@aztec/protocol-contracts 0.0.1-commit.29c6b1a3 → 0.0.1-commit.2c85e299c
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/artifacts/AuthRegistry.json +227 -181
- package/artifacts/ContractClassRegistry.json +151 -4775
- package/artifacts/ContractInstanceRegistry.json +224 -935
- package/artifacts/FeeJuice.json +106 -782
- package/artifacts/MultiCallEntrypoint.json +165 -123
- package/artifacts/PublicChecks.json +158 -124
- package/dest/auth-registry/index.d.ts +1 -1
- package/dest/auth-registry/index.d.ts.map +1 -1
- package/dest/auth-registry/index.js +3 -3
- package/dest/auth-registry/lazy.js +1 -1
- package/dest/class-registry/contract_class_published_event.js +1 -1
- package/dest/class-registry/index.d.ts +1 -1
- package/dest/class-registry/index.d.ts.map +1 -1
- package/dest/class-registry/index.js +3 -3
- package/dest/class-registry/lazy.js +1 -1
- package/dest/fee-juice/index.d.ts +1 -1
- package/dest/fee-juice/index.d.ts.map +1 -1
- package/dest/fee-juice/index.js +3 -3
- package/dest/fee-juice/lazy.js +1 -1
- package/dest/instance-registry/index.d.ts +1 -1
- package/dest/instance-registry/index.d.ts.map +1 -1
- package/dest/instance-registry/index.js +3 -3
- package/dest/instance-registry/lazy.js +1 -1
- package/dest/make_protocol_contract.d.ts +4 -4
- package/dest/make_protocol_contract.d.ts.map +1 -1
- package/dest/make_protocol_contract.js +28 -14
- package/dest/multi-call-entrypoint/index.d.ts +1 -1
- package/dest/multi-call-entrypoint/index.d.ts.map +1 -1
- package/dest/multi-call-entrypoint/index.js +3 -3
- package/dest/multi-call-entrypoint/lazy.js +1 -1
- package/dest/protocol_contract_data.d.ts +13 -1
- package/dest/protocol_contract_data.d.ts.map +1 -1
- package/dest/protocol_contract_data.js +100 -14
- package/dest/provider/bundle.js +1 -1
- package/dest/public-checks/index.d.ts +1 -1
- package/dest/public-checks/index.d.ts.map +1 -1
- package/dest/public-checks/index.js +3 -3
- package/dest/public-checks/lazy.js +1 -1
- package/dest/scripts/generate_data.js +70 -21
- package/package.json +4 -4
- package/src/auth-registry/index.ts +3 -3
- package/src/auth-registry/lazy.ts +1 -1
- package/src/class-registry/contract_class_published_event.ts +1 -1
- package/src/class-registry/index.ts +3 -3
- package/src/class-registry/lazy.ts +1 -1
- package/src/fee-juice/index.ts +3 -3
- package/src/fee-juice/lazy.ts +1 -1
- package/src/instance-registry/index.ts +3 -3
- package/src/instance-registry/lazy.ts +1 -1
- package/src/make_protocol_contract.ts +37 -15
- package/src/multi-call-entrypoint/index.ts +3 -3
- package/src/multi-call-entrypoint/lazy.ts +1 -1
- package/src/protocol_contract_data.ts +77 -14
- package/src/provider/bundle.ts +1 -1
- package/src/public-checks/index.ts +3 -3
- package/src/public-checks/lazy.ts +1 -1
|
@@ -1,6 +1,6 @@
|
|
|
1
1
|
{
|
|
2
2
|
"transpiled": true,
|
|
3
|
-
"noir_version": "1.0.0-beta.
|
|
3
|
+
"noir_version": "1.0.0-beta.19+4aabf98178cf7ad48d67f3d20ef718e0c548fdfb",
|
|
4
4
|
"name": "ContractInstanceRegistry",
|
|
5
5
|
"functions": [
|
|
6
6
|
{
|
|
@@ -35,8 +35,80 @@
|
|
|
35
35
|
}
|
|
36
36
|
}
|
|
37
37
|
},
|
|
38
|
-
"bytecode": "
|
|
39
|
-
"debug_symbols": "
|
|
38
|
+
"bytecode": "JwACBAEoAAABBIBEJwAABEQnAgIEACcCAwQAHwoAAgADAEMlAAAAPC0CAkMnAgMEQycCBAQBOw4ABAADJQAAAoIeAgADCScCBAEBJAIAAwAAAFglAAACqB4CAAMBKQIABADvUlNNJwIFAAErAgAGAAAAAAAAAAADAAAAAAAAAAAtCAEHJwIIBAUACAEIAScDBwQBACIHAggtCggJLQ4ECQAiCQIJLQ4FCQAiCQIJLQ4DCQAiCQIJLQ4GCS0IAQMnAgQEBQAIAQQBJwMDBAEAIgcCBAAiAwIFPw8ABAAFJwIEBAEAKgMEBi0LBgUnAgMAAAoqBQMEJwIDAQAKKgQDBiQCAAYAAAENJQAAAroeAgADBh4CAAQALyoABQAEAAYcCgYFBBwKBQQAAioGBAUsAgAEAC1eCYuCuje0O5mhMWEY/SDUL1FmyenxP7XqZaltHgptBCoFBAYcCgYHBBwKBwUAAioGBQcEKgcEBhwKBggCHAoIBwAcCgcIAhwKCAkBHAoJBwIcCgcIARwKBwkAAioGCQosAgAGADAz6iRuUG6Jjpf1cMr/1wTLC7RgMT+3ILKeE55cEAABBCoKBgkcCgkLBBwKCwoAAioJCgsEKgsECRwKCQsCHAoLBAAcCgQLAhwKCwwBHAoMBAIcCgQLARwKBAwAAioJDA0EKg0GCRwKCQwEHAoMBgAcCgYJBRYKCwYcCgQLBRwKBgQFBCoLCQYcCgoJBRYKCAocCgcIBRwKCgcFBCoICQocCgUJBQwqAwkFKQIAAwUAAVGAJAIABQAAAm0jAAACWQQqCAoEBCoHAwUAKgQFAiMAAAKBBCoLBgUEKgQDBgAqBQYCIwAAAoEmKAAABAR4RAwAAAQDJAAAAwAAAqcqAQABBdrF9da0SjJtPAQCASYqAQABBU/fSorXz/DTPAQCASYqAQABBbq7IdeCMxhkPAQCASY=",
|
|
39
|
+
"debug_symbols": "rVjbbtpAEP0XP/Owc9tLfqWKIpKQCgmRiEKlKuLfOwOeNUTabbvqCz4+xsdz37U/p9fN8+n703b/9v5jevj2OT0ftrvd9vvT7v1lfdy+75X9nIL9RJkeaDUlPWE9yOWQ6XrI00NcTUXPQP8DAR2kGWCeAfkl8kvsDDsjzkicQQwOxEGZQWIH/ojsZmQTFAUFHMQrwAAOnAFnwBk0M6KBNANyhuw/WQGDA2fEGXEmsgO1GVGB2YzGJGUoKDBTyS4VdGCMekEWTNIgE5UZsN5OYqDMQIyJBoxJCuyhlA2UGSRnkjPZmexMMaYYUIbVMA7KMCgwT69A/WK1kM3TKzBGTeVoDBswRg3jBA6cyc5kZ4ozlh1WL8Syw8mAMWqYWHa4GIgzQGUkGJh1hMLMkMyAnWFj1HiRcPVULGJXpswgOmMRE/VLLGLC5/Nq8nZ4Oh42G+uGm/7QrvlYHzb74/SwP+12q+nnene6/OnHx3p/OR7XB72qhmz2r3pUwbftbmPovFruDu1bATU18+2gRRerhNxrQFujRIyzRImcFoV8p4AdK0KuRmhrV4UEo37klh9dDeFFQyS1NKStQVZCFwVtlCE/xEaE28DUsiH1NHiRKFIVMt0p5LYCZi8pKkskLaq3AqVTElATWhChSuhAuK+qTihysZF20cgllrYG9NJB7kheHKHwpbY7pYmQPKOoc39MA8kbREc+tzW4rSGQPCeCNy3yJSc9MzSXNRqlQNOMXmlB8WgAhdgqLehIJESXSLq4LRI42COpPbM6FQqRbdG5ikSO1DIEeyXKyQ3JfBPRr5OvU6GxBjRBc/D9wZFqhOKSmo5QRyRjyC6SkdrR4N4U162JiwRM7ZVAeiLBqmcWCcRNkdgJKmT3JmLApkSnTDG5ApbmIO85UkrCxQ/OTSM6udXtV+1Y6ZjRz2ysdmQK0sosdYpUN49So0E3gzTDP2jEuqhojgc1pC6vAWRIQ0MAVSPCoEZtOQKgUQ2uGpjGNEBS1YhxUKN4fRDCqB05/geNGlOkMKaBSzwwDtqBudYHwagdywaKkMc0SGrvU8RBjToHiWFYA/+DRo0p42Df8tK3PNq3iWrPJRnMS65zXXeig71f6qaSQyhNjb9f9/U9tjXYpbM6oK6wPtgD3zaMvp0+6un6ZXu4+2ZzNrHDdv2828ynb6f9y83V468Pv+LffD4O7y+b19NhY0rLhx/Q32/6vrcCkEf9hgKX07IChMezPf43"
|
|
40
|
+
},
|
|
41
|
+
{
|
|
42
|
+
"name": "public_dispatch",
|
|
43
|
+
"is_unconstrained": true,
|
|
44
|
+
"custom_attributes": [
|
|
45
|
+
"abi_public"
|
|
46
|
+
],
|
|
47
|
+
"abi": {
|
|
48
|
+
"parameters": [
|
|
49
|
+
{
|
|
50
|
+
"name": "selector",
|
|
51
|
+
"type": {
|
|
52
|
+
"kind": "field"
|
|
53
|
+
},
|
|
54
|
+
"visibility": "private"
|
|
55
|
+
}
|
|
56
|
+
],
|
|
57
|
+
"return_type": null,
|
|
58
|
+
"error_types": {
|
|
59
|
+
"361444214588792908": {
|
|
60
|
+
"error_kind": "string",
|
|
61
|
+
"string": "attempt to multiply with overflow"
|
|
62
|
+
},
|
|
63
|
+
"1998584279744703196": {
|
|
64
|
+
"error_kind": "string",
|
|
65
|
+
"string": "attempt to subtract with overflow"
|
|
66
|
+
},
|
|
67
|
+
"5755400808989454547": {
|
|
68
|
+
"error_kind": "string",
|
|
69
|
+
"string": "Function get_update_delay can only be called statically"
|
|
70
|
+
},
|
|
71
|
+
"6804164082532189961": {
|
|
72
|
+
"error_kind": "string",
|
|
73
|
+
"string": "New update delay is too low"
|
|
74
|
+
},
|
|
75
|
+
"12511970388699677811": {
|
|
76
|
+
"error_kind": "fmtstring",
|
|
77
|
+
"length": 27,
|
|
78
|
+
"item_types": [
|
|
79
|
+
{
|
|
80
|
+
"kind": "field"
|
|
81
|
+
}
|
|
82
|
+
]
|
|
83
|
+
},
|
|
84
|
+
"12579274401768182412": {
|
|
85
|
+
"error_kind": "string",
|
|
86
|
+
"string": "New contract class is not registered"
|
|
87
|
+
},
|
|
88
|
+
"13455385521185560676": {
|
|
89
|
+
"error_kind": "string",
|
|
90
|
+
"string": "Storage slot 0 not allowed. Storage slots must start from 1."
|
|
91
|
+
},
|
|
92
|
+
"14990209321349310352": {
|
|
93
|
+
"error_kind": "string",
|
|
94
|
+
"string": "attempt to add with overflow"
|
|
95
|
+
},
|
|
96
|
+
"15353471697975175405": {
|
|
97
|
+
"error_kind": "string",
|
|
98
|
+
"string": "msg.sender is not deployed"
|
|
99
|
+
},
|
|
100
|
+
"15764276373176857197": {
|
|
101
|
+
"error_kind": "string",
|
|
102
|
+
"string": "Stack too deep"
|
|
103
|
+
},
|
|
104
|
+
"16431471497789672479": {
|
|
105
|
+
"error_kind": "string",
|
|
106
|
+
"string": "Index out of bounds"
|
|
107
|
+
}
|
|
108
|
+
}
|
|
109
|
+
},
|
|
110
|
+
"bytecode": "JwACBAEoAAABBIBUJwAABFQlAAAAQScCAwQBJwIEBAAfCgADAAQAUy0IUwIlAAAA8CcCAgRUJwIDBAA7DgADAAIpAABDAPqRAsspAABEAMB7XhkpAABFAAVVe/onAEYAAywAAEcALc/6U80Ocdp7SiJnezNCv8O5BD9Qgb6lg2itAI6qbzcoAABIBQJYLAAASQAwZE5y4TGgKbhQRbaBgVhdKDPoSHm5cJFD4fWT8AAAACcASgQDJwBLBAAnAEwAACcATQEBJwBOBAEnAE8AAScAUAQCJwBRAAIrAABSAAAAAAAAAAABAAAAAAAAAAAmJQAADA8KIgJDAycCBQQAJwIHBAMAKgUHBi0IAQQACAEGAScDBAQBACIEAgYtDgUGACIGAgYtDgUGJwIGBAMAKgQGBScCBQEAKQIABgADbVJ/KQIABwDvUlNNKQIACAUAAVGAJAIAAwAAAWAjAAAFXi0IAQknAgoEAgAIAQoBJwMJBAEAIgkCCh8wAE4ATgAKACIJTgstCwsKHgIACQEKIglJCxYKCwwcCgwNAAQqDQkMCioLBQkkAgAJAAABtycCDQQAPAYNAR4CAAkALQgBCycCDQQEAAgBDQEnAwsEAQAiCwINLQoNDi0OBg4AIg4CDi0OCQ4AIg4CDi0ODA4nAg0EDi0IAA4tCgsQLQhKEQAIAA0AJQAADDUtAgAALQoQCTMKAAkACyQCAAsAAAIkJQAAD0QtCAEJJwILBAQACAELAScDCQQBACIJAgstCgsNLQ4GDQAiDQINLQxGDQAiDQINLQ4KDScCDQQOLQgADi0KCRAtCEoRAAgADQAlAAAMNS0CAAAtChALMwoACwAJJAIACQAAAowlAAAPVi0IAQknAgsEBAAIAQsBJwMJBAEAIgkCCy0KCw0tDgcNACINAg0tDE8NACINAg0tDgwNJwINBA4tCAAOLQoJEC0IShEACAANACUAAAw1LQIAAC0KEAsKIgtMCQoqCQUNJAIADQAAAvglAAAPaB4CAAkALyoACwAJAA0AIgtPCR4CAA4ALyoACQAOAA8AIgtRDh4CABAALyoADgAQABEcCg0SBBwKEhAAHAoQDQUeAgAQAC8qAAsAEAASJwIXBBgtCAAYLQoSGgAIABcAJQAAD3otAgAALQoaEC0KGxMtChwULQodFS0KHhYeAgASBgwqEhYXJAIAFwAAA60jAAADixYKFBccChQYBRwKFxkFBCoYFRcEKhkIGAAqFxgDIwAAA88WChAXHAoQGAUcChcZBQQqGBMXBCoZCBgAKhcYAyMAAAPPACoSAxcOKhIXGCQCABgAAAPmJQAAEJ0MKhINAxYKAw0cCgMSABwKDQMABCoSDw0EKgMRDwAqDQ8DJwIPBBgtCAAYLQoDGi0KChstChccLQoQHS0KEx4tChQfLQoVIC0KFiEACAAPACUAABCvLQIAAC0KGg0tCw0PACIPAg8tDg8NJwIQBBgtCAAYLQoNGi0IShsACAAQACUAABIDLQIAAC0KGg8AIg1OES0LERAAIg1QEi0LEhEAIg1KEy0LExIwCgAQAAswCgARAAkwCgASAA4AIgtGCTAKAA8ACRwKFwkAJwINBAUnAg8EAwAqDQ8OLQgBCwAIAQ4BJwMLBAEAIgsCDi0ODQ4AIg4CDi0ODQ4nAg4EAwAqCw4NLQoNDi0MRw4AIg4CDi0ODA4AIg4CDi0OAw4AIg4CDi0OCg4AIg4CDi0OCQ4nAgMEBQAiCwIKLQsKCicCDAQDACoLDAk3DgAKAAktCwQDACIDAgMtDgMEACIEAgktCwkJJwIKBAMAKgQKAzsOAAkAAyMAAAVeCiICRAMkAgADAAAFcCMAAAi+LQgBCScCCgQCAAgBCgEnAwkEAQAiCQIKHzAATgBOAAoAIglOCy0LCwocCgoLBRwKCwkAHAoJCgUeAgAJAQoiCUkLFgoLDBwKDA0ABCoNCQwKKgsFCSQCAAkAAAXWJwINBAA8Bg0BHgIACQAtCAELJwINBAQACAENAScDCwQBACILAg0tCg0OLQ4GDgAiDgIOLQ4JDgAiDgIOLQ4MDicCCQQNLQgADS0KCw8tCEoQAAgACQAlAAAMNS0CAAAtCg8GMwoABgAJJAIACQAABkMlAAAPRAwiCkgGCioGBQkkAgAJAAAGWiUAABUSLQgBBicCCQQEAAgBCQEnAwYEAQAiBgIJLQoJCy0OBwsAIgsCCy0MTwsAIgsCCy0ODAsnAgsEDC0IAAwtCgYOLQhKDwAIAAsAJQAADDUtAgAALQoOCQoiCUwGCioGBQskAgALAAAGxiUAAA9oHgIABgAvKgAJAAYACycCEAQRLQgAES0KCxMACAAQACUAAA96LQIAAC0KEwYtChQMLQoVDS0KFg4tChcPHgIACwYMKgsPECQCABAAAAc7IwAABxkWCg0GHAoNDAUcCgYNBQQqDA4GBCoNCAwAKgYMAyMAAAddFgoGDRwKBg4FHAoNBgUEKg4MDQQqBggMACoNDAMjAAAHXQwqAwoMJAIADAAAB4sjAAAHbwIqAwoGDioKAwwkAgAMAAAHhiUAABUkIwAAB5knAgwFAC0KDAYjAAAHmQAqCwYMDioLDA0kAgANAAAHsCUAABCdHgIABgAvKgAJAAYACwAiCU8GHgIADQAvKgAGAA0ADgAiCVENHgIADwAvKgANAA8AEBwKCxEEHAoRDwAcCg8LBScCEQQSLQgAEi0KDhQtChAVLQoLFi0ITRctCgMYLQhNGS0KChotCgwbAAgAEQAlAAAQry0CAAAtChQPLQsPAwAiAwIDLQ4DDycCCgQQLQgAEC0KDxItCEoTAAgACgAlAAASAy0CAAAtChIDACIPTgstCwsKACIPUAwtCwwLACIPSg4tCw4MMAoACgAJMAoACwAGMAoADAANACIJRgYwCgADAAYtCwQDACIDAgMtDgMEACIEAgYtCwYGJwIJBAMAKgQJAzsOAAYAAyMAAAi+CiICRQMkAgADAAAI0CMAAApOHgIABAkkAgAEAAAI4iUAABU2HgIABAEtCAEGJwIJBAQACAEJAScDBgQBACIGAgktCgkKLQ4HCgAiCgIKLQxPCgAiCgIKLQ4ECicCBwQJLQgACS0KBgstCEoMAAgABwAlAAAMNS0CAAAtCgsECiIETAYKKgYFByQCAAcAAAlTJQAAD2geAgAGBh4CAAcALyoABAAHAAknAg0EDi0IAA4tCgkQAAgADQAlAAAPei0CAAAtChAELQoRBy0KEgotChMLLQoUDAwqBgwJJAIACQAACcgjAAAJphYKCgQcCgoGBRwKBAcFBCoGCwQEKgcIBgAqBAYDIwAACeoWCgQGHAoECQUcCgYEBQQqCQcGBCoECAcAKgYHAyMAAAnqHAoDBAAnAgYEAScCCAQDACoGCActCAEDAAgBBwEnAwMEAQAiAwIHLQ4GBwAiBwIHLQ4GBycCBwQDACoDBwYtCgYHLQ4EBwAiAwIGLQsGBicCBwQDACoDBwQ7DgAGAAQjAAAKTicCAwJVJwIEAm4nAgYCaycCBwJvJwIIAncnAgkCICcCCgJzJwILAmUnAgwCbCcCDQJjJwIOAnQnAg8CcicCEAJ7JwIRAn0tCAESJwITBBwACAETAScDEgQBACISAhMtChMULQ4DFAAiFAIULQ4EFAAiFAIULQ4GFAAiFAIULQ4EFAAiFAIULQ4HFAAiFAIULQ4IFAAiFAIULQ4EFAAiFAIULQ4JFAAiFAIULQ4KFAAiFAIULQ4LFAAiFAIULQ4MFAAiFAIULQ4LFAAiFAIULQ4NFAAiFAIULQ4OFAAiFAIULQ4HFAAiFAIULQ4PFAAiFAIULQ4JFAAiFAIULQ4QFAAiFAIULQ4KFAAiFAIULQ4LFAAiFAIULQ4MFAAiFAIULQ4LFAAiFAIULQ4NFAAiFAIULQ4OFAAiFAIULQ4HFAAiFAIULQ4PFAAiFAIULQ4RFAoiBU0DJAIAAwAADA8nAgQEHi0IAQYnAgcEHgAIAQcBLQoGByoDAAcFraNyxvqmhHMAIgcCBwAiEgIIJwIJBBstAggDLQIHBC0CCQUlAAAVSCcCCAQbACoHCActDE8HACIHAgctDgIHACIHAgc8DgQGKAAABAR4VAwAAAQDJAAAAwAADDQqAQABBdrF9da0SjJtPAQCASYlAAAMDxwKAwYABCIGUgctCAEFJwIGBAUACAEGAScDBQQBACIFAgYtCgYILQxMCAAiCAIILQxMCAAiCAIILQxMCAAiCAIILQ4HCAYiA0oGLQhLBCMAAAyNDCoEBgcAIgVOCS0LCQgAIgVQCi0LCgkkAgAHAAAOACMAAAyxBiIDSgcEIgdKCgIqAwoGCiIGSwcWCgcKLQoFBCQCAAcAAAzZLQoEBCQCAAcAAA2vIwAADOYCKgMGBw4qBgMLJAIACwAADP0lAAAVJAwiB0oLJAIACwAADQ8lAAAVegAiAgIMACoMBw0tCw0LACoICwwtAgUDJwAEBAUlAAAVjC0IBQgAIghOCy0ODAsMKE4GBSQCAAUAAA1TLQoIBCMAAA2vACIHTgUOKgcFBiQCAAYAAA1qJQAAEJ0MIgVKBiQCAAYAAA18JQAAFXoAIgICBwAqBwULLQsLBgAqCQYCLQIIAycABAQFJQAAFYwtCAUEACIEUAUtDgIFIwAADa8KIgNLBRIqBQoDJAIAAwAADcotCgQCIwAADfItCAECJwIDBAUACAEDAScDAgQBACIEAgMAIgICBT8PAAMABSMAAA3yACICTgQtCwQDLQoDAiYEIgRKBwYiB0oLCioLBAokAgAKAAAOHCUAABXmDCIHSgokAgAKAAAOLiUAABV6ACICAgsAKgsHDC0LDAoAKggKCy0CBQMnAAQEBSUAABWMLQgFCAAiCE4KLQ4LCgAiB04KDioHCgskAgALAAAOcyUAABCdDCIKSgskAgALAAAOhSUAABV6ACICAgwAKgwKDS0LDQsAKgkLCi0CCAMnAAQEBSUAABWMLQgFCQAiCVALLQ4KCwAiBUoKLQsKCAAiB1AKDioHCgskAgALAAAO0yUAABCdDCIKSgckAgAHAAAO5SUAABV6ACICAgsAKgsKDC0LDAcAKggHCi0CCQMnAAQEBSUAABWMLQgFBwAiB0oILQ4KCC0IAQUnAggEBQAIAQgBJwMFBAEAIgcCCAAiBQIJPw8ACAAJACIETgctCgcEIwAADI0qAQABBdUSfSnC0ujtPAQCASYqAQABBa6Sj2upjpKMPAQCASYqAQABBbq7IdeCMxhkPAQCASYlAAAMDxwKAgQEHAoEAwACKgIDBCwCAAIALV4Ji4K6N7Q7maExYRj9INQvUWbJ6fE/teplqW0eCm0EKgQCAxwKAwUEHAoFBAACKgMEBQQqBQIDHAoDBgIcCgYFABwKBQYCHAoGBwEcCgcFAhwKBQYBHAoFBwACKgMHCCwCAAMAMDPqJG5QbomOl/Vwyv/XBMsLtGAxP7cgsp4TnlwQAAEEKggDBxwKBwkEHAoJCAACKgcICQQqCQIHHAoHCQIcCgkCABwKAgkCHAoJCgEcCgoCAhwKAgkBHAoCCgACKgcKCwQqCwMHHAoHCgQcCgoDABwKAwcFHAoCAwUEKgMHAhwKCAMFHAoFBwUEKgcDBRwKBAMFLQoGBC0KAwYtCgIDLQoJAiYqAQABBdAH6/TLxmeQPAQCASYlAAAMDxwKBAoAHAoJBAAnAgkAICcCDAQNLQgADS0IUQ8tCgkQAAgADAAlAAAV+C0CAAAtCg8LBCoECwkAKgoJBBwKBwkAJwIHAEAnAgsEDC0IAAwtCFEOLQoHDwAIAAsAJQAAFfgtAgAALQoOCgQqCQoHACoEBwkcCggEACcCBwBIJwIKBAstCAALLQhRDS0KBw4ACAAKACUAABX4LQIAAC0KDQgEKgQIBwAqCQcEHAoFBwAnAgUAaCcCCQQKLQgACi0IUQwtCgUNAAgACQAlAAAV+C0CAAAtCgwIBCoHCAUAKgQFBxwKBgQAJwIFAHAnAggECS0IAAktCFELLQoFDAAIAAgAJQAAFfgtAgAALQoLBgQqBAYFACoHBQQtCAEFJwIGBAQACAEGAScDBQQBACIFAgYtCgYHLQ4EBwAiBwIHLQ4CBwAiBwIHLQ4DBy0KBQImJQAADA8cCgMGAAQiBlIHLQgBBScCBgQFAAgBBgEnAwUEAQAiBQIGLQoGCC0MTAgAIggCCC0MTAgAIggCCC0MTAgAIggCCC0OBwgGIgNKBi0ISwQjAAASWwwqBAYHACIFTgktCwkIACIFUAotCwoJJAIABwAAE84jAAASfwYiA0oHBCIHSgoCKgMKBgoiBksHFgoHCi0KBQQkAgAHAAASpy0KBAQkAgAHAAATfSMAABK0AioDBgcOKgYDCyQCAAsAABLLJQAAFSQMIgdKCyQCAAsAABLdJQAAFXoAIgICDAAqDAcNLQsNCwAqCAsMLQIFAycABAQFJQAAFYwtCAUIACIITgstDgwLDChOBgUkAgAFAAATIS0KCAQjAAATfQAiB04FDioHBQYkAgAGAAATOCUAABCdDCIFSgYkAgAGAAATSiUAABV6ACICAgcAKgcFCy0LCwYAKgkGAi0CCAMnAAQEBSUAABWMLQgFBAAiBFAFLQ4CBSMAABN9CiIDSwUSKgUKAyQCAAMAABOYLQoEAiMAABPALQgBAicCAwQFAAgBAwEnAwIEAQAiBAIDACICAgU/DwADAAUjAAATwAAiAk4ELQsEAy0KAwImBCIESgcGIgdKCwoqCwQKJAIACgAAE+olAAAV5gwiB0oKJAIACgAAE/wlAAAVegAiAgILACoLBwwtCwwKACoICgstAgUDJwAEBAUlAAAVjC0IBQgAIghOCi0OCwoAIgdOCg4qBwoLJAIACwAAFEElAAAQnQwiCkoLJAIACwAAFFMlAAAVegAiAgIMACoMCg0tCw0LACoJCwotAggDJwAEBAUlAAAVjC0IBQkAIglQCy0OCgsAIgVKCi0LCggAIgdQCg4qBwoLJAIACwAAFKElAAAQnQwiCkoHJAIABwAAFLMlAAAVegAiAgILACoLCgwtCwwHACoIBwotAgkDJwAEBAUlAAAVjC0IBQcAIgdKCC0OCggtCAEFJwIIBAUACAEIAScDBQQBACIHAggAIgUCCT8PAAgACQAiBE4HLQoHBCMAABJbKgEAAQVebT8u3M2HCTwEAgEmKgEAAQUbvGXQP9zq3DwEAgEmKgEAAQVP30qK18/w0zwEAgEmAAADBQctAAMILQAECQoACAcKJAAACgAAFXktAQgGLQQGCQAACAIIAAAJAgkjAAAVVSYqAQABBeQIUEUCtYwfPAQCASYtAQMGCgAGAgckAAAHAAAV4S0AAQUAAAEEAQAAAwQJLQADCi0ABQsKAAoJDCQAAAwAABXXLQEKCC0ECAsAAAoCCgAACwILIwAAFbMnAQUEASMAABXlLQADBSYqAQABBQUEG5kgr2BMPAQCASYlAAAMDycCBwQCJwIIAQEtCAEGJwIJBCEACAEJAScDBgQBACIGAgknAgoEIEMDqgADAAcACgAIAAktAgkDLQIKBCUAABbUJwIDBCEnAgcEIC0ITgQtCE8FIwAAFlUMKgQDCCQCAAgAABZsIwAAFmctCgUCJgQqBQUIAioHBAkOKgQHCiQCAAoAABaIJQAAFSQMKgkHCiQCAAoAABaaJQAAFXoAIgYCCwAqCwkMLQsMChwKCgkABCoIAgoEKgkKCwIoTwkKBCoKCAkAKgsJBQAiBE4ILQoIBCMAABZVJwAGBAIGAAQGBS0ABAgnAAkEAA4ABQkKJAAACgAAFycCAAgCCAAAAwkLLQELBgAAAwgLLQELBwAAAwkLLQQHCwAAAwgLLQQGCwAACQIJIwAAFucm",
|
|
111
|
+
"debug_symbols": "tZ3bjhw3DobfZa5zIepI5VWCIHASZ2HAcAKvvcAi8LuvSEn8a7yQprqqc+P+htNNURIlUWT1+O+X39//+vVfv3z49Mef/3758ae/X379/OHjxw//+uXjn7+9+/Lhz09N+veLk398TC8/0g8vPrUfvbym/prHz3n+XPtrieN1/MzjZ+b+WsN4LfoanO+vqb1Gec39NdN4HT+X8XMZP4teltfaX0UviaLaGqL2jujChNJ/FclPEElu4P2A4CakCU0x1QZReiB6Ig9IYcKU5CnJU1L8hDyAaUIaUN0EaaII1A5JjO9QBhBNyAP8lPg0QT7ebE7Si+AaxDChGRZSAxnoDmVAnpI8JWVKxHgFdhPShDpAjO8gTbS5yGJ8hzJAjO+QBng3wSR1QGgfj06gSWJzvhzLAPWSLJAHqJ8oTEmZkjIlYnyHOKEOELfpwB2KOGSsAmWAGN8hTagDfJwwJWq8Qvt4ajaX6CdMiawhBVlEiQWaJLcul9I+nuVXhcevOIxfVRq/qrn/ih31X7FrrefQgOIEkTTXYrGwyHvEwtKcn8WwIu8RwzrkAbLIO6QBeUpynMADyvx4mR/n+WYZ55IFpNFmanWj0SqD2WF8qvop8VMSpiQaDHvqtLBOC+u0sOYpKQJtCqraozAlMt0dWi+4jQY5cdZBzUYuQrJRDDKZN5k3WWiy6pTKJLF5UDKqk2TrGGSfyPaJbJ/I9olinxCX6MQmY9NSTUudWlqXjNqM1KBUJ1EwKpNkMgblScFksq0MEi1ZSLbHQTxJe9mpTJJdZpBorkLiQoN4kvhOM1yxTqF0qQ1ZQy99auOjmAwJUjpIq6GPQEgDpIENZdOcWAxl75kIqUzeRDRcYE5BEwUNM5pgNFzRRLUmgtMmWDEbEqS9x4reASEN+t6qmAyjA4qRRIrVUKZxIhtmSLVvcqI2fxDT5bhtmCdGNX0gpAQpQaozREWxGgZtjRXZMEIqXtfmVFDt9apM7e2Yvb0hF8Oi0qxYDGWjGCiH80SxTM5V0gO6jVFDPaInsiFBSpB6SGX3GKjTMjAb6rQMTEBtWIYkpQhkQ+3mwGxYCAgpO6Aqk74l7bEcvJR6ECWYexhFimxIkMqWMVGakFOUsgZUA5NhhDRCmiDVvg1kQ3W5gcVQp3CgNiy9yEzABKyGGikO5InFBWAxVE+Vo7phNvSQqqd21L1EzuWGIpWTmfTQp6xv0A1kYDbMDpgMC6S6yAayIUMZQ1nFx9RpJQRoqObIdDOZOay9GGgaOEAaII2QpgOavYxeMHrB6AUXSHVasgxU1VHPVZENCdJupKI6jIQypFHAREjVSwaKMolAqBaVamvqGkWV6Zj1N1SyN+hAyRvaKRPHGxrW8Qav4UAbREG9OgxUqdxqNCJoA6NYDHX4BiZgNdSdayA+lvGxjI9lfKzgY+oaHRlShrIKZdWUaYQwUXrMrFgNdS4GFkOdloHZMECqa36gXqRkoDRWmMiG2vmBxVD3s4HSRI2CuuYHsqFuYlV7oQu9S+u4mlIdd1Hv4gT9bBHUDg4shjq7AyHVE6hKr7ys4DbzgjJNbboVq6FehCVk8f0uTE5Q5mYiG1ZIq0mDC8BiqPfAgdlQzv2JCagNizlBdqeJbChXgInZMBEQUr3xD1RlSbEaFkjZA9V0WVMaI7SRUxSp3Fl9lCiujYagRHETI5AN5RydCGnwwGwYoSxCWcTHZD/2cjluUR7eW/BenbeODClDWk2a3AGtCY0GJkKKXiT0Ium0BBlfvbV7Ofe93tsHJkgTpNkDi2GBtECqKYiB2VDTEAPTxOwcMAK1YdkWNQSYWAy9B0La+yYzn3vfOkKaIE2QZkgzpAXSAilDypBWSKtJ9bCfCCl5YDH0kHpIA6Tqch3V5QYmYDVMEYiG0c2S0URBEwVN9CnsiCYqGq5oolrDjB4zeszoMaPHGhhMtIY5OGACookYgWgCE8sJTWQ0nNFEQcMFTTAaZjTBaBhzzJjj6jzQGtb0w0RruHoHTEBrooYIRBNw5RrRRELDCU1kNJzRREHDuu9I/qthNdTds6PungPzwOAcASHVjbSjbjYD2TBAGiCNHghlCco0+9sxQ5oP0mpoHQquoAm2hql7VFXUlKgT1DUk14lAPfPasRomSBOkGdKeg1XsWdiOxbBnYjtmw4qGdRscqE1IYlkjhYnaRBDU8R2oTUh22uv+0LGbngS76R0h7aZnxTqxJ8ZjUSyGBKk67UC1VwY16KAOZEP11IGQJkh1bcqdJwRdm8kpZkNdmwMh1bU5MAGlF3IpCnrVb6ecYjb0kOoi66iLLAXFaqgrq6OurIGQZki7vTLqsdubFJNht7fjQVoNdfdU7Cn4lBVlzJIMddLxTVUxAqthhDRCmiBNkOryl3tiw2Sou5xclYIm2QdWSKtJNcM+UF0je8ViqK7RUU0fCGmEVE2X9HHDOr26H80Dze370TywGPb11lHmImsJR9fbQEh7hzpqh2TUi8YaHXuHOhZDD6mHNGgTWTHPpdfP44HJMEHaF2THaqh9k/tyQzbUvsm1tWExZEh1Axmo4ytzzBpHDWRD3UsGQuoh1b7JZTaw7iVqg17JB0YCQqp9G5iAWlaSOWbt20A2LJAWSBlShrQXq8Tlqs685NxbPO+BKpWRrDo6JUkRjqqhVw1ZsRrqcipFUaUsqD4pV/Ko9+WBCdIEaYY0Q6rnEDtFkcqdPTpdZNyrggSUkeQgqB41UKVSqCMddbkvN1SpmE56YRoIaYY0Q1og1SUilYTYjyS5L8d+JLGYTnJn95LAb5gnej3y5WbcMBsSpLrTVq/1TQJCqn2TRH70aoPcl9uFSqVJUaVaIe02dDRpUK8eGIFsqA4+EFJdvANVmXQ+dHNYUaXS+SBDHaQQEPVuOjBBmhKwGuYAZMMCqbjnQFZlpKhNeC38qjQoqlSLv46AkEqgNTEC2dAHIKSypCeqsqSFZm0iK6pURif2HrNiNsyQ5gSshr3HHdmQIeVi2HusxW7tsWQPYtIeS6K/oUpldLQOPRFSLecOjEA2lIBzIqQScE5UZTLqSXuspfukPZZEQuu7AybDAmmBlCHlCGTDGoBlYnbesN8OZEg0wa3BadQEtwaGsZ+mA5NhhDRCmiC16DWO01Sxn6Ydi6FFr7Gfph0teo25P0kgw5ctTo39CJVDuGE17NGrPpHQo1fFbrr0eByWHSHtpmfFZKjHgcSeLUcSgCZl3Zg66sYkUWbDbKhnwMBqGCANkPbotSpqJCZzwckDi2GG1KLXyBa9xn6zlOC0hX36MRmzflscCCklQ422JcqM/YrYUa9RA9kwQhoh7fbq4x7dXhnffi8cmA0LpBa9xmrRa0MNImUuag9Z9VmRHmLLAyDOO2AyDJAGSCOkEVI9ySQiTZqIHthDVlJMhgwpQ6quMVCDHC+Pr2hc3VFdY2A29JB6SHv0GhTT8OpEoRrGCITUoteGbKheIrFnw2JYIO0d6qgdSoI9wuvIE33vUEdICdIevWZBP++FqZ/HHfUAHAipRa/JW/Sa+nUy98d+IlAbZsEevXaEtIfjij0cr4rZsIfjHevEfrgPhFT7JsFp6oe72tAP94HFMEBq0WsKFr021KeXvGI17BFeR0gzpBnSAqnOmwSnqT9PJEXklEMEQqrPRg1kwwRpgjRDmiHV+GFgAloTem8JUqdOur0GyYMn3V7b9V1QtteJkGprA6U1Lx3SZ4MGasMDs2GFtJpULyBBit4NtQlZAayBixTIG6pUPJX1GJeid0OVSi809dfw27cfXuYTgr98+fz+vTwgeHhk8Ke/X/569/n9py8vP376+vHjDy//effxq77p33+9+6SvX959br9tHXv/6ff22hT+8eHje6FvP+DTbv1Raj2J4+PyiAOZinReR3QSb3UdLa4rV3QEjROGHe2CutIR1jqkqjBUtEMmmYam7LQVUcLmYUVz7pUVaa2jZplkVdHKpmwaWkT2SkVeq2jrYFqR22l+UJFfqSi7sZij2XaFg4JwfihSKRgKrquhqGsd7ZYbhgpuYcBKA23MyDHPOc2xHFTwaxW0VhEk0lENbbtbOcXeBrnldRtaOmppw8Y1g3lmu9EehvLSSFJejuTGL0ueGlr5Ax5BZ02oWtrrft1Cv6UJG6fMWsHuA9lqvcuB5I1fl6mhHbCrydz1gkxBC0GXTu037uD10O42tF1r1Qu/cclWIpzLs92RMBstGfRah9/1RO4svSdU3FrHxi2zC8HsiAc7HrDCPLu25Mjaio1ncvXenDvXtY68W+SzI+Gw57a0xPlpjXYAedmrV9PKu4OQ7CxtV+277pnChT23Ytuurbq8PEbptoMHf9/BQ7jv4FJIv+fgeyvOOXjI9x08lLsOvp3Wcw4e6j/q4Af3LIGuODgHmxDmpYPHjXcSoiNqCVpTwa/dIu5iTZ6HYUvKH07T12MZ4333jumue++tOOfesdx378h33Xs7qVSrxasuryY1bY6AVgubKoo/DCf7K85Z4zJISrsTNVo/WoqLVkakjXNS0VR3H4vSMgZLJRvPIKf5sK7E+XXsndJOiSOzxLWS1FJJvh02pnIzbNx1pNbi0Y/ISyM2ztFyMObk6aoZ1cEMSksz9t6RybyjVeNW3pE3XurJ0gae4nH3okd0BOjgpY7taknJ22opcdmVnY+2LI1d+lvJeD0e+QmrJZcnrJbMt1dLrjdXy64jZ1dLodur5Y2ZzWZHy7ql5T6487BMdk7ntXOUzVbKscx4g1sRZDkau5PeDoVyyK+VBxZKzglpqbrsxm4Tdc7Wq4vlsF7jeTPYQq/KhS9NCJuD12Mu5DsVvDnoOdFcrNzy4YeevE6wMe2cy1YJtVhuqeONMzYedo26XK28zS1Zeiocx6PV1V/r2BlC0QJ7ym6ZMOTtNd7yQ4eV9n8a9nnP6eRunbTc+katARuPW65W3t3iK5kd1G7hy12Dt4GgHUuHWf0uIN4pkC/DWk8Ot7XvVFS6H5dXfzcu3w+nlurmcNZlMFq3CwWBdeN1EramXV/QmZjKcki3dpSKE5qpLu3YHvMJx1KrBS+Px7q7MOUyB6RVS9ZX8b0dcHSXD3em7+3YuqnDDhZ8XSf5d3up9xbWtrv5MjHsNp4avd2FY3C0rLuQ2+2lyJLLc4IbJRsnkecnpiVc3LJ8c35I0mZI6NyVuFW01zp2TpKR8snxWlEtE27mOVwqMYZssYfoiEs32xVy5IH8Obsul2t9SSgQ5kPu6JG+lIi+FF7XxegfLnYy29INNayX7q6slHDvSa9Ljd85O+W71crzdhwLXN/ZsR2QmjAxtaT1gOx2RPnDDRZLUfFLLf4JdU9/u/Dpn1D59HdLn4+MKNN6RO/WP9+w4/B0gPw5grUdTyiC+rtV0Lf6gk2IYllvqOF+KZTCE2qhFJ5QDKVwuxr6hh3n0ukUnlAPpXC7ILqf3XMFIwr3S6IP+OoxJ/7YvpxsM2uHUfAXtWTL5ZD8lYullicUoOh+BYqeUYKi+zUoekYRip5RhaL7ZSh6Qh2KnlCIesRTwzrM3CVU2tbt8RhYOwCXtmxLDmdT7PSUihQ9pSRFT6hJ0e2iFD2jKkVPKEu9NcHnMu1vOdvhRuLdMj1Mu7LSyWw75XAz3f5GX7wn9GWzcHYVjBDi9NUQDo+jfp9yp11t6mzefm9JsqmRL8xeU9IKD1NJru6iknbosqWJmdZK9tNTGM89s1vvsbsa1elCOxX/jH2thGfsa7tS1dl9bVerOrev7fpyel/blavO7mt7Q87V29/yknMFd9rVrM5W3N9Scqrk/tbaKccE1qY/4QllFtoVrk7VWbYaThZaiJ/wgB/x7Sf83hjTk7UW2peeThZbqLrb1ZY3LDlZbqHqn1BvoRpuF1zesuRcxWWfpWS7YETn10/i1/yPpsLlbwnADr72zSGyUknjTca17rzEhxpRPlp/PcI7t3tAwmd7QCIuz2C/Lbg4BBXk1oHjI73hi2OSMDttcy3rMYl3M8hv2IHvdckfYlvbkW/nS/yukHUuX6L31Lv5Eu/q3XzJG3ac/NIFPeHpAE+3Hw/Yz+25fImneD9f8oCnlvUusqtktRqp+UjjvIyN/O6LUievsH73TalTV9i3+oIMUisFlWVfdjWk07kf7+kJdyTv/RPuSH77ralzdyT9Yu2tO9K2L2fvSH77talzd6S3Jvhc7ucBZ0tEazep91Md+5jEH2OS9T6wq2rFbMdNLK+eRsnfKfH3HyTZ9sbj+ZzoPV+L0nALlj92tB6R9M9GnN4e9m68/kqy332RyqL4cvhitT9tA1dcWg+n1fdH3l6Fwx3NXVJRseJqCVdUeGdjKX8N+5oKtvqgq9esIPtScUO+pCI6U3HMrTykAlbEw59AeEiFFRdbHFEuqUiW621nXb2mIqRnqojXhjOZg/tMlxzc50SmolxUcXyo6NqkZgvVn6IiXlIR2J7cD1zyRRWWu6ju0nCGapnDUPO6Iz5tYtKk/52AKkn+cD8mPm8Gw4x6bUoIMQLRNRXO0lJNhb+7eV5Vgcei/PGh/cdUeKig21v4VRXFHiMivrZ5Embk+HcdHlNhe46/uG0dOnJVhf6F96Hi8FjW/62zXcXh/jqTP9xtF5SwLhRsVWTLuDhH11QkS0Adqy8PqGj3EULYSddU2M0k0DHCeEiFbcDtenFJBVKloZV7r6nAN4U8XbQCZeDrKmw4fXCXVHiMxfGJ4YdUWCY+BLpoBVKKrcJ/SUWwJ47lD4VfU2HZiBDpqgp/X4UNZ/TXVmrESo0XV2oJqNGkazPCllZpmdBri73aKdDuJvWKiuQsYEt0be9MZH9ErCU20zUVtv3K33W8aEUxFYVuj0Xx16ywkll6nTA/r8LbgZiOSczHrGCoKHfHwl87lpP+xdOhol46R1KwK3fDq1ZYR8K1Lec4FuHasZxCQEeubTntczacoVy0wqoXTQXfHotybcsJ9mxWu/df84sYbThj5ItW2HDGFO6ORbx2CKSCxV7SpeEs+u2tUX85PBhG5ZWGQPuyJ2q4ealja4UFSuX47ZtHNCBhSuyuaNCS+SjOHS8jD9iAWtbxqdCLGuiSDd7KpeUYtT5kA0MDXbLBcnPNQa/1wgKkctWjDr34TsPP7ad3v334/Or/vf8muj5/ePfrx/fjxz++fvrt8Nsv//1r/mb+v/l/ff7zt/e/f/38XjThP89v//ykj1hQKwH+/MMLyc/yP4vK/4Hcfg76+3b1bW9y8nv5QG7rsFXs5Ed5vzy6Vkr6+ZuY+z8="
|
|
40
112
|
},
|
|
41
113
|
{
|
|
42
114
|
"name": "publish_for_public_execution",
|
|
@@ -50,7 +122,7 @@
|
|
|
50
122
|
"name": "inputs",
|
|
51
123
|
"type": {
|
|
52
124
|
"kind": "struct",
|
|
53
|
-
"path": "aztec::context::inputs::
|
|
125
|
+
"path": "aztec::context::inputs::PrivateContextInputs",
|
|
54
126
|
"fields": [
|
|
55
127
|
{
|
|
56
128
|
"name": "call_context",
|
|
@@ -1168,7 +1240,7 @@
|
|
|
1168
1240
|
}
|
|
1169
1241
|
},
|
|
1170
1242
|
{
|
|
1171
|
-
"name": "
|
|
1243
|
+
"name": "expiration_timestamp",
|
|
1172
1244
|
"type": {
|
|
1173
1245
|
"kind": "integer",
|
|
1174
1246
|
"sign": "unsigned",
|
|
@@ -1344,7 +1416,7 @@
|
|
|
1344
1416
|
}
|
|
1345
1417
|
},
|
|
1346
1418
|
{
|
|
1347
|
-
"name": "
|
|
1419
|
+
"name": "key_validation_requests_and_separators",
|
|
1348
1420
|
"type": {
|
|
1349
1421
|
"kind": "struct",
|
|
1350
1422
|
"path": "aztec::protocol_types::utils::arrays::claimed_length_array::ClaimedLengthArray",
|
|
@@ -1356,7 +1428,7 @@
|
|
|
1356
1428
|
"length": 16,
|
|
1357
1429
|
"type": {
|
|
1358
1430
|
"kind": "struct",
|
|
1359
|
-
"path": "aztec::protocol_types::abis::validation_requests::
|
|
1431
|
+
"path": "aztec::protocol_types::abis::validation_requests::key_validation_request_and_separator::KeyValidationRequestAndSeparator",
|
|
1360
1432
|
"fields": [
|
|
1361
1433
|
{
|
|
1362
1434
|
"name": "request",
|
|
@@ -1401,7 +1473,7 @@
|
|
|
1401
1473
|
}
|
|
1402
1474
|
},
|
|
1403
1475
|
{
|
|
1404
|
-
"name": "
|
|
1476
|
+
"name": "key_type_domain_separator",
|
|
1405
1477
|
"type": {
|
|
1406
1478
|
"kind": "field"
|
|
1407
1479
|
}
|
|
@@ -1883,7 +1955,7 @@
|
|
|
1883
1955
|
"name": "fields",
|
|
1884
1956
|
"type": {
|
|
1885
1957
|
"kind": "array",
|
|
1886
|
-
"length":
|
|
1958
|
+
"length": 16,
|
|
1887
1959
|
"type": {
|
|
1888
1960
|
"kind": "field"
|
|
1889
1961
|
}
|
|
@@ -2004,11 +2076,6 @@
|
|
|
2004
2076
|
"error_kind": "string",
|
|
2005
2077
|
"string": "Point not on curve"
|
|
2006
2078
|
},
|
|
2007
|
-
"2754040237334517471": {
|
|
2008
|
-
"error_kind": "fmtstring",
|
|
2009
|
-
"length": 92,
|
|
2010
|
-
"item_types": []
|
|
2011
|
-
},
|
|
2012
2079
|
"4135474769840782447": {
|
|
2013
2080
|
"error_kind": "string",
|
|
2014
2081
|
"string": "Point at infinity should have canonical representation (0 0)"
|
|
@@ -2027,9 +2094,9 @@
|
|
|
2027
2094
|
}
|
|
2028
2095
|
}
|
|
2029
2096
|
},
|
|
2030
|
-
"bytecode": "H4sIAAAAAAAA/+2dd2AURfvHM89zdJHepIXeOyIoSklCk14sKMSQHHASknBJkNijvvYSLti7FBHF3hUr9v2KXVEUG2IvNLv8FgK5Sy5H5pL7iq+/138ck2c/z+zs7OzOzOajBhZfub5vcnLKyTne1OQMf7IvI8frz0hJz05Ozsqdle7Lnps8O9NfVE5N9i7ypubm+DIz4Jm2wdM2/+7h6Smp84ZnLhqRm5GakJKenr988rDxI5MC+bce7cvJ8GZnS7xFkBqLoHo2pAZDLYIaO2daRDWximphU6uWNkGtbIJa2wTFW9W8jVVUW6uodlZR7W0q39WmL/SwCeptE9TPJqi/yb99uN+Xnu6bs+v3S+IKCgoLCtbGx+37H5O/alh2ttefM93rzywsWBxYG987bbz/kz43dXl4YtKD+fnHzOjc78tReY9kLU74ZHvhj+4h0MfKxXavCPbxiNh6ewtlNMT9EzOzvb60zIy+E73++bk5Kbvu/cCS4oZxq1tc7lBc6hjy+8eXQNdAn4A+CX2qZM0LA+U3YSeLGDeDVRs8XS4qLvoKdraq4BNWFXyGUcEuVhV80qqCz1pUsCK96OmQ8jMh5WdDyk+5PWkt9Dno89AXom+HrlbtsNaqHV5kXKhuVhV8zqqCLzEq2N2qgs9bVfBlUk96MaT8Ukj55ZDyC25PegXqQAF9Nfp26GHVDq9YtcM6xoXqaVVBx6qCrzEq2MuqgrCq4OuknrQupPxaSPn1kPKrbk96A/om9C3o29G3Q2+rdnjDqh3eYVyoPlYVfNOqgu8yKtjXqoJvWVXwPVJPeiek/G5I+b2Q8ttuT1oPfR/6AXRD9O3Qz6od1lu1w4eMC9XfqoLvW1XwI9KF+jCk/FFI+YOQ8gb3Qm2Efgz9BPppyXYIWJxjA6sz/KwckJlkM+FyOUOjr2F7qxp+bjH9sanh5/El51Zmcf6KKb6MOeneoqlNeUlsahK3mzk/K90L3WQ3c7Op+qZS08Jq5Kp/Ef2kc3GhVTVctl2FN5ffNSqWf3NBlIOOHXmTSy606s+brKI2W0V9WYGrZFHDPedicdZ219LqXL6iXBf3im+yW7j4OtqHkR32m3Kx1SqC/bZcrFYE+11ErBY3QkUeeN+ElL8tc/3mO/dx9z30B+iP0J9KjncSiG6862hxKYuB5Y8HGjI0bondqL7FRP/IdDu01XXcGqM6bo2v3JMnrvyQkMbdxnnuuO2xza5xt1lFbSc8m9w6bl9sm72coOiz93exNk+v/ladb7tV1I5ol7UDMXv538G5gDvsxtifOQ+aX8rFNq8I9teIWE9xbSvyRPiljPX8TiG//9V9HvwG/R36B/TPCjz5d7gtbXfX/2bVEH+R5oJ/hZR/Dyn/EVL+022MnfDEwWPgkUq2d+hTd2fJJ7BH4fHAUwWeqlG3eOeujDfrLhRq585Wnd9TjXFGXexyV492mAhYYLtapa5BeAh3dlvT7sRr7jvoh507fyyRPWAzHHiqu6dVaHXybg0Yfa5nbwa1F4Xas6fdparFOKNedrkPYNwfva1S1ybcHz3d1rQ78QMp98cB7mlZ3R+13Row+lyffgxqXwq1Tx+7S1WHcUZ97XLXZdwf/axS1yPcH33c1rQ78fqU+6Oue1pW90c9twbR9jm7d3FPg3Kx/SuCbRgRW7u4thV45fQ0KC53Li51Cfl9Q/eFsxE8jeFpAk9T0ocWnkZWbdBsv31o4WlsVcGD9tuHFp4mVhVszpkfeZqFlA8KKTcPKTd1e1ILeFrC0wqe1qQPLTwtrNohfr99aOFpaVXBNvvtQwtPK6sKtiX1pPiQcpuQctuQcmu3J7WDpz08HeDpSPrQwtPOqh067bcPLTxWW7OezvvtQwtPB6sKdiH1pJCFKk/nkHLo062j25O6wtMNnu7w9CB9aOGxm9D3JLVDz5Byt5By95ByD7cdesHTGx73Fa5vRd5P+pVb+zoVqn2/kHKvkLKWWhTrD8/B8AyA55CSmyEa7Ta8p3/51yFQvB3iGRgsDqrAZ+CFdlWyugQDw6OOLxXlsgZZdLMSLegJ7HMfrnSGaJt7YDRfPXgOjdnWnufQMi6FXSOXTlc6v8u2Yh1WbmvGWZ3JYc6ZFTmVQVZRdqcyOPxUSh9kdSqDy/zbkTvH5abn+KakpqSn+N3iksL8lQmZGdk5KRk5Fp0hPFbWNZiZW3XZjNQenWon/dS0/pKzh6y95KwhnbpHwY0LrfbAkPKgaCpXCM/h8BwBz5AyTvvupPmzvGlp3rSEXP9C77C0NPfEg3kODykfEVIeEgwKDvfBwb5HlNUbCs8weIaXHBOqRD2qDi2/QSvyZzR2m0dbrfpwQowGloRS+/FVC6P5kKFq/vJhfn9K3oa4ljbhCTZBmTZBGTZBOTZBfpugFJug1JjVaXTMmiA7ZnVKiVmdrNrJqvtNtAnKtQmaZROUbhPki9llmRuzdkqzCbJ6W4m3CTrFJui0PUPHjcXBjzzce+6aB0bJzeltvh59xs1vDhiy8fbT86edurrrtJExHLmtBm67fB1sssXo+zI7UKdYgTrHCtQlVqBusQJ1jxWoZ6xAvWIF6hMrUF8LkP1XMxa7F7T3KU+C1ftUYozepxIr+0cBFjUJnWMmxW6OmVSRD/C/gn5tt+gyItq5fNR/lGCTIqTpRpL+KMEzwmXbVXgU448SduUfVRBta1cPrpzYfdS/98qXX5999+jdKxK2k47dwSErWqODxTGxuxNG24WNia/A30Lsaja7hbTEfd9WgaIlstFWN98Yi0sQfUcbtSu9VX67Wh5JuR2TXLDdEDU2yu0H678Y+dIu/7gK5C+fan/+4xntH8UjYkIlBq0Cu46YaHXrjeONWBODxUmxG7Em2oVNKjliFSyJZZtZDVcTrTJOogxX7o0w0W61Ockqyu5cJlfgprK6qSfaPUaSrKLszmVKlAOU3ZdQY93OYxU4zh2i7EaSqZSKJrp1tQoc745ldhWdFmVFLReRN9l184okLw8bZ1HBgxmJjUXiAYzEYpH4EEZitUg8kNHBrHbjdGO0qW2mE4cyGtJjkfgwRuIqFokHMxJXtUh8OCNxNYvERzASV7dIPISRuIZF4qGMxDUtEg9jJK5lkXg4I/EBFokTGIlrWyROZCQ+0CIx5TFfxyLxCEbiuhaJRzIS17NIPIqRuL5F4tGMxA0sEo9hJG5okfhIRuJGFonHMhI3tkg8jpG4iUXi8YzETS0ST2AkbmaReCIj8UEWiScxEje3SDyZkbiFReIpjMQtLRJPZSRuZZF4GiNxa4vERzESx1skPpqRuI1F4mMYidtaJD6WkbidReLpjEn3cQzo8YyViRlWKxOfMa5Oe4vqzWScc3KMvnAIXxK1oLoL3FaBU9xFWZtecQKlmhOiqOY0m2qmMO6IWQxoKgOaxoB6GdDZDOgcBnQuA+pjQE9kQOcxoOkM6HwGNIMBzWRAsxjQBQyonwHNZkBzGNBcBnQhA3oSA7qIAc1jQE9mQE9hQE9lQE9jQE9nQM9gQJ0zKdR8CvUsCvVsCvUcCvU/FOq5FOp5FOr5FOoFFOqFFOpFFOrFFOolFOqlFOplFGoBhbqYQg1ESbVZ/ui4yzJefu7duvQtNgtOjt3/mOB7xmKXY/XNqs3/n6ICuS8PlKuC+8ttQ0rPuIJCvZJCvYpCvZpCvYZCvZZCvY5CvZ5CvYFCvZFCvYlCvZlCvYVCXUqhLqNQl1OoKyjUWynUlRTqbRTqKgr1dgr1Dgp1NYV6J4V6F4V6N4V6D4V6L4V6H4V6P4X6AIX6IIX6EIX6MIX6CIX6KIX6GIX6OIW6hkJ9gkJ9kkJ9ikJ9mkJ9hkJ9NkqTgh11LaWuz1Goz1OoL1CoL1KoL1GoL1Oor1CoDoUKCvVVCnUdhfoahfo6hfoGhfomhfoWhfo2hfoOhfouhfoehbqeQn2fQv2AQt1AoX5IoX5EoVL+ptv5mEL9hEL9lEL9jEL9nELdRKF+QaFuplC/pFC/olC/plC/oVC/pVC/o1C/p1B/oFB/pFB/olC3UKhbKdRtFOp2CnUHhfozhfoLhforhfobhfo7hfoHhfonhfoXhbqTQYWJ42ANByscrHKwHg62CgdblYOtxsFW52BrcLA1OdhaHOwBHGxtDvZADrYOB1uXg63HwdbnYBtwsA052EYcbGMOtgkH25SDbcbBHsTBNudgW3CwLTnYVhxsaw42noNtw8G25WDbcbDtOdgOHGxHDrYTB9uZg+3CwXblYLtxsN052B4cbE8OthcH25uD7cPB9uVg+3Gw/TnYgznYARzsIRzsQA52EAd7KAd7GAc7mIM9nIM9goMdwsEO5WCHcbDDOdgEDjaRg03iYEdwsCM52FEc7GgOdgwHeyQHO5aDHcfBjudgJ3CwEznYSRzsZA52Cgc7lYOdxsEexcEezcEew8Eey8FO52CP42CP52BncLAzOdhkDvYEDjaFg53FwaZysGkcrJeDnc3BzuFg53KwPg72RA52HgebzsHO52AzONhMDjaLg13Awfo52GwONoeDzeVgF3KwJ3GwizjYPA72ZA72FA72VA72NA72dA72DA72TA42n4M9i4M9m4M9h4P9Dwd7Lgd7Hgd7Pgd7AQd7IQd7EQd7MQd7CQd7KQd7GQdbwMEu5mADHGwhB7uEg72cg72Cg72Sg72Kg72ag72Gg72Wg72Og72eg72Bg72Rg72Jg72Zg72Fg13KwS7jYJdzsCs42Fs52JUc7G0c7CoO9nYO9g4OdjUHeycHexcHezcHew8Hey8Hex8Hez8H+wAH+yAH+xAH+zAH+wgH+ygH+xgH+zgHu4aDfYKDfZKDfYqDfZqDfYaDfZaDXcvBPsfBPs/BvsDBvsjBvsTBvszBvsLBOhwsONhXOdh1HOxrHOzrHOwbHOybHOxbHOzbHOw7HOy7HOx7HOx6DvZ9DvYDDnYDB/shB/sRB7uRg/2Yg/2Eg/2Ug/2Mg/2cg93EwX7BwW7mYL/kYL/iYL/mYL/hYL/lYL/jYL/nYH/gYH/kYH/iYLdwsFs52G0c7HYOdgcH+zMH+wsH+ysH+xsH+zsH+wcH+ycH+xcHy/HfCsd/Kxz/rXD8t8Lx3wrHfysc/61w/LfC8d8Kx38rHP+tcPy3wvHfCsd/Kxz/rXD8t8Lx3wrHfysc/63U52A5/lvh+G+F478Vjv9WOP5b4fhvheO/FY7/VqL23wassC0C5f8/UOHhmK6kJeecWtmck3ImusJx6QrHpSscl65wXLrCcekKx6UrHJeucFy6wnHpCselKxyXrnBcusJx6QrHpSscl65wXLrCcekKx6UrHJeu9OVgOS5d4bh0hePSFY5LVzguXeG4dIXj0hWOS1c4Ll3huHSF49IVjktXOC5dIc0wOC5d4bh0hePSFY5LVzguXeG4dIXj0hWOS1c4Ll3huHSF49KVseVP4yuC5bh0hePSFY5LVzguXeG4dGUyB8tx6QrHpSscl65wXLrCcekKx6UrHJeucFy6wnHpCselKxyXrnBcusJx6QrHpSscl65wXLrCcekKx6UrHJeuzC56q+mUl/nUb9f8ed/HjQb4P7p/RG5CXsGm5064qcnwt1c9Gr7pUe52xu6NnPKTc4y7MjfaNzWbc+pglTpqK69N6o5WqU9kpO5klXoeI3Vnq9TpjNRdrFLPZ6TuZpU6g5G6u1XqTEbqnlapsxipe1mlXsBI3ccqtZ+Ruq9V6mjtx4sLbba6d0B/thvIOZpk4WiShaNJFo4mWRbt+1L9sHPnlopg8yrSW8vHnmz1YQhpxZIjUxaOTFk4MmXhyJSFI1MWjkxZODJl4ciUhSNTFo5MWTgyZeHIlIUjUxaOTFk4MmXhyJSFI1MWjkxZODJl4ciUhSNTFo5MWTgyZQlwsByZsnBkysKRKQtHpiwcmbJwZMrCkSkLR6YsHJmycGTKwpEpC0emLByZsnBkysKRKQtHpiwcmbJwZMrCkSkLR6YsHJmycGTKwpEpC0emLByZsnBkysKRKQtHpiwcmbJwZMrCkSnLvRwsR6YsHJmycGTKwpEpC0emLByZsnBkysKRKQtHpiwcmbJwZMrCkSkLR6YsHJmycGTKwpEpC0emLByZsnBkysKRKQtHpiwcmbJwZMrCkSkLR6YsHJmycGTKwpEpC0emLByZsnBkyvIGB8uRKQtHpiwcmbJwZMrCkSkLR6YsHJmycGTKwpEpC0emLByZsnBkysKRKQtHpiwcmbJwZMrCkSkLR6YsHJmycGTKwpEpC0emLByZsnBkysKRKQtHpiwcmbJwZMrCkSkLR6YsHJmybOFgSY4pjkxZODJl4ciUhSNTFo5MWTgyZeHIlIUjUxaOTFk4MmXhyJSFI1NWjkxZOTJl5ciUlSNTVo5MWTkyZeXIlJUjU1aOTFk5MmXlyJSVI1NWjkxZOTJl5ciUlSNTVo5MWTkyZa3PwXJkysqRKStHpqwcmbJyZMrKkSkrR6asHJmyNudgW3CwLTnYVhwsR4CsHAGycgTIyhEgK0eArBwBsnIEyMoRICtHgKwcAbJyBMjKESArR4CsHAGycgTIyhEgK0eArBwBsnIEyNqXg+UIkJUjQFaOAFk5AmTlCJCVI0BWjgBZOQJk5QiQlSNAVo4AWTkCZOUIkJUjQFaOAFk5AmTl6ESUI0BWjgBZOQJk5QiQlSNAVo4AWTkCZOUIkHUsB8sRICtHgKwcAbJyBMjKESDrZA6WI0BWjgBZOQJk5QiQlSNAVo4AWTkCZOUIkJUjQFaOAFk5AmTlCJCVI0BWjgBZOQJk5QiQlSNAVo4AWTkCZJ3NwXLUxjqXg/VxsCdysPM42HQOdj4Hm8HBZnKwWRzsAg7Wz8Fmc7AcS65yLLnKseQqx5KrizjYPA72ZA6W479Vjv9WOf5b5fhvleO/VY7/Vjn+W+X4b5Xjv1WO/1Y5/lvl+G+V479Vjv9WOf5b5fhvleO/VY7/Vjn+W+X4b5Xjv1WO/1Y5/lsNcLAc/61y/LfK8d8qx3+rHP+tcvy3yvHfKsd/qxz/rXL8t8rx3yrHf6sc/61y/LfK8d8qx3+rHP+tcvy3yvHfKsd/qxz/rXL8t8rx3yrHf6sc/61y/LfK8d8qx3+rHP+tcvy3yvHf6r0cLMd/qxz/rXL8t/og5X+Drhz/rXL8t8rx36qV/3acd36mP290hi+n0GzQcw8ecMjAQYceNvjwI4YMHTY8ITFpxMhRo8ccOXbc+AkTJ02eMnXaUUcfc+z0446fMTP5hJRZqWne2XPm+k6clz4/IzNrgT87J3fhSYvyTj7l1NNOP8M508l3znLOds5x/uOc65znnO9c4FzoXORc7FziXOpc5hQ4i52AU+gscS53rnCudK5yrnauca51rnOud25wbnRucm52bnGWOsuc5c4K51ZnpXObs8q53bnDWe3c6dzl3O3c49zr3Ofc7zzgPOg85DzsPOI86jzmPO6scZ5wnnSecp52nnGeddY6zznPOy84LzovOS87rziOA+dVZ53zmvO684bzpvOW87bzjvOu856z3nnf+cDZ4HzofORsdD52PnE+dT5zPnc2OV84m50vna+cr51vnG+d75zvnR+cH52fnC3OVmebs93Z4fzs/OL86vzm/O784fzp/OXshImDMTACozAemCowVWGqwVSHqQFTE6YWzAEwtWEOhKkDUxemHkx9mAYwDWEawTSGaQLTFKYZzEEwzWFawLSEaQXTGiYepg1MW5h2MO1hOsB0hOkE0xmmC0xXmG4w3WF6wPSE6QXTG6YPTF+YfjD9YQ6GGQBzCMxAmEEwh8IcBjMY5nCYI2CGwAyFGQYzHCYBJhEmCWYEzEiYUTCjYcbAHAkzFmYczHiYCTATYSbBTIaZAjMVZhrMUTBHwxwDcyzMdJjjYI6HmQEzEyYZ5gSYFJhZMKkwaTBemNkwc2DmwvhgToSZB5MOMx8mAyYTJgtmAYwfJhsmByYXZiHMSTCLYPJgToY5BeZUmNNgToc5A+ZMmHyYs2DOhjkH5j8w58KcB3M+zAUwF8JcBHMxzCUwl8JcBlMAsxgmAFMIswTmcpgrYK6EuQrmaphrYK6FuQ7mepgbYG6EuQnmZphbYJbCLINZDrMC5laYlTC3wayCuR3mDpjVMHfC3AVzN8w9MPfC3AdzP8wDMA/CPATzMMwjMI/CPAbzOMwamCdgnoR5CuZpmGdgnoVZC/MczPMwL8C8CPMSzMswr8A4MIB5FWYdzGswr8O8AfMmzFswb8O8A/MuzHsw62Heh/kAZgPMhzAfwWyE+RjmE5hPYT6D+RxmE8wXMJthvoT5CuZrmG9gvoX5DuZ7mB9gfoT5CWYLzFaYbTDbYXbA/AzzC8yvML/B/A7zB8yfMH/B7ITEQQxEIArxQKpAqkKqQapDakBqQmpBDoDUhhwIqQOpC6kHqQ9pAGkIaQRpDGkCaQppBjkI0hzSAtIS0grSGhIPaQNpC2kHaQ/pAOkI6QTpDOkC6QrpBukO6QHpCekF6Q3pA+kL6QfpDzkYMgByCGQgZBDkUMhhkMGQwyFHQIZAhkKGQYZDEiCJkCTICMhIyCjIaMgYyJGQsZBxkPGQCZCJkEmQyZApkKmQaZCjIEdDjoEcC5kOOQ5yPGQGZCYkGXICJAUyC5IKSYN4IbMhcyBzIT7IiZB5kHTIfEgGJBOSBVkA8UOyITmQXMhCyEmQRZA8yMmQUyCnQk6DnA45A3ImJB9yFuRsyDmQ/0DOhZwHOR9yAeRCyEWQiyGXQC6FXAYpgCyGBCCFkCWQyyFXQK6EXAW5GnIN5FrIdZDrITdAboTcBLkZcgtkKWQZZDlkBeRWyErIbZBVkNshd0BWQ+6E3AW5G3IP5F7IfZD7IQ9AHoQ8BHkY8gjkUchjkMchayBPQJ6EPAV5GvIM5FnIWshzkOchL0BehLwEeRnyCsSBAPIqZB3kNcjrkDcgb0LegrwNeQfyLuQ9yHrI+5APIBsgH0I+gmyEfAz5BPIp5DPI55BNkC8gmyFfQr6CfA35BvIt5DvI95AfID9CfoJsgWyFbINsh+yA/Az5BfIr5DfI75A/IH9C/oLshMZB3cewQBXqgVaBVoVWg1aH1oDWhNaCHgCtDT0QWgdaF1oPWh/aANoQ2gjaGNoE2hTaDHoQtDm0BbQltBW0NTQe2gbaFtoO2h7aAdoR2gnaGdoF2hXaDdod2gPaE9oL2hvaB9oX2g/aH3owdAD0EOhA6CDoodDDoIOhh0OPgA6BDoUOgw6HJkAToUnQEdCR0FHQ0dAx0COhY6HjoOOhE6AToZOgk6FToFOh06BHQY+GHgM9Fjodehz0eOgM6ExoMvQEaAp0FjQVmgb1QmdD50DnQn3QE6HzoOnQ+dAMaCY0C7oA6odmQ3Ogue72v7tV726ru1vg7na1u7XsbgO7W7bu9qq7FepuW7pbjO52oLt1526zuVti7vaVu9Xkbgu5Wzjudou7NeJuY7hbDu72gLuU7y67u0vk7nK2u/TsLhO7S7ru8qu7VOoua7pLkO5yobu05y7DuUtm7vKWuxTlLhu5Szzucoy7dOIuc7hLEu7ygTvVd6fl7hTane66U1N3GulO+dzpmTuVcqc97hTFnU64r/7ua7r7Su2+/rqvqu5rpfsK6L6urZrszcn1ZySm5KRsiDs4zoh6qlStVr1GzVoH1D6wTt169Rs0bNS4SdNmBzVv0bJV6/g2bdu179CxU+cuXbt179GzV+8+ffv1LyjYEFcvkL9sWKrP3z2w7rVq32x75fk5BQV7ftQz/EdHhP/oyMC6QWmd0/K2Ds7c+6Ox4T+aFFhX45c1My/49sCcvT+aHB41JfxHx4QfeGx41PTwHyWHH7gosG51rTeGr7mx+sy9Pzo5/EdnhJ+jc1YZP7smsK7jwEmmec47GzfEzchflbQoy+/NzvZlZhQWlL8lMzHaA+ZGe0BKtAdkR3uAN9oD4qM9IPWf10oZ0R4w55/XrGn0KuXQM6T+86qURr9wmfTeGnWVZkd7QC79HPhdw/cvuHAn0U86hz56R33SWf977P4jHrv84X5etAf0pDfraPrYGv/Pu0V99Psh/l9Qpajvh0X0ke//5RtZd/qVzqV3Pv7zoV20BxxHf/3JpN8P/4Y3gf+XD/ao12birg6s75yyewc1OTVzflZKjm9Wujc505+S6v5rode/C5R8kj8lK8vr3xDXOH95QmZGdk5h/opEn9+bmiP5t47OyPHO8fqXTuvXt/zN19LHm6iOPzOx9PFx0eVPzF+WkJKevrhWMWflZG+6e9ILvdHVxN0hDiNItIQ7dtUlzV3VTMjMyis+pcTQOoXAi2peu9I1T4xBzZdNycnMWhyIUNNS1yhh+QifN738P1eusaJonXfPmdbNv31Ept/rm5Ox6z8vX98+N8eX7svJK9rvTyjurBN299WjirpqQcHi/NVFW/fD0tJ23QjFtVicv2KKb35WureoOnuTlaqsJ6qmWJSYf/twX0bKrg8FciZkXb6XoivHuqmnzk3J2EUJdtbiJCvG5M7PGj07UHxAo/zVozPSimoa8Q4ZsA+H3PvPbX/n/jF95+cvm+rerYsDweP33qp7zjiwvrcvOznbl+ZN9s6e7f7CvfFz3Qz+ZL/XveFLDADFN36z/Xzjj6jkjT9iT6c6sNKd34QTNOY3voTC3ZqHnHhisBCaNX/puMyFJW7I4rCiM6+zJ2LPj5NCQyvbJkmVbhMTPqSEtkHJkaFB6ZEhy+9bmJLjHZ09xe3VSbs7dUJRn55c3KXDxoVgouKRobjOt0zrEznehMeXfQWCGWIz2IyI1WDT9O8bbO53x5qM3PR032yfO8Jked20GXP2/3gyspLjycjI40mUPV/CCZ6YjycaCo88UpT6jQQHizLHkBGxHENG7Ncx5JHiIWT83s46saivRh4HtMxxIxB53Ig8AgVKvpuU+q/IA4vGZmAZ+V84sNyZ5t01YcnM9ibP9WXkbIhr9e8dUv7xryiVefmINKRIpc8iqdJDq4QPKaFDackhpeneN7WyYoOdadm0Pn0HhoWGNuee23510T25+z8mZC0JCVg6JXdWOXOv4G/3zr4a9Il7t/XGg/O6NR6QOWHhORunrj694dIum+s0/T538MJfN2RGzudZOi43PcJZ7eOlJ/xxEt5y/5Bxq+XfN26tTM/ZO2K1+d9L0J5//vcSVPTP3/wS1Hwf9/yKpAW5KenZEW7t4jsoeEDj/GW7fui+WUWGFt+YdiNGiStWRG+2r/Uv9/XLooEiJzHFSf57Xrni/8aFow4ZmTm+2XnJqX6v+66cFjKx27NelOXPXJS3/5eJkyo5sO291Q/4F76KVX4BOYm9gLzPdeA1e2Zq43d3xYSinlg8aStj/Xdl+LpNLFeAk/4LV4CfSPPOyp2TnJ45JznF70/JC1vunb6fb+AFlbyBF+zpO8Mr/V7RI5xQJeY3sCcUXu5y7y3TBpYKSgoWIgeNCBYiB40MFiIHjQoWIgeNDhYiB40JFiIHHRksRA4aGyxEDhoXLEQOGh8sRA6aECxEDpoYLEQOmhQsRA6aHCxEDpoSLEQOmhosRA6aFixEDjoqWIgcdHSwEDnomGAhctCxwULkoOnBQuSg44KFyEHHBwuRg2YEC5GDZgYLkYOSg4XIQScEC5GDUoKF0KDIrwWEzZ8oR8iWpWvnCT42wthVo2O3KvvxbJa6rwehT2YTmqH0g7iiDw9TKnkwRXH68HOWkvNLDZ8fFb9DhFS5xG+qlHqeuE/CxH2txlT6JXVWpftAHWIfqPsv6gMayz5Qcn69O2ZCpacHC/7270ui7Gl73/vL7BTVSncKDTZoifatHgwo8fMawUtTZoKaexZWQnMUs6qFTQtqjs9fNjYzJa34B1WDBy13W8nvDc9ctezM1UufWvVgdyvzgBqlD6gRPKBooWRkyana1Eh93RPe1yVS8mC3DT9IQw4KnRTetefboMRd85qxmXMKCpbsYxvutlHelKxhuyY+oeNNy0gfDpUdX6XOkjK2/wbmLy8KLGtvcGDLsj8cKH1I0fS0TmzmpwtiNT899u+bn95dlMZt5WRfxq4POK4u3QiNKjkfbRibOVxcsD7F4NIzZ8uv3+LClk33NvzeldjSOSX8GlUPm3dbZjeRssctTfQtDLtSwRG6+LT3NkTg0dCLt7uJkxfkuos13oycq0pXr2ZFtwn2HF8rxpexZhAcoT1k1Z6EIc0SF2yfCEeZ3TtowetWbviuDb5weokHTUg/KHUxahWfzv8BcObJEPvQAQA=",
|
|
2031
|
-
"debug_symbols": "
|
|
2032
|
-
"verification_key": "
|
|
2097
|
+
"bytecode": "H4sIAAAAAAAA/+2dd3xURduGM8+zdAHpIB2l9yoqFkjovQk2YiALREISNwnFSuzdkGAvoFRBEBE7WLHPLcWKYgELdhDFLnwHAtlNliWzIbd+7/t7+Ydh8+z1zMyZOXtmZnOhObNvW5OWOT45KX1y/MTUQPz+8oR4/wz/hMyMpNQU+Jps0a+zVvZKTpgwpVfqjD6ZKRNiE5KTsxaO6Dmkb++crMVjkjJS/Onp0sghSI1DUBUXUrXTHIJq2lkOUbWcouq51Kq+S1ADl6CGLkGNnGre2CmqiVPUsU5Rx7lUvpXLWGjrEtTBJaizS1AXk7WsVyApOTlp0r6fz4nJzs7Nzl7XKObwf0zW0p7p6f5Axpn+QGpu9uycdY06JA4JbO04r+UTw3o/lpU19pwWnb/qN/PJtNmxW3fn7vTeAr3r8Nh32n42pTjYuyNiqxwsHKIjVg9LTfcnJaamdBrmD0zNzEjYN/dz5uR3jFfd/HLT/FKzkJ/fPQd6D/Re6FzovII1z80pugubO8R4GZz64L4iUTHRV7CFUwXvdarg/YwKtnSq4FynCs53qGBxRtF9IeX7Q8rzQ8rzvJG0ALoQugi6OPp+aOXUDwuc+mEJ40K1dqrgQqcKPsCoYBunCi5yquBS0khaElJ+IKS8NKS82BtJy6APQpdDV0TfD22d+mGZUz88xLhQ7Zwq+KBTBVcyKtjeqYLLnSr4MGkkPRRSXhlSfjikvMIbSaugj0BXQx+Nvh86OPXDKqd+eIxxoTo6VfARpwo+zqhgJ6cKrnaq4BOkkfRYSPnxkPITIeVHvZH0JPQp6NPQNdH3Q2enfnjSqR/WMi5UF6cKPuVUwWdIF2ptSPmZkPLTIeU13oV6Fvoc9HnoCwX7Icehjcc5tfBFh8VF0esWj9Mo+hpWc6rhuiJAZvgspxquO604y5mXDp9dp464tDjYl4vsHS0O9pWIWD1YKNZ4fSmk/PIhl1+veKP1Vehr0NehbxRcxZqcrEUjk1ImJfvz2lFEy00zh1mXDyx6dayz90VPTUv2Q63bctplPFkT/Yj35onTdUQJ1RGNCl6J0rOjuxIxRYeEdO6b0e9VzM51qIRHduvcN52i1hd9BYpTx/WzXbMXERR99i4eNtdhYHVxGnzrnaI2RLsrlVNin90bOBdwg9s9dmO0Dy1u2E2Hx148/vMLioN9KyLWl1/b4nwibDrEdlzzkJ+/5X0evA19B/ou9L2oL4d3Nbyedpv1bzt1xPukR7n3Q8rvhJTfDSm/53XGZugH0A+hW46wv0M/dTcX+gT+CPox9BPop1H3eItW2YQ7U0sKtUULt8G/ldGilm65t0V7m8hxwLZySv0Z4UO4hdebbg3//PBBO/bu3Vkge47T7WCb16xcp8Z7NWCMudZtGdQ2FGrr1m6X6gtGi9q45f6SMT/aOqXeTpgfrb3edGv4V5T58aXXLKf5sd2rAWPMtevAoLanUNu1c7tUXzNa1N4t9zeM+dHBKfW3hPnRzutNt4Z/R5kf33jNcpof33o1YIy5jp0Z1E4UaseObpfqe0aLOrnl/oExPzo7pd5BmB8dvd50a/hOyvz4wWuW0/zY4dUg2jHnuFb98fDYdmMqDSgOdldEbMX82hZnSfZjfrlFfqllyM93eQuyn6A/Q3dDf2F9j+Anpz749d/7HsHPThX87d/7HsFupwr+Tto/+DWk/FtI+feQ8i/eSPoD+if0L+jfrO8R/OHUD3v+ve8R/OlUwb3/3vcI/nKpoC+GNJL2hJT3Bsu+mJDX/54Dn4FP4FP4fKTvEfiMUz+U+te+R+ATpwqW/te+R+BTpwqW4YwkX6mQcumQcpmQss8bSWXhKwdfefgqkL5H4Cvr1A9HkfrhqJByuZBy+ZByBa8fKsJXCb7K8B1djOcTX5XD1/682wegWLWvElKuGHIP+KjgprGvKnzV4KsOX42Ch4US5WGhRyr6OuTkHxf6agaLtYrxLedctyo5XYKa4VFnF4ryWLUchlmBHtScw55TF84QbXfXLLo+wdNZX+0SO/r21T7EpXDr5MLpCuf32E6sOkX2ZoxTS+rYWcVpSi2nKLemHBPelMJvcmrKMYf81YgVgzOTM5JGTkhITgh4xTm5WUtiU1PSMxJSMhwGQ3isrK82LrP0gnMmtG1esfePtavOufzUdTdedmrzNlFwY0KrXTOkXCuayuXCVxe+evDVP0SzV/aeOt6fmOhPjM0MTPP3TEz0Gh7MUzekXC+kXD8Y1Dq/1Cb4yyBRVq8BfA3hK/QVDF/Ud9UGRXdocX5LxO1wFU5juHEJ3VgaF+qsUrnRfNGndNbCnoFAwswtMfVdwmNdglJdglJcgjJcggIuQQkuQRNKrE79S6wL0kusTgklVienfnIafsNcgjJdgsa7BCW7BCWV2GWZXGL9lOgSdKJLUCOXoAtdgi4+cOuYuz+41qApJ1fe2LfF53+NG/nrqvHL5nTts3hr023fj5v7cY+dj2xrX4J3bqcbt1u+pi7ZSuj7l26g5iUFalFSoJYlBWpdUqA2JQVqV1Kg9iUF6lhSoE4OIPdvlTmcXtCep3yNnZ6nmpTQ81STRtGfgcU4tKMr4/DNOCTuxkgsDomPZyRWh8Tdi5O4KOgJTjvpz0ab2mUun8joSJ9D4pMYiUs5JO7BSFzaIfHJjMRlHBKfwkhc1iHxqYzE5RwSn8ZIXN4hcU9G4goOiXsxEh/lkDiWkbiiQ+I4RuJKDol7MxJXdkjch5H4aIfEfRmJqzgk7sdIXNUhcX9G4moOiQcwEld3SDyQkbiGQ+JBjMQ1HRIPZiSu5ZB4CCNxbYfEQxmJ6zgkHsZIfIxD4uGMxHUdEo9gJK7nkHgkI3F9h8SjGIkbOCQezUjc0CHx6YzEjRwSj2EkbuyQeCwjcROHxGcwEh/rkPhMxqL7LAb0bMbOxDlOOxPrGFfnOIfqjWO0Ob6E9gSLcQ3PZUATGNDxDOgEBjSRAfUzoBMZ0EkM6GQGNIkBPY8BncKAJjOgUxnQFAY0lQFNY0DPZ0ADDGg6A5rBgGYyoNMY0OkM6AwGdCYDegEDeiEDehEDejEDegkDeikDamdRqFkU6mUU6uUU6hUU6pUU6lUU6tUU6jUU6rUU6nUU6vUU6g0U6o0U6k0U6s0UajaFOptCzYmSmuPwC+3N9jkhi869X25pXTZzrNNvkOirjI0kO8cp94uU3LfkFCkm2OP1IWVk3Eqh3kah3k6h3kGh3kmh3kWh3k2h3kOh3kuhzqVQ51Go91Go91Oo8ynUBRTqQgp1EYW6mEJdQqE+QKEupVCXUagPUqjLKdQVFOpDFOpKCvVhCnUVhfoIhbqaQn2UQn2MQn2cQn2CQn2SQn2KQn2aQl1Doa6lUJ+hUCm/b2Kfo1Cfp1BfoFBfjNKX70ZdR6nrSxTqyxTqKxTqqxTqaxTq6xTqGxQqZ+cJFOqbFOp6CnUDhbqRQt1Eob5Fob5Nob5Dob5Lob5Hob5PoW6mUD+gUD+kULdQqB9RqB9TqJ9QqJ9SqFsp1G0U6mcU6ucU6hcU6pcU6nYK9SsK9WsK9RsK9VsK9TsK9XsK9QcKdQeFupNC/ZFC3UWh/kSh/kyh7qZQf6FQf6VQf6NQf6dQ/6BQ/6RQ/6JQ/6ZQ91CoexlUmBgO1nCwwsEqB+vjYEtxsKU52DIcbFkOthwHW56DrcDBHsXBVuRgK3GwlTnYoznYKhxsVQ62GgdbnYOtwcHW5GBrcbC1Odg6HOwxHGxdDrYeB1ufg23AwTbkYBtxsI052CYc7LEc7HEcbFMOthkH25yDbcHBtuRgW3GwrTnYNhxsWw62HQfbnoPtwMF25GA7cbCdOdguHGxXDrYbB3s8B9udgz2Bgz2Rgz2Jg+3BwZ7MwZ7CwZ7KwZ7GwfbkYHtxsLEcbBwH25uD7cPB9uVg+3Gw/TnYARzsQA52EAc7mIMdwsEO5WCHcbDDOdgRHOxIDnYUBzuagz2dgx3DwY7lYM/gYM/kYM/iYM/mYM/hYMdxsPEc7LkcbAIHO56DncDBJnKwfg52Igc7iYOdzMEmcbDncbBTONhkDnYqB5vCwaZysGkc7PkcbICDTedgMzjYTA52Ggc7nYOdwcHO5GAv4GAv5GAv4mAv5mAv4WAv5WBncbBZHOxlHOzlHOwVHOyVHOxVHOzVHOw1HOy1HOx1HOz1HOwNHOyNHOxNHOzNHGw2Bzubg83hYHM52Dkc7C0c7K0c7G0c7O0c7B0c7J0c7F0c7N0c7D0c7L0c7FwOdh4Hex8Hez8HO5+DXcDBLuRgF3GwiznYJRzsAxzsUg52GQf7IAe7nINdwcE+xMGu5GAf5mBXcbCPcLCrOdhHOdjHONjHOdgnONgnOdinONinOdg1HOxaDvYZDvZZDvY5DvZ5DvYFDvZFDnYdB/sSB/syB/sKB/sqB/saB/s6B/sGB2s5WHCwb3Kw6znYDRzsRg52Ewf7Fgf7Ngf7Dgf7Lgf7Hgf7Pge7mYP9gIP9kIPdwsF+xMF+zMF+wsF+ysFu5WC3cbCfcbCfc7BfcLBfcrDbOdivONivOdhvONhvOdjvONjvOdgfONgdHOxODvZHDnYXB/sTB/szB7ubg/2Fg/2Vg/2Ng/2dg/2Dg/2Tg/2Lg/2bg93DwXL8t8Lx3wrHfysc/61w/LfC8d8Kx38rHP+tcPy3wvHfCsd/Kxz/rXD8t8Lx3wrHfysc/61w/LfC8d8Kx38rVTlYjv9WOP5b4fhvheO/FY7/Vjj+W+H4b4Xjv5Wo/bc5Tth6OUX/H6jwcbyzUp/TpgYubVLOkZ5wXLrCcekKx6UrHJeucFy6wnHpCselKxyXrnBcusJx6QrHpSscl65wXLrCcekKx6UrHJeucFy6wnHpCselK504WI5LVzguXeG4dIXj0hWOS1c4Ll3huHSF49IVjktXOC5d4bh0hePSFY5LVzguXeG4dIXj0hWOS1c4Ll3huHSF49IVjktXOC5d4bh0hePSFY5LVwYVvYwvDpbj0hWOS1c4Ll3huHSF49KVERwsx6UrHJeucFy6wnHpCselKxyXrnBcusJx6QrHpSscl65wXLrCcekKx6UrHJeucFy6wnHpCselKxyXrnBcujJxXaM6tT7ruvHcM2LeGrl9/LVv7n44d899827PvXH+F71qnb53UP1N4YceRR5n7D/IKTo5x7grk6N9UnNpU1On1FFbeV1SN3NKfR4jdXOn1FMYqVs4pU5mpG7plHoqI3Vrp9QpjNRtnFKnMlK3c0qdxkjd3in1+YzUHZ1SBxipOzmljtZ+PDvX5ah7A3Sj242co0kWjiZZph2+8Tv27t1VHOz04lz/orEznL5qQTqR58iUhSNTFo5MWTgyZeHIlIUjUxaOTFk4MmXhyJSFI1MWjkxZODJl4ciUhSNTFo5MWTgyZeHIlIUjUxaOTFk4MmXhyJSFI1MWjkxZODJl4ciUJYeD5ciUhSNTFo5MWTgyZeHIlIUjUxaOTFk4MmXhyJSFI1MWjkxZODJl4ciUhSNTFo5MWTgyZeHIlIUjUxaOTFk4MmXhyJSFI1MWjkxZODJl4ciUhSNTFo5MWTgyZeHIlIUjUxaOTFlWcbAcmbJwZMrCkSkLR6YsHJmycGTKwpEpC0emLByZsnBkysKRKQtHpiwcmbJwZMrCkSkLR6YsHJmycGTKwpEpC0emLByZsnBkysKRKQtHpiwcmbJwZMpC+s1rjkxZODJl4ciUhSNTlk0cLEemLByZsnBkysKRKQtHpiwcmbJwZMrCkSkLR6YsHJmycGTKwpEpC0emLByZsnBkysKRKQtHpiwcmbJwZMrCkSkLR6YsHJmycGTKwpEpC0emLByZsnBkysKRKQtHpiwcmbJwZMqyi4PlyJSFI1MWjkxZODJl4ciUhSNTFo5MWTgyZeHIlIUjUxaOTFk4MmXhyJSVI1NWjkxZOTJl5ciUlSNTVo5MWTkyZeXIlJUjU1aOTFk5MmXlyJSVI1NWjkxZOTJl5ciUlSNTVo5MWatysByZsnJkysqRKStHpqwcmbJyZMrKkSkrR6asdTnYehxsfQ6WI3VWjgBZOQJk5fy6pXIEyMoRICtHgKwcAbJyBMjKESArR4CsHAGycgTIyhEgK0eArBwBsnIEyMoRICtHgKwcAbJ24mA5AmTlCJCVI0BWjgBZOQJk5QiQlSNAVo4AWTkCZOUIkJUjQFaOAFk5AmTlCJCVI0BWjgBZOQJk5QiQlSNAVo4AWTkCZOUIkJUjQFaOAFk5AmQdxMFyBMjKESArR4CsHAGycgTIOoKD5QiQlSNAVo4AWTkCZOUIkJUjQFaOAFk5AmTlCJCVI0BWjgBZOQJk5QiQlSNAVo4AWTkCZOUIkJUjQFaOAFkncrActbFO5mCTONjzONgpHGwyBzuVg03hYFM52DQO9nwONsDBpnOwHEuuciy5Oo2Dnc7BzuBgOf5b5fhvleO/VY7/Vjn+W+X4b5Xjv1WO/1Y5/lvl+G+V479Vjv9WOf5b5fhvleO/VY7/Vjn+W+X4b5Xjv1WO/1Y5/lvl+G+V479Vjv9WOf5bzeFgOf5b5fhvleO/1Vsp/02kcvy3yvHfKsd/q07+28H+qamBmf1TkjJyq27RiV27Hd/9hBNP6nHyKaee1rNXbFzvPn379R8wcNDgIUOHDR8xctTo08eMPePMs84+Z1z8uQnjJyT6J06anHTelOSpKalp5wfSMzKnTZ8x84ILL7r4kkvtLJtlL7OX2yvslfYqe7W9xl5rr7PX2xvsjfYme7PNtrNtjs21c+wt9lZ7m73d3mHvtHfZu+099l47186z99n77Xy7wC60i+xiu8Q+YJfaZfZBu9yusA/ZlfZhu8o+YlfbR+1j9nH7hH3SPmWftmvsWvuMfdY+Z5+3L9gX7Tr7kn3ZvmJfta/Z1+0b1lrYN+16u8FutJvsW/Zt+459175n37eb7Qf2Q7vFfmQ/tp/YT+1Wu81+Zj+3X9gv7Xb7lf3afmO/td/Z7+0PdofdaX+0u+xP9me72/5if7W/2d/tH/ZP+5f92+6xe2FiYAyMwCiMD6YUTGmYMjBlYcrBlIepAHMUTEWYSjCVYY6GqQJTFaYaTHWYGjA1YWrB1IapA3MMTF2YejD1YRrANIRpBNMYpgnMsTDHwTSFaQbTHKYFTEuYVjCtYdrAtIVpB9MepgNMR5hOMJ1husB0hekGczxMd5gTYE6EOQmmB8zJMKfAnApzGkxPmF4wsTBxML1h+sD0hekH0x9mAMxAmEEwg2GGwAyFGQYzHGYEzEiYUTCjYU6HGQMzFuYMmDNhzoI5G+YcmHEw8TDnwiTAjIeZAJMI44eZCDMJZjJMEsx5MFNgkmGmwqTApMKkwZwPE4BJh8mAyYSZBjMdZgbMTJgLYC6EuQjmYphLYC6FmQWTBXMZzOUwV8BcCXMVzNUw18BcC3MdzPUwN8DcCHMTzM0w2TCzYXJgcmHmwNwCcyvMbTC3w9wBcyfMXTB3w9wDcy/MXJh5MPfB3A8zH2YBzEKYRTCLYZbAPACzFGYZzIMwy2FWwDwEsxLmYZhVMI/ArIZ5FOYxmMdhnoB5EuYpmKdh1sCshXkG5lmY52Ceh3kB5kWYdTAvwbwM8wrMqzCvwbwO8waMhQHMmzDrYTbAbITZBPMWzNsw78C8C/MezPswm2E+gPkQZgvMRzAfw3wC8ynMVphtMJ/BfA7zBcyXMNthvoL5GuYbmG9hvoP5HuYHmB0wO2F+hNkF8xPMzzC7YX6B+RXmN5jfYf6A+RPmL5i/YfbA7IXEQAxEIArxQUpBSkPKQMpCykHKQypAjoJUhFSCVIYcDakCqQqpBqkOqQGpCakFqQ2pAzkGUhdSD1If0gDSENII0hjSBHIs5DhIU0gzSHNIC0hLSCtIa0gbSFtIO0h7SAdIR0gnSGdIF0hXSDfI8ZDukBMgJ0JOgvSAnAw5BXIq5DRIT0gvSCwkDtIb0gfSF9IP0h8yADIQMggyGDIEMhQyDDIcMgIyEjIKMhpyOmQMZCzkDMiZkLMgZ0POgYyDxEPOhSRAxkMmQBIhfshEyCTIZEgS5DzIFEgyZCokBZIKSYOcDwlA0iEZkEzINMh0yAzITMgFkAshF0EuhlwCuRQyC5IFuQxyOeQKyJWQqyBXQ66BXAu5DnI95AbIjZCbIDdDsiGzITmQXMgcyC2QWyG3QW6H3AG5E3IX5G7IPZB7IXMh8yD3Qe6HzIcsgCyELIIshiyBPABZClkGeRCyHLIC8hBkJeRhyCrII5DVkEchj0EehzwBeRLyFORpyBrIWsgzkGchz0Geh7wAeRGyDvIS5GXIK5BXIa9BXoe8AbEQQN6ErIdsgGyEbIK8BXkb8g7kXch7kPchmyEfQD6EbIF8BPkY8gnkU8hWyDbIZ5DPIV9AvoRsh3wF+RryDeRbyHeQ7yE/QHZAdkJ+hOyC/AT5GbIb8gvkV8hvkN8hf0D+hPwF+RuyB7IXGgP1PoYFqlAftBS0NLQMtCy0HLQ8tAL0KGhFaCVoZejR0CrQqtBq0OrQGtCa0FrQ2tA60GOgdaH1oPWhDaANoY2gjaFNoMdCj4M2hTaDNoe2gLaEtoK2hraBtoW2g7aHdoB2hHaCdoZ2gXaFdoMeD+0OPQF6IvQkaA/oydBToKdCT4P2hPaCxkLjoL2hfaB9of2g/aEDoAOhg6CDoUOgQ6HDoMOhI6AjoaO8I3/veN47SveOvb0jau842Tv69Y5pvSNV7/jTO6r0jhW9I0DvuM47WvOOwbwjK+94yTsK8o5tvCMW7zjEO7rwjhm8IwFv+97bave2xb0tbG+72dsa9rZxvS1Xb3vU28r0th29LUJvO8/bevO2ybwtLW/7ydsq8rZ1vC0Yb7vE29rwtiG8LQNvee8txb1ls7fE9Zaj3tLRW+Z5SzJv+eQtdbxlibeE8B73vUdz7zHae+T1Hk+9R0nvsc97RPMep5aO8GdkBlLiEjIStsR0jTGivlKly5QtV77CURUrVT66StVq1WvUrFW7zjF169Vv0LBR4ybHHte0WfMWLVu1btO2XfsOHTt17pKdvSWmWk7Wgp4TkgJtctZvKPPtz2+8PCk7+8BL7cJf6hb+UmzO+hMSWyTO/KlH6sGX4sJf6p+zvtxva8dd+12ljIMvDQiPGhj+0rDwNw4PjxoR/tKY8DeODY86I/ylceFvnJ6zfnmFTb3Wzi077uBLM8NfuiS8c2xWyGu35WxukbD/uTl+QurUtISMpPHJ/vjUQMIE769p/kB6UmpK/PRAQlqaP7AlpmbWwtjUlPSM3KxFcUkB/4QMyVrcPyXDP8kfmD+6c6eiH7kLv99E9f5ZcYXfHxNd/risBbEJycmzK+RzlozwJ3uNnuaPsiUx4QSNlvDgvrokenMlNjVtZn6T4kLrFALPq3nFI655XAnUfMHIjNS02TkRalroGsUu7JPkTy76EL/Sory7x4GWHp21rE9qwJ80KWXfP2/Z3Dzhggz/hPjMjOT4vAEbmz9eh+4frqfnjdbs7NlZy/PWbD0TEwP+9PT8iszOWjQyaWpasj+vRgfzFaqvL6remBGXtaxXUkrCvhVixtC0Ww5SdMkgL/WoyQkp+yjB8ZqfZNGAzKlp/Sfm5L+hRtby/imJeTWNOEm6HeaXKz54afe7qwd0mpq1YJQ3YWfnBN9/cLYeaHHO6qT0+JTM5OSkiUn+QHya30ubMmlLTK1/eXr3OcLp3Sd8aEd3MWMknFCqZKZ1bGidQuDzB6dOKzCR8uML/USDN4iDt4K8iAMv9w6FHOkU733EPWnCbxIaCstrQ5WCk3xN3hxPC0yLT0ofcnCADssbn2HTOkjLn9j5dbx/dMeciPES8SeaU/AWUehfYRcrWIWSuZn0KambSc1/7mayItG/79EhNd0fPzkpJWNLTL3/vtuIFrcFxZ0+DreRAtMp8m3kkDeLAg8ZkW4jesStiDvi26mE30YK3D7zWldz39+FKnqI56MFozt26h4WGtqPB+b58rxJuP8fQ9PmhATMH5k5vojHnuBPDz74VOsY817DT7rObF2zW+rQaVd8Mmr5JdXnt9xeufYPmT2m/b4lNXK+UvMHZyZHaFXkm5GGf3YEif/PblR1/7kb1ZLkjIO3qAb/e9L535PO/j//1JNO7cNM8kW9z89MSE6PMJfzp0zwDdWyFux70Xt8inynyp+JkdaT+wk1D7ee9B6iHFpf6OoVuEcdTPKf8+BU/5+7H21umpKakTRxZvyEgD8hw58YsiQ7sAGTFkidMXNLTPX/+G2X/74HqiPfQuJvxOTVtFKhjZRGwUVW3viLzRt++eutQ+ygBPn/v/dQqv1zs3dVcuqkg/M0f4N07L88U9OOcKamHfFTQdtwQukSn6mlQuEHnufzo/ILwY+x7oWC4oKFyEG9g4XIQX2ChchBfYOFyEH9goXIQf2DhchBA4KFyEEDg4XIQYOChchBg4OFyEFDgoXIQUODhchBw4KFyEHDg4XIQSOChchBI4OFyEGjgoXIQaODhchBpwcLkYPGBAuRg8YGC5GDzggWIgedGSxEDjorWIgcdHawEDnonGAhctC4YCFyUHywEDno3GAhNCjy5/+RfmrHHfEdsn7h2pUKflyEsctEx25w6I9iM997FAj9FDahGQp/6Bb3w8MUSh5MkZ8+vM2FNrA0fB8k/3khpMoFflL488R7aup5uD2UI34aTTjiMVCZOAaO/i8aA76SHAOH2HocdMTrgDT6OuCQV7NM4aupwZ4o0DFlgwEFXi8X7NNDJih/YFsjNEc+q0zYs3v5gVkLBqUmJOa/UDr4poVe8wL+8MylD525bOGmlQ2Ok0O+oVzhN5QLviFvCyOu4OH0iCN+Tq4caZiXDh/mGqn6h5sbvpA3ha7/lgfP0b0VTHb2nMMckz3Qz5+Q1jMQSJgZMrRK14/4jlKHfkeZynMOcUDXPWthXuChTu+61w97cX/zCr8lbxVauWSWoWkltQwd888tQ1fmpfF6OT4pZZo/kHFH4U6ocYRL0Ools3yLCdYnH1x4sez4TZGYsG3Pgx1/cCe1cE4Jv0Zlw5bajtlNpOwx8+OSpoVdqeDNOb/ZBzvi/wAzeLF9Bp8BAA==",
|
|
2098
|
+
"debug_symbols": "tVvbbhs5D34XX/tCFEVKyqsUiyJts4sAQVpkkx/4UfTdl5zoMHYhQh05NyY9tr4hNR8p6jA/T98evrz98/nx+e/v/57uPv08fXl5fHp6/Ofz0/ev96+P35/l6s+T0w8IpzuAX+cTtG9Ovvn6Lcgv9C74dEci4umORSQR8kesf4zvP2W5FrZrAuHlC+mXKL/A+RTTu8ibSGIA/JK/VKs+v748POjfd2aK8T/uXx6eX093z29PT+fT/+6f3rY//fvj/nmTr/cv8qs7nx6ev4kUwL8fnx5U+3Xurd24qfcUSmvvU24AmGEWYuHuydebp5Bac+CL9jhuz8ylPUc60D46LO0juEPtfW3vh/c3/M9ApX32cKQ9pdo+5lH7NG4P4EL1QHTe+RBnbYCQoUIQYUNI0ywAB7kiuBgagkechQg5xwJBDntX0qUR4I2+dJXIOfgjNpB3lc3kd3S4tiEYbsjtCkRA190IFC4xaIyBkSsGJvRjDL4BRjSeKiLU6BQ97L3h+T4l1/o0jvs0GxkuVSt87jESME/bgFA7g/ZuXNngwbABOLUs62OD4Msk6y16QgotV+ySBaZLR7yRrlL2NdpT5jzGMCiKoTOjp2x0V51hEdT5BrGP1T/CkGRVMSCEMYZBUILYueX6Q4F0zBX2x1xhqoMAMuM6RozHMHL3JfP4saD/2C7NqZuRx2aYAZtqb5Bk1FHAomUFhsYvTP3BUpyHkMGwPRPkEYTlB/fEE2mY/NAY4LsNDB0gXgEY2ZOyq33JzvMwZQS3nroCrKeu4FdTV8D11GViTKauQMtxZpoxmXZsDO86xcfpz2KoFH/Yiz8YcdQKk8gt3GPmUZiQWYEixGaFBP8oWsmgKFDKrlXCGfKBkGcXUwtY54e+GA8lUIvYQBSHnlhjfIvXII50hENewLBiIqMC7QVojP2RhulJKfeKi32IQxMMZubcibkPkKuijbI1P62sSrsolVi5QOAb5E6+Qe7k5dzJN8idfIPcyeu5k2+QO6cxjJLNxJgs2Th/bHdMlmxWsKVdsO2WAK6DLRoUBd8XIgL5MQauh1sM6+EWaTXcIq+Hm4kxGW4xLfPLNGMy3GyMuVLFGlKwrUUw7pbbroaUZFDUE1ZPPEW3G9cuR4SEUyMj9+4Mjub7YjJtWFYkahwnHlphIeS28Jx3NcYfIXCN98y8irB/GgcRaLUfLASTVakS00vdM2RV9qusshDmGGEhzDHCRJhixCSCwYhZBFrth6OMYN8WPXm3LnXNCHBulRImxBwnTIg5UtgQU6yYhTBoMQ1By31xmBixPhEfd6Px78RI68RI68RI68RI68RI68RI68RIq8SwapvQKj0ONJwug7VpRDlWDMp5V2JRugIxFuU9NnL5kGBMUEjrVTxY+0azZTx4t1rHg7V3NFvI2yCTlTxY20eTpfy8N8aOiQ0yOSGYBzEm4DbIZCkNPn1wv07Owc0I5v5wGHbLbr9FMMINgs/aSJoOPsTl4MNwg+AzQWaDD3mdJKYhs3Fjg8zNpG2mYchtLp1xzDRrX0n6NfZ+3Z1duRo5rX0lyG2HDPYj+NUZGhPDu0ZW7wKNMazcGnvk7ayIf2JFP2PgMoytoA+1AlJuJx0cH+tPaLlsBcMtYyDUyszL2s8Qw9xZwkxtURLwGEbA0DDCLTDiQQzqC6zMRzHaHtm+vjvsy1EMcv3UGrh1DDyKEToGhzFGXo1a24oWccBGtFi7THNW2IMCQh8UwnhQsDYjyLcJBPkdyPWgYGOEtqOM++64xjBSqRCzbaImvgVGHmLMd2oyOtXapA9tpJXgS2NnrL3QbcpWCEJjjGhNU8k3DNpH/mGMIUEsBKbaG7LBO9wIAHOjiXNuU/bxeQOwNpooNUd254vSn1iR2hFNmT/g2Ar+2GMPcWPO+5KSlGHjHk3W0lZo9Q/vKjma3uCJUjdVKzyPrUhWJhVC1M6IsJtVXp2nh2SWcr14keWFIYjlC7Vjr3Gfj3/zxWAHALajJKL74TG4bcb3ofzgzg9Olyf6/pJv918fXy5f8PD6goX45kFPAIv0RWKRoUgqkouMRaYi87tEV2TBw4KHBQ8LHhY8LHhY8LDgYcELTk8WioQifZGo0yqRoUjBQ8k2gYsUPD2aGFKR+V2SKxL0MLxIXyTqcCYyFEl6KFAkFxmLzPo8zicGTWoifZFYZNAjWSKpSGmvTOeo726IFHuUcZx1xn4+RacrASKhSF8kFil4uuUfSc/bi2RNhOftbRnNjPq6zCbzu9QXZjYpeKBlV/KqiEcJVREXUlBFMBJVhasSq6Jv4WiUJ30PB8SR7DZyi6LIerA++6pgVUJVFFlPR2euSqxKqkouiizlNw2a5puGTQtNo6Zx02LTUtPaPWC7R1YNmqb3ULKIX03Te+jhSNBXmiBs/+Ot+FUtNi1tJaBquWpbLOnhINBoKpreQ4kBGlGS6lTTe+ipBtCogqj31bgqmt4jbW31Hmn7X960Xxr5L4/3X54eNHg1vN+ev9ZYlq+v//9Rf6mvc/14+f714dvby4PG/e6dLvn8JIOaB80L0C/Fs/d6ybdLMmn3US9hvxTOPuul0BuGM2yXtpe55K+fpGKL9Nf5/WdxKAmIpqH/AA==",
|
|
2099
|
+
"verification_key": "AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA0AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAACAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAANwAAAAAAAAAAAAAAAAAAAAf5fA0IA8t9UtV/sdBxsSWJsAAAAAAAAAAAAAAAAAAAAAACXnx3aDljcmoBO1KoTwmQAAAAAAAAAAAAAAAAAAAEbDrzlSo1IPW+3CWM7mEbHkAAAAAAAAAAAAAAAAAAAAAAAZwd3kLNRH9OmFuJrLYrMAAAAAAAAAAAAAAAAAAAA2dXz6vqlfZ2KxIfY4KUDcTQAAAAAAAAAAAAAAAAAAAAAADwUj9dSxEoe0Qd/x1VhEAAAAAAAAAAAAAAAAAAAAxZQ34Ll/6vCYNcz1TBbivakAAAAAAAAAAAAAAAAAAAAAAA+8jhKXw/+mNZy8CNgwnwAAAAAAAAAAAAAAAAAAAC1ZlJdu5oQbSFZ0uc8cvzY2AAAAAAAAAAAAAAAAAAAAAAAbRSJhnm7KfP/wPIbNBZoAAAAAAAAAAAAAAAAAAAC8ScGs0i94YTQqssqwr7Pn4gAAAAAAAAAAAAAAAAAAAAAAKIoxHQW2xUemMctC9D1cAAAAAAAAAAAAAAAAAAAAwfYM0FN0cbj22iYZ5vng9GsAAAAAAAAAAAAAAAAAAAAAACoOjsa6T65UQ3RZm/vSTAAAAAAAAAAAAAAAAAAAAIJelbhZLCjv/x3DsfZIxpavAAAAAAAAAAAAAAAAAAAAAAAeCUXvxVCssTKCSfjYe9cAAAAAAAAAAAAAAAAAAABf5aPWDGgxqn/liNTL7tk8WgAAAAAAAAAAAAAAAAAAAAAAKmfPb/+1vrcPp2J+l3NAAAAAAAAAAAAAAAAAAAAAE1XTA/JbYjyXIpbE5GbAy7EAAAAAAAAAAAAAAAAAAAAAAAKYgLMOrQG0ulrxhfONkAAAAAAAAAAAAAAAAAAAACrXSKj8r+19kz2qO4AjsthLAAAAAAAAAAAAAAAAAAAAAAAN4LNFYzEnFFSJcZhaY0EAAAAAAAAAAAAAAAAAAADg+5HSOJQIxAoAQrVcSSkbqQAAAAAAAAAAAAAAAAAAAAAADVm+zZDwuDuVrguj7J+RAAAAAAAAAAAAAAAAAAAA34RD4CY/7x6vQarrV/2yyVwAAAAAAAAAAAAAAAAAAAAAAAot+yK0pCzlx7efA+XTYQAAAAAAAAAAAAAAAAAAADKV5Skq5e58zJPucpMJ/0oEAAAAAAAAAAAAAAAAAAAAAAAlPhj9v98Uc9CgAq5ucpwAAAAAAAAAAAAAAAAAAABx5zYhN1wv1vbfLyCbbVTaYQAAAAAAAAAAAAAAAAAAAAAAFirzOUFp4ss0XzWfetIXAAAAAAAAAAAAAAAAAAAA2nMNAzJArrrdtiFD8Mw3d3YAAAAAAAAAAAAAAAAAAAAAABKRZzcRcvTTCBmsCocv4wAAAAAAAAAAAAAAAAAAAMwf9wXXtucX4DS+TfAJd0r/AAAAAAAAAAAAAAAAAAAAAAArR0Sk9uSVr/qDNYOwwIAAAAAAAAAAAAAAAAAAAAAL4u8aDZY0iN3CvpPEnUO8rgAAAAAAAAAAAAAAAAAAAAAALy6FhHQ5AlQE3jZIJjC1AAAAAAAAAAAAAAAAAAAAIfMU8f+qwI65mpET4UjGtoUAAAAAAAAAAAAAAAAAAAAAAAn9KLe+d38NNdKgU3pQWAAAAAAAAAAAAAAAAAAAALO5SHQF8TVOqt5WHiph25joAAAAAAAAAAAAAAAAAAAAAAAs0+jNwFjMCrQ27Z2Pc3UAAAAAAAAAAAAAAAAAAADKR4f6IgXlH0qVPhuTxCcfgQAAAAAAAAAAAAAAAAAAAAAACGhWMBuZlUgnlbj5yi5kAAAAAAAAAAAAAAAAAAAAPgd6IxqtXOEbHDsNMvR0PzEAAAAAAAAAAAAAAAAAAAAAABvfQPAxAXbXCG4uVMcMQgAAAAAAAAAAAAAAAAAAAKU6qnee8ftSPZDdDU9uGOrqAAAAAAAAAAAAAAAAAAAAAAAidtA/OXCEx0nJTda44XQAAAAAAAAAAAAAAAAAAACCfsHxE9rLWJgna0AfDJCyCwAAAAAAAAAAAAAAAAAAAAAAE+roeiNyWo84HyP9ivdpAAAAAAAAAAAAAAAAAAAAp/w8ZQlPoVHkx3UgnoFTOKwAAAAAAAAAAAAAAAAAAAAAACQcIPpoy0XgR0GxkLQuGAAAAAAAAAAAAAAAAAAAAKD53NlcHC5dCboWODgVo3czAAAAAAAAAAAAAAAAAAAAAAAsiOFAfnQAFYwghN+9nPwAAAAAAAAAAAAAAAAAAAAtHqbOjMptwXS5I2SoeiXk2QAAAAAAAAAAAAAAAAAAAAAACAi0TkbJ6+YYbeYETz1SAAAAAAAAAAAAAAAAAAAAYUHQkRtBUXBOK+fNG87NCasAAAAAAAAAAAAAAAAAAAAAABZws9r9SLgREgw58nOtigAAAAAAAAAAAAAAAAAAAAi74w6nw6v3NRRuALDCIb9TAAAAAAAAAAAAAAAAAAAAAAAQqJaghrvcE2s0fOZNBkUAAAAAAAAAAAAAAAAAAABVJUNukFaZVlq6rpSE0oFoFwAAAAAAAAAAAAAAAAAAAAAADJJ3IzXBbwqyXdM/GaerAAAAAAAAAAAAAAAAAAAAUaROIA7T6rI9CIGfcjs2xl0AAAAAAAAAAAAAAAAAAAAAACP9qsoM+RdsBQdpItpGiQAAAAAAAAAAAAAAAAAAAEwA7HQU+f5gTga32Z9xkDyyAAAAAAAAAAAAAAAAAAAAAAAEKg/yydJzRASFWKLYUxIAAAAAAAAAAAAAAAAAAAD1YxNKKiGy9P82SSC2ErvH6gAAAAAAAAAAAAAAAAAAAAAAIQZEsOmGVi3Rdk4H7ay8AAAAAAAAAAAAAAAAAAAADY/ZU5KIveELp7zGLr/MHjcAAAAAAAAAAAAAAAAAAAAAABDZzBDlD02pQoPl8e3EhgAAAAAAAAAAAAAAAAAAADWcLp5i2CJGaUkirntFLMAmAAAAAAAAAAAAAAAAAAAAAAAvbn/OxHWrWP1G7goCelsAAAAAAAAAAAAAAAAAAAB6xm+PBxfS7hc6WwIfdmC9kAAAAAAAAAAAAAAAAAAAAAAAAB2vuUSFaUyy+/iJv0koAAAAAAAAAAAAAAAAAAAAuLDdo8al7aOJRzOwLHfMq4oAAAAAAAAAAAAAAAAAAAAAABIkc72eQzkERVBVCQ0LLwAAAAAAAAAAAAAAAAAAAEerJvCOnokQFWI03trO+id9AAAAAAAAAAAAAAAAAAAAAAAnjgOMWCvk0X7w8fVOMCAAAAAAAAAAAAAAAAAAAABiuUD2th8fKtYdo/H78DqaIQAAAAAAAAAAAAAAAAAAAAAADG91fPLMghLGRZ5EUeO+AAAAAAAAAAAAAAAAAAAA1IxPaNgk9IAQoDcKgfQCLfUAAAAAAAAAAAAAAAAAAAAAAAj7WF8i/Uv4Ba60twzUCQAAAAAAAAAAAAAAAAAAAIEsY9z/xkjDbrXT+CiJVXPfAAAAAAAAAAAAAAAAAAAAAAAl+NfKZwZQBym/NQr41/cAAAAAAAAAAAAAAAAAAABUjXzVH1fFTgn2gV1TPOvXiAAAAAAAAAAAAAAAAAAAAAAAJjVnfRmRutG85wIWtnDpAAAAAAAAAAAAAAAAAAAA7NgljMTUOyEWyvFo4Elh+usAAAAAAAAAAAAAAAAAAAAAABkZAfrPMzniJkp+x0SpswAAAAAAAAAAAAAAAAAAAEU058lzpmN/qCzdHlhy+GfAAAAAAAAAAAAAAAAAAAAAAAAmROVnbZk30YtHDNjkNJEAAAAAAAAAAAAAAAAAAABNwHOTvaKidYILNPLrhi1jugAAAAAAAAAAAAAAAAAAAAAAINPWiXNC2BVP16iCcpTbAAAAAAAAAAAAAAAAAAAAPK4g+xaZkcXHDoBdZk5Z4YIAAAAAAAAAAAAAAAAAAAAAAAzaNiSnZfdPON18xZ9xewAAAAAAAAAAAAAAAAAAAJW12Le0pjsF32UrDRDvFG0mAAAAAAAAAAAAAAAAAAAAAAAJnjvVoKAKt/4YBAEFubMAAAAAAAAAAAAAAAAAAAAhKa86Y39aYioyRA+GDR4qfwAAAAAAAAAAAAAAAAAAAAAAABW40lFdduLM7Jnc0ZRZAAAAAAAAAAAAAAAAAAAAIiuIgQjcJdGqRQ4LS8ISw34AAAAAAAAAAAAAAAAAAAAAABuRdReSC609i8AclZUJKgAAAAAAAAAAAAAAAAAAAEghQcfr5CAAodWMy3Q4H20ZAAAAAAAAAAAAAAAAAAAAAAAwXomSsUju2yLm6ZIHeoQAAAAAAAAAAAAAAAAAAAB8hoR2GGgdwp2Kk2OrfEDhwwAAAAAAAAAAAAAAAAAAAAAAFkZaXMu1UM0sY71YEW/kAAAAAAAAAAAAAAAAAAAAQ5lzrBLXynltb+mMpA5sprcAAAAAAAAAAAAAAAAAAAAAAC4k1CD7+VCO0x3mkttHewAAAAAAAAAAAAAAAAAAACjt0afkbIQNnJQ/30VSHGTOAAAAAAAAAAAAAAAAAAAAAAAEPQY7Ewrfs3NCr0XQFVoAAAAAAAAAAAAAAAAAAACTMJUq50xXPRaG2ctKAHM4VAAAAAAAAAAAAAAAAAAAAAAAJhUixAiTMGRq/5ZzYZSUAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAEAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAACAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABm8RRw7rcqfzi7XSp7z2Q/KgAAAAAAAAAAAAAAAAAAAAAAANDU5h1d2YwF84wk0/QyAAAAAAAAAAAAAAAAAAAA4dTNmj44QaU9NIHOsJuhpPgAAAAAAAAAAAAAAAAAAAAAABVI+xVoTIdHXwJqCPFWcQAAAAAAAAAAAAAAAAAAAGvMegX/lalrKJQkxfczZw2WAAAAAAAAAAAAAAAAAAAAAAAAxDcm91tv2g3iLODg36sAAAAAAAAAAAAAAAAAAAAdCgnXF47JO614WPluZPC0jQAAAAAAAAAAAAAAAAAAAAAAL5tuC04sAZaN5cMkgqp9AAAAAAAAAAAAAAAAAAAAF6UyFPM7GtAJ5GGyaZJyGb4AAAAAAAAAAAAAAAAAAAAAABQQfUvkU8gEqOKRhpGbPgAAAAAAAAAAAAAAAAAAAJKHn2GoKCaTAlYbtX87FVfPAAAAAAAAAAAAAAAAAAAAAAAoRQUJTjXTtVikNALK2uI="
|
|
2033
2100
|
},
|
|
2034
2101
|
{
|
|
2035
2102
|
"name": "set_update_delay",
|
|
@@ -2051,6 +2118,10 @@
|
|
|
2051
2118
|
],
|
|
2052
2119
|
"return_type": null,
|
|
2053
2120
|
"error_types": {
|
|
2121
|
+
"361444214588792908": {
|
|
2122
|
+
"error_kind": "string",
|
|
2123
|
+
"string": "attempt to multiply with overflow"
|
|
2124
|
+
},
|
|
2054
2125
|
"1998584279744703196": {
|
|
2055
2126
|
"error_kind": "string",
|
|
2056
2127
|
"string": "attempt to subtract with overflow"
|
|
@@ -2081,8 +2152,8 @@
|
|
|
2081
2152
|
}
|
|
2082
2153
|
}
|
|
2083
2154
|
},
|
|
2084
|
-
"bytecode": "
|
|
2085
|
-
"debug_symbols": "
|
|
2155
|
+
"bytecode": "JwACBAEoAAABBIBLJwAABEslAAAARicCAwQBJwIEBAAfCgADAAQAShwASkoFLQhKAiUAAACMJwICBEsnAgMEADsOAAMAAigAAEMFAlgsAABEADBkTnLhMaApuFBFtoGBWF0oM+hIeblwkUPh9ZPwAAAAJwBFBAMnAEYAACcARwEBJwBIBAEnAEkAASYlAAAFax4CAAQBCiIERAUWCgUGHAoGBwAEKgcEBicCBAEACioFBAckAgAHAAAAxCcCCAQAPAYIAR4CAAUAKQIABwADbVJ/LQgBCCcCCQQEAAgBCQEnAwgEAQAiCAIJLQoJCi0OBwoAIgoCCi0OBQoAIgoCCi0OBgonAgcECS0IAAktCggLLQhFDAAIAAcAJQAABZEtAgAALQoLBTMKAAUAByQCAAcAAAE6JQAACL8MIgJDBQoqBQQHJAIABwAAAVElAAAI0SkCAAUA71JTTS0IAQcnAggEBAAIAQgBJwMHBAEAIgcCCC0KCAktDgUJACIJAgktDEkJACIJAgktDgYJJwIGBAgtCAAILQoHCi0IRQsACAAGACUAAAWRLQIAAC0KCgUKIgVGBgoqBgQHJAIABwAAAcYlAAAI4x4CAAQALyoABQAEAAYcCgYHBBwKBwQAAioGBAcsAgAEAC1eCYuCuje0O5mhMWEY/SDUL1FmyenxP7XqZaltHgptBCoHBAYcCgYIBBwKCAcAAioGBwgEKggEBhwKBgkCHAoJCAAcCggJAhwKCQoBHAoKCAIcCggJARwKCAoAAioGCgssAgAGADAz6iRuUG6Jjpf1cMr/1wTLC7RgMT+3ILKeE55cEAABBCoLBgocCgoMBBwKDAsAAioKCwwEKgwEChwKCgwCHAoMBAAcCgQMAhwKDA0BHAoNBAIcCgQMARwKBA0AAioKDQ4EKg4GChwKCg0EHAoNBgAcCgYKBRYKDAYcCgQMBRwKBgQFBCoMCgYcCgsKBRYKCQscCggJBRwKCwgFBCoJCgscCgcKBR4CAAcGDCoHCg0pAgAKBQABUYAkAgANAAADJiMAAAMSBCoJCwQEKggKBgAqBAYDIwAAAzoEKgwGCAQqBAoGACoIBgMjAAADOgwqAwIGJAIABgAAA2gjAAADTAIqAwIEDioCAwYkAgAGAAADYyUAAAj1IwAAA3YnAgYFAC0KBgQjAAADdgAqBwQGDioHBggkAgAIAAADjSUAAAkHHgIABAAvKgAFAAQABwAiBUkEHgIACAAvKgAEAAgACScCCAACACoFCAoeAgALAC8qAAoACwAMHAoHDQQcCg0LABwKBgcAJwIGACAnAg4EDy0IAA8tCggRLQoGEgAIAA4AJQAACRktAgAALQoRDQQqBw0GACoLBgcnAgYAQCcCDQQOLQgADi0KCBAtCgYRAAgADQAlAAAJGS0CAAAtChALACoHCwYcCgIHACcCAgBIJwINBA4tCAAOLQoIEC0KAhEACAANACUAAAkZLQIAAC0KEAsEKgcLAgAqBgIHJwICAGgnAgsEDS0IAA0tCggPLQoCEAAIAAsAJQAACRktAgAALQoPBgAqBwYCHAoDBgAnAgMAcCcCCwQNLQgADS0KCA8tCgMQAAgACwAlAAAJGS0CAAAtCg8HBCoGBwMAKgIDBisCAAIAAAAAAAAAAAMAAAAAAAAAAC0IAQMnAgcEBQAIAQcBJwMDBAEAIgMCBy0KBwgtDgYIACIIAggtDgkIACIIAggtDgwIACIIAggtDgIILQgBAicCBwQFAAgBBwEnAwIEAQAiAwIHACICAgg/DwAHAAgAIgJIBy0LBwMwCgAGAAUwCgAJAAQwCgAMAAonAgIAAwAqBQIEMAoAAwAEJigAAAQEeEsMAAAEAyQAAAMAAAWQKgEAAQXaxfXWtEoybTwEAgEmJQAABWscCgMGACsCAAcAAAAAAAAAAAEAAAAAAAAAAAQqBgcILQgBBScCBgQFAAgBBgEnAwUEAQAiBQIGLQoGBy0MRgcAIgcCBy0MRgcAIgcCBy0MRgcAIgcCBy0OCAcGIgNFBicCBwQAJwIIBAItCgcEIwAABggMKgQGCQAiBUgLLQsLCgAqBQgMLQsMCyQCAAkAAAd7IwAABiwGIgNFCQQiCUUMAioDDAYKKgYHCRYKCQwtCgUEJAIACQAABlQtCgQEJAIACQAAByojAAAGYQIqAwYJDioGAw0kAgANAAAGeCUAAAj1DCIJRQ0kAgANAAAGiiUAAAn1ACICAg4AKg4JDy0LDw0AKgoNDi0CBQMnAAQEBSUAAAoHLQgFCgAiCkgNLQ4ODQwoSAYFJAIABQAABs4tCgoEIwAAByoAIglIBQ4qCQUGJAIABgAABuUlAAAJBwwiBUUGJAIABgAABvclAAAJ9QAiAgIJACoJBQ0tCw0GACoLBgItAgoDJwAEBAUlAAAKBy0IBQQAKgQIBS0OAgUjAAAHKgoqAwcFEioFDAMkAgADAAAHRS0KBAIjAAAHbS0IAQInAgMEBQAIAQMBJwMCBAEAIgQCAwAiAgIFPw8AAwAFIwAAB20AIgJIBC0LBAMtCgMCJgQiBEUJBiIJRQ0KKg0EDCQCAAwAAAeXJQAACmEMIglFDCQCAAwAAAepJQAACfUAIgICDQAqDQkOLQsODAAqCgwNLQIFAycABAQFJQAACgctCAUKACIKSAwtDg0MACIJSAwOKgkMDSQCAA0AAAfuJQAACQcMIgxFDSQCAA0AAAgAJQAACfUAIgICDgAqDgwPLQsPDQAqCw0MLQIKAycABAQFJQAACgctCAULACoLCA0tDgwNACIFRQwtCwwKACoJCAwOKgkMDSQCAA0AAAhOJQAACQcMIgxFCSQCAAkAAAhgJQAACfUAIgICDQAqDQwOLQsOCQAqCgkMLQILAycABAQFJQAACgctCAUJACIJRQotDgwKLQgBBScCCgQFAAgBCgEnAwUEAQAiCQIKACIFAgs/DwAKAAsAIgRICS0KCQQjAAAGCCoBAAEF1RJ9KcLS6O08BAIBJioBAAEFXm0/LtzNhwk8BAIBJioBAAEFursh14IzGGQ8BAIBJioBAAEFG7xl0D/c6tw8BAIBJioBAAEF0Afr9MvGZ5A8BAIBJiUAAAVrJwIHBAInAggBAS0IAQYnAgkEIQAIAQkBJwMGBAEAIgYCCScCCgQgQwOqAAMABwAKAAgACS0CCQMtAgoEJQAACnMnAgMEIScCBwQgLQhIBC0ISQUjAAAJdgwqBAMIJAIACAAACY0jAAAJiC0KBQImBCoFBQgCKgcECQ4qBAcKJAIACgAACaklAAAI9QwqCQcKJAIACgAACbslAAAJ9QAiBgILACoLCQwtCwwKHAoKCQAEKggCCgQqCQoLAihJCQoEKgoICQAqCwkFACIESAgtCggEIwAACXYqAQABBeQIUEUCtYwfPAQCASYtAQMGCgAGAgckAAAHAAAKXC0AAQUAAAEEAQAAAwQJLQADCi0ABQsKAAoJDCQAAAwAAApSLQEKCC0ECAsAAAoCCgAACwILIwAACi4nAQUEASMAAApgLQADBSYqAQABBQUEG5kgr2BMPAQCASYnAAYEAgYABAYFLQAECCcACQQADgAFCQokAAAKAAAKxgIACAIIAAADCQstAQsGAAADCAstAQsHAAADCQstBAcLAAADCAstBAYLAAAJAgkjAAAKhiY=",
|
|
2156
|
+
"debug_symbols": "tZvbbhw5Dobfpa99IVESJeZVBoPASZyBAcMJPMkCiyDvviQlkWUvSmOrPTfur9ldf5HUiVK1f12+3H36+dfH+8ev3/6+fPjj1+XT0/3Dw/1fHx++fb79cf/tka2/LkH+xFwuH9LNJRZ+W+S1jFfqdszjld9Xfq15vI73rfZXgvGKlw8x3FwgRAZWghgm5Ak0AKYFpiVNS2oDMkyoA8pULjgA5RZNoEygATVNqAMaTJgWihP4cmDnkzgPUYAGiPMAAjQApiXBBBYETkLKOECy2qEMwGnBaanTIqnt0Aa0NGEqS5o78C0Su5rF1Q5lAg2IaUIbANMCdUCSy0EAB+RpyTSgSB8gAbZkzkZGvjxzt8gVJoglM0h6MzdKkUQpSKIyCtAAaeVcBcTCmS9ZLCRAA8q0lGnBacFpkYyVIMCWwo6VJhb2GSFO4LgKe4gSaQexsKsokZYiIBZ2DKVrdZgWnBacljotVSwcBTaxNAGxsGMoPQqDAHao0kwYBYZOlXGhllgGwLSAWNj5mkKPtErGuoUG5GmRjCHHVSVjKMqSMeSrmsRe+e5NvlyjAA0o04IwQJyvLNjE+Q7DQiFPkMs5UpLh0FiZgC9vUaCOj2Q46Ec5jI9kjlGQ4aDfkeGg30HukC0JtAEyYFsVEIt8WUZBh2mRUdABO8QQglGZFM2m7nYSDRKSsUBBiW0UhVIyMptMQINwkgQyqExCs0lHHSQqICRhUVISWxaSwAaZTUIbhIOixDaoTIpmk9gGiYpM3lFjQyWxycQcNbZOZtPYOuEkja1TmYRm09g6iYrkNGpspCSzdpCkRgluolslvIk4ESTAicUwulWXjoEqJtkF0FuAololYpAuPrAkR/8CuhXdWt2qS0VHGdoT0ZCCY3G0G6eQHfUWkqcUwbEaglvBrcmtya1ZnSTFZljkuzEpNkNpqYGyxHATKxbDFuYXclIsivoFcT3r+tpRpkFuXsVi2HU7urW5tR2sZEjJsU0sARyrYYyOaAh6C0mJrhwT9RakVUx2lFvIqh6LtnxHdVJWdsZiSG7VhpVlnTt/MEyqoAWRVigds1u1OBko/oKkWleRiWQoy9dEtza36sCBouWX3gIV68SqORvoVs3ZQDTUnEGv4fSyplgNi1u1oBqoeZBMVm3ugc1QB/pAt5Jb1V8pNmJTf1NUREP1d6Bb1d+BxVALRKlKGCVnSVLdNL+pKBZD9XegW5tbm1vJrKSVa0JFNIz63V7qBke3Jrdq1+ioXSM1xWaoXaNjd72jW6tbu+uSSeojq2N2tG5P5NY+skgq8ZAcpS1yr8/B0a0aUEcNSMo9xmKoAQ1shsWtxa2otwDFOoYeBI1tIBo2t/YBqdgHZEeJTWpNRpoYNTYpPBmbYXSrFIIT5W5ZdyApOpKhziUD3Vrc2mNDQZ1Lug8aW8cKjm7V2AaiocYm1S9jdqSJELKjW6Nbo1t7u1XZOfU9VFAkw+xWbbeO2m4D3YpuRbdWt2oUHTWKgXaLrIuaVOSQpfqLUopDLvrdpFgM0a39bor9blmxGfYbK+qubaBZS4iOeou+Y9RboKJaJVF9FZHCnVGtMkSKdnup2RmL4u/fN5e5df744+nuTnbOh70077C/3z7dPf64fHj8+fBwc/nP7cNP/dLf328f9fXH7RN/yqJ3j1/4lQW/3j/cCf2+8avD+aVS57VxOXMFkyjPNeK5Bu9z8pBA3rC5QnumAOcKSTYjKsDlhV1f4+s9kGq4e8Ar95kHeeFBmyFkbi8X2Mxji2d5xHONKtstVagV7focX+9DJvehxHbmQ1tkMrYpgTxrn2WSzhWgTgGg07ZcR5GTRZFrPu2Riw4BgLNH8WwVz8KIiz7JRVuZmQjg7ZEaPddI5xqkC5ZqEJdS5xqLnokhJfMjH/x4gxfWuXlfHc+9WPTNRjBHGO/f6Vyjrkb5DCQ175spvKFZc5xtwlP96TiPi+7JLTKTwYtvubqDFjgd6kuNYjMWb4USbGlgLaZRQzrTgEXf4B2BafCm0yTa8+4Fiw4Kba4/idph2nox+5frhwngtcNk7cXrhgm064cJ0LXDZNmokebsxxskPGvUtBhpFWBKVDiks8Fm90z1rHumVSRJt5YjFF7fzhxJiw4qez5bFxuvB6cii97BB0JS6HWRAOdlTsKVSIgWDu+fTmewVK9eolO7co1eBUJUwePI7bTiWnSQVLyjl4Ub65ZF86OlUM5aNi8WeiCwRYW32IcxG9+ggTYJchtvahSrgkMsWxqcgmgaGDc1bNwm3vHuamTTgLqnodupoYG4qWHLbOKt86ZGw3fQsJxCCnsa4PkA3PQDmvWPFHf98AWfn1buaaRiYz8hbGrYPJhy3NaAd9CwnGbYHLfZx23eHbc12ZirZbNdms3rXLJsjn2qcx7LIdCpxj+s+zbo+Fg2tLOJHRerQ8s2kfEDytNNIC5WfbRCqh5Gfn1LIADRAzkvYHC1cUq5+mg5tkp+rrFa8rncmKtcyPVcY+VH8ZmwEG1pYKOpgRT2NHivM0d+DS2eaqwbplq5L8+sTkvcuhLhJ+lWz9V02Ma9FMnvUFnW8g6VZcWrK8tar6wsV4G8trKsdHVluXaDgrtxqMZeurHuHWhjv+Z4uu9oq6pQn9n1jPIDlM3ZtFY7seB+f+7Iqpvy/tii4ZL5tNZuq7Tackt0GCzPN8dt0UWLPpNVBT5yP19s1xpWaPPD37qpYcOt8OPQPY1g5+blePL+Jg2wzUs57mx3/YDFBmjtR3E/CPc0UphjjnHbD4slRbg6Hylu5jSh5YMLs+v9qLTphy23PClutkvO1i45t10/LB+5XJ+PvChw23KdTL68HDReHmOH9A5n4SFffRgeymppsEKbHwDXTRFIs4MAHB62/L9IXc2G1XoIP303kRdnwEtH+PDYMkKHav2lI+s1ChB9jaLTeizG1cllqOS1VIt0+pxh9ayCg/WzKT6Laecqq80U+kFKjaePK/7JE1+5Ax5K3ReerHLSyBf/g8LL1llLBG+bsCVBnlI6zqqvl4BQwPZBWPYk7DAHAu15oT9cGkM3tS2JbKslHGvLN0m4F3wAsSdhB2xQYt2SKLa75Y0Q7Umk8p4SeS+dxTo4YNzq4IB2DsRHfJsS9kSPJfYaFe1Z2rtI5C2J1KyE4mMp3JSw2ZPCVjoTgS9LeB5IXD2neOX6GK5fHZdzjp8A8XqxN/PZwsgScO3kuSvhP7UB+RnVngS4RLx6Ct+VeF0Bt5TwFoFAmxI258DmtHUIZFfitXVorv/mOKv6y/Vx4ns4z+Ol7bkXtPxNhZ0sAp5qLL2wRz31+HO0tyhY3VhjCzsKEKL9AuCYyzf44KfnxyP8TYW45QPYXq0eH7y9yYfmCnHLBystKj/D21Ow1tztUYcoXij8ye9uP98/Pfs/zt+i9XR/++nhbrz9+vPx8+HTH//9Pj+Z/wf6/enb57svP5/uRMn/GZT//JH5mWGm9ufNJfK7EuCmRJJ38qGcf3PFJG/l0xzpJkP887e49j8="
|
|
2086
2157
|
},
|
|
2087
2158
|
{
|
|
2088
2159
|
"name": "update",
|
|
@@ -2145,576 +2216,69 @@
|
|
|
2145
2216
|
}
|
|
2146
2217
|
}
|
|
2147
2218
|
},
|
|
2148
|
-
"bytecode": "
|
|
2149
|
-
"debug_symbols": "
|
|
2150
|
-
}
|
|
2151
|
-
|
|
2152
|
-
|
|
2153
|
-
|
|
2154
|
-
|
|
2155
|
-
|
|
2156
|
-
|
|
2157
|
-
|
|
2158
|
-
|
|
2159
|
-
|
|
2160
|
-
|
|
2161
|
-
|
|
2162
|
-
|
|
2163
|
-
|
|
2164
|
-
|
|
2165
|
-
|
|
2166
|
-
|
|
2167
|
-
|
|
2168
|
-
|
|
2169
|
-
"
|
|
2219
|
+
"bytecode": "JwACBAEoAAABBIBMJwAABEwlAAAAQScCAwQBJwIEBAAfCgADAAQASy0ISwIlAAAAqicCAgRMJwIDBAA7DgADAAInAEMAAywAAEQALc/6U80Ocdp7SiJnezNCv8O5BD9Qgb6lg2itAI6qbzcsAABFADBkTnLhMaApuFBFtoGBWF0oM+hIeblwkUPh9ZPwAAAAJwBGBAMnAEcAACcASAEBJwBJBAEnAEoAASYlAAAGTR4CAAQBCiIERQUWCgUGHAoGBwAEKgcEBicCBAEACioFBAckAgAHAAAA4icCCAQAPAYIAR4CAAUAKQIABwADbVJ/LQgBCCcCCQQEAAgBCQEnAwgEAQAiCAIJLQoJCi0OBwoAIgoCCi0OBQoAIgoCCi0OBgonAgkECi0IAAotCggMLQhGDQAIAAkAJQAABnMtAgAALQoMBTMKAAUACCQCAAgAAAFYJQAACaEtCAEFJwIIBAQACAEIAScDBQQBACIFAggtCggJLQ4HCQAiCQIJLQxDCQAiCQIJLQ4CCScCCAQJLQgACS0KBQstCEYMAAgACAAlAAAGcy0CAAAtCgsHMwoABwAFJAIABQAAAcAlAAAJsykCAAUA71JTTS0IAQcnAggEBAAIAQgBJwMHBAEAIgcCCC0KCAktDgUJACIJAgktDEoJACIJAgktDgYJJwIIBAktCAAJLQoHCy0IRgwACAAIACUAAAZzLQIAAC0KCwUKIgVHBwoqBwQIJAIACAAAAjUlAAAJxR4CAAQALyoABQAEAAcAIgVKBB4CAAgALyoABAAIAAknAggAAgAqBQgKHgIACwAvKgAKAAsADBwKBw0EHAoNCwAcCgsHBR4CAAsALyoABQALAA0cCg0OBBwKDgsAAioNCw4sAgALAC1eCYuCuje0O5mhMWEY/SDUL1FmyenxP7XqZaltHgptBCoOCw0cCg0PBBwKDw4AAioNDg8EKg8LDRwKDRACHAoQDwAcCg8QAhwKEBEBHAoRDwIcCg8QARwKDxEAAioNERIsAgANADAz6iRuUG6Jjpf1cMr/1wTLC7RgMT+3ILKeE55cEAABBCoSDRMcChMUBBwKFBIAAioTEhQEKhQLExwKExQCHAoUCwAcCgsUAhwKFBUBHAoVCwIcCgsUARwKCxUAAioTFRYEKhYNExwKExYEHAoWDQAcCg0TBRYKFA0cCgsUBRwKDQsFBCoUEw0cChITBRYKEBIcCg8QBRwKEg8FBCoQExIcCg4TBR4CABYGDCoWExcpAgATBQABUYAkAgAXAAAD2iMAAAPGBCoQEgsEKg8TEAAqCxADIwAAA+4EKhQNDwQqCxMQACoPEAMjAAAD7gAqFgMLDioWCw8kAgAPAAAEBSUAAAnXDCoWBwMWCgMHHAoDDwAcCgcDAAQqDwkHBCoDDAkAKgcJAxwKCwcAJwIJACAnAgwEFi0IABYtCggYLQoJGQAIAAwAJQAACektAgAALQoYCwQqDgsJACoHCQsnAgkAQCcCDgQWLQgAFi0KCBgtCgkZAAgADgAlAAAJ6S0CAAAtChgMBCoRDAkAKgsJDBwKEgkAJwILAEgnAg8EFi0IABYtCggYLQoLGQAIAA8AJQAACektAgAALQoYDgQqCQ4LACoMCwknAgsAaCcCDgQWLQgAFi0KCBgtCgsZAAgADgAlAAAJ6S0CAAAtChgMBCoVDAsAKgkLDBwKDQkAJwILAHAnAg4EDy0IAA8tCggRLQoLEgAIAA4AJQAACektAgAALQoRDQQqCQ0IACoMCAkrAgAIAAAAAAAAAAADAAAAAAAAAAAtCAELJwIMBAUACAEMAScDCwQBACILAgwtCgwNLQ4JDQAiDQINLQ4DDQAiDQINLQ4CDQAiDQINLQ4IDS0IAQgnAgwEBQAIAQwBJwMIBAEAIgsCDAAiCAINPw8ADAANACIISQwtCwwLMAoACQAFMAoAAwAEMAoAAgAKACIFQwQwCgALAAQnAgUEBScCCQQDACoFCQgtCAEEAAgBCAEnAwQEAQAiBAIILQ4FCAAiCAIILQ4FCCcCCAQDACoECAUtCgUILQxECAAiCAIILQ4GCAAiCAIILQ4DCAAiCAIILQ4CCAAiCAIILQ4HCCcCAgQFACIEAgUtCwUFJwIGBAMAKgQGAzcOAAUAAyYoAAAEBHhMDAAABAMkAAADAAAGcioBAAEF2sX11rRKMm08BAIBJiUAAAZNHAoDBgArAgAHAAAAAAAAAAABAAAAAAAAAAAEKgYHCC0IAQUnAgYEBQAIAQYBJwMFBAEAIgUCBi0KBgctDEcHACIHAgctDEcHACIHAgctDEcHACIHAgctDggHBiIDRgYnAgcEACcCCAQCLQoHBCMAAAbqDCoEBgkAIgVJCy0LCwoAKgUIDC0LDAskAgAJAAAIXSMAAAcOBiIDRgkEIglGDAIqAwwGCioGBwkWCgkMLQoFBCQCAAkAAAc2LQoEBCQCAAkAAAgMIwAAB0MCKgMGCQ4qBgMNJAIADQAAB1olAAAKxQwiCUYNJAIADQAAB2wlAAAK1wAiAgIOACoOCQ8tCw8NACoKDQ4tAgUDJwAEBAUlAAAK6S0IBQoAIgpJDS0ODg0MKEkGBSQCAAUAAAewLQoKBCMAAAgMACIJSQUOKgkFBiQCAAYAAAfHJQAACdcMIgVGBiQCAAYAAAfZJQAACtcAIgICCQAqCQUNLQsNBgAqCwYCLQIKAycABAQFJQAACuktCAUEACoECAUtDgIFIwAACAwKKgMHBRIqBQwDJAIAAwAACCctCgQCIwAACE8tCAECJwIDBAUACAEDAScDAgQBACIEAgMAIgICBT8PAAMABSMAAAhPACICSQQtCwQDLQoDAiYEIgRGCQYiCUYNCioNBAwkAgAMAAAIeSUAAAtDDCIJRgwkAgAMAAAIiyUAAArXACICAg0AKg0JDi0LDgwAKgoMDS0CBQMnAAQEBSUAAArpLQgFCgAiCkkMLQ4NDAAiCUkMDioJDA0kAgANAAAI0CUAAAnXDCIMRg0kAgANAAAI4iUAAArXACICAg4AKg4MDy0LDw0AKgsNDC0CCgMnAAQEBSUAAArpLQgFCwAqCwgNLQ4MDQAiBUYMLQsMCgAqCQgMDioJDA0kAgANAAAJMCUAAAnXDCIMRgkkAgAJAAAJQiUAAArXACICAg0AKg0MDi0LDgkAKgoJDC0CCwMnAAQEBSUAAArpLQgFCQAiCUYKLQ4MCi0IAQUnAgoEBQAIAQoBJwMFBAEAIgkCCgAiBQILPw8ACgALACIESQktCgkEIwAABuoqAQABBdUSfSnC0ujtPAQCASYqAQABBa6Sj2upjpKMPAQCASYqAQABBbq7IdeCMxhkPAQCASYqAQABBdAH6/TLxmeQPAQCASYlAAAGTScCBwQCJwIIAQEtCAEGJwIJBCEACAEJAScDBgQBACIGAgknAgoEIEMDqgADAAcACgAIAAktAgkDLQIKBCUAAAtVJwIDBCEnAgcEIC0ISQQtCEoFIwAACkYMKgQDCCQCAAgAAApdIwAAClgtCgUCJgQqBQUIAioHBAkOKgQHCiQCAAoAAAp5JQAACsUMKgkHCiQCAAoAAAqLJQAACtcAIgYCCwAqCwkMLQsMChwKCgkABCoIAgoEKgkKCwIoSgkKBCoKCAkAKgsJBQAiBEkILQoIBCMAAApGKgEAAQUbvGXQP9zq3DwEAgEmKgEAAQXkCFBFArWMHzwEAgEmLQEDBgoABgIHJAAABwAACz4tAAEFAAABBAEAAAMECS0AAwotAAULCgAKCQwkAAAMAAALNC0BCggtBAgLAAAKAgoAAAsCCyMAAAsQJwEFBAEjAAALQi0AAwUmKgEAAQUFBBuZIK9gTDwEAgEmJwAGBAIGAAQGBS0ABAgnAAkEAA4ABQkKJAAACgAAC6gCAAgCCAAAAwkLLQELBgAAAwgLLQELBwAAAwkLLQQHCwAAAwgLLQQGCwAACQIJIwAAC2gm",
|
|
2220
|
+
"debug_symbols": "tZzRbpypDsffZa5zAQYM9FVWqypt01WkKK2y7ZGOqr77sQ3YX3IEO8OXvdn8xjPz/2wwYGC2vy5fHj79/Ovj4/PXb39fPvzx6/Lp5fHp6fGvj0/fPt//ePz2TNZfF8f/8TldPoS7iy/0MvHf1P/WZq+x/6XX+e4CLva//bXP7S9A/4uXD94RBE9AShDdgDigdkjDkoYFhwVLhwwDcocylAt2qPyIwpAG1AbBhQG5g4cBwwJ+AH0dyPnAzoNnqB3YeUCG0iGFAcOCw4LDws43wA7sfIPUgZ1vwI+oDLVBZOcb5A7eD8AOMCzivAB3HfkcA/ctEMQwgBwL1E0x5Q7oB2CHPCx5WMqwsM8NagdJD4GunNjnBvSISI2ZuMEbYAdwA+KA2iEMSygdIn8dGHKHNCzoBpBjkWJPmdPYM9DXE79VQn+rlP5WxfYWOj8A22eQm5c/g578SZGAPWzAFko2ZA+RP8O5gTQ2kB1Dfosda8AW6lNEtlBrIPcpQ+YBhIWhdvBsqQw8pijkzA/NnqF2CMMShiUOSxwWHk0ZGNhCjmUeTZmcLxxpA4o0k4eFI23AFnK1cCLlzMAWcqzwKGgwLHFY4rCkYUlsoSgKZ1RxDGQp5FjhjCrAgB04o0pgGDo8CsTCQ5ihOjeALeR89a5FWrnFmqV2gGHhFisUV+UWK4WBLJX88Y6Dr56Jo++kNpboxN+ITCzSqWePdzyYOqktqS2pjWeDWoTIVitTDkpqK6CEg7g1OqVO3jmlqMSzpOPgvOeJznlBsQIjBEOzBjBERZmoOybFZFaZrjuKGC8MHuURUVCsvHz4LFYULIrFrCUrVm+YBoJzhgdrVWwRZ0F5BDc2tIirYFEMZg1ZMXrDpNgibniwVkWJmBc535Ypz60OErEHQbFy64BE3NGsFQxxYJCIOyZFb1bO+4Eixq0eJGJeBwnFyk4GWWQbpmBoH0CzolmzWWXBbShLbkdUlGW3YzLUB0cXDfkRvJL6KAtwx6wIZgWzBrMGs/IQpO4VLIpJPouCRVEqioa8OFDnCCa1SmwgTkpsDatZq1qT9FDHpOjN6g/WqgjRsChKTnY0awRDe3DyhvYItAejPQLtwdkeke0RPON4rhAIs2I1q0QsKGvkQLMmQW51RPkA5yQ23Yaiy+mJ0pIdcWB23tCs3qzSkh2rorRkx6IoLdlRH5ylJTvKI3iIZEmCjvIIToJcnKE8IgvWgaU5yTNMaU42NKsUkaEKoqLMGlzG+CI91NGsMsgaSvNFL5gVZWQJyoo40KzerDI/cEHkZWWkMcMo80PHohjMKm3WUNqsI0cRufmqzA+R26xKRnU0qwychtLdEQWxI83l0bAqerN6szZ/ZZPR/OWC3slM0DErRrM2fwVltDSUIcK1HSG3WeK9iZP25dKP1hNviAO984Zm9Wb1ZpXpKgVGcbKhrC1cORKiYjJrMmvb9TSUnVCSnVVUlNTomBWrWataobmOgtizGsA7w6QIZm0jq2FVlCxJsrGTOaphNGsLqKEEVGQT6A2rYguooVmLWWWFTNxZUEMfeoR5YHBgaNY2IBuiosSGshXlrdFAfjCX7xRaNDQrF/MdZUFBEMyKkkYNZS7paNZiVomN9wiEVX2Q2DqWgbLZG5gVZbHsyLGhbKBbbA2TYjBrMGs0azSr9BtG2YTLI7JgVkxmlY5tKB3b0azZrNmsxaw1GpaB6PQR2FznJECpVng/RMif5R0RoFQrHc0qT2soT+PdASEqyoM71oGyBxtoVqkneQNFKI8Icvwg1igoVjmLkHHB2yZCsXIUWcZFzr9/313GUcvHHy8PD3zScjh7oROZ7/cvD88/Lh+efz493V3+c//0Uz709/f7Z/n74/6F3qXAHp6/0F8S/Pr49MD0+86+7eZfLYX3TvJt2ltlFUivFfxcASOnhyjQDvegUF4pwFwh8LwrAgGjfj/76z2oMDxIMc48iAsPyggh0rxiAlut6HHWijhXyDgEcrbvR3+tB7R6jyyotDOZeVAWreh5G9xakVbUWSvWuQLkIQB12o+rGLwKVFplp7m4SAVeR4YPdDo3C8IvsjFV3pm2dnBgfUEz82uNsIqEC60WCc07c41FTqILQf2IBz9u8ELTutJyPvdikZelAmhmY51r5NX4HoGEUkzB3dCt0Y8+oSVpOsL9IjmpR0ZjUAWazqZnCrP0XCkknv+bAroyUwA4neAQzic4xPMJDulsgq+9uC7BIZ9PcChnE3zZrdcleHD/aoIf0jMfc+v6BC9BO6SUaYKHRXbyEdsIg+5pVKK8TouwSAsoYymkuvmwlr5py3Q+vQOeTe+1F9eldyjn0zvUs+m97FRfx6xFZ5Y469S4WAIywJCg052DBOwkZ43TEimuVtSocdR06JE3TsRFctJ2wY1RxidSMBVZZAadrvPOvYk4mFfdEVcizqsnju4wpiL5dNUYy8mycRVIrRksjlhmTqRFcoRkSZ523ajO3PBp2hbr7ECv2RF9mGVHWmQpHTWNRKdDpePs5W/RCKZRphrL0ZIS6GjJcRrKKkcLuJEdxGHeHvkdRksq7zBaUj09WtCdHC2rQK4dLQinR8s/9CyqH4UusmY9i6uVvoKWTTXMs3StgVouUB9vaiQ9wjiO/Fs0qAm8aqDf1MijPei0M+xqRNWAvKchR71dA3FTQ091Ah1yb2oUfAcNbVM6ZNnTAGsPOo3c1CiaH3TZu6uhuR4g7mmEpGM/IGxq6DwY6Oh6VwPeQUPblE7I9zSijdu4O26zlqZ0Q7DZL0XndSruN8d+zWMei87VvVUfve6dcL5gl9WhU9RprNAN+2yFKqu6VAv1fBj3+ZYwMGkYpU7DWJ2HOqc1lIvHUR+vd6PodriWXKabhaWEDrZ6PJx+I1EX631JfsyjJYXjOMHXGqs9YNHKhW+gpxrLUGoNVru4aXLV1d6JttVaYlP9MC086qrW17mn1sMO7vWeui7yMzm9NUl+UXUsNbxWHdQ/eVNDq9pE91t7GsdYMuxpgFZy6Vjm3xaLJjpp5NOxwKKiXMeSLJaKexrBjZWacNsPjSV4ON0ewW/2S9CpNNFKt6mhxz+kUc7HkuumH3XMhLQH2uzbGLVvYyy7fmibxhROt0dcVB11eYgUbDd50Hh7PfQud0zvccm0OojyWv3w72c2RSCMBOFfssxFwK1msqwZAodb+TdH2EtH6OxbW6Qeiqi3jqzXSkC0tbJODyv96sLJu1zt6KT4Or+WXR2NuWQHBrRBLnOVRUQBbXeb/fSW5J88sQrC4eE8+40nbjlunJ1J0eQ2ve1eXTx5AD1yPFYy/9ci5bqzeUjzVl3ePaHdPWHcuXvypVpRdmjRt9m6lnCWq25LolqK1eNKdb0EOD305J8S7knoiQO4uueF15+DEJYtiagVCBwPom+SMC9ol7wnoadAkHzekkgxq8RxeblFIqT3lIh7zZk0wQH9VoID6mEFnUNtSuiOlCT2OhX1avRdJOKWBG089WCvZNyU0NWkuq3mDBVsmcZ5ID750/WCO18tLOccO+7wfk/CaaFAEnB28tyVkN+Edwl0mxJgEv70FL4rcV1Bu5SwHjn+Ju82CZ1zYHPaOgSyK3FtXb46Hz0/zrL8f1n9YPJw+e/zGy9Wey6IWm0BTjWWXuh9RD7+4PUWBa2jsy9uRwGc1x90HNvyBh/skBcOZySbCn7LB9C9az7eDt3kQzEFv+WDlhaZLpr2FLQ3dzPqEMUbhT/p1f3nx5dX/67Ab9Z6ebz/9PTQX379+fz58O6P/34f74x/l+D7y7fPD19+vjywkv3jBPSfPxJt2FKEP+8unl9FvEsY+BW/yWdpdL3KL/ndiOEuYvrzN7v2Pw=="
|
|
2221
|
+
}
|
|
2222
|
+
],
|
|
2223
|
+
"outputs": {
|
|
2224
|
+
"globals": {},
|
|
2225
|
+
"structs": {
|
|
2226
|
+
"events": [
|
|
2227
|
+
{
|
|
2228
|
+
"fields": [
|
|
2229
|
+
{
|
|
2230
|
+
"name": "CONTRACT_INSTANCE_PUBLISHED_MAGIC_VALUE",
|
|
2231
|
+
"type": {
|
|
2232
|
+
"kind": "field"
|
|
2233
|
+
}
|
|
2234
|
+
},
|
|
2235
|
+
{
|
|
2236
|
+
"name": "address",
|
|
2237
|
+
"type": {
|
|
2238
|
+
"fields": [
|
|
2239
|
+
{
|
|
2240
|
+
"name": "inner",
|
|
2170
2241
|
"type": {
|
|
2171
2242
|
"kind": "field"
|
|
2172
2243
|
}
|
|
2173
2244
|
}
|
|
2174
|
-
|
|
2175
|
-
|
|
2176
|
-
|
|
2177
|
-
|
|
2178
|
-
"kind": "integer",
|
|
2179
|
-
"sign": "unsigned",
|
|
2180
|
-
"width": 32
|
|
2181
|
-
}
|
|
2182
|
-
}
|
|
2183
|
-
]
|
|
2184
|
-
},
|
|
2185
|
-
"visibility": "private"
|
|
2186
|
-
},
|
|
2187
|
-
{
|
|
2188
|
-
"name": "message_context",
|
|
2189
|
-
"type": {
|
|
2190
|
-
"kind": "struct",
|
|
2191
|
-
"path": "aztec::messages::processing::message_context::MessageContext",
|
|
2192
|
-
"fields": [
|
|
2193
|
-
{
|
|
2194
|
-
"name": "tx_hash",
|
|
2195
|
-
"type": {
|
|
2196
|
-
"kind": "field"
|
|
2197
|
-
}
|
|
2198
|
-
},
|
|
2199
|
-
{
|
|
2200
|
-
"name": "unique_note_hashes_in_tx",
|
|
2201
|
-
"type": {
|
|
2202
|
-
"kind": "struct",
|
|
2203
|
-
"path": "std::collections::bounded_vec::BoundedVec",
|
|
2204
|
-
"fields": [
|
|
2205
|
-
{
|
|
2206
|
-
"name": "storage",
|
|
2207
|
-
"type": {
|
|
2208
|
-
"kind": "array",
|
|
2209
|
-
"length": 64,
|
|
2210
|
-
"type": {
|
|
2211
|
-
"kind": "field"
|
|
2212
|
-
}
|
|
2213
|
-
}
|
|
2214
|
-
},
|
|
2215
|
-
{
|
|
2216
|
-
"name": "len",
|
|
2217
|
-
"type": {
|
|
2218
|
-
"kind": "integer",
|
|
2219
|
-
"sign": "unsigned",
|
|
2220
|
-
"width": 32
|
|
2221
|
-
}
|
|
2222
|
-
}
|
|
2223
|
-
]
|
|
2224
|
-
}
|
|
2225
|
-
},
|
|
2226
|
-
{
|
|
2227
|
-
"name": "first_nullifier_in_tx",
|
|
2228
|
-
"type": {
|
|
2229
|
-
"kind": "field"
|
|
2230
|
-
}
|
|
2231
|
-
},
|
|
2232
|
-
{
|
|
2233
|
-
"name": "recipient",
|
|
2234
|
-
"type": {
|
|
2235
|
-
"kind": "struct",
|
|
2236
|
-
"path": "aztec::protocol_types::address::aztec_address::AztecAddress",
|
|
2237
|
-
"fields": [
|
|
2238
|
-
{
|
|
2239
|
-
"name": "inner",
|
|
2240
|
-
"type": {
|
|
2241
|
-
"kind": "field"
|
|
2242
|
-
}
|
|
2243
|
-
}
|
|
2244
|
-
]
|
|
2245
|
-
}
|
|
2246
|
-
}
|
|
2247
|
-
]
|
|
2245
|
+
],
|
|
2246
|
+
"kind": "struct",
|
|
2247
|
+
"path": "aztec::protocol_types::address::aztec_address::AztecAddress"
|
|
2248
|
+
}
|
|
2248
2249
|
},
|
|
2249
|
-
|
|
2250
|
-
|
|
2251
|
-
|
|
2252
|
-
|
|
2253
|
-
|
|
2254
|
-
|
|
2255
|
-
"error_kind": "string",
|
|
2256
|
-
"string": "attempt to multiply with overflow"
|
|
2257
|
-
},
|
|
2258
|
-
"992401946138144806": {
|
|
2259
|
-
"error_kind": "string",
|
|
2260
|
-
"string": "Attempted to read past end of BoundedVec"
|
|
2261
|
-
},
|
|
2262
|
-
"1998584279744703196": {
|
|
2263
|
-
"error_kind": "string",
|
|
2264
|
-
"string": "attempt to subtract with overflow"
|
|
2265
|
-
},
|
|
2266
|
-
"2967937905572420042": {
|
|
2267
|
-
"error_kind": "fmtstring",
|
|
2268
|
-
"length": 61,
|
|
2269
|
-
"item_types": [
|
|
2270
|
-
{
|
|
2271
|
-
"kind": "field"
|
|
2272
|
-
},
|
|
2273
|
-
{
|
|
2274
|
-
"kind": "field"
|
|
2250
|
+
{
|
|
2251
|
+
"name": "version",
|
|
2252
|
+
"type": {
|
|
2253
|
+
"kind": "integer",
|
|
2254
|
+
"sign": "unsigned",
|
|
2255
|
+
"width": 8
|
|
2275
2256
|
}
|
|
2276
|
-
|
|
2277
|
-
|
|
2278
|
-
|
|
2279
|
-
|
|
2280
|
-
"length": 48,
|
|
2281
|
-
"item_types": [
|
|
2282
|
-
{
|
|
2283
|
-
"kind": "field"
|
|
2284
|
-
},
|
|
2285
|
-
{
|
|
2257
|
+
},
|
|
2258
|
+
{
|
|
2259
|
+
"name": "salt",
|
|
2260
|
+
"type": {
|
|
2286
2261
|
"kind": "field"
|
|
2287
2262
|
}
|
|
2288
|
-
|
|
2289
|
-
|
|
2290
|
-
|
|
2291
|
-
|
|
2292
|
-
|
|
2293
|
-
|
|
2294
|
-
|
|
2295
|
-
|
|
2296
|
-
|
|
2297
|
-
|
|
2263
|
+
},
|
|
2264
|
+
{
|
|
2265
|
+
"name": "contract_class_id",
|
|
2266
|
+
"type": {
|
|
2267
|
+
"fields": [
|
|
2268
|
+
{
|
|
2269
|
+
"name": "inner",
|
|
2270
|
+
"type": {
|
|
2271
|
+
"kind": "field"
|
|
2272
|
+
}
|
|
2273
|
+
}
|
|
2274
|
+
],
|
|
2275
|
+
"kind": "struct",
|
|
2276
|
+
"path": "aztec::protocol_types::contract_class_id::ContractClassId"
|
|
2298
2277
|
}
|
|
2299
|
-
|
|
2300
|
-
|
|
2301
|
-
|
|
2302
|
-
|
|
2303
|
-
"string": "Value does not fit in field"
|
|
2304
|
-
},
|
|
2305
|
-
"4440399188109668273": {
|
|
2306
|
-
"error_kind": "string",
|
|
2307
|
-
"string": "Input length must be a multiple of 32"
|
|
2308
|
-
},
|
|
2309
|
-
"9791669845391776238": {
|
|
2310
|
-
"error_kind": "string",
|
|
2311
|
-
"string": "0 has a square root; you cannot claim it is not square"
|
|
2312
|
-
},
|
|
2313
|
-
"10135509984888824963": {
|
|
2314
|
-
"error_kind": "fmtstring",
|
|
2315
|
-
"length": 58,
|
|
2316
|
-
"item_types": [
|
|
2317
|
-
{
|
|
2318
|
-
"kind": "field"
|
|
2319
|
-
}
|
|
2320
|
-
]
|
|
2321
|
-
},
|
|
2322
|
-
"10791800398362570014": {
|
|
2323
|
-
"error_kind": "string",
|
|
2324
|
-
"string": "extend_from_bounded_vec out of bounds"
|
|
2325
|
-
},
|
|
2326
|
-
"11692359521570349358": {
|
|
2327
|
-
"error_kind": "fmtstring",
|
|
2328
|
-
"length": 40,
|
|
2329
|
-
"item_types": []
|
|
2330
|
-
},
|
|
2331
|
-
"12469291177396340830": {
|
|
2332
|
-
"error_kind": "string",
|
|
2333
|
-
"string": "call to assert_max_bit_size"
|
|
2334
|
-
},
|
|
2335
|
-
"12913276134398371456": {
|
|
2336
|
-
"error_kind": "string",
|
|
2337
|
-
"string": "push out of bounds"
|
|
2338
|
-
},
|
|
2339
|
-
"13557316507370296400": {
|
|
2340
|
-
"error_kind": "fmtstring",
|
|
2341
|
-
"length": 130,
|
|
2342
|
-
"item_types": [
|
|
2343
|
-
{
|
|
2344
|
-
"kind": "integer",
|
|
2345
|
-
"sign": "unsigned",
|
|
2346
|
-
"width": 32
|
|
2347
|
-
}
|
|
2348
|
-
]
|
|
2349
|
-
},
|
|
2350
|
-
"14938672389828944159": {
|
|
2351
|
-
"error_kind": "fmtstring",
|
|
2352
|
-
"length": 146,
|
|
2353
|
-
"item_types": [
|
|
2354
|
-
{
|
|
2355
|
-
"kind": "integer",
|
|
2356
|
-
"sign": "unsigned",
|
|
2357
|
-
"width": 32
|
|
2358
|
-
}
|
|
2359
|
-
]
|
|
2360
|
-
},
|
|
2361
|
-
"14990209321349310352": {
|
|
2362
|
-
"error_kind": "string",
|
|
2363
|
-
"string": "attempt to add with overflow"
|
|
2364
|
-
},
|
|
2365
|
-
"15764276373176857197": {
|
|
2366
|
-
"error_kind": "string",
|
|
2367
|
-
"string": "Stack too deep"
|
|
2368
|
-
},
|
|
2369
|
-
"16431471497789672479": {
|
|
2370
|
-
"error_kind": "string",
|
|
2371
|
-
"string": "Index out of bounds"
|
|
2372
|
-
},
|
|
2373
|
-
"17531474008201752295": {
|
|
2374
|
-
"error_kind": "fmtstring",
|
|
2375
|
-
"length": 133,
|
|
2376
|
-
"item_types": [
|
|
2377
|
-
{
|
|
2378
|
-
"kind": "integer",
|
|
2379
|
-
"sign": "unsigned",
|
|
2380
|
-
"width": 32
|
|
2381
|
-
}
|
|
2382
|
-
]
|
|
2383
|
-
}
|
|
2384
|
-
}
|
|
2385
|
-
},
|
|
2386
|
-
"bytecode": "H4sIAAAAAAAA/+19eXxdV32n3n3bfct9ixZLsiVZi+VdjuRIT7I2L5LtJHgjjh0nTCcViep46tiOYmchnbaGsrQDrTeGdvh8CmQjLYQQSCn0w3Shpf0AeVOGMiwhzJAyZQgwNBQy7TAMVI717jv3nvP73XPu/V1bBz3/kc+L7r3fc85vP79zzu9EL5x/19On5k7eOXvffXfcM/+fmaOzh86f/cCOuWPHjx87OjVz/PilunedfXz73NzMQy/UFS+eO3/hrzrr8H+ROs9X6uSAIlRABhVQlAooRgUUpwJKUAElqYBMKqAUFVCaCihDBZSlArKogHJUQHkqoII30NknDh47cfT4rBxgkRqwXgKwYoS3yUE2UFGvkQqoiQpoGRVQMxVQCxVQKxXQciqgFVRAbVRA7VRAHVRAK6mAOqmAuqiAuqmAeqiAVlEB9VIBraYCWkMFtJYKaB0V0HoqoA1UQBupgPqogDZRAV1HBdRPBTRABbSZCuh6KqBBKqAhKqASFdAwFdAIFdAWKqBRKqAxKqBxKqAJKqBJKqCtVEDbqIC2UwHtoAKaogKapgLaSQW0iwpoNxXQDVRAN1IB3UQF9BoqoD1UQHupgPZRAe2nAjpABfRaKqCbvYHUUlMHqQFvoQY85A147uK5c95AL9Qdnl8qiMbiiaSZSmeyVi5fKNY3NDYta25pXb6irb1jZWdXd8+q3tVr1q5bv2Fj36br+gc2Xz84VBoe2TI6Nj4xuXXb9h1T0zt37b7hxptes2fvvv0HXnvzwVsOnTs3PxD3OssLjTvPPj518sR9py+efWL62NzsnaeNs++/8cTp2aOzc48eut470o24v48off/rz7i/r1Nr/5mzj11eITq/3sZ58ubZ4zOnj90/a6ohHeYRUmoIdWc/eLkvd82cnpk6eeohe0ivY/vEgM/3nBn48eoPtlXXW899iPnleI/rvRon6l4XePzFs4/uPXn/BXa0tlBw2Gk17Pr5BcFjJ2bmHpr/aP+pd9rAj26/665Xh2+3xLTw1I0n7nr1rwFFI+JqvNqE3Tw/ZmOBGgv/G2UZ43gSY7vseBJ3Scu8nE+5aRxhm3Y9M6oi5XoSrTy5h+dMTI04JwLLzbYQ5Wb7z5HcxCjlJobITZyxMa5HCfvR0+5HSfvRhxca3RfYKD3DIxiqRvmxg6dPnjovVhnD7X6mArq/abXvC+7vdzLflyTSOu7vd6l9z/V/t9r3HP1usL9/5JB3xiXh/vzGx3cdmz1+1191tmxes+XU736+8YW13V/b9ucf3HSp9Uerxl/4+A3ve/nHn/kXwbhvqnxYN/nH0dvvfubHJzO73/T0A89/dd8Zq23mUyvf9vjtnz6/8qU73uL+8DX2hwCF6gBK71HjdNT9/V5VOXZ9v0/te45T+9W+j7m/P2AT7gu3/+Trz+YvvuHBd3zi4ZG1DTMfvPjlH3znbz73ofwPX3zq3i8PuT98rQfFK//i7g9vtj/89tvf/Wv5py+8t3ND+ZXE7t/53h0/vDE+8nz5V1r/8o0/eenli+4PDzItRt7Ufd+7Uu+I7P3UG/uezaY/9dL29+yYKn/uN35rZf6D73F/eEvlw/XjqZcf/61ffXPdN97/3d/+P+s/ua2v2LG9uOmL7/7SihNzr2t92f3hITXitrm/P8yo0YC6bNwqSWLuwyNK7XLW4zbJdrkPb5f8cMMTN8+ePjN3QuzVk26vHq16RIeDNKsvOP6eqvpWYQPpJ3bee2bm+H1sGzbWvP+76cw9p278JRsuvffsY3tOztxl/yFR/ejxea80N8u3nBC3bLqHxsQLwg9S7g9S1Q8eu9zP87sqtLzirMv1e85+YNd8n44dPXH5D+/8+JnTx44fO/3Q7tnTh678mufZ6dkHT79Q13z2qb2z95yce2i+jbn5qSQbb0BP0uCTDPgkCz6xwCc58EkefFIAnxTBJ/XgkwbwSSP4pAl8sgx8AnOhBXzSCj5ZDj5ZAT5pA5+0g086wCcrLwvWfNrlnlPHZ6/YA93+zzkj93qlNKiE+dihgc0j+F+9e3ruXMUk2WTvZCNjYMLSyU9YOqv2pGLLRBF2Jwj55J557t9y98wJ1krtdcxeK/a0+tFh21rdDAF38X2NVMN7ZPRd3MMuCdIImuuSI02XewbVhcx7u1VzMcrz3m543ttFNO/txmnlbrZHdTIFNNvDN9vDjtvFhlXsMwCy90MV6WUiAhH6KoEU997Ny8UqO3aDmlzFj2KV26ff6R5Ld5XRsgIBy243y7bHAwoJnC3cuzCYExAlUk7TwSNMC4ieKtePLgDfyym6KcHy1KMHz7ze2aBRtStQpkckJ/ZHqK1L32/bukMQvCE0otNsPAZ1bCGUnY/zBeM5LOrPwzzPM8rJmFvmZi4nY3jzk8FSPTLJhDq3QKURc6rW8cgP1M1pBjanaSJzmuEtQhoxp1m1Mb8MNZvlm82y43axwWKfAZA51JxmWTBeMHPP/SZvqyxWjIBWLX4gltuiPvcb7vFkKE1qhk/iiuQ3eENpxrq6jF+WtYMqPIdbM9nXggpiHY9gqWnQSh4hp6oM3LqLy1s99y6IdnnAXUVYM82Ldb5cbwvhf+KYlmJlyP3QIVXuh2kZ74BbFje7U+xrEKRXvJ8R+ZznHvEO+AVmMAUH/GkJc5SxneOI8MP5NZp9J50WvfrtZY/61BXcV6dc+09dYvu698xx4eyjE/7Icn6UYT/iPZtkKq0It5e/HOkABjyoKnaDESrnv5koOs/H6JUVA7FtrHPbxjq2xxWROuJM/zHv1PFWn+kXwikH5WxXcRv8SQFkroWI0YKAMjDV+YOsHOXtjLxA8zLPfapifD7OM71wNZhuqbO2YLP2LT5ZC5n5w/x0hTXAVyj13DWiVH4xUeqIHKVAKS06pdRkf3LkrVeaItzCAzQoAdzNAzQqAczyAE1KAAKLv0wJ4E4eoFkJ4DgP0KIEMMMDtCoBHOMBlisBCHa9rFACuIsHaFMCuIMHaFcCuI8H6FACuBfLMcoAzGEJOxmA0zzAKiUAQUKiVwlAsHdptRLAv+cB1igBnOQB1ioB/BIPsE4J4EEeYL1kCCnIMWxQavuMIPCIlCO/UfES34K9RISLgPKeGdSNopxXBMt5bXzuO7af/K+gxxPklzaquf1J9fzSRji/FCHKL21EVlIMNzX62K5xM8Q+1mUDzfXxzfUhk84+1omTQzbSQzZpMfBWesheesgeLdizqsbxxczx1VoI0Qp6yDVa2Mt2LdjTqwV79LCXK7SQy+VacLxXC4UMQS676SFbtBi4HiFrjxYxkR4c1yNkXbdUI7fWWkxUi4kWoSVq0kIuO+ghN2jBnu4wQgMwkdrBJVKL1Z+WICfaUY6cDZzw3M6nD+Fk6qbQz/xucndnE9szMNG6SfK05Lr+sedezP/eZyHGbuIZu6nKWOCj69DsLEfEfjUiToDHkK8DjyFvAo8h99vHkLl+XafaLxUaMq1w6sE8Xe+PMRikSQ+Z9wdZ2XIrsgsbwc2N3H4HZoPJldWZshFTWRFR3Cc0oK7EVvgrIpbKishGtmscY5mn9QoLMBsRWWEgG+ghG+khm+ghl9FDNtNDttBDttJDLtdCiFbQQ7bRQ7bTQ3bQQ3bTQ/ZoYTZWaWGCQ9DxXi04vloLIWrVwmw0aSFEa5aqJerRwhLpEQzWnO6iZk8IOr5Wi4GvW6ox0bowQgP4vAuW2swLUptW2Yhg+6qlkgeDfB4Azor0qWIrZ0X60I2aYMakTzK1uWn4+ev+5u/Mf+cvZy2f0MJSm4opxH4wtbkJTG32ganN6+DU5ibVfqnQkGkFy/yv98cYDNKkh8z7g+RSmw5HDaU2j/CpTWZs1eSm4FBc2cjYLyRUzorZuVPucDz0JF9Fq7S4HDk0ZZ+urXx2Izs+13HVDubDy5vhAeIXRfvlmW/TAhIVy0aD3eEC3OH0qycl7cGzfQXPnKVt4CbkrQL8ltQZtU60gIEMl9xHjhmvA564LvKCXkR0J8W+5upTEfE3ir4sr+5vOmCfUiTKwnfgtHI326nWbA5qVlgEC7Y3MpOGPrTuRacjhuBUra9srBeFRrZS+Yq1KmLc6x5PByJWiiSOqYtVJyxWHURiJeBvh8ziTic9E64qIMJNmUNcO7HNADIAR7CwWAbgABZ6yQDsw2JKGYD+wOvtOR5hQKkLp3iAzUoAD/EA1ysBDAhP8xm7bZOyjfOMEdaCA4IdwScDbsEusq9BFXUOI/FDEVz5rpR6KUc/5SyV+rFqqdSDd8/Mzd51cPbOudl5SkKlLgfBJ0Pgk9JFpXKR80HbJRArCT4xfZRczV8KUCrzcnCpUP9fcRtBF+k2AjO8bQQmEsDk1ZoFS27m+Wbz7LhdbBhmnwGQI2gAk2fBeOMwUjYO8QrMNAsmCIb5kQzzIcwBzt5YLMHlmWMh9sZEKGghgqzI1Ki6IOdhQbaIBDmP0gqWpzzKdtMf23FI2MbIEvaay0CXhjLAjXmYyJgJZYEZt4sNI+wzAHILasyGWTDemG0pG/fykjEiYcxG+JGM8MbsOC4+A943rpo4MyQQSjzCiBrCMI+wRVUgvCrxlY0HIFKXwFJ8Cxj7BJwtlYsP29BvwMsnhhfJFJdgJFMgimQGJSKZIdlIZlAgIkNl42288g9KKP8gP5JBXvnfdNUjmZ/39sLz0nH9I7VBNFIblGANLtY/D5A/B/Fk8echnhwkcilCWYDjySGJeLKEupRBFkwUdRgf4iVjSMKlDPEjGeJdyh9wJjcv4SWFjhcWZAuhoCBu+yjYrJ+4LV8ubrKhP+ar7LVguNlKk1PYLQJ5BTHLVgeBsGSQexiChTMl28sTtXdNxyevPjaH9mCdHALtAIK4n0NkVLyECS04gCzSHO7Vslh7Q0TtDUm2d7XHZxG1Z7GvuWxeljJKyCJRgsC4fhUMo72M67Rwq1yxzYZ+AQvfMSJw3rwUegRTgiOYLFEEU8IFJmBGrOAvI1ZCMmIlCHI0SEZstGx8J8yM2D+4R1Si1K7S1VNjW1W9lfifQOb7UeLhcjFmQ7+CKXEJJZCFjGpawawycb68ag15fjSMBgmcWsDWaTR06zQKW6cRIus0hiqXY1372YV17e2z9w1sHpmeX9R+6NTpC2f/4IbZmVPb5+ZmHmLoNgZfojl64ezjV14/L1j+HSkIr0+8JG4myzVjy5nw/VJB/PfhwiUfnfL4BH+KxB4jRLHHCPsaBOl1EcuowFJky9Gk900sFiJaU3jsNY/tyiYAbjnodUJ1yFzi4N3H3QbJLz2nPOmZD0bPfVT0hIb1yP45MGGhlJVSy9BEvqFuNQfDz0oNqmWlhtTG/D+UcjnMuLkI6EnP6dMwGtM5Zp+iiCHaiYYCKp67xMV00RV8Kpow1HJIcMAFuXmeeYZrUfDc8pD3nWCWcJ2p8AMbfB12KRgnGjlKQubYNoEhQrd0ytjULtHJg1R19x5Pma5ydHPg5HAdcj/lIM9uZhwVngyqUsOD4aly4Zs2+DDGcHDbeo5XvJRnyNyF5nnlbaQJxtlDZFkAPx4DyQIMEXmMYXyq4jfOHi7PWx5wjygeaV/+VCHWzmFNZcXfdAHx9qBHvA11jTTiNllWAGwz8R0NSDZTsL8mRbTZKfvo9LH73c7T2wTnLl+l5Z49eH9m8jcdlyQMTeoJUUDBXOssMm/R19hh8BcxfhWJ+FVkX7tKa7jcjvIUZUOpKoGRqZHMBv4XsWtSZQDeiy1JywCs4wGKSgAfx+4llwH4GBZEyACcxRK8MgC/gG2ykwFYiyWuZACu5wHGlAC+zQOMKwHcwANMKAF8ggeYVAI4zwNsVQIQnAffpgTwCg+wXQngIg+wQwngZR5gSglAENrtVPWIHMLuYBvnbZxdvOPYybbistnT6ja72hQcbU4TRZuC0UwjTmMXO2h5yF2ykBzXdhFxbadonEwrLq45O4V0+Tp6Kqygh9xED9lND5mlh7yeHjJHD5mnhyzSQ/bRQ3bSQ3bRQw5qAbmRHnKYHnKEHnKUHnKMHnKcHnIzPeQEPeQAPeQkPeRWLdzZNnrI7fSQO+ghDS0g+bVqo/oTzBwafHuGXObQgCGxvN8WQcJH7urmSJ3E4tUnwLSi91qGIUj25cqFizb4J7FaECZG/xRY1eEIUtUhghT9Mpi6DkivMhA9FCtUOHr1OHxVgcwM+34ewFACOMoDmEoAuwScTpdjAzZNP8u3EFNqgbukIo4sHSXU5pkb1SfzCXgyHyeazCd4gYqDC2lJtmucsCVZvgLNJfnmkoj8MpBr6CE30EP20kOuoIdsoods1YKWEXrIFnrIZi3Yo4dcLqeHbKSHbNcCMgRRN7RgTwhyuZYeslsLp7tcC/b00EOu02Lgq+ghr6OHXE0PGVuqYZahReS2Rgt7qUcUbKhcpmioTTQN9VmuEf5ligaaNnFRI8Z2jaMj8zSq0Fzcc0trFO2jYxPn0wubOKdnX3/m6J6TR8+duwQcVbpBvEXS2AC8PyV+Pxq5JNr2iO6J3CC3yfJKFjFSyeHkp8VJnsHAh3GwHdf8ae109SeYjEvzHEvLJePSIKRwY2OBbN/djdhZBBmA0aAb9/YG3bh3MOjGve1BN+7t5gHWKQFMB935tye8Le51+xblFnf8NC5c/rOE1urMKuyolyz/2UsPGaGHbKGHbKaHbKWHXEEP2UQPuZwespEesl0LyBBE3dCCPZYWoh6CjvcsVR3foIVC6sGeBi0sUUQLS9SkBS31kMtmLTjeUrNEZJCr6CFz9JCd9JB5LSCL9JBdWrCnTYtebqSH7NNCiDbRQ67TguPrtBB1PUxwvRaivk6LXupByxBEfVALUQ/BXq7WIr5cq0VSJ4RJSghTqRDSy+C8pySqXMXcOykq9B97JXBR4AMqZUy3qGIrrz1tcXdnC9szcF2K7VhpEO7Y5u8/eH7b+LqfQEzYwvN1i+dS/yi6mIVUxJAiYqW47wJglGnX+STGU3HhSZxt/ErRnKnANWr3KtGQaYXTDpvCt/ljCww45Q+wsrOAkTxGvRbL3gKvaqwF8daL/+ddPVRQOzJTJSky/iGueugQ897CPa78ijZ09Oxnrn9nn7rS31df33/qEsMVV2lKYQfEZSnjhk2QL3PdL7HDZE0MNtCF8cC9LV0ukwUQkKNOukKdVV/6k+Q//+HvxD7ylZdPPvDK+ouf3f2OP/3A+IVy3+SvH/zmf/z+XoQ6l6t5AYNCRjyMjzjNj1iBfC4hGpZQIkWnm2Ff47YUwE5OsVx2Tt3JIY5smGiDxQhOq4CO3fJn+0fcbBhlnwGQY2jVWYdn4dV7rBxfzkvGaIUStyq49FHGP1zZ3BZvQmInWaGA5dfhdIKGeRZYSc4+thsHZ2FbgGO7KYdwCS42LZy1wXuwEqQg8zN8QcGCp3PvF0mM/RHqH/vL8bW2OzgENVAA6CFjxPpFYX4BC/Pn+9QX2Eph2yVB6hfs7YulQYcbvQKx0y1T/QHEH7SI/eFZxH7P0H5EGGTtkeDzFq/wDPxScM1CCo6+RtnYHkL0KjQP9mUC6QtfR36c+RBEFPZln0RftiJ94a/XmmQ+DFqR7+agFfkOB63Itx+ryCelF2msJJ8UQlxgmwrlzK/YJh40yDHcjuzimBdndRQAjaO78jlv2u94jRtIrGz+F3sgN/ocyG4hcPwdNvCeoFUbDvEAUSWAXw5aU+GBEGsqtKiH0trWVAjh7HoIZ4uiWvQyhNNkMS0GrscJ+xDOrhta0DKEY8eb6SEH6CH1OLS/ZKto6HIqvHauFTnXGmW7xtGReZpWaG6RnWttDv9ca7Pfc63hhcHt+ofBaTQMZp72Ea2YMZDd9JBr6CGX0UM20kO2awHZSg/ZSw9p0EM20UMOaKGQIXA8Qg/ZQg/Zo4XZaNKilxEtetmrhRCFwPHlWvgeg0teJ6o/+xWCqYRc8jrhLz6TH3d/WNF8og14f6/4/XSdejTfphLN13H7VRjWOStdcG8yKxSJyuYXWA5SRHKQYl9zhdwJZAKSVpsDvEV9ApKGJyAJoglIGqUVXKQ7zdOReQrWDCnwzRUQ1hQkLLZ/yAg9ZAs9ZDM9ZCs95Ap6yCZ6yAF6yG4t2KOHqPfQQzZqIZeNWnC8UQur3qMFx5drwZ52LSBDsESGFuyxtBB1PWKi5loAUwtgagFMLYCpBTC1AKYWwGjLHj1EfYMWtNTDEjVooZB6uDM9wn895LJZC4631CwRGeQqesg+esit9JAhrPdso4cs0kPW00N20kO2adHLbVr0cpMWQhQCx3P0kHl6yC4taBmCVR/Uwl5ml6pChmCJNi5VS7RVC/bktejl1qXqx9dpIeqmFia4Uwt3tk4LHW/TgpZ6BNartcgarNViATaE1FMICbIQtiG2CyugJf4vVnXkckOee3Lf5t5ea1Q6JNhsbKpiO+lQAbapYLfEtODqjsn2DNyIbEoWif3hnn2feOvXvv+/IAaZPIPMKoOAj/Ddy0FvQ30zWCQ2DRaJNcEisVm4SGxatV8qNGRa4cTcpvBt/tgCA075A+SKxBqserkPAzDSCx4GiPDtYfUBU47XBNX3Ej9lSr1e7Q6Fd3bfUjcY1/zsftAj4WAkLDxAwowbM5SQpUILbiYcyiAoMJzMIbp2q09du3LqPplC/JCsUMDy61DgoC4zy99DvtCyXXAzCQYqCaDAZAxX+UTZ/KQN3owdSDJgMeYKbma8DaVcwc2MoMtmOdnmXXDTBOgRkRhRSlRw05YtUcHNVDnZFdjz1SEFN9Mca0yWSzT+LYHGS7A1ToVe/jglF6IFscYplFZwsYoUT0fm6ahCcCd5fDROBullYWuANcAaoAMQKolNEUyk5Mxv8IZssH3YzQwJIuol2Nc8Ie2eebvpDBJD7HP0jfPXmXLygB1DPA824F20GxxRVhRDZLAYIltO3mL36esSseBh1X7HWKKKiGL+vg1+GycaGdTnpdgXBRL3pFQkkyGKZDLsa/KQac+4NYXOdNKO3omixDsZqXMXCGD13+s+ENN5P4dth16D1czvUIh9Ugh1O9jXYIsYNEMVV48Ts3CcmCKKE7MorVzUsNiucXS0PB2VxTdmIYzRAfCq+ThGXF0NZSkbysopA0V4YHsATsoIm7GqPopT4Bx07ZLr3xj/aV5N/cbcYxyrdKvO/WQcEakJlk+uZ5MI47ay9HA928bQQ0zvOje961g6VBzAN5zJdOadOs6I5yRcZI7XxJyci8xJBBvnwWa9gw1RBJYrm2+xwS9hcSh4DjijfP3hfNj3ewKppkvT5AIngRaT4CsLd7oi3A3NCsLtiJqQqDOLqUXKI+jE7HYGDWdziI08ohBRIffhmQhH0khAlQm9hHEGDqjSRAFVBp1OOgqKfWShoNhl8k3NnLrvzPF5rrgqhDGUFNYIy0QuCMqADUDley+C+CuB2mQHoArEF53Q4v9zVSFzE926GtYkhViTNG9NFhBvV7cXlm0v9iL2wtVghu0zF9kxfUbmVxmv+VXaPb9irZALNwPphEwPkCsSUx6ykLGjsS/c/pOvP5u/+IYH3/GJh0fWNsx88OKXf/Cdv/nch/I/fPGpe79cgof56mRGOBLSWJbjIBmUhVhHRb/eqG4dc7B1tIisYw6dX7mokUe9Vp61XUBzeb65PBJEMpBxeshRMkivWWwNsAZYA6wBLnZAbJ5iieb4C1/uwe7LAxd6FO/LS7CvKdx1YYW+fcAK/64LC6dVwNjEUkr6MOOGAwS4vBq6xJFzyKXgdkczSq8SlTzRT0POfDKsu8b6wmfgTDDxF/e39SteNh+wwXPcRIRdLATKVRu8pC302nnT0ILwLzyLqap7ZY54FDQqcYW9jgwjh1GexDwkJOim1AZww2uV52Bxnpj39rZh8Z2lv2iDt2M7fEFpi4l2rTKNQkKKWpWIQ/JFotrNLpz62Jgc97cmPt/yalsAHwaFPBJQyBvJhbyaQJP2V9Kybyrs/o5Vs55Q91HJ8N6/OuC9kSMmsxlUqC2DEsyPh8f8mB/mxzyZb6LMj6CpdPB+V+yat6nAZiEqVs6t3syPAMyP4syPlM0dEsyPhcf8iCfz8RME8lGKwVKFYz7jMZMeRzjk+xn1FI0YKhpRT9Xdx4gGtvpp+KQuuzDx0YWFiVebWViZOHdOYe3AfpIF7jVswFcPxKsXDQqG2nvvkyG790lkqI2yeQjZ+8QepFgYksJxoGjo62DR8I8D4ddkco4B09jYIpNue2VMLNsRP7LNXqzpDghjEnFsAo1jwcu8LVmHlRAogVU2Z70dluUnnhOuEzD9QkiU4x5aEgE1tO8jgRvmXNk8LuFWrfDcas7TrebRnTRQ2kSUwWCogp3CjnlsQFCZitlWnLOfTHOe88ucKEL0IkEeTUbFsJxKHtvbAScXcuElF/KeYlJAc1bAR0XRUX1MEIqOiQYyK8srBHwxUExibHPV1JObO3kJC6uY5s44XhMZjv/AHE72vxttWAz+24xVkh9QJqBdiGFyX6htowy2jVLeuEkpRI7ZDYmejnA/zLK0lff6WYl4JIfGI1mWAUKxfwzJq+VY46+yACGV884F0OGIeDB/6EuHE+HqMNQRYJQWbqnyZfPDEvFT5ufMMVqoY8yh8VMezWdlFfYlSlmJjPcBrYSfPKnpHXAPC4/Lm3/urRZp9FSL/FEYx/lBZJtrFtsFbCClaYKJtQWLddZTrIUWOti8TBDv5Vh6YQUnsogMJpiCEVBKWZBHUVwMX6WeR4nDeZQYUR4ljmbEuStwma5h3qpPQZcTcg6wmx5yDT3kMnrIRnrIdi0gW+khe+khDXrIJnrIAXrIFi10vEcLuQyBls1ayGWvFla9RwurrofZ6NZCISNa6PiSlcvlWgQwBpbD7yfaF9nPvuYryJcfdz+w5Pn0wpLn9Ozrzxzdc/LouXOXgEXNG8SLmvEe4P294vcTdZcExxJHuMVP9mEPcGhQuF5ahy0BphSWmGII61Lsa4qbsexU+n6VzeOKVTEvqk9ZE+FvHsd38MG15xJoobisQrJHsvZcLz1khB6yhR6ymR6ylR5yBT1kEz3kAD1ktxbs0UPUe+ghG7WQyxCM25oae8ggl2sx8HYtIEMwG4YW7LG0EHU9ApjmpRpttGgRwPRoERPpIeq1aGOpRRu1SUptkrIY5bIWBdei4MVISz1EfYMWtOzRgj0NWihkZKk6Cj2cbggDb9aC4y01S0QGuYoeso8eskgPuZUesp4eMqsFLQfpIdvoITfRQ27XQog6tWBPnxY6HoJCbtNCx5esXOboIfP0kF1LVccHtdCerBbuTA8d36jFwNu0cGedWhi3Ti1ouU2Lga/TQtRNLUxwpxbubJ0WOt6mBS07tfDjq7VIPa3VYk03hPxlCFnWEHYvgynRiOjuOPtkw2FhPdD06wPXfH4nf/58oUnB0QZTFds51gqwTTy7JaYF7gpOpmfgsQe2Y6VBuGN/e+Dv7vzah98HXjaDX+orLwxYoX3FO2cvIKUnHE9iPBUXnsTZxq+Um5gKfC3gBSUaMq1w2mFT+DZ/bIEB9/sDrNymyEgeo15+an0LqptK3rsuqiu0pZw+yhQeu/YdGiunjy+qDk2U0/cuqg6NlNP3e9eKE1RATVVlGRmFgd2EkFJozpAbIncEzEC8hmIZlbS614jBnsEgOhAXQ2nFHQ9kusbR0XYO4N0jisdTa4A1wGCAcEUmWV2Em3GUfg4arnIFHe2q7fYVJenfBenjr+5+vJw5ZoO/GztvDp8wfvTgmdc7G814BinCayjsj1ggwSUU6ffa7uYQ2ABAD0NiRKZoupLApitmOf04z/8U3VXXKX7uADulVOgF2lNy05UgTimFT1d8X1ScEFcESIV9UfFNYV5UrHg19bRbmqYrveEK1e5kKed6toufldl/2F1B9HFRccbPRcUpts/wIf5d3GUIzAQo5XVRsem8qDjBNoFcP2ziFxULeuB+xZEqwGUhZV9UPPnH0dvvfubHJzO73/T0A89/dd8Zq23mUyvf9vjtnz6/8qU73ordx7ydvag4hchAIoA7vSp3HgfNURTVrWMWto4ZIusoKAaaAalhsV3jYhjmKXgFsKAYp4WERQzkOD3kJD1khB5yiAzSKzSuAdYAa4AOQO5ZgrWTWPZnCktFxYkSanH2NYWblxS9R0bddWXCv3kpg9KKqxON8S3rKUICP5lFGFMDrAEuMkA4sg2evsqwKniN7R6f7MqAd934vmQyc7sNnsNuxYsBdzA77nyA1i6jAcvmZ4LcUCos1Wj/3IHyBJeQmPcNyhlwN4XhfSfsDuE9hpkpG7zN11qX8OY9plHgs6jszXMiQYuWM11yNyiDN71EwfzlAtGnxe32XoX7k4uwgEY9BVSw2BRl8np+pBq3NEk0GowqmDab9j5vUTUcuiO4RTUzgN2iKnP3awSnbji3qKbFKdVIwc9NkwWFoZmeDMFvUTVxhsxbn5HaLap1S/oW1Zuu1i2qMpsaoqgvg61nsGu/Mzd436Lqq0J0RrSmi0SkBhuXIEuVoFPNgHEj4lQz5cz+q3AvPeJUM55OFU8Hy6dXsqiKWqjLdaRYfCgwdoeq4R1hZtENAj5JgERuFnbvIDw5yIY3ObA8xSSHJtSAj/B7ZgVikndEmsiMwvITxUzxISdrMrymjnEEer/qZgLG5gwLdypk7vG+DM5ENsap7Ms12X65ZdO5Uont8gjLvqVhwTU9BTf9qI+9y/iFeVFR1oWhFxagmH6kCxPcOLPBx/VWAYkhO9RY0KYeQ3bAMWSBKIbs4GlWAGPIIbZrHIuYp+C54SG+uSEkZcVAdtNDrqGHXEYP2UgP2a4FZCs9ZC89pEEP2UQPOaCFQobA8Qg9ZAs9ZI8WZqNJC4VcU2MPGeRyLRwFf0alo/qzXyHy6UDa62df8xVMyY87tJu6Olao3dQ15OOmrhXBbupiLkIHt4gXUDo/jswdClh7KaL2Uuxr4U0o3qT/hMKhVJjKgcUg+lHtwSB76SEj9JAt9JDN9JCt9JAr6CGb6CEH6CG7tWCPHqLeQw/ZqIVchmDc1tTYQwa5XIuBt2sBGYLZMLRgj6WFqOsRwDTXoo1atFFzZ7VooxZt1KKNWrRxdWiph6hv0IKWPVqwp0ELhYwsVUehR0wUwsCbteB4S80SkUGuoofso4fcSg8ZwkrKNnrIIj1kPT1kJz1kGz3kJnrI7TX2kEHm6CHz9JBdWtAyBBM8qIVxy2phNvTQ8Y1aDLxNi2ijUwvj1qkFLbdpMfB1Woi6qYUJ7tTCna3TQsfbtKBlpxZ+fLUWU/y1WixthpAnCiGbFcJuvHbhZQbZFwPXDH0zeDRXsOc2p4rtpEMF2KaC3RLTgqs7ObZn4H7cnOTFM5/snXrb+45cOgAxSHDqOFdlEPCR4NRxgeGqu69takR8I3jMNQ9ePJMDL55pgy+eyav2S4WGTCucmNsUvs0fW2DAPf4AuYtnHFVpkbP04J54xZpqKcdrgotnst9CrlW5+h0aK2e/u6g6NFHOvnwNO8RVhoRNqhV6nUzEbGaJjjFYKK0wiw7r7q3UxqAGWANcHIBwxCWr3HAzFmKH7LsR7SqIFphdzQJ1RJiyFKIqiNly4YQN3sgZ3jTbUdDwwpe0gA7dQi5p2eMA4rpsla1W70taoHpMO1h6Q50TXdJij+mwuE8dgcPvOuSSlhzHmgzLJYgIvMhnEFlMs68pXHug6BP/gtQnZsLziRlkVqDI2z/3F31bgcP+qJuRbRIq3YFWdcuxYLwudJStQf5gKPMJJ3cFT9tdwKdsiwCwjQdsY5lWsbHrMfV55NCIJ0M38/EZrJmKwnKrumbm5Sb5QTQzjzpuWNLyIj7aP4tkomH/7NECspEecjk95IAWtGylh+ylhzToIZu0GPgaLXq5TAsdD4HjK7RQyHYtOB6CqEe0kMtuesjNWmiPHsYthIGvooe8jh5ytRa0HNBCLvWIgnu1GHgIHrKFHrK5FrIuMe1przndxTxwPUJWPUxwtxYmeJkWtNQjvrx+qcaXa7UwG91a0LJdC4XUgz0h2EtDizBLD7ls1kIul6w7s8JwZ+4NDszOmJjCoj12jXeMfc195x7TXlx8514eWWlVrDAcU19pLcArrXmilVYB+/LgSmuR7RpH6qKEtBT55ooI9xjIlfSQ4woy5r3HHKckbd1z6zDw/h7x+4Woet3zwyp1z6OYLqeJdNmxNe1q247wzmCsUzcMOdgwWESGAb/djTOTTNc4OjJP6xV2fOQR1jCQDfSQrfSQ7fSQTfSQy+gh19BD9tJD9tBDdtNDtmjB8R4tRH2FFqLeuFQtUa8W7NFD1DdoIUSNWtByQAtHEUIAE9HCnfUsVblcsvYyFA/pmt7YNyjbp7Jy4CmkHHAKiTl9GuenjHG1Wds2wSGMXLkwanfvNvcQEsh8NaXW+Eb1+WoKnq8miOarKZ7dCXC+arFd40SBeWoSpRIsCbXyD7mBHrKXHnIFPWQTPWSEHrKFHrKZHrJ1qXK8VwsdD6GXy+ghG+kh27UQorVaCFG3FrRs0aKXPVpwvGepurMmLdizVouBr6KHvI4ecnUt2ljMZiOU0MC9CmxWf2ag9ky+PRNpL8O+5ppHmnSzaoN0Vm2GN6s2fc+qF7671d8UXl56zLC2XaQ2AO9PAds0IurbLjaobLuIcAqQkFCABEpnTAEStbQSSVppnRbT9xBmXsu08H4RLbxftxa91CMHVItwaxHu4oxwl2jyq1sLIVpey6eRQQ5oIUStWkQbLUvVXjZpoeN6OIp2LeTSCIM97lk1M+cEZ9URvr2I3Kw6grVnErVnShiciJ8EjHEVEzARxQSMcfUTMAzr0kSsS0uKSiii6UpxRJCEj6GWc8mqJ3wMOOETIUr4GDitAuaZ1HJyzLi5xLO3AUyhJX0TDnXldpOlyvkxkRHxyuHiyfWF7Wn5EncU06j+zC4cxeRpfeXBPJG//fZ3/1r+6Qvv7dxQfiWx+3e+d8cPb4yPPF/+lda/fONPXnr5Ev+pqcqmoNnMRjfHYtwewvz2Kt0Xnh0u53faj6fsX9NP3Dx7+szcicV0yC5D1F6GfQ2CBPZUMgf04sIS7fl9lbLxDQ/D/d175rgbd6G/exQ2l2Y8PaXwhChCbabqdkGhI1bVKQIfFf30vp7/qMgOxN175qR3vZ/e77umvbfY3nPHoGEfWB/6ql897AOLRD5QSCxxSPeRhZDuMvmmZk7dd+b4vHK7YjSGzMIorT5yQRCIDUAh10UQfyUQHd4MRY0XndDi/3PFgW6iN6oRfdotTdOV3tS5n+xkKed6totljevZ7gri7WLpqnNLV51j7rNgMPc6byhj3uE6Ws/22fWsge2z2+uzJ4MXiP7UlR6/+j/7T11i1X7eTgs/beBw6yGdkOmB+xWHnXCAgX19VYGEsVYeqTAhawqg5ccGOqhGxMQ1qQl8k7qJa4JNXCORiWviTVwjSI1lbNe4CGYZa4CA5pbxzS1DgiIGcpQecpwecpIeMkcG6TVnqQHWAGuANUBiQPzUIveUCZSmsKkgONFXvO0uzb6GtBchag+/Qth/5MI15Oi7e2CNEoRsRGMDjJCN4L2i1azPM2CzQJaDuQpVdJ9fY7mwwQZ/FhtwDrynuNGO8haexVRTuZVZw1E3BZoqkHEFDWuq/jTRIAFnf5MEO/4UFG9vdpjiY7iNNvhfYPfaNigolqNRSH7QfG/WoW0CKcr/tX3F4vNYt/Oq8sswJCVu+bNMlg4S0WxAEW2CRbTRU0Tx2YIvuc6hcg3m+7KI0QXzfQXZy/1EFzUXyvn/xkiGf21JCbUl/xUJ5jeGx/ycJ/MLqJ+Tl5iCQ5jdzGdEw1JIrWcDMj/LNitk/je9mQ/dRGvhzM+W89+SYH4uPOZn/TA/68n8RpT5giu1GScdVfAKVkDmW7hPmGf+D7yZb/kz+/OLMz+6tmbf8sN8KyDzcyjzk+ikwSJ1CvkgTiFfLtQxooFNZrIKvbaAVYaPLqwyvNrMwjLDuXMKCwH2k3rxEkS2EV8KEC9FNCoMrejJEAtlSBFniFUuJNn4Da50nBVXOs4iGd9c6ItaSEHTbHgFTbNgxle6oKkvX00t3fYyF3AKzY9sRxRkO1aVbW7XAzP66r4HJN3QoGBXHXMaKAqXDX8aBVq1rFxo9faAwkDfy000i/JKLLFgEjVzD5exsgk1CPjpRtxPN5cLnRJ+ell4frrZ00+38LRs9mRAK/9Ri2PG4db6Vlmb0OzHBE3xBplpzjNbIZhvpAPOULNYLmkZ99Axt4XEpCm8RNMyTzFpRlO5KrLF0IgTBFyIcmzbKpZOQkwamRzjItqWGiNqL8a+BkHKVN/jjVykXJhijJw7emKPHIujJwOJnqKh3xMRhaMngyh6ivK8MsDoKcZ2DePjeqi5GBJk4KKRoIcMzlN4waMOiTw5uhagfYkSG3uitnz/qvzGngjbL7eKGxJRsIGKja9zHcYTVwK5yzvEFpAOV34cEei2US6cCMzA9eB23kjgYp7r1RU+7u5OnO0ZaAzYjpUG4Y49MvXu1MTrZjZBLIjzXI17OtIEvi/Y3dekGhHXgiFHwvkkxlPRjhuYxq8oy1TgDf9rlWjItMLpRtxzqRpny2O3zM2cOg9ZafnJXhoyQlXj5r0WMCxeOZvz3q4t2DKc8pQ9fOd1Ft95jayFWaHlLTNwoJv3k7fMe9KoDc1bpnmBbGPphZnyvB/p4gLdtINhVwJdqwhBb0HEBMzAjQKCu6X6s18guKPlwpu9BXfMz7b1cf6jMbZfbtkcZT7lHjJfjoCCOxZQcHOw4I57Cu4EP9xxTxpN8h9NsFznRHOSpRf3dIRtmysEztL+igzGOym39AryCrbZh48hBG+mWI2loFDV3jNReDfEii7vtaAtAgXqKhf+2Ab/fcwaF8V+430VoWtcj33Nx7CMFzC5h0WW8YojLuImY37E77f73AcqYz6gMuZhZezyVMZBXq+6PJVxmP9okKUKJ3jDLKfk82beyyl52eWUnHh96yPY+pbJ0oR7mvI3pgjo+xwrJQuKEv0EJ7Bd1Z9DoMCiXOWGMsS+BkJyJ+girMKDojJ97H53T7w/G3xCxM9hBxk5fg6WC39m61u/ksR7s3IYlbQuVhP4ng2XC3/pvcQAmRlGt0piM1Pd1XVzAHBLDP4Z77BHYBCGPK3ICP/RMNsvRPBHuIeDrD0Fj+wMO48XDTqiTVc+kHnY5XVsacR5FMgxDGwRAR1HUSzi37Cd6Bf5ieuImuuIKjB0mm3FF0tz2GhBzGE7FTSiom9VMn0NRLZVQhH7vzORCBxkHbF78A0FO50D/UOO7WI1SkPUJCc881+Q2Y/VFSwoiXwDDkpSfoIS7+n/EBqURFCvh+8wBuPClE/3nrLd+6DCaCISXroEWPkhXChK5cIrvqx8KqCVH+LEt4RZxyGWt5DoDoUnusOeoiscrheNRvmPRlDRHWXpxT0dZNtWkS8J0R2yRZe/2X2Y7ZX74Qjra33SAUq6oKHZCEs2XvTHysW0d2g27meToDDRwQwHSd1MgB0BFHy00ptpwRjHy8WChM0fDjgRLS6yrNAomhUSVL4psW1zT7MywYpPtRquqJXxTwp7zSKe8+OS96ZtsT8odl4Tf2Cp+YNhljvXQKxHPMVaaNK8aCTIIo+i/mAM9QcOwYVl0LJl8KsKXsN7o3xJNDlEzOAg5kYcEYB8L4eQ7McgFo4MsfShac9iX3OxY4gy3TskqVeWAudKcgMruQdWohyYo+9QXt7OZBd3eE8AgXW0aeH8r/hvbOidWLJ5yLdomzBHBFm4hc7uCysirosvsoi4hEbEeYVV5ZLbOdO7D4R4Q57EKxEl1kosebDVsEE0DT6kQFqpuCdv+5yPKoxmMKD85LFAYhSbugyBYjISXpQx6ikmwoAh2LKzQEzGHUqBeJtRhYiRsbWQAABWmuGZaL1xpFw87h3DjvqRLjw+G8YEaAyfNV+DGHYRStcI6vJ9SdcUsgVzmIkU3KsAY6zZqpJ8gC9uOsp+hJYjG2M/cmCCQnrw7uOvviCmJc63gRIgphDnuHQKgDAmTjW8STqdAuCCs+sJ2Z6NC3o2US6+FTk8x46rUiMOzs90KOjKGBLJdrCvuSR0DNl9OhH6dvMJeIfpGNF28wmUVi5qTLJdw3f7yCeLJhHWTLIegRxyKDBPJ3kKQdvNtyJSti3AdvMJP9vNR9l+IaZxHNDCcQktHEeTiZgWjoOZy8WmhePhaeF4cC0cq2khooXj11wLx9h+IUR45NCAJw3qVHRmUo2+Xeo6Mxm+zkzi9sXd7Fa1ZjvPPrnj+Mydv7zj5INn33/LyZtn7jr24DuFBjQrlOqtDiUl5u3oYuXtaHi8Hb1qvB1T4i0SoFpEAaolF6AGz+k6+g4lj6s53TLozoBsQQnL6c7PDb5uQ38ey5WPYbvxTXD+Phpw/h6F5+9jnvP3cZTlPhevOQZOsPTCkohjCslOqSRiyU4iPgCP5uCZ14PnPUqwLeA+m/Bcc90q2o5gf8QCcXK4tVz8e3uOekhVxCfZwQmF/B+8E2Jb/azDb+M/2sr2y60zE2zk434omK3wCrU1oEJ1wQq1zVOhtvPD3eZJox38R9tRldnB0stTS23r5i3V2/3k8/DuT2JcBNffJgFBnsAFebJc/GeJ7SzbwhORST8iMhmQxhOoiGxFXeqkgpkvgTa35Ag+bE+MHKkBFzKLyGkP/GK7ovAkR33Sewt8HhC3CBYazEOnva2mYDimJ7vx62oi2NJyPXqBBXS3Vr19t9bP8H/wTvcGl3MTdqBeQMeGcn29zaIvY3fq+JqWYNf1NKiG6MrTkobwr+tpwBUm4BUaK/FpieMcNTNqpjmGkVBBCzt6r29TVVFHZU2hknbb4CvDWqR+7l1Kmuyl/gKO1rMjRtS/gXvIfJnhHjKMguuhA5RnvhWXlK5fL3HGsT7gnuwfLLLCzg1oYWeVHSgNnvOJenR7cwPbLM+f+nL9EHbGMcPSBKv+pDKmAqhVBV6rEGuQQrwqSK60d3WoLgGh0uX6SW8/n0FMCChKWVFRAKZfbnV1FkFwPWS+7AbVLRPedgHvasqWn02iwsLHDNex8zmCshXdbNvwtaqVgzgngtHrwWfEIUPUKYp2Wt5uxH01aLRc/1oulLDDDbm6Ps9/+pUvPXvT5nvsWjBc8q1y0WjAhqxPf3z/i/9yanXoDa345Oznt77wnRe8G6oYuj1IJafgqUob7LbAlYPQmkgygXCELxIFB8KKF+T+TD0QNuXqUgUJhE20AFLQK31/igfCBstpsUVhGAmZZxOsVpWyY6nrA1+9/dPA0vn/3cIV5UP54xCfkoAfjrID4v1wslx/rw1+Ei05CV2YnGRVFZzJms6z4En2JzQkPh2cYAcGhTFoAOeoYiY6r1v/gHdKOAUQO4kTex78Dd5BTxrVOPlIKc32y820lGMC40puMMNIeZ3FT4F8jcAfpS9ztmrWma/BT5LOM/8pdpyynTPZlgR+hkEHRZIjcxSMvqMOBtgKXPWanMFQ3usOeSMuYZNg+eJ6lqx8dVB9N0TMHs4R+d0QgkqCJKEDKAdxpxxE2Z/gRwnnR3GEgnHKeMdRshDRB2hIEVS0k3zmhbDvEYSzUcqGbLBbArvdFWDh4arbfZ+q2zVwNzPvdp+wwR+TcrtgfFZxkgudPsR2Apzpc55VYqYvt9Bqimf7H2C8KmR/pmySPAUO19vziirum+X6z9ngH+bobToMGuwqMZf2hDtDn6o6OCFFPm536I+wNqM8uZ50T6jL9X8CEvU25p0QHCUSDUb9RYMCXWc6hrQ37w73nXRORqr0vlza2B3nMMmdNHBRedp/KJRmu41QwhHXODJVPoIuE/UnKdRiq0Q9Bhj1GKKo532YyqGBIiSXJjqUtMJ0NgkOxUHXqmkKmF9569//7Ctvf7j1+6Encibe88BvZoeefib0hp7KfGHHf36P+W9Db+jzye/+6HN/ffRc6A2986/6bvjH1/7vDpUcmFvCHSE3YrYMTDeimGsAb4FIM/XceX90WOyPXuIjqYxaJFXHk4uBgmIRYe1BOxzZI55H/8zWx++pTtK9oP9RYrNLImDGPxakXlfaTyEQPEFgoktVYE/iflaMEmh+xmSb5fmTKNf/GFtgi6DOzpCNM+JIGvpwRfQalgWeeyTBsK0OWUeJIDWUDaTGNxdKZmBbIjH3T9hC3IzM/UMxizH9NHMKXe+NU4sy3GpMENU0LPNc04lzs+KG5aCKA6Y3jpneRLmh34Zu57gfx+QmgclNEnOnslO/hMKqeQpJXCTY1yABEywmpVVTg8qLSWl4MSlFtJgk0I+EH8/FELi6fvTsgZP3zR676+SJzQdm5+45c3r+zZMnLrDqFmNNXwzVuDiqcSnUeeBTZhNaR7mW8SKor6xfFwSNDfZh/oabFPiXDLiJI45v4pDH9JY+4fYKpCNMLy14Xpt1zvrT7PeQZ0uGVxkn7enZhOGjD9plUBVjr9T1SC5j6pn2yCF5ZLS8BDqBLNBN8W6T6XTVcVbdrOjmvIaD9qsHwAWSw6CHvtX+WrArOWHvSsb/rUfWHrhcZ1TCUZpoFgmxhqYwgd5whz3K2+CuGoKuLrR5u/Bis4ZfCHxvFjYNTiIbX6vyMePvLVs0jiBSGGGEA24lhqT14i4PttBoomqzhLFH8gl+3YCxv+7NWfMc/mW7q/e4rxWzm6q88QbgDeXFJmAilHJ/EK1+4Gg5XX3B8fcMZGMX/pwVkMfGSnHkyZYbHnIxwKx+VrFw7rZNcdtp9+BA214BdH/AXLtU4cgclIRT3ZpElNP7n+aBncYfvX2lUk7PtRzAOArDaznAtehsK+drKJe8uWV+eAaRDH0GkYRnEAmiGUQSjeHglElSdMjJdpfyHstEpnY6AD6JRF8yN77G+QtmjOqk3nP/WsMl1ZSBIyknTBq8aIO/y1+vwTCPK/4Z9/woyq+sGzJkfUK8V82mn2tlk4mO4q9e2soRJl5usFe8G34fJgzWXXCLXVJ2i514y2HDI8xmAHQ7oXzOJQmHko79ooqLBXF8saDhSV/7+bwPMeDp+ji+nw9ZTnVMOx2EuQbTTtNz2okfScEuCUt7JD7l9vPYTbE6KZLoj9m69jkF12WPZR/HUAcH5BHjnssv+PZYx4W9Qon/pHe9wTi4SQdRpnmD9WfeypTyo0zCtDzTKyTVjGwujTiVyeGo4K3ooSlT1FOZ4sjm1X3ovhF8S2HUW/YjQv/GbLQDvjMe2T/nWMR2TISF8/e/tXvzArqvDrt7HQw/Fe9ej7CvQbsMI4FvUvcRqkfhUN0gCtWjflQ1jhJYIdkfZZP98RgqwIasyPgY6RQmZ1EkA2NIrBPEFOYFCbhHSQnHaPLRcNQzGk7zcbfp+ZF4Q0gad8Hzjukl78sofW4JafjeNYnyTJooLykT5SXCc0xJP1FeUjbK8wG5D1OplL9QVGXPNPM906xwee0n3sEWfAAbkel56J8txuPXyI5Xh0wn2O+vwcwl4WcrSAIJttL+JDBRZTJi1H3J9L6QZLox7y3Tph+ZNsuN9dfETqewjENGWqYdXnhR2mls8/QeNNuYwkxuUmGhNYFE20n2NYXEuBl6tG2Gnxg3/eyySKEEVoi2TTbaTsX85ZYTPg9XJpjscsA1orHe325Z8Zl7s6FvMP/o0MZR68jqXw+9oXhsxe91Pv2Le7wbchkW5dIKQq2oZt5te2XjO2ycWX3B1ZGU6uq7eIkTOb0Wh5dZ5/3VtBiQO3hnqq6ZRqvNAivpGVUk04WU9I2UAteQk+qdgqASkmvtKW51uXF4QWz/FYXix+DEVgMA",
|
|
2387
|
-
"debug_symbols": "tZ3djuy4kW7fpa99kQzGD+lXGQwMj8czaKBhDzz2AQ4Mv/tJhhRcWbtPamdl7b7pWt1dFUuixE8SRUn//Ok///wf//jvP/z8l//66//+9Pt/++dP//G3n3/55ef//sMvf/3TH//+81//cv+v//zptv4R86ff99/9NO7/4vcf7fghx4/+0+/H/YceP+z44T/9vt3uP+P8Oe4/5f5zHj/n7fx5L9X0/lPOn/38qedPO3/6+TPOn+P8OY+f7XYraAVS0Au0wArOsq2tP7cF65d9wfrlWGAFXhAFaynmgnmC3ApagRTcK4ss0AIr8IIoGAXzhH4raAVSUJV7Ve5VuVflviq3BaNgnqC3glYgBatyX6AFdoK1gvW/VhuaFSzpbUEUjIIlXc3rt4JWsKRjQS9YlVfTuRXcK/e1YH6v3Nd6+b1yX4vh84S4V+5r60QrkIJeoAVW4AVRsCqvxcidf9nX7q9rLVYH0GVfO70u6drtD/CCKBgF84S18x+w/ny12NrND/CCKBgF8wBZu/oB68/vTSdr39BY0AqkoBesXx4LrMALomAUzBPWvnFAK5CCXlCVtSprVdaqrFVZq7JVZavKVpWtKltVtqpsVdmqslVlq8pelb0qe1X2quxV2auyV2Wvyl6VvSpHVY6qHFU5qnJU5ajKUZWjKkdVjqo8qvKoyqMqj6o8qvKoyqMqj6o8qvKoyrMqz6o8q/KsyrMqz6o8q/KsyrMqz7Nyv90KWoEU9AItsAIviIJRUJVbVW5VuVXlVpVbVW5VuVXlVpVbVW5VWaqyVGWpylKVpSpLVZaqLFVZqrJU5V6Ve1XuVblX5eqDvfpgrz7Yqw/26oO9+mCvPtirD/bqg736YK8+2KsP9uqDvfpgrz7Yqw/26oO9+mCvPtirD/bqg736YK8+2KsP9uqDvfpgrz7Yqw/26oO9+mCvPtirD/bqg736YK8+2KsP9uqDvfpgrz7Yqw/26oO9+mCvPtirD/bqg736YK8+2KsP9uqDvfpgrz7Ys6PNBfOE7GgJrUAKeoEWWIEXREFVnmdlvd0KWoEU9AItsAIviIJRUJVbVW5VuVXlVpVbVW5VuVXlVpVbVW5VWaqyVGWpylKVpSpLVZaqLFVZqrJU5V6Ve1XuVblX5V6Ve1XuVblX5V6Ve1XWqqxVWauyVmWtylqVtSprVdaqrFXZqrJVZavKVpWtKltVtqpsVdmqslVlr8pelb0qe1X2quxV2auyV2Wvyl6VoypHVY6qHFU5qnJU5ajKUZWjKkdVHlV5VOVRlUdVHlV5VOVRlUdVrj6o1Qe1+qBWH9Tqg1p9UKsPavVBrT6o1Qe1+qBWH7Tqg1Z90KoPWvVBqz5o1Qet+qBVH7Tqg1Z90KoPWvVBqz5oq6eYL7hXNllwr2yx4F7H7kFkazfutwXzhLUbH7Cu0/oCKegFWmAFXhAFo2CesHbjA6qyVWWryms39rVgazc+wAuiYBTME9ZufEArkIJeUJXXPhZrBdc+dsA4Ye0/sRpq7T+xlmftPwd4QRSMgnnC2n8OaAVS0Auq8qzKsyrPqjyr8jwr++1W0AqkoBdogRV4QRSMgqrcqnKrymv/CV3QC7TACrwgCkbBPGFl+AGtoCpLVZaqvNI4bMH6L75gucYCL4iCUTBPWDvtAa1ACnqBFlRlrcpalbUqa1W2qmxV2aqyVWWrylaVrSpbVbaqbFXZq7JXZa/KXpW9KntV9qrsVdmrslflqMpRlaMqr+yNuUALrMALomAUzBNW9h7QCqSgKo+qPKry6jvjtiAKxgmrp4y2YA0AyYI1BLT2w9UvDoiCUTAPiNUvDmgFUtALtMAKvCAKVmVdME9Y/eKAViAFvUALrMALoqAqt6osVXn1i+ELpKAXaIEVeMGqc8/wWOctYyy4/9VsC7TACrwgCkbBPGH1nQNagRRUZa3KWpVX35m3BVEwCuYJq+8c0ApWndXgq1/M1QirXxwwT1j9YtqCViAFvUALrMALomAUzBOiKkdVXv1irsZc/eIALViV5wIvyNHItRqrY9yHChfNotU17oOFi9om2bQGBm9LubrHSWto8La26THeuazHiOey5ZjnQbMoxz0PaptkU9+km2yTb9qOuR2zHON229Q2yaZVJYdkV09pra3x3PUXbQ3wrr5ykmxaS7VGSUeOiR5km3xTFOUo6BpOHZJ/m4PF+bexyDb5ptg0Ns2iftvUNsmmdIxFusk2pWOteY9NY9Ms0hyRXu2yetFJsuk8vRl14jTqxGnkidMa2s4Tp4RRME/IE6eEVpClV+Ovg9BJusk2+abYNDbNIr9tapu2w7fDt8O3w7fDt8O3w7cjtiO2I7YjtiO2I7YjtiO2I7YjtmNsx9iOsR1jO8Z2jO0Y2zG2Y2zH2I65HXM75nbM7ZjbMbdjbsfcjrkdsxzzdtvUNsmmvkk32SbfFJvGpu1o29G2o21H2462HW072na07Wjb0bZDtkO2Q7ZDtkO2Q7ZDtkO2Q7ZDtqNvR9+Ovh19O/p29O3o29G3o29H3w7dDt0O3Q7dDt0O3Q5Nx7pbpbFpbJpFR09Oyr/oi6Jo9UZbP/v5U4+fR6/Ke1ttk2zqm3STbfJNsWlsmkVjO8Z2jO0Y2zG2Y2zH2I6xHWM7xnbM7ZjbMbdjbsfcjrkdczvmdsztmOW4H7tvYAMF7KCCBjoY4ACxNWwNW8PWsDVsDVvD1rA1bA2bYBNsgk2wCTbBJtgEm2ATbB1bx9axdWwdW8fWsXVsHVvHptgUm2JTbIpNsSk2xabYFJthM2yGzbAZNsNm2AybYTNsjs2xOTbH5tgcm2NzbI7tOAavu5K3Iy4ObGAqZqKCBi5F3jq9ZVScOMClyFuqt0yLExsoYAcVNNDBAAeIbWKb2Ca2iW1im9gmtoltYpvbdswTOLGBAnZQQQMdDHCA2Bq2hq1ha9gatoatYWvYGraGTbAJNsEm2ASbYBNsgk2wCbaOrWPr2Dq2jq1j69g6to6tY1Nsik2xKTbFptgUm2JTbIrNsBk2w2bYDJthM2yGzbAZNsfm2BybY3Nsjs2xOTbH5tgCW2ALbIEtsAW2wBbYAhtZ0siSRpY0sqSRJY0saWRJI0saWdLIkkaWNLKkkSWNLGlkSSNLGlnSyJJGljSypJElQpYIWSJkiZAlQpYIWSJkiZAlQpYIWSJkiZAlQpYIWSJkiZAlQpYIWSJkiZAlQpYIWSJkiZAlQpYIWSJkiZAlQpYIWSJkiZAlQpYIWSJkiZAlQpYIWSJkiZAlQpYIWSJkiZAlQpYIWSJkiZAlQpYIWSJkiZAlQpYIWSJkiZAlQpYIWSJkiZAlQpYIWSJkiZAlQpYIWSJkiZAlQpbIkSVr/pIcWXJgA9NmiR1UMG2R6GDO7bslDnBuzCw5sYE5z68ldjDn+uXyZpbkfKucMFOYNk0c4NyYWbKmVzU5ZikeKGDaRqKCBjoY4ABnYT/mLx7YQAE7qKCBDga4bTmHpq37ii3nzNwPconrzywnBGYonDjAuTFDwXpiAwXsoIJp08S0eWKAA5wbMxQslzdDwXMZMhQ862YonLhsbonL5pHo4LL5UWzZ4ig2N2Y/XrcOW06UaZHLm/34wOzHJy5xpC37ZuTyZt88cYBzY/bNExsoYAcVNBCbY3Nsji2wBbbAFtgCW2ALbIEtsAW2gW1gG9gGtoFtYBvYBraBbWCb2Ca2iW1im9gmtoltYpvY5rbl/JvCBgrYQQUNdDDAAWLL43xEYgMF7KCCBjq4bOs+Xcs5OoVzY/bj3JVzgk5hBxU00MEABzg3Zj8+EVvH1rF1bB1bx9axdWwdm2JTbIpNsSk2xabYFJtiU2yGzbAZNqIiJ/gUYjNshs2wGTbH5tgcm2NzbI7NsTk2x+bYAltgC2yBLbAFtsAW2AJbYBvYBrYMkHVXueXUoEIFl20cv+tggLnbj8S5MQNkZBfJADlRwLTNRAUNdDDAAc7CnDxU2EABO6iggQ4GOEBsDVvD1rA1bA1bw9awNWwNW8Mm2ASbYBNsgk2wCTbBJtgEW8fWsXVsHVvH1rF1bB1bx9axKTbFptgUm2JTbIpNsSk2xWbYDJthM2yGzbAZNsNm2AybY3Nsjs2xOTbH5tgcm2NzbIEtsAW2wBbYAltgC2yBLbANbAPbwDawDWwD28A2sA1sA9vENrFNbGSJkSVGlhhZYmSJkSVGljhZ4mSJkyVOljhZ4mSJkyVOljhZ4mSJkyVOljhZ4mSJkyVOljhZ4mSJkyVOljhZ4mSJkyVOljhZ4mSJkyVOljhZ4mSJkyVOljhZ4mSJkyVOljhZ4mSJkyVOljhZ4mSJkyVOljhZ4mSJkyVOljhZ4mSJkyVOljhZ4mSJkyVOljhZ4mSJkyVOljhZ4mSJkyVOljhZ4mSJkyVOljhZ4mSJkyVOljhZ4mSJkyVOljhZ4mSJkyVOljhZ4mSJkyVOljhZ4mSJkyVOljhZ4mSJkyVOljhZ4mSJkyVOljhZ4mSJkyVOlgRZEmRJkCVBlgRZEmRJkCVBlgRZEmRJkCVBlgRZEmRJkCVBlgRZEmRJkCVBlgRZEmRJkCVBlgRZEmRJkCVBlgRZEmRJkCVBlgRZEmRJkCVBlgRZEmRJkCVBlgRZEmRJkCVBlgRZEmRJkCVBlgRZEmRJkCVBlgRZEmRJkCVBlgRZEmRJkCVBlgRZEmRJkCVBlgRZEmRJkCVBlgRZEmRJkCVBlgRZEmRJkCVBlgRZEmRJkCVBlgRZEmRJkCVBlgRZckwzXLMv2zHP8MQAl21K4tyYWbImZLZjsuGJAi7b9EQFDXQwwAHOwmPW4YkNFLCDChroYIDbdkxJXFM72zH/cI7E/LOZGOAA58YVCrIme96xgQJ2UMHc3LkMRygcGOBYv2uJc2M+sn1iAwXsoIIGOhggto5NsSk2xabYFJtiU2yKTbEpNsNm2AybYTNshs2wGTbDls+K346Hqm9gAwXsoIJpyx3GHQwwbbkb+dwYN7CBacvdKDqooIGrbstHxVdHl5a70erohR1cFdrxpLiBDq7lzbcU5GzGwrlxdfTCtGXzzbTl7jnTlmsxFTQwbbnoM8ABzsKc2VjYQAE7qKCBDgY4wLStLZRzHAsbKGAHFTTQwQAHiE2wZT7kOwtyvmNhBxU00MEABzg3Hq90OBDb8VqHlthBBWNj9nk5XiWQFTRRwA4qmMtriQ4GOMC5Mfv8iQ0UsIMKYjNshs2wGTbHln0+XxKRsygLly0nL+VcykIDHQxwgMuWNzVzFmZhAwXsoIIGOhjgALENbJkPed80Z2QWdjBt2Q6ZDyembSQGmLbsQ5kPB2Y+5M3SnJpZKGAHFTTQwQAHOE+UnKJZ2EABO6iggQ4GOEBsDVvD1rA1bA1bw9awNWwNW8Mm2ASbYBNsgk2wCTbBJtgEW8fWsXVsHVvmw7r1LTlFs9DBANPWE+fGzJITGyhgBxU00MEAsSk2w2bYDJthM2yGzbBlahyvRMl8UEvsYFbwRAMdDHCAc2Pmw4lZLBLZhNnRj/bNjn5gdvQTG5gLORI7qKCB7DAD22CHGewwkx1mssNMdpijo+cyTHaYyQ4z2WGOjp7LcHT0A2dho6M3Onqjozc6eqOjNzp6o6O32949222AuyVbu4FtL0MTsIPY6OiNjt7o6I2O3ujojY7e6Ojt6Oi5DNJBBQ10MG0zcYDLZlk3O/qJDRRw2dZkCjne8XSigQ4GOMC5MTv6iWnTRAH3Dn687sks0cEAB8iucfTuA9lYxsYyNpYpaCAby9hYxsYyNpazsZyN5eyIzo7o7BrZ59dUE8mZkoVzY/Z5y3bIcwLLJctzghM7qKCBDgY4wLlx1Hmf5JzIQgVXXc9Fz1A4cdVdj5RJzoksnBszFDw3d4bCiQIum+eWz1A40UAHAxzgLMw5kYUNFLCDeWZ+Swww61ri3Jjd/8QGCthBBXMtItHBANM2EufG7P4nps0TBexgXnW0RAMdDHCAc2N2/xMbKGAHcy1mYoADnBuzo0c2anb0EwXsoJ4DKnLMczzRwQAHODfmMOGJDcyJAZJooIMBDnBuPCY9HNhAATuIzbE5Nsfm2BxbYAtsgS2wBbbAFtgCW2ALbAPbwDawDWwD28A2sA1sA9vANrFNbBPbxDaxTWwT28Q2sc1tO2Y0nthAATuooIEOBjhAbA1bw9awNWwNW8PWsDVsDVvDJtgEm2ATbIJNsAk2wSbYpGYeyjER8sQGZj/uiR1UcKVR5PsBMzVODHClRhxvCZwbj9Q4sIECdlBBAx0MEJtiM2yGzbAZNsNm2AybYTNshs2xOTbH5tgcm2NzbI7NsTm2wBbYAltgC2yBLbAFtsAW2Aa2gW1gG9gGtoFtYBvYBraBbWKb2Ca2iW1im9gmtoltYpvbljMwCxsoYAcVNNDBAAeIrWFr2Bq2hq1ha9gatoatYWvYBJtgE2yCTbAJNsEm2ASbYOvYOraOrWPr2Dq2jq1jI0uULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULDGyxMgSI0uMLDGyxMgSI0uMLDGyxMgSI0uMLDGyxMgSI0uMLDGyxMgSI0uMLDGyxMgSI0uMLDGyxMgSI0uMLDGyxMgSI0uMLDGyxMgSI0uMLDGyxMgSI0uMLDGyxMgSI0uMLDGyxMgSI0uMLDGyxMgSI0uMLDGyxMgSI0uMLDGyxMgSI0uMLDGyxMgSI0uMLDGyxMgSI0uMLDGyxMgSI0uMLDGyxMgSI0uMLDGyxMgSI0uMLDGyxMgSI0uMLDGyxMgSI0uMLDGyxMgSI0uMLDGyxMgSI0uMLDGyxMgSI0uMLHGyxMkSJ0ucLHGyxMkSJ0ucLHGyxMkSJ0ucLHGyxMkSJ0ucLHGyxMkSJ0ucLHGyxMkSJ0ucLHGyxMkSJ0ucLHGyxMkSJ0ucLHGyxMkSJ0ucLHGyxMkSJ0ucLHGyxMkSJ0ucLHGyxMkSJ0ucLHGyxMkSJ0ucLHGyxMkSJ0ucLHGyxMkSP7JkJM6NR5YcuGzrOR/x4+36By7bemWf5GTMQgOXbb1VT3IyZuGyrYcuJCdjnphZcmLaLFHAtGmiggamLVcos+TEtM3EuTGzZOZCZpacKOCyzVzezJITDXQwwAHOjZklJzZQQGwT28Q2sU1sE9vctpyMWdhAATuooIEOBrhtOddS1twvyVmVst6gJzmrUtYMK8lZlYUDnBszFHJkL2dVFgrYQQVtvZJWEh0McIBz4wqFwrYw12KFQmEHFTTQwQAHODce7809EJti07Rl86mCBqYtG0oDTNtMnBtXKPQc8c5ZlYXLliO9OauyUEEDHQxwgHOj38AGYnNsjs2xOTbH5tgcW2ALbIEtsAW2wBbYAltgC2wD28A2sA1sA9vANrANbAPbwDbTlvvkbKCAHUxb7hrTQAcDHOAszFmVhQ0UsIMKGuhggAPE1rA1bA1bw9awNWwNW8PWsDVsgk2wCTbBJtgyNdYUN8kJln1NcZOcYFmYFSKxgwoa6GCAY2MmwZokJzlp8tgJctLksY1z0mRhgAPMNV59fhx9/sAGCrj31EGfH/T5QZ8f9PlBnx/0+UGfH7731OECdlBB1i37/JqVJuP44M6ByyZH3bkx+/yJDVw2ye2Wff5EBQ10MMABzo3Z5yV3guzzJ/a9sbKjS+4P2dFPdDDAsTfAYGNNNtZkY0021tHRD1SQjTXZWJONNdlYc2+sebuBDRSwg7kWkRjgALOhVjvk/Mm+XgEmOX+yUMAOKmiggwGOjdl51wvnJWdKFnZQwVW351rkicCJAQ5w1inKMVPyxAYK2EEFDXQwNuaDFDnp4Xgt5IkCdlBBAx0McIBzo2EzbIbNsBk2w2bYDJthM2yOzbE5Nsfm2BybY3Nsjs2xBbbAFtgCW2ALbIEtsAW2wDawDWwD28A2sA1sA9vANrANbBPbxDaxTWwT28Q2sU1sE1veN12zTvrxissTG5g9SxM7qGDaLNHBALNnHTg3Zj6cmLaZKGAHFTTQwQAHODceL5A5EJtgE2yCTbAJNsEm2ARbx9axdWwdW8fWsXVsHVvH1rEpNsWm2BSbYlNsik2xKTbFZtgMm2EzbIbNsBk2w2bYDJtjc2yOzbE5Nsfm2BybY3NsgS2wBbbAFtgCW2ALbIEtsA1sA9vANrANbAPbwDawDWwD28Q2sU1sE9vENrFNbBPbxDa37Xjb5YkNFLCDChroYIADxNawkSWNLGlkSSNLGlnSyJJGljSypJEljSxpZEkjSxpZ0siSRpY0sqSRJY0saWRJI0saWdLIkkaWNLKkkSWNLGlkSSNLGlnSyJJGljSypJEljSxpZEkjSxpZ0siSRpY0sqSRJY0saWRJI0saWdLIkkaWNLKkkSWNLGlkSSNLGlnSyJJGljSypJEljSxpZEkjSxpZ0siSRpY0sqSRJY0saWRJI0saWdLIkkaWNLKkkSWNLGlkSSNLGlnSyJJGljSypJEljSxpZEkjSxpZ0siSRpY0sqSRJUKWCFkiZImQJUKWCFkiZImQJUKWCFkiZImQJUKWCFkiZImQJUKWCFkiZImQJUKWCFkiZImQJUKWCFkiZImQJUKWCFkiZImQJUKWCFkiZImQJUKWCFkiZImQJUKWCFkiZImQJUKWCFkiZImQJUKWCFkiZImQJUKWCFkiZImQJUKWCFkiZImQJUKWCFkiZImQJUKWCFkiZImQJUKWCFkiZImQJUKWCFkiZImQJUKWCFkiZImQJUKWCFkiZImQJUKWCFkiZImQJUKWCFkiZImQJUKWCFkiZImQJUKW5NzQ3j1xgLPwmBu63ufYj7mhJ+Y1TiR2UMFlWxO7+zE39MS1bmtGeT/mhp44N2aWrCnR/ZgbemLaDuyggmusQnPJcgzkxAAHODfmsOaJDRSwgwpiE2yCTbAJto6tY+vYOraOrWPr2Dq2jq1jU2yKTbHlwOh67WrP+Z59PZ/Vc75n19wWOQR6YgMFzOXNvSSHQE800MEA0zYS58YcAj1x2SwXModAT+ygggY6GOAA58YcAj0RW2ALbIEtsAW2wBbYAlsOga7Hg3rO9ywUsIMKGuhggAOcGye2iW1im9gmtoltYpvYJra5bTnfs7CBAnZQQQMdDHCA2Bq2hq1ha9gatoatYWvYGraGTbAJNsEm2ASbYBNsgk2wCbaOrWPr2Dq2jq1j69g6to6tY1Nsik2xKTbFptgUm2JTbIrNsBk2w2bYDJthM2yGzbAZNsfm2BybY3Nsjs2xOTbH5tgCW2ALbIEtsAW2wBbYAltgI0uULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSJUuULFGyRMkSI0uMLDGyxMgSI0uMLDGyxMgSI0uMLDGyxMgSI0uMLDGyxMgSI0uMLDGyxMgSI0uMLDGyxMgSI0uMLDGyxMgSI0uMLDGyxMgSI0uMLDGyxMgSI0uMLDGyxMgSI0uMLDGyxMgSI0uMLDGyxMgSI0uMLDGyxMgSI0uMLDGyxMgSI0uMLDGyxMgSI0vsyBJJTFtP7KCCBjoY4ADnxiNLDmwgtiNLPFFBA9OmiQEOMG3rRMuOLDmwgcuWp/k537NQQQMdDHCAc2NmyYkNxDaxTWwT28Q2sU1sc9tyvmdhAwXsoIIGOhjgALE1bA1bw9awNWwNW8PWsDVsDZtgE2yCTbAJNsEm2ASbYBNsHVvH1rF1bB1bx9axdWwdW8em2BSbYlNsik2xKTbFptgUm2EzbIbNsBk2w2bYDJthM2yOzbE5Nsfm2BybY/Pdj/0IhUhU0EAHAxzg3HiEwoENFBDbwDawDWwD28A2sE1sE9vENrFNbBPbxDaxTWxz2+J2AxsoYAcVNNDBAAeIrWFr2Bq2hq1ha9gatoatYWvYBJtgE2yCTbAJNsEm2ASbYOvYOraOrWPr2Dq2jq1j69g6NsWm2BSbYlNsik2xKTbFptgMm2EzbIbNsBk2w2bYDJthc2yOzbE5Nsfm2BxbnmCsl0n0Y77niXNjnmCc2EABO5gRZIkGOpi2njjAuTGzZL1DpR/zPU8UsIMKGuhggAOcGye2iW1im9gmtoltYpvYJra5bcd8zxMbKGAHFTTQwQAHiK1ha9gatoatYWvYGraGrWFr2ASbYBNsgk2wCTbBJtgEm2Dr2Dq2jq1j69g6to6tY+vYOjbFptgUm2JTbIpNsSk2xabYDJthM2yGzbAZNsNm2AybYXNsjs2xOTbH5tgcm2NzbI4tsAW2wBbYjizxRAMdzCw5fneAc2NmyXoTTD/mkZ4o4LKtL0T1Y0rpiQYu23rcph9TSk8c4NyYWXJiAwXsoIIGYpvYJrbMkljrdswCzYU8ZoGe2EABO6jgEo8DHQxwidfTPz3fonlidvQTGyhgBxU00MEAsQm27OjrWaOec0MLBeygggamzRMDHODcmB39xAYK2EEFDcSm2LKjr0efes4YPTE7+olpyw2bHX29+bnnjNHCZZu5WbKjn7hsMxsqO/qJA5wbs6Of2EABO6iggdgcm2NzbIEtsAW2wBbYAltgC2yBLbANbAPbwDawDWwD28A2sA1sA9vENrFNbBPbxDaxTWwT28Q2y6Y5Y7SwgWnriR1U0MCKFc0Zo4UDnBvbDWyggB1UMNdCF2Y+rIzSnAXa11xszVmghR1U0EAHY2MmwXpOTXNm59kOnTXurHH2+RMDzPaNxLkx+/yJDZStUGyqoIEOBjjAuZch+/yJDWRrHn0+l+Ho8wcaiM2wGTZj33H2HWffcdbN2XeclnRa0mnJo8/nMjgt6bRkYAtsgS1oyaAlg5YM1i3YbkefP5CWHLTkYLsdff5AWnJgG9gGtkFLDlpy0JKTdZus22S7TVpy0pKTlpy05NHns+Mcff7AtK2O044+f2ADBbzbdD07qTmzs9BABwMc4Ny4+nxhW9gTBcw+f/yCVy/MOZy6Ho3UnMNZODfKDdxbqImAHVTQQAcD3Fso53Ce2G9gAwXsoIIGOphrsXInZ2sWNjBbJ9tBc1vkkqmCBjoY4ADnRruBDcyL+JFooIMBDnBu9Kyb+443UMC1FusJJM15mdpyu60kKHQwwAHOjSsJChsoYAexRdpyjcPBAAc4N44b2EABa4xU274noW3fk9Ccl6kt22EEOMC5cd7ABgrYQQUNxDaxTWxz23JeZmEDBeygggYu23q2T3NeZuEA58ZMgvVsn+a8zEIBO5gXgz3RQAcDHODceAwZHNhAAddaiCQ6GOAAcy3yz/oNbKCAOdst1/iYgXmggQ4GOMC58ZiBeWC2jiYqaKCDAY6N2efX446a8yd1PcKoOX9S18N/mvMnCwPMCiNxbsw+L7kTZJ8/UcC1vD0XPfv8iQY6GOAA58bs8z13jezzJwrYQQUNXK1+bKHs3Uc7ZO8+kdbJ3t1zy48OKmigg7kWqcjefeLcmL37xFyLtGXvPrGDacsNkL37RAfTltsie/eJszBnSup6wktzpqSuqYmaMyV1vcVYc6akrsl3mjMlCw1cddeUPM05kSdmPz6xgVm3J1rtXDn7sTDAsTEP4yeujrOeztbjxZcnGrg2YTt+N8ABzo05UfrEBgrYQQXXQmq2WR/g3JgH7BNz5XPJ8oB9YgcVzLXIRs0p0ScGOMC5MadEn9hAATt4r5tngDm38aRch1yz7LoHZtc9sYG5DpHYQQUNdDDAuy0v03Jm40Gr457UNsmmvkk32SbfFEXZYTX37+ywJwrYwVz23Ouzw57oYID3ZR/HX82i1V1PaptkU9+km2zTavkM7pyceGBOTixsoIAdvFfNK92cm3iSb4pNY9MsWl10ZJXVQ0+STX2TbrJNueRrl8pJhrommGhOMizs4Pr7g2yTb4pNY9MsWj30pLZJNvVN29G3o29H346+HX07dDt0O7JXrskrmpMHCx0MMNtCE+fGPI0+sYECdlBBA9NmiQEOcG7M3rrm0mhOHiwUsIO6N0321hMdDHCAc2MeaE9k6wdbPw+p6+ae5jTBwgCz7kjMurlHZr89sYECrrXw3AOz355ooIPL5rk4q996yla/PWj125OWynNT5lH2xA4qaKCDAQ5wFuYcwcIGps0TO6iggQ4GOMC5MY+96/6D5hxBXYPtmnMECzu4bHlhnXMECx0McIBzYx6cT2yggB3ElmfW6yPsmnMECwMc4NyYZ9YnNlDAtI1EBQ10MMABzo15ID9x2Ua2WR7IT+ygggY6GOAAVx6v/p5TBE9qm2RT36SbsmI2ZwbAyN0qA+DE9ee5T6z+f5Jusk2+KTaNTbNodfyTcsVzKfJUemTjZ78/0cEABzg3Zr8/MRc+FdnvT+yggmmLRAcDHODcmCfYJzYwbbmps+uP7D/Z9U800MEABzhrE+SUvsIGCthBBQ10MDbmyxoPaptk0yq67tBoztwrXEXn8QsOBrhWIc+hcubeidnDT1yrkINvOXOvsIMKGpi2mRjgAOfG7OEnNlDADt7r3sM18V4hr2Bz2p3dcoVX9yxU0BZKooOxMJthdc/CuXH1T8vBxJx2VyhgBxU00MG0WeIA50a/gQ0UsNcKe5bNhvYABzg3RpaNxAYK2MF1yXP8lW3yTbFpbJpF+XThQa1o9RWLLL36SuEszJlulienOdOtUMAOKmiggwEOcG5s2Bq21TEsT3JznpplSufktPO/rv3eMnRzcppld8zJaYUGOhjgAOfGtd9bJmpOTisUMG2WmDZPTFs2X/aGjLCcnHYueh8gK5Q9w7Nu9owTDXQwwAHOjdkzTmyggGnLRc+ekecpOfes0MEA05brlj3jwOwZJzZQwA4qaGAWy4bKPT/PlXLmmEVu48g9KhsqHAxwbBwNzAq5awwDs0Ju45F7XzbJzN/NJpkGOpi2bIejtxw4C8fRW3pi478K2EEFrdY453IVBjg2tr1uOWvrWKGctVW41zjnO1mOMuR8p0IDHVy2dvzZAOfGdeJVuJah5WrmnpoD9TmzqdDBrGuJA5wbc089sYECdjBt2Wa5p57oYIADnBtzTz2xgamIRAUNdDDAAc6NmecnNlBAbIEtd/D1JjvN6UyFAQ5wbhw3sO1WHwJ2kI01889yj1rnVpZD/TkDqdBABwMc4CzMl9pZDr7nS+0KBeygggY6mLaWOMC5MY8XJ0qtUM5sKlTQwFT0RBZdbmADc9E1sYMK5qJbovNnAQ4QW8fWseWx5cQOKmggto7iOGcaiQPMHSZ/4ehvB/b9C8fZ0YEG+saZC+mJuZCRmAt5/IKCuZDZ1Me+c2CAA5wn2u3Ydw5soIAdVNBABwMc4LKtWxOW01cKV4V1u8Hy1WaFAa4K62aB5avNTsxdY90WsJy+UqiggVlXE7OuJQ5wbsxd48QGps0TO6hg2iLR+TNsHVvHptgUW56xn5i2kZh1syVzPztx1dVsydzPDsz97MQGCthBBddaaLZ67n0nBpi23ACZ68cyZK6f2EABO6igganIjZW5rrmxMsFPFLCDCuai57bIBD8xwAHOjZngJzYwbbkBMrY1N2yew2huizyHOTGL5Vpkrlu2ZPbYE1cxy+bLHnuiggY6GOAAZ2FOSbE1vmg5JaVQwLT1RK3FySkphQ4GOMC5MdN+DcRaTkkpTJsldlBBAx0McIBpWxsgJ6oUNjBtkdj3MmSfP9FABwMcYNrWJsyJKoVpm4kCdlBBAx0MMM8cs/myzx+Yff7EPF/PrZl9/liG7PMnKmiggwEOkHUz1u24Fsn94bgWObCDChroYIC5brmfHdci8q9//e6nX/76pz/+/ee//uUPf//bn//80+//uf/D//70+3/750//88e//fkvf//p93/5xy+//O6n//PHX/6Rv/S///PHv+TPv//xb/f/e2+aP//lP+8/7wX/6+df/rzoX7/jr2/P/7Stt6Wff97WK7p3iRkfarTnNfLOala4D8bvv4/+4e/l+d93rSW435bbf9++KXC5EmMdrI6VWC94fLYSelEjVgYcJe5XJSyGfCxhF+3Q1pnt0RD3vXqX8FcLtPuYWDXlnfX2sBTzQ5G4aE3ZS7HezvVkKS4LrDHIo0C/PVuN+du2w5owe7aDuj5th3axW65PWpxF1ictnizGVYWWt3+OxbifS+0Ka8t8qNGf18ihlSxxH5KlQp8vV/B17n9UuK/9WxW0EuLemM8rXLVEDmGeLSHyvCUuW1MmNfrzGuOixsx3ah1FZovxzs7lbW/V+9CnPd255CJy1ie5a+dq42HDqnyscbmDiuwdVOXJqlwuhdwq99b3o58vxVWNPCE/apg+r3HZpDFuu0nvgz7Pm9S+GlzXFV5JLonfNLo+NsV82hRXRe4j0rur3MeWn+dfv9xF+23vov1xF/U3a8yv11B9s8Y6hT9r+O15jYsj/Pp8SNV43DB6T/YPNa4O8fnhqmP/kHl7XsOv9tLOfm7yZg3vu4aPN2sYy+Hz6zVCn9e42i5zH+zXu82f1tCLKL3fzawovad7f2/bzlFhukZL3qvRORfuOt5rj7H3sfsudtEeF8uxrhhrXe5nx2+1qek+8bjjfG+7xF6O+93A+fV16Rfb9uX8eJ5BdlXjNvfh+j4SwHJ8c5y8OuLnl+iOEo8HqF8txsXVUuT9lKxxv6n1cGgYH0v0qwuuViXWm/8eLrk+lrjYSddXHnanFX1a4uoodx9k2Sdi9wa1p6ty1aL55tWzRW08b9HLGsFWiYud4/Uj9nh+2J9f3sP86lJ4+m3sE+THs8pvF8QvW8TnbpHxeE748Zrc5atnt5frEn0fsdv91vLzy2G/2FP9Nue+fro93zB+FesedWhYt6Wf17g4VN7HBvu+hrqPW1LlPv7xscrFCarNWzWJ3e8BUeP1nazRY+6p+HQnm5dnUrvvt7f20pAb3UX0+TVYXOylc3fb+3juw0YZn9iwt31cWM+BvrVzrJsz+7yh9fd2sHyTzXneYO/tpPfbevv8Rdzf6yzSjMGG5+0RV7uo7fPb+zi1v1fDfe/m9+v1N2tMasw3a9ju+He092qMXvuYDX1+LXfdYXL+3Nlh7qenb1bJexNV5Wo/u6wSY4/B3PH5Hj/sq+NiVxVeGxe7rPDSuNhlWwx5GDbu/fl2GfPqTChunAnFwxnZN2Out68ebr+zFAzQrZ3s2VJcHPTnbdb1z2zPx46vKrS9HrPpeOe0Yeg+Rt453uwrI2fCnVX84sRh+lfHtK4rvDQaP746pvWJtmjj7RYNqsibSXj/y0kVfX6MyiGBr22Y75R4Zcu0m/62m+ZDc9h8e9M4Vfz2ZpXJgeE+chEXm2Z8+Y7JVYkXb5lclvj6sWGK7mP2vF/KXNzFkq/fxpLL435zjvsy3yvi3GQN19ubRR6uk93f2uXnQ75PvTjDvLrE/UEXyg8DOjLH8wvllweF+ns19LbHt7S392o83ggyeavG+tDivjT8MJTSX74RPxh7uH3YuC/fy5db7BJye34vv13dTGq6L0Hul8ls2t6/2d/l6ujtezx4vbD4aZGr9pij7/ZoVytzkWaxN0vE03GlJpej0uxho18sxtUw7KvNcVnkfu94jwffF+VhScYniuQsoro4lDeLhOwliT4uiuiXz0SuS7x0JnJ1I+e1M5HvtMbgOlf8ojUuD7u6ByA0bhdF5tWS7MP/41H3M4uRz0gdJazFm+uSc0DPIiFvF9knIjbfbdWcNXoU8Q+B+Jm9fRhDj1dFLm/m/IgiL8/L0fjyaeZViRdPMy9LvDY157I1Xp2bc92kL07Oubo19ersnO8caPZZs4wP8R6fKbKHy2ReHa0ub1D9kNWZO9DWVw4vluRiLxmue0zk8TDzzXLYRQT0vjve+hwYRfpnisy9bdaLWZ8XuTp/f/GAd13ipQPe1e2pFw94V62x3vi5bx48Ttb8VWt8/fDvXz/8u/+2rdH2zbr1AsSL1hhfb43x5daI25db46rbry+E7qX4cOcyPlPEuU9/m8+LRP+NU2x9ZGifuPf55uowyr3eGf5mkckV5nz38LBeDE6RiyWJ8QMuEGP+gCuiy9Vxsv3jna5vVmdcXbr7XpCHfSTG6xV8B4A/TOP61ZqM/gPadOgPaNPwq9PDfcb84Z6dfbMcftlp9l72eHZ3v5b7pkh8ebNcjkHsAZX1/ZmLxbg8QOy+q4+TBT9XRGbfd7kf76h8W2S2Lx8iLpej7yGV9RKsi+Xov3GRl69k5pdvpV6WePFKZn75Zup1a7x6JXPdpK9dycjt9gMOmlcR4ntc9z4y8jRC5Ooe0z3n7OEWAv3/22cE+tfv68rVnarXbster8vc43b3Mc3b83W5nESlzKF6mBdyPyn5TJHgTsYtzJ6uzXWRh+lHMeZ7Rcaeo9Ju83Z7r8hskyJq72yce2+wPcr8MKv0243TfuMaTdqe3nrnhwvmb2fJfaeMMHVQ5OFy5LNlmKcm8nDi+9kyxPz9do9flLk4FZhRzTsfBvF/tetflXi5/3xndSar029vN25Xp8zDbKRPltGHTa0P0wp+VUZ++zLCpaO0frGVLovInjF233Vvbxbpzszo8bzI5SEs9ryPx8T+1SFMrsdZ902SD2NGv2rWq2utYKr4hyPYN8d0mZdnF1xbPMxa+7bG1Rh47HUZ/fFR5fZ6ibFvCoyHOcC/KvHymsTzNbls0bnPTtp8COtftcbFSYHNbnvTxu3N5dCH25vj+XJcXeFwWfF4VfGrrRJXsyz2nn7Hh5z3zxSJfQ58x/ZekfZwFNWHW+ifWxLbc83F/N0i0nYRuVoSvcrVdttVFj+UmZ8rwwylO8e7ZbgTdufHY84ny+yNtEr68zKXDdwnm7r5m1tJdyaJzrgocnl5vx9be3za/lehNK7O/iaPWD0MVn4mDO5Hzz1x4/Gp6m9rXD3N82IYXN/HMqYGxUM/nvr6crzYpNebdo913rdyf7cD5tjhua+2/nYHFKXniL/dAWU/e7ZKXvSc75w77tGXO8/+/Gzt6lmYVx85n1+93SCXk6a+XuK1Oxbfa1LnWqeP588nfe9qtMvD1ai+eUmrgyL+9JLWf8R18Q+4MXY5MGZ7bM37u2NrTN/Q5yWubgO9Njgv0b4+OC8hv/UNj/zY01HELm4CSVzOEjSetvwwse6blI/Lh8b3KZ/OxweVerxexDpPWvc53iwS+/h7PxmX94q47GfZ/H7Od1Hk66l6uRxtPwPvMt5dmX7bA+NdLooM+W1XhvnKrs0ulkN/2+Ww/bYYt8fHvn+1HF9+ouU7JV463o0vP9Ny3RoMz/t9mON5a1w9dfVDirx6E0iunpt67SbQZYnXbgJdl3jpJtB1a7x4E+g7TfriTaAZX78JdH2U6fpwOW/PjzJzfnn4q99uXx7+6rf21eGvyxKvDX+9viYXw1+XLfra8Fe/2deHv66X46XhrzySfe2Kt1897fTq8Nd1kReHvy6LvDr8db0kLw5/XRd5cfirt/4jhr++V+bF4a/vlHl1+Ot7ZV4c/rpu4BeHv66LvDj8ddmDXhyrmfPrw1+XNV4b/upXt31eDAPpXx/+ulyO15r0O5v2teGv7+yrrw5/fafMq8Nf3yvz6vDX5WnWS0MK3zlTe2lIweyrQwq9y9eHFHrvP2BI4XJqu+wHU+/XJxeTuS+LxD4j6I+zOT45yX6nwP3C8c0i68PdVeTjfL1vG/a3LvLq1U3X21evbi5LvHZ1c13ipaub69Z48ermO0362tVN1x/xdMvVgylzPwGxZtk8XNx8+1rO37hGG0x2aB+e9/m2yOVV1uRVCo+PyMjHGRPdvvweluvleBj8nh8eGeqfKTJ4jPrD6OZnigzh6uTDA67ftoj+gIy/Ota8mvGXqyOyn9cV+fBWqW9X52pXc+P0yM2f9ZvvFeFdKO5Nnxa5fA3bvibojy/b+dXq+I94d/5ly2rsGWE6pL+3t60v6u0i/WLz+A94gqC7/oi97XL6BJ1HTN8LNmnKVDC/SMerlwa+3ibjN28TXu4g86JN4nL8J/ab7u7sTzvPd4pwB9nG02HoHpdz7NjE/uFFaN8WuXqQwPZbc9anOCnyzW3XHvr1caSrEfEXLx2v5gu+PGZy9cK8T4yZXJd5ebDjezuKPewo/dmOMn7E3ja+/Fji9W7y4kDy6F8fSL66m/XiQPJViRcHkl9ek+cDyd/peK8NJF/dzXpxIPm65706gntZ5NUR3PAfMIJ7uSSvjuB+J0heHTX9TpC8Otx5uUqvDndeFnl1uPNy0sJrY3PXkydeGu68rvHacKde3Qt67Zilt/b14c7L5Xi1Sf0HDHde76svD3del3l5uPM7ZV4c7vze1dJ8+GRPe/aYlF7eWPohl1ymvCPtwyPs37zfrF1+jIDXvEt7/oTTd4oIZ9I2L4pcDb++/E5yvfy+1G1X8dvjRv7UksRDVLd+sSRXg1q3aA+P9j0+4fSrMpdPbu8XFTxkrFh84rq6PTzd1PrDm5u+/Sbd1feu9tun4+HbGf0TI5Yv3Sj4zqDnSzcKLl9y9NoMyOv3JL2yFNevN+SlgDYePyH0iVckMt3njvpejTH4DNH0t2r0G5OwbvJ8XdrVbb5X39V4WcRj76IeD6+e8E+UGHsA+N6m8V6J/YIkH/H0paJXWyX2Qki8+wLNDzXszRqNGnLxAs2vv1JQv/5KQe3+m5Z48f3Il+25T+4kfL65Tfg+TMw3k+NxOd6tMTj5GPZuDa6rrmpcvxv5tTy/fr3yK3l+/aL4fdE8m773qvn98Y87PnuAf3x5av/48sz+689c7PcYm/c3P3MRu59ZyO3NGvu4tkbM3qyhLIe/+ekQ7sHfy737yY49U9pGe7s9BjWeb5fLz8Lw1Q+9/OjHyzXivRq8GlqvPoNy/Q2lfedb/eozKN95uIjT+2kX1yuXT0txGqf+cBX37UXp1T2V1655vrMyr17yXN2r+sQlz9Xmee2S53ID8/5fHRcfItDLW1Wf2MLj61v4u8vy4tXx1Q2E1z7ZdVnixQvs76zMq3vb5dsEX9/bQn/TvW3sl6vpbM8jSS9f8iYcs+Tx5crjmxpXQRDCIyAPb0b6psblukzbdwDnxfdq9Oqpq1fX5eoO0w9YF7vtWwh3fO+QZbIPFSbN36vRWI6mP6DG1ecHL2vst/ZYG29+Ya7ty9t7ubfbdNKm9maNRo3+/Ltf158s74xb6uMF2cePEej88iuEv1PipavTKb9piRefY7tqz84Eke5+0Z6Xz46+8ML8y6X4cFtKL5Yivp5gVx+7ejHBLtfFuC113+Ofrst1DY3/3+3LX9XQy1ug3GtQf6vGa8NzlxVeGp27rvDK4Nzl/YXXxhv6Vy+zf8DHn6/GPPiwzZjP71Xa7erR6qZM+TN7eq/ydnmavqeXj4drym9PjS9ns+wvpTd/LPHNq8WuSjhfpHp8ofRnSow9fHPH95Zi7u4ht1t7p4TcHqbIan9rKfg6T4vx3orE5AN97a0VuR+Jdok231uKvicF3M+c9K0SeVl3lLCH05RvS9yD+eraYA+i6+Oe0ebra7Ij535Yfq8xlO+LqbQvt+ebJebDt9Ie2vPbS63rz/rtqQDz8dGJT5SYtnv7tHivBO8FnQ+d5BMl5LZfpy8fbnh9ooTus+j7Yfi9pVBOgPXhS4ufKWF8i8sevrT0qRL7lfF3bO+V4EMtH74X96ml4BTn4QmUd5fi3RJ7Bxdvb+3g61GPXcLe26h88lo83lyKPS/6fnv69uUVea9EH/tqoo+hb5ZgfOj21kbtc79DtU9/3pym9lseSPrcH0S+Y7y3Jvsd0Xd8bw9v+yhwx/d6+40vKrXbe729Nc6h5fbmijglvr4ib5ZoRPjjrcdPlTAeWPP5ZgmmYMbtyyvybgnmHbf53rFI2KjSxpslbpSYX12Rd0sI73p5/DLlrzLn8sNUX88cjx0Yjxmut/Z6CT5dEg+PPLxdIt4qEfs5kDvO90oES/FwMPpMiSkcjOy9thj7ybb++GTpuyXkvY069oBSHw9D858qsc/C++NYzqdKDFbk4bsYnyrBzLUx39yoN57Ub28theSrbM/e/vBw7KdK+MPjUva0hF1+h+rhM+MfHhEcry/GJIDnW/1M+n468D6qJu+V2Hv4Hf29Evvm8Xrv1psl+Bq3+pdL2LtL8TCqf3uvhNMWs315Kb7dqP9+/9c//unnv/3hl7/+6Y9///mvf/nf+1/+axX7289//I9f/nz+63/94y9/evi/f/+//1P/5z/+9vMvv/z833/4n7/99U9//s9//O3Pq9L6fz/dzn/8m877Le37eL//++9+avd/t/VxkPtttHH/937/9/v/jVj/L3/5Pj79u/s/5voPx2/fb2bd/xH//q+1uP8P"
|
|
2388
|
-
},
|
|
2389
|
-
{
|
|
2390
|
-
"name": "public_dispatch",
|
|
2391
|
-
"is_unconstrained": true,
|
|
2392
|
-
"custom_attributes": [
|
|
2393
|
-
"abi_public"
|
|
2394
|
-
],
|
|
2395
|
-
"abi": {
|
|
2396
|
-
"parameters": [
|
|
2397
|
-
{
|
|
2398
|
-
"name": "selector",
|
|
2399
|
-
"type": {
|
|
2400
|
-
"kind": "field"
|
|
2401
|
-
},
|
|
2402
|
-
"visibility": "private"
|
|
2403
|
-
}
|
|
2404
|
-
],
|
|
2405
|
-
"return_type": null,
|
|
2406
|
-
"error_types": {
|
|
2407
|
-
"361444214588792908": {
|
|
2408
|
-
"error_kind": "string",
|
|
2409
|
-
"string": "attempt to multiply with overflow"
|
|
2410
|
-
},
|
|
2411
|
-
"1998584279744703196": {
|
|
2412
|
-
"error_kind": "string",
|
|
2413
|
-
"string": "attempt to subtract with overflow"
|
|
2414
|
-
},
|
|
2415
|
-
"5755400808989454547": {
|
|
2416
|
-
"error_kind": "string",
|
|
2417
|
-
"string": "Function get_update_delay can only be called statically"
|
|
2418
|
-
},
|
|
2419
|
-
"6804164082532189961": {
|
|
2420
|
-
"error_kind": "string",
|
|
2421
|
-
"string": "New update delay is too low"
|
|
2422
|
-
},
|
|
2423
|
-
"12511970388699677811": {
|
|
2424
|
-
"error_kind": "fmtstring",
|
|
2425
|
-
"length": 27,
|
|
2426
|
-
"item_types": [
|
|
2427
|
-
{
|
|
2428
|
-
"kind": "field"
|
|
2429
|
-
}
|
|
2430
|
-
]
|
|
2431
|
-
},
|
|
2432
|
-
"12579274401768182412": {
|
|
2433
|
-
"error_kind": "string",
|
|
2434
|
-
"string": "New contract class is not registered"
|
|
2435
|
-
},
|
|
2436
|
-
"13455385521185560676": {
|
|
2437
|
-
"error_kind": "string",
|
|
2438
|
-
"string": "Storage slot 0 not allowed. Storage slots must start from 1."
|
|
2439
|
-
},
|
|
2440
|
-
"14990209321349310352": {
|
|
2441
|
-
"error_kind": "string",
|
|
2442
|
-
"string": "attempt to add with overflow"
|
|
2443
|
-
},
|
|
2444
|
-
"15353471697975175405": {
|
|
2445
|
-
"error_kind": "string",
|
|
2446
|
-
"string": "msg.sender is not deployed"
|
|
2447
|
-
},
|
|
2448
|
-
"15764276373176857197": {
|
|
2449
|
-
"error_kind": "string",
|
|
2450
|
-
"string": "Stack too deep"
|
|
2451
|
-
},
|
|
2452
|
-
"16431471497789672479": {
|
|
2453
|
-
"error_kind": "string",
|
|
2454
|
-
"string": "Index out of bounds"
|
|
2455
|
-
}
|
|
2456
|
-
}
|
|
2457
|
-
},
|
|
2458
|
-
"bytecode": "JwACBAEoAAABBIBRJwAABFElAAAAQScCAgQBJwIDBAAfCgACAAMAUC0IUAElAAAA1ScCAQRRJwICBAA7DgACAAEnAEMAAywAAEQAAAAAAA6S+filNOhY/Pd32iBuCLDGIOz53rIdE0eYE/YoAABFBQJYLAAARgAwZE5y4TGgKbhQRbaBgVhdKDPoSHm5cJFD4fWT8AAAACcARwQDJwBIBAAnAEkAACcASgEBJwBLBAEnAEwAAScATQQCJwBOACsrAABPAAAAAAAAAAABAAAAAAAAAAAmJQAADd8pAgACAPqRAssKKgECAycCBAQAJwIGBAMAKgQGBS0IAQIACAEFAScDAgQBACICAgUtDgQFACIFAgUtDgQFJwIFBAMAKgIFBCcCBAAHJwIFAQAkAgADAAABOCMAAAYqLQgBAycCBgQCAAgBBgEnAwMEAQAiAwIGHzAASwBLAAYtCAEGAAABAgEtDgMGLQgBAwAAAQIBLQxIAycCCAQJLQgACS0KBgotCgMLAAgACAAlAAAOBS0CAAAtCgoHACIHSwYtCwYDHgIABgAeAgAHACcCCgQLLQgACwAIAAoAJQAADlotAgAALQoMCC0KDQkkAgAIAAAB2CcCCgQAPAYKAS0IAQgnAgoEBAAIAQoBJwMIBAEAIggCCi0KCgstDEkLACILAgstDEkLACILAgstDEkLLQgBCicCCwQEAAgBCwEnAwoEAQAiCgILLQoLDC0OBAwAIgwCDC0OBwwAIgwCDC0OCQwnAgsEDC0IAAwtCgoNLQhHDgAIAAsAJQAADoAtAgAALQoNBzMKAAcACiQCAAoAAAJyJQAAEdAtCwgHACIHAgctDgcILQgBBycCCgQEAAgBCgEnAwcEAQAiBwIKLQoKCy0OBAsAIgsCCy0MQwsAIgsCCy0OAwsnAgsEDC0IAAwtCgcNLQhHDgAIAAsAJQAADoAtAgAALQoNCjMKAAoAByQCAAcAAALnJQAAEeItCAEHJwIKBAMACAEKAScDBwQBACIHAgotCgoLLQxMCwAiCwILLQ4JCycCCwQMLQgADC0KBw0tCE0OAAgACwAlAAAR9C0CAAAtCg0KCiIKSQcKKgcFCyQCAAsAAANKJQAAFUQnAgsEDC0IAAwtCgoNAAgACwAlAAAVVi0CAAAtCg0HLQgBCwAAAQIBLQ4HCy0IAQcAAAECAS0MSActCwgMACIMAgwtDgwIJwINBA4tCAAOLQoLDy0KBxAtCE4RLQoIEgAIAA0AJQAAFgctAgAALQoPDCcCDQQOLQgADi0KDA8ACAANACUAABb1LQIAAC0KDwctChAILQoRCx4CAAwALyoACgAMAA0nAhIEEy0IABMtCg0UAAgAEgAlAAAXSy0CAAAtChQMLQoVDi0KFg8tChcQLQoYER4CAA0GJwITBBQtCAAULQoMFS0KDhYtCg8XLQoQGC0KERktCg0aAAgAEwAlAAAYRi0CAAAtChUSACoNEhMOKg0TFCQCABQAAARtJQAAGLcMKg0LEhYKEgscChINABwKCxIABCoNBwsEKhIIBwAqCwcIJwILBBQtCAAULQoIFS0KAxYtChMXLQoMGC0KDhktCg8aLQoQGy0KERwACAALACUAABjJLQIAAC0KFQctCwcLACILAgstDgsHJwIMBBQtCAAULQoHFS0IRxYACAAMACUAABoiLQIAAC0KFQsAIgdLDS0LDQwAIgdNDi0LDg0AIgdHDy0LDw4tCAEHJwIPBAUACAEPAScDBwQBACIHAg8tCg8QLQ4MEAAiEAIQLQ4NEAAiEAIQLQ4OEAAiEAIQLQ4LECcCCwQULQgAFC0KChUtCgcWAAgACwAlAAAdci0CAAAcChMHACcCCwQFJwINBAMAKgsNDC0IAQoACAEMAScDCgQBACIKAgwtDgsMACIMAgwtDgsMJwIMBAMAKgoMCy0KCwwtDEQMACIMAgwtDgkMACIMAgwtDggMACIMAgwtDgMMACIMAgwtDgcMJwIDBAUAIgoCCS0LCQktCgkIJwILBAMAKgoLBzcOAAgABy0LAgMAIgMCAy0OAwIAIgICCC0LCAgtCggHJwIJBAMAKgIJAzsOAAcAAyMAAAYqKQIAAwDAe14ZCioBAwYkAgAGAAAGRSMAAAp6LQgBBicCBwQCAAgBBwEnAwYEAQAiBgIHHzAASwBLAActCAEHAAABAgEtDgYHLQgBBgAAAQIBLQxIBicCCQQKLQgACi0KBwstCgYMAAgACQAlAAAOBS0CAAAtCgsIACIISwctCwcGHAoGCAUcCggHABwKBwYFHgIABwAeAgAIACcCCwQMLQgADAAIAAsAJQAADlotAgAALQoNCS0KDgokAgAJAAAG9CcCCwQAPAYLAS0IAQknAgsEBAAIAQsBJwMJBAEAIgkCCy0KCwwtDEkMACIMAgwtDEkMACIMAgwtDEkMLQgBCycCDAQEAAgBDAEnAwsEAQAiCwIMLQoMDS0OBA0AIg0CDS0OCA0AIg0CDS0OCg0nAggEDC0IAAwtCgsNLQhHDgAIAAgAJQAADoAtAgAALQoNBDMKAAQACCQCAAgAAAeOJQAAEdAMIgZFBAoqBAUIJAIACAAAB6UlAAAdxC0IAQQnAggEAwAIAQgBJwMEBAEAIgQCCC0KCAstDEwLACILAgstDgoLJwIKBAstCAALLQoEDC0ITQ0ACAAKACUAABH0LQIAAC0KDAgKIghJBAoqBAUKJAIACgAACAglAAAVRB4CAAQALyoACAAEAAonAg8EEC0IABAtCgoRAAgADwAlAAAXSy0CAAAtChEELQoSCy0KEwwtChQNLQoVDh4CAAoGJwIQBBEtCAARLQoEEi0KCxMtCgwULQoNFS0KDhYtCgoXAAgAEAAlAAAYRi0CAAAtChIPDCoPBgQkAgAEAAAIriMAAAiOAioPBgQOKgYPByQCAAcAAAilJQAAHdYtCgQDIwAACLwnAgQFAC0KBAMjAAAIvAAqCgMEDioKBAckAgAHAAAI0yUAABi3JwIHBBAtCAAQLQoIEQAIAAcAJQAAFVYtAgAALQoRAy0IAQcAAAECAS0OAwctCAEDAAABAgEtDEgDLQsJCgAiCgIKLQ4KCScCCwQQLQgAEC0KBxEtCgMSLQhOEy0KCRQACAALACUAABYHLQIAAC0KEQonAgsEEC0IABAtCgoRAAgACwAlAAAW9S0CAAAtChEDLQoSBy0KEwknAgsEEC0IABAtCgMRLQoHEi0KCRMtCEoULQoPFS0IShYtCgYXLQoEGAAIAAsAJQAAGMktAgAALQoRCi0LCgMAIgMCAy0OAwonAgQECy0IAAstCgoMLQhHDQAIAAQAJQAAGiItAgAALQoMAwAiCksGLQsGBAAiCk0HLQsHBgAiCkcJLQsJBy0IAQknAgoEBQAIAQoBJwMJBAEAIgkCCi0KCgstDgQLACILAgstDgYLACILAgstDgcLACILAgstDgMLJwIDBAotCAAKLQoICy0KCQwACAADACUAAB1yLQIAAC0LAgMAIgMCAy0OAwIAIgICBi0LBgYtCgYEJwIHBAMAKgIHAzsOAAQAAyMAAAp6KQIAAgAFVXv6CioBAgMkAgADAAAKlSMAAAweHgIAAgAeAgADAB4CAAQJJAIABAAACrElAAAd6B4CAAQBCiIERgYWCgYHHAoHCAAEKggEBwoqBgUEJAIABAAACt8nAggEADwGCAEtCAEEJwIGBAMACAEGAScDBAQBACIEAgYtCgYILQxMCAAiCAIILQ4HCCcCBwQILQgACC0KBAktCE0KAAgABwAlAAAR9C0CAAAtCgkGCiIGSQQKKgQFByQCAAcAAAtCJQAAFUQeAgAEBh4CAAcALyoABgAHAAgnAgwEDS0IAA0tCggOAAgADAAlAAAXSy0CAAAtCg4GLQoPBy0KEAktChEKLQoSCycCDAQNLQgADS0KBg4tCgcPLQoJEC0KChEtCgsSLQoEEwAIAAwAJQAAGEYtAgAALQoOCBwKCAQAJwIHBAEnAgkEAwAqBwkILQgBBgAIAQgBJwMGBAEAIgYCCC0OBwgAIggCCC0OBwgnAggEAwAqBggHLQoHCC0OBAgAIgYCCC0LCAgtCggHJwIJBAMAKgYJBDsOAAcABCMAAAweJwICAlUnAgMCbicCBAJrJwIGAm8nAgcCdycCCAIgJwIJAnMnAgoCZScCCwJsJwIMAmMnAg0CdCcCDgJyJwIPAnsnAhACfS0IAREnAhIEHAAIARIBJwMRBAEAIhECEi0KEhMtDgITACITAhMtDgMTACITAhMtDgQTACITAhMtDgMTACITAhMtDgYTACITAhMtDgcTACITAhMtDgMTACITAhMtDggTACITAhMtDgkTACITAhMtDgoTACITAhMtDgsTACITAhMtDgoTACITAhMtDgwTACITAhMtDg0TACITAhMtDgYTACITAhMtDg4TACITAhMtDggTACITAhMtDg8TACITAhMtDgkTACITAhMtDgoTACITAhMtDgsTACITAhMtDgoTACITAhMtDgwTACITAhMtDg0TACITAhMtDgYTACITAhMtDg4TACITAhMtDhATCiIFSgIkAgACAAAN3ycCAwQeLQgBBCcCBgQeAAgBBgEtCgQGKgMABgWto3LG+qaEcwAiBgIGACIRAgcnAggEGy0CBwMtAgYELQIIBSUAAB36JwIHBBsAKgYHBi0MTAYAIgYCBi0OAQYAIgYCBjwOAwQoAAAEBHhRDAAABAMkAAADAAAOBCoBAAEF2sX11rRKMm08BAIBJiUAAA3fLQsBAy0LAgQKIgRIBSQCAAUAAA4kJQAAHiwAIgNLBS0LBQQtCAEFJwIGBAIACAEGAScDBQQBACIFAgYtCgYHLQ4EBy0OAwEtDEsCLQoFASYlAAAN3x4CAAEBCiIBRgIWCgIDHAoDAgAEKgIBBC0KAwEtCgQCJiUAAA3fHAoCBAAEIgRPBS0IAQQAAAECAS0IAQYnAgcEBQAIAQcBJwMGBAEAIgYCBy0KBwgtDEkIACIIAggtDEkIACIIAggtDEkIACIIAggtDgUILQ4GBAYiAkcFLQhIAyMAAA7lDCoDBQYkAgAGAAAQZSMAAA73BiICRwUEIgVHBgIqAgYDCiIDSAUWCgUGJAIABQAAD/8jAAAPHAIqAgMFDioDAgckAgAHAAAPMyUAAB3WLQsEBwAiB0sJLQsJCAwiBUcJJAIACQAAD1IlAAAeLAAiAQIKACoKBQstCwsJACoICQotAgcDJwAEBAUlAAAePi0IBQgAIghLCS0OCgktDggEDChLAwckAgAHAAAPliMAAA//ACIITQctCwcDACIFSwcOKgUHCSQCAAkAAA+2JQAAGLcMIgdHBSQCAAUAAA/IJQAAHiwAIgECCQAqCQcKLQsKBQAqAwUBLQIIAycABAQFJQAAHj4tCAUDACIDTQUtDgEFLQ4DBCMAAA//CiICSAESKgEGAiQCAAIAABAWIwAAEFMtCwQBLQsBAgAiAgICLQ4CAS0IAQInAgMEBQAIAQMBJwMCBAEAIgECAwAiAgIFPw8AAwAFLQ4CBCMAABBTLQsEAQAiAUsDLQsDAi0KAgEmLQsEBgAiBksILQsIBwQiA0cIBiIIRwoKKgoDCSQCAAkAABCOJQAAHp0MIghHCSQCAAkAABCgJQAAHiwAIgECCgAqCggLLQsLCQAqBwkKLQIGAycABAQFJQAAHj4tCAUHACIHSwktDgoJACIHTQktCwkGACIISwkOKggJCiQCAAoAABDuJQAAGLcMIglHCiQCAAoAABEAJQAAHiwAIgECCwAqCwkMLQsMCgAqBgoJLQIHAycABAQFJQAAHj4tCAUGACIGTQotDgkKACIGRwktCwkHACIITQkOKggJCiQCAAoAABFOJQAAGLcMIglHCCQCAAgAABFgJQAAHiwAIgECCgAqCgkLLQsLCAAqBwgJLQIGAycABAQFJQAAHj4tCAUHACIHRwgtDgkILQsHBgAiBgIGLQ4GBy0IAQYnAggEBQAIAQgBJwMGBAEAIgcCCAAiBgIJPw8ACAAJLQ4GBAAiA0sGLQoGAyMAAA7lKgEAAQXVEn0pwtLo7TwEAgEmKgEAAQWuko9rqY6SjDwEAgEmJQAADd8cCgIEAAQiBE8FLQgBBAAAAQIBLQgBBicCBwQFAAgBBwEnAwYEAQAiBgIHLQoHCC0MSQgAIggCCC0MSQgAIggCCC0MSQgAIggCCC0OBQgtDgYEBiICRwUtCEgDIwAAElkMKgMFBiQCAAYAABPZIwAAEmsGIgJHBQQiBUcGAioCBgMKIgNIBRYKBQYkAgAFAAATcyMAABKQAioCAwUOKgMCByQCAAcAABKnJQAAHdYtCwQHACIHSwktCwkIDCIFTQkkAgAJAAASxiUAAB4sACIBAgoAKgoFCy0LCwkAKggJCi0CBwMnAAQEBSUAAB4+LQgFCAAiCEsJLQ4KCS0OCAQMKEsDByQCAAcAABMKIwAAE3MAIghNBy0LBwMAIgVLBw4qBQcJJAIACQAAEyolAAAYtwwiB00FJAIABQAAEzwlAAAeLAAiAQIJACoJBwotCwoFACoDBQEtAggDJwAEBAUlAAAePi0IBQMAIgNNBS0OAQUtDgMEIwAAE3MKIgJIARIqAQYCJAIAAgAAE4ojAAATxy0LBAEtCwECACICAgItDgIBLQgBAicCAwQFAAgBAwEnAwIEAQAiAQIDACICAgU/DwADAAUtDgIEIwAAE8ctCwQBACIBSwMtCwMCLQoCASYtCwQGACIGSwgtCwgHBCIDRwgGIghHCgoqCgMJJAIACQAAFAIlAAAenQwiCE0JJAIACQAAFBQlAAAeLAAiAQIKACoKCAstCwsJACoHCQotAgYDJwAEBAUlAAAePi0IBQcAIgdLCS0OCgkAIgdNCS0LCQYAIghLCQ4qCAkKJAIACgAAFGIlAAAYtwwiCU0KJAIACgAAFHQlAAAeLAAiAQILACoLCQwtCwwKACoGCgktAgcDJwAEBAUlAAAePi0IBQYAIgZNCi0OCQoAIgZHCS0LCQcAIghNCQ4qCAkKJAIACgAAFMIlAAAYtwwiCU0IJAIACAAAFNQlAAAeLAAiAQIKACoKCQstCwsIACoHCAktAgYDJwAEBAUlAAAePi0IBQcAIgdHCC0OCQgtCwcGACIGAgYtDgYHLQgBBicCCAQFAAgBCAEnAwYEAQAiBwIIACIGAgk/DwAIAAktDgYEACIDSwYtCgYDIwAAElkqAQABBbq7IdeCMxhkPAQCASYlAAAN3y0IAQMnAgQEBAAIAQQBJwMDBAEAIgMCBC0KBAUtDEkFACIFAgUtDEkFACIFAgUtDEkFLQgBBAAAAQIBLQ4DBC0ISAIjAAAVowwiAkcDJAIAAwAAFbojAAAVtS0LBAEmHAoCAwAAKgEDBR4CAAMALyoABQADAAYtCwQDLQIDAycABAQEJQAAHj4tCAUFACIFAgcAKgcCCC0OBggtDgUEACICSwMtCgMCIwAAFaMlAAAN3y0IAQYAAAECAS0OBAYnAgQABAoqAwQHLQhIBSMAABYsDCIFRwQkAgAEAAAWQyMAABY+LQsGASYtCwEILQsCCQwiCUcKJAIACgAAFl0lAAAeLAAiCAILACoLCQwtCwwKACIJSwsOKgkLDCQCAAwAABaCJQAAGLctDggBLQ4LAiQCAAcAABa2IwAAFpcKIgNOCCQCAAgAABatJwIJBAA8BgkBLQoKBCMAABa/LQoKBCMAABa/LQsGCC0CCAMnAAQEBCUAAB4+LQgFCQAiCQIKACoKBQstDgQLLQ4JBgAiBUsELQoEBSMAABYsJQAADd8tCwECACICAgItDgIBACIBTQMtCwMCLQsBAwAiAwIDLQ4DAQAiAUcELQsEAwAiAUsFLQsFBBwKBAUEHAoFAQAcCgEEBS0KAgEtCgMCLQoEAyYlAAAN3xwKAQMEHAoDAgACKgECAywCAAEALV4Ji4K6N7Q7maExYRj9INQvUWbJ6fE/teplqW0eCm0EKgMBAhwKAgQEHAoEAwACKgIDBAQqBAECHAoCBQEcCgUEABwKBAUBAioCBAYsAgACADAz6iRuUG6Jjpf1cMr/1wTLC7RgMT+3ILKeE55cEAABBCoGAgccCgcIBBwKCAYAAioHBggEKggBBxwKBwgBHAoIAQAcCgEIAQIqBwEJBCoJAgccCgcJBBwKCQIAHAoCBwUcCgECBQQqAgcBHAoGAgUcCgQGBQQqBgIEHAoDAgUtCgUDLQoCBS0KAQItCggBJiUAAA3fDCoGBQgpAgAFBQABUYAkAgAIAAAYjCMAABhmFgoDARwKAwIFHAoBAwUEKgIEAQQqAwUCACoBAgMtCgMHIwAAGLIWCgEDHAoBBAUcCgMBBQQqBAIDBCoBBQIAKgMCAS0KAQcjAAAYsi0KBwEmKgEAAQXQB+v0y8ZnkDwEAgEmJQAADd8cCgMJABwKCAMAJwIIAAInAgoAICcCDAQNLQgADS0KCA4tCgoPAAgADAAlAAAery0CAAAtCg4LBCoDCwoAKgkKAxwKBgkAJwIGAEAnAgsEDC0IAAwtCggNLQoGDgAIAAsAJQAAHq8tAgAALQoNCgQqCQoGACoDBgkcCgcDACcCBgBIJwIKBAstCAALLQoIDC0KBg0ACAAKACUAAB6vLQIAAC0KDAcEKgMHBgAqCQYDHAoEBgAnAgQAaCcCCQQKLQgACi0KCAstCgQMAAgACQAlAAAery0CAAAtCgsHBCoGBwQAKgMEBhwKBQMAJwIEAHAnAgcECS0IAAktCggKLQoECwAIAAcAJQAAHq8tAgAALQoKBQQqAwUEACoGBAMtCAEEJwIFBAQACAEFAScDBAQBACIEAgUtCgUGLQ4DBgAiBgIGLQ4BBgAiBgIGLQ4CBi0KBAEmJQAADd8cCgIEAAQiBE8FLQgBBAAAAQIBLQgBBicCBwQFAAgBBwEnAwYEAQAiBgIHLQoHCC0MSQgAIggCCC0MSQgAIggCCC0MSQgAIggCCC0OBQgtDgYEBiICRwUtCEgDIwAAGocMKgMFBiQCAAYAABwHIwAAGpkGIgJHBQQiBUcGAioCBgMKIgNIBRYKBQYkAgAFAAAboSMAABq+AioCAwUOKgMCByQCAAcAABrVJQAAHdYtCwQHACIHSwktCwkIDCIFRwkkAgAJAAAa9CUAAB4sACIBAgoAKgoFCy0LCwkAKggJCi0CBwMnAAQEBSUAAB4+LQgFCAAiCEsJLQ4KCS0OCAQMKEsDByQCAAcAABs4IwAAG6EAIghNBy0LBwMAIgVLBw4qBQcJJAIACQAAG1glAAAYtwwiB0cFJAIABQAAG2olAAAeLAAiAQIJACoJBwotCwoFACoDBQEtAggDJwAEBAUlAAAePi0IBQMAIgNNBS0OAQUtDgMEIwAAG6EKIgJIARIqAQYCJAIAAgAAG7gjAAAb9S0LBAEtCwECACICAgItDgIBLQgBAicCAwQFAAgBAwEnAwIEAQAiAQIDACICAgU/DwADAAUtDgIEIwAAG/UtCwQBACIBSwMtCwMCLQoCASYtCwQGACIGSwgtCwgHBCIDRwgGIghHCgoqCgMJJAIACQAAHDAlAAAenQwiCEcJJAIACQAAHEIlAAAeLAAiAQIKACoKCAstCwsJACoHCQotAgYDJwAEBAUlAAAePi0IBQcAIgdLCS0OCgkAIgdNCS0LCQYAIghLCQ4qCAkKJAIACgAAHJAlAAAYtwwiCUcKJAIACgAAHKIlAAAeLAAiAQILACoLCQwtCwwKACoGCgktAgcDJwAEBAUlAAAePi0IBQYAIgZNCi0OCQoAIgZHCS0LCQcAIghNCQ4qCAkKJAIACgAAHPAlAAAYtwwiCUcIJAIACAAAHQIlAAAeLAAiAQIKACoKCQstCwsIACoHCAktAgYDJwAEBAUlAAAePi0IBQcAIgdHCC0OCQgtCwcGACIGAgYtDgYHLQgBBicCCAQFAAgBCAEnAwYEAQAiBwIIACIGAgk/DwAIAAktDgYEACIDSwYtCgYDIwAAGoclAAAN3ycCBAQELQhIAyMAAB2FDCoDBAUkAgAFAAAdmCMAAB2XJhwKAwUAACoBBQYAIgICBwAqBwMILQsIBTAKAAUABgAiA0sFLQoFAyMAAB2FKgEAAQVebT8u3M2HCTwEAgEmKgEAAQUbvGXQP9zq3DwEAgEmKgEAAQVP30qK18/w0zwEAgEmAAADBQctAAMILQAECQoACAcKJAAACgAAHistAQgGLQQGCQAACAIIAAAJAgkjAAAeByYqAQABBeQIUEUCtYwfPAQCASYtAQMGCgAGAgckAAAHAAAeVCMAAB5dLQADBSMAAB6cLQABBQAAAQQBAAADBAktAAMKLQAFCwoACgkMJAAADAAAHpctAQoILQQICwAACgIKAAALAgsjAAAecycBBQQBJioBAAEFBQQbmSCvYEw8BAIBJiUAAA3fLQgBBAAAAQIBLQxMBCcCBgQCJwIHAQEtCAEFJwIIBCEACAEIAScDBQQBACIFAggnAgkEIEMDqgACAAYACQAHAAgtAggDLQIJBCUAAB+cJwICBCEnAgYEIC0ISwMjAAAfFQwqAwIHJAIABwAAHywjAAAfJy0LBAEmLQsEBwQqBwcIAioGAwcOKgMGCSQCAAkAAB9MJQAAHdYMKgcGCSQCAAkAAB9eJQAAHiwAIgUCCgAqCgcLLQsLCRwKCQcABCoIAQkEKgcJCgIoTAcJBCoJCAcAKgoHCC0OCAQAIgNLBy0KBwMjAAAfFScABgQCBgAEBgUtAAQIJwAJBAAOAAUJCiQAAAoAAB/vAgAIAggAAAMJCy0BCwYAAAMICy0BCwcAAAMJCy0EBwsAAAMICy0EBgsAAAkCCSMAAB+vJg==",
|
|
2459
|
-
"debug_symbols": "tZ3bjh03robfpa9zoTOlvMpgEDiJExgwnMCTbGAjyLuP+JMiq3tQcnWtlVxkfU13UaIOFEWpVv/18vPHH//89YdPX3757T8v3//rr5cfv376/PnTrz98/u2nD398+u3LlP71Evh/KfaX7+N3LymRfOb08n3iT5LPoj8X/blG/Wzy2fTnpj9T0M+qn0M+e8FnjlNf4c8mnynqp/6c9eesP5f5XOXPLp816yfJJ5ePzyafXD7xZ9XPIZ896yfJ50j6KT+XEPVzPhfDhBgWzBrEwjBVxT4hsS38T2ko5LygK5QlQcMxoOUA3DSzLUrLC7oCcWtzNagp9LhgScaSDJXUEBaUBUMh5gVdIXERnaEpcJMLLElZkrIkNSwoC4YCrAB0BbYiRwZSYCsE6oKhMMoClbSQF/DjeQJbkWcXNB4tArNieUzIYUFdMPWU2c6Nu0CgK9QlqUvSlqSRAsUFTaGHBXUBF8EV48oLdAEKaUFTiHHBkqSwgB+fo5bYitIYugIqPxhIoaYFS9KWpC0JKg+oCqg8gCdSYhgKIy8ggc6TQKApxCWJdQE/Prugc+UFloR9BoCdRu0MpMCDX6AqtLDAJEOBZsVaYCCFnhY0hREW1AXz8TaHzeDxI9AV2Om0xEAKPJAE6oKhwHNZYP1yWY+XJanrcTanza4cbI5AWdAVYA5gSWAOoCmM9TiPqDYY2HHNysfA04ASE9uh1BbxYFKqi7LJcjHqi4ppKaal2hM8wamCuAaNiW1S6ot4kiu1RTzYlOyJbk8MewJOlymGZLS0RPa8RKC6KJks9UXcUT2A+qKiLTuJFlWTVZM1k/Hc6SC2SKktYouUilFfNOyJsZ5IIRgVo/VEYk+mZLKUjExLNi3s15Rmf3RuocSLolJfxFYqtUW8OCqZjBdIJdYyQGMRL5NKfRGsFCKlzJ5iBFBdxP2mZLJksuSysYh7UKkv4h5UokXVSmPbhHjCjQiqRmMRzzklWsSzTslkvJiOCmLN3C4IBZRMFk0G20CwTchk2WQ885TGInbqSn1RNRmPTqFmpTWrAZlmstLINHcrrZvmYZq538b0rLHyfFMyGWwTqotgm5DJsoR6E6pCCQs4RgoBOAzZtIVkyFNvoUtJ4tBYuwSisfHAKoChwJGYwJKkJUlLkiUujK3EBU2BfZxAWTAUmkSHE7oCpQVNoYcFVWEsCTttAbYicPUpZEeYyQ1FMTm6lD0Ah5iTSGLMSBm/CWEmQ7ZqYTOsLq3VcRg2VIbHAkKEhc2QjZv+Flgch+Fw6TBpD8WxG8JIRTLkJXdhM8woOAGL4zAsLi0urS6t3RBDS5EMYbFiMxSLK7A6DkOePgtp4QjJ0aUxOkIZj4YhFnfgMBQzB3AYFpfW5MhF8M5gLjDRsRmSS8ml3aWwTXEYojcVufnSrPpcubIjGcI2xWrIDmLhQToMM5QRsBsWl2LQKnLVOa5PAWbmBmRlGb/AS9XCbsgOfSEZDpeOtjDysrywOJqyGJMjP8aBforowpKAzRCDVrE4dsOSHP2x6o9VfwzTVLC5tLkygrLMOKChAOtChBwLu2FGwdwXCV5D0aVSB0HUoTNKHQS7odRBkAy7S3szRCVrABbHsTBjnCmSITpAkZVVSUcEx+oIZchToAMUuyE6QLEZogMU/bHqyppLmyuD8TUDyRCTTLEaivGCB+lYWMR4QVOG+GKuh8BmKMYLFsduiEVC0R8r/ljxx4o/Vv0xeBjB5tLmysiVkSujYdhh0AB2Q8xCxbYQmYqF1TC6FMkWRVbWkGtK2ZEMYbxiM8RYV+QiOMpPEpUIoucVXdpc2lxK2ZEMMewVm+GIjlZwg8WKKKIAh2HMjmQIv6PYDLNLNQZLSHcASlmAIIQnUrMIbCIZwscqNkNyKQxkgE3fcVYPDoIJPdRBMII9JhIZ02UxSq8IcpGELCDmI0FBIUMsAfILWAIEUT3eCk5shhh8isMQg48GkAwx+BRN2kNydClmnmI1xMxThMHIYcLtCGJ5UyRDDD7FZlhdivBMEcq4HToGn6JLMeIE0SG9A1k6IIWZHOFPl8v1HQSsjsMQw0yxGyaXYmIJYpgpurLsyoo/ht7k/UGSuEWxGbbgWBy7Iflj5I91fwzeVXC4dLiygaTrHLkZIUziqHtiN4wujS5FJlSRDLNLs0uREVVshsiKKlbD5tJWHFFwZqTsSIbI9Co2w2FS5EpSQBI9kGF0aXRpcmlyaXZpdmlxaXFpdWl1aXNpcym5FIlrQTFI0KXDpcOkCGEWFsdhKF0o2A3dzORmphwdvYjiRZTq6EVUL7h6Ec0LdouTW5zc4uQWp+5FDC94eBHDCs4hO1rB2Ts2e8fivGShFZxzcKyOXkQpjl5E9YK9j7P3MU5VFMkLJi+ie8Hdi+he8PAihhVcfCgXH8oIghZawQiCFlZHKwKZloUoAudFcgADlJMXwWYo01SwGpJLqRh2MhzJ0aQ1JEcrAoHNwuI4DJNLk0tzdjSDavEiiheM4xPetkzsCxtXZ3YDkAx5fVPkRs18XDKxOvIRDG98csvZsRsWlxaXVpfyMFJsOKuJwGqI88CASsqAQcEyYIAyYPALMmBwiocZwMdxGcmSxMmDjGxJ4u38zPdFR+6AyC6TMOcVq2F1aXVpcynctmI3hNtWJMOeHL1geDlFLwJznsOouXnIhlL1CmyGxaVYcWJjxFAWlJrJmWZ2dKlUByjV6UBUh5saQcPC4jgMpdWBaHU+vsyIFBSzS1H1xN0ypOp4rHhp1UurB6mX1rwOYhsQnpZTFRmr/9zXAqsja0h8QBtghaJLYYWgWCHoUrhMQQwYTmBMrIbVpVgkUgMOrcPME2fHbkguxYARxIBRbIZiEOHgGaXxQXPEUicoVRdshhg7iqwh48Qajl8Qjl/RpdWl1aXNpXCDaQDxC5GRo+25+QZ2Q7hBPqedrpqrw4mcic0QbjBXYDVMLk0uhe9T7IbFpZgBiiiC+0KuISi6FFawRyxyH0GqIwYB4YIUXQoXpNgXZrh49p4FWQtFrFnsPQuyForJpfDrglioFF0KZy6ImKvgHgHWY8HmUtjGjrTIeix1ENuAWI8VD9JhiAhEkW3jFFNBUmIhCubeLIhAFF2KzhJE2KHoUnSWIorg5sM5x0KXim0VSFYH2KbYDLtLYZsgnIJicTTbqttWxTbCZYzo2AyTS5NLs0uzS7Ee81l9kWsSwIYZgHsjDTOAF6p5nrNWp4JFWDGtFafgIGPhMMwuzS4tLi3dsCZHMmzRsRmSF0zV0Yvoa3UqDbMbSFJ17iySqgu6FOOBV6eJ1VBqhlstUjO54OJSqY4gHuvAtTIUHEks7IaYpsAeoiOcI3cAtvYLXYqq80I1sdpjyUrruTi6tHhpxerQxTZBFMEd2xE5wq93skWio1GxzHRYIThMOmCFYjOMLo22qA0MGCxJOFtQzC6F98RChe261AHbdcWaHF2KAaNoq9Og4IjScP8I3YIbPyEkx2YYg2N1XCvOjJqzYzfMLs0uLS4tLpX1eDBiEcZVogBfwqtTxT0FRTgQXqgmruWgBjgQRTjHChwLcV6w0KXwiIJYmhVdmqshogpekiZWw+pSWY9xT6uudWj6pezYDcmliCoEEVUoYh3ippbNtiIK5oaSzbaiSxGRKnbD5NIcHeHwuANwtrDQpbCNF6qJax2qqQ7DVhxdKrYJdkPYxh58IhnCNl5mJraFuJiwcBhi96Xo0kSGCGR5SZpIhsWlYhv3Jm4jSB1yrYYtOB6kw5CKYzd027LblsdacSpOEQQL+k3RpdGl0aXJpWmtTlUXbCCmCAGx3Co2w+7S7tLhUtRMcSzUO4iC3VDuIQpawbLcKloRFU6Xr/hUXBuYI4ER6wVnZCuuDSS+71Nx1TDx9ZiKBP1MuzBidnPmtOKeoWqAp1XsC3HbcKGV1hD6KLpU6itYDbEe85WaKuuxIOIdRdQMvwsrBNHUfJum4v5A4mstE7m+gwcBbhAsZA2DzcQNAkX0sSJXh7PCVRZhxYMUerl1CPVVdCkqKYhKKjZDLF+ouizCgph6QFmEBeE1OgFp2SYbXcVmWFwK5ygIB6J4kA5DOEdBzKGGgjFSBTFSFdFZ/Luy51XkduC7dhU3BRUxUhXR89wBsv1VxEjlVkeifCGK4KYe8PaKkHLzyZa2QC+8nCJLK6qD9q2494qOVWQNfAzZcKtvIaSZEaXxrcsmO9ZaGdF8ii6Fj+JTu4mQEl+uxdqtyBbzHcwmeWVFSPlurSx1fN2yyVLH1yub5JUVXQrvySdxTfLKfArWJK/MZ1hN8sqCGHKtAsmQXIrZ3bjqstQpuhR5OT6NmrMUTrfjUjDnuTg32OCrM2fSG3x15psxDb5akVxKB+kw5B5aSIZc8EKT4hLZQihjK+CrM9+4afDVmZNbDb56Zn6B1TC7lMO6hd2wJEcyrC7liFRRLB5AXMHGvWhYzDuUhktlmbcl04cFx4N0GI7sSAuRAl3o0hgdoYw7ANfLMm8qGu6XZd4+TI8JaQNWw+LSUhy7ISxWJMPmUnZiimIxAVFEx21wSAeQpQl3xDkwXHiQjoVyUV2RDHniLHQpbq4rQlnE7XMUkYCQZuAwhMWKLq0urS5t2ZEMcRlfsRniQr6gJARx410SghG4tqmNJCEIjGvrObEbpuzo0uzS7NKSHJthjY7V0DKyzTOyE4cheRG0tqlNc68FN/fxuzy4ulRd0KWy727AYVhW5rRpwlXQpVIdQTzGw0jTsAPYDXtyJENLwzZZkjA0cHarGF2KqmPAyA5QHkvZ0Uob2aXZShslOTZDSWtyxw7LWrZhWcuJK0faRk+OLh0rczqHTnB0acyOKKLiHYns6FJJJjfg2pCSnLwqNsPq0loNW3AshmIQAVc+lXA3TNATriR7PcVhGNfWk3TbB5Rtn6BLs0uzS4tLESPyjpVkAeQdK0VJYCZgM5TMXgaufSFFy1qSpmG5+eLIjiZNwaQpRsdmmFyahqGkKhtwGBaXyhacGzXVtSGdSIYtObqUomMztKwlJctakmZkuaHk3FTRpJqGBSJaUXRpqoay8wnAalhcCtt4xzpxbUhJTkgVu2FzaSNDSo4ra0nZspYkGVm8+JNHcDSppmEFu2F0aYqOKKLgVaHo6FKxrQLXhnTiMKzF0aUtO3ZDSo5mm2dkSTOyBByGkpEVNKlsERVdGl2a1jaV5IRUUHYoQNRh4HdRB74HQriMNccHI9YARZPiMlbm6xiE5GzmOyOEN5EyfBT8+sJhSFhYG7AbdpciGhRENKhoUtwaXujS6FKJCQSHYbYikKLLcGIDgQscE27JqLSj6gPIGuBshhwPCy5pD3ImDEQdFF0qZ8JAhCjsozp2HYrFpQhR2F1NRBGZESEKz+6Oc7LMbqXDK2d2ID1I+/LrXrjduxDt2//++7uX9bLqD398/fiR31U9vL36r79efv/w9eOXP16+//Ln58/fvfzfh89/4pf+8/uHL/j848PX+a/ThI9ffp6fU+Evnz5/ZPr7O386nD9acMsKT/O5lSmY+6WrKuY076pipnTCHRUJF92gYi5n8VRF3qgofRkyt48HQ1q/XAtsskRFTrfagm8OLhXTM5+qaOcq+ljdOQMlUzD3V5cVUDcF/VRBP1fAL9mtOvBrdt4fc0/5SsnYjIpYVmPOjY8bMs/mLg+syskVUTFX6NPG5Fj+tEMwEbVPa3Md8Y2OtGmP6fryao95qkGmheJrJbvxab0y1/nT0bk1heJqjhlL1HNT6m6itWBKZj7iYMrrbontGe1B/2R7NOwpoaLNfLbpqG8qMXYzHv5/OZ46TpvjupLWz5SkjTHUVosS+Sgt1wc679lXa8xt9llrpM0Q7T0s5zVTjO2sVzlcOK1FqVaLmTb1WV/otY66cz8j2/CaO5h0rmUzSDkJqkpmNtNXpXxZw8x8rGrMrGM707C3xNa1GOc28dySsdPiiwq/hxxPteStM022SPtcmXuZ68Nj2KrQZ/R1NjzyzpMWt6TUem/aHwd6G6fTfqdiDJttIZ2qyPXhuZLb43Ml0zPmSu6PzpWdhmtz5RuWXJwrJT5jrpT06FzZDo9rc6WUf3iuHAb6PJO4M1cIpyqiIqfTVbZsunaei661fp7b+/I4T+tf6+i78D54dO+dSu/QEF1DO9VQwzMGV42PDq5te4aRrD3HOG3Pmrcx3OqTeNxnxDfh+eWh0U9HV93FozUn65VaTqtRN36U76utLWw9dMr/6KDdbiVYPDp5nM7YbyhpriTGcqpkt28i69x5FHfwgiNf19G9HnN1uqlj2P7t1ZrwVse2Z2wvW+ap33nPbEdIX4NsHsnSqY62caW15LXpqaWd16PVJ4yQtmmQeVZqKy2/bnW6c2r0hO1X649uv/a2ZJv+05ZD1uZNNWgblZZlCr/lcV6Rbe/yt5xI79Zc7o2yVixv0w7h3FsdtNvhN7zzqErm8cRpg5Ttim0LNp02x96UYV07TzvuNUc/DI8Y7+kYKfoQG+dNuhmlvXQLo8o4hsivnRDttk9uSxwHn/xWx86WHJI5w5DPh0ffxWLFApA2c5XnOjaB6WiWGyR3yWm27lUNM7I+pPbSuY7yjDio10fjoH2LjmobqHQ+SvtuzZ6pTksypnrukftmmBacJ2oS/TDU/6dRtzraMB3Uz3VsjSlkywt/O8FpYm4X1VExFzT/O4vqxmaQlVwtIptHg2e1GDtnihsPmlOjw6xtb3SUnQ4bH/NUup+moC+bMs5N2arw0ZHHaVA4dkt+8wk30wZ3DjdyJ/JTmvMjljG24YvN2dDOl6ftPs5C0zlY6bRPrqo4ONL8nq1L943x8ZTk7cY45Gckj9+h5Tx7HEP9B9PHPZrn6Cm08wahh3NiMfTHk2IxjGdkxWIMj6bFtiqu5cW+ZczFxFjcnT9dX7RjLI+u2vthci03FrdHUE9Ijr0a8iXfSY71bNXo+ZC+eJeKQRbi5nCqIoXHE2xxdwJ1LcO2V3EpxRbTc4ZpenyYbhv1YpYtpvbPptlejZB2PshS30WGsXtgGM7rsTuIuppGidtzqKt5lJjjExIpMT/nYP/xk/29ORdzKTHXx5Mp3+jka9mUbww3DzbTGJuR0p+QT4l5PJpQ2VuDq/1iTd5Nnt3J1HzSmiS34yIe36Gk9uY9PO4paZ7ZbSPcVELBlhwKPZ4r2Tes57pL3Iy18oT0fyzPyP9/S8u1A4BYnnACsFdy8QjgG0qunQF8o3+uHQJ8Y6T0aLNnbDq5lsczcHGXCryWgtuquJqDi5WeEijV/nCgtG/Wa2m42MIT8nCxxccTcd9Qci0T9w17npCK468FM/9YDqvX2xt/bZuHL5U8QKHzZXR32sN/7MA3oXRrw/XanHFuzi4YbmG5pN4Og+1tMNyecutvd3Q19wQ0LLYfmx6mbZssHbltIrZdRVIIfqczhHq+du1Or3KxmRPrYRt6u1k3mSz6RzNZlZKNkHB6ETLSE26sRHr4yspexbUNdX/KpZXYH761sm/Uqxvq/g/fW3k1Qsr5rajt6VUPHqSlTSzR2zN2OLtTn4s7nL01FkPnXvvGmmekB8ZT0gPjKemB8ZT0wHg8PTCekh4Yz0gP9GekBy4PNzofKduXjmzUl1DPj7PiGI8fEG7fn7KBxt9eeFqPnYrg8WbcvHaEb3999GhuV49qxzellripx2YzQMWO1XzxzlercDmmSqE9GlM9I6JKu6OsSxHVtjFsaPEfXDlddHcq+vDmPFx0f4+KYQfg/Jda7qmgaCoO90TfoYL/ZIp1yOE6wHtUlDDs2Djdq0XJrqKFWypqiB4VtnsqqkeFB9f3LhV+3a3WdLMW9mJdPe6Sb9birgob4BxA3VLRisdg9V6nNksKpUY3a1H9AmIPDxtyT0X2gGdmDctNFb5TCLc6daYXLdk32nlzpt05RunR3G+vxxjjHSGGZz8H3bPEcp8T741wDzAm3pvtwd7xTryY36qFHYGkmMJNQ5qreNyQmyqiu/BY6J6KeniFdtxUYatApPCwIXdV2F46xXFvLUreqVPdTRWeNbrpwg+G3FWRLFpLqedzn7M96njY5/Cfp7M45zA83x6r7VSMZJaMfNjU5Ovxrx9y5HB8/f89KuweVw6H4PUdKnKwSTK3NPGeCqp+Hpdvqiim4vD+23tUuMPI8XAv7l0q/OA3xZu1sBdpcjpcNHqPiuSGpHavFulwkBdv1sJeCsj5kHp7j4pcsx/Gp3sq+uHs+q4Ka4uS7s2R4nOk3JwjlG2AU73XnIeYr49708w3/vxnLe6ouHrQvN0v246E/6LqaS3S7hyELKnUD+NiWnVr176ZqWl3sPRwLRIu2Gl0kG916isVJdxUkV1Fv+fBU/LsaUqnF5P3OvwAZHK+pSNbgnxyuanDQp3J5ycGex2+y7ut42KCPe0OlS4n2NPulaZrCfbwhPR66uXx9PrWj167b7PzHdE9WDykqN5+/VPanShd+wapbS2iX1k/DI53qbA3w6dN8aYhl75LK43t143YBf7D4vg+FXZkQoc3K96norsKuqeC0nI+dHA97+iRHKn40RyVccdv8F8nNx3Hi2nv0mHJ4Ad0uB/lP31+T4efuUwdp34U38B4qqX5/oLirVe7amjFDtbvbddqjH7hodZ7KmzHV+O9zUGN9g1nNdI9Q45tQeleLboZktK9WnjEUdO92Kl6TmOqoEfbIt3LBFT/ig/+AyS3VGR/i+rVIeu7amGG5Ht7rWNb5HuZgOrXm2q+t9fiv5piKuhmLdJwFf3htqBxrxYWqcyw5964KHY/amK/WQtrzlLzo21R7u1++e+SLBVUbzUn+e3KiYdF4LqGGP2bno5fPPpaQ95+XV3y2DG1dKsWliCaOG5psG+voLt18DsI8XAM9g4Nyc5oJ9I9K4Zr6I9qiLfqkOzrMemY77vZF8dv5X1HHew+Nn9t+j0N5bHxcC2AD4+G7+HR4H2nwC4INbq1H9vE/v+eP3746dPXHw5fPP3X36zq66cPP37+qD/+8ueXnw7/+sf//77+5cevnz5//vTrD79//e2njz//+fUja+J/ewn6v39F/iLfuRtt//7uJfLPrfLPVObPGf8+0wDzlzL/Oz9Ac2mgUvlH/v0xD11G6f/+m6v7Xw=="
|
|
2460
|
-
},
|
|
2461
|
-
{
|
|
2462
|
-
"name": "sync_state",
|
|
2463
|
-
"is_unconstrained": true,
|
|
2464
|
-
"custom_attributes": [
|
|
2465
|
-
"abi_utility"
|
|
2466
|
-
],
|
|
2467
|
-
"abi": {
|
|
2468
|
-
"parameters": [],
|
|
2469
|
-
"return_type": null,
|
|
2470
|
-
"error_types": {
|
|
2471
|
-
"361444214588792908": {
|
|
2472
|
-
"error_kind": "string",
|
|
2473
|
-
"string": "attempt to multiply with overflow"
|
|
2474
|
-
},
|
|
2475
|
-
"992401946138144806": {
|
|
2476
|
-
"error_kind": "string",
|
|
2477
|
-
"string": "Attempted to read past end of BoundedVec"
|
|
2478
|
-
},
|
|
2479
|
-
"1998584279744703196": {
|
|
2480
|
-
"error_kind": "string",
|
|
2481
|
-
"string": "attempt to subtract with overflow"
|
|
2482
|
-
},
|
|
2483
|
-
"2967937905572420042": {
|
|
2484
|
-
"error_kind": "fmtstring",
|
|
2485
|
-
"length": 61,
|
|
2486
|
-
"item_types": [
|
|
2487
|
-
{
|
|
2488
|
-
"kind": "field"
|
|
2489
|
-
},
|
|
2490
|
-
{
|
|
2491
|
-
"kind": "field"
|
|
2492
|
-
}
|
|
2493
|
-
]
|
|
2494
|
-
},
|
|
2495
|
-
"3330370348214585450": {
|
|
2496
|
-
"error_kind": "fmtstring",
|
|
2497
|
-
"length": 48,
|
|
2498
|
-
"item_types": [
|
|
2499
|
-
{
|
|
2500
|
-
"kind": "field"
|
|
2501
|
-
},
|
|
2502
|
-
{
|
|
2503
|
-
"kind": "field"
|
|
2504
|
-
}
|
|
2505
|
-
]
|
|
2506
|
-
},
|
|
2507
|
-
"3670003311596808700": {
|
|
2508
|
-
"error_kind": "fmtstring",
|
|
2509
|
-
"length": 77,
|
|
2510
|
-
"item_types": [
|
|
2511
|
-
{
|
|
2512
|
-
"kind": "integer",
|
|
2513
|
-
"sign": "unsigned",
|
|
2514
|
-
"width": 32
|
|
2515
|
-
}
|
|
2516
|
-
]
|
|
2517
|
-
},
|
|
2518
|
-
"4261968856572588300": {
|
|
2519
|
-
"error_kind": "string",
|
|
2520
|
-
"string": "Value does not fit in field"
|
|
2521
|
-
},
|
|
2522
|
-
"4440399188109668273": {
|
|
2523
|
-
"error_kind": "string",
|
|
2524
|
-
"string": "Input length must be a multiple of 32"
|
|
2525
|
-
},
|
|
2526
|
-
"9791669845391776238": {
|
|
2527
|
-
"error_kind": "string",
|
|
2528
|
-
"string": "0 has a square root; you cannot claim it is not square"
|
|
2529
|
-
},
|
|
2530
|
-
"9885968605480832328": {
|
|
2531
|
-
"error_kind": "string",
|
|
2532
|
-
"string": "Attempted to read past the length of a CapsuleArray"
|
|
2533
|
-
},
|
|
2534
|
-
"10135509984888824963": {
|
|
2535
|
-
"error_kind": "fmtstring",
|
|
2536
|
-
"length": 58,
|
|
2537
|
-
"item_types": [
|
|
2538
|
-
{
|
|
2539
|
-
"kind": "field"
|
|
2540
|
-
}
|
|
2541
|
-
]
|
|
2542
|
-
},
|
|
2543
|
-
"10791800398362570014": {
|
|
2544
|
-
"error_kind": "string",
|
|
2545
|
-
"string": "extend_from_bounded_vec out of bounds"
|
|
2546
|
-
},
|
|
2547
|
-
"11021520179822076911": {
|
|
2548
|
-
"error_kind": "string",
|
|
2549
|
-
"string": "Attempted to delete past the length of a CapsuleArray"
|
|
2550
|
-
},
|
|
2551
|
-
"11692359521570349358": {
|
|
2552
|
-
"error_kind": "fmtstring",
|
|
2553
|
-
"length": 40,
|
|
2554
|
-
"item_types": []
|
|
2555
|
-
},
|
|
2556
|
-
"12327971061804302172": {
|
|
2557
|
-
"error_kind": "fmtstring",
|
|
2558
|
-
"length": 98,
|
|
2559
|
-
"item_types": []
|
|
2560
|
-
},
|
|
2561
|
-
"12469291177396340830": {
|
|
2562
|
-
"error_kind": "string",
|
|
2563
|
-
"string": "call to assert_max_bit_size"
|
|
2564
|
-
},
|
|
2565
|
-
"12913276134398371456": {
|
|
2566
|
-
"error_kind": "string",
|
|
2567
|
-
"string": "push out of bounds"
|
|
2568
|
-
},
|
|
2569
|
-
"13557316507370296400": {
|
|
2570
|
-
"error_kind": "fmtstring",
|
|
2571
|
-
"length": 130,
|
|
2572
|
-
"item_types": [
|
|
2573
|
-
{
|
|
2574
|
-
"kind": "integer",
|
|
2575
|
-
"sign": "unsigned",
|
|
2576
|
-
"width": 32
|
|
2577
|
-
}
|
|
2578
|
-
]
|
|
2579
|
-
},
|
|
2580
|
-
"14938672389828944159": {
|
|
2581
|
-
"error_kind": "fmtstring",
|
|
2582
|
-
"length": 146,
|
|
2583
|
-
"item_types": [
|
|
2584
|
-
{
|
|
2585
|
-
"kind": "integer",
|
|
2586
|
-
"sign": "unsigned",
|
|
2587
|
-
"width": 32
|
|
2588
|
-
}
|
|
2589
|
-
]
|
|
2590
|
-
},
|
|
2591
|
-
"14990209321349310352": {
|
|
2592
|
-
"error_kind": "string",
|
|
2593
|
-
"string": "attempt to add with overflow"
|
|
2594
|
-
},
|
|
2595
|
-
"15764276373176857197": {
|
|
2596
|
-
"error_kind": "string",
|
|
2597
|
-
"string": "Stack too deep"
|
|
2598
|
-
},
|
|
2599
|
-
"16431471497789672479": {
|
|
2600
|
-
"error_kind": "string",
|
|
2601
|
-
"string": "Index out of bounds"
|
|
2602
|
-
},
|
|
2603
|
-
"17531474008201752295": {
|
|
2604
|
-
"error_kind": "fmtstring",
|
|
2605
|
-
"length": 133,
|
|
2606
|
-
"item_types": [
|
|
2607
|
-
{
|
|
2608
|
-
"kind": "integer",
|
|
2609
|
-
"sign": "unsigned",
|
|
2610
|
-
"width": 32
|
|
2611
|
-
}
|
|
2612
|
-
]
|
|
2613
|
-
}
|
|
2614
|
-
}
|
|
2615
|
-
},
|
|
2616
|
-
"bytecode": "H4sIAAAAAAAA/+29eXxcxZUvrt67pW71om5ZUmu1ZNnGq2xjbLCJ9wWwMV4AGxtbtoWRLSRZiy3ZYMZJyCSZkLGNyWT5/D5ZAOMMIcwEJst8ePNmMpPJe0M64YXfSzKETJaZfJLMJEBeIJOXx0uejLtv171V51TVvXWlUtT8JXy7vlV19jp1qsp34fyf/fngaO+h/YNDnUNdZefPPrVmoLunp/vI2s6enotl5849cu7cPzSX4f95zo39d/4CAfRK08WzT6zt6x0ceuTspXXdA12Hhrxnn9zcO9R1pGvgsV2LF/Exre09Uu3/6EFr+zK5/h88+/gVEpyvMHAub+/q6RzqPtElN5KyMhrBK4vwmStjOdw51Lm2r3/UmNKD5JgI8Ksj3+R45A8qGPnjO4b6+s9fAEZq4dHaJzZ0d/UcHoN9Y/Dbl154+Nl/uDz05BMfSr4c+0jF3PIHH3roteyr9R99/aHHrA3XGcP61K5l3FEFrc3XG/3e+AXfnnv/8rd9FRvf9czJl/9563CsvvPLTe99Ys9Xzjf9bP97rA03GA1/+oGPPRh/5sInmufk3gxu/NOf7//V5sCyl3P31/79O9/62euPWBtuNBp+c89b33su/sipkYe/dHrZrKrOzzzy7V/++1df+Gz8Vz98+vi3r7U23ORQjTbLtU9Y299EtF+6REL48+1vlmtPjf8WufaUiG0xCH/28cvfW/1wbuG/vlX+/i2d7x5Z/Ccv3fGLUzVPzvjx0afrP5O0NtxqNPzR0NrzQ9PuW/qL8Dce7vhktuH7bzz53E9+Pdq17Oc/+ennW35lbXhroWHNopnL+z/8YvqVWdO/u+pvPzP/Yu0bbSte+eKmT77+2//+GwaptsmxiprqbXLt/db22+Xa+6ztdxgUY//nKfxhbbjTroHNt9/F6bjwX8Da8Haioedd0wf/LPKwZ8uX3znvuWj5l3+2+uNr1uZeePf7m+Kf+bi14R2FhtesiLz+xPvPPFT2gyf/44O/vub5VfOSjauT8///j30r2ztwV+3r1oZ3yk213tp+N2H4OuQptUeQUlTDu6T6pbR4r2C/VMN9gg0pZbhbjtCUaOyXax+xtj8g177c2r5TysM1W5sflGq+0Nr8kFTzDmvzw4Jcu97asEuOaqus7e+RGvdqa/MjUs03WJvfK9V8p7V5t1TzTmvzo1LND1mbH5NqftjavEeqeZe1+X2CEkM17JXq9x5r8z6p5keszfulmt9rbX5cqnm3tfmAVPMea/NBqeb3WZsPSTXvtTYflmreZ21+Qqp5v7X5SanmA9bmI1LNB63NR6WaD1mbn5JqPmxtflqq+Qlr8/ulmo9amz8g1fy0tfkZqeYPXNreNTQ80JtfIufq1p99akPfQFf3kd4r//DoF4eHunu6h0Y3dg3tuvrXWG9DXSNDr5RNO/v0lq77+gZGVx8+PNA1OEiuaKEvXvCLD/ziB78EwC9B8EsI/BIGv0TAL+XglwrwSxT8EgO/VIJf4uCXBPglCX5JgV+qwC9p8EsG/FINfpl2RbAu7ei+r7+n66rLm2z/Z4rQuD9ZukQK8/FdHYuW4f/KH+m5c3Qeq0bKbGyjAWqlAE6dfWxL3wkiC1ZXTGtS0Fm5oLdlLGfb3ds5MDrW6Nb+Rw3gx8aE7SpPCj0RPTy9uffw1ZSbpfM62fySufNiF0b39Jy9VmrUk0N7YixjONDF/loDdVdPd1df7I4BaYSpigFPqgbsVQ04rP2UB1UDHlcNOKQasE81YKdqwBHVgKOqAbu1H2HP1OPy/dqr3lHVgP3aG9hh7ZmizmJfLkZsU87eHJ8EgmMJBWuL4apoWGt0Awa1te4FtbXF7m1FwuL0JHsicxbP5HMW67oODh+5pe/IuXMXrcvNfMN1Zz+9qauzf/XAQOcoQfJsM/D7nezf15ddpJZkY4ugs09c/eF51sdm9nLR2uTqgq3MPMHP5ye4oWvo0L07O48c6To8Ns3Bc+fOA+Nea8GzylgWWXzVy266Si++6mE5zSqSU4b0ZAHp+VyeuLf0dR5e29k/ONwzpqdQtqIOEAjPBQbPOwDueh6BsyEQQ4F/3/SIfIaC4nijHNGbrNLUVBhNmfVLM0k5y7cWkjWWb9ONfTO2dJVZpauMnE0htXlzHpb+TRmy/m62fmsgxzyGbckWFDHyRH/66ojf/p9b+y+SdnDLcA+zaQOFWw/phMgIrD/Jkr82gcFJGWnfQ7m4OoTBCg1QehIaIGrODXLdVkHdNtDdNpDztrChkfwGQDZ99pYxg7Pz3s7e9ceHO3sGQfTGs5duGr6vf/M9pGn42t/QgtFYIMQeqM9GehqNReo9fqWb81/7Eq3EsFA5JLCAUDXAQlWvSKga8BjToV1PSXGDmDflDohvAGQzKlSNJt9CCVXz116ghaqJK1RN9DSaKKH6R9r6w0IlSeDV8kLVCAtVgyKhamSZDFiommQLUmS4QcwbjiQaIcgWVKiaSDBaqFq+9h1aqJq5QtVMT6OZEqqXMNER2T05CYZcDKlslq2ok5bKZlgqmxRJZTOqrHAo2UwzkfgK7p600N21IKFNCzcxZRdwWDXgUdWAPaoBR7QHPK4acEg1YJ9qwE7VgAPaa4rGNBTwfbqI9qhqwH7tRVv5lLunnnl4QDXgQdWAZ+iQFI7BWpwtvQRisBY4BmtWFIO1oLEtNefpct0moW6n091OJ+dtYUMr+Q2AbENXBtNJMHpl0JbztNBy0cpdGrTS82i1Lg1ynvqzj1/JPLPNfb0iIa5H6NeCiLFDlgqI8XRYjFsUifF0nFbWbltlzwfKsJ+Yt4UNbeQ3AHIGKsatJBgtxjNyng5aMtq4YtxGz6ONFuO5YArf45jE6+XFqhUWq+mKxKqVZaZgsWqT63adFDuIeVvYMIP8BkC2o2LVRoLRYtWe89xIi9UMrljNoOcxgxar5ZjwiGROymg9g+VyhhSPPL+Ul8sZsFy2KZLLGai+UnNul5vz66AQ0d22k/O2sGEm+Q2AnIXKZTsJRsvlrJznFlouZwqow0x6JjNpydxIaxosWHJELlsjL1jtsGDNUCRY7ajGUnOe6Sw5jrODmLeFDbPIbwDkbFSwZpJgtGDNznl204I1i2vwZtHzmEWL1U4qHCTkvEFK+eBwsIH8GSKsIgZ2P8Z5EYDjNMAsKYARqwjMRjTxGjmp7JDXxGtgTZytSBOvodk9G0yOzyGHRonCnEK7e6HO5tCdzUFkaw43b2MXsEc1YKdqwKOqAQdUA3arBjyuGnBQe7E5pgyQ76nsjnFE/Rhnqh7jSdWAo9obiAe0N7LK9XlIey6f0V5sjutrHtyasnKxGZ561mZUe2ujf0hXcqRaskW5NvfqO2Xjz1lTKL5xb9LUPu41SLpgjtyK/Ub5dMEcOF1wjaJ0AYNS14Dpgrnk0CgqzuWmC+bSnc1F2DKX61vsAvaoBuzUfsrHVQMOqQYc1Z4pD5S4rB+Xz2gvNsdUAw5rbw9HtGfKkPZM0d8eHtNeDge15/KQ9qqnXA5Pqgbs1n7K+geco9rHNvpzWeOA0/hz1tSLv46Xohv9/J7+ytet/QhH1JuHmarHeEp7tpxU7+ypgkZlWUQb95kiWcSZ7mURibJIas5z5bptlmIQMW8LG+aR3wDI+Wj531wSjC7/m5/zbqPlgugWrCudR89kXpGA+QJA781UAaALW0czEQrOQQRZkqk+eUGeCwvyHEWCPBelFSxPc1G2z7THdhySys3DrJknR524PGvmwayZq4g183BrbO12vly3laBBoLudT87bwoYF5DcAciFqY+aTYLSNWZjzdtOSsaBACbDEeAE9jwW0hTmMCY9Iwe1mjBMiANfTAAukALbQAAulANbTAB1SADtogEVSABtpgMVSAHfSAEukALbSANdKAayjAZZKAdxi1azrEAO3TE7Zt8obuGWwgbtOkYFbRmvodaDvWU4OjTIHywWs0HK6u+WI71nOXVraBTytGrBbNeCAasDjqgGPqQbsVA04qBqwRzXgiPaAygW7T1+mEOGD7qKtXJtHp542n9Je+fRnSr/29ua09k6gU3sa6i+HA9pzubtkbRwDPqDe1S9QD7lQPWSHzpD5b/eoH+OiScGc9kkxysXqIWsmgQgtUQ957aTg97WTQtC1Nr/5b/dOAjG/Vt8xTiIquiDgSyeFsViimjlntI8le7VPyShfgihfJClPAVN35ywrfGHswCx3tt1aAEZ2YJbDOzDLFO3AMCi1jKCUtdvr5bqNQd1eT3d7PTlvCxtuIL8BkCvQLebrSTB6i3lFztdEy8UNBUqAW8w30PO4oUi+/Bazrw4THpGdQeo6yesRubxBjkdz5eXyBlgur1cklzewBMQgrIUaK8ihUVxcUWh3BBQdurMViLkwvg2rBjylGnBINeAx1YCdqgGPa0/D06oBu1UDDmjPFP3lcFA1YI9qwBHtAZULdp/2TFEuh72qAU9q70YHtWfKqDJA489Z2k/6AdWAB1UDnlHPluVTL2Dq0z4CG9beJuofxfZRJzOIu6bB8n/82mfsZMYs+mprZbmZpNLczCz3cjOzkNyM5Lo/IZXTIOYNL75BW7cSzc3cYJIuKjezMuf7E9TEttoT7UJ25j2UIC8X8KqSKcZZ5M/+0PujCreVJasCSpNVy91LVi23nazis0aHGNFdSKvA3iDQH56KxQT2hj/4/qh0OqyQK1x/LncFrJA3KFLIFSitLNRYSQ6NoiPxFaw3WUl3txJhzUpu1GgXcFg14FHVgD2qAUe0BzyuGnBINWCfasBO1YAntFc95Vw+rRqwWzXgqPbGoVN71RsuMcUx4KD2LoDOlRDhbq2iCLrWFMfAcZ1IwcF2GmClFMDtNMCNUgC3WsO0dyBB6yq5uPFd8kHrKjhofYeioHUVze53gEHranJolCgQX8HD0Kvp7lYj0rWaawLtAp5WDditGnBANeBx1YDHVAN2qgY8oRrwpPZM0V+wR1UD9mgvh8rN13CJKY4BB7Wf8oj2gMqNQ5++TDH+nK+9aOsfjAyUYgfHgKXYoRQ7lGKHUuxQih20jx3coqH+gn1KexqOas+Ufu1V7/TUcwH6xzbKpzygPZe7S9bGMeAD6lfMNeohV6iHnKcecqVq5tyjGvBe9ZNeqB6yXT3kEvWQN5aYowhygXrIDvWQiyYFLV0wvkv1NWtuWvMlU1O/F0+CabdPighj4aQwawsnBS1XToqJX6uzqOe/HZkUxnehzm7MTX536CxCbtJy4STw4Ge0X873ar/tqDwLpDxPpbzSjbrzbVXhC6PQdLVcrWeFZbAFYGOoRk9ED2Ch6SpFhaYMSq0qUspCjTXk0Cgqrim0A29IW0N3tgZhSwmwBKgZIFV5DZuHNXIa2iZvHtbA5mG1IvOwBjWkFmqsJYdGUZH4CqY+1tLdrUUYY3w7qRpwWDXgUdWAPaoBR7QHPK4acEg1YJ9qwE7VgCdUA3Zrr8uj2suhchoOaC+HQ9pb7FHtLbb+xuGk9qp3WntdnoJyOKh9KEIf4iXWxrWK1h215M+opTi88lgrF/w/Ir/yWAuvPNYoWnmsRWllocY6cmgUHYmvYAJ8Hd3dOoQ167h+zC7gadWA3aoBB1QDHlcNeEw1YKdqwBOqAU9qzxT9BXtUNWCP9nKo3HwNl5jiGHBQ+ymPaA+o3Dj06csU48/52ou2/sHIwNSLHbq1D0ZGtY9u9BfsUuwwFWKH0sKitLAoxbClGHayxbCXXKKh/oJ9SnsajmrPlH7tVe/01HMB+rtR5VMe0J7L3SVr4xjwAfWZmxrVY7xH/RhXqB7jverHOG8S0HGpesh29ZBL1EPeOAkEaOGkYE6NztrtgjIaf67UV7+nukwuUA/ZoR5y0VTV76WTwDPO09mNTSr9XjwJpt0+KZzYwklh1hZOClqunBQTv1ZnUc9/OzIpjO9Cnd2Ym/zu0FmE3KTlwkngwc9on2Dq1X7PVXleUnnmVHkNMHU3wI2FL85L8Mstgy0AG0M1eiJ6AEvwb3SvBP/GIqUkS/Dz7faoZksJsARoC9B6gIc4nz5LQiOw40KzyJ9Rh+Vh67FOToHnyluPdbD1WKvIeqxDaWWhxnpyaBQd1wsEa+vp7tYjrFnPdY12AUdUAx5VDTisGvC0asAe1YAntR/hMdWAnaoBH1ANeFA14BntaTikvS6Paq8pI9pzuVd786VcbAa1Z0q39iM8ob3YHNc+cuieevawU3td1t8FjGgvh33qmUJlcOAV6Xq5RWGD/Ip0PbwiXadoRboezRVYqLGBHBpFReIruFe/ge5uA8KYDVyrbRdwWDXgUdWAPaoBR7QHPK4acEg1YJ9qwE7VgCe0Vz3lXD6tGrBbNeCo9sahU/sRntZ+hEPai41yLg9q71PoW8mIzHmtogCylvwZlcaHQ8gNclHce+RDyA1wCLleUQi5AaWVhRobyaFRdCS+gqU3G+nuNiKs2cjVTruAp1UDdqsGHFANeFw14DHVgJ2qAU+oBjypPVP0F+xR1YA92sthj/Zc7tHeYo9qz+VB7Zkyoj2gcmvTpy9TjD/nay/a+kc3A6VgxDFgKRgpBSOlYKQUjJSCkakXjLhFQ/0F+5T2NNTf2vRrr3r6Oyn9g3b95XBAey53l6yNY8AH1C/Ba9RDrlAPOU895ErVzLlHNeC96ie9UD1k+6QY5cpJMcolk0CEXOD3AvWQHeohF00KWrpgz5fqaynddBCTQRldsEGLp6YNWjEpmNMxKUa5Yqr672t1FvX8tyOTwvgu1NmNucnvDp1FyE1aToZw+oz2GYJe7bdGlSeWlKe+lJf3URcOtRe+MKpr58kVuMYsgy0AG0M1eiJ6AKtr2xVV186jKdVOUMra7Xy5bqNQt/PpbueT87awYYGAC+v47C1dg4M77+3sXX98uLNnEERfcPbSTcP39W++h+igIxfeRcvFggIlwLtwFtDzWFAk3+NX+jmfC2/DhOdTu5Zx6bgL44QIwDGaorBgd8gxuUZesDtgwV6gSLA7UM5YqLGIHBolBosEpG8R3d0ixOIY34aUARKSoe0Y89+G1U+6UftJd6oGHFQNOKIasE97Go6qBrxfNeAJ1YA92jPluGrAY9pP+QHVgAdVA56x+sx5SAQhFyZ6fiAfQcyHI4h5iiIIRow6DwmN5aImz/clApcOct5w6AI6/qVoaNxh4jYVGi/Nhf8Mdb2t9kStEBxfoE5QErH6KqkFBCzGqxAKzlcXCvuVhsLz3QuF59sOhXkrIrv2xQVAy8w6ED4vcrauFeDzIpjPHYr4vIhlOWCDtVSu2wrQutDdLiXnbWHDCvIbALkSNVhLSTDaYK3MhT9Hy8UKrqCtoOexgjZXT1Pmivj9XEVCPJf8GSKsIkv/H2KcFwH4BA2wQgpgNg2wUgrgi9jRdhGAz9MAG6UAztIAm6QA9tEAm6UAZtEAN0kBLKYBbpYC+CkNcIsUwCYaYIsUwJdogK1SAOdpgFulANbSANukAN6kAW6TAniEBtguBfA6DbBDCoDhPnfJuZJmGuEOOQQfZGhvpw3tLrIXizPaWfTU0h79dtij71Tk0Rmz2Ym4jdvJSYtD3i4KSXHtdkVc28WaJ9GLhWvmQdFD5q2BpWnAyyPYJ+oS1WM8qX6Mi1SP8ZD6MS5VD7lCPeRK9ZA16iEXqofcoB5y46SAXKwecpN6yM3qIW9SD3mzeshbVJu2+9WPcYvqMZ5QP8at6iFv1dmRXS5G/8ohb1MPuV09ZOukgNxBZWtqin8ug/qrofurQfpbRv6MipFrntjQ3dVzeCw4fmPw25deePjZf7g89OQTH0q+HPtIxdzyBx966LXsq/Ufff2hx+mmC+XC6zsc5zWraITFcggpGmGJHELScaZyHSNhZTDhxi/49tz7l7/tq9j4rmdOvvzPW4dj9Z1fbnrvE3u+cr7pZ/v/GEtVCXW+2uk1jJ4yRrLKGL407TbJDb8Jy1MJDf91LFH12K6OpdwxhLFMlRDCUixVJYRwHSNXVWBC27f+OvSff/6n/s995/W+k29e88g/bXz4b55acSE378Y/2vGvH3p1C5alEiwVRLJMdjMst8khVGJ5JiGEMJZoEtxmcZhpGttlpXMWhi799AMfezD+zIVPNM/JvRnc+Kc/3/+rzYFlL+fur/37d771s9cvMpJUgmp4A930TtnNFgphtxxCmkbYYwz/m3ve+t5z8UdOjTz8pdPLZlV1fuaRb//y37/6wmfjv/rh08e/zdCeu8RmPma78vskkcWU5yVSZ3WQ5/VeLmz8kEm3nSQIveHjzSXWGv1eZ00WeZBtP68cTWvlk4ReOEnoUZQk9NLRigfc3vWRQ6MiGR+3HsVHd+ZDQiNfsXxEMWCnasATqgF7VAMOqQY8phrwuPZT7pt6ctitGvCkasBR7eVQOQ0HtJdD5ao3rL3YKLfYI7T7hYMRv1w84JUPRvxwMOJTFIz4UUo9tWGMUN1Hetd29vQ8+rnhoe6e7qHRK2Hi2s7+weGeMRo+vaXrvr6B0TGQgbFAkAxWPr2pq7N/9cBA5yhBT7/nwtlLO7rv6+/pIvawO84+cfWH5wsfr4avnkdA/GnWL/kxrwf+fdMjZmj2/5mISnM8KEd0qqJtT2E0ZdYvd5GUs3zbS7LG8m1fAfEwW7rKrNJVRs7m8St8PZ+ruzkPS/+GGqifHLPlW4Ac8xi2JXQvYuSJ/vTVEb/9P7f2XyTVd8twD7NpgML1QzohMoKStpPaDrPTT9vMAElYWysd5xbpmbxFWtd1cPjILX1Hzp27CKj/OrY58tZA5gIyXxcZ5msZZb7IjzWAcWFbPGQ1LCpQsJ/zFBfoJckv+bmSn5sqfs76E1NWCZcFr5FJPPv45e+tfji38F/fKn//ls53jyz+k5fu+MWpmidn/Pjo0/WfSRkZvcepTKKfNEGAggbMmUT2vOlcYiAXf9no+bJZkb+QV+Q1wz3HtncNDXR3jW0r9B0ZPHdOXt+2AP++VUjf2OGGFzG6PteNrg82ul5FRpexDPOqMLoettH1uW10t7ppdAPjYXQ9iNH1qjS6ATtG14cYXT9mdEmx5hldr9nomsIQcTspMIJSiFUKsUoh1lQJseARXLp6Jo5pK7yMkMaXi/xPxyZiLFrbOdDZf/4C0xaUApFSIFIKRKZKIIJYL3NNg8vJJ2IAyDLzR0Nrzw9Nu2/pL8LfeLjjk9mG77/x5HM/+fVo17Kf/+Snn295w7GFut2xbd1lLDh/SS11AwJL3SCvaCbA8ArBXOQ/jX7fNNusf56XN1q3d/Z0H+4c6lrde/ht8q/vPT7cNdx1eGvfUNfg2D+uP9HVO2Rr/bsB+PeNEuvfS2OL8OEB8CLFysd2DB80G+lAMR8LNIqzTp4bjVCKxnOR/2MYhy5UYCutmhFHPGbCdY+ZgD1mXJHHTNAeM67CYwbYHjMxqT1majw8ZgDxmHGVHjNlx2MmEI+ZxDwmYTATPI8ZN3vMANmFFTcB6YTICKw/iUPRkWw2s9KkToxsZnnaoP692Egr+bQa4zCw8KH4AxszSdG+Q96YpWBjllRkzFK0MUuqMGYJtjFL3S5jzG6XMGaE8EBffDYMGi2IiVz5vEK0Ud5IRTmEcjVLeJAEEh42kz9D+mtQ1F8D+TOLQgQL7XZbv4TAL2FyKpZvEXDftbzwhfIJFeRQLd+iIF6siFfg3tcggtUhWrGJYkEt0RC2OnVUsqO2ALmXIWZ1ufJVxkAXUX0mBcQsieo2JmZJrL8GRf01kD+jfCYkTClEmKpA5qdBYcogwlQN4tXQwvT31t/UIb4jK7swk/YdWdh31CnyHVma33UEv63dNskuJYFum+hum8h5W9jQQn4DIKejl3Q1kWC0pk7PlW+hpbulKCFApy30PFqK5CuI1SbrfLIqMw9ZknWWjmqL0l8YDHj4tg4I6gjT6GcaufhXDfBdmGHNItrlnAx1xFQtYyAoVC+hCFmkt3pkWm5xtx6MbIvcBeuumwDuEk5hMYO7Tbn4XxjghynKmpQWIXuzIrI3TwDZm2lrpLCjliIPARK1oraSPtg2nWhKrbHayN+h68ZWohGwbjT1hGVaGYIKlt+38gV1OkNQW3PxRw3wEduC2kJ9bCFNDOR7WG6AYBE0VdRltfAmXP6gsZgGj061ANScjhv1llz5Ow3wXgnJrCUWnuxGbXSjVnJcCP3bJAYynZtbbUOpb5JtmkBtufL3EdRneCNSCWENnSEhUtMRMzKD/JlF+6artFemsfPV/IIDNV/JVvMzBvijFGVRSZpOLhPUkL1hAshOLXHaVHbUxvVHM1EFXkmRvZ1oSrmQWeTvUH80k2gE+CNTT5L+6BI4Xb6gtjMEdWYufsgA/zS2FkcFtQ0T8Tp7Nha89q0dtYitJiGhJtyeK/8Lvj+C1L4N90djzu5Zvj9qt+OPGOLcLkj/mRBmLY3ZxvVHOPXbTHNiUf+vBf1RLZiouQtJ1DTRiZrLxfiJStUQ7htO1iTpZA1sTmtMHhVK2ATBuYTICcPZzRSd3SSmTOU3iSnDGc4MneEkpkzlOIkpF7OcrC3z8m843p7FCqkSoKAwsmFJ17eFk3A2LKEoG5ZEk+z2d1KC7J2U5KTeFq4aj23hILItnFC5LVxlZ1s4SY4Ztp30tnCQwOBtdSbM28JBsgsrbhLSCZERIHvMQaFt4SB/WzjBNmQ/MagP3pUQpOtnElyfmhSrn2GNKpkr/w+ifgbq4BLLWVeaHBIL+neGaX9VwhhVciecQoOISlJS6HGlcuX/iwgirPKQkhDaJLg/n4K3sRkMJoYONKsSnTGLyVW58t/wmZygR5bicqJKTPRS7FG9RY6K5XfW9vWP5v0O41ww7BlIdyq9+564KHEcjOlFClL/O6wIJciTriAoXXEztZ4zjlD3dA11GfS6YINewQsyh9+CulbQBd2roAsWQyXYTybotUnSxD6gEBLtzsTzZ/M8f7sbg+V2gidm0Bb34MGT4Mn3Uoml2lg6ManPS6UmOpaexCWWRCQrW2JJBsEOSiwZI8C8m6pYOs6MpSumEyWWoh6UeAUt4KKlSpaKwce6S8hYqoSd+skgYKs2q7BVdeNhq+yVg98nb6vqDG0ZcsFWwTmBfUg+9W4kn7ofyaceQPKpnUg+9SBdNmT8eYhZPlux0vHBOizzGMAOHoXBqnRajwPITldYsL8KRf1VINIdQGxs3PVoMA7b2IAiGxtHaQWrV5ymY4LUC1o4Q7mKLxeWmRW3yKzLQnJzXSpP6JD767KQzLosTA6NoSD5dkegzsJ0Z2FU4/LfhlUDnlINOKQa8JhqwE7tpzys/ZSPaj/lQdWAJ1QDDqgG7FENOKoa8Lj2YjOkveoNaE/DPtWAI9ozpVd7ppzUnobKDWy39jTU38B2a2++pmA4N6p95KCOKcafjdrrinK29GuvK6Pa25s+7Wn4gGrAM1RSjijhDEjkP0JIbwHyZ7ZSKuKzDgCbCo7veQ9dK3fPe9jGPe/Xyt3zXrxCSqKGNCOXA1skn4DLuF9DmkFrSKkTsMTQsKLtWyWuOahD5L2O683tAg6qBjyhGnBANWCPasBR1YDHtRebIdWAndqLjXIa9mlPw17taXhKe8E+VuKyY8CT2tNQudfr1p6G+nu9bu19Sqf25mtYe7Hp0Zcpxp+N2uuKcrb0a68ro9rbG/0jxAdUA9Lpo0zxz4DE6j0jlj7K2EsIiM/atfRRpkMufVRnI33UIZc+YpV1RRdNXM1htaIawGrB/sa7xnGVov5WkT+DaxxF83ZCireKPumvsCMDbCd2bWu1RG15Qkw+EiAk8379A8Uf1ICWKH9Y9Uq1OT2c3Qyty+SimwoF0tnvgycDjGtUojcJjprAIMbNKjWOrzfAt2AsCKBCkmBxlugZAQ4r4m1YhLc0JFGnHQEZi56BrTGNj8XjO/gXt2R4UgfOqYYldRlM6mpy0bukpG6f4KhZUhdhkiQ+0wA/QAlHRFTqIqjUJca96hzpL6KoPzNtHNay2zs7UoGcHYnSZ0eMP2PWb3cX/5xm/ba/+Cd1ZcwBmKyF4SMnUuKG6P9I/ERKgKQEfPPNXkoEoiQGIAJRWgSiYr45CkIy700gnC2tlNFc5UZDKe+nr80xnLlTqVssv6+InKCIuXeCIlZkAnwoiHGCgvh6raKFUIabT7ALOKIa8KhqwGHVgKdVA/aoBjyp/QiPqQbsVA34gGrAg6oBz2hPwyHtdXlUe00Z0Z7Lvdpz+aT2NDyhGrBbexqOah/bKKfhQMliTwGLrY4pxp+N2uuKcrb0a68ro9rbm76pF2UfUh9lW3MypvcYxdMBcbGcTBy7nCjEvs4ug2RXauQSHD757EoNnF3JKMqu1KDMg6u2a9Bqjbj6ApC0vfwQ0CiNTlvtNnN8EfD7bezfp73y28yLZLaZvZTiEXdvgzt6MZTO2I5eDOsvoqi/iGB/YUX9hQX7q1DUX4VgfwFF/QUE++tQ1F+HqT+LoSb6S7ANdZTaHIuVgxYD2BwjtgRCzIfFY5sN8Biy+U55irDrNxmFYU8RUuQpGAe7QoDJVHFbXHhS32tZPtF3xYVU3mtZbudeyzA5ZvhtCfTp8DDvXssQ+HR4hMINQzohMgLrT0xHMhU9HR5iPh0em8G/Iz5AX9Rt6CZ4UXdY7KJu1qjCudhs/vXhYd4d8QE29ArDys6VMEb8O+IjojemhxnjiuRiC5E74iMSQvv24Iv/u0IgGIqwGEwMHWhWLjpjFpPLc7GlfCaH6JFFuJwoFxO9CHtU17t+R3xY/IbRIiFU3RF/Rf7hi3YDPOkKgNIVdO2O+IDUHfHYpY8h10OlkPuXPobQ0iHJuwhJ9rG7C4rXTKu6I349O2gL2rwjvnhqfrxrTZH+Ior6iwj250q9JdJfhaL+KgT7Cyjqz1TdKll1aywTu5g1t7G7+I/tvf0sEYC6XSJHGuAmqZi5OYTWxG3JNXYOZWyyeSiD3SjLSvURE7GOnqjWzdoZ/bYJHX2CHD2VNoX9XdZ1f5eF/V2dIn+XRbO69lMDGbaXybqdGtjgZmqgZTxSAxkkNVCnMjXQYic1kCXHbPnWRI7ZGgcT5i/Li4PrzKmBDNmFFTcL6YTICKw/MdkJExg41qw5Zr8dYSSxIyV9yIcitTKoFsTETZcT+Iy8iZsOm7gWRSaO+dI9RA3Ta9xU/NJKGiCgO8bD7q1ISERAJtVDptRDVqmHTCuDzH/bUwIsAZYAS4DjBIiVqbXQXw3vfTe2EIxIVECkxZIYaay/DkX9dZA/o14Fsh+3UB2Zxm6dWIsAIVvQyAAjZAv/hGfsb8BuwROeeYwDjAxHS65ymQH9d9h00+Zo3mcSxXyQlf/mlwuxooUVQ8Pz1vlPL0AGJLRrevHPO9EAIYYyf7oAM14AhZt/3PZOBjvSucoWA/zrWDlck4RamTqFpAfdGIqbdI0hRbGXyK0weNgZWeklGLKb3fO3iQwdJKJxhyKagUW0hSui+ErBllynUbmukaiMS3NzfTWoZKRN+sE4wB77Ef9IvYC27GZqS+zHAsxvcY/5aS7za1AvJy4xNSZhtjKfEA2ZGxXiDpkfJ7tlMv91PvOh4qsEzvx4LvYrAean3WN+3A7z41zmt6DMZ1zfQTjpcgmvkHDIfM7rc2PM/x2f+Ql7Zj+Rq/RMrNlP2GF+wiHz0yjza9EFQ0KpU8g4cQqZXGWMEA3GQoZoLj7qhFtb3MaXLFDPnbazyS1Tv17HZUgCZUgdzpAxdUojpUzkK5TsAg7sZeS06xtaafdfRk6jlhy+cyJtTyclHmJWVcCxAXpN3l4Bh7hsR4uyTZVwE7MvFnEjyYYmCbtqWtNAUbho+NPC0KrWXGU73wMyA32em2hj5ZRIYsEkaqM+tpKyCXUI+OkW3E+35SrnCfjpVvf8dBvXT7fTtGzjMmAm3ajdtOKwav1MUZvQZscEbaINMtEdN1vBWG9EHK5Q41guqZX6aFrbQmIy3b1EUytXTNrQNK6MbBE0ogQBF6I02beMpRMQkxYiw0j5cA95tIxL55k0gFcK4CAN4JMCmGedqB8JUCSLPA/JBygBOEDxKwpQGJfT+cEAhawepqXMeNLpHon60iCS4Ta+daoGPKEasFs14EnVgKOqAY9rT8MB7eVwSDXgsPZi06MMkPAyisc4or3gHNVecAa1t9kD+or2pLHZw9pbxE7txUY5Dfu0p+Ex7QX7WCl20M98KafhSe1dgPJQ5JT29lB/sTk+9bxet/ZTvr9ksfVTPf3toTouG396taei/gZM/xi2V3ttPqU9lzWOso0/fdpLonKr3a+9vdE/QzeiPVP0tzcDU8jeuGVilccOp7Uf4Untuaxcl5Uvz05oD9gzbqrnId7fy/92d+GPuxjVS54rj98hpQxCO/ZUraSv0KXzUoTDdkoR4PfSfGIXYS1dAg/sqczf7lvX+vu9EmUK/KtXgmhtg9Mbww6C9UZB8xc/TcX8lwDZeaHG6EV6ZEHZkclQkeiF0g2DxnvsMabwWDAhKoQ+oM9LI7f6hKDB1HHOvwDNsqKPf9YxlD2bi89DzrARF4KA13Ixbr3JIgYrTP4MguSfjFrCnsxi/sVVTfR4w1xlZNSXmer1EcK1gAMBZmmUvbOOrjbl4ssFakszDosGK+Ciwaai/ssQi0dh5nlBgibY6a8sS/eJvqmvprd/gQFlbJYUZohnadFr4BADImMjMo5tRIZrI24WsxHVimxEtSMbkcfdz57KbbYsRPWkshB3CFiIRMlCCFoI8HhAwqaFSPCfS58JcD5Z/HMlg/czc/F7+PI9y05R92y60SxyXFb5Jkr/Z1MfZ5FMsn6cXfwTPBZwDUCf2YV5sC62vCYX7zWk9rugZsxyqBmrYc24hqsZc2gyX8PlzVy60RySJpR0zyX5BIkgDTq7KN2QaKGOZjbZLc2fWbn4KHZCcjpJE+prm705JUGNTZKAeY0tv4QdJKqD+m1j9UsgAM3aUWomybnT1GzPxd8lcBALUCSCmn7mKa/4e/iGpp2edi1XmPFDRuhBrpnUxzZSeiCFb3Oo8GtghW/nKjxzujwaMSz4TFIwKOWYRdILU6x2UFBsqk6roToXZGWQQFnMlsEP82WwzU6ogZ9gSmIy2I7JYJb62C4QBkLBANF2CTsY+ISAu3Mq/SlY+mdypZ8pyM5CkXZavmcL2NpWRA9Bd9eGGuh2U3zFOCYafwpzd1mSJtgVCK3u6ewwJbBNAu6uBXV34HHl6aLujnXueHou/ld8d9fEP9HrZ6+pvsg3NdPtuDv8QGkLRv9W7LRp1rWbgaqU31zGoxF+8DuJxoJNqGJNl8gBCKlOk6E6nfwcjoFHyIt0KsD408cW3Bf4gtuCTNb2chwRXHrNVyciuHUOBfd2ze4zq0XvM8MFt0UiQ1gLCm6tiWF5wd1OH5yF9+4m9KGaoKJjxCF0z1X5m36hSf2mX2Si3/QLqry4P2Ln4v4QOWb4HSP0Tb8Q7+L+IPimXxh7hi8o/KZfCLi433RO3smbfn6TOjHe9Iv/L4P692Ij9fNptRp47Cvg4gOlSXlj9gf4QGlCxpgl7FxAFgTM2WYV5iyh7xOl98mbs4ShUEPi5iwoas7g50v3Wb+VF/+82/qNeClrP3L71QHrN+L5407rN+IRx4PI1sshhh0K5hKVjouSyoxqEYHqo1JANckCqi1uBlTJP6iAKqk6oEq4H1AlJiqgQh50NgU0XoSR2DOiks7NJ29MEu4/I5pAi/TgVAzj0uAkqepAd0k0GYJBgi9JVuD1n+5c2xpi28oKr52rLb0SFZRBbto8hCZ6TepCu+tQLrEYubaV8UZw6d1dRGEqyKFR0l1BEla8UNntd3e3qH13V1y2/VzZDqKy7cdleywUXY1tCZmCysJrwY9DQymn3yT3cMdfIfYmuYcx+opcYiPxJjk1+jpyeUCJIayUUdeVMgorZYUipYzSwlShIiT2sFUh6nZIvNbNkLhSjuh76eAWCon3kZSzfLubZI3l234HIXGlnZA4So4ZXgjfTTlAUqx5IXGFOST2kF1YcaOQToiMwPqTCvLXIjlGD5BjLDepE+MwU+IAkmMkRlrOp5UpJK9BBCmKGLOYnGjfKW/MYrAxiyoyZjHamEVdNGaxO2SM2R12ouUK8MtCGwaNKYijBY+dOErtfxLsqwdVgCY69qJbPfkzpL8GRf01IArhPWucPKTOBRIDhq4v3gmG8HuQXGYDmPrfSWc5IbxI8UuBe7+jzbGhhKLKCpMxVhyklWlEjhM8FlFJM60S6S1L/oxKqSqclmnslo48xJTzNH43ND/o3SRCoBcx302qm2+A/zH2VlslRvZ6RWSvnwCy14OP+ajoKFHkIUCiFOu0BME0K9mJxEqKctxV5O/QYCRFNAKCEVNPJjC+oH4YnC5fUJMMQU3l6qoM8I/ZFtQEdvQsJpH6SpAsgqYq+mIWe8KJT2FL3hjZHJnUdIn0YQIRZNOjcu5qDNEnX9CeApnGF7SlDLonc7VvGeCfpSgbdYkM4saBeCEHNQ2wKaIbEsZghsRQUggbZ5A/sxAqpVJeTGPny8vz0Pyq+PLCOlpWlav9sQH+XynKVpmsNUz2BkVkb5gAsje4/AIzz4NW0ySqIpmGHCiuppzeXvJ3qAclTuPuBTyoqSdJD/oiOF2+oGYYglqdq/0nA/wlbOWDCmoaE3HwCbM0h0XQWXPUg1aZhITxsGDiZX7lexX/zcmlTLVPfI9fQJzB8wHC4pwRpH+1xED4zzpWiz7ryBa3xL/Zf+s3g1M/nUv8hE/9ajvU38s65E6MC3lMba9EjjvjkPoZ05xY1H8Vix4TZHMkxolJRI9Rkme2FNoUXDEV+g3BkDgBZlruQjItcTrTYvxZSedaLhfjLjjb4kFqOlJIVVkVUlWWJnIuNJm8uaTzzSKsbouWGKIOAzzF5KUlxou4/SbyZ0h/PkX9me4wgiDN1spw2YS8MNlRbhyw+BcJE+GD43UvyQz3kuw2dgwnPMkO1z/G0DSQV0KO+AdlJTYCnslvBKzrOjh85Ja+I+fOXQS2ENexdwG8WWjLEdg18Fxk7Boso3YNyI9ZYIMSKBwYb33VqL9mRf01kz+DnJmK9ZVp7NxlSRK8eiTKX5awTmNHc7VfNMDpiwqEzDJdz8GvR4mK1XP4mUNOziXqOYAO/AA9lgjMKErcTUnPaTd7TB2O7T3m9GMUa/wCSuZHSoVwJfML0pV2wl4Gefy55HWqnbBfMIb2SXQXFSMO2l+Lov5axIIM5xbINHa+BVoHOl3QAuUxNjMkI5arvWRAb8TsTxSmK2V/vFz7ExOzP17mkJO38O0PO1jdLDCfGMv6eDHrMzai2xxXK2HWpxJzuW2KXG7bBLjcNg02zX2Kdm995M/4erwf7JYfSbByHpW52l4D/CBmIdEAjnZ0MRGdoUkVEzN5MUFzJuboxjTxKN/RxaS2lbwigzVsxjJmw9azj23tM1+cXWx7xdCA9WUxcy2en/wTbFRpbhQTahS7YseZGrKRNm7x8SjFjNGlmPlWt8qXW8YNufiheLllJTkukHJxK+XyyHvhJgkzhyrJccJszUsZAVOsQ0JGZxGGfJNdTCOSfJ9hRB50fHLIHtvjDg64NsZtMhcy2FhpWqVBqkcmiFQxnUh1lyCpQElNmiXVR/7Jqp1MFpfOH4JRPZTWxIpaA207s2JADxYDpnLJjxqU3YPtL16jqLLyGvJnErNPkprGJOtf0dKckr3s1CIKVUhaNi2LLZ2WTdNb9MTIwJRtWvChh9kLb/jaD+Mf+SeJ7d80N4eaQa98pYhYLUfElcgd8dBDD+mz0EMP1dhDDxnZkclQkegFLp3YZ48xDEDCICmHjNmDpJ6jMNXcQFWku8HqLaOiOfktzIrNVmTFZju3YjG2FXvJcdS6BCkhorCrZLGlrVgVbVSJkYFWrErQis2/7uUFX30pfBQsFWEVsfCsWBq5Ltrr2FYsBK1YGrRiVaAVy2BWLC07MhkqEr1QClLFtWI4YxiAfCtmHzJmD5KyYilSayErht0K4SPsGHOh8z3jB9+Rif4NMwllrvbQF80YaIUef44EwUbeo7jYJeZnySMQZEpeCVahamBWPEu09TJLgZNGaWfyR/CA395/Kk6eHCu4iPAawD9BfpWAfyW06PAjJyQrhbiEVJZHFVWWc6p+xhzZb4wB/RLzyHMVeeS55M+ET2z5SQBIX43sZ+p5cxXA5/NVABu7hnbc2znQdXhH16GBriH4yF4C/JIEv6TkjuyN6cpFECsCfvGBX2Lgl/hFkZHB48T2bcBXD3zIdh9DLGaaTKs+/c1R1N8c8meQ1VexK2EaO3efIBWyvd+3jZkgr/mFAV2O5fpRos9SRPRZpf4mpL/livpbPgFKs1xAaZrkD4oiShPP1XzCgJ6OKw3UL7JBtgnjVFwizIgVJ4GcEEQPAfoURTU+wf7iivqb0PmJn5s0OLQdG2RS4jSUgXgb56gsLLQJRbu6prOkSH9JRf0lBfsb7/nNUtTfLPJn7tZJEH3yjet6+cPNSAVSKlfzQQMaPZs5dYhepbKjqiIH+bzdKXtUCeVtOldzwoC+A+ctRqAUMqvNEoxPcfOVVeg1j+JJTsJ3WIieQXLIkps4Nm4ar4bzxBlFBxT2Ise9LMX/z+WX/au7BjsWLVs3tuYf7R+6wK7b3wsv+asvoNX7CWb1/kXgeEACulac/fuqBPvf04mLNgbFaYJ/RaxjRpF1zJA/s1u4Vc1cl6a6+YVbCfQkIRoCWM8mm5y5yFVjscd23NtjVXLjz+3gkJnU2IRTI5FL9fOpkUSosQ2PL5G7ThJC1Eh86tYBq9iQ+DAr5ikSxXkT4KjnCXjQ+0F28es6dzHT8DWHDPAH8dOq40SGqOwhmF0CwThziyKKldwkc6n3Oq5UKUPKrlM0u0mLkufJ+x0cCdrFPMtSs8sAf9jW8eSYnaPfSdZNTLxGKTRf5FoRkOcHdoqAhLbInYQ+GXyL3G7ok8l5vg8GP2k8+LnSVCb8wboCQp0k8O8pTggEDU1pEOQjWaEm6WnaQHd60rwZ1uF13Sceg8qdonCicctwD+iZozAJqEM8adIOcE7qAcTbyTRvqU8ahZL7MH7NVcSvueTPxilJPdflI2PFsAOOtHYqirR2kj9D+qtS1J9INQmuHdsE4rRn5bcIyNGzNgmMy9dTn8c26n34MTvhqzv8JDpcReEjNt2RUfkVlQ+YRsW6DyL1DWNAf4cN6HpFA7oeIZMHiUi8rt8W4YUjEo+iiMSL0gouncGtW0Ciu+u5MaQPHaPi2yLmyN0W4bNxW8QcydsiripD9TNsbfkmLZk+dUscH3bcza/oZKmf/BkEyYwkKmFHR4jjdYoChevIn0GQ0qeDfbnUa47DxG3I2t5pmfM2ecsVp6vniJGBVi0uWIq86NWR86tWzH5LYjedv1RlJA+vI4TB4ftrW8BS5ARYihwHS5GTWClyQnZkMlQkemFssudHutceY2DATfYAqaph01JHF8vGy4dXsg3/m/wMsA+5X2QTfi2QNQNM+v7Cu0iUzbr6gZa431v+Qw4ZW+59AGJg5gbBW8ay8QD2DInXZGSwiXIfQomaD/aaCIjUQ5tOMRIj20INJiY8bDLtB1y36mV7lytg8KLNr2jR5id/hvS3TFF/y8ifjVPeexl/WVlV6WBZuZW5rJz2KwM8ia2XwLWyn87tVHINr+AFLZVMVa2q5l/QApWvbhWQzUpWEBbDgrDKXFXWcaCEBdJx3tUQbysi7VRuErwGxKgb41Mnzr+nUXwLwAP7E5GKtSRv+9MvUYnhgXc3U0RDEJE5lm0CY8kgY9mO3YmbYapH9WJDo8GypSAuNjcznwnMNBnAc2wC38IErlphAM/HbNACRTmbBeTPSjkbFTmbqER3C/TK2UxzP2czzW7OxqoMxN3H4E1tjKdRg4gyrCN/hvRXq6i/WvJn4pDruELDeIG21i2hCdYDv98JPBZfJi809TJCU4a9Ju7D31ogmGy8Jg6nwzyK0mGiWxbrFfW33vQzRrlH1UHHudD30veRw94kLIst7U3CyBXoyJPQYcE82q9u2fqlP/7uqz+BGBSmGRTmajHjHs31SB5N8hLWh8A8WhTMo4XBPFoMy6NFZUcmQ0WiF0rQw9w8Gs4YGHCTPUAqjxYSVH1XTA1rEVx1hMiGaWT72hX1107+bJxqFNrBreZiOmMA9OXA8p1IQu1gcDKUy8QM8GE8RSleqsK/7zpk/77rUK7qlP37rncIzCgkfd/12JgedOyvsHRGGLvv2QtnmuB8tBe9CNZPFzfAfjkkN89Keb+M+F6/olVeCKUVFhYwzL/xZ0KZR7nMXQPYdVJ7SoAlwBKgECC8WnEeCoTEzK/zjvxw3jYs4FUkqeclf8aFpLPA8IMFSAyxzTQ2RtFr1Wf5z8FF+VsiYd42g/jxibFtms8VxpT9vsDW1nMODjr4mERJv2aAfwE76BBChTeK7kaG8Zcr1EQyUfJn4pD8dVsIfTEuzI1c/46QOiT/5OfthPvNm9qGHdpBUZdAnS8R+4QQ6s4nfyaRv5FMPQTk40Sk1imkKE6MobSSfO+L56gknzyYDIDj5uMIcR2neoSQy+GB4QGg+9xUdENcSTsxrwz46VcGCGJbvu1HqH+AnJTlW2fxzzvYRBN6u6DxEHJnO3LnD3JcSKpgL0r+jB8xvOqgGCbMzAOmv22A/xILJit5J5ZMcVIYi5PGYrdfu1w64jSTo5PgSwt32BDuj0oItyn0Qc/IImoR4kSO+CFoLCaNI4buLomwCHmXxo9wJIxERVHXaySiYjtXTqKiKL5zRW4lfy6/lXyFfGs7+weHe8a4Ah1xDbF3h6OeC8x7N4H6APjeUqiUYSNU4iB3Z+nV/WeHL5HZsyYhxJqEaWuSRzwsby8qjSXNzYi9oI5fEmOGbwW+G1skccuFw9ZFEmmF4HreML75zxiB9SdhaNmBlTaPUbj4v3tciioVRsJwEOrUOaftHIABTVylIhMXR1c6FmokUdeTJA2QeO1nEokECcigesiEMkjeerIEWAIsAZYAdQfEFhuVrIVKvuV2rGLUq6hi1Ev+DOlvmaL+lpE/s3jCoMrklGnsyBuyXkXpSi/5M25+Jb1P8PAIgWH8uYN5Sib93wzwA9gBMx+/DDUIVvIVb83Jf/PLFnQUasGeB6PCgFRYZfy5lXVIlSAAJiEiHDsmeEqUxbGtzHOi6b80wHttHQ9jHjcgOoXKsNCdKdOJCdaZ+PQguTMFDxt8/sDHL0BbxO75pNFzLyiiHocimoZF1McV0SBaOyhuaYKo5Jq2RsSP7fDfdvejkuE16QfFH38u/U7+TrmAtixia8tDAsz3ucd8L5f5foTkMv7adA8PZrYCds742GQ+pyJgjPnn+Mz3AMz34cz35NKPCDDf6x7zPXaY7+EyP4Ay30cznyiQj6CBpcwRNZ9D0fDhHmNMND5OiAaWmfdKeTp20vjZfNL47W7yWeNz5yTyusaXKHCorQrP7LIzy1UShppfXOIVLS5hX+SVvoQUl5BmPj8liXOcPtf3KHzun+P0yZzjxDXWr5l0G7sWbNn22JFt7FSlVyCO9aFxLOw6nTisYC79eb7DCqKLQPF1SpAcF0KiOLYGD8nuyXPc6tie/H8RcKtB99xqnOtWE3bui2LkahKokibRcNu0OWxDhTchl1F7+evLuJ2wMoHeEOXBMiIJbN8dTg3E3UsNJLhiwuQ4j0YpVkrvMhJ6p0h6YYF5QmKpJyQmlUTiCHksKqooexk1/YxlOF7hX3Fl+9qc9PcJqyQ+oahjhiNyn3J8zdzkKHGLy+/qJ4VK3MSNm5BCxIlKNbT83M4FWpWsC62IUUBzQeMR0wvGTLF/E8mrxQXiIcmKQK+AW4vby0aPTeb/2NJhr7s6DA0EmGUlbqmSuYxHIH6KuucYk1zHmEINP9CIcYET7vqqTGEAEj8lOdfPideMCVmJKP8ETMhOnjQMCEwIF5hwLpPkq0XUTiaJ+W4IYgbDJNURA+pzTaxjsFjHuGLNtNA21mWmjUBs/yiMnseP0clikvbGiXwroYl03mqJHGEAseqryZ8h/dUq6q+W/Jk45Go7iXHXrhwKtMpdORS0ceVQq+SVQzDrPIpY5xFhHWDpjBM4t2EZizWKqgbWkD+DIFnHA4zp72bfurfe8RUFj7pYwP2onQJuuHw2DCdOo4LXEn1j20uHvvsXn2yS8F1RO75rDSEMDl+7vAB6sBh4LVEUvJYog11LFJMdmQwViV4Y6/X8SPfaYwwMeJs9QOpaojAWjLht21gLlMxNyLVE4z+gsbXErVoNqCqX2anVgCpzmd38pFMQCZ5vw2aBVr95FPkxj2B/Nyrq70byZ+NUbXcj/26qzD3gagwsDcpj7Gcelq9uNqC7se0V5FJM+GYq0ARiN1PdZgJiXabVK30zlUEC/nzs3EuVGXT5Xir37m+0sYscdv/8fxg9/2//pJufvSgJu33Sbb2bJ91iE51ND6k86Razc9ItTI4ZDuPpk27kyVfeSbeQ+aSbKegVP5wmMALszhLBk25h80m3FQgjndwIQZFaGRT21JPkYbOkvImrhE1cTJGJw/Nw1G4/MTQs2ZZQtMMhkvu3D5lWDxlQD+lTBpn/tqcEWAIsAQoB4ptdcNblbux0jszLDj6x/V/0ouRVivpbRf5snC5KXoUt+WXKsgNihAzwDxJlviyba/dgi99ArjppQH8FK+YNAge/AjRf6FxpwOFuXwW82xfk7vbFkKzHAU5BOSYdQQFuvSh/kMUYGav0OvNbA/ol7PSUzKMvRJfuHPnKfEfsyJdf/shXfuSb2f2+Mg4HvpJODnwF7Bz4CrLsCyazRHotgjoVn07HwTI/xY59RMnm4qP2ARkUdcc+wuz0iidhpzQ+ITG1EJch+LGPEM6QMdvzWunYR9mUPvaxfgKOfUQVH/sIODn2Echlfs8/9hFAt1nEoxTTLhl6MgYJyuB3XsFjH4hTjeWqgwJONeCeU52Q6i6f7O0AImWJjg99wNFlDPHXXim6IRIYIEmFFEr7kBIK15YFNu+D4NGIdzCGEoSESSmQ1USlhDUREpMAf8mIVa/eprx6tbptMlSvhkijDQluyKHglsOCG7Wzno06VG78logwuqSI2quNFih5HdvoRxJLNyhKLN1A/gzpr1ZRf7Xkz8Qhb+CyODqOJa++rFzJa9RGyWvWWcmrKVOjhnVBQVEZ78fo3qGov3fg0W9lrnqP47XbQ8iGqfM3JKXXhTHkUtio2A4oVvH6/Iy17/3knRe3SdhyfqzKeJX8HQRXrWOtliPiO0GvlwErXmNgxWs1VvGakR2ZDBWJXuBb8vbaYwx27Z4tQKriNTqRpoZV8Vq9fwIf4mRVvFYf1mpAVbnqbj2fKp3cO3DcctDqITAg4m0bHGC++jDtBwb0SeUPlYL2AXtkbLsJiDHk6vvtloMeEJhPVLocdGxEZx178zKkHDQ27s+UTkzJYVCu5ND4M4wc4J+GHOBPWb8dhMlaGL5IIWP2R+KFjH6SEmghI1wCv1ZRCfxa8mdIf35F/flN/Vn2WMhFN3uPZYoXRcOhPP6kS1CCe2u54blE4bbjdXhwDlRVDVV5y6/D58iswz06XTs93lrp4+x8FmOWp2RLHUy1Haxih+r/MMA/S+ysQeGTbpuwXvc2Yb2A8kmdmvAAeTC3T02sdfPURGA8QhgPEsJ4VZ6aCNg5NeFDgg2/KdiwqL2HVnvwJILXfGrCVPJkxfVBOiEyAqwqwwwG1ZUA5qfcpE6MK3arv2pQ/zhctEKti/hVRD5kXbQJH9WYUXyBvy7yXWIVApSbzDcL+l8MK/t1CWNU7rBsqpyUFFbZVPU3kSodv4TQ+szHZ2oE3KqfxWBi6LZKMjiiF8hVf4fPZC+yJN8kNS5a9PzsUb1Cjorld9b29Y8axTgXbZSa+cAvFeAX70URv4F5kYLU/4tIDRgoXR5Quixe+jkjRO7pGioWL12wQa+ir2bOtlSv9odWr7bWlXq1yGKsaMArsR0eElvjhLD+/Ir6M70qKnm+3uBjF/t8/Rv8wo+3D5YCqDJ7Kn6HlRAhW48Lx+yU48btjD6JFiDFsJt5k3ZGv21CR2+6+w+6/dnj+HJVG/Y5CdvnuCL7zCSWgqVsjG0Vk24vZTe4uZTNjMdSNoYsZeMql7IZO0vZJDlmy7cqcszWuI0wf0le3BY3L2VjZBdW3CSkEyIjsP7EZCfELgBImmPM2xFGKnyftkodVAYxcZJVHRl5E1cNm7iMIhNXTZu4DEiNveTQqPhlL2mAgO720t3tRUIiAjKhHjKlHjKtHjKsDDL/bU8JsARYAiwBjhMgtu+bYd1Fnm95N7YQlNn7DYst8sNYfx2K+usgfwbfPOu8hMs0duvEMgKEzKCRAUbIDFibZmy/TrsD7JZ3KI5VMpbJTfsfBvQebLphpLbW2YmSKHyipLoAGZDQrurin3eiAUIQZX61ADMOy5408pFjY500mvbXBvgRrDKySkKtTJ1C0iP60GGYLUU9yD0JpmNzktJLMGQ3u+f+cXgdNQOLaIYrovhKwZZch1G5rpRIm/NfXKwUfXGRfe5i2mn+qWMBbdnN1pYzAszPuMf8MJf5laiXE5cY/EQvIRohiaS6zyHzTccKmcx/H5/5Pv6hzN3MbexpHxBgftg95vvsMJ9/R0oGZX6IZj7hpAN2CvtsMj+E+4Qx5v8Zn/khe2Y/lJv20Yk1+yE7zA85ZH4YZX4EXTCElDqFmBOnEMtNu4RdkFNFNhcfdcitLVnjSxKopEvb2ZRNS0wtzmVICGVIHGfImDo9jZTeEJoOlIn6kGzvhBZv+9wr3vaB2V7h4m1bvtqlgoMNbNkO2Sw4sFG4gd0I4SPKj5FkQ5WEXTUFCVAULhr+ZBhatTc37b/yPSAz0Oe5iX2snBJJLJhE9DOqe0nZhDoE/HQG99P7ctP+UcBP73XPT+/j+um7aVru4zJgP93obtOKw6r1+0Vtwj47JmgTUhsc5mcrqu3cuYOvUH1YLmkv9dG0toXEpNq9RNNerpjsQ9O4MrJF0IgSBFyIwmTfMpZOQEwy/AxjFBETuNAJsBzEcbit7Bjx3/ilV5V4YZ5w+U8lOS7kPqj4xLwYOf6XReHVTl70IfmYvcuiojbv3InyT1Pjby0DjRKA4BJ0uI0huInctP+09QIwvwQNfwGYlk3iAq8U9nh6DBTcpHsv+Ka4gst8jJdHozTdqIrkOiWaaZJemGNOCT3KTT0xnlC5N5Uobg5SFVQKuzHAdoOVi8YeSA0YM6b4CrSNoUCpXM1sAzyBPWudZN72UVNlPMv+ItY6gemLD9OXqOyMk7jJGJtxraEo3wWVMeFQGeNOlDFjRxmZOx+kcUHy2HEJY57kG3N0IWeyoiyTXtOG5at8JE2w657j9hyUgN1JPUsJbIq0gOIeJYXYhSryZyAkoxqeUHhQVNZ1n7COhN8swzwBV20iI2PTsKbDsBEvSUk8n5XVqKSlSE2gR1adq7mWnzJI8RfjabaZWcZ/R1IAfBcb/AZ+2FPN8s7OFpoZTPD3YqvQBFx+W20uFSYa3UVlR4mPKV4J8l5zWa9pGgxnLzaPJFvEtxtOdAOdlN0r5zp8EgzdSfZii6VxPHcADcW46meZjL4VybQFRDZUQhJ7GxGJwEHWXcYItkvY6TjoH0yPfxWjNHQBwLoHqeZOgdSdwxWC5wdOrpNlkIV/nWwVatc9qNdrRVcIUYmlrZB7N5a2qfdLLCQJgCUOItXNbCt/hG/lq+ywBV+4JTErn56QxS0mulVc0U3b8YSMkCSNim4GjUxjAhFi0qboGk8zpe6nuJMmh4CY+ip76wqPvd2cDOmLWLs5NffzQ7N9dpZJeJbYg23Y3C27YWPsLW1mbtfUvFPA5qfdeyJhQrZrqtHtmr2c7RrMX2Qk1F9IrdKGWu2UcIr8ZGcVIC4p3B9U5Wou8P1B2o4/wG0dnc80UR21OBMg1hNSJOpBi0SrOMcLYBk0gsrUegmvwb8bGk9ve2yntxMSo0yiydfLcDhC9DdLUX+zyJ+5m+4l+kTirFmK0kizyJ9BmUgVEzONnZ/Jfk7WOsYxZzpmG79uQH8Bz2PbFW2fVBYuP9htrm33BDSLiFNoRCyTjU1ZnTNNvCr3iJe0sxJO2llypUjySO6VmQTJtUR3k8RsEg7lJ247ykhOmSgjLhtlJAXC4yok37UZFADAShM8Y+03pnM1/8KPYTN2pAtfp1ZhAlSNiV7KNSM0uaQrjbp8W9KFZVOriEjBuguQIs1WkeQdS7HbQFL41SImY2zCBK3rjnt73v4BC+MmjvMgmxGDvBkkI5VOARBS7OjoTX46pQod2S2gJRAdWRXbHvxvpBienBe7GD6FFMOn5dTRL18Mn4aL4VOKiuHTaLhPmQ1MXUXCMcnz1KYdPuWQScc8tXd/U4q+vwmovCyAWWWkjBxxYV/qW+J3NMXJcSGmqoqtFVW6akWVe1pR5VwrUiWtQLSiasK1IkWOCyHCp3Z1CLwaI6EzkvdYtcjrTMZ9ncmgOuP04rDms5fX9HQeOramb+Tskzv7tnce7h55lGnQNjClutqkpIp5G9eVt3H3eBsfN96mpHiL5DxnKsp5zkRcuVs5z5ngVYFGzrN2uexqOoblPNO52s0G9ArsJEUKS4jCJyniDte3vklVkB7j1JpCR25sJtliRpItBM+Guox+GwkA2gKqWZq7J1ktdod9mll7VbuVf7N+ml/qyE4Y1d6mSaljmoyXkDN1KdfO1LVodqYuhp6pS/O11LBufKneh3o4W8PPYFwEiz2gy5PSuCBncrWHxuF0bouTnOI+OzlFnMZpVESq7eUU08iO9ybkgoA04YnR8yjQwQY0L425jwTz0pbaQX6JeCXvLv3NbOgTfKuZwC8+EN5XT5CjQi+Wt2YyiJaVhTsOqDvar34Yk/zf4//BleApi3NjDiDJLMGsNS69ajyA3R9va1mSQJYlKdkQXXpZkoKXJQlFy5IUrjAOV7pN+LKkkrksIZNnJCO5FQu175VVUSLI3sRW0g8a4H8CgtuMLysL0Mn9UqrsrHAojuk/Wl3hxRaGMeWldLUfEjgE6LRo+ZeTqkSjUkIEU9wFRVL0aFYl89X22k9ihwC9JE2w0jqZOQltS1byzUHMTk1oJZgBMP5cwrYhf8539HE7jj7BohAxLkTR0YPEUdfyDch+eoKrbi4YQw8a3Vaip1cTIqmD5Dp7h2AgweXfHrKYeXtI7fO2bg/hy6DS20MqSfsByWClQxlMwTIY58pgws4alxeQS94e4iX7FjgtlWzjn+SzCqLx50p2OinHF6e9drwjfpOXB0sHoDd50YGNaQUMLZwB+hgnLFivpN2dq/2fApGL0zTCaliM7+aKMfMACI83B+hG+0maUIJ6gOSTeF5wH9cM4ieX9pHdsk4u1f4Ai1xSJE2wdLTMnIQWBNUFjU28iJW7JaRO0RAIUESKUtNUNcBMmv27QOESPyO3lL0I+IWtWkT+eRq8FjGN0b8ayzunXKt0XTPZz9OkyL7F95SEVMeoRUw8j59+lTklRiAI1/wBCOyavzoPX3WS/PXzQub6rM4/IUeT0RQCurecAFUn5VB11k+qo8lJ9KyVe0eTE0+B2sGPExcxc7N11bZkMO5QBj1yx+OJlpWYbU842HBazPSddY0CkaLTIvYqzRxH2t5jeimWSvEiRdxAp7kGejYWKVaSNMF0NiXldgR01jhzmvgwlsiJSSxjTaeLbGUMPeTcmR5pMd/dxQFVSuDuLp6rW2rrmkm+u8MzSGgiLYXtYVa6drNdetyPzjm5RCaOKpZ7R+cS73ZG5pEH2Rt6lgdcjKJZoxNDegsNcnU3URt9xmZgcUhLl8BDevkrb37ruZsW3Xf28Z0Dnf3nL9ClcZe2dw0ND/QaSrKeoUWeXN1tBfLUbbUS0biRlboGM1D4ssdofZDeOwwa28T4f8vhbeLQJev2MKE2QUhUGFeFE1fpWlU0SDRkPg5Rt8+Y5R3wUL2Moeb7PMyA9ebq7qJJFpJT/DKa/QQUrBNBY0L77f3KEI27aNEgoIrCAffiR+42DhSE2KG2ZJ/vevEdr/z7K3xtcdjR+xb5kx/cvWWT6x29GPqPN174xyPnXO/o38Lb1nv/6gNNrnf04Te2XvuumtbXZCwaVN/LKN6olNOscvnijUq4eCOmqHijEqmy8qJbpJTLjRdNuLjDjSOlVSXAEqAzQGZ88jHDiXyQ8twegZWPBwkbvWihgsdWPGT5EgS/hMAvYfBLBPxSTk7B8q2iWDgFXTFpxHHZxxjHcQTjOOTi12osjgOTw9Ok4jgiozYNQqxBELdRiNOIhhBiLYK4nUKsIRpCiHUI4m0UYi3REELMIoj0Y9l1REPmZnB2kaGTn4ZZnoXj4fsYsNlc3dO06NWri4frkUfbnB878hXpaekmiwQlktOrkA9K6uGgJKsoKKmnpSsLBiUN5NAoKjZwvUsD3VkDwpYSYAlQM0CLQtSrtEL1pApaOqouRgEF6/110GHwbk89wLTg2awB/T8ot5Ilh2n9WC8QyTHsTL1YJFc/XkSPIStS5x0Rx1cBEjUipvgARXTCFjdS50CayN+h1/Q0Eo3yJ0asPzH1ZALjC+mPwMmCQkqqHSWmjblsmQH+Y6zArB6T4RhW6eiTkOFYkUGQrUF3YUxyTk+3IVf3c/4uDFRnaijKZmaVad1r/D2YBiT49EoIcgPGmBgpYACmF7Efm+zRvt40Jxbtfy34cI4XyZBm6EfvLheXKHDWp4Yuub5cXDZQG0WXiwsA+JKParqeAnY55ovO8wvMj8jrM+J0xrTZx5fBJjREBRo1042ayFFZZZCwg83UxyZMepsFvF8LQJ3mwjz2M6jTkstWCBQcNDncfyyH9x9bzvL2H6fTZG7h8qaVbjSdpAmlaq0CBoJhdJq5BqIJNRDNZLc0f5py2WrMQNSTNMEiHJk5VRfnRHlfMiAw/C/iBX0SVr+aRICGi1KT79mb+a4Oim0bMFc3Ftu28s1Mox1Xx7BNjeSoEOo3YSFdPajuDe49x9rIVXfmdJ2aYko1mkl6YWrVKJEzE1KcLLG6GpfFwN1gDM1IOGVdTzhl4YRTtaKEE8YaL73UwyWBt9CXXHWWAEuAmgHC+WjnViiLrAx81Fo+u0P2YJoPi/3HdiL+mwF9O7aSz7qYlLdRKVBKypcAS4CTMIeu2HbaSOdWT6p0LsMFnJZN//i4i76nDfAzFFF8JGNRD4Hmem1YWZvpXNM2CSulmH3I/hq3nrPGfa8m6dyswAJtItK52T/FsjUxsvnkSOf6kHRuNZLOzRLpXHulwVSdFEEOqlKKIAdVK0WQg6qWIsgB10ul6HopghxUxRRBjmLNlER5s5+cGDzTcqwsGqFsGKFQBW2fCQbAHIkglI0WqnKlzTqe1f8LW1n9aoepJJ87Wf2s6qz+F0tZ/bcbCPiJCcnq/739rH7W3px8YHLSRwIWwzAkGJKJd0x36dryuj5uxJPjRzzVdiKesQTCi5pEPOatF7g6Jguqe717Wf0Grro3oks5WzsfPlo18Jx/luxb/HSzkOJUEyksh+dcHv2HeZteu+0XjQ7OuYSR7FVEjut/J5+9isDZq7Ci7FWEZlOYWElbuy2X6/ZvoW7L6W7LyXlTHVfI3r5P7QgR6NCZH9R4mur+WZcRZn+NhLAx1oV3vLRNFD1UrQNgjFVlRTCtoMs/x9TnU7uWcRm6iF5WwJopKSx3yGtmBayZ5Yo0s4KlIlBeOUoODebjPaoFY1R7wB7VgIOqAU9oT8PjqgGHVAP2qQbs1H7Kw9qP8Kj2uqycy8e0V70R7bmsXLBPay+HJ1UD3q+9puhvvpRP+QHVgAdVA57RnoYntJdD/SPYIe2nrNzrdasGHCgFnFNAU0ZKblS/KesfcOpvYE9qb2CPak9D/ePDQ1MvPuzV3jic1J6GI9qrnv5MUW4P+7QPlvSXwwHt5XAqOSnjz4h6N2Wt6yDK6GS2wiNIb6Z9emvdNtGfN1/aDV0Vx9i/jMptIfrl9y+j8P5lhaL9SwbzKorkhLfno2i5b0RqJxrmHgHpVw8JVu/40U1doFEApeRTG8aG0X2k90oJy6PPDA9193QPja7rOjh85Ja+I+fOXTz79Jau+/oGRscwBroGBwsN15399Kauzv7VAwOdo8Qk/LcDv9/O/n3Ad/HspR3d9/X3dJH7+WefuPrD86yPt1P/+PbkrE2u6g1dJ0qU9QYl6OxHWBckf4b051HUH161DBuGgJxuzpY3DAHYMPgVGYYASiu4/jlA09Gwz/cqMurGt37VgMdVA46oBuxUDXhUNeCwasAh1YCjqgFPqgbs1p7Lo9oL9jHtBbtn6lmbIe2Zor9gn9JebHq0p+EJ7V2A8lDktPZOanTqyeEUtIcueD3oKQHjmH0DeAN+ADgoRRw9ZZ19DuQa3muA19HnXeHVoVdugTZXfnXohVeHHkWrQ8Zhcw+4OjRd60mx0ThvdATqzEd35kPkwsdVBbuAp1QDDqkGPKYasFM14GnVgN2qAQdUAx6felwe0l6XlY/wqGrAHtWAI9qLTa/2YnNSexp2az/CUe25PDr1nFSn9kzp1X7KD6gGPKga8EwpctDPOLjg6K27o8RlSWGJNZ0X6S1M/oy6mwle//rklqBe+fWvD17/ehWtf30oreAbrhiXeBi7qnskOiMW2+J73eQtLUrLEXxzgN9vAsoXPPLlCHNkyhE82NOYoAJIPo0ZJn8GX3gWBpVjp3GxCaytQUXaGiR/hvTnUdSfKR0F0RtMveVxu5hPoDacJ+4ospZ0kQ9+s0u6MNsUcL2kK+C+bQrI2KYgOTSG1OTb7YM6C9KdBcXE0Kce0rm3YdwkmO+5DKGcF0xAb2dLSJlVQsrIEeelu/Fb5rutiN+U4a/Uw+rtV6TefgH19uYfPP3Uro4C0u7CH3cxNNt75aYtpwy8BmQgQziCstjS6h5E9Q00BUHBu7M+tfZjkZV3dc63p0pAoxBeJefwjqtZ4IVtIfMXP03F/BfT7Z6FS9pepEcWkh2ZDBWJXmCzucceYwo3oRGiQpqHq+qd/3WwSEmmdIYuEddkWdsQO1uFn+ca/tbY1/qyle5GV4VffAP4hfR94IArjVgb+IoNTD2XF39g+veK4tCYHUQZ5DGwIhR5ormGr1sYEC42KwiCte8wu+9y6+TAIuMCoLUBUWBc4MhXofv4JGMbD/se24KYgHwJmOkfBvgS4TC+nMEXAytE8aU81/AypBhhK18ixZ8w+w5bJxfm8IWS0gjNl5cK9HR4XeKz1869PnZn+x/xr0t02FHsK1+89Ye/6W93cC+j37Y58CLr5L2OHbkX8xVj4YpA7C0RZUg6yN/LRxlhOJIIKFpUhGmHFUCCAslbN3939vKans5Dx9b0jZx9cmff9s7D3SOPAuvhy4z1dwSMInz0QpyOLyIFEW56p+N6jd85ls7/y381ouFNMHjjvxrBKmcZc/u/NcB/g2VP/FDSIkSq6tNXR/f2AvzW/oukHG0Z7mE2CsHx6I7hg2D4BS4jI6KXLAcZ9IjkGssMu9YFdmGvdmgMXOCN1nJU44BGzOsoiXEhJ+4qqFwKMY1IPpcC8jUC8tUDNyq/wtmiWSdag03eDjyY4y8XHlwYDd5NdkF8iSR0bXKIUOCi13zC4Rkee0kLD5i0uF0+aeE31mE/FE9aYK8tOAkdQDkImOXAR/4JNgqaG2GPdgRUxjsBkjqIPkBT8qCiHUJKFp2PHcuA+FR2ZIDd4djtZuE8fUFrG6+Rdbte3M2Eco0LDPB5Qm4XjM8KTjI/6DvJQYAFt5RnDRfNGOSXWH7VaEQCUdMtzzUuIbwqZH82GSRZCk6X73kjjAGEc41FZi6n6B02GTTscDrs0vLrVtM4Cg6OSZHVxoBuxPr0IW/jRAyItSBR9xK/ccFRItGgz140yNB1YmBIf2PucGsfcMy//Eoy2hrnEO8blQMvvJXbD4XKyWEjlDDFNRXk6G0EXWHUn0Q49ySIRz1eMOrxMqKeMfuJqBwaKEJyGUanUi6xnA2BUzHRtWiaHOZX/vhHv//OB07Xvup6Imflx0++L3rtM3/pekdPV3xzzX/5ePhumYyRVR5MASqi5F5MknyYIQW3wMqJ/Sraeu9mW+8ex+8alNHkIqAgz32Jtag1nPd29qrznYb09skuaXnQA8SCFkrABB2+yOOHX+SJQGl+woRgh4tsLacZtqeCtLfi+/P8qCuIZjPCZLc0f4K5xgewB7g8qGvwinrlAJK03W2I3kccR+ohMMgpQx778yCXVniR5xB9yHOIfvmVctDY3v8oslJ2xSz6J59mbqJFqhwVOGeiDPfqZ8UAH+HugAToNeT/B6o4YHoDmOkdU+1nDehPUNwPYHKD1oSFMHcqulAKwitPzBpjNT4RUMA8jh/CCshvvZTDWy8RRVsv5XaKOCpQAhd3W57b1jfY1X24r3fRtq6B+4aHxn7Z13uBVDc/afr8qMYFUI2LoM4DX2CGoV2HiYwXQX0l/ToraPxrQ2NzEvwLcZnOvMyNGJd1loQpjUpg8qWPcSdbFBsIMcoYvAqMmtfI5WR7uKjImWcLwJ6tnOvZ8MfBxGlXgaoYfiufKRWLqWc5J+PCyf/wBDqIbGdtQt5vDhKO0+H69IYZH6zJ/vfjUdcXwgF/9iPNzxy4RWohbMk4kRWWvIyTZV/DCLp3qNxVoXaSYLcbct3thsRqJ5243RBq+OB1Roh1UiDfbo9EPiqMxEOTARAzWSKXQwYeW9d9Asg2bueXSDT+XDbONq1kWZF203ID/DV7owZt45j+gkE/eCqI2rwROTcSuMQuhzDoZ0mekwXLb1dyM65CaWo1CPNrmDDYcMEqjpBoFQe7qqXxt8R+E1qxIr5QIfep4JgyIpthC+AZtqYyWyUj/INieI4rgJeMIBl7U6xmIswExGphbqwWQbNyjMuHLiOBkylbILZlTO+g+pgS3VRZ0LUxrRN3XcZctlEMNXFAHDHAzVniFVgBk0axJD7Nf+Y+wDtCtp1tsKbxlSliR5mYuSxiVEh+Bqlf8piVyeSo4GpH15TJx1WmAFIftQ3dmsSrVnx82fcw/RtRywGdVvrUrQOmnR/Twol1WqlppjGaJWjpxrift3TvNLaNUH1iTmPzVRU/JimRIfORGbKAn3NYTlBkbMx0EyZnPuTEoFcgueaXWBcE4RGFBBxjmI6GfdxouJyOu8PcRuxd1HLcBY85ptXGHs5LivdRm9ZNSJQXVhPlhUSivKB7jilkJ8oLiUZ5NiC3YSoVsReKypTlEe2Jblk56aad/GALSnhHMJkeg76DL9MVdmQaT3dH8HQ3UlRlkukg2X4CVi5BO/unQSTYKrcngcEikxGjbkumt7kl00f4Mh22I9PhXNPRCbHTESzjUCEs0yYvrKWdxurztqPZxghmckP2zmNT/YXIn0kkxsOuR9th9xPjYTtbkxGUwBLRdpiMtiN+e7nloM3zO0Eiu2zRDukjqEzWFtPHhtIZ+Oxz1X7rQCKy5Yfs89dIlX+g2BV9DrvpEehQteWAAu9QdQV4xDwCnfSukEUKW5BCtpEi4OH/kPygIKig7ePnTe/Jr/H+Hz1VQmv6/gQA",
|
|
2617
|
-
"debug_symbols": "tf3dzuRIcmaN3ksd64Bu/q9bGQyElqZn0ECjW2hJG9gQdO9f+EOarcgshCffiLdOlEvVmbZIJ81IOi2c//3b//nzv/7X//uXv/zt//79P3775//137/96z/+8te//uX//ctf//5vf/rPv/z9b4//+t+/Hev/9PzbP+d/+q2X3/65Pv6o5x/t/KOff4zzj6k/xnH+kc4/7Pwjn3+cUcYZZZxRxhllnFHGGWWeUeYZZZ5R5hllnlHmGWWeUeYZZZ5R5hklHcf1Z7r+tOvPfP1Zrj/r9We7/uzXn+P684qXrnjpipeueOmKl6546YqXrnjpipeueOmKZ1c8u+LZFc+ueHbFsyueXfHsimdXPLvi5StevuLlK16+4uUrXr7i5StevuLlK16+4pUrXrnilSteueKVK155xOvrz3b92a8/x/XnI146HlAPh+TwCJnygkfMtP5yLQ7VoTl0h+GwIo8HtMMhOZhDdigO1aE5dIfh4JG7R+4r8lxgDtlhRV4jsTLkhObwiGyC4TAvWLlyQnIwh+xQHKpDc/DIwyMPj7zyx9b4rAw6wRyyQ3GoDs2hOwyHeYIdh0NyMIfsUByqQ3PoDsPBIyePnDxy8sjJIyePnDzySjGbC7rDcJgXrDQ7ITmYQ3YoDtXBI5tHNo9sHjl75OyRs0fOHjl75OyRs0fOHjl75OyRi0cuHrl45OKRi0cuHrl45OKRi0cuHrl65OqRq0euHrl65OqRq0euHrl65OqRm0duHrl55OaRm0duHrl55OaRm0duHrl75O6Ru0fuHrl75O6RVw5mW9AdhsO8YOXgCcnBHLJDcagOHnl45OGRVw7mRw7aysETksMjcjkWZIfiUB2aQ3cYDvOEvHLwhORgDtmhOFx1Ix/NoTsMh6tu5HQ4JAdzyA7FwSMnj5w88srBkhfMC1YOnpAczCE7FIfq0By6g0c2j5w9cvbIKwdLWZAdikN1aA7dYTjMC1YOnpAcPHLxyMUjrxwsfUFz6A7rspoWzAtWDp6QHMwhOxSH6tAcuoNHrh65eeTmkZtHbh65eeTmkZtHbh65eeTmkbtH7h65e+TukbtH7h65e+TukbtH7h55eOThkYdHHh55eOThkYdHHh55eOThkadHnh55euTpkadHnh55euTpkadHnlfkchwOycEcskNxqA7NoTsMB4+cPHLyyMkjJ4+cPHLyyMkjJ4+cPHLyyOaRzSObRzaPbB7ZPLJ5ZPPI5pHNI2ePnD1y9sjZI2ePnD1y9sjZI2ePnD1y8cjFIxePXDxy8cjFIxePXDyy52DxHCyeg8VzsCgH84LsUByqQ3PoDsNhXqAcFCQHj9w8cvPIzSM3j9w8cvPIzSN3j9w9cvfI3SN3j9w9cvfI3SN3j9w98vDIwyMPjzw88vDIwyMPjzw88vDIwyNPjzw98vTI0yNPjzw98vTI0yNPjzyvyPU4HJKDOWSH4lAdmkN3GA4eOXnk5JGTR04eOXnk5JGTR04eOXnk5JHNI5tHNo9sHtk8snlk88jmkc0jm0fOHjl75OyRs0fOHjl75OyRs0fOHjl75OKRi0cuHrl45OKRi0cuHrl45OKRi0euHrl6ZM/B6jlYPQer52D1HKyeg9VzsHoOVs/B6jlYPQer52D1HKyeg9VzsHoOVs/B6jlYPQer52D1HKyeg9VzsHoOVs/B6jlYPQercvDxgFmVg4LkYA7ZoThUh+bQHYaDR54eeXrk6ZGnR54eeXrk6ZGnR54eeV6R23E4JAdzyA6PyO1YUB2aQ3cYDvOClYMnJAdzyA4eOXnk5JFXDra8YDjMC1YOnpAczCE7FIfq0Bw8snlk88jZI2ePnD1y9sjZI2ePnD1y9sjZI2ePXDxy8cjFIxePXDxy8cjFIxePXDxy8cjVI1ePXD1y9cjVI1ePXD1y9cjVI1eP3Dxy88jNIzeP3Dxy88jNIzeP3Dxy88jdI3eP3D1y98jdI3eP3D1y98jdI3ePPDzy8MjDIw+PPDzy8MjDIw+PPDzy8MjTI0+PPD3y9MjTI0+PPD3y9MjTI88rcj8Oh+RgDtmhOFSH5tAdhoNHTh45eeTkkZNHTh45eeTkkT0Hu+dg9xzsnoPdc7B7DnbPwe452D0Hu+dg9xzsnoPdc7B7DnbPwe452D0Hu+dg9xzsnoPdc7B7DnbPwe452D0Hu+dg9xzsnoPdc7B7DnbPwe452D0Hu+dg9xzsnoPdc7B7DnbPwe452D0Hu+dg9xzsnoPdc7B7DnbPwe452D0Hu+dg9xzsnoPdc7B7DnbPwe452D0Hu+dg9xzsnoPdc7B7DnbPwe452D0Hu+dg9xzsnoPdc7ArB9uC7jAc5gXKQUFyMIfsUByqg0eeHnl6ZOVgWq89DofkYA7ZoThUh+bQHYaDR04eOXnk5JGTR04eOXnk5JGTR04eOXlk88jmkc0jm0c2j2we2TyyeWTzyOaRs0fOHjl75OyRs0fOHjl75OyRs0fOHrl45OKRi0cuHrl45OKRi0cuHrl45OKRq0euHrl65OqRq0euHrl65OqRq0euHrl55OaRm0duHrl55OaRm0duHrl55OaRu0fuHrl75O6Ru0fuHrl75O6Ru0fuHnl45OGRh0ceHnl45OGRh0ceHnl45OGRp0dWDvYF5pAdVuS5oDo0h+4wHOYJUzkoSA7mkB2KQ3VoDt1hOHjk5JGTR04eOXnk5JGTR04eOXnk5JGTRzaPbB7ZPLJ5ZPPI5pHNI5tHNo+8crAf623p4ZAcHpF7WpAdisN6g5cXNIfusF7ilQXzgpWDJyQHc8gOxaE6NIfu4JGLR64euXrk6pGrR64euXrk6pGrR64euXrk5pGbR24euXnk5pGbR24euXnk5pGbR+4euXvk7pG7R+4euXvk7pG7R+4euXvk4ZGHRx4eeXjk4ZGHRx4eeXjk4ZGHR54eeXrk6ZGnR54eeXrk6ZFXDva2YDjMEx6v3FfoKUpBFpSDSlANakE9aARNpxSOFI4UjhSOFI4UjhSOFI4UjhQOC4eFw8Jh4bBwWDgsHBYOC4eFI4cjhyOHI4cjhyOHI4cjhyOHI4ejhKOEo4SjhKOEo4SjhKOEo4SjhKOGo4ajhqOGo4ajhqOGo4ajhqOGo4WjhaOFo4WjhaOFo4WjhaOFo4Wjh6OHo4ejh6OHo4ejh6OHo4ejh2OEY4RjhGOEY4RjhGOEY4RjhGOEY4ZjhmOGY4ZjhmOGY4ZjhmOGY7ojRZ6nyPMUeZ4iz1PkeYo8T5HnKfI8RZ6nyPMUeZ4iz1PkeYo8T5HnKfI8RZ6nyPMUeZ4iz1PkeYo8T5HnKfI8RZ6nyPMUeZ4iz1PkeYo8T5HnKfI8RZ6nyPMUeZ4iz1PkeYo8T5HnKfI8RZ6nyPMUeZ4iz1PkeYo8T5HnKfI8RZ6nyPMUeZ4iz1PkeYo8T5HnKfI8RZ6nyPMUeZ4iz1PkeYo8T5HnKfI8RZ6nyPMUeZ4iz1PkeYo8T5HnKfI8RZ6nyPMUeZ4iz1PkeYo8T5HnKfI8RZ6nyPMUeZ4iz1PkeYo8T5HnKfI8RZ6nyPMUeZ4iz1PkeYo8T5HnKfI8RZ6nyPMUeZ4izy3y3CLPLfLcIs8t8twizy3y3CLPLfLcIs8t8twizy3y3CLPLfLcIs8t8twizy3y3CLPLfLcIs8t8twizy3y3CLPLfLcIs8t8twizy3y3CLPLfLcIs8t8twizy3y3CLPLfLcIs8t8twizy3y3CLPLfLcIs8t8twizy3y3CLPLfLcIs8t8twizy3y3CLPLfLcIs8t8twizy3y3CLPLfLcIs8t8twizy3y3CLP1TQ0TDSdVp5flIIsKAeVoBrUgnpQOHo4RjhGOEY4RjhGOEY4RjhGOEY4RjhmOGY4ZjhWno8sKkE1qAX1oBE0L1JT0UUpyIJyUAmqQS2oB42gcKRwpHCkcKRwpHCkcKRwpHCkcKRwWDgsHBYOC4eFw8Jh4bBwWDgsHDkcORw5HDkcORw5HDkcORw5HDkcJRwlHCUcJRwlHCUcJRwlHCUcJRw1HDUcNRw1HDUcNRw1HDUcNRw1HC0cLRwtHC0cLRwtHC0cLRzK87N5eTopz09ajiGyoBxUgmpQC+pBI2g6Kc9PCscIxwjHCMcIxwjHCMcIxwjHDMcMxwzHDMcMxwzHDMcMxwzHdIcaly5KQRaUg0pQDWpBPWgEhSOFI4UjhSOFI4UjhSOFI4UjhSOFw8Jh4bBwWDgsHBYOC4eFw8Jh4cjhyOHI4cjhyOHI4cjhyOHI4cjhKOEo4SjhKOEo4SjhKOEo4SjhKOGo4ajhqOGo4ajhqOGo4ajhqOGo4WjhaOFo4WjhaOFo4WjhaOFo4Wjh6OGIPC+R5yXyvESel8jzEnleIs9L5HmJPC+R5yXyvESel8jzEnleIs9L5HmJPC+R5yXyvESel8jzEnleIs9L5HmJPC+R5yXyvESel8jzGnleI89r5HmNPK+R5zXyvEae18jzGnleI89r5HmNPK+R5zXyvEae18jzGnleI89r5HmNPK+R5zXyvEae18jzGnleI89r5HmNPK+R5zXyvEae18jzGnleI89r5HmNPK+R5zXyvEae18jzGnleI89r5HmNPK+R5zXyvEae18jzGnleI89r5HmNPK+R5zXyvEae18jzGnleI89r5HmNPK+R5zXyvEae18jzGnleI89r5HmNPK+R5zXyvEae18jzGnleI89r5HmNPK+R5zXyvEae18jzGnleI89r5HmNPK+R5zXyvEae18jzGnleI89r5HmNPK+R5zXyvEae18jzGnleI89r5HmNPG+R5y3yvEWet8jzFnneIs9b5HmLPG+R5y3yvEWet8jzFnneIs9b5HmLPG+R5y3yvEWet8jzFnneIs9b5HmLPG+R5y3yvEWet8jzFnneIs9b5HmLPG+R5y3yvEWet8jzFnneIs9b5HmLPG+R5y3yvEWet8jzFnneIs9b5HmLPG+R5y3yvEWet8jzFnneIs9b5HmLPG+R5y3yvEWet8jzFnneIs9b5HmLPG+R5y3yvEWet8hzNXHNJJpOK88vSkEWlINKUA1qQT0oHD0cIxwjHCMcIxwjHCMcIxwjHCMcIxwzHCvPZxFZUA5ajiaqQS2oB42geZGavC5KQRaUg0pQDWpBPWgEhSOFI4UjhSOFI4UjhSOFI4UjhSOFw8Jh4bBwWDgsHBYOC4eFw8Jh4cjhyOHI4cjhyOHI4cjhyOHI4cjhKOEo4SjhKOEo4SjhKOEo4SjhKOGo4ajhqOGo4ajhqOGo4ajhqOGo4WjhaOFo4WjhaOFo4WjhaOFo4Wjh6OHo4ejh6OHo4ejh6OHo4ejh6OEY4RjhGOEY4RjhUJ53UQvqQSNoOinPT0pBFpSDSlA4ZjhmOGY4pjvUSHZRCrKgHFSCalAL6kEjKBwpHCkcKRwpHCkcKRwpHCkcKRwpHBYOC4eFw8Jh4bBwWDgsHBYOC0cORw5HDkcORw5HDkcORw5HDkcORwlHCUcJRwlHCUcJh/J8inrQCJrrN/BrCnecv4s/MYEGZrCAFWxgBweIrWFr2Bq2hq1ha9gatoatYWvYOraOrWPr2Dq2jq1j69g6to5tYBvYBraBbWAb2Aa2gW1gG9gmtoltYpvYJraJbWKb2Ca2GTb1tzkm0MAMFrCCDezgALElbAlbwpawJWwJW8KWsCVsCZthM2yGzbAZNsNm2AybYTNsGVvGlrFlbBlbxpaxZWwZW8ZWsBVsBVvBVrAVbAVbwVawUUsmtWRSSya1ZFJLJrVkUksmtWRSSya1ZFJLJrVkUksmtWRSSya1ZFJLJrVkUksmtWRSSya1ZFJLJrVkUksmtWRSSya1ZFJLJrVkUksmtWRSSya1ZFJLJrVkUksmtWRSSya1ZFJLJrVkUksmtWRSSya1ZFJLJrVkUksmtWRGLbEjaokdUUvsiFpiR9QSO6KW2BG1xI6oJXZELbEjaokdB7aELWFL2BK2hC1hS9gStoQtYTNshs2wGTbDZtgMm2EzbIYtY8vYMraMLWPL2DK2jC1jy9gKtoKtYCvYCraCrWAr2Aq2gq1iq9gqtoqtYqvYKraKrWKr2Bq2hq1ha9gatoatYWvYGraGrWPr2Dq2jq1j69g6to6tY+vYBraBbWAb2Aa2gW1gG9gGtoFtYpvYJraJbWKb2Ca2iW1io5YkakmiliRqSaKWJGpJopYkakmiliRqSaKWJGpJopYkakmiliRqSaKWJGpJopYkakmilqSzllRhAg3MYAEr2MAODnAGZmwZW8Z21pJDWMAKNrCDA5yBZy05MYEGYivYCraCrWAr2Aq2iq1iq9gqtoqtYqvYKraKrWJr2Bq2hq1ha9gatoatYWvYGraOrWPr2Dq2jq1j69g6to6tYxvYBraBbWAb2Aa2s5Zo/ayzlpw4wBl41pITE2hgBgtYQWwT28SmWpJWvqnd0DGBy5aaMIMFrGADOzjAGahacmECsamWWBEWsIIN7OAAZ6BqyYUJNBCbYTNsqiVa90ydiI4DlG0sVC25MIEGZrCAFWxgBweIrWAr2Aq2gq1gK9gKtoKtYCvYKraKrWKr2Cq2iq1iq9gqtoqtYWvYGraGrWFr2Bq2hq1ha9g6to6tY+vYOraOrWPr2Dq2jm1gG9gGtoFtYBvYBraBbWAb2Ca2iW1im9gmtoltYpvYJrYZNrU0OibQwAwWsIIN7OAAsSVsCVvClrAlbAlbwpawJWwJm2EzbIZNtSQXYQFroJKhipY3n7gMeZUSNe45JtDADBawgg3s4ACxdWwdW8fWsXVsHVvH1rF1bB3bwDawDWwD28A2sA1sA9vANrBNbBPbxDaxTWwT28Q2sU1sM2xq8HNMoIEZLGAFG9jBAWJL2BI2nfVatFDdfo4FrGADO7hsJQlnoM76CxNoYAYLWMEGdhCbYdMVtJgwgbJlYQYLWMEGdnCAsq1bDTUCOiZQtiHMYAGVxtpeXUEv7OAAZ6CuoBcuW9W+6Qp6YQYLWMEGdnCAM1C15EJsDZtqSdWQqJZcWEGN2RQq7qphav57PBYIFUF/4VyN98QKNrCDA1xxm84+1YcLE2hgBgtYwQZ2cIDYJjbVh6bDovpwoWzaY9WHCyvYwA4OULZV4tUY6JhAAzNYwAo2sIMDxJawqT6sVTNMTYKOsnVhASvYwGVbv1c3tQo6zkDVhwsTaOCydRMWsIIN7OAAZ6Dqw4UJNBBbxqb6sH5ab2oedOygRnIKZ6Dqw4UVVIQi1JZpoJTSfQgNzGABK7iCDW2kUvrCAc7Ac8HtExO4bEN7cS67fWIBK9jADg5wBp6LcJ+YQGwdm9J/aEiU/hc2UDadk0r/C2eg0n9oJJX+Q6Oj9J+HMIMFrGADe6ASfWojlegXGpjBAlZH9e6l1b5gat5zlGJtr1r10nq/bOrVczQwgwWsgVoJW9ME6rBzbGAHBzgDtSr2hQk0MIPYMraMLWPL2DI2rYt9JKEimFARirCDA1SEdbjVTueYQAMzWEDF1QHQyteay1C3nCVtmVa/vjCDiqCh1hrYFzawgwOcgVoNO2mPtR72hbJp57Um9oUFXHGTTiOtPJ80Dlp7/kLt8RAqgnZTK9BfWMEGKq7GQSvRXzgDtRp90uhoPfoLDcQ2sU1sE5vWpr9wxLGYcTTVKOeYQAMz2PwQqgvuPIRqgzsPlvrgHA3MfizUCudYwQZ2cIDTj5sa4hyTHyy1xDlmsPkhVLfbedzU7uaY/BCq4e0cKHW8ORawgs0PlrreHAc4/WCp8c0xgdgKtoKtYCtxNNVVZklDomS4sIFrczT5pc4yxxmoZLgwgQauzTHZlAwXVrCBHRzgDFTiXJhAA7ENbEoc00gqcS7soGwaSSXOiUqcC2XTgVXiXJjBAsqm4VOKZJ20ShGheswcE7jiXovir7g5C1dczRio0cyxgR2UrQpnoNLpwgTK1oVSTOFS6AlQjWamRy51mj2eJ4QDnIHKoQsTaGAGl00PV+o4c1y2KrGubxcOcAYq3y5M4LLpiUqdZ44FrGADOzjAGah8uzCB2Ao25ZueqNSF5thA2XRgdS28cAbqWlg1ULoWVh0hXQsvzGABK9hA2YZwgDNQ180LE2hgBgtYwQZia9gato6tY+vYOjaVCj2TqRPNsYE6J7WbKhUXzkCVigsTaOCy6QFPnWiOFWxgBwc4A1UUmo6xisKFBaxgAzs4wOmonjPHBBqYwQJWsIEdHCC2hC1hS9gStoQtYUvYEraELWEzbIbNsBk2w2bYDJthM2yGLWPL2DK2jC1jy9gytowtY8vYCraCrWAr2Aq2gq1gK9gKtoKtYqvYKraKrWKr2Cq2iq1iq9gatoatYWvYGraGrWFr2Bq2hq1j69g6to6tY+vYOraOrWPr2Aa2gW1gG9gGtoFtYBvYBraBbWKb2Kglk1oyqSWTWjKpJZNaMqklM2pJPqKW5CNqST6iluQjakk+opbkI2pJPs5aUoQdHIFnAUnCBBqYwQJWsIEdHOAMNGyGzbAZNsNm2AybYTNshi1jy9gytowtY8vYMraMLWPL2Aq2gq1gK9gKtoKtYCvYCraCrWKr2Cq2iq1iq9gqtoqtYqvYGraGrWFr2Bq2hq1ha9gatoatY+vYOraOrWPr2Dq2jq1j69gGtoFtYBvYBraBbWAb2Aa2gW1im9gmtoltYpvYJraJbWKbYUvHASbQwAwWsIIN7OAAsVFLErUkUUsStSRRSxK1JJ21pAs7OEDZ5sKzlpyYQNmGMIMFrGADO7hsa+I5q9HsQtWSC5eta3tVSy7MYAEr2MBlW3PQWY1mjjNQtaSfHw9LoIEZVNwmVAQNlOrDhQlUBA2U6sOFBVzbOw5hAzs4wGUb2iHVhwsTaKDiaviU82viOash7ELl/IXaXimU8xdmsIAVbKC2VyOpnL9wBirnL0yggRksYAUbiG1gG9gmtoltYlPODx1NZffQ0VR2XzjA6Xh+WvLCBBqYwQJWsIEdHCC2hC1hS9gStoQtYUvYEraELWEzbIbNsBk2w2bYDJthM2yGLWPL2DK2jC1jy9gytowtY8vYCraCrWAr2Aq2gq1gK9gKtoKtYqvYKraKrWKr2Cq2iq1iq9gatoatYWvYGraGrWFr2Bq2hq1j69g6to6tY+vYOraOrWPr2Aa2gW1gG9gGtoFtYBvYBraBbWKb2Ca2iW1im9ioJUYtMWqJUUsytSRTSzK1JFNL8llLurCCDezgAGfgWUtOTKCBGVy29Townx/QvLCBsg3hAGfgWUtOTKCBGSxgBRuIzbCdH7hd17d8fuL2xAQu23pfmPP5odsTC/iw5UM7dH7cVv9s1Ye83r9lrWXnmMECVrCBfWEVDnAGrvrgmEADM1jACjYQW8VWZdO50w4wgbLpcLcMFlA2DXVrYAcHKJsGdVWCnDSo+jD7hQWs4IqbNOr6/O16a5TVDpeTRlKfwD1RH8G9MIGyaY/1KdwLC1hB2bRv+hJu0vbqW7imzdHXcE2bo+/h6jOx6oFzzGABK9jADi6badTndFTj23nKqfHNMYMFrGADOzjAyAs1vjliS9gStoQtYUvaoSHs4AC1Q2sk1fjmmEADM1jACjawgwPElrGtnM9Z27ty3jGDBaxgA5dtvUvKanxznIHr/sExgQZmsIAVbCC2gk31Yb2jymp8c0ygbDp3VB/Wi6msxjdH2XRYVB8ulE0Dpfpw4QxUfbgwgQZmsIAVbCC2hq1h69g6to6tY+vYOraOrWPr2Dq2gW1gG9gGtoFtYBvYBraBbWCb2Ca2iW1im9gmtoltYpvYZtjUJOeYQAOXTR/YVpOcYwUb2P2yWM9acuIMPGvJiQk0MIMFrODai9W1mtX4dl551fiW1yvUrMY3xwJWsIEdHIGqBPq+ds0xvmpmu3Yzs8fK+QsHuMZXH8tWM5tjAg2Mo1kLtlLBBnZwgBxN5fy5Dcr5Cw3kaCrnz21Qzl/YQGzkfCXnKzlfyflKzldyXp1xl7gxko2RbIykcv7chsZIdkaSnK/kfCXnKzlfyflKzldyXp1xl1g5f+JgJAcjOThuyvkLGUlyvpLzlZyv5Hwl5ys5X8n5Ss6rX+7ahslITkZyMpKTkVTOr26ArIX0TtRKenl1A2QtpedoYAZlm8IKNrCDA5yB6QATuGyrnyCrUc9ROZ+F3bNQq+jl61vvM1B3ChcmMI5QswwWsIIN7OAA4wip1c8xgQZmsIAVbGCcD1pFL6+Whaxl9BwN1OhoHFQfqrZM9eHCBnZwgDNQ9eHCBBqoZyedJefswYkdHOAMPGcPTkyggRksILaGrWFr2Bq2jq1j69g6to6tY+vYOraOrWMb2Aa2gW1gG9gGtoFtYBvYBraJbWKb2JhzPFsIL8Q2sU1sE9sM29lCeGECDcxgASvYwA4OEFvClrAlbAlbwpawJWwJW8KWsBk2w2bYDJthM2yGzbAZNsOWsWVsGVvGlrFlbBlbxpaxZWwFW8FWsBVsBVvBVrAVbAVbwVaxVWwVW8VWsVFLOrWkU0s6taRTSzq1pFNLOrWkU0s6taRTSzq1pFNLOrWkU0s6taRTSzq1pFNLOrWkU0s6taRTSzq1pFNLOrWkU0s6taRTSzq1pFNLOrWkU0s6taRTSzq1pFNLOrWkU0s6taRTSzq1pFNLOrWkU0sGtWRQSwa1ZFBLBrVkUEsGtWRQSwa1ZFBLBrVkUEsGtWRQSwa1ZFBLBrVkUEsGtWRQSwa1ZFBLBrVkUEsGtWRQSwa1ZFBLBrVkUEsGtWRQSwa1ZFBLBrVkUEsGtWRQSwa1ZFBLBrVkUEsGtWRQSwa1ZFBLBrVkUEsGtWRQSwa1ZFBLBrVkUEsGtWRQSwa1ZFBLBrVEbZe5CvWEcmECDcxgASvYwA4OEFvH1rF1bB1bx9axdWwdW8d21pJ1Y3i2XV4oWxMamMECVrCBHZRtCGegnlAulG0KDcygbF1YwQbquGXhAOOt8tmMeWECDcxgASvYQL1dX/t2tl1euPZidbhmtV06ZrCAFWxgB9eYqXNLbZcX6gnlQtm0OXpCuTCDsiVhBRuo3oMuHGB0Dpxtlxcm0MAMFrCCDdRerEcCNVg6JlB7UYUZLKD2QkOtJ5QLNWZS6AnlwhmoJxQ1dKjB0tHADBawgg2UbQoHOANVHy5MoIH6iYf2+Pzhkvai+U9H8tlKeeEMPH+4dGICDcygfhmindddxYUN7KB+WHPiDBwHmEADM1jACjaQIz858pMjPznykyM/OfKTIz858pMjPzny0498UdOkjltR06SjgRksYAUb6Ee+qGnScQamA0yggX7ky9kpuY58OTsl04kDnIF2gAk0MIN+5MvZKXlhAzvoR76cnZIn5gNMoIEZLGAFG7hGZzXiFPVEOibQwHUsVlNUUU+kYwUbqB+GmXCAM/D8WeKJCTQwgwWs4DrGq62qqPvxQmX3hQk0MIPaCx0WXf0vbGAHBzgDdfW/MIEGZhBbx6arf9ex0NX/wgHKphNc85MXJnDZho6Qrv5DB0BX/3UtLOp+dGxgBwc4A1UJhpJBleBCAzNYwAo2sIMDnI7qfnRMoIEZLGAFGyhbEw5wBqoSrI6Eou5HRwMzWMAKLtv6LEJR96PjAGeg7gkuTKCBGSxgBbEZNs1artetRd2PF2rW8kLZNCSatVy/oi7qfnQsYAUb2MEBzkBVjQtlG0IDZZvCAlawgQ9bUXZrmT3HGbiqhmMCDcxgAevCLGygbBqdOsAZ2A4wgVJUYQEr2MAOSqEhaTOwH2ACDcygbBqoXsEGdnCAM3AcYAINzCC2gW0VkJKUAauAOA5w2ZJOz1VAHBO4bEkHYBWQosut1tYrSQO1CohjAzs4wOl4tlJ2UQ4qQTWoBXWnpOBNOMAZqCu8NLrAn2RBOagE1SBFlCdrGIZQT1GiHFSC9MJC1IJ60AiaTuc7R5EkU2jgGuvVrVLUpuhYwbWZtg6RWg/Lamcpaj101MsOkQKcWMEGdnCA04ekxXC2GM4Ww9liOFsMpxLpHESlzDmIShnTXitlLtSu6p8pZS7UlupoKmXOv9qDRtB0UrqclIIUURuiBDBtiBLg/I/TSaf/Setfy6yT/6QcVIJqUAuSRIdQ5/2Fy7J+2FzUDOiYwBU0J+GKsLpVihr8HFeENTDq7zsHRv19jgZmUGGzsIIN7D7g6u9znIGGzbAZNsNm2AybYTNshs2wZWwZW8aWseUC1utU1wdtz9NXX7R1HOAMLEegrlNKZfXpORqongdRCapBLagHjSAd/HVmqUPPMYHy6O/qYnWhRlP7p4vVhQ3s4ABnoDLvQiWEziRl3oUZXLaic1GZd2EDlXoarTP3TpyButtVLN3snmRBOagE1SBFXAmrhrxynunKPqWVGvIcC1hBbekQdnCA01GL0jnKNoUGZnDZ1mvrot48xwYu23r3W9Sb56h0XTuk3jzHBOoiLspBJagGtaDupJxcc41FnXZlzQkWddqVNXdX1Gnn2MAOaku1g8q+E5V9FybQQJ2dohJUg5R7oh40gqbTmXeiFKRCq73Tle/CAvZAJWvT4CtZL9S1U5SDSpBKtTZT170LO7g2tGlMla8nKl+bhlf5eqE2VgOpfNV0hjrmiuYl1DFXunZM+XphBwc4A5WvFybQwGXr2l7la9eppHzVE7I65ooeVNUbV/RIqt44xwQamMECVlDBtJvnZfLEBBqYwQJWUMHWQKmHrehZWD1sjgWs4GPflFxqYbtoBE2nlW8XpSALykElqAaFI4UjhSOFw8Jh4bBwWDgsHBYOC4eFw8Jh4cjhyOHI4VjJpgKk9raLRtB0Wsl2UQqyoBxUgmpQOEo4SjhKOGo4ajhqOGo4ajhqOGo4ajhqOGo4WjhaOFo4lBjrJw1FbWVFMyJqKyvrNwRFDWSPs3ihrjX6jzqrRTqpT3pEUplRD9dF9SJ1ZRU9zKsra71rKWrKuigHlaAa1IJ60AiaTjqBTwpHCocuDZouUM9VWZ1YRT1Xqj1qubooBVlQDipBNagF9aARFI4cjhyOHI4cjhyOHI4cDl0RNNuhXqpHiRCuQ7lWkivqpXKsYAM7OMAZqEvFhQk0EFvFVrHpaqH5EnVYOQ5wBupqcWECDcxgASuIrWFr2NbVQhcANVhdlIIsKAeVIEXUSaQrguZwzg+R6iDoA4Un5aDHvz7PMH2g8KQW1ING0HRa14R6KFlWBlXN7aj1ybGDKw+O859NR7U+OSbQwAwWsIIN7OAAsSnvNPmj1idHA2XrwgLKNoSyTaGqWRIOcAbqEqJ5FbU+OaqkFaHqpsTntzxkO7/lcWIDOzjAGagLh+ZG1M5U0/lfVXy1vedV5MQBru3VfIPamRwTaGAGV1zNTahFqWpCQi1KVc9balFyNDCDBaxgAzs4QNk0fLpgXJhA2TSoLYMFrKBsGrPWwQGu8dXcQj/XyT8xgbZQf/dcJ//EAlawgR1cR1NzFj3WyS891skvalGqp20YmMEC9sCp0VGEmUC93BD1oHGROoZ0r62GoYtyUAmqQS2oB42g6bQy7yLd6pxoYAZ1H5WFDeygbqWKcAaeN2wnrt3QX9Vl8aQcVIJqUAvqQSNoOumyeFI4cjhyOHI4cjhyOHI4cjhyOEo4SjhKOEo4SjhKOEo4dD+nmQ21ADnOQOXqediVqxcaqEMyhQVcR0dPdGoBcuzgAGegclUPkWoBclw2TQqoBahqUkAtQFXP/GoBcmygbNpI5eqFM3Dlqh7k1AF0kQXloBJUgxRxJYsaeqomCdTQU1d3fFFDj2MBK7i2tGq3lY8XDnAGKksvXBd5jcW6rOrpSe08tZ7/US5toq61F8qlrdW1VjexaudxXK7V/VLUzlNX90BRO4/jI65upqd/xLdc3+I8hAk0cG2XHqDVoONYwQZ2cIAzUJmrJ2w16DgaWHzD/Ju9Zfo3e4tacnSjo46ci6aTnrH0Blz9OI4Grl3R7ZP6cRzXruiRXP04jh3URfjEGRifyyt8erPw6c3CpzcLn94sfHqz8OnNwqc3C5/eLHx6s/DpzcKnNwuf3ix8erPw6c3CpzcLn94sfHqz8OnNwqc3C5/eLHx6s6hLp+q0VZeOYwE1kk3YQI2kjp9S+MIZeH7iSufH+YmrEw3MYAErqLg6gZTIyij141RNN6gfx7GAFdTjnHZTiXzhAGegEvlCba9OrvOzVSdmUDZtpFL5wgZ2cIDzwqouHccEGpjBAlawgR0cILaELWFL2BK2hC1hS9gStoQtYTNshs2wGTbDpumXVciqenccOzjAGaj6cKFsXWhgBmUbwgo2sIOyTeEM1C32hQlccVcTQ1WXTl3TD1VdOo4zUJftNTlQ1aXjaODa3qkd0mX7wgo2ULYilE0jqZxfTxL1/ETmhQmU7cQMFrCCDezgAGdgP8AEYuvYOjblfNKm6xb7wg4OcAbqFvvCBBqYwQJiG9hUH6bOEtWHC2eg6sOFCTQwgwWsYANl03mm+nDhdFSXjqOmtg7hujtcJaiqH8dxgDNQN+yrxFf14zgamMECVrCBHRzgDDRshs2wGTbDZth0B7+e8qv6cRxla8IZqLv4CxNoYAZl68IKNrCDA5yBup+/MIEGZhBbwaa7+kNHs3RwgHrO0jGuetDSIawJ1OOcBqpmUA90GqhawQZ2cIAzsB1gAg3MILaGrWFr2Bq2hq1j69g6to6tY+vYOraOrWPr2Aa2gW1gG9gGtoFtYBvYBraBbWKb2Ca2iW1im9gmtoltylaE01FrnzkmcNW+fGIGC1jBBnZwgDPw/GjXidqLKtT2NmEHtb1dOANVHy5MoIEZLKDirhTRGmXnkKjn59pj5fyFGSygxncKG9jBAcbRVO+PYwINzGABK9hiG5TzFw6Qo3nmvLbhzPkTDcRGzhs5b+S8kfNGzhs5b41zpzGSjZFsjOSZ89qGxkg2RpKcN3LeyHkj542cN3LeyHkj5+3MeW1DZyQ7I9kZyc5IKufXDGdVg5Hjsq3Jzqo1yhwLWMFlszNYBwc4A5XzFybQwAzKpsRRzl/ICa5EN+WQEl2oXiTHBMapkc/pvRMLWMEGdnCAcbByOsAEGpjBAlawgXFqqEWprWnNqhYlRwM1UEOogdKW6fbgwgZ2cIAzUKXiwgQaWP3uSt1Ijh3UtF4SzsBzYk87dM7snWig5vaKsIAV1PReFXZwgDNQReHCBBqYwQJWEJtm8vSEogYnR8XVGaX0vzCDBaxgAzuovdDwKf1PVPpfKJsOgNL/wgzKpvNB6X9hA+PhSg1OjvFwpQYnxwQamMECVrCBay+KBkqJfmECDVx7UfTPlOgXVrCB/ZrMqGp+cpyOan5yTKCBGSxgPycCq7qcLppOK7X1oK0Wp4ssSNtfhAWsoLb//LsdHOAyreOs3qeLUpAF5aASVINaUA8aQeHI4cjhyOHI4cjhyOHI4cjhyOHI4SjhKOEo4SjhKOFQpq8p7qolxhw7qPE6/+4MVKYXHUNl+oUGrqOz2iiq+qUcl23NWFc1TDl2cNmqjr4u/yfq8r9mrKsaphwNlE0HVfl/oWxd2EDZtBfK/wtn4Mp/pZP6pS6yoBxUgmqQImoEdDFv2itdzJv+gi7mFxawgmtLm3ZbF/MLBzgDleMXyqYjphy/MIMFrGADZdMQ6bp+4XTUgmGOCTQwgwWsYAM7OEDZ1lFQw5VjApdt/RCtqueqrfn0qqYrx2Vb0+VVbVeOy7Zm2asarxxnoK72FybQwAwWsIINxGbYDFvGlrFlbBlbxpaxZWwZW8aWsRVsBVvBVrAVbAVbwVawFWwFW8VWsVVsFVvFpsqwZu+rmrccOzhATajpwJ6ThScm0MAMFrCCDeyBugdY3Y9VXWBtvUGo6gJz1PbqpNXV/sIODnAG6mb/wgQqrk7wwfgO9lg5f6Jy/sIEanynMIMFrCBHc2KbHM0ZR1OtaY4JNDCDxTdH7WmODezgAJdtvfyo6lFzXLb1I8aqLjXHDBZw2YaCKecv7OAAZ6By/sIEGihbFRaw+cE6+9nWbwnr2dB24QxUol+Y/ACcTW0XZrCAFWxgB+NgNRK9keiNRG8keiPRG4neSPRGoqvfrekdhPrdHBOogdI4KKX1XkH9bo4VbGAHBzgDdbG/MIFq+tOpocv6hQ3soJoLdWrosn6iUvrCBOrypX92vqM/sYAVbGAHBzgDlegX5vMle1Xf20U16BFUJUV9bxeNIG2//qIS/8IErvf2Oi9X3l9UgjRUJzawg+N87V/VICdSf9xFKciCclAJqkEtqAeNoHCkcKRwpHCkcKRwpHCkcKRwpHCkcFg4LBxnz2oTZrCA6nMowgZqxLpwgDNQr/R0+6hFwBzVwXH+hQwWUN0LJmygbGeEAc5A3ebrr+o2/yQLykElqAYpogZjJXPXaxr1y3W9hVG/nGMBK7jGX+861C/nOMAZuJLZUTYNZzMwg+t+WgdhZfhFLagHjaDppHv2k1KQBeWgcPRw9HD0cPRw9HCMcIxwjHAoy1cXQFVznGMFG9jBAc7AeYAaNh125fqFGZRN2zAr2EDZdMSV7hdOR63f1fUqR513/l/XP9MUpbrrHGegcvjCBBq4gmniXQtxOVawgR0c4AxUNl+YQAOxGTaTrQkb2EHZunAG5gOUbQgNzGABZdPwrcztmstVn92FK3MdE7jirnbWql67vtpOq5rtumZi1W3n2MAOyqY9LjOwHmACZdO+KcE1wagmu561OUrwrM1Rgufznw1wBirBL0yggRlU07hGvVUwTk911jlyeqon/cIEGiiFDsDZl35iBbVD59/t4ABn4DjABBqYwQJWENvApkQvGlQl+olK9AsTaGAGdfegU0OJfmEDOzjA6ahuPMcEGpjBAlZQtiLs4ABlWwdWHX19NUdWdfQ5yjaEGZRtCivYwA4OcAaqPlyYQAMziM2wGTbDZtgMW8aWsWVsGVvGlrFlbBlbxpaxFWwFW8FWsBVsBVvBVrAVbAVbxVaxVWwVW8VWsVVsFVvFVrGpgGjyTy1+jgZmUD3uOs/0BH9hAzs4wBl4dtSfmEAD115oslLNfOdlUUtudU01asktxwQamMECVnDF1cTmnIzvZI8ne3zeyp9YwTW+ujNV257jAOeF7Tj8aLbjSKCBGSxgBRvYr21oattznIHpAFNsg3L+wgxiS9gStsj5dkTOtyNyvh3GvlkKsRmYwQLW2AZrYAexGbaMLTOSmZHMjGRm33INsXL+QkYyM5KZ46acv5CRLNgKtoKtMJKFkSyMZGHfCvtWOW6VkayMZGUkKyOpnF+T7U0tfo7atyYc4Aw8c/5E2bQNZ86fmMECVrCBHRzgsjVtpO4fLtQc4RCWKwubmvn6mn1vauZz7OAAOUKDIzQ4QoNzfXCun5XgRM6+wREaHKHBERococnZNzn7JufD5HyYnA+qD+uxsqltz3E6asmtvt4hNC251VeHflMzn2MGC1jBBnZwgDNQlWC14Dc18zkWsIKK24QdHOAMVCVYj7JNzXyOBmawgBVsYAdHoHJ+vaZoattzzGABtRdD2MAODlC/IVkHS217jgk0MIMFrGADNTpCZfeFCTQwgwVc29u188rY9Yalqemud507ytgLM7gidJ1RytgL1zh0nQTK2AsHuLa368grYy9MoIEZLGAFZdOpoTy+cIAzUHl8YQLXqJuOkDL2HAdl7IWMjjK268grY09Uxl6YQAO1F1IoYy+sYAOXbcimPL5wOqq9rq8pnqb2OkcDl229WG9qr3OsoGxTKFsRylaFsq3RUXudYwIVtwsr2MAOKu7aN7XXnSeX2uscM1jABq7EMaGm3y5MoA6hdl7TbxcWsIIN7OAAZ+D5o9UTNagaM12EL6xgAzVbqYOli/CFM1BpeuHai6SBOtc8ODGDBaxgAzs4wBmojvpDA6WO+gs14XpiBRvYQe2FxkHJe6KS98IEGpjBtRfHiRVsYAcHOAPVPnNhAg3MoPZC57qS98IBzkAl71QGKHkvNDCD5frdezsX77qwgR0c4HQ8l++6MIE6FlVYwQZ2cIAzUGl6iFKQBeWgElSDNF0m6kEjaDqdE3OiFKQtb0JtYxcOcAZqfaBzc7U+0IUGZrCAFWxgBwc4Awu2gq1gK9gKtoKtYCvYztwdwgQamEGNjg6xbqAvbGAHBzgDdTm+MIHrFYBuVtQQ51jACq6OIqW8GuIcBzgDz4zWwToz+kQDM1jACjaQ86FzPqzcHcpStb45ZlB7kYXaiyJsYAcHqL3QEVoZ7ZhAA2XTEVoZPZIGamW0YwM7OMDpqIY4xwQamMECypaFDezgAGegOuUuTKCBsjWhbENYwQZ2cIAzUN1yFybQwAxiU8ucrsxnz9yFHRzgDFTf3IUJNFDvu4qwgBVsYAcHOAPPV2snytaFBmawgBVsYAcHqDf2i85eGVEKsqAcVIIUUcPZtKVTmEC7Vu9p5ypiFxawgg3s4ABnoFYRu3CNQNbpurJ9ZB2Fle2ODezgAGfgun47rr1Yrx2aGuYcM1hA2bQ5qgEXdnCAM1A14MIEyqZjrhqw3lY0Ncw5VrCBHRzg9GOhhjnHBBqYwQJWsIE9UGv/aUJDrXGOBmovurCA2oszQgM7uPainBFmoLL9wrUX62VEU2ucYwYLWMFlWy23Ta1xjgOcgcr2CxNoYAYVtwnntWRfU2PbKNpj5eqFBdSWDWEDtWUaB+XqhTOwqhtZ41ATaGAGC1jBBi5b1fauK7zjDFR2X5hAA3Pssa7lVUOta/mFA5yBXXGzMIEGZnBVDU3TnYueXdjADg5wBmpFqAsTqNEpwgo2sIPaCx1u5fGJyuMLE7gy4Dw1zpU9TyxgBRvYwQFOR7W7DW262t0cC6i96MIGdlB7MYQz8Oxvn8IEGrhsSmm1uzlWsIEdHOAMVB7rhFG7m6OBGSxgBdeYqf62c3Vd7Zvu31VI1ePmaGAGC1jBBq5jYRr1c5HPE2fgucznicuma+G50tuFGSxgBRvYwQHOwHP5T+2msltTpupxc6xgAzs4wBmo7Nakq3rcHA3M4NoL3UGda7pd2MAODnAGxlrZTZ1vjgZqL4qwgR3UXmjUde0+UdfuC7UXSgZduy/UXmj4lPMXVlA2bYNy/sIBzkDl/IUJNFA2JY6u3RdWsIEdHKCO/DpCang7j7w63s7jppY3xwo2sIMDjCOvxrfzwKrzzdHADMaRV/ebYwM7OMA48mqBc0xgHHm1mo154gBXz5OeE9Vq5pjjL+hqemEFW6A6rtZvh9rZcnVhBRvYwQHOQDVeXZhAA7ENbAPbwDawDWwD28Q2sU1sE9vENrFNxdUhnNNRXVYX6shroNQu5ai4RVjACjawgwOcgXaACTQwjpsaoxw7OEDFXYmuxihHxW1Cxe3CDBawgg3s4ABnoM6+CxOIrWAr2Aq2gq1gK9gKtoqtYqvYKraKrWKr2Cq2iq1ia4qr8VW/o+4yteTYeRqpMcpxgIqwElKNUY4JNDCDBVy2emIDl023lmqMcpyByjfdRKrZaeoeUc1OjiuCniTGmVk6Nc7MEp6ZdSLnjjJLN3tqdnIsIBkwyYBJBkxsM2zzOMAEWmCSuAozWEDt5vl3G9hBDVQXzkClnu7w1InkaKBsU1jACjawgwOcgUpI3eGpE8nRwAwWsIJxCOeZetpIpZ4OgHqOHA3MYAEr2MA4WLMMMMrVrAeYPBnmmXonZrCAFWxgBwc4A8/U0zFuGSxxarRI6dka2MEBRkrPfoAJNDCDBcTWsXVsHVvHNrANbAPbwDawDWwD28A2sA1sE9vENrGdaapzZzLq0y+s/TgOMIEGZrCAFWxgBweILWFL2BK2hC1hS9gStoQtYUvYDJthMy/FXZ1IjgWsYAM7qJw/cQYq56sUyvkLDVQWmnBc2d3VXXShsnvV6n4UL479KAZmsICe3f2I7O7qLnL07O5HZHc/Irv7UbFVbBVbxXZmt/C84lRhAzuo3Tz/7gzUSXuhBqoLDVQRG8ICVtBLcVcrjeMAvRR3tdI4JtBAL8VdrTSOFWxgBwcYhzAlv3/oKXkp7ikVsIIN7OAAZ2DcOfYUd449xZ1jT5ZBL8U9WQUb2MEBzsDzfvLEBBq4np3WW8Wu9hjHBBqYwQJWsIEdHCC2iq1iq9gqtoqtYqvYKjbNCHQdTc0InKgZgQsTaGAGC1jBBnYQW8PWsXVsHVvH1rF1bB1bx9axdWwD28A2sA1sA9vANrANbAPbwDaxTWwT28Q2sU1sE9vENrHNsKntxjGBBmawgBVsYAcHiC1hS9gStoQtYUvYEraELWFL2AybYTNshs2wGTbDZtgMm2HL2DK2jC1jy9gytowtY8vYMraCrWAr2Aq2gq1gK9gKtoKtYKvYKraKrWKr2Cq2iq1io5YYtcSoJUYtMWqJUUuMWmLUEqOWGLXEqCVGLTFqiVFLjFpi1BKjlhi1xKglRi0xaolRS4xaYtQSo5YYtcSoJUYtMWqJUUuMWmLUEqOWGLXEqCVGLTFqiVFLjFpi1BKjlhi1JFNLMrUkU0sytSRTSzK1JFNLMrUkU0sytSRTSzK1JFNLMrUkU0sytSRTSzK1JFNLMrUkU0sytSRTSzK1JFNLMrUkU0sytSRTSzK1JFNLMrUkU0sytSRTSzK1JFNLMrUkU0vyWUvWLXY+a0kWJtDADBawgg3s4ABnYMV21pImNDCDshVhBRso2xAOcAaqlqxlFro6jRwNzGABK9jADg5wBnZsHVvH1rF1bB1bx9axdWwd28A2sA1sA9vANrANbAPbwDawTWwT28Q2sU1sE9vENrFNbDNsZ//RhQk0MIMFrGADOzhAbAlbwpawJWwJW8KWsCVsCVvCZtgMm2EzbIbNsBk2w2bYDFvGlrFlbBlbxpaxZWwZW8aWsRVsBVvBVrAVbCXyuJz1oQsTaGAGC1jBBnZwgDOwYWvYGraGrWFr2Bq2hq1ha9g6to6tY+vYOraOrWPr2Dq2jm1gG9gGtoFtYBvYBraBbWAb2Ca2iW1im9gmtoltYpvYJrYZtrM36cIEGpjBAlawgR0cILaELWFL2BK2hC1hS9gStoQtYTNshs2wGTbDZtgMm2EzbIYtY8vYMraMLWPL2DK2jC1jy9gKtoKtYCvYzvpgwgo2sIMDnIGqJReqGlWhgRmULQsr2ALPUjGECTQwgwWsoIJp385biRMHqE1f80Zno9PUpqtUXGhgBgtYwQZ2cIAzcGBTqZgaEpWKCzNYwAo2sIMDjItE5Vaiciuh9qcxNQ4qFRcWsIIN7OAAp6PWAHNMoIEZLGAFG9jBAWJL2BI2zSDrwGoJKkcD16Tk+llKV3uOYwUb2MEBzsB1pjom0EBsDZveBOkkUHPNXO2yXWtJ+X/V5hShNqcKOzjAGagXPRcm0EBtThMWsIKyaSQ1Z75e6/fz84pTw7dOrsf89XqyUaPNte2aNL+QPdKcuB4w1EfjOMDpqMWkHBNoYAYLWEHZulC2IRzgDNRLnwtlm0IDM1jACjawgyNQE+HrJ3dda0VN5Z4WiJoqlFogaqriaYGoCzXPfWECC6gIRThARVgHWQs8zaEh0QsXVTwt5+Q4A8900Tic6XKigTniKl2u/1rBBnZwxB4rXU5UulyYQPZNr1PPHdLr1AvZ43NpJf2zc22lEw3MoN6caKh1hl/YwA7qzYm2Qadyk02n8oUZVFwNid7/XNjADg5wOp4dPhfK1oQGZrCAFWxgB0egTvDVO9fVRORoYAYLWMEGdnCAM9CwGTZlwGq561pzybGAFWxgB4eP+tladOLZyXBiAvXPVuqd3UCafTm7gS40MIMFrGADld0mHOAMVA5dmEADMyhbElawgR2csUNKnAsTaKAUWcimK3EuHKA2XWOmPoQLE6hN1+nZGajOQHUGqmPr2Do2XZ5OHByWwWEZHJaBbaBQkh0aEiXZoZFUkh3aYyXZhWpIXHtxtvVcmEADM1jACjawgwPElrAlbAmb8m39fqyfPUIXKsLK2LMb6MIEKkIXZlARhrCDA5yBypa1/lU/+37W78f62fdzYQYLWMFlW9/q6VqByHGAy7bWw+1nN9D5zwq2gq1gK9gKNqXehbKtA3v2/SSNpJLsQsXVSCrJLixgBRvYwQFqLzTqyrcLEyibDoDy7dwGXb4urGADOzjAGXiuHq6DdS4froN1rhV+YgM7OMAVzHQslGQXJtDADBawgstmOgC6LJoOrJolTMdC930XKpj2QpdF00gqYy9UMA2fMvbCAc4Lx9n3c2ECDcygbF1YwQbKNoTj2pxx9v2cqIy9MIEGZlC2Kazgsq3ft42z7+fCAc5AZfeFCTRw2dbv28bZ93NhBWUzYY9tUM5fOAOV8xcm0EDZsrCAshVhAzs4wBl49gidmEDtm4ZPOX9hAWXT0VTOn9ugnL9wgDNQleDCBBrIvlX2TZUg63xQJbiwgwOcgaoEFyZQNp1nqgS5/8///NNvf/37v/3pP//y97/9y3/+489//u2f/zv+w3/89s//679/+/c//ePPf/vP3/75b//117/+02//vz/99b/0l/7j3//0N/35n3/6x+N/fZwMf/7b/3n8+Qj4f//y1z8v+p9/4l8fr/9pSvqBsv75g4tFiNl/iJFexygrvRThMVUc/77nH/69vf73efX46d8/XrbEv08/BdjvxLrVv3biUTFf7UR5HWMyCmxDyXf/+eONUY2dmByIZPZDiLYJkX0YHy9jCDDy3QD6Yp4CtMw+PML+EGBsxlE/8TxH4TH9+TLE3OxEi5Ph8UYuvwyxG0o9VF0DMfvLoUybU9JsXRsVwx5vwYlRfjqr7dPjsdmRx3sy35HHe7L2ekc2Maq+taQYazn2iNF+zPB1N/LyqNaDo1rzyxCbM0trCinCyM8Zmm5HGMV34/EI8jrC3d3or3djN5h9PQecg/mYznkVwjalxkpUGqtP1fLnEOnTobDNmWnH9P2wdHBilR/Pq3W79XIj1jPguRFzvN6IXcE087P7gYVM/3kodjuSco8dqenljmxOLBs+mvl4GWCfYbNzUpSXR3R8XvR2MR4vff2IPF7kvr6A5GNbvy1S5Gk0rPy4L3lzdurT0OdF5CDV7VF6bp8YpcaJ8XhP9/LEyHl3Ne4zYjxV3zx/PEHzZjusWWRJe07VLxyTOLke763r62OyOT+TFmY9j8l4Or2S/XglWonwMsZa+8mDrAU3nqL8eFzy+IazY356duz3RR/rvfal/TCqP0Ypu+t7anF9T+NpS35K/GKfnh/bs/RmCdzGuJktpX6eLaV9PBq7I/t4seKbkdaPBV4f2bE7sjXFkW3H05H96QZy7q4JPc6O+XSePu7CfohRN7V0feTbLwsp55cxttsxI23zkTfbsTlLW4/teLztmy9jfOXIjJdHppaP7zrq7h5udYbGhpR6vN6Q3XPOMX1v1hKSr2P03b15nGblaPO9Abl391Lnh3cv28sLN3L2mKR4eXlpu2KqpdjOGCO/vkS1zWm6viHt6fII8hRj3I+h9WvOGI8Z8NcxyucXuVY/vcjtzq6HOR40HnOC753llmqc5fP1Gdo2xXR9tc+3o/5wdnwhRotJgfXRrDdjTGLM1zH2tUMrxV61Y9TXo9rt02O7z5YST4DjhzP9Kxk3I8bcZFzfjcfjDUOMx+MVw3hxyd5ux2TW6nHRfL0dffck6bsyf7iw/LgVfff4lCPvc3meJ8n3Y5QUI/qYjpwvY4xveHwa6Y88v3KOWaM1MG+dX48Hz7iulGO+jDHKH3t+5WJxZOsmV8buxvSo3Hb8cFNZfoyxq8c5btTXR6afzo5+O8ZafChuxMYmxvz8DJvHx1enXeUY9vRMmrO9rKTTdpPuzKY9OM0X58fMnz507KqPXrad22BmL8vP3A5H4zbuh2L8hRO9xi1pfp6m/VLSNsrgjxfJH2PM7UxUTEQ9JWwf9zeCg5rHrC83Ih3bUzTuz8vzeNafQmwHI+5rc8/P14RyP8hj/iYm4EudmyD585xNR/ljk3Zy+/N4qO0vkzYd7dMN2dbjHPcMVp7f19nPg7qbi9JiVddjy9Ntw8+T+cfuVdPk7crrKeyUju1rotgM688TOD8HSbtCeESUxeXl/Ms2abi89JFeJ03aldMj3uU+HtbZjt5+irG77JtxvpuNp9mkn9+d7d7WqBfsvCvsTyFavl2WH9sxeYX3uixrnub1S6MeJSCtz06+uMTouz2vz/i4e7D2w3PHz0E2Z2upkb7lMe25eSN5fJ42u9dPN9Nm+9rmbtrs3kDdT5ttWZztGFEWn+8hflcWbXeyZU62/HTO208dAMk+nkLdb0dhKqbk9Ho7dpVEXz45c28cryuJ7ef5Yzpn1s378/wNZ2v+/GzN33G25m85W/fvGmtnLuXl2+NdT0GPGZ0y6uvXhClv35nGk53NHy425X6QzAxqPnrbBBmf9ybs3kndbE7YhbjZnXB7TzbtCbeH9IfpmC8cF5uR/vmYm/uzsp9GvdUJlHavpe6+Ft+PSYl7mlx2Y1J2c1TcSwx7frn+cznbBuHdxeOhuW6CzM9P+N2rqZsn/C7EzRP+9p7s+nG2Q1riuOTx7nFp8ephjOfJ9p+DbO8jeDB6vJh6GpKf2r325ypX3vzDlvx8rtb+DWfI+PwMGR+fIbf35N2SOOL1Zx4/3N39NKS7F0u3O+Dyx0O6C3FzSG/vybtD+nyWlvLm1X9U5onG7rhsXwvda25s31BQ++cFtX9eUNs3FNT9iH56g1mPGcck/fCw+9MN5u7d1Foc3qeZpm0ednvbTe22uOFO6XVF3o8HzzFtvDmm97pGU5/b57qYYy5PDeY/x9i+nrp5pu9eT90808fH7av392Rzpm9HNMeM+2NE+3sxKg/sNZfXI7qbUNUSsNeTcj/ejJHrnRj7M+xWY3Ianz9Jjc+fpOa2t+9WW03avZy61xW83Yp73U567fz6zvROk3XazYK2FJfI9Qnnp1mH8m6Q+mYQStj6NN8myPj4uGz3Jc7z9tz5+bV9sfhtx/oG7rtB+lODzruHJhe/GVtfsnwZxLavqI4jR0F98NPB+d1PG76hnfUXQaIRY+Y03wxCR8jMrb0Z5GZnre1eVN1trbXdm6qbnejb7RhxRzWfe59+vx13g7Tj3SDxRuWB7b0gjxnUuGw+uO/CbH8mEIXtcaDs3ZNtcLI95/HXgkStn3m+TsAvXMNfPg/Z7mVVjx/P9f76qvWLZr1bP4jZvagqKQpsSe31M6bt3lRZjyCPefvNhnz+6G/28aP/NsTd33x9/uj/ixGNs8P6qG/FyCnS5VHfx5sxevo4Ro4X5vk5474Wgy6TPF7H2P5g6t4DwC9i3HoA2O9L4WfUpc3PY7x5jmWbgwn718d229XeCrOxz/2Lv0uYbSsTU1S9vS4fu7c6tw/u+IMPbk/syyZxd7+ZSkfcyjzmU9q7g8pPWsbmLCv503e6tn0/pS+oXG/9++uHke12lBTXqOdL1O+GY3eds3g7VSwfr69zuxcYNyeHrHz+ItXKx4//2xA3r3Pl8xep+xG9Nzm0j3Fvcsh2vxC6m/r7s+PeL87rx7/f34a4e2Rv78nr2rH7wdSt29tfpCw/6i1lbm5Nt0HiAlVsd3+767W9+5Lddi+Vbv/2fLs7vcevJx6PQ5vdqd+xO+2P3p0ZLYxl9t3ujD/yTKs5Lg615NfvyKwfty5ST79CtZ+Ho6ePpx+2W1GOuFT2zVZsr7axJEtZv5l4tRXbea7eozf16GO+F2RMJsvmcbwXRKuoeZCnOdWvDGqPe8tjd2jHHxriMZC5MKj19a6M7zgy4zuOzPiGI7PN3NL5JWoa710j2hEPyi0d/c0gyZip7vnNIM9T9/nd3cnxGrTVY3OrO75hhSkb8w++RrTKz2tr2ezO7iXR4wa1Fm5Wnx8yvxTkVo+67X5J9Xjv74d4fYNyszu75tKbPeq2/TnVva5fm+3jJ8S5u9m82fVru9dV97t+fxGmZh69ax2vw+xO2fWtJz/Gub9u283H55OqSvYPHzbz8fGk6jbEvUeS+3vSN3vy+aTqNsbNSdVfxLg1qbqPcW9S9Rcxbk2q5vT5pOovYtx6+N7vy71J1fsx3jzHbk6q5vQNk6r7Dbk3qZrT+IaDO/7gg3tvUjXbN0yq/mJDbk2qZvt4UjXbN0yqbrfj5qTqr26I6tMNUX5xQ5TtG375tw1y85l1ezvUSzwY9fr6RM2fd/7l/HHn3zbEzevt7T3ZTO7ubzDjGpXmfF2Ccv18YnZ7h9mij/qBc3OHuQvSY2blgem9IOnpd79le6+7ne/OcRtT2/s3zIOu3effMH31hvlpVeqaN+0hc/8agHFJ7c1xKZ23M0/LEf8+SPu8Ku5+GkpjtqVjvpU6lmJu5IdlE39Ond0s/s0LzfYVz90LTemfD+n20HLn/nxn9sVTPhmLjz8vIPLFU94KdxLW3s4cS4kwZZM5u47keB3Qn1YczF+ahcv2NAtX3pzKi+bIB7dXU3l5+yOkm/OB2yDfMnd9d0TyN4zI9rXT3RHZBbk5IvsewCPmMx783L73tVbCI7enMJveyO26F/c7EndhGm/SWn9+gP5CiBFrGrVR+nshYlG2NvrLRS/2jckHXxM43u6zjovFI8jr7ub97ztLnGqjlNe/78y7df9u9ljkbfbdvA3v5ePb8F2Im7fht/dkMyWxHdF7PRb7GPd6LPKuafbubMI+xr3ZhP0ZdqtPQxNsH54duxB3z47be/J6OmLUD9+e/yLt47iOMjZpP/rnT9/j89aq/Pkvq/Lnv6y6vyebtN+O6M2n793Lqrvptt+OW6+Z8u7ydPNRZvdgd/fRe7sd9x5ltsNx8+lwH+Pe02HZrT10b0jLbjb07tPhdjvuDekv1pXgvqM9/Rzq94tTbM70e78/3n9x5tadS9mt+nezhMn0WQnbhrhXwu7vSX9vQG82hx4f37eU3eelbt63/CLGvWnMj+eFt68N7v/6cPs5oZu/G9zFuPmzwe33OG7+0O52jM3v7PYx7v3Mbrto2f1n2u2X8e79yC5/yy9U8zf8yC7nP3Zv7p6r+Rt+4rr97svNc/V2jM25uo9x71zdxbh/ruZv+S3nx48/ZfftqXvNw9v17OP29nEr89yl/tMHjraL9PAVxMc721czjr8IMWjmePkSteTx8VThLsIRef+YCyqvB6PsV/e/1XpYynZZ6nuth7t3oPeGdPcitsXv9B8TbPHvf/cVrl2EeOvYnl4R/C7C/k0ur9efVl7/3dfEtockvnn3iJFfxihl+yB47zsF+eP5/V98oo3lipqV1182KvX4OGPrx6dX2X1z6uZw7Nb54DfkD3x5SObH5/j8+Bwf33COj284x+v4/BzffjLPjrisWXpe4tjux6g0j9byOsY+U3pco1Mb6fXXgMpuJbybmbIPcStTdp+b+o7C8eNwvP7Q0/6reXF7/cDn7yG2N2PMz2M8veP82tf7Yp1Vex6P3315b/vbGotPAJbnxXl+H2TbdZk5x56WCfpiED5nbU+fJv9ikMqWtPkNQZ7mKr/0OcLEr0CS5TcPzow77HqYvRkk89n5XF6P6+2PPNp4a0Qe73ri20LFNofm9kcvN2kzPl+xrIztWukxu2/PJfH3G7Jr7a/RiN7r85cbxk8xdh+BL4kvWD0Xxf5TjN30Pt9fz8fzBO7PMXbzjengDdJjVOvrvdm+K2VJu/z084/fD+s2SOfY9Ncnyf4jelqo6nohZmXz9d3dN6jm04/90vNiyV/4AGeOlUrL85B85SOe1eLXV9Xam583rNGw8cD6XozBOrY/rqj7lc8blphUWq8q7c0otfKB1boZ190L4Hv33tsIt+69f/F5MW6cf3x3+1N5352nx/RrxEwv7/D2IVJM9c9UXt1477/cVHhnMUp/88iOGu3G6TFRt8mY3Yeo7t02/yLEndvmerRPb5u/MBy7Txr/Ikonir2Zuo9/OYlSNl8TTh8/+/8ixK1Dk+yPPTQ/DEedbx+aRpT2ekJl+72ze6VsH+JWLdt/pMjim7Hp8cZg89nr9PGkyjbEo5DGi/EH23wvSGPFgN7K8WaQp2+St/bWmTafKussmw8cbz+69F3fkHq6d7b5fJOX3wuSn5d0+FKQ52maau8FyQfPrccPt5s/Btl+i4Zfx63pp6dx7T89X83PJ+7rdtL97sT97llgjqeWo83e7L5GdevN0HbW6uaebL+0XhsfXvhhtYAvfK29G8uE/rCoxPhpND5+Q1U/f0NVP39DtR+MwRPA8wcPfh6Msl2mI76s2crzV4p+F2T3q+ceF7zn68xXNoPfXrWa+pv7UqPXp9VubweJS+/z4stfDBJrLzzuIsrrc337+dbKejC7GPXTO5FWP70R2e3H3Rca2xg3X2jUmj5/obH9bPyMm6r8wzcKf74u1PxxAdqHuFWAav20AG0XgjriRyPleH77+LvB6J8PRv98MOYfOhgp3iCU9dnLl4Ox/RL2vcHYh7g1GO3jVdO2GzG5j5vPffRf+TT5ZCzmeP1V8Lpb2u/2fVzrn9/97H4j2RK/bKqbzfiOe9L+Dfek+w+lV1YGeb4s/PyN89q395Q3Phu//9Q674XK8wuqr32vnZ+Llfw8w/W7famf5u32k+/3vxtfPp95KJ9e8Pdfr795xd8HuXvJH99wyd9+4fwxf1qfJlI4VX9Ku5G/YWZ5937q3rTwfl9mvBRKzx9q/t2+bH9+8vQT2vbcEZu/EuTeCpC/CnJrBchfBLm3AuQvgtz7fXPa/XDDnn7Xczy9w+xfiJGMFbke/LwYxs8/IdmHsbhgPfjpfuarYXj1Z/bU4PH7MPXzM+5X2xLvqpP98PPir+1SLo0wz+vqfS1MeRrg8vzlo5/C1Dn/8DDGHZ+l55VPfk7pbRCLN5KPE+Z4M0huvLUer4PsPwJ/7xeY7dg/tt75+VI7dj9IvfU7l22Iez9fur8nu++3HttpyDu/wGzH5z94TruZzLvrH+2D3Fz/aBvk7o8w91tyc/2jtP2dy+31j34R5u6Cob8Kc3MZpf3I3FxGaR/k5jJKKW+fMm79qnOXPTd/KLuPce+Hsm33Oad7P5Rttr2BvPdD2e123B3S7aG9t4zSL87Vu8so/SLM3WWUfhXm5jJKv7pBYRHCRxrll7cELX/cGdA+/9FJy/aHhrg3m/WrIW3cxuanT4//7i7rFw8Jt5Zj+lWQW8sxtfwNC1S1z3/Asp9siK9ltpbfna/gTUt5GWL3WH1vaq4V+3xqrpVv+KrKbjmFMvloxnx6UlrH526M2vka+3x+jfaFGM1imdvHlaC/jNHKx68GtpuRoiO/2XhzVzIfMsj2Okb7/DdW282g7aQ9L8nw+82wP3Qzavyi5/Gidm424+OGwF+EuHVhqB83BO6Wx2ktnopaH+PlYOzamu9N2c7j0xnb3X7cnbDdxrg5X9t2LQ2352u3i/PdfPpv3/D03z5/+m+fP/23b3j6347ozaf/9g1P/7tW09tP/9sgd5/+d0FuP/1vt+Tu0//uiwNfePrfh7n99P+LMHef/tPxDU//2yB3n/6P+fGj6i577j79b2PcfPofnz/9j+94+h+fP/3vD+3Np//9uXr76X8f5vbT/y/C3Hz6n8enD1T7u4k7z1O7l+E3n6fmdzxPzW94ntr2e1k0jD/uOF+3OG1j9Ljy5efXi1+KwfP64zngdYyxXZ4ufuz1U7vETzE+XgVkfLwKyPiGVUDGN6wC0o9vuFvdLcM4o4VuvWblmNj9EI9/x1fHankvRiq8u2uvt6Mf39Bs1Y9vaLbSr6hfnyL3vpGX7FteiGzXEVLj0Jl1dTz3E//Yft/T5x9Q6+nzD6j19PEH1LYh7j3S3N+TvtmTzz+gto1x8wNqv4hx6wNq+xj3PqD2ixi3PqDW7fMPqP0ixq3HxP2+3PuA2v0Yb55jNz+g1u0bPqC235B7H1DrNr7h4I4/+ODe+4Baz9/wAbVfbMitD6j1/PEH1Hr+hg+obbfj7iPZL759ducDaj1/wwfU+je8l7LPG4h6+fwDar18vFDuNsTN6+3tPdlMIdrnDUS9fP4BtWTf0UBk39FAZN/RQGTf0UBk39NAZN/T+WPf0flj39H5Y593/tg3dP7Y550/vX78AbVev+EDar32z4f0Ozp/7Hs6f+x7On/sWzp/tjMrt+b+9nMzd+b+tj8XvbUN+x+c3tmGXyxFwAoA9WnS7mvrGfBu94HlzSBjsKzgbO8FyQdvyw97vTt1d+t9d2WFbZB7Hxrbh7j1obFfhLj1obHtcemxFY+plfTmwf0hSH03SCKIvT4uffcpqXv9FL8Icaefoo/0h4a4e+u+HdC4TD3meOa7R4Vl7/p8t4I8b8nbQUb82sRGfTsId4nbINsliW726rVPa/svlkaLZ4CZypurq8XClw989Zux7Upzt4Ziv1bdrSvtbi6F9YNqy68XNN7G6JFutdvxZoy4xNU+3lzLsBe24901FXnL9gj37pqK0dxWR3p7PAYxXh+X7V0yyzKW7aqMt2P092KwplPZrVO5jdHibd3jlr+8GSPuO0qvr8djHL/ovuYXp7O+buIex3Zb4r7wMbdcX9+p/2pb+EXjbLtt2fUfHhGlHc9PDV/akv707J9e/1pgpP2Manr6Oe/zbzR/F2bXosI89dND++N+/v6pwqJIZWyWARz77/LePlV2P1u9far8altuniq76dmbp8ovtuT2qTK/5VTZzYp8w6ky4vVMmel1dRu72YjHk0pc/ux5uajxU4y8e6wy2oifftf/8wJa277/Gm+Z52a117G7Tby9L+0P3Zd6xOzqA9+7+lWLq059/vDEl2IktiOVb4hRjzdjRAdBTWO+GSOemR/h3h7TyZjWN2MkYuT8Msb+oyKZBR7L8xPejx0V4/NFAMfniwCOPP7QEPcembfjmen9ef4q3O/G8+MlALdb8cOMfdlsRf68gpXycQXbf7KGGfvHGf9yX/Yx4sX/D292fhejfcO3c7ZB7s367UPcmvX7RYg7s37bbzPdemrff93pzlN7/niOPn88R7//6uHzcirH8/cov/TtxCO3pyibL0Hul1G4+wnGbZib5+g2xL1zdB/izjm6/5rszW9JbmN8/sXS++fIr77AevMcse85R+zzc8Q+P0fs43Nk25syWen+h1vbn57l+vaXVHxM+nnx8ftb8fQr9Dn6y63Yt4TEVfLHpa3vhxi0Ph8/rAf981hsF5e917Y8tisA3mxb3h0Ti8WtzZ5/u/27ndl+2q3ymr7V9qon/VdB+ERFa+n1D4W3n1SLppKcjtdnyNj26acxeE8/n3Zn9rvjWnqs+1WG5XfOs9JZ3HXkzaHZ/njq7nm2/UbV7UUC9seXpdDa8w37z1vS/uiTpPJ6q866Gdjtj+P4CJml1yve/SKI8VRZXy9UN+bxLZN1M308WfeLLbk7WTfzt0zWzfLpZN0vKsHTunspPz3czZ83ZHPSxh1Af/po3u0ycPNrd2O3EPCIm7MxX3dijd0aeTkVKmt9nlcu96+9Tx8xeZrL+fmQbK+93IfM5x+DfSEEPeUP7O+FYLnL+bTCxxdC2BEfprAfWmO+EKLE1Njj0fq9rSjMapWnLw99JUQ9EtMO7b0Q8dGBB6b3QhQ+ZV/tza3gqvD0s7p3t+LdEHGCP27H3jrBrRVus+t7B7XFXYO1/uZWxI/hrI3j4x15L0QeMUWYxyhvhuA6crx1UPOMRUof15DXwzl3757KiKatx0vGp9n0eX8z4iOBD+zv7UksW/zA987wFFeBB76X7Ue0GTxCvJftKXFVtePNHWmE+HxH3gyRKOHPvUlfChFfKH28tppvhqDlvB8f78i7IfidRZrvXYuMg2ppvBniIMT8dEfeDWGxgLzZ09cwfldztr9quldztjeOs8T086zHfDkzOHeT4JPu6vn8gaTfLVNR/sj5p8cpSqI83aj8dCs+d6v2WbSK5CO9vpmfn0+1boOsWVIWoD/ym2FmjSvbfP761deCsJbAA8u7QaKUPq62880guTIT3tqb56paSM4go76efr4f5OnO/ItB4oeND2zvBbk/Ef6Lob33kuEX23L3DcGvwtx8RTBr/o6R2Ya594pgH+LWK4JfhPjwFcG9noDtLz6ZdW3Hcy25PzXf+Ohre/7wwxdCjLiTSc+XvK+EmHFAH7cC6Z0Qdjy9Yyj5ra1gsYnUx3s70iefnk5v7UjiTuYxlf7eVuT4OWMqR3krRGmDWfD6MoTmdf64B7CU41bokSHvDUbhC77F0sfj+V6Ix1uAeAx8fjIvR7ofgnUq+tMP998O0d8KoWVjrhBPdw1fCtHZiqcphq+EmMYUQ31vLEa8LMrPL2jfDWHvHdQR19U8nu6wvxSCtWmer0NfCsESOeNpWZkvheCXi2O+eVAPVmBLb23F4+Usj4FPb5q/FIIfLtvTryl+DjG373Wevur+w0Jd4/5mTB6r51t5ZjleQlqe9l6IOMMf2N4LEU36lkt9MwRfPi/t4xD13a14asA83gvRGIuZPt6Knw/q/378v3/6t7/841/++vd/+9N//uXvf/uPx7/8nxXsH3/507/+9c/X//t//+tv//b0v/7n///f/X/513/85a9//cv/+5d//8ff/+3P/+e//vHnFWn9b78d1//5X4+3i/ZPjzul9L//6bf0+P/H0do/jWPkx/+f9b/n9b8XW//7+gdt/QD38RL8WP8h6W88Hkke/6f+7/9Zm/z/AQ=="
|
|
2618
|
-
}
|
|
2619
|
-
],
|
|
2620
|
-
"outputs": {
|
|
2621
|
-
"globals": {
|
|
2622
|
-
"storage": [
|
|
2623
|
-
{
|
|
2624
|
-
"fields": [
|
|
2625
|
-
{
|
|
2626
|
-
"name": "contract_name",
|
|
2627
|
-
"value": {
|
|
2628
|
-
"kind": "string",
|
|
2629
|
-
"value": "ContractInstanceRegistry"
|
|
2630
|
-
}
|
|
2631
|
-
},
|
|
2632
|
-
{
|
|
2633
|
-
"name": "fields",
|
|
2634
|
-
"value": {
|
|
2635
|
-
"fields": [
|
|
2636
|
-
{
|
|
2637
|
-
"name": "updated_class_ids",
|
|
2638
|
-
"value": {
|
|
2639
|
-
"fields": [
|
|
2640
|
-
{
|
|
2641
|
-
"name": "slot",
|
|
2642
|
-
"value": {
|
|
2643
|
-
"kind": "integer",
|
|
2644
|
-
"sign": false,
|
|
2645
|
-
"value": "0000000000000000000000000000000000000000000000000000000000000001"
|
|
2646
|
-
}
|
|
2647
|
-
}
|
|
2648
|
-
],
|
|
2649
|
-
"kind": "struct"
|
|
2650
|
-
}
|
|
2651
|
-
}
|
|
2652
|
-
],
|
|
2653
|
-
"kind": "struct"
|
|
2654
|
-
}
|
|
2655
|
-
}
|
|
2656
|
-
],
|
|
2657
|
-
"kind": "struct"
|
|
2658
|
-
}
|
|
2659
|
-
]
|
|
2660
|
-
},
|
|
2661
|
-
"structs": {
|
|
2662
|
-
"events": [
|
|
2663
|
-
{
|
|
2664
|
-
"fields": [
|
|
2665
|
-
{
|
|
2666
|
-
"name": "CONTRACT_INSTANCE_PUBLISHED_MAGIC_VALUE",
|
|
2667
|
-
"type": {
|
|
2668
|
-
"kind": "field"
|
|
2669
|
-
}
|
|
2670
|
-
},
|
|
2671
|
-
{
|
|
2672
|
-
"name": "address",
|
|
2673
|
-
"type": {
|
|
2674
|
-
"fields": [
|
|
2675
|
-
{
|
|
2676
|
-
"name": "inner",
|
|
2677
|
-
"type": {
|
|
2678
|
-
"kind": "field"
|
|
2679
|
-
}
|
|
2680
|
-
}
|
|
2681
|
-
],
|
|
2682
|
-
"kind": "struct",
|
|
2683
|
-
"path": "aztec::protocol_types::address::aztec_address::AztecAddress"
|
|
2684
|
-
}
|
|
2685
|
-
},
|
|
2686
|
-
{
|
|
2687
|
-
"name": "version",
|
|
2688
|
-
"type": {
|
|
2689
|
-
"kind": "integer",
|
|
2690
|
-
"sign": "unsigned",
|
|
2691
|
-
"width": 8
|
|
2692
|
-
}
|
|
2693
|
-
},
|
|
2694
|
-
{
|
|
2695
|
-
"name": "salt",
|
|
2696
|
-
"type": {
|
|
2697
|
-
"kind": "field"
|
|
2698
|
-
}
|
|
2699
|
-
},
|
|
2700
|
-
{
|
|
2701
|
-
"name": "contract_class_id",
|
|
2702
|
-
"type": {
|
|
2703
|
-
"fields": [
|
|
2704
|
-
{
|
|
2705
|
-
"name": "inner",
|
|
2706
|
-
"type": {
|
|
2707
|
-
"kind": "field"
|
|
2708
|
-
}
|
|
2709
|
-
}
|
|
2710
|
-
],
|
|
2711
|
-
"kind": "struct",
|
|
2712
|
-
"path": "aztec::protocol_types::contract_class_id::ContractClassId"
|
|
2713
|
-
}
|
|
2714
|
-
},
|
|
2715
|
-
{
|
|
2716
|
-
"name": "initialization_hash",
|
|
2717
|
-
"type": {
|
|
2278
|
+
},
|
|
2279
|
+
{
|
|
2280
|
+
"name": "initialization_hash",
|
|
2281
|
+
"type": {
|
|
2718
2282
|
"kind": "field"
|
|
2719
2283
|
}
|
|
2720
2284
|
},
|
|
@@ -2979,111 +2543,6 @@
|
|
|
2979
2543
|
"kind": "struct",
|
|
2980
2544
|
"path": "ContractInstanceRegistry::get_update_delay_abi"
|
|
2981
2545
|
},
|
|
2982
|
-
{
|
|
2983
|
-
"fields": [
|
|
2984
|
-
{
|
|
2985
|
-
"name": "parameters",
|
|
2986
|
-
"type": {
|
|
2987
|
-
"fields": [
|
|
2988
|
-
{
|
|
2989
|
-
"name": "message_ciphertext",
|
|
2990
|
-
"type": {
|
|
2991
|
-
"fields": [
|
|
2992
|
-
{
|
|
2993
|
-
"name": "storage",
|
|
2994
|
-
"type": {
|
|
2995
|
-
"kind": "array",
|
|
2996
|
-
"length": 17,
|
|
2997
|
-
"type": {
|
|
2998
|
-
"kind": "field"
|
|
2999
|
-
}
|
|
3000
|
-
}
|
|
3001
|
-
},
|
|
3002
|
-
{
|
|
3003
|
-
"name": "len",
|
|
3004
|
-
"type": {
|
|
3005
|
-
"kind": "integer",
|
|
3006
|
-
"sign": "unsigned",
|
|
3007
|
-
"width": 32
|
|
3008
|
-
}
|
|
3009
|
-
}
|
|
3010
|
-
],
|
|
3011
|
-
"kind": "struct",
|
|
3012
|
-
"path": "std::collections::bounded_vec::BoundedVec"
|
|
3013
|
-
}
|
|
3014
|
-
},
|
|
3015
|
-
{
|
|
3016
|
-
"name": "message_context",
|
|
3017
|
-
"type": {
|
|
3018
|
-
"fields": [
|
|
3019
|
-
{
|
|
3020
|
-
"name": "tx_hash",
|
|
3021
|
-
"type": {
|
|
3022
|
-
"kind": "field"
|
|
3023
|
-
}
|
|
3024
|
-
},
|
|
3025
|
-
{
|
|
3026
|
-
"name": "unique_note_hashes_in_tx",
|
|
3027
|
-
"type": {
|
|
3028
|
-
"fields": [
|
|
3029
|
-
{
|
|
3030
|
-
"name": "storage",
|
|
3031
|
-
"type": {
|
|
3032
|
-
"kind": "array",
|
|
3033
|
-
"length": 64,
|
|
3034
|
-
"type": {
|
|
3035
|
-
"kind": "field"
|
|
3036
|
-
}
|
|
3037
|
-
}
|
|
3038
|
-
},
|
|
3039
|
-
{
|
|
3040
|
-
"name": "len",
|
|
3041
|
-
"type": {
|
|
3042
|
-
"kind": "integer",
|
|
3043
|
-
"sign": "unsigned",
|
|
3044
|
-
"width": 32
|
|
3045
|
-
}
|
|
3046
|
-
}
|
|
3047
|
-
],
|
|
3048
|
-
"kind": "struct",
|
|
3049
|
-
"path": "std::collections::bounded_vec::BoundedVec"
|
|
3050
|
-
}
|
|
3051
|
-
},
|
|
3052
|
-
{
|
|
3053
|
-
"name": "first_nullifier_in_tx",
|
|
3054
|
-
"type": {
|
|
3055
|
-
"kind": "field"
|
|
3056
|
-
}
|
|
3057
|
-
},
|
|
3058
|
-
{
|
|
3059
|
-
"name": "recipient",
|
|
3060
|
-
"type": {
|
|
3061
|
-
"fields": [
|
|
3062
|
-
{
|
|
3063
|
-
"name": "inner",
|
|
3064
|
-
"type": {
|
|
3065
|
-
"kind": "field"
|
|
3066
|
-
}
|
|
3067
|
-
}
|
|
3068
|
-
],
|
|
3069
|
-
"kind": "struct",
|
|
3070
|
-
"path": "aztec::protocol_types::address::aztec_address::AztecAddress"
|
|
3071
|
-
}
|
|
3072
|
-
}
|
|
3073
|
-
],
|
|
3074
|
-
"kind": "struct",
|
|
3075
|
-
"path": "aztec::messages::processing::message_context::MessageContext"
|
|
3076
|
-
}
|
|
3077
|
-
}
|
|
3078
|
-
],
|
|
3079
|
-
"kind": "struct",
|
|
3080
|
-
"path": "ContractInstanceRegistry::process_message_parameters"
|
|
3081
|
-
}
|
|
3082
|
-
}
|
|
3083
|
-
],
|
|
3084
|
-
"kind": "struct",
|
|
3085
|
-
"path": "ContractInstanceRegistry::process_message_abi"
|
|
3086
|
-
},
|
|
3087
2546
|
{
|
|
3088
2547
|
"fields": [
|
|
3089
2548
|
{
|
|
@@ -3308,20 +2767,6 @@
|
|
|
3308
2767
|
"kind": "struct",
|
|
3309
2768
|
"path": "ContractInstanceRegistry::set_update_delay_abi"
|
|
3310
2769
|
},
|
|
3311
|
-
{
|
|
3312
|
-
"fields": [
|
|
3313
|
-
{
|
|
3314
|
-
"name": "parameters",
|
|
3315
|
-
"type": {
|
|
3316
|
-
"fields": [],
|
|
3317
|
-
"kind": "struct",
|
|
3318
|
-
"path": "ContractInstanceRegistry::sync_state_parameters"
|
|
3319
|
-
}
|
|
3320
|
-
}
|
|
3321
|
-
],
|
|
3322
|
-
"kind": "struct",
|
|
3323
|
-
"path": "ContractInstanceRegistry::sync_state_abi"
|
|
3324
|
-
},
|
|
3325
2770
|
{
|
|
3326
2771
|
"fields": [
|
|
3327
2772
|
{
|
|
@@ -3360,301 +2805,145 @@
|
|
|
3360
2805
|
"path": "std/aes128.nr",
|
|
3361
2806
|
"source": "// docs:start:aes128\n// Given a plaintext as an array of bytes, returns the corresponding aes128 ciphertext (CBC mode). Input padding is performed using PKCS#7, so that the output length is `input.len() + (16 - input.len() % 16)`.\npub fn aes128_encrypt<let N: u32>(\n input: [u8; N],\n iv: [u8; 16],\n key: [u8; 16],\n) -> [u8; N + 16 - N % 16] {\n let padding_length = (16 - N % 16) as u8;\n let mut padded_input: [u8; N + 16 - N % 16] = [0; N + 16 - N % 16];\n for i in 0..N {\n padded_input[i] = input[i];\n }\n for i in N..N + 16 - N % 16 {\n padded_input[i] = padding_length;\n }\n let output = aes128_encrypt_padded_input(padded_input, iv, key);\n output\n}\n\n#[foreign(aes128_encrypt)]\nfn aes128_encrypt_padded_input<let N: u32>(input: [u8; N], iv: [u8; 16], key: [u8; 16]) -> [u8; N] {}\n\n// docs:end:aes128\n"
|
|
3362
2807
|
},
|
|
3363
|
-
"
|
|
3364
|
-
"path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/macros/dispatch.nr",
|
|
3365
|
-
"source": "use crate::macros::internals_functions_generation::external_functions_registry::get_public_functions;\nuse crate::protocol::meta::utils::get_params_len_quote;\nuse super::utils::compute_fn_selector;\nuse poseidon::poseidon2::Poseidon2Hasher;\nuse std::{collections::umap::UHashMap, hash::BuildHasherDefault, panic};\n\n/// Returns an `fn public_dispatch(...)` function for the given module that's assumed to be an Aztec contract.\npub comptime fn generate_public_dispatch(m: Module) -> Quoted {\n let functions = get_public_functions(m);\n\n let unit = get_type::<()>();\n\n let seen_selectors = &mut UHashMap::<Field, Quoted, BuildHasherDefault<Poseidon2Hasher>>::default();\n\n let ifs = functions.map(|function: FunctionDefinition| {\n let parameters = function.parameters();\n let return_type = function.return_type();\n\n let selector: Field = compute_fn_selector(function);\n let fn_name = function.name();\n\n // Since function selectors are computed as the first 4 bytes of the hash of the function signature, it's\n // possible to have collisions. With the following check, we ensure it doesn't happen within the same contract.\n if seen_selectors.contains_key(selector) {\n let existing_fn = seen_selectors.get(selector).unwrap();\n panic(\n f\"Public function selector collision detected between functions '{fn_name}' and '{existing_fn}'\",\n );\n }\n seen_selectors.insert(selector, fn_name);\n\n let params_len_quote = get_params_len_quote(parameters);\n\n let initial_read = if parameters.len() == 0 {\n quote {}\n } else {\n // The initial calldata_copy offset is 1 to skip the Field selector The expected calldata is the\n // serialization of\n // - FunctionSelector: the selector of the function intended to dispatch\n // - Parameters: the parameters of the function intended to dispatch That is, exactly what is expected for\n // a call to the target function, but with a selector added at the beginning.\n quote {\n let input_calldata: [Field; $params_len_quote] = aztec::oracle::avm::calldata_copy(1, $params_len_quote);\n let mut reader = aztec::protocol::utils::reader::Reader::new(input_calldata);\n }\n };\n\n let parameter_index: &mut u32 = &mut 0;\n let reads = parameters.map(|param: (Quoted, Type)| {\n let parameter_index_value = *parameter_index;\n let param_name = f\"arg{parameter_index_value}\".quoted_contents();\n let param_type = param.1;\n let read = quote {\n let $param_name: $param_type = reader.read_struct(aztec::protocol::traits::Deserialize::deserialize);\n };\n *parameter_index += 1;\n quote { $read }\n });\n let read = reads.join(quote { });\n\n let mut args = @[];\n for parameter_index in 0..parameters.len() {\n let param_name = f\"arg{parameter_index}\".quoted_contents();\n args = args.push_back(quote { $param_name });\n }\n\n // We call a function whose name is prefixed with `__aztec_nr_internals__`. This is necessary because the\n // original function is intentionally made uncallable, preventing direct invocation within the contract.\n // Instead, a new function with the same name, but prefixed by `__aztec_nr_internals__`, has been generated to\n // be called here. For more details see the `process_functions` function.\n let name = f\"__aztec_nr_internals__{fn_name}\".quoted_contents();\n let args = args.join(quote { , });\n let call = quote { $name($args) };\n\n let return_code = if return_type == unit {\n quote {\n $call;\n // Force early return.\n aztec::oracle::avm::avm_return([]);\n }\n } else {\n quote {\n let return_value = aztec::protocol::traits::Serialize::serialize($call);\n aztec::oracle::avm::avm_return(return_value.as_vector());\n }\n };\n\n let if_ = quote {\n if selector == $selector {\n $initial_read\n $read\n $return_code\n }\n };\n if_\n });\n\n if ifs.len() == 0 {\n // No dispatch function if there are no public functions\n quote {}\n } else {\n let ifs = ifs.push_back(quote { panic(f\"Unknown selector {selector}\") });\n let dispatch = ifs.join(quote { });\n\n let body = quote {\n // We mark this as public because our whole system depends on public functions having this attribute.\n #[aztec::macros::internals_functions_generation::abi_attributes::abi_public]\n pub unconstrained fn public_dispatch(selector: Field) {\n $dispatch\n }\n };\n\n body\n }\n}\n\ncomptime fn get_type<T>() -> Type {\n let t: T = std::mem::zeroed();\n std::meta::type_of(t)\n}\n"
|
|
3366
|
-
},
|
|
3367
|
-
"111": {
|
|
3368
|
-
"path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/macros/internals_functions_generation/external/private.nr",
|
|
3369
|
-
"source": "use crate::macros::{\n internals_functions_generation::external::helpers::{create_authorize_once_check, get_abi_relevant_attributes},\n utils::{\n fn_has_authorize_once, fn_has_noinitcheck, fn_has_nophasecheck, is_fn_initializer, is_fn_only_self, is_fn_view,\n module_has_initializer, module_has_storage,\n },\n};\nuse crate::protocol::meta::utils::derive_serialization_quotes;\nuse std::meta::{ctstring::AsCtString, type_of};\n\npub(crate) comptime fn generate_private_external(f: FunctionDefinition) -> Quoted {\n let module_has_initializer = module_has_initializer(f.module());\n let module_has_storage = module_has_storage(f.module());\n\n // Private functions undergo a lot of transformations from their Aztec.nr form into a circuit that can be fed to\n // the Private Kernel Circuit. First we change the function signature so that it also receives\n // `PrivateContextInputs`, which contain information about the execution context (e.g. the caller).\n let original_params = f.parameters();\n\n let original_params_quotes =\n original_params.map(|(param_name, param_type)| quote { $param_name: $param_type }).join(quote {, });\n\n let params = quote { inputs: aztec::context::inputs::PrivateContextInputs, $original_params_quotes };\n\n let mut body = f.body().as_block().unwrap();\n\n // The original params are hashed and passed to the `context` object, so that the kernel can verify we've received\n // the correct values.\n let (args_serialization, _, serialized_args_name) = derive_serialization_quotes(original_params, false);\n\n let storage_init = if module_has_storage {\n // Contract has Storage defined so we initialize it.\n quote {\n let storage = Storage::init(&mut context);\n }\n } else {\n // Contract does not have Storage defined, so we set storage to the unit type `()`. ContractSelf requires a\n // storage struct in its constructor. Using an Option type would lead to worse developer experience and higher\n // constraint counts so we use the unit type `()` instead.\n quote {\n let storage = ();\n }\n };\n\n let contract_self_creation = quote {\n #[allow(unused_variables)]\n let mut self = {\n $args_serialization\n let args_hash = aztec::hash::hash_args($serialized_args_name);\n let mut context = aztec::context::PrivateContext::new(inputs, args_hash);\n $storage_init\n let self_address = context.this_address();\n let call_self: CallSelf<&mut aztec::context::PrivateContext> = CallSelf { address: self_address, context: &mut context };\n let enqueue_self: EnqueueSelf<&mut aztec::context::PrivateContext> = EnqueueSelf { address: self_address, context: &mut context };\n let call_self_static: CallSelfStatic<&mut aztec::context::PrivateContext> = CallSelfStatic { address: self_address, context: &mut context };\n let enqueue_self_static: EnqueueSelfStatic<&mut aztec::context::PrivateContext> = EnqueueSelfStatic { address: self_address, context: &mut context };\n let internal: CallInternal<&mut aztec::context::PrivateContext> = CallInternal { context: &mut context };\n aztec::ContractSelf::new_private(&mut context, storage, call_self, enqueue_self, call_self_static, enqueue_self_static, internal)\n };\n };\n\n let original_function_name = f.name();\n\n // Modifications introduced by the different marker attributes.\n let internal_check = if is_fn_only_self(f) {\n let assertion_message = f\"Function {original_function_name} can only be called by the same contract\";\n quote { assert(self.msg_sender() == self.address, $assertion_message); }\n } else {\n quote {}\n };\n\n let view_check = if is_fn_view(f) {\n let assertion_message =\n f\"Function {original_function_name} can only be called statically\".as_ctstring().as_quoted_str();\n quote { assert(self.context.inputs.call_context.is_static_call, $assertion_message); }\n } else {\n quote {}\n };\n\n let (assert_initializer, mark_as_initialized) = if is_fn_initializer(f) {\n (\n quote { aztec::macros::functions::initialization_utils::assert_initialization_matches_address_preimage_private(*self.context); },\n quote { aztec::macros::functions::initialization_utils::mark_as_initialized_private(self.context); },\n )\n } else {\n (quote {}, quote {})\n };\n\n // Initialization checks are not included in contracts that don't have initializers.\n let init_check = if module_has_initializer & !is_fn_initializer(f) & !fn_has_noinitcheck(f) {\n quote { aztec::macros::functions::initialization_utils::assert_is_initialized_private(self.context); }\n } else {\n quote {}\n };\n\n // Phase checks are skipped in functions that request to manually handle phases\n let initial_phase_store = if fn_has_nophasecheck(f) {\n quote {}\n } else {\n quote { let within_revertible_phase: bool = self.context.in_revertible_phase(); }\n };\n\n let no_phase_change_check = if fn_has_nophasecheck(f) {\n quote {}\n } else {\n quote { \n assert_eq(\n within_revertible_phase,\n self.context.in_revertible_phase(),\n f\"Phase change detected on function with phase check. If this is expected, use #[nophasecheck]\",\n ); \n }\n };\n\n // Inject the authwit check if the function is marked with #[authorize_once].\n let authorize_once_check = if fn_has_authorize_once(f) {\n create_authorize_once_check(f, true)\n } else {\n quote {}\n };\n\n // Finally, we need to change the return type to be `PrivateCircuitPublicInputs`, which is what the Private Kernel\n // circuit expects.\n let return_value_var_name = quote { macro__returned__values };\n\n let return_value_type = f.return_type();\n let return_value = if body.len() == 0 {\n quote {}\n } else if return_value_type != type_of(()) {\n // The original return value is serialized and hashed before being passed to the context.\n let (body_without_return, last_body_expr) = body.pop_back();\n let return_value = last_body_expr.quoted();\n let return_value_assignment = quote { let $return_value_var_name: $return_value_type = $return_value; };\n\n let (return_serialization, _, serialized_return_name) =\n derive_serialization_quotes([(return_value_var_name, return_value_type)], false);\n\n body = body_without_return;\n\n quote {\n $return_value_assignment\n $return_serialization\n self.context.set_return_hash($serialized_return_name);\n }\n } else {\n let (body_without_return, last_body_expr) = body.pop_back();\n if !last_body_expr.has_semicolon()\n & last_body_expr.as_for().is_none()\n & last_body_expr.as_assert().is_none()\n & last_body_expr.as_for_range().is_none()\n & last_body_expr.as_assert_eq().is_none()\n & last_body_expr.as_let().is_none() {\n let unused_return_value_name = f\"_{return_value_var_name}\".quoted_contents();\n body = body_without_return.push_back(quote { let $unused_return_value_name = $last_body_expr; }\n .as_expr()\n .unwrap());\n }\n quote {}\n };\n\n let context_finish = quote { self.context.finish() };\n\n // Preserve all attributes that are relevant to the function's ABI.\n let abi_relevant_attributes = get_abi_relevant_attributes(f);\n\n let fn_name = f\"__aztec_nr_internals__{original_function_name}\".quoted_contents();\n\n let to_prepend = quote {\n aztec::oracle::version::assert_compatible_oracle_version();\n $contract_self_creation\n $initial_phase_store\n $assert_initializer\n $init_check\n $internal_check\n $view_check\n $authorize_once_check\n };\n\n let body_quote = body.map(|expr| expr.quoted()).join(quote { });\n\n let to_append = quote {\n $return_value\n $mark_as_initialized\n $no_phase_change_check\n $context_finish\n };\n\n quote {\n #[aztec::macros::internals_functions_generation::abi_attributes::abi_private]\n $abi_relevant_attributes\n fn $fn_name($params) -> return_data aztec::protocol::abis::private_circuit_public_inputs::PrivateCircuitPublicInputs {\n $to_prepend\n $body_quote\n $to_append\n }\n }\n}\n"
|
|
3370
|
-
},
|
|
3371
|
-
"112": {
|
|
3372
|
-
"path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/macros/internals_functions_generation/external/public.nr",
|
|
3373
|
-
"source": "use crate::macros::{\n internals_functions_generation::external::helpers::{create_authorize_once_check, get_abi_relevant_attributes},\n utils::{\n fn_has_authorize_once, fn_has_noinitcheck, is_fn_initializer, is_fn_only_self, is_fn_view,\n module_has_initializer, module_has_storage,\n },\n};\nuse std::meta::ctstring::AsCtString;\n\npub(crate) comptime fn generate_public_external(f: FunctionDefinition) -> Quoted {\n let module_has_initializer = module_has_initializer(f.module());\n let module_has_storage = module_has_storage(f.module());\n\n // Public functions undergo a lot of transformations from their Aztec.nr form.\n let original_params = f.parameters();\n\n let args_len_quote = if original_params.len() == 0 {\n // If the function has no parameters, we set the args_len to 0.\n quote { 0 }\n } else {\n // The following will give us <type_of_struct_member_1 as Serialize>::N + <type_of_struct_member_2 as\n // Serialize>::N + ...\n original_params\n .map(|(_, param_type): (Quoted, Type)| {\n quote {\n <$param_type as $crate::protocol::traits::Serialize>::N\n }\n })\n .join(quote {+})\n };\n\n let storage_init = if module_has_storage {\n quote {\n let storage = Storage::init(context);\n }\n } else {\n // Contract does not have Storage defined, so we set storage to the unit type `()`. ContractSelf requires a\n // storage struct in its constructor. Using an Option type would lead to worse developer experience and higher\n // constraint counts so we use the unit type `()` instead.\n quote {\n let storage = ();\n }\n };\n\n // Unlike in the private case, in public the `context` does not need to receive the hash of the original params.\n let contract_self_creation = quote {\n #[allow(unused_variables)]\n let mut self = {\n let context = aztec::context::PublicContext::new(|| {\n // We start from 1 because we skip the selector for the dispatch function.\n let serialized_args : [Field; $args_len_quote] = aztec::oracle::avm::calldata_copy(1, $args_len_quote);\n aztec::hash::hash_args(serialized_args)\n });\n $storage_init\n let self_address = context.this_address();\n let call_self: CallSelf<aztec::context::PublicContext> = CallSelf { address: self_address, context };\n let call_self_static: CallSelfStatic<aztec::context::PublicContext> = CallSelfStatic { address: self_address, context };\n let internal: CallInternal<aztec::context::PublicContext> = CallInternal { context };\n aztec::ContractSelf::new_public(context, storage, call_self, call_self_static, internal)\n };\n };\n\n let original_function_name = f.name();\n\n // Modifications introduced by the different marker attributes.\n let internal_check = if is_fn_only_self(f) {\n let assertion_message = f\"Function {original_function_name} can only be called by the same contract\";\n quote { assert(self.msg_sender() == self.address, $assertion_message); }\n } else {\n quote {}\n };\n\n let view_check = if is_fn_view(f) {\n let assertion_message =\n f\"Function {original_function_name} can only be called statically\".as_ctstring().as_quoted_str();\n quote { assert(self.context.is_static_call(), $assertion_message); }\n } else {\n quote {}\n };\n\n let (assert_initializer, mark_as_initialized) = if is_fn_initializer(f) {\n (\n quote { aztec::macros::functions::initialization_utils::assert_initialization_matches_address_preimage_public(self.context); },\n quote { aztec::macros::functions::initialization_utils::mark_as_initialized_public(self.context); },\n )\n } else {\n (quote {}, quote {})\n };\n\n // Initialization checks are not included in contracts that don't have initializers.\n let init_check = if module_has_initializer & !fn_has_noinitcheck(f) & !is_fn_initializer(f) {\n quote { aztec::macros::functions::initialization_utils::assert_is_initialized_public(self.context); }\n } else {\n quote {}\n };\n\n // Inject the authwit check if the function is marked with #[authorize_once].\n let authorize_once_check = if fn_has_authorize_once(f) {\n create_authorize_once_check(f, false)\n } else {\n quote {}\n };\n\n let to_prepend = quote {\n $contract_self_creation\n $assert_initializer\n $init_check\n $internal_check\n $view_check\n $authorize_once_check\n };\n\n let to_append = quote {\n $mark_as_initialized\n };\n\n let fn_name = f\"__aztec_nr_internals__{original_function_name}\".quoted_contents();\n let body = f.body();\n let return_type = f.return_type();\n\n // New function parameters are the same as the original function's ones.\n let params = original_params.map(|(param_name, param_type)| quote { $param_name: $param_type }).join(quote {, });\n\n // Preserve all attributes that are relevant to the function's ABI.\n let abi_relevant_attributes = get_abi_relevant_attributes(f);\n\n // All public functions are automatically made unconstrained, even if they were not marked as such. This is because\n // instead of compiling into a circuit, they will compile to bytecode that will be later transpiled into AVM\n // bytecode.\n quote {\n #[aztec::macros::internals_functions_generation::abi_attributes::abi_public]\n $abi_relevant_attributes\n unconstrained fn $fn_name($params) -> pub $return_type {\n $to_prepend\n $body\n $to_append\n }\n }\n}\n"
|
|
3374
|
-
},
|
|
3375
|
-
"122": {
|
|
3376
|
-
"path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/messages/discovery/mod.nr",
|
|
3377
|
-
"source": "use crate::protocol::{address::AztecAddress, debug_log::{debug_log, debug_log_format}};\n\npub mod nonce_discovery;\npub mod partial_notes;\npub mod private_events;\npub mod private_notes;\npub mod process_message;\n\nuse crate::{\n messages::{\n discovery::process_message::process_message_ciphertext,\n logs::note::MAX_NOTE_PACKED_LEN,\n processing::{\n get_private_logs, pending_tagged_log::PendingTaggedLog, validate_and_store_enqueued_notes_and_events,\n },\n },\n utils::array,\n};\n\npub struct NoteHashAndNullifier {\n /// The result of NoteHash::compute_note_hash\n pub note_hash: Field,\n /// The result of NoteHash::compute_nullifier_unconstrained (since all of message discovery is unconstrained)\n pub inner_nullifier: Field,\n}\n\n/// A function which takes a note's packed content, address of the emitting contract, note nonce, storage slot and note\n/// type ID and attempts to compute its note hash (not hashed by note nonce nor siloed by address) and inner nullifier\n/// (not siloed by address).\n///\n/// This function must be user-provided as its implementation requires knowledge of how note type IDs are allocated in\n/// a contract. The `#[aztec]` macro automatically creates such a contract library method called\n/// `_compute_note_hash_and_nullifier`, which looks something like this:\n///\n/// ```\n/// |packed_note, owner, storage_slot, note_type_id, contract_address, randomness, note_nonce| {\n/// if note_type_id == MyNoteType::get_id() {\n/// assert(packed_note.len() == MY_NOTE_TYPE_SERIALIZATION_LENGTH);\n///\n/// let note = MyNoteType::unpack(aztec::utils::array::subarray(packed_note.storage(), 0));\n///\n/// let note_hash = note.compute_note_hash(owner, storage_slot, randomness);\n/// let note_hash_for_nullification = aztec::note::utils::compute_note_hash_for_nullification(\n/// HintedNote{ note, contract_address, metadata: SettledNoteMetadata::new(note_nonce).into() },\n/// storage_slot\n/// );\n///\n/// let inner_nullifier = note.compute_nullifier_unconstrained(owner, note_hash_for_nullification);\n///\n/// Option::some(\n/// aztec::messages::discovery::NoteHashAndNullifier {\n/// note_hash, inner_nullifier\n/// }\n/// )\n/// } else if note_type_id == MyOtherNoteType::get_id() {\n/// ... // Similar to above but calling MyOtherNoteType::unpack_content\n/// } else {\n/// Option::none() // Unknown note type ID\n/// };\n/// }\n/// ```\npub type ComputeNoteHashAndNullifier<Env> = unconstrained fn[Env](/* packed_note */BoundedVec<Field, MAX_NOTE_PACKED_LEN>, /*\n owner */ AztecAddress, /* storage_slot */ Field, /* note_type_id */ Field, /* contract_address */ AztecAddress, /*\nrandomness */ Field, /* note nonce */ Field) -> Option<NoteHashAndNullifier>;\n\n/// Performs the state synchronization process, in which private logs are downloaded and inspected to find new private\n/// notes, partial notes and events, etc., and pending partial notes are processed to search for their completion logs.\n/// This is the mechanism via which a contract updates its knowledge of its private state.\n///\n/// Note that the state is synchronized up to the latest block synchronized by PXE (referred to as \"anchor block\").\n/// That should be close to the chain tip as block synchronization is performed before contract function simulation is\n/// done.\n///\n/// Receives the address of the contract on which discovery is performed along with its\n/// `compute_note_hash_and_nullifier` function.\npub unconstrained fn do_sync_state<Env>(\n contract_address: AztecAddress,\n compute_note_hash_and_nullifier: ComputeNoteHashAndNullifier<Env>,\n) {\n debug_log(\"Performing state synchronization\");\n\n // First we process all private logs, which can contain different kinds of messages e.g. private notes, partial\n // notes, private events, etc.\n let mut logs = get_private_logs(contract_address);\n logs.for_each(|i, pending_tagged_log: PendingTaggedLog| {\n debug_log_format(\n \"Processing log with tag {0}\",\n [pending_tagged_log.log.get(0)],\n );\n\n // We remove the tag from the pending tagged log and process the message ciphertext contained in it.\n let message_ciphertext = array::subbvec(pending_tagged_log.log, 1);\n\n process_message_ciphertext(\n contract_address,\n compute_note_hash_and_nullifier,\n message_ciphertext,\n pending_tagged_log.context,\n );\n logs.remove(i);\n });\n\n // Then we process all pending partial notes, regardless of whether they were found in the current or previous\n // executions.\n partial_notes::fetch_and_process_partial_note_completion_logs(contract_address, compute_note_hash_and_nullifier);\n\n // Finally we validate all notes and events that were found as part of the previous processes, resulting in them\n // being added to PXE's database and retrievable via oracles (get_notes) and our TS API (PXE::getPrivateEvents).\n validate_and_store_enqueued_notes_and_events(contract_address);\n}\n"
|
|
3378
|
-
},
|
|
3379
|
-
"123": {
|
|
3380
|
-
"path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/messages/discovery/nonce_discovery.nr",
|
|
3381
|
-
"source": "use crate::messages::{discovery::ComputeNoteHashAndNullifier, logs::note::MAX_NOTE_PACKED_LEN};\n\nuse crate::protocol::{\n address::AztecAddress,\n constants::MAX_NOTE_HASHES_PER_TX,\n debug_log::debug_log_format,\n hash::{compute_note_hash_nonce, compute_siloed_note_hash, compute_unique_note_hash},\n traits::ToField,\n};\n\n/// A struct with the discovered information of a complete note, required for delivery to PXE. Note that this is *not*\n/// the complete note information, since it does not include content, storage slot, etc.\npub struct DiscoveredNoteInfo {\n pub note_nonce: Field,\n pub note_hash: Field,\n pub inner_nullifier: Field,\n}\n\n/// Searches for note nonces that will result in a note that was emitted in a transaction. While rare, it is possible\n/// for multiple notes to have the exact same packed content and storage slot but different nonces, resulting in\n/// different unique note hashes. Because of this this function returns a *vector* of discovered notes, though in most\n/// cases it will contain a single element.\n///\n/// Due to how nonces are computed, this function requires knowledge of the transaction in which the note was created,\n/// more specifically the list of all unique note hashes in it plus the value of its first nullifier.\npub unconstrained fn attempt_note_nonce_discovery<Env>(\n unique_note_hashes_in_tx: BoundedVec<Field, MAX_NOTE_HASHES_PER_TX>,\n first_nullifier_in_tx: Field,\n compute_note_hash_and_nullifier: ComputeNoteHashAndNullifier<Env>,\n contract_address: AztecAddress,\n owner: AztecAddress,\n storage_slot: Field,\n randomness: Field,\n note_type_id: Field,\n packed_note: BoundedVec<Field, MAX_NOTE_PACKED_LEN>,\n) -> BoundedVec<DiscoveredNoteInfo, MAX_NOTE_HASHES_PER_TX> {\n let discovered_notes = &mut BoundedVec::new();\n\n debug_log_format(\n \"Attempting nonce discovery on {0} potential notes on contract {1} for storage slot {2}\",\n [unique_note_hashes_in_tx.len() as Field, contract_address.to_field(), storage_slot],\n );\n\n // We need to find nonces (typically just one) that result in a note hash that, once siloed into a unique note\n // hash, is one of the note hashes created by the transaction.\n unique_note_hashes_in_tx.for_eachi(|i, expected_unique_note_hash| {\n // Nonces are computed by hashing the first nullifier in the transaction with the index of the note in the new\n // note hashes array. We therefore know for each note in every transaction what its nonce is.\n let candidate_nonce = compute_note_hash_nonce(first_nullifier_in_tx, i);\n\n // Given note nonce, note content and metadata, we can compute the note hash and silo it to check if it matches\n // the note hash at the array index we're currently processing. TODO(#11157): handle failed\n // note_hash_and_nullifier computation\n let hashes = compute_note_hash_and_nullifier(\n packed_note,\n owner,\n storage_slot,\n note_type_id,\n contract_address,\n randomness,\n candidate_nonce,\n )\n .expect(f\"Failed to compute a note hash for note type {note_type_id}\");\n\n let siloed_note_hash = compute_siloed_note_hash(contract_address, hashes.note_hash);\n let unique_note_hash = compute_unique_note_hash(candidate_nonce, siloed_note_hash);\n\n if unique_note_hash == expected_unique_note_hash {\n // Note that while we did check that the note hash is the preimage of the expected unique note hash, we\n // perform no validations on the nullifier - we fundamentally cannot, since only the application knows how\n // to compute nullifiers. We simply trust it to have provided the correct one: if it hasn't, then PXE may\n // fail to realize that a given note has been nullified already, and calls to the application could result\n // in invalid transactions (with duplicate nullifiers). This is not a concern because an application\n // already has more direct means of making a call to it fail the transaction.\n discovered_notes.push(\n DiscoveredNoteInfo {\n note_nonce: candidate_nonce,\n note_hash: hashes.note_hash,\n inner_nullifier: hashes.inner_nullifier,\n },\n );\n\n // We don't exit the loop - it is possible (though rare) for the exact same note content to be present\n // multiple times in the same transaction with different nonces. This typically doesn't happen due to notes\n // containing random values in order to hide their contents.\n }\n });\n\n debug_log_format(\n \"Found valid nonces for a total of {0} notes\",\n [discovered_notes.len() as Field],\n );\n\n *discovered_notes\n}\n\nmod test {\n use crate::{\n messages::{discovery::NoteHashAndNullifier, logs::note::MAX_NOTE_PACKED_LEN},\n note::{\n HintedNote,\n note_interface::{NoteHash, NoteType},\n note_metadata::SettledNoteMetadata,\n utils::compute_note_hash_for_nullification,\n },\n oracle::random::random,\n test::mocks::mock_note::MockNote,\n utils::array,\n };\n\n use crate::protocol::{\n address::AztecAddress,\n hash::{compute_note_hash_nonce, compute_siloed_note_hash, compute_unique_note_hash},\n traits::{FromField, Packable},\n };\n\n use super::attempt_note_nonce_discovery;\n\n // This implementation could be simpler, but this serves as a nice example of the expected flow in a real\n // implementation, and as a sanity check that the interface is sufficient.\n unconstrained fn compute_note_hash_and_nullifier(\n packed_note: BoundedVec<Field, MAX_NOTE_PACKED_LEN>,\n owner: AztecAddress,\n storage_slot: Field,\n note_type_id: Field,\n contract_address: AztecAddress,\n randomness: Field,\n note_nonce: Field,\n ) -> Option<NoteHashAndNullifier> {\n if note_type_id == MockNote::get_id() {\n let note = MockNote::unpack(array::subarray(packed_note.storage(), 0));\n let note_hash = note.compute_note_hash(owner, storage_slot, randomness);\n\n let note_hash_for_nullification = compute_note_hash_for_nullification(\n HintedNote {\n note,\n contract_address,\n owner,\n randomness,\n storage_slot,\n metadata: SettledNoteMetadata::new(note_nonce).into(),\n },\n );\n\n let inner_nullifier = note.compute_nullifier_unconstrained(owner, note_hash_for_nullification);\n\n Option::some(NoteHashAndNullifier { note_hash, inner_nullifier })\n } else {\n Option::none()\n }\n }\n\n global VALUE: Field = 7;\n global FIRST_NULLIFIER_IN_TX: Field = 47;\n global CONTRACT_ADDRESS: AztecAddress = AztecAddress::from_field(13);\n global OWNER: AztecAddress = AztecAddress::from_field(14);\n global STORAGE_SLOT: Field = 99;\n global RANDOMNESS: Field = 99;\n\n #[test]\n unconstrained fn no_note_hashes() {\n let unique_note_hashes_in_tx = BoundedVec::new();\n let packed_note = BoundedVec::new();\n\n let discovered_notes = attempt_note_nonce_discovery(\n unique_note_hashes_in_tx,\n FIRST_NULLIFIER_IN_TX,\n compute_note_hash_and_nullifier,\n CONTRACT_ADDRESS,\n OWNER,\n STORAGE_SLOT,\n RANDOMNESS,\n MockNote::get_id(),\n packed_note,\n );\n\n assert_eq(discovered_notes.len(), 0);\n }\n\n #[test(should_fail_with = \"Failed to compute a note hash\")]\n unconstrained fn failed_hash_computation() {\n let unique_note_hashes_in_tx = BoundedVec::from_array([random()]);\n let packed_note = BoundedVec::new();\n let note_type_id = 0; // This note type id is unknown to compute_note_hash_and_nullifier\n\n let discovered_notes = attempt_note_nonce_discovery(\n unique_note_hashes_in_tx,\n FIRST_NULLIFIER_IN_TX,\n compute_note_hash_and_nullifier,\n CONTRACT_ADDRESS,\n OWNER,\n STORAGE_SLOT,\n RANDOMNESS,\n note_type_id,\n packed_note,\n );\n\n assert_eq(discovered_notes.len(), 0);\n }\n\n struct NoteAndData {\n note: MockNote,\n note_nonce: Field,\n note_hash: Field,\n unique_note_hash: Field,\n inner_nullifier: Field,\n }\n\n unconstrained fn construct_note(value: Field, note_index_in_tx: u32) -> NoteAndData {\n let note_nonce = compute_note_hash_nonce(FIRST_NULLIFIER_IN_TX, note_index_in_tx);\n\n let hinted_note = MockNote::new(value)\n .contract_address(CONTRACT_ADDRESS)\n .owner(OWNER)\n .randomness(RANDOMNESS)\n .storage_slot(STORAGE_SLOT)\n .note_metadata(SettledNoteMetadata::new(note_nonce).into())\n .build_hinted_note();\n let note = hinted_note.note;\n\n let note_hash = note.compute_note_hash(OWNER, STORAGE_SLOT, RANDOMNESS);\n let unique_note_hash = compute_unique_note_hash(\n note_nonce,\n compute_siloed_note_hash(CONTRACT_ADDRESS, note_hash),\n );\n let inner_nullifier =\n note.compute_nullifier_unconstrained(OWNER, compute_note_hash_for_nullification(hinted_note));\n\n NoteAndData { note, note_nonce, note_hash, unique_note_hash, inner_nullifier }\n }\n\n #[test]\n unconstrained fn single_note() {\n let note_index_in_tx = 2;\n let note_and_data = construct_note(VALUE, note_index_in_tx);\n\n let mut unique_note_hashes_in_tx = BoundedVec::from_array([\n random(), random(), random(), random(), random(), random(), random(),\n ]);\n unique_note_hashes_in_tx.set(note_index_in_tx, note_and_data.unique_note_hash);\n\n let discovered_notes = attempt_note_nonce_discovery(\n unique_note_hashes_in_tx,\n FIRST_NULLIFIER_IN_TX,\n compute_note_hash_and_nullifier,\n CONTRACT_ADDRESS,\n OWNER,\n STORAGE_SLOT,\n RANDOMNESS,\n MockNote::get_id(),\n BoundedVec::from_array(note_and_data.note.pack()),\n );\n\n assert_eq(discovered_notes.len(), 1);\n let discovered_note = discovered_notes.get(0);\n\n assert_eq(discovered_note.note_nonce, note_and_data.note_nonce);\n assert_eq(discovered_note.note_hash, note_and_data.note_hash);\n assert_eq(discovered_note.inner_nullifier, note_and_data.inner_nullifier);\n }\n\n #[test]\n unconstrained fn multiple_notes_same_preimage() {\n let first_note_index_in_tx = 3;\n let first_note_and_data = construct_note(VALUE, first_note_index_in_tx);\n\n let second_note_index_in_tx = 5;\n let second_note_and_data = construct_note(VALUE, second_note_index_in_tx);\n\n // Both notes have the same preimage (and therefore packed representation), so both should be found in the same\n // call.\n assert_eq(first_note_and_data.note, second_note_and_data.note);\n let packed_note = first_note_and_data.note.pack();\n\n let mut unique_note_hashes_in_tx = BoundedVec::from_array([\n random(), random(), random(), random(), random(), random(), random(),\n ]);\n unique_note_hashes_in_tx.set(first_note_index_in_tx, first_note_and_data.unique_note_hash);\n unique_note_hashes_in_tx.set(second_note_index_in_tx, second_note_and_data.unique_note_hash);\n\n let discovered_notes = attempt_note_nonce_discovery(\n unique_note_hashes_in_tx,\n FIRST_NULLIFIER_IN_TX,\n compute_note_hash_and_nullifier,\n CONTRACT_ADDRESS,\n OWNER,\n STORAGE_SLOT,\n RANDOMNESS,\n MockNote::get_id(),\n BoundedVec::from_array(packed_note),\n );\n\n assert_eq(discovered_notes.len(), 2);\n\n assert(discovered_notes.any(|discovered_note| {\n (discovered_note.note_nonce == first_note_and_data.note_nonce)\n & (discovered_note.note_hash == first_note_and_data.note_hash)\n & (discovered_note.inner_nullifier == first_note_and_data.inner_nullifier)\n }));\n\n assert(discovered_notes.any(|discovered_note| {\n (discovered_note.note_nonce == second_note_and_data.note_nonce)\n & (discovered_note.note_hash == second_note_and_data.note_hash)\n & (discovered_note.inner_nullifier == second_note_and_data.inner_nullifier)\n }));\n }\n}\n"
|
|
3382
|
-
},
|
|
3383
|
-
"124": {
|
|
3384
|
-
"path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/messages/discovery/partial_notes.nr",
|
|
3385
|
-
"source": "use crate::{\n capsules::CapsuleArray,\n messages::{\n discovery::{ComputeNoteHashAndNullifier, nonce_discovery::attempt_note_nonce_discovery},\n encoding::MAX_MESSAGE_CONTENT_LEN,\n logs::partial_note::{decode_partial_note_private_message, MAX_PARTIAL_NOTE_PRIVATE_PACKED_LEN},\n processing::{\n enqueue_note_for_validation, get_pending_partial_notes_completion_logs,\n log_retrieval_response::LogRetrievalResponse,\n },\n },\n utils::array,\n};\n\nuse crate::protocol::{\n address::AztecAddress,\n debug_log::debug_log_format,\n hash::sha256_to_field,\n traits::{Deserialize, Serialize},\n};\n\n/// The slot in the PXE capsules where we store a `CapsuleArray` of `DeliveredPendingPartialNote`.\npub global DELIVERED_PENDING_PARTIAL_NOTE_ARRAY_LENGTH_CAPSULES_SLOT: Field = sha256_to_field(\n \"AZTEC_NR::DELIVERED_PENDING_PARTIAL_NOTE_ARRAY_LENGTH_CAPSULES_SLOT\".as_bytes(),\n);\n\n/// A partial note that was delivered but is still pending completion. Contains the information necessary to find the\n/// log that will complete it and lead to a note being discovered and delivered.\n#[derive(Serialize, Deserialize)]\npub(crate) struct DeliveredPendingPartialNote {\n pub(crate) owner: AztecAddress,\n pub(crate) storage_slot: Field,\n pub(crate) randomness: Field,\n pub(crate) note_completion_log_tag: Field,\n pub(crate) note_type_id: Field,\n pub(crate) packed_private_note_content: BoundedVec<Field, MAX_PARTIAL_NOTE_PRIVATE_PACKED_LEN>,\n pub(crate) recipient: AztecAddress,\n}\n\npub unconstrained fn process_partial_note_private_msg(\n contract_address: AztecAddress,\n recipient: AztecAddress,\n msg_metadata: u64,\n msg_content: BoundedVec<Field, MAX_MESSAGE_CONTENT_LEN>,\n) {\n // We store the information of the partial note we found in a persistent capsule in PXE, so that we can later\n // search for the public log that will complete it.\n let (owner, storage_slot, randomness, note_completion_log_tag, note_type_id, packed_private_note_content) =\n decode_partial_note_private_message(msg_metadata, msg_content);\n\n let pending = DeliveredPendingPartialNote {\n owner,\n storage_slot,\n randomness,\n note_completion_log_tag,\n note_type_id,\n packed_private_note_content,\n recipient,\n };\n\n CapsuleArray::at(\n contract_address,\n DELIVERED_PENDING_PARTIAL_NOTE_ARRAY_LENGTH_CAPSULES_SLOT,\n )\n .push(pending);\n}\n\n/// Searches for logs that would result in the completion of pending partial notes, ultimately resulting in the notes\n/// being delivered to PXE if completed.\npub unconstrained fn fetch_and_process_partial_note_completion_logs<Env>(\n contract_address: AztecAddress,\n compute_note_hash_and_nullifier: ComputeNoteHashAndNullifier<Env>,\n) {\n let pending_partial_notes = CapsuleArray::at(\n contract_address,\n DELIVERED_PENDING_PARTIAL_NOTE_ARRAY_LENGTH_CAPSULES_SLOT,\n );\n\n debug_log_format(\n \"{} pending partial notes\",\n [pending_partial_notes.len() as Field],\n );\n\n // Each of the pending partial notes might get completed by a log containing its public values. For performance\n // reasons, we fetch all of these logs concurrently and then process them one by one, minimizing the amount of time\n // waiting for the node roundtrip.\n let maybe_completion_logs = get_pending_partial_notes_completion_logs(contract_address, pending_partial_notes);\n\n // Each entry in the maybe completion logs array corresponds to the entry in the pending partial notes array at the\n // same index. This means we can use the same index as we iterate through the responses to get both the partial\n // note and the log that might complete it.\n assert_eq(maybe_completion_logs.len(), pending_partial_notes.len());\n\n maybe_completion_logs.for_each(|i, maybe_log: Option<LogRetrievalResponse>| {\n // We clear the completion logs as we read them so that the array is empty by the time we next query it.\n // TODO(#14943): use volatile arrays to avoid having to manually clear this.\n maybe_completion_logs.remove(i);\n\n let pending_partial_note = pending_partial_notes.get(i);\n\n if maybe_log.is_none() {\n debug_log_format(\n \"Found no completion logs for partial note with tag {}\",\n [pending_partial_note.note_completion_log_tag],\n );\n\n // Note that we're not removing the pending partial note from the capsule array, so we will continue\n // searching for this tagged log when performing message discovery in the future until we either find it or\n // the entry is somehow removed from the array.\n } else {\n debug_log_format(\n \"Completion log found for partial note with tag {}\",\n [pending_partial_note.note_completion_log_tag],\n );\n let log = maybe_log.unwrap();\n\n // Public fields are assumed to all be placed at the end of the packed representation, so we combine the\n // private and public packed fields (i.e. the contents of the private message and public log plaintext to\n // get the complete packed content.\n let complete_packed_note = array::append(\n pending_partial_note.packed_private_note_content,\n log.log_payload,\n );\n\n let discovered_notes = attempt_note_nonce_discovery(\n log.unique_note_hashes_in_tx,\n log.first_nullifier_in_tx,\n compute_note_hash_and_nullifier,\n contract_address,\n pending_partial_note.owner,\n pending_partial_note.storage_slot,\n pending_partial_note.randomness,\n pending_partial_note.note_type_id,\n complete_packed_note,\n );\n\n // TODO(#11627): is there anything reasonable we can do if we get a log but it doesn't result in a note\n // being found?\n if discovered_notes.len() == 0 {\n panic(\n f\"A partial note's completion log did not result in any notes being found - this should never happen\",\n );\n }\n\n debug_log_format(\n \"Discovered {0} notes for partial note with tag {1}\",\n [discovered_notes.len() as Field, pending_partial_note.note_completion_log_tag],\n );\n\n discovered_notes.for_each(|discovered_note| {\n enqueue_note_for_validation(\n contract_address,\n pending_partial_note.owner,\n pending_partial_note.storage_slot,\n pending_partial_note.randomness,\n discovered_note.note_nonce,\n complete_packed_note,\n discovered_note.note_hash,\n discovered_note.inner_nullifier,\n log.tx_hash,\n pending_partial_note.recipient,\n );\n });\n\n // Because there is only a single log for a given tag, once we've processed the tagged log then we simply\n // delete the pending work entry, regardless of whether it was actually completed or not.\n pending_partial_notes.remove(i);\n }\n });\n}\n"
|
|
3386
|
-
},
|
|
3387
|
-
"125": {
|
|
3388
|
-
"path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/messages/discovery/private_events.nr",
|
|
3389
|
-
"source": "use crate::{\n event::event_interface::compute_private_serialized_event_commitment,\n messages::{\n encoding::MAX_MESSAGE_CONTENT_LEN, logs::event::decode_private_event_message,\n processing::enqueue_event_for_validation,\n },\n};\nuse crate::protocol::{address::AztecAddress, traits::ToField};\n\npub unconstrained fn process_private_event_msg(\n contract_address: AztecAddress,\n recipient: AztecAddress,\n msg_metadata: u64,\n msg_content: BoundedVec<Field, MAX_MESSAGE_CONTENT_LEN>,\n tx_hash: Field,\n) {\n let (event_type_id, randomness, serialized_event) = decode_private_event_message(msg_metadata, msg_content);\n\n let event_commitment =\n compute_private_serialized_event_commitment(serialized_event, randomness, event_type_id.to_field());\n\n enqueue_event_for_validation(\n contract_address,\n event_type_id,\n randomness,\n serialized_event,\n event_commitment,\n tx_hash,\n recipient,\n );\n}\n"
|
|
3390
|
-
},
|
|
3391
|
-
"126": {
|
|
3392
|
-
"path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/messages/discovery/private_notes.nr",
|
|
3393
|
-
"source": "use crate::messages::{\n discovery::{ComputeNoteHashAndNullifier, nonce_discovery::attempt_note_nonce_discovery},\n encoding::MAX_MESSAGE_CONTENT_LEN,\n logs::note::{decode_private_note_message, MAX_NOTE_PACKED_LEN},\n processing::enqueue_note_for_validation,\n};\nuse crate::protocol::{address::AztecAddress, constants::MAX_NOTE_HASHES_PER_TX, debug_log::debug_log_format};\n\npub unconstrained fn process_private_note_msg<Env>(\n contract_address: AztecAddress,\n tx_hash: Field,\n unique_note_hashes_in_tx: BoundedVec<Field, MAX_NOTE_HASHES_PER_TX>,\n first_nullifier_in_tx: Field,\n recipient: AztecAddress,\n compute_note_hash_and_nullifier: ComputeNoteHashAndNullifier<Env>,\n msg_metadata: u64,\n msg_content: BoundedVec<Field, MAX_MESSAGE_CONTENT_LEN>,\n) {\n let (note_type_id, owner, storage_slot, randomness, packed_note) =\n decode_private_note_message(msg_metadata, msg_content);\n\n attempt_note_discovery(\n contract_address,\n tx_hash,\n unique_note_hashes_in_tx,\n first_nullifier_in_tx,\n recipient,\n compute_note_hash_and_nullifier,\n owner,\n storage_slot,\n randomness,\n note_type_id,\n packed_note,\n );\n}\n\n/// Attempts discovery of a note given information about its contents and the transaction in which it is suspected the\n/// note was created.\npub unconstrained fn attempt_note_discovery<Env>(\n contract_address: AztecAddress,\n tx_hash: Field,\n unique_note_hashes_in_tx: BoundedVec<Field, MAX_NOTE_HASHES_PER_TX>,\n first_nullifier_in_tx: Field,\n recipient: AztecAddress,\n compute_note_hash_and_nullifier: ComputeNoteHashAndNullifier<Env>,\n owner: AztecAddress,\n storage_slot: Field,\n randomness: Field,\n note_type_id: Field,\n packed_note: BoundedVec<Field, MAX_NOTE_PACKED_LEN>,\n) {\n let discovered_notes = attempt_note_nonce_discovery(\n unique_note_hashes_in_tx,\n first_nullifier_in_tx,\n compute_note_hash_and_nullifier,\n contract_address,\n owner,\n storage_slot,\n randomness,\n note_type_id,\n packed_note,\n );\n\n debug_log_format(\n \"Discovered {0} notes from a private message\",\n [discovered_notes.len() as Field],\n );\n\n discovered_notes.for_each(|discovered_note| {\n enqueue_note_for_validation(\n contract_address,\n owner,\n storage_slot,\n randomness,\n discovered_note.note_nonce,\n packed_note,\n discovered_note.note_hash,\n discovered_note.inner_nullifier,\n tx_hash,\n recipient,\n );\n });\n}\n"
|
|
3394
|
-
},
|
|
3395
|
-
"127": {
|
|
3396
|
-
"path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/messages/discovery/process_message.nr",
|
|
3397
|
-
"source": "use crate::messages::{\n discovery::{\n ComputeNoteHashAndNullifier, partial_notes::process_partial_note_private_msg,\n private_events::process_private_event_msg, private_notes::process_private_note_msg,\n },\n encoding::{decode_message, MESSAGE_CIPHERTEXT_LEN, MESSAGE_PLAINTEXT_LEN},\n encryption::{aes128::AES128, message_encryption::MessageEncryption},\n msg_type::{PARTIAL_NOTE_PRIVATE_MSG_TYPE_ID, PRIVATE_EVENT_MSG_TYPE_ID, PRIVATE_NOTE_MSG_TYPE_ID},\n processing::MessageContext,\n};\n\nuse crate::protocol::{address::AztecAddress, debug_log::{debug_log, debug_log_format}};\n\n/// Processes a message that can contain notes, partial notes, or events.\n///\n/// Notes result in nonce discovery being performed prior to delivery, which requires knowledge of the transaction hash\n/// in which the notes would've been created (typically the same transaction in which the log was emitted), along with\n/// the list of unique note hashes in said transaction and the `compute_note_hash_and_nullifier` function. Once\n/// discovered, the notes are enqueued for validation.\n///\n/// Partial notes result in a pending partial note entry being stored in a PXE capsule, which will later be retrieved\n/// to search for the note's completion public log.\n///\n/// Events are processed by computing an event commitment from the serialized event data and its randomness field, then\n/// enqueueing the event data and commitment for validation.\npub unconstrained fn process_message_ciphertext<Env>(\n contract_address: AztecAddress,\n compute_note_hash_and_nullifier: ComputeNoteHashAndNullifier<Env>,\n message_ciphertext: BoundedVec<Field, MESSAGE_CIPHERTEXT_LEN>,\n message_context: MessageContext,\n) {\n let message_plaintext_option = AES128::decrypt(message_ciphertext, message_context.recipient);\n\n if message_plaintext_option.is_some() {\n process_message_plaintext(\n contract_address,\n compute_note_hash_and_nullifier,\n message_plaintext_option.unwrap(),\n message_context,\n );\n } else {\n debug_log_format(\n \"Found invalid message from tx {0}, ignoring\",\n [message_context.tx_hash],\n );\n }\n}\n\npub unconstrained fn process_message_plaintext<Env>(\n contract_address: AztecAddress,\n compute_note_hash_and_nullifier: ComputeNoteHashAndNullifier<Env>,\n message_plaintext: BoundedVec<Field, MESSAGE_PLAINTEXT_LEN>,\n message_context: MessageContext,\n) {\n // The first thing to do after decrypting the message is to determine what type of message we're processing. We\n // have 3 message types: private notes, partial notes and events.\n\n // We decode the message to obtain the message type id, metadata and content.\n let (msg_type_id, msg_metadata, msg_content) = decode_message(message_plaintext);\n\n if msg_type_id == PRIVATE_NOTE_MSG_TYPE_ID {\n debug_log(\"Processing private note msg\");\n\n process_private_note_msg(\n contract_address,\n message_context.tx_hash,\n message_context.unique_note_hashes_in_tx,\n message_context.first_nullifier_in_tx,\n message_context.recipient,\n compute_note_hash_and_nullifier,\n msg_metadata,\n msg_content,\n );\n } else if msg_type_id == PARTIAL_NOTE_PRIVATE_MSG_TYPE_ID {\n debug_log(\"Processing partial note private msg\");\n\n process_partial_note_private_msg(\n contract_address,\n message_context.recipient,\n msg_metadata,\n msg_content,\n );\n } else if msg_type_id == PRIVATE_EVENT_MSG_TYPE_ID {\n debug_log(\"Processing private event msg\");\n\n process_private_event_msg(\n contract_address,\n message_context.recipient,\n msg_metadata,\n msg_content,\n message_context.tx_hash,\n );\n } else {\n debug_log_format(\"Unknown msg type id {0}\", [msg_type_id as Field]);\n }\n}\n"
|
|
3398
|
-
},
|
|
3399
|
-
"128": {
|
|
3400
|
-
"path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/messages/encoding.nr",
|
|
3401
|
-
"source": "// TODO(#12750): don't make these values assume we're using AES.\nuse crate::protocol::constants::PRIVATE_LOG_CIPHERTEXT_LEN;\nuse crate::utils::array;\n\n// We reassign to the constant here to communicate the distinction between a log and a message. In Aztec.nr, unlike in\n// protocol circuits, we have a concept of a message that can be emitted either as a private log or as an offchain\n// message. Message is a piece of data that is to be eventually delivered to a contract via the `process_message(...)`\n// utility function function that is injected by the #[aztec] macro. Note: PRIVATE_LOG_CIPHERTEXT_LEN is an amount of\n// fields, so MESSAGE_CIPHERTEXT_LEN is the size of the message in fields.\npub global MESSAGE_CIPHERTEXT_LEN: u32 = PRIVATE_LOG_CIPHERTEXT_LEN;\n\n// TODO(#12750): The global variables below should not be here as they are AES128 specific. ciphertext_length (2) + 14\n// bytes pkcs#7 AES padding.\npub(crate) global HEADER_CIPHERTEXT_SIZE_IN_BYTES: u32 = 16;\n\npub global EPH_PK_X_SIZE_IN_FIELDS: u32 = 1;\npub global EPH_PK_SIGN_BYTE_SIZE_IN_BYTES: u32 = 1;\n\n// (17 - 1) * 31 - 16 - 1 = 479 Note: We multiply by 31 because ciphertext bytes are stored in fields using\n// bytes_to_fields, which packs 31 bytes per field (since a Field is ~254 bits and can safely store 31 whole bytes).\nglobal MESSAGE_PLAINTEXT_SIZE_IN_BYTES: u32 = (MESSAGE_CIPHERTEXT_LEN - EPH_PK_X_SIZE_IN_FIELDS) * 31\n - HEADER_CIPHERTEXT_SIZE_IN_BYTES\n - EPH_PK_SIGN_BYTE_SIZE_IN_BYTES;\n// The plaintext bytes represent Field values that were originally serialized using fields_to_bytes, which converts\n// each Field to 32 bytes. To convert the plaintext bytes back to fields, we divide by 32. 479 / 32 = 14\npub global MESSAGE_PLAINTEXT_LEN: u32 = MESSAGE_PLAINTEXT_SIZE_IN_BYTES / 32;\n\npub global MESSAGE_EXPANDED_METADATA_LEN: u32 = 1;\n\n// The standard message layout is composed of:\n// - an initial field called the 'expanded metadata'\n// - an arbitrary number of fields following that called the 'message content'\n//\n// ```\n// message: [ msg_expanded_metadata, ...msg_content ]\n// ```\n//\n// The expanded metadata itself is interpreted as a u128, of which:\n// - the upper 64 bits are the message type id\n// - the lower 64 bits are called the 'message metadata'\n//\n// ```\n// msg_expanded_metadata: [ msg_type_id | msg_metadata ]\n// <--- 64 bits --->|<--- 64 bits --->\n// ```\n//\n// The meaning of the message metadata and message content depend on the value of the message type id. Note that there\n// is nothing special about the message metadata, it _can_ be considered part of the content. It just has a different\n// name to make it distinct from the message content given that it is not a full field.\n\n/// The maximum length of a message's content, i.e. not including the expanded message metadata.\npub global MAX_MESSAGE_CONTENT_LEN: u32 = MESSAGE_PLAINTEXT_LEN - MESSAGE_EXPANDED_METADATA_LEN;\n\n/// Encodes a message following aztec-nr's standard message encoding. This message can later be decoded with\n/// `decode_message` to retrieve the original values.\n///\n/// - The `msg_type` is an identifier that groups types of messages that are all processed the same way, e.g. private\n/// notes or events. Possible values are defined in `aztec::messages::msg_type`.\n/// - The `msg_metadata` and `msg_content` are the values stored in the message, whose meaning depends on the\n/// `msg_type`. The only special thing about `msg_metadata` that separates it from `msg_content` is that it is a u64\n/// instead of a full Field (due to details of how messages are encoded), allowing applications that can fit values\n/// into this smaller variable to achieve higher data efficiency.\npub fn encode_message<let N: u32>(\n msg_type: u64,\n msg_metadata: u64,\n msg_content: [Field; N],\n) -> [Field; (N + MESSAGE_EXPANDED_METADATA_LEN)] {\n std::static_assert(\n msg_content.len() <= MAX_MESSAGE_CONTENT_LEN,\n \"Invalid message content: it must have a length of at most MAX_MESSAGE_CONTENT_LEN\",\n );\n\n // If MESSAGE_EXPANDED_METADATA_LEN is changed, causing the assertion below to fail, then the destructuring of the\n // message encoding below must be updated as well.\n std::static_assert(\n MESSAGE_EXPANDED_METADATA_LEN == 1,\n \"unexpected value for MESSAGE_EXPANDED_METADATA_LEN\",\n );\n let mut message: [Field; (N + MESSAGE_EXPANDED_METADATA_LEN)] = std::mem::zeroed();\n\n message[0] = to_expanded_metadata(msg_type, msg_metadata);\n for i in 0..msg_content.len() {\n message[MESSAGE_EXPANDED_METADATA_LEN + i] = msg_content[i];\n }\n\n message\n}\n\n/// Decodes a standard aztec-nr message, i.e. one created via `encode_message`, returning the original encoded values.\n///\n/// Note that `encode_message` returns a fixed size array while this function takes a `BoundedVec`: this is because\n/// prior to decoding the message type is unknown, and consequentially not known at compile time. If working with\n/// fixed-size messages, consider using `BoundedVec::from_array` to convert them.\npub unconstrained fn decode_message(\n message: BoundedVec<Field, MESSAGE_PLAINTEXT_LEN>,\n) -> (u64, u64, BoundedVec<Field, MAX_MESSAGE_CONTENT_LEN>) {\n assert(\n message.len() >= MESSAGE_EXPANDED_METADATA_LEN,\n f\"Invalid message: it must have at least {MESSAGE_EXPANDED_METADATA_LEN} fields\",\n );\n\n // If MESSAGE_EXPANDED_METADATA_LEN is changed, causing the assertion below to fail, then the destructuring of the\n // message encoding below must be updated as well.\n std::static_assert(\n MESSAGE_EXPANDED_METADATA_LEN == 1,\n \"unexpected value for MESSAGE_EXPANDED_METADATA_LEN\",\n );\n\n let msg_expanded_metadata = message.get(0);\n let (msg_type_id, msg_metadata) = from_expanded_metadata(msg_expanded_metadata);\n let msg_content = array::subbvec(message, MESSAGE_EXPANDED_METADATA_LEN);\n\n (msg_type_id, msg_metadata, msg_content)\n}\n\nglobal U64_SHIFT_MULTIPLIER: Field = 2.pow_32(64);\n\nfn to_expanded_metadata(msg_type: u64, msg_metadata: u64) -> Field {\n // We use multiplication instead of bit shifting operations to shift the type bits as bit shift operations are\n // expensive in circuits.\n let type_field: Field = (msg_type as Field) * U64_SHIFT_MULTIPLIER;\n let msg_metadata_field = msg_metadata as Field;\n\n type_field + msg_metadata_field\n}\n\nfn from_expanded_metadata(input: Field) -> (u64, u64) {\n input.assert_max_bit_size::<128>();\n let msg_metadata = (input as u64);\n let msg_type = ((input - (msg_metadata as Field)) / U64_SHIFT_MULTIPLIER) as u64;\n // Use division instead of bit shift since bit shifts are expensive in circuits\n (msg_type, msg_metadata)\n}\n\nmod tests {\n use crate::utils::array::subarray::subarray;\n use super::{decode_message, encode_message, from_expanded_metadata, MAX_MESSAGE_CONTENT_LEN, to_expanded_metadata};\n\n global U64_MAX: u64 = (2.pow_32(64) - 1) as u64;\n global U128_MAX: Field = (2.pow_32(128) - 1);\n\n #[test]\n unconstrained fn encode_decode_empty_message(msg_type: u64, msg_metadata: u64) {\n let encoded = encode_message(msg_type, msg_metadata, []);\n let (decoded_msg_type, decoded_msg_metadata, decoded_msg_content) =\n decode_message(BoundedVec::from_array(encoded));\n\n assert_eq(decoded_msg_type, msg_type);\n assert_eq(decoded_msg_metadata, msg_metadata);\n assert_eq(decoded_msg_content.len(), 0);\n }\n\n #[test]\n unconstrained fn encode_decode_short_message(\n msg_type: u64,\n msg_metadata: u64,\n msg_content: [Field; MAX_MESSAGE_CONTENT_LEN / 2],\n ) {\n let encoded = encode_message(msg_type, msg_metadata, msg_content);\n let (decoded_msg_type, decoded_msg_metadata, decoded_msg_content) =\n decode_message(BoundedVec::from_array(encoded));\n\n assert_eq(decoded_msg_type, msg_type);\n assert_eq(decoded_msg_metadata, msg_metadata);\n assert_eq(decoded_msg_content.len(), msg_content.len());\n assert_eq(subarray(decoded_msg_content.storage(), 0), msg_content);\n }\n\n #[test]\n unconstrained fn encode_decode_full_message(\n msg_type: u64,\n msg_metadata: u64,\n msg_content: [Field; MAX_MESSAGE_CONTENT_LEN],\n ) {\n let encoded = encode_message(msg_type, msg_metadata, msg_content);\n let (decoded_msg_type, decoded_msg_metadata, decoded_msg_content) =\n decode_message(BoundedVec::from_array(encoded));\n\n assert_eq(decoded_msg_type, msg_type);\n assert_eq(decoded_msg_metadata, msg_metadata);\n assert_eq(decoded_msg_content.len(), msg_content.len());\n assert_eq(subarray(decoded_msg_content.storage(), 0), msg_content);\n }\n\n #[test]\n unconstrained fn to_expanded_metadata_packing() {\n // Test case 1: All bits set\n let packed = to_expanded_metadata(U64_MAX, U64_MAX);\n let (msg_type, msg_metadata) = from_expanded_metadata(packed);\n assert_eq(msg_type, U64_MAX);\n assert_eq(msg_metadata, U64_MAX);\n\n // Test case 2: Only log type bits set\n let packed = to_expanded_metadata(U64_MAX, 0);\n let (msg_type, msg_metadata) = from_expanded_metadata(packed);\n assert_eq(msg_type, U64_MAX);\n assert_eq(msg_metadata, 0);\n\n // Test case 3: Only msg_metadata bits set\n let packed = to_expanded_metadata(0, U64_MAX);\n let (msg_type, msg_metadata) = from_expanded_metadata(packed);\n assert_eq(msg_type, 0);\n assert_eq(msg_metadata, U64_MAX);\n\n // Test case 4: No bits set\n let packed = to_expanded_metadata(0, 0);\n let (msg_type, msg_metadata) = from_expanded_metadata(packed);\n assert_eq(msg_type, 0);\n assert_eq(msg_metadata, 0);\n }\n\n #[test]\n unconstrained fn from_expanded_metadata_packing() {\n // Test case 1: All bits set\n let input = U128_MAX as Field;\n let (msg_type, msg_metadata) = from_expanded_metadata(input);\n assert_eq(msg_type, U64_MAX);\n assert_eq(msg_metadata, U64_MAX);\n\n // Test case 2: Only log type bits set\n let input = (U128_MAX - U64_MAX as Field);\n let (msg_type, msg_metadata) = from_expanded_metadata(input);\n assert_eq(msg_type, U64_MAX);\n assert_eq(msg_metadata, 0);\n\n // Test case 3: Only msg_metadata bits set\n let input = U64_MAX as Field;\n let (msg_type, msg_metadata) = from_expanded_metadata(input);\n assert_eq(msg_type, 0);\n assert_eq(msg_metadata, U64_MAX);\n\n // Test case 4: No bits set\n let input = 0;\n let (msg_type, msg_metadata) = from_expanded_metadata(input);\n assert_eq(msg_type, 0);\n assert_eq(msg_metadata, 0);\n }\n\n #[test]\n unconstrained fn to_from_expanded_metadata(original_msg_type: u64, original_msg_metadata: u64) {\n let packed = to_expanded_metadata(original_msg_type, original_msg_metadata);\n let (unpacked_msg_type, unpacked_msg_metadata) = from_expanded_metadata(packed);\n\n assert_eq(original_msg_type, unpacked_msg_type);\n assert_eq(original_msg_metadata, unpacked_msg_metadata);\n }\n}\n"
|
|
3402
|
-
},
|
|
3403
|
-
"129": {
|
|
3404
|
-
"path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/messages/encryption/aes128.nr",
|
|
3405
|
-
"source": "use crate::protocol::{\n address::AztecAddress,\n constants::{DOM_SEP__SYMMETRIC_KEY, DOM_SEP__SYMMETRIC_KEY_2},\n hash::poseidon2_hash_with_separator,\n point::Point,\n public_keys::AddressPoint,\n};\n\nuse crate::{\n keys::{ecdh_shared_secret::derive_ecdh_shared_secret, ephemeral::generate_ephemeral_key_pair},\n messages::{\n encoding::{\n EPH_PK_SIGN_BYTE_SIZE_IN_BYTES, EPH_PK_X_SIZE_IN_FIELDS, HEADER_CIPHERTEXT_SIZE_IN_BYTES,\n MESSAGE_CIPHERTEXT_LEN, MESSAGE_PLAINTEXT_LEN,\n },\n encryption::message_encryption::MessageEncryption,\n logs::arithmetic_generics_utils::{\n get_arr_of_size__message_bytes__from_PT, get_arr_of_size__message_bytes_padding__from_PT,\n },\n },\n oracle::{aes128_decrypt::aes128_decrypt_oracle, random::random, shared_secret::get_shared_secret},\n utils::{\n array,\n conversion::{\n bytes_to_fields::{bytes_from_fields, bytes_to_fields},\n fields_to_bytes::{fields_from_bytes, fields_to_bytes},\n },\n point::{get_sign_of_point, point_from_x_coord_and_sign},\n random::get_random_bytes,\n },\n};\n\nuse std::aes128::aes128_encrypt;\n\n/// Computes N close-to-uniformly-random 256 bits from a given ECDH shared_secret.\n///\n/// NEVER re-use the same iv and sym_key. DO NOT call this function more than once with the same shared_secret.\n///\n/// This function is only known to be safe if shared_secret is computed by combining a random ephemeral key with an\n/// address point. See big comment within the body of the function. See big comment within the body of the function.\nfn extract_many_close_to_uniformly_random_256_bits_from_ecdh_shared_secret_using_poseidon2_unsafe<let N: u32>(\n shared_secret: Point,\n) -> [[u8; 32]; N] {\n /*\n * Unsafe because of https://eprint.iacr.org/2010/264.pdf Page 13, Lemma 2 (and the * two\n paragraphs below it).\n *\n * If you call this function, you need to be careful and aware of how the arg\n * `shared_secret` has been derived.\n *\n * The paper says that the way you derive aes keys and IVs should be fine with poseidon2\n * (modelled as a RO), as long as you _don't_ use Poseidon2 as a PRG to generate the * two\n exponents x & y which multiply to the shared secret S:\n *\n * S = [x*y]*G.\n *\n * (Otherwise, you would have to \"key\" poseidon2, i.e. generate a uniformly string K\n * which can be public and compute Hash(x) as poseidon(K,x)).\n * In that lemma, k would be 2*254=508, and m would be the number of points on the * grumpkin\n curve (which is close to r according to the Hasse bound).\n *\n * Our shared secret S is [esk * address_sk] * G, and the question is: * Can we compute hash(S)\n using poseidon2 instead of sha256?\n *\n * Well, esk is random and not generated with poseidon2, so that's good.\n * What about address_sk?\n * Well, address_sk = poseidon2(stuff) + ivsk, so there was some\n * discussion about whether address_sk is independent of poseidon2.\n * Given that ivsk is random and independent of poseidon2, the address_sk is also\n * independent of poseidon2.\n *\n * Tl;dr: we believe it's safe to hash S = [esk * address_sk] * G using poseidon2,\n * in order to derive a symmetric key.\n *\n * If you're calling this function for a differently-derived `shared_secret`, be\n * careful.\n *\n */\n \n\n /* The output of this function needs to be 32 random bytes.\n * A single field won't give us 32 bytes of entropy.\n * So we compute two \"random\" fields, by poseidon-hashing with two different\n * generators.\n * We then extract the last 16 (big endian) bytes of each \"random\" field.\n * Note: we use to_be_bytes because it's slightly more efficient. But we have to\n * be careful not to take bytes from the \"big end\", because the \"big\" byte is\n * not uniformly random over the byte: it only has < 6 bits of randomness, because\n * it's the big end of a 254-bit field element.\n */\n\n let mut all_bytes: [[u8; 32]; N] = std::mem::zeroed();\n // We restrict N to be < 2^8, because of how we compute the domain separator from k below (where k <= N must be 8\n // bits). In practice, it's extremely unlikely that an app will want to compute >= 256 ciphertexts.\n std::static_assert(N < 256, \"N too large\");\n for k in 0..N {\n // We augment the domain separator with the loop index, so that we can generate N lots of randomness.\n let k_shift = (k as u16 << 8);\n let separator_1 = k_shift + DOM_SEP__SYMMETRIC_KEY as u16;\n let separator_2 = k_shift + DOM_SEP__SYMMETRIC_KEY_2 as u16;\n\n let rand1: Field = poseidon2_hash_with_separator([shared_secret.x, shared_secret.y], separator_1);\n let rand2: Field = poseidon2_hash_with_separator([shared_secret.x, shared_secret.y], separator_2);\n\n let rand1_bytes: [u8; 32] = rand1.to_be_bytes();\n let rand2_bytes: [u8; 32] = rand2.to_be_bytes();\n\n let mut bytes: [u8; 32] = [0; 32];\n for i in 0..16 {\n // We take bytes from the \"little end\" of the be-bytes arrays:\n let j = 32 - i - 1;\n bytes[i] = rand1_bytes[j];\n bytes[16 + i] = rand2_bytes[j];\n }\n\n all_bytes[k] = bytes;\n }\n\n all_bytes\n}\n\nfn derive_aes_symmetric_key_and_iv_from_uniformly_random_256_bits<let N: u32>(\n many_random_256_bits: [[u8; 32]; N],\n) -> [([u8; 16], [u8; 16]); N] {\n // Many (sym_key, iv) pairs:\n let mut many_pairs: [([u8; 16], [u8; 16]); N] = std::mem::zeroed();\n for k in 0..N {\n let random_256_bits = many_random_256_bits[k];\n let mut sym_key = [0; 16];\n let mut iv = [0; 16];\n for i in 0..16 {\n sym_key[i] = random_256_bits[i];\n iv[i] = random_256_bits[i + 16];\n }\n many_pairs[k] = (sym_key, iv);\n }\n\n many_pairs\n}\n\npub fn derive_aes_symmetric_key_and_iv_from_ecdh_shared_secret_using_poseidon2_unsafe<let N: u32>(\n shared_secret: Point,\n) -> [([u8; 16], [u8; 16]); N] {\n let many_random_256_bits: [[u8; 32]; N] =\n extract_many_close_to_uniformly_random_256_bits_from_ecdh_shared_secret_using_poseidon2_unsafe(shared_secret);\n\n derive_aes_symmetric_key_and_iv_from_uniformly_random_256_bits(many_random_256_bits)\n}\n\npub struct AES128 {}\n\nimpl MessageEncryption for AES128 {\n fn encrypt<let PlaintextLen: u32>(\n plaintext: [Field; PlaintextLen],\n recipient: AztecAddress,\n ) -> [Field; MESSAGE_CIPHERTEXT_LEN] {\n // AES 128 operates on bytes, not fields, so we need to convert the fields to bytes. (This process is then\n // reversed when processing the message in `process_message_ciphertext`)\n let plaintext_bytes = fields_to_bytes(plaintext);\n\n // ***************************************************************************** Compute the shared secret\n // *****************************************************************************\n\n let (eph_sk, eph_pk) = generate_ephemeral_key_pair();\n\n let eph_pk_sign_byte: u8 = get_sign_of_point(eph_pk) as u8;\n\n // (not to be confused with the tagging shared secret) TODO (#17158): Currently we unwrap the Option returned\n // by derive_ecdh_shared_secret. We need to handle the case where the ephemeral public key is invalid to\n // prevent potential DoS vectors.\n let ciphertext_shared_secret = derive_ecdh_shared_secret(\n eph_sk,\n recipient\n .to_address_point()\n .unwrap_or(\n // Safety: if the recipient is an invalid address, then it is not possible to encrypt a message for\n // them because we cannot establish a shared secret. This is never expected to occur during normal\n // operation. However, it is technically possible for us to receive an invalid address, and we must\n // therefore handle it. We could simply fail, but that'd introduce a potential security issue in\n // which an attacker forces a contract to encrypt a message for an invalid address, resulting in an\n // impossible transaction - this is sometimes called a 'king of the hill' attack. We choose instead\n // to not fail and encrypt the plaintext regardless using the shared secret that results from a\n // random valid address. The sender is free to choose this address and hence shared secret, but\n // this has no security implications as they already know not only the full plaintext but also the\n // ephemeral private key anyway.\n unsafe { random_address_point() },\n )\n .inner,\n );\n // TODO: also use this shared secret for deriving note randomness.\n\n // ***************************************************************************** Convert the plaintext into\n // whatever format the encryption function expects\n // *****************************************************************************\n\n // Already done for this strategy: AES expects bytes.\n\n // ***************************************************************************** Encrypt the plaintext\n // *****************************************************************************\n\n // It is safe to call the `unsafe` function here, because we know the `shared_secret` was derived using an\n // AztecAddress (the recipient). See the block comment at the start of this unsafe target function for more\n // info.\n let pairs = derive_aes_symmetric_key_and_iv_from_ecdh_shared_secret_using_poseidon2_unsafe::<2>(\n ciphertext_shared_secret,\n );\n let (body_sym_key, body_iv) = pairs[0];\n let (header_sym_key, header_iv) = pairs[1];\n\n let ciphertext_bytes = aes128_encrypt(plaintext_bytes, body_iv, body_sym_key);\n\n // |full_pt| = |pt_length| + |pt|\n // |pt_aes_padding| = 16 - (|full_pt| % 16)\n // or... since a % b is the same as a - b * (a // b) (integer division), so:\n // |pt_aes_padding| = 16 - (|full_pt| - 16 * (|full_pt| // 16))\n // |ct| = |full_pt| + |pt_aes_padding|\n // = |full_pt| + 16 - (|full_pt| - 16 * (|full_pt| // 16)) = 16 + 16 * (|full_pt| // 16) = 16 * (1 +\n // |full_pt| // 16)\n std::static_assert(\n ciphertext_bytes.len() == 16 * (1 + (PlaintextLen * 32) / 16),\n \"unexpected ciphertext length\",\n );\n\n // ***************************************************************************** Compute the header ciphertext\n // *****************************************************************************\n\n // Header contains only the length of the ciphertext stored in 2 bytes.\n let mut header_plaintext: [u8; 2] = [0 as u8; 2];\n let ciphertext_bytes_length = ciphertext_bytes.len();\n header_plaintext[0] = (ciphertext_bytes_length >> 8) as u8;\n header_plaintext[1] = ciphertext_bytes_length as u8;\n\n // Note: the aes128_encrypt builtin fn automatically appends bytes to the input, according to pkcs#7; hence why\n // the output `header_ciphertext_bytes` is 16 bytes larger than the input in this case.\n let header_ciphertext_bytes = aes128_encrypt(header_plaintext, header_iv, header_sym_key);\n // I recall that converting a slice to an array incurs constraints, so I'll check the length this way instead:\n std::static_assert(\n header_ciphertext_bytes.len() == HEADER_CIPHERTEXT_SIZE_IN_BYTES,\n \"unexpected ciphertext header length\",\n );\n\n // ***************************************************************************** Prepend / append more bytes of\n // data to the ciphertext, before converting back to fields.\n // *****************************************************************************\n\n let mut message_bytes_padding_to_mult_31 =\n get_arr_of_size__message_bytes_padding__from_PT::<PlaintextLen * 32>();\n // Safety: this randomness won't be constrained to be random. It's in the interest of the executor of this fn\n // to encrypt with random bytes.\n message_bytes_padding_to_mult_31 = unsafe { get_random_bytes() };\n\n let mut message_bytes = get_arr_of_size__message_bytes__from_PT::<PlaintextLen * 32>();\n\n std::static_assert(\n message_bytes.len() % 31 == 0,\n \"Unexpected error: message_bytes.len() should be divisible by 31, by construction.\",\n );\n\n message_bytes[0] = eph_pk_sign_byte;\n let mut offset = 1;\n for i in 0..header_ciphertext_bytes.len() {\n message_bytes[offset + i] = header_ciphertext_bytes[i];\n }\n offset += header_ciphertext_bytes.len();\n\n for i in 0..ciphertext_bytes.len() {\n message_bytes[offset + i] = ciphertext_bytes[i];\n }\n offset += ciphertext_bytes.len();\n\n for i in 0..message_bytes_padding_to_mult_31.len() {\n message_bytes[offset + i] = message_bytes_padding_to_mult_31[i];\n }\n offset += message_bytes_padding_to_mult_31.len();\n\n // Ideally we would be able to have a static assert where we check that the offset would be such that we've\n // written to the entire log_bytes array, but we cannot since Noir does not treat the offset as a comptime\n // value (despite the values that it goes through being known at each stage). We instead check that the\n // computation used to obtain the offset computes the expected value (which we _can_ do in a static check), and\n // then add a cheap runtime check to also validate that the offset matches this.\n std::static_assert(\n 1 + header_ciphertext_bytes.len() + ciphertext_bytes.len() + message_bytes_padding_to_mult_31.len()\n == message_bytes.len(),\n \"unexpected message length\",\n );\n assert(offset == message_bytes.len(), \"unexpected encrypted message length\");\n\n // ***************************************************************************** Convert bytes back to fields\n // *****************************************************************************\n\n // TODO(#12749): As Mike pointed out, we need to make messages produced by different encryption schemes\n // indistinguishable from each other and for this reason the output here and in the last for-loop of this\n // function should cover a full field.\n let message_bytes_as_fields = bytes_to_fields(message_bytes);\n\n // ***************************************************************************** Prepend / append fields, to\n // create the final message *****************************************************************************\n\n let mut ciphertext: [Field; MESSAGE_CIPHERTEXT_LEN] = [0; MESSAGE_CIPHERTEXT_LEN];\n\n ciphertext[0] = eph_pk.x;\n\n let mut offset = 1;\n for i in 0..message_bytes_as_fields.len() {\n ciphertext[offset + i] = message_bytes_as_fields[i];\n }\n offset += message_bytes_as_fields.len();\n\n for i in offset..MESSAGE_CIPHERTEXT_LEN {\n // We need to get a random value that fits in 31 bytes to not leak information about the size of the\n // message (all the \"real\" message fields contain at most 31 bytes because of the way we convert the bytes\n // to fields). TODO(#12749): Long term, this is not a good solution.\n\n // Safety: we assume that the sender wants for the message to be private - a malicious one could simply\n // reveal its contents publicly. It is therefore fine to trust the sender to provide random padding.\n let field_bytes = unsafe { get_random_bytes::<31>() };\n ciphertext[i] = Field::from_be_bytes::<31>(field_bytes);\n }\n\n ciphertext\n }\n\n unconstrained fn decrypt(\n ciphertext: BoundedVec<Field, MESSAGE_CIPHERTEXT_LEN>,\n recipient: AztecAddress,\n ) -> Option<BoundedVec<Field, MESSAGE_PLAINTEXT_LEN>> {\n let eph_pk_x = ciphertext.get(0);\n\n let ciphertext_without_eph_pk_x_fields = array::subbvec::<Field, MESSAGE_CIPHERTEXT_LEN, MESSAGE_CIPHERTEXT_LEN - EPH_PK_X_SIZE_IN_FIELDS>(\n ciphertext,\n EPH_PK_X_SIZE_IN_FIELDS,\n );\n\n // Convert the ciphertext represented as fields to a byte representation (its original format)\n let ciphertext_without_eph_pk_x = bytes_from_fields(ciphertext_without_eph_pk_x_fields);\n\n // First byte of the ciphertext represents the ephemeral public key sign\n let eph_pk_sign_bool = ciphertext_without_eph_pk_x.get(0) != 0;\n\n // With the sign and the x-coordinate of the ephemeral public key, we can reconstruct the point. This may fail\n // however, as not all x-coordinates are on the curve. In that case, we simply return `Option::none`.\n point_from_x_coord_and_sign(eph_pk_x, eph_pk_sign_bool).map(|eph_pk| {\n // Derive shared secret\n let ciphertext_shared_secret = get_shared_secret(recipient, eph_pk);\n\n // Derive symmetric keys:\n let pairs = derive_aes_symmetric_key_and_iv_from_ecdh_shared_secret_using_poseidon2_unsafe::<2>(\n ciphertext_shared_secret,\n );\n let (body_sym_key, body_iv) = pairs[0];\n let (header_sym_key, header_iv) = pairs[1];\n\n // Extract the header ciphertext\n let header_start = EPH_PK_SIGN_BYTE_SIZE_IN_BYTES; // Skip eph_pk_sign byte\n let header_ciphertext: [u8; HEADER_CIPHERTEXT_SIZE_IN_BYTES] =\n array::subarray(ciphertext_without_eph_pk_x.storage(), header_start);\n // We need to convert the array to a BoundedVec because the oracle expects a BoundedVec as it's designed to\n // work with messages with unknown length at compile time. This would not be necessary here as the header\n // ciphertext length is fixed. But we do it anyway to not have to have duplicate oracles.\n let header_ciphertext_bvec =\n BoundedVec::<u8, HEADER_CIPHERTEXT_SIZE_IN_BYTES>::from_array(header_ciphertext);\n\n // Decrypt header\n let header_plaintext = aes128_decrypt_oracle(header_ciphertext_bvec, header_iv, header_sym_key);\n\n // Extract ciphertext length from header (2 bytes, big-endian)\n let ciphertext_length = ((header_plaintext.get(0) as u32) << 8) | (header_plaintext.get(1) as u32);\n\n // Extract and decrypt main ciphertext\n let ciphertext_start = header_start + HEADER_CIPHERTEXT_SIZE_IN_BYTES;\n let ciphertext_with_padding: [u8; (MESSAGE_CIPHERTEXT_LEN - EPH_PK_X_SIZE_IN_FIELDS) * 31 - HEADER_CIPHERTEXT_SIZE_IN_BYTES - EPH_PK_SIGN_BYTE_SIZE_IN_BYTES] =\n array::subarray(ciphertext_without_eph_pk_x.storage(), ciphertext_start);\n let ciphertext: BoundedVec<u8, (MESSAGE_CIPHERTEXT_LEN - EPH_PK_X_SIZE_IN_FIELDS) * 31 - HEADER_CIPHERTEXT_SIZE_IN_BYTES - EPH_PK_SIGN_BYTE_SIZE_IN_BYTES> =\n BoundedVec::from_parts(ciphertext_with_padding, ciphertext_length);\n\n // Decrypt main ciphertext and return it\n let plaintext_bytes = aes128_decrypt_oracle(ciphertext, body_iv, body_sym_key);\n\n // Each field of the original note message was serialized to 32 bytes so we convert the bytes back to\n // fields.\n fields_from_bytes(plaintext_bytes)\n })\n }\n}\n\n/// Produces a random valid address point, i.e. one that is on the curve. This is equivalent to calling\n/// [AztecAddress::to_address_point] on a random valid address.\nunconstrained fn random_address_point() -> AddressPoint {\n let mut result = std::mem::zeroed();\n\n loop {\n // We simply produce random x coordinates until we find one that is on the curve. About half of the x\n // coordinates fulfill this condition, so this should only take a few iterations at most.\n let x_coord = random();\n let point = point_from_x_coord_and_sign(x_coord, true);\n if point.is_some() {\n result = AddressPoint { inner: point.unwrap() };\n break;\n }\n }\n\n result\n}\n\nmod test {\n use crate::{\n keys::ecdh_shared_secret::derive_ecdh_shared_secret,\n messages::{encoding::MESSAGE_PLAINTEXT_LEN, encryption::message_encryption::MessageEncryption},\n test::helpers::test_environment::TestEnvironment,\n };\n use crate::protocol::{address::AztecAddress, traits::FromField};\n use super::{AES128, random_address_point};\n use std::{embedded_curve_ops::EmbeddedCurveScalar, test::OracleMock};\n\n #[test]\n unconstrained fn encrypt_decrypt_deterministic() {\n let env = TestEnvironment::new();\n\n // Message decryption requires oracles that are only available during private execution\n env.private_context(|_| {\n let plaintext = [1, 2, 3];\n\n let recipient = AztecAddress::from_field(\n 0x25afb798ea6d0b8c1618e50fdeafa463059415013d3b7c75d46abf5e242be70c,\n );\n\n // Mock random values for deterministic test\n let eph_sk = 0x1358d15019d4639393d62b97e1588c095957ce74a1c32d6ec7d62fe6705d9538;\n let _ = OracleMock::mock(\"utilityGetRandomField\").returns(eph_sk).times(1);\n\n let randomness = 0x0101010101010101010101010101010101010101010101010101010101010101;\n let _ = OracleMock::mock(\"utilityGetRandomField\").returns(randomness).times(1000000);\n\n let _ = OracleMock::mock(\"privateGetNextAppTagAsSender\").returns(42);\n\n // Encrypt the message\n let encrypted_message = BoundedVec::from_array(AES128::encrypt(plaintext, recipient));\n\n // Mock shared secret for deterministic test\n let shared_secret = derive_ecdh_shared_secret(\n EmbeddedCurveScalar::from_field(eph_sk),\n recipient.to_address_point().unwrap().inner,\n );\n\n let _ = OracleMock::mock(\"utilityGetSharedSecret\").returns(shared_secret);\n\n // Decrypt the message\n let decrypted = AES128::decrypt(encrypted_message, recipient).unwrap();\n\n // The decryption function spits out a BoundedVec because it's designed to work with messages with unknown\n // length at compile time. For this reason we need to convert the original input to a BoundedVec.\n let plaintext_bvec = BoundedVec::<Field, MESSAGE_PLAINTEXT_LEN>::from_array(plaintext);\n\n // Verify decryption matches original plaintext\n assert_eq(decrypted, plaintext_bvec, \"Decrypted bytes should match original plaintext\");\n\n // The following is a workaround of \"struct is never constructed\" Noir compilation error (we only ever use\n // static methods of the struct).\n let _ = AES128 {};\n });\n }\n\n #[test]\n unconstrained fn encrypt_decrypt_random() {\n // Same as `encrypt_decrypt_deterministic`, except we don't mock any of the oracles and rely on\n // `TestEnvironment` instead.\n let mut env = TestEnvironment::new();\n\n let recipient = env.create_light_account();\n\n env.private_context(|_| {\n let plaintext = [1, 2, 3];\n let ciphertext = AES128::encrypt(plaintext, recipient);\n\n assert_eq(\n AES128::decrypt(BoundedVec::from_array(ciphertext), recipient).unwrap(),\n BoundedVec::from_array(plaintext),\n );\n });\n }\n\n #[test]\n unconstrained fn encrypt_to_invalid_address() {\n // x = 3 is a non-residue for this curve, resulting in an invalid address\n let invalid_address = AztecAddress { inner: 3 };\n\n // We just test that we produced some output and did not crash - the result is gibberish as it is encrypted\n // using a public key for which we do not know the private key.\n let _ = AES128::encrypt([1, 2, 3, 4], invalid_address);\n }\n\n #[test]\n unconstrained fn random_address_point_produces_valid_points() {\n // About half of random addresses are invalid, so testing just a couple gives us high confidence that\n // `random_address_point` is indeed producing valid addresses.\n for _ in 0..10 {\n let random_address = AztecAddress { inner: random_address_point().inner.x };\n assert(random_address.to_address_point().is_some());\n }\n }\n\n #[test]\n unconstrained fn decrypt_invalid_ephemeral_public_key() {\n let mut env = TestEnvironment::new();\n\n let recipient = env.create_light_account();\n\n env.private_context(|_| {\n let plaintext = [1, 2, 3, 4];\n let ciphertext = AES128::encrypt(plaintext, recipient);\n\n // The first field of the ciphertext is the x-coordinate of the ephemeral public key. We set it to a known\n // non-residue (3), causing `decrypt` to fail to produce a decryption shared secret.\n let mut bad_ciphertext = BoundedVec::from_array(ciphertext);\n bad_ciphertext.set(0, 3);\n\n assert(AES128::decrypt(bad_ciphertext, recipient).is_none());\n });\n }\n}\n"
|
|
3406
|
-
},
|
|
3407
|
-
"134": {
|
|
3408
|
-
"path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/messages/logs/event.nr",
|
|
3409
|
-
"source": "use crate::{\n event::{event_interface::EventInterface, EventSelector},\n messages::{\n encoding::{encode_message, MAX_MESSAGE_CONTENT_LEN, MESSAGE_EXPANDED_METADATA_LEN},\n msg_type::PRIVATE_EVENT_MSG_TYPE_ID,\n },\n utils::array,\n};\nuse crate::protocol::traits::{FromField, Serialize, ToField};\n\n/// The number of fields in a private event message content that are not the event's serialized representation (1 field\n/// for randomness).\npub(crate) global PRIVATE_EVENT_MSG_PLAINTEXT_RESERVED_FIELDS_LEN: u32 = 1;\npub(crate) global PRIVATE_EVENT_MSG_PLAINTEXT_RANDOMNESS_INDEX: u32 = 0;\n\n/// The maximum length of the packed representation of an event's contents. This is limited by private log size,\n/// encryption overhead and extra fields in the message (e.g. message type id, randomness, etc.).\npub global MAX_EVENT_SERIALIZED_LEN: u32 = MAX_MESSAGE_CONTENT_LEN - PRIVATE_EVENT_MSG_PLAINTEXT_RESERVED_FIELDS_LEN;\n\n/// Creates the plaintext for a private event message (i.e. one of type [PRIVATE_EVENT_MSG_TYPE_ID]).\n///\n/// This plaintext is meant to be decoded via [decode_private_event_message].\npub fn encode_private_event_message<Event>(\n event: Event,\n randomness: Field,\n) -> [Field; PRIVATE_EVENT_MSG_PLAINTEXT_RESERVED_FIELDS_LEN + <Event as Serialize>::N + MESSAGE_EXPANDED_METADATA_LEN]\nwhere\n Event: EventInterface + Serialize,\n{\n // We use `Serialize` because we want for events to be processable by off-chain actors, e.g. block explorers,\n // wallets and apps, without having to rely on contract invocation. If we used `Packable` we'd need to call utility\n // functions in order to unpack events, which would introduce a level of complexity we don't currently think is\n // worth the savings in DA (for public events) and proving time (when encrypting private event messages).\n let serialized_event = event.serialize();\n\n // If PRIVATE_EVENT_MSG_PLAINTEXT_RESERVED_FIELDS_LEN is changed, causing the assertion below to fail, then the\n // encoding below must be updated as well.\n std::static_assert(\n PRIVATE_EVENT_MSG_PLAINTEXT_RESERVED_FIELDS_LEN == 1,\n \"unexpected value for PRIVATE_EVENT_MSG_PLAINTEXT_RESERVED_FIELDS_LEN\",\n );\n\n let mut msg_plaintext = [0; PRIVATE_EVENT_MSG_PLAINTEXT_RESERVED_FIELDS_LEN + <Event as Serialize>::N];\n msg_plaintext[PRIVATE_EVENT_MSG_PLAINTEXT_RANDOMNESS_INDEX] = randomness;\n\n for i in 0..serialized_event.len() {\n msg_plaintext[PRIVATE_EVENT_MSG_PLAINTEXT_RESERVED_FIELDS_LEN + i] = serialized_event[i];\n }\n\n // The event type id is stored in the message metadata\n encode_message(\n PRIVATE_EVENT_MSG_TYPE_ID,\n Event::get_event_type_id().to_field() as u64,\n msg_plaintext,\n )\n}\n\n/// Decodes the plaintext from a private event message (i.e. one of type [PRIVATE_EVENT_MSG_TYPE_ID]).\n///\n/// This plaintext is meant to have originated from [encode_private_event_message].\n///\n/// Note that while [encode_private_event_message] returns a fixed-size array, this function takes a [BoundedVec]\n/// instead. This is because when decoding we're typically processing runtime-sized plaintexts, more specifically,\n/// those that originate from [crate::messages::encryption::message_encryption::MessageEncryption::decrypt].\npub(crate) unconstrained fn decode_private_event_message(\n msg_metadata: u64,\n msg_content: BoundedVec<Field, MAX_MESSAGE_CONTENT_LEN>,\n) -> (EventSelector, Field, BoundedVec<Field, MAX_EVENT_SERIALIZED_LEN>) {\n // Private event messages contain the event type id in the metadata\n let event_type_id = EventSelector::from_field(msg_metadata as Field);\n\n assert(\n msg_content.len() > PRIVATE_EVENT_MSG_PLAINTEXT_RESERVED_FIELDS_LEN,\n f\"Invalid private event message: all private event messages must have at least {PRIVATE_EVENT_MSG_PLAINTEXT_RESERVED_FIELDS_LEN} fields\",\n );\n\n // If PRIVATE_EVENT_MSG_PLAINTEXT_RESERVED_FIELDS_LEN is changed, causing the assertion below to fail, then the\n // destructuring of the private event message encoding below must be updated as well.\n std::static_assert(\n PRIVATE_EVENT_MSG_PLAINTEXT_RESERVED_FIELDS_LEN == 1,\n \"unexpected value for PRIVATE_EVENT_MSG_PLAINTEXT_RESERVED_FIELDS_LEN\",\n );\n\n let randomness = msg_content.get(PRIVATE_EVENT_MSG_PLAINTEXT_RANDOMNESS_INDEX);\n let serialized_event = array::subbvec(msg_content, PRIVATE_EVENT_MSG_PLAINTEXT_RESERVED_FIELDS_LEN);\n\n (event_type_id, randomness, serialized_event)\n}\n\nmod test {\n use crate::{\n event::event_interface::EventInterface,\n messages::{\n encoding::decode_message,\n logs::event::{decode_private_event_message, encode_private_event_message},\n msg_type::PRIVATE_EVENT_MSG_TYPE_ID,\n },\n };\n use crate::protocol::traits::Serialize;\n use crate::test::mocks::mock_event::MockEvent;\n\n global VALUE: Field = 7;\n global RANDOMNESS: Field = 10;\n\n #[test]\n unconstrained fn encode_decode() {\n let event = MockEvent::new(VALUE).build_event();\n\n let message_plaintext = encode_private_event_message(event, RANDOMNESS);\n\n let (msg_type_id, msg_metadata, msg_content) = decode_message(BoundedVec::from_array(message_plaintext));\n\n assert_eq(msg_type_id, PRIVATE_EVENT_MSG_TYPE_ID);\n\n let (event_type_id, randomness, serialized_event) = decode_private_event_message(msg_metadata, msg_content);\n\n assert_eq(event_type_id, MockEvent::get_event_type_id());\n assert_eq(randomness, RANDOMNESS);\n assert_eq(serialized_event, BoundedVec::from_array(event.serialize()));\n }\n}\n"
|
|
3410
|
-
},
|
|
3411
|
-
"136": {
|
|
3412
|
-
"path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/messages/logs/note.nr",
|
|
3413
|
-
"source": "use crate::{\n messages::{\n encoding::{encode_message, MAX_MESSAGE_CONTENT_LEN, MESSAGE_EXPANDED_METADATA_LEN},\n msg_type::PRIVATE_NOTE_MSG_TYPE_ID,\n },\n note::note_interface::NoteType,\n utils::array,\n};\nuse crate::protocol::{address::AztecAddress, traits::{FromField, Packable, ToField}};\n\n/// The number of fields in a private note message content that are not the note's packed representation.\npub(crate) global PRIVATE_NOTE_MSG_PLAINTEXT_RESERVED_FIELDS_LEN: u32 = 3;\n\npub(crate) global PRIVATE_NOTE_MSG_PLAINTEXT_OWNER_INDEX: u32 = 0;\npub(crate) global PRIVATE_NOTE_MSG_PLAINTEXT_STORAGE_SLOT_INDEX: u32 = 1;\npub(crate) global PRIVATE_NOTE_MSG_PLAINTEXT_RANDOMNESS_INDEX: u32 = 2;\n\n/// The maximum length of the packed representation of a note's contents. This is limited by private log size,\n/// encryption overhead and extra fields in the message (e.g. message type id, storage slot, randomness, etc.).\npub global MAX_NOTE_PACKED_LEN: u32 = MAX_MESSAGE_CONTENT_LEN - PRIVATE_NOTE_MSG_PLAINTEXT_RESERVED_FIELDS_LEN;\n\n/// Creates the plaintext for a private note message (i.e. one of type [PRIVATE_NOTE_MSG_TYPE_ID]).\n///\n/// This plaintext is meant to be decoded via [decode_private_note_message].\npub fn encode_private_note_message<Note>(\n note: Note,\n owner: AztecAddress,\n storage_slot: Field,\n randomness: Field,\n) -> [Field; PRIVATE_NOTE_MSG_PLAINTEXT_RESERVED_FIELDS_LEN + <Note as Packable>::N + MESSAGE_EXPANDED_METADATA_LEN]\nwhere\n Note: NoteType + Packable,\n{\n let packed_note = note.pack();\n\n // If PRIVATE_NOTE_MSG_PLAINTEXT_RESERVED_FIELDS_LEN is changed, causing the assertion below to fail, then the\n // encoding below must be updated as well.\n std::static_assert(\n PRIVATE_NOTE_MSG_PLAINTEXT_RESERVED_FIELDS_LEN == 3,\n \"unexpected value for PRIVATE_NOTE_MSG_PLAINTEXT_RESERVED_FIELDS_LEN\",\n );\n\n let mut msg_content = [0; PRIVATE_NOTE_MSG_PLAINTEXT_RESERVED_FIELDS_LEN + <Note as Packable>::N];\n msg_content[PRIVATE_NOTE_MSG_PLAINTEXT_OWNER_INDEX] = owner.to_field();\n msg_content[PRIVATE_NOTE_MSG_PLAINTEXT_STORAGE_SLOT_INDEX] = storage_slot;\n msg_content[PRIVATE_NOTE_MSG_PLAINTEXT_RANDOMNESS_INDEX] = randomness;\n for i in 0..packed_note.len() {\n msg_content[PRIVATE_NOTE_MSG_PLAINTEXT_RESERVED_FIELDS_LEN + i] = packed_note[i];\n }\n\n // Notes use the note type id for metadata\n encode_message(PRIVATE_NOTE_MSG_TYPE_ID, Note::get_id() as u64, msg_content)\n}\n\n/// Decodes the plaintext from a private note message (i.e. one of type [PRIVATE_NOTE_MSG_TYPE_ID]).\n///\n/// This plaintext is meant to have originated from [encode_private_note_message].\n///\n/// Note that while [encode_private_note_message] returns a fixed-size array, this function takes a [BoundedVec]\n/// instead. This is because when decoding we're typically processing runtime-sized plaintexts, more specifically,\n/// those that originate from [crate::messages::encryption::message_encryption::MessageEncryption::decrypt].\npub(crate) unconstrained fn decode_private_note_message(\n msg_metadata: u64,\n msg_content: BoundedVec<Field, MAX_MESSAGE_CONTENT_LEN>,\n) -> (Field, AztecAddress, Field, Field, BoundedVec<Field, MAX_NOTE_PACKED_LEN>) {\n let note_type_id = msg_metadata as Field; // TODO: make note type id not be a full field\n\n assert(\n msg_content.len() > PRIVATE_NOTE_MSG_PLAINTEXT_RESERVED_FIELDS_LEN,\n f\"Invalid private note message: all private note messages must have at least {PRIVATE_NOTE_MSG_PLAINTEXT_RESERVED_FIELDS_LEN} fields\",\n );\n\n // If PRIVATE_NOTE_MSG_PLAINTEXT_RESERVED_FIELDS_LEN is changed, causing the assertion below to fail, then the\n // decoding below must be updated as well.\n std::static_assert(\n PRIVATE_NOTE_MSG_PLAINTEXT_RESERVED_FIELDS_LEN == 3,\n \"unexpected value for PRIVATE_NOTE_MSG_PLAINTEXT_RESERVED_FIELDS_LEN\",\n );\n\n let owner = AztecAddress::from_field(msg_content.get(PRIVATE_NOTE_MSG_PLAINTEXT_OWNER_INDEX));\n let storage_slot = msg_content.get(PRIVATE_NOTE_MSG_PLAINTEXT_STORAGE_SLOT_INDEX);\n let randomness = msg_content.get(PRIVATE_NOTE_MSG_PLAINTEXT_RANDOMNESS_INDEX);\n let packed_note = array::subbvec(msg_content, PRIVATE_NOTE_MSG_PLAINTEXT_RESERVED_FIELDS_LEN);\n\n (note_type_id, owner, storage_slot, randomness, packed_note)\n}\n\nmod test {\n use crate::{\n messages::{\n encoding::decode_message,\n logs::note::{decode_private_note_message, encode_private_note_message},\n msg_type::PRIVATE_NOTE_MSG_TYPE_ID,\n },\n note::note_interface::NoteType,\n };\n use crate::protocol::{address::AztecAddress, traits::{FromField, Packable}};\n use crate::test::mocks::mock_note::MockNote;\n\n global VALUE: Field = 7;\n global OWNER: AztecAddress = AztecAddress::from_field(8);\n global STORAGE_SLOT: Field = 9;\n global RANDOMNESS: Field = 10;\n\n #[test]\n unconstrained fn encode_decode() {\n let note = MockNote::new(VALUE).build_note();\n\n let message_plaintext = encode_private_note_message(note, OWNER, STORAGE_SLOT, RANDOMNESS);\n\n let (msg_type_id, msg_metadata, msg_content) = decode_message(BoundedVec::from_array(message_plaintext));\n\n assert_eq(msg_type_id, PRIVATE_NOTE_MSG_TYPE_ID);\n\n let (note_type_id, owner, storage_slot, randomness, packed_note) =\n decode_private_note_message(msg_metadata, msg_content);\n\n assert_eq(note_type_id, MockNote::get_id());\n assert_eq(owner, OWNER);\n assert_eq(storage_slot, STORAGE_SLOT);\n assert_eq(randomness, RANDOMNESS);\n assert_eq(packed_note, BoundedVec::from_array(note.pack()));\n }\n}\n"
|
|
3414
|
-
},
|
|
3415
|
-
"137": {
|
|
3416
|
-
"path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/messages/logs/partial_note.nr",
|
|
3417
|
-
"source": "use crate::{\n messages::{\n encoding::{encode_message, MAX_MESSAGE_CONTENT_LEN, MESSAGE_EXPANDED_METADATA_LEN},\n encryption::{aes128::AES128, message_encryption::MessageEncryption},\n logs::utils::prefix_with_tag,\n msg_type::PARTIAL_NOTE_PRIVATE_MSG_TYPE_ID,\n },\n note::note_interface::NoteType,\n utils::array,\n};\nuse crate::protocol::{\n address::AztecAddress,\n constants::PRIVATE_LOG_SIZE_IN_FIELDS,\n traits::{FromField, Packable, ToField},\n};\n\n/// The number of fields in a private note message content that are not the note's packed representation.\npub(crate) global PARTIAL_NOTE_PRIVATE_MSG_PLAINTEXT_RESERVED_FIELDS_LEN: u32 = 4;\npub(crate) global PARTIAL_NOTE_PRIVATE_MSG_PLAINTEXT_OWNER_INDEX: u32 = 0;\npub(crate) global PARTIAL_NOTE_PRIVATE_MSG_PLAINTEXT_STORAGE_SLOT_INDEX: u32 = 1;\npub(crate) global PARTIAL_NOTE_PRIVATE_MSG_PLAINTEXT_RANDOMNESS_INDEX: u32 = 2;\npub(crate) global PARTIAL_NOTE_PRIVATE_MSG_PLAINTEXT_NOTE_COMPLETION_LOG_TAG_INDEX: u32 = 3;\n\n/// Partial notes have a maximum packed length of their private fields bound by extra content in their private message\n/// (e.g. the storage slot, note completion log tag, etc.).\npub global MAX_PARTIAL_NOTE_PRIVATE_PACKED_LEN: u32 =\n MAX_MESSAGE_CONTENT_LEN - PARTIAL_NOTE_PRIVATE_MSG_PLAINTEXT_RESERVED_FIELDS_LEN;\n\n// TODO(#16881): once partial notes support delivery via an offchain message we will most likely want to remove this.\npub fn compute_partial_note_private_content_log<PartialNotePrivateContent>(\n partial_note_private_content: PartialNotePrivateContent,\n owner: AztecAddress,\n storage_slot: Field,\n randomness: Field,\n recipient: AztecAddress,\n note_completion_log_tag: Field,\n) -> [Field; PRIVATE_LOG_SIZE_IN_FIELDS]\nwhere\n PartialNotePrivateContent: NoteType + Packable,\n{\n let message_plaintext = encode_partial_note_private_message(\n partial_note_private_content,\n owner,\n storage_slot,\n randomness,\n note_completion_log_tag,\n );\n let message_ciphertext = AES128::encrypt(message_plaintext, recipient);\n\n prefix_with_tag(message_ciphertext, recipient)\n}\n\n/// Creates the plaintext for a partial note private message (i.e. one of type [PARTIAL_NOTE_PRIVATE_MSG_TYPE_ID]).\n///\n/// This plaintext is meant to be decoded via [decode_partial_note_private_message].\npub fn encode_partial_note_private_message<PartialNotePrivateContent>(\n partial_note_private_content: PartialNotePrivateContent,\n owner: AztecAddress,\n storage_slot: Field,\n randomness: Field,\n note_completion_log_tag: Field,\n ) -> [Field; PARTIAL_NOTE_PRIVATE_MSG_PLAINTEXT_RESERVED_FIELDS_LEN + <PartialNotePrivateContent as Packable>::N + MESSAGE_EXPANDED_METADATA_LEN]\nwhere\n PartialNotePrivateContent: NoteType + Packable,\n{\n let packed_private_content = partial_note_private_content.pack();\n\n // If PARTIAL_NOTE_PRIVATE_MSG_PLAINTEXT_NON_NOTE_FIELDS_LEN is changed, causing the assertion below to fail, then\n // the encoding below must be updated as well.\n std::static_assert(\n PARTIAL_NOTE_PRIVATE_MSG_PLAINTEXT_RESERVED_FIELDS_LEN == 4,\n \"unexpected value for PARTIAL_NOTE_PRIVATE_MSG_PLAINTEXT_NON_NOTE_FIELDS_LEN\",\n );\n\n let mut msg_content =\n [0; PARTIAL_NOTE_PRIVATE_MSG_PLAINTEXT_RESERVED_FIELDS_LEN + <PartialNotePrivateContent as Packable>::N];\n msg_content[PARTIAL_NOTE_PRIVATE_MSG_PLAINTEXT_OWNER_INDEX] = owner.to_field();\n msg_content[PARTIAL_NOTE_PRIVATE_MSG_PLAINTEXT_STORAGE_SLOT_INDEX] = storage_slot;\n msg_content[PARTIAL_NOTE_PRIVATE_MSG_PLAINTEXT_RANDOMNESS_INDEX] = randomness;\n msg_content[PARTIAL_NOTE_PRIVATE_MSG_PLAINTEXT_NOTE_COMPLETION_LOG_TAG_INDEX] = note_completion_log_tag;\n\n for i in 0..packed_private_content.len() {\n msg_content[PARTIAL_NOTE_PRIVATE_MSG_PLAINTEXT_RESERVED_FIELDS_LEN + i] = packed_private_content[i];\n }\n\n encode_message(\n PARTIAL_NOTE_PRIVATE_MSG_TYPE_ID,\n // Notes use the note type id for metadata\n PartialNotePrivateContent::get_id() as u64,\n msg_content,\n )\n}\n\n/// Decodes the plaintext from a private note message (i.e. one of type [PARTIAL_NOTE_PRIVATE_MSG_TYPE_ID]).\n///\n/// This plaintext is meant to have originated from [encode_partial_note_private_message].\n///\n/// Note that while [encode_partial_note_private_message] returns a fixed-size array, this function takes a\n/// [BoundedVec] instead. This is because when decoding we're typically processing runtime-sized plaintexts, more\n/// specifically, those that originate from\n/// [crate::messages::encryption::message_encryption::MessageEncryption::decrypt].\npub(crate) unconstrained fn decode_partial_note_private_message(\n msg_metadata: u64,\n msg_content: BoundedVec<Field, MAX_MESSAGE_CONTENT_LEN>,\n) -> (AztecAddress, Field, Field, Field, Field, BoundedVec<Field, MAX_PARTIAL_NOTE_PRIVATE_PACKED_LEN>) {\n let note_type_id = msg_metadata as Field; // TODO: make note type id not be a full field\n\n // The following ensures that the message content contains at least the minimum number of fields required for a\n // valid partial note private message. (Refer to the description of\n // PARTIAL_NOTE_PRIVATE_MSG_PLAINTEXT_NON_NOTE_FIELDS_LEN for more information about these fields.)\n assert(\n msg_content.len() >= PARTIAL_NOTE_PRIVATE_MSG_PLAINTEXT_RESERVED_FIELDS_LEN,\n f\"Invalid private note message: all partial note private messages must have at least {PARTIAL_NOTE_PRIVATE_MSG_PLAINTEXT_RESERVED_FIELDS_LEN} fields\",\n );\n\n // If PARTIAL_NOTE_PRIVATE_MSG_PLAINTEXT_NON_NOTE_FIELDS_LEN is changed, causing the assertion below to fail, then\n // the destructuring of the partial note private message encoding below must be updated as well.\n std::static_assert(\n PARTIAL_NOTE_PRIVATE_MSG_PLAINTEXT_RESERVED_FIELDS_LEN == 4,\n \"unexpected value for PARTIAL_NOTE_PRIVATE_MSG_PLAINTEXT_NON_NOTE_FIELDS_LEN\",\n );\n\n // We currently have four fields that are not the partial note's packed representation, which are the owner, the\n // storage slot, the randomness, and the note completion log tag.\n let owner = AztecAddress::from_field(\n msg_content.get(PARTIAL_NOTE_PRIVATE_MSG_PLAINTEXT_OWNER_INDEX),\n );\n let storage_slot = msg_content.get(PARTIAL_NOTE_PRIVATE_MSG_PLAINTEXT_STORAGE_SLOT_INDEX);\n let randomness = msg_content.get(PARTIAL_NOTE_PRIVATE_MSG_PLAINTEXT_RANDOMNESS_INDEX);\n let note_completion_log_tag = msg_content.get(PARTIAL_NOTE_PRIVATE_MSG_PLAINTEXT_NOTE_COMPLETION_LOG_TAG_INDEX);\n\n let packed_private_note_content: BoundedVec<Field, MAX_PARTIAL_NOTE_PRIVATE_PACKED_LEN> = array::subbvec(\n msg_content,\n PARTIAL_NOTE_PRIVATE_MSG_PLAINTEXT_RESERVED_FIELDS_LEN,\n );\n\n (owner, storage_slot, randomness, note_completion_log_tag, note_type_id, packed_private_note_content)\n}\n\nmod test {\n use crate::{\n messages::{\n encoding::decode_message,\n logs::partial_note::{decode_partial_note_private_message, encode_partial_note_private_message},\n msg_type::PARTIAL_NOTE_PRIVATE_MSG_TYPE_ID,\n },\n note::note_interface::NoteType,\n };\n use crate::protocol::{address::AztecAddress, traits::{FromField, Packable}};\n use crate::test::mocks::mock_note::MockNote;\n\n global VALUE: Field = 7;\n global OWNER: AztecAddress = AztecAddress::from_field(8);\n global STORAGE_SLOT: Field = 9;\n global RANDOMNESS: Field = 10;\n global NOTE_COMPLETION_LOG_TAG: Field = 11;\n\n #[test]\n unconstrained fn encode_decode() {\n // Note that here we use MockNote as the private fields of a partial note\n let note = MockNote::new(VALUE).build_note();\n\n let message_plaintext = encode_partial_note_private_message(\n note,\n OWNER,\n STORAGE_SLOT,\n RANDOMNESS,\n NOTE_COMPLETION_LOG_TAG,\n );\n\n let (msg_type_id, msg_metadata, msg_content) = decode_message(BoundedVec::from_array(message_plaintext));\n\n assert_eq(msg_type_id, PARTIAL_NOTE_PRIVATE_MSG_TYPE_ID);\n\n let (owner, storage_slot, randomness, note_completion_log_tag, note_type_id, packed_note) =\n decode_partial_note_private_message(msg_metadata, msg_content);\n\n assert_eq(note_type_id, MockNote::get_id());\n assert_eq(owner, OWNER);\n assert_eq(storage_slot, STORAGE_SLOT);\n assert_eq(randomness, RANDOMNESS);\n assert_eq(note_completion_log_tag, NOTE_COMPLETION_LOG_TAG);\n assert_eq(packed_note, BoundedVec::from_array(note.pack()));\n }\n}\n"
|
|
3418
|
-
},
|
|
3419
|
-
"147": {
|
|
3420
|
-
"path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/messages/processing/mod.nr",
|
|
3421
|
-
"source": "pub(crate) mod event_validation_request;\n\nmod message_context;\npub use message_context::MessageContext;\n\npub(crate) mod note_validation_request;\npub(crate) mod log_retrieval_request;\npub(crate) mod log_retrieval_response;\npub(crate) mod pending_tagged_log;\n\nuse crate::{\n capsules::CapsuleArray,\n event::EventSelector,\n messages::{\n discovery::partial_notes::DeliveredPendingPartialNote,\n logs::{event::MAX_EVENT_SERIALIZED_LEN, note::MAX_NOTE_PACKED_LEN},\n processing::{\n log_retrieval_request::LogRetrievalRequest, log_retrieval_response::LogRetrievalResponse,\n note_validation_request::NoteValidationRequest, pending_tagged_log::PendingTaggedLog,\n },\n },\n oracle,\n};\nuse crate::protocol::{address::AztecAddress, hash::sha256_to_field};\nuse event_validation_request::EventValidationRequest;\n\n// Base slot for the pending tagged log array to which the fetch_tagged_logs oracle inserts found private logs.\nglobal PENDING_TAGGED_LOG_ARRAY_BASE_SLOT: Field =\n sha256_to_field(\"AZTEC_NR::PENDING_TAGGED_LOG_ARRAY_BASE_SLOT\".as_bytes());\n\nglobal NOTE_VALIDATION_REQUESTS_ARRAY_BASE_SLOT: Field = sha256_to_field(\n \"AZTEC_NR::NOTE_VALIDATION_REQUESTS_ARRAY_BASE_SLOT\".as_bytes(),\n);\n\nglobal EVENT_VALIDATION_REQUESTS_ARRAY_BASE_SLOT: Field = sha256_to_field(\n \"AZTEC_NR::EVENT_VALIDATION_REQUESTS_ARRAY_BASE_SLOT\".as_bytes(),\n);\n\nglobal LOG_RETRIEVAL_REQUESTS_ARRAY_BASE_SLOT: Field = sha256_to_field(\n \"AZTEC_NR::LOG_RETRIEVAL_REQUESTS_ARRAY_BASE_SLOT\".as_bytes(),\n);\n\nglobal LOG_RETRIEVAL_RESPONSES_ARRAY_BASE_SLOT: Field = sha256_to_field(\n \"AZTEC_NR::LOG_RETRIEVAL_RESPONSES_ARRAY_BASE_SLOT\".as_bytes(),\n);\n\n/// Searches for private logs emitted by `contract_address` that might contain messages for one of the local accounts,\n/// and stores them in a `CapsuleArray` which is then returned.\npub(crate) unconstrained fn get_private_logs(contract_address: AztecAddress) -> CapsuleArray<PendingTaggedLog> {\n // We will eventually perform log discovery via tagging here, but for now we simply call the `fetchTaggedLogs`\n // oracle. This makes PXE synchronize tags, download logs and store the pending tagged logs in a capsule array.\n oracle::message_processing::fetch_tagged_logs(PENDING_TAGGED_LOG_ARRAY_BASE_SLOT);\n\n CapsuleArray::at(contract_address, PENDING_TAGGED_LOG_ARRAY_BASE_SLOT)\n}\n\n/// Enqueues a note for validation by PXE, so that it becomes aware of a note's existence allowing for later retrieval\n/// via `get_notes` oracle. The note will be scoped to `contract_address`, meaning other contracts will not be able to\n/// access it unless authorized.\n///\n/// In order for the note validation and insertion to occur, `validate_and_store_enqueued_notes_and_events` must be\n/// later called. For optimal performance, accumulate as many note validation requests as possible and then validate\n/// them all at the end (which results in PXE minimizing the number of network round-trips).\n///\n/// The `packed_note` is what `getNotes` will later return. PXE indexes notes by `storage_slot`, so this value is\n/// typically used to filter notes that correspond to different state variables. `note_hash` and `nullifier` are the\n/// inner hashes, i.e. the raw hashes returned by `NoteHash::compute_note_hash` and `NoteHash::compute_nullifier`. PXE\n/// will verify that the siloed unique note hash was inserted into the tree at `tx_hash`, and will store the nullifier\n/// to later check for nullification.\n///\n/// `owner` is the address used in note hash and nullifier computation, often requiring knowledge of their nullifier\n/// secret key.\n///\n/// `recipient` is the account to which the note message was delivered (i.e. the address the message was encrypted to).\n/// This determines which PXE account can see the note - other accounts will not be able to access it (e.g. other\n/// accounts will not be able to see one another's token balance notes, even in the same PXE) unless authorized. In\n/// most cases `recipient` equals `owner`, but they can differ in scenarios like delegated discovery.\npub(crate) unconstrained fn enqueue_note_for_validation(\n contract_address: AztecAddress,\n owner: AztecAddress,\n storage_slot: Field,\n randomness: Field,\n note_nonce: Field,\n packed_note: BoundedVec<Field, MAX_NOTE_PACKED_LEN>,\n note_hash: Field,\n nullifier: Field,\n tx_hash: Field,\n recipient: AztecAddress,\n) {\n // We store requests in a `CapsuleArray`, which PXE will later read from and deserialize into its version of the\n // Noir `NoteValidationRequest`\n CapsuleArray::at(contract_address, NOTE_VALIDATION_REQUESTS_ARRAY_BASE_SLOT).push(\n NoteValidationRequest {\n contract_address,\n owner,\n storage_slot,\n randomness,\n note_nonce,\n packed_note,\n note_hash,\n nullifier,\n tx_hash,\n recipient,\n },\n )\n}\n\n/// Enqueues an event for validation by PXE, so that it can be efficiently validated and then inserted into the event\n/// store.\n///\n/// In order for the event validation and insertion to occur, `validate_and_store_enqueued_notes_and_events` must be\n/// later called. For optimal performance, accumulate as many event validation requests as possible and then validate\n/// them all at the end (which results in PXE minimizing the number of network round-trips).\npub(crate) unconstrained fn enqueue_event_for_validation(\n contract_address: AztecAddress,\n event_type_id: EventSelector,\n randomness: Field,\n serialized_event: BoundedVec<Field, MAX_EVENT_SERIALIZED_LEN>,\n event_commitment: Field,\n tx_hash: Field,\n recipient: AztecAddress,\n) {\n // We store requests in a `CapsuleArray`, which PXE will later read from and deserialize into its version of the\n // Noir `EventValidationRequest`\n CapsuleArray::at(contract_address, EVENT_VALIDATION_REQUESTS_ARRAY_BASE_SLOT).push(\n EventValidationRequest {\n contract_address,\n event_type_id,\n randomness,\n serialized_event,\n event_commitment,\n tx_hash,\n recipient,\n },\n )\n}\n\n/// Validates all note and event validation requests enqueued via `enqueue_note_for_validation` and\n/// `enqueue_event_for_validation`, inserting them into the note database and event store respectively, making them\n/// queryable via `get_notes` oracle and our TS API (PXE::getPrivateEvents).\n///\n/// This automatically clears both validation request queues, so no further work needs to be done by the caller.\npub(crate) unconstrained fn validate_and_store_enqueued_notes_and_events(contract_address: AztecAddress) {\n oracle::message_processing::validate_and_store_enqueued_notes_and_events(\n contract_address,\n NOTE_VALIDATION_REQUESTS_ARRAY_BASE_SLOT,\n EVENT_VALIDATION_REQUESTS_ARRAY_BASE_SLOT,\n );\n}\n\n/// Efficiently queries the node for logs that result in the completion of all `DeliveredPendingPartialNote`s stored in\n/// a `CapsuleArray` by performing all node communication concurrently. Returns a second `CapsuleArray` with Options\n/// for the responses that correspond to the pending partial notes at the same index.\n///\n/// For example, given an array with pending partial notes `[ p1, p2, p3 ]`, where `p1` and `p3` have corresponding\n/// completion logs but `p2` does not, the returned `CapsuleArray` will have contents `[some(p1_log), none(),\n/// some(p3_log)]`.\npub(crate) unconstrained fn get_pending_partial_notes_completion_logs(\n contract_address: AztecAddress,\n pending_partial_notes: CapsuleArray<DeliveredPendingPartialNote>,\n) -> CapsuleArray<Option<LogRetrievalResponse>> {\n let log_retrieval_requests = CapsuleArray::at(contract_address, LOG_RETRIEVAL_REQUESTS_ARRAY_BASE_SLOT);\n\n // We create a LogRetrievalRequest for each PendingPartialNote in the CapsuleArray. Because we need the indices in\n // the request array to match the indices in the partial note array, we can't use CapsuleArray::for_each, as that\n // function has arbitrary iteration order. Instead, we manually iterate the array from the beginning and push into\n // the requests array, which we expect to be empty.\n let mut i = 0;\n let pending_partial_notes_count = pending_partial_notes.len();\n while i < pending_partial_notes_count {\n let pending_partial_note = pending_partial_notes.get(i);\n log_retrieval_requests.push(\n LogRetrievalRequest { contract_address, unsiloed_tag: pending_partial_note.note_completion_log_tag },\n );\n i += 1;\n }\n\n oracle::message_processing::bulk_retrieve_logs(\n contract_address,\n LOG_RETRIEVAL_REQUESTS_ARRAY_BASE_SLOT,\n LOG_RETRIEVAL_RESPONSES_ARRAY_BASE_SLOT,\n );\n\n CapsuleArray::at(contract_address, LOG_RETRIEVAL_RESPONSES_ARRAY_BASE_SLOT)\n}\n"
|
|
3422
|
-
},
|
|
3423
|
-
"16": {
|
|
2808
|
+
"15": {
|
|
3424
2809
|
"path": "std/embedded_curve_ops.nr",
|
|
3425
|
-
"source": "use crate::cmp::Eq;\nuse crate::hash::Hash;\nuse crate::ops::arith::{Add, Neg, Sub};\n\n/// A point on the embedded elliptic curve\n/// By definition, the base field of the embedded curve is the scalar field of the proof system curve, i.e the Noir Field.\n/// x and y denotes the Weierstrass coordinates of the point, if is_infinite is false.\npub struct EmbeddedCurvePoint {\n pub x: Field,\n pub y: Field,\n pub is_infinite: bool,\n}\n\nimpl EmbeddedCurvePoint {\n /// Elliptic curve point doubling operation\n /// returns the doubled point of a point P, i.e P+P\n pub fn double(self) -> EmbeddedCurvePoint {\n embedded_curve_add(self, self)\n }\n\n /// Returns the null element of the curve; 'the point at infinity'\n pub fn point_at_infinity() -> EmbeddedCurvePoint {\n EmbeddedCurvePoint { x: 0, y: 0, is_infinite: true }\n }\n\n /// Returns the curve's generator point.\n pub fn generator() -> EmbeddedCurvePoint {\n // Generator point for the grumpkin curve (y^2 = x^3 - 17)\n EmbeddedCurvePoint {\n x: 1,\n y: 17631683881184975370165255887551781615748388533673675138860, // sqrt(-16)\n is_infinite: false,\n }\n }\n}\n\nimpl Add for EmbeddedCurvePoint {\n /// Adds two points P+Q, using the curve addition formula, and also handles point at infinity\n fn add(self, other: EmbeddedCurvePoint) -> EmbeddedCurvePoint {\n embedded_curve_add(self, other)\n }\n}\n\nimpl Sub for EmbeddedCurvePoint {\n /// Points subtraction operation, using addition and negation\n fn sub(self, other: EmbeddedCurvePoint) -> EmbeddedCurvePoint {\n self + other.neg()\n }\n}\n\nimpl Neg for EmbeddedCurvePoint {\n /// Negates a point P, i.e returns -P, by negating the y coordinate.\n /// If the point is at infinity, then the result is also at infinity.\n fn neg(self) -> EmbeddedCurvePoint {\n EmbeddedCurvePoint { x: self.x, y: -self.y, is_infinite: self.is_infinite }\n }\n}\n\nimpl Eq for EmbeddedCurvePoint {\n /// Checks whether two points are equal\n fn eq(self: Self, b: EmbeddedCurvePoint) -> bool {\n (self.is_infinite & b.is_infinite)\n | ((self.is_infinite == b.is_infinite) & (self.x == b.x) & (self.y == b.y))\n }\n}\n\nimpl Hash for EmbeddedCurvePoint {\n fn hash<H>(self, state: &mut H)\n where\n H: crate::hash::Hasher,\n {\n if self.is_infinite {\n self.is_infinite.hash(state);\n } else {\n self.x.hash(state);\n self.y.hash(state);\n }\n }\n}\n\n/// Scalar for the embedded curve represented as low and high limbs\n/// By definition, the scalar field of the embedded curve is base field of the proving system curve.\n/// It may not fit into a Field element, so it is represented with two Field elements; its low and high limbs.\npub struct EmbeddedCurveScalar {\n pub lo: Field,\n pub hi: Field,\n}\n\nimpl EmbeddedCurveScalar {\n pub fn new(lo: Field, hi: Field) -> Self {\n EmbeddedCurveScalar { lo, hi }\n }\n\n #[field(bn254)]\n pub fn from_field(scalar: Field) -> EmbeddedCurveScalar {\n let (a, b) = crate::field::bn254::decompose(scalar);\n EmbeddedCurveScalar { lo: a, hi: b }\n }\n\n //Bytes to scalar: take the first (after the specified offset) 16 bytes of the input as the lo value, and the next 16 bytes as the hi value\n #[field(bn254)]\n pub(crate) fn from_bytes(bytes: [u8; 64], offset: u32) -> EmbeddedCurveScalar {\n let mut v = 1;\n let mut lo = 0 as Field;\n let mut hi = 0 as Field;\n for i in 0..16 {\n lo = lo + (bytes[offset + 31 - i] as Field) * v;\n hi = hi + (bytes[offset + 15 - i] as Field) * v;\n v = v * 256;\n }\n let sig_s = crate::embedded_curve_ops::EmbeddedCurveScalar { lo, hi };\n sig_s\n }\n}\n\nimpl Eq for EmbeddedCurveScalar {\n fn eq(self, other: Self) -> bool {\n (other.hi == self.hi) & (other.lo == self.lo)\n }\n}\n\nimpl Hash for EmbeddedCurveScalar {\n fn hash<H>(self, state: &mut H)\n where\n H: crate::hash::Hasher,\n {\n self.hi.hash(state);\n self.lo.hash(state);\n }\n}\n\n// Computes a multi scalar multiplication over the embedded curve.\n// For bn254, We have Grumpkin and Baby JubJub.\n// For bls12-381, we have JubJub and Bandersnatch.\n//\n// The embedded curve being used is decided by the\n// underlying proof system.\n// docs:start:multi_scalar_mul\npub fn multi_scalar_mul<let N: u32>(\n points: [EmbeddedCurvePoint; N],\n scalars: [EmbeddedCurveScalar; N],\n) -> EmbeddedCurvePoint\n// docs:end:multi_scalar_mul\n{\n multi_scalar_mul_array_return(points, scalars, true)[0]\n}\n\n#[foreign(multi_scalar_mul)]\npub(crate) fn multi_scalar_mul_array_return<let N: u32>(\n points: [EmbeddedCurvePoint; N],\n scalars: [EmbeddedCurveScalar; N],\n predicate: bool,\n) -> [EmbeddedCurvePoint; 1] {}\n\n// docs:start:fixed_base_scalar_mul\npub fn fixed_base_scalar_mul(scalar: EmbeddedCurveScalar) -> EmbeddedCurvePoint\n// docs:end:fixed_base_scalar_mul\n{\n multi_scalar_mul([EmbeddedCurvePoint::generator()], [scalar])\n}\n\n///
|
|
3426
|
-
},
|
|
3427
|
-
"165": {
|
|
3428
|
-
"path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/nullifier/utils.nr",
|
|
3429
|
-
"source": "use crate::{context::NullifierExistenceRequest, oracle::nullifiers::is_nullifier_pending};\n\nuse crate::protocol::{address::aztec_address::AztecAddress, hash::compute_siloed_nullifier};\n\n/// Returns the [NullifierExistenceRequest] used to prove a nullifier exists.\npub fn compute_nullifier_existence_request(\n unsiloed_nullifier: Field,\n contract_address: AztecAddress,\n) -> NullifierExistenceRequest {\n let pending_read_request = NullifierExistenceRequest::for_pending(unsiloed_nullifier, contract_address);\n\n let siloed_nullifier = compute_siloed_nullifier(contract_address, unsiloed_nullifier);\n let settled_read_request = NullifierExistenceRequest::for_settled(siloed_nullifier);\n\n // Safety: This is a hint to check whether we are reading a pending or settled nullifier. The chosen read request\n // will be validated by the kernel. Failure to provide a correct hint will cause the read request validation to\n // fail.\n let should_use_pending_read_request = unsafe { is_nullifier_pending(unsiloed_nullifier, contract_address) };\n\n if should_use_pending_read_request {\n pending_read_request\n } else {\n settled_read_request\n }\n}\n"
|
|
2810
|
+
"source": "use crate::cmp::Eq;\nuse crate::hash::Hash;\nuse crate::ops::arith::{Add, Neg, Sub};\n\n/// A point on the embedded elliptic curve\n/// By definition, the base field of the embedded curve is the scalar field of the proof system curve, i.e the Noir Field.\n/// x and y denotes the Weierstrass coordinates of the point, if is_infinite is false.\npub struct EmbeddedCurvePoint {\n pub x: Field,\n pub y: Field,\n pub is_infinite: bool,\n}\n\nimpl EmbeddedCurvePoint {\n /// Elliptic curve point doubling operation\n /// returns the doubled point of a point P, i.e P+P\n pub fn double(self) -> EmbeddedCurvePoint {\n embedded_curve_add(self, self)\n }\n\n /// Returns the null element of the curve; 'the point at infinity'\n pub fn point_at_infinity() -> EmbeddedCurvePoint {\n EmbeddedCurvePoint { x: 0, y: 0, is_infinite: true }\n }\n\n /// Returns the curve's generator point.\n pub fn generator() -> EmbeddedCurvePoint {\n // Generator point for the grumpkin curve (y^2 = x^3 - 17)\n EmbeddedCurvePoint {\n x: 1,\n y: 17631683881184975370165255887551781615748388533673675138860, // sqrt(-16)\n is_infinite: false,\n }\n }\n}\n\nimpl Add for EmbeddedCurvePoint {\n /// Adds two points P+Q, using the curve addition formula, and also handles point at infinity\n fn add(self, other: EmbeddedCurvePoint) -> EmbeddedCurvePoint {\n embedded_curve_add(self, other)\n }\n}\n\nimpl Sub for EmbeddedCurvePoint {\n /// Points subtraction operation, using addition and negation\n fn sub(self, other: EmbeddedCurvePoint) -> EmbeddedCurvePoint {\n self + other.neg()\n }\n}\n\nimpl Neg for EmbeddedCurvePoint {\n /// Negates a point P, i.e returns -P, by negating the y coordinate.\n /// If the point is at infinity, then the result is also at infinity.\n fn neg(self) -> EmbeddedCurvePoint {\n EmbeddedCurvePoint { x: self.x, y: -self.y, is_infinite: self.is_infinite }\n }\n}\n\nimpl Eq for EmbeddedCurvePoint {\n /// Checks whether two points are equal\n fn eq(self: Self, b: EmbeddedCurvePoint) -> bool {\n (self.is_infinite & b.is_infinite)\n | ((self.is_infinite == b.is_infinite) & (self.x == b.x) & (self.y == b.y))\n }\n}\n\nimpl Hash for EmbeddedCurvePoint {\n fn hash<H>(self, state: &mut H)\n where\n H: crate::hash::Hasher,\n {\n if self.is_infinite {\n self.is_infinite.hash(state);\n } else {\n self.x.hash(state);\n self.y.hash(state);\n }\n }\n}\n\n/// Scalar for the embedded curve represented as low and high limbs\n/// By definition, the scalar field of the embedded curve is base field of the proving system curve.\n/// It may not fit into a Field element, so it is represented with two Field elements; its low and high limbs.\npub struct EmbeddedCurveScalar {\n pub lo: Field,\n pub hi: Field,\n}\n\nimpl EmbeddedCurveScalar {\n pub fn new(lo: Field, hi: Field) -> Self {\n EmbeddedCurveScalar { lo, hi }\n }\n\n #[field(bn254)]\n pub fn from_field(scalar: Field) -> EmbeddedCurveScalar {\n let (a, b) = crate::field::bn254::decompose(scalar);\n EmbeddedCurveScalar { lo: a, hi: b }\n }\n\n //Bytes to scalar: take the first (after the specified offset) 16 bytes of the input as the lo value, and the next 16 bytes as the hi value\n #[field(bn254)]\n pub(crate) fn from_bytes(bytes: [u8; 64], offset: u32) -> EmbeddedCurveScalar {\n let mut v = 1;\n let mut lo = 0 as Field;\n let mut hi = 0 as Field;\n for i in 0..16 {\n lo = lo + (bytes[offset + 31 - i] as Field) * v;\n hi = hi + (bytes[offset + 15 - i] as Field) * v;\n v = v * 256;\n }\n let sig_s = crate::embedded_curve_ops::EmbeddedCurveScalar { lo, hi };\n sig_s\n }\n}\n\nimpl Eq for EmbeddedCurveScalar {\n fn eq(self, other: Self) -> bool {\n (other.hi == self.hi) & (other.lo == self.lo)\n }\n}\n\nimpl Hash for EmbeddedCurveScalar {\n fn hash<H>(self, state: &mut H)\n where\n H: crate::hash::Hasher,\n {\n self.hi.hash(state);\n self.lo.hash(state);\n }\n}\n\n// Computes a multi scalar multiplication over the embedded curve.\n// For bn254, We have Grumpkin and Baby JubJub.\n// For bls12-381, we have JubJub and Bandersnatch.\n//\n// The embedded curve being used is decided by the\n// underlying proof system.\n//\n// IMPORTANT: Prefer `multi_scalar_mul()` over repeated `embedded_curve_add()`\n// for adding multiple points. This is significantly more efficient.\n// For adding exactly 2 points, use `embedded_curve_add()` directly.\n// docs:start:multi_scalar_mul\npub fn multi_scalar_mul<let N: u32>(\n points: [EmbeddedCurvePoint; N],\n scalars: [EmbeddedCurveScalar; N],\n) -> EmbeddedCurvePoint\n// docs:end:multi_scalar_mul\n{\n multi_scalar_mul_array_return(points, scalars, true)[0]\n}\n\n#[foreign(multi_scalar_mul)]\npub(crate) fn multi_scalar_mul_array_return<let N: u32>(\n points: [EmbeddedCurvePoint; N],\n scalars: [EmbeddedCurveScalar; N],\n predicate: bool,\n) -> [EmbeddedCurvePoint; 1] {}\n\n// docs:start:fixed_base_scalar_mul\npub fn fixed_base_scalar_mul(scalar: EmbeddedCurveScalar) -> EmbeddedCurvePoint\n// docs:end:fixed_base_scalar_mul\n{\n multi_scalar_mul([EmbeddedCurvePoint::generator()], [scalar])\n}\n\n/// Elliptic curve addition\n/// IMPORTANT: this function is expected to perform a full addition in order to handle all corner cases:\n/// - points on the curve\n/// - point doubling\n/// - point at infinity\n/// As a result, you may not get optimal performance, depending on the assumptions of your inputs.\n// docs:start:embedded_curve_add\npub fn embedded_curve_add(\n point1: EmbeddedCurvePoint,\n point2: EmbeddedCurvePoint,\n) -> EmbeddedCurvePoint {\n // docs:end:embedded_curve_add\n if crate::runtime::is_unconstrained() {\n // avoid calling the black box function for trivial cases\n if point1.is_infinite {\n point2\n } else if point2.is_infinite {\n point1\n } else {\n embedded_curve_add_inner(point1, point2)\n }\n } else {\n embedded_curve_add_inner(point1, point2)\n }\n}\n\n#[foreign(embedded_curve_add)]\nfn embedded_curve_add_array_return(\n _point1: EmbeddedCurvePoint,\n _point2: EmbeddedCurvePoint,\n _predicate: bool,\n) -> [EmbeddedCurvePoint; 1] {}\n\n/// EC addition wrapper for the foreign function\nfn embedded_curve_add_inner(\n point1: EmbeddedCurvePoint,\n point2: EmbeddedCurvePoint,\n) -> EmbeddedCurvePoint {\n embedded_curve_add_array_return(point1, point2, true)[0]\n}\n"
|
|
3430
2811
|
},
|
|
3431
|
-
"
|
|
3432
|
-
"path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/oracle/avm.nr",
|
|
3433
|
-
"source": "//! AVM oracles.\n//!\n//! There are only available during public execution. Calling any of them from a private or utility function will\n//! result in runtime errors.\n\nuse crate::protocol::address::{AztecAddress, EthAddress};\n\npub unconstrained fn address() -> AztecAddress {\n address_opcode()\n}\npub unconstrained fn sender() -> AztecAddress {\n sender_opcode()\n}\npub unconstrained fn transaction_fee() -> Field {\n transaction_fee_opcode()\n}\npub unconstrained fn chain_id() -> Field {\n chain_id_opcode()\n}\npub unconstrained fn version() -> Field {\n version_opcode()\n}\npub unconstrained fn block_number() -> u32 {\n block_number_opcode()\n}\npub unconstrained fn timestamp() -> u64 {\n timestamp_opcode()\n}\npub unconstrained fn min_fee_per_l2_gas() -> u128 {\n min_fee_per_l2_gas_opcode()\n}\npub unconstrained fn min_fee_per_da_gas() -> u128 {\n min_fee_per_da_gas_opcode()\n}\npub unconstrained fn l2_gas_left() -> u32 {\n l2_gas_left_opcode()\n}\npub unconstrained fn da_gas_left() -> u32 {\n da_gas_left_opcode()\n}\npub unconstrained fn is_static_call() -> u1 {\n is_static_call_opcode()\n}\npub unconstrained fn note_hash_exists(note_hash: Field, leaf_index: u64) -> u1 {\n note_hash_exists_opcode(note_hash, leaf_index)\n}\npub unconstrained fn emit_note_hash(note_hash: Field) {\n emit_note_hash_opcode(note_hash)\n}\npub unconstrained fn nullifier_exists(siloed_nullifier: Field) -> u1 {\n nullifier_exists_opcode(siloed_nullifier)\n}\npub unconstrained fn emit_nullifier(nullifier: Field) {\n emit_nullifier_opcode(nullifier)\n}\npub unconstrained fn emit_public_log(message: [Field]) {\n emit_public_log_opcode(message)\n}\npub unconstrained fn l1_to_l2_msg_exists(msg_hash: Field, msg_leaf_index: u64) -> u1 {\n l1_to_l2_msg_exists_opcode(msg_hash, msg_leaf_index)\n}\npub unconstrained fn send_l2_to_l1_msg(recipient: EthAddress, content: Field) {\n send_l2_to_l1_msg_opcode(recipient, content)\n}\n\npub unconstrained fn call<let N: u32>(\n l2_gas_allocation: u32,\n da_gas_allocation: u32,\n address: AztecAddress,\n args: [Field; N],\n) {\n call_opcode(l2_gas_allocation, da_gas_allocation, address, N, args)\n}\n\npub unconstrained fn call_static<let N: u32>(\n l2_gas_allocation: u32,\n da_gas_allocation: u32,\n address: AztecAddress,\n args: [Field; N],\n) {\n call_static_opcode(l2_gas_allocation, da_gas_allocation, address, N, args)\n}\n\npub unconstrained fn calldata_copy<let N: u32>(cdoffset: u32, copy_size: u32) -> [Field; N] {\n calldata_copy_opcode(cdoffset, copy_size)\n}\n\n/// `success_copy` is placed immediately after the CALL opcode to get the success value\npub unconstrained fn success_copy() -> bool {\n success_copy_opcode()\n}\n\npub unconstrained fn returndata_size() -> u32 {\n returndata_size_opcode()\n}\n\npub unconstrained fn returndata_copy(rdoffset: u32, copy_size: u32) -> [Field] {\n returndata_copy_opcode(rdoffset, copy_size)\n}\n\n/// The additional prefix is to avoid clashing with the `return` Noir keyword.\npub unconstrained fn avm_return(returndata: [Field]) {\n return_opcode(returndata)\n}\n\n/// This opcode reverts using the exact data given. In general it should only be used to do rethrows, where the revert\n/// data is the same as the original revert data. For normal reverts, use Noir's `assert` which, on top of reverting,\n/// will also add an error selector to the revert data.\npub unconstrained fn revert(revertdata: [Field]) {\n revert_opcode(revertdata)\n}\n\npub unconstrained fn storage_read(storage_slot: Field, contract_address: Field) -> Field {\n storage_read_opcode(storage_slot, contract_address)\n}\n\npub unconstrained fn storage_write(storage_slot: Field, value: Field) {\n storage_write_opcode(storage_slot, value);\n}\n\n#[oracle(avmOpcodeAddress)]\nunconstrained fn address_opcode() -> AztecAddress {}\n\n#[oracle(avmOpcodeSender)]\nunconstrained fn sender_opcode() -> AztecAddress {}\n\n#[oracle(avmOpcodeTransactionFee)]\nunconstrained fn transaction_fee_opcode() -> Field {}\n\n#[oracle(avmOpcodeChainId)]\nunconstrained fn chain_id_opcode() -> Field {}\n\n#[oracle(avmOpcodeVersion)]\nunconstrained fn version_opcode() -> Field {}\n\n#[oracle(avmOpcodeBlockNumber)]\nunconstrained fn block_number_opcode() -> u32 {}\n\n#[oracle(avmOpcodeTimestamp)]\nunconstrained fn timestamp_opcode() -> u64 {}\n\n#[oracle(avmOpcodeMinFeePerL2Gas)]\nunconstrained fn min_fee_per_l2_gas_opcode() -> u128 {}\n\n#[oracle(avmOpcodeMinFeePerDaGas)]\nunconstrained fn min_fee_per_da_gas_opcode() -> u128 {}\n\n#[oracle(avmOpcodeL2GasLeft)]\nunconstrained fn l2_gas_left_opcode() -> u32 {}\n\n#[oracle(avmOpcodeDaGasLeft)]\nunconstrained fn da_gas_left_opcode() -> u32 {}\n\n#[oracle(avmOpcodeIsStaticCall)]\nunconstrained fn is_static_call_opcode() -> u1 {}\n\n#[oracle(avmOpcodeNoteHashExists)]\nunconstrained fn note_hash_exists_opcode(note_hash: Field, leaf_index: u64) -> u1 {}\n\n#[oracle(avmOpcodeEmitNoteHash)]\nunconstrained fn emit_note_hash_opcode(note_hash: Field) {}\n\n#[oracle(avmOpcodeNullifierExists)]\nunconstrained fn nullifier_exists_opcode(siloed_nullifier: Field) -> u1 {}\n\n#[oracle(avmOpcodeEmitNullifier)]\nunconstrained fn emit_nullifier_opcode(nullifier: Field) {}\n\n// TODO(#11124): rename unencrypted to public in avm\n#[oracle(avmOpcodeEmitUnencryptedLog)]\nunconstrained fn emit_public_log_opcode(message: [Field]) {}\n\n#[oracle(avmOpcodeL1ToL2MsgExists)]\nunconstrained fn l1_to_l2_msg_exists_opcode(msg_hash: Field, msg_leaf_index: u64) -> u1 {}\n\n#[oracle(avmOpcodeSendL2ToL1Msg)]\nunconstrained fn send_l2_to_l1_msg_opcode(recipient: EthAddress, content: Field) {}\n\n#[oracle(avmOpcodeCalldataCopy)]\nunconstrained fn calldata_copy_opcode<let N: u32>(cdoffset: u32, copy_size: u32) -> [Field; N] {}\n\n#[oracle(avmOpcodeReturndataSize)]\nunconstrained fn returndata_size_opcode() -> u32 {}\n\n#[oracle(avmOpcodeReturndataCopy)]\nunconstrained fn returndata_copy_opcode(rdoffset: u32, copy_size: u32) -> [Field] {}\n\n#[oracle(avmOpcodeReturn)]\nunconstrained fn return_opcode(returndata: [Field]) {}\n\n#[oracle(avmOpcodeRevert)]\nunconstrained fn revert_opcode(revertdata: [Field]) {}\n\n// While the length parameter might seem unnecessary given that we have N we keep it around because at the AVM bytecode\n// level, we want to support non-comptime-known lengths for such opcodes, even if Noir code will not generally take\n// that route.\n#[oracle(avmOpcodeCall)]\nunconstrained fn call_opcode<let N: u32>(\n l2_gas_allocation: u32,\n da_gas_allocation: u32,\n address: AztecAddress,\n length: u32,\n args: [Field; N],\n) {}\n\n// While the length parameter might seem unnecessary given that we have N we keep it around because at the AVM bytecode\n// level, we want to support non-comptime-known lengths for such opcodes, even if Noir code will not generally take\n// that route.\n#[oracle(avmOpcodeStaticCall)]\nunconstrained fn call_static_opcode<let N: u32>(\n l2_gas_allocation: u32,\n da_gas_allocation: u32,\n address: AztecAddress,\n length: u32,\n args: [Field; N],\n) {}\n\n#[oracle(avmOpcodeSuccessCopy)]\nunconstrained fn success_copy_opcode() -> bool {}\n\n#[oracle(avmOpcodeStorageRead)]\nunconstrained fn storage_read_opcode(storage_slot: Field, contract_address: Field) -> Field {}\n\n#[oracle(avmOpcodeStorageWrite)]\nunconstrained fn storage_write_opcode(storage_slot: Field, value: Field) {}\n"
|
|
3434
|
-
},
|
|
3435
|
-
"17": {
|
|
2812
|
+
"16": {
|
|
3436
2813
|
"path": "std/field/bn254.nr",
|
|
3437
2814
|
"source": "use crate::field::field_less_than;\nuse crate::runtime::is_unconstrained;\n\n// The low and high decomposition of the field modulus\npub(crate) global PLO: Field = 53438638232309528389504892708671455233;\npub(crate) global PHI: Field = 64323764613183177041862057485226039389;\n\npub(crate) global TWO_POW_128: Field = 0x100000000000000000000000000000000;\n\n// Decomposes a single field into two 16 byte fields.\nfn compute_decomposition(x: Field) -> (Field, Field) {\n // Here's we're taking advantage of truncating 128 bit limbs from the input field\n // and then subtracting them from the input such the field division is equivalent to integer division.\n let low = (x as u128) as Field;\n let high = (x - low) / TWO_POW_128;\n\n (low, high)\n}\n\npub(crate) unconstrained fn decompose_hint(x: Field) -> (Field, Field) {\n compute_decomposition(x)\n}\n\nunconstrained fn lte_hint(x: Field, y: Field) -> bool {\n if x == y {\n true\n } else {\n field_less_than(x, y)\n }\n}\n\n// Assert that (alo > blo && ahi >= bhi) || (alo <= blo && ahi > bhi)\nfn assert_gt_limbs(a: (Field, Field), b: (Field, Field)) {\n let (alo, ahi) = a;\n let (blo, bhi) = b;\n // Safety: borrow is enforced to be boolean due to its type.\n // if borrow is 0, it asserts that (alo > blo && ahi >= bhi)\n // if borrow is 1, it asserts that (alo <= blo && ahi > bhi)\n unsafe {\n let borrow = lte_hint(alo, blo);\n\n let rlo = alo - blo - 1 + (borrow as Field) * TWO_POW_128;\n let rhi = ahi - bhi - (borrow as Field);\n\n rlo.assert_max_bit_size::<128>();\n rhi.assert_max_bit_size::<128>();\n }\n}\n\n/// Decompose a single field into two 16 byte fields.\npub fn decompose(x: Field) -> (Field, Field) {\n if is_unconstrained() {\n compute_decomposition(x)\n } else {\n // Safety: decomposition is properly checked below\n unsafe {\n // Take hints of the decomposition\n let (xlo, xhi) = decompose_hint(x);\n\n // Range check the limbs\n xlo.assert_max_bit_size::<128>();\n xhi.assert_max_bit_size::<128>();\n\n // Check that the decomposition is correct\n assert_eq(x, xlo + TWO_POW_128 * xhi);\n\n // Assert that the decomposition of P is greater than the decomposition of x\n assert_gt_limbs((PLO, PHI), (xlo, xhi));\n (xlo, xhi)\n }\n }\n}\n\npub fn assert_gt(a: Field, b: Field) {\n if is_unconstrained() {\n assert(\n // Safety: already unconstrained\n unsafe { field_less_than(b, a) },\n );\n } else {\n // Decompose a and b\n let a_limbs = decompose(a);\n let b_limbs = decompose(b);\n\n // Assert that a_limbs is greater than b_limbs\n assert_gt_limbs(a_limbs, b_limbs)\n }\n}\n\npub fn assert_lt(a: Field, b: Field) {\n assert_gt(b, a);\n}\n\npub fn gt(a: Field, b: Field) -> bool {\n if is_unconstrained() {\n // Safety: unsafe in unconstrained\n unsafe {\n field_less_than(b, a)\n }\n } else if a == b {\n false\n } else {\n // Safety: Take a hint of the comparison and verify it\n unsafe {\n if field_less_than(a, b) {\n assert_gt(b, a);\n false\n } else {\n assert_gt(a, b);\n true\n }\n }\n }\n}\n\npub fn lt(a: Field, b: Field) -> bool {\n gt(b, a)\n}\n\nmod tests {\n // TODO: Allow imports from \"super\"\n use crate::field::bn254::{assert_gt, decompose, gt, lt, lte_hint, PHI, PLO, TWO_POW_128};\n\n #[test]\n fn check_decompose() {\n assert_eq(decompose(TWO_POW_128), (0, 1));\n assert_eq(decompose(TWO_POW_128 + 0x1234567890), (0x1234567890, 1));\n assert_eq(decompose(0x1234567890), (0x1234567890, 0));\n }\n\n #[test]\n unconstrained fn check_lte_hint() {\n assert(lte_hint(0, 1));\n assert(lte_hint(0, 0x100));\n assert(lte_hint(0x100, TWO_POW_128 - 1));\n assert(!lte_hint(0 - 1, 0));\n\n assert(lte_hint(0, 0));\n assert(lte_hint(0x100, 0x100));\n assert(lte_hint(0 - 1, 0 - 1));\n }\n\n #[test]\n fn check_gt() {\n assert(gt(1, 0));\n assert(gt(0x100, 0));\n assert(gt((0 - 1), (0 - 2)));\n assert(gt(TWO_POW_128, 0));\n assert(!gt(0, 0));\n assert(!gt(0, 0x100));\n assert(gt(0 - 1, 0 - 2));\n assert(!gt(0 - 2, 0 - 1));\n assert_gt(0 - 1, 0);\n }\n\n #[test]\n fn check_plo_phi() {\n assert_eq(PLO + PHI * TWO_POW_128, 0);\n let p_bytes = crate::field::modulus_le_bytes();\n let mut p_low: Field = 0;\n let mut p_high: Field = 0;\n\n let mut offset = 1;\n for i in 0..16 {\n p_low += (p_bytes[i] as Field) * offset;\n p_high += (p_bytes[i + 16] as Field) * offset;\n offset *= 256;\n }\n assert_eq(p_low, PLO);\n assert_eq(p_high, PHI);\n }\n\n #[test]\n fn check_decompose_edge_cases() {\n assert_eq(decompose(0), (0, 0));\n assert_eq(decompose(TWO_POW_128 - 1), (TWO_POW_128 - 1, 0));\n assert_eq(decompose(TWO_POW_128 + 1), (1, 1));\n assert_eq(decompose(TWO_POW_128 * 2), (0, 2));\n assert_eq(decompose(TWO_POW_128 * 2 + 0x1234567890), (0x1234567890, 2));\n }\n\n #[test]\n fn check_decompose_large_values() {\n let large_field = 0xffffffffffffffff;\n let (lo, hi) = decompose(large_field);\n assert_eq(large_field, lo + TWO_POW_128 * hi);\n\n let large_value = large_field - TWO_POW_128;\n let (lo2, hi2) = decompose(large_value);\n assert_eq(large_value, lo2 + TWO_POW_128 * hi2);\n }\n\n #[test]\n fn check_lt_comprehensive() {\n assert(lt(0, 1));\n assert(!lt(1, 0));\n assert(!lt(0, 0));\n assert(!lt(42, 42));\n\n assert(lt(TWO_POW_128 - 1, TWO_POW_128));\n assert(!lt(TWO_POW_128, TWO_POW_128 - 1));\n }\n}\n"
|
|
3438
2815
|
},
|
|
3439
|
-
"
|
|
3440
|
-
"path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/oracle/capsules.nr",
|
|
3441
|
-
"source": "use crate::protocol::{address::AztecAddress, traits::{Deserialize, Serialize}};\n\n/// Stores arbitrary information in a per-contract non-volatile database, which can later be retrieved with `load`. If\n/// data was already stored at this slot, it is overwritten.\npub unconstrained fn store<T>(contract_address: AztecAddress, slot: Field, value: T)\nwhere\n T: Serialize,\n{\n let serialized = value.serialize();\n store_oracle(contract_address, slot, serialized);\n}\n\n/// Returns data previously stored via `storeCapsule` in the per-contract non-volatile database. Returns Option::none()\n/// if nothing was stored at the given slot.\npub unconstrained fn load<T>(contract_address: AztecAddress, slot: Field) -> Option<T>\nwhere\n T: Deserialize,\n{\n let serialized_option = load_oracle(contract_address, slot, <T as Deserialize>::N);\n serialized_option.map(|arr| Deserialize::deserialize(arr))\n}\n\n/// Deletes data in the per-contract non-volatile database. Does nothing if no data was present.\npub unconstrained fn delete(contract_address: AztecAddress, slot: Field) {\n delete_oracle(contract_address, slot);\n}\n\n/// Copies a number of contiguous entries in the per-contract non-volatile database. This allows for efficient data\n/// structures by avoiding repeated calls to `loadCapsule` and `storeCapsule`. Supports overlapping source and\n/// destination regions (which will result in the overlapped source values being overwritten). All copied slots must\n/// exist in the database (i.e. have been stored and not deleted)\npub unconstrained fn copy(contract_address: AztecAddress, src_slot: Field, dst_slot: Field, num_entries: u32) {\n copy_oracle(contract_address, src_slot, dst_slot, num_entries);\n}\n\n#[oracle(utilityStoreCapsule)]\nunconstrained fn store_oracle<let N: u32>(contract_address: AztecAddress, slot: Field, values: [Field; N]) {}\n\n/// We need to pass in `array_len` (the value of N) as a parameter to tell the oracle how many fields the response must\n/// have.\n///\n/// Note that the oracle returns an Option<[Field; N]> because we cannot return an Option<T> directly. That would\n/// require for the oracle resolver to know the shape of T (e.g. if T were a struct of 3 u32 values then the expected\n/// response shape would be 3 single items, whereas it were a struct containing `u32, [Field;10], u32` then the\n/// expected shape would be single, array, single.). Instead, we return the serialization and deserialize in Noir.\n#[oracle(utilityLoadCapsule)]\nunconstrained fn load_oracle<let N: u32>(\n contract_address: AztecAddress,\n slot: Field,\n array_len: u32,\n) -> Option<[Field; N]> {}\n\n#[oracle(utilityDeleteCapsule)]\nunconstrained fn delete_oracle(contract_address: AztecAddress, slot: Field) {}\n\n#[oracle(utilityCopyCapsule)]\nunconstrained fn copy_oracle(contract_address: AztecAddress, src_slot: Field, dst_slot: Field, num_entries: u32) {}\n\nmod test {\n // These tests are sort of redundant since we already test the oracle implementation directly in TypeScript, but\n // they are cheap regardless and help ensure both that the TXE implementation works accordingly and that the Noir\n // oracles are hooked up correctly.\n\n use crate::{\n oracle::capsules::{copy, delete, load, store},\n test::{helpers::test_environment::TestEnvironment, mocks::MockStruct},\n };\n use crate::protocol::{address::AztecAddress, traits::{FromField, ToField}};\n\n global SLOT: Field = 1;\n\n #[test]\n unconstrained fn stores_and_loads() {\n let env = TestEnvironment::new();\n env.private_context(|context| {\n let contract_address = context.this_address();\n\n let value = MockStruct::new(5, 6);\n store(contract_address, SLOT, value);\n\n assert_eq(load(contract_address, SLOT).unwrap(), value);\n });\n }\n\n #[test]\n unconstrained fn store_overwrites() {\n let env = TestEnvironment::new();\n env.private_context(|context| {\n let contract_address = context.this_address();\n\n let value = MockStruct::new(5, 6);\n store(contract_address, SLOT, value);\n\n let new_value = MockStruct::new(7, 8);\n store(contract_address, SLOT, new_value);\n\n assert_eq(load(contract_address, SLOT).unwrap(), new_value);\n });\n }\n\n #[test]\n unconstrained fn loads_empty_slot() {\n let env = TestEnvironment::new();\n env.private_context(|context| {\n let contract_address = context.this_address();\n\n let loaded_value: Option<MockStruct> = load(contract_address, SLOT);\n assert_eq(loaded_value, Option::none());\n });\n }\n\n #[test]\n unconstrained fn deletes_stored_value() {\n let env = TestEnvironment::new();\n env.private_context(|context| {\n let contract_address = context.this_address();\n\n let value = MockStruct::new(5, 6);\n store(contract_address, SLOT, value);\n delete(contract_address, SLOT);\n\n let loaded_value: Option<MockStruct> = load(contract_address, SLOT);\n assert_eq(loaded_value, Option::none());\n });\n }\n\n #[test]\n unconstrained fn deletes_empty_slot() {\n let env = TestEnvironment::new();\n env.private_context(|context| {\n let contract_address = context.this_address();\n\n delete(contract_address, SLOT);\n let loaded_value: Option<MockStruct> = load(contract_address, SLOT);\n assert_eq(loaded_value, Option::none());\n });\n }\n\n #[test]\n unconstrained fn copies_non_overlapping_values() {\n let env = TestEnvironment::new();\n env.private_context(|context| {\n let contract_address = context.this_address();\n\n let src = 5;\n\n let values = [MockStruct::new(5, 6), MockStruct::new(7, 8), MockStruct::new(9, 10)];\n store(contract_address, src, values[0]);\n store(contract_address, src + 1, values[1]);\n store(contract_address, src + 2, values[2]);\n\n let dst = 10;\n copy(contract_address, src, dst, 3);\n\n assert_eq(load(contract_address, dst).unwrap(), values[0]);\n assert_eq(load(contract_address, dst + 1).unwrap(), values[1]);\n assert_eq(load(contract_address, dst + 2).unwrap(), values[2]);\n });\n }\n\n #[test]\n unconstrained fn copies_overlapping_values_with_src_ahead() {\n let env = TestEnvironment::new();\n env.private_context(|context| {\n let contract_address = context.this_address();\n\n let src = 1;\n\n let values = [MockStruct::new(5, 6), MockStruct::new(7, 8), MockStruct::new(9, 10)];\n store(contract_address, src, values[0]);\n store(contract_address, src + 1, values[1]);\n store(contract_address, src + 2, values[2]);\n\n let dst = 2;\n copy(contract_address, src, dst, 3);\n\n assert_eq(load(contract_address, dst).unwrap(), values[0]);\n assert_eq(load(contract_address, dst + 1).unwrap(), values[1]);\n assert_eq(load(contract_address, dst + 2).unwrap(), values[2]);\n\n // src[1] and src[2] should have been overwritten since they are also dst[0] and dst[1]\n assert_eq(load(contract_address, src).unwrap(), values[0]); // src[0] (unchanged)\n assert_eq(load(contract_address, src + 1).unwrap(), values[0]); // dst[0]\n assert_eq(load(contract_address, src + 2).unwrap(), values[1]); // dst[1]\n });\n }\n\n #[test]\n unconstrained fn copies_overlapping_values_with_dst_ahead() {\n let env = TestEnvironment::new();\n env.private_context(|context| {\n let contract_address = context.this_address();\n\n let src = 2;\n\n let values = [MockStruct::new(5, 6), MockStruct::new(7, 8), MockStruct::new(9, 10)];\n store(contract_address, src, values[0]);\n store(contract_address, src + 1, values[1]);\n store(contract_address, src + 2, values[2]);\n\n let dst = 1;\n copy(contract_address, src, dst, 3);\n\n assert_eq(load(contract_address, dst).unwrap(), values[0]);\n assert_eq(load(contract_address, dst + 1).unwrap(), values[1]);\n assert_eq(load(contract_address, dst + 2).unwrap(), values[2]);\n\n // src[0] and src[1] should have been overwritten since they are also dst[1] and dst[2]\n assert_eq(load(contract_address, src).unwrap(), values[1]); // dst[1]\n assert_eq(load(contract_address, src + 1).unwrap(), values[2]); // dst[2]\n assert_eq(load(contract_address, src + 2).unwrap(), values[2]); // src[2] (unchanged)\n });\n }\n\n #[test(should_fail_with = \"copy empty slot\")]\n unconstrained fn cannot_copy_empty_values() {\n let env = TestEnvironment::new();\n env.private_context(|context| {\n let contract_address = context.this_address();\n\n copy(contract_address, SLOT, SLOT, 1);\n });\n }\n\n #[test(should_fail_with = \"not allowed to access\")]\n unconstrained fn cannot_store_other_contract() {\n let env = TestEnvironment::new();\n env.private_context(|context| {\n let contract_address = context.this_address();\n let other_contract_address = AztecAddress::from_field(contract_address.to_field() + 1);\n\n let value = MockStruct::new(5, 6);\n store(other_contract_address, SLOT, value);\n });\n }\n\n #[test(should_fail_with = \"not allowed to access\")]\n unconstrained fn cannot_load_other_contract() {\n let env = TestEnvironment::new();\n env.private_context(|context| {\n let contract_address = context.this_address();\n let other_contract_address = AztecAddress::from_field(contract_address.to_field() + 1);\n\n let _: Option<MockStruct> = load(other_contract_address, SLOT);\n });\n }\n\n #[test(should_fail_with = \"not allowed to access\")]\n unconstrained fn cannot_delete_other_contract() {\n let env = TestEnvironment::new();\n env.private_context(|context| {\n let contract_address = context.this_address();\n let other_contract_address = AztecAddress::from_field(contract_address.to_field() + 1);\n\n delete(other_contract_address, SLOT);\n });\n }\n\n #[test(should_fail_with = \"not allowed to access\")]\n unconstrained fn cannot_copy_other_contract() {\n let env = TestEnvironment::new();\n env.private_context(|context| {\n let contract_address = context.this_address();\n let other_contract_address = AztecAddress::from_field(contract_address.to_field() + 1);\n\n copy(other_contract_address, SLOT, SLOT, 0);\n });\n }\n}\n"
|
|
3442
|
-
},
|
|
3443
|
-
"172": {
|
|
3444
|
-
"path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/oracle/enqueue_public_function_call.nr",
|
|
3445
|
-
"source": "use crate::protocol::address::AztecAddress;\n\n#[oracle(privateNotifyEnqueuedPublicFunctionCall)]\nunconstrained fn notify_enqueued_public_function_call_oracle(\n _contract_address: AztecAddress,\n _calldata_hash: Field,\n _side_effect_counter: u32,\n _is_static_call: bool,\n) {}\n\nunconstrained fn notify_enqueued_public_function_call_wrapper(\n contract_address: AztecAddress,\n calldata_hash: Field,\n side_effect_counter: u32,\n is_static_call: bool,\n) {\n notify_enqueued_public_function_call_oracle(\n contract_address,\n calldata_hash,\n side_effect_counter,\n is_static_call,\n )\n}\n\npub fn notify_enqueued_public_function_call(\n contract_address: AztecAddress,\n calldata_hash: Field,\n side_effect_counter: u32,\n is_static_call: bool,\n) {\n // Safety: Notifies the simulator that a public call has been enqueued, allowing it to prepare hints for the AVM to\n // process this call.\n unsafe {\n notify_enqueued_public_function_call_wrapper(\n contract_address,\n calldata_hash,\n side_effect_counter,\n is_static_call,\n )\n }\n}\n\n#[oracle(privateNotifySetPublicTeardownFunctionCall)]\nunconstrained fn notify_set_public_teardown_function_call_oracle(\n _contract_address: AztecAddress,\n _calldata_hash: Field,\n _side_effect_counter: u32,\n _is_static_call: bool,\n) {}\n\nunconstrained fn notify_set_public_teardown_function_call_wrapper(\n contract_address: AztecAddress,\n calldata_hash: Field,\n side_effect_counter: u32,\n is_static_call: bool,\n) {\n notify_set_public_teardown_function_call_oracle(\n contract_address,\n calldata_hash,\n side_effect_counter,\n is_static_call,\n )\n}\n\npub fn notify_set_public_teardown_function_call(\n contract_address: AztecAddress,\n calldata_hash: Field,\n side_effect_counter: u32,\n is_static_call: bool,\n) {\n // Safety: Notifies the simulator that a teardown call has been set, allowing it to prepare hints for the AVM to\n // process this call.\n unsafe {\n notify_set_public_teardown_function_call_wrapper(\n contract_address,\n calldata_hash,\n side_effect_counter,\n is_static_call,\n )\n }\n}\n\npub fn notify_set_min_revertible_side_effect_counter(counter: u32) {\n // Safety: This oracle call returns nothing: we only call it for its side effects. It is therefore always safe to\n // call.\n unsafe { notify_set_min_revertible_side_effect_counter_oracle_wrapper(counter) };\n}\n\npub unconstrained fn notify_set_min_revertible_side_effect_counter_oracle_wrapper(counter: u32) {\n notify_set_min_revertible_side_effect_counter_oracle(counter);\n}\n\n#[oracle(privateNotifySetMinRevertibleSideEffectCounter)]\nunconstrained fn notify_set_min_revertible_side_effect_counter_oracle(_counter: u32) {}\n\npub unconstrained fn is_side_effect_counter_revertible_oracle_wrapper(counter: u32) -> bool {\n is_side_effect_counter_revertible_oracle(counter)\n}\n\n#[oracle(privateIsSideEffectCounterRevertible)]\nunconstrained fn is_side_effect_counter_revertible_oracle(counter: u32) -> bool {}\n"
|
|
3446
|
-
},
|
|
3447
|
-
"173": {
|
|
3448
|
-
"path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/oracle/execution.nr",
|
|
3449
|
-
"source": "use crate::context::UtilityContext;\n\n#[oracle(utilityGetUtilityContext)]\nunconstrained fn get_utility_context_oracle() -> UtilityContext {}\n\n/// Returns a utility context built from the global variables of anchor block and the contract address of the function\n/// being executed.\npub unconstrained fn get_utility_context() -> UtilityContext {\n get_utility_context_oracle()\n}\n"
|
|
3450
|
-
},
|
|
3451
|
-
"18": {
|
|
2816
|
+
"17": {
|
|
3452
2817
|
"path": "std/field/mod.nr",
|
|
3453
2818
|
"source": "pub mod bn254;\nuse crate::{runtime::is_unconstrained, static_assert};\nuse bn254::lt as bn254_lt;\n\nimpl Field {\n /// Asserts that `self` can be represented in `bit_size` bits.\n ///\n /// # Failures\n /// Causes a constraint failure for `Field` values exceeding `2^{bit_size}`.\n // docs:start:assert_max_bit_size\n pub fn assert_max_bit_size<let BIT_SIZE: u32>(self) {\n // docs:end:assert_max_bit_size\n static_assert(\n BIT_SIZE < modulus_num_bits() as u32,\n \"BIT_SIZE must be less than modulus_num_bits\",\n );\n __assert_max_bit_size(self, BIT_SIZE);\n }\n\n /// Decomposes `self` into its little endian bit decomposition as a `[u1; N]` array.\n /// This array will be zero padded should not all bits be necessary to represent `self`.\n ///\n /// # Failures\n /// Causes a constraint failure for `Field` values exceeding `2^N` as the resulting array will not\n /// be able to represent the original `Field`.\n ///\n /// # Safety\n /// The bit decomposition returned is canonical and is guaranteed to not overflow the modulus.\n // docs:start:to_le_bits\n pub fn to_le_bits<let N: u32>(self: Self) -> [u1; N] {\n // docs:end:to_le_bits\n let bits = __to_le_bits(self);\n\n if !is_unconstrained() {\n // Ensure that the byte decomposition does not overflow the modulus\n let p = modulus_le_bits();\n assert(bits.len() <= p.len());\n let mut ok = bits.len() != p.len();\n for i in 0..N {\n if !ok {\n if (bits[N - 1 - i] != p[N - 1 - i]) {\n assert(p[N - 1 - i] == 1);\n ok = true;\n }\n }\n }\n assert(ok);\n }\n bits\n }\n\n /// Decomposes `self` into its big endian bit decomposition as a `[u1; N]` array.\n /// This array will be zero padded should not all bits be necessary to represent `self`.\n ///\n /// # Failures\n /// Causes a constraint failure for `Field` values exceeding `2^N` as the resulting array will not\n /// be able to represent the original `Field`.\n ///\n /// # Safety\n /// The bit decomposition returned is canonical and is guaranteed to not overflow the modulus.\n // docs:start:to_be_bits\n pub fn to_be_bits<let N: u32>(self: Self) -> [u1; N] {\n // docs:end:to_be_bits\n let bits = __to_be_bits(self);\n\n if !is_unconstrained() {\n // Ensure that the decomposition does not overflow the modulus\n let p = modulus_be_bits();\n assert(bits.len() <= p.len());\n let mut ok = bits.len() != p.len();\n for i in 0..N {\n if !ok {\n if (bits[i] != p[i]) {\n assert(p[i] == 1);\n ok = true;\n }\n }\n }\n assert(ok);\n }\n bits\n }\n\n /// Decomposes `self` into its little endian byte decomposition as a `[u8;N]` array\n /// This array will be zero padded should not all bytes be necessary to represent `self`.\n ///\n /// # Failures\n /// The length N of the array must be big enough to contain all the bytes of the 'self',\n /// and no more than the number of bytes required to represent the field modulus\n ///\n /// # Safety\n /// The result is ensured to be the canonical decomposition of the field element\n // docs:start:to_le_bytes\n pub fn to_le_bytes<let N: u32>(self: Self) -> [u8; N] {\n // docs:end:to_le_bytes\n static_assert(\n N <= modulus_le_bytes().len(),\n \"N must be less than or equal to modulus_le_bytes().len()\",\n );\n // Compute the byte decomposition\n let bytes = self.to_le_radix(256);\n\n if !is_unconstrained() {\n // Ensure that the byte decomposition does not overflow the modulus\n let p = modulus_le_bytes();\n assert(bytes.len() <= p.len());\n let mut ok = bytes.len() != p.len();\n for i in 0..N {\n if !ok {\n if (bytes[N - 1 - i] != p[N - 1 - i]) {\n assert(bytes[N - 1 - i] < p[N - 1 - i]);\n ok = true;\n }\n }\n }\n assert(ok);\n }\n bytes\n }\n\n /// Decomposes `self` into its big endian byte decomposition as a `[u8;N]` array of length required to represent the field modulus\n /// This array will be zero padded should not all bytes be necessary to represent `self`.\n ///\n /// # Failures\n /// The length N of the array must be big enough to contain all the bytes of the 'self',\n /// and no more than the number of bytes required to represent the field modulus\n ///\n /// # Safety\n /// The result is ensured to be the canonical decomposition of the field element\n // docs:start:to_be_bytes\n pub fn to_be_bytes<let N: u32>(self: Self) -> [u8; N] {\n // docs:end:to_be_bytes\n static_assert(\n N <= modulus_le_bytes().len(),\n \"N must be less than or equal to modulus_le_bytes().len()\",\n );\n // Compute the byte decomposition\n let bytes = self.to_be_radix(256);\n\n if !is_unconstrained() {\n // Ensure that the byte decomposition does not overflow the modulus\n let p = modulus_be_bytes();\n assert(bytes.len() <= p.len());\n let mut ok = bytes.len() != p.len();\n for i in 0..N {\n if !ok {\n if (bytes[i] != p[i]) {\n assert(bytes[i] < p[i]);\n ok = true;\n }\n }\n }\n assert(ok);\n }\n bytes\n }\n\n fn to_le_radix<let N: u32>(self: Self, radix: u32) -> [u8; N] {\n // Brillig does not need an immediate radix\n if !crate::runtime::is_unconstrained() {\n static_assert(1 < radix, \"radix must be greater than 1\");\n static_assert(radix <= 256, \"radix must be less than or equal to 256\");\n static_assert(radix & (radix - 1) == 0, \"radix must be a power of 2\");\n }\n __to_le_radix(self, radix)\n }\n\n fn to_be_radix<let N: u32>(self: Self, radix: u32) -> [u8; N] {\n // Brillig does not need an immediate radix\n if !crate::runtime::is_unconstrained() {\n static_assert(1 < radix, \"radix must be greater than 1\");\n static_assert(radix <= 256, \"radix must be less than or equal to 256\");\n static_assert(radix & (radix - 1) == 0, \"radix must be a power of 2\");\n }\n __to_be_radix(self, radix)\n }\n\n // Returns self to the power of the given exponent value.\n // Caution: we assume the exponent fits into 32 bits\n // using a bigger bit size impacts negatively the performance and should be done only if the exponent does not fit in 32 bits\n pub fn pow_32(self, exponent: Field) -> Field {\n let mut r: Field = 1;\n let b: [u1; 32] = exponent.to_le_bits();\n\n for i in 1..33 {\n r *= r;\n r = (b[32 - i] as Field) * (r * self) + (1 - b[32 - i] as Field) * r;\n }\n r\n }\n\n // Parity of (prime) Field element, i.e. sgn0(x mod p) = 0 if x `elem` {0, ..., p-1} is even, otherwise sgn0(x mod p) = 1.\n pub fn sgn0(self) -> u1 {\n self as u1\n }\n\n pub fn lt(self, another: Field) -> bool {\n if crate::compat::is_bn254() {\n bn254_lt(self, another)\n } else {\n lt_fallback(self, another)\n }\n }\n\n /// Convert a little endian byte array to a field element.\n /// If the provided byte array overflows the field modulus then the Field will silently wrap around.\n pub fn from_le_bytes<let N: u32>(bytes: [u8; N]) -> Field {\n static_assert(\n N <= modulus_le_bytes().len(),\n \"N must be less than or equal to modulus_le_bytes().len()\",\n );\n let mut v = 1;\n let mut result = 0;\n\n for i in 0..N {\n result += (bytes[i] as Field) * v;\n v = v * 256;\n }\n result\n }\n\n /// Convert a big endian byte array to a field element.\n /// If the provided byte array overflows the field modulus then the Field will silently wrap around.\n pub fn from_be_bytes<let N: u32>(bytes: [u8; N]) -> Field {\n let mut v = 1;\n let mut result = 0;\n\n for i in 0..N {\n result += (bytes[N - 1 - i] as Field) * v;\n v = v * 256;\n }\n result\n }\n}\n\n#[builtin(apply_range_constraint)]\nfn __assert_max_bit_size(value: Field, bit_size: u32) {}\n\n// `_radix` must be less than 256\n#[builtin(to_le_radix)]\nfn __to_le_radix<let N: u32>(value: Field, radix: u32) -> [u8; N] {}\n\n// `_radix` must be less than 256\n#[builtin(to_be_radix)]\nfn __to_be_radix<let N: u32>(value: Field, radix: u32) -> [u8; N] {}\n\n/// Decomposes `self` into its little endian bit decomposition as a `[u1; N]` array.\n/// This array will be zero padded should not all bits be necessary to represent `self`.\n///\n/// # Failures\n/// Causes a constraint failure for `Field` values exceeding `2^N` as the resulting array will not\n/// be able to represent the original `Field`.\n///\n/// # Safety\n/// Values of `N` equal to or greater than the number of bits necessary to represent the `Field` modulus\n/// (e.g. 254 for the BN254 field) allow for multiple bit decompositions. This is due to how the `Field` will\n/// wrap around due to overflow when verifying the decomposition.\n#[builtin(to_le_bits)]\nfn __to_le_bits<let N: u32>(value: Field) -> [u1; N] {}\n\n/// Decomposes `self` into its big endian bit decomposition as a `[u1; N]` array.\n/// This array will be zero padded should not all bits be necessary to represent `self`.\n///\n/// # Failures\n/// Causes a constraint failure for `Field` values exceeding `2^N` as the resulting array will not\n/// be able to represent the original `Field`.\n///\n/// # Safety\n/// Values of `N` equal to or greater than the number of bits necessary to represent the `Field` modulus\n/// (e.g. 254 for the BN254 field) allow for multiple bit decompositions. This is due to how the `Field` will\n/// wrap around due to overflow when verifying the decomposition.\n#[builtin(to_be_bits)]\nfn __to_be_bits<let N: u32>(value: Field) -> [u1; N] {}\n\n#[builtin(modulus_num_bits)]\npub comptime fn modulus_num_bits() -> u64 {}\n\n#[builtin(modulus_be_bits)]\npub comptime fn modulus_be_bits() -> [u1] {}\n\n#[builtin(modulus_le_bits)]\npub comptime fn modulus_le_bits() -> [u1] {}\n\n#[builtin(modulus_be_bytes)]\npub comptime fn modulus_be_bytes() -> [u8] {}\n\n#[builtin(modulus_le_bytes)]\npub comptime fn modulus_le_bytes() -> [u8] {}\n\n/// An unconstrained only built in to efficiently compare fields.\n#[builtin(field_less_than)]\nunconstrained fn __field_less_than(x: Field, y: Field) -> bool {}\n\npub(crate) unconstrained fn field_less_than(x: Field, y: Field) -> bool {\n __field_less_than(x, y)\n}\n\n// Convert a 32 byte array to a field element by modding\npub fn bytes32_to_field(bytes32: [u8; 32]) -> Field {\n // Convert it to a field element\n let mut v = 1;\n let mut high = 0 as Field;\n let mut low = 0 as Field;\n\n for i in 0..16 {\n high = high + (bytes32[15 - i] as Field) * v;\n low = low + (bytes32[16 + 15 - i] as Field) * v;\n v = v * 256;\n }\n // Abuse that a % p + b % p = (a + b) % p and that low < p\n low + high * v\n}\n\nfn lt_fallback(x: Field, y: Field) -> bool {\n if is_unconstrained() {\n // Safety: unconstrained context\n unsafe {\n field_less_than(x, y)\n }\n } else {\n let x_bytes: [u8; 32] = x.to_le_bytes();\n let y_bytes: [u8; 32] = y.to_le_bytes();\n let mut x_is_lt = false;\n let mut done = false;\n for i in 0..32 {\n if (!done) {\n let x_byte = x_bytes[32 - 1 - i] as u8;\n let y_byte = y_bytes[32 - 1 - i] as u8;\n let bytes_match = x_byte == y_byte;\n if !bytes_match {\n x_is_lt = x_byte < y_byte;\n done = true;\n }\n }\n }\n x_is_lt\n }\n}\n\nmod tests {\n use crate::{panic::panic, runtime, static_assert};\n use super::{\n field_less_than, modulus_be_bits, modulus_be_bytes, modulus_le_bits, modulus_le_bytes,\n };\n\n #[test]\n // docs:start:to_be_bits_example\n fn test_to_be_bits() {\n let field = 2;\n let bits: [u1; 8] = field.to_be_bits();\n assert_eq(bits, [0, 0, 0, 0, 0, 0, 1, 0]);\n }\n // docs:end:to_be_bits_example\n\n #[test]\n // docs:start:to_le_bits_example\n fn test_to_le_bits() {\n let field = 2;\n let bits: [u1; 8] = field.to_le_bits();\n assert_eq(bits, [0, 1, 0, 0, 0, 0, 0, 0]);\n }\n // docs:end:to_le_bits_example\n\n #[test]\n // docs:start:to_be_bytes_example\n fn test_to_be_bytes() {\n let field = 2;\n let bytes: [u8; 8] = field.to_be_bytes();\n assert_eq(bytes, [0, 0, 0, 0, 0, 0, 0, 2]);\n assert_eq(Field::from_be_bytes::<8>(bytes), field);\n }\n // docs:end:to_be_bytes_example\n\n #[test]\n // docs:start:to_le_bytes_example\n fn test_to_le_bytes() {\n let field = 2;\n let bytes: [u8; 8] = field.to_le_bytes();\n assert_eq(bytes, [2, 0, 0, 0, 0, 0, 0, 0]);\n assert_eq(Field::from_le_bytes::<8>(bytes), field);\n }\n // docs:end:to_le_bytes_example\n\n #[test]\n // docs:start:to_be_radix_example\n fn test_to_be_radix() {\n // 259, in base 256, big endian, is [1, 3].\n // i.e. 3 * 256^0 + 1 * 256^1\n let field = 259;\n\n // The radix (in this example, 256) must be a power of 2.\n // The length of the returned byte array can be specified to be\n // >= the amount of space needed.\n let bytes: [u8; 8] = field.to_be_radix(256);\n assert_eq(bytes, [0, 0, 0, 0, 0, 0, 1, 3]);\n assert_eq(Field::from_be_bytes::<8>(bytes), field);\n }\n // docs:end:to_be_radix_example\n\n #[test]\n // docs:start:to_le_radix_example\n fn test_to_le_radix() {\n // 259, in base 256, little endian, is [3, 1].\n // i.e. 3 * 256^0 + 1 * 256^1\n let field = 259;\n\n // The radix (in this example, 256) must be a power of 2.\n // The length of the returned byte array can be specified to be\n // >= the amount of space needed.\n let bytes: [u8; 8] = field.to_le_radix(256);\n assert_eq(bytes, [3, 1, 0, 0, 0, 0, 0, 0]);\n assert_eq(Field::from_le_bytes::<8>(bytes), field);\n }\n // docs:end:to_le_radix_example\n\n #[test(should_fail_with = \"radix must be greater than 1\")]\n fn test_to_le_radix_1() {\n // this test should only fail in constrained mode\n if !runtime::is_unconstrained() {\n let field = 2;\n let _: [u8; 8] = field.to_le_radix(1);\n } else {\n panic(\"radix must be greater than 1\");\n }\n }\n\n // Updated test to account for Brillig restriction that radix must be greater than 2\n #[test(should_fail_with = \"radix must be greater than 1\")]\n fn test_to_le_radix_brillig_1() {\n // this test should only fail in constrained mode\n if !runtime::is_unconstrained() {\n let field = 1;\n let _: [u8; 8] = field.to_le_radix(1);\n } else {\n panic(\"radix must be greater than 1\");\n }\n }\n\n #[test(should_fail_with = \"radix must be a power of 2\")]\n fn test_to_le_radix_3() {\n // this test should only fail in constrained mode\n if !runtime::is_unconstrained() {\n let field = 2;\n let _: [u8; 8] = field.to_le_radix(3);\n } else {\n panic(\"radix must be a power of 2\");\n }\n }\n\n #[test]\n fn test_to_le_radix_brillig_3() {\n // this test should only fail in constrained mode\n if runtime::is_unconstrained() {\n let field = 1;\n let out: [u8; 8] = field.to_le_radix(3);\n let mut expected = [0; 8];\n expected[0] = 1;\n assert(out == expected, \"unexpected result\");\n }\n }\n\n #[test(should_fail_with = \"radix must be less than or equal to 256\")]\n fn test_to_le_radix_512() {\n // this test should only fail in constrained mode\n if !runtime::is_unconstrained() {\n let field = 2;\n let _: [u8; 8] = field.to_le_radix(512);\n } else {\n panic(\"radix must be less than or equal to 256\")\n }\n }\n\n #[test(should_fail_with = \"Field failed to decompose into specified 16 limbs\")]\n unconstrained fn not_enough_limbs_brillig() {\n let _: [u8; 16] = 0x100000000000000000000000000000000.to_le_bytes();\n }\n\n #[test(should_fail_with = \"Field failed to decompose into specified 16 limbs\")]\n fn not_enough_limbs() {\n let _: [u8; 16] = 0x100000000000000000000000000000000.to_le_bytes();\n }\n\n #[test]\n unconstrained fn test_field_less_than() {\n assert(field_less_than(0, 1));\n assert(field_less_than(0, 0x100));\n assert(field_less_than(0x100, 0 - 1));\n assert(!field_less_than(0 - 1, 0));\n }\n\n #[test]\n unconstrained fn test_large_field_values_unconstrained() {\n let large_field = 0xffffffffffffffff;\n\n let bits: [u1; 64] = large_field.to_le_bits();\n assert_eq(bits[0], 1);\n\n let bytes: [u8; 8] = large_field.to_le_bytes();\n assert_eq(Field::from_le_bytes::<8>(bytes), large_field);\n\n let radix_bytes: [u8; 8] = large_field.to_le_radix(256);\n assert_eq(Field::from_le_bytes::<8>(radix_bytes), large_field);\n }\n\n #[test]\n fn test_large_field_values() {\n let large_val = 0xffffffffffffffff;\n\n let bits: [u1; 64] = large_val.to_le_bits();\n assert_eq(bits[0], 1);\n\n let bytes: [u8; 8] = large_val.to_le_bytes();\n assert_eq(Field::from_le_bytes::<8>(bytes), large_val);\n\n let radix_bytes: [u8; 8] = large_val.to_le_radix(256);\n assert_eq(Field::from_le_bytes::<8>(radix_bytes), large_val);\n }\n\n #[test]\n fn test_decomposition_edge_cases() {\n let zero_bits: [u1; 8] = 0.to_le_bits();\n assert_eq(zero_bits, [0; 8]);\n\n let zero_bytes: [u8; 8] = 0.to_le_bytes();\n assert_eq(zero_bytes, [0; 8]);\n\n let one_bits: [u1; 8] = 1.to_le_bits();\n let expected: [u1; 8] = [1, 0, 0, 0, 0, 0, 0, 0];\n assert_eq(one_bits, expected);\n\n let pow2_bits: [u1; 8] = 4.to_le_bits();\n let expected: [u1; 8] = [0, 0, 1, 0, 0, 0, 0, 0];\n assert_eq(pow2_bits, expected);\n }\n\n #[test]\n fn test_pow_32() {\n assert_eq(2.pow_32(3), 8);\n assert_eq(3.pow_32(2), 9);\n assert_eq(5.pow_32(0), 1);\n assert_eq(7.pow_32(1), 7);\n\n assert_eq(2.pow_32(10), 1024);\n\n assert_eq(0.pow_32(5), 0);\n assert_eq(0.pow_32(0), 1);\n\n assert_eq(1.pow_32(100), 1);\n }\n\n #[test]\n fn test_sgn0() {\n assert_eq(0.sgn0(), 0);\n assert_eq(2.sgn0(), 0);\n assert_eq(4.sgn0(), 0);\n assert_eq(100.sgn0(), 0);\n\n assert_eq(1.sgn0(), 1);\n assert_eq(3.sgn0(), 1);\n assert_eq(5.sgn0(), 1);\n assert_eq(101.sgn0(), 1);\n }\n\n #[test(should_fail_with = \"Field failed to decompose into specified 8 limbs\")]\n fn test_bit_decomposition_overflow() {\n // 8 bits can't represent large field values\n let large_val = 0x1000000000000000;\n let _: [u1; 8] = large_val.to_le_bits();\n }\n\n #[test(should_fail_with = \"Field failed to decompose into specified 4 limbs\")]\n fn test_byte_decomposition_overflow() {\n // 4 bytes can't represent large field values\n let large_val = 0x1000000000000000;\n let _: [u8; 4] = large_val.to_le_bytes();\n }\n\n #[test]\n fn test_to_from_be_bytes_bn254_edge_cases() {\n if crate::compat::is_bn254() {\n // checking that decrementing this byte produces the expected 32 BE bytes for (modulus - 1)\n let mut p_minus_1_bytes: [u8; 32] = modulus_be_bytes().as_array();\n assert(p_minus_1_bytes[32 - 1] > 0);\n p_minus_1_bytes[32 - 1] -= 1;\n\n let p_minus_1 = Field::from_be_bytes::<32>(p_minus_1_bytes);\n assert_eq(p_minus_1 + 1, 0);\n\n // checking that converting (modulus - 1) from and then to 32 BE bytes produces the same bytes\n let p_minus_1_converted_bytes: [u8; 32] = p_minus_1.to_be_bytes();\n assert_eq(p_minus_1_converted_bytes, p_minus_1_bytes);\n\n // checking that incrementing this byte produces 32 BE bytes for (modulus + 1)\n let mut p_plus_1_bytes: [u8; 32] = modulus_be_bytes().as_array();\n assert(p_plus_1_bytes[32 - 1] < 255);\n p_plus_1_bytes[32 - 1] += 1;\n\n let p_plus_1 = Field::from_be_bytes::<32>(p_plus_1_bytes);\n assert_eq(p_plus_1, 1);\n\n // checking that converting p_plus_1 to 32 BE bytes produces the same\n // byte set to 1 as p_plus_1_bytes and otherwise zeroes\n let mut p_plus_1_converted_bytes: [u8; 32] = p_plus_1.to_be_bytes();\n assert_eq(p_plus_1_converted_bytes[32 - 1], 1);\n p_plus_1_converted_bytes[32 - 1] = 0;\n assert_eq(p_plus_1_converted_bytes, [0; 32]);\n\n // checking that Field::from_be_bytes::<32> on the Field modulus produces 0\n assert_eq(modulus_be_bytes().len(), 32);\n let p = Field::from_be_bytes::<32>(modulus_be_bytes().as_array());\n assert_eq(p, 0);\n\n // checking that converting 0 to 32 BE bytes produces 32 zeroes\n let p_bytes: [u8; 32] = 0.to_be_bytes();\n assert_eq(p_bytes, [0; 32]);\n }\n }\n\n #[test]\n fn test_to_from_le_bytes_bn254_edge_cases() {\n if crate::compat::is_bn254() {\n // checking that decrementing this byte produces the expected 32 LE bytes for (modulus - 1)\n let mut p_minus_1_bytes: [u8; 32] = modulus_le_bytes().as_array();\n assert(p_minus_1_bytes[0] > 0);\n p_minus_1_bytes[0] -= 1;\n\n let p_minus_1 = Field::from_le_bytes::<32>(p_minus_1_bytes);\n assert_eq(p_minus_1 + 1, 0);\n\n // checking that converting (modulus - 1) from and then to 32 BE bytes produces the same bytes\n let p_minus_1_converted_bytes: [u8; 32] = p_minus_1.to_le_bytes();\n assert_eq(p_minus_1_converted_bytes, p_minus_1_bytes);\n\n // checking that incrementing this byte produces 32 LE bytes for (modulus + 1)\n let mut p_plus_1_bytes: [u8; 32] = modulus_le_bytes().as_array();\n assert(p_plus_1_bytes[0] < 255);\n p_plus_1_bytes[0] += 1;\n\n let p_plus_1 = Field::from_le_bytes::<32>(p_plus_1_bytes);\n assert_eq(p_plus_1, 1);\n\n // checking that converting p_plus_1 to 32 LE bytes produces the same\n // byte set to 1 as p_plus_1_bytes and otherwise zeroes\n let mut p_plus_1_converted_bytes: [u8; 32] = p_plus_1.to_le_bytes();\n assert_eq(p_plus_1_converted_bytes[0], 1);\n p_plus_1_converted_bytes[0] = 0;\n assert_eq(p_plus_1_converted_bytes, [0; 32]);\n\n // checking that Field::from_le_bytes::<32> on the Field modulus produces 0\n assert_eq(modulus_le_bytes().len(), 32);\n let p = Field::from_le_bytes::<32>(modulus_le_bytes().as_array());\n assert_eq(p, 0);\n\n // checking that converting 0 to 32 LE bytes produces 32 zeroes\n let p_bytes: [u8; 32] = 0.to_le_bytes();\n assert_eq(p_bytes, [0; 32]);\n }\n }\n\n /// Convert a little endian bit array to a field element.\n /// If the provided bit array overflows the field modulus then the Field will silently wrap around.\n fn from_le_bits<let N: u32>(bits: [u1; N]) -> Field {\n static_assert(\n N <= modulus_le_bits().len(),\n \"N must be less than or equal to modulus_le_bits().len()\",\n );\n let mut v = 1;\n let mut result = 0;\n\n for i in 0..N {\n result += (bits[i] as Field) * v;\n v = v * 2;\n }\n result\n }\n\n /// Convert a big endian bit array to a field element.\n /// If the provided bit array overflows the field modulus then the Field will silently wrap around.\n fn from_be_bits<let N: u32>(bits: [u1; N]) -> Field {\n let mut v = 1;\n let mut result = 0;\n\n for i in 0..N {\n result += (bits[N - 1 - i] as Field) * v;\n v = v * 2;\n }\n result\n }\n\n #[test]\n fn test_to_from_be_bits_bn254_edge_cases() {\n if crate::compat::is_bn254() {\n // checking that decrementing this bit produces the expected 254 BE bits for (modulus - 1)\n let mut p_minus_1_bits: [u1; 254] = modulus_be_bits().as_array();\n assert(p_minus_1_bits[254 - 1] > 0);\n p_minus_1_bits[254 - 1] -= 1;\n\n let p_minus_1 = from_be_bits::<254>(p_minus_1_bits);\n assert_eq(p_minus_1 + 1, 0);\n\n // checking that converting (modulus - 1) from and then to 254 BE bits produces the same bits\n let p_minus_1_converted_bits: [u1; 254] = p_minus_1.to_be_bits();\n assert_eq(p_minus_1_converted_bits, p_minus_1_bits);\n\n // checking that incrementing this bit produces 254 BE bits for (modulus + 4)\n let mut p_plus_4_bits: [u1; 254] = modulus_be_bits().as_array();\n assert(p_plus_4_bits[254 - 3] < 1);\n p_plus_4_bits[254 - 3] += 1;\n\n let p_plus_4 = from_be_bits::<254>(p_plus_4_bits);\n assert_eq(p_plus_4, 4);\n\n // checking that converting p_plus_4 to 254 BE bits produces the same\n // bit set to 1 as p_plus_4_bits and otherwise zeroes\n let mut p_plus_4_converted_bits: [u1; 254] = p_plus_4.to_be_bits();\n assert_eq(p_plus_4_converted_bits[254 - 3], 1);\n p_plus_4_converted_bits[254 - 3] = 0;\n assert_eq(p_plus_4_converted_bits, [0; 254]);\n\n // checking that Field::from_be_bits::<254> on the Field modulus produces 0\n assert_eq(modulus_be_bits().len(), 254);\n let p = from_be_bits::<254>(modulus_be_bits().as_array());\n assert_eq(p, 0);\n\n // checking that converting 0 to 254 BE bytes produces 254 zeroes\n let p_bits: [u1; 254] = 0.to_be_bits();\n assert_eq(p_bits, [0; 254]);\n }\n }\n\n #[test]\n fn test_to_from_le_bits_bn254_edge_cases() {\n if crate::compat::is_bn254() {\n // checking that decrementing this bit produces the expected 254 LE bits for (modulus - 1)\n let mut p_minus_1_bits: [u1; 254] = modulus_le_bits().as_array();\n assert(p_minus_1_bits[0] > 0);\n p_minus_1_bits[0] -= 1;\n\n let p_minus_1 = from_le_bits::<254>(p_minus_1_bits);\n assert_eq(p_minus_1 + 1, 0);\n\n // checking that converting (modulus - 1) from and then to 254 BE bits produces the same bits\n let p_minus_1_converted_bits: [u1; 254] = p_minus_1.to_le_bits();\n assert_eq(p_minus_1_converted_bits, p_minus_1_bits);\n\n // checking that incrementing this bit produces 254 LE bits for (modulus + 4)\n let mut p_plus_4_bits: [u1; 254] = modulus_le_bits().as_array();\n assert(p_plus_4_bits[2] < 1);\n p_plus_4_bits[2] += 1;\n\n let p_plus_4 = from_le_bits::<254>(p_plus_4_bits);\n assert_eq(p_plus_4, 4);\n\n // checking that converting p_plus_4 to 254 LE bits produces the same\n // bit set to 1 as p_plus_4_bits and otherwise zeroes\n let mut p_plus_4_converted_bits: [u1; 254] = p_plus_4.to_le_bits();\n assert_eq(p_plus_4_converted_bits[2], 1);\n p_plus_4_converted_bits[2] = 0;\n assert_eq(p_plus_4_converted_bits, [0; 254]);\n\n // checking that Field::from_le_bits::<254> on the Field modulus produces 0\n assert_eq(modulus_le_bits().len(), 254);\n let p = from_le_bits::<254>(modulus_le_bits().as_array());\n assert_eq(p, 0);\n\n // checking that converting 0 to 254 LE bytes produces 254 zeroes\n let p_bits: [u1; 254] = 0.to_le_bits();\n assert_eq(p_bits, [0; 254]);\n }\n }\n}\n"
|
|
3454
2819
|
},
|
|
3455
|
-
"
|
|
3456
|
-
"path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/oracle/message_processing.nr",
|
|
3457
|
-
"source": "use crate::protocol::address::AztecAddress;\n\n/// Finds new private logs that may have been sent to all registered accounts in PXE in the current contract and makes\n/// them available for later processing in Noir by storing them in a capsule array.\npub unconstrained fn fetch_tagged_logs(pending_tagged_log_array_base_slot: Field) {\n fetch_tagged_logs_oracle(pending_tagged_log_array_base_slot);\n}\n\n#[oracle(utilityFetchTaggedLogs)]\nunconstrained fn fetch_tagged_logs_oracle(pending_tagged_log_array_base_slot: Field) {}\n\n// This must be a single oracle and not one for notes and one for events because the entire point is to validate all\n// notes and events in one go, minimizing node round-trips.\npub(crate) unconstrained fn validate_and_store_enqueued_notes_and_events(\n contract_address: AztecAddress,\n note_validation_requests_array_base_slot: Field,\n event_validation_requests_array_base_slot: Field,\n) {\n validate_and_store_enqueued_notes_and_events_oracle(\n contract_address,\n note_validation_requests_array_base_slot,\n event_validation_requests_array_base_slot,\n );\n}\n\n#[oracle(utilityValidateAndStoreEnqueuedNotesAndEvents)]\nunconstrained fn validate_and_store_enqueued_notes_and_events_oracle(\n contract_address: AztecAddress,\n note_validation_requests_array_base_slot: Field,\n event_validation_requests_array_base_slot: Field,\n) {}\n\npub(crate) unconstrained fn bulk_retrieve_logs(\n contract_address: AztecAddress,\n log_retrieval_requests_array_base_slot: Field,\n log_retrieval_responses_array_base_slot: Field,\n) {\n bulk_retrieve_logs_oracle(\n contract_address,\n log_retrieval_requests_array_base_slot,\n log_retrieval_responses_array_base_slot,\n );\n}\n\n#[oracle(utilityBulkRetrieveLogs)]\nunconstrained fn bulk_retrieve_logs_oracle(\n contract_address: AztecAddress,\n log_retrieval_requests_array_base_slot: Field,\n log_retrieval_responses_array_base_slot: Field,\n) {}\n"
|
|
3458
|
-
},
|
|
3459
|
-
"186": {
|
|
3460
|
-
"path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/oracle/nullifiers.nr",
|
|
3461
|
-
"source": "//! Nullifier creation, existence checks, etc.\n\nuse crate::protocol::address::aztec_address::AztecAddress;\n\n/// Notifies the simulator that a nullifier has been created, so that its correct status (pending or settled) can be\n/// determined when reading nullifiers in subsequent private function calls. The first non-revertible nullifier emitted\n/// is also used to compute note nonces.\npub fn notify_created_nullifier(inner_nullifier: Field) {\n // Safety: This oracle call returns nothing: we only call it for its side effects. It is therefore always safe to\n // call.\n unsafe { notify_created_nullifier_oracle(inner_nullifier) };\n}\n\n#[oracle(privateNotifyCreatedNullifier)]\nunconstrained fn notify_created_nullifier_oracle(_inner_nullifier: Field) {}\n\n/// Returns true if the nullifier has been emitted in the same transaction, i.e. if [notify_created_nullifier] has been\n/// called for this inner nullifier from the contract with the specified address.\n///\n/// Note that despite sharing pending transaction information with the app, this is not a privacy leak: anyone in the\n/// network can always determine in which transaction a inner nullifier was emitted by a given contract by simply\n/// inspecting transaction effects. What _would_ constitute a leak would be to share the list of inner pending\n/// nullifiers, as that would reveal their preimages.\npub unconstrained fn is_nullifier_pending(inner_nullifier: Field, contract_address: AztecAddress) -> bool {\n is_nullifier_pending_oracle(inner_nullifier, contract_address)\n}\n\n#[oracle(privateIsNullifierPending)]\nunconstrained fn is_nullifier_pending_oracle(_inner_nullifier: Field, _contract_address: AztecAddress) -> bool {}\n\n/// Returns true if the nullifier exists. Note that a `true` value can be constrained by proving existence of the\n/// nullifier, but a `false` value should not be relied upon since other transactions may emit this nullifier before\n/// the current transaction is included in a block. While this might seem of little use at first, certain design\n/// patterns benefit from this abstraction (see e.g. `PrivateMutable`).\npub unconstrained fn check_nullifier_exists(inner_nullifier: Field) -> bool {\n check_nullifier_exists_oracle(inner_nullifier)\n}\n\n#[oracle(utilityCheckNullifierExists)]\nunconstrained fn check_nullifier_exists_oracle(_inner_nullifier: Field) -> bool {}\n"
|
|
3462
|
-
},
|
|
3463
|
-
"189": {
|
|
3464
|
-
"path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/oracle/shared_secret.nr",
|
|
3465
|
-
"source": "use crate::protocol::{address::aztec_address::AztecAddress, point::Point};\n\n// TODO(#12656): return an app-siloed secret + document this\n#[oracle(utilityGetSharedSecret)]\nunconstrained fn get_shared_secret_oracle(address: AztecAddress, ephPk: Point) -> Point {}\n\n/// Returns an app-siloed shared secret between `address` and someone who knows the secret key behind an ephemeral\n/// public key `ephPk`. The app-siloing means that contracts cannot retrieve secrets that belong to other contracts,\n/// and therefore cannot e.g. decrypt their messages. This is an important security consideration given that both the\n/// `address` and `ephPk` are public information.\n///\n/// The shared secret `S` is computed as: `let S = (ivsk + h) * ephPk` where `ivsk + h` is the 'preaddress' i.e. the\n/// preimage of the address, also called the address secret. TODO(#12656): app-silo this secret\npub unconstrained fn get_shared_secret(address: AztecAddress, ephPk: Point) -> Point {\n get_shared_secret_oracle(address, ephPk)\n}\n"
|
|
3466
|
-
},
|
|
3467
|
-
"19": {
|
|
2820
|
+
"18": {
|
|
3468
2821
|
"path": "std/hash/mod.nr",
|
|
3469
|
-
"source": "// Exposed only for usage in `std::meta`\npub(crate) mod poseidon2;\n\nuse crate::default::Default;\nuse crate::embedded_curve_ops::{\n EmbeddedCurvePoint, EmbeddedCurveScalar, multi_scalar_mul, multi_scalar_mul_array_return,\n};\nuse crate::meta::derive_via;\n\n#[foreign(sha256_compression)]\n// docs:start:sha256_compression\npub fn sha256_compression(input: [u32; 16], state: [u32; 8]) -> [u32; 8] {}\n// docs:end:sha256_compression\n\n#[foreign(keccakf1600)]\n// docs:start:keccakf1600\npub fn keccakf1600(input: [u64; 25]) -> [u64; 25] {}\n// docs:end:keccakf1600\n\npub mod keccak {\n #[deprecated(\"This function has been moved to std::hash::keccakf1600\")]\n pub fn keccakf1600(input: [u64; 25]) -> [u64; 25] {\n super::keccakf1600(input)\n }\n}\n\n#[foreign(blake2s)]\n// docs:start:blake2s\npub fn blake2s<let N: u32>(input: [u8; N]) -> [u8; 32]\n// docs:end:blake2s\n{}\n\n// docs:start:blake3\npub fn blake3<let N: u32>(input: [u8; N]) -> [u8; 32]\n// docs:end:blake3\n{\n if crate::runtime::is_unconstrained() {\n // Temporary measure while Barretenberg is main proving system.\n // Please open an issue if you're working on another proving system and running into problems due to this.\n crate::static_assert(\n N <= 1024,\n \"Barretenberg cannot prove blake3 hashes with inputs larger than 1024 bytes\",\n );\n }\n __blake3(input)\n}\n\n#[foreign(blake3)]\nfn __blake3<let N: u32>(input: [u8; N]) -> [u8; 32] {}\n\n// docs:start:pedersen_commitment\npub fn pedersen_commitment<let N: u32>(input: [Field; N]) -> EmbeddedCurvePoint {\n // docs:end:pedersen_commitment\n pedersen_commitment_with_separator(input, 0)\n}\n\n#[inline_always]\npub fn pedersen_commitment_with_separator<let N: u32>(\n input: [Field; N],\n separator: u32,\n) -> EmbeddedCurvePoint {\n let mut points = [EmbeddedCurveScalar { lo: 0, hi: 0 }; N];\n for i in 0..N {\n // we use the unsafe version because the multi_scalar_mul will constrain the scalars.\n points[i] = from_field_unsafe(input[i]);\n }\n let generators = derive_generators(\"DEFAULT_DOMAIN_SEPARATOR\".as_bytes(), separator);\n multi_scalar_mul(generators, points)\n}\n\n// docs:start:pedersen_hash\npub fn pedersen_hash<let N: u32>(input: [Field; N]) -> Field\n// docs:end:pedersen_hash\n{\n pedersen_hash_with_separator(input, 0)\n}\n\n#[no_predicates]\npub fn pedersen_hash_with_separator<let N: u32>(input: [Field; N], separator: u32) -> Field {\n let mut scalars: [EmbeddedCurveScalar; N + 1] = [EmbeddedCurveScalar { lo: 0, hi: 0 }; N + 1];\n let mut generators: [EmbeddedCurvePoint; N + 1] =\n [EmbeddedCurvePoint::point_at_infinity(); N + 1];\n let domain_generators: [EmbeddedCurvePoint; N] =\n derive_generators(\"DEFAULT_DOMAIN_SEPARATOR\".as_bytes(), separator);\n\n for i in 0..N {\n scalars[i] = from_field_unsafe(input[i]);\n generators[i] = domain_generators[i];\n }\n scalars[N] = EmbeddedCurveScalar { lo: N as Field, hi: 0 as Field };\n\n let length_generator: [EmbeddedCurvePoint; 1] =\n derive_generators(\"pedersen_hash_length\".as_bytes(), 0);\n generators[N] = length_generator[0];\n multi_scalar_mul_array_return(generators, scalars, true)[0].x\n}\n\n#[field(bn254)]\n#[inline_always]\npub fn derive_generators<let N: u32, let M: u32>(\n domain_separator_bytes: [u8; M],\n starting_index: u32,\n) -> [EmbeddedCurvePoint; N] {\n crate::assert_constant(domain_separator_bytes);\n // TODO(https://github.com/noir-lang/noir/issues/5672): Add back assert_constant on starting_index\n __derive_generators(domain_separator_bytes, starting_index)\n}\n\n#[builtin(derive_pedersen_generators)]\n#[field(bn254)]\nfn __derive_generators<let N: u32, let M: u32>(\n domain_separator_bytes: [u8; M],\n starting_index: u32,\n) -> [EmbeddedCurvePoint; N] {}\n\n#[field(bn254)]\n// Decompose the input 'bn254 scalar' into two 128 bits limbs.\n// It is called 'unsafe' because it does not assert the limbs are 128 bits\n// Assuming the limbs are 128 bits:\n// Assert the decomposition does not overflow the field size.\nfn from_field_unsafe(scalar: Field) -> EmbeddedCurveScalar {\n // Safety: xlo and xhi decomposition is checked below\n let (xlo, xhi) = unsafe { crate::field::bn254::decompose_hint(scalar) };\n // Check that the decomposition is correct\n assert_eq(scalar, xlo + crate::field::bn254::TWO_POW_128 * xhi);\n // Check that the decomposition does not overflow the field size\n let (a, b) = if xhi == crate::field::bn254::PHI {\n (xlo, crate::field::bn254::PLO)\n } else {\n (xhi, crate::field::bn254::PHI)\n };\n crate::field::bn254::assert_lt(a, b);\n\n EmbeddedCurveScalar { lo: xlo, hi: xhi }\n}\n\npub fn poseidon2_permutation<let N: u32>(input: [Field; N], state_len: u32) -> [Field; N] {\n assert_eq(input.len(), state_len);\n poseidon2_permutation_internal(input)\n}\n\n#[foreign(poseidon2_permutation)]\nfn poseidon2_permutation_internal<let N: u32>(input: [Field; N]) -> [Field; N] {}\n\n// Generic hashing support.\n// Partially ported and impacted by rust.\n\n// Hash trait shall be implemented per type.\n#[derive_via(derive_hash)]\npub trait Hash {\n fn hash<H>(self, state: &mut H)\n where\n H: Hasher;\n}\n\n// docs:start:derive_hash\ncomptime fn derive_hash(s: TypeDefinition) -> Quoted {\n let name = quote { $crate::hash::Hash };\n let signature = quote { fn hash<H>(_self: Self, _state: &mut H) where H: $crate::hash::Hasher };\n let for_each_field = |name| quote { _self.$name.hash(_state); };\n crate::meta::make_trait_impl(\n s,\n name,\n signature,\n for_each_field,\n quote {},\n |fields| fields,\n )\n}\n// docs:end:derive_hash\n\n// Hasher trait shall be implemented by algorithms to provide hash-agnostic means.\n// TODO: consider making the types generic here ([u8], [Field], etc.)\npub trait Hasher {\n fn finish(self) -> Field;\n\n fn write(&mut self, input: Field);\n}\n\n// BuildHasher is a factory trait, responsible for production of specific Hasher.\npub trait BuildHasher {\n type H: Hasher;\n\n fn build_hasher(self) -> H;\n}\n\npub struct BuildHasherDefault<H>;\n\nimpl<H> BuildHasher for BuildHasherDefault<H>\nwhere\n H: Hasher + Default,\n{\n type H = H;\n\n fn build_hasher(_self: Self) -> H {\n H::default()\n }\n}\n\nimpl<H> Default for BuildHasherDefault<H>\nwhere\n H: Hasher + Default,\n{\n fn default() -> Self {\n BuildHasherDefault {}\n }\n}\n\nimpl Hash for Field {\n fn hash<H>(self, state: &mut H)\n where\n H: Hasher,\n {\n H::write(state, self);\n }\n}\n\nimpl Hash for u1 {\n fn hash<H>(self, state: &mut H)\n where\n H: Hasher,\n {\n H::write(state, self as Field);\n }\n}\n\nimpl Hash for u8 {\n fn hash<H>(self, state: &mut H)\n where\n H: Hasher,\n {\n H::write(state, self as Field);\n }\n}\n\nimpl Hash for u16 {\n fn hash<H>(self, state: &mut H)\n where\n H: Hasher,\n {\n H::write(state, self as Field);\n }\n}\n\nimpl Hash for u32 {\n fn hash<H>(self, state: &mut H)\n where\n H: Hasher,\n {\n H::write(state, self as Field);\n }\n}\n\nimpl Hash for u64 {\n fn hash<H>(self, state: &mut H)\n where\n H: Hasher,\n {\n H::write(state, self as Field);\n }\n}\n\nimpl Hash for u128 {\n fn hash<H>(self, state: &mut H)\n where\n H: Hasher,\n {\n H::write(state, self as Field);\n }\n}\n\nimpl Hash for i8 {\n fn hash<H>(self, state: &mut H)\n where\n H: Hasher,\n {\n H::write(state, self as u8 as Field);\n }\n}\n\nimpl Hash for i16 {\n fn hash<H>(self, state: &mut H)\n where\n H: Hasher,\n {\n H::write(state, self as u16 as Field);\n }\n}\n\nimpl Hash for i32 {\n fn hash<H>(self, state: &mut H)\n where\n H: Hasher,\n {\n H::write(state, self as u32 as Field);\n }\n}\n\nimpl Hash for i64 {\n fn hash<H>(self, state: &mut H)\n where\n H: Hasher,\n {\n H::write(state, self as u64 as Field);\n }\n}\n\nimpl Hash for bool {\n fn hash<H>(self, state: &mut H)\n where\n H: Hasher,\n {\n H::write(state, self as Field);\n }\n}\n\nimpl Hash for () {\n fn hash<H>(_self: Self, _state: &mut H)\n where\n H: Hasher,\n {}\n}\n\nimpl<T, let N: u32> Hash for [T; N]\nwhere\n T: Hash,\n{\n fn hash<H>(self, state: &mut H)\n where\n H: Hasher,\n {\n for elem in self {\n elem.hash(state);\n }\n }\n}\n\nimpl<T> Hash for [T]\nwhere\n T: Hash,\n{\n fn hash<H>(self, state: &mut H)\n where\n H: Hasher,\n {\n self.len().hash(state);\n for elem in self {\n elem.hash(state);\n }\n }\n}\n\nimpl<A, B> Hash for (A, B)\nwhere\n A: Hash,\n B: Hash,\n{\n fn hash<H>(self, state: &mut H)\n where\n H: Hasher,\n {\n self.0.hash(state);\n self.1.hash(state);\n }\n}\n\nimpl<A, B, C> Hash for (A, B, C)\nwhere\n A: Hash,\n B: Hash,\n C: Hash,\n{\n fn hash<H>(self, state: &mut H)\n where\n H: Hasher,\n {\n self.0.hash(state);\n self.1.hash(state);\n self.2.hash(state);\n }\n}\n\nimpl<A, B, C, D> Hash for (A, B, C, D)\nwhere\n A: Hash,\n B: Hash,\n C: Hash,\n D: Hash,\n{\n fn hash<H>(self, state: &mut H)\n where\n H: Hasher,\n {\n self.0.hash(state);\n self.1.hash(state);\n self.2.hash(state);\n self.3.hash(state);\n }\n}\n\nimpl<A, B, C, D, E> Hash for (A, B, C, D, E)\nwhere\n A: Hash,\n B: Hash,\n C: Hash,\n D: Hash,\n E: Hash,\n{\n fn hash<H>(self, state: &mut H)\n where\n H: Hasher,\n {\n self.0.hash(state);\n self.1.hash(state);\n self.2.hash(state);\n self.3.hash(state);\n self.4.hash(state);\n }\n}\n\n// Some test vectors for Pedersen hash and Pedersen Commitment.\n// They have been generated using the same functions so the tests are for now useless\n// but they will be useful when we switch to Noir implementation.\n#[test]\nfn assert_pedersen() {\n assert_eq(\n pedersen_hash_with_separator([1], 1),\n 0x1b3f4b1a83092a13d8d1a59f7acb62aba15e7002f4440f2275edb99ebbc2305f,\n );\n assert_eq(\n pedersen_commitment_with_separator([1], 1),\n EmbeddedCurvePoint {\n x: 0x054aa86a73cb8a34525e5bbed6e43ba1198e860f5f3950268f71df4591bde402,\n y: 0x209dcfbf2cfb57f9f6046f44d71ac6faf87254afc7407c04eb621a6287cac126,\n is_infinite: false,\n },\n );\n\n assert_eq(\n pedersen_hash_with_separator([1, 2], 2),\n 0x26691c129448e9ace0c66d11f0a16d9014a9e8498ee78f4d69f0083168188255,\n );\n assert_eq(\n pedersen_commitment_with_separator([1, 2], 2),\n EmbeddedCurvePoint {\n x: 0x2e2b3b191e49541fe468ec6877721d445dcaffe41728df0a0eafeb15e87b0753,\n y: 0x2ff4482400ad3a6228be17a2af33e2bcdf41be04795f9782bd96efe7e24f8778,\n is_infinite: false,\n },\n );\n assert_eq(\n pedersen_hash_with_separator([1, 2, 3], 3),\n 0x0bc694b7a1f8d10d2d8987d07433f26bd616a2d351bc79a3c540d85b6206dbe4,\n );\n assert_eq(\n pedersen_commitment_with_separator([1, 2, 3], 3),\n EmbeddedCurvePoint {\n x: 0x1fee4e8cf8d2f527caa2684236b07c4b1bad7342c01b0f75e9a877a71827dc85,\n y: 0x2f9fedb9a090697ab69bf04c8bc15f7385b3e4b68c849c1536e5ae15ff138fd1,\n is_infinite: false,\n },\n );\n assert_eq(\n pedersen_hash_with_separator([1, 2, 3, 4], 4),\n 0xdae10fb32a8408521803905981a2b300d6a35e40e798743e9322b223a5eddc,\n );\n assert_eq(\n pedersen_commitment_with_separator([1, 2, 3, 4], 4),\n EmbeddedCurvePoint {\n x: 0x07ae3e202811e1fca39c2d81eabe6f79183978e6f12be0d3b8eda095b79bdbc9,\n y: 0x0afc6f892593db6fbba60f2da558517e279e0ae04f95758587760ba193145014,\n is_infinite: false,\n },\n );\n assert_eq(\n pedersen_hash_with_separator([1, 2, 3, 4, 5], 5),\n 0xfc375b062c4f4f0150f7100dfb8d9b72a6d28582dd9512390b0497cdad9c22,\n );\n assert_eq(\n pedersen_commitment_with_separator([1, 2, 3, 4, 5], 5),\n EmbeddedCurvePoint {\n x: 0x1754b12bd475a6984a1094b5109eeca9838f4f81ac89c5f0a41dbce53189bb29,\n y: 0x2da030e3cfcdc7ddad80eaf2599df6692cae0717d4e9f7bfbee8d073d5d278f7,\n is_infinite: false,\n },\n );\n assert_eq(\n pedersen_hash_with_separator([1, 2, 3, 4, 5, 6], 6),\n 0x1696ed13dc2730062a98ac9d8f9de0661bb98829c7582f699d0273b18c86a572,\n );\n assert_eq(\n pedersen_commitment_with_separator([1, 2, 3, 4, 5, 6], 6),\n EmbeddedCurvePoint {\n x: 0x190f6c0e97ad83e1e28da22a98aae156da083c5a4100e929b77e750d3106a697,\n y: 0x1f4b60f34ef91221a0b49756fa0705da93311a61af73d37a0c458877706616fb,\n is_infinite: false,\n },\n );\n assert_eq(\n pedersen_hash_with_separator([1, 2, 3, 4, 5, 6, 7], 7),\n 0x128c0ff144fc66b6cb60eeac8a38e23da52992fc427b92397a7dffd71c45ede3,\n );\n assert_eq(\n pedersen_commitment_with_separator([1, 2, 3, 4, 5, 6, 7], 7),\n EmbeddedCurvePoint {\n x: 0x015441e9d29491b06563fac16fc76abf7a9534c715421d0de85d20dbe2965939,\n y: 0x1d2575b0276f4e9087e6e07c2cb75aa1baafad127af4be5918ef8a2ef2fea8fc,\n is_infinite: false,\n },\n );\n assert_eq(\n pedersen_hash_with_separator([1, 2, 3, 4, 5, 6, 7, 8], 8),\n 0x2f960e117482044dfc99d12fece2ef6862fba9242be4846c7c9a3e854325a55c,\n );\n assert_eq(\n pedersen_commitment_with_separator([1, 2, 3, 4, 5, 6, 7, 8], 8),\n EmbeddedCurvePoint {\n x: 0x1657737676968887fceb6dd516382ea13b3a2c557f509811cd86d5d1199bc443,\n y: 0x1f39f0cb569040105fa1e2f156521e8b8e08261e635a2b210bdc94e8d6d65f77,\n is_infinite: false,\n },\n );\n assert_eq(\n pedersen_hash_with_separator([1, 2, 3, 4, 5, 6, 7, 8, 9], 9),\n 0x0c96db0790602dcb166cc4699e2d306c479a76926b81c2cb2aaa92d249ec7be7,\n );\n assert_eq(\n pedersen_commitment_with_separator([1, 2, 3, 4, 5, 6, 7, 8, 9], 9),\n EmbeddedCurvePoint {\n x: 0x0a3ceae42d14914a432aa60ec7fded4af7dad7dd4acdbf2908452675ec67e06d,\n y: 0xfc19761eaaf621ad4aec9a8b2e84a4eceffdba78f60f8b9391b0bd9345a2f2,\n is_infinite: false,\n },\n );\n assert_eq(\n pedersen_hash_with_separator([1, 2, 3, 4, 5, 6, 7, 8, 9, 10], 10),\n 0x2cd37505871bc460a62ea1e63c7fe51149df5d0801302cf1cbc48beb8dff7e94,\n );\n assert_eq(\n pedersen_commitment_with_separator([1, 2, 3, 4, 5, 6, 7, 8, 9, 10], 10),\n EmbeddedCurvePoint {\n x: 0x2fb3f8b3d41ddde007c8c3c62550f9a9380ee546fcc639ffbb3fd30c8d8de30c,\n y: 0x300783be23c446b11a4c0fabf6c91af148937cea15fcf5fb054abf7f752ee245,\n is_infinite: false,\n },\n );\n}\n"
|
|
2822
|
+
"source": "// Exposed only for usage in `std::meta`\npub(crate) mod poseidon2;\n\nuse crate::default::Default;\nuse crate::embedded_curve_ops::{\n EmbeddedCurvePoint, EmbeddedCurveScalar, multi_scalar_mul, multi_scalar_mul_array_return,\n};\nuse crate::meta::derive_via;\nuse crate::static_assert;\n\n/// The size of the state accepted by the backend in `poseidon2_permutation`.\nglobal POSEIDON2_CONFIG_STATE_SIZE: u32 = poseidon2_config_state_size();\n\n#[foreign(sha256_compression)]\n// docs:start:sha256_compression\npub fn sha256_compression(input: [u32; 16], state: [u32; 8]) -> [u32; 8] {}\n// docs:end:sha256_compression\n\n#[foreign(keccakf1600)]\n// docs:start:keccakf1600\npub fn keccakf1600(input: [u64; 25]) -> [u64; 25] {}\n// docs:end:keccakf1600\n\npub mod keccak {\n #[deprecated(\"This function has been moved to std::hash::keccakf1600\")]\n pub fn keccakf1600(input: [u64; 25]) -> [u64; 25] {\n super::keccakf1600(input)\n }\n}\n\n#[foreign(blake2s)]\n// docs:start:blake2s\npub fn blake2s<let N: u32>(input: [u8; N]) -> [u8; 32]\n// docs:end:blake2s\n{}\n\n// docs:start:blake3\npub fn blake3<let N: u32>(input: [u8; N]) -> [u8; 32]\n// docs:end:blake3\n{\n if crate::runtime::is_unconstrained() {\n // Temporary measure while Barretenberg is main proving system.\n // Please open an issue if you're working on another proving system and running into problems due to this.\n crate::static_assert(\n N <= 1024,\n \"Barretenberg cannot prove blake3 hashes with inputs larger than 1024 bytes\",\n );\n }\n __blake3(input)\n}\n\n#[foreign(blake3)]\nfn __blake3<let N: u32>(input: [u8; N]) -> [u8; 32] {}\n\n// docs:start:pedersen_commitment\npub fn pedersen_commitment<let N: u32>(input: [Field; N]) -> EmbeddedCurvePoint {\n // docs:end:pedersen_commitment\n pedersen_commitment_with_separator(input, 0)\n}\n\n#[inline_always]\npub fn pedersen_commitment_with_separator<let N: u32>(\n input: [Field; N],\n separator: u32,\n) -> EmbeddedCurvePoint {\n let mut points = [EmbeddedCurveScalar { lo: 0, hi: 0 }; N];\n for i in 0..N {\n // we use the unsafe version because the multi_scalar_mul will constrain the scalars.\n points[i] = from_field_unsafe(input[i]);\n }\n let generators = derive_generators(\"DEFAULT_DOMAIN_SEPARATOR\".as_bytes(), separator);\n multi_scalar_mul(generators, points)\n}\n\n// docs:start:pedersen_hash\npub fn pedersen_hash<let N: u32>(input: [Field; N]) -> Field\n// docs:end:pedersen_hash\n{\n pedersen_hash_with_separator(input, 0)\n}\n\n#[no_predicates]\npub fn pedersen_hash_with_separator<let N: u32>(input: [Field; N], separator: u32) -> Field {\n let mut scalars: [EmbeddedCurveScalar; N + 1] = [EmbeddedCurveScalar { lo: 0, hi: 0 }; N + 1];\n let mut generators: [EmbeddedCurvePoint; N + 1] =\n [EmbeddedCurvePoint::point_at_infinity(); N + 1];\n crate::assert_constant(separator);\n let domain_generators: [EmbeddedCurvePoint; N] =\n derive_generators(\"DEFAULT_DOMAIN_SEPARATOR\".as_bytes(), separator);\n\n for i in 0..N {\n scalars[i] = from_field_unsafe(input[i]);\n generators[i] = domain_generators[i];\n }\n scalars[N] = EmbeddedCurveScalar { lo: N as Field, hi: 0 as Field };\n\n let length_generator: [EmbeddedCurvePoint; 1] =\n derive_generators(\"pedersen_hash_length\".as_bytes(), 0);\n generators[N] = length_generator[0];\n multi_scalar_mul_array_return(generators, scalars, true)[0].x\n}\n\n#[field(bn254)]\n#[inline_always]\npub fn derive_generators<let N: u32, let M: u32>(\n domain_separator_bytes: [u8; M],\n starting_index: u32,\n) -> [EmbeddedCurvePoint; N] {\n crate::assert_constant(domain_separator_bytes);\n crate::assert_constant(starting_index);\n __derive_generators(domain_separator_bytes, starting_index)\n}\n\n#[builtin(derive_pedersen_generators)]\n#[field(bn254)]\nfn __derive_generators<let N: u32, let M: u32>(\n domain_separator_bytes: [u8; M],\n starting_index: u32,\n) -> [EmbeddedCurvePoint; N] {}\n\n#[field(bn254)]\n// Decompose the input 'bn254 scalar' into two 128 bits limbs.\n// It is called 'unsafe' because it does not assert the limbs are 128 bits\n// Assuming the limbs are 128 bits:\n// Assert the decomposition does not overflow the field size.\nfn from_field_unsafe(scalar: Field) -> EmbeddedCurveScalar {\n // Safety: xlo and xhi decomposition is checked below\n let (xlo, xhi) = unsafe { crate::field::bn254::decompose_hint(scalar) };\n // Check that the decomposition is correct\n assert_eq(scalar, xlo + crate::field::bn254::TWO_POW_128 * xhi);\n // Check that the decomposition does not overflow the field size\n let (a, b) = if xhi == crate::field::bn254::PHI {\n (xlo, crate::field::bn254::PLO)\n } else {\n (xhi, crate::field::bn254::PHI)\n };\n crate::field::bn254::assert_lt(a, b);\n\n EmbeddedCurveScalar { lo: xlo, hi: xhi }\n}\n\npub fn poseidon2_permutation<let N: u32>(input: [Field; N], state_len: u32) -> [Field; N] {\n assert_eq(input.len(), state_len);\n\n static_assert(\n N == POSEIDON2_CONFIG_STATE_SIZE,\n f\"the input length must equal the state size in the Poseidon2 config; expected {POSEIDON2_CONFIG_STATE_SIZE}, got {N}\",\n );\n poseidon2_permutation_internal(input)\n}\n\n#[foreign(poseidon2_permutation)]\nfn poseidon2_permutation_internal<let N: u32>(input: [Field; N]) -> [Field; N] {}\n\n#[foreign(poseidon2_config_state_size)]\ncomptime fn poseidon2_config_state_size() -> u32 {}\n\n// Generic hashing support.\n// Partially ported and impacted by rust.\n\n// Hash trait shall be implemented per type.\n#[derive_via(derive_hash)]\npub trait Hash {\n fn hash<H>(self, state: &mut H)\n where\n H: Hasher;\n}\n\n// docs:start:derive_hash\ncomptime fn derive_hash(s: TypeDefinition) -> Quoted {\n let name = quote { $crate::hash::Hash };\n let signature = quote { fn hash<H>(_self: Self, _state: &mut H) where H: $crate::hash::Hasher };\n let for_each_field = |name| quote { _self.$name.hash(_state); };\n crate::meta::make_trait_impl(\n s,\n name,\n signature,\n for_each_field,\n quote {},\n |fields| fields,\n )\n}\n// docs:end:derive_hash\n\n// Hasher trait shall be implemented by algorithms to provide hash-agnostic means.\n// TODO: consider making the types generic here ([u8], [Field], etc.)\npub trait Hasher {\n fn finish(self) -> Field;\n\n fn write(&mut self, input: Field);\n}\n\n// BuildHasher is a factory trait, responsible for production of specific Hasher.\npub trait BuildHasher {\n type H: Hasher;\n\n fn build_hasher(self) -> H;\n}\n\npub struct BuildHasherDefault<H>;\n\nimpl<H> BuildHasher for BuildHasherDefault<H>\nwhere\n H: Hasher + Default,\n{\n type H = H;\n\n fn build_hasher(_self: Self) -> H {\n H::default()\n }\n}\n\nimpl<H> Default for BuildHasherDefault<H>\nwhere\n H: Hasher + Default,\n{\n fn default() -> Self {\n BuildHasherDefault {}\n }\n}\n\nimpl Hash for Field {\n fn hash<H>(self, state: &mut H)\n where\n H: Hasher,\n {\n H::write(state, self);\n }\n}\n\nimpl Hash for u1 {\n fn hash<H>(self, state: &mut H)\n where\n H: Hasher,\n {\n H::write(state, self as Field);\n }\n}\n\nimpl Hash for u8 {\n fn hash<H>(self, state: &mut H)\n where\n H: Hasher,\n {\n H::write(state, self as Field);\n }\n}\n\nimpl Hash for u16 {\n fn hash<H>(self, state: &mut H)\n where\n H: Hasher,\n {\n H::write(state, self as Field);\n }\n}\n\nimpl Hash for u32 {\n fn hash<H>(self, state: &mut H)\n where\n H: Hasher,\n {\n H::write(state, self as Field);\n }\n}\n\nimpl Hash for u64 {\n fn hash<H>(self, state: &mut H)\n where\n H: Hasher,\n {\n H::write(state, self as Field);\n }\n}\n\nimpl Hash for u128 {\n fn hash<H>(self, state: &mut H)\n where\n H: Hasher,\n {\n H::write(state, self as Field);\n }\n}\n\nimpl Hash for i8 {\n fn hash<H>(self, state: &mut H)\n where\n H: Hasher,\n {\n H::write(state, self as u8 as Field);\n }\n}\n\nimpl Hash for i16 {\n fn hash<H>(self, state: &mut H)\n where\n H: Hasher,\n {\n H::write(state, self as u16 as Field);\n }\n}\n\nimpl Hash for i32 {\n fn hash<H>(self, state: &mut H)\n where\n H: Hasher,\n {\n H::write(state, self as u32 as Field);\n }\n}\n\nimpl Hash for i64 {\n fn hash<H>(self, state: &mut H)\n where\n H: Hasher,\n {\n H::write(state, self as u64 as Field);\n }\n}\n\nimpl Hash for bool {\n fn hash<H>(self, state: &mut H)\n where\n H: Hasher,\n {\n H::write(state, self as Field);\n }\n}\n\nimpl Hash for () {\n fn hash<H>(_self: Self, _state: &mut H)\n where\n H: Hasher,\n {}\n}\n\nimpl<T, let N: u32> Hash for [T; N]\nwhere\n T: Hash,\n{\n fn hash<H>(self, state: &mut H)\n where\n H: Hasher,\n {\n for elem in self {\n elem.hash(state);\n }\n }\n}\n\nimpl<T> Hash for [T]\nwhere\n T: Hash,\n{\n fn hash<H>(self, state: &mut H)\n where\n H: Hasher,\n {\n self.len().hash(state);\n for elem in self {\n elem.hash(state);\n }\n }\n}\n\nimpl<A, B> Hash for (A, B)\nwhere\n A: Hash,\n B: Hash,\n{\n fn hash<H>(self, state: &mut H)\n where\n H: Hasher,\n {\n self.0.hash(state);\n self.1.hash(state);\n }\n}\n\nimpl<A, B, C> Hash for (A, B, C)\nwhere\n A: Hash,\n B: Hash,\n C: Hash,\n{\n fn hash<H>(self, state: &mut H)\n where\n H: Hasher,\n {\n self.0.hash(state);\n self.1.hash(state);\n self.2.hash(state);\n }\n}\n\nimpl<A, B, C, D> Hash for (A, B, C, D)\nwhere\n A: Hash,\n B: Hash,\n C: Hash,\n D: Hash,\n{\n fn hash<H>(self, state: &mut H)\n where\n H: Hasher,\n {\n self.0.hash(state);\n self.1.hash(state);\n self.2.hash(state);\n self.3.hash(state);\n }\n}\n\nimpl<A, B, C, D, E> Hash for (A, B, C, D, E)\nwhere\n A: Hash,\n B: Hash,\n C: Hash,\n D: Hash,\n E: Hash,\n{\n fn hash<H>(self, state: &mut H)\n where\n H: Hasher,\n {\n self.0.hash(state);\n self.1.hash(state);\n self.2.hash(state);\n self.3.hash(state);\n self.4.hash(state);\n }\n}\n\n// Some test vectors for Pedersen hash and Pedersen Commitment.\n// They have been generated using the same functions so the tests are for now useless\n// but they will be useful when we switch to Noir implementation.\n#[test]\nfn assert_pedersen() {\n assert_eq(\n pedersen_hash_with_separator([1], 1),\n 0x1b3f4b1a83092a13d8d1a59f7acb62aba15e7002f4440f2275edb99ebbc2305f,\n );\n assert_eq(\n pedersen_commitment_with_separator([1], 1),\n EmbeddedCurvePoint {\n x: 0x054aa86a73cb8a34525e5bbed6e43ba1198e860f5f3950268f71df4591bde402,\n y: 0x209dcfbf2cfb57f9f6046f44d71ac6faf87254afc7407c04eb621a6287cac126,\n is_infinite: false,\n },\n );\n\n assert_eq(\n pedersen_hash_with_separator([1, 2], 2),\n 0x26691c129448e9ace0c66d11f0a16d9014a9e8498ee78f4d69f0083168188255,\n );\n assert_eq(\n pedersen_commitment_with_separator([1, 2], 2),\n EmbeddedCurvePoint {\n x: 0x2e2b3b191e49541fe468ec6877721d445dcaffe41728df0a0eafeb15e87b0753,\n y: 0x2ff4482400ad3a6228be17a2af33e2bcdf41be04795f9782bd96efe7e24f8778,\n is_infinite: false,\n },\n );\n assert_eq(\n pedersen_hash_with_separator([1, 2, 3], 3),\n 0x0bc694b7a1f8d10d2d8987d07433f26bd616a2d351bc79a3c540d85b6206dbe4,\n );\n assert_eq(\n pedersen_commitment_with_separator([1, 2, 3], 3),\n EmbeddedCurvePoint {\n x: 0x1fee4e8cf8d2f527caa2684236b07c4b1bad7342c01b0f75e9a877a71827dc85,\n y: 0x2f9fedb9a090697ab69bf04c8bc15f7385b3e4b68c849c1536e5ae15ff138fd1,\n is_infinite: false,\n },\n );\n assert_eq(\n pedersen_hash_with_separator([1, 2, 3, 4], 4),\n 0xdae10fb32a8408521803905981a2b300d6a35e40e798743e9322b223a5eddc,\n );\n assert_eq(\n pedersen_commitment_with_separator([1, 2, 3, 4], 4),\n EmbeddedCurvePoint {\n x: 0x07ae3e202811e1fca39c2d81eabe6f79183978e6f12be0d3b8eda095b79bdbc9,\n y: 0x0afc6f892593db6fbba60f2da558517e279e0ae04f95758587760ba193145014,\n is_infinite: false,\n },\n );\n assert_eq(\n pedersen_hash_with_separator([1, 2, 3, 4, 5], 5),\n 0xfc375b062c4f4f0150f7100dfb8d9b72a6d28582dd9512390b0497cdad9c22,\n );\n assert_eq(\n pedersen_commitment_with_separator([1, 2, 3, 4, 5], 5),\n EmbeddedCurvePoint {\n x: 0x1754b12bd475a6984a1094b5109eeca9838f4f81ac89c5f0a41dbce53189bb29,\n y: 0x2da030e3cfcdc7ddad80eaf2599df6692cae0717d4e9f7bfbee8d073d5d278f7,\n is_infinite: false,\n },\n );\n assert_eq(\n pedersen_hash_with_separator([1, 2, 3, 4, 5, 6], 6),\n 0x1696ed13dc2730062a98ac9d8f9de0661bb98829c7582f699d0273b18c86a572,\n );\n assert_eq(\n pedersen_commitment_with_separator([1, 2, 3, 4, 5, 6], 6),\n EmbeddedCurvePoint {\n x: 0x190f6c0e97ad83e1e28da22a98aae156da083c5a4100e929b77e750d3106a697,\n y: 0x1f4b60f34ef91221a0b49756fa0705da93311a61af73d37a0c458877706616fb,\n is_infinite: false,\n },\n );\n assert_eq(\n pedersen_hash_with_separator([1, 2, 3, 4, 5, 6, 7], 7),\n 0x128c0ff144fc66b6cb60eeac8a38e23da52992fc427b92397a7dffd71c45ede3,\n );\n assert_eq(\n pedersen_commitment_with_separator([1, 2, 3, 4, 5, 6, 7], 7),\n EmbeddedCurvePoint {\n x: 0x015441e9d29491b06563fac16fc76abf7a9534c715421d0de85d20dbe2965939,\n y: 0x1d2575b0276f4e9087e6e07c2cb75aa1baafad127af4be5918ef8a2ef2fea8fc,\n is_infinite: false,\n },\n );\n assert_eq(\n pedersen_hash_with_separator([1, 2, 3, 4, 5, 6, 7, 8], 8),\n 0x2f960e117482044dfc99d12fece2ef6862fba9242be4846c7c9a3e854325a55c,\n );\n assert_eq(\n pedersen_commitment_with_separator([1, 2, 3, 4, 5, 6, 7, 8], 8),\n EmbeddedCurvePoint {\n x: 0x1657737676968887fceb6dd516382ea13b3a2c557f509811cd86d5d1199bc443,\n y: 0x1f39f0cb569040105fa1e2f156521e8b8e08261e635a2b210bdc94e8d6d65f77,\n is_infinite: false,\n },\n );\n assert_eq(\n pedersen_hash_with_separator([1, 2, 3, 4, 5, 6, 7, 8, 9], 9),\n 0x0c96db0790602dcb166cc4699e2d306c479a76926b81c2cb2aaa92d249ec7be7,\n );\n assert_eq(\n pedersen_commitment_with_separator([1, 2, 3, 4, 5, 6, 7, 8, 9], 9),\n EmbeddedCurvePoint {\n x: 0x0a3ceae42d14914a432aa60ec7fded4af7dad7dd4acdbf2908452675ec67e06d,\n y: 0xfc19761eaaf621ad4aec9a8b2e84a4eceffdba78f60f8b9391b0bd9345a2f2,\n is_infinite: false,\n },\n );\n assert_eq(\n pedersen_hash_with_separator([1, 2, 3, 4, 5, 6, 7, 8, 9, 10], 10),\n 0x2cd37505871bc460a62ea1e63c7fe51149df5d0801302cf1cbc48beb8dff7e94,\n );\n assert_eq(\n pedersen_commitment_with_separator([1, 2, 3, 4, 5, 6, 7, 8, 9, 10], 10),\n EmbeddedCurvePoint {\n x: 0x2fb3f8b3d41ddde007c8c3c62550f9a9380ee546fcc639ffbb3fd30c8d8de30c,\n y: 0x300783be23c446b11a4c0fabf6c91af148937cea15fcf5fb054abf7f752ee245,\n is_infinite: false,\n },\n );\n}\n"
|
|
3470
2823
|
},
|
|
3471
|
-
"
|
|
2824
|
+
"233": {
|
|
3472
2825
|
"path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/oracle/version.nr",
|
|
3473
|
-
"source": "/// The ORACLE_VERSION constant is used to check that the oracle interface is in sync between PXE and Aztec.nr. We need\n/// to version the oracle interface to ensure that developers get a reasonable error message if they use incompatible\n/// versions of Aztec.nr and PXE. The TypeScript counterpart is in `oracle_version.ts`.\n///\n/// @dev Whenever a contract function or Noir test is run, the `
|
|
3474
|
-
},
|
|
3475
|
-
"194": {
|
|
3476
|
-
"path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/state_vars/delayed_public_mutable.nr",
|
|
3477
|
-
"source": "use crate::protocol::{\n delayed_public_mutable::{\n delayed_public_mutable_values::{unpack_delay_change, unpack_value_change},\n DelayedPublicMutableValues,\n ScheduledDelayChange,\n ScheduledValueChange,\n },\n traits::Packable,\n};\n\nuse crate::{context::{PrivateContext, PublicContext, UtilityContext}, state_vars::StateVariable, utils::WithHash};\n\nmod test;\n\n/// Public mutable values with private read access.\npub struct DelayedPublicMutable<T, let InitialDelay: u64, Context> {\n context: Context,\n storage_slot: Field,\n}\n\n// DelayedPublicMutable<T> stores a value of type T that is:\n// - publicly known (i.e. unencrypted)\n// - mutable in public\n// - readable in private with no contention (i.e. multiple parties can all read the same value without blocking one\n// another nor needing to coordinate)\n// This is famously a hard problem to solve. DelayedPublicMutable makes it work by introducing a delay to public\n// mutation: the value is not changed immediately but rather a value change is scheduled to happen in the future after\n// some delay measured in seconds. Reads in private are only valid as long as they are included in a block with a\n// timestamp not too far into the future, so that they can guarantee the value will not have possibly changed by then\n// (because of the delay). The delay for changing a value is initially equal to InitialDelay, but can be changed by\n// calling `schedule_delay_change`.\n//\n// This implementation requires that T implements the Packable and Eq traits, and allocates `M + 1` storage slots to\n// this state variable.\nimpl<T, let InitialDelay: u64, Context, let M: u32> StateVariable<M + 1, Context> for DelayedPublicMutable<T, InitialDelay, Context>\nwhere\n DelayedPublicMutableValues<T, InitialDelay>: Packable<N = M>,\n{\n fn new(context: Context, storage_slot: Field) -> Self {\n assert(storage_slot != 0, \"Storage slot 0 not allowed. Storage slots must start from 1.\");\n Self { context, storage_slot }\n }\n\n fn get_storage_slot(self) -> Field {\n self.storage_slot\n }\n}\n\nimpl<T, let InitialDelay: u64> DelayedPublicMutable<T, InitialDelay, PublicContext>\nwhere\n T: Eq,\n{\n\n pub fn schedule_value_change(self, new_value: T)\n where\n T: Packable,\n {\n let _value_change = self.schedule_and_return_value_change(new_value);\n }\n\n pub fn schedule_and_return_value_change(self, new_value: T) -> ScheduledValueChange<T>\n where\n T: Packable,\n {\n let mut value_change = self.read_value_change();\n let delay_change = self.read_delay_change();\n\n let current_timestamp = self.context.timestamp();\n let current_delay = delay_change.get_current(current_timestamp);\n\n // TODO: make this configurable https://github.com/AztecProtocol/aztec-packages/issues/5501\n let timestamp_of_change = current_timestamp + current_delay;\n value_change.schedule_change(new_value, current_timestamp, current_delay, timestamp_of_change);\n\n self.write(value_change, delay_change);\n\n value_change\n }\n\n pub fn schedule_delay_change(self, new_delay: u64)\n where\n T: Packable,\n {\n let mut delay_change = self.read_delay_change();\n\n let current_timestamp = self.context.timestamp();\n\n delay_change.schedule_change(new_delay, current_timestamp);\n\n self.write(self.read_value_change(), delay_change);\n }\n\n pub fn get_current_value(self) -> T\n where\n T: Packable,\n {\n let current_timestamp = self.context.timestamp();\n let value_change = self.read_value_change();\n\n value_change.get_current_at(current_timestamp)\n }\n\n pub fn get_current_delay(self) -> u64\n where\n T: Packable,\n {\n let current_timestamp = self.context.timestamp();\n self.read_delay_change().get_current(current_timestamp)\n }\n\n pub fn get_scheduled_value(self) -> (T, u64)\n where\n T: Packable,\n {\n self.read_value_change().get_scheduled()\n }\n\n pub fn get_scheduled_delay(self) -> (u64, u64)\n where\n T: Packable,\n {\n self.read_delay_change().get_scheduled()\n }\n\n fn read_value_change(self) -> ScheduledValueChange<T>\n where\n T: Packable,\n {\n // We don't read ScheduledValueChange directly by having it implement Packable because ScheduledValueChange and\n // ScheduledDelayChange are packed together (sdc and svc.timestamp_of_change are stored in the same slot).\n let packed = self.context.storage_read(self.storage_slot);\n unpack_value_change::<T, <T as Packable>::N>(packed)\n }\n\n fn read_delay_change(self) -> ScheduledDelayChange<InitialDelay>\n where\n T: Packable,\n {\n // Since all ScheduledDelayChange member are packed into a single field, we can read a single storage slot here\n // and skip the ones that correspond to ScheduledValueChange members. We are abusing the fact that the field\n // containing the ScheduledDelayChange data is the first one in the storage layout - otherwise we'd need to\n // offset the storage slot to get the position where it'd land. We don't read ScheduledDelayChange directly by\n // having it implement Packable because ScheduledValueChange and ScheduledDelayChange are packed together (sdc\n // and svc.timestamp_of_change are stored in the same slot).\n let packed = self.context.storage_read(self.storage_slot);\n unpack_delay_change::<InitialDelay>(packed)\n }\n\n fn write(self, value_change: ScheduledValueChange<T>, delay_change: ScheduledDelayChange<InitialDelay>)\n where\n T: Packable,\n {\n // Whenever we write to public storage, we write both the value change and delay change to storage at once. We\n // do so by wrapping them in a single struct (`DelayedPublicMutableValues`). Then we wrap the resulting struct\n // in `WithHash`. Wrapping in `WithHash` makes for more costly writes but it also makes private proofs much\n // simpler because they only need to produce a historical proof for the hash, which results in a single\n // inclusion proof (as opposed to 4 in the best case scenario in which T is a single field). Private delayed\n // public mutable reads are assumed to be much more frequent than public writes, so this tradeoff makes sense.\n let values = WithHash::new(DelayedPublicMutableValues::new(value_change, delay_change));\n\n self.context.storage_write(self.storage_slot, values);\n }\n}\n\nimpl<T, let InitialDelay: u64> DelayedPublicMutable<T, InitialDelay, &mut PrivateContext>\nwhere\n T: Eq,\n{\n pub fn get_current_value(self) -> T\n where\n T: Packable,\n {\n // When reading the current value in private we construct a historical state proof for the public value.\n // However, since this value might change, we must constrain the maximum transaction timestamp as this proof\n // will only be valid for the time we can ensure the value will not change, which will depend on the current\n // delay and any scheduled delay changes.\n let (value_change, delay_change, anchor_timestamp) = self.anchor_read_from_public_storage();\n\n // We use the effective minimum delay as opposed to the current delay at the anchor block's timestamp as this\n // one also takes into consideration any scheduled delay changes. For example, consider a scenario in which at\n // timestamp `x` the current delay was 86400 seconds (1 day). We may naively think that the earliest we could\n // change the value would be at timestamp `x + 86400` by scheduling immediately after the anchor block's\n // timestamp, i.e. at timestamp `x + 1`. But if there was a delay change scheduled for timestamp `y` to reduce\n // the delay to 43200 seconds (12 hours), then if a value change was scheduled at timestamp `y` it would go\n // into effect at timestamp `y + 43200`, which is earlier than what we'd expect if we only considered the\n // current delay.\n let effective_minimum_delay = delay_change.get_effective_minimum_delay_at(anchor_timestamp);\n let time_horizon = value_change.get_time_horizon(anchor_timestamp, effective_minimum_delay);\n\n // We prevent this transaction from being included in any timestamp after the time horizon, ensuring that the\n // historical public value matches the current one, since it can only change after the horizon.\n self.context.set_include_by_timestamp(time_horizon);\n\n value_change.get_current_at(anchor_timestamp)\n }\n\n fn anchor_read_from_public_storage(self) -> (ScheduledValueChange<T>, ScheduledDelayChange<InitialDelay>, u64)\n where\n T: Packable,\n {\n let header = self.context.get_anchor_block_header();\n let address = self.context.this_address();\n\n let anchor_timestamp = header.global_variables.timestamp;\n\n let values: DelayedPublicMutableValues<T, InitialDelay> =\n WithHash::historical_public_storage_read(header, address, self.storage_slot);\n\n (values.svc, values.sdc, anchor_timestamp)\n }\n}\n\nimpl<T, let InitialDelay: u64> DelayedPublicMutable<T, InitialDelay, UtilityContext>\nwhere\n T: Eq,\n{\n pub unconstrained fn get_current_value(self) -> T\n where\n T: Packable,\n {\n let dpmv: DelayedPublicMutableValues<T, InitialDelay> =\n WithHash::utility_public_storage_read(self.context, self.storage_slot);\n\n let current_timestamp = self.context.timestamp();\n dpmv.svc.get_current_at(current_timestamp)\n }\n}\n"
|
|
3478
|
-
},
|
|
3479
|
-
"195": {
|
|
3480
|
-
"path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/state_vars/map.nr",
|
|
3481
|
-
"source": "use crate::protocol::{storage::map::derive_storage_slot_in_map, traits::ToField};\nuse crate::state_vars::StateVariable;\n\n/// A key-value container for state variables.\n///\n/// A key-value storage container that maps keys to state variables, similar to Solidity mappings.\n///\n/// `Map` enables you to associate keys (like addresses or other identifiers) with state variables in your Aztec smart\n/// contract. This is conceptually similar to Solidity's `mapping(K => V)` syntax, where you can store and retrieve\n/// values by their associated keys.\n///\n/// You can declare a state variable contained within a Map in your contract's\n/// [storage](crate::macros::storage::storage) struct.\n///\n/// For example, you might use `Map<AztecAddress, PublicMutable<FieldNote, Context>, Context>` to track token balances\n/// for different users, similar to how you'd use `mapping(address => uint256)` in Solidity.\n///\n/// > Aside: the verbose `Context` in the declaration is a consequence of > leveraging Noir's regular syntax for\n/// generics to ensure that certain > state variable methods can only be called in some contexts (private, > public,\n/// utility).\n///\n/// The methods of Map are:\n/// - `at` (access state variable for a given key) (see the method's own doc comments for more info).\n///\n/// ## Generic Parameters\n/// - `K`: The key type (must implement `ToField` trait for hashing)\n/// - `V`: The value type:\n/// - any Aztec state variable (variable that implements the StateVariable trait):\n/// - `PublicMutable`\n/// - `PublicImmutable`\n/// - `DelayedPublicMutable`\n/// - `Map`\n/// - `Context`: The execution context (handles private/public function contexts)\n///\n/// ## Usage Maps are typically declared in your contract's [storage](crate::macros::storage::storage) struct and accessed using the `at(key)` method to get the state variable for a specific key. The resulting state variable can then be read from or written to using its own methods.\n///\n/// Note that maps cannot be used with owned state variables (variables that implement the OwnedStateVariable trait) -\n/// those need to be wrapped in an `Owned` state variable instead.\n///\n/// ## Advanced Internally, `Map` uses a single base storage slot to represent the mapping itself, similar to Solidity's approach. Individual key-value pairs are stored at derived storage slots computed by hashing the base storage slot with the key using Poseidon2. This ensures:\n/// - No storage slot collisions between different keys\n/// - Uniform distribution of storage slots across the storage space\n/// - Compatibility with Aztec's storage tree structure\n/// - Gas-efficient storage access patterns similar to Solidity mappings\n///\n/// The storage slot derivation uses `derive_storage_slot_in_map(base_slot, key)` which computes\n/// `poseidon2_hash([base_slot, key.to_field()])`, ensuring cryptographically secure slot separation.\n///\n/// docs:start:map\npub struct Map<K, V, Context> {\n pub context: Context,\n storage_slot: Field,\n}\n\n// Map reserves a single storage slot regardless of what it stores because nothing is stored at said slot: it is only\n// used to derive the storage slots of nested state variables, which is expected to never result in collisions or slots\n// being close to one another due to these being hashes. This mirrors the strategy adopted by Solidity mappings.\nimpl<K, V, Context> StateVariable<1, Context> for Map<K, V, Context> {\n fn new(context: Context, storage_slot: Field) -> Self {\n assert(storage_slot != 0, \"Storage slot 0 not allowed. Storage slots must start from 1.\");\n Map { context, storage_slot }\n }\n\n fn get_storage_slot(self) -> Field {\n self.storage_slot\n }\n}\n\nimpl<K, V, Context> Map<K, V, Context> {\n /// Returns the state variable associated with the given key.\n ///\n /// This is equivalent to accessing `mapping[key]` in Solidity. It returns the state variable instance for the\n /// specified key, which can then be used to read or write the value at that key.\n ///\n /// Unlike Solidity mappings which return the value directly, this returns the state variable wrapper (like\n /// PublicMutable, nested Map etc.) that you then call methods on to interact with the actual value.\n ///\n /// # Arguments\n ///\n /// * `key` - The key to look up in the map. Must implement the ToField trait (which most basic Noir & Aztec types\n /// do).\n ///\n /// # Returns\n ///\n /// * `V` - The state variable instance for this key. You can then call methods like `.read()`, `.write()`,\n /// `.get_note()`, etc. on this depending on the specific state variable type.\n ///\n /// # Example\n ///\n /// ```noir\n /// // Get a user's balance (assuming PrivateMutable<FieldNote>)\n /// let user_balance = self.storage.balances.at(user_address);\n /// let current_note = user_balance.get_note();\n ///\n /// // Update the balance\n /// user_balance.replace(new_note);\n /// ```\n ///\n pub fn at<let N: u32>(self, key: K) -> V\n where\n K: ToField,\n V: StateVariable<N, Context>,\n {\n V::new(\n self.context,\n derive_storage_slot_in_map(self.storage_slot, key),\n )\n }\n}\n"
|
|
3482
|
-
},
|
|
3483
|
-
"236": {
|
|
3484
|
-
"path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/utils/array/append.nr",
|
|
3485
|
-
"source": "/// Appends the elements of the second `BoundedVec` to the end of the first one. The resulting `BoundedVec` can have\n/// any arbitrary maximum length, but it must be large enough to fit all of the elements of both the first and second\n/// vectors.\npub fn append<T, let ALen: u32, let BLen: u32, let DstLen: u32>(\n a: BoundedVec<T, ALen>,\n b: BoundedVec<T, BLen>,\n) -> BoundedVec<T, DstLen> {\n let mut dst = BoundedVec::new();\n\n dst.extend_from_bounded_vec(a);\n dst.extend_from_bounded_vec(b);\n\n dst\n}\n\nmod test {\n use super::append;\n\n #[test]\n unconstrained fn append_empty_vecs() {\n let a: BoundedVec<_, 3> = BoundedVec::new();\n let b: BoundedVec<_, 14> = BoundedVec::new();\n\n let result: BoundedVec<Field, 5> = append(a, b);\n\n assert_eq(result.len(), 0);\n assert_eq(result.storage(), std::mem::zeroed());\n }\n\n #[test]\n unconstrained fn append_non_empty_vecs() {\n let a: BoundedVec<_, 3> = BoundedVec::from_array([1, 2, 3]);\n let b: BoundedVec<_, 14> = BoundedVec::from_array([4, 5, 6]);\n\n let result: BoundedVec<Field, 8> = append(a, b);\n\n assert_eq(result.len(), 6);\n assert_eq(result.storage(), [1, 2, 3, 4, 5, 6, std::mem::zeroed(), std::mem::zeroed()]);\n }\n\n #[test(should_fail_with = \"out of bounds\")]\n unconstrained fn append_non_empty_vecs_insufficient_max_len() {\n let a: BoundedVec<_, 3> = BoundedVec::from_array([1, 2, 3]);\n let b: BoundedVec<_, 14> = BoundedVec::from_array([4, 5, 6]);\n\n let _: BoundedVec<Field, 5> = append(a, b);\n }\n}\n"
|
|
3486
|
-
},
|
|
3487
|
-
"239": {
|
|
3488
|
-
"path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/utils/array/subarray.nr",
|
|
3489
|
-
"source": "/// Returns `DstLen` elements from a source array, starting at `offset`. `DstLen` must not be larger than the number of\n/// elements past `offset`.\n///\n/// Examples:\n/// ```\n/// let foo: [Field; 2] = subarray([1, 2, 3, 4, 5], 2);\n/// assert_eq(foo, [3, 4]);\n///\n/// let bar: [Field; 5] = subarray([1, 2, 3, 4, 5], 2); // fails - we can't return 5 elements since only 3 remain\n/// ```\npub fn subarray<T, let SrcLen: u32, let DstLen: u32>(src: [T; SrcLen], offset: u32) -> [T; DstLen] {\n assert(offset + DstLen <= SrcLen, \"DstLen too large for offset\");\n\n let mut dst: [T; DstLen] = std::mem::zeroed();\n for i in 0..DstLen {\n dst[i] = src[i + offset];\n }\n\n dst\n}\n\nmod test {\n use super::subarray;\n\n #[test]\n unconstrained fn subarray_into_empty() {\n // In all of these cases we're setting DstLen to be 0, so we always get back an empty array.\n assert_eq(subarray::<Field, _, _>([], 0), []);\n assert_eq(subarray([1, 2, 3, 4, 5], 0), []);\n assert_eq(subarray([1, 2, 3, 4, 5], 2), []);\n }\n\n #[test]\n unconstrained fn subarray_complete() {\n assert_eq(subarray::<Field, _, _>([], 0), []);\n assert_eq(subarray([1, 2, 3, 4, 5], 0), [1, 2, 3, 4, 5]);\n }\n\n #[test]\n unconstrained fn subarray_different_end_sizes() {\n // We implicitly select how many values to read in the size of the return array\n assert_eq(subarray([1, 2, 3, 4, 5], 1), [2, 3, 4, 5]);\n assert_eq(subarray([1, 2, 3, 4, 5], 1), [2, 3, 4]);\n assert_eq(subarray([1, 2, 3, 4, 5], 1), [2, 3]);\n assert_eq(subarray([1, 2, 3, 4, 5], 1), [2]);\n }\n\n #[test(should_fail_with = \"DstLen too large for offset\")]\n unconstrained fn subarray_offset_too_large() {\n // With an offset of 1 we can only request up to 4 elements\n let _: [_; 5] = subarray([1, 2, 3, 4, 5], 1);\n }\n\n #[test(should_fail)]\n unconstrained fn subarray_bad_return_value() {\n assert_eq(subarray([1, 2, 3, 4, 5], 1), [3, 3, 4, 5]);\n }\n}\n"
|
|
3490
|
-
},
|
|
3491
|
-
"240": {
|
|
3492
|
-
"path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/utils/array/subbvec.nr",
|
|
3493
|
-
"source": "use crate::utils::array;\n\n/// Returns `DstMaxLen` elements from a source BoundedVec, starting at `offset`. `offset` must not be larger than the\n/// original length, and `DstLen` must not be larger than the total number of elements past `offset` (including the\n/// zeroed elements past `len()`).\n///\n/// Only elements at the beginning of the vector can be removed: it is not possible to also remove elements at the end\n/// of the vector by passing a value for `DstLen` that is smaller than `len() - offset`.\n///\n/// Examples:\n/// ```\n/// let foo = BoundedVec::<_, 10>::from_array([1, 2, 3, 4, 5]);\n/// assert_eq(subbvec(foo, 2), BoundedVec::<_, 8>::from_array([3, 4, 5]));\n///\n/// let bar: BoundedVec<_, 1> = subbvec(foo, 2); // fails - we can't return just 1 element since 3 remain\n/// let baz: BoundedVec<_, 10> = subbvec(foo, 3); // fails - we can't return 10 elements since only 7 remain\n/// ```\npub fn subbvec<T, let SrcMaxLen: u32, let DstMaxLen: u32>(\n bvec: BoundedVec<T, SrcMaxLen>,\n offset: u32,\n) -> BoundedVec<T, DstMaxLen> {\n // from_parts_unchecked does not verify that the elements past len are zeroed, but that is not an issue in our case\n // because we're constructing the new storage array as a subarray of the original one (which should have zeroed\n // storage past len), guaranteeing correctness. This is because `subarray` does not allow extending arrays past\n // their original length.\n BoundedVec::from_parts_unchecked(array::subarray(bvec.storage(), offset), bvec.len() - offset)\n}\n\nmod test {\n use super::subbvec;\n\n #[test]\n unconstrained fn subbvec_empty() {\n let bvec = BoundedVec::<Field, 0>::from_array([]);\n assert_eq(subbvec(bvec, 0), bvec);\n }\n\n #[test]\n unconstrained fn subbvec_complete() {\n let bvec = BoundedVec::<_, 10>::from_array([1, 2, 3, 4, 5]);\n assert_eq(subbvec(bvec, 0), bvec);\n\n let smaller_capacity = BoundedVec::<_, 5>::from_array([1, 2, 3, 4, 5]);\n assert_eq(subbvec(bvec, 0), smaller_capacity);\n }\n\n #[test]\n unconstrained fn subbvec_partial() {\n let bvec = BoundedVec::<_, 10>::from_array([1, 2, 3, 4, 5]);\n\n assert_eq(subbvec(bvec, 2), BoundedVec::<_, 8>::from_array([3, 4, 5]));\n assert_eq(subbvec(bvec, 2), BoundedVec::<_, 3>::from_array([3, 4, 5]));\n }\n\n #[test]\n unconstrained fn subbvec_into_empty() {\n let bvec: BoundedVec<_, 10> = BoundedVec::from_array([1, 2, 3, 4, 5]);\n assert_eq(subbvec(bvec, 5), BoundedVec::<_, 5>::from_array([]));\n }\n\n #[test(should_fail)]\n unconstrained fn subbvec_offset_past_len() {\n let bvec = BoundedVec::<_, 10>::from_array([1, 2, 3, 4, 5]);\n let _: BoundedVec<_, 1> = subbvec(bvec, 6);\n }\n\n #[test(should_fail)]\n unconstrained fn subbvec_insufficient_dst_len() {\n let bvec = BoundedVec::<_, 10>::from_array([1, 2, 3, 4, 5]);\n\n // We're not providing enough space to hold all of the items inside the original BoundedVec. subbvec can cause\n // for the capacity to reduce, but not the length (other than by len - offset).\n let _: BoundedVec<_, 1> = subbvec(bvec, 2);\n }\n\n #[test(should_fail_with = \"DstLen too large for offset\")]\n unconstrained fn subbvec_dst_len_causes_enlarge() {\n let bvec = BoundedVec::<_, 10>::from_array([1, 2, 3, 4, 5]);\n\n // subbvec does not support capacity increases\n let _: BoundedVec<_, 11> = subbvec(bvec, 0);\n }\n\n #[test(should_fail_with = \"DstLen too large for offset\")]\n unconstrained fn subbvec_dst_len_too_large_for_offset() {\n let bvec = BoundedVec::<_, 10>::from_array([1, 2, 3, 4, 5]);\n\n // This effectively requests a capacity increase, since there'd be just one element plus the 5 empty slots,\n // which is less than 7.\n let _: BoundedVec<_, 7> = subbvec(bvec, 4);\n }\n}\n"
|
|
3494
|
-
},
|
|
3495
|
-
"242": {
|
|
3496
|
-
"path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/utils/conversion/bytes_to_fields.nr",
|
|
3497
|
-
"source": "use std::static_assert;\n\n// These functions are used to facilitate the conversion of log ciphertext between byte and field representations.\n//\n// `bytes_to_fields` uses fixed-size arrays since encryption contexts have compile-time size information.\n// `bytes_from_fields` uses BoundedVec for flexibility in unconstrained contexts where sizes are dynamic.\n//\n// Together they provide bidirectional conversion between bytes and fields when processing encrypted logs.\n\n/// Converts the input bytes into an array of fields. A Field is ~254 bits meaning that each field can store 31 whole\n/// bytes. Use `bytes_from_fields` to obtain the original bytes array.\n///\n/// The input bytes are chunked into chunks of 31 bytes. Each 31-byte chunk is viewed as big-endian, and is converted\n/// into a Field. For example, [1, 10, 3, ..., 0] (31 bytes) is encoded as [1 * 256^30 + 10 * 256^29 + 3 * 256^28 + ...\n/// + 0] Note: N must be a multiple of 31 bytes\npub fn bytes_to_fields<let N: u32>(bytes: [u8; N]) -> [Field; N / 31] {\n // Assert that N is a multiple of 31\n static_assert(N % 31 == 0, \"N must be a multiple of 31\");\n\n let mut fields = [0; N / 31];\n\n // Since N is a multiple of 31, we can simply process all chunks fully\n for i in 0..N / 31 {\n let mut field = 0;\n for j in 0..31 {\n // Shift the existing value left by 8 bits and add the new byte\n field = field * 256 + bytes[i * 31 + j] as Field;\n }\n fields[i] = field;\n }\n\n fields\n}\n\n/// Converts an input BoundedVec of fields into a BoundedVec of bytes in big-endian order. Arbitrary Field arrays are\n/// not allowed: this is assumed to be an array obtained via `bytes_to_fields`, i.e. one that actually represents\n/// bytes. To convert a Field array into bytes, use `fields_to_bytes`.\n///\n/// Each input field must contain at most 31 bytes (this is constrained to be so). Each field is converted into 31\n/// big-endian bytes, and the resulting 31-byte chunks are concatenated back together in the order of the original\n/// fields.\npub fn bytes_from_fields<let N: u32>(fields: BoundedVec<Field, N>) -> BoundedVec<u8, N * 31> {\n let mut bytes = BoundedVec::new();\n\n for i in 0..fields.len() {\n let field = fields.get(i);\n\n // We expect that the field contains at most 31 bytes of information.\n field.assert_max_bit_size::<248>();\n\n // Now we can safely convert the field to 31 bytes.\n let field_as_bytes: [u8; 31] = field.to_be_bytes();\n\n for j in 0..31 {\n bytes.push(field_as_bytes[j]);\n }\n }\n\n bytes\n}\n\nmod tests {\n use crate::utils::array::subarray;\n use super::{bytes_from_fields, bytes_to_fields};\n\n #[test]\n unconstrained fn random_bytes_to_fields_and_back(input: [u8; 93]) {\n let fields = bytes_to_fields(input);\n\n // At this point in production, the log flies through the system and we get a BoundedVec on the other end. So\n // we need to convert the field array to a BoundedVec to be able to feed it to the `bytes_from_fields`\n // function.\n let fields_as_bounded_vec = BoundedVec::<_, 6>::from_array(fields);\n\n let bytes_back = bytes_from_fields(fields_as_bounded_vec);\n\n // Compare the original input with the round-tripped result\n assert_eq(bytes_back.len(), input.len());\n assert_eq(subarray(bytes_back.storage(), 0), input);\n }\n\n #[test(should_fail_with = \"N must be a multiple of 31\")]\n unconstrained fn bytes_to_fields_input_length_not_multiple_of_31() {\n // Try to convert 32 bytes (not a multiple of 31) to fields\n let _fields = bytes_to_fields([0; 32]);\n }\n\n}\n"
|
|
3498
|
-
},
|
|
3499
|
-
"243": {
|
|
3500
|
-
"path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/utils/conversion/fields_to_bytes.nr",
|
|
3501
|
-
"source": "// These functions are used to facilitate the conversion of log plaintext represented as fields into bytes and back.\n//\n// `fields_to_bytes` uses fixed-size arrays since encryption contexts have compile-time size information.\n// `fields_from_bytes` uses BoundedVec for flexibility in unconstrained contexts where sizes are dynamic.\n//\n// Together they provide bidirectional conversion between fields and bytes.\n\n/// Converts an input array of fields into a single array of bytes. Use `fields_from_bytes` to obtain the original\n/// field array. Each field is converted to a 32-byte big-endian array.\n///\n/// For example, if you have a field array [123, 456], it will be converted to a 64-byte array:\n/// [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,123, // First field (32 bytes)\n/// 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,200] // Second field (32 bytes)\n///\n/// Since a field is ~254 bits, you'll end up with a subtle 2-bit \"gap\" at the big end, every 32 bytes. Be careful that\n/// such a gap doesn't leak information! This could happen if you for example expected the output to be\n/// indistinguishable from random bytes.\npub fn fields_to_bytes<let N: u32>(fields: [Field; N]) -> [u8; 32 * N] {\n let mut bytes = [0; 32 * N];\n\n for i in 0..N {\n let field_as_bytes: [u8; 32] = fields[i].to_be_bytes();\n\n for j in 0..32 {\n bytes[i * 32 + j] = field_as_bytes[j];\n }\n }\n\n bytes\n}\n\n/// Converts an input BoundedVec of bytes into a BoundedVec of fields. Arbitrary byte arrays are not allowed: this is\n/// assumed to be an array obtained via `fields_to_bytes`, i.e. one that actually represents fields. To convert a byte\n/// array into Fields, use `bytes_to_fields`.\n///\n/// The input bytes are chunked into chunks of 32 bytes. Each 32-byte chunk is viewed as big-endian, and is converted\n/// into a Field. For example, [1, 10, 3, ..., 0] (32 bytes) is encoded as [1 * 256^31 + 10 * 256^30 + 3 * 256^29 + ...\n/// + 0] Note 1: N must be a multiple of 32 bytes Note 2: The max value check code was taken from\n/// std::field::to_be_bytes function.\npub fn fields_from_bytes<let N: u32>(bytes: BoundedVec<u8, N>) -> BoundedVec<Field, N / 32> {\n // Assert that input length is a multiple of 32\n assert(bytes.len() % 32 == 0, \"Input length must be a multiple of 32\");\n\n let mut fields = BoundedVec::new();\n\n let p = std::field::modulus_be_bytes();\n\n // Since input length is a multiple of 32, we can simply process all chunks fully\n for i in 0..bytes.len() / 32 {\n let mut field = 0;\n\n // Process each byte in the 32-byte chunk\n let mut ok = false;\n\n for j in 0..32 {\n let next_byte = bytes.get(i * 32 + j);\n field = field * 256 + next_byte as Field;\n\n if !ok {\n if next_byte != p[j] {\n assert(next_byte < p[j], \"Value does not fit in field\");\n ok = true;\n }\n }\n }\n assert(ok, \"Value does not fit in field\");\n\n fields.push(field);\n }\n\n fields\n}\n\nmod tests {\n use crate::utils::array::subarray;\n use super::{fields_from_bytes, fields_to_bytes};\n\n #[test]\n unconstrained fn random_fields_to_bytes_and_back(input: [Field; 3]) {\n // Convert to bytes\n let bytes = fields_to_bytes(input);\n\n // At this point in production, the log flies through the system and we get a BoundedVec on the other end. So\n // we need to convert the field array to a BoundedVec to be able to feed it to the `fields_from_bytes`\n // function. 113 is an arbitrary max length that is larger than the input length of 96.\n let bytes_as_bounded_vec = BoundedVec::<_, 113>::from_array(bytes);\n\n // Convert back to fields\n let fields_back = fields_from_bytes(bytes_as_bounded_vec);\n\n // Compare the original input with the round-tripped result\n assert_eq(fields_back.len(), input.len());\n assert_eq(subarray(fields_back.storage(), 0), input);\n }\n\n #[test(should_fail_with = \"Input length must be a multiple of 32\")]\n unconstrained fn to_fields_assert() {\n // 143 is an arbitrary max length that is larger than 33\n let input = BoundedVec::<_, 143>::from_array([\n 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29,\n 30, 31, 32, 33,\n ]);\n\n // This should fail since 33 is not a multiple of 32\n let _fields = fields_from_bytes(input);\n }\n\n #[test]\n unconstrained fn fields_from_bytes_max_value() {\n let max_field_as_bytes: [u8; 32] = (-1).to_be_bytes();\n let input = BoundedVec::<_, 32>::from_array(max_field_as_bytes);\n\n let fields = fields_from_bytes(input);\n\n // The result should be a largest value storable in a field (-1 since we are modulo-ing)\n assert_eq(fields.get(0), -1);\n }\n\n // In this test we verify that overflow check works by taking the max allowed value, bumping a random byte and then\n // feeding it to `fields_from_bytes` as input.\n #[test(should_fail_with = \"Value does not fit in field\")]\n unconstrained fn fields_from_bytes_overflow(random_value: u8) {\n let index_of_byte_to_bump = random_value % 32;\n\n // Obtain the byte representation of the maximum field value\n let max_field_value_as_bytes: [u8; 32] = (-1).to_be_bytes();\n\n let byte_to_bump = max_field_value_as_bytes[index_of_byte_to_bump as u32];\n\n // Skip test execution if the selected byte is already at maximum value (255). This is acceptable since we are\n // using fuzz testing to generate many test cases.\n if byte_to_bump != 255 {\n let mut input = BoundedVec::<_, 32>::from_array(max_field_value_as_bytes);\n\n // Increment the selected byte to exceed the field's maximum value\n input.set(index_of_byte_to_bump as u32, byte_to_bump + 1);\n\n // Attempt the conversion, which should fail due to the value exceeding the field's capacity\n let _fields = fields_from_bytes(input);\n }\n }\n\n}\n"
|
|
3502
|
-
},
|
|
3503
|
-
"246": {
|
|
3504
|
-
"path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/utils/point.nr",
|
|
3505
|
-
"source": "use crate::protocol::{point::Point, utils::field::sqrt};\n\n// I am storing the modulus minus 1 divided by 2 here because full modulus would throw \"String literal too large\" error\n// Full modulus is 21888242871839275222246405745257275088548364400416034343698204186575808495617\nglobal BN254_FR_MODULUS_DIV_2: Field = 10944121435919637611123202872628637544274182200208017171849102093287904247808;\n\n/// Returns: true if p.y <= MOD_DIV_2, else false.\npub fn get_sign_of_point(p: Point) -> bool {\n // We store only a \"sign\" of the y coordinate because the rest can be derived from the x coordinate. To get the\n // sign we check if the y coordinate is less or equal than the field's modulus minus 1 divided by 2. Ideally we'd\n // do `y <= MOD_DIV_2`, but there's no `lte` function, so instead we do `!(y > MOD_DIV_2)`, which is equivalent,\n // and then rewrite that as `!(MOD_DIV_2 < y)`, since we also have no `gt` function.\n !BN254_FR_MODULUS_DIV_2.lt(p.y)\n}\n\n/// Returns a `Point` in the Grumpkin curve given its x coordinate.\n///\n/// Because not all values in the field are valid x coordinates of points in the curve (i.e. there is no corresponding\n/// y value in the field that satisfies the curve equation), it may not be possible to reconstruct a `Point`.\n/// `Option::none()` is returned in such cases.\npub fn point_from_x_coord(x: Field) -> Option<Point> {\n // y ^ 2 = x ^ 3 - 17\n let rhs = x * x * x - 17;\n sqrt(rhs).map(|y| Point { x, y, is_infinite: false })\n}\n\n/// Returns a `Point` in the Grumpkin curve given its x coordinate and sign for the y coordinate.\n///\n/// Because not all values in the field are valid x coordinates of points in the curve (i.e. there is no corresponding\n/// y value in the field that satisfies the curve equation), it may not be possible to reconstruct a `Point`.\n/// `Option::none()` is returned in such cases.\n///\n/// @param x - The x coordinate of the point @param sign - The \"sign\" of the y coordinate - determines whether y <=\n/// (Fr.MODULUS - 1) / 2\npub fn point_from_x_coord_and_sign(x: Field, sign: bool) -> Option<Point> {\n // y ^ 2 = x ^ 3 - 17\n let rhs = x * x * x - 17;\n\n sqrt(rhs).map(|y| {\n // If there is a square root, we need to ensure it has the correct \"sign\"\n let y_is_positive = !BN254_FR_MODULUS_DIV_2.lt(y);\n let final_y = if y_is_positive == sign { y } else { -y };\n Point { x, y: final_y, is_infinite: false }\n })\n}\n\nmod test {\n use crate::protocol::point::Point;\n use crate::utils::point::{\n BN254_FR_MODULUS_DIV_2, get_sign_of_point, point_from_x_coord, point_from_x_coord_and_sign,\n };\n\n #[test]\n unconstrained fn test_point_from_x_coord_and_sign() {\n // Test positive y coordinate\n let x = 0x1af41f5de96446dc3776a1eb2d98bb956b7acd9979a67854bec6fa7c2973bd73;\n let sign = true;\n let p = point_from_x_coord_and_sign(x, sign).unwrap();\n\n assert_eq(p.x, x);\n assert_eq(p.y, 0x07fc22c7f2c7057571f137fe46ea9c95114282bc95d37d71ec4bfb88de457d4a);\n assert_eq(p.is_infinite, false);\n\n // Test negative y coordinate\n let x2 = 0x247371652e55dd74c9af8dbe9fb44931ba29a9229994384bd7077796c14ee2b5;\n let sign2 = false;\n let p2 = point_from_x_coord_and_sign(x2, sign2).unwrap();\n\n assert_eq(p2.x, x2);\n assert_eq(p2.y, 0x26441aec112e1ae4cee374f42556932001507ad46e255ffb27369c7e3766e5c0);\n assert_eq(p2.is_infinite, false);\n }\n\n #[test]\n unconstrained fn test_point_from_x_coord_valid() {\n // x = 8 is a known quadratic residue - should give a valid point\n let result = point_from_x_coord(Field::from(8));\n assert(result.is_some());\n\n let point = result.unwrap();\n assert_eq(point.x, Field::from(8));\n // Check curve equation y^2 = x^3 - 17\n assert_eq(point.y * point.y, point.x * point.x * point.x - 17);\n }\n\n #[test]\n unconstrained fn test_point_from_x_coord_invalid() {\n // x = 3 is a non-residue for this curve - should give None\n let x = Field::from(3);\n let maybe_point = point_from_x_coord(x);\n assert(maybe_point.is_none());\n }\n\n #[test]\n unconstrained fn test_both_roots_satisfy_curve() {\n // Derive a point from x = 8 (known to be valid from test_point_from_x_coord_valid)\n let x: Field = 8;\n let point = point_from_x_coord(x).unwrap();\n\n // Check y satisfies curve equation\n assert_eq(point.y * point.y, x * x * x - 17);\n\n // Check -y also satisfies curve equation\n let neg_y = 0 - point.y;\n assert_eq(neg_y * neg_y, x * x * x - 17);\n\n // Verify they are different (unless y = 0)\n assert(point.y != neg_y);\n }\n\n #[test]\n unconstrained fn test_point_from_x_coord_and_sign_invalid() {\n // x = 3 has no valid point on the curve (from test_point_from_x_coord_invalid)\n let x = Field::from(3);\n let result_positive = point_from_x_coord_and_sign(x, true);\n let result_negative = point_from_x_coord_and_sign(x, false);\n\n assert(result_positive.is_none());\n assert(result_negative.is_none());\n }\n\n #[test]\n unconstrained fn test_get_sign_of_point() {\n // Derive a point from x = 8, then test both possible y values\n let point = point_from_x_coord(8).unwrap();\n let neg_point = Point { x: point.x, y: 0 - point.y, is_infinite: false };\n\n // One should be \"positive\" (y <= MOD_DIV_2) and one \"negative\"\n let sign1 = get_sign_of_point(point);\n let sign2 = get_sign_of_point(neg_point);\n assert(sign1 != sign2);\n\n // y = 0 should return true (0 <= MOD_DIV_2)\n let zero_y_point = Point { x: 0, y: 0, is_infinite: false };\n assert(get_sign_of_point(zero_y_point) == true);\n\n // y = MOD_DIV_2 should return true (exactly at boundary)\n let boundary_point = Point { x: 0, y: BN254_FR_MODULUS_DIV_2, is_infinite: false };\n assert(get_sign_of_point(boundary_point) == true);\n\n // y = MOD_DIV_2 + 1 should return false (just over boundary)\n let over_boundary_point = Point { x: 0, y: BN254_FR_MODULUS_DIV_2 + 1, is_infinite: false };\n assert(get_sign_of_point(over_boundary_point) == false);\n }\n\n #[test]\n unconstrained fn test_point_from_x_coord_zero() {\n // x = 0: y^2 = 0^3 - 17 = -17, which is not a quadratic residue in BN254 scalar field\n let result = point_from_x_coord(0);\n assert(result.is_none());\n }\n\n #[test]\n unconstrained fn test_bn254_fr_modulus_div_2() {\n // Verify that BN254_FR_MODULUS_DIV_2 == (p - 1) / 2 This means: 2 * BN254_FR_MODULUS_DIV_2 + 1 == p == 0 (in\n // the field)\n assert_eq(2 * BN254_FR_MODULUS_DIV_2 + 1, 0);\n }\n\n}\n"
|
|
3506
|
-
},
|
|
3507
|
-
"249": {
|
|
3508
|
-
"path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/utils/with_hash.nr",
|
|
3509
|
-
"source": "use crate::{context::{PublicContext, UtilityContext}, history::storage::public_storage_historical_read, oracle};\nuse crate::protocol::{abis::block_header::BlockHeader, address::AztecAddress, hash::poseidon2_hash, traits::Packable};\n\n/// A struct that allows for efficient reading of value `T` from public storage in private.\n///\n/// The efficient reads are achieved by verifying large values through a single hash check and then proving inclusion\n/// only of the hash in public storage. This reduces the number of required tree inclusion proofs from `M` to 1.\n///\n/// # Type Parameters\n/// - `T`: The underlying type being wrapped, must implement `Packable<N>`\n/// - `M`: The number of field elements required to pack values of type `T`\npub struct WithHash<T, let M: u32> {\n value: T,\n packed: [Field; M],\n hash: Field,\n}\n\nimpl<T, let M: u32> WithHash<T, M>\nwhere\n T: Packable<N = M> + Eq,\n{\n pub fn new(value: T) -> Self {\n let packed = value.pack();\n Self { value, packed, hash: poseidon2_hash(packed) }\n }\n\n pub fn get_value(self) -> T {\n self.value\n }\n\n pub fn get_hash(self) -> Field {\n self.hash\n }\n\n /// Reads the value stored in this [WithHash] from public storage.\n ///\n /// Note that unlike a full public storage read, this will _not_ read (not return) the stored hash of the value,\n /// resulting in reduced gas costs.\n ///\n /// This is the public counterpart to [WithHash::utility_public_storage_read] and\n /// [WithHash::historical_public_storage_read].\n pub fn public_storage_read(context: PublicContext, storage_slot: Field) -> T {\n context.storage_read(storage_slot)\n }\n\n pub unconstrained fn utility_public_storage_read(context: UtilityContext, storage_slot: Field) -> T {\n context.storage_read(storage_slot)\n }\n\n pub fn historical_public_storage_read(\n header_to_read_from: BlockHeader,\n address: AztecAddress,\n storage_slot: Field,\n ) -> T {\n // We could simply produce historical inclusion proofs for each field in `packed`, but that would require one\n // full sibling path per storage slot (since due to kernel siloing the storage is not contiguous). Instead, we\n // get an oracle to provide us the values, and instead we prove inclusion of their hash, which is both a much\n // smaller proof (a single slot), and also independent of the size of T (except in that we need to pack and\n // hash T).\n let hint = WithHash::new(\n // Safety: We verify that a hash of the hint/packed data matches the stored hash.\n unsafe { oracle::storage::storage_read(header_to_read_from, address, storage_slot) },\n );\n\n // The actual `value` (of type T, of packed length M fields) is stored in contiguous fields from the\n // `storage_slot`. The _hash_ of the `value` is stored at the end, at slot: `storage_slot + M`.\n let hash = public_storage_historical_read(header_to_read_from, storage_slot + M as Field, address);\n\n if hash != 0 {\n assert_eq(hash, hint.get_hash(), \"Hint values do not match hash\");\n } else {\n // The hash slot can only hold a zero if it is uninitialized. Therefore, the hints must then be zero (i.e.\n // the default value for public storage) as well.\n assert_eq(hint.get_value(), T::unpack(std::mem::zeroed()), \"Non-zero hint for zero hash\");\n };\n\n hint.get_value()\n }\n}\n\n// Note: I don't derive Packable on `WithHash` because `derive_serialize` function does not support setting \"N = M\" as\n// I do here 3 lines below. This could be worked around by placing the \"where\" clause directly on the `WithHash`\n// struct, but Jake mentioned that the syntax is not expected to be supported at least until Noir 1.0. Relevant\n// discussion on Slack:\n// https://aztecprotocol.slack.com/archives/C04QF64EDNV/p1752593876160699?thread_ts=1752589887.955379&cid=C04QF64EDNV\nimpl<T, let M: u32> Packable for WithHash<T, M>\nwhere\n T: Packable<N = M>,\n{\n let N: u32 = M + 1;\n\n fn pack(self) -> [Field; Self::N] {\n let mut result: [Field; Self::N] = std::mem::zeroed();\n for i in 0..M {\n result[i] = self.packed[i];\n }\n result[M] = self.hash;\n\n result\n }\n\n fn unpack(packed: [Field; Self::N]) -> Self {\n let mut value_packed = [0; M];\n for i in 0..M {\n value_packed[i] = packed[i];\n }\n let hash = packed[M];\n\n Self { value: T::unpack(value_packed), packed: value_packed, hash }\n }\n}\n\nmod test {\n use crate::protocol::{hash::poseidon2_hash, traits::{Hash, Packable, ToField}};\n use crate::{test::{helpers::test_environment::TestEnvironment, mocks::MockStruct}, utils::with_hash::WithHash};\n\n use std::test::OracleMock;\n\n global STORAGE_SLOT: Field = 47;\n\n #[test]\n unconstrained fn create_and_recover() {\n let value = MockStruct { a: 5, b: 3 };\n let value_with_hash = WithHash::new(value);\n let recovered = WithHash::unpack(value_with_hash.pack());\n\n assert_eq(recovered.value, value);\n assert_eq(recovered.packed, value.pack());\n assert_eq(recovered.hash, poseidon2_hash(value.pack()));\n }\n\n #[test]\n unconstrained fn read_uninitialized_value() {\n let env = TestEnvironment::new();\n\n env.private_context(|context| {\n let result = WithHash::<MockStruct, _>::historical_public_storage_read(\n context.anchor_block_header,\n context.this_address(),\n STORAGE_SLOT,\n );\n\n assert_eq(result, std::mem::zeroed());\n });\n }\n\n #[test]\n unconstrained fn read_initialized_value() {\n let env = TestEnvironment::new();\n\n let value = MockStruct { a: 5, b: 3 };\n let value_with_hash = WithHash::new(value);\n\n env.public_context(|context| { context.storage_write(STORAGE_SLOT, value_with_hash); });\n\n env.private_context(|context| {\n let result = WithHash::<MockStruct, _>::historical_public_storage_read(\n context.anchor_block_header,\n context.this_address(),\n STORAGE_SLOT,\n );\n assert_eq(result, value);\n });\n }\n\n #[test(should_fail_with = \"Non-zero hint for zero hash\")]\n unconstrained fn bad_hint_uninitialized_value() {\n let env = TestEnvironment::new();\n\n env.private_context(|context| {\n let block_header = context.anchor_block_header;\n let address = context.this_address();\n\n // Mock the oracle to return a non-zero hint/packed value\n let value_packed = MockStruct { a: 1, b: 1 }.pack();\n let _ = OracleMock::mock(\"utilityStorageRead\")\n .with_params((block_header.hash(), address.to_field(), STORAGE_SLOT, value_packed.len()))\n .returns(value_packed)\n .times(1);\n\n // This should fail because the hint value is non-zero and the hash is zero (default value of storage)\n let _ = WithHash::<MockStruct, _>::historical_public_storage_read(block_header, address, STORAGE_SLOT);\n });\n }\n\n #[test(should_fail_with = \"Hint values do not match hash\")]\n unconstrained fn bad_hint_initialized_value() {\n let env = TestEnvironment::new();\n\n env.public_context(|context| {\n // Write the value and hash separately so that the hash is wrong\n let value = MockStruct { a: 5, b: 3 };\n context.storage_write(STORAGE_SLOT, value);\n\n let incorrect_hash = 13;\n let hash_storage_slot = STORAGE_SLOT + (value.pack().len() as Field);\n context.storage_write(hash_storage_slot, [incorrect_hash]);\n });\n\n env.private_context(|context| {\n let _ = WithHash::<MockStruct, _>::historical_public_storage_read(\n context.anchor_block_header,\n context.this_address(),\n STORAGE_SLOT,\n );\n });\n }\n}\n"
|
|
3510
|
-
},
|
|
3511
|
-
"257": {
|
|
3512
|
-
"path": "/home/aztec-dev/nargo/github.com/noir-lang/poseidon/v0.2.3/src/poseidon2.nr",
|
|
3513
|
-
"source": "use std::default::Default;\nuse std::hash::Hasher;\n\ncomptime global RATE: u32 = 3;\n\npub struct Poseidon2 {\n cache: [Field; 3],\n state: [Field; 4],\n cache_size: u32,\n squeeze_mode: bool, // 0 => absorb, 1 => squeeze\n}\n\nimpl Poseidon2 {\n #[no_predicates]\n pub fn hash<let N: u32>(input: [Field; N], message_size: u32) -> Field {\n Poseidon2::hash_internal(input, message_size)\n }\n\n pub(crate) fn new(iv: Field) -> Poseidon2 {\n let mut result =\n Poseidon2 { cache: [0; 3], state: [0; 4], cache_size: 0, squeeze_mode: false };\n result.state[RATE] = iv;\n result\n }\n\n fn perform_duplex(&mut self) {\n // add the cache into sponge state\n self.state[0] += self.cache[0];\n self.state[1] += self.cache[1];\n self.state[2] += self.cache[2];\n self.state = crate::poseidon2_permutation(self.state, 4);\n }\n\n fn absorb(&mut self, input: Field) {\n assert(!self.squeeze_mode);\n if self.cache_size == RATE {\n // If we're absorbing, and the cache is full, apply the sponge permutation to compress the cache\n self.perform_duplex();\n self.cache[0] = input;\n self.cache_size = 1;\n } else {\n // If we're absorbing, and the cache is not full, add the input into the cache\n self.cache[self.cache_size] = input;\n self.cache_size += 1;\n }\n }\n\n fn squeeze(&mut self) -> Field {\n assert(!self.squeeze_mode);\n // If we're in absorb mode, apply sponge permutation to compress the cache.\n self.perform_duplex();\n self.squeeze_mode = true;\n\n // Pop one item off the top of the permutation and return it.\n self.state[0]\n }\n\n fn hash_internal<let N: u32>(input: [Field; N], in_len: u32) -> Field {\n let two_pow_64 = 18446744073709551616;\n let iv: Field = (in_len as Field) * two_pow_64;\n let mut state = [0; 4];\n state[RATE] = iv;\n\n if std::runtime::is_unconstrained() {\n for i in 0..(in_len / RATE) {\n state[0] += input[i * RATE];\n state[1] += input[i * RATE + 1];\n state[2] += input[i * RATE + 2];\n state = crate::poseidon2_permutation(state, 4);\n }\n\n // handle remaining elements after last full RATE-sized chunk\n let num_extra_fields = in_len % RATE;\n if num_extra_fields != 0 {\n let remainder_start = in_len - num_extra_fields;\n state[0] += input[remainder_start];\n if num_extra_fields > 1 {\n state[1] += input[remainder_start + 1]\n }\n }\n } else {\n let mut states: [[Field; 4]; N / RATE + 1] = [[0; 4]; N / RATE + 1];\n states[0] = state;\n\n // process all full RATE-sized chunks, storing state after each permutation\n for chunk_idx in 0..(N / RATE) {\n for i in 0..RATE {\n state[i] += input[chunk_idx * RATE + i];\n }\n state = crate::poseidon2_permutation(state, 4);\n states[chunk_idx + 1] = state;\n }\n\n // get state at the last full block before in_len\n let first_partially_filled_chunk = in_len / RATE;\n state = states[first_partially_filled_chunk];\n\n // handle remaining elements after last full RATE-sized chunk\n let remainder_start = (in_len / RATE) * RATE;\n for j in 0..RATE {\n let idx = remainder_start + j;\n if idx < in_len {\n state[j] += input[idx];\n }\n }\n }\n\n // always run final permutation unless we just completed a full chunk\n // still need to permute once if in_len is 0\n if (in_len == 0) | (in_len % RATE != 0) {\n state = crate::poseidon2_permutation(state, 4)\n };\n\n state[0]\n }\n}\n\npub struct Poseidon2Hasher {\n _state: [Field],\n}\n\nimpl Hasher for Poseidon2Hasher {\n fn finish(self) -> Field {\n let iv: Field = (self._state.len() as Field) * 18446744073709551616; // iv = (self._state.len() << 64)\n let mut sponge = Poseidon2::new(iv);\n for i in 0..self._state.len() {\n sponge.absorb(self._state[i]);\n }\n sponge.squeeze()\n }\n\n fn write(&mut self, input: Field) {\n self._state = self._state.push_back(input);\n }\n}\n\nimpl Default for Poseidon2Hasher {\n fn default() -> Self {\n Poseidon2Hasher { _state: &[] }\n }\n}\n"
|
|
3514
|
-
},
|
|
3515
|
-
"299": {
|
|
3516
|
-
"path": "/home/aztec-dev/aztec-packages/noir-projects/noir-protocol-circuits/crates/types/src/abis/private_log.nr",
|
|
3517
|
-
"source": "use crate::{\n abis::log::Log,\n constants::PRIVATE_LOG_SIZE_IN_FIELDS,\n side_effect::{Counted, Scoped},\n traits::{Deserialize, Empty, Serialize},\n};\nuse std::meta::derive;\n\npub type PrivateLog = Log<PRIVATE_LOG_SIZE_IN_FIELDS>;\n\n#[derive(Eq, Deserialize, Serialize)]\npub struct PrivateLogData {\n pub log: Log<PRIVATE_LOG_SIZE_IN_FIELDS>,\n // The counter of the note hash this log is for. 0 if it does not link to a note hash.\n pub note_hash_counter: u32,\n}\n\nimpl Empty for PrivateLogData {\n fn empty() -> Self {\n PrivateLogData { log: PrivateLog::empty(), note_hash_counter: 0 }\n }\n}\n\nimpl PrivateLogData {\n pub fn count(self, counter: u32) -> Counted<Self> {\n Counted::new(self, counter)\n }\n}\n\nimpl Scoped<Counted<PrivateLogData>> {\n pub fn expose_to_public(self) -> PrivateLog {\n self.innermost().log\n }\n}\n"
|
|
2826
|
+
"source": "/// The ORACLE_VERSION constant is used to check that the oracle interface is in sync between PXE and Aztec.nr. We need\n/// to version the oracle interface to ensure that developers get a reasonable error message if they use incompatible\n/// versions of Aztec.nr and PXE. The TypeScript counterpart is in `oracle_version.ts`.\n///\n/// @dev Whenever a contract function or Noir test is run, the `aztec_utl_assertCompatibleOracleVersion` oracle is\n/// called\n/// and if the oracle version is incompatible an error is thrown.\npub global ORACLE_VERSION: Field = 14;\n\n/// Asserts that the version of the oracle is compatible with the version expected by the contract.\npub fn assert_compatible_oracle_version() {\n // Safety: This oracle call returns nothing: we only call it to check Aztec.nr and Oracle interface versions are\n // compatible. It is therefore always safe to call.\n unsafe {\n assert_compatible_oracle_version_wrapper();\n }\n}\n\nunconstrained fn assert_compatible_oracle_version_wrapper() {\n assert_compatible_oracle_version_oracle(ORACLE_VERSION);\n}\n\n#[oracle(aztec_utl_assertCompatibleOracleVersion)]\nunconstrained fn assert_compatible_oracle_version_oracle(version: Field) {}\n\nmod test {\n use super::{assert_compatible_oracle_version_oracle, ORACLE_VERSION};\n\n #[test]\n unconstrained fn compatible_oracle_version() {\n assert_compatible_oracle_version_oracle(ORACLE_VERSION);\n }\n\n #[test(should_fail_with = \"Incompatible oracle version. TXE is using version\")]\n unconstrained fn incompatible_oracle_version() {\n let arbitrary_incorrect_version = 318183437;\n assert_compatible_oracle_version_oracle(arbitrary_incorrect_version);\n }\n}\n"
|
|
3518
2827
|
},
|
|
3519
2828
|
"3": {
|
|
3520
2829
|
"path": "std/array/mod.nr",
|
|
3521
|
-
"source": "use crate::cmp::{Eq, Ord};\nuse crate::convert::From;\nuse crate::runtime::is_unconstrained;\n\nmod check_shuffle;\nmod quicksort;\n\nimpl<T, let N: u32> [T; N] {\n /// Returns the length of this array.\n ///\n /// ```noir\n /// fn len(self) -> Field\n /// ```\n ///\n /// example\n ///\n /// ```noir\n /// fn main() {\n /// let array = [42, 42];\n /// assert(array.len() == 2);\n /// }\n /// ```\n #[builtin(array_len)]\n pub fn len(self) -> u32 {}\n\n /// Returns this array as a vector.\n ///\n /// ```noir\n /// let array = [1, 2];\n /// let vector = array.as_vector();\n /// assert_eq(vector, [1, 2].as_vector());\n /// ```\n #[builtin(as_vector)]\n pub fn as_vector(self) -> [T] {}\n\n /// Returns this array as a vector.\n /// This method is deprecated in favor of `as_vector`.\n ///\n /// ```noir\n /// let array = [1, 2];\n /// let vector = array.as_slice();\n /// assert_eq(vector, [1, 2].as_vector());\n /// ```\n #[builtin(as_vector)]\n #[deprecated(\"This method has been renamed to `as_vector`\")]\n pub fn as_slice(self) -> [T] {}\n\n /// Applies a function to each element of this array, returning a new array containing the mapped elements.\n ///\n /// Example:\n ///\n /// ```rust\n /// let a = [1, 2, 3];\n /// let b = a.map(|a| a * 2);\n /// assert_eq(b, [2, 4, 6]);\n /// ```\n pub fn map<U, Env>(self, f: fn[Env](T) -> U) -> [U; N] {\n let uninitialized = crate::mem::zeroed();\n let mut ret = [uninitialized; N];\n\n for i in 0..self.len() {\n ret[i] = f(self[i]);\n }\n\n ret\n }\n\n /// Applies a function to each element of this array along with its index,\n /// returning a new array containing the mapped elements.\n ///\n /// Example:\n ///\n /// ```rust\n /// let a = [1, 2, 3];\n /// let b = a.mapi(|i, a| i + a * 2);\n /// assert_eq(b, [2, 5, 8]);\n /// ```\n pub fn mapi<U, Env>(self, f: fn[Env](u32, T) -> U) -> [U; N] {\n let uninitialized = crate::mem::zeroed();\n let mut ret = [uninitialized; N];\n\n for i in 0..self.len() {\n ret[i] = f(i, self[i]);\n }\n\n ret\n }\n\n /// Applies a function to each element of this array.\n ///\n /// Example:\n ///\n /// ```rust\n /// let a = [1, 2, 3];\n /// let mut b = [0; 3];\n /// let mut i = 0;\n /// a.for_each(|x| {\n /// b[i] = x;\n /// i += 1;\n /// });\n /// assert_eq(a, b);\n /// ```\n pub fn for_each<Env>(self, f: fn[Env](T) -> ()) {\n for i in 0..self.len() {\n f(self[i]);\n }\n }\n\n /// Applies a function to each element of this array along with its index.\n ///\n /// Example:\n ///\n /// ```rust\n /// let a = [1, 2, 3];\n /// let mut b = [0; 3];\n /// a.for_eachi(|i, x| {\n /// b[i] = x;\n /// });\n /// assert_eq(a, b);\n /// ```\n pub fn for_eachi<Env>(self, f: fn[Env](u32, T) -> ()) {\n for i in 0..self.len() {\n f(i, self[i]);\n }\n }\n\n /// Applies a function to each element of the array, returning the final accumulated value. The first\n /// parameter is the initial value.\n ///\n /// This is a left fold, so the given function will be applied to the accumulator and first element of\n /// the array, then the second, and so on. For a given call the expected result would be equivalent to:\n ///\n /// ```rust\n /// let a1 = [1];\n /// let a2 = [1, 2];\n /// let a3 = [1, 2, 3];\n ///\n /// let f = |a, b| a - b;\n /// a1.fold(10, f); //=> f(10, 1)\n /// a2.fold(10, f); //=> f(f(10, 1), 2)\n /// a3.fold(10, f); //=> f(f(f(10, 1), 2), 3)\n ///\n /// assert_eq(a3.fold(10, f), 10 - 1 - 2 - 3);\n /// ```\n pub fn fold<U, Env>(self, mut accumulator: U, f: fn[Env](U, T) -> U) -> U {\n for elem in self {\n accumulator = f(accumulator, elem);\n }\n accumulator\n }\n\n /// Same as fold, but uses the first element as the starting element.\n ///\n /// Requires the input array to be non-empty.\n ///\n /// Example:\n ///\n /// ```noir\n /// fn main() {\n /// let arr = [1, 2, 3, 4];\n /// let reduced = arr.reduce(|a, b| a + b);\n /// assert(reduced == 10);\n /// }\n /// ```\n pub fn reduce<Env>(self, f: fn[Env](T, T) -> T) -> T {\n let mut accumulator = self[0];\n for i in 1..self.len() {\n accumulator = f(accumulator, self[i]);\n }\n accumulator\n }\n\n /// Returns true if all the elements in this array satisfy the given predicate.\n ///\n /// Example:\n ///\n /// ```noir\n /// fn main() {\n /// let arr = [2, 2, 2, 2, 2];\n /// let all = arr.all(|a| a == 2);\n /// assert(all);\n /// }\n /// ```\n pub fn all<Env>(self, predicate: fn[Env](T) -> bool) -> bool {\n let mut ret = true;\n for elem in self {\n ret &= predicate(elem);\n }\n ret\n }\n\n /// Returns true if any of the elements in this array satisfy the given predicate.\n ///\n /// Example:\n ///\n /// ```noir\n /// fn main() {\n /// let arr = [2, 2, 2, 2, 5];\n /// let any = arr.any(|a| a == 5);\n /// assert(any);\n /// }\n /// ```\n pub fn any<Env>(self, predicate: fn[Env](T) -> bool) -> bool {\n let mut ret = false;\n for elem in self {\n ret |= predicate(elem);\n }\n ret\n }\n\n /// Concatenates this array with another array.\n ///\n /// Example:\n ///\n /// ```noir\n /// fn main() {\n /// let arr1 = [1, 2, 3, 4];\n /// let arr2 = [6, 7, 8, 9, 10, 11];\n /// let concatenated_arr = arr1.concat(arr2);\n /// assert(concatenated_arr == [1, 2, 3, 4, 6, 7, 8, 9, 10, 11]);\n /// }\n /// ```\n pub fn concat<let M: u32>(self, array2: [T; M]) -> [T; N + M] {\n let mut result = [crate::mem::zeroed(); N + M];\n for i in 0..N {\n result[i] = self[i];\n }\n for i in 0..M {\n result[i + N] = array2[i];\n }\n result\n }\n}\n\nimpl<T, let N: u32> [T; N]\nwhere\n T: Ord + Eq,\n{\n /// Returns a new sorted array. The original array remains untouched. Notice that this function will\n /// only work for arrays of fields or integers, not for any arbitrary type. This is because the sorting\n /// logic it uses internally is optimized specifically for these values. If you need a sort function to\n /// sort any type, you should use the [`Self::sort_via`] function.\n ///\n /// Example:\n ///\n /// ```rust\n /// fn main() {\n /// let arr = [42, 32];\n /// let sorted = arr.sort();\n /// assert(sorted == [32, 42]);\n /// }\n /// ```\n pub fn sort(self) -> Self {\n self.sort_via(|a, b| a <= b)\n }\n}\n\nimpl<T, let N: u32> [T; N]\nwhere\n T: Eq,\n{\n /// Returns a new sorted array by sorting it with a custom comparison function.\n /// The original array remains untouched.\n /// The ordering function must return true if the first argument should be sorted to be before the second argument or is equal to the second argument.\n ///\n /// Using this method with an operator like `<` that does not return `true` for equal values will result in an assertion failure for arrays with equal elements.\n ///\n /// Example:\n ///\n /// ```rust\n /// fn main() {\n /// let arr = [42, 32]\n /// let sorted_ascending = arr.sort_via(|a, b| a <= b);\n /// assert(sorted_ascending == [32, 42]); // verifies\n ///\n /// let sorted_descending = arr.sort_via(|a, b| a >= b);\n /// assert(sorted_descending == [32, 42]); // does not verify\n /// }\n /// ```\n pub fn sort_via<Env>(self, ordering: fn[Env](T, T) -> bool) -> Self {\n // Safety: `sorted` array is checked to be:\n // a. a permutation of `input`'s elements\n // b. satisfying the predicate `ordering`\n let sorted = unsafe { quicksort::quicksort(self, ordering) };\n\n if !is_unconstrained() {\n for i in 0..N - 1 {\n assert(\n ordering(sorted[i], sorted[i + 1]),\n \"Array has not been sorted correctly according to `ordering`.\",\n );\n }\n check_shuffle::check_shuffle(self, sorted);\n }\n sorted\n }\n}\n\nimpl<let N: u32> [u8; N] {\n /// Converts a byte array of type `[u8; N]` to a string. Note that this performs no UTF-8 validation -\n /// the given array is interpreted as-is as a string.\n ///\n /// Example:\n ///\n /// ```rust\n /// fn main() {\n /// let hi = [104, 105].as_str_unchecked();\n /// assert_eq(hi, \"hi\");\n /// }\n /// ```\n #[builtin(array_as_str_unchecked)]\n pub fn as_str_unchecked(self) -> str<N> {}\n}\n\nimpl<let N: u32> From<str<N>> for [u8; N] {\n /// Returns an array of the string bytes.\n fn from(s: str<N>) -> Self {\n s.as_bytes()\n }\n}\n\nmod test {\n #[test]\n fn map_empty() {\n assert_eq([].map(|x| x + 1), []);\n }\n\n global arr_with_100_values: [u32; 100] = [\n 42, 123, 87, 93, 48, 80, 50, 5, 104, 84, 70, 47, 119, 66, 71, 121, 3, 29, 42, 118, 2, 54,\n 89, 44, 81, 0, 26, 106, 68, 96, 84, 48, 95, 54, 45, 32, 89, 100, 109, 19, 37, 41, 19, 98,\n 53, 114, 107, 66, 6, 74, 13, 19, 105, 64, 123, 28, 44, 50, 89, 58, 123, 126, 21, 43, 86, 35,\n 21, 62, 82, 0, 108, 120, 72, 72, 62, 80, 12, 71, 70, 86, 116, 73, 38, 15, 127, 81, 30, 8,\n 125, 28, 26, 69, 114, 63, 27, 28, 61, 42, 13, 32,\n ];\n global expected_with_100_values: [u32; 100] = [\n 0, 0, 2, 3, 5, 6, 8, 12, 13, 13, 15, 19, 19, 19, 21, 21, 26, 26, 27, 28, 28, 28, 29, 30, 32,\n 32, 35, 37, 38, 41, 42, 42, 42, 43, 44, 44, 45, 47, 48, 48, 50, 50, 53, 54, 54, 58, 61, 62,\n 62, 63, 64, 66, 66, 68, 69, 70, 70, 71, 71, 72, 72, 73, 74, 80, 80, 81, 81, 82, 84, 84, 86,\n 86, 87, 89, 89, 89, 93, 95, 96, 98, 100, 104, 105, 106, 107, 108, 109, 114, 114, 116, 118,\n 119, 120, 121, 123, 123, 123, 125, 126, 127,\n ];\n fn sort_u32(a: u32, b: u32) -> bool {\n a <= b\n }\n\n #[test]\n fn test_sort() {\n let mut arr: [u32; 7] = [3, 6, 8, 10, 1, 2, 1];\n\n let sorted = arr.sort();\n\n let expected: [u32; 7] = [1, 1, 2, 3, 6, 8, 10];\n assert(sorted == expected);\n }\n\n #[test]\n fn test_sort_100_values() {\n let mut arr: [u32; 100] = [\n 42, 123, 87, 93, 48, 80, 50, 5, 104, 84, 70, 47, 119, 66, 71, 121, 3, 29, 42, 118, 2,\n 54, 89, 44, 81, 0, 26, 106, 68, 96, 84, 48, 95, 54, 45, 32, 89, 100, 109, 19, 37, 41,\n 19, 98, 53, 114, 107, 66, 6, 74, 13, 19, 105, 64, 123, 28, 44, 50, 89, 58, 123, 126, 21,\n 43, 86, 35, 21, 62, 82, 0, 108, 120, 72, 72, 62, 80, 12, 71, 70, 86, 116, 73, 38, 15,\n 127, 81, 30, 8, 125, 28, 26, 69, 114, 63, 27, 28, 61, 42, 13, 32,\n ];\n\n let sorted = arr.sort();\n\n let expected: [u32; 100] = [\n 0, 0, 2, 3, 5, 6, 8, 12, 13, 13, 15, 19, 19, 19, 21, 21, 26, 26, 27, 28, 28, 28, 29, 30,\n 32, 32, 35, 37, 38, 41, 42, 42, 42, 43, 44, 44, 45, 47, 48, 48, 50, 50, 53, 54, 54, 58,\n 61, 62, 62, 63, 64, 66, 66, 68, 69, 70, 70, 71, 71, 72, 72, 73, 74, 80, 80, 81, 81, 82,\n 84, 84, 86, 86, 87, 89, 89, 89, 93, 95, 96, 98, 100, 104, 105, 106, 107, 108, 109, 114,\n 114, 116, 118, 119, 120, 121, 123, 123, 123, 125, 126, 127,\n ];\n assert(sorted == expected);\n }\n\n #[test]\n fn test_sort_100_values_comptime() {\n let sorted = arr_with_100_values.sort();\n assert(sorted == expected_with_100_values);\n }\n\n #[test]\n fn test_sort_via() {\n let mut arr: [u32; 7] = [3, 6, 8, 10, 1, 2, 1];\n\n let sorted = arr.sort_via(sort_u32);\n\n let expected: [u32; 7] = [1, 1, 2, 3, 6, 8, 10];\n assert(sorted == expected);\n }\n\n #[test]\n fn test_sort_via_100_values() {\n let mut arr: [u32; 100] = [\n 42, 123, 87, 93, 48, 80, 50, 5, 104, 84, 70, 47, 119, 66, 71, 121, 3, 29, 42, 118, 2,\n 54, 89, 44, 81, 0, 26, 106, 68, 96, 84, 48, 95, 54, 45, 32, 89, 100, 109, 19, 37, 41,\n 19, 98, 53, 114, 107, 66, 6, 74, 13, 19, 105, 64, 123, 28, 44, 50, 89, 58, 123, 126, 21,\n 43, 86, 35, 21, 62, 82, 0, 108, 120, 72, 72, 62, 80, 12, 71, 70, 86, 116, 73, 38, 15,\n 127, 81, 30, 8, 125, 28, 26, 69, 114, 63, 27, 28, 61, 42, 13, 32,\n ];\n\n let sorted = arr.sort_via(sort_u32);\n\n let expected: [u32; 100] = [\n 0, 0, 2, 3, 5, 6, 8, 12, 13, 13, 15, 19, 19, 19, 21, 21, 26, 26, 27, 28, 28, 28, 29, 30,\n 32, 32, 35, 37, 38, 41, 42, 42, 42, 43, 44, 44, 45, 47, 48, 48, 50, 50, 53, 54, 54, 58,\n 61, 62, 62, 63, 64, 66, 66, 68, 69, 70, 70, 71, 71, 72, 72, 73, 74, 80, 80, 81, 81, 82,\n 84, 84, 86, 86, 87, 89, 89, 89, 93, 95, 96, 98, 100, 104, 105, 106, 107, 108, 109, 114,\n 114, 116, 118, 119, 120, 121, 123, 123, 123, 125, 126, 127,\n ];\n assert(sorted == expected);\n }\n\n #[test]\n fn mapi_empty() {\n assert_eq([].mapi(|i, x| i * x + 1), []);\n }\n\n #[test]\n fn for_each_empty() {\n let empty_array: [Field; 0] = [];\n empty_array.for_each(|_x| assert(false));\n }\n\n #[test]\n fn for_eachi_empty() {\n let empty_array: [Field; 0] = [];\n empty_array.for_eachi(|_i, _x| assert(false));\n }\n\n #[test]\n fn map_example() {\n let a = [1, 2, 3];\n let b = a.map(|a| a * 2);\n assert_eq(b, [2, 4, 6]);\n }\n\n #[test]\n fn mapi_example() {\n let a = [1, 2, 3];\n let b = a.mapi(|i, a| i + a * 2);\n assert_eq(b, [2, 5, 8]);\n }\n\n #[test]\n fn for_each_example() {\n let a = [1, 2, 3];\n let mut b = [0, 0, 0];\n let b_ref = &mut b;\n let mut i = 0;\n let i_ref = &mut i;\n a.for_each(|x| {\n b_ref[*i_ref] = x * 2;\n *i_ref += 1;\n });\n assert_eq(b, [2, 4, 6]);\n assert_eq(i, 3);\n }\n\n #[test]\n fn for_eachi_example() {\n let a = [1, 2, 3];\n let mut b = [0, 0, 0];\n let b_ref = &mut b;\n a.for_eachi(|i, a| { b_ref[i] = i + a * 2; });\n assert_eq(b, [2, 5, 8]);\n }\n\n #[test]\n fn concat() {\n let arr1 = [1, 2, 3, 4];\n let arr2 = [6, 7, 8, 9, 10, 11];\n let concatenated_arr = arr1.concat(arr2);\n assert_eq(concatenated_arr, [1, 2, 3, 4, 6, 7, 8, 9, 10, 11]);\n }\n\n #[test]\n fn concat_zero_length_with_something() {\n let arr1 = [];\n let arr2 = [1];\n let concatenated_arr = arr1.concat(arr2);\n assert_eq(concatenated_arr, [1]);\n }\n\n #[test]\n fn concat_something_with_zero_length() {\n let arr1 = [1];\n let arr2 = [];\n let concatenated_arr = arr1.concat(arr2);\n assert_eq(concatenated_arr, [1]);\n }\n\n #[test]\n fn concat_zero_lengths() {\n let arr1: [Field; 0] = [];\n let arr2: [Field; 0] = [];\n let concatenated_arr = arr1.concat(arr2);\n assert_eq(concatenated_arr, []);\n }\n}\n"
|
|
2830
|
+
"source": "use crate::cmp::{Eq, Ord};\nuse crate::convert::From;\nuse crate::runtime::is_unconstrained;\n\nmod check_shuffle;\nmod quicksort;\n\nimpl<T, let N: u32> [T; N] {\n /// Returns the length of this array.\n ///\n /// ```noir\n /// fn len(self) -> Field\n /// ```\n ///\n /// example\n ///\n /// ```noir\n /// fn main() {\n /// let array = [42, 42];\n /// assert(array.len() == 2);\n /// }\n /// ```\n #[builtin(array_len)]\n pub fn len(self) -> u32 {}\n\n /// Returns this array as a vector.\n ///\n /// ```noir\n /// let array = [1, 2];\n /// let vector = array.as_vector();\n /// assert_eq(vector, [1, 2].as_vector());\n /// ```\n #[builtin(as_vector)]\n pub fn as_vector(self) -> [T] {}\n\n /// Returns this array as a vector.\n /// This method is deprecated in favor of `as_vector`.\n ///\n /// ```noir\n /// let array = [1, 2];\n /// let vector = array.as_slice();\n /// assert_eq(vector, [1, 2].as_vector());\n /// ```\n #[builtin(as_vector)]\n #[deprecated(\"This method has been renamed to `as_vector`\")]\n pub fn as_slice(self) -> [T] {}\n\n /// Applies a function to each element of this array, returning a new array containing the mapped elements.\n ///\n /// Example:\n ///\n /// ```rust\n /// let a = [1, 2, 3];\n /// let b = a.map(|a| a * 2);\n /// assert_eq(b, [2, 4, 6]);\n /// ```\n pub fn map<U, Env>(self, f: fn[Env](T) -> U) -> [U; N] {\n let uninitialized = crate::mem::zeroed();\n let mut ret = [uninitialized; N];\n\n for i in 0..self.len() {\n ret[i] = f(self[i]);\n }\n\n ret\n }\n\n /// Applies a function to each element of this array along with its index,\n /// returning a new array containing the mapped elements.\n ///\n /// Example:\n ///\n /// ```rust\n /// let a = [1, 2, 3];\n /// let b = a.mapi(|i, a| i + a * 2);\n /// assert_eq(b, [2, 5, 8]);\n /// ```\n pub fn mapi<U, Env>(self, f: fn[Env](u32, T) -> U) -> [U; N] {\n let uninitialized = crate::mem::zeroed();\n let mut ret = [uninitialized; N];\n\n for i in 0..self.len() {\n ret[i] = f(i, self[i]);\n }\n\n ret\n }\n\n /// Applies a function to each element of this array.\n ///\n /// Example:\n ///\n /// ```rust\n /// let a = [1, 2, 3];\n /// let mut b = [0; 3];\n /// let mut i = 0;\n /// a.for_each(|x| {\n /// b[i] = x;\n /// i += 1;\n /// });\n /// assert_eq(a, b);\n /// ```\n pub fn for_each<Env>(self, f: fn[Env](T) -> ()) {\n for i in 0..self.len() {\n f(self[i]);\n }\n }\n\n /// Applies a function to each element of this array along with its index.\n ///\n /// Example:\n ///\n /// ```rust\n /// let a = [1, 2, 3];\n /// let mut b = [0; 3];\n /// a.for_eachi(|i, x| {\n /// b[i] = x;\n /// });\n /// assert_eq(a, b);\n /// ```\n pub fn for_eachi<Env>(self, f: fn[Env](u32, T) -> ()) {\n for i in 0..self.len() {\n f(i, self[i]);\n }\n }\n\n /// Applies a function to each element of the array, returning the final accumulated value. The first\n /// parameter is the initial value.\n ///\n /// This is a left fold, so the given function will be applied to the accumulator and first element of\n /// the array, then the second, and so on. For a given call the expected result would be equivalent to:\n ///\n /// ```rust\n /// let a1 = [1];\n /// let a2 = [1, 2];\n /// let a3 = [1, 2, 3];\n ///\n /// let f = |a, b| a - b;\n /// a1.fold(10, f); //=> f(10, 1)\n /// a2.fold(10, f); //=> f(f(10, 1), 2)\n /// a3.fold(10, f); //=> f(f(f(10, 1), 2), 3)\n ///\n /// assert_eq(a3.fold(10, f), 10 - 1 - 2 - 3);\n /// ```\n pub fn fold<U, Env>(self, mut accumulator: U, f: fn[Env](U, T) -> U) -> U {\n for elem in self {\n accumulator = f(accumulator, elem);\n }\n accumulator\n }\n\n /// Same as fold, but uses the first element as the starting element.\n ///\n /// Requires the input array to be non-empty.\n ///\n /// Example:\n ///\n /// ```noir\n /// fn main() {\n /// let arr = [1, 2, 3, 4];\n /// let reduced = arr.reduce(|a, b| a + b);\n /// assert(reduced == 10);\n /// }\n /// ```\n pub fn reduce<Env>(self, f: fn[Env](T, T) -> T) -> T {\n let mut accumulator = self[0];\n for i in 1..self.len() {\n accumulator = f(accumulator, self[i]);\n }\n accumulator\n }\n\n /// Returns true if all the elements in this array satisfy the given predicate.\n ///\n /// Example:\n ///\n /// ```noir\n /// fn main() {\n /// let arr = [2, 2, 2, 2, 2];\n /// let all = arr.all(|a| a == 2);\n /// assert(all);\n /// }\n /// ```\n pub fn all<Env>(self, predicate: fn[Env](T) -> bool) -> bool {\n let mut ret = true;\n for elem in self {\n ret &= predicate(elem);\n }\n ret\n }\n\n /// Returns true if any of the elements in this array satisfy the given predicate.\n ///\n /// Example:\n ///\n /// ```noir\n /// fn main() {\n /// let arr = [2, 2, 2, 2, 5];\n /// let any = arr.any(|a| a == 5);\n /// assert(any);\n /// }\n /// ```\n pub fn any<Env>(self, predicate: fn[Env](T) -> bool) -> bool {\n let mut ret = false;\n for elem in self {\n ret |= predicate(elem);\n }\n ret\n }\n\n /// Concatenates this array with another array.\n ///\n /// Example:\n ///\n /// ```noir\n /// fn main() {\n /// let arr1 = [1, 2, 3, 4];\n /// let arr2 = [6, 7, 8, 9, 10, 11];\n /// let concatenated_arr = arr1.concat(arr2);\n /// assert(concatenated_arr == [1, 2, 3, 4, 6, 7, 8, 9, 10, 11]);\n /// }\n /// ```\n pub fn concat<let M: u32>(self, array2: [T; M]) -> [T; N + M] {\n let mut result = [crate::mem::zeroed(); N + M];\n for i in 0..N {\n result[i] = self[i];\n }\n for i in 0..M {\n result[i + N] = array2[i];\n }\n result\n }\n}\n\nimpl<T, let N: u32> [T; N]\nwhere\n T: Ord + Eq,\n{\n /// Returns a new sorted array. The original array remains untouched. Notice that this function will\n /// only work for arrays of fields or integers, not for any arbitrary type. This is because the sorting\n /// logic it uses internally is optimized specifically for these values. If you need a sort function to\n /// sort any type, you should use the [`Self::sort_via`] function.\n ///\n /// Example:\n ///\n /// ```rust\n /// fn main() {\n /// let arr = [42, 32];\n /// let sorted = arr.sort();\n /// assert(sorted == [32, 42]);\n /// }\n /// ```\n pub fn sort(self) -> Self {\n self.sort_via(|a, b| a <= b)\n }\n}\n\nimpl<T, let N: u32> [T; N]\nwhere\n T: Eq,\n{\n /// Returns a new sorted array by sorting it with a custom comparison function.\n /// The original array remains untouched.\n /// The ordering function must return true if the first argument should be sorted to be before the second argument or is equal to the second argument.\n ///\n /// Using this method with an operator like `<` that does not return `true` for equal values will result in an assertion failure for arrays with equal elements.\n ///\n /// Example:\n ///\n /// ```rust\n /// fn main() {\n /// let arr = [42, 32]\n /// let sorted_ascending = arr.sort_via(|a, b| a <= b);\n /// assert(sorted_ascending == [32, 42]); // verifies\n ///\n /// let sorted_descending = arr.sort_via(|a, b| a >= b);\n /// assert(sorted_descending == [32, 42]); // does not verify\n /// }\n /// ```\n pub fn sort_via<Env>(self, ordering: fn[Env](T, T) -> bool) -> Self {\n // Safety: `sorted` array is checked to be:\n // a. a permutation of `input`'s elements\n // b. satisfying the predicate `ordering`\n let sorted = unsafe { quicksort::quicksort(self, ordering) };\n\n if !is_unconstrained() {\n for i in 0..N - 1 {\n assert(\n ordering(sorted[i], sorted[i + 1]),\n \"Array has not been sorted correctly according to `ordering`.\",\n );\n }\n check_shuffle::check_shuffle(self, sorted);\n }\n sorted\n }\n}\n\nimpl<let N: u32> [u8; N] {\n /// Converts a byte array of type `[u8; N]` to a string. Note that this performs no UTF-8 validation -\n /// the given array is interpreted as-is as a string.\n ///\n /// Example:\n ///\n /// ```rust\n /// fn main() {\n /// let hi = [104, 105].as_str_unchecked();\n /// assert_eq(hi, \"hi\");\n /// }\n /// ```\n #[builtin(array_as_str_unchecked)]\n pub fn as_str_unchecked(self) -> str<N> {}\n}\n\nimpl<let N: u32> From<str<N>> for [u8; N] {\n /// Returns an array of the string bytes.\n fn from(s: str<N>) -> Self {\n s.as_bytes()\n }\n}\n\nmod test {\n #[test]\n fn map_empty() {\n assert_eq([].map(|x| x + 1), []);\n }\n\n global arr_with_100_values: [u32; 100] = [\n 42, 123, 87, 93, 48, 80, 50, 5, 104, 84, 70, 47, 119, 66, 71, 121, 3, 29, 42, 118, 2, 54,\n 89, 44, 81, 0, 26, 106, 68, 96, 84, 48, 95, 54, 45, 32, 89, 100, 109, 19, 37, 41, 19, 98,\n 53, 114, 107, 66, 6, 74, 13, 19, 105, 64, 123, 28, 44, 50, 89, 58, 123, 126, 21, 43, 86, 35,\n 21, 62, 82, 0, 108, 120, 72, 72, 62, 80, 12, 71, 70, 86, 116, 73, 38, 15, 127, 81, 30, 8,\n 125, 28, 26, 69, 114, 63, 27, 28, 61, 42, 13, 32,\n ];\n global expected_with_100_values: [u32; 100] = [\n 0, 0, 2, 3, 5, 6, 8, 12, 13, 13, 15, 19, 19, 19, 21, 21, 26, 26, 27, 28, 28, 28, 29, 30, 32,\n 32, 35, 37, 38, 41, 42, 42, 42, 43, 44, 44, 45, 47, 48, 48, 50, 50, 53, 54, 54, 58, 61, 62,\n 62, 63, 64, 66, 66, 68, 69, 70, 70, 71, 71, 72, 72, 73, 74, 80, 80, 81, 81, 82, 84, 84, 86,\n 86, 87, 89, 89, 89, 93, 95, 96, 98, 100, 104, 105, 106, 107, 108, 109, 114, 114, 116, 118,\n 119, 120, 121, 123, 123, 123, 125, 126, 127,\n ];\n fn sort_u32(a: u32, b: u32) -> bool {\n a <= b\n }\n\n #[test]\n fn test_sort() {\n let arr: [u32; 7] = [3, 6, 8, 10, 1, 2, 1];\n\n let sorted = arr.sort();\n\n let expected: [u32; 7] = [1, 1, 2, 3, 6, 8, 10];\n assert(sorted == expected);\n }\n\n #[test]\n fn test_sort_100_values() {\n let arr: [u32; 100] = [\n 42, 123, 87, 93, 48, 80, 50, 5, 104, 84, 70, 47, 119, 66, 71, 121, 3, 29, 42, 118, 2,\n 54, 89, 44, 81, 0, 26, 106, 68, 96, 84, 48, 95, 54, 45, 32, 89, 100, 109, 19, 37, 41,\n 19, 98, 53, 114, 107, 66, 6, 74, 13, 19, 105, 64, 123, 28, 44, 50, 89, 58, 123, 126, 21,\n 43, 86, 35, 21, 62, 82, 0, 108, 120, 72, 72, 62, 80, 12, 71, 70, 86, 116, 73, 38, 15,\n 127, 81, 30, 8, 125, 28, 26, 69, 114, 63, 27, 28, 61, 42, 13, 32,\n ];\n\n let sorted = arr.sort();\n\n let expected: [u32; 100] = [\n 0, 0, 2, 3, 5, 6, 8, 12, 13, 13, 15, 19, 19, 19, 21, 21, 26, 26, 27, 28, 28, 28, 29, 30,\n 32, 32, 35, 37, 38, 41, 42, 42, 42, 43, 44, 44, 45, 47, 48, 48, 50, 50, 53, 54, 54, 58,\n 61, 62, 62, 63, 64, 66, 66, 68, 69, 70, 70, 71, 71, 72, 72, 73, 74, 80, 80, 81, 81, 82,\n 84, 84, 86, 86, 87, 89, 89, 89, 93, 95, 96, 98, 100, 104, 105, 106, 107, 108, 109, 114,\n 114, 116, 118, 119, 120, 121, 123, 123, 123, 125, 126, 127,\n ];\n assert(sorted == expected);\n }\n\n #[test]\n fn test_sort_100_values_comptime() {\n let sorted = arr_with_100_values.sort();\n assert(sorted == expected_with_100_values);\n }\n\n #[test]\n fn test_sort_via() {\n let arr: [u32; 7] = [3, 6, 8, 10, 1, 2, 1];\n\n let sorted = arr.sort_via(sort_u32);\n\n let expected: [u32; 7] = [1, 1, 2, 3, 6, 8, 10];\n assert(sorted == expected);\n }\n\n #[test]\n fn test_sort_via_100_values() {\n let arr: [u32; 100] = [\n 42, 123, 87, 93, 48, 80, 50, 5, 104, 84, 70, 47, 119, 66, 71, 121, 3, 29, 42, 118, 2,\n 54, 89, 44, 81, 0, 26, 106, 68, 96, 84, 48, 95, 54, 45, 32, 89, 100, 109, 19, 37, 41,\n 19, 98, 53, 114, 107, 66, 6, 74, 13, 19, 105, 64, 123, 28, 44, 50, 89, 58, 123, 126, 21,\n 43, 86, 35, 21, 62, 82, 0, 108, 120, 72, 72, 62, 80, 12, 71, 70, 86, 116, 73, 38, 15,\n 127, 81, 30, 8, 125, 28, 26, 69, 114, 63, 27, 28, 61, 42, 13, 32,\n ];\n\n let sorted = arr.sort_via(sort_u32);\n\n let expected: [u32; 100] = [\n 0, 0, 2, 3, 5, 6, 8, 12, 13, 13, 15, 19, 19, 19, 21, 21, 26, 26, 27, 28, 28, 28, 29, 30,\n 32, 32, 35, 37, 38, 41, 42, 42, 42, 43, 44, 44, 45, 47, 48, 48, 50, 50, 53, 54, 54, 58,\n 61, 62, 62, 63, 64, 66, 66, 68, 69, 70, 70, 71, 71, 72, 72, 73, 74, 80, 80, 81, 81, 82,\n 84, 84, 86, 86, 87, 89, 89, 89, 93, 95, 96, 98, 100, 104, 105, 106, 107, 108, 109, 114,\n 114, 116, 118, 119, 120, 121, 123, 123, 123, 125, 126, 127,\n ];\n assert(sorted == expected);\n }\n\n #[test]\n fn mapi_empty() {\n assert_eq([].mapi(|i, x| i * x + 1), []);\n }\n\n #[test]\n fn for_each_empty() {\n let empty_array: [Field; 0] = [];\n empty_array.for_each(|_x| assert(false));\n }\n\n #[test]\n fn for_eachi_empty() {\n let empty_array: [Field; 0] = [];\n empty_array.for_eachi(|_i, _x| assert(false));\n }\n\n #[test]\n fn map_example() {\n let a = [1, 2, 3];\n let b = a.map(|a| a * 2);\n assert_eq(b, [2, 4, 6]);\n }\n\n #[test]\n fn mapi_example() {\n let a = [1, 2, 3];\n let b = a.mapi(|i, a| i + a * 2);\n assert_eq(b, [2, 5, 8]);\n }\n\n #[test]\n fn for_each_example() {\n let a = [1, 2, 3];\n let mut b = [0, 0, 0];\n let b_ref = &mut b;\n let mut i = 0;\n let i_ref = &mut i;\n a.for_each(|x| {\n b_ref[*i_ref] = x * 2;\n *i_ref += 1;\n });\n assert_eq(b, [2, 4, 6]);\n assert_eq(i, 3);\n }\n\n #[test]\n fn for_eachi_example() {\n let a = [1, 2, 3];\n let mut b = [0, 0, 0];\n let b_ref = &mut b;\n a.for_eachi(|i, a| { b_ref[i] = i + a * 2; });\n assert_eq(b, [2, 5, 8]);\n }\n\n #[test]\n fn concat() {\n let arr1 = [1, 2, 3, 4];\n let arr2 = [6, 7, 8, 9, 10, 11];\n let concatenated_arr = arr1.concat(arr2);\n assert_eq(concatenated_arr, [1, 2, 3, 4, 6, 7, 8, 9, 10, 11]);\n }\n\n #[test]\n fn concat_zero_length_with_something() {\n let arr1 = [];\n let arr2 = [1];\n let concatenated_arr = arr1.concat(arr2);\n assert_eq(concatenated_arr, [1]);\n }\n\n #[test]\n fn concat_something_with_zero_length() {\n let arr1 = [1];\n let arr2 = [];\n let concatenated_arr = arr1.concat(arr2);\n assert_eq(concatenated_arr, [1]);\n }\n\n #[test]\n fn concat_zero_lengths() {\n let arr1: [Field; 0] = [];\n let arr2: [Field; 0] = [];\n let concatenated_arr = arr1.concat(arr2);\n assert_eq(concatenated_arr, []);\n }\n}\n"
|
|
3522
2831
|
},
|
|
3523
|
-
"
|
|
2832
|
+
"300": {
|
|
2833
|
+
"path": "/home/aztec-dev/nargo/github.com/noir-lang/poseidon/v0.2.6/src/poseidon2.nr",
|
|
2834
|
+
"source": "use std::default::Default;\nuse std::hash::Hasher;\n\nglobal RATE: u32 = 3;\n\npub struct Poseidon2 {\n cache: [Field; 3],\n state: [Field; 4],\n cache_size: u32,\n squeeze_mode: bool, // 0 => absorb, 1 => squeeze\n}\n\nimpl Poseidon2 {\n #[no_predicates]\n pub fn hash<let N: u32>(input: [Field; N], message_size: u32) -> Field {\n Poseidon2::hash_internal(input, message_size)\n }\n\n pub(crate) fn new(iv: Field) -> Poseidon2 {\n let mut result =\n Poseidon2 { cache: [0; 3], state: [0; 4], cache_size: 0, squeeze_mode: false };\n result.state[RATE] = iv;\n result\n }\n\n fn perform_duplex(&mut self) {\n // add the cache into sponge state\n self.state[0] += self.cache[0];\n self.state[1] += self.cache[1];\n self.state[2] += self.cache[2];\n self.state = crate::poseidon2_permutation(self.state, 4);\n }\n\n fn absorb(&mut self, input: Field) {\n assert(!self.squeeze_mode);\n if self.cache_size == RATE {\n // If we're absorbing, and the cache is full, apply the sponge permutation to compress the cache\n self.perform_duplex();\n self.cache[0] = input;\n self.cache_size = 1;\n } else {\n // If we're absorbing, and the cache is not full, add the input into the cache\n self.cache[self.cache_size] = input;\n self.cache_size += 1;\n }\n }\n\n fn squeeze(&mut self) -> Field {\n assert(!self.squeeze_mode);\n // If we're in absorb mode, apply sponge permutation to compress the cache.\n self.perform_duplex();\n self.squeeze_mode = true;\n\n // Pop one item off the top of the permutation and return it.\n self.state[0]\n }\n\n fn hash_internal<let N: u32>(input: [Field; N], in_len: u32) -> Field {\n let two_pow_64 = 18446744073709551616;\n let iv: Field = (in_len as Field) * two_pow_64;\n let mut state = [0; 4];\n state[RATE] = iv;\n\n if std::runtime::is_unconstrained() {\n for i in 0..(in_len / RATE) {\n state[0] += input[i * RATE];\n state[1] += input[i * RATE + 1];\n state[2] += input[i * RATE + 2];\n state = crate::poseidon2_permutation(state, 4);\n }\n\n // handle remaining elements after last full RATE-sized chunk\n let num_extra_fields = in_len % RATE;\n if num_extra_fields != 0 {\n let remainder_start = in_len - num_extra_fields;\n state[0] += input[remainder_start];\n if num_extra_fields > 1 {\n state[1] += input[remainder_start + 1];\n }\n }\n } else {\n let mut states: [[Field; 4]; N / RATE + 1] = [[0; 4]; N / RATE + 1];\n states[0] = state;\n\n // process all full RATE-sized chunks, storing state after each permutation\n for chunk_idx in 0..(N / RATE) {\n for i in 0..RATE {\n state[i] += input[chunk_idx * RATE + i];\n }\n state = crate::poseidon2_permutation(state, 4);\n states[chunk_idx + 1] = state;\n }\n\n // get state at the last full block before in_len\n let first_partially_filled_chunk = in_len / RATE;\n state = states[first_partially_filled_chunk];\n\n // handle remaining elements after last full RATE-sized chunk\n let remainder_start = (in_len / RATE) * RATE;\n for j in 0..RATE {\n let idx = remainder_start + j;\n if idx < in_len {\n state[j] += input[idx];\n }\n }\n }\n\n // always run final permutation unless we just completed a full chunk\n // still need to permute once if in_len is 0\n if (in_len == 0) | (in_len % RATE != 0) {\n state = crate::poseidon2_permutation(state, 4);\n };\n\n state[0]\n }\n}\n\npub struct Poseidon2Hasher {\n _state: [Field],\n}\n\nimpl Hasher for Poseidon2Hasher {\n fn finish(self) -> Field {\n let iv: Field = (self._state.len() as Field) * 18446744073709551616; // iv = (self._state.len() << 64)\n let mut sponge = Poseidon2::new(iv);\n for i in 0..self._state.len() {\n sponge.absorb(self._state[i]);\n }\n sponge.squeeze()\n }\n\n fn write(&mut self, input: Field) {\n self._state = self._state.push_back(input);\n }\n}\n\nimpl Default for Poseidon2Hasher {\n fn default() -> Self {\n Poseidon2Hasher { _state: &[] }\n }\n}\n"
|
|
2835
|
+
},
|
|
2836
|
+
"358": {
|
|
3524
2837
|
"path": "/home/aztec-dev/aztec-packages/noir-projects/noir-protocol-circuits/crates/types/src/address/aztec_address.nr",
|
|
3525
|
-
"source": "use crate::{\n address::{\n partial_address::PartialAddress, salted_initialization_hash::SaltedInitializationHash,\n },\n constants::{AZTEC_ADDRESS_LENGTH, DOM_SEP__CONTRACT_ADDRESS_V1, MAX_FIELD_VALUE},\n contract_class_id::ContractClassId,\n hash::poseidon2_hash_with_separator,\n public_keys::{IvpkM, NpkM, OvpkM, PublicKeys, ToPoint, TpkM},\n traits::{Deserialize, Empty, FromField, Packable, Serialize, ToField},\n utils::field::sqrt,\n};\n\n// We do below because `use crate::point::Point;` does not work\nuse dep::std::embedded_curve_ops::EmbeddedCurvePoint as Point;\n\nuse crate::public_keys::AddressPoint;\nuse std::{\n embedded_curve_ops::{EmbeddedCurveScalar, fixed_base_scalar_mul as derive_public_key},\n ops::Add,\n};\nuse std::meta::derive;\n\n// Aztec address\n#[derive(Deserialize, Eq, Packable, Serialize)]\npub struct AztecAddress {\n pub inner: Field,\n}\n\nimpl Empty for AztecAddress {\n fn empty() -> Self {\n Self { inner: 0 }\n }\n}\n\nimpl ToField for AztecAddress {\n fn to_field(self) -> Field {\n self.inner\n }\n}\n\nimpl FromField for AztecAddress {\n fn from_field(value: Field) -> AztecAddress {\n AztecAddress { inner: value }\n }\n}\n\nimpl AztecAddress {\n pub fn zero() -> Self {\n Self { inner: 0 }\n }\n\n /// Returns an address's `AddressPoint`, which can be used to create shared secrets with the owner\n /// of the address. If the address is invalid (i.e. it is not a properly derived Aztec address), then this\n /// returns `Option::none()`, and no shared secrets can be created.\n pub fn to_address_point(self) -> Option<AddressPoint> {\n // We compute the address point by taking our address as x, and then solving for y in the\n // equation which defines the grumpkin curve:\n // y^2 = x^3 - 17; x = address\n let x = self.inner;\n let y_squared = x * x * x - 17;\n\n // An invalid AztecAddress is one for which no y coordinate satisfies the curve equation, which we'll\n // identify by proving that the square root of y_squared does not exist.\n sqrt(y_squared).map(|y| {\n // If we get a negative y coordinate (y > (r - 1) / 2), we swap it to the\n // positive one (where y <= (r - 1) / 2) by negating it.\n let final_y = if Self::is_positive(y) { y } else { -y };\n\n AddressPoint { inner: Point { x: self.inner, y: final_y, is_infinite: false } }\n })\n }\n\n /// Determines whether a y-coordinate is in the lower (positive) or upper (negative) \"half\" of the field.\n /// I.e.\n /// y <= (r - 1)/2 => positive.\n /// y > (r - 1)/2 => negative.\n /// An AddressPoint always uses the \"positive\" y.\n fn is_positive(y: Field) -> bool {\n // Note: The field modulus r is MAX_FIELD_VALUE + 1.\n let MID = MAX_FIELD_VALUE / 2; // (r - 1) / 2\n let MID_PLUS_1 = MID + 1; // (r - 1)/2 + 1\n // Note: y <= m implies y < m + 1.\n y.lt(MID_PLUS_1)\n }\n\n pub fn compute(public_keys: PublicKeys, partial_address: PartialAddress) -> AztecAddress {\n //\n // address = address_point.x\n // |\n // address_point = pre_address * G + Ivpk_m (always choose \"positive\" y-coord)\n // | ^\n // | |.....................\n // pre_address .\n // / \\ .\n // / \\ .\n // partial_address public_keys_hash .\n // / \\ / / \\ \\ .\n // / \\ Npk_m Ivpk_m Ovpk_m Tpk_m .\n // contract_class_id \\ |...................\n // / | \\ \\\n // artifact_hash | public_bytecode_commitment salted_initialization_hash\n // | / / \\\n // private_function_tree_root deployer_address salt initialization_hash\n // / \\ / \\\n // ... ... constructor_fn_selector constructor_args_hash\n // / \\\n // / \\ / \\\n // leaf leaf leaf leaf\n // ^\n // |\n // |---h(function_selector, vk_hash)\n // ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^\n // Each of these represents a private function of the contract.\n\n let public_keys_hash = public_keys.hash();\n\n let pre_address = poseidon2_hash_with_separator(\n [public_keys_hash.to_field(), partial_address.to_field()],\n DOM_SEP__CONTRACT_ADDRESS_V1,\n );\n\n // Note: `.add()` will fail within the blackbox fn if either of the points are not on the curve. (See tests below).\n let address_point = derive_public_key(EmbeddedCurveScalar::from_field(pre_address)).add(\n public_keys.ivpk_m.to_point(),\n );\n\n // Note that our address is only the x-coordinate of the full address_point. This is okay because when people want to encrypt something and send it to us\n // they can recover our full point using the x-coordinate (our address itself). To do this, they recompute the y-coordinate according to the equation y^2 = x^3 - 17.\n // When they do this, they may get a positive y-coordinate (a value that is less than or equal to MAX_FIELD_VALUE / 2) or\n // a negative y-coordinate (a value that is more than MAX_FIELD_VALUE), and we cannot dictate which one they get and hence the recovered point may sometimes be different than the one\n // our secret can decrypt. Regardless though, they should and will always encrypt using point with the positive y-coordinate by convention.\n // This ensures that everyone encrypts to the same point given an arbitrary x-coordinate (address). This is allowed because even though our original point may not have a positive y-coordinate,\n // with our original secret, we will be able to derive the secret to the point with the flipped (and now positive) y-coordinate that everyone encrypts to.\n AztecAddress::from_field(address_point.x)\n }\n\n pub fn compute_from_class_id(\n contract_class_id: ContractClassId,\n salted_initialization_hash: SaltedInitializationHash,\n public_keys: PublicKeys,\n ) -> Self {\n let partial_address = PartialAddress::compute_from_salted_initialization_hash(\n contract_class_id,\n salted_initialization_hash,\n );\n\n AztecAddress::compute(public_keys, partial_address)\n }\n\n pub fn is_zero(self) -> bool {\n self.inner == 0\n }\n\n pub fn assert_is_zero(self) {\n assert(self.to_field() == 0);\n }\n}\n\n#[test]\nfn check_max_field_value() {\n // Check that it is indeed r-1.\n assert_eq(MAX_FIELD_VALUE + 1, 0);\n}\n\n#[test]\nfn check_is_positive() {\n assert(AztecAddress::is_positive(0));\n assert(AztecAddress::is_positive(1));\n assert(!AztecAddress::is_positive(-1));\n assert(AztecAddress::is_positive(MAX_FIELD_VALUE / 2));\n assert(!AztecAddress::is_positive((MAX_FIELD_VALUE / 2) + 1));\n}\n\n// Gives us confidence that we don't need to manually check that the input public keys need to be on the curve for `add`,\n// because the blackbox function does this check for us.\n#[test(should_fail_with = \"is not on curve\")]\nfn check_embedded_curve_point_add() {\n // Choose a point not on the curve:\n let p1 = Point { x: 1, y: 1, is_infinite: false };\n let p2 = Point::generator();\n let _ = p1 + p2;\n}\n\n// Gives us confidence that we don't need to manually check that the input public keys need to be on the curve for `add`,\n// because the blackbox function does this check for us.\n#[test(should_fail_with = \"is not on curve\")]\nfn check_embedded_curve_point_add_2() {\n // Choose a point not on the curve in the 2nd position.\n let p1 = Point::generator();\n let p2 = Point { x: 1, y: 1, is_infinite: false };\n let _ = p1 + p2;\n}\n\n#[test]\nfn compute_address_from_partial_and_pub_keys() {\n let public_keys = PublicKeys {\n npk_m: NpkM {\n inner: Point {\n x: 0x22f7fcddfa3ce3e8f0cc8e82d7b94cdd740afa3e77f8e4a63ea78a239432dcab,\n y: 0x0471657de2b6216ade6c506d28fbc22ba8b8ed95c871ad9f3e3984e90d9723a7,\n is_infinite: false,\n },\n },\n ivpk_m: IvpkM {\n inner: Point {\n x: 0x111223493147f6785514b1c195bb37a2589f22a6596d30bb2bb145fdc9ca8f1e,\n y: 0x273bbffd678edce8fe30e0deafc4f66d58357c06fd4a820285294b9746c3be95,\n is_infinite: false,\n },\n },\n ovpk_m: OvpkM {\n inner: Point {\n x: 0x09115c96e962322ffed6522f57194627136b8d03ac7469109707f5e44190c484,\n y: 0x0c49773308a13d740a7f0d4f0e6163b02c5a408b6f965856b6a491002d073d5b,\n is_infinite: false,\n },\n },\n tpk_m: TpkM {\n inner: Point {\n x: 0x00d3d81beb009873eb7116327cf47c612d5758ef083d4fda78e9b63980b2a762,\n y: 0x2f567d22d2b02fe1f4ad42db9d58a36afd1983e7e2909d1cab61cafedad6193a,\n is_infinite: false,\n },\n },\n };\n\n let partial_address = PartialAddress::from_field(\n 0x0a7c585381b10f4666044266a02405bf6e01fa564c8517d4ad5823493abd31de,\n );\n\n let address = AztecAddress::compute(public_keys, partial_address);\n\n // The following value was generated by `derivation.test.ts`.\n // --> Run the test with AZTEC_GENERATE_TEST_DATA=1 flag to update test data.\n let expected_computed_address_from_partial_and_pubkeys =\n 0x24e4646f58b9fbe7d38e317db8d5636c423fbbdfbe119fc190fe9c64747e0c62;\n assert(address.to_field() == expected_computed_address_from_partial_and_pubkeys);\n}\n\n#[test]\nfn compute_preaddress_from_partial_and_pub_keys() {\n let pre_address = poseidon2_hash_with_separator([1, 2], DOM_SEP__CONTRACT_ADDRESS_V1);\n let expected_computed_preaddress_from_partial_and_pubkey =\n 0x23ce9be3fa3c846b0f9245cc796902e731d04f086e8a42473bb29e405fc98075;\n assert(pre_address == expected_computed_preaddress_from_partial_and_pubkey);\n}\n\n#[test]\nfn from_field_to_field() {\n let address = AztecAddress { inner: 37 };\n assert_eq(FromField::from_field(address.to_field()), address);\n}\n\n#[test]\nfn serde() {\n let address = AztecAddress { inner: 37 };\n // We use the AZTEC_ADDRESS_LENGTH constant to ensure that there is a match between the derived trait\n // implementation and the constant.\n let serialized: [Field; AZTEC_ADDRESS_LENGTH] = address.serialize();\n let deserialized = AztecAddress::deserialize(serialized);\n assert_eq(address, deserialized);\n}\n\n#[test]\nfn to_address_point_valid() {\n // x = 8 where x^3 - 17 = 512 - 17 = 495, which is a residue in this field\n let address = AztecAddress { inner: 8 };\n let maybe_point = address.to_address_point();\n assert(maybe_point.is_some());\n\n let point = maybe_point.unwrap().inner;\n // check that x is preserved\n assert_eq(point.x, Field::from(8));\n\n // check that the curve equation holds: y^2 == x^3 - 17\n assert_eq(point.y * point.y, point.x * point.x * point.x - 17);\n}\n\n#[test]\nunconstrained fn to_address_point_invalid() {\n // x = 3 where x^3 - 17 = 27 - 17 = 10, which is a non-residue in this field\n let address = AztecAddress { inner: 3 }; //\n let maybe_point = address.to_address_point();\n assert(maybe_point.is_none());\n}\n"
|
|
2838
|
+
"source": "use crate::{\n address::{\n partial_address::PartialAddress, salted_initialization_hash::SaltedInitializationHash,\n },\n constants::{AZTEC_ADDRESS_LENGTH, DOM_SEP__CONTRACT_ADDRESS_V1, MAX_FIELD_VALUE},\n contract_class_id::ContractClassId,\n hash::poseidon2_hash_with_separator,\n public_keys::{IvpkM, NpkM, OvpkM, PublicKeys, ToPoint, TpkM},\n traits::{Deserialize, Empty, FromField, Packable, Serialize, ToField},\n utils::field::sqrt,\n};\n\n// We do below because `use crate::point::Point;` does not work\nuse std::embedded_curve_ops::EmbeddedCurvePoint as Point;\n\nuse crate::public_keys::AddressPoint;\nuse std::{\n embedded_curve_ops::{EmbeddedCurveScalar, fixed_base_scalar_mul as derive_public_key},\n ops::Add,\n};\nuse std::meta::derive;\n\n// Aztec address\n#[derive(Deserialize, Eq, Packable, Serialize)]\npub struct AztecAddress {\n pub inner: Field,\n}\n\nimpl Empty for AztecAddress {\n fn empty() -> Self {\n Self { inner: 0 }\n }\n}\n\nimpl ToField for AztecAddress {\n fn to_field(self) -> Field {\n self.inner\n }\n}\n\nimpl FromField for AztecAddress {\n fn from_field(value: Field) -> AztecAddress {\n AztecAddress { inner: value }\n }\n}\n\nimpl AztecAddress {\n pub fn zero() -> Self {\n Self { inner: 0 }\n }\n\n /// Returns `true` if the address is valid.\n ///\n /// An invalid address is one that can be proven to not be correctly derived, meaning it contains no contract code,\n /// public keys, etc., and can therefore not receive messages nor execute calls.\n pub fn is_valid(self) -> bool {\n self.get_y().is_some()\n }\n\n /// Returns an address's [`AddressPoint`].\n ///\n /// This can be used to create shared secrets with the owner of the address. If the address is invalid (see\n /// [`AztecAddress::is_valid`]) then this returns `Option::none()`, and no shared secrets can be created.\n pub fn to_address_point(self) -> Option<AddressPoint> {\n self.get_y().map(|y| {\n // If we get a negative y coordinate (y > (r - 1) / 2), we swap it to the\n // positive one (where y <= (r - 1) / 2) by negating it.\n let final_y = if Self::is_positive(y) { y } else { -y };\n\n AddressPoint { inner: Point { x: self.inner, y: final_y, is_infinite: false } }\n })\n }\n\n /// Determines whether a y-coordinate is in the lower (positive) or upper (negative) \"half\" of the field.\n /// I.e.\n /// y <= (r - 1)/2 => positive.\n /// y > (r - 1)/2 => negative.\n /// An AddressPoint always uses the \"positive\" y.\n fn is_positive(y: Field) -> bool {\n // Note: The field modulus r is MAX_FIELD_VALUE + 1.\n let MID = MAX_FIELD_VALUE / 2; // (r - 1) / 2\n let MID_PLUS_1 = MID + 1; // (r - 1)/2 + 1\n // Note: y <= m implies y < m + 1.\n y.lt(MID_PLUS_1)\n }\n\n /// Returns one of the two possible y-coordinates.\n ///\n /// Not all `AztecAddresses` are valid, in which case there is no corresponding y-coordinate. This returns\n /// `Option::none()` for invalid addresses.\n ///\n /// An `AztecAddress` is defined by an x-coordinate, for which two y-coordinates exist as solutions to the curve\n /// equation. This function returns either of them. Note that an [`AddressPoint`] must **always** have a positive\n /// y-coordinate - if trying to obtain the underlying point use [`AztecAddress::to_address_point`] instead.\n fn get_y(self) -> Option<Field> {\n // We compute the address point by taking our address as x, and then solving for y in the\n // equation which defines the grumpkin curve:\n // y^2 = x^3 - 17; x = address\n let x = self.inner;\n let y_squared = x * x * x - 17;\n\n sqrt(y_squared)\n }\n\n pub fn compute(public_keys: PublicKeys, partial_address: PartialAddress) -> AztecAddress {\n //\n // address = address_point.x\n // |\n // address_point = pre_address * G + Ivpk_m (always choose \"positive\" y-coord)\n // | ^\n // | |.....................\n // pre_address .\n // / \\ .\n // / \\ .\n // partial_address public_keys_hash .\n // / \\ / / \\ \\ .\n // / \\ Npk_m Ivpk_m Ovpk_m Tpk_m .\n // contract_class_id \\ |...................\n // / | \\ \\\n // artifact_hash | public_bytecode_commitment salted_initialization_hash\n // | / / \\\n // private_function_tree_root deployer_address salt initialization_hash\n // / \\ / \\\n // ... ... constructor_fn_selector constructor_args_hash\n // / \\\n // / \\ / \\\n // leaf leaf leaf leaf\n // ^\n // |\n // |---h(function_selector, vk_hash)\n // ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^\n // Each of these represents a private function of the contract.\n\n let public_keys_hash = public_keys.hash();\n\n let pre_address = poseidon2_hash_with_separator(\n [public_keys_hash.to_field(), partial_address.to_field()],\n DOM_SEP__CONTRACT_ADDRESS_V1,\n );\n\n // Note: `.add()` will fail within the blackbox fn if either of the points are not on the curve. (See tests below).\n let address_point = derive_public_key(EmbeddedCurveScalar::from_field(pre_address)).add(\n public_keys.ivpk_m.to_point(),\n );\n\n // Note that our address is only the x-coordinate of the full address_point. This is okay because when people want to encrypt something and send it to us\n // they can recover our full point using the x-coordinate (our address itself). To do this, they recompute the y-coordinate according to the equation y^2 = x^3 - 17.\n // When they do this, they may get a positive y-coordinate (a value that is less than or equal to MAX_FIELD_VALUE / 2) or\n // a negative y-coordinate (a value that is more than MAX_FIELD_VALUE), and we cannot dictate which one they get and hence the recovered point may sometimes be different than the one\n // our secret can decrypt. Regardless though, they should and will always encrypt using point with the positive y-coordinate by convention.\n // This ensures that everyone encrypts to the same point given an arbitrary x-coordinate (address). This is allowed because even though our original point may not have a positive y-coordinate,\n // with our original secret, we will be able to derive the secret to the point with the flipped (and now positive) y-coordinate that everyone encrypts to.\n AztecAddress::from_field(address_point.x)\n }\n\n pub fn compute_from_class_id(\n contract_class_id: ContractClassId,\n salted_initialization_hash: SaltedInitializationHash,\n public_keys: PublicKeys,\n ) -> Self {\n let partial_address = PartialAddress::compute_from_salted_initialization_hash(\n contract_class_id,\n salted_initialization_hash,\n );\n\n AztecAddress::compute(public_keys, partial_address)\n }\n\n pub fn is_zero(self) -> bool {\n self.inner == 0\n }\n\n pub fn assert_is_zero(self) {\n assert(self.to_field() == 0);\n }\n}\n\n#[test]\nfn check_max_field_value() {\n // Check that it is indeed r-1.\n assert_eq(MAX_FIELD_VALUE + 1, 0);\n}\n\n#[test]\nfn check_is_positive() {\n assert(AztecAddress::is_positive(0));\n assert(AztecAddress::is_positive(1));\n assert(!AztecAddress::is_positive(-1));\n assert(AztecAddress::is_positive(MAX_FIELD_VALUE / 2));\n assert(!AztecAddress::is_positive((MAX_FIELD_VALUE / 2) + 1));\n}\n\n// Gives us confidence that we don't need to manually check that the input public keys need to be on the curve for `add`,\n// because the blackbox function does this check for us.\n#[test(should_fail_with = \"is not on curve\")]\nfn check_embedded_curve_point_add() {\n // Choose a point not on the curve:\n let p1 = Point { x: 1, y: 1, is_infinite: false };\n let p2 = Point::generator();\n let _ = p1 + p2;\n}\n\n// Gives us confidence that we don't need to manually check that the input public keys need to be on the curve for `add`,\n// because the blackbox function does this check for us.\n#[test(should_fail_with = \"is not on curve\")]\nfn check_embedded_curve_point_add_2() {\n // Choose a point not on the curve in the 2nd position.\n let p1 = Point::generator();\n let p2 = Point { x: 1, y: 1, is_infinite: false };\n let _ = p1 + p2;\n}\n\n#[test]\nfn compute_address_from_partial_and_pub_keys() {\n let public_keys = PublicKeys {\n npk_m: NpkM {\n inner: Point {\n x: 0x22f7fcddfa3ce3e8f0cc8e82d7b94cdd740afa3e77f8e4a63ea78a239432dcab,\n y: 0x0471657de2b6216ade6c506d28fbc22ba8b8ed95c871ad9f3e3984e90d9723a7,\n is_infinite: false,\n },\n },\n ivpk_m: IvpkM {\n inner: Point {\n x: 0x111223493147f6785514b1c195bb37a2589f22a6596d30bb2bb145fdc9ca8f1e,\n y: 0x273bbffd678edce8fe30e0deafc4f66d58357c06fd4a820285294b9746c3be95,\n is_infinite: false,\n },\n },\n ovpk_m: OvpkM {\n inner: Point {\n x: 0x09115c96e962322ffed6522f57194627136b8d03ac7469109707f5e44190c484,\n y: 0x0c49773308a13d740a7f0d4f0e6163b02c5a408b6f965856b6a491002d073d5b,\n is_infinite: false,\n },\n },\n tpk_m: TpkM {\n inner: Point {\n x: 0x00d3d81beb009873eb7116327cf47c612d5758ef083d4fda78e9b63980b2a762,\n y: 0x2f567d22d2b02fe1f4ad42db9d58a36afd1983e7e2909d1cab61cafedad6193a,\n is_infinite: false,\n },\n },\n };\n\n let partial_address = PartialAddress::from_field(\n 0x0a7c585381b10f4666044266a02405bf6e01fa564c8517d4ad5823493abd31de,\n );\n\n let address = AztecAddress::compute(public_keys, partial_address);\n\n // The following value was generated by `derivation.test.ts`.\n // --> Run the test with AZTEC_GENERATE_TEST_DATA=1 flag to update test data.\n let expected_computed_address_from_partial_and_pubkeys =\n 0x2f66081d4bb077fbe8e8abe96a3516a713a3d7e34360b4e985da0da95092b37d;\n assert(address.to_field() == expected_computed_address_from_partial_and_pubkeys);\n}\n\n#[test]\nfn compute_preaddress_from_partial_and_pub_keys() {\n let pre_address = poseidon2_hash_with_separator([1, 2], DOM_SEP__CONTRACT_ADDRESS_V1);\n let expected_computed_preaddress_from_partial_and_pubkey =\n 0x286c7755f2924b1e53b00bcaf1adaffe7287bd74bba7a02f4ab867e3892d28da;\n assert(pre_address == expected_computed_preaddress_from_partial_and_pubkey);\n}\n\n#[test]\nfn from_field_to_field() {\n let address = AztecAddress { inner: 37 };\n assert_eq(FromField::from_field(address.to_field()), address);\n}\n\n#[test]\nfn serde() {\n let address = AztecAddress { inner: 37 };\n // We use the AZTEC_ADDRESS_LENGTH constant to ensure that there is a match between the derived trait\n // implementation and the constant.\n let serialized: [Field; AZTEC_ADDRESS_LENGTH] = address.serialize();\n let deserialized = AztecAddress::deserialize(serialized);\n assert_eq(address, deserialized);\n}\n\n#[test]\nfn to_address_point_valid() {\n // x = 8 where x^3 - 17 = 512 - 17 = 495, which is a residue in this field\n let address = AztecAddress { inner: 8 };\n\n assert(address.get_y().is_some()); // We don't bother checking the result of get_y as it is only used internally\n assert(address.is_valid());\n\n let maybe_point = address.to_address_point();\n assert(maybe_point.is_some());\n\n let point = maybe_point.unwrap().inner;\n // check that x is preserved\n assert_eq(point.x, Field::from(8));\n\n // check that the curve equation holds: y^2 == x^3 - 17\n assert_eq(point.y * point.y, point.x * point.x * point.x - 17);\n}\n\n#[test]\nunconstrained fn to_address_point_invalid() {\n // x = 3 where x^3 - 17 = 27 - 17 = 10, which is a non-residue in this field\n let address = AztecAddress { inner: 3 };\n\n assert(address.get_y().is_none());\n assert(!address.is_valid());\n\n assert(address.to_address_point().is_none());\n}\n"
|
|
3526
2839
|
},
|
|
3527
|
-
"
|
|
2840
|
+
"361": {
|
|
3528
2841
|
"path": "/home/aztec-dev/aztec-packages/noir-projects/noir-protocol-circuits/crates/types/src/address/partial_address.nr",
|
|
3529
2842
|
"source": "use crate::{\n address::{aztec_address::AztecAddress, salted_initialization_hash::SaltedInitializationHash},\n constants::DOM_SEP__PARTIAL_ADDRESS,\n contract_class_id::ContractClassId,\n hash::poseidon2_hash_with_separator,\n traits::{Deserialize, Empty, Serialize, ToField},\n};\nuse std::meta::derive;\n\n// Partial address\n#[derive(Deserialize, Eq, Serialize)]\npub struct PartialAddress {\n pub inner: Field,\n}\n\nimpl ToField for PartialAddress {\n fn to_field(self) -> Field {\n self.inner\n }\n}\n\nimpl Empty for PartialAddress {\n fn empty() -> Self {\n Self { inner: 0 }\n }\n}\n\nimpl PartialAddress {\n pub fn from_field(field: Field) -> Self {\n Self { inner: field }\n }\n\n pub fn compute(\n contract_class_id: ContractClassId,\n salt: Field,\n initialization_hash: Field,\n deployer: AztecAddress,\n ) -> Self {\n PartialAddress::compute_from_salted_initialization_hash(\n contract_class_id,\n SaltedInitializationHash::compute(salt, initialization_hash, deployer),\n )\n }\n\n pub fn compute_from_salted_initialization_hash(\n contract_class_id: ContractClassId,\n salted_initialization_hash: SaltedInitializationHash,\n ) -> Self {\n PartialAddress::from_field(poseidon2_hash_with_separator(\n [contract_class_id.to_field(), salted_initialization_hash.to_field()],\n DOM_SEP__PARTIAL_ADDRESS,\n ))\n }\n\n pub fn to_field(self) -> Field {\n self.inner\n }\n\n pub fn is_zero(self) -> bool {\n self.to_field() == 0\n }\n\n pub fn assert_is_zero(self) {\n assert(self.to_field() == 0);\n }\n}\n\nmod test {\n use crate::{address::partial_address::PartialAddress, traits::{Deserialize, Serialize}};\n\n #[test]\n fn serialization_of_partial_address() {\n let item = PartialAddress::from_field(1);\n let serialized: [Field; 1] = item.serialize();\n let deserialized = PartialAddress::deserialize(serialized);\n assert_eq(item, deserialized);\n }\n}\n"
|
|
3530
2843
|
},
|
|
3531
|
-
"
|
|
2844
|
+
"363": {
|
|
3532
2845
|
"path": "/home/aztec-dev/aztec-packages/noir-projects/noir-protocol-circuits/crates/types/src/address/salted_initialization_hash.nr",
|
|
3533
2846
|
"source": "use crate::{\n address::aztec_address::AztecAddress, constants::DOM_SEP__PARTIAL_ADDRESS,\n hash::poseidon2_hash_with_separator, traits::ToField,\n};\n\n// Salted initialization hash. Used in the computation of a partial address.\n#[derive(Eq)]\npub struct SaltedInitializationHash {\n pub inner: Field,\n}\n\nimpl ToField for SaltedInitializationHash {\n fn to_field(self) -> Field {\n self.inner\n }\n}\n\nimpl SaltedInitializationHash {\n pub fn from_field(field: Field) -> Self {\n Self { inner: field }\n }\n\n pub fn compute(salt: Field, initialization_hash: Field, deployer: AztecAddress) -> Self {\n SaltedInitializationHash::from_field(poseidon2_hash_with_separator(\n [salt, initialization_hash, deployer.to_field()],\n DOM_SEP__PARTIAL_ADDRESS,\n ))\n }\n\n pub fn assert_is_zero(self) {\n assert(self.to_field() == 0);\n }\n}\n"
|
|
3534
2847
|
},
|
|
3535
|
-
"
|
|
3536
|
-
"path": "/home/aztec-dev/aztec-packages/noir-projects/noir-protocol-circuits/crates/types/src/debug_log.nr",
|
|
3537
|
-
"source": "// TODO: Expose other wrapped functions than debug (info, warn)\n// ['silent', 'fatal', 'error', 'warn', 'info', 'verbose', 'debug', 'trace']\n\npub global SILENT_LOG_LEVEL: u8 = 0;\npub global FATAL_LOG_LEVEL: u8 = 1;\npub global ERROR_LOG_LEVEL: u8 = 2;\npub global WARN_LOG_LEVEL: u8 = 3;\npub global INFO_LOG_LEVEL: u8 = 4;\npub global VERBOSE_LOG_LEVEL: u8 = 5;\npub global DEBUG_LOG_LEVEL: u8 = 6;\npub global TRACE_LOG_LEVEL: u8 = 7;\n\n/// Utility function to console.log data in the acir simulator.\n/// Example:\n/// debug_log(\"blah blah this is a debug string\");\npub fn debug_log<let N: u32>(msg: str<N>) {\n debug_log_format(msg, []);\n}\n\n/// Same as debug_log, but allows to customize the log level.\n/// Consider changing just to 'log'\npub fn debug_log_with_level<let N: u32>(log_level: u8, msg: str<N>) {\n debug_log_format_with_level(log_level, msg, []);\n}\n\n/// Utility function to console.log data in the acir simulator. This variant receives a format string in which the\n/// `${k}` tokens will be replaced with the k-eth value in the `args` array.\n/// Examples:\n/// debug_log_format(\"get_2(slot:{0}) =>\\n\\t0:{1}\\n\\t1:{2}\", [storage_slot, note0_hash, note1_hash]);\n/// debug_log_format(\"whole array: {}\", [e1, e2, e3, e4]);\npub fn debug_log_format<let M: u32, let N: u32>(msg: str<M>, args: [Field; N]) {\n // Safety: This oracle call returns nothing: we only call it for its side effects. It is therefore always safe\n // to call.\n unsafe { debug_log_array_oracle_wrapper(DEBUG_LOG_LEVEL, msg, args) };\n}\n\n/// Same as debug_log_format, but allows to customize the log level.\n/// Consider changing just to 'log_format'\npub fn debug_log_format_with_level<let M: u32, let N: u32>(\n log_level: u8,\n msg: str<M>,\n args: [Field; N],\n) {\n // Safety: This oracle call returns nothing: we only call it for its side effects. It is therefore always safe\n // to call.\n unsafe { debug_log_array_oracle_wrapper(log_level, msg, args) };\n}\n\n/// Utility function to console.log data in the acir simulator. This variant receives a format string in which the\n/// `${k}` tokens will be replaced with the k-eth value in the `args` slice.\n/// Examples:\n/// debug_log_format(\"get_2(slot:{0}) =>\\n\\t0:{1}\\n\\t1:{2}\", [storage_slot, note0_hash, note1_hash]);\n/// debug_log_format(\"whole slice: {}\", [e1, e2, e3, e4]);\npub fn debug_log_format_slice<let M: u32>(log_level: u8, msg: str<M>, args: [Field]) {\n // Safety: This oracle call returns nothing: we only call it for its side effects. It is therefore always safe\n // to call.\n unsafe { debug_log_slice_oracle_wrapper(log_level, msg, args) };\n}\n\n// We provide two versions of the debug log oracle: one that takes args as a slice and another one that takes args as an array.\n// We do this since conversion from array to slice generates overhead in public functions, since opcodes need to be emitted for the conversion.\n// By exposing the two flavors, we avoid conversions since the AVM is able to handle both arrays an slices in this oracle.\n\nunconstrained fn debug_log_slice_oracle_wrapper<let M: u32>(\n log_level: u8,\n msg: str<M>,\n args: [Field],\n) {\n debug_log_slice_oracle(log_level, msg, args);\n}\n\n// WARNING: sometimes when using debug logs the ACVM errors with: `thrown: \"solver opcode resolution error: cannot solve opcode: expression has too many unknowns x155\"`\n#[oracle(utilityDebugLog)]\nunconstrained fn debug_log_slice_oracle<let M: u32>(log_level: u8, msg: str<M>, args: [Field]) {}\n\nunconstrained fn debug_log_array_oracle_wrapper<let M: u32, let N: u32>(\n log_level: u8,\n msg: str<M>,\n args: [Field; N],\n) {\n debug_log_array_oracle(log_level, msg, N, args);\n}\n\n#[oracle(utilityDebugLog)]\nunconstrained fn debug_log_array_oracle<let M: u32, let N: u32>(\n log_level: u8,\n msg: str<M>,\n length: u32,\n args: [Field; N],\n) {}\n"
|
|
3538
|
-
},
|
|
3539
|
-
"338": {
|
|
2848
|
+
"381": {
|
|
3540
2849
|
"path": "/home/aztec-dev/aztec-packages/noir-projects/noir-protocol-circuits/crates/types/src/delayed_public_mutable/delayed_public_mutable_values.nr",
|
|
3541
2850
|
"source": "use crate::{\n delayed_public_mutable::{\n scheduled_delay_change::ScheduledDelayChange, scheduled_value_change::ScheduledValueChange,\n },\n hash::poseidon2_hash,\n traits::{Hash, Packable},\n utils::arrays,\n};\nuse std::meta::derive;\n\nmod test;\n\n/// DelayedPublicMutableValues is just a wrapper around ScheduledValueChange and ScheduledDelayChange that then allows us\n/// to wrap both of these values in WithHash. WithHash allows for efficient read of values in private.\n///\n/// Note that the WithHash optimization does not work in public (due to there being no unconstrained). But we also want\n/// to be able to read the values efficiently in public and we want to be able to read each value separately. Reading\n/// the values separately is tricky because ScheduledValueChange and ScheduledDelayChange are packed together (sdc and\n/// svc.timestamp_of_change are stored in the same slot). For that reason we expose `unpack_value_change` and\n/// `unpack_delay_change` functions that can be used to extract the values from the packed representation. This\n/// is \"hacky\" but there is no way around it.\n#[derive(Eq)]\npub struct DelayedPublicMutableValues<T, let INITIAL_DELAY: u64> {\n pub svc: ScheduledValueChange<T>,\n pub sdc: ScheduledDelayChange<INITIAL_DELAY>,\n}\n\nimpl<T, let INITIAL_DELAY: u64> DelayedPublicMutableValues<T, INITIAL_DELAY> {\n pub fn new(svc: ScheduledValueChange<T>, sdc: ScheduledDelayChange<INITIAL_DELAY>) -> Self {\n DelayedPublicMutableValues { svc, sdc }\n }\n}\n\n/// Extracts a ScheduledValueChange struct from the packed representation of the full DelayedPublicMutable.\n/// TODO: impl the packable trait for ScheduledValueChange.\npub fn unpack_value_change<T, let M: u32>(packed: [Field; 2 * M + 1]) -> ScheduledValueChange<T>\nwhere\n T: Packable<N = M>,\n{\n let svc_pre_packed = arrays::subarray(packed, 1);\n let svc_post_packed = arrays::subarray(packed, M + 1);\n\n // We first cast to u32 as the timestamp_of_change is packed into the same field as the delay change and it\n // occupies the first 32 bits of the field.\n let timestamp_of_change = (packed[0] as u32) as u64;\n ScheduledValueChange::new(\n T::unpack(svc_pre_packed),\n T::unpack(svc_post_packed),\n timestamp_of_change,\n )\n}\n\n/// Extracts a ScheduledDelayChange struct from 0th field of the packed representation of the full DelayedPublicMutable.\n/// This function expects to be called with just the first field of the packed representation, which contains sdc\n/// and svc timestamp_of_change. We'll discard the svc component.\npub fn unpack_delay_change<let INITIAL_DELAY: u64>(\n packed: Field,\n) -> ScheduledDelayChange<INITIAL_DELAY> {\n // This function expects to be called with just the first field of the packed representation, which contains sdc\n // and svc timestamp_of_change. We'll discard the svc component.\n let svc_timestamp_of_change = packed as u32;\n\n let mut tmp = (packed - svc_timestamp_of_change as Field) / TWO_POW_32;\n let sdc_timestamp_of_change = tmp as u32;\n\n tmp = (tmp - sdc_timestamp_of_change as Field) / TWO_POW_32;\n let sdc_post_is_some = (tmp as u1) != 0;\n\n tmp = (tmp - sdc_post_is_some as Field) / TWO_POW_8;\n let sdc_post_inner = tmp as u32;\n\n tmp = (tmp - sdc_post_inner as Field) / TWO_POW_32;\n let sdc_pre_is_some = (tmp as u1) != 0;\n\n tmp = (tmp - sdc_pre_is_some as Field) / TWO_POW_8;\n let sdc_pre_inner = tmp as u32;\n\n // Note that below we cast the values to u64 as that is the default type of timestamp in the system. Us packing\n // the values as u32 is a tech debt that is not worth tackling.\n ScheduledDelayChange {\n pre: if sdc_pre_is_some {\n Option::some(sdc_pre_inner as u64)\n } else {\n Option::none()\n },\n post: if sdc_post_is_some {\n Option::some(sdc_post_inner as u64)\n } else {\n Option::none()\n },\n timestamp_of_change: sdc_timestamp_of_change as u64,\n }\n}\n\n// Q: do these evaluate at comptime or runtime?\nglobal TWO_POW_32: Field = 2.pow_32(32);\nglobal TWO_POW_8: Field = 2.pow_32(8);\n\n// We pack to `2 * N + 1` fields because ScheduledValueChange contains T twice (hence `2 * N`) and we need one extra\n// field to store ScheduledDelayChange and the timestamp_of_change of ScheduledValueChange.\nimpl<T, let INITIAL_DELAY: u64> Packable for DelayedPublicMutableValues<T, INITIAL_DELAY>\nwhere\n T: Packable,\n{\n let N: u32 = 2 * <T as Packable>::N + 1;\n\n fn pack(self) -> [Field; Self::N] {\n let mut result = [0; Self::N];\n\n // We pack sdc.pre, sdc.post, sdc.timestamp_of_change and svc.timestamp_of_change into a single field as follows:\n // [ sdc.pre_inner: u32 | sdc.pre_is_some: u8 | sdc.post_inner: u32 | sdc.post_is_some: u8 | sdc.timestamp_of_change: u32 | svc.timestamp_of_change: u32 ]\n // Note that the code below no longer works after 2106 as by that time the timestamp will overflow u32. This is a tech debt that is not worth tackling.\n result[0] = self.svc.timestamp_of_change as Field\n + ((self.sdc.timestamp_of_change as Field) * 2.pow_32(32))\n + ((self.sdc.post.is_some() as Field) * 2.pow_32(64))\n + ((self.sdc.post.unwrap_unchecked() as Field) * 2.pow_32(72))\n + ((self.sdc.pre.is_some() as Field) * 2.pow_32(104))\n + ((self.sdc.pre.unwrap_unchecked() as Field) * 2.pow_32(112));\n\n // Pack the pre and post values from ScheduledValueChange\n let svc_pre_packed = self.svc.pre.pack();\n let svc_post_packed = self.svc.post.pack();\n for i in 0..<T as Packable>::N {\n result[i + 1] = svc_pre_packed[i];\n result[i + 1 + <T as Packable>::N] = svc_post_packed[i];\n }\n result\n }\n\n // Note: inefficient if all you want to unpack is the svc; use unpack_value_change instead.\n fn unpack(fields: [Field; Self::N]) -> Self {\n let svc = unpack_value_change::<T, _>(fields);\n let sdc = unpack_delay_change::<INITIAL_DELAY>(fields[0]);\n Self::new(svc, sdc)\n }\n}\n\nimpl<T, let INITIAL_DELAY: u64> Hash for DelayedPublicMutableValues<T, INITIAL_DELAY>\nwhere\n T: Packable,\n{\n fn hash(self) -> Field {\n poseidon2_hash(self.pack())\n }\n}\n"
|
|
3542
2851
|
},
|
|
3543
|
-
"
|
|
2852
|
+
"384": {
|
|
3544
2853
|
"path": "/home/aztec-dev/aztec-packages/noir-projects/noir-protocol-circuits/crates/types/src/delayed_public_mutable/scheduled_delay_change.nr",
|
|
3545
|
-
"source": "use crate::traits::Empty;\nuse std::cmp::min;\n\nmod test;\n\n// This data structure is used by DelayedPublicMutable to store the minimum delay with which a ScheduledValueChange object can\n// schedule a change.\n// This delay is initially equal to INITIAL_DELAY, and can be safely mutated to any other value over time. This mutation\n// is performed via `schedule_change` in order to satisfy ScheduleValueChange constraints: if e.g. we allowed for the\n// delay to be decreased immediately then it'd be possible for the state variable to schedule a value change with a\n// reduced delay, invalidating prior private reads.\npub struct ScheduledDelayChange<let INITIAL_DELAY: u64> {\n // Both pre and post are stored in public storage, so by default they are zeroed. By wrapping them in an Option,\n // they default to Option::none(), which we detect and replace with INITIAL_DELAY. The end result is that a\n // ScheduledDelayChange that has not been initialized has a delay equal to INITIAL_DELAY, which is the desired\n // effect. Once initialized, the Option will never be none again.\n pub(crate) pre: Option<u64>,\n pub(crate) post: Option<u64>,\n // Timestamp at which `post` value is used instead of `pre`\n pub(crate) timestamp_of_change: u64,\n}\n\nimpl<let INITIAL_DELAY: u64> ScheduledDelayChange<INITIAL_DELAY> {\n pub fn new(pre: Option<u64>, post: Option<u64>, timestamp_of_change: u64) -> Self {\n Self { pre, post, timestamp_of_change }\n }\n\n /// Returns the current value of the delay stored in the data structure.\n /// WARNING: This function only returns a meaningful value when called in public with the current timestamp - for\n /// historical private reads use `get_effective_minimum_delay_at` instead.\n pub fn get_current(self, current_timestamp: u64) -> u64 {\n // The post value becomes the current one at the timestamp of change, so any transaction that is included at or after\n // the timestamp of change will use the post value.\n if current_timestamp < self.timestamp_of_change {\n self.pre.unwrap_or(INITIAL_DELAY)\n } else {\n self.post.unwrap_or(INITIAL_DELAY)\n }\n }\n\n /// Returns the scheduled change, i.e. the post-change delay and the timestamp at which it will become the current\n /// delay. Note that this timestamp may be in the past if the change has already taken place.\n /// Additionally, further changes might be later scheduled, potentially canceling the one returned by this function.\n pub fn get_scheduled(self) -> (u64, u64) {\n (self.post.unwrap_or(INITIAL_DELAY), self.timestamp_of_change)\n }\n\n /// Schedules a change to the delay, given the `current_timestamp` and the `current` delay.\n /// This function is only meaningful when called in public with the current timestamp.\n /// The timestamp at which the new delay will become effective is determined automatically:\n /// - when increasing the delay, the change is effective immediately\n /// - when reducing the delay, the change will take effect after a delay equal to the difference between old and\n /// new delay. For example, if reducing from 3 days to 1 day, the reduction will be scheduled to happen after 2\n /// days.\n pub fn schedule_change(&mut self, new: u64, current_timestamp: u64) {\n let current = self.get_current(current_timestamp);\n\n // When changing the delay value we must ensure that it is not possible to produce a value change with a delay\n // shorter than the current one.\n let time_until_delay_change = if new > current {\n // Increasing the delay value can therefore be done immediately: this does not invalidate prior constraints\n // about how quickly a value might be changed (indeed it strengthens them).\n //\n //\n // Earliest `svc.timestamp_of_change`, Earliest `svc.timestamp_of_change`\n // `current_timestamp` if the delay had remained unchanged immediately after this scheduling fn.\n // v v v\n // ====|==========================================================|==============|==>\n // | | |\n // [------------------`current` delay-------------------------] |\n // | |\n // [-------------------------`new` (longer) delay----------------------------]\n // |\n // [] <--- `time_until_delay_change` is `0`; the change is immediate.\n // |\n // ^\n // The newly-calculated `self.timestamp_of_change` (unchanged)\n\n 0\n } else {\n // Decreasing the delay requires waiting for the difference between current and new delay in order to ensure\n // that overall the current delay is respected.\n //\n //\n // Earliest `svc.timestamp_of_change`,\n // if the delay had remained unchanged\n // AND\n // Earliest `svc.timestamp_of_change`,\n // `current_timestamp` immediately after this scheduling fn.\n // ====|============================|=============================|=================>\n // | |\n // [---------------------`current` delay----------------------]\n // | |\n // [- --`new` (shorter) delay----]\n // | ^\n // [-`time_until_delay_change`--] |\n // | |\n // ^ |\n // The newly-calculated |\n // `self.timestamp_of_change` |\n // |\n // The new `self.timestamp_of_change`\n // is calculated so that these ends\n // align.\n current - new\n };\n\n self.pre = Option::some(current);\n self.post = Option::some(new);\n self.timestamp_of_change = current_timestamp + time_until_delay_change;\n }\n\n /// Returns the minimum delay before a value might mutate due to a scheduled change, from the perspective of some\n /// historical timestamp. It only returns a meaningful value when called in private with historical timestamps.\n /// The output of this function can be passed into `ScheduledValueChange.get_time_horizon` to properly\n /// constrain the `include_by_timestamp` when reading delayed mutable state.\n /// This value typically equals the current delay at the timestamp following the historical one (the earliest one in\n /// which a value change could be scheduled), but it also considers scenarios in which a delay reduction is\n /// scheduled to happen in the near future, resulting in a way to schedule a change with an overall delay lower than\n /// the current one.\n ///\n /// Alternative explanation: returns the maximum amount of time (from the historical timestamp) that a state read\n /// (as at the historical timestamp) will remain valid.\n /// A read might end up being valid for less time in the case where a `svc.timestamp_of_change` has already been\n /// set and if it's sooner than the output of this function. In that case, the `scheduled_value_change.nr`'s\n /// `get_time_horizon` function will realize this.\n ///\n pub fn get_effective_minimum_delay_at(self, historical_timestamp: u64) -> u64 {\n // If a change is scheduled, then the effective delay might be lower than the current one (pre). At the\n // timestamp of change the current delay will be the scheduled one, with an overall delay from the historical\n // timestamp equal to the time until the change plus the new delay. If this value is lower\n // than the current delay, then that is the effective minimum delay.\n\n // If using some block as the anchor block of some tx, then note that if you\n // read a `delayed_mutable` from that anchor block, you're actually reading the\n // `delayed_mutable` _as at the very end_ of that block.\n // Therefore the `delayed_mutable` that you will read _as at the very start of the next\n // block_ will be _the very same_ `delayed_mutable` (nothing can possibly have changed).\n // Therefore the first opportunity to schedule a value change (from the anchor timestamp)\n // is the first tx of that next block, which takes place at least 1 second after the\n // anchor block.\n // So should you choose to go ahead and schedule a value change in the first tx of that\n // next block, it will only take effect after the \"current delay\" (as dictated by the\n // `delayed_mutable` of that tx, which is the same as the `delayed_mutable` as at the\n // anchor timestamp).\n // In all, the time between the anchor block's timestamp and the earliest-possible value\n // timestamp_of_change, is therefore: 1 second + the \"current\" delay (as at the time of\n // the anchor timestamp).\n // Reads must only be valid until _just before_ the earliest-possible value change --\n // i.e. 1 second before the earliest-possible value change.\n // That is, reads are only valid for the \"current\" delay (as at the time of the anchor\n // timestamp) _at most_.\n // (I.e. the read remains valid for 1 + \"current delay\" - 1 = \"current delay\", from the\n // anchor timestamp).\n //\n // ____________ ____________\n // | | | |\n // | Block |<--At least a 1 second gap-->| Block |\n // |____________| |____________|\n // ^ ^\n // | You can schedule a value change from here.\n // |\n // Suppose this is your anchor block.\n // The delayed_mutable (and hence the \"current\" delay) as at the end of this block will\n // be the same as at the start of the next block.\n //\n if self.timestamp_of_change <= historical_timestamp {\n //\n // `self.timestamp_of_change` <= `historical_timestamp`\n // v v\n // ===================|==============================|=========\n // ^^^^^^^^^^^^^^^^^^ ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^\n // `self.pre` is |`self.post` takes effect from here.\n // effective before. |\n //\n // So in this `if` case, `self.post` is in effect at the time of the `historical_timestamp`.\n //\n // If no delay changes are scheduled (as at the time of the anchor timestamp), then the\n // \"current delay\" (as at the time of the historical timestamp) is `self.post` (or the\n // INITIAL_DELAY if never set).\n self.post.unwrap_or(INITIAL_DELAY)\n } else {\n //\n // `historical_timestamp` < `self.timestamp_of_change`\n // v\n // ===================|======================|====================================\n // ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^\n // `self.pre` is effective |`self.post` takes effect from here.\n // during this period. |\n //\n // So in this `else` case, `self.pre` is in effect at the time of the `historical_timestamp`.\n //\n // If a delay change _is_ already scheduled (as at the time of the historical timestamp):\n // ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^\n // |________________\n // |\n // v Earliest possible\n // `historical_ Scheduled delay change: `svc.timestamp_of_change`\n // timestamp` < `self.timestamp_of_change` (if not already set [^1])\n // v v v\n // ===||=============================|====================================|================>\n // .| . .\n // .| . .\n // .|__ Earliest possible timestamp at which a .\n // . function could call `schedule_change` for a new .\n // . _value_ change..................................................And the earliest timestamp at\n // . . .which the new value would take effect.\n // .[---------------`self.pre` delay-----------------------------------]\n // . . .\n // [******************************************************************].\n // [ ].\n // [----------------`self.pre` delay----------------------------------].\n // [ ].\n // [ If reading a _value_ at that (<--) anchor timestamp, then the ].\n // [ read will remain valid for this duration, unless a shorter ].\n // [ delay has been scheduled (see just below in this diagram). ].\n // [ If a _deferred, longer_ delay has been scheduled, it might yet ].\n // [ still be cancelled, in which case this `pre` delay would ].\n // [ bite (see the `min` calc below) -- meaning reads would remain ].\n // [ valid for this duration. ].\n // [ ].\n // [******************************************************************].\n // . . .\n // . . .\n // [---`time_until_delay_change`--] .\n // . . .\n // . . .\n // . . .\n // SCENARIO 1: scheduled delay is shorter than the `self.pre` delay: .\n // . . .\n // . . .\n // . [-`self.post` delay-] .\n // . . (if shorter ^^ .\n // . . than `pre`) ||_ new values can take effect from here.\n // . . |\n // . . |_ reads are only valid until here:\n // . . . `historic_timestamp + time_until_delay_change + self.post - 1`\n // . . . .\n // [*************************************************] .\n // [ ] .\n // [----`time_until_delay_change + self.post - 1`----] .\n // [ ] .\n // [ If reading a _value_ at that (<--) anchor ] .\n // [ timestamp, then the read will remain valid ] .\n // [ for this duration: ] .\n // [ ] .\n // [*************************************************] .\n // . . .\n // . . .\n // . . .\n // SCENARIO 2: scheduled delay is longer than the `self.pre` delay, AND is deferred:\n // (note: scheduling deferred delay changes is not yet possible)\n // . . .\n // . . .\n // . [-`self.post` delay (if longer than `pre` & deferred)------------------]\n // . . (scheduling deferred delay changes is not yet possible) ^^\n // . . ||\n // . . reads would only be valid until here:___________________________||\n // . . `historic_timestamp + time_until_delay_change + self.post - 1` |\n // . . |\n // . . new values would take effect from here,_______|\n // . . but only once this longer delay takes effect .\n // . . . .\n // . . . .\n // [****************************************************************************************************].\n // [ ].\n // [----`time_until_delay_change + self.post - 1`-------------------------------------------------------].\n // [ ].\n // [ Given a longer, deferred delay, then if reading a _value_ at that (<--) historical timestamp, then ].\n // [ you might think the read would remain valid for this duration. ].\n // [ BUT, in this case of this deferred, longer-than-`self.pre` delay, the `pre` delay ends sooner (by ].\n // [ construction) (see above in this diagram). ].\n // [ And since this scheduled delay (`post`) can be cancelled up until the time it takes effect, ].\n // [ any reads as at that (<--) historical timestamp would cautiously only be valid until the earlier ].\n // [ `pre` delay expiry. ].\n // [ ].\n // [****************************************************************************************************].\n //\n //\n //\n // [^1] If a svc.timestamp_of_change has already been set, and if it's sooner than the\n // output of this function, then it will bite within `scheduled_value_change.nr`'s\n // `get_time_horizon` function.\n let time_until_delay_change = self.timestamp_of_change - historical_timestamp;\n\n min(\n self.pre.unwrap_or(INITIAL_DELAY), // in case the scheduled delay (`post`) gets cancelled before it takes effect.\n time_until_delay_change + self.post.unwrap_or(INITIAL_DELAY) - 1,\n )\n }\n }\n}\n\nimpl<let INITIAL_DELAY: u64> Eq for ScheduledDelayChange<INITIAL_DELAY> {\n fn eq(self, other: Self) -> bool {\n (self.pre == other.pre)\n & (self.post == other.post)\n & (self.timestamp_of_change == other.timestamp_of_change)\n }\n}\n\nimpl<let INITIAL_DELAY: u64> Empty for ScheduledDelayChange<INITIAL_DELAY> {\n fn empty() -> Self {\n Self { pre: Option::none(), post: Option::none(), timestamp_of_change: 0 }\n }\n}\n"
|
|
2854
|
+
"source": "use crate::traits::Empty;\nuse std::cmp::min;\n\nmod test;\n\n// This data structure is used by DelayedPublicMutable to store the minimum delay with which a ScheduledValueChange\n// object can schedule a change.\n// This delay is initially equal to INITIAL_DELAY, and can be safely mutated to any other value over time. This mutation\n// is performed via `schedule_change` in order to satisfy ScheduleValueChange constraints: if e.g. we allowed for the\n// delay to be decreased immediately then it'd be possible for the state variable to schedule a value change with a\n// reduced delay, invalidating prior private reads.\npub struct ScheduledDelayChange<let INITIAL_DELAY: u64> {\n // Both pre and post are stored in public storage, so by default they are zeroed. By wrapping them in an Option,\n // they default to Option::none(), which we detect and replace with INITIAL_DELAY. The end result is that a\n // ScheduledDelayChange that has not been initialized has a delay equal to INITIAL_DELAY, which is the desired\n // effect. Once initialized, the Option will never be none again.\n pub(crate) pre: Option<u64>,\n pub(crate) post: Option<u64>,\n // Timestamp at which `post` value is used instead of `pre`\n pub(crate) timestamp_of_change: u64,\n}\n\nimpl<let INITIAL_DELAY: u64> ScheduledDelayChange<INITIAL_DELAY> {\n pub fn new(pre: Option<u64>, post: Option<u64>, timestamp_of_change: u64) -> Self {\n Self { pre, post, timestamp_of_change }\n }\n\n /// Returns the current value of the delay stored in the data structure.\n /// WARNING: This function only returns a meaningful value when called in public with the current timestamp - for\n /// historical private reads use `get_effective_minimum_delay_at` instead.\n pub fn get_current(self, current_timestamp: u64) -> u64 {\n // The post value becomes the current one at the timestamp of change, so any transaction that is included at or\n // after the timestamp of change will use the post value.\n if current_timestamp < self.timestamp_of_change {\n self.pre.unwrap_or(INITIAL_DELAY)\n } else {\n self.post.unwrap_or(INITIAL_DELAY)\n }\n }\n\n /// Returns the scheduled change, i.e. the post-change delay and the timestamp at which it will become the current\n /// delay. Note that this timestamp may be in the past if the change has already taken place.\n /// Additionally, further changes might be later scheduled, potentially canceling the one returned by this function.\n pub fn get_scheduled(self) -> (u64, u64) {\n (self.post.unwrap_or(INITIAL_DELAY), self.timestamp_of_change)\n }\n\n /// Schedules a change to the delay, given the `current_timestamp` and the `current` delay.\n /// This function is only meaningful when called in public with the current timestamp.\n /// The timestamp at which the new delay will become effective is determined automatically:\n /// - when increasing the delay, the change is effective immediately\n /// - when reducing the delay, the change will take effect after a delay equal to the difference between old and\n /// new delay. For example, if reducing from 3 days to 1 day, the reduction will be scheduled to happen after 2\n /// days.\n pub fn schedule_change(&mut self, new: u64, current_timestamp: u64) {\n let current = self.get_current(current_timestamp);\n\n // When changing the delay value we must ensure that it is not possible to produce a value change with a delay\n // shorter than the current one.\n let time_until_delay_change = if new > current {\n // Increasing the delay value can therefore be done immediately: this does not invalidate prior constraints\n // about how quickly a value might be changed (indeed it strengthens them).\n //\n //\n // Earliest `svc.timestamp_of_change`, Earliest `svc.timestamp_of_change`\n // `current_timestamp` if the delay had remained unchanged immediately after this scheduling fn.\n // v v v\n // ====|==========================================================|==============|==>\n // | | |\n // [------------------`current` delay-------------------------] |\n // | |\n // [-------------------------`new` (longer) delay----------------------------]\n // |\n // [] <--- `time_until_delay_change` is `0`; the change is immediate.\n // |\n // ^\n // The newly-calculated `self.timestamp_of_change` (unchanged)\n\n 0\n } else {\n // Decreasing the delay requires waiting for the difference between current and new delay in order to ensure\n // that overall the current delay is respected.\n //\n //\n // Earliest `svc.timestamp_of_change`,\n // if the delay had remained unchanged\n // AND\n // Earliest `svc.timestamp_of_change`,\n // `current_timestamp` immediately after this scheduling fn.\n // ====|============================|=============================|=================>\n // | |\n // [---------------------`current` delay----------------------]\n // | |\n // [- --`new` (shorter) delay----]\n // | ^\n // [-`time_until_delay_change`--] |\n // | |\n // ^ |\n // The newly-calculated |\n // `self.timestamp_of_change` |\n // |\n // The new `self.timestamp_of_change`\n // is calculated so that these ends\n // align.\n current - new\n };\n\n self.pre = Option::some(current);\n self.post = Option::some(new);\n self.timestamp_of_change = current_timestamp + time_until_delay_change;\n }\n\n /// Returns the minimum delay before a value might mutate due to a scheduled change, from the perspective of some\n /// anchor block timestamp. It only returns a meaningful value when called in private with anchor block timestamps.\n /// The output of this function can be passed into `ScheduledValueChange.get_time_horizon` to properly\n /// constrain the `expiration_timestamp` when reading delayed mutable state.\n /// This value typically equals the current delay at the timestamp following the anchor block one (the earliest one\n /// in which a value change could be scheduled), but it also considers scenarios in which a delay reduction is\n /// scheduled to happen in the near future, resulting in a way to schedule a change with an overall delay lower than\n /// the current one.\n ///\n /// Alternative explanation: returns the maximum amount of time (from the anchor block timestamp) that a state read\n /// (as at the anchor block timestamp) will remain valid.\n /// A read might end up being valid for less time in the case where a `svc.timestamp_of_change` has already been\n /// set and if it's sooner than the output of this function. In that case, the `scheduled_value_change.nr`'s\n /// `get_time_horizon` function will realize this.\n ///\n pub fn get_effective_minimum_delay_at(self, anchor_block_timestamp: u64) -> u64 {\n // If a change is scheduled, then the effective delay might be lower than the current one (pre). At the\n // timestamp of change the current delay will be the scheduled one, with an overall delay from the anchor block\n // timestamp equal to the time until the change plus the new delay. If this value is lower\n // than the current delay, then that is the effective minimum delay.\n\n // If using some block as the anchor block of some tx, then note that if you\n // read a `delayed_mutable` from that anchor block, you're actually reading the\n // `delayed_mutable` _as at the very end_ of that block.\n // Therefore the `delayed_mutable` that you will read _as at the very start of the next\n // block_ will be _the very same_ `delayed_mutable` (nothing can possibly have changed).\n // Therefore the first opportunity to schedule a value change (from the anchor block timestamp)\n // is the first tx of a subsequent block. Blocks within the same checkpoint can share\n // timestamps, so the earliest scheduling timestamp can equal the anchor block timestamp.\n // So should you choose to go ahead and schedule a value change in a subsequent block,\n // it will only take effect after the \"current\" delay (as dictated by the\n // `delayed_mutable` of that tx, which is the same as the `delayed_mutable` as at the\n // anchor block timestamp).\n // In all, the time between the anchor block's timestamp and the earliest-possible value\n // timestamp_of_change, is therefore: the \"current\" delay (as at the time of the anchor\n // timestamp).\n // Reads must only be valid until _just before_ the earliest-possible value change --\n // i.e. 1 second before the earliest-possible value change.\n // That is, reads are only valid for the \"current\" delay (as at the time of the anchor\n // block timestamp) _at most_.\n //\n // ____________ ____________\n // | | | |\n // | Block |<-- 0 or more seconds gap -->| Block |\n // |____________| |____________|\n // ^ ^\n // | You can schedule a value change from here.\n // |\n // Suppose this is your anchor block.\n // The delayed_mutable (and hence the \"current\" delay) as at the end of this block will\n // be the same as at the start of the next block.\n //\n if self.timestamp_of_change <= anchor_block_timestamp {\n //\n // `self.timestamp_of_change` <= `anchor_block_timestamp`\n // v v\n // ===================|==============================|=========\n // ^^^^^^^^^^^^^^^^^^ ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^\n // `self.pre` is |`self.post` takes effect from here.\n // effective before. |\n //\n // So in this `if` case, `self.post` is in effect at the time of the `anchor_block_timestamp`.\n //\n // If no delay changes are scheduled (as at the time of the anchor timestamp), then the \"current delay\" (as\n // at the time of the anchor block timestamp) is `self.post - 1` (or the `INITIAL_DELAY - 1` if never set).\n self.post.unwrap_or(INITIAL_DELAY) - 1\n } else {\n //\n // `anchor_block_timestamp` < `self.timestamp_of_change`\n // v\n // ===================|======================|====================================\n // ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^\n // `self.pre` is effective |`self.post` takes effect from here.\n // during this period. |\n //\n //\n // So in this `else` case, `self.pre` is in effect at the time of the `anchor_block_timestamp`.\n //\n //\n //\n // If a delay change _is_ already scheduled (as at the time of the anchor block timestamp):\n // ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^\n // |________________\n // |\n // v Earliest possible\n // `anchor_block_ Scheduled delay change: `svc.timestamp_of_change`\n // timestamp` < `self.timestamp_of_change` (if not already set [^1])\n // v v v\n // ===|==============================|====================================|================>\n // | . .\n // | . .\n // |__ Earliest possible timestamp at which a .\n // . function could call `schedule_change` for a new .\n // . _value_ change.................................................| And the earliest timestamp at\n // . . . which the new value would take effect,\n // . . . as dictated by `self.pre`.\n // . . .\n // [---------------`self.pre` delay------------------------------------]\n // . . .\n // . . .\n // . . .\n // . . .\n // ********************************************************************.\n // * *.\n // [----------------`self.pre - 1`------------------------------------].\n // * *.\n // * If reading a _value_ at that (<--) anchor timestamp, then the *.\n // * read will remain valid for this duration, unless a shorter *.\n // * delay has been scheduled (see just below in this diagram). *.\n // * See the `min` calc in the code below. *.\n // * *.\n // * Future enhancement, recorded here so we don't have to *.\n // * re-remember it: *.\n // * If a _deferred, longer_ delay has been scheduled (not yet *.\n // * possible), it might yet still be cancelled, in which case this *.\n // * `pre - 1` delay would also bite (meaning reads would remain *.\n // * valid for this duration). *.\n // * *.\n // ********************************************************************.\n // . . .\n // . . .\n // . . .\n // . . .\n // [---`time_until_delay_change`--] .\n // . . .\n // . . .\n // . . .\n // SCENARIO 1: an already-scheduled delay is shorter than the `self.pre` delay:\n // . . .\n // . . .\n // . [-`self.post` delay-] .\n // . . (if shorter ^^ .\n // . . than `pre`) ||_ new values can take effect from here.\n // . . |\n // . . |_ reads are only valid until here:\n // . . . `anchor_block_timestamp + time_until_delay_change + self.post - 1`\n // . . . .\n // *************************************************** .\n // * * .\n // [----`time_until_delay_change + self.post - 1`----] .\n // * * .\n // * If reading a _value_ at that (<--) anchor * .\n // * timestamp, then the read will remain valid * .\n // * for this duration: * .\n // * * .\n // *************************************************** .\n // . . .\n // . . .\n // . . .\n // . . .\n // SCENARIO 2: an already-scheduled delay is longer than the `self.pre` delay, AND is deferred:\n // (note: scheduling deferred delay changes is not yet possible)\n // . . .\n // . . .\n // . . .\n // . [-`self.post` delay (if longer than `pre` & deferred)------------------]\n // . . (scheduling deferred delay changes is not yet possible) ^^\n // . . ||\n // . . reads would only be valid until here:___________________________||\n // . . `anchor_block_timestamp + time_until_delay_change + self.post - 1` |\n // . . |\n // . . new values would take effect from here,_______|\n // . . but only once this longer delay takes effect .\n // . . . .\n // . . . .\n // . . . .\n // ******************************************************************************************************.\n // * *.\n // [----`time_until_delay_change + self.post - 1`-------------------------------------------------------].\n // * *.\n // * Given a longer, deferred delay, then if reading a _value_ at that (<--) anchor block timestamp, then *.\n // * you might think the read would remain valid for this duration. *.\n // * BUT, in this case of this deferred, longer-than-`self.pre` delay, the `pre` delay ends sooner (by *.\n // * construction) (see above in this diagram). *.\n // * And since this scheduled delay (`post`) can be cancelled up until the time it takes effect, *.\n // * any reads as at that (<--) anchor block timestamp would cautiously only be valid until the earlier *.\n // * `pre` delay expiry. *.\n // * *.\n // ******************************************************************************************************.\n //\n //\n //\n // [^1] If a svc.timestamp_of_change has already been set, and if it's sooner than the\n // output of this function, then it will bite within `scheduled_value_change.nr`'s\n // `get_time_horizon` function.\n let time_until_delay_change = self.timestamp_of_change - anchor_block_timestamp;\n\n let time_until_next_delay_change = min(\n self.pre.unwrap_or(INITIAL_DELAY), // in case the scheduled delay (`post`) gets cancelled before it takes effect.\n time_until_delay_change + self.post.unwrap_or(INITIAL_DELAY),\n );\n\n // The effective minimum delay equals the minimum time until a value change, minus 1, since reads are\n // valid only up to (but not including) the moment the value can change.\n time_until_next_delay_change - 1\n }\n }\n}\n\nimpl<let INITIAL_DELAY: u64> Eq for ScheduledDelayChange<INITIAL_DELAY> {\n fn eq(self, other: Self) -> bool {\n (self.pre == other.pre)\n & (self.post == other.post)\n & (self.timestamp_of_change == other.timestamp_of_change)\n }\n}\n\nimpl<let INITIAL_DELAY: u64> Empty for ScheduledDelayChange<INITIAL_DELAY> {\n fn empty() -> Self {\n Self { pre: Option::none(), post: Option::none(), timestamp_of_change: 0 }\n }\n}\n"
|
|
3546
2855
|
},
|
|
3547
|
-
"
|
|
2856
|
+
"386": {
|
|
3548
2857
|
"path": "/home/aztec-dev/aztec-packages/noir-projects/noir-protocol-circuits/crates/types/src/delayed_public_mutable/scheduled_value_change.nr",
|
|
3549
|
-
"source": "use crate::traits::Empty;\nuse std::cmp::min;\n\nmod test;\n\n// This data structure is used by DelayedPublicMutable to represent a value that changes from `pre` to `post` at some timestamp\n// called the `timestamp_of_change`. The value can only be made to change by scheduling a change event at some future\n// timestamp after some minimum delay measured in seconds has elapsed. This means that at any given timestamp we know\n// both the current value and the smallest timestamp at which the value might change - this is called the\n// 'time horizon'.\npub struct ScheduledValueChange<T> {\n pub(crate) pre: T,\n pub(crate) post: T,\n // Timestamp at which `post` value is used instead of `pre`\n pub(crate) timestamp_of_change: u64,\n}\n\nimpl<T> ScheduledValueChange<T> {\n pub fn new(pre: T, post: T, timestamp_of_change: u64) -> Self {\n Self { pre, post, timestamp_of_change }\n }\n\n /// Returns the value stored in the data structure at a given timestamp. This function can be called both in public\n /// (where `timestamp` is simply the current timestamp, i.e. the timestamp at which the current transaction will be\n /// included) and in private (where `timestamp` is the anchor block's timestamp). Reading in private is only safe\n /// if the transaction's `
|
|
2858
|
+
"source": "use crate::traits::Empty;\nuse std::cmp::min;\n\nmod test;\n\n// This data structure is used by DelayedPublicMutable to represent a value that changes from `pre` to `post` at some timestamp\n// called the `timestamp_of_change`. The value can only be made to change by scheduling a change event at some future\n// timestamp after some minimum delay measured in seconds has elapsed. This means that at any given timestamp we know\n// both the current value and the smallest timestamp at which the value might change - this is called the\n// 'time horizon'.\npub struct ScheduledValueChange<T> {\n pub(crate) pre: T,\n pub(crate) post: T,\n // Timestamp at which `post` value is used instead of `pre`\n pub(crate) timestamp_of_change: u64,\n}\n\nimpl<T> ScheduledValueChange<T> {\n pub fn new(pre: T, post: T, timestamp_of_change: u64) -> Self {\n Self { pre, post, timestamp_of_change }\n }\n\n /// Returns the value stored in the data structure at a given timestamp. This function can be called both in public\n /// (where `timestamp` is simply the current timestamp, i.e. the timestamp at which the current transaction will be\n /// included) and in private (where `timestamp` is the anchor block's timestamp). Reading in private is only safe\n /// if the transaction's `expiration_timestamp` property is set to a value lower or equal to the time horizon (see\n /// `get_time_horizon()`).\n pub fn get_current_at(self, timestamp: u64) -> T {\n // The post value becomes the current one at the timestamp of change. This means different things in each realm:\n // - in public, any transaction that is included at the timestamp of change will use the post value\n // - in private, any transaction that includes the timestamp of change as part of the historical state will use\n // the post value (barring any follow-up changes)\n if timestamp < self.timestamp_of_change {\n self.pre\n } else {\n self.post\n }\n }\n\n /// Returns the scheduled change, i.e. the post-change value and the timestamp at which it will become the current\n /// value. Note that this timestamp may be in the past if the change has already taken place.\n /// Additionally, further changes might be later scheduled, potentially canceling the one returned by this function.\n pub fn get_scheduled(self) -> (T, u64) {\n (self.post, self.timestamp_of_change)\n }\n\n // Returns the previous value. This is the value that is current up until the timestamp of change. Note that this\n // value might not be the current anymore since timestamp of change might have already passed.\n pub fn get_previous(self) -> (T, u64) {\n (self.pre, self.timestamp_of_change)\n }\n\n /// Returns the largest timestamp at which the value returned by `get_current_at` is known to remain the current\n /// value. This value is only meaningful in private where the proof is constructed against an anchor block, since\n /// due to its asynchronous nature private execution cannot know about any later scheduled changes.\n /// The caller of this function must know how quickly the value can change due to a scheduled change in the form of\n /// `minimum_delay`. If the delay itself is immutable, then this is just its duration. If the delay is mutable\n /// however, then this value is the 'effective minimum delay' (obtained by calling\n /// `ScheduledDelayChange.get_effective_minimum_delay_at`), which equals the minimum time in seconds that needs to\n /// elapse from the next block's timestamp until the value changes, regardless of further delay changes.\n /// The value returned by `get_current_at` in private when called with a anchor block's timestamp is only safe to use\n /// if the transaction's `expiration_timestamp` property is set to a value lower or equal to the time horizon\n /// computed using the same anchor timestamp.\n pub fn get_time_horizon(self, anchor_block_timestamp: u64, minimum_delay: u64) -> u64 {\n // The time horizon is the very last timestamp in which the current value is known. Any timestamp past the\n // horizon (i.e. with a timestamp larger than the time horizon) may have a different current value.\n // Reading the current value in private typically requires constraining the maximum valid timestamp to be equal\n // to the time horizon.\n if anchor_block_timestamp >= self.timestamp_of_change {\n // Once the timestamp of change has passed (block with timestamp >= timestamp_of_change was mined),\n // the current value (post) will not change unless a new value change is scheduled. This did not happen at\n // the anchor timestamp (or else it would not be greater or equal to the timestamp of change), and\n // therefore could only happen after the anchor timestamp. The earliest would be the immediate next\n // timestamp, and so the smallest possible next timestamp of change equals `anchor_block_timestamp + 1 +\n // minimum_delay`. Our time horizon is simply the previous timestamp to that one.\n //\n // timestamp of anchor\n // change timestamp time horizon\n // =======|=============N===================H===========>\n // ^ ^\n // ---------------------\n // minimum delay\n anchor_block_timestamp + minimum_delay\n } else {\n // If the timestamp of change has not yet been reached however, then there are two possible scenarios.\n // a) It could be so far into the future that the time horizon is actually determined by the minimum\n // delay, because a new change could be scheduled and take place _before_ the currently scheduled one.\n // This is similar to the scenario where the timestamp of change is in the past: the time horizon is\n // the timestamp prior to the earliest one in which a new timestamp of change might land.\n //\n // anchor\n // timestamp time horizon timestamp of change\n // =====N=================================H=================|=========>\n // ^ ^\n // | |\n // -----------------------------------\n // minimum delay\n //\n // b) It could be fewer than `minimum_delay` seconds away from the anchor timestamp, in which case\n // the timestamp of change would become the limiting factor for the time horizon, which would equal\n // the timestamp right before the timestamp of change (since by definition the value changes at the\n // timestamp of change).\n //\n // anchor time horizon\n // timestamp timestamp of change if not scheduled\n // =======N=============|===================H=================>\n // ^ ^ ^\n // | actual horizon |\n // -----------------------------------\n // minimum delay\n //\n // Note that the current implementation does not allow the caller to set the timestamp of change to an\n // arbitrary value, and therefore scenario a) is not currently possible. However implementing #5501 would\n // allow for this to happen.\n // Because anchor_block_timestamp < self.timestamp_of_change, then timestamp_of_change > 0 and we can safely\n // subtract 1.\n min(\n anchor_block_timestamp + minimum_delay,\n self.timestamp_of_change - 1,\n )\n }\n }\n\n /// Mutates the value by scheduling a change at the current timestamp. This function is only meaningful when\n /// called in public with the current timestamp.\n pub fn schedule_change(\n &mut self,\n new_value: T,\n current_timestamp: u64,\n minimum_delay: u64,\n timestamp_of_change: u64,\n ) {\n assert(timestamp_of_change >= current_timestamp + minimum_delay);\n\n self.pre = self.get_current_at(current_timestamp);\n self.post = new_value;\n self.timestamp_of_change = timestamp_of_change;\n }\n}\n\nimpl<T> Eq for ScheduledValueChange<T>\nwhere\n T: Eq,\n{\n fn eq(self, other: Self) -> bool {\n (self.pre == other.pre)\n & (self.post == other.post)\n & (self.timestamp_of_change == other.timestamp_of_change)\n }\n}\n\nimpl<T> Empty for ScheduledValueChange<T>\nwhere\n T: Empty,\n{\n fn empty() -> Self {\n Self { pre: T::empty(), post: T::empty(), timestamp_of_change: 0 }\n }\n}\n"
|
|
3550
2859
|
},
|
|
3551
|
-
"
|
|
2860
|
+
"389": {
|
|
3552
2861
|
"path": "/home/aztec-dev/aztec-packages/noir-projects/noir-protocol-circuits/crates/types/src/hash.nr",
|
|
3553
|
-
"source": "mod poseidon2_chunks;\n\nuse crate::{\n abis::{\n contract_class_function_leaf_preimage::ContractClassFunctionLeafPreimage,\n function_selector::FunctionSelector,\n note_hash::NoteHash,\n nullifier::Nullifier,\n private_log::{PrivateLog, PrivateLogData},\n transaction::tx_request::TxRequest,\n },\n address::{AztecAddress, EthAddress},\n constants::{\n CONTRACT_CLASS_LOG_SIZE_IN_FIELDS, DOM_SEP__NOTE_HASH_NONCE, DOM_SEP__OUTER_NULLIFIER,\n DOM_SEP__SILOED_NOTE_HASH, DOM_SEP__UNIQUE_NOTE_HASH, FUNCTION_TREE_HEIGHT,\n NULL_MSG_SENDER_CONTRACT_ADDRESS, TWO_POW_64,\n },\n merkle_tree::root_from_sibling_path,\n messaging::l2_to_l1_message::L2ToL1Message,\n poseidon2::Poseidon2Sponge,\n side_effect::{Counted, Scoped},\n traits::{FromField, Hash, ToField},\n utils::field::{field_from_bytes, field_from_bytes_32_trunc},\n};\n\npub use poseidon2_chunks::poseidon2_absorb_in_chunks_existing_sponge;\nuse poseidon2_chunks::poseidon2_absorb_in_chunks;\nuse std::embedded_curve_ops::EmbeddedCurveScalar;\n\n// TODO: refactor these into their own files: sha256, poseidon2, some protocol-specific hash computations, some merkle computations.\n\npub fn sha256_to_field<let N: u32>(bytes_to_hash: [u8; N]) -> Field {\n let sha256_hashed = sha256::digest(bytes_to_hash);\n let hash_in_a_field = field_from_bytes_32_trunc(sha256_hashed);\n\n hash_in_a_field\n}\n\npub fn private_functions_root_from_siblings(\n selector: FunctionSelector,\n vk_hash: Field,\n function_leaf_index: Field,\n function_leaf_sibling_path: [Field; FUNCTION_TREE_HEIGHT],\n) -> Field {\n let function_leaf_preimage = ContractClassFunctionLeafPreimage { selector, vk_hash };\n let function_leaf = function_leaf_preimage.hash();\n root_from_sibling_path(\n function_leaf,\n function_leaf_index,\n function_leaf_sibling_path,\n )\n}\n\npub fn compute_note_hash_nonce(first_nullifier_in_tx: Field, note_index_in_tx: u32) -> Field {\n // Hashing the first nullifier with note index in tx is guaranteed to be unique (because all nullifiers are also\n // unique).\n poseidon2_hash_with_separator(\n [first_nullifier_in_tx, note_index_in_tx as Field],\n DOM_SEP__NOTE_HASH_NONCE,\n )\n}\n\npub fn compute_unique_note_hash(note_nonce: Field, siloed_note_hash: Field) -> Field {\n let inputs = [note_nonce, siloed_note_hash];\n poseidon2_hash_with_separator(inputs, DOM_SEP__UNIQUE_NOTE_HASH)\n}\n\npub fn compute_note_nonce_and_unique_note_hash(\n siloed_note_hash: Field,\n first_nullifier: Field,\n note_index_in_tx: u32,\n) -> Field {\n let note_nonce = compute_note_hash_nonce(first_nullifier, note_index_in_tx);\n compute_unique_note_hash(note_nonce, siloed_note_hash)\n}\n\npub fn compute_siloed_note_hash(contract_address: AztecAddress, note_hash: Field) -> Field {\n poseidon2_hash_with_separator(\n [contract_address.to_field(), note_hash],\n DOM_SEP__SILOED_NOTE_HASH,\n )\n}\n\n/// Computes unique, siloed note hashes from siloed note hashes.\n///\n/// The protocol injects uniqueness into every note_hash, so that every single note_hash in the\n/// tree is unique. This prevents faerie gold attacks, where a malicious sender could create\n/// two identical note_hashes for a recipient (meaning only one would be nullifiable in future).\n///\n/// Most privacy protocols will inject the note's leaf_index (its position in the Note Hashes Tree)\n/// into the note, but this requires the creator of a note to wait until their tx is included in\n/// a block to know the note's final note hash (the unique, siloed note hash), because inserting\n/// leaves into trees is the job of a block producer.\n///\n/// We took a different approach so that the creator of a note will know each note's unique, siloed\n/// note hash before broadcasting their tx to the network.\n/// (There was also a historical requirement relating to \"chained transactions\" -- a feature that\n/// Aztec Connect had to enable notes to be spent from distinct txs earlier in the same block,\n/// and hence before an archive block root had been established for that block -- but that feature\n/// was abandoned for the Aztec Network for having too many bad tradeoffs).\n///\n/// (\n/// Edit: it is no longer true that all final note_hashes will be known by the creator of a tx\n/// before they send it to the network. If a tx makes public function calls, then _revertible_\n/// note_hashes that are created in private will not be made unique in private by the Reset circuit,\n/// but will instead be made unique by the AVM, because the `note_index_in_tx` will not be known\n/// until the AVM has executed the public functions of the tx. (See an explanation in\n/// reset_output_composer.nr for why).\n/// For some such txs, the `note_index_in_tx` might still be predictable through simulation, but\n/// for txs whose public functions create a varying number of non-revertible notes (determined at\n/// runtime), the `note_index_in_tx` will not be deterministically derivable before submitting the\n/// tx to the network.\n/// )\n///\n/// We use the `first_nullifier` of a tx as a seed of uniqueness. We have a guarantee that there will\n/// always be at least one nullifier per tx, because the init circuit will create one if one isn't\n/// created naturally by any functions of the tx. (Search \"protocol_nullifier\").\n/// We combine the `first_nullifier` with the note's index (its position within this tx's new\n/// note_hashes array) (`note_index_in_tx`) to get a truly unique value to inject into a note, which\n/// we call a `note_nonce`.\npub fn compute_unique_siloed_note_hash(\n siloed_note_hash: Field,\n first_nullifier: Field,\n note_index_in_tx: u32,\n) -> Field {\n if siloed_note_hash == 0 {\n 0\n } else {\n compute_note_nonce_and_unique_note_hash(siloed_note_hash, first_nullifier, note_index_in_tx)\n }\n}\n\n/// Siloing in the context of Aztec refers to the process of hashing a note hash with a contract address (this way\n/// the note hash is scoped to a specific contract). This is used to prevent intermingling of notes between contracts.\npub fn silo_note_hash(note_hash: Scoped<Counted<NoteHash>>) -> Field {\n if note_hash.contract_address.is_zero() {\n 0\n } else {\n compute_siloed_note_hash(note_hash.contract_address, note_hash.innermost())\n }\n}\n\npub fn compute_siloed_nullifier(contract_address: AztecAddress, nullifier: Field) -> Field {\n poseidon2_hash_with_separator(\n [contract_address.to_field(), nullifier],\n DOM_SEP__OUTER_NULLIFIER,\n )\n}\n\npub fn silo_nullifier(nullifier: Scoped<Counted<Nullifier>>) -> Field {\n let value = nullifier.innermost().value;\n // Q: shouldn't we be checking whether the _whole_ scoped, counted, nullifier struct is empty?\n // A: We don't have to. The init and inner circuits add a contract address only to non-empty nullifiers.\n // So we know we should silo it if the contract address is not empty.\n if nullifier.contract_address.is_zero() {\n // Return `.value` instead of 0, because already-siloed nullifiers also have a zero\n // contract_address field, and we of course want to return that already-siloed nullifier\n // (we just don't want to silo it a second time).\n value\n } else {\n compute_siloed_nullifier(nullifier.contract_address, value)\n }\n}\n\npub fn create_protocol_nullifier(tx_request: TxRequest) -> Scoped<Counted<Nullifier>> {\n // The protocol nullifier is ascribed a special side-effect counter of 1. No other side-effect\n // can have counter 1 (see `validate_as_first_call` for that assertion).\n Nullifier { value: tx_request.hash(), note_hash: 0 }.count(1).scope(\n NULL_MSG_SENDER_CONTRACT_ADDRESS,\n )\n}\n\npub fn compute_siloed_private_log_field(contract_address: AztecAddress, field: Field) -> Field {\n poseidon2_hash([contract_address.to_field(), field])\n}\n\npub fn silo_private_log(private_log: Scoped<Counted<PrivateLogData>>) -> PrivateLog {\n let log = private_log.innermost().log;\n if private_log.contract_address.is_zero() {\n log\n } else {\n let mut fields = log.fields;\n fields[0] = compute_siloed_private_log_field(private_log.contract_address, fields[0]);\n PrivateLog::new(fields, log.length)\n }\n}\n\npub fn compute_contract_class_log_hash(log: [Field; CONTRACT_CLASS_LOG_SIZE_IN_FIELDS]) -> Field {\n poseidon2_hash(log)\n}\n\npub fn compute_app_siloed_secret_key(\n master_secret_key: EmbeddedCurveScalar,\n app_address: AztecAddress,\n app_secret_key_domain_separator: Field,\n) -> Field {\n poseidon2_hash_with_separator(\n [master_secret_key.hi, master_secret_key.lo, app_address.to_field()],\n app_secret_key_domain_separator,\n )\n}\n\npub fn compute_l2_to_l1_hash(\n contract_address: AztecAddress,\n recipient: EthAddress,\n content: Field,\n rollup_version_id: Field,\n chain_id: Field,\n) -> Field {\n let contract_address_bytes: [u8; 32] = contract_address.to_field().to_be_bytes();\n let recipient_bytes: [u8; 20] = recipient.to_be_bytes();\n let content_bytes: [u8; 32] = content.to_be_bytes();\n let rollup_version_id_bytes: [u8; 32] = rollup_version_id.to_be_bytes();\n let chain_id_bytes: [u8; 32] = chain_id.to_be_bytes();\n\n let mut bytes: [u8; 148] = std::mem::zeroed();\n for i in 0..32 {\n bytes[i] = contract_address_bytes[i];\n bytes[i + 32] = rollup_version_id_bytes[i];\n // 64 - 84 are for recipient.\n bytes[i + 84] = chain_id_bytes[i];\n bytes[i + 116] = content_bytes[i];\n }\n\n for i in 0..20 {\n bytes[64 + i] = recipient_bytes[i];\n }\n\n sha256_to_field(bytes)\n}\n\npub fn silo_l2_to_l1_message(\n msg: Scoped<L2ToL1Message>,\n rollup_version_id: Field,\n chain_id: Field,\n) -> Field {\n if msg.contract_address.is_zero() {\n 0\n } else {\n compute_l2_to_l1_hash(\n msg.contract_address,\n msg.inner.recipient,\n msg.inner.content,\n rollup_version_id,\n chain_id,\n )\n }\n}\n\n// TODO: consider a variant that enables domain separation with a u32 (we seem to have standardised u32s for domain separators)\n/// Computes sha256 hash of 2 input fields.\n///\n/// @returns A truncated field (i.e., the first byte is always 0).\npub fn accumulate_sha256(v0: Field, v1: Field) -> Field {\n // Concatenate two fields into 32 x 2 = 64 bytes\n let v0_as_bytes: [u8; 32] = v0.to_be_bytes();\n let v1_as_bytes: [u8; 32] = v1.to_be_bytes();\n let hash_input_flattened = v0_as_bytes.concat(v1_as_bytes);\n\n sha256_to_field(hash_input_flattened)\n}\n\npub fn poseidon2_hash<let N: u32>(inputs: [Field; N]) -> Field {\n poseidon::poseidon2::Poseidon2::hash(inputs, N)\n}\n\n#[no_predicates]\npub fn poseidon2_hash_with_separator<let N: u32, T>(inputs: [Field; N], separator: T) -> Field\nwhere\n T: ToField,\n{\n let inputs_with_separator = [separator.to_field()].concat(inputs);\n poseidon2_hash(inputs_with_separator)\n}\n\n/// Computes a Poseidon2 hash over a dynamic-length subarray of the given input.\n/// Only the first `in_len` fields of `input` are absorbed; any remaining fields are ignored.\n/// The caller is responsible for ensuring that the input is padded with zeros if required.\n#[no_predicates]\npub fn poseidon2_hash_subarray<let N: u32>(input: [Field; N], in_len: u32) -> Field {\n let mut sponge = poseidon2_absorb_in_chunks(input, in_len);\n sponge.squeeze()\n}\n\n// NB the below is the same as poseidon::poseidon2::Poseidon2::hash(), but replacing a range check with a bit check,\n// and absorbing in chunks of 3 below.\n#[no_predicates]\npub fn poseidon2_cheaper_variable_hash<let N: u32>(input: [Field; N], in_len: u32) -> Field {\n let mut sponge = poseidon2_absorb_in_chunks(input, in_len);\n sponge.squeeze()\n}\n\n// This function is unconstrained because it is intended to be used in unconstrained context only as\n// in constrained contexts it would be too inefficient.\npub unconstrained fn poseidon2_hash_with_separator_bounded_vec<let N: u32, T>(\n inputs: BoundedVec<Field, N>,\n separator: T,\n) -> Field\nwhere\n T: ToField,\n{\n let in_len = inputs.len() + 1;\n let iv: Field = (in_len as Field) * TWO_POW_64;\n let mut sponge = Poseidon2Sponge::new(iv);\n sponge.absorb(separator.to_field());\n\n for i in 0..inputs.len() {\n sponge.absorb(inputs.get(i));\n }\n\n sponge.squeeze()\n}\n\n#[no_predicates]\npub fn poseidon2_hash_bytes<let N: u32>(inputs: [u8; N]) -> Field {\n let mut fields = [0; (N + 30) / 31];\n let mut field_index = 0;\n let mut current_field = [0; 31];\n for i in 0..inputs.len() {\n let index = i % 31;\n current_field[index] = inputs[i];\n if index == 30 {\n fields[field_index] = field_from_bytes(current_field, false);\n current_field = [0; 31];\n field_index += 1;\n }\n }\n if field_index != fields.len() {\n fields[field_index] = field_from_bytes(current_field, false);\n }\n poseidon2_hash(fields)\n}\n\n#[test]\nfn poseidon_chunks_matches_fixed() {\n let in_len = 501;\n let mut input: [Field; 4096] = [0; 4096];\n let mut fixed_input = [3; 501];\n assert(in_len == fixed_input.len()); // sanity check\n for i in 0..in_len {\n input[i] = 3;\n }\n let sub_chunk_hash = poseidon2_hash_subarray(input, in_len);\n let fixed_len_hash = poseidon::poseidon2::Poseidon2::hash(fixed_input, fixed_input.len());\n assert(sub_chunk_hash == fixed_len_hash);\n}\n\n#[test]\nfn poseidon_chunks_matches_variable() {\n let in_len = 501;\n let mut input: [Field; 4096] = [0; 4096];\n for i in 0..in_len {\n input[i] = 3;\n }\n let variable_chunk_hash = poseidon2_cheaper_variable_hash(input, in_len);\n let variable_len_hash = poseidon::poseidon2::Poseidon2::hash(input, in_len);\n assert(variable_chunk_hash == variable_len_hash);\n}\n\n#[test]\nfn smoke_sha256_to_field() {\n let full_buffer = [\n 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24,\n 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47,\n 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70,\n 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93,\n 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112,\n 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130,\n 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148,\n 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159,\n ];\n let result = sha256_to_field(full_buffer);\n\n assert(result == 0x448ebbc9e1a31220a2f3830c18eef61b9bd070e5084b7fa2a359fe729184c7);\n\n // to show correctness of the current ver (truncate one byte) vs old ver (mod full bytes):\n let result_bytes = sha256::digest(full_buffer);\n let truncated_field = crate::utils::field::field_from_bytes_32_trunc(result_bytes);\n assert(truncated_field == result);\n let mod_res = result + (result_bytes[31] as Field);\n assert(mod_res == 0x448ebbc9e1a31220a2f3830c18eef61b9bd070e5084b7fa2a359fe729184e0);\n}\n\n#[test]\nfn compute_l2_l1_hash() {\n // All zeroes\n let hash_result =\n compute_l2_to_l1_hash(AztecAddress::from_field(0), EthAddress::zero(), 0, 0, 0);\n assert(hash_result == 0x3b18c58c739716e76429634a61375c45b3b5cd470c22ab6d3e14cee23dd992);\n\n // Non-zero case\n let hash_result = compute_l2_to_l1_hash(\n AztecAddress::from_field(1),\n EthAddress::from_field(3),\n 5,\n 2,\n 4,\n );\n assert(hash_result == 0xaab2a5828156782b12a1dc6f336e2bc627eb1b9514b02d511f66296990c050);\n}\n\n#[test]\nfn silo_l2_to_l1_message_matches_typescript() {\n let version = 4;\n let chainId = 5;\n\n let hash = silo_l2_to_l1_message(\n L2ToL1Message { recipient: EthAddress::from_field(1), content: 2 }.scope(\n AztecAddress::from_field(3),\n ),\n version,\n chainId,\n );\n\n // The following value was generated by `yarn-project/stdlib/src/hash/hash.test.ts`\n let hash_from_typescript = 0x0081edf209e087ad31b3fd24263698723d57190bd1d6e9fe056fc0c0a68ee661;\n\n assert_eq(hash, hash_from_typescript);\n}\n\n#[test]\nunconstrained fn poseidon2_hash_with_separator_bounded_vec_matches_non_bounded_vec_version() {\n let inputs = BoundedVec::<Field, 4>::from_array([1, 2, 3]);\n let separator = 42;\n\n // Hash using bounded vec version\n let bounded_result = poseidon2_hash_with_separator_bounded_vec(inputs, separator);\n\n // Hash using regular version\n let regular_result = poseidon2_hash_with_separator([1, 2, 3], separator);\n\n // Results should match\n assert_eq(bounded_result, regular_result);\n}\n"
|
|
2862
|
+
"source": "mod poseidon2_chunks;\n\nuse crate::{\n abis::{\n contract_class_function_leaf_preimage::ContractClassFunctionLeafPreimage,\n function_selector::FunctionSelector, nullifier::Nullifier, private_log::PrivateLog,\n transaction::tx_request::TxRequest,\n },\n address::{AztecAddress, EthAddress},\n constants::{\n CONTRACT_CLASS_LOG_SIZE_IN_FIELDS, DOM_SEP__NOTE_HASH_NONCE,\n DOM_SEP__PRIVATE_LOG_FIRST_FIELD, DOM_SEP__SILOED_NOTE_HASH, DOM_SEP__SILOED_NULLIFIER,\n DOM_SEP__UNIQUE_NOTE_HASH, FUNCTION_TREE_HEIGHT, NULL_MSG_SENDER_CONTRACT_ADDRESS,\n TWO_POW_64,\n },\n merkle_tree::root_from_sibling_path,\n messaging::l2_to_l1_message::L2ToL1Message,\n poseidon2::Poseidon2Sponge,\n side_effect::{Counted, Scoped},\n traits::{FromField, Hash, ToField},\n utils::field::{field_from_bytes, field_from_bytes_32_trunc},\n};\n\npub use poseidon2_chunks::poseidon2_absorb_in_chunks_existing_sponge;\nuse poseidon2_chunks::poseidon2_absorb_in_chunks;\nuse std::embedded_curve_ops::EmbeddedCurveScalar;\n\n// TODO: refactor these into their own files: sha256, poseidon2, some protocol-specific hash computations, some merkle computations.\n\npub fn sha256_to_field<let N: u32>(bytes_to_hash: [u8; N]) -> Field {\n let sha256_hashed = sha256::digest(bytes_to_hash);\n let hash_in_a_field = field_from_bytes_32_trunc(sha256_hashed);\n\n hash_in_a_field\n}\n\npub fn private_functions_root_from_siblings(\n selector: FunctionSelector,\n vk_hash: Field,\n function_leaf_index: Field,\n function_leaf_sibling_path: [Field; FUNCTION_TREE_HEIGHT],\n) -> Field {\n let function_leaf_preimage = ContractClassFunctionLeafPreimage { selector, vk_hash };\n let function_leaf = function_leaf_preimage.hash();\n root_from_sibling_path(\n function_leaf,\n function_leaf_index,\n function_leaf_sibling_path,\n )\n}\n\n/// Siloing in the context of Aztec refers to the process of hashing a note hash with a contract address (this way\n/// the note hash is scoped to a specific contract). This is used to prevent intermingling of notes between contracts.\npub fn compute_siloed_note_hash(contract_address: AztecAddress, note_hash: Field) -> Field {\n poseidon2_hash_with_separator(\n [contract_address.to_field(), note_hash],\n DOM_SEP__SILOED_NOTE_HASH,\n )\n}\n\n/// Computes unique, siloed note hashes from siloed note hashes.\n///\n/// The protocol injects uniqueness into every note_hash, so that every single note_hash in the\n/// tree is unique. This prevents faerie gold attacks, where a malicious sender could create\n/// two identical note_hashes for a recipient (meaning only one would be nullifiable in future).\n///\n/// Most privacy protocols will inject the note's leaf_index (its position in the Note Hashes Tree)\n/// into the note, but this requires the creator of a note to wait until their tx is included in\n/// a block to know the note's final note hash (the unique, siloed note hash), because inserting\n/// leaves into trees is the job of a block producer.\n///\n/// We took a different approach so that the creator of a note will know each note's unique, siloed\n/// note hash before broadcasting their tx to the network.\n/// (There was also a historical requirement relating to \"chained transactions\" -- a feature that\n/// Aztec Connect had to enable notes to be spent from distinct txs earlier in the same block,\n/// and hence before an archive block root had been established for that block -- but that feature\n/// was abandoned for the Aztec Network for having too many bad tradeoffs).\n///\n/// (\n/// Edit: it is no longer true that all final note_hashes will be known by the creator of a tx\n/// before they send it to the network. If a tx makes public function calls, then _revertible_\n/// note_hashes that are created in private will not be made unique in private by the Reset circuit,\n/// but will instead be made unique by the AVM, because the `note_index_in_tx` will not be known\n/// until the AVM has executed the public functions of the tx. (See an explanation in\n/// reset_output_composer.nr for why).\n/// For some such txs, the `note_index_in_tx` might still be predictable through simulation, but\n/// for txs whose public functions create a varying number of non-revertible notes (determined at\n/// runtime), the `note_index_in_tx` will not be deterministically derivable before submitting the\n/// tx to the network.\n/// )\n///\n/// We use the `first_nullifier` of a tx as a seed of uniqueness. We have a guarantee that there will\n/// always be at least one nullifier per tx, because the init circuit will create one if one isn't\n/// created naturally by any functions of the tx. (Search \"protocol_nullifier\").\n/// We combine the `first_nullifier` with the note's index (its position within this tx's new\n/// note_hashes array) (`note_index_in_tx`) to get a truly unique value to inject into a note, which\n/// we call a `note_nonce`.\npub fn compute_unique_note_hash(note_nonce: Field, siloed_note_hash: Field) -> Field {\n let inputs = [note_nonce, siloed_note_hash];\n poseidon2_hash_with_separator(inputs, DOM_SEP__UNIQUE_NOTE_HASH)\n}\n\npub fn compute_note_hash_nonce(first_nullifier_in_tx: Field, note_index_in_tx: u32) -> Field {\n // Hashing the first nullifier with note index in tx is guaranteed to be unique (because all nullifiers are also\n // unique).\n poseidon2_hash_with_separator(\n [first_nullifier_in_tx, note_index_in_tx as Field],\n DOM_SEP__NOTE_HASH_NONCE,\n )\n}\n\npub fn compute_note_nonce_and_unique_note_hash(\n siloed_note_hash: Field,\n first_nullifier: Field,\n note_index_in_tx: u32,\n) -> Field {\n let note_nonce = compute_note_hash_nonce(first_nullifier, note_index_in_tx);\n compute_unique_note_hash(note_nonce, siloed_note_hash)\n}\n\npub fn compute_siloed_nullifier(contract_address: AztecAddress, nullifier: Field) -> Field {\n poseidon2_hash_with_separator(\n [contract_address.to_field(), nullifier],\n DOM_SEP__SILOED_NULLIFIER,\n )\n}\n\npub fn create_protocol_nullifier(tx_request: TxRequest) -> Scoped<Counted<Nullifier>> {\n // The protocol nullifier is ascribed a special side-effect counter of 1. No other side-effect\n // can have counter 1 (see `validate_as_first_call` for that assertion).\n Nullifier { value: tx_request.hash(), note_hash: 0 }.count(1).scope(\n NULL_MSG_SENDER_CONTRACT_ADDRESS,\n )\n}\n\npub fn compute_siloed_private_log_first_field(\n contract_address: AztecAddress,\n field: Field,\n) -> Field {\n poseidon2_hash_with_separator(\n [contract_address.to_field(), field],\n DOM_SEP__PRIVATE_LOG_FIRST_FIELD,\n )\n}\n\npub fn compute_siloed_private_log(contract_address: AztecAddress, log: PrivateLog) -> PrivateLog {\n let mut fields = log.fields;\n fields[0] = compute_siloed_private_log_first_field(contract_address, fields[0]);\n PrivateLog::new(fields, log.length)\n}\n\npub fn compute_contract_class_log_hash(log: [Field; CONTRACT_CLASS_LOG_SIZE_IN_FIELDS]) -> Field {\n poseidon2_hash(log)\n}\n\npub fn compute_app_siloed_secret_key(\n master_secret_key: EmbeddedCurveScalar,\n app_address: AztecAddress,\n key_type_domain_separator: Field,\n) -> Field {\n poseidon2_hash_with_separator(\n [master_secret_key.hi, master_secret_key.lo, app_address.to_field()],\n key_type_domain_separator,\n )\n}\n\npub fn compute_l2_to_l1_message_hash(\n message: Scoped<L2ToL1Message>,\n rollup_version_id: Field,\n chain_id: Field,\n) -> Field {\n let contract_address_bytes: [u8; 32] = message.contract_address.to_field().to_be_bytes();\n let recipient_bytes: [u8; 20] = message.inner.recipient.to_be_bytes();\n let content_bytes: [u8; 32] = message.inner.content.to_be_bytes();\n let rollup_version_id_bytes: [u8; 32] = rollup_version_id.to_be_bytes();\n let chain_id_bytes: [u8; 32] = chain_id.to_be_bytes();\n\n let mut bytes: [u8; 148] = std::mem::zeroed();\n for i in 0..32 {\n bytes[i] = contract_address_bytes[i];\n bytes[i + 32] = rollup_version_id_bytes[i];\n // 64 - 84 are for recipient.\n bytes[i + 84] = chain_id_bytes[i];\n bytes[i + 116] = content_bytes[i];\n }\n\n for i in 0..20 {\n bytes[64 + i] = recipient_bytes[i];\n }\n\n sha256_to_field(bytes)\n}\n\n// TODO: consider a variant that enables domain separation with a u32 (we seem to have standardised u32s for domain separators)\n/// Computes sha256 hash of 2 input fields.\n///\n/// @returns A truncated field (i.e., the first byte is always 0).\npub fn accumulate_sha256(v0: Field, v1: Field) -> Field {\n // Concatenate two fields into 32 x 2 = 64 bytes\n let v0_as_bytes: [u8; 32] = v0.to_be_bytes();\n let v1_as_bytes: [u8; 32] = v1.to_be_bytes();\n let hash_input_flattened = v0_as_bytes.concat(v1_as_bytes);\n\n sha256_to_field(hash_input_flattened)\n}\n\npub fn poseidon2_hash<let N: u32>(inputs: [Field; N]) -> Field {\n poseidon::poseidon2::Poseidon2::hash(inputs, N)\n}\n\n#[no_predicates]\npub fn poseidon2_hash_with_separator<let N: u32, T>(inputs: [Field; N], separator: T) -> Field\nwhere\n T: ToField,\n{\n let inputs_with_separator = [separator.to_field()].concat(inputs);\n poseidon2_hash(inputs_with_separator)\n}\n\n/// Computes a Poseidon2 hash over a dynamic-length subarray of the given input.\n/// Only the first `in_len` fields of `input` are absorbed; any remaining fields are ignored.\n/// The caller is responsible for ensuring that the input is padded with zeros if required.\n#[no_predicates]\npub fn poseidon2_hash_subarray<let N: u32>(input: [Field; N], in_len: u32) -> Field {\n let mut sponge = poseidon2_absorb_in_chunks(input, in_len);\n sponge.squeeze()\n}\n\n// This function is unconstrained because it is intended to be used in unconstrained context only as\n// in constrained contexts it would be too inefficient.\npub unconstrained fn poseidon2_hash_with_separator_bounded_vec<let N: u32, T>(\n inputs: BoundedVec<Field, N>,\n separator: T,\n) -> Field\nwhere\n T: ToField,\n{\n let in_len = inputs.len() + 1;\n let iv: Field = (in_len as Field) * TWO_POW_64;\n let mut sponge = Poseidon2Sponge::new(iv);\n sponge.absorb(separator.to_field());\n\n for i in 0..inputs.len() {\n sponge.absorb(inputs.get(i));\n }\n\n sponge.squeeze()\n}\n\n#[no_predicates]\npub fn poseidon2_hash_bytes<let N: u32>(inputs: [u8; N]) -> Field {\n let mut fields = [0; (N + 30) / 31];\n let mut field_index = 0;\n let mut current_field = [0; 31];\n for i in 0..inputs.len() {\n let index = i % 31;\n current_field[index] = inputs[i];\n if index == 30 {\n fields[field_index] = field_from_bytes(current_field, false);\n current_field = [0; 31];\n field_index += 1;\n }\n }\n if field_index != fields.len() {\n fields[field_index] = field_from_bytes(current_field, false);\n }\n poseidon2_hash(fields)\n}\n\n#[test]\nfn subarray_hash_matches_fixed() {\n let values_to_hash = [3; 17];\n let padded = values_to_hash.concat([0; 11]);\n let subarray_hash = poseidon2_hash_subarray(padded, values_to_hash.len());\n\n // Hash the entire values_to_hash.\n let fixed_len_hash = poseidon::poseidon2::Poseidon2::hash(values_to_hash, values_to_hash.len());\n\n assert_eq(subarray_hash, fixed_len_hash);\n}\n\n#[test]\nfn subarray_hash_matches_variable() {\n let values_to_hash = [3; 17];\n let padded = values_to_hash.concat([0; 11]);\n let subarray_hash = poseidon2_hash_subarray(padded, values_to_hash.len());\n\n // Hash up to values_to_hash.len() fields of the padded array.\n let variable_len_hash = poseidon::poseidon2::Poseidon2::hash(padded, values_to_hash.len());\n\n assert_eq(subarray_hash, variable_len_hash);\n}\n\n#[test]\nfn smoke_sha256_to_field() {\n let full_buffer = [\n 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24,\n 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47,\n 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70,\n 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93,\n 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112,\n 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130,\n 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148,\n 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159,\n ];\n let result = sha256_to_field(full_buffer);\n\n assert(result == 0x448ebbc9e1a31220a2f3830c18eef61b9bd070e5084b7fa2a359fe729184c7);\n\n // to show correctness of the current ver (truncate one byte) vs old ver (mod full bytes):\n let result_bytes = sha256::digest(full_buffer);\n let truncated_field = crate::utils::field::field_from_bytes_32_trunc(result_bytes);\n assert(truncated_field == result);\n let mod_res = result + (result_bytes[31] as Field);\n assert(mod_res == 0x448ebbc9e1a31220a2f3830c18eef61b9bd070e5084b7fa2a359fe729184e0);\n}\n\n#[test]\nfn unique_siloed_note_hash_matches_typescript() {\n let inner_note_hash = 1;\n let contract_address = AztecAddress::from_field(2);\n let first_nullifier = 3;\n let note_index_in_tx = 4;\n\n let siloed_note_hash = compute_siloed_note_hash(contract_address, inner_note_hash);\n let siloed_note_hash_from_ts =\n 0x1986a4bea3eddb1fff917d629a13e10f63f514f401bdd61838c6b475db949169;\n assert_eq(siloed_note_hash, siloed_note_hash_from_ts);\n\n let nonce: Field = compute_note_hash_nonce(first_nullifier, note_index_in_tx);\n let note_hash_nonce_from_ts =\n 0x28e7799791bf066a57bb51fdd0fbcaf3f0926414314c7db515ea343f44f5d58b;\n assert_eq(nonce, note_hash_nonce_from_ts);\n\n let unique_siloed_note_hash_from_nonce = compute_unique_note_hash(nonce, siloed_note_hash);\n let unique_siloed_note_hash = compute_note_nonce_and_unique_note_hash(\n siloed_note_hash,\n first_nullifier,\n note_index_in_tx,\n );\n assert_eq(unique_siloed_note_hash_from_nonce, unique_siloed_note_hash);\n\n let unique_siloed_note_hash_from_ts =\n 0x29949aef207b715303b24639737c17fbfeb375c1d965ecfa85c7e4f0febb7d16;\n assert_eq(unique_siloed_note_hash, unique_siloed_note_hash_from_ts);\n}\n\n#[test]\nfn siloed_nullifier_matches_typescript() {\n let contract_address = AztecAddress::from_field(123);\n let nullifier = 456;\n\n let res = compute_siloed_nullifier(contract_address, nullifier);\n\n let siloed_nullifier_from_ts =\n 0x169b50336c1f29afdb8a03d955a81e485f5ac7d5f0b8065673d1e407e5877813;\n\n assert_eq(res, siloed_nullifier_from_ts);\n}\n\n#[test]\nfn siloed_private_log_first_field_matches_typescript() {\n let contract_address = AztecAddress::from_field(123);\n let field = 456;\n let res = compute_siloed_private_log_first_field(contract_address, field);\n\n let siloed_private_log_first_field_from_ts =\n 0x29480984f7b9257fded523d50addbcfc8d1d33adcf2db73ef3390a8fd5cdffaa;\n\n assert_eq(res, siloed_private_log_first_field_from_ts);\n}\n\n#[test]\nfn empty_l2_to_l1_message_hash_matches_typescript() {\n // All zeroes\n let res = compute_l2_to_l1_message_hash(\n L2ToL1Message { recipient: EthAddress::zero(), content: 0 }.scope(AztecAddress::from_field(\n 0,\n )),\n 0,\n 0,\n );\n\n let empty_l2_to_l1_msg_hash_from_ts =\n 0x003b18c58c739716e76429634a61375c45b3b5cd470c22ab6d3e14cee23dd992;\n\n assert_eq(res, empty_l2_to_l1_msg_hash_from_ts);\n}\n\n#[test]\nfn l2_to_l1_message_hash_matches_typescript() {\n let message = L2ToL1Message { recipient: EthAddress::from_field(1), content: 2 }.scope(\n AztecAddress::from_field(3),\n );\n let version = 4;\n let chainId = 5;\n\n let hash = compute_l2_to_l1_message_hash(message, version, chainId);\n\n // The following value was generated by `yarn-project/stdlib/src/hash/hash.test.ts`\n let l2_to_l1_message_hash_from_ts =\n 0x0081edf209e087ad31b3fd24263698723d57190bd1d6e9fe056fc0c0a68ee661;\n\n assert_eq(hash, l2_to_l1_message_hash_from_ts);\n}\n\n#[test]\nunconstrained fn poseidon2_hash_with_separator_bounded_vec_matches_non_bounded_vec_version() {\n let inputs = BoundedVec::<Field, 4>::from_array([1, 2, 3]);\n let separator = 42;\n\n // Hash using bounded vec version\n let bounded_result = poseidon2_hash_with_separator_bounded_vec(inputs, separator);\n\n // Hash using regular version\n let regular_result = poseidon2_hash_with_separator([1, 2, 3], separator);\n\n // Results should match\n assert_eq(bounded_result, regular_result);\n}\n"
|
|
3554
2863
|
},
|
|
3555
|
-
"
|
|
3556
|
-
"path": "/home/aztec-dev/aztec-packages/noir-projects/noir-protocol-circuits/crates/types/src/
|
|
3557
|
-
"source": "use utils::derive_serialization_quotes;\n\npub mod utils;\n\n/// Generates the generic parameter declarations for a struct's trait implementation.\n///\n/// This function takes a struct type definition and generates the generic parameter declarations\n/// that go after the `impl` keyword. For example, given a struct with generics `N: u32` and `T`,\n/// it generates `<let N: u32, T>`.\n///\n/// # Parameters\n/// - `s`: The struct type definition to generate generic declarations for\n///\n/// # Returns\n/// A quoted code block containing the generic parameter declarations, or an empty quote if the struct\n/// has no generic parameters\n///\n/// # Example\n/// For a struct defined as:\n/// ```\n/// struct Container<T, let N: u32> {\n/// items: [T; N],\n/// count: u32\n/// }\n/// ```\n///\n/// This function generates:\n/// ```\n/// <let N: u32, T>\n/// ```\ncomptime fn get_generics_declarations(s: TypeDefinition) -> Quoted {\n let generics = s.generics();\n\n if generics.len() > 0 {\n let generics_declarations_items = generics\n .map(|(name, maybe_integer_typ)| {\n // The second item in the generics tuple is an Option of an integer type that is Some only if\n // the generic is numeric.\n if maybe_integer_typ.is_some() {\n // The generic is numeric, so we return a quote defined as e.g. \"let N: u32\"\n let integer_type = maybe_integer_typ.unwrap();\n quote {let $name: $integer_type}\n } else {\n // The generic is not numeric, so we return a quote containing the name of the generic (e.g. \"T\")\n quote {$name}\n }\n })\n .join(quote {,});\n quote {<$generics_declarations_items>}\n } else {\n // The struct doesn't have any generics defined, so we just return an empty quote.\n quote {}\n }\n}\n\n/// Generates the `where` clause for a trait implementation that constrains non-numeric generic type parameters.\n///\n/// This function takes a struct type definition and a trait name, and generates a `where` clause that\n/// requires all non-numeric generic type parameters to implement the specified trait.\n///\n/// # Parameters\n/// - `s`: The struct type definition to generate the where clause for\n/// - `trait_name`: The name of the trait that non-numeric generic parameters must implement\n///\n/// # Returns\n/// A quoted code block containing the where clause, or an empty quote if the struct has no non-numeric\n/// generic parameters\n///\n/// # Example\n/// For a struct defined as:\n/// ```\n/// struct Container<T, let N: u32> {\n/// items: [T; N],\n/// count: u32\n/// }\n/// ```\n///\n/// And trait name \"Serialize\", this function generates:\n/// ```\n/// where T: Serialize\n/// ```\ncomptime fn get_where_trait_clause(s: TypeDefinition, trait_name: Quoted) -> Quoted {\n let generics = s.generics();\n\n // The second item in the generics tuple is an Option of an integer type that is Some only if the generic is\n // numeric.\n let non_numeric_generics =\n generics.filter(|(_, maybe_integer_typ)| maybe_integer_typ.is_none());\n\n if non_numeric_generics.len() > 0 {\n let non_numeric_generics_declarations =\n non_numeric_generics.map(|(name, _)| quote {$name: $trait_name}).join(quote {,});\n quote {where $non_numeric_generics_declarations}\n } else {\n // There are no non-numeric generics, so we return an empty quote.\n quote {}\n }\n}\n\n/// Generates a `Serialize` trait implementation for a struct type.\n///\n/// # Parameters\n/// - `s`: The struct type definition to generate the implementation for\n///\n/// # Returns\n/// A quoted code block containing the trait implementation\n///\n/// # Example\n/// For a struct defined as:\n/// ```\n/// struct Log<N> {\n/// fields: [Field; N],\n/// length: u32\n/// }\n/// ```\n///\n/// This function generates code equivalent to:\n/// ```\n/// impl<let N: u32> Serialize for Log<N> {\n/// let N: u32 = <[Field; N] as Serialize>::N + <u32 as Serialize>::N;\n///\n/// #[inline_always]\n/// fn serialize(self) -> [Field; Self::N] {\n/// let mut serialized_params = [0; _];\n/// let mut offset = 0;\n///\n/// let serialized_member = Serialize::serialize(self.fields);\n/// let serialized_member_len = <[Field; N] as Serialize>::N;\n/// for i in 0..serialized_member_len {\n/// serialized_params[i + offset] = serialized_member[i];\n/// }\n/// offset += serialized_member_len;\n///\n/// let serialized_member = Serialize::serialize(self.length);\n/// let serialized_member_len = <u32 as Serialize>::N;\n/// for i in 0..serialized_member_len {\n/// serialized_params[i + offset] = serialized_member[i];\n/// }\n/// offset += serialized_member_len;\n///\n/// serialized_params\n/// }\n/// }\n/// ```\npub comptime fn derive_serialize(s: TypeDefinition) -> Quoted {\n let typ = s.as_type();\n let nested_struct = typ.as_data_type().unwrap();\n\n // We care only about the name and type so we drop the last item of the tuple\n let params = nested_struct.0.fields(nested_struct.1).map(|(name, typ, _)| (name, typ));\n\n // Generates the generic parameter declarations (to be placed after the `impl` keyword) and the `where` clause\n // for the `Serialize` trait.\n let generics_declarations = get_generics_declarations(s);\n let where_serialize_clause = get_where_trait_clause(s, quote {Serialize});\n\n let (function_body, params_len_quote, serialized_params_name) =\n derive_serialization_quotes(params, true);\n\n quote {\n impl$generics_declarations $crate::traits::Serialize for $typ\n $where_serialize_clause\n {\n let N: u32 = $params_len_quote;\n\n #[inline_always]\n fn serialize(self) -> [Field; Self::N] {\n $function_body\n\n $serialized_params_name\n }\n }\n }\n}\n\n/// Generates a `Deserialize` trait implementation for a given struct `s`.\n///\n/// # Arguments\n/// * `s` - The struct type definition to generate the implementation for\n///\n/// # Returns\n/// A `Quoted` block containing the generated trait implementation\n///\n/// # Requirements\n/// Each struct member type must implement the `Deserialize` trait (it gets used in the generated code).\n///\n/// # Example\n/// For a struct like:\n/// ```\n/// struct MyStruct {\n/// x: AztecAddress,\n/// y: Field,\n/// }\n/// ```\n///\n/// This generates:\n/// ```\n/// impl Deserialize for MyStruct {\n/// let N: u32 = <AztecAddress as Deserialize>::N + <Field as Deserialize>::N;\n///\n/// fn deserialize(serialized: [Field; Self::N]) -> Self {\n/// let mut offset = 0;\n/// let mut member_fields = [0; <AztecAddress as Deserialize>::N];\n/// for i in 0..<AztecAddress as Deserialize>::N {\n/// member_fields[i] = serialized[i + offset];\n/// }\n/// let x = <AztecAddress as Deserialize>::deserialize(member_fields);\n/// offset += <AztecAddress as Deserialize>::N;\n///\n/// let mut member_fields = [0; <Field as Deserialize>::N];\n/// for i in 0..<Field as Deserialize>::N {\n/// member_fields[i] = serialized[i + offset];\n/// }\n/// let y = <Field as Deserialize>::deserialize(member_fields);\n/// offset += <Field as Deserialize>::N;\n///\n/// Self { x, y }\n/// }\n/// }\n/// ```\npub(crate) comptime fn derive_deserialize(s: TypeDefinition) -> Quoted {\n let typ = s.as_type();\n let nested_struct = typ.as_data_type().unwrap();\n let params = nested_struct.0.fields(nested_struct.1);\n\n // Generates the generic parameter declarations (to be placed after the `impl` keyword) and the `where` clause\n // for the `Deserialize` trait.\n let generics_declarations = get_generics_declarations(s);\n let where_deserialize_clause = get_where_trait_clause(s, quote {Deserialize});\n\n // The following will give us:\n // <type_of_struct_member_1 as Deserialize>::N + <type_of_struct_member_2 as Deserialize>::N + ...\n // (or 0 if the struct has no members)\n let right_hand_side_of_definition_of_n = if params.len() > 0 {\n params\n .map(|(_, param_type, _): (Quoted, Type, Quoted)| {\n quote {\n <$param_type as $crate::traits::Deserialize>::N\n }\n })\n .join(quote {+})\n } else {\n quote {0}\n };\n\n // For structs containing a single member, we can enhance performance by directly deserializing the input array,\n // bypassing the need for loop-based array construction. While this optimization yields significant benefits in\n // Brillig where the loops are expected to not be optimized, it is not relevant in ACIR where the loops are\n // expected to be optimized away.\n let function_body = if params.len() > 1 {\n // This generates deserialization code for each struct member and concatenates them together.\n let deserialization_of_struct_members = params\n .map(|(param_name, param_type, _): (Quoted, Type, Quoted)| {\n quote {\n let mut member_fields = [0; <$param_type as Deserialize>::N];\n for i in 0..<$param_type as Deserialize>::N {\n member_fields[i] = serialized[i + offset];\n }\n let $param_name = <$param_type as Deserialize>::deserialize(member_fields);\n offset += <$param_type as Deserialize>::N;\n }\n })\n .join(quote {});\n\n // We join the struct member names with a comma to be used in the `Self { ... }` syntax\n // This will give us e.g. `a, b, c` for a struct with three fields named `a`, `b`, and `c`.\n let struct_members = params\n .map(|(param_name, _, _): (Quoted, Type, Quoted)| quote { $param_name })\n .join(quote {,});\n\n quote {\n let mut offset = 0;\n\n $deserialization_of_struct_members\n\n Self { $struct_members }\n }\n } else if params.len() == 1 {\n let param_name = params[0].0;\n quote {\n Self { $param_name: $crate::traits::Deserialize::deserialize(serialized) }\n }\n } else {\n quote {\n Self {}\n }\n };\n\n quote {\n impl$generics_declarations $crate::traits::Deserialize for $typ\n $where_deserialize_clause\n {\n let N: u32 = $right_hand_side_of_definition_of_n;\n\n #[inline_always]\n fn deserialize(serialized: [Field; Self::N]) -> Self {\n $function_body\n }\n }\n }\n}\n\n/// Generates a `Packable` trait implementation for a given struct `s`.\n///\n/// # Arguments\n/// * `s` - The struct type definition to generate the implementation for\n///\n/// # Returns\n/// A `Quoted` block containing the generated trait implementation\n///\n/// # Requirements\n/// Each struct member type must implement the `Packable` trait (it gets used in the generated code).\n///\n/// # Example\n/// For a struct like:\n/// ```\n/// struct MyStruct {\n/// x: AztecAddress,\n/// y: Field,\n/// }\n/// ```\n///\n/// This generates:\n/// ```\n/// impl Packable for MyStruct {\n/// let N: u32 = 2;\n///\n/// fn pack(self) -> [Field; 2] {\n/// let mut result: [Field; 2] = [0_Field; 2];\n/// let mut offset: u32 = 0_u32;\n/// let packed_member: [Field; 1] = self.x.pack();\n/// let packed_member_len: u32 = <Field as Packable>::N;\n/// for i in 0_u32..packed_member_len {\n/// {\n/// result[i + offset] = packed_member[i];\n/// }\n/// }\n/// offset = offset + packed_member_len;\n/// let packed_member: [Field; 1] = self.y.pack();\n/// let packed_member_len: u32 = <Field as Packable>::N;\n/// for i in 0_u32..packed_member_len {\n/// {\n/// result[i + offset] = packed_member[i];\n/// }\n/// }\n/// offset = offset + packed_member_len;\n/// result\n/// }\n///\n/// fn unpack(packed: [Field; 2]) -> Self {\n/// let mut offset: u32 = 0_u32;\n/// let mut member_fields: [Field; 1] = [0_Field; 1];\n/// for i in 0_u32..<AztecAddress as Packable>::N {\n/// member_fields[i] = packed[i + offset];\n/// }\n/// let x: AztecAddress = <AztecAddress as Packable>::unpack(member_fields);\n/// offset = offset + <AztecAddress as Packable>::N;\n/// let mut member_fields: [Field; 1] = [0_Field; 1];\n/// for i in 0_u32..<Field as Packable>::N {\n/// member_fields[i] = packed[i + offset];\n/// }\n/// let y: Field = <Field as Packable>::unpack(member_fields);\n/// offset = offset + <Field as Packable>::N;\n/// Self { x: x, y: y }\n/// }\n/// }\n/// ```\npub comptime fn derive_packable(s: TypeDefinition) -> Quoted {\n let typ = s.as_type();\n let nested_struct = typ.as_data_type().unwrap();\n let params = nested_struct.0.fields(nested_struct.1);\n\n // Generates the generic parameter declarations (to be placed after the `impl` keyword) and the `where` clause\n // for the `Packable` trait.\n let generics_declarations = get_generics_declarations(s);\n let where_packable_clause = get_where_trait_clause(s, quote {Packable});\n\n // The following will give us:\n // <type_of_struct_member_1 as Packable>::N + <type_of_struct_member_2 as Packable>::N + ...\n // (or 0 if the struct has no members)\n let right_hand_side_of_definition_of_n = if params.len() > 0 {\n params\n .map(|(_, param_type, _): (Quoted, Type, Quoted)| {\n quote {\n <$param_type as $crate::traits::Packable>::N\n }\n })\n .join(quote {+})\n } else {\n quote {0}\n };\n\n // For structs containing a single member, we can enhance performance by directly returning the packed member,\n // bypassing the need for loop-based array construction. While this optimization yields significant benefits in\n // Brillig where the loops are expected to not be optimized, it is not relevant in ACIR where the loops are\n // expected to be optimized away.\n let pack_function_body = if params.len() > 1 {\n // For multiple struct members, generate packing code that:\n // 1. Packs each member\n // 2. Copies the packed fields into the result array at the correct offset\n // 3. Updates the offset for the next member\n let packing_of_struct_members = params\n .map(|(param_name, param_type, _): (Quoted, Type, Quoted)| {\n quote {\n let packed_member = $crate::traits::Packable::pack(self.$param_name);\n let packed_member_len = <$param_type as $crate::traits::Packable>::N;\n for i in 0..packed_member_len {\n result[i + offset] = packed_member[i];\n }\n offset += packed_member_len;\n }\n })\n .join(quote {});\n\n quote {\n let mut result = [0; Self::N];\n let mut offset = 0;\n\n $packing_of_struct_members\n\n result\n }\n } else if params.len() == 1 {\n let param_name = params[0].0;\n quote {\n $crate::traits::Packable::pack(self.$param_name)\n }\n } else {\n quote {\n [0; Self::N]\n }\n };\n\n // For structs containing a single member, we can enhance performance by directly unpacking the input array,\n // bypassing the need for loop-based array construction. While this optimization yields significant benefits in\n // Brillig where the loops are expected to not be optimized, it is not relevant in ACIR where the loops are\n // expected to be optimized away.\n let unpack_function_body = if params.len() > 1 {\n // For multiple struct members, generate unpacking code that:\n // 1. Unpacks each member\n // 2. Copies packed fields into member array at correct offset\n // 3. Updates offset for next member\n let unpacking_of_struct_members = params\n .map(|(param_name, param_type, _): (Quoted, Type, Quoted)| {\n quote {\n let mut member_fields = [0; <$param_type as $crate::traits::Packable>::N];\n for i in 0..<$param_type as $crate::traits::Packable>::N {\n member_fields[i] = packed[i + offset];\n }\n let $param_name = <$param_type as $crate::traits::Packable>::unpack(member_fields);\n offset += <$param_type as $crate::traits::Packable>::N;\n }\n })\n .join(quote {});\n\n // We join the struct member names with a comma to be used in the `Self { ... }` syntax\n let struct_members = params\n .map(|(param_name, _, _): (Quoted, Type, Quoted)| quote { $param_name })\n .join(quote {,});\n\n quote {\n let mut offset = 0;\n $unpacking_of_struct_members\n Self { $struct_members }\n }\n } else if params.len() == 1 {\n let param_name = params[0].0;\n quote {\n Self { $param_name: $crate::traits::Packable::unpack(packed) }\n }\n } else {\n quote {\n Self {}\n }\n };\n\n quote {\n impl$generics_declarations $crate::traits::Packable for $typ\n $where_packable_clause\n {\n let N: u32 = $right_hand_side_of_definition_of_n;\n\n #[inline_always]\n fn pack(self) -> [Field; Self::N] {\n $pack_function_body\n }\n\n #[inline_always]\n fn unpack(packed: [Field; Self::N]) -> Self {\n $unpack_function_body\n }\n }\n }\n}\n\nmod test {\n use crate::traits::{Deserialize, Packable, Serialize};\n\n #[derive(Deserialize, Eq, Packable, Serialize)]\n pub struct Empty {}\n\n #[derive(Deserialize, Eq, Packable, Serialize)]\n pub struct Smol {\n a: Field,\n b: Field,\n }\n\n #[derive(Deserialize, Eq, Serialize)]\n pub struct HasArray {\n a: [Field; 2],\n b: bool,\n }\n\n #[derive(Deserialize, Eq, Serialize)]\n pub struct Fancier {\n a: Smol,\n b: [Field; 2],\n c: [u8; 3],\n d: str<16>,\n }\n\n #[derive(Deserialize, Eq, Packable, Serialize)]\n pub struct HasArrayWithGenerics<T, let N: u32> {\n pub fields: [T; N],\n pub length: u32,\n }\n\n #[test]\n fn serde_on_empty() {\n let original = Empty {};\n let serialized = original.serialize();\n assert_eq(serialized, [], \"Serialized does not match empty array\");\n let deserialized = Empty::deserialize(serialized);\n assert_eq(deserialized, original, \"Deserialized does not match original\");\n }\n\n #[test]\n fn packable_on_empty() {\n let original = Empty {};\n let packed = original.pack();\n assert_eq(packed, [], \"Packed does not match empty array\");\n let unpacked = Empty::unpack(packed);\n assert_eq(unpacked, original, \"Unpacked does not match original\");\n }\n\n #[test]\n fn serde_on_smol() {\n let smol = Smol { a: 1, b: 2 };\n let serialized = smol.serialize();\n assert(serialized == [1, 2], serialized);\n let deserialized = Smol::deserialize(serialized);\n assert(deserialized == smol);\n\n // None of the struct members implements the `Packable` trait so the packed and serialized data should be the same\n let packed = smol.pack();\n assert_eq(packed, serialized, \"Packed does not match serialized\");\n }\n\n #[test]\n fn serde_on_has_array() {\n let has_array = HasArray { a: [1, 2], b: true };\n let serialized = has_array.serialize();\n assert(serialized == [1, 2, 1], serialized);\n let deserialized = HasArray::deserialize(serialized);\n assert(deserialized == has_array);\n }\n\n #[test]\n fn serde_on_fancier() {\n let fancier =\n Fancier { a: Smol { a: 1, b: 2 }, b: [0, 1], c: [1, 2, 3], d: \"metaprogramming!\" };\n let serialized = fancier.serialize();\n assert(\n serialized\n == [\n 1, 2, 0, 1, 1, 2, 3, 0x6d, 0x65, 0x74, 0x61, 0x70, 0x72, 0x6f, 0x67, 0x72, 0x61,\n 0x6d, 0x6d, 0x69, 0x6e, 0x67, 0x21,\n ],\n serialized,\n );\n let deserialized = Fancier::deserialize(serialized);\n assert(deserialized == fancier);\n }\n\n #[test]\n fn serde_on_contains_array_with_generics() {\n let struct_with_array_of_generics = HasArrayWithGenerics { fields: [1, 2, 3], length: 3 };\n let serialized = struct_with_array_of_generics.serialize();\n assert(serialized == [1, 2, 3, 3], serialized);\n let deserialized = HasArrayWithGenerics::deserialize(serialized);\n assert(deserialized == struct_with_array_of_generics);\n }\n\n #[test]\n fn packable_on_contains_array_with_generics() {\n let struct_with_array_of_generics = HasArrayWithGenerics { fields: [1, 2, 3], length: 3 };\n let packed = struct_with_array_of_generics.pack();\n assert(packed == [1, 2, 3, 3], packed);\n\n let unpacked = HasArrayWithGenerics::unpack(packed);\n assert(unpacked == struct_with_array_of_generics);\n }\n\n}\n"
|
|
3558
|
-
},
|
|
3559
|
-
"361": {
|
|
3560
|
-
"path": "/home/aztec-dev/aztec-packages/noir-projects/noir-protocol-circuits/crates/types/src/meta/utils.nr",
|
|
3561
|
-
"source": "/// Generates serialization code for a list of parameters and the total length of the serialized array\n///\n/// # Parameters\n/// - `params`: A list of (name, type) tuples to serialize\n/// - `use_self_prefix`: If true, parameters are accessed as `self.$param_name` (for struct members).\n/// If false, parameters are accessed directly as `$param_name` (for function parameters).\n///\n/// # Returns\n/// A tuple containing:\n/// - Quoted code that serializes the parameters into an array named `serialized_params`\n/// - Quoted code that evaluates to the total length of the serialized array\n/// - Quoted code containing the name of the serialized array\npub comptime fn derive_serialization_quotes(\n params: [(Quoted, Type)],\n use_self_prefix: bool,\n) -> (Quoted, Quoted, Quoted) {\n let prefix_quote = if use_self_prefix {\n quote { self. }\n } else {\n quote {}\n };\n\n let params_len_quote = get_params_len_quote(params);\n let serialized_params_name = quote { serialized_params };\n\n let body = if params.len() == 0 {\n quote {\n let $serialized_params_name: [Field; 0] = [];\n }\n } else if params.len() == 1 {\n // When we have only a single parameter on the input, we can enhance performance by directly returning\n // the serialized member, bypassing the need for loop-based array construction. While this optimization yields\n // significant benefits in Brillig where the loops are expected to not be optimized, it is not relevant in ACIR\n // where the loops are expected to be optimized away.\n\n let param_name = params[0].0;\n quote {\n let $serialized_params_name = $crate::traits::Serialize::serialize($prefix_quote$param_name);\n }\n } else {\n // For multiple struct members, generate serialization code that:\n // 1. Serializes each member\n // 2. Copies the serialized fields into the serialize array at the correct offset\n // 3. Updates the offset for the next member\n let serialization_of_struct_members = params\n .map(|(param_name, param_type): (Quoted, Type)| {\n quote {\n let serialized_member = $crate::traits::Serialize::serialize($prefix_quote$param_name);\n let serialized_member_len = <$param_type as $crate::traits::Serialize>::N;\n for i in 0..serialized_member_len {\n $serialized_params_name[i + offset] = serialized_member[i];\n }\n offset += serialized_member_len;\n }\n })\n .join(quote {});\n\n quote {\n let mut $serialized_params_name = [0; $params_len_quote];\n let mut offset = 0;\n\n $serialization_of_struct_members\n }\n };\n\n (body, params_len_quote, serialized_params_name)\n}\n\n/// Generates a quoted expression that computes the total serialized length of function parameters.\n///\n/// # Parameters\n/// * `params` - An array of tuples where each tuple contains a quoted parameter name and its Type. The type needs\n/// to implement the Serialize trait.\n///\n/// # Returns\n/// A quoted expression that evaluates to:\n/// * `0` if there are no parameters\n/// * `(<type1 as Serialize>::N + <type2 as Serialize>::N + ...)` for one or more parameters\npub comptime fn get_params_len_quote(params: [(Quoted, Type)]) -> Quoted {\n if params.len() == 0 {\n quote { 0 }\n } else {\n let params_quote_without_parentheses = params\n .map(|(_, param_type): (Quoted, Type)| {\n quote {\n <$param_type as $crate::traits::Serialize>::N\n }\n })\n .join(quote {+});\n quote { ($params_quote_without_parentheses) }\n }\n}\n"
|
|
2864
|
+
"391": {
|
|
2865
|
+
"path": "/home/aztec-dev/aztec-packages/noir-projects/noir-protocol-circuits/crates/types/src/logging.nr",
|
|
2866
|
+
"source": "// Log levels matching the JS logger:\n\n// global SILENT_LOG_LEVEL: u8 = 0;\nglobal FATAL_LOG_LEVEL: u8 = 1;\nglobal ERROR_LOG_LEVEL: u8 = 2;\nglobal WARN_LOG_LEVEL: u8 = 3;\nglobal INFO_LOG_LEVEL: u8 = 4;\nglobal VERBOSE_LOG_LEVEL: u8 = 5;\nglobal DEBUG_LOG_LEVEL: u8 = 6;\nglobal TRACE_LOG_LEVEL: u8 = 7;\n\n// --- Per-level log functions (no format args) ---\n\npub fn fatal_log<let N: u32>(msg: str<N>) {\n fatal_log_format(msg, []);\n}\n\npub fn error_log<let N: u32>(msg: str<N>) {\n error_log_format(msg, []);\n}\n\npub fn warn_log<let N: u32>(msg: str<N>) {\n warn_log_format(msg, []);\n}\n\npub fn info_log<let N: u32>(msg: str<N>) {\n info_log_format(msg, []);\n}\n\npub fn verbose_log<let N: u32>(msg: str<N>) {\n verbose_log_format(msg, []);\n}\n\npub fn debug_log<let N: u32>(msg: str<N>) {\n debug_log_format(msg, []);\n}\n\npub fn trace_log<let N: u32>(msg: str<N>) {\n trace_log_format(msg, []);\n}\n\n// --- Per-level log functions (with format args) ---\n\npub fn fatal_log_format<let M: u32, let N: u32>(msg: str<M>, args: [Field; N]) {\n log_format(FATAL_LOG_LEVEL, msg, args);\n}\n\npub fn error_log_format<let M: u32, let N: u32>(msg: str<M>, args: [Field; N]) {\n log_format(ERROR_LOG_LEVEL, msg, args);\n}\n\npub fn warn_log_format<let M: u32, let N: u32>(msg: str<M>, args: [Field; N]) {\n log_format(WARN_LOG_LEVEL, msg, args);\n}\n\npub fn info_log_format<let M: u32, let N: u32>(msg: str<M>, args: [Field; N]) {\n log_format(INFO_LOG_LEVEL, msg, args);\n}\n\npub fn verbose_log_format<let M: u32, let N: u32>(msg: str<M>, args: [Field; N]) {\n log_format(VERBOSE_LOG_LEVEL, msg, args);\n}\n\npub fn debug_log_format<let M: u32, let N: u32>(msg: str<M>, args: [Field; N]) {\n log_format(DEBUG_LOG_LEVEL, msg, args);\n}\n\npub fn trace_log_format<let M: u32, let N: u32>(msg: str<M>, args: [Field; N]) {\n log_format(TRACE_LOG_LEVEL, msg, args);\n}\n\nfn log_format<let M: u32, let N: u32>(log_level: u8, msg: str<M>, args: [Field; N]) {\n // Safety: This oracle call returns nothing: we only call it for its side effects. It is therefore always safe\n // to call.\n unsafe { log_oracle_wrapper(log_level, msg, args) };\n}\n\nunconstrained fn log_oracle_wrapper<let M: u32, let N: u32>(\n log_level: u8,\n msg: str<M>,\n args: [Field; N],\n) {\n log_oracle(log_level, msg, N, args);\n}\n\n#[oracle(aztec_utl_log)]\nunconstrained fn log_oracle<let M: u32, let N: u32>(\n log_level: u8,\n msg: str<M>,\n length: u32,\n args: [Field; N],\n) {}\n"
|
|
3562
2867
|
},
|
|
3563
|
-
"
|
|
2868
|
+
"405": {
|
|
3564
2869
|
"path": "/home/aztec-dev/aztec-packages/noir-projects/noir-protocol-circuits/crates/types/src/point.nr",
|
|
3565
|
-
"source": "pub use
|
|
2870
|
+
"source": "pub use std::embedded_curve_ops::EmbeddedCurvePoint as Point;\nuse crate::{hash::poseidon2_hash, traits::{Deserialize, Empty, Hash, Packable, Serialize}};\n\npub global POINT_LENGTH: u32 = 3;\n\nimpl Hash for Point {\n fn hash(self) -> Field {\n poseidon2_hash(self.serialize())\n }\n}\n\nimpl Empty for Point {\n /// Note: Does not return a valid point on curve - instead represents an empty/\"unpopulated\" point struct (e.g.\n /// empty/unpopulated value in an array of points).\n fn empty() -> Self {\n Point { x: 0, y: 0, is_infinite: false }\n }\n}\n\npub fn validate_on_curve(p: Point) {\n // y^2 == x^3 - 17\n let x = p.x;\n let y = p.y;\n if p.is_infinite {\n // Assert the canonical representation of infinity\n assert_eq(x, 0, \"Point at infinity should have canonical representation (0 0)\");\n assert_eq(y, 0, \"Point at infinity should have canonical representation (0 0)\");\n } else {\n assert_eq(y * y, x * x * x - 17, \"Point not on curve\");\n }\n}\n\n// TODO(#11356): use compact representation here.\nimpl Packable for Point {\n let N: u32 = POINT_LENGTH;\n\n fn pack(self) -> [Field; Self::N] {\n self.serialize()\n }\n\n fn unpack(packed: [Field; Self::N]) -> Self {\n Self::deserialize(packed)\n }\n}\n\nmod tests {\n use super::validate_on_curve;\n use std::embedded_curve_ops::EmbeddedCurvePoint as Point;\n\n #[test]\n unconstrained fn test_validate_on_curve_generator() {\n // The generator point should be on the curve\n let generator = Point::generator();\n validate_on_curve(generator);\n }\n\n #[test]\n unconstrained fn test_validate_on_curve_infinity() {\n // Canonical infinite point (x=0, y=0) should pass\n let infinity = Point { x: 0, y: 0, is_infinite: true };\n validate_on_curve(infinity);\n }\n\n #[test(should_fail_with = \"Point not on curve\")]\n unconstrained fn test_validate_on_curve_invalid_point() {\n // A point not on the curve should fail\n let invalid = Point { x: 1, y: 1, is_infinite: false };\n validate_on_curve(invalid);\n }\n\n #[test(should_fail_with = \"Point at infinity should have canonical representation (0 0)\")]\n unconstrained fn test_validate_on_curve_infinity_non_canonical_x() {\n // Infinite point with non-zero x should fail\n let invalid_infinity = Point { x: 1, y: 0, is_infinite: true };\n validate_on_curve(invalid_infinity);\n }\n\n #[test(should_fail_with = \"Point at infinity should have canonical representation (0 0)\")]\n unconstrained fn test_validate_on_curve_infinity_non_canonical_y() {\n // Infinite point with non-zero y should fail\n let invalid_infinity = Point { x: 0, y: 1, is_infinite: true };\n validate_on_curve(invalid_infinity);\n }\n}\n"
|
|
3566
2871
|
},
|
|
3567
|
-
"
|
|
3568
|
-
"path": "/
|
|
3569
|
-
"source": "use crate::
|
|
2872
|
+
"41": {
|
|
2873
|
+
"path": "std/option.nr",
|
|
2874
|
+
"source": "use crate::cmp::{Eq, Ord, Ordering};\nuse crate::default::Default;\nuse crate::hash::{Hash, Hasher};\n\npub struct Option<T> {\n _is_some: bool,\n _value: T,\n}\n\nimpl<T> Option<T> {\n /// Constructs a None value\n pub fn none() -> Self {\n Self { _is_some: false, _value: crate::mem::zeroed() }\n }\n\n /// Constructs a Some wrapper around the given value\n pub fn some(_value: T) -> Self {\n Self { _is_some: true, _value }\n }\n\n /// True if this Option is None\n pub fn is_none(self) -> bool {\n !self._is_some\n }\n\n /// True if this Option is Some\n pub fn is_some(self) -> bool {\n self._is_some\n }\n\n /// Asserts `self.is_some()` and returns the wrapped value.\n pub fn unwrap(self) -> T {\n assert(self._is_some);\n self._value\n }\n\n /// Returns the inner value without asserting `self.is_some()`\n /// Note that if `self` is `None`, there is no guarantee what value will be returned,\n /// only that it will be of type `T`.\n pub fn unwrap_unchecked(self) -> T {\n self._value\n }\n\n /// Returns the wrapped value if `self.is_some()`. Otherwise, returns the given default value.\n pub fn unwrap_or(self, default: T) -> T {\n if self._is_some {\n self._value\n } else {\n default\n }\n }\n\n /// Returns the wrapped value if `self.is_some()`. Otherwise, calls the given function to return\n /// a default value.\n pub fn unwrap_or_else<Env>(self, default: fn[Env]() -> T) -> T {\n if self._is_some {\n self._value\n } else {\n default()\n }\n }\n\n /// Asserts `self.is_some()` with a provided custom message and returns the contained `Some` value\n pub fn expect<let N: u32, MessageTypes>(self, message: fmtstr<N, MessageTypes>) -> T {\n assert(self.is_some(), message);\n self._value\n }\n\n /// If self is `Some(x)`, this returns `Some(f(x))`. Otherwise, this returns `None`.\n pub fn map<U, Env>(self, f: fn[Env](T) -> U) -> Option<U> {\n if self._is_some {\n Option::some(f(self._value))\n } else {\n Option::none()\n }\n }\n\n /// If self is `Some(x)`, this returns `f(x)`. Otherwise, this returns the given default value.\n pub fn map_or<U, Env>(self, default: U, f: fn[Env](T) -> U) -> U {\n if self._is_some {\n f(self._value)\n } else {\n default\n }\n }\n\n /// If self is `Some(x)`, this returns `f(x)`. Otherwise, this returns `default()`.\n pub fn map_or_else<U, Env1, Env2>(self, default: fn[Env1]() -> U, f: fn[Env2](T) -> U) -> U {\n if self._is_some {\n f(self._value)\n } else {\n default()\n }\n }\n\n /// Returns None if self is None. Otherwise, this returns `other`.\n pub fn and(self, other: Self) -> Self {\n if self.is_none() {\n Option::none()\n } else {\n other\n }\n }\n\n /// If self is None, this returns None. Otherwise, this calls the given function\n /// with the Some value contained within self, and returns the result of that call.\n ///\n /// In some languages this function is called `flat_map` or `bind`.\n pub fn and_then<U, Env>(self, f: fn[Env](T) -> Option<U>) -> Option<U> {\n if self._is_some {\n f(self._value)\n } else {\n Option::none()\n }\n }\n\n /// If self is Some, return self. Otherwise, return `other`.\n pub fn or(self, other: Self) -> Self {\n if self._is_some {\n self\n } else {\n other\n }\n }\n\n /// If self is Some, return self. Otherwise, return `default()`.\n pub fn or_else<Env>(self, default: fn[Env]() -> Self) -> Self {\n if self._is_some {\n self\n } else {\n default()\n }\n }\n\n // If only one of the two Options is Some, return that option.\n // Otherwise, if both options are Some or both are None, None is returned.\n pub fn xor(self, other: Self) -> Self {\n if self._is_some {\n if other._is_some {\n Option::none()\n } else {\n self\n }\n } else if other._is_some {\n other\n } else {\n Option::none()\n }\n }\n\n /// Returns `Some(x)` if self is `Some(x)` and `predicate(x)` is true.\n /// Otherwise, this returns `None`\n pub fn filter<Env>(self, predicate: fn[Env](T) -> bool) -> Self {\n if self._is_some {\n if predicate(self._value) {\n self\n } else {\n Option::none()\n }\n } else {\n Option::none()\n }\n }\n\n /// Flattens an Option<Option<T>> into a Option<T>.\n /// This returns None if the outer Option is None. Otherwise, this returns the inner Option.\n pub fn flatten(option: Option<Option<T>>) -> Option<T> {\n if option._is_some {\n option._value\n } else {\n Option::none()\n }\n }\n}\n\nimpl<T> Default for Option<T> {\n fn default() -> Self {\n Option::none()\n }\n}\n\nimpl<T> Eq for Option<T>\nwhere\n T: Eq,\n{\n fn eq(self, other: Self) -> bool {\n if self._is_some == other._is_some {\n if self._is_some {\n self._value == other._value\n } else {\n true\n }\n } else {\n false\n }\n }\n}\n\nimpl<T> Hash for Option<T>\nwhere\n T: Hash,\n{\n fn hash<H>(self, state: &mut H)\n where\n H: Hasher,\n {\n self._is_some.hash(state);\n if self._is_some {\n self._value.hash(state);\n }\n }\n}\n\n// For this impl we're declaring Option::none < Option::some\nimpl<T> Ord for Option<T>\nwhere\n T: Ord,\n{\n fn cmp(self, other: Self) -> Ordering {\n if self._is_some {\n if other._is_some {\n self._value.cmp(other._value)\n } else {\n Ordering::greater()\n }\n } else if other._is_some {\n Ordering::less()\n } else {\n Ordering::equal()\n }\n }\n}\n"
|
|
3570
2875
|
},
|
|
3571
|
-
"
|
|
2876
|
+
"413": {
|
|
3572
2877
|
"path": "/home/aztec-dev/aztec-packages/noir-projects/noir-protocol-circuits/crates/types/src/public_keys.nr",
|
|
3573
|
-
"source": "use crate::{\n address::public_keys_hash::PublicKeysHash,\n constants::{\n DEFAULT_IVPK_M_X, DEFAULT_IVPK_M_Y, DEFAULT_NPK_M_X, DEFAULT_NPK_M_Y, DEFAULT_OVPK_M_X,\n DEFAULT_OVPK_M_Y, DEFAULT_TPK_M_X, DEFAULT_TPK_M_Y, DOM_SEP__PUBLIC_KEYS_HASH,\n },\n hash::poseidon2_hash_with_separator,\n traits::{Deserialize, Hash, Serialize},\n};\n\nuse
|
|
2878
|
+
"source": "use crate::{\n address::public_keys_hash::PublicKeysHash,\n constants::{\n DEFAULT_IVPK_M_X, DEFAULT_IVPK_M_Y, DEFAULT_NPK_M_X, DEFAULT_NPK_M_Y, DEFAULT_OVPK_M_X,\n DEFAULT_OVPK_M_Y, DEFAULT_TPK_M_X, DEFAULT_TPK_M_Y, DOM_SEP__PUBLIC_KEYS_HASH,\n },\n hash::poseidon2_hash_with_separator,\n point::validate_on_curve,\n traits::{Deserialize, Hash, Serialize},\n};\n\nuse std::{default::Default, meta::derive};\nuse std::embedded_curve_ops::EmbeddedCurvePoint as Point;\n\npub trait ToPoint {\n fn to_point(self) -> Point;\n}\n\n#[derive(Deserialize, Eq, Serialize)]\npub struct NpkM {\n pub inner: Point,\n}\n\nimpl ToPoint for NpkM {\n fn to_point(self) -> Point {\n self.inner\n }\n}\n\n// Note: If we store npk_m_hash directly we can remove this trait implementation. See #8091\nimpl Hash for NpkM {\n fn hash(self) -> Field {\n self.inner.hash()\n }\n}\n\n#[derive(Deserialize, Eq, Serialize)]\npub struct IvpkM {\n pub inner: Point,\n}\n\nimpl ToPoint for IvpkM {\n fn to_point(self) -> Point {\n self.inner\n }\n}\n\n#[derive(Deserialize, Eq, Serialize)]\npub struct OvpkM {\n pub inner: Point,\n}\n\nimpl Hash for OvpkM {\n fn hash(self) -> Field {\n self.inner.hash()\n }\n}\n\nimpl ToPoint for OvpkM {\n fn to_point(self) -> Point {\n self.inner\n }\n}\n\n#[derive(Deserialize, Eq, Serialize)]\npub struct TpkM {\n pub inner: Point,\n}\n\nimpl ToPoint for TpkM {\n fn to_point(self) -> Point {\n self.inner\n }\n}\n\n#[derive(Deserialize, Eq, Serialize)]\npub struct PublicKeys {\n pub npk_m: NpkM,\n pub ivpk_m: IvpkM,\n pub ovpk_m: OvpkM,\n pub tpk_m: TpkM,\n}\n\nimpl Default for PublicKeys {\n fn default() -> Self {\n PublicKeys {\n npk_m: NpkM {\n inner: Point { x: DEFAULT_NPK_M_X, y: DEFAULT_NPK_M_Y, is_infinite: false },\n },\n ivpk_m: IvpkM {\n inner: Point { x: DEFAULT_IVPK_M_X, y: DEFAULT_IVPK_M_Y, is_infinite: false },\n },\n ovpk_m: OvpkM {\n inner: Point { x: DEFAULT_OVPK_M_X, y: DEFAULT_OVPK_M_Y, is_infinite: false },\n },\n tpk_m: TpkM {\n inner: Point { x: DEFAULT_TPK_M_X, y: DEFAULT_TPK_M_Y, is_infinite: false },\n },\n }\n }\n}\n\nimpl PublicKeys {\n pub fn hash(self) -> PublicKeysHash {\n PublicKeysHash::from_field(poseidon2_hash_with_separator(\n self.serialize(),\n DOM_SEP__PUBLIC_KEYS_HASH as Field,\n ))\n }\n\n pub fn validate_on_curve(self) {\n validate_on_curve(self.npk_m.inner);\n validate_on_curve(self.ivpk_m.inner);\n validate_on_curve(self.ovpk_m.inner);\n validate_on_curve(self.tpk_m.inner);\n }\n}\n\npub struct AddressPoint {\n pub inner: Point,\n}\n\nimpl ToPoint for AddressPoint {\n fn to_point(self) -> Point {\n self.inner\n }\n}\n\nmod test {\n use crate::{\n point::POINT_LENGTH,\n public_keys::{IvpkM, NpkM, OvpkM, PublicKeys, TpkM},\n traits::{Deserialize, Serialize},\n };\n use std::embedded_curve_ops::EmbeddedCurvePoint as Point;\n\n #[test]\n unconstrained fn compute_public_keys_hash() {\n let keys = PublicKeys {\n npk_m: NpkM { inner: Point { x: 1, y: 2, is_infinite: false } },\n ivpk_m: IvpkM { inner: Point { x: 3, y: 4, is_infinite: false } },\n ovpk_m: OvpkM { inner: Point { x: 5, y: 6, is_infinite: false } },\n tpk_m: TpkM { inner: Point { x: 7, y: 8, is_infinite: false } },\n };\n\n let actual = keys.hash();\n\n // The following value was generated by `public_keys.test.ts`.\n let expected_public_keys_hash =\n 0x056998309f6c119e4d753e404f94fef859dddfa530a9379634ceb0854b29bf7a;\n\n assert(actual.to_field() == expected_public_keys_hash);\n }\n\n #[test]\n unconstrained fn compute_default_hash() {\n let keys = PublicKeys::default();\n\n let actual = keys.hash();\n\n // The following value was generated by `public_keys.test.ts`.\n let test_data_default_hash =\n 0x023547e676dba19784188825b901a0e70d8ad978300d21d6185a54281b734da0;\n\n assert(actual.to_field() == test_data_default_hash);\n }\n\n #[test]\n unconstrained fn serde() {\n let keys = PublicKeys {\n npk_m: NpkM { inner: Point { x: 1, y: 2, is_infinite: false } },\n ivpk_m: IvpkM { inner: Point { x: 3, y: 4, is_infinite: false } },\n ovpk_m: OvpkM { inner: Point { x: 5, y: 6, is_infinite: false } },\n tpk_m: TpkM { inner: Point { x: 7, y: 8, is_infinite: false } },\n };\n\n // We use the PUBLIC_KEYS_LENGTH constant to ensure that there is a match between the derived trait\n let serialized: [Field; POINT_LENGTH * 4] = keys.serialize();\n let deserialized = PublicKeys::deserialize(serialized);\n\n assert_eq(keys, deserialized);\n }\n}\n"
|
|
3574
2879
|
},
|
|
3575
|
-
"
|
|
2880
|
+
"418": {
|
|
3576
2881
|
"path": "/home/aztec-dev/aztec-packages/noir-projects/noir-protocol-circuits/crates/types/src/storage/map.nr",
|
|
3577
|
-
"source": "use crate::{
|
|
2882
|
+
"source": "use crate::{\n constants::DOM_SEP__PUBLIC_STORAGE_MAP_SLOT, hash::poseidon2_hash_with_separator,\n traits::ToField,\n};\n\n// TODO: Move this to src/public_data/storage/map.nr\npub fn derive_storage_slot_in_map<K>(storage_slot: Field, key: K) -> Field\nwhere\n K: ToField,\n{\n poseidon2_hash_with_separator(\n [storage_slot, key.to_field()],\n DOM_SEP__PUBLIC_STORAGE_MAP_SLOT,\n )\n}\n\nmod test {\n use crate::{address::AztecAddress, storage::map::derive_storage_slot_in_map, traits::FromField};\n\n #[test]\n fn test_derive_storage_slot_in_map_matches_typescript() {\n let map_slot = 0x132258fb6962c4387ba659d9556521102d227549a386d39f0b22d1890d59c2b5;\n let key = AztecAddress::from_field(\n 0x302dbc2f9b50a73283d5fb2f35bc01eae8935615817a0b4219a057b2ba8a5a3f,\n );\n\n let slot = derive_storage_slot_in_map(map_slot, key);\n\n // The following value was generated by `map_slot.test.ts`\n let slot_from_typescript =\n 0x2d225f361108379adc2da91378b9702675c5546b57e78bafc1e74ec7fec55967;\n\n assert_eq(slot, slot_from_typescript);\n }\n}\n"
|
|
3578
2883
|
},
|
|
3579
|
-
"
|
|
3580
|
-
"path": "/
|
|
3581
|
-
"source": "use crate::meta::{derive_deserialize, derive_packable, derive_serialize};\nuse crate::utils::field::field_from_bytes;\n\n// Trait: is_empty\n//\n// The general is_empty trait checks if a data type is is empty,\n// and it defines empty for the basic data types as 0.\n//\n// If a Field is equal to zero, then it is regarded as zero.\n// We will go with this definition for now, however it can be problematic\n// if a value can actually be zero. In a future refactor, we can\n// use the optional type for safety. Doing it now would lead to a worse devex\n// and would make it harder to sync up with the cpp code.\n// Preferred over Default trait to convey intent, as default doesn't necessarily mean empty.\npub trait Empty: Eq {\n fn empty() -> Self;\n\n fn is_empty(self) -> bool {\n self.eq(Self::empty())\n }\n\n // Requires this Noir fix: https://github.com/noir-lang/noir/issues/9002\n // fn assert_not_empty<let U: u32>(self, msg: str<U>) { // This msg version was failing with weird compiler errors.\n // // We provide a default impl but it's likely inefficient.\n // // The reason we include this function is because there's a lot of\n // // opportunity for optimisation on a per-struct basis.\n // // You only need to show one element is not empty to know that the whole thing\n // // is not empty.\n // // If you know an element of your struct which should always be nonempty,\n // // you can write an impl that solely checks that that element is nonempty.\n // assert(!self.is_empty(), msg);\n // }\n\n // This default impl is overwritten by types like arrays, because there's a much\n // more efficient approach.\n fn assert_empty<let S: u32>(self, msg: str<S>) {\n assert(self.is_empty(), msg);\n }\n}\n\nimpl Empty for Field {\n #[inline_always]\n fn empty() -> Self {\n 0\n }\n}\n\nimpl Empty for bool {\n #[inline_always]\n fn empty() -> Self {\n false\n }\n}\n\nimpl Empty for u1 {\n #[inline_always]\n fn empty() -> Self {\n 0\n }\n}\nimpl Empty for u8 {\n #[inline_always]\n fn empty() -> Self {\n 0\n }\n}\nimpl Empty for u16 {\n fn empty() -> Self {\n 0\n }\n}\nimpl Empty for u32 {\n #[inline_always]\n fn empty() -> Self {\n 0\n }\n}\nimpl Empty for u64 {\n #[inline_always]\n fn empty() -> Self {\n 0\n }\n}\nimpl Empty for u128 {\n #[inline_always]\n fn empty() -> Self {\n 0\n }\n}\n\nimpl<T, let N: u32> Empty for [T; N]\nwhere\n T: Empty,\n{\n #[inline_always]\n fn empty() -> Self {\n [T::empty(); N]\n }\n\n fn is_empty(self) -> bool {\n self.all(|elem| elem.is_empty())\n }\n\n fn assert_empty<let S: u32>(self, msg: str<S>) -> () {\n self.for_each(|elem| elem.assert_empty(msg))\n }\n}\n\nimpl<T> Empty for [T]\nwhere\n T: Empty,\n{\n #[inline_always]\n fn empty() -> Self {\n [T::empty()]\n }\n\n fn is_empty(self) -> bool {\n self.all(|elem| elem.is_empty())\n }\n\n fn assert_empty<let S: u32>(self, msg: str<S>) -> () {\n self.for_each(|elem| elem.assert_empty(msg))\n }\n}\nimpl<A, B> Empty for (A, B)\nwhere\n A: Empty,\n B: Empty,\n{\n #[inline_always]\n fn empty() -> Self {\n (A::empty(), B::empty())\n }\n}\n\nimpl<T> Empty for Option<T>\nwhere\n T: Eq,\n{\n #[inline_always]\n fn empty() -> Self {\n Option::none()\n }\n}\n\n// pub fn is_empty<T>(item: T) -> bool\n// where\n// T: Empty,\n// {\n// item.eq(T::empty())\n// }\n\n// pub fn is_empty_array<T, let N: u32>(array: [T; N]) -> bool\n// where\n// T: Empty,\n// {\n// array.all(|elem| is_empty(elem))\n// }\n\n// pub fn assert_empty<T>(item: T) -> ()\n// where\n// T: Empty,\n// {\n// assert(item.eq(T::empty()))\n// }\n\n// pub fn assert_empty_array<T, let N: u32>(array: [T; N]) -> ()\n// where\n// T: Empty,\n// {\n// // A cheaper option than `is_empty_array` for if you don't need to gracefully\n// // handle a bool result.\n// // Avoids the `&` operator of `is_empty_array`'s `.all()` call.\n// for i in 0..N {\n// assert(is_empty(array[i]));\n// }\n// }\n\npub trait Hash {\n fn hash(self) -> Field;\n}\n\npub trait ToField {\n fn to_field(self) -> Field;\n}\n\nimpl ToField for Field {\n #[inline_always]\n fn to_field(self) -> Field {\n self\n }\n}\n\nimpl ToField for bool {\n #[inline_always]\n fn to_field(self) -> Field {\n self as Field\n }\n}\nimpl ToField for u1 {\n #[inline_always]\n fn to_field(self) -> Field {\n self as Field\n }\n}\nimpl ToField for u8 {\n #[inline_always]\n fn to_field(self) -> Field {\n self as Field\n }\n}\nimpl ToField for u16 {\n fn to_field(self) -> Field {\n self as Field\n }\n}\nimpl ToField for u32 {\n #[inline_always]\n fn to_field(self) -> Field {\n self as Field\n }\n}\nimpl ToField for u64 {\n #[inline_always]\n fn to_field(self) -> Field {\n self as Field\n }\n}\nimpl ToField for u128 {\n #[inline_always]\n fn to_field(self) -> Field {\n self as Field\n }\n}\nimpl<let N: u32> ToField for str<N> {\n #[inline_always]\n fn to_field(self) -> Field {\n assert(N < 32, \"String doesn't fit in a field, consider using Serialize instead\");\n field_from_bytes(self.as_bytes(), true)\n }\n}\n\npub trait FromField {\n fn from_field(value: Field) -> Self;\n}\n\nimpl FromField for Field {\n #[inline_always]\n fn from_field(value: Field) -> Self {\n value\n }\n}\n\nimpl FromField for bool {\n #[inline_always]\n fn from_field(value: Field) -> Self {\n value != 0\n }\n}\nimpl FromField for u1 {\n #[inline_always]\n fn from_field(value: Field) -> Self {\n value as u1\n }\n}\nimpl FromField for u8 {\n #[inline_always]\n fn from_field(value: Field) -> Self {\n value as u8\n }\n}\nimpl FromField for u16 {\n fn from_field(value: Field) -> Self {\n value as u16\n }\n}\nimpl FromField for u32 {\n #[inline_always]\n fn from_field(value: Field) -> Self {\n value as u32\n }\n}\nimpl FromField for u64 {\n #[inline_always]\n fn from_field(value: Field) -> Self {\n value as u64\n }\n}\nimpl FromField for u128 {\n #[inline_always]\n fn from_field(value: Field) -> Self {\n value as u128\n }\n}\n\n// docs:start:serialize\n/// Trait for serializing Noir types into arrays of Fields.\n///\n/// An implementation of the Serialize trait has to follow Noir's intrinsic serialization (each member of a struct\n/// converted directly into one or more Fields without any packing or compression). This trait (and Deserialize) are\n/// typically used to communicate between Noir and TypeScript (via oracles and function arguments).\n///\n/// # On Following Noir's Intrinsic Serialization\n/// When calling a Noir function from TypeScript (TS), first the function arguments are serialized into an array\n/// of fields. This array is then included in the initial witness. Noir's intrinsic serialization is then used\n/// to deserialize the arguments from the witness. When the same Noir function is called from Noir this Serialize trait\n/// is used instead of the serialization in TS. For this reason we need to have a match between TS serialization,\n/// Noir's intrinsic serialization and the implementation of this trait. If there is a mismatch, the function calls\n/// fail with an arguments hash mismatch error message.\n///\n/// # Associated Constants\n/// * `N` - The length of the output Field array, known at compile time\n///\n/// # Example\n/// ```\n/// impl<let N: u32> Serialize for str<N> {\n/// let N: u32 = N;\n///\n/// fn serialize(self) -> [Field; Self::N] {\n/// let bytes = self.as_bytes();\n/// let mut fields = [0; Self::N];\n/// for i in 0..bytes.len() {\n/// fields[i] = bytes[i] as Field; // Each byte gets its own Field\n/// }\n/// fields\n/// }\n/// }\n/// ```\n#[derive_via(derive_serialize)]\npub trait Serialize {\n let N: u32;\n\n fn serialize(self) -> [Field; N];\n}\n// docs:end:serialize\n\nimpl<let M: u32> Serialize for str<M> {\n let N: u32 = M;\n\n #[inline_always]\n fn serialize(self) -> [Field; Self::N] {\n let bytes = self.as_bytes();\n let mut fields = [0; Self::N];\n for i in 0..bytes.len() {\n fields[i] = bytes[i] as Field;\n }\n fields\n }\n}\n\n/// Implementation of Deserialize for BoundedVec.\n///\n/// This implementation deserializes a BoundedVec from an array of Fields. The array contains:\n/// 1. The serialized items, each taking up T::N Fields\n/// 2. The length of the BoundedVec as the last Field\n///\n/// # Type Parameters\n/// * `T` - The type of items stored in the BoundedVec, must implement Deserialize\n/// * `M` - The maximum length of the BoundedVec\n///\n/// # Fields Array Layout\n/// [item1_field1, item1_field2, ..., item2_field1, item2_field2, ..., length]\n/// Where:\n/// - itemN_fieldM: The M-th Field of the N-th item (T::N Fields per item)\n/// - length: The number of items in the BoundedVec (1 Field)\n///\n/// Total length N = T::N * M + 1, where:\n/// - T::N is the number of Fields needed to deserialize one item\n/// - M is the maximum length of the BoundedVec\n/// - +1 is for storing the length\n///\n/// # Note\n/// Not deriving this because it's not supported to call derive_deserialize on a \"remote\" struct (and it will never\n/// be supported).\nimpl<T, let M: u32> Deserialize for BoundedVec<T, M>\nwhere\n T: Deserialize,\n{\n let N: u32 = <T as Deserialize>::N * M + 1;\n\n #[inline_always]\n fn deserialize(fields: [Field; Self::N]) -> Self {\n let mut new_bounded_vec: BoundedVec<T, M> = BoundedVec::new();\n\n // Length is stored in the last field as we need to match intrinsic Noir serialization and the `len` struct\n // field is after `storage` struct field (see `bounded_vec.nr` in noir-stdlib)\n let len = fields[<T as Deserialize>::N * M] as u32;\n\n for i in 0..len {\n let mut nested_fields = [0; <T as Deserialize>::N];\n for j in 0..<T as Deserialize>::N {\n nested_fields[j] = fields[i * <T as Deserialize>::N + j];\n }\n\n let item = T::deserialize(nested_fields);\n new_bounded_vec.push(item);\n }\n\n new_bounded_vec\n }\n}\n\n// This may cause issues if used as program input, because noir disallows empty arrays for program input.\n// I think this is okay because I don't foresee a unit type being used as input. But leaving this comment as a hint\n// if someone does run into this in the future.\nimpl Deserialize for () {\n let N: u32 = 0;\n\n fn deserialize(_fields: [Field; Self::N]) -> Self {\n ()\n }\n}\n\n// Note: Not deriving this because it's not supported to call derive_serialize on a \"remote\" struct (and it will never\n// be supported).\nimpl<T, let M: u32> Serialize for BoundedVec<T, M>\nwhere\n T: Serialize,\n{\n let N: u32 = <T as Serialize>::N * M + 1; // +1 for the length of the BoundedVec\n\n #[inline_always]\n fn serialize(self) -> [Field; Self::N] {\n let mut fields = [0; Self::N];\n\n let storage = self.storage();\n\n for i in 0..M {\n let serialized_item = storage[i].serialize();\n\n for j in 0..<T as Serialize>::N {\n fields[i * <T as Serialize>::N + j] = serialized_item[j];\n }\n }\n\n // Length is stored in the last field as we need to match intrinsic Noir serialization and the `len` struct\n // field is after `storage` struct field (see `bounded_vec.nr` in noir-stdlib)\n fields[<T as Serialize>::N * M] = self.len() as Field;\n\n fields\n }\n}\n\n// docs:start:deserialize\n/// Trait for deserializing Noir types from arrays of Fields.\n///\n/// An implementation of the Deserialize trait has to follow Noir's intrinsic serialization (each member of a struct\n/// converted directly into one or more Fields without any packing or compression). This trait is typically used when\n/// deserializing return values from function calls in Noir. Since the same function could be called from TypeScript\n/// (TS), in which case the TS deserialization would get used, we need to have a match between the 2.\n///\n/// # Associated Constants\n/// * `N` - The length of the input Field array, known at compile time\n///\n/// # Example\n/// ```\n/// impl<let M: u32> Deserialize for str<M> {\n/// let N: u32 = M;\n///\n/// #[inline_always]\n/// fn deserialize(fields: [Field; Self::N]) -> Self {\n/// str::<Self::N>::from(fields.map(|value| value as u8))\n/// }\n/// }\n/// ```\n#[derive_via(derive_deserialize)]\npub trait Deserialize {\n let N: u32;\n\n fn deserialize(fields: [Field; N]) -> Self;\n}\n// docs:end:deserialize\n\nimpl<let M: u32> Deserialize for str<M> {\n let N: u32 = M;\n\n #[inline_always]\n fn deserialize(fields: [Field; Self::N]) -> Self {\n str::<Self::N>::from(fields.map(|value| value as u8))\n }\n}\n\n/// Trait for efficiently packing and unpacking Noir types into and from arrays of Fields.\n///\n/// The `Packable` trait allows types to be serialized and deserialized with a focus on minimizing the size of\n/// the resulting Field array. This trait is used when storage efficiency is critical (e.g. when storing data\n/// in the contract's public storage).\n///\n/// # Associated Constants\n/// * `N` - The length of the Field array, known at compile time\n#[derive_via(derive_packable)]\npub trait Packable {\n let N: u32;\n\n /// Packs the current value into a compact array of `Field` elements.\n fn pack(self) -> [Field; N];\n\n /// Unpacks a compact array of `Field` elements into the original value.\n fn unpack(fields: [Field; N]) -> Self;\n}\n\n#[test]\nunconstrained fn bounded_vec_serialization() {\n // Test empty BoundedVec\n let empty_vec: BoundedVec<Field, 3> = BoundedVec::from_array([]);\n let serialized = empty_vec.serialize();\n let deserialized = BoundedVec::<Field, 3>::deserialize(serialized);\n assert_eq(empty_vec, deserialized);\n assert_eq(deserialized.len(), 0);\n\n // Test partially filled BoundedVec\n let partial_vec: BoundedVec<[u32; 2], 3> = BoundedVec::from_array([[1, 2]]);\n let serialized = partial_vec.serialize();\n let deserialized = BoundedVec::<[u32; 2], 3>::deserialize(serialized);\n assert_eq(partial_vec, deserialized);\n assert_eq(deserialized.len(), 1);\n assert_eq(deserialized.get(0), [1, 2]);\n\n // Test full BoundedVec\n let full_vec: BoundedVec<[u32; 2], 3> = BoundedVec::from_array([[1, 2], [3, 4], [5, 6]]);\n let serialized = full_vec.serialize();\n let deserialized = BoundedVec::<[u32; 2], 3>::deserialize(serialized);\n assert_eq(full_vec, deserialized);\n assert_eq(deserialized.len(), 3);\n assert_eq(deserialized.get(0), [1, 2]);\n assert_eq(deserialized.get(1), [3, 4]);\n assert_eq(deserialized.get(2), [5, 6]);\n}\n"
|
|
2884
|
+
"42": {
|
|
2885
|
+
"path": "std/panic.nr",
|
|
2886
|
+
"source": "pub fn panic<T, U>(message: T) -> U\nwhere\n T: StringLike,\n{\n assert(false, message);\n crate::mem::zeroed()\n}\n\ntrait StringLike {}\n\nimpl<let N: u32> StringLike for str<N> {}\nimpl<let N: u32, T> StringLike for fmtstr<N, T> {}\n"
|
|
3582
2887
|
},
|
|
3583
|
-
"
|
|
2888
|
+
"440": {
|
|
3584
2889
|
"path": "/home/aztec-dev/aztec-packages/noir-projects/noir-protocol-circuits/crates/types/src/type_packing.nr",
|
|
3585
|
-
"source": "use crate::traits::Packable;\n\nglobal BOOL_PACKED_LEN: u32 = 1;\nglobal U8_PACKED_LEN: u32 = 1;\nglobal U16_PACKED_LEN: u32 = 1;\nglobal U32_PACKED_LEN: u32 = 1;\nglobal U64_PACKED_LEN: u32 = 1;\nglobal U128_PACKED_LEN: u32 = 1;\nglobal FIELD_PACKED_LEN: u32 = 1;\nglobal I8_PACKED_LEN: u32 = 1;\nglobal I16_PACKED_LEN: u32 = 1;\nglobal I32_PACKED_LEN: u32 = 1;\nglobal I64_PACKED_LEN: u32 = 1;\n\nimpl Packable for bool {\n let N: u32 = BOOL_PACKED_LEN;\n\n #[inline_always]\n fn pack(self) -> [Field; Self::N] {\n [self as Field]\n }\n\n #[inline_always]\n fn unpack(fields: [Field; Self::N]) -> bool {\n (fields[0] as u1) != 0\n }\n}\n\nimpl Packable for u8 {\n let N: u32 = U8_PACKED_LEN;\n\n #[inline_always]\n fn pack(self) -> [Field; Self::N] {\n [self as Field]\n }\n\n #[inline_always]\n fn unpack(fields: [Field; Self::N]) -> Self {\n fields[0] as u8\n }\n}\n\nimpl Packable for u16 {\n let N: u32 = U16_PACKED_LEN;\n\n #[inline_always]\n fn pack(self) -> [Field; Self::N] {\n [self as Field]\n }\n\n #[inline_always]\n fn unpack(fields: [Field; Self::N]) -> Self {\n fields[0] as u16\n }\n}\n\nimpl Packable for u32 {\n let N: u32 = U32_PACKED_LEN;\n\n #[inline_always]\n fn pack(self) -> [Field; Self::N] {\n [self as Field]\n }\n\n #[inline_always]\n fn unpack(fields: [Field; Self::N]) -> Self {\n fields[0] as u32\n }\n}\n\nimpl Packable for u64 {\n let N: u32 = U64_PACKED_LEN;\n\n #[inline_always]\n fn pack(self) -> [Field; Self::N] {\n [self as Field]\n }\n\n #[inline_always]\n fn unpack(fields: [Field; Self::N]) -> Self {\n fields[0] as u64\n }\n}\n\nimpl Packable for u128 {\n let N: u32 = U128_PACKED_LEN;\n\n #[inline_always]\n fn pack(self) -> [Field; Self::N] {\n [self as Field]\n }\n\n #[inline_always]\n fn unpack(fields: [Field; Self::N]) -> Self {\n fields[0] as u128\n }\n}\n\nimpl Packable for Field {\n let N: u32 = FIELD_PACKED_LEN;\n\n #[inline_always]\n fn pack(self) -> [Field; Self::N] {\n [self]\n }\n\n #[inline_always]\n fn unpack(fields: [Field; Self::N]) -> Self {\n fields[0]\n }\n}\n\nimpl Packable for i8 {\n let N: u32 = I8_PACKED_LEN;\n\n #[inline_always]\n fn pack(self) -> [Field; Self::N] {\n [self as u8 as Field]\n }\n\n #[inline_always]\n fn unpack(fields: [Field; Self::N]) -> Self {\n fields[0] as u8 as i8\n }\n}\n\nimpl Packable for i16 {\n let N: u32 = I16_PACKED_LEN;\n\n #[inline_always]\n fn pack(self) -> [Field; Self::N] {\n [self as u16 as Field]\n }\n\n #[inline_always]\n fn unpack(fields: [Field; Self::N]) -> Self {\n fields[0] as u16 as i16\n }\n}\n\nimpl Packable for i32 {\n let N: u32 = I32_PACKED_LEN;\n\n #[inline_always]\n fn pack(self) -> [Field; Self::N] {\n [self as u32 as Field]\n }\n\n #[inline_always]\n fn unpack(fields: [Field; Self::N]) -> Self {\n fields[0] as u32 as i32\n }\n}\n\nimpl Packable for i64 {\n let N: u32 = I64_PACKED_LEN;\n\n #[inline_always]\n fn pack(self) -> [Field; Self::N] {\n [self as u64 as Field]\n }\n\n #[inline_always]\n fn unpack(fields: [Field; Self::N]) -> Self {\n fields[0] as u64 as i64\n }\n}\n\nimpl<T, let M: u32> Packable for [T; M]\nwhere\n T: Packable,\n{\n let N: u32 = M * <T as Packable>::N;\n\n #[inline_always]\n fn pack(self) -> [Field; Self::N] {\n let mut result: [Field; Self::N] = std::mem::zeroed();\n for i in 0..M {\n let serialized = self[i].pack();\n for j in 0..<T as Packable>::N {\n result[i * <T as Packable>::N + j] = serialized[j];\n }\n }\n result\n }\n\n #[inline_always]\n fn unpack(fields: [Field; Self::N]) -> Self {\n let mut reader = crate::utils::reader::Reader::new(fields);\n let
|
|
2890
|
+
"source": "use crate::traits::Packable;\n\nglobal BOOL_PACKED_LEN: u32 = 1;\nglobal U8_PACKED_LEN: u32 = 1;\nglobal U16_PACKED_LEN: u32 = 1;\nglobal U32_PACKED_LEN: u32 = 1;\nglobal U64_PACKED_LEN: u32 = 1;\nglobal U128_PACKED_LEN: u32 = 1;\nglobal FIELD_PACKED_LEN: u32 = 1;\nglobal I8_PACKED_LEN: u32 = 1;\nglobal I16_PACKED_LEN: u32 = 1;\nglobal I32_PACKED_LEN: u32 = 1;\nglobal I64_PACKED_LEN: u32 = 1;\n\nimpl Packable for bool {\n let N: u32 = BOOL_PACKED_LEN;\n\n #[inline_always]\n fn pack(self) -> [Field; Self::N] {\n [self as Field]\n }\n\n #[inline_always]\n fn unpack(fields: [Field; Self::N]) -> bool {\n (fields[0] as u1) != 0\n }\n}\n\nimpl Packable for u8 {\n let N: u32 = U8_PACKED_LEN;\n\n #[inline_always]\n fn pack(self) -> [Field; Self::N] {\n [self as Field]\n }\n\n #[inline_always]\n fn unpack(fields: [Field; Self::N]) -> Self {\n fields[0] as u8\n }\n}\n\nimpl Packable for u16 {\n let N: u32 = U16_PACKED_LEN;\n\n #[inline_always]\n fn pack(self) -> [Field; Self::N] {\n [self as Field]\n }\n\n #[inline_always]\n fn unpack(fields: [Field; Self::N]) -> Self {\n fields[0] as u16\n }\n}\n\nimpl Packable for u32 {\n let N: u32 = U32_PACKED_LEN;\n\n #[inline_always]\n fn pack(self) -> [Field; Self::N] {\n [self as Field]\n }\n\n #[inline_always]\n fn unpack(fields: [Field; Self::N]) -> Self {\n fields[0] as u32\n }\n}\n\nimpl Packable for u64 {\n let N: u32 = U64_PACKED_LEN;\n\n #[inline_always]\n fn pack(self) -> [Field; Self::N] {\n [self as Field]\n }\n\n #[inline_always]\n fn unpack(fields: [Field; Self::N]) -> Self {\n fields[0] as u64\n }\n}\n\nimpl Packable for u128 {\n let N: u32 = U128_PACKED_LEN;\n\n #[inline_always]\n fn pack(self) -> [Field; Self::N] {\n [self as Field]\n }\n\n #[inline_always]\n fn unpack(fields: [Field; Self::N]) -> Self {\n fields[0] as u128\n }\n}\n\nimpl Packable for Field {\n let N: u32 = FIELD_PACKED_LEN;\n\n #[inline_always]\n fn pack(self) -> [Field; Self::N] {\n [self]\n }\n\n #[inline_always]\n fn unpack(fields: [Field; Self::N]) -> Self {\n fields[0]\n }\n}\n\nimpl Packable for i8 {\n let N: u32 = I8_PACKED_LEN;\n\n #[inline_always]\n fn pack(self) -> [Field; Self::N] {\n [self as u8 as Field]\n }\n\n #[inline_always]\n fn unpack(fields: [Field; Self::N]) -> Self {\n fields[0] as u8 as i8\n }\n}\n\nimpl Packable for i16 {\n let N: u32 = I16_PACKED_LEN;\n\n #[inline_always]\n fn pack(self) -> [Field; Self::N] {\n [self as u16 as Field]\n }\n\n #[inline_always]\n fn unpack(fields: [Field; Self::N]) -> Self {\n fields[0] as u16 as i16\n }\n}\n\nimpl Packable for i32 {\n let N: u32 = I32_PACKED_LEN;\n\n #[inline_always]\n fn pack(self) -> [Field; Self::N] {\n [self as u32 as Field]\n }\n\n #[inline_always]\n fn unpack(fields: [Field; Self::N]) -> Self {\n fields[0] as u32 as i32\n }\n}\n\nimpl Packable for i64 {\n let N: u32 = I64_PACKED_LEN;\n\n #[inline_always]\n fn pack(self) -> [Field; Self::N] {\n [self as u64 as Field]\n }\n\n #[inline_always]\n fn unpack(fields: [Field; Self::N]) -> Self {\n fields[0] as u64 as i64\n }\n}\n\nimpl<T, let M: u32> Packable for [T; M]\nwhere\n T: Packable,\n{\n let N: u32 = M * <T as Packable>::N;\n\n #[inline_always]\n fn pack(self) -> [Field; Self::N] {\n let mut result: [Field; Self::N] = std::mem::zeroed();\n for i in 0..M {\n let serialized = self[i].pack();\n for j in 0..<T as Packable>::N {\n result[i * <T as Packable>::N + j] = serialized[j];\n }\n }\n result\n }\n\n #[inline_always]\n fn unpack(fields: [Field; Self::N]) -> Self {\n let mut reader = crate::utils::reader::Reader::new(fields);\n let result: [T; M] = std::mem::zeroed();\n reader.read_struct_array::<T, <T as Packable>::N, M>(Packable::unpack, result)\n }\n}\n\n#[test]\nfn test_u16_packing() {\n let a: u16 = 10;\n assert_eq(a, u16::unpack(a.pack()));\n}\n\n#[test]\nfn test_i8_packing() {\n let a: i8 = -10;\n assert_eq(a, i8::unpack(a.pack()));\n}\n\n#[test]\nfn test_i16_packing() {\n let a: i16 = -10;\n assert_eq(a, i16::unpack(a.pack()));\n}\n\n#[test]\nfn test_i32_packing() {\n let a: i32 = -10;\n assert_eq(a, i32::unpack(a.pack()));\n}\n\n#[test]\nfn test_i64_packing() {\n let a: i64 = -10;\n assert_eq(a, i64::unpack(a.pack()));\n}\n"
|
|
3586
2891
|
},
|
|
3587
|
-
"
|
|
3588
|
-
"path": "/home/aztec-dev/aztec-packages/noir-projects/noir-protocol-circuits/crates/
|
|
3589
|
-
"source": "
|
|
2892
|
+
"453": {
|
|
2893
|
+
"path": "/home/aztec-dev/aztec-packages/noir-projects/noir-protocol-circuits/crates/serde/src/reader.nr",
|
|
2894
|
+
"source": "pub struct Reader<let N: u32> {\n data: [Field; N],\n offset: u32,\n}\n\nimpl<let N: u32> Reader<N> {\n pub fn new(data: [Field; N]) -> Self {\n Self { data, offset: 0 }\n }\n\n pub fn read(&mut self) -> Field {\n let result = self.data[self.offset];\n self.offset += 1;\n result\n }\n\n pub fn read_u32(&mut self) -> u32 {\n self.read() as u32\n }\n\n pub fn read_u64(&mut self) -> u64 {\n self.read() as u64\n }\n\n pub fn read_bool(&mut self) -> bool {\n self.read() != 0\n }\n\n pub fn read_array<let K: u32>(&mut self) -> [Field; K] {\n let mut result = [0; K];\n for i in 0..K {\n result[i] = self.data[self.offset + i];\n }\n self.offset += K;\n result\n }\n\n pub fn read_struct<T, let K: u32>(&mut self, deserialise: fn([Field; K]) -> T) -> T {\n let result = deserialise(self.read_array());\n result\n }\n\n pub fn read_struct_array<T, let K: u32, let C: u32>(\n &mut self,\n deserialise: fn([Field; K]) -> T,\n mut result: [T; C],\n ) -> [T; C] {\n for i in 0..C {\n result[i] = self.read_struct(deserialise);\n }\n result\n }\n\n pub fn peek_offset(&mut self, offset: u32) -> Field {\n self.data[self.offset + offset]\n }\n\n pub fn advance_offset(&mut self, offset: u32) {\n self.offset += offset;\n }\n\n pub fn finish(self) {\n assert_eq(self.offset, self.data.len(), \"Reader did not read all data\");\n }\n}\n"
|
|
3590
2895
|
},
|
|
3591
|
-
"
|
|
3592
|
-
"path": "/home/aztec-dev/aztec-packages/noir-projects/noir-protocol-circuits/crates/
|
|
3593
|
-
"source": "pub(crate) mod assert_trailing_zeros;\npub(crate) mod copy_items_into_array;\npub(crate) mod find_index;\npub(crate) mod get_sorted_tuples;\npub(crate) mod claimed_length_array;\n\n// Re-exports.\npub use assert_trailing_zeros::assert_trailing_zeros;\npub use claimed_length_array::ClaimedLengthArray;\npub use copy_items_into_array::copy_items_into_array;\npub use find_index::{find_first_index, find_last_index};\npub use get_sorted_tuples::{get_sorted_tuples, SortedTuple};\n\nuse crate::traits::Empty;\n\n// TODO: Consider making this a part of the noir stdlib.\n/// Helper fn to create a subarray from a given array.\npub fn subarray<T, let N: u32, let M: u32>(array: [T; N], offset: u32) -> [T; M]\nwhere\n T: Empty,\n{\n let mut result: [T; M] = [T::empty(); M];\n for i in 0..M {\n result[i] = array[offset + i];\n }\n result\n}\n\n/// Helper function to count the number of non-empty elements in a validated array.\n/// Danger: This is only safe to call if the input arrays have been \"validated\" (dense lhs, empty rhs).\n/// 1. All elements before the first empty element are non-empty\n/// 2. All elements after and including the first empty element are empty\n/// 3. The array forms a contiguous sequence of non-empty elements followed by empty elements\npub fn array_length<T, let N: u32>(array: [T; N]) -> u32\nwhere\n T: Empty,\n{\n // We get the length by checking the index of the first empty element.\n\n // Safety: This is safe because we have validated the array (see function doc comment above) and the emptiness\n // of the element and non-emptiness of the previous element is checked below.\n let length = unsafe { find_first_index(array, |elem: T| elem.is_empty()) };\n\n validate_array_length_hint(array, length);\n\n length\n}\n\n// Extracted into a standalone function to enable testing of bad hints.\nfn validate_array_length_hint<T, let N: u32>(array: [T; N], length: u32)\nwhere\n T: Empty,\n{\n // Note: if length > N, the below `array` access will throw an out of bounds error.\n\n if length != N {\n array[length].assert_empty(\"Expected array[length] to be empty\");\n }\n\n if length != 0 {\n assert(\n !array[length - 1].is_empty(),\n \"Expected claimed final element of array (array[length - 1]) to be nonempty\",\n );\n }\n}\n\n// Returns an array length defined by fully trimming _all_ \"empty\" items\n// from the RHS.\npub unconstrained fn trimmed_array_length_hint<T, let N: u32>(array: [T; N]) -> u32\nwhere\n T: Empty,\n{\n let index_of_last_nonempty = find_last_index(array, |elem: T| !elem.is_empty());\n let length: u32 = if index_of_last_nonempty != N {\n 1 + index_of_last_nonempty\n } else {\n 0\n };\n length\n}\n\n// Returns the number of consecutive elements at the start of the array for which the predicate returns false.\n// This function ensures that any element after the first matching element (predicate returns true) also matches the predicate.\npub fn array_length_until<T, let N: u32, Env>(array: [T; N], predicate: fn[Env](T) -> bool) -> u32 {\n let mut length = 0;\n let mut stop = false;\n for i in 0..N {\n if predicate(array[i]) {\n stop = true;\n } else {\n assert(\n stop == false,\n \"matching element found after already encountering a non-matching element\",\n );\n length += 1;\n }\n }\n length\n}\n\n/// This function assumes that `array1` and `array2` contain no more than N non-empty elements between them,\n/// if this is not the case then elements from the end of `array2` will be dropped.\n/// Danger: This is only safe to call if the input arrays have been \"validated\" (dense lhs, empty rhs).\npub fn array_merge<T, let N: u32>(array1: [T; N], array2: [T; N]) -> [T; N]\nwhere\n T: Empty,\n{\n // Safety: we constrain this array below\n let result = unsafe { array_merge_helper(array1, array2) };\n\n validate_array_merge_hint(array1, array2, result);\n\n result\n}\n\n// Danger: assumes the array's length has already been validated.\nunconstrained fn array_merge_helper<T, let N: u32>(array1: [T; N], array2: [T; N]) -> [T; N]\nwhere\n T: Empty,\n{\n let mut result: [T; N] = [T::empty(); N];\n let mut i = 0;\n for elem in array1 {\n // This function should only be used with validated arrays, so it's fine to simply skip empty elements here.\n if !elem.is_empty() {\n result[i] = elem;\n i += 1;\n }\n }\n for elem in array2 {\n if !elem.is_empty() {\n result[i] = elem;\n i += 1;\n }\n }\n result\n}\n\n/// Extracted into a standalone function to enable testing of bad hints.\n/// Danger: This is only safe to call if the input arrays have been \"validated\" (dense lhs, empty rhs).\nfn validate_array_merge_hint<T, let N: u32>(array1: [T; N], array2: [T; N], result: [T; N])\nwhere\n T: Empty,\n{\n // We assume the array length has been validated. The only use cases so far are with previously validated arrays.\n let array1_len = array_length(array1);\n let mut add_from_left = true;\n for i in 0..N {\n add_from_left &= i != array1_len;\n if add_from_left {\n assert_eq(result[i], array1[i], \"Incorrect array merge hint\");\n } else {\n assert_eq(result[i], array2[i - array1_len], \"Incorrect array merge hint\");\n }\n }\n}\n\npub fn check_permutation<T, let N: u32>(\n original_array: [T; N],\n permuted_array: [T; N],\n original_indexes: [u32; N],\n)\nwhere\n T: Eq,\n{\n let mut seen_value = [false; N];\n for i in 0..N {\n let index = original_indexes[i];\n let original_value = original_array[index];\n assert(permuted_array[i].eq(original_value), \"Invalid index\");\n assert(!seen_value[index], \"Duplicated index\");\n seen_value[index] = true;\n }\n}\n\n// Helper function to check if an array is padded with a given value from a given index.\npub fn array_padded_with<T, let N: u32>(array: [T; N], from_index: u32, padded_with: T) -> bool\nwhere\n T: Eq,\n{\n let mut is_valid = true;\n let mut should_check = false;\n for i in 0..N {\n should_check |= i == from_index;\n is_valid &= !should_check | (array[i] == padded_with);\n }\n is_valid\n}\n\n// ==================== subarray tests ====================\n\n#[test]\nfn test_subarray() {\n assert_eq(subarray::<_, 5, 3>([10, 20, 30, 40, 50], 1), [20, 30, 40]);\n assert_eq(subarray::<_, 5, 2>([10, 20, 30, 40, 50], 0), [10, 20]);\n assert_eq(subarray::<_, 3, 0>([10, 20, 30], 2), []);\n assert_eq(subarray::<_, 3, 1>([10, 20, 30], 2), [30]);\n}\n\n#[test(should_fail_with = \"out of bounds\")]\nfn test_subarray_offset_out_of_bounds() {\n let _: [Field; 1] = subarray([10, 20, 30], 5);\n}\n\n#[test(should_fail_with = \"out of bounds\")]\nfn test_subarray_result_size_exceeds_available() {\n let _: [Field; 3] = subarray([10, 20, 30, 40, 50], 3);\n}\n\n// ==================== array_length tests ====================\n\n#[test]\nfn test_array_length_empty_array() {\n assert_eq(array_length([0]), 0);\n assert_eq(array_length([0, 0, 0]), 0);\n}\n\n#[test]\nfn test_array_length() {\n assert_eq(array_length([123]), 1);\n assert_eq(array_length([123, 0, 0]), 1);\n assert_eq(array_length([123, 456]), 2);\n assert_eq(array_length([123, 456, 0]), 2);\n}\n\n#[test]\nfn test_array_length_invalid_arrays() {\n // Result can be misleading (but correct) for invalid arrays.\n // This is why the arrays being passed-into `array_length` must already have been \"validated\"\n // (dense lhs, empty rhs).\n assert_eq(array_length([0, 0, 123]), 0);\n assert_eq(array_length([0, 123, 0]), 0);\n assert_eq(array_length([0, 123, 456]), 0);\n assert_eq(array_length([123, 0, 456]), 1);\n}\n\n// ==================== validate_array_length_hint tests ====================\n\n#[test]\nfn test_validate_array_length_hint_valid() {\n validate_array_length_hint([0, 0, 0], 0);\n validate_array_length_hint([10, 20, 0], 2);\n validate_array_length_hint([10, 20, 30], 3);\n}\n\n#[test(should_fail_with = \"Expected array[length] to be empty\")]\nfn test_validate_array_length_hint_claims_zero_when_not_empty() {\n // Invalid: hint says length 0, but first element is not empty\n validate_array_length_hint([10, 20, 30], 0);\n}\n\n#[test(should_fail_with = \"Expected array[length] to be empty\")]\nfn test_validate_array_length_hint_too_short() {\n // Invalid: hint says length 1, but element at index 1 is not empty\n validate_array_length_hint([10, 20, 0], 1);\n}\n\n#[test(should_fail_with = \"Expected claimed final element of array (array[length - 1]) to be nonempty\")]\nfn test_validate_array_length_hint_too_long() {\n // Invalid: hint says length 2, but element at index 1 is empty\n validate_array_length_hint([10, 0, 0], 2);\n}\n\n#[test(should_fail_with = \"Expected claimed final element of array (array[length - 1]) to be nonempty\")]\nfn test_validate_array_length_hint_of_empty_too_long() {\n // Invalid: hint says length 2, but element at index 1 is empty\n validate_array_length_hint([0, 0, 0], 2);\n}\n\n#[test(should_fail_with = \"out of bounds\")]\nfn test_validate_array_length_hint_out_of_bounds() {\n // Invalid: hint says length 4, but array only has 3 elements\n validate_array_length_hint([10, 20, 30], 4);\n}\n\n// ==================== trimmed_array_length_hint tests ====================\n\n#[test]\nunconstrained fn test_trimmed_array_length_hint_with_trailing_empties() {\n assert_eq(trimmed_array_length_hint([10, 20, 30, 0, 0]), 3);\n}\n\n#[test]\nunconstrained fn test_trimmed_array_length_hint_fully_empty() {\n assert_eq(trimmed_array_length_hint([0, 0, 0, 0, 0]), 0);\n}\n\n#[test]\nunconstrained fn test_trimmed_array_length_hint_no_empties() {\n assert_eq(trimmed_array_length_hint([10, 20, 30, 40, 50]), 5);\n}\n\n#[test]\nunconstrained fn test_trimmed_array_length_hint_with_gaps() {\n // Unlike array_length, this trims from the right only, so gaps don't matter\n assert_eq(trimmed_array_length_hint([10, 0, 30, 0, 0]), 3);\n}\n\n// ==================== array_length_until tests ====================\n\n#[test]\nfn test_array_length_until() {\n let array = [11, 22, 33, 44, 55];\n assert_eq(array_length_until(array, |x| x == 55), 4);\n assert_eq(array_length_until(array, |x| x == 56), 5);\n assert_eq(array_length_until(array, |x| x > 40), 3);\n assert_eq(array_length_until(array, |x| x > 10), 0);\n}\n\n#[test(should_fail_with = \"matching element found after already encountering a non-matching element\")]\nfn test_array_length_until_non_consecutive_fails() {\n let array = [1, 1, 0, 1, 0];\n let _ = array_length_until(array, |x| x == 0);\n}\n\n#[test(should_fail_with = \"matching element found after already encountering a non-matching element\")]\nfn test_array_length_until_first_non_matching_fails() {\n let array = [1, 0, 0, 0, 0];\n let _ = array_length_until(array, |x| x == 1);\n}\n\n// ==================== array_merge tests ====================\n\n#[test]\nfn test_array_merge() {\n assert_eq(array_merge([10, 20, 0, 0, 0], [30, 40, 50, 0, 0]), [10, 20, 30, 40, 50]);\n assert_eq(array_merge([0, 0, 0], [10, 20, 0]), [10, 20, 0]);\n assert_eq(array_merge([10, 20, 0], [0, 0, 0]), [10, 20, 0]);\n assert_eq(array_merge::<Field, 3>([0, 0, 0], [0, 0, 0]), [0, 0, 0]);\n}\n\n#[test(should_fail_with = \"out of bounds\")]\nfn test_array_merge_combined_exceeds_capacity() {\n let _ = array_merge([10, 20, 30, 0, 0], [40, 50, 60, 0, 0]);\n}\n\n#[test(should_fail_with = \"Incorrect array merge hint\")]\nfn test_array_merge_rejects_array1_with_gaps() {\n // array_merge assumes validated arrays (no gaps). The helper compacts empties,\n // but the validation expects array1's structure to be preserved, causing failure.\n let _ = array_merge([10, 0, 20, 0, 0], [30, 0, 0, 0, 0]);\n}\n\n#[test(should_fail_with = \"Incorrect array merge hint\")]\nfn test_array_merge_rejects_array2_with_gaps() {\n // array_merge assumes validated arrays (no gaps). The helper compacts empties,\n // but the validation expects array2's structure to be preserved, causing failure.\n let _ = array_merge([10, 0, 0, 0, 0], [0, 20, 0, 30, 0]);\n}\n\n// ==================== validate_array_merge_hint tests ====================\n\n#[test]\nfn test_validate_array_merge_hint_valid() {\n validate_array_merge_hint([10, 20, 0], [30, 0, 0], [10, 20, 30]);\n validate_array_merge_hint([0, 0, 0], [10, 20, 0], [10, 20, 0]);\n validate_array_merge_hint([10, 20, 0], [0, 0, 0], [10, 20, 0]);\n validate_array_merge_hint([0, 0, 0], [0, 0, 0], [0, 0, 0]);\n validate_array_merge_hint([10, 20, 0, 0], [30, 40, 0, 0], [10, 20, 30, 40]);\n}\n\n#[test(should_fail_with = \"Incorrect array merge hint\")]\nfn test_validate_array_merge_hint_wrong_result_from_array1() {\n // Invalid: result doesn't match array1 elements\n validate_array_merge_hint([10, 20, 0], [30, 0, 0], [99, 20, 30]);\n}\n\n#[test(should_fail_with = \"Incorrect array merge hint\")]\nfn test_validate_array_merge_hint_wrong_result_from_array2() {\n // Invalid: result doesn't match array2 elements\n validate_array_merge_hint([10, 20, 0], [30, 0, 0], [10, 20, 99]);\n}\n\n#[test(should_fail_with = \"Incorrect array merge hint\")]\nfn test_validate_array_merge_hint_swapped_order() {\n // Invalid: result has array2 elements before array1 elements\n validate_array_merge_hint([10, 20, 0], [30, 0, 0], [30, 10, 20]);\n}\n\n#[test(should_fail_with = \"Incorrect array merge hint\")]\nfn test_validate_array_merge_hint_missing_element_from_array1() {\n // Invalid: result is missing an element from array1\n validate_array_merge_hint([10, 20, 0], [30, 0, 0], [10, 30, 0]);\n}\n\n#[test(should_fail_with = \"Incorrect array merge hint\")]\nfn test_validate_array_merge_hint_missing_element_from_array2() {\n // Invalid: result is missing an element from array2 (truncated)\n validate_array_merge_hint([10, 20, 0, 0], [30, 40, 0, 0], [10, 20, 30, 0]);\n}\n\n#[test(should_fail_with = \"Incorrect array merge hint\")]\nfn test_validate_array_merge_hint_extra_element_in_padding() {\n // Invalid: result has garbage where array2's empties should be\n validate_array_merge_hint([10, 0, 0], [20, 0, 0], [10, 20, 99]);\n}\n\n#[test(should_fail_with = \"Incorrect array merge hint\")]\nfn test_validate_array_merge_hint_rejects_compacted_result_for_array1_with_gaps() {\n // If array1 has gaps, a compacted result won't match the expected structure\n validate_array_merge_hint([10, 0, 20, 0, 0], [30, 0, 0, 0, 0], [10, 20, 30, 0, 0]);\n}\n\n#[test(should_fail_with = \"Incorrect array merge hint\")]\nfn test_validate_array_merge_hint_rejects_compacted_result_for_array2_with_gaps() {\n // If array2 has gaps, a compacted result won't match the expected structure\n validate_array_merge_hint([10, 0, 0, 0, 0], [0, 20, 0, 30, 0], [10, 20, 30, 0, 0]);\n}\n\n// ==================== check_permutation tests ====================\n\n#[test]\nfn test_check_permutation() {\n let original_array = [1, 2, 3];\n let permuted_array = [3, 1, 2];\n let indexes = [2, 0, 1];\n check_permutation(original_array, permuted_array, indexes);\n}\n\n#[test(should_fail_with = \"Duplicated index\")]\nfn test_check_permutation_duplicated_index() {\n let original_array = [0, 1, 0];\n let permuted_array = [1, 0, 0];\n let indexes = [1, 0, 0];\n check_permutation(original_array, permuted_array, indexes);\n}\n\n#[test(should_fail_with = \"Invalid index\")]\nfn test_check_permutation_invalid_index() {\n let original_array = [0, 1, 2];\n let permuted_array = [1, 0, 0];\n let indexes = [1, 0, 2];\n check_permutation(original_array, permuted_array, indexes);\n}\n\n// ==================== array_padded_with tests ====================\n\n#[test]\nfn test_array_padded_with() {\n let array = [11, 22, 33, 44, 44];\n assert_eq(array_padded_with(array, 0, 44), false);\n assert_eq(array_padded_with(array, 1, 44), false);\n assert_eq(array_padded_with(array, 2, 44), false);\n assert_eq(array_padded_with(array, 3, 44), true);\n assert_eq(array_padded_with(array, 4, 44), true);\n assert_eq(array_padded_with(array, 4, 33), false);\n assert_eq(array_padded_with(array, 5, 44), true); // Index out of bounds.\n assert_eq(array_padded_with(array, 0, 11), false);\n}\n"
|
|
2896
|
+
"454": {
|
|
2897
|
+
"path": "/home/aztec-dev/aztec-packages/noir-projects/noir-protocol-circuits/crates/serde/src/serialization.nr",
|
|
2898
|
+
"source": "use crate::{reader::Reader, writer::Writer};\n\n// docs:start:serialize\n/// Trait for serializing Noir types into arrays of Fields.\n///\n/// An implementation of the Serialize trait has to follow Noir's intrinsic serialization (each member of a struct\n/// converted directly into one or more Fields without any packing or compression). This trait (and Deserialize) are\n/// typically used to communicate between Noir and TypeScript (via oracles and function arguments).\n///\n/// # On Following Noir's Intrinsic Serialization\n/// When calling a Noir function from TypeScript (TS), first the function arguments are serialized into an array\n/// of fields. This array is then included in the initial witness. Noir's intrinsic serialization is then used\n/// to deserialize the arguments from the witness. When the same Noir function is called from Noir this Serialize trait\n/// is used instead of the serialization in TS. For this reason we need to have a match between TS serialization,\n/// Noir's intrinsic serialization and the implementation of this trait. If there is a mismatch, the function calls\n/// fail with an arguments hash mismatch error message.\n///\n/// # Associated Constants\n/// * `N` - The length of the output Field array, known at compile time\n///\n/// # Example\n/// ```\n/// impl<let N: u32> Serialize for str<N> {\n/// let N: u32 = N;\n///\n/// fn serialize(self) -> [Field; Self::N] {\n/// let mut writer: Writer<Self::N> = Writer::new();\n/// self.stream_serialize(&mut writer);\n/// writer.finish()\n/// }\n///\n/// fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>) {\n/// let bytes = self.as_bytes();\n/// for i in 0..bytes.len() {\n/// writer.write(bytes[i] as Field);\n/// }\n/// }\n/// }\n/// ```\n#[derive_via(derive_serialize)]\npub trait Serialize {\n let N: u32;\n\n fn serialize(self) -> [Field; Self::N];\n\n fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>);\n}\n\n/// Generates a `Serialize` trait implementation for a struct type.\n///\n/// # Parameters\n/// - `s`: The struct type definition to generate the implementation for\n///\n/// # Returns\n/// A quoted code block containing the trait implementation\n///\n/// # Example\n/// For a struct defined as:\n/// ```\n/// struct Log<N> {\n/// fields: [Field; N],\n/// length: u32\n/// }\n/// ```\n///\n/// This function generates code equivalent to:\n/// ```\n/// impl<let N: u32> Serialize for Log<N> {\n/// let N: u32 = <[Field; N] as Serialize>::N + <u32 as Serialize>::N;\n///\n/// fn serialize(self) -> [Field; Self::N] {\n/// let mut writer: Writer<Self::N> = Writer::new();\n/// self.stream_serialize(&mut writer);\n/// writer.finish()\n/// }\n///\n/// #[inline_always]\n/// fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>) {\n/// Serialize::stream_serialize(self.fields, writer);\n/// Serialize::stream_serialize(self.length, writer);\n/// }\n/// }\n/// ```\npub comptime fn derive_serialize(s: TypeDefinition) -> Quoted {\n let typ = s.as_type();\n let nested_struct = typ.as_data_type().unwrap();\n\n // We care only about the name and type so we drop the last item of the tuple\n let params = nested_struct.0.fields(nested_struct.1).map(|(name, typ, _)| (name, typ));\n\n // Generates the generic parameter declarations (to be placed after the `impl` keyword) and the `where` clause\n // for the `Serialize` trait.\n let generics_declarations = get_generics_declarations(s);\n let where_serialize_clause = get_where_trait_clause(s, quote {Serialize});\n\n let params_len_quote = get_params_len_quote(params);\n\n let function_body = params\n .map(|(name, _typ): (Quoted, Type)| {\n quote {\n $crate::serialization::Serialize::stream_serialize(self.$name, writer);\n }\n })\n .join(quote {});\n\n quote {\n impl$generics_declarations $crate::serialization::Serialize for $typ\n $where_serialize_clause\n {\n let N: u32 = $params_len_quote;\n\n\n fn serialize(self) -> [Field; Self::N] {\n let mut writer: $crate::writer::Writer<Self::N> = $crate::writer::Writer::new();\n $crate::serialization::Serialize::stream_serialize(self, &mut writer);\n writer.finish()\n }\n\n\n #[inline_always]\n fn stream_serialize<let K: u32>(self, writer: &mut $crate::writer::Writer<K>) {\n $function_body\n }\n }\n }\n}\n\n// docs:start:deserialize\n/// Trait for deserializing Noir types from arrays of Fields.\n///\n/// An implementation of the Deserialize trait has to follow Noir's intrinsic serialization (each member of a struct\n/// converted directly into one or more Fields without any packing or compression). This trait is typically used when\n/// deserializing return values from function calls in Noir. Since the same function could be called from TypeScript\n/// (TS), in which case the TS deserialization would get used, we need to have a match between the 2.\n///\n/// # Associated Constants\n/// * `N` - The length of the input Field array, known at compile time\n///\n/// # Example\n/// ```\n/// impl<let M: u32> Deserialize for str<M> {\n/// let N: u32 = M;\n///\n/// fn deserialize(fields: [Field; Self::N]) -> Self {\n/// let mut reader = Reader::new(fields);\n/// let result = Self::stream_deserialize(&mut reader);\n/// reader.finish();\n/// result\n/// }\n///\n/// fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> Self {\n/// let mut bytes = [0 as u8; M];\n/// for i in 0..M {\n/// bytes[i] = reader.read() as u8;\n/// }\n/// str::<M>::from(bytes)\n/// }\n/// }\n/// ```\n#[derive_via(derive_deserialize)]\npub trait Deserialize {\n let N: u32;\n\n fn deserialize(fields: [Field; Self::N]) -> Self;\n\n fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> Self;\n}\n\n/// Generates a `Deserialize` trait implementation for a given struct `s`.\n///\n/// # Arguments\n/// * `s` - The struct type definition to generate the implementation for\n///\n/// # Returns\n/// A `Quoted` block containing the generated trait implementation\n///\n/// # Requirements\n/// Each struct member type must implement the `Deserialize` trait (it gets used in the generated code).\n///\n/// # Example\n/// For a struct like:\n/// ```\n/// struct MyStruct {\n/// x: AztecAddress,\n/// y: Field,\n/// }\n/// ```\n///\n/// This generates:\n/// ```\n/// impl Deserialize for MyStruct {\n/// let N: u32 = <AztecAddress as Deserialize>::N + <Field as Deserialize>::N;\n///\n/// fn deserialize(fields: [Field; Self::N]) -> Self {\n/// let mut reader = Reader::new(fields);\n/// let result = Self::stream_deserialize(&mut reader);\n/// reader.finish();\n/// result\n/// }\n///\n/// #[inline_always]\n/// fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> Self {\n/// let x = <AztecAddress as Deserialize>::stream_deserialize(reader);\n/// let y = <Field as Deserialize>::stream_deserialize(reader);\n/// Self { x, y }\n/// }\n/// }\n/// ```\npub comptime fn derive_deserialize(s: TypeDefinition) -> Quoted {\n let typ = s.as_type();\n let nested_struct = typ.as_data_type().unwrap();\n let params = nested_struct.0.fields(nested_struct.1);\n\n // Generates the generic parameter declarations (to be placed after the `impl` keyword) and the `where` clause\n // for the `Deserialize` trait.\n let generics_declarations = get_generics_declarations(s);\n let where_deserialize_clause = get_where_trait_clause(s, quote {Deserialize});\n\n // The following will give us:\n // <type_of_struct_member_1 as Deserialize>::N + <type_of_struct_member_2 as Deserialize>::N + ...\n // (or 0 if the struct has no members)\n let right_hand_side_of_definition_of_n = if params.len() > 0 {\n params\n .map(|(_, param_type, _): (Quoted, Type, Quoted)| {\n quote {\n <$param_type as $crate::serialization::Deserialize>::N\n }\n })\n .join(quote {+})\n } else {\n quote {0}\n };\n\n // For structs containing a single member, we can enhance performance by directly deserializing the input array,\n // bypassing the need for loop-based array construction. While this optimization yields significant benefits in\n // Brillig where the loops are expected to not be optimized, it is not relevant in ACIR where the loops are\n // expected to be optimized away.\n let function_body = if params.len() > 1 {\n // This generates deserialization code for each struct member and concatenates them together.\n let deserialization_of_struct_members = params\n .map(|(param_name, param_type, _): (Quoted, Type, Quoted)| {\n quote {\n let $param_name = <$param_type as Deserialize>::stream_deserialize(reader);\n }\n })\n .join(quote {});\n\n // We join the struct member names with a comma to be used in the `Self { ... }` syntax\n // This will give us e.g. `a, b, c` for a struct with three fields named `a`, `b`, and `c`.\n let struct_members = params\n .map(|(param_name, _, _): (Quoted, Type, Quoted)| quote { $param_name })\n .join(quote {,});\n\n quote {\n $deserialization_of_struct_members\n\n Self { $struct_members }\n }\n } else if params.len() == 1 {\n let param_name = params[0].0;\n quote {\n Self { $param_name: $crate::serialization::Deserialize::stream_deserialize(reader) }\n }\n } else {\n quote {\n Self {}\n }\n };\n\n quote {\n impl$generics_declarations $crate::serialization::Deserialize for $typ\n $where_deserialize_clause\n {\n let N: u32 = $right_hand_side_of_definition_of_n;\n\n fn deserialize(fields: [Field; Self::N]) -> Self {\n let mut reader = $crate::reader::Reader::new(fields);\n let result = Self::stream_deserialize(&mut reader);\n reader.finish();\n result\n }\n\n #[inline_always]\n fn stream_deserialize<let K: u32>(reader: &mut $crate::reader::Reader<K>) -> Self {\n $function_body\n }\n }\n }\n}\n\n/// Generates a quoted expression that computes the total serialized length of function parameters.\n///\n/// # Parameters\n/// * `params` - An array of tuples where each tuple contains a quoted parameter name and its Type. The type needs\n/// to implement the Serialize trait.\n///\n/// # Returns\n/// A quoted expression that evaluates to:\n/// * `0` if there are no parameters\n/// * `(<type1 as Serialize>::N + <type2 as Serialize>::N + ...)` for one or more parameters\ncomptime fn get_params_len_quote(params: [(Quoted, Type)]) -> Quoted {\n if params.len() == 0 {\n quote { 0 }\n } else {\n let params_quote_without_parentheses = params\n .map(|(_, param_type): (Quoted, Type)| {\n quote {\n <$param_type as $crate::serialization::Serialize>::N\n }\n })\n .join(quote {+});\n quote { ($params_quote_without_parentheses) }\n }\n}\n\ncomptime fn get_generics_declarations(s: TypeDefinition) -> Quoted {\n let generics = s.generics();\n\n if generics.len() > 0 {\n let generics_declarations_items = generics\n .map(|(name, maybe_integer_typ)| {\n // The second item in the generics tuple is an Option of an integer type that is Some only if\n // the generic is numeric.\n if maybe_integer_typ.is_some() {\n // The generic is numeric, so we return a quote defined as e.g. \"let N: u32\"\n let integer_type = maybe_integer_typ.unwrap();\n quote {let $name: $integer_type}\n } else {\n // The generic is not numeric, so we return a quote containing the name of the generic (e.g. \"T\")\n quote {$name}\n }\n })\n .join(quote {,});\n quote {<$generics_declarations_items>}\n } else {\n // The struct doesn't have any generics defined, so we just return an empty quote.\n quote {}\n }\n}\n\ncomptime fn get_where_trait_clause(s: TypeDefinition, trait_name: Quoted) -> Quoted {\n let generics = s.generics();\n\n // The second item in the generics tuple is an Option of an integer type that is Some only if the generic is\n // numeric.\n let non_numeric_generics =\n generics.filter(|(_, maybe_integer_typ)| maybe_integer_typ.is_none());\n\n if non_numeric_generics.len() > 0 {\n let non_numeric_generics_declarations =\n non_numeric_generics.map(|(name, _)| quote {$name: $trait_name}).join(quote {,});\n quote {where $non_numeric_generics_declarations}\n } else {\n // There are no non-numeric generics, so we return an empty quote.\n quote {}\n }\n}\n"
|
|
3594
2899
|
},
|
|
3595
|
-
"
|
|
3596
|
-
"path": "/home/aztec-dev/aztec-packages/noir-projects/noir-protocol-circuits/crates/
|
|
3597
|
-
"source": "pub fn field_from_bytes<let N: u32>(bytes: [u8; N], big_endian: bool) -> Field {\n assert(bytes.len() < 32, \"field_from_bytes: N must be less than 32\");\n let mut as_field = 0;\n let mut offset = 1;\n for i in 0..N {\n let mut index = i;\n if big_endian {\n index = N - i - 1;\n }\n as_field += (bytes[index] as Field) * offset;\n offset *= 256;\n }\n\n as_field\n}\n\n// Convert a 32 byte array to a field element by truncating the final byte\npub fn field_from_bytes_32_trunc(bytes32: [u8; 32]) -> Field {\n // Convert it to a field element\n let mut v = 1;\n let mut high = 0 as Field;\n let mut low = 0 as Field;\n\n for i in 0..15 {\n // covers bytes 16..30 (31 is truncated and ignored)\n low = low + (bytes32[15 + 15 - i] as Field) * v;\n v = v * 256;\n // covers bytes 0..14\n high = high + (bytes32[14 - i] as Field) * v;\n }\n // covers byte 15\n low = low + (bytes32[15] as Field) * v;\n\n low + high * v\n}\n\n// TODO to radix returns u8, so we cannot use bigger radixes. It'd be ideal to use a radix of the maximum range-constrained integer noir supports\npub fn full_field_less_than(lhs: Field, rhs: Field) -> bool {\n lhs.lt(rhs)\n}\n\npub fn full_field_greater_than(lhs: Field, rhs: Field) -> bool {\n rhs.lt(lhs)\n}\n\npub fn min(f1: Field, f2: Field) -> Field {\n if f1.lt(f2) {\n f1\n } else {\n f2\n }\n}\n\n// TODO: write doc-comments and tests for these magic constants.\n\nglobal KNOWN_NON_RESIDUE: Field = 5; // This is a non-residue in Noir's native Field.\nglobal C1: u32 = 28;\nglobal C3: Field = 40770029410420498293352137776570907027550720424234931066070132305055;\nglobal C5: Field = 19103219067921713944291392827692070036145651957329286315305642004821462161904;\n\n// @dev: only use this for _huge_ exponents y, when writing a constrained function.\n// If you're only exponentiating by a small value, first consider writing-out the multiplications by hand.\n// Only after you've measured the gates of that approach, consider using the native Field::pow_32 function.\n// Only if your exponent is larger than 32 bits, resort to using this function.\npub fn pow(x: Field, y: Field) -> Field {\n let mut r = 1 as Field;\n let b: [u1; 254] = y.to_le_bits();\n\n for i in 0..254 {\n r *= r;\n r *= (b[254 - 1 - i] as Field) * x + (1 - b[254 - 1 - i] as Field);\n }\n\n r\n}\n\n/// Returns Option::some(sqrt) if there is a square root, and Option::none() if there isn't.\npub fn sqrt(x: Field) -> Option<Field> {\n // Safety: if the hint returns the square root of x, then we simply square it\n // check the result equals x. If x is not square, we return a value that\n // enables us to prove that fact (see the `else` clause below).\n let (is_sq, maybe_sqrt) = unsafe { __sqrt(x) };\n\n if is_sq {\n let sqrt = maybe_sqrt;\n validate_sqrt_hint(x, sqrt);\n Option::some(sqrt)\n } else {\n let not_sqrt_hint = maybe_sqrt;\n validate_not_sqrt_hint(x, not_sqrt_hint);\n Option::none()\n }\n}\n\n// Boolean indicating whether Field element is a square, i.e. whether there exists a y in Field s.t. x = y*y.\nunconstrained fn is_square(x: Field) -> bool {\n let v = pow(x, -1 / 2);\n v * (v - 1) == 0\n}\n\n// Tonelli-Shanks algorithm for computing the square root of a Field element.\n// Requires C1 = max{c: 2^c divides (p-1)}, where p is the order of Field\n// as well as C3 = (C2 - 1)/2, where C2 = (p-1)/(2^c1),\n// and C5 = ZETA^C2, where ZETA is a non-square element of Field.\n// These are pre-computed above as globals.\nunconstrained fn tonelli_shanks_sqrt(x: Field) -> Field {\n let mut z = pow(x, C3);\n let mut t = z * z * x;\n z *= x;\n let mut b = t;\n let mut c = C5;\n\n for i in 0..(C1 - 1) {\n for _j in 1..(C1 - i - 1) {\n b *= b;\n }\n\n z *= if b == 1 { 1 } else { c };\n\n c *= c;\n\n t *= if b == 1 { 1 } else { c };\n\n b = t;\n }\n\n z\n}\n\n// NB: this doesn't return an option, because in the case of there _not_ being a square root, we still want to return a field element that allows us to then assert in the _constrained_ sqrt function that there is no sqrt.\nunconstrained fn __sqrt(x: Field) -> (bool, Field) {\n let is_sq = is_square(x);\n if is_sq {\n let sqrt = tonelli_shanks_sqrt(x);\n (true, sqrt)\n } else {\n // Demonstrate that x is not a square (a.k.a. a \"quadratic non-residue\").\n // Facts:\n // The Legendre symbol (\"LS\") of x, is x^((p-1)/2) (mod p).\n // - If x is a square, LS(x) = 1\n // - If x is not a square, LS(x) = -1\n // - If x = 0, LS(x) = 0.\n //\n // Hence:\n // sq * sq = sq // 1 * 1 = 1\n // non-sq * non-sq = sq // -1 * -1 = 1\n // sq * non-sq = non-sq // -1 * 1 = -1\n //\n // See: https://en.wikipedia.org/wiki/Legendre_symbol\n let demo_x_not_square = x * KNOWN_NON_RESIDUE;\n let not_sqrt = tonelli_shanks_sqrt(demo_x_not_square);\n (false, not_sqrt)\n }\n}\n\nfn validate_sqrt_hint(x: Field, hint: Field) {\n assert(hint * hint == x, f\"The claimed_sqrt {hint} is not the sqrt of x {x}\");\n}\n\nfn validate_not_sqrt_hint(x: Field, hint: Field) {\n // We need this assertion, because x = 0 would pass the other assertions in this\n // function, and we don't want people to be able to prove that 0 is not square!\n assert(x != 0, \"0 has a square root; you cannot claim it is not square\");\n // Demonstrate that x is not a square (a.k.a. a \"quadratic non-residue\").\n //\n // Facts:\n // The Legendre symbol (\"LS\") of x, is x^((p-1)/2) (mod p).\n // - If x is a square, LS(x) = 1\n // - If x is not a square, LS(x) = -1\n // - If x = 0, LS(x) = 0.\n //\n // Hence:\n // 1. sq * sq = sq // 1 * 1 = 1\n // 2. non-sq * non-sq = sq // -1 * -1 = 1\n // 3. sq * non-sq = non-sq // -1 * 1 = -1\n //\n // See: https://en.wikipedia.org/wiki/Legendre_symbol\n //\n // We want to demonstrate that this below multiplication falls under bullet-point (2):\n let demo_x_not_square = x * KNOWN_NON_RESIDUE;\n // I.e. we want to demonstrate that `demo_x_not_square` has Legendre symbol 1\n // (i.e. that it is a square), so we prove that it is square below.\n // Why do we want to prove that it has LS 1?\n // Well, since it was computed with a known-non-residue, its squareness implies we're\n // in case 2 (something multiplied by a known-non-residue yielding a result which\n // has a LS of 1), which implies that x must be a non-square. The unconstrained\n // function gave us the sqrt of demo_x_not_square, so all we need to do is\n // assert its squareness:\n assert(\n hint * hint == demo_x_not_square,\n f\"The hint {hint} does not demonstrate that {x} is not a square\",\n );\n}\n\n#[test]\nunconstrained fn bytes_field_test() {\n // Tests correctness of field_from_bytes_32_trunc against existing methods\n // Bytes representing 0x543e0a6642ffeb8039296861765a53407bba62bd1c97ca43374de950bbe0a7\n let inputs = [\n 84, 62, 10, 102, 66, 255, 235, 128, 57, 41, 104, 97, 118, 90, 83, 64, 123, 186, 98, 189, 28,\n 151, 202, 67, 55, 77, 233, 80, 187, 224, 167,\n ];\n let field = field_from_bytes(inputs, true);\n let return_bytes: [u8; 31] = field.to_be_bytes();\n assert_eq(inputs, return_bytes);\n // 32 bytes - we remove the final byte, and check it matches the field\n let inputs2 = [\n 84, 62, 10, 102, 66, 255, 235, 128, 57, 41, 104, 97, 118, 90, 83, 64, 123, 186, 98, 189, 28,\n 151, 202, 67, 55, 77, 233, 80, 187, 224, 167, 158,\n ];\n let field2 = field_from_bytes_32_trunc(inputs2);\n let return_bytes2: [u8; 31] = field2.to_be_bytes();\n\n assert_eq(return_bytes2, return_bytes);\n assert_eq(field2, field);\n}\n\n#[test]\nunconstrained fn max_field_test() {\n // Tests the hardcoded value in constants.nr vs underlying modulus\n // NB: We can't use 0-1 in constants.nr as it will be transpiled incorrectly to ts and sol constants files\n let max_value = crate::constants::MAX_FIELD_VALUE;\n assert_eq(max_value, 0 - 1);\n // modulus == 0 is tested elsewhere, so below is more of a sanity check\n let max_bytes: [u8; 32] = max_value.to_be_bytes();\n let mod_bytes = std::field::modulus_be_bytes();\n for i in 0..31 {\n assert_eq(max_bytes[i], mod_bytes[i]);\n }\n assert_eq(max_bytes[31], mod_bytes[31] - 1);\n}\n\n#[test]\nunconstrained fn sqrt_valid_test() {\n let x = 16; // examples: 16, 9, 25, 81\n let result = sqrt(x);\n assert(result.is_some());\n assert_eq(result.unwrap() * result.unwrap(), x);\n}\n\n#[test]\nunconstrained fn sqrt_invalid_test() {\n let x = KNOWN_NON_RESIDUE; // has no square root in the field\n let result = sqrt(x);\n assert(result.is_none());\n}\n\n#[test]\nunconstrained fn sqrt_zero_test() {\n let result = sqrt(0);\n assert(result.is_some());\n assert_eq(result.unwrap(), 0);\n}\n\n#[test]\nunconstrained fn sqrt_one_test() {\n let result = sqrt(1);\n assert(result.is_some());\n assert_eq(result.unwrap() * result.unwrap(), 1);\n}\n\n#[test]\nunconstrained fn field_from_bytes_empty_test() {\n let empty: [u8; 0] = [];\n let result = field_from_bytes(empty, true);\n assert_eq(result, 0);\n\n let result_le = field_from_bytes(empty, false);\n assert_eq(result_le, 0);\n}\n\n#[test]\nunconstrained fn field_from_bytes_little_endian_test() {\n // Test little-endian conversion: [0x01, 0x02] should be 0x0201 = 513\n let bytes = [0x01, 0x02];\n let result_le = field_from_bytes(bytes, false);\n assert_eq(result_le, 0x0201);\n\n // Compare with big-endian: [0x01, 0x02] should be 0x0102 = 258\n let result_be = field_from_bytes(bytes, true);\n assert_eq(result_be, 0x0102);\n}\n\n#[test]\nunconstrained fn pow_test() {\n assert_eq(pow(2, 0), 1);\n assert_eq(pow(2, 1), 2);\n assert_eq(pow(2, 10), 1024);\n assert_eq(pow(3, 5), 243);\n assert_eq(pow(0, 5), 0);\n assert_eq(pow(1, 100), 1);\n}\n\n#[test]\nunconstrained fn min_test() {\n assert_eq(min(5, 10), 5);\n assert_eq(min(10, 5), 5);\n assert_eq(min(7, 7), 7);\n assert_eq(min(0, 1), 0);\n}\n\n#[test]\nunconstrained fn full_field_comparison_test() {\n assert(full_field_less_than(5, 10));\n assert(!full_field_less_than(10, 5));\n assert(!full_field_less_than(5, 5));\n\n assert(full_field_greater_than(10, 5));\n assert(!full_field_greater_than(5, 10));\n assert(!full_field_greater_than(5, 5));\n}\n\n#[test]\nunconstrained fn sqrt_has_two_roots_test() {\n // Every square has two roots: r and -r (i.e., p - r)\n // sqrt(16) can return 4 or -4\n let x = 16;\n let result = sqrt(x).unwrap();\n assert(result * result == x);\n // The other root is -result\n let other_root = 0 - result;\n assert(other_root * other_root == x);\n // Verify they are different (unless x = 0)\n assert(result != other_root);\n\n // Same for 9: roots are 3 and -3\n let y = 9;\n let result_y = sqrt(y).unwrap();\n assert(result_y * result_y == y);\n let other_root_y = 0 - result_y;\n assert(other_root_y * other_root_y == y);\n assert(result_y != other_root_y);\n}\n\n#[test]\nunconstrained fn sqrt_negative_one_test() {\n let x = 0 - 1;\n let result = sqrt(x);\n assert(result.unwrap() == 0x30644e72e131a029048b6e193fd841045cea24f6fd736bec231204708f703636);\n}\n\n#[test]\nunconstrained fn validate_sqrt_hint_valid_test() {\n // 4 is a valid sqrt of 16\n validate_sqrt_hint(16, 4);\n // -4 is also a valid sqrt of 16\n validate_sqrt_hint(16, 0 - 4);\n // 0 is a valid sqrt of 0\n validate_sqrt_hint(0, 0);\n // 1 is a valid sqrt of 1\n validate_sqrt_hint(1, 1);\n // -1 is also a valid sqrt of 1\n validate_sqrt_hint(1, 0 - 1);\n}\n\n#[test(should_fail_with = \"is not the sqrt of x\")]\nunconstrained fn validate_sqrt_hint_invalid_test() {\n // 5 is not a valid sqrt of 16\n validate_sqrt_hint(16, 5);\n}\n\n#[test]\nunconstrained fn validate_not_sqrt_hint_valid_test() {\n // 5 (KNOWN_NON_RESIDUE) is not a square.\n let x = KNOWN_NON_RESIDUE;\n let hint = tonelli_shanks_sqrt(x * KNOWN_NON_RESIDUE);\n validate_not_sqrt_hint(x, hint);\n}\n\n#[test(should_fail_with = \"0 has a square root\")]\nunconstrained fn validate_not_sqrt_hint_zero_test() {\n // 0 has a square root, so we cannot claim it is not square\n validate_not_sqrt_hint(0, 0);\n}\n\n#[test(should_fail_with = \"does not demonstrate that\")]\nunconstrained fn validate_not_sqrt_hint_wrong_hint_test() {\n // Provide a wrong hint for a non-square\n let x = KNOWN_NON_RESIDUE;\n validate_not_sqrt_hint(x, 123);\n}\n"
|
|
3598
|
-
},
|
|
3599
|
-
"405": {
|
|
3600
|
-
"path": "/home/aztec-dev/aztec-packages/noir-projects/noir-protocol-circuits/crates/types/src/utils/reader.nr",
|
|
3601
|
-
"source": "pub struct Reader<let N: u32> {\n data: [Field; N],\n offset: u32,\n}\n\nimpl<let N: u32> Reader<N> {\n pub fn new(data: [Field; N]) -> Self {\n Self { data, offset: 0 }\n }\n\n pub fn read(&mut self) -> Field {\n let result = self.data[self.offset];\n self.offset += 1;\n result\n }\n\n pub fn read_u32(&mut self) -> u32 {\n self.read() as u32\n }\n\n pub fn read_u64(&mut self) -> u64 {\n self.read() as u64\n }\n\n pub fn read_bool(&mut self) -> bool {\n self.read() != 0\n }\n\n pub fn read_array<let K: u32>(&mut self) -> [Field; K] {\n let mut result = [0; K];\n for i in 0..K {\n result[i] = self.data[self.offset + i];\n }\n self.offset += K;\n result\n }\n\n pub fn read_struct<T, let K: u32>(&mut self, deserialise: fn([Field; K]) -> T) -> T {\n let result = deserialise(self.read_array());\n result\n }\n\n pub fn read_struct_array<T, let K: u32, let C: u32>(\n &mut self,\n deserialise: fn([Field; K]) -> T,\n mut result: [T; C],\n ) -> [T; C] {\n for i in 0..C {\n result[i] = self.read_struct(deserialise);\n }\n result\n }\n\n pub fn finish(self) {\n assert_eq(self.offset, self.data.len(), \"Reader did not read all data\");\n }\n}\n"
|
|
3602
|
-
},
|
|
3603
|
-
"42": {
|
|
3604
|
-
"path": "std/option.nr",
|
|
3605
|
-
"source": "use crate::cmp::{Eq, Ord, Ordering};\nuse crate::default::Default;\nuse crate::hash::{Hash, Hasher};\n\npub struct Option<T> {\n _is_some: bool,\n _value: T,\n}\n\nimpl<T> Option<T> {\n /// Constructs a None value\n pub fn none() -> Self {\n Self { _is_some: false, _value: crate::mem::zeroed() }\n }\n\n /// Constructs a Some wrapper around the given value\n pub fn some(_value: T) -> Self {\n Self { _is_some: true, _value }\n }\n\n /// True if this Option is None\n pub fn is_none(self) -> bool {\n !self._is_some\n }\n\n /// True if this Option is Some\n pub fn is_some(self) -> bool {\n self._is_some\n }\n\n /// Asserts `self.is_some()` and returns the wrapped value.\n pub fn unwrap(self) -> T {\n assert(self._is_some);\n self._value\n }\n\n /// Returns the inner value without asserting `self.is_some()`\n /// Note that if `self` is `None`, there is no guarantee what value will be returned,\n /// only that it will be of type `T`.\n pub fn unwrap_unchecked(self) -> T {\n self._value\n }\n\n /// Returns the wrapped value if `self.is_some()`. Otherwise, returns the given default value.\n pub fn unwrap_or(self, default: T) -> T {\n if self._is_some {\n self._value\n } else {\n default\n }\n }\n\n /// Returns the wrapped value if `self.is_some()`. Otherwise, calls the given function to return\n /// a default value.\n pub fn unwrap_or_else<Env>(self, default: fn[Env]() -> T) -> T {\n if self._is_some {\n self._value\n } else {\n default()\n }\n }\n\n /// Asserts `self.is_some()` with a provided custom message and returns the contained `Some` value\n pub fn expect<let N: u32, MessageTypes>(self, message: fmtstr<N, MessageTypes>) -> T {\n assert(self.is_some(), message);\n self._value\n }\n\n /// If self is `Some(x)`, this returns `Some(f(x))`. Otherwise, this returns `None`.\n pub fn map<U, Env>(self, f: fn[Env](T) -> U) -> Option<U> {\n if self._is_some {\n Option::some(f(self._value))\n } else {\n Option::none()\n }\n }\n\n /// If self is `Some(x)`, this returns `f(x)`. Otherwise, this returns the given default value.\n pub fn map_or<U, Env>(self, default: U, f: fn[Env](T) -> U) -> U {\n if self._is_some {\n f(self._value)\n } else {\n default\n }\n }\n\n /// If self is `Some(x)`, this returns `f(x)`. Otherwise, this returns `default()`.\n pub fn map_or_else<U, Env1, Env2>(self, default: fn[Env1]() -> U, f: fn[Env2](T) -> U) -> U {\n if self._is_some {\n f(self._value)\n } else {\n default()\n }\n }\n\n /// Returns None if self is None. Otherwise, this returns `other`.\n pub fn and(self, other: Self) -> Self {\n if self.is_none() {\n Option::none()\n } else {\n other\n }\n }\n\n /// If self is None, this returns None. Otherwise, this calls the given function\n /// with the Some value contained within self, and returns the result of that call.\n ///\n /// In some languages this function is called `flat_map` or `bind`.\n pub fn and_then<U, Env>(self, f: fn[Env](T) -> Option<U>) -> Option<U> {\n if self._is_some {\n f(self._value)\n } else {\n Option::none()\n }\n }\n\n /// If self is Some, return self. Otherwise, return `other`.\n pub fn or(self, other: Self) -> Self {\n if self._is_some {\n self\n } else {\n other\n }\n }\n\n /// If self is Some, return self. Otherwise, return `default()`.\n pub fn or_else<Env>(self, default: fn[Env]() -> Self) -> Self {\n if self._is_some {\n self\n } else {\n default()\n }\n }\n\n // If only one of the two Options is Some, return that option.\n // Otherwise, if both options are Some or both are None, None is returned.\n pub fn xor(self, other: Self) -> Self {\n if self._is_some {\n if other._is_some {\n Option::none()\n } else {\n self\n }\n } else if other._is_some {\n other\n } else {\n Option::none()\n }\n }\n\n /// Returns `Some(x)` if self is `Some(x)` and `predicate(x)` is true.\n /// Otherwise, this returns `None`\n pub fn filter<Env>(self, predicate: fn[Env](T) -> bool) -> Self {\n if self._is_some {\n if predicate(self._value) {\n self\n } else {\n Option::none()\n }\n } else {\n Option::none()\n }\n }\n\n /// Flattens an Option<Option<T>> into a Option<T>.\n /// This returns None if the outer Option is None. Otherwise, this returns the inner Option.\n pub fn flatten(option: Option<Option<T>>) -> Option<T> {\n if option._is_some {\n option._value\n } else {\n Option::none()\n }\n }\n}\n\nimpl<T> Default for Option<T> {\n fn default() -> Self {\n Option::none()\n }\n}\n\nimpl<T> Eq for Option<T>\nwhere\n T: Eq,\n{\n fn eq(self, other: Self) -> bool {\n if self._is_some == other._is_some {\n if self._is_some {\n self._value == other._value\n } else {\n true\n }\n } else {\n false\n }\n }\n}\n\nimpl<T> Hash for Option<T>\nwhere\n T: Hash,\n{\n fn hash<H>(self, state: &mut H)\n where\n H: Hasher,\n {\n self._is_some.hash(state);\n if self._is_some {\n self._value.hash(state);\n }\n }\n}\n\n// For this impl we're declaring Option::none < Option::some\nimpl<T> Ord for Option<T>\nwhere\n T: Ord,\n{\n fn cmp(self, other: Self) -> Ordering {\n if self._is_some {\n if other._is_some {\n self._value.cmp(other._value)\n } else {\n Ordering::greater()\n }\n } else if other._is_some {\n Ordering::less()\n } else {\n Ordering::equal()\n }\n }\n}\n"
|
|
3606
|
-
},
|
|
3607
|
-
"43": {
|
|
3608
|
-
"path": "std/panic.nr",
|
|
3609
|
-
"source": "pub fn panic<T, U>(message: T) -> U\nwhere\n T: StringLike,\n{\n assert(false, message);\n crate::mem::zeroed()\n}\n\ntrait StringLike {}\n\nimpl<let N: u32> StringLike for str<N> {}\nimpl<let N: u32, T> StringLike for fmtstr<N, T> {}\n"
|
|
2900
|
+
"456": {
|
|
2901
|
+
"path": "/home/aztec-dev/aztec-packages/noir-projects/noir-protocol-circuits/crates/serde/src/type_impls.nr",
|
|
2902
|
+
"source": "use crate::{reader::Reader, serialization::{Deserialize, Serialize}, writer::Writer};\nuse std::embedded_curve_ops::EmbeddedCurvePoint;\nuse std::embedded_curve_ops::EmbeddedCurveScalar;\n\nglobal U1_SERIALIZED_LEN: u32 = 1;\nglobal BOOL_SERIALIZED_LEN: u32 = 1;\nglobal U8_SERIALIZED_LEN: u32 = 1;\nglobal U16_SERIALIZED_LEN: u32 = 1;\nglobal U32_SERIALIZED_LEN: u32 = 1;\nglobal U64_SERIALIZED_LEN: u32 = 1;\nglobal U128_SERIALIZED_LEN: u32 = 1;\nglobal FIELD_SERIALIZED_LEN: u32 = 1;\nglobal I8_SERIALIZED_LEN: u32 = 1;\nglobal I16_SERIALIZED_LEN: u32 = 1;\nglobal I32_SERIALIZED_LEN: u32 = 1;\nglobal I64_SERIALIZED_LEN: u32 = 1;\n\nimpl Serialize for bool {\n let N: u32 = BOOL_SERIALIZED_LEN;\n\n fn serialize(self) -> [Field; Self::N] {\n let mut writer: Writer<Self::N> = Writer::new();\n self.stream_serialize(&mut writer);\n writer.finish()\n }\n\n #[inline_always]\n fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>) {\n writer.write(self as Field);\n }\n}\n\nimpl Deserialize for bool {\n let N: u32 = BOOL_SERIALIZED_LEN;\n\n fn deserialize(fields: [Field; Self::N]) -> Self {\n let mut reader = Reader::new(fields);\n let result = Self::stream_deserialize(&mut reader);\n reader.finish();\n result\n }\n\n #[inline_always]\n fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> bool {\n reader.read() != 0\n }\n}\n\nimpl Serialize for u1 {\n let N: u32 = U1_SERIALIZED_LEN;\n\n fn serialize(self) -> [Field; Self::N] {\n let mut writer: Writer<Self::N> = Writer::new();\n self.stream_serialize(&mut writer);\n writer.finish()\n }\n\n #[inline_always]\n fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>) {\n writer.write(self as Field);\n }\n}\n\nimpl Deserialize for u1 {\n let N: u32 = U1_SERIALIZED_LEN;\n\n fn deserialize(fields: [Field; Self::N]) -> Self {\n let mut reader = Reader::new(fields);\n let result = Self::stream_deserialize(&mut reader);\n reader.finish();\n result\n }\n\n #[inline_always]\n fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> Self {\n reader.read() as u1\n }\n}\n\nimpl Serialize for u8 {\n let N: u32 = U8_SERIALIZED_LEN;\n\n fn serialize(self) -> [Field; Self::N] {\n let mut writer: Writer<Self::N> = Writer::new();\n self.stream_serialize(&mut writer);\n writer.finish()\n }\n\n #[inline_always]\n fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>) {\n writer.write(self as Field);\n }\n}\n\nimpl Deserialize for u8 {\n let N: u32 = U8_SERIALIZED_LEN;\n\n fn deserialize(fields: [Field; Self::N]) -> Self {\n let mut reader = Reader::new(fields);\n let result = Self::stream_deserialize(&mut reader);\n reader.finish();\n result\n }\n\n #[inline_always]\n fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> Self {\n reader.read() as u8\n }\n}\n\nimpl Serialize for u16 {\n let N: u32 = U16_SERIALIZED_LEN;\n\n fn serialize(self) -> [Field; Self::N] {\n let mut writer: Writer<Self::N> = Writer::new();\n self.stream_serialize(&mut writer);\n writer.finish()\n }\n\n #[inline_always]\n fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>) {\n writer.write(self as Field);\n }\n}\n\nimpl Deserialize for u16 {\n let N: u32 = U16_SERIALIZED_LEN;\n\n fn deserialize(fields: [Field; Self::N]) -> Self {\n let mut reader = Reader::new(fields);\n let result = Self::stream_deserialize(&mut reader);\n reader.finish();\n result\n }\n\n #[inline_always]\n fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> Self {\n reader.read() as u16\n }\n}\n\nimpl Serialize for u32 {\n let N: u32 = U32_SERIALIZED_LEN;\n\n fn serialize(self) -> [Field; Self::N] {\n let mut writer: Writer<Self::N> = Writer::new();\n self.stream_serialize(&mut writer);\n writer.finish()\n }\n\n #[inline_always]\n fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>) {\n writer.write(self as Field);\n }\n}\n\nimpl Deserialize for u32 {\n let N: u32 = U32_SERIALIZED_LEN;\n\n fn deserialize(fields: [Field; Self::N]) -> Self {\n let mut reader = Reader::new(fields);\n let result = Self::stream_deserialize(&mut reader);\n reader.finish();\n result\n }\n\n #[inline_always]\n fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> Self {\n reader.read() as u32\n }\n}\n\nimpl Serialize for u64 {\n let N: u32 = U64_SERIALIZED_LEN;\n\n fn serialize(self) -> [Field; Self::N] {\n let mut writer: Writer<Self::N> = Writer::new();\n self.stream_serialize(&mut writer);\n writer.finish()\n }\n\n #[inline_always]\n fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>) {\n writer.write(self as Field);\n }\n}\n\nimpl Deserialize for u64 {\n let N: u32 = U64_SERIALIZED_LEN;\n\n fn deserialize(fields: [Field; Self::N]) -> Self {\n let mut reader = Reader::new(fields);\n let result = Self::stream_deserialize(&mut reader);\n reader.finish();\n result\n }\n\n #[inline_always]\n fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> Self {\n reader.read() as u64\n }\n}\n\nimpl Serialize for u128 {\n let N: u32 = U128_SERIALIZED_LEN;\n\n fn serialize(self) -> [Field; Self::N] {\n let mut writer: Writer<Self::N> = Writer::new();\n self.stream_serialize(&mut writer);\n writer.finish()\n }\n\n #[inline_always]\n fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>) {\n writer.write(self as Field);\n }\n}\n\nimpl Deserialize for u128 {\n let N: u32 = U128_SERIALIZED_LEN;\n\n fn deserialize(fields: [Field; Self::N]) -> Self {\n let mut reader = Reader::new(fields);\n let result = Self::stream_deserialize(&mut reader);\n reader.finish();\n result\n }\n\n #[inline_always]\n fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> Self {\n reader.read() as u128\n }\n}\n\nimpl Serialize for Field {\n let N: u32 = FIELD_SERIALIZED_LEN;\n\n fn serialize(self) -> [Field; Self::N] {\n let mut writer: Writer<Self::N> = Writer::new();\n self.stream_serialize(&mut writer);\n writer.finish()\n }\n\n #[inline_always]\n fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>) {\n writer.write(self);\n }\n}\n\nimpl Deserialize for Field {\n let N: u32 = FIELD_SERIALIZED_LEN;\n\n fn deserialize(fields: [Field; Self::N]) -> Self {\n let mut reader = Reader::new(fields);\n let result = Self::stream_deserialize(&mut reader);\n reader.finish();\n result\n }\n\n #[inline_always]\n fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> Self {\n reader.read()\n }\n}\n\nimpl Serialize for i8 {\n let N: u32 = I8_SERIALIZED_LEN;\n\n fn serialize(self) -> [Field; Self::N] {\n let mut writer: Writer<Self::N> = Writer::new();\n self.stream_serialize(&mut writer);\n writer.finish()\n }\n\n #[inline_always]\n fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>) {\n writer.write(self as u8 as Field);\n }\n}\n\nimpl Deserialize for i8 {\n let N: u32 = I8_SERIALIZED_LEN;\n\n fn deserialize(fields: [Field; Self::N]) -> Self {\n let mut reader = Reader::new(fields);\n let result = Self::stream_deserialize(&mut reader);\n reader.finish();\n result\n }\n\n #[inline_always]\n fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> Self {\n reader.read() as u8 as i8\n }\n}\n\nimpl Serialize for i16 {\n let N: u32 = I16_SERIALIZED_LEN;\n\n fn serialize(self) -> [Field; Self::N] {\n let mut writer: Writer<Self::N> = Writer::new();\n self.stream_serialize(&mut writer);\n writer.finish()\n }\n\n #[inline_always]\n fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>) {\n writer.write(self as u16 as Field);\n }\n}\n\nimpl Deserialize for i16 {\n let N: u32 = I16_SERIALIZED_LEN;\n\n fn deserialize(fields: [Field; Self::N]) -> Self {\n let mut reader = Reader::new(fields);\n let result = Self::stream_deserialize(&mut reader);\n reader.finish();\n result\n }\n\n #[inline_always]\n fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> Self {\n reader.read() as u16 as i16\n }\n}\n\nimpl Serialize for i32 {\n let N: u32 = I32_SERIALIZED_LEN;\n\n fn serialize(self) -> [Field; Self::N] {\n let mut writer: Writer<Self::N> = Writer::new();\n self.stream_serialize(&mut writer);\n writer.finish()\n }\n\n #[inline_always]\n fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>) {\n writer.write(self as u32 as Field);\n }\n}\n\nimpl Deserialize for i32 {\n let N: u32 = I32_SERIALIZED_LEN;\n\n fn deserialize(fields: [Field; Self::N]) -> Self {\n let mut reader = Reader::new(fields);\n let result = Self::stream_deserialize(&mut reader);\n reader.finish();\n result\n }\n\n #[inline_always]\n fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> Self {\n reader.read() as u32 as i32\n }\n}\n\nimpl Serialize for i64 {\n let N: u32 = I64_SERIALIZED_LEN;\n\n fn serialize(self) -> [Field; Self::N] {\n let mut writer: Writer<Self::N> = Writer::new();\n self.stream_serialize(&mut writer);\n writer.finish()\n }\n\n #[inline_always]\n fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>) {\n writer.write(self as u64 as Field);\n }\n}\n\nimpl Deserialize for i64 {\n let N: u32 = I64_SERIALIZED_LEN;\n\n fn deserialize(fields: [Field; Self::N]) -> Self {\n let mut reader = Reader::new(fields);\n let result = Self::stream_deserialize(&mut reader);\n reader.finish();\n result\n }\n\n #[inline_always]\n fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> Self {\n reader.read() as u64 as i64\n }\n}\n\nimpl<T, let M: u32> Serialize for [T; M]\nwhere\n T: Serialize,\n{\n let N: u32 = <T as Serialize>::N * M;\n\n fn serialize(self) -> [Field; Self::N] {\n let mut writer: Writer<Self::N> = Writer::new();\n self.stream_serialize(&mut writer);\n writer.finish()\n }\n\n #[inline_always]\n fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>) {\n for i in 0..M {\n self[i].stream_serialize(writer);\n }\n }\n}\n\nimpl<T, let M: u32> Deserialize for [T; M]\nwhere\n T: Deserialize,\n{\n let N: u32 = <T as Deserialize>::N * M;\n\n fn deserialize(fields: [Field; Self::N]) -> Self {\n let mut reader = Reader::new(fields);\n let result = Self::stream_deserialize(&mut reader);\n reader.finish();\n result\n }\n\n #[inline_always]\n fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> Self {\n let mut result: [T; M] = std::mem::zeroed();\n for i in 0..M {\n result[i] = T::stream_deserialize(reader);\n }\n result\n }\n}\n\nimpl<T> Serialize for Option<T>\nwhere\n T: Serialize,\n{\n let N: u32 = <T as Serialize>::N + 1;\n\n fn serialize(self) -> [Field; Self::N] {\n let mut writer: Writer<Self::N> = Writer::new();\n self.stream_serialize(&mut writer);\n writer.finish()\n }\n\n #[inline_always]\n fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>) {\n writer.write_bool(self.is_some());\n if self.is_some() {\n self.unwrap_unchecked().stream_serialize(writer);\n } else {\n writer.advance_offset(<T as Serialize>::N);\n }\n }\n}\n\nimpl<T> Deserialize for Option<T>\nwhere\n T: Deserialize,\n{\n let N: u32 = <T as Deserialize>::N + 1;\n\n fn deserialize(fields: [Field; Self::N]) -> Self {\n let mut reader = Reader::new(fields);\n let result = Self::stream_deserialize(&mut reader);\n reader.finish();\n result\n }\n\n #[inline_always]\n fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> Self {\n if reader.read_bool() {\n Option::some(<T as Deserialize>::stream_deserialize(reader))\n } else {\n reader.advance_offset(<T as Deserialize>::N);\n Option::none()\n }\n }\n}\n\nglobal SCALAR_SIZE: u32 = 2;\n\nimpl Serialize for EmbeddedCurveScalar {\n\n let N: u32 = SCALAR_SIZE;\n\n fn serialize(self) -> [Field; SCALAR_SIZE] {\n [self.lo, self.hi]\n }\n\n #[inline_always]\n fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>) {\n writer.write(self.lo);\n writer.write(self.hi);\n }\n}\n\nimpl Deserialize for EmbeddedCurveScalar {\n let N: u32 = SCALAR_SIZE;\n\n fn deserialize(fields: [Field; Self::N]) -> Self {\n Self { lo: fields[0], hi: fields[1] }\n }\n\n #[inline_always]\n fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> Self {\n Self { lo: reader.read(), hi: reader.read() }\n }\n}\n\nglobal POINT_SIZE: u32 = 3;\n\nimpl Serialize for EmbeddedCurvePoint {\n let N: u32 = POINT_SIZE;\n\n fn serialize(self) -> [Field; Self::N] {\n [self.x, self.y, self.is_infinite as Field]\n }\n\n fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>) {\n writer.write(self.x);\n writer.write(self.y);\n writer.write(self.is_infinite as Field);\n }\n}\n\nimpl Deserialize for EmbeddedCurvePoint {\n let N: u32 = POINT_SIZE;\n\n fn deserialize(fields: [Field; Self::N]) -> Self {\n Self { x: fields[0], y: fields[1], is_infinite: fields[2] != 0 }\n }\n\n #[inline_always]\n fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> Self {\n Self { x: reader.read(), y: reader.read(), is_infinite: reader.read_bool() }\n }\n}\n\nimpl<let M: u32> Deserialize for str<M> {\n let N: u32 = M;\n\n fn deserialize(fields: [Field; Self::N]) -> Self {\n let mut reader = Reader::new(fields);\n let result = Self::stream_deserialize(&mut reader);\n reader.finish();\n result\n }\n\n #[inline_always]\n fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> Self {\n let u8_arr = <[u8; Self::N] as Deserialize>::stream_deserialize(reader);\n str::<Self::N>::from(u8_arr)\n }\n}\n\nimpl<let M: u32> Serialize for str<M> {\n let N: u32 = M;\n\n fn serialize(self) -> [Field; Self::N] {\n let mut writer: Writer<Self::N> = Writer::new();\n self.stream_serialize(&mut writer);\n writer.finish()\n }\n\n #[inline_always]\n fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>) {\n self.as_bytes().stream_serialize(writer);\n }\n}\n\n// Note: Not deriving this because it's not supported to call derive_serialize on a \"remote\" struct (and it will never\n// be supported).\nimpl<T, let M: u32> Deserialize for BoundedVec<T, M>\nwhere\n T: Deserialize,\n{\n let N: u32 = <T as Deserialize>::N * M + 1;\n\n fn deserialize(fields: [Field; Self::N]) -> Self {\n let mut reader = Reader::new(fields);\n let result = Self::stream_deserialize(&mut reader);\n reader.finish();\n result\n }\n\n #[inline_always]\n fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> Self {\n let mut new_bounded_vec: BoundedVec<T, M> = BoundedVec::new();\n let payload_len = Self::N - 1;\n\n // Length is stored in the last field as we need to match intrinsic Noir serialization and the `len` struct\n // field is after `storage` struct field (see `bounded_vec.nr` in noir-stdlib)\n let len = reader.peek_offset(payload_len) as u32;\n\n for i in 0..M {\n if i < len {\n new_bounded_vec.push(<T as Deserialize>::stream_deserialize(reader));\n }\n }\n\n // +1 for the length of the BoundedVec\n reader.advance_offset((M - len) * <T as Deserialize>::N + 1);\n\n new_bounded_vec\n }\n}\n\n// This may cause issues if used as program input, because noir disallows empty arrays for program input.\n// I think this is okay because I don't foresee a unit type being used as input. But leaving this comment as a hint\n// if someone does run into this in the future.\nimpl Deserialize for () {\n let N: u32 = 0;\n\n fn deserialize(fields: [Field; Self::N]) -> Self {\n let mut reader = Reader::new(fields);\n let result = Self::stream_deserialize(&mut reader);\n reader.finish();\n result\n }\n\n #[inline_always]\n fn stream_deserialize<let K: u32>(_reader: &mut Reader<K>) -> Self {\n ()\n }\n}\n\n// Note: Not deriving this because it's not supported to call derive_serialize on a \"remote\" struct (and it will never\n// be supported).\nimpl<T, let M: u32> Serialize for BoundedVec<T, M>\nwhere\n T: Serialize,\n{\n let N: u32 = <T as Serialize>::N * M + 1; // +1 for the length of the BoundedVec\n\n fn serialize(self) -> [Field; Self::N] {\n let mut writer: Writer<Self::N> = Writer::new();\n self.stream_serialize(&mut writer);\n writer.finish()\n }\n\n #[inline_always]\n fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>) {\n self.storage().stream_serialize(writer);\n // Length is stored in the last field as we need to match intrinsic Noir serialization and the `len` struct\n // field is after `storage` struct field (see `bounded_vec.nr` in noir-stdlib)\n writer.write_u32(self.len() as u32);\n }\n}\n\n// Create a slice of the given length with each element made from `f(i)` where `i` is the current index\ncomptime fn make_slice<Env, T>(length: u32, f: fn[Env](u32) -> T) -> [T] {\n let mut slice = @[];\n for i in 0..length {\n slice = slice.push_back(f(i));\n }\n slice\n}\n\n// Implements Serialize and Deserialize for an arbitrary tuple type\ncomptime fn impl_serialize_for_tuple(_m: Module, length: u32) -> Quoted {\n // `T0`, `T1`, `T2`\n let type_names = make_slice(length, |i| f\"T{i}\".quoted_contents());\n\n // `result0`, `result1`, `result2`\n let result_names = make_slice(length, |i| f\"result{i}\".quoted_contents());\n\n // `T0, T1, T2`\n let field_generics = type_names.join(quote [,]);\n\n // `<T0 as Serialize>::N + <T1 as Serialize>::N + <T2 as Serialize>::N`\n let full_size_serialize = type_names\n .map(|type_name| quote {\n <$type_name as Serialize>::N\n })\n .join(quote [+]);\n\n // `<T0 as Deserialize>::N + <T1 as Deserialize>::N + <T2 as Deserialize>::N`\n let full_size_deserialize = type_names\n .map(|type_name| quote {\n <$type_name as Deserialize>::N\n })\n .join(quote [+]);\n\n // `T0: Serialize, T1: Serialize, T2: Serialize,`\n let serialize_constraints = type_names\n .map(|field_name| quote {\n $field_name: Serialize,\n })\n .join(quote []);\n\n // `T0: Deserialize, T1: Deserialize, T2: Deserialize,`\n let deserialize_constraints = type_names\n .map(|field_name| quote {\n $field_name: Deserialize,\n })\n .join(quote []);\n\n // Statements to serialize each field\n let serialized_fields = type_names\n .mapi(|i, _type_name| quote {\n $crate::serialization::Serialize::stream_serialize(self.$i, writer);\n })\n .join(quote []);\n\n // Statements to deserialize each field\n let deserialized_fields = type_names\n .mapi(|i, type_name| {\n let result_name = result_names[i];\n quote {\n let $result_name = <$type_name as $crate::serialization::Deserialize>::stream_deserialize(reader);\n }\n })\n .join(quote []);\n let deserialize_results = result_names.join(quote [,]);\n\n quote {\n impl<$field_generics> Serialize for ($field_generics) where $serialize_constraints {\n let N: u32 = $full_size_serialize;\n\n fn serialize(self) -> [Field; Self::N] {\n let mut writer: $crate::writer::Writer<Self::N> = $crate::writer::Writer::new();\n self.stream_serialize(&mut writer);\n writer.finish()\n }\n\n #[inline_always]\n fn stream_serialize<let K: u32>(self, writer: &mut $crate::writer::Writer<K>) {\n\n $serialized_fields\n }\n }\n\n impl<$field_generics> Deserialize for ($field_generics) where $deserialize_constraints {\n let N: u32 = $full_size_deserialize;\n\n fn deserialize(fields: [Field; Self::N]) -> Self {\n let mut reader = $crate::reader::Reader::new(fields);\n let result = Self::stream_deserialize(&mut reader);\n reader.finish();\n result\n }\n \n #[inline_always]\n fn stream_deserialize<let K: u32>(reader: &mut $crate::reader::Reader<K>) -> Self {\n $deserialized_fields\n ($deserialize_results)\n }\n }\n }\n}\n\n// Keeping these manual impls. They are more efficient since they do not\n// require copying sub-arrays from any serialized arrays.\nimpl<T1> Serialize for (T1,)\nwhere\n T1: Serialize,\n{\n let N: u32 = <T1 as Serialize>::N;\n\n fn serialize(self) -> [Field; Self::N] {\n let mut writer: crate::writer::Writer<Self::N> = crate::writer::Writer::new();\n self.stream_serialize(&mut writer);\n writer.finish()\n }\n\n #[inline_always]\n fn stream_serialize<let K: u32>(self, writer: &mut Writer<K>) {\n self.0.stream_serialize(writer);\n }\n}\n\nimpl<T1> Deserialize for (T1,)\nwhere\n T1: Deserialize,\n{\n let N: u32 = <T1 as Deserialize>::N;\n\n fn deserialize(fields: [Field; Self::N]) -> Self {\n let mut reader = crate::reader::Reader::new(fields);\n let result = Self::stream_deserialize(&mut reader);\n reader.finish();\n result\n }\n\n #[inline_always]\n fn stream_deserialize<let K: u32>(reader: &mut Reader<K>) -> Self {\n (<T1 as Deserialize>::stream_deserialize(reader),)\n }\n}\n\n#[impl_serialize_for_tuple(2)]\n#[impl_serialize_for_tuple(3)]\n#[impl_serialize_for_tuple(4)]\n#[impl_serialize_for_tuple(5)]\n#[impl_serialize_for_tuple(6)]\nmod impls {\n use crate::serialization::{Deserialize, Serialize};\n}\n\n#[test]\nunconstrained fn bounded_vec_serialization() {\n // Test empty BoundedVec\n let empty_vec: BoundedVec<Field, 3> = BoundedVec::from_array([]);\n let serialized = empty_vec.serialize();\n let deserialized = BoundedVec::<Field, 3>::deserialize(serialized);\n assert_eq(empty_vec, deserialized);\n assert_eq(deserialized.len(), 0);\n\n // Test partially filled BoundedVec\n let partial_vec: BoundedVec<[u32; 2], 3> = BoundedVec::from_array([[1, 2]]);\n let serialized = partial_vec.serialize();\n let deserialized = BoundedVec::<[u32; 2], 3>::deserialize(serialized);\n assert_eq(partial_vec, deserialized);\n assert_eq(deserialized.len(), 1);\n assert_eq(deserialized.get(0), [1, 2]);\n\n // Test full BoundedVec\n let full_vec: BoundedVec<[u32; 2], 3> = BoundedVec::from_array([[1, 2], [3, 4], [5, 6]]);\n let serialized = full_vec.serialize();\n let deserialized = BoundedVec::<[u32; 2], 3>::deserialize(serialized);\n assert_eq(full_vec, deserialized);\n assert_eq(deserialized.len(), 3);\n assert_eq(deserialized.get(0), [1, 2]);\n assert_eq(deserialized.get(1), [3, 4]);\n assert_eq(deserialized.get(2), [5, 6]);\n}\n"
|
|
3610
2903
|
},
|
|
3611
2904
|
"5": {
|
|
3612
2905
|
"path": "std/cmp.nr",
|
|
3613
|
-
"source": "use crate::meta::derive_via;\n\n#[derive_via(derive_eq)]\n// docs:start:eq-trait\npub trait Eq {\n fn eq(self, other: Self) -> bool;\n}\n// docs:end:eq-trait\n\n// docs:start:derive_eq\ncomptime fn derive_eq(s: TypeDefinition) -> Quoted {\n let signature = quote { fn eq(_self: Self, _other: Self) -> bool };\n let for_each_field = |name| quote { (_self.$name == _other.$name) };\n let body = |fields| {\n if s.fields_as_written().len() == 0 {\n quote { true }\n } else {\n fields\n }\n };\n crate::meta::make_trait_impl(\n s,\n quote { $crate::cmp::Eq },\n signature,\n for_each_field,\n quote { & },\n body,\n )\n}\n// docs:end:derive_eq\n\nimpl Eq for Field {\n fn eq(self, other: Field) -> bool {\n self == other\n }\n}\n\nimpl Eq for u128 {\n fn eq(self, other: u128) -> bool {\n self == other\n }\n}\nimpl Eq for u64 {\n fn eq(self, other: u64) -> bool {\n self == other\n }\n}\nimpl Eq for u32 {\n fn eq(self, other: u32) -> bool {\n self == other\n }\n}\nimpl Eq for u16 {\n fn eq(self, other: u16) -> bool {\n self == other\n }\n}\nimpl Eq for u8 {\n fn eq(self, other: u8) -> bool {\n self == other\n }\n}\nimpl Eq for u1 {\n fn eq(self, other: u1) -> bool {\n self == other\n }\n}\n\nimpl Eq for i8 {\n fn eq(self, other: i8) -> bool {\n self == other\n }\n}\nimpl Eq for i16 {\n fn eq(self, other: i16) -> bool {\n self == other\n }\n}\nimpl Eq for i32 {\n fn eq(self, other: i32) -> bool {\n self == other\n }\n}\nimpl Eq for i64 {\n fn eq(self, other: i64) -> bool {\n self == other\n }\n}\n\nimpl Eq for () {\n fn eq(_self: Self, _other: ()) -> bool {\n true\n }\n}\nimpl Eq for bool {\n fn eq(self, other: bool) -> bool {\n self == other\n }\n}\n\nimpl<T, let N: u32> Eq for [T; N]\nwhere\n T: Eq,\n{\n fn eq(self, other: [T; N]) -> bool {\n let mut result = true;\n for i in 0..self.len() {\n result &= self[i].eq(other[i]);\n }\n result\n }\n}\n\nimpl<T> Eq for [T]\nwhere\n T: Eq,\n{\n fn eq(self, other: [T]) -> bool {\n let mut result = self.len() == other.len();\n if result {\n for i in 0..self.len() {\n result &= self[i].eq(other[i]);\n }\n }\n result\n }\n}\n\nimpl<let N: u32> Eq for str<N> {\n fn eq(self, other: str<N>) -> bool {\n let self_bytes = self.as_bytes();\n let other_bytes = other.as_bytes();\n self_bytes == other_bytes\n }\n}\n\nimpl<A, B> Eq for (A, B)\nwhere\n A: Eq,\n B: Eq,\n{\n fn eq(self, other: (A, B)) -> bool {\n self.0.eq(other.0) & self.1.eq(other.1)\n }\n}\n\nimpl<A, B, C> Eq for (A, B, C)\nwhere\n A: Eq,\n B: Eq,\n C: Eq,\n{\n fn eq(self, other: (A, B, C)) -> bool {\n self.0.eq(other.0) & self.1.eq(other.1) & self.2.eq(other.2)\n }\n}\n\nimpl<A, B, C, D> Eq for (A, B, C, D)\nwhere\n A: Eq,\n B: Eq,\n C: Eq,\n D: Eq,\n{\n fn eq(self, other: (A, B, C, D)) -> bool {\n self.0.eq(other.0) & self.1.eq(other.1) & self.2.eq(other.2) & self.3.eq(other.3)\n }\n}\n\nimpl<A, B, C, D, E> Eq for (A, B, C, D, E)\nwhere\n A: Eq,\n B: Eq,\n C: Eq,\n D: Eq,\n E: Eq,\n{\n fn eq(self, other: (A, B, C, D, E)) -> bool {\n self.0.eq(other.0)\n & self.1.eq(other.1)\n & self.2.eq(other.2)\n & self.3.eq(other.3)\n & self.4.eq(other.4)\n }\n}\n\nimpl Eq for Ordering {\n fn eq(self, other: Ordering) -> bool {\n self.result == other.result\n }\n}\n\n// Noir doesn't have enums yet so we emulate (Lt | Eq | Gt) with a struct\n// that has 3 public functions for constructing the struct.\npub struct Ordering {\n result: Field,\n}\n\nimpl Ordering {\n // Implementation note: 0, 1, and 2 for Lt, Eq, and Gt are built\n // into the compiler, do not change these without also updating\n // the compiler itself!\n pub fn less() -> Ordering {\n Ordering { result: 0 }\n }\n\n pub fn equal() -> Ordering {\n Ordering { result: 1 }\n }\n\n pub fn greater() -> Ordering {\n Ordering { result: 2 }\n }\n}\n\n#[derive_via(derive_ord)]\n// docs:start:ord-trait\npub trait Ord {\n fn cmp(self, other: Self) -> Ordering;\n}\n// docs:end:ord-trait\n\n// docs:start:derive_ord\ncomptime fn derive_ord(s: TypeDefinition) -> Quoted {\n let name = quote { $crate::cmp::Ord };\n let signature = quote { fn cmp(_self: Self, _other: Self) -> $crate::cmp::Ordering };\n let for_each_field = |name| quote {\n if result == $crate::cmp::Ordering::equal() {\n result = _self.$name.cmp(_other.$name);\n }\n };\n let body = |fields| quote {\n let mut result = $crate::cmp::Ordering::equal();\n $fields\n result\n };\n crate::meta::make_trait_impl(s, name, signature, for_each_field, quote {}, body)\n}\n// docs:end:derive_ord\n\n// Note: Field deliberately does not implement Ord\n\nimpl Ord for u128 {\n fn cmp(self, other: u128) -> Ordering {\n if self < other {\n Ordering::less()\n } else if self > other {\n Ordering::greater()\n } else {\n Ordering::equal()\n }\n }\n}\nimpl Ord for u64 {\n fn cmp(self, other: u64) -> Ordering {\n if self < other {\n Ordering::less()\n } else if self > other {\n Ordering::greater()\n } else {\n Ordering::equal()\n }\n }\n}\n\nimpl Ord for u32 {\n fn cmp(self, other: u32) -> Ordering {\n if self < other {\n Ordering::less()\n } else if self > other {\n Ordering::greater()\n } else {\n Ordering::equal()\n }\n }\n}\n\nimpl Ord for u16 {\n fn cmp(self, other: u16) -> Ordering {\n if self < other {\n Ordering::less()\n } else if self > other {\n Ordering::greater()\n } else {\n Ordering::equal()\n }\n }\n}\n\nimpl Ord for u8 {\n fn cmp(self, other: u8) -> Ordering {\n if self < other {\n Ordering::less()\n } else if self > other {\n Ordering::greater()\n } else {\n Ordering::equal()\n }\n }\n}\n\nimpl Ord for i8 {\n fn cmp(self, other: i8) -> Ordering {\n if self < other {\n Ordering::less()\n } else if self > other {\n Ordering::greater()\n } else {\n Ordering::equal()\n }\n }\n}\n\nimpl Ord for i16 {\n fn cmp(self, other: i16) -> Ordering {\n if self < other {\n Ordering::less()\n } else if self > other {\n Ordering::greater()\n } else {\n Ordering::equal()\n }\n }\n}\n\nimpl Ord for i32 {\n fn cmp(self, other: i32) -> Ordering {\n if self < other {\n Ordering::less()\n } else if self > other {\n Ordering::greater()\n } else {\n Ordering::equal()\n }\n }\n}\n\nimpl Ord for i64 {\n fn cmp(self, other: i64) -> Ordering {\n if self < other {\n Ordering::less()\n } else if self > other {\n Ordering::greater()\n } else {\n Ordering::equal()\n }\n }\n}\n\nimpl Ord for () {\n fn cmp(_self: Self, _other: ()) -> Ordering {\n Ordering::equal()\n }\n}\n\nimpl Ord for bool {\n fn cmp(self, other: bool) -> Ordering {\n if self {\n if other {\n Ordering::equal()\n } else {\n Ordering::greater()\n }\n } else if other {\n Ordering::less()\n } else {\n Ordering::equal()\n }\n }\n}\n\nimpl<T, let N: u32> Ord for [T; N]\nwhere\n T: Ord,\n{\n // The first non-equal element of both arrays determines\n // the ordering for the whole array.\n fn cmp(self, other: [T; N]) -> Ordering {\n let mut result = Ordering::equal();\n for i in 0..self.len() {\n if result == Ordering::equal() {\n result = self[i].cmp(other[i]);\n }\n }\n result\n }\n}\n\nimpl<T> Ord for [T]\nwhere\n T: Ord,\n{\n // The first non-equal element of both arrays determines\n // the ordering for the whole array.\n fn cmp(self, other: [T]) -> Ordering {\n let self_len = self.len();\n let other_len = other.len();\n let min_len = if self_len < other_len {\n self_len\n } else {\n other_len\n };\n\n let mut result = Ordering::equal();\n for i in 0..min_len {\n if result == Ordering::equal() {\n result = self[i].cmp(other[i]);\n }\n }\n\n if result != Ordering::equal() {\n result\n } else {\n self_len.cmp(other_len)\n }\n }\n}\n\nimpl<A, B> Ord for (A, B)\nwhere\n A: Ord,\n B: Ord,\n{\n fn cmp(self, other: (A, B)) -> Ordering {\n let result = self.0.cmp(other.0);\n\n if result != Ordering::equal() {\n result\n } else {\n self.1.cmp(other.1)\n }\n }\n}\n\nimpl<A, B, C> Ord for (A, B, C)\nwhere\n A: Ord,\n B: Ord,\n C: Ord,\n{\n fn cmp(self, other: (A, B, C)) -> Ordering {\n let mut result = self.0.cmp(other.0);\n\n if result == Ordering::equal() {\n result = self.1.cmp(other.1);\n }\n\n if result == Ordering::equal() {\n result = self.2.cmp(other.2);\n }\n\n result\n }\n}\n\nimpl<A, B, C, D> Ord for (A, B, C, D)\nwhere\n A: Ord,\n B: Ord,\n C: Ord,\n D: Ord,\n{\n fn cmp(self, other: (A, B, C, D)) -> Ordering {\n let mut result = self.0.cmp(other.0);\n\n if result == Ordering::equal() {\n result = self.1.cmp(other.1);\n }\n\n if result == Ordering::equal() {\n result = self.2.cmp(other.2);\n }\n\n if result == Ordering::equal() {\n result = self.3.cmp(other.3);\n }\n\n result\n }\n}\n\nimpl<A, B, C, D, E> Ord for (A, B, C, D, E)\nwhere\n A: Ord,\n B: Ord,\n C: Ord,\n D: Ord,\n E: Ord,\n{\n fn cmp(self, other: (A, B, C, D, E)) -> Ordering {\n let mut result = self.0.cmp(other.0);\n\n if result == Ordering::equal() {\n result = self.1.cmp(other.1);\n }\n\n if result == Ordering::equal() {\n result = self.2.cmp(other.2);\n }\n\n if result == Ordering::equal() {\n result = self.3.cmp(other.3);\n }\n\n if result == Ordering::equal() {\n result = self.4.cmp(other.4);\n }\n\n result\n }\n}\n\n// Compares and returns the maximum of two values.\n//\n// Returns the second argument if the comparison determines them to be equal.\n//\n// # Examples\n//\n// ```\n// use std::cmp;\n//\n// assert_eq(cmp::max(1, 2), 2);\n// assert_eq(cmp::max(2, 2), 2);\n// ```\npub fn max<T>(v1: T, v2: T) -> T\nwhere\n T: Ord,\n{\n if v1 > v2 {\n v1\n } else {\n v2\n }\n}\n\n// Compares and returns the minimum of two values.\n//\n// Returns the first argument if the comparison determines them to be equal.\n//\n// # Examples\n//\n// ```\n// use std::cmp;\n//\n// assert_eq(cmp::min(1, 2), 1);\n// assert_eq(cmp::min(2, 2), 2);\n// ```\npub fn min<T>(v1: T, v2: T) -> T\nwhere\n T: Ord,\n{\n if v1 > v2 {\n v2\n } else {\n v1\n }\n}\n\nmod cmp_tests {\n use super::{Eq, max, min, Ord};\n\n #[test]\n fn sanity_check_min() {\n assert_eq(min(0_u64, 1), 0);\n assert_eq(min(0_u64, 0), 0);\n assert_eq(min(1_u64, 1), 1);\n assert_eq(min(255_u8, 0), 0);\n }\n\n #[test]\n fn sanity_check_max() {\n assert_eq(max(0_u64, 1), 1);\n assert_eq(max(0_u64, 0), 0);\n assert_eq(max(1_u64, 1), 1);\n assert_eq(max(255_u8, 0), 255);\n }\n\n #[test]\n fn correctly_handles_unequal_length_vectors() {\n let vector_1 = [0, 1, 2, 3].as_vector();\n let vector_2 = [0, 1, 2].as_vector();\n assert(!vector_1.eq(vector_2));\n }\n\n #[test]\n fn lexicographic_ordering_for_vectors() {\n assert(\n [2_u32].as_vector().cmp([1_u32, 1_u32, 1_u32].as_vector())\n == super::Ordering::greater(),\n );\n assert(\n [1_u32, 2_u32].as_vector().cmp([1_u32, 2_u32, 3_u32].as_vector())\n == super::Ordering::less(),\n );\n }\n}\n"
|
|
2906
|
+
"source": "use crate::meta::ctstring::AsCtString;\nuse crate::meta::derive_via;\n\n#[derive_via(derive_eq)]\n// docs:start:eq-trait\npub trait Eq {\n fn eq(self, other: Self) -> bool;\n}\n// docs:end:eq-trait\n\n// docs:start:derive_eq\ncomptime fn derive_eq(s: TypeDefinition) -> Quoted {\n let signature = quote { fn eq(_self: Self, _other: Self) -> bool };\n let for_each_field = |name| quote { (_self.$name == _other.$name) };\n let body = |fields| {\n if s.fields_as_written().len() == 0 {\n quote { true }\n } else {\n fields\n }\n };\n crate::meta::make_trait_impl(\n s,\n quote { $crate::cmp::Eq },\n signature,\n for_each_field,\n quote { & },\n body,\n )\n}\n// docs:end:derive_eq\n\nimpl Eq for Field {\n fn eq(self, other: Field) -> bool {\n self == other\n }\n}\n\nimpl Eq for u128 {\n fn eq(self, other: u128) -> bool {\n self == other\n }\n}\nimpl Eq for u64 {\n fn eq(self, other: u64) -> bool {\n self == other\n }\n}\nimpl Eq for u32 {\n fn eq(self, other: u32) -> bool {\n self == other\n }\n}\nimpl Eq for u16 {\n fn eq(self, other: u16) -> bool {\n self == other\n }\n}\nimpl Eq for u8 {\n fn eq(self, other: u8) -> bool {\n self == other\n }\n}\nimpl Eq for u1 {\n fn eq(self, other: u1) -> bool {\n self == other\n }\n}\n\nimpl Eq for i8 {\n fn eq(self, other: i8) -> bool {\n self == other\n }\n}\nimpl Eq for i16 {\n fn eq(self, other: i16) -> bool {\n self == other\n }\n}\nimpl Eq for i32 {\n fn eq(self, other: i32) -> bool {\n self == other\n }\n}\nimpl Eq for i64 {\n fn eq(self, other: i64) -> bool {\n self == other\n }\n}\n\nimpl Eq for () {\n fn eq(_self: Self, _other: ()) -> bool {\n true\n }\n}\nimpl Eq for bool {\n fn eq(self, other: bool) -> bool {\n self == other\n }\n}\n\nimpl<T, let N: u32> Eq for [T; N]\nwhere\n T: Eq,\n{\n fn eq(self, other: [T; N]) -> bool {\n let mut result = true;\n for i in 0..self.len() {\n result &= self[i].eq(other[i]);\n }\n result\n }\n}\n\nimpl<T> Eq for [T]\nwhere\n T: Eq,\n{\n fn eq(self, other: [T]) -> bool {\n let mut result = self.len() == other.len();\n if result {\n for i in 0..self.len() {\n result &= self[i].eq(other[i]);\n }\n }\n result\n }\n}\n\nimpl<let N: u32> Eq for str<N> {\n fn eq(self, other: str<N>) -> bool {\n let self_bytes = self.as_bytes();\n let other_bytes = other.as_bytes();\n self_bytes == other_bytes\n }\n}\n\ncomptime fn make_tuple_eq_body(n: u32) -> Quoted {\n let mut body = f\"self.0.eq(other.0)\".as_ctstring();\n for i in 1u32..n {\n body = body.append_fmtstr(f\" & self.{i}.eq(other.{i})\");\n }\n f\"{body}\".quoted_contents()\n}\n\nimpl<A: Eq, B: Eq> Eq for (A, B) {\n fn eq(self, other: (A, B)) -> bool {\n make_tuple_eq_body!(2u32)\n }\n}\n\nimpl<A: Eq, B: Eq, C: Eq> Eq for (A, B, C) {\n fn eq(self, other: (A, B, C)) -> bool {\n make_tuple_eq_body!(3u32)\n }\n}\n\nimpl<A: Eq, B: Eq, C: Eq, D: Eq> Eq for (A, B, C, D) {\n fn eq(self, other: (A, B, C, D)) -> bool {\n make_tuple_eq_body!(4u32)\n }\n}\n\nimpl<A: Eq, B: Eq, C: Eq, D: Eq, E: Eq> Eq for (A, B, C, D, E) {\n fn eq(self, other: (A, B, C, D, E)) -> bool {\n make_tuple_eq_body!(5u32)\n }\n}\n\nimpl<A: Eq, B: Eq, C: Eq, D: Eq, E: Eq, F: Eq> Eq for (A, B, C, D, E, F) {\n fn eq(self, other: (A, B, C, D, E, F)) -> bool {\n make_tuple_eq_body!(6u32)\n }\n}\n\nimpl<A: Eq, B: Eq, C: Eq, D: Eq, E: Eq, F: Eq, G: Eq> Eq for (A, B, C, D, E, F, G) {\n fn eq(self, other: (A, B, C, D, E, F, G)) -> bool {\n make_tuple_eq_body!(7u32)\n }\n}\n\nimpl<A: Eq, B: Eq, C: Eq, D: Eq, E: Eq, F: Eq, G: Eq, H: Eq> Eq for (A, B, C, D, E, F, G, H) {\n fn eq(self, other: (A, B, C, D, E, F, G, H)) -> bool {\n make_tuple_eq_body!(8u32)\n }\n}\n\nimpl<A: Eq, B: Eq, C: Eq, D: Eq, E: Eq, F: Eq, G: Eq, H: Eq, I: Eq> Eq for (A, B, C, D, E, F, G, H, I) {\n fn eq(self, other: (A, B, C, D, E, F, G, H, I)) -> bool {\n make_tuple_eq_body!(9u32)\n }\n}\n\nimpl<A: Eq, B: Eq, C: Eq, D: Eq, E: Eq, F: Eq, G: Eq, H: Eq, I: Eq, J: Eq> Eq for (A, B, C, D, E, F, G, H, I, J) {\n fn eq(self, other: (A, B, C, D, E, F, G, H, I, J)) -> bool {\n make_tuple_eq_body!(10u32)\n }\n}\n\nimpl<A: Eq, B: Eq, C: Eq, D: Eq, E: Eq, F: Eq, G: Eq, H: Eq, I: Eq, J: Eq, K: Eq> Eq for (A, B, C, D, E, F, G, H, I, J, K) {\n fn eq(self, other: (A, B, C, D, E, F, G, H, I, J, K)) -> bool {\n make_tuple_eq_body!(11u32)\n }\n}\n\nimpl<A: Eq, B: Eq, C: Eq, D: Eq, E: Eq, F: Eq, G: Eq, H: Eq, I: Eq, J: Eq, K: Eq, L: Eq> Eq for (A, B, C, D, E, F, G, H, I, J, K, L) {\n fn eq(self, other: (A, B, C, D, E, F, G, H, I, J, K, L)) -> bool {\n make_tuple_eq_body!(12u32)\n }\n}\n\nimpl Eq for Ordering {\n fn eq(self, other: Ordering) -> bool {\n self.result == other.result\n }\n}\n\n// Noir doesn't have enums yet so we emulate (Lt | Eq | Gt) with a struct\n// that has 3 public functions for constructing the struct.\npub struct Ordering {\n result: Field,\n}\n\nimpl Ordering {\n // Implementation note: 0, 1, and 2 for Lt, Eq, and Gt are built\n // into the compiler, do not change these without also updating\n // the compiler itself!\n pub fn less() -> Ordering {\n Ordering { result: 0 }\n }\n\n pub fn equal() -> Ordering {\n Ordering { result: 1 }\n }\n\n pub fn greater() -> Ordering {\n Ordering { result: 2 }\n }\n}\n\n#[derive_via(derive_ord)]\n// docs:start:ord-trait\npub trait Ord {\n fn cmp(self, other: Self) -> Ordering;\n}\n// docs:end:ord-trait\n\n// docs:start:derive_ord\ncomptime fn derive_ord(s: TypeDefinition) -> Quoted {\n let name = quote { $crate::cmp::Ord };\n let signature = quote { fn cmp(_self: Self, _other: Self) -> $crate::cmp::Ordering };\n let for_each_field = |name| quote {\n if result == $crate::cmp::Ordering::equal() {\n result = _self.$name.cmp(_other.$name);\n }\n };\n let body = |fields| quote {\n let mut result = $crate::cmp::Ordering::equal();\n $fields\n result\n };\n crate::meta::make_trait_impl(s, name, signature, for_each_field, quote {}, body)\n}\n// docs:end:derive_ord\n\n// Note: Field deliberately does not implement Ord\n\nimpl Ord for u128 {\n fn cmp(self, other: u128) -> Ordering {\n if self < other {\n Ordering::less()\n } else if self > other {\n Ordering::greater()\n } else {\n Ordering::equal()\n }\n }\n}\nimpl Ord for u64 {\n fn cmp(self, other: u64) -> Ordering {\n if self < other {\n Ordering::less()\n } else if self > other {\n Ordering::greater()\n } else {\n Ordering::equal()\n }\n }\n}\n\nimpl Ord for u32 {\n fn cmp(self, other: u32) -> Ordering {\n if self < other {\n Ordering::less()\n } else if self > other {\n Ordering::greater()\n } else {\n Ordering::equal()\n }\n }\n}\n\nimpl Ord for u16 {\n fn cmp(self, other: u16) -> Ordering {\n if self < other {\n Ordering::less()\n } else if self > other {\n Ordering::greater()\n } else {\n Ordering::equal()\n }\n }\n}\n\nimpl Ord for u8 {\n fn cmp(self, other: u8) -> Ordering {\n if self < other {\n Ordering::less()\n } else if self > other {\n Ordering::greater()\n } else {\n Ordering::equal()\n }\n }\n}\n\nimpl Ord for i8 {\n fn cmp(self, other: i8) -> Ordering {\n if self < other {\n Ordering::less()\n } else if self > other {\n Ordering::greater()\n } else {\n Ordering::equal()\n }\n }\n}\n\nimpl Ord for i16 {\n fn cmp(self, other: i16) -> Ordering {\n if self < other {\n Ordering::less()\n } else if self > other {\n Ordering::greater()\n } else {\n Ordering::equal()\n }\n }\n}\n\nimpl Ord for i32 {\n fn cmp(self, other: i32) -> Ordering {\n if self < other {\n Ordering::less()\n } else if self > other {\n Ordering::greater()\n } else {\n Ordering::equal()\n }\n }\n}\n\nimpl Ord for i64 {\n fn cmp(self, other: i64) -> Ordering {\n if self < other {\n Ordering::less()\n } else if self > other {\n Ordering::greater()\n } else {\n Ordering::equal()\n }\n }\n}\n\nimpl Ord for () {\n fn cmp(_self: Self, _other: ()) -> Ordering {\n Ordering::equal()\n }\n}\n\nimpl Ord for bool {\n fn cmp(self, other: bool) -> Ordering {\n if self {\n if other {\n Ordering::equal()\n } else {\n Ordering::greater()\n }\n } else if other {\n Ordering::less()\n } else {\n Ordering::equal()\n }\n }\n}\n\nimpl<T, let N: u32> Ord for [T; N]\nwhere\n T: Ord,\n{\n // The first non-equal element of both arrays determines\n // the ordering for the whole array.\n fn cmp(self, other: [T; N]) -> Ordering {\n let mut result = Ordering::equal();\n for i in 0..self.len() {\n if result == Ordering::equal() {\n result = self[i].cmp(other[i]);\n }\n }\n result\n }\n}\n\nimpl<T> Ord for [T]\nwhere\n T: Ord,\n{\n // The first non-equal element of both arrays determines\n // the ordering for the whole array.\n fn cmp(self, other: [T]) -> Ordering {\n let self_len = self.len();\n let other_len = other.len();\n let min_len = if self_len < other_len {\n self_len\n } else {\n other_len\n };\n\n let mut result = Ordering::equal();\n for i in 0..min_len {\n if result == Ordering::equal() {\n result = self[i].cmp(other[i]);\n }\n }\n\n if result != Ordering::equal() {\n result\n } else {\n self_len.cmp(other_len)\n }\n }\n}\n\ncomptime fn make_tuple_ord_body(n: u32) -> Quoted {\n let last = n - 1u32;\n let mut body = if last == 1 {\n f\"let result = self.0.cmp(other.0);\".as_ctstring()\n } else {\n f\"let mut result = self.0.cmp(other.0);\".as_ctstring()\n };\n for i in 1u32..last {\n body = body.append_fmtstr(\n f\" if result == Ordering::equal() {{ result = self.{i}.cmp(other.{i}); }}\",\n );\n }\n body = body.append_fmtstr(\n f\" if result != Ordering::equal() {{ result }} else {{ self.{last}.cmp(other.{last}) }}\",\n );\n f\"{body}\".quoted_contents()\n}\n\nimpl<A: Ord, B: Ord> Ord for (A, B) {\n fn cmp(self, other: (A, B)) -> Ordering {\n make_tuple_ord_body!(2u32)\n }\n}\n\nimpl<A: Ord, B: Ord, C: Ord> Ord for (A, B, C) {\n fn cmp(self, other: (A, B, C)) -> Ordering {\n make_tuple_ord_body!(3u32)\n }\n}\n\nimpl<A: Ord, B: Ord, C: Ord, D: Ord> Ord for (A, B, C, D) {\n fn cmp(self, other: (A, B, C, D)) -> Ordering {\n make_tuple_ord_body!(4u32)\n }\n}\n\nimpl<A: Ord, B: Ord, C: Ord, D: Ord, E: Ord> Ord for (A, B, C, D, E) {\n fn cmp(self, other: (A, B, C, D, E)) -> Ordering {\n make_tuple_ord_body!(5u32)\n }\n}\n\nimpl<A: Ord, B: Ord, C: Ord, D: Ord, E: Ord, F: Ord> Ord for (A, B, C, D, E, F) {\n fn cmp(self, other: (A, B, C, D, E, F)) -> Ordering {\n make_tuple_ord_body!(6u32)\n }\n}\n\nimpl<A: Ord, B: Ord, C: Ord, D: Ord, E: Ord, F: Ord, G: Ord> Ord for (A, B, C, D, E, F, G) {\n fn cmp(self, other: (A, B, C, D, E, F, G)) -> Ordering {\n make_tuple_ord_body!(7u32)\n }\n}\n\nimpl<A: Ord, B: Ord, C: Ord, D: Ord, E: Ord, F: Ord, G: Ord, H: Ord> Ord for (A, B, C, D, E, F, G, H) {\n fn cmp(self, other: (A, B, C, D, E, F, G, H)) -> Ordering {\n make_tuple_ord_body!(8u32)\n }\n}\n\nimpl<A: Ord, B: Ord, C: Ord, D: Ord, E: Ord, F: Ord, G: Ord, H: Ord, I: Ord> Ord for (A, B, C, D, E, F, G, H, I) {\n fn cmp(self, other: (A, B, C, D, E, F, G, H, I)) -> Ordering {\n make_tuple_ord_body!(9u32)\n }\n}\n\nimpl<A: Ord, B: Ord, C: Ord, D: Ord, E: Ord, F: Ord, G: Ord, H: Ord, I: Ord, J: Ord> Ord for (A, B, C, D, E, F, G, H, I, J) {\n fn cmp(self, other: (A, B, C, D, E, F, G, H, I, J)) -> Ordering {\n make_tuple_ord_body!(10u32)\n }\n}\n\nimpl<A: Ord, B: Ord, C: Ord, D: Ord, E: Ord, F: Ord, G: Ord, H: Ord, I: Ord, J: Ord, K: Ord> Ord for (A, B, C, D, E, F, G, H, I, J, K) {\n fn cmp(self, other: (A, B, C, D, E, F, G, H, I, J, K)) -> Ordering {\n make_tuple_ord_body!(11u32)\n }\n}\n\nimpl<A: Ord, B: Ord, C: Ord, D: Ord, E: Ord, F: Ord, G: Ord, H: Ord, I: Ord, J: Ord, K: Ord, L: Ord> Ord for (A, B, C, D, E, F, G, H, I, J, K, L) {\n fn cmp(self, other: (A, B, C, D, E, F, G, H, I, J, K, L)) -> Ordering {\n make_tuple_ord_body!(12u32)\n }\n}\n\n// Compares and returns the maximum of two values.\n//\n// Returns the second argument if the comparison determines them to be equal.\n//\n// # Examples\n//\n// ```\n// use std::cmp;\n//\n// assert_eq(cmp::max(1, 2), 2);\n// assert_eq(cmp::max(2, 2), 2);\n// ```\npub fn max<T>(v1: T, v2: T) -> T\nwhere\n T: Ord,\n{\n if v1 > v2 {\n v1\n } else {\n v2\n }\n}\n\n// Compares and returns the minimum of two values.\n//\n// Returns the first argument if the comparison determines them to be equal.\n//\n// # Examples\n//\n// ```\n// use std::cmp;\n//\n// assert_eq(cmp::min(1, 2), 1);\n// assert_eq(cmp::min(2, 2), 2);\n// ```\npub fn min<T>(v1: T, v2: T) -> T\nwhere\n T: Ord,\n{\n if v1 > v2 {\n v2\n } else {\n v1\n }\n}\n\nmod cmp_tests {\n use super::{Eq, max, min, Ord};\n\n #[test]\n fn sanity_check_min() {\n assert_eq(min(0_u64, 1), 0);\n assert_eq(min(0_u64, 0), 0);\n assert_eq(min(1_u64, 1), 1);\n assert_eq(min(255_u8, 0), 0);\n }\n\n #[test]\n fn sanity_check_max() {\n assert_eq(max(0_u64, 1), 1);\n assert_eq(max(0_u64, 0), 0);\n assert_eq(max(1_u64, 1), 1);\n assert_eq(max(255_u8, 0), 255);\n }\n\n #[test]\n fn correctly_handles_unequal_length_vectors() {\n let vector_1 = [0, 1, 2, 3].as_vector();\n let vector_2 = [0, 1, 2].as_vector();\n assert(!vector_1.eq(vector_2));\n }\n\n #[test]\n fn lexicographic_ordering_for_vectors() {\n assert(\n [2_u32].as_vector().cmp([1_u32, 1_u32, 1_u32].as_vector())\n == super::Ordering::greater(),\n );\n assert(\n [1_u32, 2_u32].as_vector().cmp([1_u32, 2_u32, 3_u32].as_vector())\n == super::Ordering::less(),\n );\n }\n}\n"
|
|
3614
2907
|
},
|
|
3615
|
-
"
|
|
3616
|
-
"path": "/home/aztec-dev/aztec-packages/noir-projects/noir-contracts/contracts/protocol/
|
|
3617
|
-
"source": "use aztec::macros::aztec;\n\n#[aztec]\npub contract ContractInstanceRegistry {\n use aztec::{\n macros::{events::event, functions::{external, view}, storage::storage},\n nullifier::utils::compute_nullifier_existence_request,\n protocol::{\n address::{AztecAddress, PartialAddress},\n constants::{\n CONTRACT_CLASS_REGISTRY_CONTRACT_ADDRESS, CONTRACT_INSTANCE_PUBLISHED_MAGIC_VALUE,\n CONTRACT_INSTANCE_UPDATED_MAGIC_VALUE, DEFAULT_UPDATE_DELAY, MINIMUM_UPDATE_DELAY,\n },\n contract_class_id::ContractClassId,\n point::validate_on_curve,\n public_keys::PublicKeys,\n traits::{Serialize, ToField},\n },\n state_vars::{DelayedPublicMutable, Map},\n };\n\n #[event]\n struct ContractInstancePublished {\n CONTRACT_INSTANCE_PUBLISHED_MAGIC_VALUE: Field,\n address: AztecAddress,\n version: u8,\n salt: Field,\n contract_class_id: ContractClassId,\n initialization_hash: Field,\n public_keys: PublicKeys,\n deployer: AztecAddress,\n }\n\n // We need to impl this separately because ts deserializes a point as two fields only.\n // We had issues that:\n // Notice how the 'is_infinite' field is deserialized as the next point.\n // {\n // masterNullifierPublicKey: Point {\n // x: Fr<0x0000000000000000000000000000000000000000000000000000000000000012>,\n // y: Fr<0x0000000000000000000000000000000000000000000000000000000000000034>,\n // isInfinite: false,\n // kind: 'point'\n // },\n // masterIncomingViewingPublicKey: Point {\n // x: Fr<0x0000000000000000000000000000000000000000000000000000000000000000>,\n // y: Fr<0x0000000000000000000000000000000000000000000000000000000000000056>,\n // isInfinite: false,\n // kind: 'point'\n // },\n // masterOutgoingViewingPublicKey: Point {\n // x: Fr<0x0000000000000000000000000000000000000000000000000000000000000078>,\n // y: Fr<0x0000000000000000000000000000000000000000000000000000000000000000>,\n // isInfinite: false,\n // kind: 'point'\n // },\n // masterTaggingPublicKey: Point {\n // x: Fr<0x0000000000000000000000000000000000000000000000000000000000000910>,\n // y: Fr<0x0000000000000000000000000000000000000000000000000000000000001112>,\n // isInfinite: false,\n // kind: 'point'\n // }\n\n impl ContractInstancePublished {\n fn serialize_non_standard(self) -> [Field; 15] {\n [\n self.CONTRACT_INSTANCE_PUBLISHED_MAGIC_VALUE,\n self.address.to_field(),\n self.version.to_field(),\n self.salt,\n self.contract_class_id.to_field(),\n self.initialization_hash,\n self.public_keys.npk_m.serialize()[0],\n self.public_keys.npk_m.serialize()[1],\n self.public_keys.ivpk_m.serialize()[0],\n self.public_keys.ivpk_m.serialize()[1],\n self.public_keys.ovpk_m.serialize()[0],\n self.public_keys.ovpk_m.serialize()[1],\n self.public_keys.tpk_m.serialize()[0],\n self.public_keys.tpk_m.serialize()[1],\n self.deployer.to_field(),\n ]\n }\n }\n\n #[event]\n struct ContractInstanceUpdated {\n CONTRACT_INSTANCE_UPDATED_MAGIC_VALUE: Field,\n address: AztecAddress,\n prev_contract_class_id: ContractClassId,\n new_contract_class_id: ContractClassId,\n timestamp_of_change: u64,\n }\n\n #[storage]\n struct Storage<Context> {\n updated_class_ids: Map<AztecAddress, DelayedPublicMutable<ContractClassId, DEFAULT_UPDATE_DELAY, Context>, Context>,\n }\n\n #[external(\"private\")]\n fn publish_for_public_execution(\n salt: Field,\n contract_class_id: ContractClassId,\n initialization_hash: Field,\n public_keys: PublicKeys,\n universal_deploy: bool,\n ) {\n // contract class must be published in order to publish an instance\n let nullifier_existence_request = compute_nullifier_existence_request(\n contract_class_id.to_field(),\n CONTRACT_CLASS_REGISTRY_CONTRACT_ADDRESS,\n );\n self.context.assert_nullifier_exists(nullifier_existence_request);\n\n let deployer = if universal_deploy {\n AztecAddress::zero()\n } else {\n self.msg_sender()\n };\n\n let partial_address =\n PartialAddress::compute(contract_class_id, salt, initialization_hash, deployer);\n\n // Note: Out of all the public keys, only the Ivpk_m is checked to be on the curve\n // (implicitly as part of the `add` operation of deriving the address). This at least\n // protects the AVM against DoS attacks.\n // For thoroughness, we also ensure the other points are on the curve:\n validate_on_curve(public_keys.npk_m.inner);\n validate_on_curve(public_keys.ovpk_m.inner);\n validate_on_curve(public_keys.tpk_m.inner);\n\n let address = AztecAddress::compute(public_keys, partial_address);\n\n // Emit the address as a nullifier:\n // - to demonstrate that this contract instance hasn't been published before\n // - to enable apps to read that this contract instance has been published.\n self.context.push_nullifier(address.to_field());\n\n // Broadcast the event\n let event = ContractInstancePublished {\n CONTRACT_INSTANCE_PUBLISHED_MAGIC_VALUE,\n contract_class_id,\n address,\n public_keys,\n initialization_hash,\n salt,\n deployer,\n version: 1,\n };\n\n let payload = event.serialize_non_standard();\n aztec::oracle::debug_log::debug_log_format(\"ContractInstancePublished: {}\", payload);\n\n let padded_log = payload.concat([0; 3]);\n // Only the payload needs to be emitted. Since the siloed tag of this event log is publicly known, it's\n // acceptable to pad the log with 0s and reveal the actual payload length.\n let length = payload.len();\n self.context.emit_private_log(padded_log, length);\n }\n\n #[external(\"public\")]\n fn update(new_contract_class_id: ContractClassId) {\n let address = self.msg_sender();\n\n // Safety: we're using the nullifier's existence as a guarantee of the availability of the contract's\n // information through publishing, which is safe - we just need this information to be _eventually_ available.\n assert(\n self.context.nullifier_exists_unsafe(address.to_field(), self.address),\n \"msg.sender is not deployed\",\n );\n\n // Safety: we're using the nullifier's existence as a guarantee of the availability of the new contract class'\n // information through registration, which is safe - we just need this information to be _eventually_ available.\n assert(\n self.context.nullifier_exists_unsafe(\n new_contract_class_id.to_field(),\n CONTRACT_CLASS_REGISTRY_CONTRACT_ADDRESS,\n ),\n \"New contract class is not registered\",\n );\n\n let scheduled_value_update = self\n .storage\n .updated_class_ids\n .at(address)\n .schedule_and_return_value_change(new_contract_class_id);\n let (prev_contract_class_id, timestamp_of_change) = scheduled_value_update.get_previous();\n\n let event = ContractInstanceUpdated {\n CONTRACT_INSTANCE_UPDATED_MAGIC_VALUE,\n address,\n prev_contract_class_id,\n new_contract_class_id,\n timestamp_of_change,\n };\n\n self.context.emit_public_log(event);\n }\n\n #[external(\"public\")]\n fn set_update_delay(new_update_delay: u64) {\n let msg_sender = self.msg_sender();\n\n // Safety: we're using the nullifier's existence as a guarantee of the availability of the contract's\n // information through publishing, which is safe - we just need this information to be _eventually_ available.\n assert(\n self.context.nullifier_exists_unsafe(msg_sender.to_field(), self.address),\n \"msg.sender is not deployed\",\n );\n\n assert(new_update_delay >= MINIMUM_UPDATE_DELAY, \"New update delay is too low\");\n\n self.storage.updated_class_ids.at(msg_sender).schedule_delay_change(new_update_delay);\n }\n\n #[external(\"public\")]\n #[view]\n fn get_update_delay() -> u64 {\n self.storage.updated_class_ids.at(self.msg_sender()).get_current_delay()\n }\n}\n"
|
|
2908
|
+
"50": {
|
|
2909
|
+
"path": "/home/aztec-dev/aztec-packages/noir-projects/noir-contracts/contracts/protocol/contract_instance_registry_contract/src/main.nr",
|
|
2910
|
+
"source": "/// Protocol contract responsible for deploying contract instances and managing contract upgrades.\n///\n/// In Aztec, contracts are split into *classes* (code, registered via ContractClassRegistry) and *instances*\n/// (deployments of a class at a unique address). This contract handles contract instance publishing and contract\n/// updates (updating instance to a new class).\npub contract ContractInstanceRegistry {\n use aztec::{\n context::{PrivateContext, PublicContext},\n hash::hash_args,\n nullifier::utils::compute_nullifier_existence_request,\n oracle::{avm, logging::debug_log_format, version::assert_compatible_oracle_version},\n protocol::{\n abis::function_selector::FunctionSelector,\n address::{AztecAddress, PartialAddress},\n constants::{\n CONTRACT_CLASS_REGISTRY_CONTRACT_ADDRESS, CONTRACT_INSTANCE_PUBLISHED_MAGIC_VALUE,\n CONTRACT_INSTANCE_UPDATED_MAGIC_VALUE, DEFAULT_UPDATE_DELAY, MINIMUM_UPDATE_DELAY,\n },\n contract_class_id::ContractClassId,\n public_keys::PublicKeys,\n traits::{Deserialize, Serialize, ToField},\n utils::reader::Reader,\n },\n state_vars::{DelayedPublicMutable, Map, StateVariable},\n };\n\n #[abi(events)]\n struct ContractInstancePublished {\n CONTRACT_INSTANCE_PUBLISHED_MAGIC_VALUE: Field,\n address: AztecAddress,\n version: u8,\n salt: Field,\n contract_class_id: ContractClassId,\n initialization_hash: Field,\n public_keys: PublicKeys,\n deployer: AztecAddress,\n }\n\n // Custom serialization is required because we don't want to waste one field for the `is_infinite` flag of public\n // key points (public key points will never be the infinity point).\n impl ContractInstancePublished {\n fn serialize_non_standard(self) -> [Field; 15] {\n [\n self.CONTRACT_INSTANCE_PUBLISHED_MAGIC_VALUE,\n self.address.to_field(),\n self.version.to_field(),\n self.salt,\n self.contract_class_id.to_field(),\n self.initialization_hash,\n self.public_keys.npk_m.serialize()[0],\n self.public_keys.npk_m.serialize()[1],\n self.public_keys.ivpk_m.serialize()[0],\n self.public_keys.ivpk_m.serialize()[1],\n self.public_keys.ovpk_m.serialize()[0],\n self.public_keys.ovpk_m.serialize()[1],\n self.public_keys.tpk_m.serialize()[0],\n self.public_keys.tpk_m.serialize()[1],\n self.deployer.to_field(),\n ]\n }\n }\n\n #[abi(events)]\n #[derive(Serialize)]\n struct ContractInstanceUpdated {\n CONTRACT_INSTANCE_UPDATED_MAGIC_VALUE: Field,\n address: AztecAddress,\n prev_contract_class_id: ContractClassId,\n new_contract_class_id: ContractClassId,\n timestamp_of_change: u64,\n }\n\n struct Storage<Context> {\n /// Map from contract instance address to a `DelayedPublicMutable` holding the updated contract class ID.\n updated_class_ids: Map<AztecAddress, DelayedPublicMutable<ContractClassId, DEFAULT_UPDATE_DELAY, Context>, Context>,\n }\n\n /// Publishes a new contract instance.\n ///\n /// The caller provides deployment parameters (salt, class_id, init_hash, public_keys, universal_deploy).\n /// The `universal_deploy` flag controls whether the deployer address is bound into the contract address:\n /// when true, deployer is zero (anyone can deploy the same instance); when false, deployer is the caller.\n ///\n /// This function:\n /// 1. Verifies the contract class is registered in ContractClassRegistry (nullifier existence check).\n /// 2. Validates public key points are on the Grumpkin curve (preventing AVM DoS via invalid points).\n /// 3. Computes the deterministic contract address from the deployment parameters.\n /// 4. Emits the address as a nullifier (proving publication preventing duplicate deployment)\n /// --> this address nullifier is then checked to exist by the AVM upon public function execution (if it doesn't\n /// exist AVM reverts)\n /// 5. Broadcasts a `ContractInstancePublished` event so nodes can reconstruct the instance.\n #[aztec::macros::internals_functions_generation::abi_attributes::abi_private]\n fn publish_for_public_execution(\n inputs: aztec::context::inputs::PrivateContextInputs,\n salt: Field,\n contract_class_id: ContractClassId,\n initialization_hash: Field,\n public_keys: PublicKeys,\n universal_deploy: bool,\n ) -> return_data aztec::protocol::abis::private_circuit_public_inputs::PrivateCircuitPublicInputs {\n // MACRO CODE START\n // Note: The macros initially inserted a phase check here, but since there is no phase change in this function\n // body, I have removed that check.\n assert_compatible_oracle_version();\n\n let serialized_params: [Field; 16] = [\n salt,\n contract_class_id.to_field(),\n initialization_hash,\n ]\n .concat(public_keys.serialize())\n .concat([universal_deploy.to_field()]);\n\n let args_hash: Field = hash_args(serialized_params);\n let mut context: PrivateContext = PrivateContext::new(inputs, args_hash);\n // MACRO CODE END\n\n // Verify the contract class is registered by checking for its nullifier at the ContractClassRegistry address.\n let nullifier_existence_request = compute_nullifier_existence_request(\n contract_class_id.to_field(),\n CONTRACT_CLASS_REGISTRY_CONTRACT_ADDRESS,\n );\n context.assert_nullifier_exists(nullifier_existence_request);\n\n // For universal deployments, deployer is zero so the resulting address is the same regardless of who initiates\n // deployment.\n let deployer = if universal_deploy {\n AztecAddress::zero()\n } else {\n context.maybe_msg_sender().unwrap()\n };\n\n let partial_address =\n PartialAddress::compute(contract_class_id, salt, initialization_hash, deployer);\n\n // Validate public key points lie on the Grumpkin curve to prevent AVM DoS attacks.\n public_keys.validate_on_curve();\n\n let address = AztecAddress::compute(public_keys, partial_address);\n\n // Emit address as nullifier: prevents duplicate deployment and proves publication.\n // We use no domain separators because these are the only nullifiers this contract uses.\n context.push_nullifier(address.to_field());\n\n // Broadcast deployment event. Uses non-standard serialization (2 fields per point,\n // omitting is_infinite) for TypeScript SDK compatibility.\n let event = ContractInstancePublished {\n CONTRACT_INSTANCE_PUBLISHED_MAGIC_VALUE,\n contract_class_id,\n address,\n public_keys,\n initialization_hash,\n salt,\n deployer,\n version: 1,\n };\n let payload = event.serialize_non_standard();\n debug_log_format(\"ContractInstancePublished: {}\", payload);\n // We pad the payload with [0] to match the length required by emit_private_log. Since the log is not\n // encrypted, padding with zero rather than a random value is acceptable (we don't care about privacy here).\n let padded_log = payload.concat([0]);\n let length = payload.len();\n context.emit_private_log(padded_log, length);\n\n // MACRO CODE START\n context.finish()\n // MACRO CODE END\n }\n\n /// Schedules an upgrade of the calling contract instance to a new contract class.\n ///\n /// The change is time-delayed via `DelayedPublicMutable` and only takes effect after the configured\n /// delay has elapsed. Only the contract instance itself can call this function (msg.sender == address).\n ///\n /// This function:\n /// 1. Verifies msg.sender is a deployed contract (its address nullifier exists).\n /// 2. Verifies the new class is registered in ContractClassRegistry.\n /// 3. Schedules the class ID change and emits a `ContractInstanceUpdated` event.\n #[aztec::macros::internals_functions_generation::abi_attributes::abi_public]\n unconstrained fn update(new_contract_class_id: ContractClassId) {\n // MACRO CODE START\n let context: PublicContext = PublicContext::new(\n || -> Field {\n let serialized_args: [Field; 1] =\n avm::calldata_copy(1, <ContractClassId as Serialize>::N);\n hash_args(serialized_args)\n },\n );\n let storage: Storage<PublicContext> = Storage::init(context);\n // MACRO CODE END\n\n let address = context.maybe_msg_sender().unwrap();\n\n // Safety: we're using the nullifier's existence as a guarantee of the availability of the contract's\n // information through publishing, which is safe - we just need this information to be _eventually_ available.\n assert(\n context.nullifier_exists_unsafe(address.to_field(), context.this_address()),\n \"msg.sender is not deployed\",\n );\n\n // Safety: we're using the nullifier's existence as a guarantee of the availability of the new contract class'\n // information through registration, which is safe - we just need this information to be _eventually_ available.\n assert(\n context.nullifier_exists_unsafe(\n new_contract_class_id.to_field(),\n CONTRACT_CLASS_REGISTRY_CONTRACT_ADDRESS,\n ),\n \"New contract class is not registered\",\n );\n\n let scheduled_value_update = storage\n .updated_class_ids\n .at(address)\n .schedule_and_get_value_change(new_contract_class_id);\n let (prev_contract_class_id, timestamp_of_change) = scheduled_value_update.get_previous();\n\n let event = ContractInstanceUpdated {\n CONTRACT_INSTANCE_UPDATED_MAGIC_VALUE,\n address,\n prev_contract_class_id,\n new_contract_class_id,\n timestamp_of_change,\n };\n context.emit_public_log(event);\n }\n\n /// Schedules a change to the upgrade delay for the calling contract instance. The delay change is\n /// itself delayed (preventing atomically reducing delay + scheduling an instant upgrade). The new\n /// delay must be at least `MINIMUM_UPDATE_DELAY`.\n #[aztec::macros::internals_functions_generation::abi_attributes::abi_public]\n unconstrained fn set_update_delay(new_update_delay: u64) {\n // MACRO CODE START\n let context: PublicContext = PublicContext::new(\n || -> Field {\n let serialized_args: [Field; 1] = avm::calldata_copy(1, <u64 as Serialize>::N);\n hash_args(serialized_args)\n },\n );\n let storage: Storage<PublicContext> = Storage::init(context);\n // MACRO CODE END\n\n let msg_sender = context.maybe_msg_sender().unwrap();\n\n // Safety: we're using the nullifier's existence as a guarantee of the availability of the contract's\n // information through publishing, which is safe - we just need this information to be _eventually_ available.\n assert(\n context.nullifier_exists_unsafe(msg_sender.to_field(), context.this_address()),\n \"msg.sender is not deployed\",\n );\n\n assert(new_update_delay >= MINIMUM_UPDATE_DELAY, \"New update delay is too low\");\n\n storage.updated_class_ids.at(msg_sender).schedule_delay_change(new_update_delay);\n }\n\n /// Returns the current update delay for the calling contract instance.\n #[aztec::macros::internals_functions_generation::abi_attributes::abi_public]\n #[aztec::macros::internals_functions_generation::abi_attributes::abi_view]\n unconstrained fn get_update_delay() -> pub u64 {\n // MACRO CODE START\n let context: PublicContext = PublicContext::new(\n || -> Field {\n let serialized_args: [Field; 0] = avm::calldata_copy(1, 0);\n hash_args(serialized_args)\n },\n );\n let storage: Storage<PublicContext> = Storage::init(context);\n assert(context.is_static_call(), \"Function get_update_delay can only be called statically\");\n // MACRO CODE END\n\n storage.updated_class_ids.at(avm::sender()).get_current_delay()\n }\n\n // THE REST OF THE CODE IN THIS CONTRACT WAS ORIGINALLY INJECTED BY THE #[aztec] MACRO.\n\n global UPDATE_SELECTOR: Field =\n comptime { FunctionSelector::from_signature(\"update((Field))\").to_field() };\n global SET_UPDATE_DELAY_SELECTOR: Field =\n comptime { FunctionSelector::from_signature(\"set_update_delay(u64)\").to_field() };\n global GET_UPDATE_DELAY_SELECTOR: Field =\n comptime { FunctionSelector::from_signature(\"get_update_delay()\").to_field() };\n\n #[aztec::macros::internals_functions_generation::abi_attributes::abi_public]\n pub unconstrained fn public_dispatch(selector: Field) {\n if selector == UPDATE_SELECTOR {\n let input_calldata: [Field; 1] =\n avm::calldata_copy(1, <ContractClassId as Serialize>::N);\n let mut reader: Reader<1> = Reader::new(input_calldata);\n let arg0: ContractClassId =\n <ContractClassId as Deserialize>::stream_deserialize(&mut reader);\n update(arg0);\n avm::avm_return([].as_vector());\n };\n if selector == SET_UPDATE_DELAY_SELECTOR {\n let input_calldata: [Field; 1] = avm::calldata_copy(1, <u64 as Serialize>::N);\n let mut reader: Reader<1> = Reader::new(input_calldata);\n let arg0: u64 = <u64 as Deserialize>::stream_deserialize(&mut reader);\n set_update_delay(arg0);\n avm::avm_return([].as_vector());\n };\n if selector == GET_UPDATE_DELAY_SELECTOR {\n let return_value: [Field; 1] = <u64 as Serialize>::serialize(get_update_delay());\n avm::avm_return(return_value.as_vector());\n };\n panic(f\"Unknown selector {selector}\")\n }\n\n impl<Context> Storage<Context> {\n fn init(context: Context) -> Self {\n Self {\n updated_class_ids: <Map<AztecAddress, DelayedPublicMutable<ContractClassId, DEFAULT_UPDATE_DELAY, Context>, Context> as StateVariable<1, Context>>::new(\n context,\n 1,\n ),\n }\n }\n }\n\n pub struct publish_for_public_execution_parameters {\n pub _salt: Field,\n pub _contract_class_id: ContractClassId,\n pub _initialization_hash: Field,\n pub _public_keys: PublicKeys,\n pub _universal_deploy: bool,\n }\n\n pub struct update_parameters {\n pub _new_contract_class_id: ContractClassId,\n }\n\n pub struct set_update_delay_parameters {\n pub _new_update_delay: u64,\n }\n\n pub struct get_update_delay_parameters {}\n\n #[abi(functions)]\n pub struct publish_for_public_execution_abi {\n parameters: publish_for_public_execution_parameters,\n }\n\n #[abi(functions)]\n pub struct update_abi {\n parameters: update_parameters,\n }\n\n #[abi(functions)]\n pub struct set_update_delay_abi {\n parameters: set_update_delay_parameters,\n }\n\n #[abi(functions)]\n pub struct get_update_delay_abi {\n parameters: get_update_delay_parameters,\n return_type: u64,\n }\n}\n"
|
|
3618
2911
|
},
|
|
3619
|
-
"
|
|
3620
|
-
"path": "
|
|
3621
|
-
"source": "use crate::{cmp::Eq, convert::From, runtime::is_unconstrained, static_assert};\n\n/// A `BoundedVec<T, MaxLen>` is a growable storage similar to a built-in vector except that it\n/// is bounded with a maximum possible length. `BoundedVec` is also not\n/// subject to the same restrictions vectors are (notably, nested vectors are disallowed).\n///\n/// Since a BoundedVec is backed by a normal array under the hood, growing the BoundedVec by\n/// pushing an additional element is also more efficient - the length only needs to be increased\n/// by one.\n///\n/// For these reasons `BoundedVec<T, N>` should generally be preferred over vectors when there\n/// is a reasonable maximum bound that can be placed on the vector.\n///\n/// Example:\n///\n/// ```noir\n/// let mut vector: BoundedVec<Field, 10> = BoundedVec::new();\n/// for i in 0..5 {\n/// vector.push(i);\n/// }\n/// assert(vector.len() == 5);\n/// assert(vector.max_len() == 10);\n/// ```\npub struct BoundedVec<T, let MaxLen: u32> {\n storage: [T; MaxLen],\n len: u32,\n}\n\nimpl<T, let MaxLen: u32> BoundedVec<T, MaxLen> {\n /// Creates a new, empty vector of length zero.\n ///\n /// Since this container is backed by an array internally, it still needs an initial value\n /// to give each element. To resolve this, each element is zeroed internally. This value\n /// is guaranteed to be inaccessible unless `get_unchecked` is used.\n ///\n /// Example:\n ///\n /// ```noir\n /// let empty_vector: BoundedVec<Field, 10> = BoundedVec::new();\n /// assert(empty_vector.len() == 0);\n /// ```\n ///\n /// Note that whenever calling `new` the maximum length of the vector should always be specified\n /// via a type signature:\n ///\n /// ```noir\n /// fn good() -> BoundedVec<Field, 10> {\n /// // Ok! MaxLen is specified with a type annotation\n /// let v1: BoundedVec<Field, 3> = BoundedVec::new();\n /// let v2 = BoundedVec::new();\n ///\n /// // Ok! MaxLen is known from the type of `good`'s return value\n /// v2\n /// }\n ///\n /// fn bad() {\n /// // Error: Type annotation needed\n /// // The compiler can't infer `MaxLen` from the following code:\n /// let mut v3 = BoundedVec::new();\n /// v3.push(5);\n /// }\n /// ```\n ///\n /// This defaulting of `MaxLen` (and numeric generics in general) to zero may change in future noir versions\n /// but for now make sure to use type annotations when using bounded vectors. Otherwise, you will receive a\n /// constraint failure at runtime when the vec is pushed to.\n pub fn new() -> Self {\n let zeroed = crate::mem::zeroed();\n BoundedVec { storage: [zeroed; MaxLen], len: 0 }\n }\n\n /// Retrieves an element from the vector at the given index, starting from zero.\n ///\n /// If the given index is equal to or greater than the length of the vector, this\n /// will issue a constraint failure.\n ///\n /// Example:\n ///\n /// ```noir\n /// fn foo<let N: u32>(v: BoundedVec<u32, N>) {\n /// let first = v.get(0);\n /// let last = v.get(v.len() - 1);\n /// assert(first != last);\n /// }\n /// ```\n pub fn get(self, index: u32) -> T {\n assert(index < self.len, \"Attempted to read past end of BoundedVec\");\n self.get_unchecked(index)\n }\n\n /// Retrieves an element from the vector at the given index, starting from zero, without\n /// performing a bounds check.\n ///\n /// Since this function does not perform a bounds check on length before accessing the element,\n /// it is unsafe! Use at your own risk!\n ///\n /// Example:\n ///\n /// ```noir\n /// fn sum_of_first_three<let N: u32>(v: BoundedVec<u32, N>) -> u32 {\n /// // Always ensure the length is larger than the largest\n /// // index passed to get_unchecked\n /// assert(v.len() > 2);\n /// let first = v.get_unchecked(0);\n /// let second = v.get_unchecked(1);\n /// let third = v.get_unchecked(2);\n /// first + second + third\n /// }\n /// ```\n pub fn get_unchecked(self, index: u32) -> T {\n self.storage[index]\n }\n\n /// Writes an element to the vector at the given index, starting from zero.\n ///\n /// If the given index is equal to or greater than the length of the vector, this will issue a constraint failure.\n ///\n /// Example:\n ///\n /// ```noir\n /// fn foo<let N: u32>(v: BoundedVec<u32, N>) {\n /// let first = v.get(0);\n /// assert(first != 42);\n /// v.set(0, 42);\n /// let new_first = v.get(0);\n /// assert(new_first == 42);\n /// }\n /// ```\n pub fn set(&mut self, index: u32, value: T) {\n assert(index < self.len, \"Attempted to write past end of BoundedVec\");\n self.set_unchecked(index, value)\n }\n\n /// Writes an element to the vector at the given index, starting from zero, without performing a bounds check.\n ///\n /// Since this function does not perform a bounds check on length before accessing the element, it is unsafe! Use at your own risk!\n ///\n /// Example:\n ///\n /// ```noir\n /// fn set_unchecked_example() {\n /// let mut vec: BoundedVec<u32, 5> = BoundedVec::new();\n /// vec.extend_from_array([1, 2]);\n ///\n /// // Here we're safely writing within the valid range of `vec`\n /// // `vec` now has the value [42, 2]\n /// vec.set_unchecked(0, 42);\n ///\n /// // We can then safely read this value back out of `vec`.\n /// // Notice that we use the checked version of `get` which would prevent reading unsafe values.\n /// assert_eq(vec.get(0), 42);\n ///\n /// // We've now written past the end of `vec`.\n /// // As this index is still within the maximum potential length of `v`,\n /// // it won't cause a constraint failure.\n /// vec.set_unchecked(2, 42);\n /// println(vec);\n ///\n /// // This will write past the end of the maximum potential length of `vec`,\n /// // it will then trigger a constraint failure.\n /// vec.set_unchecked(5, 42);\n /// println(vec);\n /// }\n /// ```\n pub fn set_unchecked(&mut self, index: u32, value: T) {\n self.storage[index] = value;\n }\n\n /// Pushes an element to the end of the vector. This increases the length\n /// of the vector by one.\n ///\n /// Panics if the new length of the vector will be greater than the max length.\n ///\n /// Example:\n ///\n /// ```noir\n /// let mut v: BoundedVec<Field, 2> = BoundedVec::new();\n ///\n /// v.push(1);\n /// v.push(2);\n ///\n /// // Panics with failed assertion \"push out of bounds\"\n /// v.push(3);\n /// ```\n pub fn push(&mut self, elem: T) {\n assert(self.len < MaxLen, \"push out of bounds\");\n\n self.storage[self.len] = elem;\n self.len += 1;\n }\n\n /// Returns the current length of this vector\n ///\n /// Example:\n ///\n /// ```noir\n /// let mut v: BoundedVec<Field, 4> = BoundedVec::new();\n /// assert(v.len() == 0);\n ///\n /// v.push(100);\n /// assert(v.len() == 1);\n ///\n /// v.push(200);\n /// v.push(300);\n /// v.push(400);\n /// assert(v.len() == 4);\n ///\n /// let _ = v.pop();\n /// let _ = v.pop();\n /// assert(v.len() == 2);\n /// ```\n pub fn len(self) -> u32 {\n self.len\n }\n\n /// Returns the maximum length of this vector. This is always\n /// equal to the `MaxLen` parameter this vector was initialized with.\n ///\n /// Example:\n ///\n /// ```noir\n /// let mut v: BoundedVec<Field, 5> = BoundedVec::new();\n ///\n /// assert(v.max_len() == 5);\n /// v.push(10);\n /// assert(v.max_len() == 5);\n /// ```\n pub fn max_len(_self: BoundedVec<T, MaxLen>) -> u32 {\n MaxLen\n }\n\n /// Returns the internal array within this vector.\n ///\n /// Since arrays in Noir are immutable, mutating the returned storage array will not mutate\n /// the storage held internally by this vector.\n ///\n /// Note that uninitialized elements may be zeroed out!\n ///\n /// Example:\n ///\n /// ```noir\n /// let mut v: BoundedVec<Field, 5> = BoundedVec::new();\n ///\n /// assert(v.storage() == [0, 0, 0, 0, 0]);\n ///\n /// v.push(57);\n /// assert(v.storage() == [57, 0, 0, 0, 0]);\n /// ```\n pub fn storage(self) -> [T; MaxLen] {\n self.storage\n }\n\n /// Pushes each element from the given array to this vector.\n ///\n /// Panics if pushing each element would cause the length of this vector\n /// to exceed the maximum length.\n ///\n /// Example:\n ///\n /// ```noir\n /// let mut vec: BoundedVec<Field, 3> = BoundedVec::new();\n /// vec.extend_from_array([2, 4]);\n ///\n /// assert(vec.len == 2);\n /// assert(vec.get(0) == 2);\n /// assert(vec.get(1) == 4);\n /// ```\n pub fn extend_from_array<let Len: u32>(&mut self, array: [T; Len]) {\n let new_len = self.len + array.len();\n assert(new_len <= MaxLen, \"extend_from_array out of bounds\");\n for i in 0..array.len() {\n self.storage[self.len + i] = array[i];\n }\n self.len = new_len;\n }\n\n /// Pushes each element from the given vector to this vector.\n ///\n /// Panics if pushing each element would cause the length of this vector\n /// to exceed the maximum length.\n ///\n /// Example:\n ///\n /// ```noir\n /// let mut vec: BoundedVec<Field, 3> = BoundedVec::new();\n /// vec.extend_from_vector([2, 4].as_vector());\n ///\n /// assert(vec.len == 2);\n /// assert(vec.get(0) == 2);\n /// assert(vec.get(1) == 4);\n /// ```\n pub fn extend_from_vector(&mut self, vector: [T]) {\n let new_len = self.len + vector.len();\n assert(new_len <= MaxLen, \"extend_from_vector out of bounds\");\n for i in 0..vector.len() {\n self.storage[self.len + i] = vector[i];\n }\n self.len = new_len;\n }\n\n /// Pushes each element from the other vector to this vector. The length of\n /// the other vector is left unchanged.\n ///\n /// Panics if pushing each element would cause the length of this vector\n /// to exceed the maximum length.\n ///\n /// ```noir\n /// let mut v1: BoundedVec<Field, 5> = BoundedVec::new();\n /// let mut v2: BoundedVec<Field, 7> = BoundedVec::new();\n ///\n /// v2.extend_from_array([1, 2, 3]);\n /// v1.extend_from_bounded_vec(v2);\n ///\n /// assert(v1.storage() == [1, 2, 3, 0, 0]);\n /// assert(v2.storage() == [1, 2, 3, 0, 0, 0, 0]);\n /// ```\n pub fn extend_from_bounded_vec<let Len: u32>(&mut self, vec: BoundedVec<T, Len>) {\n let append_len = vec.len();\n let new_len = self.len + append_len;\n assert(new_len <= MaxLen, \"extend_from_bounded_vec out of bounds\");\n\n if is_unconstrained() {\n for i in 0..append_len {\n self.storage[self.len + i] = vec.get_unchecked(i);\n }\n } else {\n for i in 0..Len {\n if i < append_len {\n self.storage[self.len + i] = vec.get_unchecked(i);\n }\n }\n }\n self.len = new_len;\n }\n\n /// Creates a new vector, populating it with values derived from an array input.\n /// The maximum length of the vector is determined based on the type signature.\n ///\n /// Example:\n ///\n /// ```noir\n /// let bounded_vec: BoundedVec<Field, 10> = BoundedVec::from_array([1, 2, 3])\n /// ```\n pub fn from_array<let Len: u32>(array: [T; Len]) -> Self {\n static_assert(Len <= MaxLen, \"from array out of bounds\");\n let mut vec: BoundedVec<T, MaxLen> = BoundedVec::new();\n vec.extend_from_array(array);\n vec\n }\n\n /// Pops the element at the end of the vector. This will decrease the length\n /// of the vector by one.\n ///\n /// Panics if the vector is empty.\n ///\n /// Example:\n ///\n /// ```noir\n /// let mut v: BoundedVec<Field, 2> = BoundedVec::new();\n /// v.push(1);\n /// v.push(2);\n ///\n /// let two = v.pop();\n /// let one = v.pop();\n ///\n /// assert(two == 2);\n /// assert(one == 1);\n ///\n /// // error: cannot pop from an empty vector\n /// let _ = v.pop();\n /// ```\n pub fn pop(&mut self) -> T {\n assert(self.len > 0, \"cannot pop from an empty vector\");\n self.len -= 1;\n\n let elem = self.storage[self.len];\n self.storage[self.len] = crate::mem::zeroed();\n elem\n }\n\n /// Returns true if the given predicate returns true for any element\n /// in this vector.\n ///\n /// Example:\n ///\n /// ```noir\n /// let mut v: BoundedVec<u32, 3> = BoundedVec::new();\n /// v.extend_from_array([2, 4, 6]);\n ///\n /// let all_even = !v.any(|elem: u32| elem % 2 != 0);\n /// assert(all_even);\n /// ```\n pub fn any<Env>(self, predicate: fn[Env](T) -> bool) -> bool {\n let mut ret = false;\n if is_unconstrained() {\n for i in 0..self.len {\n ret |= predicate(self.storage[i]);\n }\n } else {\n let mut exceeded_len = false;\n for i in 0..MaxLen {\n exceeded_len |= i == self.len;\n if !exceeded_len {\n ret |= predicate(self.storage[i]);\n }\n }\n }\n ret\n }\n\n /// Creates a new vector of equal size by calling a closure on each element in this vector.\n ///\n /// Example:\n ///\n /// ```noir\n /// let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n /// let result = vec.map(|value| value * 2);\n ///\n /// let expected = BoundedVec::from_array([2, 4, 6, 8]);\n /// assert_eq(result, expected);\n /// ```\n pub fn map<U, Env>(self, f: fn[Env](T) -> U) -> BoundedVec<U, MaxLen> {\n let mut ret = BoundedVec::new();\n ret.len = self.len();\n\n if is_unconstrained() {\n for i in 0..self.len() {\n ret.storage[i] = f(self.get_unchecked(i));\n }\n } else {\n for i in 0..MaxLen {\n if i < self.len() {\n ret.storage[i] = f(self.get_unchecked(i));\n }\n }\n }\n\n ret\n }\n\n /// Creates a new vector of equal size by calling a closure on each element\n /// in this vector, along with its index.\n ///\n /// Example:\n ///\n /// ```noir\n /// let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n /// let result = vec.mapi(|i, value| i + value * 2);\n ///\n /// let expected = BoundedVec::from_array([2, 5, 8, 11]);\n /// assert_eq(result, expected);\n /// ```\n pub fn mapi<U, Env>(self, f: fn[Env](u32, T) -> U) -> BoundedVec<U, MaxLen> {\n let mut ret = BoundedVec::new();\n ret.len = self.len();\n\n if is_unconstrained() {\n for i in 0..self.len() {\n ret.storage[i] = f(i, self.get_unchecked(i));\n }\n } else {\n for i in 0..MaxLen {\n if i < self.len() {\n ret.storage[i] = f(i, self.get_unchecked(i));\n }\n }\n }\n\n ret\n }\n\n /// Calls a closure on each element in this vector.\n ///\n /// Example:\n ///\n /// ```noir\n /// let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n /// let mut result = BoundedVec::<u32, 4>::new();\n /// vec.for_each(|value| result.push(value * 2));\n ///\n /// let expected = BoundedVec::from_array([2, 4, 6, 8]);\n /// assert_eq(result, expected);\n /// ```\n pub fn for_each<Env>(self, f: fn[Env](T) -> ()) {\n if is_unconstrained() {\n for i in 0..self.len() {\n f(self.get_unchecked(i));\n }\n } else {\n for i in 0..MaxLen {\n if i < self.len() {\n f(self.get_unchecked(i));\n }\n }\n }\n }\n\n /// Calls a closure on each element in this vector, along with its index.\n ///\n /// Example:\n ///\n /// ```noir\n /// let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n /// let mut result = BoundedVec::<u32, 4>::new();\n /// vec.for_eachi(|i, value| result.push(i + value * 2));\n ///\n /// let expected = BoundedVec::from_array([2, 5, 8, 11]);\n /// assert_eq(result, expected);\n /// ```\n pub fn for_eachi<Env>(self, f: fn[Env](u32, T) -> ()) {\n if is_unconstrained() {\n for i in 0..self.len() {\n f(i, self.get_unchecked(i));\n }\n } else {\n for i in 0..MaxLen {\n if i < self.len() {\n f(i, self.get_unchecked(i));\n }\n }\n }\n }\n\n /// Creates a new BoundedVec from the given array and length.\n /// The given length must be less than or equal to the length of the array.\n ///\n /// This function will zero out any elements at or past index `len` of `array`.\n /// This incurs an extra runtime cost of O(MaxLen). If you are sure your array is\n /// zeroed after that index, you can use [`from_parts_unchecked`][Self::from_parts_unchecked] to remove the extra loop.\n ///\n /// Example:\n ///\n /// ```noir\n /// let vec: BoundedVec<u32, 4> = BoundedVec::from_parts([1, 2, 3, 0], 3);\n /// assert_eq(vec.len(), 3);\n /// ```\n pub fn from_parts(mut array: [T; MaxLen], len: u32) -> Self {\n assert(len <= MaxLen);\n let zeroed = crate::mem::zeroed();\n\n if is_unconstrained() {\n for i in len..MaxLen {\n array[i] = zeroed;\n }\n } else {\n for i in 0..MaxLen {\n if i >= len {\n array[i] = zeroed;\n }\n }\n }\n\n BoundedVec { storage: array, len }\n }\n\n /// Creates a new BoundedVec from the given array and length.\n /// The given length must be less than or equal to the length of the array.\n ///\n /// This function is unsafe because it expects all elements past the `len` index\n /// of `array` to be zeroed, but does not check for this internally. Use `from_parts`\n /// for a safe version of this function which does zero out any indices past the\n /// given length. Invalidating this assumption can notably cause `BoundedVec::eq`\n /// to give incorrect results since it will check even elements past `len`.\n ///\n /// Example:\n ///\n /// ```noir\n /// let vec: BoundedVec<u32, 4> = BoundedVec::from_parts_unchecked([1, 2, 3, 0], 3);\n /// assert_eq(vec.len(), 3);\n ///\n /// // invalid use!\n /// let vec1: BoundedVec<u32, 4> = BoundedVec::from_parts_unchecked([1, 2, 3, 1], 3);\n /// let vec2: BoundedVec<u32, 4> = BoundedVec::from_parts_unchecked([1, 2, 3, 2], 3);\n ///\n /// // both vecs have length 3 so we'd expect them to be equal, but this\n /// // fails because elements past the length are still checked in eq\n /// assert_eq(vec1, vec2); // fails\n /// ```\n pub fn from_parts_unchecked(array: [T; MaxLen], len: u32) -> Self {\n assert(len <= MaxLen);\n BoundedVec { storage: array, len }\n }\n}\n\nimpl<T, let MaxLen: u32> Eq for BoundedVec<T, MaxLen>\nwhere\n T: Eq,\n{\n fn eq(self, other: BoundedVec<T, MaxLen>) -> bool {\n // TODO: https://github.com/noir-lang/noir/issues/4837\n //\n // We make the assumption that the user has used the proper interface for working with `BoundedVec`s\n // rather than directly manipulating the internal fields as this can result in an inconsistent internal state.\n if self.len == other.len {\n self.storage == other.storage\n } else {\n false\n }\n }\n}\n\nimpl<T, let MaxLen: u32, let Len: u32> From<[T; Len]> for BoundedVec<T, MaxLen> {\n fn from(array: [T; Len]) -> BoundedVec<T, MaxLen> {\n BoundedVec::from_array(array)\n }\n}\n\nmod bounded_vec_tests {\n\n mod get {\n use crate::collections::bounded_vec::BoundedVec;\n\n #[test(should_fail_with = \"Attempted to read past end of BoundedVec\")]\n fn panics_when_reading_elements_past_end_of_vec() {\n let vec: BoundedVec<Field, 5> = BoundedVec::new();\n\n let _ = vec.get(0);\n }\n\n #[test(should_fail_with = \"Attempted to read past end of BoundedVec\")]\n fn panics_when_reading_beyond_length() {\n let vec: BoundedVec<u32, 5> = BoundedVec::from_array([1, 2, 3]);\n let _ = vec.get(3);\n }\n\n #[test]\n fn get_works_within_bounds() {\n let vec: BoundedVec<u32, 5> = BoundedVec::from_array([1, 2, 3, 4, 5]);\n assert_eq(vec.get(0), 1);\n assert_eq(vec.get(2), 3);\n assert_eq(vec.get(4), 5);\n }\n\n #[test]\n fn get_unchecked_works() {\n let vec: BoundedVec<u32, 5> = BoundedVec::from_array([1, 2, 3]);\n assert_eq(vec.get_unchecked(0), 1);\n assert_eq(vec.get_unchecked(2), 3);\n }\n\n #[test]\n fn get_unchecked_works_past_len() {\n let vec: BoundedVec<u32, 5> = BoundedVec::from_array([1, 2, 3]);\n assert_eq(vec.get_unchecked(4), 0);\n }\n }\n\n mod set {\n use crate::collections::bounded_vec::BoundedVec;\n\n #[test]\n fn set_updates_values_properly() {\n let mut vec = BoundedVec::from_array([0, 0, 0, 0, 0]);\n\n vec.set(0, 42);\n assert_eq(vec.storage, [42, 0, 0, 0, 0]);\n\n vec.set(1, 43);\n assert_eq(vec.storage, [42, 43, 0, 0, 0]);\n\n vec.set(2, 44);\n assert_eq(vec.storage, [42, 43, 44, 0, 0]);\n\n vec.set(1, 10);\n assert_eq(vec.storage, [42, 10, 44, 0, 0]);\n\n vec.set(0, 0);\n assert_eq(vec.storage, [0, 10, 44, 0, 0]);\n }\n\n #[test(should_fail_with = \"Attempted to write past end of BoundedVec\")]\n fn panics_when_writing_elements_past_end_of_vec() {\n let mut vec: BoundedVec<Field, 5> = BoundedVec::new();\n vec.set(0, 42);\n }\n\n #[test(should_fail_with = \"Attempted to write past end of BoundedVec\")]\n fn panics_when_setting_beyond_length() {\n let mut vec: BoundedVec<u32, 5> = BoundedVec::from_array([1, 2, 3]);\n vec.set(3, 4);\n }\n\n #[test]\n fn set_unchecked_operations() {\n let mut vec: BoundedVec<u32, 5> = BoundedVec::new();\n vec.push(1);\n vec.push(2);\n\n vec.set_unchecked(0, 10);\n assert_eq(vec.get(0), 10);\n }\n\n #[test(should_fail_with = \"Attempted to read past end of BoundedVec\")]\n fn set_unchecked_operations_past_len() {\n let mut vec: BoundedVec<u32, 5> = BoundedVec::new();\n vec.push(1);\n vec.push(2);\n\n vec.set_unchecked(3, 40);\n assert_eq(vec.get(3), 40);\n }\n\n #[test]\n fn set_preserves_other_elements() {\n let mut vec: BoundedVec<u32, 5> = BoundedVec::from_array([1, 2, 3, 4, 5]);\n\n vec.set(2, 30);\n assert_eq(vec.get(0), 1);\n assert_eq(vec.get(1), 2);\n assert_eq(vec.get(2), 30);\n assert_eq(vec.get(3), 4);\n assert_eq(vec.get(4), 5);\n }\n }\n\n mod any {\n use crate::collections::bounded_vec::BoundedVec;\n\n #[test]\n fn returns_false_if_predicate_not_satisfied() {\n let vec: BoundedVec<bool, 4> = BoundedVec::from_array([false, false, false, false]);\n let result = vec.any(|value| value);\n\n assert(!result);\n }\n\n #[test]\n fn returns_true_if_predicate_satisfied() {\n let vec: BoundedVec<bool, 4> = BoundedVec::from_array([false, false, true, true]);\n let result = vec.any(|value| value);\n\n assert(result);\n }\n\n #[test]\n fn returns_false_on_empty_boundedvec() {\n let vec: BoundedVec<bool, 0> = BoundedVec::new();\n let result = vec.any(|value| value);\n\n assert(!result);\n }\n\n #[test]\n fn any_with_complex_predicates() {\n let vec: BoundedVec<u32, 5> = BoundedVec::from_array([1, 2, 3, 4, 5]);\n\n assert(vec.any(|x| x > 3));\n assert(!vec.any(|x| x > 10));\n assert(vec.any(|x| x % 2 == 0)); // has a even number\n assert(vec.any(|x| x == 3)); // has a specific value\n }\n\n #[test]\n fn any_with_partial_vector() {\n let mut vec: BoundedVec<u32, 5> = BoundedVec::new();\n vec.push(1);\n vec.push(2);\n\n assert(vec.any(|x| x == 1));\n assert(vec.any(|x| x == 2));\n assert(!vec.any(|x| x == 3));\n }\n }\n\n mod map {\n use crate::collections::bounded_vec::BoundedVec;\n\n #[test]\n fn applies_function_correctly() {\n // docs:start:bounded-vec-map-example\n let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n let result = vec.map(|value| value * 2);\n // docs:end:bounded-vec-map-example\n let expected = BoundedVec::from_array([2, 4, 6, 8]);\n\n assert_eq(result, expected);\n }\n\n #[test]\n fn applies_function_that_changes_return_type() {\n let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n let result = vec.map(|value| (value * 2) as Field);\n let expected: BoundedVec<Field, 4> = BoundedVec::from_array([2, 4, 6, 8]);\n\n assert_eq(result, expected);\n }\n\n #[test]\n fn does_not_apply_function_past_len() {\n let vec: BoundedVec<u32, 3> = BoundedVec::from_array([0, 1]);\n let result = vec.map(|value| if value == 0 { 5 } else { value });\n let expected = BoundedVec::from_array([5, 1]);\n\n assert_eq(result, expected);\n assert_eq(result.get_unchecked(2), 0);\n }\n\n #[test]\n fn map_with_conditional_logic() {\n let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n\n let result = vec.map(|x| if x % 2 == 0 { x * 2 } else { x });\n let expected = BoundedVec::from_array([1, 4, 3, 8]);\n assert_eq(result, expected);\n }\n\n #[test]\n fn map_preserves_length() {\n let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n let result = vec.map(|x| x * 2);\n\n assert_eq(result.len(), vec.len());\n assert_eq(result.max_len(), vec.max_len());\n }\n\n #[test]\n fn map_on_empty_vector() {\n let vec: BoundedVec<u32, 5> = BoundedVec::new();\n let result = vec.map(|x| x * 2);\n assert_eq(result, vec);\n assert_eq(result.len(), 0);\n assert_eq(result.max_len(), 5);\n }\n }\n\n mod mapi {\n use crate::collections::bounded_vec::BoundedVec;\n\n #[test]\n fn applies_function_correctly() {\n // docs:start:bounded-vec-mapi-example\n let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n let result = vec.mapi(|i, value| i + value * 2);\n // docs:end:bounded-vec-mapi-example\n let expected = BoundedVec::from_array([2, 5, 8, 11]);\n\n assert_eq(result, expected);\n }\n\n #[test]\n fn applies_function_that_changes_return_type() {\n let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n let result = vec.mapi(|i, value| (i + value * 2) as Field);\n let expected: BoundedVec<Field, 4> = BoundedVec::from_array([2, 5, 8, 11]);\n\n assert_eq(result, expected);\n }\n\n #[test]\n fn does_not_apply_function_past_len() {\n let vec: BoundedVec<u32, 3> = BoundedVec::from_array([0, 1]);\n let result = vec.mapi(|_, value| if value == 0 { 5 } else { value });\n let expected = BoundedVec::from_array([5, 1]);\n\n assert_eq(result, expected);\n assert_eq(result.get_unchecked(2), 0);\n }\n\n #[test]\n fn mapi_with_index_branching_logic() {\n let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n\n let result = vec.mapi(|i, x| if i % 2 == 0 { x * 2 } else { x });\n let expected = BoundedVec::from_array([2, 2, 6, 4]);\n assert_eq(result, expected);\n }\n }\n\n mod for_each {\n use crate::collections::bounded_vec::BoundedVec;\n\n // map in terms of for_each\n fn for_each_map<T, U, Env, let MaxLen: u32>(\n input: BoundedVec<T, MaxLen>,\n f: fn[Env](T) -> U,\n ) -> BoundedVec<U, MaxLen> {\n let mut output = BoundedVec::<U, MaxLen>::new();\n let output_ref = &mut output;\n input.for_each(|x| output_ref.push(f(x)));\n output\n }\n\n #[test]\n fn smoke_test() {\n let mut acc = 0;\n let acc_ref = &mut acc;\n // docs:start:bounded-vec-for-each-example\n let vec: BoundedVec<u32, 3> = BoundedVec::from_array([1, 2, 3]);\n vec.for_each(|value| { *acc_ref += value; });\n // docs:end:bounded-vec-for-each-example\n assert_eq(acc, 6);\n }\n\n #[test]\n fn applies_function_correctly() {\n let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n let result = for_each_map(vec, |value| value * 2);\n let expected = BoundedVec::from_array([2, 4, 6, 8]);\n\n assert_eq(result, expected);\n }\n\n #[test]\n fn applies_function_that_changes_return_type() {\n let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n let result = for_each_map(vec, |value| (value * 2) as Field);\n let expected: BoundedVec<Field, 4> = BoundedVec::from_array([2, 4, 6, 8]);\n\n assert_eq(result, expected);\n }\n\n #[test]\n fn does_not_apply_function_past_len() {\n let vec: BoundedVec<u32, 3> = BoundedVec::from_array([0, 1]);\n let result = for_each_map(vec, |value| if value == 0 { 5 } else { value });\n let expected = BoundedVec::from_array([5, 1]);\n\n assert_eq(result, expected);\n assert_eq(result.get_unchecked(2), 0);\n }\n\n #[test]\n fn for_each_on_empty_vector() {\n let vec: BoundedVec<u32, 5> = BoundedVec::new();\n let mut count = 0;\n let count_ref = &mut count;\n vec.for_each(|_| { *count_ref += 1; });\n assert_eq(count, 0);\n }\n\n #[test]\n fn for_each_with_side_effects() {\n let vec: BoundedVec<u32, 3> = BoundedVec::from_array([1, 2, 3]);\n let mut seen = BoundedVec::<u32, 3>::new();\n let seen_ref = &mut seen;\n vec.for_each(|x| seen_ref.push(x));\n assert_eq(seen, vec);\n }\n }\n\n mod for_eachi {\n use crate::collections::bounded_vec::BoundedVec;\n\n // mapi in terms of for_eachi\n fn for_eachi_mapi<T, U, Env, let MaxLen: u32>(\n input: BoundedVec<T, MaxLen>,\n f: fn[Env](u32, T) -> U,\n ) -> BoundedVec<U, MaxLen> {\n let mut output = BoundedVec::<U, MaxLen>::new();\n let output_ref = &mut output;\n input.for_eachi(|i, x| output_ref.push(f(i, x)));\n output\n }\n\n #[test]\n fn smoke_test() {\n let mut acc = 0;\n let acc_ref = &mut acc;\n // docs:start:bounded-vec-for-eachi-example\n let vec: BoundedVec<u32, 3> = BoundedVec::from_array([1, 2, 3]);\n vec.for_eachi(|i, value| { *acc_ref += i * value; });\n // docs:end:bounded-vec-for-eachi-example\n\n // 0 * 1 + 1 * 2 + 2 * 3\n assert_eq(acc, 8);\n }\n\n #[test]\n fn applies_function_correctly() {\n let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n let result = for_eachi_mapi(vec, |i, value| i + value * 2);\n let expected = BoundedVec::from_array([2, 5, 8, 11]);\n\n assert_eq(result, expected);\n }\n\n #[test]\n fn applies_function_that_changes_return_type() {\n let vec: BoundedVec<u32, 4> = BoundedVec::from_array([1, 2, 3, 4]);\n let result = for_eachi_mapi(vec, |i, value| (i + value * 2) as Field);\n let expected: BoundedVec<Field, 4> = BoundedVec::from_array([2, 5, 8, 11]);\n\n assert_eq(result, expected);\n }\n\n #[test]\n fn does_not_apply_function_past_len() {\n let vec: BoundedVec<u32, 3> = BoundedVec::from_array([0, 1]);\n let result = for_eachi_mapi(vec, |_, value| if value == 0 { 5 } else { value });\n let expected = BoundedVec::from_array([5, 1]);\n\n assert_eq(result, expected);\n assert_eq(result.get_unchecked(2), 0);\n }\n\n #[test]\n fn for_eachi_on_empty_vector() {\n let vec: BoundedVec<u32, 5> = BoundedVec::new();\n let mut count = 0;\n let count_ref = &mut count;\n vec.for_eachi(|_, _| { *count_ref += 1; });\n assert_eq(count, 0);\n }\n\n #[test]\n fn for_eachi_with_index_tracking() {\n let vec: BoundedVec<u32, 3> = BoundedVec::from_array([10, 20, 30]);\n let mut indices = BoundedVec::<u32, 3>::new();\n let indices_ref = &mut indices;\n vec.for_eachi(|i, _| indices_ref.push(i));\n\n let expected = BoundedVec::from_array([0, 1, 2]);\n assert_eq(indices, expected);\n }\n\n }\n\n mod from_array {\n use crate::collections::bounded_vec::BoundedVec;\n\n #[test]\n fn empty() {\n let empty_array: [Field; 0] = [];\n let bounded_vec = BoundedVec::from_array([]);\n\n assert_eq(bounded_vec.max_len(), 0);\n assert_eq(bounded_vec.len(), 0);\n assert_eq(bounded_vec.storage(), empty_array);\n }\n\n #[test]\n fn equal_len() {\n let array = [1, 2, 3];\n let bounded_vec = BoundedVec::from_array(array);\n\n assert_eq(bounded_vec.max_len(), 3);\n assert_eq(bounded_vec.len(), 3);\n assert_eq(bounded_vec.storage(), array);\n }\n\n #[test]\n fn max_len_greater_then_array_len() {\n let array = [1, 2, 3];\n let bounded_vec: BoundedVec<Field, 10> = BoundedVec::from_array(array);\n\n assert_eq(bounded_vec.max_len(), 10);\n assert_eq(bounded_vec.len(), 3);\n assert_eq(bounded_vec.get(0), 1);\n assert_eq(bounded_vec.get(1), 2);\n assert_eq(bounded_vec.get(2), 3);\n }\n\n #[test(should_fail_with = \"from array out of bounds\")]\n fn max_len_lower_then_array_len() {\n let _: BoundedVec<Field, 2> = BoundedVec::from_array([0; 3]);\n }\n\n #[test]\n fn from_array_preserves_order() {\n let array = [5, 3, 1, 4, 2];\n let vec: BoundedVec<u32, 5> = BoundedVec::from_array(array);\n for i in 0..array.len() {\n assert_eq(vec.get(i), array[i]);\n }\n }\n\n #[test]\n fn from_array_with_different_types() {\n let bool_array = [true, false, true];\n let bool_vec: BoundedVec<bool, 3> = BoundedVec::from_array(bool_array);\n assert_eq(bool_vec.len(), 3);\n assert_eq(bool_vec.get(0), true);\n assert_eq(bool_vec.get(1), false);\n }\n }\n\n mod trait_from {\n use crate::collections::bounded_vec::BoundedVec;\n use crate::convert::From;\n\n #[test]\n fn simple() {\n let array = [1, 2];\n let bounded_vec: BoundedVec<Field, 10> = BoundedVec::from(array);\n\n assert_eq(bounded_vec.max_len(), 10);\n assert_eq(bounded_vec.len(), 2);\n assert_eq(bounded_vec.get(0), 1);\n assert_eq(bounded_vec.get(1), 2);\n }\n }\n\n mod trait_eq {\n use crate::collections::bounded_vec::BoundedVec;\n\n #[test]\n fn empty_equality() {\n let mut bounded_vec1: BoundedVec<Field, 3> = BoundedVec::new();\n let mut bounded_vec2: BoundedVec<Field, 3> = BoundedVec::new();\n\n assert_eq(bounded_vec1, bounded_vec2);\n }\n\n #[test]\n fn inequality() {\n let mut bounded_vec1: BoundedVec<Field, 3> = BoundedVec::new();\n let mut bounded_vec2: BoundedVec<Field, 3> = BoundedVec::new();\n bounded_vec1.push(1);\n bounded_vec2.push(2);\n\n assert(bounded_vec1 != bounded_vec2);\n }\n }\n\n mod from_parts {\n use crate::collections::bounded_vec::BoundedVec;\n\n #[test]\n fn from_parts() {\n // docs:start:from-parts\n let vec: BoundedVec<u32, 4> = BoundedVec::from_parts([1, 2, 3, 0], 3);\n assert_eq(vec.len(), 3);\n\n // Any elements past the given length are zeroed out, so these\n // two BoundedVecs will be completely equal\n let vec1: BoundedVec<u32, 4> = BoundedVec::from_parts([1, 2, 3, 1], 3);\n let vec2: BoundedVec<u32, 4> = BoundedVec::from_parts([1, 2, 3, 2], 3);\n assert_eq(vec1, vec2);\n // docs:end:from-parts\n }\n\n #[test]\n fn from_parts_unchecked() {\n // docs:start:from-parts-unchecked\n let vec: BoundedVec<u32, 4> = BoundedVec::from_parts_unchecked([1, 2, 3, 0], 3);\n assert_eq(vec.len(), 3);\n\n // invalid use!\n let vec1: BoundedVec<u32, 4> = BoundedVec::from_parts_unchecked([1, 2, 3, 1], 3);\n let vec2: BoundedVec<u32, 4> = BoundedVec::from_parts_unchecked([1, 2, 3, 2], 3);\n\n // both vecs have length 3 so we'd expect them to be equal, but this\n // fails because elements past the length are still checked in eq\n assert(vec1 != vec2);\n // docs:end:from-parts-unchecked\n }\n }\n\n mod push_pop {\n use crate::collections::bounded_vec::BoundedVec;\n\n #[test]\n fn push_and_pop_operations() {\n let mut vec: BoundedVec<u32, 5> = BoundedVec::new();\n\n assert_eq(vec.len(), 0);\n\n vec.push(1);\n assert_eq(vec.len(), 1);\n assert_eq(vec.get(0), 1);\n\n vec.push(2);\n assert_eq(vec.len(), 2);\n assert_eq(vec.get(1), 2);\n\n let popped = vec.pop();\n assert_eq(popped, 2);\n assert_eq(vec.len(), 1);\n\n let popped2 = vec.pop();\n assert_eq(popped2, 1);\n assert_eq(vec.len(), 0);\n }\n\n #[test(should_fail_with = \"push out of bounds\")]\n fn push_to_full_vector() {\n let mut vec: BoundedVec<u32, 2> = BoundedVec::new();\n vec.push(1);\n vec.push(2);\n vec.push(3); // should panic\n }\n\n #[test(should_fail_with = \"cannot pop from an empty vector\")]\n fn pop_from_empty_vector() {\n let mut vec: BoundedVec<u32, 5> = BoundedVec::new();\n let _ = vec.pop(); // should panic\n }\n\n #[test]\n fn push_pop_cycle() {\n let mut vec: BoundedVec<u32, 3> = BoundedVec::new();\n\n // push to full\n vec.push(1);\n vec.push(2);\n vec.push(3);\n assert_eq(vec.len(), 3);\n\n // pop all\n assert_eq(vec.pop(), 3);\n assert_eq(vec.pop(), 2);\n assert_eq(vec.pop(), 1);\n assert_eq(vec.len(), 0);\n\n // push again\n vec.push(4);\n assert_eq(vec.len(), 1);\n assert_eq(vec.get(0), 4);\n }\n }\n\n mod extend {\n use crate::collections::bounded_vec::BoundedVec;\n\n #[test]\n fn extend_from_array() {\n let mut vec: BoundedVec<u32, 5> = BoundedVec::new();\n vec.push(1);\n vec.extend_from_array([2, 3]);\n\n assert_eq(vec.len(), 3);\n assert_eq(vec.get(0), 1);\n assert_eq(vec.get(1), 2);\n assert_eq(vec.get(2), 3);\n }\n\n #[test]\n fn extend_from_vector() {\n let mut vec: BoundedVec<u32, 5> = BoundedVec::new();\n vec.push(1);\n vec.extend_from_vector([2, 3].as_vector());\n\n assert_eq(vec.len(), 3);\n assert_eq(vec.get(0), 1);\n assert_eq(vec.get(1), 2);\n assert_eq(vec.get(2), 3);\n }\n\n #[test]\n fn extend_from_bounded_vec() {\n let mut vec1: BoundedVec<u32, 5> = BoundedVec::new();\n let mut vec2: BoundedVec<u32, 3> = BoundedVec::new();\n\n vec1.push(1);\n vec2.push(2);\n vec2.push(3);\n\n vec1.extend_from_bounded_vec(vec2);\n\n assert_eq(vec1.len(), 3);\n assert_eq(vec1.get(0), 1);\n assert_eq(vec1.get(1), 2);\n assert_eq(vec1.get(2), 3);\n }\n\n #[test(should_fail_with = \"extend_from_array out of bounds\")]\n fn extend_array_beyond_max_len() {\n let mut vec: BoundedVec<u32, 3> = BoundedVec::new();\n vec.push(1);\n vec.extend_from_array([2, 3, 4]); // should panic\n }\n\n #[test(should_fail_with = \"extend_from_vector out of bounds\")]\n fn extend_vector_beyond_max_len() {\n let mut vec: BoundedVec<u32, 3> = BoundedVec::new();\n vec.push(1);\n vec.extend_from_vector([2, 3, 4].as_vector()); // S]should panic\n }\n\n #[test(should_fail_with = \"extend_from_bounded_vec out of bounds\")]\n fn extend_bounded_vec_beyond_max_len() {\n let mut vec: BoundedVec<u32, 3> = BoundedVec::new();\n let other: BoundedVec<u32, 5> = BoundedVec::from_array([1, 2, 3, 4, 5]);\n vec.extend_from_bounded_vec(other); // should panic\n }\n\n #[test]\n fn extend_with_empty_collections() {\n let mut vec: BoundedVec<u32, 5> = BoundedVec::new();\n let original_len = vec.len();\n\n vec.extend_from_array([]);\n assert_eq(vec.len(), original_len);\n\n vec.extend_from_vector([].as_vector());\n assert_eq(vec.len(), original_len);\n\n let empty: BoundedVec<u32, 3> = BoundedVec::new();\n vec.extend_from_bounded_vec(empty);\n assert_eq(vec.len(), original_len);\n }\n }\n\n mod storage {\n use crate::collections::bounded_vec::BoundedVec;\n\n #[test]\n fn storage_consistency() {\n let mut vec: BoundedVec<u32, 5> = BoundedVec::new();\n\n // test initial storage state\n assert_eq(vec.storage(), [0, 0, 0, 0, 0]);\n\n vec.push(1);\n vec.push(2);\n\n // test storage after modifications\n assert_eq(vec.storage(), [1, 2, 0, 0, 0]);\n\n // storage doesn't change length\n assert_eq(vec.len(), 2);\n assert_eq(vec.max_len(), 5);\n }\n\n #[test]\n fn storage_after_pop() {\n let mut vec: BoundedVec<u32, 3> = BoundedVec::from_array([1, 2, 3]);\n\n let _ = vec.pop();\n // after pop, the last element should be zeroed\n assert_eq(vec.storage(), [1, 2, 0]);\n assert_eq(vec.len(), 2);\n }\n\n #[test]\n fn vector_immutable() {\n let vec: BoundedVec<u32, 3> = BoundedVec::from_array([1, 2, 3]);\n let storage = vec.storage();\n\n assert_eq(storage, [1, 2, 3]);\n\n // Verify that the original vector is unchanged\n assert_eq(vec.len(), 3);\n assert_eq(vec.get(0), 1);\n assert_eq(vec.get(1), 2);\n assert_eq(vec.get(2), 3);\n }\n }\n}\n"
|
|
2912
|
+
"57": {
|
|
2913
|
+
"path": "/home/aztec-dev/aztec-packages/noir-projects/noir-contracts/contracts/protocol/aztec_sublib/src/context/private_context.nr",
|
|
2914
|
+
"source": "use crate::{\n context::{inputs::PrivateContextInputs, NullifierExistenceRequest, ReturnsHash},\n hash::hash_args,\n messaging::process_l1_to_l2_message,\n oracle::{\n call_private_function::call_private_function_internal,\n enqueue_public_function_call::{\n is_side_effect_counter_revertible_oracle_wrapper, notify_enqueued_public_function_call,\n notify_set_min_revertible_side_effect_counter,\n },\n execution_cache,\n logs::notify_created_contract_class_log,\n nullifiers::notify_created_nullifier,\n },\n};\nuse crate::protocol::{\n abis::{\n block_header::BlockHeader,\n call_context::CallContext,\n function_selector::FunctionSelector,\n gas_settings::GasSettings,\n log_hash::LogHash,\n nullifier::Nullifier,\n private_call_request::PrivateCallRequest,\n private_circuit_public_inputs::PrivateCircuitPublicInputs,\n private_log::{PrivateLog, PrivateLogData},\n public_call_request::PublicCallRequest,\n },\n address::{AztecAddress, EthAddress},\n constants::{\n CONTRACT_CLASS_LOG_SIZE_IN_FIELDS, MAX_CONTRACT_CLASS_LOGS_PER_CALL,\n MAX_ENQUEUED_CALLS_PER_CALL, MAX_TX_LIFETIME, MAX_L2_TO_L1_MSGS_PER_CALL,\n MAX_NULLIFIER_READ_REQUESTS_PER_CALL, MAX_NULLIFIERS_PER_CALL,\n MAX_PRIVATE_CALL_STACK_LENGTH_PER_CALL, MAX_PRIVATE_LOGS_PER_CALL,\n NULL_MSG_SENDER_CONTRACT_ADDRESS, PRIVATE_LOG_SIZE_IN_FIELDS,\n },\n hash::poseidon2_hash,\n messaging::l2_to_l1_message::L2ToL1Message,\n side_effect::{Counted, scoped::Scoped},\n traits::Empty,\n utils::arrays::{ClaimedLengthArray, trimmed_array_length_hint},\n};\n\n/// Minimal PrivateContext for protocol contracts going to audit.\n/// Contains only the methods actually used by: fee_juice, auth_registry, contract_class_registry, contract_instance_registry\n#[derive(Eq)]\npub struct PrivateContext {\n pub inputs: PrivateContextInputs,\n pub side_effect_counter: u32,\n\n pub min_revertible_side_effect_counter: u32,\n pub is_fee_payer: bool,\n\n pub args_hash: Field,\n pub return_hash: Field,\n\n pub expiration_timestamp: u64,\n\n pub nullifier_read_requests: BoundedVec<Scoped<Counted<Field>>, MAX_NULLIFIER_READ_REQUESTS_PER_CALL>,\n\n pub nullifiers: BoundedVec<Counted<Nullifier>, MAX_NULLIFIERS_PER_CALL>,\n\n pub private_call_requests: BoundedVec<PrivateCallRequest, MAX_PRIVATE_CALL_STACK_LENGTH_PER_CALL>,\n pub public_call_requests: BoundedVec<Counted<PublicCallRequest>, MAX_ENQUEUED_CALLS_PER_CALL>,\n pub public_teardown_call_request: PublicCallRequest,\n pub l2_to_l1_msgs: BoundedVec<Counted<L2ToL1Message>, MAX_L2_TO_L1_MSGS_PER_CALL>,\n\n // Header of a block whose state is used during private execution (not the block the transaction is included in).\n pub anchor_block_header: BlockHeader,\n\n pub private_logs: BoundedVec<Counted<PrivateLogData>, MAX_PRIVATE_LOGS_PER_CALL>,\n pub contract_class_logs_hashes: BoundedVec<Counted<LogHash>, MAX_CONTRACT_CLASS_LOGS_PER_CALL>,\n\n pub expected_non_revertible_side_effect_counter: u32,\n pub expected_revertible_side_effect_counter: u32,\n}\n\nimpl PrivateContext {\n pub fn new(inputs: PrivateContextInputs, args_hash: Field) -> PrivateContext {\n PrivateContext {\n inputs,\n side_effect_counter: inputs.start_side_effect_counter + 1,\n min_revertible_side_effect_counter: 0,\n is_fee_payer: false,\n args_hash,\n return_hash: 0,\n expiration_timestamp: inputs.anchor_block_header.global_variables.timestamp\n + MAX_TX_LIFETIME,\n nullifier_read_requests: BoundedVec::new(),\n nullifiers: BoundedVec::new(),\n anchor_block_header: inputs.anchor_block_header,\n private_call_requests: BoundedVec::new(),\n public_call_requests: BoundedVec::new(),\n public_teardown_call_request: PublicCallRequest::empty(),\n l2_to_l1_msgs: BoundedVec::new(),\n private_logs: BoundedVec::new(),\n contract_class_logs_hashes: BoundedVec::new(),\n expected_non_revertible_side_effect_counter: 0,\n expected_revertible_side_effect_counter: 0,\n }\n }\n\n /// Returns the contract address that initiated this function call (similar to msg.sender in Solidity).\n pub fn maybe_msg_sender(self) -> Option<AztecAddress> {\n let maybe_msg_sender = self.inputs.call_context.msg_sender;\n if maybe_msg_sender == NULL_MSG_SENDER_CONTRACT_ADDRESS {\n Option::none()\n } else {\n Option::some(maybe_msg_sender)\n }\n }\n\n /// Returns the contract address of the current function being executed.\n pub fn this_address(self) -> AztecAddress {\n self.inputs.call_context.contract_address\n }\n\n /// Returns the chain ID of the current network.\n pub fn chain_id(self) -> Field {\n self.inputs.tx_context.chain_id\n }\n\n /// Returns the protocol version.\n pub fn version(self) -> Field {\n self.inputs.tx_context.version\n }\n\n /// Returns the gas settings for the current transaction.\n pub fn gas_settings(self) -> GasSettings {\n self.inputs.tx_context.gas_settings\n }\n\n /// Returns the function selector of the currently executing function.\n pub fn selector(self) -> FunctionSelector {\n self.inputs.call_context.function_selector\n }\n\n /// Returns the hash of the arguments passed to the current function.\n pub fn get_args_hash(self) -> Field {\n self.args_hash\n }\n\n /// Returns the anchor block header.\n pub fn get_anchor_block_header(self) -> BlockHeader {\n self.anchor_block_header\n }\n\n /// Sets the hash of the return values for this private function.\n pub fn set_return_hash<let N: u32>(&mut self, serialized_return_values: [Field; N]) {\n let return_hash = hash_args(serialized_return_values);\n self.return_hash = return_hash;\n execution_cache::store(serialized_return_values, return_hash);\n }\n\n /// Builds the PrivateCircuitPublicInputs for this private function.\n pub fn finish(self) -> PrivateCircuitPublicInputs {\n PrivateCircuitPublicInputs {\n call_context: self.inputs.call_context,\n args_hash: self.args_hash,\n returns_hash: self.return_hash,\n min_revertible_side_effect_counter: self.min_revertible_side_effect_counter,\n is_fee_payer: self.is_fee_payer,\n expiration_timestamp: self.expiration_timestamp,\n note_hash_read_requests: ClaimedLengthArray::empty(), // Not used by protocol contracts\n nullifier_read_requests: ClaimedLengthArray::from_bounded_vec(\n self.nullifier_read_requests,\n ),\n key_validation_requests_and_separators: ClaimedLengthArray::empty(), // Not used by protocol contracts\n note_hashes: ClaimedLengthArray::empty(), // Not used by protocol contracts\n nullifiers: ClaimedLengthArray::from_bounded_vec(self.nullifiers),\n private_call_requests: ClaimedLengthArray::from_bounded_vec(self.private_call_requests),\n public_call_requests: ClaimedLengthArray::from_bounded_vec(self.public_call_requests),\n public_teardown_call_request: self.public_teardown_call_request,\n l2_to_l1_msgs: ClaimedLengthArray::from_bounded_vec(self.l2_to_l1_msgs),\n start_side_effect_counter: self.inputs.start_side_effect_counter,\n end_side_effect_counter: self.side_effect_counter,\n private_logs: ClaimedLengthArray::from_bounded_vec(self.private_logs),\n contract_class_logs_hashes: ClaimedLengthArray::from_bounded_vec(\n self.contract_class_logs_hashes,\n ),\n anchor_block_header: self.anchor_block_header,\n tx_context: self.inputs.tx_context,\n expected_non_revertible_side_effect_counter: self\n .expected_non_revertible_side_effect_counter,\n expected_revertible_side_effect_counter: self.expected_revertible_side_effect_counter,\n }\n }\n\n /// Declares the end of the \"setup phase\" of this tx. Used by fee_juice.\n pub fn end_setup(&mut self) {\n self.side_effect_counter += 1;\n self.min_revertible_side_effect_counter = self.next_counter();\n notify_set_min_revertible_side_effect_counter(self.min_revertible_side_effect_counter);\n }\n\n pub fn in_revertible_phase(&mut self) -> bool {\n let current_counter = self.side_effect_counter;\n\n // Safety: Kernel will validate that the claim is correct by validating the expected counters.\n let is_revertible =\n unsafe { is_side_effect_counter_revertible_oracle_wrapper(current_counter) };\n\n if is_revertible {\n if (self.expected_revertible_side_effect_counter == 0)\n | (current_counter < self.expected_revertible_side_effect_counter) {\n self.expected_revertible_side_effect_counter = current_counter;\n }\n } else if current_counter > self.expected_non_revertible_side_effect_counter {\n self.expected_non_revertible_side_effect_counter = current_counter;\n }\n\n is_revertible\n }\n\n /// Sets a deadline for when this transaction must be included in a block.\n pub fn set_expiration_timestamp(&mut self, expiration_timestamp: u64) {\n self.expiration_timestamp = std::cmp::min(self.expiration_timestamp, expiration_timestamp);\n }\n\n /// Pushes a new nullifier. Used by class_registry and instance_registry.\n pub fn push_nullifier(&mut self, nullifier: Field) {\n notify_created_nullifier(nullifier);\n self.nullifiers.push(Nullifier { value: nullifier, note_hash: 0 }.count(self.next_counter()));\n }\n\n /// Asserts that a nullifier has been emitted. Used by instance_registry.\n pub fn assert_nullifier_exists(\n &mut self,\n nullifier_existence_request: NullifierExistenceRequest,\n ) {\n let nullifier = nullifier_existence_request.nullifier();\n let contract_address =\n nullifier_existence_request.maybe_contract_address().unwrap_or(AztecAddress::zero());\n\n let request = Scoped::new(\n Counted::new(nullifier, self.next_counter()),\n contract_address,\n );\n\n self.nullifier_read_requests.push(request);\n }\n\n /// Consumes a message sent from Ethereum (L1) to Aztec (L2). Used by fee_juice.\n pub fn consume_l1_to_l2_message(\n &mut self,\n content: Field,\n secret: Field,\n sender: EthAddress,\n leaf_index: Field,\n ) {\n let nullifier = process_l1_to_l2_message(\n self.anchor_block_header.state.l1_to_l2_message_tree.root,\n self.this_address(),\n sender,\n self.chain_id(),\n self.version(),\n content,\n secret,\n leaf_index,\n );\n\n // Push nullifier (and the \"commitment\" corresponding to this can be \"empty\")\n self.push_nullifier(nullifier)\n }\n\n /// Emits a private log. Used by instance_registry.\n pub fn emit_private_log(&mut self, log: [Field; PRIVATE_LOG_SIZE_IN_FIELDS], length: u32) {\n let counter = self.next_counter();\n let private_log = PrivateLogData { log: PrivateLog::new(log, length), note_hash_counter: 0 }\n .count(counter);\n self.private_logs.push(private_log);\n }\n\n /// Emits a contract class log. Used by class_registry.\n pub fn emit_contract_class_log<let N: u32>(&mut self, log: [Field; N]) {\n let contract_address = self.this_address();\n let counter = self.next_counter();\n\n let log_to_emit: [Field; CONTRACT_CLASS_LOG_SIZE_IN_FIELDS] =\n log.concat([0; CONTRACT_CLASS_LOG_SIZE_IN_FIELDS - N]);\n // Safety: The below length is constrained in the base rollup, which will make sure that all the fields beyond\n // length are zero. However, it won't be able to check that we didn't add extra padding (trailing zeroes) or\n // that we cut trailing zeroes from the end.\n let length = unsafe { trimmed_array_length_hint(log_to_emit) };\n // We hash the entire padded log to ensure a user cannot pass a shorter length and so emit incorrect shorter\n // bytecode.\n let log_hash = poseidon2_hash(log_to_emit);\n // Safety: the below only exists to broadcast the raw log, so we can provide it to the base rollup later to be\n // constrained.\n unsafe {\n notify_created_contract_class_log(contract_address, log_to_emit, length, counter);\n }\n\n self.contract_class_logs_hashes.push(LogHash { value: log_hash, length: length }.count(\n counter,\n ));\n }\n\n /// Makes a read-only call to a private function. Used by auth_registry for authwit.\n pub fn static_call_private_function<let ArgsCount: u32>(\n &mut self,\n contract_address: AztecAddress,\n function_selector: FunctionSelector,\n args: [Field; ArgsCount],\n ) -> ReturnsHash {\n let args_hash = hash_args(args);\n execution_cache::store(args, args_hash);\n self.call_private_function_with_args_hash(\n contract_address,\n function_selector,\n args_hash,\n true,\n )\n }\n\n fn call_private_function_with_args_hash(\n &mut self,\n contract_address: AztecAddress,\n function_selector: FunctionSelector,\n args_hash: Field,\n is_static_call: bool,\n ) -> ReturnsHash {\n let mut is_static_call = is_static_call | self.inputs.call_context.is_static_call;\n let start_side_effect_counter = self.side_effect_counter;\n\n // Safety: The oracle simulates the private call and returns the value of the side effects counter after\n // execution of the call.\n let (end_side_effect_counter, returns_hash) = unsafe {\n call_private_function_internal(\n contract_address,\n function_selector,\n args_hash,\n start_side_effect_counter,\n is_static_call,\n )\n };\n\n self.private_call_requests.push(\n PrivateCallRequest {\n call_context: CallContext {\n msg_sender: self.this_address(),\n contract_address,\n function_selector,\n is_static_call,\n },\n args_hash,\n returns_hash,\n start_side_effect_counter,\n end_side_effect_counter,\n },\n );\n\n self.side_effect_counter = end_side_effect_counter + 1;\n ReturnsHash::new(returns_hash)\n }\n\n /// Enqueues a call to a public function with a calldata hash. Used by fee_juice and auth_registry.\n pub fn call_public_function_with_calldata_hash(\n &mut self,\n contract_address: AztecAddress,\n calldata_hash: Field,\n is_static_call: bool,\n hide_msg_sender: bool,\n ) {\n let counter = self.next_counter();\n\n let mut is_static_call = is_static_call | self.inputs.call_context.is_static_call;\n\n notify_enqueued_public_function_call(\n contract_address,\n calldata_hash,\n counter,\n is_static_call,\n );\n\n let msg_sender = if hide_msg_sender {\n NULL_MSG_SENDER_CONTRACT_ADDRESS\n } else {\n self.this_address()\n };\n\n let call_request =\n PublicCallRequest { msg_sender, contract_address, is_static_call, calldata_hash };\n\n self.public_call_requests.push(Counted::new(call_request, counter));\n }\n\n fn next_counter(&mut self) -> u32 {\n let counter = self.side_effect_counter;\n self.side_effect_counter += 1;\n counter\n }\n}\n\nimpl Empty for PrivateContext {\n fn empty() -> Self {\n PrivateContext {\n inputs: PrivateContextInputs::empty(),\n side_effect_counter: 0 as u32,\n min_revertible_side_effect_counter: 0 as u32,\n is_fee_payer: false,\n args_hash: 0,\n return_hash: 0,\n expiration_timestamp: 0,\n nullifier_read_requests: BoundedVec::new(),\n nullifiers: BoundedVec::new(),\n private_call_requests: BoundedVec::new(),\n public_call_requests: BoundedVec::new(),\n public_teardown_call_request: PublicCallRequest::empty(),\n l2_to_l1_msgs: BoundedVec::new(),\n anchor_block_header: BlockHeader::empty(),\n private_logs: BoundedVec::new(),\n contract_class_logs_hashes: BoundedVec::new(),\n expected_non_revertible_side_effect_counter: 0,\n expected_revertible_side_effect_counter: 0,\n }\n }\n}\n"
|
|
3622
2915
|
},
|
|
3623
|
-
"
|
|
3624
|
-
"path": "/home/aztec-dev/aztec-packages/noir-projects/
|
|
3625
|
-
"source": "use crate::oracle::capsules;\nuse crate::protocol::{address::AztecAddress, traits::{Deserialize, Serialize}};\n\n/// A dynamically sized array backed by PXE's non-volatile database (called capsules). Values are persisted until\n/// deleted, so they can be e.g. stored during simulation of a transaction and later retrieved during witness\n/// generation. All values are scoped per contract address, so external contracts cannot access them.\npub struct CapsuleArray<T> {\n contract_address: AztecAddress,\n /// The base slot is where the array length is stored in capsules. Array elements are stored in consecutive slots\n /// after the base slot. For example, with base slot 5: the length is at slot 5, the first element (index 0) is at\n /// slot 6, the second element (index 1) is at slot 7, and so on.\n base_slot: Field,\n}\n\nimpl<T> CapsuleArray<T> {\n /// Returns a CapsuleArray connected to a contract's capsules at a base slot. Array elements are stored in\n /// contiguous slots following the base slot, so there should be sufficient space between array base slots to\n /// accommodate elements. A reasonable strategy is to make the base slot a hash of a unique value.\n pub unconstrained fn at(contract_address: AztecAddress, base_slot: Field) -> Self {\n Self { contract_address, base_slot }\n }\n\n /// Returns the number of elements stored in the array.\n pub unconstrained fn len(self) -> u32 {\n // An uninitialized array defaults to a length of 0.\n capsules::load(self.contract_address, self.base_slot).unwrap_or(0) as u32\n }\n\n /// Stores a value at the end of the array.\n pub unconstrained fn push(self, value: T)\n where\n T: Serialize,\n {\n let current_length = self.len();\n\n // The slot corresponding to the index `current_length` is the first slot immediately after the end of the\n // array, which is where we want to place the new value.\n capsules::store(self.contract_address, self.slot_at(current_length), value);\n\n // Then we simply update the length.\n let new_length = current_length + 1;\n capsules::store(self.contract_address, self.base_slot, new_length);\n }\n\n /// Retrieves the value stored in the array at `index`. Throws if the index is out of bounds.\n pub unconstrained fn get(self, index: u32) -> T\n where\n T: Deserialize,\n {\n assert(index < self.len(), \"Attempted to read past the length of a CapsuleArray\");\n\n capsules::load(self.contract_address, self.slot_at(index)).unwrap()\n }\n\n /// Deletes the value stored in the array at `index`. Throws if the index is out of bounds.\n pub unconstrained fn remove(self, index: u32) {\n let current_length = self.len();\n assert(index < current_length, \"Attempted to delete past the length of a CapsuleArray\");\n\n // In order to be able to remove elements at arbitrary indices, we need to shift the entire contents of the\n // array past the removed element one slot backward so that we don't end up with a gap and preserve the\n // contiguous slots. We can skip this when deleting the last element however.\n if index != current_length - 1 {\n // The source and destination regions overlap, but `copy` supports this.\n capsules::copy(\n self.contract_address,\n self.slot_at(index + 1),\n self.slot_at(index),\n current_length - index - 1,\n );\n }\n\n // We can now delete the last element (which has either been copied to the slot immediately before it, or was\n // the element we meant to delete in the first place) and update the length.\n capsules::delete(self.contract_address, self.slot_at(current_length - 1));\n capsules::store(self.contract_address, self.base_slot, current_length - 1);\n }\n\n /// Iterates over the entire array, calling the callback with all values and their array index. The order in which\n /// values are processed is arbitrary.\n ///\n /// It is safe to delete the current element (and only the current element) from inside the callback via `remove`:\n /// ```noir\n /// array.for_each(|index, value| {\n /// if some_condition(value) {\n /// array.remove(index); // safe only for this index\n /// }\n /// }\n /// ```\n ///\n /// If all elements in the array need to iterated over and then removed, then using `for_each` results in optimal\n /// efficiency.\n ///\n /// It is **not** safe to push new elements into the array from inside the callback.\n pub unconstrained fn for_each<Env>(self, f: unconstrained fn[Env](u32, T) -> ())\n where\n T: Deserialize,\n {\n // Iterating over all elements is simple, but we want to do it in such a way that a) deleting the current\n // element is safe to do, and b) deleting *all* elements is optimally efficient. This is because CapsuleArrays\n // are typically used to hold pending tasks, so iterating them while clearing completed tasks (sometimes\n // unconditionally, resulting in a full clear) is a very common access pattern.\n //\n // The way we achieve this is by iterating backwards: each element can always be deleted since it won't change\n // any preceding (lower) indices, and if every element is deleted then every element will (in turn) be the last\n // element. This results in an optimal full clear since `remove` will be able to skip the `capsules::copy` call\n // to shift any elements past the deleted one (because there will be none).\n let mut i = self.len();\n while i > 0 {\n i -= 1;\n f(i, self.get(i));\n }\n }\n\n unconstrained fn slot_at(self, index: u32) -> Field {\n // Elements are stored immediately after the base slot, so we add 1 to it to compute the slot for the first\n // element.\n self.base_slot + 1 + index as Field\n }\n}\n\nmod test {\n use crate::test::helpers::test_environment::TestEnvironment;\n use super::CapsuleArray;\n\n global SLOT: Field = 1230;\n\n #[test]\n unconstrained fn empty_array() {\n let env = TestEnvironment::new();\n env.private_context(|context| {\n let contract_address = context.this_address();\n\n let array: CapsuleArray<Field> = CapsuleArray::at(contract_address, SLOT);\n assert_eq(array.len(), 0);\n });\n }\n\n #[test(should_fail_with = \"Attempted to read past the length of a CapsuleArray\")]\n unconstrained fn empty_array_read() {\n let env = TestEnvironment::new();\n env.private_context(|context| {\n let contract_address = context.this_address();\n\n let array = CapsuleArray::at(contract_address, SLOT);\n let _: Field = array.get(0);\n });\n }\n\n #[test]\n unconstrained fn array_push() {\n let env = TestEnvironment::new();\n env.private_context(|context| {\n let contract_address = context.this_address();\n\n let array = CapsuleArray::at(contract_address, SLOT);\n array.push(5);\n\n assert_eq(array.len(), 1);\n assert_eq(array.get(0), 5);\n });\n }\n\n #[test(should_fail_with = \"Attempted to read past the length of a CapsuleArray\")]\n unconstrained fn read_past_len() {\n let env = TestEnvironment::new();\n env.private_context(|context| {\n let contract_address = context.this_address();\n\n let array = CapsuleArray::at(contract_address, SLOT);\n array.push(5);\n\n let _ = array.get(1);\n });\n }\n\n #[test]\n unconstrained fn array_remove_last() {\n let env = TestEnvironment::new();\n env.private_context(|context| {\n let contract_address = context.this_address();\n\n let array = CapsuleArray::at(contract_address, SLOT);\n\n array.push(5);\n array.remove(0);\n\n assert_eq(array.len(), 0);\n });\n }\n\n #[test]\n unconstrained fn array_remove_some() {\n let env = TestEnvironment::new();\n env.private_context(|context| {\n let contract_address = context.this_address();\n\n let array = CapsuleArray::at(contract_address, SLOT);\n\n array.push(7);\n array.push(8);\n array.push(9);\n\n assert_eq(array.len(), 3);\n assert_eq(array.get(0), 7);\n assert_eq(array.get(1), 8);\n assert_eq(array.get(2), 9);\n\n array.remove(1);\n\n assert_eq(array.len(), 2);\n assert_eq(array.get(0), 7);\n assert_eq(array.get(1), 9);\n });\n }\n\n #[test]\n unconstrained fn array_remove_all() {\n let env = TestEnvironment::new();\n env.private_context(|context| {\n let contract_address = context.this_address();\n\n let array = CapsuleArray::at(contract_address, SLOT);\n\n array.push(7);\n array.push(8);\n array.push(9);\n\n array.remove(1);\n array.remove(1);\n array.remove(0);\n\n assert_eq(array.len(), 0);\n });\n }\n\n #[test]\n unconstrained fn for_each_called_with_all_elements() {\n let env = TestEnvironment::new();\n env.private_context(|context| {\n let contract_address = context.this_address();\n let array = CapsuleArray::at(contract_address, SLOT);\n\n array.push(4);\n array.push(5);\n array.push(6);\n\n // We store all values that we were called with and check that all (value, index) tuples are present. Note\n // that we do not care about the order in which each tuple was passed to the closure.\n let called_with = &mut BoundedVec::<(u32, Field), 3>::new();\n array.for_each(|index, value| { called_with.push((index, value)); });\n\n assert_eq(called_with.len(), 3);\n assert(called_with.any(|(index, value)| (index == 0) & (value == 4)));\n assert(called_with.any(|(index, value)| (index == 1) & (value == 5)));\n assert(called_with.any(|(index, value)| (index == 2) & (value == 6)));\n });\n }\n\n #[test]\n unconstrained fn for_each_remove_some() {\n let env = TestEnvironment::new();\n env.private_context(|context| {\n let contract_address = context.this_address();\n let array = CapsuleArray::at(contract_address, SLOT);\n\n array.push(4);\n array.push(5);\n array.push(6);\n\n array.for_each(|index, _| {\n if index == 1 {\n array.remove(index);\n }\n });\n\n assert_eq(array.len(), 2);\n assert_eq(array.get(0), 4);\n assert_eq(array.get(1), 6);\n });\n }\n\n #[test]\n unconstrained fn for_each_remove_all() {\n let env = TestEnvironment::new();\n env.private_context(|context| {\n let contract_address = context.this_address();\n let array = CapsuleArray::at(contract_address, SLOT);\n\n array.push(4);\n array.push(5);\n array.push(6);\n\n array.for_each(|index, _| { array.remove(index); });\n\n assert_eq(array.len(), 0);\n });\n }\n\n #[test]\n unconstrained fn for_each_remove_all_no_copy() {\n let env = TestEnvironment::new();\n env.private_context(|context| {\n let contract_address = context.this_address();\n let array = CapsuleArray::at(contract_address, SLOT);\n\n array.push(4);\n array.push(5);\n array.push(6);\n\n // We test that the utilityCopyCapsule was never called, which is the expensive operation we want to avoid.\n let mock = std::test::OracleMock::mock(\"utilityCopyCapsule\");\n\n array.for_each(|index, _| { array.remove(index); });\n\n assert_eq(mock.times_called(), 0);\n });\n }\n}\n"
|
|
2916
|
+
"58": {
|
|
2917
|
+
"path": "/home/aztec-dev/aztec-packages/noir-projects/noir-contracts/contracts/protocol/aztec_sublib/src/context/public_context.nr",
|
|
2918
|
+
"source": "use crate::{\n context::gas::GasOpts,\n hash::{\n compute_l1_to_l2_message_hash, compute_l1_to_l2_message_nullifier, compute_secret_hash,\n compute_siloed_nullifier,\n },\n oracle::avm,\n};\nuse crate::protocol::{\n abis::function_selector::FunctionSelector,\n address::{AztecAddress, EthAddress},\n constants::{MAX_U32_VALUE, NULL_MSG_SENDER_CONTRACT_ADDRESS},\n traits::{Empty, FromField, Packable, Serialize, ToField},\n};\n\n/// Minimal PublicContext for protocol contracts going to audit.\npub struct PublicContext {\n pub args_hash: Option<Field>,\n pub compute_args_hash: fn() -> Field,\n}\n\nimpl Eq for PublicContext {\n fn eq(self, other: Self) -> bool {\n (self.args_hash == other.args_hash)\n // Can't compare the function compute_args_hash\n }\n}\n\nimpl PublicContext {\n pub fn new(compute_args_hash: fn() -> Field) -> Self {\n PublicContext { args_hash: Option::none(), compute_args_hash }\n }\n\n /// Emits a _public_ log that will be visible onchain to everyone.\n pub fn emit_public_log<T>(_self: Self, log: T)\n where\n T: Serialize,\n {\n // Safety: AVM opcodes are constrained by the AVM itself\n unsafe { avm::emit_public_log(Serialize::serialize(log).as_vector()) };\n }\n\n /// Checks if a given note hash exists in the note hash tree at a particular leaf_index.\n pub fn note_hash_exists(_self: Self, note_hash: Field, leaf_index: u64) -> bool {\n // Safety: AVM opcodes are constrained by the AVM itself\n unsafe { avm::note_hash_exists(note_hash, leaf_index) } == 1\n }\n\n /// Checks if a specific L1-to-L2 message exists in the L1-to-L2 message tree at a particular leaf index.\n pub fn l1_to_l2_msg_exists(_self: Self, msg_hash: Field, msg_leaf_index: Field) -> bool {\n // Safety: AVM opcodes are constrained by the AVM itself TODO(alvaro): Make l1l2msg leaf index a u64 upstream\n unsafe { avm::l1_to_l2_msg_exists(msg_hash, msg_leaf_index as u64) } == 1\n }\n\n /// Returns `true` if an `unsiloed_nullifier` has been emitted by `contract_address`.\n pub fn nullifier_exists_unsafe(\n _self: Self,\n unsiloed_nullifier: Field,\n contract_address: AztecAddress,\n ) -> bool {\n let siloed_nullifier = compute_siloed_nullifier(contract_address, unsiloed_nullifier);\n // Safety: AVM opcodes are constrained by the AVM itself\n unsafe { avm::nullifier_exists(siloed_nullifier) } == 1\n }\n\n /// Consumes a message sent from Ethereum (L1) to Aztec (L2).\n pub fn consume_l1_to_l2_message(\n self: Self,\n content: Field,\n secret: Field,\n sender: EthAddress,\n leaf_index: Field,\n ) {\n let secret_hash = compute_secret_hash(secret);\n let message_hash = compute_l1_to_l2_message_hash(\n sender,\n self.chain_id(),\n /*recipient=*/\n self.this_address(),\n self.version(),\n content,\n secret_hash,\n leaf_index,\n );\n let nullifier = compute_l1_to_l2_message_nullifier(message_hash, secret);\n\n assert(\n !self.nullifier_exists_unsafe(nullifier, self.this_address()),\n \"L1-to-L2 message is already nullified\",\n );\n assert(\n self.l1_to_l2_msg_exists(message_hash, leaf_index),\n \"Tried to consume nonexistent L1-to-L2 message\",\n );\n\n self.push_nullifier(nullifier);\n }\n\n /// Sends an \"L2 -> L1 message\".\n pub fn message_portal(_self: Self, recipient: EthAddress, content: Field) {\n // Safety: AVM opcodes are constrained by the AVM itself\n unsafe { avm::send_l2_to_l1_msg(recipient, content) };\n }\n\n /// Calls a public function on another contract.\n pub unconstrained fn call_public_function<let N: u32>(\n _self: Self,\n contract_address: AztecAddress,\n function_selector: FunctionSelector,\n args: [Field; N],\n gas_opts: GasOpts,\n ) -> [Field] {\n let calldata = [function_selector.to_field()].concat(args);\n\n avm::call(\n gas_opts.l2_gas.unwrap_or(MAX_U32_VALUE),\n gas_opts.da_gas.unwrap_or(MAX_U32_VALUE),\n contract_address,\n calldata,\n );\n // Use success_copy to determine whether the call succeeded\n let success = avm::success_copy();\n\n let result_data = avm::returndata_copy(0, avm::returndata_size());\n if !success {\n // Rethrow the revert data.\n avm::revert(result_data);\n }\n result_data\n }\n\n /// Makes a read-only call to a public function on another contract.\n pub unconstrained fn static_call_public_function<let N: u32>(\n _self: Self,\n contract_address: AztecAddress,\n function_selector: FunctionSelector,\n args: [Field; N],\n gas_opts: GasOpts,\n ) -> [Field] {\n let calldata = [function_selector.to_field()].concat(args);\n\n avm::call_static(\n gas_opts.l2_gas.unwrap_or(MAX_U32_VALUE),\n gas_opts.da_gas.unwrap_or(MAX_U32_VALUE),\n contract_address,\n calldata,\n );\n // Use success_copy to determine whether the call succeeded\n let success = avm::success_copy();\n\n let result_data = avm::returndata_copy(0, avm::returndata_size());\n if !success {\n // Rethrow the revert data.\n avm::revert(result_data);\n }\n result_data\n }\n\n /// Adds a new note hash to the Note Hash Tree.\n pub fn push_note_hash(_self: Self, note_hash: Field) {\n // Safety: AVM opcodes are constrained by the AVM itself\n unsafe { avm::emit_note_hash(note_hash) };\n }\n\n /// Adds a new nullifier to the Nullifier Tree.\n pub fn push_nullifier(_self: Self, nullifier: Field) {\n // Safety: AVM opcodes are constrained by the AVM itself\n unsafe { avm::emit_nullifier(nullifier) };\n }\n\n /// Returns the address of the current contract being executed.\n pub fn this_address(_self: Self) -> AztecAddress {\n // Safety: AVM opcodes are constrained by the AVM itself\n unsafe {\n avm::address()\n }\n }\n\n /// Returns the contract address that initiated this function call.\n pub fn maybe_msg_sender(_self: Self) -> Option<AztecAddress> {\n // Safety: AVM opcodes are constrained by the AVM itself\n let maybe_msg_sender = unsafe { avm::sender() };\n if maybe_msg_sender == NULL_MSG_SENDER_CONTRACT_ADDRESS {\n Option::none()\n } else {\n Option::some(maybe_msg_sender)\n }\n }\n\n /// Returns the function selector of the currently-executing function.\n pub fn selector(_self: Self) -> FunctionSelector {\n // The selector is the first element of the calldata when calling a public function through dispatch.\n // Safety: AVM opcodes are constrained by the AVM itself.\n let raw_selector: [Field; 1] = unsafe { avm::calldata_copy(0, 1) };\n FunctionSelector::from_field(raw_selector[0])\n }\n\n /// Returns the hash of the arguments passed to the current function.\n pub fn get_args_hash(mut self) -> Field {\n if !self.args_hash.is_some() {\n self.args_hash = Option::some((self.compute_args_hash)());\n }\n\n self.args_hash.unwrap_unchecked()\n }\n\n /// Returns the \"transaction fee\" for the current transaction.\n pub fn transaction_fee(_self: Self) -> Field {\n // Safety: AVM opcodes are constrained by the AVM itself\n unsafe {\n avm::transaction_fee()\n }\n }\n\n /// Returns the chain ID of the current network.\n pub fn chain_id(_self: Self) -> Field {\n // Safety: AVM opcodes are constrained by the AVM itself\n unsafe {\n avm::chain_id()\n }\n }\n\n /// Returns the protocol version.\n pub fn version(_self: Self) -> Field {\n // Safety: AVM opcodes are constrained by the AVM itself\n unsafe {\n avm::version()\n }\n }\n\n /// Returns the current block number.\n pub fn block_number(_self: Self) -> u32 {\n // Safety: AVM opcodes are constrained by the AVM itself\n unsafe {\n avm::block_number()\n }\n }\n\n /// Returns the timestamp of the current block.\n pub fn timestamp(_self: Self) -> u64 {\n // Safety: AVM opcodes are constrained by the AVM itself\n unsafe {\n avm::timestamp()\n }\n }\n\n /// Returns the fee per unit of L2 gas.\n pub fn min_fee_per_l2_gas(_self: Self) -> u128 {\n // Safety: AVM opcodes are constrained by the AVM itself\n unsafe {\n avm::min_fee_per_l2_gas()\n }\n }\n\n /// Returns the fee per unit of DA gas.\n pub fn min_fee_per_da_gas(_self: Self) -> u128 {\n // Safety: AVM opcodes are constrained by the AVM itself\n unsafe {\n avm::min_fee_per_da_gas()\n }\n }\n\n /// Returns the remaining L2 gas available.\n pub fn l2_gas_left(_self: Self) -> u32 {\n // Safety: AVM opcodes are constrained by the AVM itself\n unsafe {\n avm::l2_gas_left()\n }\n }\n\n /// Returns the remaining DA gas available.\n pub fn da_gas_left(_self: Self) -> u32 {\n // Safety: AVM opcodes are constrained by the AVM itself\n unsafe {\n avm::da_gas_left()\n }\n }\n\n /// Checks if the current execution is within a staticcall context.\n pub fn is_static_call(_self: Self) -> bool {\n // Safety: AVM opcodes are constrained by the AVM itself\n unsafe { avm::is_static_call() } == 1\n }\n\n /// Reads raw field values from public storage.\n pub fn raw_storage_read<let N: u32>(self: Self, storage_slot: Field) -> [Field; N] {\n let mut out = [0; N];\n for i in 0..N {\n // Safety: AVM opcodes are constrained by the AVM itself\n out[i] = unsafe {\n avm::storage_read(storage_slot + i as Field, self.this_address().to_field())\n };\n }\n out\n }\n\n /// Reads a typed value from public storage.\n pub fn storage_read<T>(self, storage_slot: Field) -> T\n where\n T: Packable,\n {\n T::unpack(self.raw_storage_read(storage_slot))\n }\n\n /// Writes raw field values to public storage.\n pub fn raw_storage_write<let N: u32>(_self: Self, storage_slot: Field, values: [Field; N]) {\n for i in 0..N {\n // Safety: AVM opcodes are constrained by the AVM itself\n unsafe { avm::storage_write(storage_slot + i as Field, values[i]) };\n }\n }\n\n /// Writes a typed value to public storage.\n pub fn storage_write<T>(self, storage_slot: Field, value: T)\n where\n T: Packable,\n {\n self.raw_storage_write(storage_slot, value.pack());\n }\n}\n\nimpl Empty for PublicContext {\n fn empty() -> Self {\n PublicContext::new(|| 0)\n }\n}\n"
|
|
2919
|
+
},
|
|
2920
|
+
"61": {
|
|
2921
|
+
"path": "/home/aztec-dev/aztec-packages/noir-projects/noir-contracts/contracts/protocol/aztec_sublib/src/hash.nr",
|
|
2922
|
+
"source": "//! Aztec hash functions.\n\nuse crate::protocol::{\n address::{AztecAddress, EthAddress},\n constants::{\n DOM_SEP__FUNCTION_ARGS, DOM_SEP__MESSAGE_NULLIFIER, DOM_SEP__PUBLIC_BYTECODE,\n DOM_SEP__PUBLIC_CALLDATA, DOM_SEP__SECRET_HASH, MAX_PACKED_PUBLIC_BYTECODE_SIZE_IN_FIELDS,\n },\n hash::{poseidon2_hash_subarray, poseidon2_hash_with_separator, sha256_to_field},\n traits::ToField,\n};\n\npub use crate::protocol::hash::compute_siloed_nullifier;\n\npub fn compute_secret_hash(secret: Field) -> Field {\n poseidon2_hash_with_separator([secret], DOM_SEP__SECRET_HASH)\n}\n\npub fn compute_l1_to_l2_message_hash(\n sender: EthAddress,\n chain_id: Field,\n recipient: AztecAddress,\n version: Field,\n content: Field,\n secret_hash: Field,\n leaf_index: Field,\n) -> Field {\n let mut hash_bytes = [0 as u8; 224];\n let sender_bytes: [u8; 32] = sender.to_field().to_be_bytes();\n let chain_id_bytes: [u8; 32] = chain_id.to_be_bytes();\n let recipient_bytes: [u8; 32] = recipient.to_field().to_be_bytes();\n let version_bytes: [u8; 32] = version.to_be_bytes();\n let content_bytes: [u8; 32] = content.to_be_bytes();\n let secret_hash_bytes: [u8; 32] = secret_hash.to_be_bytes();\n let leaf_index_bytes: [u8; 32] = leaf_index.to_be_bytes();\n\n for i in 0..32 {\n hash_bytes[i] = sender_bytes[i];\n hash_bytes[i + 32] = chain_id_bytes[i];\n hash_bytes[i + 64] = recipient_bytes[i];\n hash_bytes[i + 96] = version_bytes[i];\n hash_bytes[i + 128] = content_bytes[i];\n hash_bytes[i + 160] = secret_hash_bytes[i];\n hash_bytes[i + 192] = leaf_index_bytes[i];\n }\n\n sha256_to_field(hash_bytes)\n}\n\n// The nullifier of a l1 to l2 message is the hash of the message salted with the secret\npub fn compute_l1_to_l2_message_nullifier(message_hash: Field, secret: Field) -> Field {\n poseidon2_hash_with_separator([message_hash, secret], DOM_SEP__MESSAGE_NULLIFIER)\n}\n\n// Computes the hash of input arguments or return values for private functions, or for authwit creation.\npub fn hash_args<let N: u32>(args: [Field; N]) -> Field {\n if args.len() == 0 {\n 0\n } else {\n poseidon2_hash_with_separator(args, DOM_SEP__FUNCTION_ARGS)\n }\n}\n\n// Computes the hash of calldata for public functions.\npub fn hash_calldata_array<let N: u32>(calldata: [Field; N]) -> Field {\n poseidon2_hash_with_separator(calldata, DOM_SEP__PUBLIC_CALLDATA)\n}\n\n/// Computes the public bytecode commitment for a contract class. The commitment is `hash([(length | separator),\n/// ...bytecode])`.\n///\n/// @param packed_bytecode - The packed bytecode of the contract class. 0th word is the length in bytes.\n/// packed_bytecode is mutable so that we can avoid copying the array to construct one starting with first_field\n/// instead of length. @returns The public bytecode commitment.\npub fn compute_public_bytecode_commitment(\n mut packed_public_bytecode: [Field; MAX_PACKED_PUBLIC_BYTECODE_SIZE_IN_FIELDS],\n) -> Field {\n // First field element contains the length of the bytecode\n let bytecode_length_in_bytes: u32 = packed_public_bytecode[0] as u32;\n let bytecode_length_in_fields: u32 = (bytecode_length_in_bytes / 31) + (bytecode_length_in_bytes % 31 != 0) as u32;\n // Don't allow empty public bytecode. AVM doesn't handle execution of contracts that exist with empty bytecode.\n assert(bytecode_length_in_fields != 0);\n assert(bytecode_length_in_fields < MAX_PACKED_PUBLIC_BYTECODE_SIZE_IN_FIELDS);\n\n // Packed_bytecode's 0th entry is the length. Append it to the separator before hashing.\n let first_field = DOM_SEP__PUBLIC_BYTECODE.to_field() + (packed_public_bytecode[0] as u64 << 32) as Field;\n packed_public_bytecode[0] = first_field;\n\n // `fields_to_hash` is the number of fields from the start of `packed_public_bytecode` that should be included in\n // the hash. Fields after this length are ignored. +1 to account for the separator.\n let num_fields_to_hash = bytecode_length_in_fields + 1;\n\n poseidon2_hash_subarray(packed_public_bytecode, num_fields_to_hash)\n}\n"
|
|
3626
2923
|
},
|
|
3627
2924
|
"70": {
|
|
3628
|
-
"path": "/home/aztec-dev/aztec-packages/noir-projects/
|
|
3629
|
-
"source": "use crate::{\n context::{inputs::PrivateContextInputs, NoteExistenceRequest, NullifierExistenceRequest, ReturnsHash},\n hash::{hash_args, hash_calldata_array},\n keys::constants::{NULLIFIER_INDEX, NUM_KEY_TYPES, OUTGOING_INDEX, sk_generators},\n messaging::process_l1_to_l2_message,\n oracle::{\n block_header::get_block_header_at,\n call_private_function::call_private_function_internal,\n enqueue_public_function_call::{\n is_side_effect_counter_revertible_oracle_wrapper, notify_enqueued_public_function_call,\n notify_set_min_revertible_side_effect_counter, notify_set_public_teardown_function_call,\n },\n execution_cache,\n key_validation_request::get_key_validation_request,\n logs::notify_created_contract_class_log,\n notes::notify_nullified_note,\n nullifiers::notify_created_nullifier,\n },\n};\nuse crate::protocol::{\n abis::{\n block_header::BlockHeader,\n call_context::CallContext,\n function_selector::FunctionSelector,\n gas_settings::GasSettings,\n log_hash::LogHash,\n note_hash::NoteHash,\n nullifier::Nullifier,\n private_call_request::PrivateCallRequest,\n private_circuit_public_inputs::PrivateCircuitPublicInputs,\n private_log::{PrivateLog, PrivateLogData},\n public_call_request::PublicCallRequest,\n validation_requests::{KeyValidationRequest, KeyValidationRequestAndGenerator},\n },\n address::{AztecAddress, EthAddress},\n constants::{\n CONTRACT_CLASS_LOG_SIZE_IN_FIELDS, MAX_CONTRACT_CLASS_LOGS_PER_CALL, MAX_ENQUEUED_CALLS_PER_CALL,\n MAX_INCLUDE_BY_TIMESTAMP_DURATION, MAX_KEY_VALIDATION_REQUESTS_PER_CALL, MAX_L2_TO_L1_MSGS_PER_CALL,\n MAX_NOTE_HASH_READ_REQUESTS_PER_CALL, MAX_NOTE_HASHES_PER_CALL, MAX_NULLIFIER_READ_REQUESTS_PER_CALL,\n MAX_NULLIFIERS_PER_CALL, MAX_PRIVATE_CALL_STACK_LENGTH_PER_CALL, MAX_PRIVATE_LOGS_PER_CALL,\n NULL_MSG_SENDER_CONTRACT_ADDRESS, PRIVATE_LOG_SIZE_IN_FIELDS,\n },\n hash::poseidon2_hash,\n messaging::l2_to_l1_message::L2ToL1Message,\n side_effect::{Counted, scoped::Scoped},\n traits::{Empty, Hash, ToField},\n utils::arrays::{ClaimedLengthArray, trimmed_array_length_hint},\n};\n\n/// # PrivateContext\n///\n/// The **main interface** between an #[external(\"private\")] function and the Aztec blockchain.\n///\n/// An instance of the PrivateContext is initialized automatically at the outset of every private function, within the\n/// #[external(\"private\")] macro, so you'll never need to consciously instantiate this yourself.\n///\n/// The instance is always named `context`, and it is always be available within the body of every\n/// #[external(\"private\")] function in your smart contract.\n///\n/// > For those used to \"vanilla\" Noir, it might be jarring to have access to > `context` without seeing a declaration\n/// `let context = PrivateContext::new(...)` > within the body of your function. This is just a consequence of using >\n/// macros to tidy-up verbose boilerplate. You can use `nargo expand` to > expand all macros, if you dare.\n///\n/// Typical usage for a smart contract developer will be to call getter methods of the PrivateContext.\n///\n/// _Pushing_ data and requests to the context is mostly handled within aztec-nr's own functions, so typically a smart\n/// contract developer won't need to call any setter methods directly.\n///\n/// > Advanced users might occasionally wish to push data to the context > directly for lower-level control. If you\n/// find yourself doing this, please > open an issue on GitHub to describe your use case: it might be that > new\n/// functionality should be added to aztec-nr.\n///\n/// ## Responsibilities\n/// - Exposes contextual data to a private function:\n/// - Data relating to how this private function was called.\n/// - msg_sender\n/// - this_address - (the contract address of the private function being executed)\n/// - See `CallContext` for more data.\n/// - Data relating to the transaction in which this private function is being executed.\n/// - chain_id\n/// - version\n/// - gas_settings\n/// - Provides state access:\n/// - Access to the \"Anchor block\" header. Recall, a private function cannot read from the \"current\" block header, but\n/// must read from some historical block header, because as soon as private function execution begins (asynchronously,\n/// on a user's device), the public state of the chain (the \"current state\") will have progressed forward. We call this\n/// reference the \"Anchor block\". See `BlockHeader`.\n/// - Enables consumption of L1->L2 messages.\n/// - Enables calls to functions of other smart contracts:\n/// - Private function calls\n/// - Enqueueing of public function call requests (Since public functions are executed at a later time, by a block\n/// proposer, we say they are \"enqueued\").\n/// - Writes data to the blockchain:\n/// - New notes\n/// - New nullifiers\n/// - Private logs (for sending encrypted note contents or encrypted events)\n/// - New L2->L1 messages.\n/// - Provides args to the private function (handled by the #[external(\"private\")] macro).\n/// - Returns the return values of this private function (handled by the\n/// #[external(\"private\")] macro).\n/// - Makes Key Validation Requests.\n/// - Private functions are not allowed to see master secret keys, because we do not trust them. They are instead given\n/// \"app-siloed\" secret keys with a claim that they relate to a master public key. They can then request validation of\n/// this claim, by making a \"key validation request\" to the protocol's kernel circuits (which _are_ allowed to see\n/// certain master secret keys).\n///\n/// ## Advanced Responsibilities\n///\n/// - Ultimately, the PrivateContext is responsible for constructing the PrivateCircuitPublicInputs of the private\n/// function being executed. All private functions on Aztec must have public inputs which adhere to the rigid layout of\n/// the PrivateCircuitPublicInputs, in order to be compatible with the protocol's kernel circuits. A well-known\n/// misnomer:\n/// - \"public inputs\" contain both inputs and outputs of this function.\n/// - By \"outputs\" we mean a lot more side-effects than just the \"return values\" of the function.\n/// - Most of the so-called \"public inputs\" are kept _private_, and never leak to the outside world, because they are\n/// 'swallowed' by the protocol's kernel circuits before the tx is sent to the network. Only the following are exposed\n/// to the outside world:\n/// - New note_hashes\n/// - New nullifiers\n/// - New private logs\n/// - New L2->L1 messages\n/// - New enqueued public function call requests All the above-listed arrays of side-effects can be padded by the\n/// user's wallet (through instructions to the kernel circuits, via the PXE) to obscure their true lengths.\n///\n/// ## Syntax Justification\n///\n/// Both user-defined functions _and_ most functions in aztec-nr need access to the PrivateContext instance to\n/// read/write data. This is why you'll see the arguably-ugly pervasiveness of the \"context\" throughout your smart\n/// contract and the aztec-nr library. For example, `&mut context` is prevalent. In some languages, you can access and\n/// mutate a global variable (such as a PrivateContext instance) from a function without polluting the function's\n/// parameters. With Noir, a function must explicitly pass control of a mutable variable to another function, by\n/// reference. Since many functions in aztec-nr need to be able to push new data to the PrivateContext, they need to be\n/// handed a mutable reference _to_ the context as a parameter. For example, `Context` is prevalent as a generic\n/// parameter, to give better type safety at compile time. Many `aztec-nr` functions don't make sense if they're called\n/// in a particular runtime (private, public or utility), and so are intentionally only implemented over certain\n/// [Private|Public|Utility]Context structs. This gives smart contract developers a much faster feedback loop if\n/// they're making a mistake, as an error will be thrown by the LSP or when they compile their contract.\n///\n#[derive(Eq)]\npub struct PrivateContext {\n // docs:start:private-context\n pub inputs: PrivateContextInputs,\n pub side_effect_counter: u32,\n\n pub min_revertible_side_effect_counter: u32,\n pub is_fee_payer: bool,\n\n pub args_hash: Field,\n pub return_hash: Field,\n\n pub include_by_timestamp: u64,\n\n pub(crate) note_hash_read_requests: BoundedVec<Scoped<Counted<Field>>, MAX_NOTE_HASH_READ_REQUESTS_PER_CALL>,\n pub(crate) nullifier_read_requests: BoundedVec<Scoped<Counted<Field>>, MAX_NULLIFIER_READ_REQUESTS_PER_CALL>,\n key_validation_requests_and_generators: BoundedVec<KeyValidationRequestAndGenerator, MAX_KEY_VALIDATION_REQUESTS_PER_CALL>,\n\n pub note_hashes: BoundedVec<Counted<NoteHash>, MAX_NOTE_HASHES_PER_CALL>,\n pub nullifiers: BoundedVec<Counted<Nullifier>, MAX_NULLIFIERS_PER_CALL>,\n\n pub private_call_requests: BoundedVec<PrivateCallRequest, MAX_PRIVATE_CALL_STACK_LENGTH_PER_CALL>,\n pub public_call_requests: BoundedVec<Counted<PublicCallRequest>, MAX_ENQUEUED_CALLS_PER_CALL>,\n pub public_teardown_call_request: PublicCallRequest,\n pub l2_to_l1_msgs: BoundedVec<Counted<L2ToL1Message>, MAX_L2_TO_L1_MSGS_PER_CALL>,\n // docs:end:private-context\n\n // Header of a block whose state is used during private execution (not the block the transaction is included in).\n pub anchor_block_header: BlockHeader,\n\n pub private_logs: BoundedVec<Counted<PrivateLogData>, MAX_PRIVATE_LOGS_PER_CALL>,\n pub contract_class_logs_hashes: BoundedVec<Counted<LogHash>, MAX_CONTRACT_CLASS_LOGS_PER_CALL>,\n\n // Contains the last key validation request for each key type. This is used to cache the last request and avoid\n // fetching the same request multiple times. The index of the array corresponds to the key type (0 nullifier, 1\n // incoming, 2 outgoing, 3 tagging).\n pub last_key_validation_requests: [Option<KeyValidationRequest>; NUM_KEY_TYPES],\n\n pub expected_non_revertible_side_effect_counter: u32,\n pub expected_revertible_side_effect_counter: u32,\n}\n\nimpl PrivateContext {\n pub fn new(inputs: PrivateContextInputs, args_hash: Field) -> PrivateContext {\n let max_allowed_include_by_timestamp =\n inputs.anchor_block_header.global_variables.timestamp + MAX_INCLUDE_BY_TIMESTAMP_DURATION;\n PrivateContext {\n inputs,\n side_effect_counter: inputs.start_side_effect_counter + 1,\n min_revertible_side_effect_counter: 0,\n is_fee_payer: false,\n args_hash,\n return_hash: 0,\n include_by_timestamp: max_allowed_include_by_timestamp,\n note_hash_read_requests: BoundedVec::new(),\n nullifier_read_requests: BoundedVec::new(),\n key_validation_requests_and_generators: BoundedVec::new(),\n note_hashes: BoundedVec::new(),\n nullifiers: BoundedVec::new(),\n anchor_block_header: inputs.anchor_block_header,\n private_call_requests: BoundedVec::new(),\n public_call_requests: BoundedVec::new(),\n public_teardown_call_request: PublicCallRequest::empty(),\n l2_to_l1_msgs: BoundedVec::new(),\n private_logs: BoundedVec::new(),\n contract_class_logs_hashes: BoundedVec::new(),\n last_key_validation_requests: [Option::none(); NUM_KEY_TYPES],\n expected_non_revertible_side_effect_counter: 0,\n expected_revertible_side_effect_counter: 0,\n }\n }\n\n /// Returns the contract address that initiated this function call.\n ///\n /// This is similar to `msg.sender` in Solidity (hence the name).\n ///\n /// Important Note: Since Aztec doesn't have a concept of an EoA (Externally-owned Account), the msg_sender is\n /// \"none\" for the first function call of every transaction. The first function call of a tx is likely to be a call\n /// to the user's account contract, so this quirk will most often be handled by account contract developers.\n ///\n /// # Returns\n /// * `Option<AztecAddress>` - The address of the smart contract that called this function (be it an app contract\n /// or a user's account contract). Returns `Option<AztecAddress>::none` for the first function call of the tx. No\n /// other _private_ function calls in the tx will have a `none` msg_sender, but _public_ function calls might (see\n /// the PublicContext).\n pub fn maybe_msg_sender(self) -> Option<AztecAddress> {\n let maybe_msg_sender = self.inputs.call_context.msg_sender;\n if maybe_msg_sender == NULL_MSG_SENDER_CONTRACT_ADDRESS {\n Option::none()\n } else {\n Option::some(maybe_msg_sender)\n }\n }\n\n /// Returns the contract address of the current function being executed.\n ///\n /// This is equivalent to `address(this)` in Solidity (hence the name). Use this to identify the current contract's\n /// address, commonly needed for access control or when interacting with other contracts.\n ///\n /// # Returns\n /// * `AztecAddress` - The contract address of the current function being executed.\n ///\n pub fn this_address(self) -> AztecAddress {\n self.inputs.call_context.contract_address\n }\n\n /// Returns the chain ID of the current network.\n ///\n /// This is similar to `block.chainid` in Solidity. Returns the unique identifier for the blockchain network this\n /// transaction is executing on.\n ///\n /// Helps prevent cross-chain replay attacks. Useful if implementing multi-chain contract logic.\n ///\n /// # Returns\n /// * `Field` - The chain ID as a field element\n ///\n pub fn chain_id(self) -> Field {\n self.inputs.tx_context.chain_id\n }\n\n /// Returns the Aztec protocol version that this transaction is executing under. Different versions may have\n /// different rules, opcodes, or cryptographic primitives.\n ///\n /// This is similar to how Ethereum has different EVM versions.\n ///\n /// Useful for forward/backward compatibility checks\n ///\n /// Not to be confused with contract versions; this is the protocol version.\n ///\n /// # Returns\n /// * `Field` - The protocol version as a field element\n ///\n pub fn version(self) -> Field {\n self.inputs.tx_context.version\n }\n\n /// Returns the gas settings for the current transaction.\n ///\n /// This provides information about gas limits and pricing for the transaction, similar to `tx.gasprice` and gas\n /// limits in Ethereum. However, Aztec has a more sophisticated gas model with separate accounting for L2\n /// computation and data availability (DA) costs.\n ///\n /// # Returns\n /// * `GasSettings` - Struct containing gas limits and fee information\n ///\n pub fn gas_settings(self) -> GasSettings {\n self.inputs.tx_context.gas_settings\n }\n\n /// Returns the function selector of the currently executing function.\n ///\n /// Low-level function: Ordinarily, smart contract developers will not need to access this.\n ///\n /// This is similar to `msg.sig` in Solidity, which returns the first 4 bytes of the function signature. In Aztec,\n /// the selector uniquely identifies which function within the contract is being called.\n ///\n /// # Returns\n /// * `FunctionSelector` - The 4-byte function identifier\n ///\n /// # Advanced\n /// Only #[external(\"private\")] functions have a function selector as a protocol- enshrined concept. The function\n /// selectors of private functions are baked into the preimage of the contract address, and are used by the\n /// protocol's kernel circuits to identify each private function and ensure the correct one is being executed.\n ///\n /// Used internally for function dispatch and call verification.\n ///\n pub fn selector(self) -> FunctionSelector {\n self.inputs.call_context.function_selector\n }\n\n /// Returns the hash of the arguments passed to the current function.\n ///\n /// Very low-level function: You shouldn't need to call this. The #[external(\"private\")] macro calls this, and it\n /// makes the arguments neatly available to the body of your private function.\n ///\n /// # Returns\n /// * `Field` - Hash of the function arguments\n ///\n /// # Advanced\n /// * Arguments are hashed to reduce proof size and verification time\n /// * Enables efficient argument passing in recursive function calls\n /// * The hash can be used to retrieve the original arguments from the PXE.\n ///\n pub fn get_args_hash(self) -> Field {\n self.args_hash\n }\n\n /// Pushes a new note_hash to the Aztec blockchain's global Note Hash Tree (a state tree).\n ///\n /// A note_hash is a commitment to a piece of private state.\n ///\n /// Low-level function: Ordinarily, smart contract developers will not need to manually call this. Aztec-nr's state\n /// variables (see `../state_vars/`) are designed to understand when to create and push new note hashes.\n ///\n /// # Arguments\n /// * `note_hash` - The new note_hash.\n ///\n /// # Advanced\n /// From here, the protocol's kernel circuits will take over and insert the note_hash into the protocol's \"note\n /// hash tree\" (in the Base Rollup circuit). Before insertion, the protocol will:\n /// - \"Silo\" the `note_hash` with the contract address of this function, to yield a `siloed_note_hash`. This\n /// prevents state collisions between different smart contracts.\n /// - Ensure uniqueness of the `siloed_note_hash`, to prevent Faerie-Gold attacks, by hashing the\n /// `siloed_note_hash` with a unique value, to yield a `unique_siloed_note_hash` (see the protocol spec for more).\n ///\n /// In addition to calling this function, aztec-nr provides the contents of the newly-created note to the PXE, via\n /// the `notify_created_note` oracle.\n ///\n /// > Advanced users might occasionally wish to push data to the context > directly for lower-level control. If you\n /// find yourself doing this, > please open an issue on GitHub to describe your use case: it might be > that new\n /// functionality should be added to aztec-nr.\n ///\n pub fn push_note_hash(&mut self, note_hash: Field) {\n self.note_hashes.push(Counted::new(note_hash, self.next_counter()));\n }\n\n /// Pushes a new nullifier to the Aztec blockchain's global Nullifier Tree (a state tree).\n ///\n /// See also: `push_nullifier_for_note_hash`.\n ///\n /// Low-level function: Ordinarily, smart contract developers will not need to manually call this. Aztec-nr's state\n /// variables (see `../state_vars/`) are designed to understand when to create and push new nullifiers.\n ///\n /// A nullifier can only be emitted once. Duplicate nullifier insertions are rejected by the protocol.\n ///\n /// Generally, a nullifier is emitted to prevent an action from happening more than once, in such a way that the\n /// action cannot be linked (by an observer of the blockchain) to any earlier transactions.\n ///\n /// I.e. a nullifier is a random-looking, but deterministic record of a private, one-time action, which does not\n /// leak what action has been taken, and which preserves the property of \"tx unlinkability\".\n ///\n /// Usually, a nullifier will be emitted to \"spend\" a note (a piece of private state), without revealing which\n /// specific note is being spent.\n ///\n /// (Important: in such cases, use the below `push_nullifier_for_note_hash`).\n ///\n /// Sometimes, a nullifier might be emitted completely unrelated to any notes. Examples include initialization of a\n /// new contract; initialization of a PrivateMutable, or signalling in Semaphore-like applications. This\n /// `push_nullifier` function serves such use cases.\n ///\n /// # Arguments\n /// * `nullifier`\n ///\n /// # Advanced\n /// From here, the protocol's kernel circuits will take over and insert the nullifier into the protocol's\n /// \"nullifier tree\" (in the Base Rollup circuit). Before insertion, the protocol will:\n /// - \"Silo\" the `nullifier` with the contract address of this function, to yield a `siloed_nullifier`. This\n /// prevents state collisions between different smart contracts.\n /// - Ensure the `siloed_nullifier` is unique (the nullifier tree is an indexed merkle tree which supports\n /// efficient non-membership proofs).\n ///\n pub fn push_nullifier(&mut self, nullifier: Field) {\n notify_created_nullifier(nullifier);\n self.nullifiers.push(Nullifier { value: nullifier, note_hash: 0 }.count(self.next_counter()));\n }\n\n /// Pushes a nullifier that corresponds to a specific note hash.\n ///\n /// Low-level function: Ordinarily, smart contract developers will not need to manually call this. Aztec-nr's state\n /// variables (see `../state_vars/`) are designed to understand when to create and push new nullifiers.\n ///\n /// This is a specialized version of `push_nullifier` that links a nullifier to the specific note hash it's\n /// nullifying. This is the most common usage pattern for nullifiers. See `push_nullifier` for more explanation on\n /// nullifiers.\n ///\n /// # Arguments\n /// * `nullifier`\n /// * `nullified_note_hash` - The note hash of the note being nullified\n ///\n /// # Advanced\n ///Important: usage of this function doesn't mean that the world will _see_ that this nullifier relates to the\n /// given nullified_note_hash (as that would violate \"tx unlinkability\"); it simply informs the user's PXE about\n /// the relationship (via `notify_nullified_note`). The PXE can then use this information to feed hints to the\n /// kernel circuits for \"squashing\" purposes: If a note is nullified during the same tx which created it, we can\n /// \"squash\" (delete) the note and nullifier (and any private logs associated with the note), to save on data\n /// emission costs.\n ///\n pub fn push_nullifier_for_note_hash(&mut self, nullifier: Field, nullified_note_hash: Field) {\n let nullifier_counter = self.next_counter();\n notify_nullified_note(nullifier, nullified_note_hash, nullifier_counter);\n self.nullifiers.push(Nullifier { value: nullifier, note_hash: nullified_note_hash }.count(nullifier_counter));\n }\n\n /// Returns the anchor block header - the historical block header that this private function is reading from.\n ///\n /// A private function CANNOT read from the \"current\" block header, but must read from some older block header,\n /// because as soon as private function execution begins (asynchronously, on a user's device), the public state of\n /// the chain (the \"current state\") will have progressed forward.\n ///\n /// # Returns\n /// * `BlockHeader` - The anchor block header.\n ///\n /// # Advanced\n /// * All private functions of a tx read from the same anchor block header.\n /// * The protocol asserts that the `include_by_timestamp` of every tx is at most 24 hours beyond the timestamp of\n /// the tx's chosen anchor block header. This enables the network's nodes to safely prune old txs from the mempool.\n /// Therefore, the chosen block header _must_ be one from within the last 24 hours.\n ///\n pub fn get_anchor_block_header(self) -> BlockHeader {\n self.anchor_block_header\n }\n\n /// Returns the header of any historical block at or before the anchor block.\n ///\n /// This enables private contracts to access information from even older blocks than the anchor block header.\n ///\n /// Useful for time-based contract logic that needs to compare against multiple historical points.\n ///\n /// # Arguments\n /// * `block_number` - The block number to retrieve (must be <= anchor block number)\n ///\n /// # Returns\n /// * `BlockHeader` - The header of the requested historical block\n ///\n /// # Advanced\n /// This function uses an oracle to fetch block header data from the user's PXE. Depending on how much blockchain\n /// data the user's PXE has been set up to store, this might require a query from the PXE to another Aztec node to\n /// get the data. > This is generally true of all oracle getters (see `../oracle`).\n ///\n /// Each block header gets hashed and stored as a leaf in the protocol's Archive Tree. In fact, the i-th block\n /// header gets stored at the i-th leaf index of the Archive Tree. Behind the scenes, this `get_block_header_at`\n /// function will add Archive Tree merkle-membership constraints (~3k) to your smart contract function's circuit,\n /// to prove existence of the block header in the Archive Tree.\n ///\n /// Note: we don't do any caching, so avoid making duplicate calls for the same block header, because each call\n /// will add duplicate constraints.\n ///\n /// Calling this function is more expensive (constraint-wise) than getting the anchor block header (via\n /// `get_block_header`). This is because the anchor block's merkle membership proof is handled by Aztec's protocol\n /// circuits, and is only performed once for the entire tx because all private functions of a tx share a common\n /// anchor block header. Therefore, the cost (constraint-wise) of calling `get_block_header` is effectively free.\n ///\n pub fn get_block_header_at(self, block_number: u32) -> BlockHeader {\n get_block_header_at(block_number, self)\n }\n\n /// Sets the hash of the return values for this private function.\n ///\n /// Very low-level function: this is called by the #[external(\"private\")] macro.\n ///\n /// # Arguments\n /// * `serialized_return_values` - The serialized return values as a field array\n ///\n pub fn set_return_hash<let N: u32>(&mut self, serialized_return_values: [Field; N]) {\n let return_hash = hash_args(serialized_return_values);\n self.return_hash = return_hash;\n execution_cache::store(serialized_return_values, return_hash);\n }\n\n /// Builds the PrivateCircuitPublicInputs for this private function, to ensure compatibility with the protocol's\n /// kernel circuits.\n ///\n /// Very low-level function: This function is automatically called by the #[external(\"private\")] macro.\n pub fn finish(self) -> PrivateCircuitPublicInputs {\n PrivateCircuitPublicInputs {\n call_context: self.inputs.call_context,\n args_hash: self.args_hash,\n returns_hash: self.return_hash,\n min_revertible_side_effect_counter: self.min_revertible_side_effect_counter,\n is_fee_payer: self.is_fee_payer,\n include_by_timestamp: self.include_by_timestamp,\n note_hash_read_requests: ClaimedLengthArray::from_bounded_vec(self.note_hash_read_requests),\n nullifier_read_requests: ClaimedLengthArray::from_bounded_vec(self.nullifier_read_requests),\n key_validation_requests_and_generators: ClaimedLengthArray::from_bounded_vec(\n self.key_validation_requests_and_generators,\n ),\n note_hashes: ClaimedLengthArray::from_bounded_vec(self.note_hashes),\n nullifiers: ClaimedLengthArray::from_bounded_vec(self.nullifiers),\n private_call_requests: ClaimedLengthArray::from_bounded_vec(self.private_call_requests),\n public_call_requests: ClaimedLengthArray::from_bounded_vec(self.public_call_requests),\n public_teardown_call_request: self.public_teardown_call_request,\n l2_to_l1_msgs: ClaimedLengthArray::from_bounded_vec(self.l2_to_l1_msgs),\n start_side_effect_counter: self.inputs.start_side_effect_counter,\n end_side_effect_counter: self.side_effect_counter,\n private_logs: ClaimedLengthArray::from_bounded_vec(self.private_logs),\n contract_class_logs_hashes: ClaimedLengthArray::from_bounded_vec(self.contract_class_logs_hashes),\n anchor_block_header: self.anchor_block_header,\n tx_context: self.inputs.tx_context,\n expected_non_revertible_side_effect_counter: self.expected_non_revertible_side_effect_counter,\n expected_revertible_side_effect_counter: self.expected_revertible_side_effect_counter,\n }\n }\n\n /// Designates this contract as the fee payer for the transaction.\n ///\n /// Unlike Ethereum, where the transaction sender always pays fees, Aztec allows any contract to voluntarily pay\n /// transaction fees. This enables patterns like sponsored transactions or fee abstraction where users don't need\n /// to hold fee-juice themselves. (Fee juice is a fee-paying asset for Aztec).\n ///\n /// Only one contract per transaction can declare itself as the fee payer, and it must have sufficient fee-juice\n /// balance (>= the gas limits specified in the TxContext) by the time we reach the public setup phase of the tx.\n ///\n pub fn set_as_fee_payer(&mut self) {\n crate::protocol::debug_log::debug_log_format(\"Setting {0} as fee payer\", [self.this_address().to_field()]);\n self.is_fee_payer = true;\n }\n\n pub fn in_revertible_phase(&mut self) -> bool {\n let current_counter = self.side_effect_counter;\n\n // Safety: Kernel will validate that the claim is correct by validating the expected counters.\n let is_revertible = unsafe { is_side_effect_counter_revertible_oracle_wrapper(current_counter) };\n\n if is_revertible {\n if (self.expected_revertible_side_effect_counter == 0)\n | (current_counter < self.expected_revertible_side_effect_counter) {\n self.expected_revertible_side_effect_counter = current_counter;\n }\n } else if current_counter > self.expected_non_revertible_side_effect_counter {\n self.expected_non_revertible_side_effect_counter = current_counter;\n }\n\n is_revertible\n }\n\n /// Declares the end of the \"setup phase\" of this tx.\n ///\n /// Only one function per tx can declare the end of the setup phase.\n ///\n /// Niche function: Only wallet developers and paymaster contract developers (aka Fee-payment contracts) will need\n /// to make use of this function.\n ///\n /// Aztec supports a three-phase execution model: setup, app logic, teardown. The phases exist to enable a fee\n /// payer to take on the risk of paying a transaction fee, safe in the knowledge that their payment (in whatever\n /// token or method the user chooses) will succeed, regardless of whether the app logic will succeed. The \"setup\"\n /// phase enables such a payment to be made, because the setup phase _cannot revert_: a reverting function within\n /// the setup phase would result in an invalid block which cannot be proven. Any side-effects generated during that\n /// phase are guaranteed to be inserted into Aztec's state trees (except for squashed notes & nullifiers, of\n /// course).\n ///\n /// Even though the end of the setup phase is declared within a private function, you might have noticed that\n /// _public_ functions can also execute within the setup phase. This is because any public function calls which\n /// were enqueued _within the setup phase_ by a private function are considered part of the setup phase.\n ///\n /// # Advanced\n /// * Sets the minimum revertible side effect counter of this tx to be the PrivateContext's _current_ side effect\n /// counter.\n ///\n pub fn end_setup(&mut self) {\n // Incrementing the side effect counter when ending setup ensures non ambiguity for the counter where we change\n // phases.\n self.side_effect_counter += 1;\n // crate::protocol::debug_log::debug_log_format(\n // \"Ending setup at counter {0}\",\n // [self.side_effect_counter as Field]\n // );\n self.min_revertible_side_effect_counter = self.next_counter();\n notify_set_min_revertible_side_effect_counter(self.min_revertible_side_effect_counter);\n }\n\n /// Sets a deadline (an \"include-by timestamp\") for when this transaction must be included in a block.\n ///\n /// Other functions in this tx might call this setter with differing values for the include-by timestamp. To ensure\n /// that all functions' deadlines are met, the _minimum_ of all these include-by timestamps will be exposed when\n /// this tx is submitted to the network.\n ///\n /// If the transaction is not included in a block by its include-by timestamp, it becomes invalid and it will never\n /// be included.\n ///\n /// This expiry timestamp is publicly visible. See the \"Advanced\" section for privacy concerns.\n ///\n /// # Arguments\n /// * `include_by_timestamp` - Unix timestamp (seconds) deadline for inclusion. The include-by timestamp of this tx\n /// will be _at most_ the timestamp specified.\n ///\n /// # Advanced\n /// * If multiple functions set differing `include_by_timestamp`s, the kernel circuits will set it to be the\n /// _minimum_ of the two. This ensures the tx expiry requirements of all functions in the tx are met.\n /// * Rollup circuits will reject expired txs.\n /// * The protocol enforces that all transactions must be included within 24 hours of their chosen anchor block's\n /// timestamp, to enable safe mempool pruning.\n /// * The DelayedPublicMutable design makes heavy use of this functionality, to enable private functions to read\n /// public state.\n /// * A sophisticated Wallet should cleverly set an include-by timestamp to improve the privacy of the user and the\n /// network as a whole. For example, if a contract interaction sets include-by to some publicly-known value (e.g.\n /// the time when a contract upgrades), then the wallet might wish to set an even lower one to avoid revealing that\n /// this tx is interacting with said contract. Ideally, all wallets should standardize on an approach in order to\n /// provide users with a large anonymity set -- although the exact approach\n /// will need to be discussed. Wallets that deviate from a standard might accidentally reveal which wallet each\n /// transaction originates from.\n ///\n // docs:start:include-by-timestamp\n pub fn set_include_by_timestamp(&mut self, include_by_timestamp: u64) {\n // docs:end:include-by-timestamp\n self.include_by_timestamp = std::cmp::min(self.include_by_timestamp, include_by_timestamp);\n }\n\n /// Asserts that a note has been created.\n ///\n /// This function will cause the transaction to fail unless the requested note exists. This is the preferred\n /// mechanism for performing this check, and the only one that works for pending notes.\n ///\n /// ## Pending Notes\n ///\n /// Both settled notes (created in prior transactions) and pending notes (created in the current transaction) will\n /// be considered by this function. Pending notes must have been created **before** this call is made for the check\n /// to pass.\n ///\n /// ## Historical Notes\n ///\n /// If you need to assert that a note existed _by some specific block in the past_, instead of simply proving that\n /// it exists by the current anchor block, use [crate::history::note::assert_note_existed_by] instead.\n ///\n /// ## Cost\n ///\n /// This uses up one of the call's kernel note hash read requests, which are limited. Like all kernel requests,\n /// proving time costs are only incurred when the total number of requests exceeds the kernel's capacity, requiring\n /// an additional invocation of the kernel reset circuit.\n pub fn assert_note_exists(&mut self, note_existence_request: NoteExistenceRequest) {\n // Note that the `note_hash_read_requests` array does not hold `NoteExistenceRequest` objects, but rather a\n // custom kernel type. We convert from the aztec-nr type into it.\n\n let note_hash = note_existence_request.note_hash();\n let contract_address = note_existence_request.maybe_contract_address().unwrap_or(AztecAddress::zero());\n\n let side_effect = Scoped::new(\n Counted::new(note_hash, self.next_counter()),\n contract_address,\n );\n\n self.note_hash_read_requests.push(side_effect);\n }\n\n /// Asserts that a nullifier has been emitted.\n ///\n /// This function will cause the transaction to fail unless the requested nullifier exists. This is the preferred\n /// mechanism for performing this check, and the only one that works for pending nullifiers.\n ///\n /// ## Pending Nullifiers\n ///\n /// Both settled nullifiers (emitted in prior transactions) and pending nullifiers (emitted in the current\n /// transaction) will be considered by this function. Pending nullifiers must have been emitted **before** this\n /// call is made for the check to pass.\n ///\n /// ## Historical Nullifiers\n ///\n /// If you need to assert that a nullifier existed _by some specific block in the past_, instead of simply proving\n /// that it exists by the current anchor block, use [crate::history::nullifier::assert_nullifier_existed_by]\n /// instead.\n ///\n /// ## Public vs Private\n ///\n /// In general, it is unsafe to check for nullifier non-existence in private, as that will not consider the\n /// possibility of the nullifier having been emitted in any transaction between the anchor block and the inclusion\n /// block. Private functions instead prove existence via this function and 'prove' non-existence by _emitting_ the\n /// nullifer, which would cause the transaction to fail if the nullifier existed.\n ///\n /// This is not the case in public functions, which do have access to the tip of the blockchain and so can reliably\n /// prove whether a nullifier exists or not via\n /// [crate::context::public_context::PublicContext::nullifier_exists_unsafe].\n ///\n /// ## Cost\n ///\n /// This uses up one of the call's kernel nullifier read requests, which are limited. Like all kernel requests,\n /// proving time costs are only incurred when the total number of requests exceeds the kernel's capacity, requiring\n /// an additional invocation of the kernel reset circuit.\n pub fn assert_nullifier_exists(&mut self, nullifier_existence_request: NullifierExistenceRequest) {\n let nullifier = nullifier_existence_request.nullifier();\n let contract_address = nullifier_existence_request.maybe_contract_address().unwrap_or(AztecAddress::zero());\n\n let request = Scoped::new(\n Counted::new(nullifier, self.next_counter()),\n contract_address,\n );\n\n self.nullifier_read_requests.push(request);\n }\n\n /// Requests the app-siloed nullifier secret key (nsk_app) for the given (hashed) master nullifier public key\n /// (npk_m), from the user's PXE.\n ///\n /// Advanced function: Only needed if you're designing your own notes and/or nullifiers.\n ///\n /// Contracts are not allowed to compute nullifiers for other contracts, as that would let them read parts of their\n /// private state. Because of this, a contract is only given an \"app-siloed secret key\", which is constructed by\n /// hashing the user's master nullifier secret key with the contract's address. However, because contracts cannot\n /// be trusted with a user's master nullifier secret key (because we don't know which contracts are honest or\n /// malicious), the PXE refuses to provide any master secret keys to any app smart contract function. This means\n /// app functions are unable to prove that the derivation of an app-siloed nullifier secret key has been computed\n /// correctly. Instead, an app function can request to the kernel (via `request_nsk_app`) that it validates the\n /// siloed derivation, since the kernel has been vetted to not leak any master secret keys.\n ///\n /// A common nullification scheme is to inject a nullifier secret key into the preimage of a nullifier, to make the\n /// nullifier deterministic but random-looking. This function enables that flow.\n ///\n /// # Arguments\n /// * `npk_m_hash` - A hash of the master nullifier public key of the user whose PXE is executing this function.\n ///\n /// # Returns\n /// * The app-siloed nullifier secret key that corresponds to the given `npk_m_hash`.\n ///\n pub fn request_nsk_app(&mut self, npk_m_hash: Field) -> Field {\n self.request_sk_app(npk_m_hash, NULLIFIER_INDEX)\n }\n\n /// Requests the app-siloed nullifier secret key (nsk_app) for the given (hashed) master nullifier public key\n /// (npk_m), from the user's PXE.\n ///\n /// See `request_nsk_app` and `request_sk_app` for more info.\n ///\n /// The intention of the \"outgoing\" keypair is to provide a second secret key for all of a user's outgoing activity\n /// (i.e. for notes that a user creates, as opposed to notes that a user receives from others). The separation of\n /// incoming and outgoing data was a distinction made by zcash, with the intention of enabling a user to optionally\n /// share with a 3rd party a controlled view of only incoming or outgoing notes. Similar functionality of sharing\n /// select data can be achieved with offchain zero-knowledge proofs. It is up to an app developer whether they\n /// choose to make use of a user's outgoing keypair within their application logic, or instead simply use the same\n /// keypair (the address keypair (which is effectively the same as the \"incoming\" keypair)) for all incoming &\n /// outgoing messages to a user.\n ///\n /// Currently, all of the exposed encryption functions in aztec-nr ignore the outgoing viewing keys, and instead\n /// encrypt all note logs and event logs to a user's address public key.\n ///\n /// # Arguments\n /// * `ovpk_m_hash` - Hash of the outgoing viewing public key master\n ///\n /// # Returns\n /// * The application-specific outgoing viewing secret key\n ///\n pub fn request_ovsk_app(&mut self, ovpk_m_hash: Field) -> Field {\n self.request_sk_app(ovpk_m_hash, OUTGOING_INDEX)\n }\n\n /// Pushes a Key Validation Request to the kernel.\n ///\n /// Private functions are not allowed to see a user's master secret keys, because we do not trust them. They are\n /// instead given \"app-siloed\" secret keys with a claim that they relate to a master public key. They can then\n /// request validation of this claim, by making a \"key validation request\" to the protocol's kernel circuits (which\n /// _are_ allowed to see certain master secret keys).\n ///\n /// When a Key Validation Request tuple of (sk_app, Pk_m, app_address) is submitted to the kernel, it will perform\n /// the following derivations to validate the relationship between the claimed sk_app and the user's Pk_m:\n ///\n /// (sk_m) ----> * G ----> Pk_m\n /// | |\n /// v We use the kernel to prove this\n /// h(sk_m, app_address) | sk_app-Pk_m relationship, because app\n /// | circuits must not be trusted to see sk_m.\n /// v |\n /// sk_app - - - - - - - - -\n ///\n /// The function is named \"request_\" instead of \"get_\" to remind the user that a Key Validation Request will be\n /// emitted to the kernel.\n ///\n fn request_sk_app(&mut self, pk_m_hash: Field, key_index: Field) -> Field {\n let cached_request =\n self.last_key_validation_requests[key_index as u32].unwrap_or(KeyValidationRequest::empty());\n\n if cached_request.pk_m.hash() == pk_m_hash {\n // We get a match so the cached request is the latest one\n cached_request.sk_app\n } else {\n // We didn't get a match meaning the cached result is stale Typically we'd validate keys by showing that\n // they are the preimage of `pk_m_hash`, but that'd require the oracle returning the master secret keys,\n // which could cause malicious contracts to leak it or learn about secrets from other contracts. We\n // therefore silo secret keys, and rely on the private kernel to validate that we siloed secret key\n // corresponds to correct siloing of the master secret key that hashes to `pk_m_hash`.\n\n // Safety: Kernels verify that the key validation request is valid and below we verify that a request for\n // the correct public key has been received.\n let request = unsafe { get_key_validation_request(pk_m_hash, key_index) };\n assert_eq(request.pk_m.hash(), pk_m_hash, \"Obtained invalid key validation request\");\n\n self.key_validation_requests_and_generators.push(\n KeyValidationRequestAndGenerator { request, sk_app_generator: sk_generators[key_index as u32] },\n );\n self.last_key_validation_requests[key_index as u32] = Option::some(request);\n request.sk_app\n }\n }\n\n /// Sends an \"L2 -> L1 message\" from this function (Aztec, L2) to a smart contract on Ethereum (L1). L1 contracts\n /// which are designed to send/receive messages to/from Aztec are called \"Portal Contracts\".\n ///\n /// Common use cases include withdrawals, cross-chain asset transfers, and triggering L1 actions based on L2 state\n /// changes.\n ///\n /// The message will be inserted into an Aztec \"Outbox\" contract on L1, when this transaction's block is proposed\n /// to L1. Sending the message will not result in any immediate state changes in the target portal contract. The\n /// message will need to be manually consumed from the Outbox through a separate Ethereum transaction: a user will\n /// need to call a function of the portal contract -- a function specifically designed to make a call to the Outbox\n /// to consume the message. The message will only be available for consumption once the _epoch_ proof has been\n /// submitted. Given that there are multiple Aztec blocks within an epoch, it might take some time for this epoch\n /// proof to be submitted -- especially if the block was near the start of an epoch.\n ///\n /// # Arguments\n /// * `recipient` - Ethereum address that will receive the message\n /// * `content` - Message content (32 bytes as a Field element). This content has a very\n /// specific layout. docs:start:context_message_portal\n pub fn message_portal(&mut self, recipient: EthAddress, content: Field) {\n let message = L2ToL1Message { recipient, content };\n self.l2_to_l1_msgs.push(message.count(self.next_counter()));\n }\n\n /// Consumes a message sent from Ethereum (L1) to Aztec (L2).\n ///\n /// Common use cases include token bridging, cross-chain governance, and triggering L2 actions based on L1 events.\n ///\n /// Use this function if you only want the message to ever be \"referred to\" once. Once consumed using this method,\n /// the message cannot be consumed again, because a nullifier is emitted. If your use case wants for the message to\n /// be read unlimited times, then you can always read any historic message from the L1-to-L2 messages tree;\n /// messages never technically get deleted from that tree.\n ///\n /// The message will first be inserted into an Aztec \"Inbox\" smart contract on L1. Sending the message will not\n /// result in any immediate state changes in the target L2 contract. The message will need to be manually consumed\n /// by the target contract through a separate Aztec transaction. The message will not be available for consumption\n /// immediately. Messages get copied over from the L1 Inbox to L2 by the next Proposer in batches. So you will need\n /// to wait until the messages are copied before you can consume them.\n ///\n /// # Arguments\n /// * `content` - The message content that was sent from L1\n /// * `secret` - Secret value used for message privacy (if needed)\n /// * `sender` - Ethereum address that sent the message\n /// * `leaf_index` - Index of the message in the L1-to-L2 message tree\n ///\n /// # Advanced\n /// Validates message existence in the L1-to-L2 message tree and nullifies the message to prevent\n /// double-consumption.\n pub fn consume_l1_to_l2_message(&mut self, content: Field, secret: Field, sender: EthAddress, leaf_index: Field) {\n let nullifier = process_l1_to_l2_message(\n self.anchor_block_header.state.l1_to_l2_message_tree.root,\n self.this_address(),\n sender,\n self.chain_id(),\n self.version(),\n content,\n secret,\n leaf_index,\n );\n\n // Push nullifier (and the \"commitment\" corresponding to this can be \"empty\")\n self.push_nullifier(nullifier)\n }\n\n /// Emits a private log (an array of Fields) that will be published to an Ethereum blob.\n ///\n /// Private logs are intended for the broadcasting of ciphertexts: that is, encrypted events or encrypted note\n /// contents. Since the data in the logs is meant to be _encrypted_, private_logs are broadcast to publicly-visible\n /// Ethereum blobs. The intended recipients of such encrypted messages can then discover and decrypt these\n /// encrypted logs using their viewing secret key. (See `../messages/discovery` for more details).\n ///\n /// Important note: This function DOES NOT _do_ any encryption of the input `log` fields. This function blindly\n /// publishes whatever input `log` data is fed into it, so the caller of this function should have already\n /// performed the encryption, and the `log` should be the result of that encryption.\n ///\n /// The protocol does not dictate what encryption scheme should be used: a smart contract developer can choose\n /// whatever encryption scheme they like. Aztec-nr includes some off-the-shelf encryption libraries that developers\n /// might wish to use, for convenience. These libraries not only encrypt a plaintext (to produce a ciphertext);\n /// they also prepend the ciphertext with a `tag` and `ephemeral public key` for easier message discovery. This is\n /// a very dense topic, and we will be writing more libraries and docs soon.\n ///\n /// > Currently, AES128 CBC encryption is the main scheme included in > aztec.nr. > We are currently making\n /// significant changes to the interfaces of the > encryption library.\n ///\n /// In some niche use cases, an app might be tempted to publish _un-encrypted_ data via a private log, because\n /// _public logs_ are not available to private functions. Be warned that emitting public data via private logs is\n /// strongly discouraged, and is considered a \"privacy anti-pattern\", because it reveals identifiable information\n /// about _which_ function has been executed. A tx which leaks such information does not contribute to the privacy\n /// set of the network.\n ///\n /// * Unlike `emit_raw_note_log`, this log is not tied to any specific note\n ///\n /// # Arguments\n /// * `log` - The log data that will be publicly broadcast (so make sure it's already been encrypted before you\n /// call this function). Private logs are bounded in size (PRIVATE_LOG_SIZE_IN_FIELDS), to encourage all logs from\n /// all smart contracts look identical.\n /// * `length` - The actual length of the `log` (measured in number of Fields). Although the input log has a max\n /// size of PRIVATE_LOG_SIZE_IN_FIELDS, the latter values of the array might all be 0's for small logs. This\n /// `length` should reflect the trimmed length of the array. The protocol's kernel circuits can then append random\n /// fields as \"padding\" after the `length`, so that the logs of this smart contract look indistinguishable from\n /// (the same length as) the logs of all other applications. It's up to wallets how much padding to apply, so\n /// ideally all wallets should agree on standards for this.\n pub fn emit_private_log(&mut self, log: [Field; PRIVATE_LOG_SIZE_IN_FIELDS], length: u32) {\n let counter = self.next_counter();\n let private_log = PrivateLogData { log: PrivateLog::new(log, length), note_hash_counter: 0 }.count(counter);\n self.private_logs.push(private_log);\n }\n\n // TODO: rename.\n /// Emits a private log that is explicitly tied to a newly-emitted note_hash, to convey to the kernel: \"this log\n /// relates to this note\".\n ///\n /// This linkage is important in case the note gets squashed (due to being read later in this same tx), since we\n /// can then squash the log as well.\n ///\n /// See `emit_private_log` for more info about private log emission.\n ///\n /// # Arguments\n /// * `log` - The log data as an array of Field elements\n /// * `length` - The actual length of the `log` (measured in number of Fields).\n /// * `note_hash_counter` - The side-effect counter that was assigned to the new note_hash when it was pushed to\n /// this `PrivateContext`.\n ///\n /// Important: If your application logic requires the log to always be emitted regardless of note squashing,\n /// consider using `emit_private_log` instead, or emitting additional events.\n ///\n pub fn emit_raw_note_log(&mut self, log: [Field; PRIVATE_LOG_SIZE_IN_FIELDS], length: u32, note_hash_counter: u32) {\n let counter = self.next_counter();\n let private_log = PrivateLogData { log: PrivateLog::new(log, length), note_hash_counter };\n self.private_logs.push(private_log.count(counter));\n }\n\n pub fn emit_contract_class_log<let N: u32>(&mut self, log: [Field; N]) {\n let contract_address = self.this_address();\n let counter = self.next_counter();\n\n let log_to_emit: [Field; CONTRACT_CLASS_LOG_SIZE_IN_FIELDS] =\n log.concat([0; CONTRACT_CLASS_LOG_SIZE_IN_FIELDS - N]);\n // Note: the length is not always N, it is the number of fields we want to broadcast, omitting trailing zeros\n // to save blob space.\n // Safety: The below length is constrained in the base rollup, which will make sure that all the fields beyond\n // length are zero. However, it won't be able to check that we didn't add extra padding (trailing zeroes) or\n // that we cut trailing zeroes from the end.\n let length = unsafe { trimmed_array_length_hint(log_to_emit) };\n // We hash the entire padded log to ensure a user cannot pass a shorter length and so emit incorrect shorter\n // bytecode.\n let log_hash = poseidon2_hash(log_to_emit);\n // Safety: the below only exists to broadcast the raw log, so we can provide it to the base rollup later to be\n // constrained.\n unsafe {\n notify_created_contract_class_log(contract_address, log_to_emit, length, counter);\n }\n\n self.contract_class_logs_hashes.push(LogHash { value: log_hash, length: length }.count(counter));\n }\n\n /// Calls a private function on another contract (or the same contract).\n ///\n /// Very low-level function.\n ///\n /// # Arguments\n /// * `contract_address` - Address of the contract containing the function\n /// * `function_selector` - 4-byte identifier of the function to call\n /// * `args` - Array of arguments to pass to the called function\n ///\n /// # Returns\n /// * `ReturnsHash` - Hash of the called function's return values. Use `.get_preimage()` to extract the actual\n /// return values.\n ///\n /// This enables contracts to interact with each other while maintaining privacy. This \"composability\" of private\n /// contract functions is a key feature of the Aztec network.\n ///\n /// If a user's transaction includes multiple private function calls, then by the design of Aztec, the following\n /// information will remain private[1]:\n /// - The function selectors and contract addresses of all private function calls will remain private, so an\n /// observer of the public mempool will not be able to look at a tx and deduce which private functions have been\n /// executed.\n /// - The arguments and return values of all private function calls will remain private.\n /// - The person who initiated the tx will remain private.\n /// - The notes and nullifiers and private logs that are emitted by all private function calls will (if designed\n /// well) not leak any user secrets, nor leak which functions have been executed.\n ///\n /// [1] Caveats: Some of these privacy guarantees depend on how app developers design their smart contracts. Some\n /// actions _can_ leak information, such as:\n /// - Calling an internal public function.\n /// - Calling a public function and not setting msg_sender to Option::none (feature not built yet - see github).\n /// - Calling any public function will always leak details about the nature of the transaction, so devs should be\n /// careful in their contract designs. If it can be done in a private function, then that will give the best\n /// privacy.\n /// - Not padding the side-effects of a tx to some standardized, uniform size. The kernel circuits can take hints\n /// to pad side-effects, so a wallet should be able to request for a particular amount of padding. Wallets should\n /// ideally agree on some standard.\n /// - Padding should include:\n /// - Padding the lengths of note & nullifier arrays\n /// - Padding private logs with random fields, up to some standardized size. See also:\n /// https://docs.aztec.network/developers/resources/considerations/privacy_considerations\n ///\n /// # Advanced\n /// * The call is added to the private call stack and executed by kernel circuits after this function completes\n /// * The called function can modify its own contract's private state\n /// * Side effects from the called function are included in this transaction\n /// * The call inherits the current transaction's context and gas limits\n ///\n pub fn call_private_function<let ArgsCount: u32>(\n &mut self,\n contract_address: AztecAddress,\n function_selector: FunctionSelector,\n args: [Field; ArgsCount],\n ) -> ReturnsHash {\n let args_hash = hash_args(args);\n execution_cache::store(args, args_hash);\n self.call_private_function_with_args_hash(contract_address, function_selector, args_hash, false)\n }\n\n /// Makes a read-only call to a private function on another contract.\n ///\n /// This is similar to Solidity's `staticcall`. The called function cannot modify state, emit L2->L2 messages, nor\n /// emit events. Any nested calls are constrained to also be staticcalls.\n ///\n /// See `call_private_function` for more general info on private function calls.\n ///\n /// # Arguments\n /// * `contract_address` - Address of the contract to call\n /// * `function_selector` - 4-byte identifier of the function to call\n /// * `args` - Array of arguments to pass to the called function\n ///\n /// # Returns\n /// * `ReturnsHash` - Hash of the called function's return values. Use `.get_preimage()` to extract the actual\n /// return values.\n ///\n pub fn static_call_private_function<let ArgsCount: u32>(\n &mut self,\n contract_address: AztecAddress,\n function_selector: FunctionSelector,\n args: [Field; ArgsCount],\n ) -> ReturnsHash {\n let args_hash = hash_args(args);\n execution_cache::store(args, args_hash);\n self.call_private_function_with_args_hash(contract_address, function_selector, args_hash, true)\n }\n\n /// Calls a private function that takes no arguments.\n ///\n /// This is a convenience function for calling private functions that don't require any input parameters. It's\n /// equivalent to `call_private_function` but slightly more efficient to use when no arguments are needed.\n ///\n /// # Arguments\n /// * `contract_address` - Address of the contract containing the function\n /// * `function_selector` - 4-byte identifier of the function to call\n ///\n /// # Returns\n /// * `ReturnsHash` - Hash of the called function's return values. Use `.get_preimage()` to extract the actual\n /// return values.\n ///\n pub fn call_private_function_no_args(\n &mut self,\n contract_address: AztecAddress,\n function_selector: FunctionSelector,\n ) -> ReturnsHash {\n self.call_private_function_with_args_hash(contract_address, function_selector, 0, false)\n }\n\n /// Makes a read-only call to a private function which takes no arguments.\n ///\n /// This combines the optimisation of `call_private_function_no_args` with the safety of\n /// `static_call_private_function`.\n ///\n /// # Arguments\n /// * `contract_address` - Address of the contract containing the function\n /// * `function_selector` - 4-byte identifier of the function to call\n ///\n /// # Returns\n /// * `ReturnsHash` - Hash of the called function's return values. Use `.get_preimage()` to extract the actual\n /// return values.\n ///\n pub fn static_call_private_function_no_args(\n &mut self,\n contract_address: AztecAddress,\n function_selector: FunctionSelector,\n ) -> ReturnsHash {\n self.call_private_function_with_args_hash(contract_address, function_selector, 0, true)\n }\n\n /// Low-level private function call.\n ///\n /// This is the underlying implementation used by all other private function call methods. Instead of taking raw\n /// arguments, it accepts a hash of the arguments.\n ///\n /// # Arguments\n /// * `contract_address` - Address of the contract containing the function\n /// * `function_selector` - 4-byte identifier of the function to call\n /// * `args_hash` - Pre-computed hash of the function arguments\n /// * `is_static_call` - Whether this should be a read-only call\n ///\n /// # Returns\n /// * `ReturnsHash` - Hash of the called function's return values\n ///\n pub fn call_private_function_with_args_hash(\n &mut self,\n contract_address: AztecAddress,\n function_selector: FunctionSelector,\n args_hash: Field,\n is_static_call: bool,\n ) -> ReturnsHash {\n let mut is_static_call = is_static_call | self.inputs.call_context.is_static_call;\n let start_side_effect_counter = self.side_effect_counter;\n\n // Safety: The oracle simulates the private call and returns the value of the side effects counter after\n // execution of the call (which means that end_side_effect_counter - start_side_effect_counter is the number of\n // side effects that took place), along with the hash of the return values. We validate these by requesting a\n // private kernel iteration in which the return values are constrained to hash to `returns_hash` and the side\n // effects counter to increment from start to end.\n let (end_side_effect_counter, returns_hash) = unsafe {\n call_private_function_internal(\n contract_address,\n function_selector,\n args_hash,\n start_side_effect_counter,\n is_static_call,\n )\n };\n\n self.private_call_requests.push(\n PrivateCallRequest {\n call_context: CallContext {\n msg_sender: self.this_address(),\n contract_address,\n function_selector,\n is_static_call,\n },\n args_hash,\n returns_hash,\n start_side_effect_counter,\n end_side_effect_counter,\n },\n );\n\n // TODO (fees) figure out why this crashes the prover and enable it we need this in order to pay fees inside\n // child call contexts assert(\n // (item.public_inputs.min_revertible_side_effect_counter == 0 as u32)\n // | (item.public_inputs.min_revertible_side_effect_counter\n // > self.min_revertible_side_effect_counter)\n // ); if item.public_inputs.min_revertible_side_effect_counter\n // > self.min_revertible_side_effect_counter { self.min_revertible_side_effect_counter =\n // item.public_inputs.min_revertible_side_effect_counter; }\n self.side_effect_counter = end_side_effect_counter + 1; // TODO: call `next_counter`\n // instead, for consistency\n ReturnsHash::new(returns_hash)\n }\n\n /// Enqueues a call to a public function to be executed later.\n ///\n /// Unlike private functions which execute immediately on the user's device, public function calls are \"enqueued\"\n /// and executed some time later by a block proposer.\n ///\n /// This means a public function cannot return any values back to a private function, because by the time the\n /// public function is being executed, the private function which called it has already completed execution. (In\n /// fact, the private function has been executed and proven, along with all other private function calls of the\n /// user's tx. A single proof of the tx has been submitted to the Aztec network, and some time later a proposer has\n /// picked the tx up from the mempool and begun executing all of the enqueued public functions).\n ///\n /// # Privacy warning Enqueueing a public function call is an inherently leaky action. Many interesting applications will require some interaction with public state, but smart contract developers should try to use public function calls sparingly, and carefully. _Internal_ public function calls are especially leaky, because they completely leak which private contract made the call. See also: https://docs.aztec.network/developers/resources/considerations/privacy_considerations\n ///\n /// # Arguments\n /// * `contract_address` - Address of the contract containing the function\n /// * `function_selector` - 4-byte identifier of the function to call\n /// * `args` - Array of arguments to pass to the public function\n /// * `hide_msg_sender` - the called function will see a \"null\" value for `msg_sender` if set to `true`\n ///\n pub fn call_public_function<let ArgsCount: u32>(\n &mut self,\n contract_address: AztecAddress,\n function_selector: FunctionSelector,\n args: [Field; ArgsCount],\n hide_msg_sender: bool,\n ) {\n let calldata = [function_selector.to_field()].concat(args);\n let calldata_hash = hash_calldata_array(calldata);\n execution_cache::store(calldata, calldata_hash);\n self.call_public_function_with_calldata_hash(contract_address, calldata_hash, false, hide_msg_sender)\n }\n\n /// Enqueues a read-only call to a public function.\n ///\n /// This is similar to Solidity's `staticcall`. The called function cannot modify state or emit events. Any nested\n /// calls are constrained to also be staticcalls.\n ///\n /// See also `call_public_function` for more important information about making private -> public function calls.\n ///\n /// # Arguments\n /// * `contract_address` - Address of the contract containing the function\n /// * `function_selector` - 4-byte identifier of the function to call\n /// * `args` - Array of arguments to pass to the public function\n /// * `hide_msg_sender` - the called function will see a \"null\" value for `msg_sender` if set to `true`\n ///\n pub fn static_call_public_function<let ArgsCount: u32>(\n &mut self,\n contract_address: AztecAddress,\n function_selector: FunctionSelector,\n args: [Field; ArgsCount],\n hide_msg_sender: bool,\n ) {\n let calldata = [function_selector.to_field()].concat(args);\n let calldata_hash = hash_calldata_array(calldata);\n execution_cache::store(calldata, calldata_hash);\n self.call_public_function_with_calldata_hash(contract_address, calldata_hash, true, hide_msg_sender)\n }\n\n /// Enqueues a call to a public function that takes no arguments.\n ///\n /// This is an optimisation for calling public functions that don't take any input parameters. It's otherwise\n /// equivalent to `call_public_function`.\n ///\n /// # Arguments\n /// * `contract_address` - Address of the contract containing the function\n /// * `function_selector` - 4-byte identifier of the function to call\n /// * `hide_msg_sender` - the called function will see a \"null\" value for `msg_sender` if set to `true`\n ///\n pub fn call_public_function_no_args(\n &mut self,\n contract_address: AztecAddress,\n function_selector: FunctionSelector,\n hide_msg_sender: bool,\n ) {\n let calldata_hash = hash_calldata_array([function_selector.to_field()]);\n self.call_public_function_with_calldata_hash(contract_address, calldata_hash, false, hide_msg_sender)\n }\n\n /// Enqueues a read-only call to a public function with no arguments.\n ///\n /// This combines the optimisation of `call_public_function_no_args` with the safety of\n /// `static_call_public_function`.\n ///\n /// # Arguments\n /// * `contract_address` - Address of the contract containing the function\n /// * `function_selector` - 4-byte identifier of the function to call\n /// * `hide_msg_sender` - the called function will see a \"null\" value for `msg_sender` if set to `true`\n ///\n pub fn static_call_public_function_no_args(\n &mut self,\n contract_address: AztecAddress,\n function_selector: FunctionSelector,\n hide_msg_sender: bool,\n ) {\n let calldata_hash = hash_calldata_array([function_selector.to_field()]);\n self.call_public_function_with_calldata_hash(contract_address, calldata_hash, true, hide_msg_sender)\n }\n\n /// Low-level public function call.\n ///\n /// This is the underlying implementation used by all other public function call methods. Instead of taking raw\n /// arguments, it accepts a hash of the arguments.\n ///\n /// Advanced function: Most developers should use `call_public_function` or `static_call_public_function` instead.\n /// This function is exposed for performance optimization and advanced use cases.\n ///\n /// # Arguments\n /// * `contract_address` - Address of the contract containing the function\n /// * `calldata_hash` - Hash of the function calldata\n /// * `is_static_call` - Whether this should be a read-only call\n /// * `hide_msg_sender` - the called function will see a \"null\" value for `msg_sender` if set to `true`\n ///\n pub fn call_public_function_with_calldata_hash(\n &mut self,\n contract_address: AztecAddress,\n calldata_hash: Field,\n is_static_call: bool,\n hide_msg_sender: bool,\n ) {\n let counter = self.next_counter();\n\n let mut is_static_call = is_static_call | self.inputs.call_context.is_static_call;\n\n notify_enqueued_public_function_call(contract_address, calldata_hash, counter, is_static_call);\n\n let msg_sender = if hide_msg_sender {\n NULL_MSG_SENDER_CONTRACT_ADDRESS\n } else {\n self.this_address()\n };\n\n let call_request = PublicCallRequest { msg_sender, contract_address, is_static_call, calldata_hash };\n\n self.public_call_requests.push(Counted::new(call_request, counter));\n }\n\n /// Enqueues a public function call, and designates it to be the teardown function for this tx. Only one teardown\n /// function call can be made by a tx.\n ///\n /// Niche function: Only wallet developers and paymaster contract developers (aka Fee-payment contracts) will need\n /// to make use of this function.\n ///\n /// Aztec supports a three-phase execution model: setup, app logic, teardown. The phases exist to enable a fee\n /// payer to take on the risk of paying a transaction fee, safe in the knowledge that their payment (in whatever\n /// token or method the user chooses) will succeed, regardless of whether the app logic will succeed. The \"setup\"\n /// phase ensures the fee payer has sufficient balance to pay the proposer their fees. The teardown phase is\n /// primarily intended to: calculate exactly how much the user owes, based on gas consumption, and refund the user\n /// any change.\n ///\n /// Note: in some cases, the cost of refunding the user (i.e. DA costs of tx side-effects) might exceed the refund\n /// amount. For app logic with fairly stable and predictable gas consumption, a material refund amount is unlikely.\n /// For app logic with unpredictable gas consumption, a refund might be important to the user (e.g. if a hefty\n /// function reverts very early). Wallet/FPC/Paymaster developers should be mindful of this.\n ///\n /// # Arguments\n /// * `contract_address` - Address of the contract containing the teardown function\n /// * `function_selector` - 4-byte identifier of the function to call\n /// * `args` - An array of fields to pass to the function.\n /// * `hide_msg_sender` - the called function will see a \"null\" value for `msg_sender` if set to `true`\n pub fn set_public_teardown_function<let ArgsCount: u32>(\n &mut self,\n contract_address: AztecAddress,\n function_selector: FunctionSelector,\n args: [Field; ArgsCount],\n hide_msg_sender: bool,\n ) {\n let calldata = [function_selector.to_field()].concat(args);\n let calldata_hash = hash_calldata_array(calldata);\n execution_cache::store(calldata, calldata_hash);\n self.set_public_teardown_function_with_calldata_hash(contract_address, calldata_hash, false, hide_msg_sender)\n }\n\n /// Low-level function to set the public teardown function.\n ///\n /// This is the underlying implementation for setting the teardown function call that will execute at the end of\n /// the transaction. Instead of taking raw arguments, it accepts a hash of the arguments.\n ///\n /// Advanced function: Most developers should use `set_public_teardown_function` instead.\n ///\n /// # Arguments\n /// * `contract_address` - Address of the contract containing the teardown function\n /// * `calldata_hash` - Hash of the function calldata\n /// * `is_static_call` - Whether this should be a read-only call\n /// * `hide_msg_sender` - the called function will see a \"null\" value for `msg_sender` if set to `true`\n ///\n pub fn set_public_teardown_function_with_calldata_hash(\n &mut self,\n contract_address: AztecAddress,\n calldata_hash: Field,\n is_static_call: bool,\n hide_msg_sender: bool,\n ) {\n let counter = self.next_counter();\n\n let mut is_static_call = is_static_call | self.inputs.call_context.is_static_call;\n\n notify_set_public_teardown_function_call(contract_address, calldata_hash, counter, is_static_call);\n\n let msg_sender = if hide_msg_sender {\n NULL_MSG_SENDER_CONTRACT_ADDRESS\n } else {\n self.this_address()\n };\n\n self.public_teardown_call_request =\n PublicCallRequest { msg_sender, contract_address, is_static_call, calldata_hash };\n }\n\n /// Increments the side-effect counter.\n ///\n /// Very low-level function.\n ///\n /// # Advanced\n ///\n /// Every side-effect of a private function is given a \"side-effect counter\", based on when it is created. This\n /// PrivateContext is in charge of assigning the counters.\n ///\n /// The reason we have side-effect counters is complicated. Consider this illustrative pseudocode of inter-contract\n /// function calls:\n /// ```\n /// contract A {\n /// let x = 5; // pseudocode for storage var x.\n /// fn a1 {\n /// read x; // value: 5, counter: 1.\n /// x = x + 1;\n /// write x; // value: 6, counter: 2.\n ///\n /// B.b(); // start_counter: 2, end_counter: 4\n ///\n /// read x; // value: 36, counter: 5.\n /// x = x + 1;\n /// write x; // value: 37, counter: 6.\n /// }\n ///\n /// fn a2 {\n /// read x; // value: 6, counter: 3.\n /// x = x * x;\n /// write x; // value: 36, counter: 4.\n /// }\n /// }\n ///\n /// contract B {\n /// fn b() {\n /// A.a2();\n /// }\n /// }\n /// ```\n ///\n /// Suppose a1 is the first function called. The comments show the execution counter of each side-effect, and what\n /// the new value of `x` is.\n ///\n /// These (private) functions are processed by Aztec's kernel circuits in an order that is different from execution\n /// order: All of A.a1 is proven before B.b is proven, before A.a2 is proven. So when we're in the 2nd execution\n /// frame of A.a1 (after the call to B.b), the circuit needs to justify why x went from being `6` to `36`. But the\n /// circuit doesn't know why, and given the order of proving, the kernel hasn't _seen_ a value of 36 get written\n /// yet. The kernel needs to track big arrays of all side-effects of all private functions in a tx. Then, as it\n /// recurses and processes B.b(), it will eventually see a value of 36 get written.\n ///\n /// Suppose side-effect counters weren't exposed: The kernel would only see this ordering (in order of proof\n /// verification): [ A.a1.read, A.a1.write, A.a1.read, A.a1.write, A.a2.read, A.a2.write ]\n /// [ 5, 6, 36, 37, 6, 36 ]\n /// The kernel wouldn't know _when_ B.b() was called within A.a1(), because it can't see what's going on within an\n /// app circuit. So the kernel wouldn't know that the ordering of reads and writes should actually be: [ A.a1.read,\n /// A.a1.write, A.a2.read, A.a2.write, A.a1.read, A.a1.write ]\n /// [ 5, 6, 6, 36, 36, 37 ]\n ///\n /// And so, we introduced side-effect counters: every private function must assign side-effect counters alongside\n /// every side-effect that it emits, and also expose to the kernel the counters that it started and ended with.\n /// This gives the kernel enough information to arrange all side-effects in the correct order. It can then catch\n /// (for example) if a function tries to read state before it has been written (e.g. if A.a2() maliciously tried to\n /// read a value of x=37) (e.g. if A.a1() maliciously tried to read x=6).\n ///\n /// If a malicious app contract _lies_ and does not count correctly:\n /// - It cannot lie about its start and end counters because the kernel will catch this.\n /// - It _could_ lie about its intermediate counters:\n /// - 1. It could not increment its side-effects correctly\n /// - 2. It could label its side-effects with counters outside of its start and end counters' range. The kernel\n /// will catch 2. The kernel will not catch 1., but this would only cause corruption to the private state of the\n /// malicious contract, and not any other contracts (because a contract can only modify its own state). If a \"good\"\n /// contract is given _read access_ to a maliciously-counting contract (via an external getter function, or by\n /// reading historic state from the archive tree directly), and they then make state changes to their _own_ state\n /// accordingly, that could be dangerous. Developers should be mindful not to trust the claimed innards of external\n /// contracts unless they have audited/vetted the contracts including vetting the side-effect counter\n /// incrementation. This is a similar paradigm to Ethereum smart contract development: you must vet external\n /// contracts that your contract relies upon, and you must not make any presumptions about their claimed behaviour.\n /// (Hopefully if a contract imports a version of aztec-nr, we will get contract verification tooling that can\n /// validate the authenticity of the imported aztec-nr package, and hence infer that the side- effect counting will\n /// be correct, without having to re-audit such logic for every contract).\n ///\n fn next_counter(&mut self) -> u32 {\n let counter = self.side_effect_counter;\n self.side_effect_counter += 1;\n counter\n }\n}\n\nimpl Empty for PrivateContext {\n fn empty() -> Self {\n PrivateContext {\n inputs: PrivateContextInputs::empty(),\n side_effect_counter: 0 as u32,\n min_revertible_side_effect_counter: 0 as u32,\n is_fee_payer: false,\n args_hash: 0,\n return_hash: 0,\n include_by_timestamp: 0,\n note_hash_read_requests: BoundedVec::new(),\n nullifier_read_requests: BoundedVec::new(),\n key_validation_requests_and_generators: BoundedVec::new(),\n note_hashes: BoundedVec::new(),\n nullifiers: BoundedVec::new(),\n private_call_requests: BoundedVec::new(),\n public_call_requests: BoundedVec::new(),\n public_teardown_call_request: PublicCallRequest::empty(),\n l2_to_l1_msgs: BoundedVec::new(),\n anchor_block_header: BlockHeader::empty(),\n private_logs: BoundedVec::new(),\n contract_class_logs_hashes: BoundedVec::new(),\n last_key_validation_requests: [Option::none(); NUM_KEY_TYPES],\n expected_non_revertible_side_effect_counter: 0,\n expected_revertible_side_effect_counter: 0,\n }\n }\n}\n"
|
|
2925
|
+
"path": "/home/aztec-dev/aztec-packages/noir-projects/noir-contracts/contracts/protocol/aztec_sublib/src/nullifier/utils.nr",
|
|
2926
|
+
"source": "use crate::{context::NullifierExistenceRequest, oracle::nullifiers::is_nullifier_pending};\n\nuse crate::protocol::{address::aztec_address::AztecAddress, hash::compute_siloed_nullifier};\n\n/// Returns the [NullifierExistenceRequest] used to prove a nullifier exists.\npub fn compute_nullifier_existence_request(\n unsiloed_nullifier: Field,\n contract_address: AztecAddress,\n) -> NullifierExistenceRequest {\n let pending_read_request =\n NullifierExistenceRequest::for_pending(unsiloed_nullifier, contract_address);\n\n let siloed_nullifier = compute_siloed_nullifier(contract_address, unsiloed_nullifier);\n let settled_read_request = NullifierExistenceRequest::for_settled(siloed_nullifier);\n\n // Safety: This is a hint to check whether we are reading a pending or settled nullifier. The chosen read request\n // will be validated by the kernel. Failure to provide a correct hint will cause the read request validation to\n // fail.\n let should_use_pending_read_request =\n unsafe { is_nullifier_pending(unsiloed_nullifier, contract_address) };\n\n if should_use_pending_read_request {\n pending_read_request\n } else {\n settled_read_request\n }\n}\n"
|
|
3630
2927
|
},
|
|
3631
2928
|
"71": {
|
|
3632
|
-
"path": "/home/aztec-dev/aztec-packages/noir-projects/
|
|
3633
|
-
"source": "use crate::{\n context::gas::GasOpts,\n hash::{\n compute_l1_to_l2_message_hash, compute_l1_to_l2_message_nullifier, compute_secret_hash,\n compute_siloed_nullifier,\n },\n oracle::avm,\n};\nuse crate::protocol::{\n abis::function_selector::FunctionSelector,\n address::{AztecAddress, EthAddress},\n constants::{MAX_U32_VALUE, NULL_MSG_SENDER_CONTRACT_ADDRESS},\n traits::{Empty, FromField, Packable, Serialize, ToField},\n};\n\n/// # PublicContext\n///\n/// The **main interface** between an #[external(\"public\")] function and the Aztec blockchain.\n///\n/// An instance of the PublicContext is initialized automatically at the outset of every public function, within the\n/// #[external(\"public\")] macro, so you'll never need to consciously instantiate this yourself.\n///\n/// The instance is always named `context`, and it will always be available within the body of every\n/// #[external(\"public\")] function in your smart contract.\n///\n/// Typical usage for a smart contract developer will be to call getter methods of the PublicContext.\n///\n/// _Pushing_ data and requests to the context is mostly handled within aztec-nr's own functions, so typically a smart\n/// contract developer won't need to call any setter methods directly.\n///\n/// ## Responsibilities\n/// - Exposes contextual data to a public function:\n/// - Data relating to how this public function was called:\n/// - msg_sender, this_address\n/// - Data relating to the current blockchain state:\n/// - timestamp, block_number, chain_id, version\n/// - Gas and fee information\n/// - Provides state access:\n/// - Read/write public storage (key-value mapping)\n/// - Check existence of notes and nullifiers (Some patterns use notes & nullifiers to store public (not private)\n/// information)\n/// - Enables consumption of L1->L2 messages.\n/// - Enables calls to other public smart contract functions:\n/// - Writes data to the blockchain:\n/// - Updates to public state variables\n/// - New public logs (for events)\n/// - New L2->L1 messages\n/// - New notes & nullifiers (E.g. pushing public info to notes/nullifiers, or for completing \"partial notes\")\n///\n/// ## Key Differences from Private Execution\n///\n/// Unlike private functions -- which are executed on the user's device and which can only reference historic state --\n/// public functions are executed by a block proposer and are executed \"live\" on the _current_ tip of the chain. This\n/// means public functions can:\n/// - Read and write _current_ public state\n/// - Immediately see the effects of earlier transactions in the same block\n///\n/// Also, public functions are executed within a zkVM (the \"AVM\"), so that they can _revert_ whilst still ensuring\n/// payment to the proposer and prover. (Private functions cannot revert: they either succeed, or they cannot be\n/// included).\n///\n/// ## Optimising Public Functions\n///\n/// Using the AVM to execute public functions means they compile down to \"AVM bytecode\" instead of the ACIR that\n/// private functions (standalone circuits) compile to. Therefore the approach to optimising a public function is\n/// fundamentally different from optimising a public function.\n///\npub struct PublicContext {\n pub args_hash: Option<Field>,\n pub compute_args_hash: fn() -> Field,\n}\n\nimpl Eq for PublicContext {\n fn eq(self, other: Self) -> bool {\n (self.args_hash == other.args_hash)\n // Can't compare the function compute_args_hash\n }\n}\n\nimpl PublicContext {\n /// Creates a new PublicContext instance.\n ///\n /// Low-level function: This is called automatically by the #[external(\"public\")] macro, so you shouldn't need to\n /// be called directly by smart contract developers.\n ///\n /// # Arguments\n /// * `compute_args_hash` - Function to compute the args_hash\n ///\n /// # Returns\n /// * A new PublicContext instance\n ///\n pub fn new(compute_args_hash: fn() -> Field) -> Self {\n PublicContext { args_hash: Option::none(), compute_args_hash }\n }\n\n /// Emits a _public_ log that will be visible onchain to everyone.\n ///\n /// # Arguments\n /// * `log` - The data to log, must implement Serialize trait\n ///\n pub fn emit_public_log<T>(_self: Self, log: T)\n where\n T: Serialize,\n {\n // Safety: AVM opcodes are constrained by the AVM itself\n unsafe { avm::emit_public_log(Serialize::serialize(log).as_vector()) };\n }\n\n /// Checks if a given note hash exists in the note hash tree at a particular leaf_index.\n ///\n /// # Arguments\n /// * `note_hash` - The note hash to check for existence\n /// * `leaf_index` - The index where the note hash should be located\n ///\n /// # Returns\n /// * `bool` - True if the note hash exists at the specified index\n ///\n pub fn note_hash_exists(_self: Self, note_hash: Field, leaf_index: u64) -> bool {\n // Safety: AVM opcodes are constrained by the AVM itself\n unsafe { avm::note_hash_exists(note_hash, leaf_index) } == 1\n }\n\n /// Checks if a specific L1-to-L2 message exists in the L1-to-L2 message tree at a particular leaf index.\n ///\n /// Common use cases include token bridging, cross-chain governance, and triggering L2 actions based on L1 events.\n ///\n /// This function should be called before attempting to consume an L1-to-L2 message.\n ///\n /// # Arguments\n /// * `msg_hash` - Hash of the L1-to-L2 message to check\n /// * `msg_leaf_index` - The index where the message should be located\n ///\n /// # Returns\n /// * `bool` - True if the message exists at the specified index\n ///\n /// # Advanced\n /// * Uses the AVM l1_to_l2_msg_exists opcode for tree lookup\n /// * Messages are copied from L1 Inbox to L2 by block proposers\n ///\n pub fn l1_to_l2_msg_exists(_self: Self, msg_hash: Field, msg_leaf_index: Field) -> bool {\n // Safety: AVM opcodes are constrained by the AVM itself TODO(alvaro): Make l1l2msg leaf index a u64 upstream\n unsafe { avm::l1_to_l2_msg_exists(msg_hash, msg_leaf_index as u64) } == 1\n }\n\n /// Returns `true` if an `unsiloed_nullifier` has been emitted by `contract_address`.\n ///\n /// Note that unsiloed nullifiers are not the actual values stored in the nullifier tree: they are first siloed via\n /// [crate::hash::compute_siloed_nullifier] with the emitting contract's address.\n ///\n /// ## Use Cases\n ///\n /// Nullifiers are typically used as a _privacy-preserving_ record of a one-time action, but they can also be used\n /// to efficiently record _public_ one-time actions as well. This is cheaper than using public storage, and has the\n /// added benefit of the nullifier being emittable from a private function.\n ///\n /// An example is to check whether a contract has been published: we emit a nullifier that is deterministic and\n /// which has a _public_ preimage.\n ///\n /// ## Public vs Private\n ///\n /// In general, it is unsafe to check for nullifier non-existence in private, as that will not consider the\n /// possibility of the nullifier having been emitted in any transaction between the anchor block and the inclusion\n /// block. Private functions instead prove existence via [crate::context::PrivateContext::assert_nullifier_exists]\n /// and 'prove' non-existence by _emitting_ the nullifer, which would cause the transaction to fail if the\n /// nullifier existed.\n ///\n /// This is not the case in public functions, which do have access to the tip of the blockchain and so can reliably\n /// prove whether a nullifier exists or not.\n ///\n /// ## Safety\n ///\n /// While it is safe to rely on this function's return value to determine if a nullifier exists or not, it is often\n /// **not** safe to infer additional information from that. In particular, it is **unsafe** to infer that the\n /// existence of a nullifier emitted from a private function implies that all other side-effects of said private\n /// execution have been completed, more concretely that any enqueued public calls have been executed.\n ///\n /// This is because all private transaction effects are committed _before_ enqueued public functions are run (in\n /// order to not reveal detailed timing information about the transaction), so it is possible to observe a\n /// nullifier that was emitted alongside the enqueuing of a public call **before** said call has been completed.\n ///\n /// ## Cost\n ///\n /// This emits the `CHECKNULLIFIEREXISTS` opcode, which conceptually performs a merkle inclusion proof on the\n /// nullifier tree (both when the nullifier exists and when it doesn't).\n pub fn nullifier_exists_unsafe(_self: Self, unsiloed_nullifier: Field, contract_address: AztecAddress) -> bool {\n let siloed_nullifier = compute_siloed_nullifier(contract_address, unsiloed_nullifier);\n // Safety: AVM opcodes are constrained by the AVM itself\n unsafe { avm::nullifier_exists(siloed_nullifier) } == 1\n }\n\n /// Consumes a message sent from Ethereum (L1) to Aztec (L2) -- effectively marking it as \"read\".\n ///\n /// Use this function if you only want the message to ever be \"referred to\" once. Once consumed using this method,\n /// the message cannot be consumed again, because a nullifier is emitted. If your use case wants for the message to\n /// be read unlimited times, then you can always read any historic message from the L1-to-L2 messages tree, using\n /// the `l1_to_l2_msg_exists` method. Messages never technically get deleted from that tree.\n ///\n /// The message will first be inserted into an Aztec \"Inbox\" smart contract on L1. It will not be available for\n /// consumption immediately. Messages get copied-over from the L1 Inbox to L2 by the next Proposer in batches. So\n /// you will need to wait until the messages are copied before you can consume them.\n ///\n /// # Arguments\n /// * `content` - The message content that was sent from L1\n /// * `secret` - Secret value used for message privacy (if needed)\n /// * `sender` - Ethereum address that sent the message\n /// * `leaf_index` - Index of the message in the L1-to-L2 message tree\n ///\n /// # Advanced\n /// * Validates message existence in the L1-to-L2 message tree\n /// * Prevents double-consumption by emitting a nullifier\n /// * Message hash is computed from all parameters + chain context\n /// * Will revert if message doesn't exist or was already consumed\n ///\n pub fn consume_l1_to_l2_message(self: Self, content: Field, secret: Field, sender: EthAddress, leaf_index: Field) {\n let secret_hash = compute_secret_hash(secret);\n let message_hash = compute_l1_to_l2_message_hash(\n sender,\n self.chain_id(),\n /*recipient=*/\n self.this_address(),\n self.version(),\n content,\n secret_hash,\n leaf_index,\n );\n let nullifier = compute_l1_to_l2_message_nullifier(message_hash, secret);\n\n assert(!self.nullifier_exists_unsafe(nullifier, self.this_address()), \"L1-to-L2 message is already nullified\");\n assert(self.l1_to_l2_msg_exists(message_hash, leaf_index), \"Tried to consume nonexistent L1-to-L2 message\");\n\n self.push_nullifier(nullifier);\n }\n\n /// Sends an \"L2 -> L1 message\" from this function (Aztec, L2) to a smart contract on Ethereum (L1). L1 contracts\n /// which are designed to send/receive messages to/from Aztec are called \"Portal Contracts\".\n ///\n /// Common use cases include withdrawals, cross-chain asset transfers, and triggering L1 actions based on L2 state\n /// changes.\n ///\n /// The message will be inserted into an Aztec \"Outbox\" contract on L1, when this transaction's block is proposed\n /// to L1. Sending the message will not result in any immediate state changes in the target portal contract. The\n /// message will need to be manually consumed from the Outbox through a separate Ethereum transaction: a user will\n /// need to call a function of the portal contract -- a function specifically designed to make a call to the Outbox\n /// to consume the message. The message will only be available for consumption once the _epoch_ proof has been\n /// submitted. Given that there are multiple Aztec blocks within an epoch, it might take some time for this epoch\n /// proof to be submitted -- especially if the block was near the start of an epoch.\n ///\n /// # Arguments\n /// * `recipient` - Ethereum address that will receive the message\n /// * `content` - Message content (32 bytes as a Field element)\n ///\n pub fn message_portal(_self: Self, recipient: EthAddress, content: Field) {\n // Safety: AVM opcodes are constrained by the AVM itself\n unsafe { avm::send_l2_to_l1_msg(recipient, content) };\n }\n\n /// Calls a public function on another contract.\n ///\n /// Will revert if the called function reverts or runs out of gas.\n ///\n /// # Arguments\n /// * `contract_address` - Address of the contract to call\n /// * `function_selector` - Function to call on the target contract\n /// * `args` - Arguments to pass to the function\n /// * `gas_opts` - An optional allocation of gas to the called function.\n ///\n /// # Returns\n /// * `[Field]` - Return data from the called function\n ///\n pub unconstrained fn call_public_function<let N: u32>(\n _self: Self,\n contract_address: AztecAddress,\n function_selector: FunctionSelector,\n args: [Field; N],\n gas_opts: GasOpts,\n ) -> [Field] {\n let calldata = [function_selector.to_field()].concat(args);\n\n avm::call(\n gas_opts.l2_gas.unwrap_or(MAX_U32_VALUE),\n gas_opts.da_gas.unwrap_or(MAX_U32_VALUE),\n contract_address,\n calldata,\n );\n // Use success_copy to determine whether the call succeeded\n let success = avm::success_copy();\n\n let result_data = avm::returndata_copy(0, avm::returndata_size());\n if !success {\n // Rethrow the revert data.\n avm::revert(result_data);\n }\n result_data\n }\n\n /// Makes a read-only call to a public function on another contract.\n ///\n /// This is similar to Solidity's `staticcall`. The called function cannot modify state or emit events. Any nested\n /// calls are constrained to also be staticcalls.\n ///\n /// Useful for querying data from other contracts safely.\n ///\n /// Will revert if the called function reverts or runs out of gas.\n ///\n /// # Arguments\n /// * `contract_address` - Address of the contract to call\n /// * `function_selector` - Function to call on the target contract\n /// * `args` - Array of arguments to pass to the called function\n /// * `gas_opts` - An optional allocation of gas to the called function.\n ///\n /// # Returns\n /// * `[Field]` - Return data from the called function\n ///\n pub unconstrained fn static_call_public_function<let N: u32>(\n _self: Self,\n contract_address: AztecAddress,\n function_selector: FunctionSelector,\n args: [Field; N],\n gas_opts: GasOpts,\n ) -> [Field] {\n let calldata = [function_selector.to_field()].concat(args);\n\n avm::call_static(\n gas_opts.l2_gas.unwrap_or(MAX_U32_VALUE),\n gas_opts.da_gas.unwrap_or(MAX_U32_VALUE),\n contract_address,\n calldata,\n );\n // Use success_copy to determine whether the call succeeded\n let success = avm::success_copy();\n\n let result_data = avm::returndata_copy(0, avm::returndata_size());\n if !success {\n // Rethrow the revert data.\n avm::revert(result_data);\n }\n result_data\n }\n\n /// Adds a new note hash to the Aztec blockchain's global Note Hash Tree.\n ///\n /// Notes are ordinarily constructed and emitted by _private_ functions, to ensure that both the content of the\n /// note, and the contract that emitted the note, stay private.\n ///\n /// There are however some useful patterns whereby a note needs to contain _public_ data. The ability to push a new\n /// note_hash from a _public_ function means that notes can be injected with public data immediately -- as soon as\n /// the public value is known. The slower alternative would be to submit a follow-up transaction so that a private\n /// function can inject the data. Both are possible on Aztec.\n ///\n /// Search \"Partial Note\" for a very common pattern which enables a note to be \"partially\" populated with some data\n /// in a _private_ function, and then later \"completed\" with some data in a public function.\n ///\n /// # Arguments\n /// * `note_hash` - The hash of the note to add to the tree\n ///\n /// # Advanced\n /// * The note hash will be siloed with the contract address by the protocol\n ///\n pub fn push_note_hash(_self: Self, note_hash: Field) {\n // Safety: AVM opcodes are constrained by the AVM itself\n unsafe { avm::emit_note_hash(note_hash) };\n }\n\n /// Adds a new nullifier to the Aztec blockchain's global Nullifier Tree.\n ///\n /// Whilst nullifiers are primarily intended as a _privacy-preserving_ record of a one-time action, they can also\n /// be used to efficiently record _public_ one-time actions too. Hence why you're seeing this function within the\n /// PublicContext. An example is to check whether a contract has been published: we emit a nullifier that is\n /// deterministic, but whose preimage is _not_ private.\n ///\n /// # Arguments\n /// * `nullifier` - A unique field element that represents the consumed state\n ///\n /// # Advanced\n /// * Nullifier is immediately added to the global nullifier tree\n /// * Emitted nullifiers are immediately visible to all subsequent transactions in the same block\n /// * Automatically siloed with the contract address by the protocol\n /// * Used for preventing double-spending and ensuring one-time actions\n ///\n pub fn push_nullifier(_self: Self, nullifier: Field) {\n // Safety: AVM opcodes are constrained by the AVM itself\n unsafe { avm::emit_nullifier(nullifier) };\n }\n\n /// Returns the address of the current contract being executed.\n ///\n /// This is equivalent to `address(this)` in Solidity (hence the name). Use this to identify the current contract's\n /// address, commonly needed for access control or when interacting with other contracts.\n ///\n /// # Returns\n /// * `AztecAddress` - The contract address of the current function being executed.\n ///\n pub fn this_address(_self: Self) -> AztecAddress {\n // Safety: AVM opcodes are constrained by the AVM itself\n unsafe {\n avm::address()\n }\n }\n\n /// Returns the contract address that initiated this function call.\n ///\n /// This is similar to `msg.sender` in Solidity (hence the name).\n ///\n /// Important Note: If the calling function is a _private_ function, then it had the option of hiding its address\n /// when enqueuing this public function call. In such cases, this method will return `Option<AztecAddress>::none`.\n /// If the calling function is a _public_ function, it will always return an `Option<AztecAddress>::some` (i.e. a\n /// non-null value).\n ///\n /// # Returns\n /// * `Option<AztecAddress>` - The address of the smart contract that called this function (be it an app contract\n /// or a user's account contract).\n ///\n /// # Advanced\n /// * Value is provided by the AVM sender opcode\n /// * In nested calls, this is the immediate caller, not the original transaction sender\n ///\n pub fn maybe_msg_sender(_self: Self) -> Option<AztecAddress> {\n // Safety: AVM opcodes are constrained by the AVM itself\n let maybe_msg_sender = unsafe { avm::sender() };\n if maybe_msg_sender == NULL_MSG_SENDER_CONTRACT_ADDRESS {\n Option::none()\n } else {\n Option::some(maybe_msg_sender)\n }\n }\n\n /// Returns the function selector of the currently-executing function.\n ///\n /// This is similar to `msg.sig` in Solidity, returning the first 4 bytes of the function signature.\n ///\n /// # Returns\n /// * `FunctionSelector` - The 4-byte function identifier\n ///\n /// # Advanced\n /// * Extracted from the first element of calldata\n /// * Used internally for function dispatch in the AVM\n ///\n pub fn selector(_self: Self) -> FunctionSelector {\n // The selector is the first element of the calldata when calling a public function through dispatch.\n // Safety: AVM opcodes are constrained by the AVM itself.\n let raw_selector: [Field; 1] = unsafe { avm::calldata_copy(0, 1) };\n FunctionSelector::from_field(raw_selector[0])\n }\n\n /// Returns the hash of the arguments passed to the current function.\n ///\n /// Very low-level function: The #[external(\"public\")] macro uses this internally. Smart contract developers\n /// typically won't need to access this directly as arguments are automatically made available.\n ///\n /// # Returns\n /// * `Field` - Hash of the function arguments\n ///\n pub fn get_args_hash(mut self) -> Field {\n if !self.args_hash.is_some() {\n self.args_hash = Option::some((self.compute_args_hash)());\n }\n\n self.args_hash.unwrap_unchecked()\n }\n\n /// Returns the \"transaction fee\" for the current transaction. This is the final tx fee that will be deducted from\n /// the fee_payer's \"fee-juice\" balance (in the protocol's Base Rollup circuit).\n ///\n /// # Returns\n /// * `Field` - The actual, final cost of the transaction, taking into account: the actual gas used during the\n /// setup and app-logic phases, and the fixed amount of gas that's been allocated by the user for the teardown\n /// phase. I.e. effectiveL2FeePerGas * l2GasUsed + effectiveDAFeePerGas * daGasUsed\n ///\n /// This will return `0` during the \"setup\" and \"app-logic\" phases of tx execution (because the final tx fee is not\n /// known at that time). This will only return a nonzero value during the \"teardown\" phase of execution, where the\n /// final tx fee can actually be computed.\n ///\n /// Regardless of _when_ this function is called during the teardown phase, it will always return the same final tx\n /// fee value. The teardown phase does not consume a variable amount of gas: it always consumes a pre-allocated\n /// amount of gas, as specified by the user when they generate their tx.\n ///\n pub fn transaction_fee(_self: Self) -> Field {\n // Safety: AVM opcodes are constrained by the AVM itself\n unsafe {\n avm::transaction_fee()\n }\n }\n\n /// Returns the chain ID of the current network.\n ///\n /// This is similar to `block.chainid` in Solidity. Returns the unique identifier for the blockchain network this\n /// transaction is executing on.\n ///\n /// Helps prevent cross-chain replay attacks. Useful if implementing multi-chain contract logic.\n ///\n /// # Returns\n /// * `Field` - The chain ID as a field element\n ///\n pub fn chain_id(_self: Self) -> Field {\n // Safety: AVM opcodes are constrained by the AVM itself\n unsafe {\n avm::chain_id()\n }\n }\n\n /// Returns the Aztec protocol version that this transaction is executing under. Different versions may have\n /// different rules, opcodes, or cryptographic primitives.\n ///\n /// This is similar to how Ethereum has different EVM versions.\n ///\n /// Useful for forward/backward compatibility checks\n ///\n /// Not to be confused with contract versions; this is the protocol version.\n ///\n /// # Returns\n /// * `Field` - The protocol version as a field element\n ///\n pub fn version(_self: Self) -> Field {\n // Safety: AVM opcodes are constrained by the AVM itself\n unsafe {\n avm::version()\n }\n }\n /// Returns the current block number.\n ///\n /// This is similar to `block.number` in Solidity.\n ///\n /// Note: the current block number is only available within a public function (as opposed to a private function).\n ///\n /// Note: the time intervals between blocks should not be relied upon as being consistent:\n /// - Timestamps of blocks fall within a range, rather than at exact regular intervals.\n /// - Slots can be missed.\n /// - Protocol upgrades can completely change the intervals between blocks (and indeed the current roadmap plans to\n /// reduce the time between blocks, eventually). Use `context.timestamp()` for more-reliable time-based logic.\n ///\n /// # Returns\n /// * `u32` - The current block number\n ///\n pub fn block_number(_self: Self) -> u32 {\n // Safety: AVM opcodes are constrained by the AVM itself\n unsafe {\n avm::block_number()\n }\n }\n\n /// Returns the timestamp of the current block.\n ///\n /// This is similar to `block.timestamp` in Solidity.\n ///\n /// All functions of all transactions in a block share the exact same timestamp (even though technically each\n /// transaction is executed one-after-the-other).\n ///\n /// Important note: Timestamps of Aztec blocks are not at reliably-fixed intervals. The proposer of the block has\n /// some flexibility to choose a timestamp which is in a valid _range_: Obviously the timestamp of this block must\n /// be strictly greater than that of the previous block, and must must be less than the timestamp of whichever\n /// ethereum block the aztec block is proposed to. Furthermore, if the timestamp is not deemed close enough to the\n /// actual current time, the committee of validators will not attest to the block.\n ///\n /// # Returns\n /// * `u64` - Unix timestamp in seconds\n ///\n pub fn timestamp(_self: Self) -> u64 {\n // Safety: AVM opcodes are constrained by the AVM itself\n unsafe {\n avm::timestamp()\n }\n }\n\n /// Returns the fee per unit of L2 gas for this transaction (aka the \"L2 gas price\"), as chosen by the user.\n ///\n /// L2 gas covers the cost of executing public functions and handling side-effects within the AVM.\n ///\n /// # Returns\n /// * `u128` - Fee per unit of L2 gas\n ///\n /// Wallet developers should be mindful that the choice of gas price (which is publicly visible) can leak\n /// information about the user, e.g.:\n /// - which wallet software the user is using;\n /// - the amount of time which has elapsed from the time the user's wallet chose a gas price (at the going rate),\n /// to the time of tx submission. This can give clues about the proving time, and hence the nature of the tx.\n /// - the urgency of the transaction (which is kind of unavoidable, if the tx is indeed urgent).\n /// - the wealth of the user.\n /// - the exact user (if the gas price is explicitly chosen by the user to be some unique number like 0.123456789,\n /// or their favorite number). Wallet devs might wish to consider fuzzing the choice of gas price.\n ///\n pub fn min_fee_per_l2_gas(_self: Self) -> u128 {\n // Safety: AVM opcodes are constrained by the AVM itself\n unsafe {\n avm::min_fee_per_l2_gas()\n }\n }\n\n /// Returns the fee per unit of DA (Data Availability) gas (aka the \"DA gas price\").\n ///\n /// DA gas covers the cost of making transaction data available on L1.\n ///\n /// See the warning in `min_fee_per_l2_gas` for how gas prices can be leaky.\n ///\n /// # Returns\n /// * `u128` - Fee per unit of DA gas\n ///\n pub fn min_fee_per_da_gas(_self: Self) -> u128 {\n // Safety: AVM opcodes are constrained by the AVM itself\n unsafe {\n avm::min_fee_per_da_gas()\n }\n }\n\n /// Returns the remaining L2 gas available for this transaction.\n ///\n /// Different AVM opcodes consume different amounts of gas.\n ///\n /// # Returns\n /// * `u32` - Remaining L2 gas units\n ///\n pub fn l2_gas_left(_self: Self) -> u32 {\n // Safety: AVM opcodes are constrained by the AVM itself\n unsafe {\n avm::l2_gas_left()\n }\n }\n\n /// Returns the remaining DA (Data Availability) gas available for this transaction.\n ///\n /// DA gas is consumed when emitting data that needs to be made available on L1, such as public logs or state\n /// updates. All of the side-effects from the private part of the tx also consume DA gas before execution of any\n /// public functions even begins.\n ///\n /// # Returns\n /// * `u32` - Remaining DA gas units\n ///\n pub fn da_gas_left(_self: Self) -> u32 {\n // Safety: AVM opcodes are constrained by the AVM itself\n unsafe {\n avm::da_gas_left()\n }\n }\n\n /// Checks if the current execution is within a staticcall context, where no state changes or logs are allowed to\n /// be emitted (by this function or any nested function calls).\n ///\n /// # Returns\n /// * `bool` - True if in staticcall context, false otherwise\n ///\n pub fn is_static_call(_self: Self) -> bool {\n // Safety: AVM opcodes are constrained by the AVM itself\n unsafe { avm::is_static_call() } == 1\n }\n\n /// Reads raw field values from public storage. Reads N consecutive storage slots starting from the given slot.\n ///\n /// Very low-level function. Users should typically use the public state variable abstractions to perform reads:\n /// PublicMutable & PublicImmutable.\n ///\n /// # Arguments\n /// * `storage_slot` - The starting storage slot to read from\n ///\n /// # Returns\n /// * `[Field; N]` - Array of N field values from consecutive storage slots\n ///\n /// # Generic Parameters\n /// * `N` - the number of consecutive slots to return, starting from the `storage_slot`.\n ///\n pub fn raw_storage_read<let N: u32>(self: Self, storage_slot: Field) -> [Field; N] {\n let mut out = [0; N];\n for i in 0..N {\n // Safety: AVM opcodes are constrained by the AVM itself\n out[i] = unsafe { avm::storage_read(storage_slot + i as Field, self.this_address().to_field()) };\n }\n out\n }\n\n /// Reads a typed value from public storage.\n ///\n /// Low-level function. Users should typically use the public state variable abstractions to perform reads:\n /// PublicMutable & PublicImmutable.\n ///\n /// # Arguments\n /// * `storage_slot` - The storage slot to read from\n ///\n /// # Returns\n /// * `T` - The deserialized value from storage\n ///\n /// # Generic Parameters\n /// * `T` - The type that the caller expects to read from the `storage_slot`.\n ///\n pub fn storage_read<T>(self, storage_slot: Field) -> T\n where\n T: Packable,\n {\n T::unpack(self.raw_storage_read(storage_slot))\n }\n\n /// Writes raw field values to public storage. Writes to N consecutive storage slots starting from the given slot.\n ///\n /// Very low-level function. Users should typically use the public state variable abstractions to perform writes:\n /// PublicMutable & PublicImmutable.\n ///\n /// Public storage writes take effect immediately.\n ///\n /// # Arguments\n /// * `storage_slot` - The starting storage slot to write to\n /// * `values` - Array of N Fields to write to storage\n ///\n pub fn raw_storage_write<let N: u32>(_self: Self, storage_slot: Field, values: [Field; N]) {\n for i in 0..N {\n // Safety: AVM opcodes are constrained by the AVM itself\n unsafe { avm::storage_write(storage_slot + i as Field, values[i]) };\n }\n }\n\n /// Writes a typed value to public storage.\n ///\n /// Low-level function. Users should typically use the public state variable abstractions to perform writes:\n /// PublicMutable & PublicImmutable.\n ///\n /// # Arguments\n /// * `storage_slot` - The storage slot to write to\n /// * `value` - The typed value to write to storage\n ///\n /// # Generic Parameters\n /// * `T` - The type to write to storage.\n ///\n pub fn storage_write<T>(self, storage_slot: Field, value: T)\n where\n T: Packable,\n {\n self.raw_storage_write(storage_slot, value.pack());\n }\n}\n\nimpl Empty for PublicContext {\n fn empty() -> Self {\n PublicContext::new(|| 0)\n }\n}\n"
|
|
3634
|
-
},
|
|
3635
|
-
"73": {
|
|
3636
|
-
"path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/context/utility_context.nr",
|
|
3637
|
-
"source": "use crate::oracle::{execution::get_utility_context, storage::storage_read};\nuse crate::protocol::{abis::block_header::BlockHeader, address::AztecAddress, traits::Packable};\n\n// If you'll modify this struct don't forget to update utility_context.ts as well.\npub struct UtilityContext {\n block_header: BlockHeader,\n contract_address: AztecAddress,\n}\n\nimpl UtilityContext {\n pub unconstrained fn new() -> Self {\n get_utility_context()\n }\n\n pub unconstrained fn at(contract_address: AztecAddress) -> Self {\n // We get a context with default contract address, and then we construct the final context with the provided\n // contract address.\n let default_context = get_utility_context();\n\n Self { block_header: default_context.block_header, contract_address }\n }\n\n pub fn block_header(self) -> BlockHeader {\n self.block_header\n }\n\n pub fn block_number(self) -> u32 {\n self.block_header.global_variables.block_number\n }\n\n pub fn timestamp(self) -> u64 {\n self.block_header.global_variables.timestamp\n }\n\n pub fn this_address(self) -> AztecAddress {\n self.contract_address\n }\n\n pub fn version(self) -> Field {\n self.block_header.global_variables.version\n }\n\n pub fn chain_id(self) -> Field {\n self.block_header.global_variables.chain_id\n }\n\n pub unconstrained fn raw_storage_read<let N: u32>(self: Self, storage_slot: Field) -> [Field; N] {\n storage_read(self.block_header, self.this_address(), storage_slot)\n }\n\n pub unconstrained fn storage_read<T>(self, storage_slot: Field) -> T\n where\n T: Packable,\n {\n T::unpack(self.raw_storage_read(storage_slot))\n }\n}\n"
|
|
2929
|
+
"path": "/home/aztec-dev/aztec-packages/noir-projects/noir-contracts/contracts/protocol/aztec_sublib/src/oracle/avm.nr",
|
|
2930
|
+
"source": "//! AVM oracles.\n//!\n//! There are only available during public execution. Calling any of them from a private or utility function will\n//! result in runtime errors.\n\nuse crate::protocol::address::{AztecAddress, EthAddress};\n\npub unconstrained fn address() -> AztecAddress {\n address_opcode()\n}\npub unconstrained fn sender() -> AztecAddress {\n sender_opcode()\n}\npub unconstrained fn transaction_fee() -> Field {\n transaction_fee_opcode()\n}\npub unconstrained fn chain_id() -> Field {\n chain_id_opcode()\n}\npub unconstrained fn version() -> Field {\n version_opcode()\n}\npub unconstrained fn block_number() -> u32 {\n block_number_opcode()\n}\npub unconstrained fn timestamp() -> u64 {\n timestamp_opcode()\n}\npub unconstrained fn min_fee_per_l2_gas() -> u128 {\n min_fee_per_l2_gas_opcode()\n}\npub unconstrained fn min_fee_per_da_gas() -> u128 {\n min_fee_per_da_gas_opcode()\n}\npub unconstrained fn l2_gas_left() -> u32 {\n l2_gas_left_opcode()\n}\npub unconstrained fn da_gas_left() -> u32 {\n da_gas_left_opcode()\n}\npub unconstrained fn is_static_call() -> u1 {\n is_static_call_opcode()\n}\npub unconstrained fn note_hash_exists(note_hash: Field, leaf_index: u64) -> u1 {\n note_hash_exists_opcode(note_hash, leaf_index)\n}\npub unconstrained fn emit_note_hash(note_hash: Field) {\n emit_note_hash_opcode(note_hash)\n}\npub unconstrained fn nullifier_exists(siloed_nullifier: Field) -> u1 {\n nullifier_exists_opcode(siloed_nullifier)\n}\npub unconstrained fn emit_nullifier(nullifier: Field) {\n emit_nullifier_opcode(nullifier)\n}\npub unconstrained fn emit_public_log(message: [Field]) {\n emit_public_log_opcode(message)\n}\npub unconstrained fn l1_to_l2_msg_exists(msg_hash: Field, msg_leaf_index: u64) -> u1 {\n l1_to_l2_msg_exists_opcode(msg_hash, msg_leaf_index)\n}\npub unconstrained fn send_l2_to_l1_msg(recipient: EthAddress, content: Field) {\n send_l2_to_l1_msg_opcode(recipient, content)\n}\n\npub unconstrained fn call<let N: u32>(\n l2_gas_allocation: u32,\n da_gas_allocation: u32,\n address: AztecAddress,\n args: [Field; N],\n) {\n call_opcode(l2_gas_allocation, da_gas_allocation, address, N, args)\n}\n\npub unconstrained fn call_static<let N: u32>(\n l2_gas_allocation: u32,\n da_gas_allocation: u32,\n address: AztecAddress,\n args: [Field; N],\n) {\n call_static_opcode(l2_gas_allocation, da_gas_allocation, address, N, args)\n}\n\npub unconstrained fn calldata_copy<let N: u32>(cdoffset: u32, copy_size: u32) -> [Field; N] {\n calldata_copy_opcode(cdoffset, copy_size)\n}\n\n/// `success_copy` is placed immediately after the CALL opcode to get the success value\npub unconstrained fn success_copy() -> bool {\n success_copy_opcode()\n}\n\npub unconstrained fn returndata_size() -> u32 {\n returndata_size_opcode()\n}\n\npub unconstrained fn returndata_copy(rdoffset: u32, copy_size: u32) -> [Field] {\n returndata_copy_opcode(rdoffset, copy_size)\n}\n\n/// The additional prefix is to avoid clashing with the `return` Noir keyword.\npub unconstrained fn avm_return(returndata: [Field]) {\n return_opcode(returndata)\n}\n\n/// This opcode reverts using the exact data given. In general it should only be used to do rethrows, where the revert\n/// data is the same as the original revert data. For normal reverts, use Noir's `assert` which, on top of reverting,\n/// will also add an error selector to the revert data.\npub unconstrained fn revert(revertdata: [Field]) {\n revert_opcode(revertdata)\n}\n\npub unconstrained fn storage_read(storage_slot: Field, contract_address: Field) -> Field {\n storage_read_opcode(storage_slot, contract_address)\n}\n\npub unconstrained fn storage_write(storage_slot: Field, value: Field) {\n storage_write_opcode(storage_slot, value);\n}\n\n#[oracle(aztec_avm_address)]\nunconstrained fn address_opcode() -> AztecAddress {}\n\n#[oracle(aztec_avm_sender)]\nunconstrained fn sender_opcode() -> AztecAddress {}\n\n#[oracle(aztec_avm_transactionFee)]\nunconstrained fn transaction_fee_opcode() -> Field {}\n\n#[oracle(aztec_avm_chainId)]\nunconstrained fn chain_id_opcode() -> Field {}\n\n#[oracle(aztec_avm_version)]\nunconstrained fn version_opcode() -> Field {}\n\n#[oracle(aztec_avm_blockNumber)]\nunconstrained fn block_number_opcode() -> u32 {}\n\n#[oracle(aztec_avm_timestamp)]\nunconstrained fn timestamp_opcode() -> u64 {}\n\n#[oracle(aztec_avm_minFeePerL2Gas)]\nunconstrained fn min_fee_per_l2_gas_opcode() -> u128 {}\n\n#[oracle(aztec_avm_minFeePerDaGas)]\nunconstrained fn min_fee_per_da_gas_opcode() -> u128 {}\n\n#[oracle(aztec_avm_l2GasLeft)]\nunconstrained fn l2_gas_left_opcode() -> u32 {}\n\n#[oracle(aztec_avm_daGasLeft)]\nunconstrained fn da_gas_left_opcode() -> u32 {}\n\n#[oracle(aztec_avm_isStaticCall)]\nunconstrained fn is_static_call_opcode() -> u1 {}\n\n#[oracle(aztec_avm_noteHashExists)]\nunconstrained fn note_hash_exists_opcode(note_hash: Field, leaf_index: u64) -> u1 {}\n\n#[oracle(aztec_avm_emitNoteHash)]\nunconstrained fn emit_note_hash_opcode(note_hash: Field) {}\n\n#[oracle(aztec_avm_nullifierExists)]\nunconstrained fn nullifier_exists_opcode(siloed_nullifier: Field) -> u1 {}\n\n#[oracle(aztec_avm_emitNullifier)]\nunconstrained fn emit_nullifier_opcode(nullifier: Field) {}\n\n#[oracle(aztec_avm_emitPublicLog)]\nunconstrained fn emit_public_log_opcode(message: [Field]) {}\n\n#[oracle(aztec_avm_l1ToL2MsgExists)]\nunconstrained fn l1_to_l2_msg_exists_opcode(msg_hash: Field, msg_leaf_index: u64) -> u1 {}\n\n#[oracle(aztec_avm_sendL2ToL1Msg)]\nunconstrained fn send_l2_to_l1_msg_opcode(recipient: EthAddress, content: Field) {}\n\n#[oracle(aztec_avm_calldataCopy)]\nunconstrained fn calldata_copy_opcode<let N: u32>(cdoffset: u32, copy_size: u32) -> [Field; N] {}\n\n#[oracle(aztec_avm_returndataSize)]\nunconstrained fn returndata_size_opcode() -> u32 {}\n\n#[oracle(aztec_avm_returndataCopy)]\nunconstrained fn returndata_copy_opcode(rdoffset: u32, copy_size: u32) -> [Field] {}\n\n#[oracle(aztec_avm_return)]\nunconstrained fn return_opcode(returndata: [Field]) {}\n\n#[oracle(aztec_avm_revert)]\nunconstrained fn revert_opcode(revertdata: [Field]) {}\n\n// While the length parameter might seem unnecessary given that we have N we keep it around because at the AVM bytecode\n// level, we want to support non-comptime-known lengths for such opcodes, even if Noir code will not generally take\n// that route.\n#[oracle(aztec_avm_call)]\nunconstrained fn call_opcode<let N: u32>(\n l2_gas_allocation: u32,\n da_gas_allocation: u32,\n address: AztecAddress,\n length: u32,\n args: [Field; N],\n) {}\n\n// While the length parameter might seem unnecessary given that we have N we keep it around because at the AVM bytecode\n// level, we want to support non-comptime-known lengths for such opcodes, even if Noir code will not generally take\n// that route.\n#[oracle(aztec_avm_staticCall)]\nunconstrained fn call_static_opcode<let N: u32>(\n l2_gas_allocation: u32,\n da_gas_allocation: u32,\n address: AztecAddress,\n length: u32,\n args: [Field; N],\n) {}\n\n#[oracle(aztec_avm_successCopy)]\nunconstrained fn success_copy_opcode() -> bool {}\n\n#[oracle(aztec_avm_storageRead)]\nunconstrained fn storage_read_opcode(storage_slot: Field, contract_address: Field) -> Field {}\n\n#[oracle(aztec_avm_storageWrite)]\nunconstrained fn storage_write_opcode(storage_slot: Field, value: Field) {}\n"
|
|
3638
2931
|
},
|
|
3639
|
-
"
|
|
3640
|
-
"path": "/home/aztec-dev/aztec-packages/noir-projects/
|
|
3641
|
-
"source": "//! The `self` contract value.\n\nuse crate::{\n context::{\n calls::{PrivateCall, PrivateStaticCall, PublicCall, PublicStaticCall},\n PrivateContext,\n PublicContext,\n UtilityContext,\n },\n event::{\n event_emission::{emit_event_in_private, emit_event_in_public},\n event_interface::EventInterface,\n EventMessage,\n },\n};\nuse crate::protocol::{address::AztecAddress, traits::{Deserialize, Serialize}};\n\n/// Core interface for interacting with aztec-nr contract features.\n///\n/// This struct is automatically injected into every [external](crate::macros::functions::external) and\n/// [internal](crate::macros::functions::internal) contract function by the Aztec macro system and is accessible\n/// through the `self` variable.\n///\n/// ## Usage in Contract Functions\n///\n/// Once injected, you can use `self` to:\n/// - Access storage: `self.storage.balances.at(owner).read()`\n/// - Call contracts: `self.call(Token::at(address).transfer(recipient, amount))`\n/// - Emit events: `self.emit(event).deliver_to(recipient, delivery_mode)` (private) or `self.emit(event)` (public)\n/// - Get the contract address: `self.address`\n/// - Get the caller: `self.msg_sender()`\n/// - Access low-level Aztec.nr APIs through the context: `self.context`\n///\n/// ## Example\n///\n/// ```noir\n/// #[external(\"private\")]\n/// fn withdraw(amount: u128, recipient: AztecAddress) {\n/// // Get the caller of this function\n/// let sender = self.msg_sender();\n///\n/// // Access storage\n/// let token = self.storage.donation_token.get_note().get_address();\n///\n/// // Call contracts\n/// self.call(Token::at(token).transfer(recipient, amount));\n/// }\n/// ```\n///\n/// ## Type Parameters\n///\n/// - `Context`: The execution context type - either `&mut PrivateContext`, `PublicContext`, or `UtilityContext`\n/// - `Storage`: The contract's storage struct (defined with [storage](crate::macros::storage::storage), or `()` if the\n/// contract has no storage\n/// - `CallSelf`: Macro-generated type for calling contract's own non-view functions\n/// - `EnqueueSelf`: Macro-generated type for enqueuing calls to the contract's own non-view functions\n/// - `CallSelfStatic`: Macro-generated type for calling contract's own view functions\n/// - `EnqueueSelfStatic`: Macro-generated type for enqueuing calls to the contract's own view functions\npub struct ContractSelf<Context, Storage, CallSelf, EnqueueSelf, CallSelfStatic, EnqueueSelfStatic, CallInternal> {\n /// The address of this contract\n pub address: AztecAddress,\n\n /// The contract's storage instance, representing the struct to which the\n /// [storage](crate::macros::storage::storage) macro was applied in your contract. If the contract has no storage,\n /// the type of this will be `()`.\n ///\n /// This storage instance is specialized for the current execution context (private, public, or utility) and\n /// provides access to the contract's state variables. Each state variable accepts the context as a generic\n /// parameter, which determines its available functionality. For example, a PublicImmutable variable can be read\n /// from any context (public, private, or utility) but can only be written to from public contexts.\n ///\n /// ## Developer Note\n ///\n /// If you've arrived here while trying to access your contract's storage while the `Storage` generic type is set\n /// to unit type `()`, it means you haven't yet defined a Storage struct using the\n /// [storage](crate::macros::storage::storage) macro in your contract. For guidance on setting this up, please\n /// refer to our docs: https://docs.aztec.network/developers/docs/guides/smart_contracts/storage\n\n pub storage: Storage,\n\n /// The execution context whose type is determined by the [external](crate::macros::functions::external) attribute\n /// of the contract function based on the external function type (private, public, or utility).\n pub context: Context,\n\n /// Provides type-safe methods for calling this contract's own non-view functions.\n ///\n /// In private and public contexts this will be a struct with appropriate methods; in utility context it will be\n /// the unit type `()`.\n ///\n /// Example API:\n /// ```noir\n /// self.call_self.some_private_function(args)\n /// ```\n pub call_self: CallSelf,\n\n /// Provides type-safe methods for enqueuing calls to this contract's own non-view functions.\n ///\n /// In private context this will be a struct with appropriate methods; in public and utility contexts it will be\n /// the unit type `()`.\n ///\n /// Example API:\n /// ```noir\n /// self.enqueue_self.some_public_function(args)\n /// ```\n pub enqueue_self: EnqueueSelf,\n\n /// Provides type-safe methods for calling this contract's own view functions.\n ///\n /// In private and public contexts this will be a struct with appropriate methods; in utility context it will be\n /// the unit type `()`.\n ///\n /// Example API:\n /// ```noir\n /// self.call_self_static.some_view_function(args)\n /// ```\n pub call_self_static: CallSelfStatic,\n\n /// Provides type-safe methods for enqueuing calls to this contract's own view functions.\n ///\n /// In private context this will be a struct with appropriate methods; in public and utility contexts it will be\n /// the unit type `()`.\n ///\n /// Example API:\n /// ```noir\n /// self.enqueue_self_static.some_public_view_function(args)\n /// ```\n pub enqueue_self_static: EnqueueSelfStatic,\n\n /// Provides type-safe methods for calling internal functions.\n ///\n /// In private and public contexts this will be a struct with appropriate methods; in utility context it will be\n /// the unit type `()`.\n ///\n /// Example API:\n /// ```noir\n /// self.internal.some_internal_function(args)\n /// ```\n pub internal: CallInternal,\n}\n\n// Implementation for `ContractSelf` in private execution contexts.\n//\n// This implementation is used when an external or internal contract function is marked with \"private\".\nimpl<Storage, CallSelf, EnqueueSelf, CallSelfStatic, EnqueueSelfStatic, CallInternal> ContractSelf<&mut PrivateContext, Storage, CallSelf, EnqueueSelf, CallSelfStatic, EnqueueSelfStatic, CallInternal> {\n /// Creates a new `ContractSelf` instance for a private function.\n ///\n /// This constructor is called automatically by the macro system and should not be called directly.\n pub fn new_private(\n context: &mut PrivateContext,\n storage: Storage,\n call_self: CallSelf,\n enqueue_self: EnqueueSelf,\n call_self_static: CallSelfStatic,\n enqueue_self_static: EnqueueSelfStatic,\n internal: CallInternal,\n ) -> Self {\n Self {\n context,\n storage,\n address: context.this_address(),\n call_self,\n enqueue_self,\n call_self_static,\n enqueue_self_static,\n internal,\n }\n }\n\n /// The address of the contract address that made this function call.\n ///\n /// This is similar to Solidity's `msg.sender` value.\n ///\n /// ## Transaction Entrypoints\n ///\n /// As there are no EOAs (externally owned accounts) in Aztec, unlike on Ethereum, the first contract function\n /// executed in a transaction (i.e. transaction entrypoint) does **not** have a caller. This function panics when\n /// executed in such a context.\n ///\n /// If you need to handle these cases, use [PrivateContext::maybe_msg_sender].\n pub fn msg_sender(self) -> AztecAddress {\n self.context.maybe_msg_sender().unwrap()\n }\n\n /// Emits an event privately.\n ///\n /// Unlike public events, private events do not reveal their contents publicly. They instead create an\n /// [EventMessage] containing the private event information, which **MUST** be delivered to a recipient via\n /// [EventMessage::deliver_to] in order for them to learn about the event. Multiple recipients can have the same\n /// message be delivered to them.\n ///\n /// # Example\n /// ```noir\n /// #[event]\n /// struct Transfer { from: AztecAddress, to: AztecAddress, amount: u128 }\n ///\n /// #[external(\"private\")]\n /// fn transfer(to: AztecAddress, amount: u128) {\n /// let from = self.msg_sender();\n ///\n /// let message: EventMessage = self.emit(Transfer { from, to, amount });\n /// message.deliver_to(from, MessageDelivery.OFFCHAIN);\n /// message.deliver_to(to, MessageDelivery.ONCHAIN_CONSTRAINED);\n /// }\n /// ```\n ///\n /// # Cost\n ///\n /// Private event emission always results in the creation of a nullifer, which acts as a commitment to the event\n /// and is used by third parties to verify its authenticity. See [EventMessage::deliver_to] for the costs\n /// associated to delivery.\n ///\n /// # Privacy\n ///\n /// The nullifier created when emitting a private event leaks nothing about the content of the event - it's a\n /// commitment that includes a random value, so even with full knowledge of the event preimage determining if an\n /// event was emitted or not requires brute-forcing the entire `Field` space.\n pub fn emit<Event>(&mut self, event: Event) -> EventMessage<Event>\n where\n Event: EventInterface + Serialize,\n {\n emit_event_in_private(self.context, event)\n }\n\n /// Makes a private contract call.\n ///\n /// # Arguments\n /// * `call` - The object representing the private function to invoke.\n ///\n /// # Returns\n /// * `T` - Whatever data the called function has returned.\n ///\n /// # Example\n /// ```noir\n /// self.call(Token::at(address).transfer_in_private(recipient, amount));\n /// ```\n ///\n /// This enables contracts to interact with each other while maintaining privacy. This \"composability\" of private\n /// contract functions is a key feature of the Aztec network.\n ///\n /// If a user's transaction includes multiple private function calls, then by the design of Aztec, the following\n /// information will remain private[1]:\n /// - The function selectors and contract addresses of all private function calls will remain private, so an\n /// observer of the public mempool will not be able to look at a tx and deduce which private functions have been\n /// executed.\n /// - The arguments and return values of all private function calls will remain private.\n /// - The person who initiated the tx will remain private.\n /// - The notes and nullifiers and private logs that are emitted by all private function calls will (if designed\n /// well) not leak any user secrets, nor leak which functions have been executed.\n ///\n /// [1] Caveats: Some of these privacy guarantees depend on how app developers design their smart contracts. Some\n /// actions _can_ leak information, such as:\n /// - Calling an internal public function.\n /// - Calling a public function and not setting msg_sender to Option::none (see\n /// https://github.com/AztecProtocol/aztec-packages/pull/16433)\n /// - Calling any public function will always leak details about the nature of the transaction, so devs should be\n /// careful in their contract designs. If it can be done in a private function, then that will give the best\n /// privacy.\n /// - Not padding the side-effects of a tx to some standardized, uniform size. The kernel circuits can take hints\n /// to pad side-effects, so a wallet should be able to request for a particular amount of padding. Wallets should\n /// ideally agree on some standard.\n /// - Padding should include:\n /// - Padding the lengths of note & nullifier arrays\n /// - Padding private logs with random fields, up to some standardized size. See also:\n /// https://docs.aztec.network/developers/resources/considerations/privacy_considerations\n ///\n /// # Advanced\n /// * The call is added to the private call stack and executed by kernel circuits after this function completes\n /// * The called function can modify its own contract's private state\n /// * Side effects from the called function are included in this transaction\n /// * The call inherits the current transaction's context and gas limits\n ///\n pub fn call<let M: u32, let N: u32, T>(&mut self, call: PrivateCall<M, N, T>) -> T\n where\n T: Deserialize,\n {\n call.call(self.context)\n }\n\n /// Makes a read-only private contract call.\n ///\n /// This is similar to Solidity's `staticcall`. The called function cannot modify state, emit L2->L1 messages, nor\n /// emit events. Any nested calls are constrained to also be static calls.\n ///\n /// # Arguments\n /// * `call` - The object representing the read-only private function to invoke.\n ///\n /// # Returns\n /// * `T` - Whatever data the called function has returned.\n ///\n /// # Example\n /// ```noir\n /// self.view(Token::at(address).balance_of_private(recipient));\n /// ```\n pub fn view<let M: u32, let N: u32, T>(&mut self, call: PrivateStaticCall<M, N, T>) -> T\n where\n T: Deserialize,\n {\n call.view(self.context)\n }\n\n /// Enqueues a public contract call function.\n ///\n /// Unlike private functions which execute immediately on the user's device, public function calls are \"enqueued\"\n /// and executed some time later by a block proposer.\n ///\n /// This means a public function cannot return any values back to a private function, because by the time the\n /// public function is being executed, the private function which called it has already completed execution. (In\n /// fact, the private function has been executed and proven, along with all other private function calls of the\n /// user's tx. A single proof of the tx has been submitted to the Aztec network, and some time later a proposer has\n /// picked the tx up from the mempool and begun executing all of the enqueued public functions).\n ///\n /// # Privacy warning Enqueueing a public function call is an inherently leaky action. Many interesting applications will require some interaction with public state, but smart contract developers should try to use public function calls sparingly, and carefully. _Internal_ public function calls are especially leaky, because they completely leak which private contract made the call. See also: https://docs.aztec.network/developers/resources/considerations/privacy_considerations\n ///\n /// # Arguments\n /// * `call` - The interface representing the public function to enqueue.\n pub fn enqueue<let M: u32, let N: u32, T>(&mut self, call: PublicCall<M, N, T>) {\n call.enqueue(self.context)\n }\n\n /// Enqueues a read-only public contract call function.\n ///\n /// This is similar to Solidity's `staticcall`. The called function cannot modify state, emit L2->L1 messages, nor\n /// emit events. Any nested calls are constrained to also be static calls.\n ///\n /// # Arguments\n /// * `call` - The object representing the read-only public function to enqueue.\n ///\n /// # Example\n /// ```noir\n /// self.enqueue_view(MyContract::at(address).assert_timestamp_less_than(timestamp));\n /// ```\n pub fn enqueue_view<let M: u32, let N: u32, T>(&mut self, call: PublicStaticCall<M, N, T>) {\n call.enqueue_view(self.context)\n }\n\n /// Enqueues a privacy-preserving public contract call function.\n ///\n /// This is the same as [ContractSelf::enqueue], except it hides this calling contract's address from the target\n /// public function (i.e. [ContractSelf::msg_sender] will panic).\n ///\n /// This means the origin of the call (msg_sender) will not be publicly visible to any blockchain observers, nor to\n /// the target public function. If the target public function reads `self.msg_sender()` the call will revert.\n ///\n /// NOTES:\n /// - Not all public functions will accept a msg_sender of \"none\". Many public functions will require that\n /// msg_sender is \"some\" and will revert otherwise. Therefore, if using `enqueue_incognito`, you must understand\n /// whether the function you're calling will accept a msg_sender of \"none\". Lots of public bookkeeping patterns\n /// rely on knowing which address made the call, so as to ascribe state against the caller's address. (There are\n /// patterns whereby bookkeeping could instead be done in private-land).\n /// - If you are enqueueing a call to an _internal_ public function (i.e. a public function that will only accept\n /// calls from other functions of its own contract), then by definition a call to it cannot possibly be\n /// \"incognito\": the msg_sender must be its own address, and indeed the called public function will assert this.\n /// Tl;dr this is not usable for enqueued internal public calls.\n ///\n /// # Arguments\n /// * `call` - The object representing the public function to enqueue.\n ///\n /// # Example\n /// ```noir\n /// self.enqueue_incognito(Token::at(address).increase_total_supply_by(amount));\n /// ```\n ///\n /// Advanced:\n /// - The kernel circuits will permit _any_ private function to set the msg_sender field of any enqueued public\n /// function call to NULL_MSG_SENDER_CONTRACT_ADDRESS.\n /// - When the called public function calls `PublicContext::msg_sender()`, aztec-nr will translate\n /// NULL_MSG_SENDER_CONTRACT_ADDRESS into `Option<AztecAddress>::none` for familiarity to devs.\n ///\n pub fn enqueue_incognito<let M: u32, let N: u32, T>(&mut self, call: PublicCall<M, N, T>) {\n call.enqueue_incognito(self.context)\n }\n\n /// Enqueues a privacy-preserving read-only public contract call function.\n ///\n /// As per `enqueue_view`, but hides this calling contract's address from the target public function.\n ///\n /// See `enqueue_incognito` for more details relating to hiding msg_sender.\n ///\n /// # Arguments\n /// * `call` - The object representing the read-only public function to enqueue.\n ///\n /// # Example\n /// ```noir\n /// self.enqueue_view_incognito(MyContract::at(address).assert_timestamp_less_than(timestamp));\n /// ```\n ///\n pub fn enqueue_view_incognito<let M: u32, let N: u32, T>(&mut self, call: PublicStaticCall<M, N, T>) {\n call.enqueue_view_incognito(self.context)\n }\n\n /// Enqueues a call to the public function defined by the `call` parameter, and designates it to be the teardown\n /// function for this tx. Only one teardown function call can be made by a tx.\n ///\n /// Niche function: Only wallet developers and paymaster contract developers (aka Fee-payment contracts) will need\n /// to make use of this function.\n ///\n /// Aztec supports a three-phase execution model: setup, app logic, teardown. The phases exist to enable a fee\n /// payer to take on the risk of paying a transaction fee, safe in the knowledge that their payment (in whatever\n /// token or method the user chooses) will succeed, regardless of whether the app logic will succeed. The \"setup\"\n /// phase ensures the fee payer has sufficient balance to pay the proposer their fees. The teardown phase is\n /// primarily intended to: calculate exactly how much the user owes, based on gas consumption, and refund the user\n /// any change.\n ///\n /// Note: in some cases, the cost of refunding the user (i.e. DA costs of tx side-effects) might exceed the refund\n /// amount. For app logic with fairly stable and predictable gas consumption, a material refund amount is unlikely.\n /// For app logic with unpredictable gas consumption, a refund might be important to the user (e.g. if a hefty\n /// function reverts very early). Wallet/FPC/Paymaster developers should be mindful of this.\n ///\n /// See `enqueue` for more information about enqueuing public function calls.\n ///\n /// # Arguments\n /// * `call` - The object representing the public function to designate as teardown.\n ///\n pub fn set_as_teardown<let M: u32, let N: u32, T>(&mut self, call: PublicCall<M, N, T>) {\n call.set_as_teardown(self.context)\n }\n\n /// Enqueues a call to the public function defined by the `call` parameter, and designates it to be the teardown\n /// function for this tx. Only one teardown function call can be made by a tx.\n ///\n /// As per `set_as_teardown`, but hides this calling contract's address from the target public function.\n ///\n /// See `enqueue_incognito` for more details relating to hiding msg_sender.\n ///\n pub fn set_as_teardown_incognito<let M: u32, let N: u32, T>(&mut self, call: PublicCall<M, N, T>) {\n call.set_as_teardown_incognito(self.context)\n }\n}\n\n// Implementation for `ContractSelf` in public execution contexts.\n//\n// This implementation is used when an external or internal contract function is marked with \"public\".\nimpl<Storage, CallSelf, CallSelfStatic, CallInternal> ContractSelf<PublicContext, Storage, CallSelf, (), CallSelfStatic, (), CallInternal> {\n /// Creates a new `ContractSelf` instance for a public function.\n ///\n /// This constructor is called automatically by the macro system and should not be called directly.\n pub fn new_public(\n context: PublicContext,\n storage: Storage,\n call_self: CallSelf,\n call_self_static: CallSelfStatic,\n internal: CallInternal,\n ) -> Self {\n Self {\n context,\n storage,\n address: context.this_address(),\n call_self,\n enqueue_self: (),\n call_self_static,\n enqueue_self_static: (),\n internal,\n }\n }\n\n /// The address of the contract address that made this function call.\n ///\n /// This is similar to Solidity's `msg.sender` value.\n ///\n /// ## Incognito Calls\n ///\n /// Contracts can call public functions from private ones hiding their identity (see\n /// [enqueue_incognito](ContractSelf::enqueue_incognito)). This function reverts when executed in such a context.\n ///\n /// If you need to handle these cases, use [PublicContext::maybe_msg_sender].\n pub fn msg_sender(self: Self) -> AztecAddress {\n self.context.maybe_msg_sender().unwrap()\n }\n\n /// Emits an event publicly.\n ///\n /// Public events are emitted as plaintext and are therefore visible to everyone. This is is the same as Solidity\n /// events on EVM chains.\n ///\n /// Unlike private events, they don't require delivery of an event message.\n ///\n /// # Example\n /// ```noir\n /// #[event]\n /// struct Update { value: Field }\n ///\n /// #[external(\"public\")]\n /// fn publish_update(value: Field) {\n /// self.emit(Update { value });\n /// }\n /// ```\n ///\n /// # Cost\n ///\n /// Public event emission is achieved by emitting public transaction logs. A total of `N+1` fields are emitted,\n /// where `N` is the serialization length of the event.\n pub fn emit<Event>(&mut self, event: Event)\n where\n Event: EventInterface + Serialize,\n {\n emit_event_in_public(self.context, event);\n }\n\n /// Makes a public contract call.\n ///\n /// Will revert if the called function reverts or runs out of gas.\n ///\n /// # Arguments\n /// * `call` - The object representing the public function to invoke.\n ///\n /// # Returns\n /// * `T` - Whatever data the called function has returned.\n ///\n /// # Example\n /// ```noir\n /// self.call(Token::at(address).transfer_in_public(recipient, amount));\n /// ```\n ///\n pub unconstrained fn call<let M: u32, let N: u32, T>(self, call: PublicCall<M, N, T>) -> T\n where\n T: Deserialize,\n {\n call.call(self.context)\n }\n\n /// Makes a public read-only contract call.\n ///\n /// This is similar to Solidity's `staticcall`. The called function cannot modify state or emit events. Any nested\n /// calls are constrained to also be static calls.\n ///\n /// Will revert if the called function reverts or runs out of gas.\n ///\n /// # Arguments\n /// * `call` - The object representing the read-only public function to invoke.\n ///\n /// # Returns\n /// * `T` - Whatever data the called function has returned.\n ///\n /// # Example\n /// ```noir\n /// self.view(Token::at(address).balance_of_public(recipient));\n /// ```\n ///\n pub unconstrained fn view<let M: u32, let N: u32, T>(self, call: PublicStaticCall<M, N, T>) -> T\n where\n T: Deserialize,\n {\n call.view(self.context)\n }\n}\n\n// Implementation for `ContractSelf` in utility execution contexts.\n//\n// This implementation is used when an external or internal contract function is marked with \"utility\".\nimpl<Storage> ContractSelf<UtilityContext, Storage, (), (), (), (), ()> {\n /// Creates a new `ContractSelf` instance for a utility function.\n ///\n /// This constructor is called automatically by the macro system and should not be called directly.\n pub fn new_utility(context: UtilityContext, storage: Storage) -> Self {\n Self {\n context,\n storage,\n address: context.this_address(),\n call_self: (),\n enqueue_self: (),\n call_self_static: (),\n enqueue_self_static: (),\n internal: (),\n }\n }\n}\n"
|
|
3642
|
-
},
|
|
3643
|
-
"76": {
|
|
3644
|
-
"path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/event/event_interface.nr",
|
|
3645
|
-
"source": "use crate::{event::EventSelector, messages::logs::event::MAX_EVENT_SERIALIZED_LEN};\nuse crate::protocol::{\n constants::DOM_SEP__EVENT_COMMITMENT,\n hash::{poseidon2_hash_with_separator, poseidon2_hash_with_separator_bounded_vec},\n traits::{Serialize, ToField},\n};\n\npub trait EventInterface {\n fn get_event_type_id() -> EventSelector;\n}\n\n/// A private event's commitment is a value stored on-chain which is used to verify that the event was indeed emitted.\n///\n/// It requires a `randomness` value that must be produced alongside the event in order to perform said validation.\n/// This random value prevents attacks in which someone guesses plausible events (e.g. 'Alice transfers to Bob an\n/// amount of 10'), since they will not be able to test for existence of their guessed events without brute-forcing the\n/// entire `Field` space by guessing `randomness` values.\npub fn compute_private_event_commitment<Event>(event: Event, randomness: Field) -> Field\nwhere\n Event: EventInterface + Serialize,\n{\n poseidon2_hash_with_separator(\n [randomness, Event::get_event_type_id().to_field()].concat(event.serialize()),\n DOM_SEP__EVENT_COMMITMENT,\n )\n}\n\n/// Unconstrained variant of [compute_private_event_commitment] which takes the event in serialized form.\n///\n/// This function is unconstrained as the mechanism it uses to compute the commitment would be very inefficient in a\n/// constrained environment (due to the hashing of a dynamically sized array). This is not an issue as it is typically\n/// invoked when processing event messages, which is an unconstrained operation.\npub unconstrained fn compute_private_serialized_event_commitment(\n serialized_event: BoundedVec<Field, MAX_EVENT_SERIALIZED_LEN>,\n randomness: Field,\n event_type_id: Field,\n) -> Field {\n let mut commitment_preimage =\n BoundedVec::<_, 1 + MAX_EVENT_SERIALIZED_LEN>::from_array([randomness, event_type_id]);\n commitment_preimage.extend_from_bounded_vec(serialized_event);\n\n poseidon2_hash_with_separator_bounded_vec(commitment_preimage, DOM_SEP__EVENT_COMMITMENT)\n}\n\nmod test {\n use crate::event::event_interface::{\n compute_private_event_commitment, compute_private_serialized_event_commitment, EventInterface,\n };\n use crate::protocol::traits::{Serialize, ToField};\n use crate::test::mocks::mock_event::MockEvent;\n\n global VALUE: Field = 7;\n global RANDOMNESS: Field = 10;\n\n #[test]\n unconstrained fn event_commitment_equivalence() {\n let event = MockEvent::new(VALUE).build_event();\n\n assert_eq(\n compute_private_event_commitment(event, RANDOMNESS),\n compute_private_serialized_event_commitment(\n BoundedVec::from_array(event.serialize()),\n RANDOMNESS,\n MockEvent::get_event_type_id().to_field(),\n ),\n );\n }\n}\n"
|
|
2932
|
+
"80": {
|
|
2933
|
+
"path": "/home/aztec-dev/aztec-packages/noir-projects/noir-contracts/contracts/protocol/aztec_sublib/src/oracle/nullifiers.nr",
|
|
2934
|
+
"source": "//! Nullifier creation, existence checks, etc.\n\nuse crate::protocol::address::aztec_address::AztecAddress;\n\n/// Notifies the simulator that a nullifier has been created, so that its correct status (pending or settled) can be\n/// determined when reading nullifiers in subsequent private function calls. The first non-revertible nullifier emitted\n/// is also used to compute note nonces.\npub fn notify_created_nullifier(inner_nullifier: Field) {\n // Safety: This oracle call returns nothing: we only call it for its side effects. It is therefore always safe to\n // call.\n unsafe { notify_created_nullifier_oracle(inner_nullifier) };\n}\n\n#[oracle(aztec_prv_notifyCreatedNullifier)]\nunconstrained fn notify_created_nullifier_oracle(_inner_nullifier: Field) {}\n\n/// Returns true if the nullifier has been emitted in the same transaction, i.e. if [notify_created_nullifier] has been\n/// called for this inner nullifier from the contract with the specified address.\n///\n/// Note that despite sharing pending transaction information with the app, this is not a privacy leak: anyone in the\n/// network can always determine in which transaction a inner nullifier was emitted by a given contract by simply\n/// inspecting transaction effects. What _would_ constitute a leak would be to share the list of inner pending\n/// nullifiers, as that would reveal their preimages.\npub unconstrained fn is_nullifier_pending(\n inner_nullifier: Field,\n contract_address: AztecAddress,\n) -> bool {\n is_nullifier_pending_oracle(inner_nullifier, contract_address)\n}\n\n#[oracle(aztec_prv_isNullifierPending)]\nunconstrained fn is_nullifier_pending_oracle(\n _inner_nullifier: Field,\n _contract_address: AztecAddress,\n) -> bool {}\n\n/// Returns true if the nullifier exists. Note that a `true` value can be constrained by proving existence of the\n/// nullifier, but a `false` value should not be relied upon since other transactions may emit this nullifier before\n/// the current transaction is included in a block. While this might seem of little use at first, certain design\n/// patterns benefit from this abstraction (see e.g. `PrivateMutable`).\npub unconstrained fn check_nullifier_exists(inner_nullifier: Field) -> bool {\n check_nullifier_exists_oracle(inner_nullifier)\n}\n\n#[oracle(aztec_utl_checkNullifierExists)]\nunconstrained fn check_nullifier_exists_oracle(_inner_nullifier: Field) -> bool {}\n"
|
|
3646
2935
|
},
|
|
3647
|
-
"
|
|
3648
|
-
"path": "/home/aztec-dev/aztec-packages/noir-projects/
|
|
3649
|
-
"source": "use crate::protocol::{hash::poseidon2_hash_bytes, traits::{Deserialize, Empty, FromField, Serialize, ToField}};\n\n#[derive(Deserialize, Eq, Serialize)]\npub struct EventSelector {\n // 1st 4-bytes (big-endian leftmost) of abi-encoding of an event.\n inner: u32,\n}\n\nimpl FromField for EventSelector {\n fn from_field(field: Field) -> Self {\n Self { inner: field as u32 }\n }\n}\n\nimpl ToField for EventSelector {\n fn to_field(self) -> Field {\n self.inner as Field\n }\n}\n\nimpl Empty for EventSelector {\n fn empty() -> Self {\n Self { inner: 0 as u32 }\n }\n}\n\nimpl EventSelector {\n pub fn from_u32(value: u32) -> Self {\n Self { inner: value }\n }\n\n pub fn from_signature<let N: u32>(signature: str<N>) -> Self {\n let bytes = signature.as_bytes();\n let hash = poseidon2_hash_bytes(bytes);\n\n // `hash` is automatically truncated to fit within 32 bits.\n EventSelector::from_field(hash)\n }\n\n pub fn zero() -> Self {\n Self { inner: 0 }\n }\n}\n"
|
|
2936
|
+
"82": {
|
|
2937
|
+
"path": "/home/aztec-dev/aztec-packages/noir-projects/noir-contracts/contracts/protocol/aztec_sublib/src/state_vars/delayed_public_mutable.nr",
|
|
2938
|
+
"source": "use crate::protocol::{\n delayed_public_mutable::{\n delayed_public_mutable_values::{unpack_delay_change, unpack_value_change},\n DelayedPublicMutableValues,\n ScheduledDelayChange,\n ScheduledValueChange,\n },\n traits::Packable,\n};\n\nuse crate::{context::{PrivateContext, PublicContext, UtilityContext}, state_vars::StateVariable, utils::WithHash};\n\n/// Mutable public values with private read access.\n///\n/// This is an advanced public state variable, with no native Solidity equivalent.\n///\n/// Like [`PublicMutable`](crate::state_vars::PublicMutable) it represents a public value of type `T` that can be\n/// written to repeatedly, but with a key improvement: the current value can also be **read from a private contract\n/// function**.\n///\n/// This comes at the cost of extra restrictions on the state variable: writes do not come into effect immediately,\n/// they must be **scheduled** to take place after some minimum delay. Reading from the state variable will therefore\n/// return the previous value until some time passes, which is why this is a _delayed_ mutable variable.\n///\n/// It is these delays that enable the capacity for reads from private contract functions, as they provide guarantees\n/// regarding how long can some historical state observed at the anchor block be known to not change.\n///\n/// Delays can be modified during the lifetime of the contract.\n///\n/// ## Access Patterns\n///\n/// The current value stored in a `DelayedPublicMutable` can be read from public contract functions, and writes can be\n/// scheduled to happen in the future.\n///\n/// Public contract functions can also schedule changes to the write delay, as well as inspect any already scheduled\n/// value or delay changes.\n///\n/// Private contract functions can read the **current** value of the state variable, but not past or scheduled values.\n/// They cannot read the current delay, and they cannot schedule any kind of value change.\n///\n/// ## Privacy\n///\n/// The value stored in `DelayedPublicMutable` is fully public, as are all scheduled value and delay changes.\n///\n/// Reads from a private contract function are almost fully private: the only observable effect is that they set the\n/// transaction's `expiration_timestamp` property, possibly reducing the privacy set. See\n/// [`PrivateContext::set_expiration_timestamp`](crate::context::PrivateContext::set_expiration_timestamp).\n///\n/// ## Use Cases\n///\n/// These are mostly an extension of [`PublicMutable`](crate::state_vars::PublicMutable)'s, given that what this state\n/// variable essentially achieves is to provide private reads to it. For example, it can be used for global contract\n/// configuration (such as fees, access control, etc.) that users will need to access during private interactions.\n///\n/// The key consideration is whether the enforced minimum delay on writes prevents using this state variable. In some\n/// scenarios this restriction is incompatible with requirements (such as a token's total supply, which must always be\n/// up to date), while in others the enhanced privacy might make the tradeoff acceptable (such as when dealing with\n/// contract pauses or access control revocation, where a delay of some hours could be acceptable).\n///\n/// Note that, just like in [`PublicMutable`](crate::state_vars::PublicMutable), the fact that the values are public\n/// does not necessarily mean the actions that update these values must themselves be wholly public. To learn more,\n/// see the notes there regarding usage of [`only_self`](crate::macros::functions::only_self).\n///\n/// ## Choosing Delays\n///\n/// A short delay reduces the most obvious downside of `DelayedPublicMutable`, and so it is natural to wish to make it\n/// be as low as possible. It is therefore important to understand the tradeoffs involved in delay selection.\n///\n/// A shorter delay will result in a lower `expiration_timestamp` property of transactions that privately read the\n/// state variable, reducing its privacy set. If the delay is smaller than that of any other contract, then this\n/// privacy leak might be large enough to uniquely identify those transactions that interact with the contract - fully\n/// defeating the purpose of `DelayedPublicMutable`.\n///\n/// Additionally, a lower `expiration_timestamp` obviously causes transactions to expire earlier, resulting in\n/// multiple issues. Among others, this can make large transactions that take long to prove be unfeasible, restrict\n/// users with slow proving devices, and force large transaction fees to guarantee fast inclusion.\n///\n/// In practice, a delay of at least a couple hours is recommended. From a privacy point of view the optimal delay is\n/// [`crate::protocol::constants::MAX_TX_LIFETIME`], which puts contracts in the same privacy set as those that do not\n/// use `DelayedPublicMutable` at all.\n///\n/// ## Examples\n///\n/// Declaring a `DelayedPublicMutable` in the contract's [`storage`](crate::macros::storage::storage) struct\n/// requires specifying the type `T` that is stored in the variable, along with the initial delay used when scheduling\n/// value changes:\n///\n/// ```noir\n/// global PAUSE_CONTRACT_INITIAL_DELAY_S: u64 = 6 * 60 * 60; // 6 hours\n/// global CHANGE_AUTHORIZATION_INITIAL_DELAY_S: u64 = 24 * 60 * 60; // 24 hours\n///\n/// #[storage]\n/// struct Storage<C> {\n/// paused: DelayedPublicMutable<bool, PAUSE_CONTRACT_INITIAL_DELAY_S, C>,\n/// user_authorization: Map<AztecAddress, DelayedPublicMutable<bool, CHANGE_AUTHORIZATION_INITIAL_DELAY_S, C>, C>,\n/// }\n/// ```\n///\n/// Note that this initial delay can be altered during the contract's lifetime via\n/// [`DelayedPublicMutable::schedule_delay_change`].\n///\n/// ## Requirements\n///\n/// The type `T` stored in the `DelayedPublicMutable` must implement the `Eq` and\n/// [`Packable`](crate::protocol::traits::Packable) traits.\n///\n/// ## Implementation Details\n///\n/// This state variable stores more information in public storage than\n/// [`PublicMutable`](crate::state_vars::PublicMutable), as it needs to keep track of the current and scheduled change\n/// information for both the value and the delay - see\n/// [`crate::protocol::delayed_public_mutable::DelayedPublicMutableValues`].\n///\n/// It also stores a hash of this entire configuration so that private reads can be performed in a single historical\n/// public storage read - see [`crate::utils::WithHash`].\n///\n/// This results in a total of `N * 2 + 2` storage slots used, where `N` is the packing length of the stored type `T`.\n/// This makes it quite important to ensure `T`'s implementation of [`Packable`](crate::protocol::traits::Packable) is\n/// space-efficient.\npub struct DelayedPublicMutable<T, let InitialDelay: u64, Context> {\n context: Context,\n storage_slot: Field,\n}\n\n// We allocate `M + 1` slots because we're going to store a `WithHash<DelayedPublicMutableValues<T, InitialDelay>>`,\n// and `WithHash` increases the packing length by one.\nimpl<T, let InitialDelay: u64, Context, let M: u32> StateVariable<M + 1, Context> for DelayedPublicMutable<T, InitialDelay, Context>\nwhere\n DelayedPublicMutableValues<T, InitialDelay>: Packable<N = M>,\n{\n fn new(context: Context, storage_slot: Field) -> Self {\n assert(storage_slot != 0, \"Storage slot 0 not allowed. Storage slots must start from 1.\");\n Self { context, storage_slot }\n }\n\n fn get_storage_slot(self) -> Field {\n self.storage_slot\n }\n}\n\nimpl<T, let InitialDelay: u64> DelayedPublicMutable<T, InitialDelay, PublicContext>\nwhere\n T: Eq,\n{\n /// Schedules a write to the current value.\n ///\n /// The current value does not immediately change. Once the current delay passes,\n /// [`get_current_value`](DelayedPublicMutable::get_current_value) automatically begins to return `new_value`.\n ///\n /// ## Multiple Scheduled Changes\n ///\n /// Only a **single** value can be scheduled to become the new value at a given point in time. Any prior scheduled\n /// changes which have not yet become current are **replaced** with the new one and discarded.\n ///\n /// To illustrate this, consider a scenario at `t0` with a current value `A`. A value change to `B` is scheduled to\n /// occur at `t1`. At some point _before_ `t1`, a second value change to `C` is scheduled to occur at `t2` (`t2 >\n /// t1`). The result is that the current value continues to be `A` all the way until `t2`, at which point it\n /// changes to `C`.\n ///\n /// This also means that it is possible to **cancel** a scheduled change by calling `schedule_value_change` with\n /// the current value.\n ///\n /// ## Examples\n ///\n /// A public setter that authorizes a user:\n /// ```noir\n /// #[external(\"public\")]\n /// fn authorize_user(user: AztecAddress) {\n /// assert_eq(self.storage.admin.read(), self.msg_sender(), \"caller is not admin\");\n /// self.storage.user_authorization.at(user).schedule_value_change(true);\n /// }\n /// ```\n ///\n /// ## Cost\n ///\n /// The `SSTORE` AVM opcode is invoked `2 * N + 2` times, where `N` is `T`'s packed length.\n pub fn schedule_value_change(self, new_value: T)\n where\n T: Packable,\n {\n let _ = self.schedule_and_get_value_change(new_value);\n }\n\n /// Schedules a write to the current value, returning the scheduled entry.\n pub fn schedule_and_get_value_change(self, new_value: T) -> ScheduledValueChange<T>\n where\n T: Packable,\n {\n let mut value_change = self.read_value_change();\n let delay_change = self.read_delay_change();\n\n let current_timestamp = self.context.timestamp();\n let current_delay = delay_change.get_current(current_timestamp);\n\n // TODO: make this configurable https://github.com/AztecProtocol/aztec-packages/issues/5501\n let timestamp_of_change = current_timestamp + current_delay;\n value_change.schedule_change(new_value, current_timestamp, current_delay, timestamp_of_change);\n\n self.write(value_change, delay_change);\n\n value_change\n }\n\n /// Schedules a write to the current delay.\n ///\n /// This works just like [`schedule_value_change`](DelayedPublicMutable::schedule_value_change), except instead of\n /// changing the value in the state variable, it changes the delay that will govern future invocations of that\n /// function.\n ///\n /// The current delay does not immediately change. Once the current delay passes,\n /// [`get_current_delay`](DelayedPublicMutable::get_current_delay) automatically begins to return `new_delay`, and\n /// [`schedule_value_change`](DelayedPublicMutable::schedule_value_change) begins using it.\n ///\n /// ## Multiple Scheduled Changes\n ///\n /// Only a **single** delay can be scheduled to become the new delay at a given point in time. Any prior scheduled\n /// changes which have not yet become current are **replaced** with the new one and discarded.\n ///\n /// To illustrate this, consider a scenario at `t0` with a current delay `A`. A delay change to `B` is scheduled to\n /// occur at `t1`. At some point _before_ `t1`, a second delay change to `C` is scheduled to occur at `t2` (`t2 >\n /// t1`). The result is that the current delay continues to be `A` all the way until `t2`, at which point it\n /// changes to `C`.\n ///\n /// ## Delays When Changing Delays\n ///\n /// A delay change cannot always be immediate: if it were, then it'd be possible to break `DelayedPublicMutable`'s\n /// invariants by setting the delay to a very low or zero value and then scheduling a value change, resulting in a\n /// new value becoming the current one earlier than was predictable based on the prior delay. This would prohibit\n /// private reads, which is the reason for existence of this state variable.\n ///\n /// Instead, delay changes are themselves scheduled and delay so that the property mentioned above is preserved.\n /// This results in delay increases and decreases being asymmetrical.\n ///\n /// If the delay is being decreased, then this requires a delay equal to the difference between the current and new\n /// delay, so that a scheduled value change that occurred as the new delay came into effect would be scheduled for\n /// the same timestamp as if no delay change had occurred.\n ///\n /// If the delay is being increased, then the new delay becomes effective immediately, as new value changes would\n /// be scheduled for a timestamp that is further than the current delay.\n ///\n /// ## Examples\n ///\n /// A public setter that sets the pause delay:\n /// ```noir\n /// #[public]\n /// fn set_pause_delay(delay: u64) {\n /// assert_eq(self.storage.admin.read(), self.msg_sender(), \"caller is not admin\");\n /// self.storage.paused.schedule_delay_change(delay);\n /// }\n /// ```\n ///\n /// ## Cost\n ///\n /// The `SSTORE` AVM opcode is invoked `2 * N + 2` times, where `N` is `T`'s packed length.\n pub fn schedule_delay_change(self, new_delay: u64)\n where\n T: Packable,\n {\n let mut delay_change = self.read_delay_change();\n\n let current_timestamp = self.context.timestamp();\n\n delay_change.schedule_change(new_delay, current_timestamp);\n\n // We can't just update the `ScheduledDelayChange`, we need to update the entire storage because we need to\n // also recompute and write the hash.\n // We _could_ just read everything, update the hash and `ScheduledDelayChange` but not overwrite the\n // `ScheduledValueChange`, resulting in fewer storage writes, but that would require careful handling of\n // storage slots and `WithHash`'s internal layout, which is not worth doing at this point.\n self.write(self.read_value_change(), delay_change);\n }\n\n /// Returns the current value.\n ///\n /// If [`schedule_value_change`](DelayedPublicMutable::schedule_value_change) has never been called, then this\n /// returns the default empty public storage value, which is all zeroes - equivalent to `let t =\n /// T::unpack(std::mem::zeroed());`.\n ///\n /// It is not possible to detect if a `DelayedPublicMutable` has ever been initialized or not other than by testing\n /// for the zero sentinel value. For a more robust solution, store an `Option<T>` in the `DelayedPublicMutable`.\n ///\n /// Use [`get_scheduled_value`](DelayedPublicMutable::get_scheduled_value) to instead get the last value that was\n /// scheduled to become the current one (which will equal the current value if the delay has already passed).\n ///\n /// ## Examples\n ///\n /// A public getter that returns a user's authorization status:\n /// ```noir\n /// #[external(\"public\")]\n /// fn is_authorized(user: AztecAddress) -> bool {\n /// self.storage.user_authorization.at(user).get_current_value()\n /// }\n /// ```\n ///\n /// ## Cost\n ///\n /// The `SLOAD` AVM opcode is invoked `2 * N + 1` times, where `N` is `T`'s packed length.\n pub fn get_current_value(self) -> T\n where\n T: Packable,\n {\n let current_timestamp = self.context.timestamp();\n let value_change = self.read_value_change();\n\n value_change.get_current_at(current_timestamp)\n }\n\n /// Returns the current delay.\n ///\n /// This is the delay that would be used by [`schedule_value_change`](DelayedPublicMutable::schedule_value_change)\n /// if it were called in the current transaction.\n ///\n /// If [`schedule_delay_change`](DelayedPublicMutable::schedule_delay_change) has never been called, then this\n /// returns the `InitialDelay` used in the [`storage`](crate::macros::storage::storage) struct.\n ///\n /// Use [`get_scheduled_delay`](DelayedPublicMutable::get_scheduled_delay) to instead get the last delay that was\n /// scheduled to become the current one (which will equal the current delay if the delay has already passed).\n ///\n /// ## Examples\n ///\n /// A public getter that returns the pause delay:\n /// ```noir\n /// #[external(\"public\")]\n /// fn get_pause_delay() -> u64 {\n /// self.storage.paused.get_current_delay()\n /// }\n /// ```\n ///\n /// ## Cost\n ///\n /// The `SLOAD` AVM opcode is invoked a single time, regardless of `T`.\n pub fn get_current_delay(self) -> u64\n where\n T: Packable,\n {\n let current_timestamp = self.context.timestamp();\n self.read_delay_change().get_current(current_timestamp)\n }\n\n /// Returns the last scheduled value and timestamp of change.\n pub fn get_scheduled_value(self) -> (T, u64)\n where\n T: Packable,\n {\n self.read_value_change().get_scheduled()\n }\n\n /// Returns the last scheduled delay and timestamp of change.\n pub fn get_scheduled_delay(self) -> (u64, u64)\n where\n T: Packable,\n {\n self.read_delay_change().get_scheduled()\n }\n\n fn read_value_change(self) -> ScheduledValueChange<T>\n where\n T: Packable,\n {\n // We don't read ScheduledValueChange directly by having it implement Packable because ScheduledValueChange and\n // ScheduledDelayChange are packed together (sdc and svc.timestamp_of_change are stored in the same slot).\n let packed = self.context.storage_read(self.storage_slot);\n unpack_value_change::<T, <T as Packable>::N>(packed)\n }\n\n fn read_delay_change(self) -> ScheduledDelayChange<InitialDelay>\n where\n T: Packable,\n {\n // Since all ScheduledDelayChange member are packed into a single field, we can read a single storage slot here\n // and skip the ones that correspond to ScheduledValueChange members. We are abusing the fact that the field\n // containing the ScheduledDelayChange data is the first one in the storage layout - otherwise we'd need to\n // offset the storage slot to get the position where it'd land. We don't read ScheduledDelayChange directly by\n // having it implement Packable because ScheduledValueChange and ScheduledDelayChange are packed together (sdc\n // and svc.timestamp_of_change are stored in the same slot).\n let packed = self.context.storage_read(self.storage_slot);\n unpack_delay_change::<InitialDelay>(packed)\n }\n\n fn write(self, value_change: ScheduledValueChange<T>, delay_change: ScheduledDelayChange<InitialDelay>)\n where\n T: Packable,\n {\n // Whenever we write to public storage, we write both the value change and delay change to storage at once. We\n // do so by wrapping them in a single struct (`DelayedPublicMutableValues`). Then we wrap the resulting struct\n // in `WithHash`. Wrapping in `WithHash` makes for more costly writes but it also makes private proofs much\n // simpler because they only need to produce a historical proof for the hash, which results in a single\n // inclusion proof (as opposed to 4 in the best case scenario in which T is a single field). Private delayed\n // public mutable reads are assumed to be much more frequent than public writes, so this tradeoff makes sense.\n let values = WithHash::new(DelayedPublicMutableValues::new(value_change, delay_change));\n\n self.context.storage_write(self.storage_slot, values);\n }\n}\n\nimpl<T, let InitialDelay: u64> DelayedPublicMutable<T, InitialDelay, &mut PrivateContext>\nwhere\n T: Eq,\n{\n /// Returns the current value.\n ///\n /// If [`schedule_value_change`](DelayedPublicMutable::schedule_value_change) has never been called, then this\n /// returns the default empty public storage value, which is all zeroes - equivalent to `let t =\n /// T::unpack(std::mem::zeroed());`.\n ///\n /// It is not possible to detect if a `DelayedPublicMutable` has ever been initialized or not other than by testing\n /// for the zero sentinel value. For a more robust solution, store an `Option<T>` in the `DelayedPublicMutable`.\n ///\n /// ## Privacy\n ///\n /// This function does leak some privacy, though in a subtle way. Understanding this is key to understanding how to\n /// use `DelayedPublicMutable` in a privacy-preserving way.\n ///\n /// Private reads are based on a historical public storage read at the anchor block (i.e.\n /// [`crate::history::storage::public_storage_historical_read`]). `DelayedPublicMutable` is able to provide\n /// guarantees about values read in the past remaining the state variable's current value into the future due to\n /// the existence of delays when scheduling writes. It then sets the `expiration_timestamp` property of the current\n /// transaction (see\n /// [`PrivateContext::set_expiration_timestamp`](crate::context::PrivateContext::set_expiration_timestamp)) to\n /// ensure that the transaction can only be included in a block **prior** to the state variable's value changing.\n /// In other words, it knows some facts about the near future up until some time horizon, and then makes sure that\n /// it doesn't act on this knowledge past said moment.\n ///\n /// Because the `expiration_timestamp` property is part of the transaction's public information, any mutation to\n /// this value could result in transaction fingerprinting. Note that multiple contracts may set this value during a\n /// transaction: it is the smallest (most restrictive) timestamp that will be used.\n ///\n /// If the state variable **does not** have any value changes scheduled, then the timestamp will be set to that of\n /// the anchor block plus the current delay. If multiple contracts use the same delay for their\n /// `DelayedPublicMutable` state variables, then these will all be in the same privacy set.\n ///\n /// If the state variable **does** have a value change scheduled, then the timestamp will be set to equal the time\n /// at which the current value will change, i.e. the one\n /// [`get_scheduled_value`](DelayedPublicMutable::get_scheduled_value) returns - which is public information. This\n /// results in an unavoidable privacy leak of any transactions in which a contract privately reads a\n /// `DelayedPublicMutable` that will change soon.\n ///\n /// Transactions that do not read from a `DelayedPublicMutable` are part of a privacy set in which the\n /// `expiration_timestamp` is set to their anchor block plus [`crate::protocol::constants::MAX_TX_LIFETIME`],\n /// making this the most privacy-preserving delay. The less frequent said value changes are, the more private the\n /// contract is. Wallets can also then choose to further lower this timestamp to make it less obvious that their\n /// transactions are interacting with this soon-to-change variable.\n ///\n /// ## Examples\n ///\n /// A private action that requires authorization:\n /// ```noir\n /// #[external(\"private\")]\n /// fn do_action() {\n /// assert(\n /// self.storage.user_authorization.at(self.msg_sender()).get_current_value(),\n /// \"caller is not authorized\"\n /// );\n ///\n /// // do the action\n /// }\n /// ```\n ///\n /// A private action that can be paused:\n /// ```noir\n /// #[external(\"private\")]\n /// fn do_action() {\n /// assert(!self.storage.paused.get_current_value(), \"contract is paused\");\n ///\n /// // do the action\n /// }\n /// ```\n ///\n /// ## Cost\n ///\n /// This function performs a single merkle tree inclusion proof, which is in the order of 4k gates.\n pub fn get_current_value(self) -> T\n where\n T: Packable,\n {\n // When reading the current value in private we construct a historical state proof for the public value.\n // However, since this value might change, we must constrain the maximum transaction timestamp as this proof\n // will only be valid for the time we can ensure the value will not change, which will depend on the current\n // delay and any scheduled delay changes.\n let (value_change, delay_change, anchor_timestamp) = self.anchor_read_from_public_storage();\n\n // We use the effective minimum delay as opposed to the current delay at the anchor block's timestamp as this\n // one also takes into consideration any scheduled delay changes. For example, consider a scenario in which at\n // timestamp `x` the current delay was 86400 seconds (1 day). We may naively think that the earliest we could\n // change the value would be at timestamp `x + 86400` by scheduling immediately after the anchor block's\n // timestamp, i.e. at timestamp `x + 1`. But if there was a delay change scheduled for timestamp `y` to reduce\n // the delay to 43200 seconds (12 hours), then if a value change was scheduled at timestamp `y` it would go\n // into effect at timestamp `y + 43200`, which is earlier than what we'd expect if we only considered the\n // current delay.\n let effective_minimum_delay = delay_change.get_effective_minimum_delay_at(anchor_timestamp);\n let time_horizon = value_change.get_time_horizon(anchor_timestamp, effective_minimum_delay);\n\n // We prevent this transaction from being included in any timestamp after the time horizon, ensuring that the\n // historical public value matches the current one, since it can only change after the horizon.\n self.context.set_expiration_timestamp(time_horizon);\n\n value_change.get_current_at(anchor_timestamp)\n }\n\n fn anchor_read_from_public_storage(self) -> (ScheduledValueChange<T>, ScheduledDelayChange<InitialDelay>, u64)\n where\n T: Packable,\n {\n let header = self.context.get_anchor_block_header();\n let address = self.context.this_address();\n\n let anchor_timestamp = header.global_variables.timestamp;\n\n let values: DelayedPublicMutableValues<T, InitialDelay> =\n WithHash::historical_public_storage_read(header, address, self.storage_slot);\n\n (values.svc, values.sdc, anchor_timestamp)\n }\n}\n\nimpl<T, let InitialDelay: u64> DelayedPublicMutable<T, InitialDelay, UtilityContext>\nwhere\n T: Eq,\n{\n pub unconstrained fn get_current_value(self) -> T\n where\n T: Packable,\n {\n let dpmv: DelayedPublicMutableValues<T, InitialDelay> =\n WithHash::utility_public_storage_read(self.context, self.storage_slot);\n\n let current_timestamp = self.context.timestamp();\n dpmv.svc.get_current_at(current_timestamp)\n }\n}\n"
|
|
3650
2939
|
},
|
|
3651
|
-
"
|
|
3652
|
-
"path": "/home/aztec-dev/aztec-packages/noir-projects/
|
|
3653
|
-
"source": "
|
|
2940
|
+
"83": {
|
|
2941
|
+
"path": "/home/aztec-dev/aztec-packages/noir-projects/noir-contracts/contracts/protocol/aztec_sublib/src/state_vars/map.nr",
|
|
2942
|
+
"source": "use crate::protocol::{storage::map::derive_storage_slot_in_map, traits::ToField};\nuse crate::state_vars::StateVariable;\n\n/// A key-value container for state variables.\n///\n/// A key-value storage container that maps keys to state variables, similar to Solidity mappings.\npub struct Map<K, V, Context> {\n pub context: Context,\n storage_slot: Field,\n}\n\n// Map reserves a single storage slot regardless of what it stores because nothing is stored at said slot: it is only\n// used to derive the storage slots of nested state variables.\nimpl<K, V, Context> StateVariable<1, Context> for Map<K, V, Context> {\n fn new(context: Context, storage_slot: Field) -> Self {\n assert(storage_slot != 0, \"Storage slot 0 not allowed. Storage slots must start from 1.\");\n Map { context, storage_slot }\n }\n\n fn get_storage_slot(self) -> Field {\n self.storage_slot\n }\n}\n\nimpl<K, V, Context> Map<K, V, Context> {\n /// Returns the state variable associated with the given key.\n ///\n /// This is equivalent to accessing `mapping[key]` in Solidity.\n pub fn at<let N: u32>(self, key: K) -> V\n where\n K: ToField,\n V: StateVariable<N, Context>,\n {\n V::new(\n self.context,\n derive_storage_slot_in_map(self.storage_slot, key),\n )\n }\n}\n"
|
|
3654
2943
|
},
|
|
3655
|
-
"
|
|
3656
|
-
"path": "/home/aztec-dev/aztec-packages/noir-projects/
|
|
3657
|
-
"source": "use crate::macros::{\n calls_generation::{\n external_functions::{generate_external_function_calls, generate_external_function_self_calls_structs},\n internal_functions::generate_call_internal_struct,\n },\n dispatch::generate_public_dispatch,\n internals_functions_generation::{create_fn_abi_exports, process_functions},\n notes::NOTES,\n storage::STORAGE_LAYOUT_NAME,\n utils::{\n get_trait_impl_method, is_fn_contract_library_method, is_fn_external, is_fn_internal, is_fn_test,\n module_has_storage,\n },\n};\n\n/// Marks a contract as an Aztec contract, generating the interfaces for its functions and notes, as well as injecting\n/// the `sync_state` utility function.\n///\n/// Note: This is a module annotation, so the returned quote gets injected inside the module (contract) itself.\npub comptime fn aztec(m: Module) -> Quoted {\n // Functions that don't have #[external(...)], #[contract_library_method], or #[test] are not allowed in contracts.\n check_each_fn_macroified(m);\n\n // We generate new functions prefixed with `__aztec_nr_internals__` and we replace the original functions' bodies\n // with `static_assert(false, ...)` to prevent them from being called directly from within the contract.\n let functions = process_functions(m);\n\n // We generate structs and their implementations necessary for convenient functions calls.\n let interface = generate_contract_interface(m);\n let self_call_structs = generate_external_function_self_calls_structs(m);\n let call_internal_struct = generate_call_internal_struct(m);\n\n // We generate ABI exports for all the external functions in the contract.\n let fn_abi_exports = create_fn_abi_exports(m);\n\n // We generate `_compute_note_hash_and_nullifier`, `sync_state` and `process_message` functions only if they are\n // not already implemented. If they are implemented we just insert empty quotes.\n let contract_library_method_compute_note_hash_and_nullifier = if !m.functions().any(|f| {\n f.name() == quote { _compute_note_hash_and_nullifier }\n }) {\n generate_contract_library_method_compute_note_hash_and_nullifier()\n } else {\n quote {}\n };\n let sync_state_fn_and_abi_export = if !m.functions().any(|f| f.name() == quote { sync_state }) {\n generate_sync_state()\n } else {\n quote {}\n };\n\n let process_message_fn_and_abi_export = if !m.functions().any(|f| f.name() == quote { process_message }) {\n generate_process_message()\n } else {\n quote {}\n };\n let public_dispatch = generate_public_dispatch(m);\n\n quote {\n $interface\n $self_call_structs\n $call_internal_struct\n $functions\n $fn_abi_exports\n $contract_library_method_compute_note_hash_and_nullifier\n $public_dispatch\n $sync_state_fn_and_abi_export\n $process_message_fn_and_abi_export\n }\n}\n\ncomptime fn generate_contract_interface(m: Module) -> Quoted {\n let calls = generate_external_function_calls(m);\n\n let module_name = m.name();\n\n let has_storage_layout = module_has_storage(m) & STORAGE_LAYOUT_NAME.get(m).is_some();\n let storage_layout_getter = if has_storage_layout {\n let storage_layout_name = STORAGE_LAYOUT_NAME.get(m).unwrap();\n quote {\n pub fn storage_layout() -> StorageLayoutFields {\n $storage_layout_name.fields\n }\n }\n } else {\n quote {}\n };\n\n let library_storage_layout_getter = if has_storage_layout {\n quote {\n #[contract_library_method]\n $storage_layout_getter\n }\n } else {\n quote {}\n };\n\n quote {\n pub struct $module_name {\n pub target_contract: aztec::protocol::address::AztecAddress\n }\n\n impl $module_name {\n $calls\n\n pub fn at(\n addr: aztec::protocol::address::AztecAddress\n ) -> Self {\n Self { target_contract: addr }\n }\n\n pub fn interface() -> Self {\n Self { target_contract: aztec::protocol::address::AztecAddress::zero() }\n }\n\n $storage_layout_getter\n }\n\n #[contract_library_method]\n pub fn at(\n addr: aztec::protocol::address::AztecAddress\n ) -> $module_name {\n $module_name { target_contract: addr }\n }\n\n #[contract_library_method]\n pub fn interface() -> $module_name {\n $module_name { target_contract: aztec::protocol::address::AztecAddress::zero() }\n }\n\n $library_storage_layout_getter\n\n }\n}\n\n/// Generates a contract library method called `_compute_note_hash_and_nullifier` which is used for note discovery (to\n/// create the `aztec::messages::discovery::ComputeNoteHashAndNullifier` function) and to implement the\n/// `compute_note_hash_and_nullifier` unconstrained contract function.\ncomptime fn generate_contract_library_method_compute_note_hash_and_nullifier() -> Quoted {\n if NOTES.len() > 0 {\n // Contracts that do define notes produce an if-else chain where `note_type_id` is matched against the\n // `get_note_type_id()` function of each note type that we know of, in order to identify the note type. Once we\n // know it we call we correct `unpack` method from the `Packable` trait to obtain the underlying note type, and\n // compute the note hash (non-siloed) and inner nullifier (also non-siloed).\n\n let mut if_note_type_id_match_statements_list = @[];\n for i in 0..NOTES.len() {\n let typ = NOTES.get(i);\n\n let get_note_type_id = get_trait_impl_method(\n typ,\n quote { crate::note::note_interface::NoteType },\n quote { get_id },\n );\n let unpack = get_trait_impl_method(\n typ,\n quote { crate::protocol::traits::Packable },\n quote { unpack },\n );\n\n let compute_note_hash = get_trait_impl_method(\n typ,\n quote { crate::note::note_interface::NoteHash },\n quote { compute_note_hash },\n );\n\n let compute_nullifier_unconstrained = get_trait_impl_method(\n typ,\n quote { crate::note::note_interface::NoteHash },\n quote { compute_nullifier_unconstrained },\n );\n\n let if_or_else_if = if i == 0 {\n quote { if }\n } else {\n quote { else if }\n };\n\n if_note_type_id_match_statements_list = if_note_type_id_match_statements_list.push_back(\n quote {\n $if_or_else_if note_type_id == $get_note_type_id() {\n // As an extra safety check we make sure that the packed_note BoundedVec has the expected\n // length, since we're about to interpret its raw storage as a fixed-size array by calling the\n // unpack function on it.\n let expected_len = <$typ as $crate::protocol::traits::Packable>::N;\n let actual_len = packed_note.len();\n assert(\n actual_len == expected_len,\n f\"Expected packed note of length {expected_len} but got {actual_len} for note type id {note_type_id}\"\n );\n\n let note = $unpack(aztec::utils::array::subarray(packed_note.storage(), 0));\n\n let note_hash = $compute_note_hash(note, owner, storage_slot, randomness);\n \n // The message discovery process finds settled notes, that is, notes that were created in prior transactions and are therefore already part of the note hash tree. We therefore compute the nullification note hash by treating the note as a settled note with the provided note nonce.\n let note_hash_for_nullification = aztec::note::utils::compute_note_hash_for_nullification(\n aztec::note::HintedNote{\n note,\n contract_address,\n owner,\n randomness,\n storage_slot,\n metadata: aztec::note::note_metadata::SettledNoteMetadata::new(note_nonce).into()\n }\n );\n\n let inner_nullifier = $compute_nullifier_unconstrained(note, owner, note_hash_for_nullification);\n\n Option::some(\n aztec::messages::discovery::NoteHashAndNullifier {\n note_hash, inner_nullifier\n }\n )\n }\n },\n );\n }\n\n let if_note_type_id_match_statements = if_note_type_id_match_statements_list.join(quote {});\n\n quote {\n /// Unpacks an array into a note corresponding to `note_type_id` and then computes its note hash (non-siloed) and inner nullifier (non-siloed) assuming the note has been inserted into the note hash tree with `note_nonce`.\n ///\n /// The signature of this function notably matches the `aztec::messages::discovery::ComputeNoteHashAndNullifier` type, and so it can be used to call functions from that module such as `do_sync_state` and `attempt_note_discovery`.\n ///\n /// This function is automatically injected by the `#[aztec]` macro.\n #[contract_library_method]\n unconstrained fn _compute_note_hash_and_nullifier(\n packed_note: BoundedVec<Field, aztec::messages::logs::note::MAX_NOTE_PACKED_LEN>,\n owner: aztec::protocol::address::AztecAddress,\n storage_slot: Field,\n note_type_id: Field,\n contract_address: aztec::protocol::address::AztecAddress,\n randomness: Field,\n note_nonce: Field,\n ) -> Option<aztec::messages::discovery::NoteHashAndNullifier> {\n $if_note_type_id_match_statements\n else {\n Option::none()\n }\n }\n }\n } else {\n // Contracts with no notes still implement this function to avoid having special-casing, the implementation\n // simply throws immediately.\n quote {\n /// This contract does not use private notes, so this function should never be called as it will unconditionally fail.\n ///\n /// This function is automatically injected by the `#[aztec]` macro.\n #[contract_library_method]\n unconstrained fn _compute_note_hash_and_nullifier(\n _packed_note: BoundedVec<Field, aztec::messages::logs::note::MAX_NOTE_PACKED_LEN>,\n _owner: aztec::protocol::address::AztecAddress,\n _storage_slot: Field,\n _note_type_id: Field,\n _contract_address: aztec::protocol::address::AztecAddress,\n _randomness: Field,\n _nonce: Field,\n ) -> Option<aztec::messages::discovery::NoteHashAndNullifier> {\n panic(f\"This contract does not use private notes\")\n }\n }\n }\n}\n\ncomptime fn generate_sync_state() -> Quoted {\n quote {\n pub struct sync_state_parameters {}\n\n #[abi(functions)]\n pub struct sync_state_abi {\n parameters: sync_state_parameters,\n }\n\n #[aztec::macros::internals_functions_generation::abi_attributes::abi_utility]\n unconstrained fn sync_state() {\n let address = aztec::context::UtilityContext::new().this_address();\n \n aztec::messages::discovery::do_sync_state(address, _compute_note_hash_and_nullifier);\n }\n }\n}\n\ncomptime fn generate_process_message() -> Quoted {\n quote {\n pub struct process_message_parameters {\n pub message_ciphertext: BoundedVec<Field, aztec::messages::encoding::MESSAGE_CIPHERTEXT_LEN>,\n pub message_context: aztec::messages::processing::MessageContext,\n }\n\n #[abi(functions)]\n pub struct process_message_abi {\n parameters: process_message_parameters,\n }\n\n #[aztec::macros::internals_functions_generation::abi_attributes::abi_utility]\n unconstrained fn process_message(\n message_ciphertext: BoundedVec<Field, aztec::messages::encoding::MESSAGE_CIPHERTEXT_LEN>,\n message_context: aztec::messages::processing::MessageContext,\n ) {\n let address = aztec::context::UtilityContext::new().this_address();\n\n aztec::messages::discovery::process_message::process_message_ciphertext(\n address,\n _compute_note_hash_and_nullifier,\n message_ciphertext,\n message_context,\n );\n }\n }\n}\n\n/// Checks that all functions in the module have a context macro applied.\n///\n/// Non-macroified functions are not allowed in contracts. They must all be one of\n/// [external](crate::macros::functions::external), [internal](crate::macros::functions::internal) or `test`.\ncomptime fn check_each_fn_macroified(m: Module) {\n for f in m.functions() {\n let name = f.name();\n if !is_fn_external(f) & !is_fn_contract_library_method(f) & !is_fn_internal(f) & !is_fn_test(f) {\n // We don't suggest that #[contract_library_method] is allowed because we don't want to introduce another\n // concept\n panic(\n f\"Function {name} must be marked as either #[external(...)], #[internal(...)], or #[test]\",\n );\n }\n }\n}\n"
|
|
2944
|
+
"89": {
|
|
2945
|
+
"path": "/home/aztec-dev/aztec-packages/noir-projects/noir-contracts/contracts/protocol/aztec_sublib/src/utils/with_hash.nr",
|
|
2946
|
+
"source": "use crate::{\n context::{PublicContext, UtilityContext},\n history::storage::public_storage_historical_read,\n oracle,\n};\nuse crate::protocol::{\n abis::block_header::BlockHeader, address::AztecAddress, hash::poseidon2_hash, traits::Packable,\n};\n\n/// A struct that allows for efficient reading of value `T` from public storage in private.\n///\n/// The efficient reads are achieved by verifying large values through a single hash check and then proving inclusion\n/// only of the hash in public storage. This reduces the number of required tree inclusion proofs from `M` to 1.\n///\n/// # Type Parameters\n/// - `T`: The underlying type being wrapped, must implement `Packable<N>`\n/// - `M`: The number of field elements required to pack values of type `T`\npub struct WithHash<T, let M: u32> {\n value: T,\n packed: [Field; M],\n hash: Field,\n}\n\nimpl<T, let M: u32> WithHash<T, M>\nwhere\n T: Packable<N = M> + Eq,\n{\n pub fn new(value: T) -> Self {\n let packed = value.pack();\n Self { value, packed, hash: poseidon2_hash(packed) }\n }\n\n pub fn get_value(self) -> T {\n self.value\n }\n\n pub fn get_hash(self) -> Field {\n self.hash\n }\n\n /// Reads the value stored in this [WithHash] from public storage.\n pub fn public_storage_read(context: PublicContext, storage_slot: Field) -> T {\n context.storage_read(storage_slot)\n }\n\n pub unconstrained fn utility_public_storage_read(\n context: UtilityContext,\n storage_slot: Field,\n ) -> T {\n context.storage_read(storage_slot)\n }\n\n pub fn historical_public_storage_read(\n header_to_read_from: BlockHeader,\n address: AztecAddress,\n storage_slot: Field,\n ) -> T {\n // We could simply produce historical inclusion proofs for each field in `packed`, but that would require one\n // full sibling path per storage slot. Instead, we get an oracle to provide us the values, and instead we prove\n // inclusion of their hash, which is both a much smaller proof (a single slot), and also independent of the\n // size of T.\n let hint = WithHash::new(\n // Safety: We verify that a hash of the hint/packed data matches the stored hash.\n unsafe { oracle::storage::storage_read(header_to_read_from, address, storage_slot) },\n );\n\n // The actual `value` (of type T, of packed length M fields) is stored in contiguous fields from the\n // `storage_slot`. The _hash_ of the `value` is stored at the end, at slot: `storage_slot + M`.\n let hash =\n public_storage_historical_read(header_to_read_from, storage_slot + M as Field, address);\n\n if hash != 0 {\n assert_eq(hash, hint.get_hash(), \"Hint values do not match hash\");\n } else {\n // The hash slot can only hold a zero if it is uninitialized. Therefore, the hints must then be zero (i.e.\n // the default value for public storage) as well.\n assert_eq(\n hint.get_value(),\n T::unpack(std::mem::zeroed()),\n \"Non-zero hint for zero hash\",\n );\n };\n\n hint.get_value()\n }\n}\n\nimpl<T, let M: u32> Packable for WithHash<T, M>\nwhere\n T: Packable<N = M>,\n{\n let N: u32 = M + 1;\n\n fn pack(self) -> [Field; Self::N] {\n let mut result: [Field; Self::N] = std::mem::zeroed();\n for i in 0..M {\n result[i] = self.packed[i];\n }\n result[M] = self.hash;\n\n result\n }\n\n fn unpack(packed: [Field; Self::N]) -> Self {\n let mut value_packed = [0; M];\n for i in 0..M {\n value_packed[i] = packed[i];\n }\n let hash = packed[M];\n\n Self { value: T::unpack(value_packed), packed: value_packed, hash }\n }\n}\n"
|
|
3658
2947
|
}
|
|
3659
2948
|
}
|
|
3660
2949
|
}
|