@aztec/protocol-contracts 0.0.1-commit.9ee6fcc6 → 0.0.1-commit.9ef841308
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 +736 -990
- package/artifacts/ContractClassRegistry.json +344 -340
- package/artifacts/ContractInstanceRegistry.json +776 -768
- package/artifacts/FeeJuice.json +998 -1002
- package/artifacts/MultiCallEntrypoint.json +465 -875
- package/artifacts/PublicChecks.json +438 -848
- package/dest/protocol_contract_data.js +37 -37
- package/package.json +4 -4
- package/src/protocol_contract_data.ts +37 -37
|
@@ -1,6 +1,6 @@
|
|
|
1
1
|
{
|
|
2
2
|
"transpiled": true,
|
|
3
|
-
"noir_version": "1.0.0-beta.19+
|
|
3
|
+
"noir_version": "1.0.0-beta.19+0ea490f9eaf15585e3f55d4c44c154f66436e40c",
|
|
4
4
|
"name": "ContractInstanceRegistry",
|
|
5
5
|
"functions": [
|
|
6
6
|
{
|
|
@@ -32,7 +32,7 @@
|
|
|
32
32
|
}
|
|
33
33
|
},
|
|
34
34
|
"bytecode": "JwACBAEoAAABBIBEJwAABEQnAgIEACcCAwQAHwoAAgADAEMlAAAAPC0CAkMnAgMEQycCBAQBOw4ABAADHgIAAwknAgQBASQCAAMAAABTJQAAAn0eAgADASkCAAQA71JTTScCBQABKwIABgAAAAAAAAAAAwAAAAAAAAAALQgBBycCCAQFAAgBCAEnAwcEAQAiBwIILQoICS0OBAkAIgkCCS0OBQkAIgkCCS0OAwkAIgkCCS0OBgktCAEDJwIEBAUACAEEAScDAwQBACIHAgQAIgMCBT8PAAQABScCBAQBACoDBAUtCwUFJwIDAAAKKgUDBCcCAwEACioEAwYkAgAGAAABCCUAAAKPHgIAAwYeAgAEAC8qAAUABAAGHAoGBQQcCgUEAAIqBgQFLAIABAAtXgmLgro3tDuZoTFhGP0g1C9RZsnp8T+16mWpbR4KbQQqBQQGHAoGBwQcCgcFAAIqBgUHBCoHBAYcCgYIAhwKCAcAHAoHCAIcCggJARwKCQcCHAoHCAEcCgcJAAIqBgkKLAIABgAwM+okblBuiY6X9XDK/9cEywu0YDE/tyCynhOeXBAAAQQqCgYJHAoJCwQcCgsKAAIqCQoLBCoLBAkcCgkLAhwKCwQAHAoECwIcCgsMARwKDAQCHAoECwEcCgQMAAIqCQwNBCoNBgkcCgkMBBwKDAYAHAoGCQUWCgsGHAoECwUcCgYEBQQqCwkGHAoKCQUWCggKHAoHCAUcCgoHBQQqCAkKHAoFCQUMKgMJBSkCAAMFAAFRgCQCAAUAAAJoIwAAAlQEKggKBAQqBwMFACoEBQIjAAACfAQqCwYFBCoEAwYAKgUGAiMAAAJ8JioBAAEFT99KitfP8NM8BAIBJioBAAEFursh14IzGGQ8BAIBJg==",
|
|
35
|
-
"debug_symbols": "rZjbbts4EIbfRde+
|
|
35
|
+
"debug_symbols": "rZjbbts4EIbfRde+4Jx4yKsUReAkTmHAcALXXmAR+N13xtJQdgFyW6I31u9f1qfhcIaU9TW97V4uP573x/ePn9PTt6/p5bQ/HPY/ng8fr9vz/uOo7tcU7CPqJ22mKNMTb6YU5kO+HTJNT1EP+g30NyXNRwi4CCQXfor8FLnD7rA7Ai5kERbELNhFWUTyW6QlCsgGFBNxEQVcLA4GcOEOuAMWho4KEV24Q/abbCIugt1hd8QdKYuwmBFNqIPmJHUoqLBQyU7ltIhiDpkwR3NMxC70ctIIidmFORoYiTnJhDl6C7KbzsKd5E5yJ7uTzSkqijocTKjDsJnYRnoTNlJGE3ERNlImE+ZohBzNERNxEcmd5E52J7tjs8PRhDk6CrHZ4WzCHA1MbHZmoY5ohIILR1AWh4ILd9gcMCHzSMUydnMsY7NwxzImaMIcvl43k3fD8/m021kz3LWHNs3n9rQ7nqen4+Vw2Ez/bA+X249+fm6Pt+N5e9KzGsju+KZHBb7vDztT1816dWhfqv1TeLkctNZiRcgjA9qMEjEuiBI5rYT8QMBOFCHXICCshASj48itcXQZwitDJLUY0maQldCNoP0xNA6xJcJjYGrFkHoMXhFFKiHLAyG3CZi9pKismUTAB0DplAQFD6EQY0VAKo9V1UlFCdb6MyOU0GZAbzocQfluIPQLoVOaulj7jCLkNMZA8gbRlZ7bDG4zdFny2hTdW9Zs5N8OQ+eyZqMUaIbRKy0ong2gEFulBR1EQnRE0j1tRfBgj6T2mtWpUE2nbTozJHKkViDYiSRz8kAy32X015WvU6GxJjRBc+H7n4HUIFSX1BwIdSAZQ3ZIRmpng3urOIrXuerU3gmkBwlWPQskEDchsZNUyD6aiAGbiE6ZYnICluZC3htIKQnXcXBuBtGZW33qqh0rnTD6MxtrHFmX5dbMUqdI9ZlRajYo3y3F8AeMWDeVcL+A/RFD6vYaQIYYmgKojAiDjNpyBECjDK4MTGMMkFQZMQ4yitcHIYzGkeNfYNScIoUxBq75wDgYB+ZaHwSjcawPUIQ8xiCpvU8RBxl1HSSGYQb+BUbNKeNg3/Latzzat4lqzyUZnJdc13X9VzvY+6U+VHIIpcn4/X1f/762Fnbp7A6oO6wv7IHvG0YZ3/Xr9nV/enhlczXYab99OeyWr++X4+vd2fO/n37GX/l8nj5ed2+X085I63sf+8f9DfSJFYC/X+1+/wE="
|
|
36
36
|
},
|
|
37
37
|
{
|
|
38
38
|
"name": "public_dispatch",
|
|
@@ -68,7 +68,7 @@
|
|
|
68
68
|
"error_kind": "string",
|
|
69
69
|
"string": "New update delay is too low"
|
|
70
70
|
},
|
|
71
|
-
"
|
|
71
|
+
"9663057235827813545": {
|
|
72
72
|
"error_kind": "fmtstring",
|
|
73
73
|
"length": 27,
|
|
74
74
|
"item_types": [
|
|
@@ -99,8 +99,8 @@
|
|
|
99
99
|
}
|
|
100
100
|
}
|
|
101
101
|
},
|
|
102
|
-
"bytecode": "JwACBAEoAAABBIBUJwAABFQlAAAAQScCAwQBJwIEBAAfCgADAAQAUy0IUwIlAAAA8CcCAgRUJwIDBAA7DgADAAIpAABDAPqRAsspAABEAMB7XhkpAABFAAVVe/onAEYAAywAAEcALc/
|
|
103
|
-
"debug_symbols": "
|
|
102
|
+
"bytecode": "JwACBAEoAAABBIBUJwAABFQlAAAAQScCAwQBJwIEBAAfCgADAAQAUy0IUwIlAAAA8CcCAgRUJwIDBAA7DgADAAIpAABDAPqRAsspAABEAMB7XhkpAABFAAVVe/onAEYAAywAAEcALc/6U80Ocdp7SiJnezNCv8O5BD9Qgb6lg2itAI6qbzcoAABIBQJYLAAASQAwZE5y4TGgKbhQRbaBgVhdKDPoSHm5cJFD4fWT8AAAACcASgQDJwBLBAAnAEwAACcATQEBJwBOBAEnAE8AAScAUAQCJwBRAAIrAABSAAAAAAAAAAADAAAAAAAAAAAmCiICQwMnAgUEACcCBwQDACoFBwYtCAEEAAgBBgEnAwQEAQAiBAIGLQ4FBgAiBgIGLQ4FBicCBgQDACoEBgUnAgUBACkCAAYAA21SfykCAAcA71JTTSkCAAgFAAFRgCQCAAMAAAFbIwAABUktCAEJJwIKBAIACAEKAScDCQQBACIJAgofMABOAE4ACgAiCU4KLQsKCh4CAAkBCiIJSQsWCgsMHAoMDQAEKg0JDAoqCwUJJAIACQAAAbInAg0EADwGDQEeAgAJAC0IAQsnAg0EBAAIAQ0BJwMLBAEAIgsCDS0KDQ4tDgYOACIOAg4tDgkOACIOAg4tDgwOJwINBA4tCAAOLQoLEAAIAA0AJQAAC+otAgAALQoQCTMKAAkACyQCAAsAAAIbJQAADZstCAEJJwILBAQACAELAScDCQQBACIJAgstCgsNLQ4GDQAiDQINLQxGDQAiDQINLQ4KDScCDQQOLQgADi0KCRAACAANACUAAAvqLQIAAC0KEAszCgALAAkkAgAJAAACfyUAAA2tLQgBCScCCwQEAAgBCwEnAwkEAQAiCQILLQoLDS0OBw0AIg0CDS0MTw0AIg0CDS0ODA0nAg0EDi0IAA4tCgkQAAgADQAlAAAL6i0CAAAtChALCiILTAkKKgkFDSQCAA0AAALnJQAADb8eAgAJAC8qAAsACQANACILTwkeAgAOAC8qAAkADgAPACILUQ4eAgAQAC8qAA4AEAARHAoNEgQcChIQABwKEA0FHgIAEAAvKgALABAAEicCFwQYLQgAGC0KEhoACAAXACUAAA3RLQIAAC0KGhAtChsTLQocFC0KHRUtCh4WHgIAEgYMKhIWFyQCABcAAAOcIwAAA3oWChQXHAoUGAUcChcZBQQqGBUXBCoZCBgAKhcYAyMAAAO+FgoQFxwKEBgFHAoXGQUEKhgTFwQqGQgYACoXGAMjAAADvgAqEgMXDioSFxgkAgAYAAAD1SUAAA7vDCoSDQMWCgMNHAoDEgAcCg0DAAQqEg8NBCoDEQ8AKg0PAycCDwQYLQgAGC0KAxotCgobLQoXHC0KEB0tChMeLQoUHy0KFSAtChYhAAgADwAlAAAPAS0CAAAtChoNLQsNDwAiDwIPLQ4PDScCEAQYLQgAGC0KDRoACAAQACUAABBQLQIAAC0KGg8AIg1OEC0LEBAAIg1QES0LEREAIg1KEi0LEhIwCgAQAAswCgARAAkwCgASAA4AIgtGCTAKAA8ACRwKFwkAJwINBAUnAg8EAwAqDQ8OLQgBCwAIAQ4BJwMLBAEAIgsCDi0ODQ4AIg4CDi0ODQ4nAg4EAwAqCw4NLQoNDi0MRw4AIg4CDi0ODA4AIg4CDi0OAw4AIg4CDi0OCg4AIg4CDi0OCQ4nAgMEBQAiCwIKLQsKCicCDAQDACoLDAk3DgAKAAktCwQDACIDAgMtDgMEACIEAgktCwkJJwIKBAMAKgQKAzsOAAkAAyMAAAVJCiICRAMkAgADAAAFWyMAAAidLQgBCScCCgQCAAgBCgEnAwkEAQAiCQIKHzAATgBOAAoAIglOCi0LCgocCgoLBRwKCwkAHAoJCgUeAgAJAQoiCUkLFgoLDBwKDA0ABCoNCQwKKgsFCSQCAAkAAAXBJwINBAA8Bg0BHgIACQAtCAELJwINBAQACAENAScDCwQBACILAg0tCg0OLQ4GDgAiDgIOLQ4JDgAiDgIOLQ4MDicCCQQNLQgADS0KCw8ACAAJACUAAAvqLQIAAC0KDwYzCgAGAAkkAgAJAAAGKiUAAA2bDCIKSAYKKgYFCSQCAAkAAAZBJQAAEgEtCAEGJwIJBAQACAEJAScDBgQBACIGAgktCgkLLQ4HCwAiCwILLQxPCwAiCwILLQ4MCycCCwQMLQgADC0KBg4ACAALACUAAAvqLQIAAC0KDgkKIglMBgoqBgULJAIACwAABqklAAANvx4CAAYALyoACQAGAAsnAhAEES0IABEtCgsTAAgAEAAlAAAN0S0CAAAtChMGLQoUDC0KFQ0tChYOLQoXDx4CAAsGDCoLDxAkAgAQAAAHHiMAAAb8FgoNBhwKDQwFHAoGDQUEKgwOBgQqDQgMACoGDAMjAAAHQBYKBg0cCgYOBRwKDQYFBCoODA0EKgYIDAAqDQwDIwAAB0AMKgMKDCQCAAwAAAduIwAAB1ICKgMKBg4qCgMMJAIADAAAB2klAAASEyMAAAd8JwIMBQAtCgwGIwAAB3wAKgsGDA4qCwwNJAIADQAAB5MlAAAO7x4CAAYALyoACQAGAAsAIglPBh4CAA0ALyoABgANAA4AIglRDR4CAA8ALyoADQAPABAcCgsRBBwKEQ8AHAoPCwUnAhEEEi0IABItCg4ULQoQFS0KCxYtCE0XLQoDGC0ITRktCgoaLQoMGwAIABEAJQAADwEtAgAALQoUDy0LDwMAIgMCAy0OAw8nAgoEEC0IABAtCg8SAAgACgAlAAAQUC0CAAAtChIDACIPTgotCwoKACIPUAstCwsLACIPSgwtCwwMMAoACgAJMAoACwAGMAoADAANACIJRgYwCgADAAYtCwQDACIDAgMtDgMEACIEAgYtCwYGJwIJBAMAKgQJAzsOAAYAAyMAAAidCiICRQMkAgADAAAIryMAAAopHgIABAkkAgAEAAAIwSUAABIlHgIABAEtCAEGJwIJBAQACAEJAScDBgQBACIGAgktCgkKLQ4HCgAiCgIKLQxPCgAiCgIKLQ4ECicCBwQJLQgACS0KBgsACAAHACUAAAvqLQIAAC0KCwQKIgRMBgoqBgUHJAIABwAACS4lAAANvx4CAAYGHgIABwAvKgAEAAcACScCDQQOLQgADi0KCRAACAANACUAAA3RLQIAAC0KEAQtChEHLQoSCi0KEwstChQMDCoGDAkkAgAJAAAJoyMAAAmBFgoKBBwKCgYFHAoEBwUEKgYLBAQqBwgGACoEBgMjAAAJxRYKBAYcCgQJBRwKBgQFBCoJBwYEKgQIBwAqBgcDIwAACcUcCgMEACcCBgQBJwIIBAMAKgYIBy0IAQMACAEHAScDAwQBACIDAgctDgYHACIHAgctDgYHJwIHBAMAKgMHBi0KBgctDgQHACIDAgYtCwYGJwIHBAMAKgMHBDsOAAYABCMAAAopJwIDAlUnAgQCbicCBgJrJwIHAm8nAggCdycCCQIgJwIKAnMnAgsCZScCDAJsJwINAmMnAg4CdCcCDwJyJwIQAnsnAhECfS0IARInAhMEHAAIARMBJwMSBAEAIhICEy0KExQtDgMUACIUAhQtDgQUACIUAhQtDgYUACIUAhQtDgQUACIUAhQtDgcUACIUAhQtDggUACIUAhQtDgQUACIUAhQtDgkUACIUAhQtDgoUACIUAhQtDgsUACIUAhQtDgwUACIUAhQtDgsUACIUAhQtDg0UACIUAhQtDg4UACIUAhQtDgcUACIUAhQtDg8UACIUAhQtDgkUACIUAhQtDhAUACIUAhQtDgoUACIUAhQtDgsUACIUAhQtDgwUACIUAhQtDgsUACIUAhQtDg0UACIUAhQtDg4UACIUAhQtDgcUACIUAhQtDg8UACIUAhQtDhEUCiIFTQMkAgADAAAL6icCBAQeLQgBBicCBwQeAAgBBwEtCgYHKgMABwWGGhNb4cjsqQAiBwIHACISAggnAgkEGy0CCAMtAgcELQIJBSUAABI3JwIIBBsAKgcIBy0MTwcAIgcCBy0OAgcAIgcCBzwOBAYtCAEEJwIFBAUACAEFAScDBAQBACIEAgUtCgUGLQxMBgAiBgIGLQxMBgAiBgIGLQxMBgAiBgIGLQxSBi0ISwMjAAAMLgoiA0sFACIETgYtCwYGACIEUActCwcHJAIABQAADFcjAAAMUi0KBgImBCIDSgUGIgVKCQoqCQMIJAIACAAADHMlAAASaQwiBUoIJAIACAAADIUlAAASewAiAgIJACoJBQgtCwgIACoGCAktAgQDJwAEBAUlAAASjS0IBQYAIgZOCC0OCQgAIgVOCA4qBQgJJAIACQAADMolAAAO7wwiCEoJJAIACQAADNwlAAASewAiAgIKACoKCAktCwkJACoHCQgtAgYDJwAEBAUlAAASjS0IBQcAIgdQCS0OCAkAIgRKBi0LBgYAIgVQCA4qBQgJJAIACQAADSolAAAO7wwiCEoFJAIABQAADTwlAAASewAiAgIJACoJCAUtCwUFACoGBQgtAgcDJwAEBAUlAAASjS0IBQUAIgVKBi0OCAYtCAEEJwIGBAUACAEGAScDBAQBACIFAgYAIgQCBz8PAAYABwAiA04FLQoFAyMAAAwuKgEAAQXVEn0pwtLo7TwEAgEmKgEAAQWuko9rqY6SjDwEAgEmKgEAAQW6uyHXgjMYZDwEAgEmHAoCBAQcCgQDAAIqAgMELAIAAgAtXgmLgro3tDuZoTFhGP0g1C9RZsnp8T+16mWpbR4KbQQqBAIDHAoDBQQcCgUEAAIqAwQFBCoFAgMcCgMGAhwKBgUAHAoFBgIcCgYHARwKBwUCHAoFBgEcCgUHAAIqAwcILAIAAwAwM+okblBuiY6X9XDK/9cEywu0YDE/tyCynhOeXBAAAQQqCAMHHAoHCQQcCgkIAAIqBwgJBCoJAgccCgcJAhwKCQIAHAoCCQIcCgkKARwKCgICHAoCCQEcCgIKAAIqBwoLBCoLAwccCgcKBBwKCgMAHAoDBwUcCgIDBQQqAwcCHAoIAwUcCgUHBQQqBwMFHAoEAwUtCgYELQoDBi0KAgMtCgkCJioBAAEF0Afr9MvGZ5A8BAIBJhwKBAoAHAoJBAAnAgkAICcCDAQNLQgADS0IUQ8tCgkQAAgADAAlAAAS5y0CAAAtCg8LBCoECwkAKgoJBBwKBwkAJwIHAEAnAgsEDC0IAAwtCFEOLQoHDwAIAAsAJQAAEuctAgAALQoOCgQqCQoHACoEBwkcCggEACcCBwBIJwIKBAstCAALLQhRDS0KBw4ACAAKACUAABLnLQIAAC0KDQgEKgQIBwAqCQcEHAoFBwAnAgUAaCcCCQQKLQgACi0IUQwtCgUNAAgACQAlAAAS5y0CAAAtCgwIBCoHCAUAKgQFBxwKBgQAJwIFAHAnAggECS0IAAktCFELLQoFDAAIAAgAJQAAEuctAgAALQoLBgQqBAYFACoHBQQtCAEFJwIGBAQACAEGAScDBQQBACIFAgYtCgYHLQ4EBwAiBwIHLQ4CBwAiBwIHLQ4DBy0KBQImLQgBBCcCBQQFAAgBBQEnAwQEAQAiBAIFLQoFBi0MTAYAIgYCBi0MTAYAIgYCBi0MTAYAIgYCBi0MUgYtCEsDIwAAEJQKIgNLBQAiBE4GLQsGBgAiBFAHLQsHByQCAAUAABC9IwAAELgtCgYCJgQiA0oFBiIFSgkKKgkDCCQCAAgAABDZJQAAEmkMIgVKCCQCAAgAABDrJQAAEnsAIgICCQAqCQUILQsICAAqBggJLQIEAycABAQFJQAAEo0tCAUGACIGTggtDgkIACIFTggOKgUICSQCAAkAABEwJQAADu8MIghKCSQCAAkAABFCJQAAEnsAIgICCgAqCggJLQsJCQAqBwkILQIGAycABAQFJQAAEo0tCAUHACIHUAktDggJACIESgYtCwYGACIFUAgOKgUICSQCAAkAABGQJQAADu8MIghKBSQCAAUAABGiJQAAEnsAIgICCQAqCQgFLQsFBQAqBgUILQIHAycABAQFJQAAEo0tCAUFACIFSgYtDggGLQgBBCcCBgQFAAgBBgEnAwQEAQAiBQIGACIEAgc/DwAGAAcAIgNOBS0KBQMjAAAQlCoBAAEFXm0/LtzNhwk8BAIBJioBAAEFG7xl0D/c6tw8BAIBJioBAAEFT99KitfP8NM8BAIBJgAAAwUHLQADCC0ABAkjAAASWy0BCAYtBAYJAAAIAggAAAkCCQwACAcKJAAACgAAEkkmKgEAAQUFBBuZIK9gTDwEAgEmKgEAAQXkCFBFArWMHzwEAgEmLQEDBgoABgIHJAAABwAAEuItAAEFAAABBAEAAAMECS0AAwotAAULIwAAEsstAQoILQQICwAACgIKAAALAgsMAAoJDCQAAAwAABK5JwEFBAEjAAAS5i0AAwUmJwIHBAInAggBAS0IAQYnAgkEIQAIAQkBJwMGBAEAIgYCCScCCgQgQwOqAAMABwAKAAgACS0CCQMtAgoEJQAAE74nAgMEIScCBwQgLQhOBC0ITwUjAAATPwwqBAMIJAIACAAAE1YjAAATUS0KBQImBCoFBQgCKgcECQ4qBAcKJAIACgAAE3IlAAASEwwqCQcKJAIACgAAE4QlAAASewAiBgILACoLCQotCwoKHAoKCQAEKggCCgQqCQoLAihPCQoEKgoICQAqCwkFACIETggtCggEIwAAEz8tAAMHAAADBAgCAAgCCCMAABPrLQEHBS0BCAYtBAYHLQQFCAAABwIHAgAIAggMAAcICSQAAAkAABPRJg==",
|
|
103
|
+
"debug_symbols": "tZ3dbhy3DoDfxde5ECVREvsqRVGkrXsQIEiLNDnAQZF3PyQlkeMUkscz25vsZ3qXIiXqj5x1/n767fmXr//5+cOn3//46+mHH/9++uXzh48fP/zn549//Pr+y4c/PrH076cg/8TML/COX/Hph8ivGMbr+LmMn0ser9Rf6/i5jp9bGq+tv1Icr1VfU+bXzK8I47X01zJ+LuPnOn4WvY1fWx6vrBdEEXFDIO+g1iGH2H+VQx0AIikCdUDEASlMYMVAAuKB6MlpQhuAU4JTUqak1AFicIcyoIUJOEGaqAyUJ7QOKMZ3qANgSqAMiKKQBFiSAoMY34E1J2QQ4zu0ATglOCVlSsR4BTG+QxkgxnfACdIEDwGK8R1ahyLGd6gDYErEeAUxPgcBGWEOtSLGd2DNmceiiPEd2gCcEpySMiVivIKGikIZIMZ3wAnSBHddEeM7tA5VjO9QB8CUiPEKYjyCAA5IU5LaADEemwBLCntaJbaL/EqCW38l0a2/kmmjv5L41l9JgOuvZMaUJFA7NLGwZAGWVH5PEwsrR3gTw6q8RwzrQANSmtAG5CmRSaggs7DD/DjOj5f5Zunnyn3YqjTKpjaajUpndhifopAnTAlMSTQY9tC0kKaFNC2kPCUy7pWHgNQehSmR4VZo7EWLAmWAWNiqAHaAEIKRycBkwDIKQtKjg7JRm5SiUZmU7RPZPpHtE2ifQPuExMMgk1XTUk1LNS2yrA7i4aAkJIEyqAwC8XIQTgKTyVgMEs1FKCajOkm97FQmZTASzSQk4TOoTpJxYjMU2xSKS2yRIgmqopYdXUou1aVdMYbk6FJwqS7xHWN0LIYJHF2q+97A7GjmRPQm0Bsu3kTxhqs3Ub2Jpk00RTQkl3aPO9LEFEyaQN9LitmRDGUQeVAVm6EM48RqmF2qvslOCbrfgmyjjGiopg90KbmUTJp1hKAqNkPdgqEpVsPo0qibtdiQ1d6oytTejhJ44w25GKJKi2IxlNPJRDKsYplsnIxiWVK9LTpWQ3IpmVR354nFUIdlIDqSoawgE7Vh6RKUZW9iNVQ3BxZDdCmiozYhDmERqeyrPAWTo56JZIyxJUeXyorRsQRpQjZJRjRU3wa6NLo0HqRkqL4NbIYacgOrofom2ytjMSzBMTuSYXVpd1NRRxPVIR3NjmTSKivjRDFdNl2o6qZsu4yirOgbdDoNrIa6gAwshtmlGR3JEF0ZurLiH9MhlP0dalVzZIxrc3PUi4GmQU8FE10KLo0HNHube9Hci+ZetOxSHZYiHdW01wspkmFzaTdSkOTYBHJOAYrg6FI9cw8UZXK84HVfpdIayaYJVZVpn/U36KLb36Ad1d+gy1V/gy5X/Q3afU28IL0pDFSp3EeCLlcNFZuhdt/AYqhhPzA7+seSfyz5x7J/LPvHNDQ6okvRlRVXVlyZLtADxePWBNXjgdmxGXbnO5oUNHYGShMkVz/eFBzRUJ0fmB3JUOc8ZUUy1MnQUSc6oWIxaRk3QxAnFfQKpaCfrYLq4MDsSIZk0qjzmsSrKDOYR0hRrlghCcrYDJSAj3IiYRQpBEG99Q5Ew+LS4tLqUr0ED2yGehUeWA31QjxQGxZzkizCE9GRDCE7ulTdHKhNiEO67090qd7sO3Y3SVGkUaXqplw0GcWLKD2ZZFeZWA3lyD2xGJJLCR1pop4RJpqyDOAoH5MbbczJ35v8vbKVTHQpuhRdWhyrN1HN3uxeZPciuxeow5KSorxB9vKIau9Al0aXRjSUe+JEl2aXysowkQw14zCwGRaXqm8d1bdUFIuhZh8GoiGZtHTfULEYgkvBpdGl0aXJpcml2aXZpehSdGlxaXFpdWlFw+5QR5eSS+kgpYlVQ25gM9TkysBq6G5Wd7Om4IiO3kQfwo7eBHrD6E0Ub9g9ru5xdY+re6zZgYneMHkTZA3rwWCiNdx8YJsPrOYPJqKjNdFSdvQmcnL0JtAb9jFuPsateBPVG67eRPWGmzfRvGHyJsgaJg9l8lAmCI7oaE1oRmKiNaFZiYnahKwEpOtOR109B6IjGWqOdKBLdSHtqItNR11sBk5pCgEc0ZEMITk2w+jS6NIUHath9iayN6y+yf6c9HAykQyLS4tLq0t1A+woZ/KJ1VA9HlgmauJiIhqqb3JySJqniJKAYGyG6pvs/ozVsNsrDkG3t6NLq0u7kR1VAwlqnCnGbllHNASXwkEqOVJJfqSowaVGRrc3puToUg2ugdVQlkweXsViWFxayLBqIjgqkqE4NFAcmmjSFKKjNpEEdanQnkzdN8Wefe54kJKhLhUDJTMcZAiTJqQHasMymgmjo0tlfRgo60OS/EnSfMTAlhybIbmUTJq7b1WxThv0rDGxGEaXRjRMwVH7lxSbYfeto0vRpejS4tI+bhJy2CekSLGvMB21qCBhhLqmykU9aQJ+oNYPclSkiSWoNCmqtBdWVIqKZBhdGl2aXJpcqvub3NkZVSqdWnR9yOJF0Sk9UKsf4kXVRWygSDFoXUekcg9Pml7nw5Kg7rwDXZpcmlyaXaorF4rHVQ8YqCUj3XxQTNdrNs8exWKo2y1WxWLYXKoLtGQIuP4EjiZt6huKb3p1jpJCSHp1jnJ1TppZ58OSYjEsLtW9cCAZ6iYxsBk2l+oa1VEtkwIBozah1TC1rKCiSsVj0l4f6FKd0gOzYzPU5WqgSzVSB6oy6TPqHjdFlUrvkHosV33GYlhdquedgWSoHg9shuRS3f0Fc98sKyhqE1oDVI+lhJBDL6D1EiE4ulRPeAOzYzPU885Al+rcHKjKULB7XBRVWrUkqdKmWAybS/VMO5AMu8cd20QIybEado9JUZpoQUugIpXsByMaqscDXZpdmg9SMtQz7cBmqGfagdWwzs096yV+IhqSS8mk0Q4CjNmxGerRZ2A1jNHRGtac/0BdxOQokTW7r3ssL/bZUZuQwYp6z+rY7ZX+jd3ejiZNITg2w26klpX7GUaxW6bYLevo0uzSjOMokft1XY1Mbm9C8yIVl5ZmWJNjHScF3r2io0sJJ+YQxpmAEQ0hOTbD6NLo0hTHUSJnO5TlnMGxGKJLEQ1LcMxjE85j31SsaZwUsqb0BzaXEjiWcSbIep+fSIaQHV0aXdp9q/okwDzOZN27B+bo6FIEx2JYwjgIMGZHMqwurS5tLm0u7eMmIdd0w27S601jfaBL++Tt2AyLS4tLq0urS3XHGYiO1gRpEqqJm/2WJPnK3G9JTXqSdGAHurS31lFb649GJMPecMcyEPvCP9ClejKX3CZqVZcvivp4hUZUUNQ4A0FdBikqqjQJ6jJI6du3d0/zSZmfv3x+fpYHZQ6Pzvz499Of7z8/f/ry9MOnrx8/vnv67/uPX/VNf/35/pO+fnn/mX/LrT5/+o1fWeHvHz4+C317558O64+CXCTGx0GuBKYCz+vgKY1TB++G9YoOuQqYHXx0W+lIax18QpyuSIrMNLCy01ZkWV6HFZwOW1mBax1cRahDBZXWTAMfnF+oKGsVpcG0gutOdFCBL1TUXV/M3uTT00FBPN8VWKt3RaNVV9BaBydW0lDRKCzDAjZmcIpvjimX9g4q2ksVsFaR5IqgGngfWwXF3gaZwd0GTqcubdiEJh8whgY+2By68lJPQln25C4uYWrgSpkpyHDWBNK0+VCAYWnCJiiLloR6R3LxZNmRbRPXdWrgY9dqMHdegCng28kyqOMmHKLePLoNvGqtvIibkOQ0+ZyeJRxGgyuOL3XE3XiUaJ4QrHVswrKElMyO7Hak81Yk84SrrnFtxS4yQ7bQDBTWOspukk8V6bjmJjo/rNk2IF48l7M8tt1GCLaX8pHsbnhiurDmki/bfBhqy20Ubgd4ivcDPKX7AS5FqnsBvrXiZICncj/AU70b4NthPRfgif7VAD+EZ01wJcBbmjZw6mYZ4HkTneCnI+CrtqloL/fjvDtrtrkZcgLJhwNenq9yvh/eGe+G99aKk+Gd6/3wzu1ueG8HFYjsvBrKalBxswXUGKeKGg/d2fKV4KS8PCThbkfN5gdxzX9lBG6CE6omE3pfVK6hLJVsIgOCJrO7khDXZ2/EnZIAZkng5OdSSbl9bMR689i4c4TzwdH9yG1pxCY4OLlmQY5XzaDgZgAuzdhHh5QQRnRw4m0VHWUTpREsbRAhH+c8vEVHch1tqWM7WxBtFeXE1tKVXYy2GOzS3/jEs1RSHjBbSn3AbCnt9mwpdHO27Bw5O1sq3J4tr4ys7bHQeKdbroO7CCsAdqBeB0fdLKUt17nJcr50eaCuu53eNoV6yK+9ZaKUgp6WoqUbu0U0BJuvIdfDfH1DbzY7ehFnfi8NSLMAp2Mu5DsVbbPRc/V0TlbOWuPBk/JSB+yCy2YJEOSljlf22HxYNWg5W9tmPefqbLSz6KE/Ynx56Gg7QyDbwR5KWCYM2yZEm21NdJhp/9Cwz3vOIA/rpOU2NoiSLzxhOVvb7hZPYHYA38KXq0bbHgRtWzqMKsFpBfJVMPPkcFv7TgXB/XM5xbvn8n13ail/dictD6O0nSh+sGZeJ2EJd764M1z6Wnbp1o5KvkM3oKUd220efVvicv5ye6TdhanU2SFcLVlfxfd2eKCHcrgzfW/HNkyDr2Ap0jrJv1tLo+XH5W6+TAyHuEux212YK+WwrLtA2K2ltXi8H+5N/1SyCRIuf84Y4epmWJZvzncJbroEzl2JI7a1jl2QFE/5lHytqFbAb+YlXSoxpmJnD9GRl2G2K+Rwgdx2ylDqNV/QC4TlkDt6iy81uy+1reti8C8XO1uzqZsorafurqyEfu/Bl6XG74Idyt1q5Xk7alnase0QQh8YqrjukN2KyGcpCxGAGpda4gPqnvF24TM+oPIZ75Y+39KjDdY9erf++Yodh6cDAKGt7XhAETTerYK+5osvQpDrekFN90uhkB5QC4X0gGIopNvV0L0dJ9PpkB5QD4V0uyC6H91zBSNI90uib4jVY078besy2mImf0UiXtRSLJfDi3tYlmjhAQUouF+BgkeUoOB+DQoeUYSCR1Sh4H4ZCh5Qh4IHFKLeEqlpfczcJVR46Y7+GBhvgEtbtiWHsyl2eEhFCh5SkoIH1KTgdlEKHlGVggeUpV4b4HOZ9teC7XAjiWGZHoZdWelkth1Kupluf8WXGMF92UycXQVDvtM2xyYdHkf9PuUOu9rU2bz93hK0oZHvhF1TwoWHqaRQuKiEN91maeIGayX74anNn3tuYb3G7mpUpwvtUOMj1rWaHrGu7UpVZ9e1Xa3q3Lq28+X0urYrV51d1/aGnKu3vxYl5wrusKtZna24v6bkVMn9tblTjwmsjT/pAWUW2BWuTtVZthpOFlqgPeABP2i3n/B7pU9P1lpgX3o6WWwBCrerLa9YcrLcAhQfUG8BSrcLLq9Zcq7iss9SNrtg5BDXT+JT+VdT4Tl4zTiHdu2bQ2ClEvn7feuMK+2ihOdI9vLR+usRMYTdAxKx2AMSebkHx23BJfihAsL64PgWb9rFPkEfHV5c67pP8t0M8it2+Pe62Ka0tqPczpfEXSHrXL5E76l38yUx0N18yd6Os1+6gAc8HRDh9uMB+7E9ly+JkO/nS94QqXW9iuwqWVwjzeD10rI8G8XdF6VOXmHj7ptSp66wr/niGSQuBdWlL7sa0uncT4zwgDtSjPEBd6S4/dbUuTuSfrH21h1p68vZO1Lcfm3q3B3ptQE+l/t5Q7AhwDpM6H6qY38micczyXod2FW1crHtJtcXT6N8t6ztqklnHyTZehP9+ZwcY7t2SvNbsPzNi3WP4L974oz2sDfz+ivJMW2fYiW/AXsd+PQXo/lWZVUxSusr9FZFsbNICHBNBdrR7JiXeIMKnqngAwLXVNicTQDpogq7VvHEu6TCLxGJE6HXVPgztBEuWuEJ0usqrDtjCpdURO+L47M0b1Jhd1Su6V+0wg/bnPu+pCLZszic+Y7XVNg+nXhRv6gi3ldh3ZnjtZmafabmizO1Js9e4LURaXbgSI2uTXaqc9XK4UX+/7QKDPZgFMK1tRPB/rwGH/nxmgpbfhGuTTMEO4oiVLjdFzVes8KSSRjjNSuibYh4PN6/zYrmKurdvojXtmXUv+k3VNClfQT1L2p1FSlctcIcSdeWnGNfpGvbMqbkjlxbcvhz1p28/FxTYfd6VtFu90W9tuQkq1rydelaXORs3Zlzu2iFdWfGdLcv8rVNAKtP9oqXurOCPYlZIR0D/OUhvu0foPLsZlnq2FphB6UKLxw5r8FOrpWLblc0aDJ5pK1CvWSDZ3nii/Xmkga4ZIOmKYaGFK7Z0FwDXLIhoWnAa17YAalejaiDF5c0yP9AYtW7w4r5fT51dy8MdkXmiz9eU2G3EPnvPS6pANs9GNs1FZ7JgUM26E2OWPGQVcS7fXFVhT+8Hl98tfJNKqKrgNsjclVF9czJ4Vsrb1LhI3L861tvUwGmAsJdR66q0P/jYqg4PDz/j7/HsyvjIByOrMerDCdwf+Kf3v/64fOL/0r1m+j6/OH9Lx+fx4+/f/306+G3X/735/zN/K9Y//z8x6/Pv339/Cya/P9j5X9+5OzVO8Ly07snkJ94H+ALFfCPSX7kbDwl+Un+7O+PhfMjhfJP38S0/wM="
|
|
104
104
|
},
|
|
105
105
|
{
|
|
106
106
|
"name": "publish_for_public_execution",
|
|
@@ -2082,9 +2082,9 @@
|
|
|
2082
2082
|
}
|
|
2083
2083
|
}
|
|
2084
2084
|
},
|
|
2085
|
-
"bytecode": "H4sIAAAAAAAA/+2dd3hURdvGM8+zNJHepaP03hQVCyT03sRKDMkCkZDETULRVyX2bgr2AkoVBBGxgxX73FKsKBawYAdR7MJ3KMlusiyZDbkvr++9Xv9xPPvs75mZM6fMzOan5uXeviY9a2JKcsaU+Elpgfj95cR4/0x/YlZmcloqfC226DfZK/umJCRO7Zs2s39WamJsQkpK9sLRfYYP6JeXvXh8cmaqPyNDmjkEqXEIquFCqnW6Q1BdO9shqp5TVCOXWjV2CWriEtTUJaiZU82bO0W1cIo61inqOJfKt3MZCx1dgrq4BHV3Cephspf1DSSnpCRP3vf5nJicnPycnHXNYg7/j8le2icjwx/IPNsfSMvPyc1b16xL0vDA1q7z2j45st/j2dlnntem+9cDZz2Vnhu7dXf+Tu8r0LsPj3234+dTS4O9JyK2RkHhEB2xemRahj85KS2120h/YFpWZsK+az9vTmHHeNUtLLcsLLUK+fyeOdB7ofdB50LnFa15fl7JXdjaIcbL4NQH95eIiom+gm2cKnifUwUfYFSwrVMF5zpVcL5DBUsziu4PKT8QUp4fUp7njaQF0IXQRdDF0fdDO6d+WODUD0sYJ6q9UwUXOlXwQUYFOzhVcJFTBZeSRtKSkPKDIeWlIeXF3khaBn0Iuhy6Ivp+6OjUD8uc+uFhxonq5FTBh5wquJJRwc5OFVzuVMFHSCPp4ZDyypDyIyHlFd5IWgV9FLoa+lj0/dDFqR9WOfXD44wT1dWpgo86VfAJRgW7OVVwtVMFnySNpMdDyk+ElJ8MKT/mjaSnoE9Dn4Guib4fujv1w1NO/bCWcaJ6OFXwaacKPks6UWtDys+GlJ8JKa/xTtRz0OehL0BfLNoPeQ5tPM6phS85TC5Knrd4nGbR17CWUw3XlQAyo2Y71XDd6aWZzrx8+Ow6bfRlpcG+UmLvaGmwr0bEakGhVOP15ZDyK4ecfr3qjdbXoK9D34C+WXQWa/KyF41JTp2c4j/QjhJablo5XHWFwJJnx5q7L3paeoofat2m0y7jyZroR7x3nTidR5RRHdGs6JkonxvdmYgpOSSkc9+Kfq0iN9+hEh7ZrXPfcopaX/IZKE0d1+e6Zi8hKPrsPTxsvsPA6uE0+NY7RW2IdlUqr8ye3Rs4J3CD2z12Y7QvLW7YTYfHXjLxi4tKg307ItZXWNvSPBE2HWI5rnXI5297z4N3oO9C34O+H/Xp8M6G19NuV/07Th3xAelV7oOQ8rsh5fdCyu97nbEZ+iH0I+iWI+zv0Kfu5mJP4I+hn0A/hX4WdY+3aZdDuDO1pVDbtHEb/FsZLWrrlntbtLeJPAdsO6fUnxMewm283nRr+BeHD9qxd+/OItnznG4H27xm5Ts13qsBY8y178igdqBQ27d3O1VfMlrUwS33V4zro6NT6u2E66O915tuDf+acn185TXL6frY7tWAMeY6dWFQO1OonTq5napvGC3q7Jb7W8b10cUp9XeE66OT15tuDf+ecn186zXL6fr4zqsBY8x17c6gdqNQu3Z1O1U/MFrUzS33j4zro7tT6h2E66Or15tuDd9JuT5+9JrldH3s8GoQ7ZhznKv+dHhsp/FVB5cGuysitkphbUszJfupsNymsNQ25PNd3oTsZ+gv0N3QX1m/I/jZqQ9++/d+R/CLUwV///d+R7DbqYJ/kNYPfgsp/x5S/iOk/Ks3kv6E/gX9G/oP63cEfzr1w55/73cEfzlVcO+/9zuCv10q6IshjaQ9IeW9wbIvJuT4P3PgM/AJfAqfj/Q7Ap9x6ody/9rvCHziVMHy/9rvCHzqVMEKnJHkKxdSLh9SrhBS9nkjqSJ8leA7Cr7KpN8R+Co69cPRpH44OqRcKaR8VEi5stcPVeCrCl81+KqX4v3EV+Pwtb/gjsEoVe1rhJSrhNwDPi66aOyrCV8t+GrDV6foZqFEuVnokUo+D3mF24W+usFivVL8yjnfrUpOp6BueNS5xaI8Vj2HYVakBzXvsPvUxTNE2911S65PcHfWV7/Mtr599Q9xKtw6uXi64vk9thOrQYm9GePUkgZ2dmmaUs8pyq0px4Q3pfiXnJpyzCH/NGLFsKyUzOQxiQkpCQGvOCc/e0lsWmpGZkJqpsNgCI+V9bUmZJVfcF5ix9ZV+v1Uv+acK05bd9Plp7XuEAU3JrTadUPK9aKpXD58DeFrBF/jQzR7Zb9pE/1JSf6k2KzAdH+fpCSv4cE8DUPKjULKjYNB7QtLHYJ/DBJl9ZrA1xS+Yj/B8EV9V21ScoeW5q9E3DZX4TSGm5fRjaV5sc4qlx/ND33KZy/sEwgkzNoS09glPNYlKM0lKNUlKNMlKOASlOASlFhmdRpUZl2QUWZ1SiizOjn1k9PwG+kSlOUSNNElKMUlKLnMTsuUMuunJJegk1yCmrkEXewSdMnBW8fc/cH1hk49pdrGAW2++HvCmN9WTVw2p2f/xVtbbvthwtxPeu98dFvnMrxzO9243fK1dMlWRr+/dAO1LitQm7ICtS0rUPuyAnUoK1CnsgJ1LitQ17ICdXMAuf+qzGH3gvY+5Wvu9D7Voozep1o0i34PLMahHT0Zm2/GIfHxjMTikPgERmJ1SNyrNIlLgp7otJL+XLSpXa7lkxgd6XNIfDIjcTmHxL0Zics7JD6FkbiCQ+JTGYkrOiQ+jZG4kkPi0xmJj3JI3IeRuLJD4r6MxEc7JI5lJK7ikDiOkbiqQ+J+jMTVHBL3ZySu7pB4ACNxDYfEAxmJazokHsRIXMsh8WBG4toOiYcwEtdxSDyUkbiuQ+JhjMT1HBIPZySu75B4BCNxA4fEIxmJj3FIPIqRuKFD4tGMxI0cEo9hJG7skHgsI3ETh8TjGImbOiQ+g5G4mUPi8YzEzR0Sn8lI3MIh8VmMxMc6JD6bMek+hwE9l7EycZ7TysQ6xtk5zqF6Exhtji+jNcFSnMPzGdAEBnQiA5rIgCYxoH4GdBIDOpkBncKAJjOgFzCgUxnQFAZ0GgOayoCmMaDpDOiFDGiAAc1gQDMZ0CwGdDoDOoMBncmAzmJAL2JAL2ZA/8OAXsKAXsqAXsaA2tkUajaFejmFegWFeiWFehWFejWFeg2Fei2Feh2Fej2FegOFeiOFehOFejOFeguFmkOh5lKoeVFS8xz+oL3VPidkybn3yy2ty2KOdfoLEn2NsZBk5zjlfomS+9a8EsUEe7w+pIyM2yjU2ynUOyjUOynUuyjUuynUeyjUeynU+yjUuRTqPAr1fgr1AQp1PoW6gEJdSKEuolAXU6hLKNQHKdSlFOoyCvUhCnU5hbqCQn2YQl1JoT5Coa6iUB+lUFdTqI9RqI9TqE9QqE9SqE9RqE9TqM9QqGso1LUU6rMUKuXvTezzFOoLFOqLFOpLUfry3ajrKHV9mUJ9hUJ9lUJ9jUJ9nUJ9g0J9k0LlrDyBQn2LQl1PoW6gUDdSqJso1Lcp1Hco1Hcp1Pco1Pcp1A8o1M0U6ocU6kcU6hYK9WMK9RMK9VMK9TMKdSuFuo1C/ZxC/YJC/ZJC/YpC3U6hfk2hfkOhfkuhfkehfk+h/kCh/kih7qBQd1KoP1GouyjUnynUXyjU3RTqrxTqbxTq7xTqHxTqnxTqXxTq3xTqPxTqHgp1L4MKE8PBGg5WOFjlYH0cbDkOtjwHW4GDrcjBVuJgj+JgK3OwR3OwVTjYqhxsNQ62Ogdbg4OtycHW4mBrc7B1ONi6HGw9DrY+B9uAgz2Gg23IwTbiYBtzsE042KYcbDMOtjkH24KDPZaDPY6DbcnBtuJgW3OwbTjYthxsOw62PQfbgYPtyMF24mA7c7BdONiuHGw3DrY7B9uDg+3JwR7PwZ7AwfbiYE/kYE/iYE/mYHtzsKdwsKdysKdxsKdzsH042L4cbCwHG8fB9uNg+3OwAzjYgRzsIA52MAc7hIMdysEO42CHc7AjONiRHOwoDnY0BzuGgx3LwY7jYM/gYMdzsGdysGdxsGdzsOdwsOdysOdxsBM42HgO9nwONoGDncjBJnKwSRysn4OdxMFO5mCncLDJHOwFHOxUDjaFg53GwaZysGkcbDoHeyEHG+BgMzjYTA42i4OdzsHO4GBncrCzONiLONiLOdj/cLCXcLCXcrCXcbCzOdhsDvZyDvYKDvZKDvYqDvZqDvYaDvZaDvY6DvZ6DvYGDvZGDvYmDvZmDvYWDjaHg83lYPM42HwOdg4HeysHexsHezsHewcHeycHexcHezcHew8Hey8Hex8HO5eDncfB3s/BPsDBzudgF3CwCznYRRzsYg52CQf7IAe7lINdxsE+xMEu52BXcLAPc7ArOdhHONhVHOyjHOxqDvYxDvZxDvYJDvZJDvYpDvZpDvYZDnYNB7uWg32Wg32Og32eg32Bg32Rg32Jg13Hwb7Mwb7Cwb7Kwb7Gwb7Owb7Bwb7JwVoOFhzsWxzseg52Awe7kYPdxMG+zcG+w8G+y8G+x8G+z8F+wMFu5mA/5GA/4mC3cLAfc7CfcLCfcrCfcbBbOdhtHOznHOwXHOyXHOxXHOx2DvZrDvYbDvZbDvY7DvZ7DvYHDvZHDnYHB7uTg/2Jg93Fwf7Mwf7Cwe7mYH/lYH/jYH/nYP/gYP/kYP/iYP/mYP/hYPdwsBz/rXD8t8Lx3wrHfysc/61w/LfC8d8Kx38rHP+tcPy3wvHfCsd/Kxz/rXD8t8Lx3wrHfysc/61w/LfC8d9KTQ6W478Vjv9WOP5b4fhvheO/FY7/Vjj+W+H4byVq/22eE7ZRXsn/D1T4ON5ZacxpUxOXNilnS084Ll3huHSF49IVjktXOC5d4bh0hePSFY5LVzguXeG4dIXj0hWOS1c4Ll3huHSF49IVjktXOC5d4bh0hePSlW4cLMelKxyXrnBcusJx6QrHpSscl65wXLrCcekKx6UrHJeucFy6wnHpCselKxyXrnBcusJx6QrHpSscl65wXLrCcekKx6UrHJeucFy6wnHpCselK0NLnsaXBstx6QrHpSscl65wXLrCcenKaA6W49IVjktXOC5d4bh0hePSFY5LVzguXeG4dIXj0hWOS1c4Ll3huHSF49IVjktXOC5d4bh0hePSFY5LVzguXZm0rlmDep/33Hj+WTFvj9k+8bq3dj+Sv+f+eXfk3zT/y771ztg7tPGm8E2PErcz9m/klJycY9yVKdG+qbm0qaVT6qitvC6pWzmlvoCRurVT6qmM1G2cUqcwUrd1Sj2Nkbq9U+pURuoOTqnTGKk7OaVOZ6Tu7JT6Qkbqrk6pA4zU3ZxSR2s/zs132ereAN3odiPnaJKFo0mW6Ydv/I69e3eVBjujNOe/ZOxMp59akHbkOTJl4ciUhSNTFo5MWTgyZeHIlIUjUxaOTFk4MmXhyJSFI1MWjkxZODJl4ciUhSNTFo5MWTgyZeHIlIUjUxaOTFk4MmXhyJSFI1MWjkxZODJlyeNgOTJl4ciUhSNTFo5MWTgyZeHIlIUjUxaOTFk4MmXhyJSFI1MWjkxZODJl4ciUhSNTFo5MWTgyZeHIlIUjUxaOTFk4MmXhyJSFI1MWjkxZODJl4ciUhSNTFo5MWTgyZeHIlIUjU5ZVHCxHpiwcmbJwZMrCkSkLR6YsHJmycGTKwpEpC0emLByZsnBkysKRKQtHpiwcmbJwZMrCkSkLR6YsHJmycGTKwpEpC0emLByZsnBkysKRKQtHpiwcmbKQ/vKaI1MWjkxZODJl4ciUZRMHy5EpC0emLByZsnBkysKRKQtHpiwcmbJwZMrCkSkLR6YsHJmycGTKwpEpC0emLByZsnBkysKRKQtHpiwcmbJwZMrCkSkLR6YsHJmycGTKwpEpC0emLByZsnBkysKRKQtHpiwcmbLs4mA5MmXhyJSFI1MWjkxZODJl4ciUhSNTFo5MWTgyZeHIlIUjUxaOTFk4MmXlyJSVI1NWjkxZOTJl5ciUlSNTVo5MWTkyZeXIlJUjU1aOTFk5MmXlyJSVI1NWjkxZOTJl5ciUlSNT1pocLEemrByZsnJkysqRKStHpqwcmbJyZMrKkSlrQw62EQfbmIPlSJ2VI0BWjgBZOX9uqRwBsnIEyMoRICtHgKwcAbJyBMjKESArR4CsHAGycgTIyhEgK0eArBwBsnIEyMoRICtHgKzdOFiOAFk5AmTlCJCVI0BWjgBZOQJk5QiQlSNAVo4AWTkCZOUIkJUjQFaOAFk5AmTlCJCVI0BWjgBZOQJk5QiQlSNAVo4AWTkCZOUIkJUjQFaOAFmHcrAcAbJyBMjKESArR4CsHAGyjuZgOQJk5QiQlSNAVo4AWTkCZOUIkJUjQFaOAFk5AmTlCJCVI0BWjgBZOQJk5QiQlSNAVo4AWTkCZOUIkJUjQNZJHCxHbaxTONhkDvYCDnYqB5vCwU7jYFM52DQONp2DvZCDDXCwGRwsx5KrHEuuTudgZ3CwMzlYjv9WOf5b5fhvleO/VY7/Vjn+W+X4b5Xjv1WO/1Y5/lvl+G+V479Vjv9WOf5b5fhvleO/VY7/Vjn+W+X4b5Xjv1WO/1Y5/lvl+G+V479Vjv9W8zhYjv9WOf5b5fhv9TbK/yZSOf5b5fhvleO/VSf/7TD/tLTArEGpyZn5NbfopJ7Hn9DrxJNO7n3Kqaed3qdvbFy//gMGDho8ZOiw4SNGjho9Zuy4M8afedbZ55x73oT48xMmJib5J02eknzB1JRpqWnpFwYyMrOmz5g566KL/3PJpZfZ2TbbXm6vsFfaq+zV9hp7rb3OXm9vsDfam+zN9habY3Ntns23c+yt9jZ7u73D3mnvsnfbe+y99j47186z99sH7Hy7wC60i+xiu8Q+aJfaZfYhu9yusA/blfYRu8o+alfbx+zj9gn7pH3KPm2fsWvsWvusfc4+b1+wL9qX7Dr7sn3Fvmpfs6/bN+yb1lrYt+x6u8FutJvs2/Yd+659z75vP7Cb7Yf2I7vFfmw/sZ/az+xWu81+br+wX9qv7Hb7tf3Gfmu/s9/bH+yPdofdaX+yu+zP9he72/5qf7O/2z/sn/Yv+7f9x+6xe2FiYAyMwCiMD6YcTHmYCjAVYSrBHAVTGeZomCowVWGqwVSHqQFTE6YWTG2YOjB1YerB1IdpAHMMTEOYRjCNYZrANIVpBtMcpgXMsTDHwbSEaQXTGqYNTFuYdjDtYTrAdITpBNMZpgtMV5huMN1hesD0hDke5gSYXjAnwpwEczJMb5hTYE6FOQ3mdJg+MH1hYmHiYPrB9IcZADMQZhDMYJghMENhhsEMhxkBMxJmFMxomDEwY2HGwZwBMx7mTJizYM6GOQfmXJjzYCbAxMOcD5MAMxEmESYJxg8zCWYyzBSYZJgLYKbCpMBMg0mFSYNJh7kQJgCTAZMJkwUzHWYGzEyYWTAXwVwM8x+YS2AuhbkMZjZMNszlMFfAXAlzFczVMNfAXAtzHcz1MDfA3AhzE8zNMLfA5MDkwuTB5MPMgbkV5jaY22HugLkT5i6Yu2HugbkX5j6YuTDzYO6HeQBmPswCmIUwi2AWwyyBeRBmKcwymIdglsOsgHkYZiXMIzCrYB6FWQ3zGMzjME/APAnzFMzTMM/ArIFZC/MszHMwz8O8APMizEsw62BehnkF5lWY12Beh3kD5k0YCwOYt2DWw2yA2QizCeZtmHdg3oV5D+Z9mA9gNsN8CPMRzBaYj2E+gfkU5jOYrTDbYD6H+QLmS5ivYLbDfA3zDcy3MN/BfA/zA8yPMDtgdsL8BLML5meYX2B2w/wK8xvM7zB/wPwJ8xfM3zD/wOyB2QuJgRiIQBTig5SDlIdUgFSEVIIcBakMORpSBVIVUg1SHVIDUhNSC1IbUgdSF1IPUh/SAHIMpCGkEaQxpAmkKaQZpDmkBeRYyHGQlpBWkNaQNpC2kHaQ9pAOkI6QTpDOkC6QrpBukO6QHpCekOMhJ0B6QU6EnAQ5GdIbcgrkVMhpkNMhfSB9IbGQOEg/SH/IAMhAyCDIYMgQyFDIMMhwyAjISMgoyGjIGMhYyDjIGZDxkDMhZ0HOhpwDORdyHmQCJB5yPiQBMhGSCEmC+CGTIJMhUyDJkAsgUyEpkGmQVEgaJB1yISQAyYBkQrIg0yEzIDMhsyAXQS6G/AdyCeRSyGWQ2ZBsyOWQKyBXQq6CXA25BnIt5DrI9ZAbIDdCboLcDLkFkgPJheRB8iFzILdCboPcDrkDcifkLsjdkHsg90Lug8yFzIPcD3kAMh+yALIQsgiyGLIE8iBkKWQZ5CHIcsgKyMOQlZBHIKsgj0JWQx6DPA55AvIk5CnI05BnIGsgayHPQp6DPA95AfIi5CXIOsjLkFcgr0Jeg7wOeQPyJsRCAHkLsh6yAbIRsgnyNuQdyLuQ9yDvQz6AbIZ8CPkIsgXyMeQTyKeQzyBbIdsgn0O+gHwJ+QqyHfI15BvIt5DvIN9DfoD8CNkB2Qn5CbIL8jPkF8huyK+Q3yC/Q/6A/An5C/I35B/IHsheaAzUewwLVKE+aDloeWgFaEVoJehR0MrQo6FVoFWh1aDVoTWgNaG1oLWhdaB1ofWg9aENoMdAG0IbQRtDm0CbQptBm0NbQI+FHgdtCW0FbQ1tA20LbQdtD+0A7QjtBO0M7QLtCu0G7Q7tAe0JPR56ArQX9EToSdCTob2hp0BPhZ4GPR3aB9oXGguNg/aD9ocOgA6EDoIOhg6BDoUOgw6HjoCOhI6CjoaOgY71tvy97XlvK93b9va2qL3tZG/r19um9bZUve1Pb6vS21b0tgC97Tpva83bBvO2rLztJW8ryNu28bZYvO0Qb+vC22bwtgS85Xtvqd1bFveWsL3lZm9p2FvG9ZZcveVRbynTW3b0lgi95Txv6c1bJvOWtLzlJ2+pyFvW8ZZgvOUSb2nDW4bwlgy86b03Ffemzd4U15uOelNHb5rnTcm86ZM31fGmJd4Uwnvd917Nvddo75XXez31XiW91z7vFc17nVo62p+ZFUiNS8hM2BLTM8aI+sqVr1Cx0lGVj65StVr1GjVr1a5Tt179Bsc0bNS4SdNmzVsce1zLVq3btG3XvkPHTp27dO3WvUdOzpaYWnnZC/okJgc65K3fUOG7X958ZXJOzsFDncIPHR9+KDZv/YlJbZJm/dw7reBQXPihQXnrK/2+dsJ131fNLDg0ODxqSPihkeFfHBUeNTr80PjwL54ZHnVW+KEJ4V+ckbd+eeVNfdfOrTih4NCs8EOXhneOzQ45dnve5jYJ+9+b4xPTpqUnZCZPTPHHpwUSEr1/TfcHMpLTUuNnBBLS0/2BudkLY9NSMzLzsxfFJQf8iZmSvXhQaqZ/sj8wf1z3biW/cBf/vonq+7Pjin8/Jrr8cdkLYhNSUnIrF3KWjPaneE2e7o+yJTHhBI2W8NC+uiR5V0psWvqswibFhdYpBH6g5lWOuOZxZVDzBWMy09Jz8yLUtNg5il3YP9mfUvIWfs1FB+4d2cv6pwX8yZNT9zX41s2tEy7K9CfGZ2WmxB8YprGFo3TE/kF6xoExmpOTm738wEytT1JSwJ+RUViB3OxFY5Knpaf4D9TkYJ681ckZ8alZKSnJk5L9gfh0f2pScurkLTHV/+VB3v8IB3n/8BPsi44g4YRyZTO4Y0PrFAKfPyxtepHhVBhf7BMNXiYFF8SBiIOH+4VCjnSg9zvinjThl4qGwooM9TUHRnp6YHp8csbwgoE58sC4DBvcQUrh8C6s2wPjuuZFjJeIn2he0Qul2H+FnaRgFQouqRVJ/n0PkbQMf/yU5NTMLTF1/vsuJi1tC0o7iBwupiKDKvLFdMhLpsgDJ9LFpEfcirgjvqlI+MVU5Cbita5YBQ/xjFwwrmu3XmGhof13cLQv75ucmhCYtf8/RqTPCQmYPyZrYgmPvuCnBQ+/Wl1j3m/6ac9Z7esenzZi+pWfjl1+ae35bbdXq/9jVu/pf2xJi5yv3PxhWSkRWhX5ktTwO2eQWHC5LknJLLhQ6/3vqfe/p97+f/hPvchDfVG/C7MSUjIijOhFg7OmpQ+aFIItVzN7wb6DudUPc70uGeo95cZOSUiN9Ga9n1DncG/W3gPVodXFzlqRK7UgicNDdHPL1LTM5Emz4hMD/oRMf1LIS+rBaVl6IG3mrHv/30/G/vserZX/H0zPik6vmgVfOg+MutgDg67w/fMQ86ogN8LMalVK2uSCsXpw6WBLzKh/ebymH+F4TT/i50PHcEL5Mh+v5ULhB99zCqMKC8EbW69iQXHBQuSgfsFC5KD+wULkoAHBQuSggcFC5KBBwULkoMHBQuSgIcFC5KChwULkoGHBQuSg4cFC5KARwULkoJHBQuSgUcFC5KDRwULkoDHBQuSgscFC5KBxwULkoDOChchB44OFyEFnBguRg84KFiIHnR0sRA46J1iIHHRusBA56LxgIXLQhGAhclB8sBA56PxgITQo8lPwSJ9dcUd8h2xcvHblgo+LMHaF6NhNspcdeMn0vjQi/dZC8HzvwbgPEMwUkmH5IG/9Zn/vHNnDwxRLHkxRmD68zcUm9Bo+Pzz4iS+0ykU+Kf488d5y+hxubnnE72QJRzwGqhHHQPX/ojHgK8sxUHwpxosZesRvw+n8t+FDnc0Kxc+mBnuiSMdUDAYUOV4p2KeHTHDUwYluaI5CVoXgRLcgfEj2gqFpCUmFB8oHv7TQa17AH565/KEzVyzetIrBcXLIL1Qq/oVKwS8cmNTGFWzcHOn7cbVIw7t8+PDWSNU+3DXhC/lS6CxoeXCPyZu55OTMOczi+YMD/QnpfQKBhFkhQ6p844jfKHfob1SoNucQy/a9shceCDzUmn6vxmEH9zev+FcOzMWqFUzGVh649Xg545NTvQ3dzDuLT4TqHOFErHbZTGJigvUpBBefMjruJcaELQcVXKcFK0zFc0rYRacVwyacjtlNpOwx8+OSpwefEIV1KLhFFTa7oCP+D6kpOwUmmQEA",
|
|
2086
|
-
"debug_symbols": "
|
|
2087
|
-
"verification_key": "
|
|
2085
|
+
"bytecode": "H4sIAAAAAAAA/+2dd3hURdvGM8+zdOldeu8dFBULhC69iJUYyAKRkMRNQtFXJfZuCvYCShUEEbGDFfvcUqwoFrBgB1HswncoyW6yLJlNcl9e33u9/uO4++zvmZkzs+fMzOan5mTfvi41Y1JSYtq0uCkpgbiD5clx/tn+yRnpiSnJ8LXZprszV/dLip88vV/K7IEZyZNj45OSMheP6Tti0ICczKUTEtOT/Wlp0tQhSI1DUHUXUs3THILq2LkOUXWdohq61KqRS1Bjl6AmLkFNnWrezCmquVNUC6eoli6Vb+8yFjq5BHV1CerhEtTTZK7oF0hMSkqceuD9eTFZWblZWRuaxhz9H5O5vG9amj+QfrY/kJKblZ2zoWnXhBGB7d0WtHty1IDHMzPPPK9tj68Hz3kqNTt2+97c3d5HoHcfHftup8+nFwd7T0Rs9bzCETpi7aiUNH9iQkpy91H+wIyM9PgDcz9nXn7HeNXNL7fKL7UOef+eedB7ofdB50MXFKx5bk7RXdjGIcbL4NQH9xeJiom+gm2dKnifUwUfYFSwnVMF5ztVcKFDBYsziu4PKT8QUl4YUl7gjaRF0MXQJdCl0fdDe6d+WOTUD8sYF6qDUwUXO1XwQUYFOzpVcIlTBZeTRtKykPKDIeXlIeWl3khaAX0IuhK6Kvp+6OTUDyuc+uFhxoXq7FTBh5wquJpRwS5OFVzpVMFHSCPp4ZDy6pDyIyHlVd5IWgN9FLoW+lj0/dDVqR/WOPXD44wL1c2pgo86VfAJRgW7O1VwrVMFnySNpMdDyk+ElJ8MKT/mjaSnoE9Dn4Gui74fejj1w1NO/bCecaF6OlXwaacKPku6UOtDys+GlJ8JKa/zLtRz0OehL0BfLNgPOQ5tbOnUwpccFhdFr1s8TtPoa1jTqYYbigCZ0XOdarjhtOIsZ14+enadMeay4mBfKbJ3tDjYVyNiNa9QrPH6ckj5lSMuv171Rutr0Nehb0DfLLiKNTmZS8YmJk9N8h9qRxEtN60dZl0+sOjVsWYfiJ6RmuSHWrfltMt4sib6Ee/NE6friFKqI5oWvBJls6O7EjFFh4R07lvR71Vk5zpUwiO7de5bTlEbi74CxanjxmzX7EUERZ+9p4fNdRhYPZ0G30anqE3R7krllNq9exPnAm5y+47dHO1Dixt2y9Gxl0z64qLiYN+OiPXl17Y4d4QtR9iOaxPy/tve/eAd6LvQ96DvR305vKvh9bTbrH/HqSM+ID3KfRBSfjek/F5I+X2vM7ZCP4R+BN1Wwv4OvetuLXQH/hj6CfRT6GdR93jb9lmEb6Z2FGrbtm6DfzujRe3ccu+I9msixwHb3in154SbcFuvN90a/sXRg3bt37+7QPYcp6+DHV6zcp0a79WAMeY6dGJQO1KoHTq4XaovGS3q6Jb7K8b86OSUeidhfnTwetOt4V9T5sdXXrOc5sdOrwaMMde5K4PahULt3NntUn3DaFEXt9zfMuZHV6fU3xHmR2evN90a/j1lfnzrNctpfnzn1YAx5rr1YFC7U6jdurldqh8YLerulvtHxvzo4ZR6F2F+dPN6063huynz40evWU7zY5dXg2jHnONa9aejYztPqDK0ONg9EbGV82tbnCXZT/nltvmldiHv7/EWZD9Df4Huhf7K+h3Bz0598Nu/9zuCX5wq+Pu/9zuCvU4V/IO0f/BbSPn3kPIfIeVfvZH0J/Qv6N/Qf1i/I/jTqR/2/Xu/I/jLqYL7/73fEfztUkFfDGkk7Qsp7w+WfTEhr/8zDz4Dn8Cn8PlIvyPwGad+KPOv/Y7AJ04VLPuv/Y7Ap04VLMcZSb4yIeWyIeVyIWWfN5LKw1cBvorwVSL9jsBX3qkfjiH1wzEh5Qoh5Yoh5UpeP1SGrwp8VeGrVoznE1/1o9f+gjuGoli1rx5SrhzyHfBxwU1jXw34asJXC77aBQ8LJcrDQo9U9HXIyT8u9NUJFusW41fOuW5VcroEdcKjzi0U5bHqOgyzAj2oOUc9py6cIdrurlN0fYKns756pXb07at3hEvh1smF0xXO77GdWPWL7M0Yp5bUt3OL05S6TlFuTTk2vCmFP+TUlGOP+KcRq4ZnJKUnjp0cnxQf8IrzcjOXxaYkp6XHJ6c7DIbwWNlYc2JG2UXnTe7UpvKAn+rVmHfFqRtuuvzUNh2j4MaEVrtOSLluNJXLha8BfA3ha1Sy3zh4mKjmUWPOrxwOtqaxW4WbEA7AD+ZvkhXtV1z0vd0wqt5uyuptb+A0datwM0pve/mbMfbuvIvokd2ePJoX67lp9YAZk/wJCf6E2IzATH/fhATvSyU4hxuElBuGlJsHgzrklzoG/9AqyqnfAr6W8LUqOBh9UQ/GFkX3QHH+AsvthwtwukitHZK73B9aF/otWJncaH5EVzZzcd9AIH7OtphGLuGxLkEpLkHJLkHpLkEBl6B4l6DJpVanIaXWBWmlVqf4UquTUz85Db9RLkEZLkGTXIKSXIISS+2yTCu1fkpwCTrRJcjpxnuxS9Alh7865h8Mrjts+slVNw9q+8XfE8f+tmbSinm9Bi7d3mrHDxPnf9Jn96M7upTiN7fTF7dbvlYu2Urpt81uoDalBWpbWqB2pQXqUFqgjqUF6lxaoC6lBepWWqDuDiD3X2w6PNHSnqd8rZ2ep9o4JHd5nmrTNPrz5RiHdvSKdtfZJbFxSHwcI7E4JD6ekVgdEvcuTuKioCc4nVI9F21ql7l8IqMjfQ6JT2IkLuOQuA8jcVmHxCczEpdzSHwKI3F5h8SnMhJXcEh8GiNxRYfEfRmJKzkk7sdIfIxD4lhG4soOifszEldxSDyAkbiqQ+KBjMTVHBIPYiSu7pB4MCNxDYfEQxiJazokHspIXMsh8emMxLUdEg9jJK7jkHg4I3Fdh8QjGInrOSQeyUhc3yHxKEbiYx0Sj2YkbuCQeAwjcUOHxGMZiRs5JB7HSNzYIfF4RuImDonPYCRu6pB4AiNxM4fEZzISN3dIfBYjcQuHxGczFt3nMKDnMnYmznPamdjAuDotHao3kdHmuFLaEyzGNTyfAY1nQCcxoJMZ0AQG1M+ATmFApzKg0xjQRAb0AgZ0OgOaxIDOYECTGdAUBjSVAb2QAQ0woGkMaDoDmsGAzmRAZzGgsxnQOQzoRQzoxQzofxjQSxjQSxnQyxhQO5dCzaRQL6dQr6BQr6RQr6JQr6ZQr6FQr6VQr6NQr6dQb6BQb6RQb6JQb6ZQb6FQsyjUbAo1J0pqjoMsovUB32rRuQ+KY63LZo51+ussfY2xkWTnOeV+iZL71pwipR/7vD6kjIzbKNTbKdQ7KNQ7KdS7KNS7KdR7KNR7KdT7KNT5FOoCCvV+CvUBCnUhhbqIQl1MoS6hUJdSqMso1Acp1OUU6goK9SEKdSWFuopCfZhCXU2hPkKhrqFQH6VQ11Koj1Goj1OoT1CoT1KoT1GoT1Ooz1Co6yjU9RTqsxQq5e9N7PMU6gsU6osU6ktRyiHcqBsodX2ZQn2FQn2VQn2NQn2dQn2DQn2TQuXsPIFCfYtC3UihbqJQN1OoWyjUtynUdyjUdynU9yjU9ynUDyjUrRTqhxTqRxTqNgr1Ywr1Ewr1Uwr1Mwp1O4W6g0L9nEL9gkL9kkL9ikLdSaF+TaF+Q6F+S6F+R6F+T6H+QKH+SKHuolB3U6g/Uah7KNSfKdRfKNS9FOqvFOpvFOrvFOofFOqfFOpfFOrfFOo/FOo+CnU/gwoTw8EaDlY4WOVgfRxsGQ62LAdbjoMtz8FW4GArcrCVONhjONjKHGwVDrYqB1uNg63OwdbgYGtysLU42NocbB0Oti4HW4+Drc/BHsvBNuBgG3KwjTjYxhxsEw62KQfbjINtzsG24GBbcrCtONjWHGwbDrYtB9uOg23PwXbgYDtysJ042M4cbBcOtisH242D7c7B9uBge3KwvTjY4zjY4znY3hzsCRzsiRzsSRxsHw72ZA72FA72VA72NA62Lwfbj4ON5WD7c7ADONiBHOwgDnYwBzuEgx3KwZ7OwQ7jYIdzsCM42JEc7CgOdjQHO4aDHcvBjuNgx3OwZ3CwEzjYMznYszjYsznYczjYcznY8zjYiRxsHAd7Pgcbz8FO4mAnc7AJHKyfg53CwU7lYKdxsIkc7AUc7HQONomDncHBJnOwKRxsKgd7IQcb4GDTONh0DjaDg53Jwc7iYGdzsHM42Is42Is52P9wsJdwsJdysJdxsHM52EwO9nIO9goO9koO9ioO9moO9hoO9loO9joO9noO9gYO9kYO9iYO9mYO9hYONouDzeZgczjYXA52Hgd7Kwd7Gwd7Owd7Bwd7Jwd7Fwd7Nwd7Dwd7Lwd7Hwc7n4NdwMHez8E+wMEu5GAXcbCLOdglHOxSDnYZB/sgB7ucg13BwT7Ewa7kYFdxsA9zsKs52Ec42DUc7KMc7FoO9jEO9nEO9gkO9kkO9ikO9mkO9hkOdh0Hu56DfZaDfY6DfZ6DfYGDfZGDfYmD3cDBvszBvsLBvsrBvsbBvs7BvsHBvsnBWg4WHOxbHOxGDnYTB7uZg93Cwb7Nwb7Dwb7Lwb7Hwb7PwX7AwW7lYD/kYD/iYLdxsB9zsJ9wsJ9ysJ9xsNs52B0c7Occ7Bcc7Jcc7Fcc7E4O9msO9hsO9lsO9jsO9nsO9gcO9kcOdhcHu5uD/YmD3cPB/szB/sLB7uVgf+Vgf+Ngf+dg/+Bg/+Rg/+Jg/+Zg/+Fg93GwHP+tcPy3wvHfCsd/Kxz/rXD8t8Lx3wrHfysc/61w/LfC8d8Kx38rHP+tcPy3wvHfCsd/Kxz/rXD8t8Lx30oNDpbjvxWO/1Y4/lvh+G+F478Vjv9WOP5b4fhvJWr/bY4TtmFO0f8PVPg4ElNpxGlTY5c2KedITzguXeG4dIXj0hWOS1dIw5Dj0hWOS1c4Ll3huHSF49IVjktXOC5d4bh0hePSFY5LVzguXeG4dIXj0hWOS1e6c7Acl65wXLrCcekKx6UrHJeucFy6wnHpCselKxyXrnBcusJx6QrHpSscl65wXLrCcekKx6UrHJeucFy6wnHpCselKxyXrnBcusJx6QrHpSscl64MK3oZXxwsx6UrHJeucFy6wnHpCselK2M4WI5LVzguXeG4dIXj0hWOS1c4Ll3huHSF49IVjktXOC5d4bh0hePSFY5LVzguXeG4dIXj0hWOS1c4Ll3huHRlyoam9et+3mvz+WfFvD1256Tr3tr7SO6++xfckXvTwi/71T1j/7BGW8IPPYo8zjh4kFN0co5xV6ZF+6Tm0qZWTqmjtvK6pG7tlPoCRuo2TqmnM1K3dUqdxEjdzin1DEbqDk6pkxmpOzqlTmGk7uyUOpWRuotT6gsZqbs5pQ4wUnd3Sh2t/Tg71+WoexN0s9sXOUeTLBxNssw8euN37d+/pzjYWcW5/kVjZzv91IJ0vMuRKQtHpiwcmbJwZMrCkSkLR6YsHJmycGTKwpEpC0emLByZsnBkysKRKQtHpiwcmbJwZMrCkSkLR6YsHJmycGTKwpEpC0emLByZsnBkysKRKUsOB8uRKQtHpiwcmbJwZMrCkSkLR6YsHJmycGTKwpEpC0emLByZsnBkysKRKQtHpiwcmbJwZMrCkSkLR6YsHJmycGTKwpEpC0emLByZsnBkysKRKQtHpiwcmbJwZMrCkSkLR6YsHJmyrOFgOTJl4ciUhSNTFo5MWTgyZeHIlIUjUxaOTFk4MmXhyJSFI1MWjkxZODJl4ciUhSNTFo5MWTgyZeHIlIUjUxaOTFk4MmXhyJSFI1MWjkxZODJl4ciUhfSX1xyZsnBkysKRKQtHpixbOFiOTFk4MmXhyJSFI1MWjkxZODJl4ciUhSNTFo5MWTgyZeHIlIUjUxaOTFk4MmXhyJSFI1MWjkxZODJl4ciUhSNTFo5MWTgyZeHIlIUjUxaOTFk4MmXhyJSFI1MWjkxZODJl4ciUZQ8Hy5EpC0emLByZsnBkysKRKQtHpiwcmbJwZMrCkSkLR6YsHJmycGTKwpEpK0emrByZsnJkysqRKStHpqwcmbJyZMrKkSkrR6asHJmycmTKypEpK0emrByZsnJkysqRKStHpqwcmbLW4GA5MmXlyJSVI1NWjkxZOTJl5ciUlSNTVo5MWRtwsA052EYcbGMOliNAVo4AWTkCZOUIkJUjQFaOAFk5AmTl/IWscgTIyhEgK0eArBwBsnIEyMoRICtHgKwcAbJyBMjKESArR4Cs3TlYjgBZOQJk5QiQlSNAVo4AWTkCZOUIkJUjQFaOAFk5AmTlCJCVI0BWjgBZOQJk5QiQlSNAVo4AWTkCZOUIkJUjQFaOAFk5AmTlCJCVI0BWjgBZh3GwHAGycgTIyhEgK0eArBwBso7hYDkCZOUIkJUjQFaOAFk5AmTlCJCVI0BWjgBZOQJk5QiQlSNAVo4AWTkCZOUIkJUjQFaOAFk5AmTlCJCVI0DWKRwsR22s0zjYRA72Ag52OgebxMHO4GCTOdgUDjaVg72Qgw1wsGkcLMeSqxxLrs7kYGdxsLM5WI7/Vjn+W+X4b5Xjv1WO/1Y5/lvl+G+V479Vjv9WOf5b5fhvleO/VY7/Vjn+W+X4b5Xjv1WO/1Y5/lvl+G+V479Vjv9WOf5b5fhvleO/VY7/VnM4WI7/Vjn+W+X4b/U2yv8mUjn+W+X4b5Xjv1Un/+1w/4yUwJwhyYnpuTW26ZRexx3f+4QTT+pz8imnnta3X2z/AQMHDR4y9PRhw0eMHDV6zNhx48+YcOZZZ59z7nkT486PnzQ5wT9l6rTEC6YnzUhOSb0wkJaeMXPW7DkXXfyfSy69zM61mfZye4W90l5lr7bX2GvtdfZ6e4O90d5kb7a32CybbXNsrp1nb7W32dvtHfZOe5e9295j77X32fl2gb3fPmAX2kV2sV1il9pl9kG73K6wD9mVdpV92K62j9g19lG71j5mH7dP2CftU/Zp+4xdZ9fbZ+1z9nn7gn3RvmQ32JftK/ZV+5p93b5h37TWwr5lN9pNdrPdYt+279h37Xv2ffuB3Wo/tB/ZbfZj+4n91H5mt9sd9nP7hf3SfmV32q/tN/Zb+5393v5gf7S77G77k91jf7a/2L32V/ub/d3+Yf+0f9m/7T92n90PEwNjYARGYXwwZWDKwpSDKQ9TAaYiTCWYY2Aqw1SBqQpTDaY6TA2YmjC1YGrD1IGpC1MPpj7MsTANYBrCNIJpDNMEpilMM5jmMC1gWsK0gmkN0wamLUw7mPYwHWA6wnSC6QzTBaYrTDeY7jA9YHrC9II5DuZ4mN4wJ8CcCHMSTB+Yk2FOgTkV5jSYvjD9YGJh+sMMgBkIMwhmMMwQmKEwp8MMgxkOMwJmJMwomNEwY2DGwoyDGQ9zBswEmDNhzoI5G+YcmHNhzoOZCBMHcz5MPMwkmMkwCTB+mCkwU2GmwSTCXAAzHSYJZgZMMkwKTCrMhTABmDSYdJgMmJkws2Bmw8yBuQjmYpj/wFwCcynMZTBzYTJhLoe5AuZKmKtgroa5BuZamOtgroe5AeZGmJtgboa5BSYLJhsmByYXZh7MrTC3wdwOcwfMnTB3wdwNcw/MvTD3wcyHWQBzP8wDMAthFsEshlkCsxRmGcyDMMthVsA8BLMSZhXMwzCrYR6BWQPzKMxamMdgHod5AuZJmKdgnoZ5BmYdzHqYZ2Geg3ke5gWYF2FegtkA8zLMKzCvwrwG8zrMGzBvwlgYwLwFsxFmE8xmmC0wb8O8A/MuzHsw78N8ALMV5kOYj2C2wXwM8wnMpzCfwWyH2QHzOcwXMF/CfAWzE+ZrmG9gvoX5DuZ7mB9gfoTZBbMb5ieYPTA/w/wCsxfmV5jfYH6H+QPmT5i/YP6G+QdmH8x+SAzEQASiEB+kDKQspBykPKQCpCKkEuQYSGVIFUhVSDVIdUgNSE1ILUhtSB1IXUg9SH3IsZAGkIaQRpDGkCaQppBmkOaQFpCWkFaQ1pA2kLaQdpD2kA6QjpBOkM6QLpCukG6Q7pAekJ6QXpDjIMdDekNOgJwIOQnSB3Iy5BTIqZDTIH0h/SCxkP6QAZCBkEGQwZAhkKGQ0yHDIMMhIyAjIaMgoyFjIGMh4yDjIWdAJkDOhJwFORtyDuRcyHmQiZA4yPmQeMgkyGRIAsQPmQKZCpkGSYRcAJkOSYLMgCRDUiCpkAshAUgaJB2SAZkJmQWZDZkDuQhyMeQ/kEsgl0Iug8yFZEIuh1wBuRJyFeRqyDWQayHXQa6H3AC5EXIT5GbILZAsSDYkB5ILmQe5FXIb5HbIHZA7IXdB7obcA7kXch9kPmQB5H7IA5CFkEWQxZAlkKWQZZAHIcshKyAPQVZCVkEehqyGPAJZA3kUshbyGORxyBOQJyFPQZ6GPANZB1kPeRbyHOR5yAuQFyEvQTZAXoa8AnkV8hrkdcgbkDchFgLIW5CNkE2QzZAtkLch70DehbwHeR/yAWQr5EPIR5BtkI8hn0A+hXwG2Q7ZAfkc8gXkS8hXkJ2QryHfQL6FfAf5HvID5EfILshuyE+QPZCfIb9A9kJ+hfwG+R3yB+RPyF+QvyH/QPZB9kNjoN5tWKAK9UHLQMtCy0HLQytAK0IrQY+BVoZWgVaFVoNWh9aA1oTWgtaG1oHWhdaD1oceC20AbQhtBG0MbQJtCm0GbQ5tAW0JbQVtDW0DbQttB20P7QDtCO0E7QztAu0K7QbtDu0B7QntBT0Oejy0N/QE6InQk6B9oCdDT4GeCj0N2hfaDxoL7Q8dAB0IHQQdDB0CHQo9HToMOhw6AjoSOgo6GjoGOhY6zjvy947nvaN079jbO6L2jpO9o1/vmNY7UvWOP72jSu9Y0TsC9I7rvKM17xjMO7Lyjpe8oyDv2MY7YvGOQ7yjC++YwTsS8Lbvva12b1vc28L2tpu9rWFvG9fbcvW2R72tTG/b0dsi9LbzvK03b5vM29Lytp+8rSJvW8fbgvG2S7ytDW8bwtsy8Jb33lLcWzZ7S1xvOeotHb1lnrck85ZP3lLHW5Z4Swjvcd97NPceo71HXu/x1HuU9B77vEc073Fq+Rh/ekYguX98evy2mF4xRtRXpmy58hUqVjqmcpWq1arXqFmrdp269eof26Bho8ZNmjZr3qJlq9Zt2rZr36Fjp85dunbr3qNnVta2mJo5mYv6Tk4MdMzZuKncd7+8+crUrKzDL3UOf+m48JdiczaekNA2Yc7PfVLyXuof/tKQnI0Vfl8/8brvq6TnvTQ0POr08JdGhX9wdHjUmPCXJoR/8MzwqLPCX5oY/sFZORtXVtrSb/388hPzXpoT/pK9Krx37LUhr92es7Vt/MEH57jJKTNS49MTJyX541IC8ZO9f830B9ISU5LjZgXiU1P9gfmZi2NTktPSczOX9E8M+CenS+bSIcnp/qn+wMLxPboX/cRd+PMmqs/P7V/48zHR5e+fuSg2Pikpu1I+Z9kYf5LX5Jn+KFsSE07QaAkPHahLgjdVYlNS5+Q3qX9onULgh2peucQ1718KNV80Nj0lNTsnQk0LXaPYxQMT/UlFn+HXXnLoyyNzxcCUgD9xavKBBt+6tU38Ren+yXEZ6Ulxh4ZpbP4oHXlwkJ5xaIxmZWVnrjy0VOubkBDwp6XlVyA7c8nYxBmpSf5DNTmcJ2dtYlpcckZSUuKURH8gLtWfnJCYPHVbTLV/eZAPLOEgHxh+gX3RESScUKZ0BndsaJ1C4AuHp8wsMJzy4wu9o8FpkjchDkUcfnlAKKSkA31AiXvShE8VDYUVGOrrDo301MDMuMS0EXkDc9ShcRk2uIOU/OGdX7cHxnfLiRgvEd/RnIITpdB/hV2kYBXyptSqBP+Bm0hKmj9uWmJy+raY2v99k0mL24LiDiKHyVRgUEWeTEecMgVuOJEmk5a4Ff1L/KUi4ZOpwJeI17pCFTzCPXLR+G7de4eFhvbf4dG+sl9icnxgzsH/GJk6LyRg4diMSUXc+oLv5t38anaLeb/Jp73mdKhzXMrImVd+Om7lpbUWtttZtd6PGX1m/rEtJXK+MguHZyRFaFXkKanh35xBYt50XZaUnjdR6/7vrve/u97Bf/h3vchDfcmACzPik9IijOglQzNmpA6ZEoItUyNz0YEXs6sdZb4uG+bd5cZNi0+O9GR9kFD7aE/W3g3VodWFrlqBmZqXxOEmurVVckp64pQ5cZMD/vh0f0LIQ+rhZVlqIGX2nHv/3y/G/vturZX+HyzPCi6vmgYfOg+NuthDgy7/+fMI66ogN8LKak1SytS8sXp462BbzOh/ebymlnC8ppb4/tApnFC21MdrmVD44eec/Kj8QvCLrXehoP7BQuSgAcFC5KCBwULkoEHBQuSgwcFC5KAhwULkoKHBQuSg04OFyEHDgoXIQcODhchBI4KFyEEjg4XIQaOChchBo4OFyEFjgoXIQWODhchB44KFyEHjg4XIQWcEC5GDJgQLkYPODBYiB50VLEQOOjtYiBx0TrAQOejcYCFy0HnBQuSgicFC5KC4YCFy0PnBQmhQ5LtgSe9d/Uv8DdmocO3KBG8XYexy0bEbZ6449JDpfWhk6q354IXejfEAIJgpJMPKId7+zcHeKdnNwxRKHkyRnz68zYUW9Bq+Pjz8ji+0ygXeKXw/8Z5y+h5tbVniZ7L4Eo+BqsQxUO2/aAz4SnMMFN6K8WKGlfhpOJX/NHykq1mu8NXUYE8U6JjywYACr1cI9umhhd+QzEXDUuIT8gPKBgmLvfoF/OEfLXvkupUvXLfywQt9xA9UKPyBCkV8oGL+gvmIacoF1+F5HxiQd3RT0ifkqpEGeNnwAa6RmnG0WeEL+VDoOmhl8JTJW7tkZc07yvb5g4P98al9A4H4OSGDqmyjiJ8oc+RPlKs67wgb970zFx8KPNKufu9GYS8ebF7hjxxajVXNW46tPvTl4+WMS0z2jnTT7yy8FKpdwqVYrdJZxsQE65MPLrxodDxNjAnbEMqbqXl7TIVzSti41vJhS07H7CZS9piF/RNnBu8R+XXI+5LKb3ZeR/wf2a0W+IWcAQA=",
|
|
2086
|
+
"debug_symbols": "tVvbbhs5DP0XP/tBFC+S8itFUaStWwQI0iBNFlgU+fcVJ7qMXYirzDgvIScenaGkQ4q6/Tl8P319+fnl7uHHr9+Hm09/Dl+f7u7v735+uf/17fb57tdD/u+fg9M/gIcbgNfjAdqTy0++PlH+hd4EH244CzncSBYhi/wi1hfD208p/4+W/2VAnx9YH0L+BY6HEN5EfBMpi9f8SrXqy/PT6aSvr8zMxj/ePp0eng83Dy/398fDP7f3L8tLvx9vHxb5fPuUf3XHw+nhe5YZ8Mfd/Um112Mv7cZFvWcqpb2PqQFAhFmIHV+Pvn48UuzflrPyOC4vIqW8BN5QPjgs5QO4TeV9Le+H3zfqn4BL+eRhS3mOtXxIo/JxXB7AUa1B1mVVhzBrA1CCCsGMDSEbNIvgWjOAC70fIs4iUEqhILDD3pJ8zkTwBhVTpVLCuMEE9q5ymf2KDJcmkFELj5WOhK7XwtO5FdpaIwwMUjEwoh9jyBUwgtGniFAbNOu0rg3Ptym71qZh3KbJiG+xWuFT9xAP0+RkhNoYvK7GhQ0eDBtAYouxPjQIOQ+x3mBnQtciBZJfuel5RbwRrJKjWpPkkhtjGBRF6szoXuLxAsEiqPMNYu2q78LIoapiANEYwyAog3R/XTkbxG1VEb+tKsK1Y1EE92OEsBHDu4aBG+uSenskGXct4sd2S4rdjDQ2w3T6WFuUc1QeOT1aQdT3TvErKzjMQ5DUwRmZeARh1UN68Ao8DKBoBNA8pNcUCzpAOAcgy4bUQpc4L8OwQ7A//JHfH/4I94Y/ov3hz8SYDH8ku/3MNGMydNkYc2HHYmhOH7GnjzDiqEXRIM3dQ5KRmzCYRsSWBjtIceStbFAUWLAlTSyyxeXFhdgc1vlhXaw8lKByg0hkWBO2UtnarQTc8y7eVAsYZl0crLlVc/dV1KHpaa30rE08haEJBjNT6sRcOQjwuRFiWSF1YhNdWCGcZ+JyhdgpV4idsjt2yhVip1whdsr+2ClXiJ3TGEbaJ1eIvybGZNoX4GObdDLtsxw2rhw20NBhg2EG+L4cQuzHGLzfZYPsd9kQ9rpsiPtd1sSYdNnodvPLNGPSZW2MOXezBgRsayKCq0W/i2EpGhT1jLUmnlfrbd6dD/DRoGhfIgqyGpfSO9oiti7B5Ny4Ww0rItcJUmQZWmEhpLb8nVZ5yrsQpPp7EtmLsOqNrQi8tx0sBJNVsRLT59xpyKpEe1llIcwxwkKYY4SJMMWISQSDEbMIvLcdtjJCfFt8lfX62AUjwPm9lDAh5jhhQsyRwoaYYsUshEGLaQje3RabiRFqj/iwmtb8RQxwu4lhQUwSA9xuYpgQc8SYhLCIMQvBu9vCgLByG2qZnhAPp9wA0VpuDBWDU1rlzhQvQKxdI2zk8hRhTFDv9mfxYO0dzabxYO0ezeXxYG0ezSbyNshkJg/W8v5kKj9fG2PnxgaZnBDMgxiT+P8BmZtW2CCT03hA+ODOmZzIm2FAeg8LBBmHAaQreDDyFTzY3gqa8mAMV/BgE2TWg80tpUmSmIbMOp8NMuk3JtOQUpuQJxwzzdxY8r7vFp4tFV9gWCtPqW3VwVkaIPMY3vmWmTniMYa1PBq6563p/h4r+oEJl2BsRfxQKyCmdmzDybb2hBbL9mC43RgINb3zeQFpiMEGR7NPt2NaBLgNg5AaBl0DI2zE4L5KK7IVwzWMCPvrshWDXT+AB24/Bm7FoI4hNMSwNprmvNa2onkciOEt1lbCnBX2oIDQBwUaDwrmPpOk1Lal153C78Fo29Ic1inMJYZRGUq+bkJSCuPBSawxP69VVzuI3DYMCq0uFK+BETZipDpIMq/zl80YcWtdXMdIGzGoTZdpdUJoOz9kiDHvMHHsMNaWApALLZriuFGD0SA5r6wRWXjtuRcY1m6TpOZ0weE1MIZENY8OcG0NkfFO0ZKhjJd02kJIXt8aHmoBa7WPYztHgZ0cl7Mf0wppGVCSFMZWiDUu7D9bExZXeusTSOP1qRittU9qua2ssnSePq0Uck5crfAytiJZR+6lhWMIsGLXxbUPSNa5ZtcT07wSNgSx6sLtfHZYj7V/1cUa8aF3S9bj8MASWNsdV+GHdH5IPD82+jk/3X67ezq/h+Sd5tXHg9cbQ5kX3heJRVKRXKQUGYqMRaY3ia7IgocFDwseFjwseFjwsOBhwcOCR07XHrKEIn2RqNcEsqQiWVcmspQiMx7p/2OR6U2yKxK0VbL0RaKmCFlSkXrhKncHS5GhyKTx5HgQ0Cs/WfoisUhSp8iSi8zlNY5KLq9Mk2yPeqckPSB2PASnSztZQpG+SCySNPBlyRp6jstlLk3Klttcrt7ncvVGlyrRVQVUySDRq5JbLS5XzLKZkVTJOJGrIlUJVYkLnbOiyHp1JSmyXv5Iiqy3L5KvClaFqqLIuv+WpCqhKrEqqSjgXNOgab5p2DRqGjdNmhaaFpvWvgEL171q0DS/jNqqYdNomVuppt/g5T1Z5heqhabpN3R4ykv5VVv8SQ9zgnpU0fQbmimBehUoLUD9qmjcNP2GHu0B9a6ixaalJbBlTX2saPoN3VUH9TOIeg9QPa1o+g3N8kC9DdLynizaq8aQp7vbr/cnDQMaKF4evtWokB+f/32sv9T7i49Pv76dvr88nTSCLMFjuV6YP/cpVzPw51cNMv8B",
|
|
2087
|
+
"verification_key": "AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA0AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAACAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAANwAAAAAAAAAAAAAAAAAAAA7Dl1C2EC6/coJ7ej3R0oXGoAAAAAAAAAAAAAAAAAAAAAACBcCtKV0h6KYsIp+UYlYgAAAAAAAAAAAAAAAAAAAHJu2nOdqtopnTiKS4JQG2abAAAAAAAAAAAAAAAAAAAAAAAd9csQE1G8lKUdwQG+gGkAAAAAAAAAAAAAAAAAAACIuEuTjr+Ax+6bdACZBvhl6AAAAAAAAAAAAAAAAAAAAAAAGqZ5DAjhgZi1Z/jUC7EDAAAAAAAAAAAAAAAAAAAAHK8s9VcdAxtOcDQbJH8IM+MAAAAAAAAAAAAAAAAAAAAAACmv8b5agEnBhpwqEmUZrwAAAAAAAAAAAAAAAAAAALJC45fbheaK/CNxJBvQYt1/AAAAAAAAAAAAAAAAAAAAAAAAiHXHh3lXWlUQMzlv5f0AAAAAAAAAAAAAAAAAAACCzRtv0r1shyLWydWwMGlvEAAAAAAAAAAAAAAAAAAAAAAAAQeHTE4pIj4d++KhTkLHAAAAAAAAAAAAAAAAAAAAcCqeVL7KbGdOkjURwkK8OyQAAAAAAAAAAAAAAAAAAAAAAAzphxi8rirLUF3ukKqQLgAAAAAAAAAAAAAAAAAAAMnf5GI6yexcMRS7+kowvtCvAAAAAAAAAAAAAAAAAAAAAAAaFbrqwO69fLbxQR5eSnkAAAAAAAAAAAAAAAAAAACMeavE0cSLyfnluTZXecqesAAAAAAAAAAAAAAAAAAAAAAAL+Ssjd/cNyNYRcFlozWmAAAAAAAAAAAAAAAAAAAAG7wOwTmsxBXDDITIAT5hwCUAAAAAAAAAAAAAAAAAAAAAABPED4yi0zJFBiDbZduIHwAAAAAAAAAAAAAAAAAAAFGA0X9rEpxK5M/xwzUJ+PauAAAAAAAAAAAAAAAAAAAAAAATrOX9cmQwlFUcoq+4EDcAAAAAAAAAAAAAAAAAAAC3eopFsfcJiOVwQYCo7a2a5gAAAAAAAAAAAAAAAAAAAAAAI3gdzFoAbzo9TcAlubtZAAAAAAAAAAAAAAAAAAAA34RD4CY/7x6vQarrV/2yyVwAAAAAAAAAAAAAAAAAAAAAAAot+yK0pCzlx7efA+XTYQAAAAAAAAAAAAAAAAAAADKV5Skq5e58zJPucpMJ/0oEAAAAAAAAAAAAAAAAAAAAAAAlPhj9v98Uc9CgAq5ucpwAAAAAAAAAAAAAAAAAAABx5zYhN1wv1vbfLyCbbVTaYQAAAAAAAAAAAAAAAAAAAAAAFirzOUFp4ss0XzWfetIXAAAAAAAAAAAAAAAAAAAA2nMNAzJArrrdtiFD8Mw3d3YAAAAAAAAAAAAAAAAAAAAAABKRZzcRcvTTCBmsCocv4wAAAAAAAAAAAAAAAAAAALoTLdvetZFHRAFamf439B1iAAAAAAAAAAAAAAAAAAAAAAAWtVQBm+QD4mY+DW+yzAoAAAAAAAAAAAAAAAAAAACFONXYEU965mMrmUQEJ//29gAAAAAAAAAAAAAAAAAAAAAAKI03FpgqUTzuEX1rS1FqAAAAAAAAAAAAAAAAAAAA3d9rGyVJSzlHqBFefYRadwQAAAAAAAAAAAAAAAAAAAAAABb7QPVZ89jgP42M+aEhLAAAAAAAAAAAAAAAAAAAAOsIGX77tjk+T2cmoMHAM9bDAAAAAAAAAAAAAAAAAAAAAAAAWf04xAGT3w1vft+0v18AAAAAAAAAAAAAAAAAAAD0BMO6zm6wsNFwTTwVtk5KtAAAAAAAAAAAAAAAAAAAAAAAKWf+XknyLEUAHEEASJxZAAAAAAAAAAAAAAAAAAAAfUapOptntmQpljRPStpE+VUAAAAAAAAAAAAAAAAAAAAAACgqU8qKCEk+KqKalEPUEwAAAAAAAAAAAAAAAAAAAMbF8Bs7RGbJ6PgTNDCx4KWTAAAAAAAAAAAAAAAAAAAAAAAZuxQOPcgOx6Vh0SAKYlkAAAAAAAAAAAAAAAAAAAA6gy1ygnwrQpmkGINKW3yjIgAAAAAAAAAAAAAAAAAAAAAAGrYg4X9OyDcW73fSHd36AAAAAAAAAAAAAAAAAAAAy8E6KrLdNa07vJkPZKyFutkAAAAAAAAAAAAAAAAAAAAAABGYqt9bmc9Dfi6OWd4UgwAAAAAAAAAAAAAAAAAAAN4QzKs2UF0kPqfW+wuXg3u9AAAAAAAAAAAAAAAAAAAAAAAu2AjHJgk2PNpJHohdyAsAAAAAAAAAAAAAAAAAAABNTxpGrI1REmNhgzYcZyxwMQAAAAAAAAAAAAAAAAAAAAAAFNu3jqTUc34/aCWTRUg/AAAAAAAAAAAAAAAAAAAArfPBJV1dC1f1dhSwsKL4dHMAAAAAAAAAAAAAAAAAAAAAACu7CfDR6032uRFbXac9mgAAAAAAAAAAAAAAAAAAAE/70bM3MzNjwG1rxCoCe5cfAAAAAAAAAAAAAAAAAAAAAAAFCCYgRKdz4nHclldTirUAAAAAAAAAAAAAAAAAAAAS4TVpTNC7DvhFn9lN8kilYwAAAAAAAAAAAAAAAAAAAAAAE+WvF711Y2Gxgy8hDwSsAAAAAAAAAAAAAAAAAAAATmgjm5xIjNFpyGZf+/AUcVQAAAAAAAAAAAAAAAAAAAAAACojrQNM0dv/32+JdkxubgAAAAAAAAAAAAAAAAAAACr+v7O6W39FfcgvXxOmEe6NAAAAAAAAAAAAAAAAAAAAAAAI2gQgiXqhfM0lunqELmUAAAAAAAAAAAAAAAAAAACKyP0hVI7gs7bn9V8KJQnxrwAAAAAAAAAAAAAAAAAAAAAADe24Fqfz5YjHSsmMZGomAAAAAAAAAAAAAAAAAAAA+l8i9vIAcUDBGrdSfhzHj9wAAAAAAAAAAAAAAAAAAAAAAC6ON3giUZkVk7mm+tjbCwAAAAAAAAAAAAAAAAAAAOskmdv7G4ODPK8Ag4HOY0MYAAAAAAAAAAAAAAAAAAAAAAAZuETzRtznX0e1aoahqH8AAAAAAAAAAAAAAAAAAAC4uLPWfS+QuMCPqV/ty89cHAAAAAAAAAAAAAAAAAAAAAAAKHsooUcBQE/+bOMT0i2tAAAAAAAAAAAAAAAAAAAA8anTwjGwHTKX0tEf7XJ3GswAAAAAAAAAAAAAAAAAAAAAACfq/q4Z1FWOwULtvfyE+AAAAAAAAAAAAAAAAAAAAKJecIGDdWbUaI9ggCojPyU/AAAAAAAAAAAAAAAAAAAAAAAYubXNieSZkx6V52p4fGMAAAAAAAAAAAAAAAAAAADSeQAmFy5BBzdksIZ9bqr7VwAAAAAAAAAAAAAAAAAAAAAAGZcKLhrXi5L1fPUGLHdjAAAAAAAAAAAAAAAAAAAAFTwyI6w7tXbUTiwky+FOILQAAAAAAAAAAAAAAAAAAAAAABLontBoLw7ScE4cqKZAjAAAAAAAAAAAAAAAAAAAAH9lQoMxho3YeYKu+5jXbODpAAAAAAAAAAAAAAAAAAAAAAAQIjehnh++3XOZflNVRZcAAAAAAAAAAAAAAAAAAABHQ4vasynSYZ7IY4Vzsq+L5gAAAAAAAAAAAAAAAAAAAAAABWvQIGJYLKCjVqDGQonhAAAAAAAAAAAAAAAAAAAAt6q4yXUlqoM5nBO1nEiOjAYAAAAAAAAAAAAAAAAAAAAAAALykixAa6HldiByENiO7gAAAAAAAAAAAAAAAAAAABaJMAbSYK5DF1ISW3C0SJaHAAAAAAAAAAAAAAAAAAAAAAAYkpFJz7YGSmTsfL2mVLoAAAAAAAAAAAAAAAAAAABTVzRvR4XcnHnHns5M9UnO9gAAAAAAAAAAAAAAAAAAAAAAFSrf5wz22OgvM3NiTyDCAAAAAAAAAAAAAAAAAAAAil+2/F38P4wXdS6+CAhH8lcAAAAAAAAAAAAAAAAAAAAAABOqe7bcKmVhTJwyEPlc7AAAAAAAAAAAAAAAAAAAAJW12Le0pjsF32UrDRDvFG0mAAAAAAAAAAAAAAAAAAAAAAAJnjvVoKAKt/4YBAEFubMAAAAAAAAAAAAAAAAAAAAhKa86Y39aYioyRA+GDR4qfwAAAAAAAAAAAAAAAAAAAAAAABW40lFdduLM7Jnc0ZRZAAAAAAAAAAAAAAAAAAAAIiuIgQjcJdGqRQ4LS8ISw34AAAAAAAAAAAAAAAAAAAAAABuRdReSC609i8AclZUJKgAAAAAAAAAAAAAAAAAAAEghQcfr5CAAodWMy3Q4H20ZAAAAAAAAAAAAAAAAAAAAAAAwXomSsUju2yLm6ZIHeoQAAAAAAAAAAAAAAAAAAAB8hoR2GGgdwp2Kk2OrfEDhwwAAAAAAAAAAAAAAAAAAAAAAFkZaXMu1UM0sY71YEW/kAAAAAAAAAAAAAAAAAAAAQ5lzrBLXynltb+mMpA5sprcAAAAAAAAAAAAAAAAAAAAAAC4k1CD7+VCO0x3mkttHewAAAAAAAAAAAAAAAAAAACjt0afkbIQNnJQ/30VSHGTOAAAAAAAAAAAAAAAAAAAAAAAEPQY7Ewrfs3NCr0XQFVoAAAAAAAAAAAAAAAAAAACTMJUq50xXPRaG2ctKAHM4VAAAAAAAAAAAAAAAAAAAAAAAJhUixAiTMGRq/5ZzYZSUAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAEAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAACAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABccA1w2e+PNokeGjDvkgaXCQAAAAAAAAAAAAAAAAAAAAAAB5IRKt34/LQHCCkeILi0AAAAAAAAAAAAAAAAAAAAfTyQy69nIQGEIGdAY6mywO8AAAAAAAAAAAAAAAAAAAAAAA+qn9yzR5mphEKZ9ZEhEAAAAAAAAAAAAAAAAAAAAGvMegX/lalrKJQkxfczZw2WAAAAAAAAAAAAAAAAAAAAAAAAxDcm91tv2g3iLODg36sAAAAAAAAAAAAAAAAAAAAdCgnXF47JO614WPluZPC0jQAAAAAAAAAAAAAAAAAAAAAAL5tuC04sAZaN5cMkgqp9AAAAAAAAAAAAAAAAAAAAF6UyFPM7GtAJ5GGyaZJyGb4AAAAAAAAAAAAAAAAAAAAAABQQfUvkU8gEqOKRhpGbPgAAAAAAAAAAAAAAAAAAAJKHn2GoKCaTAlYbtX87FVfPAAAAAAAAAAAAAAAAAAAAAAAoRQUJTjXTtVikNALK2uI="
|
|
2088
2088
|
},
|
|
2089
2089
|
{
|
|
2090
2090
|
"name": "set_update_delay",
|
|
@@ -2136,8 +2136,8 @@
|
|
|
2136
2136
|
}
|
|
2137
2137
|
}
|
|
2138
2138
|
},
|
|
2139
|
-
"bytecode": "
|
|
2140
|
-
"debug_symbols": "
|
|
2139
|
+
"bytecode": "JwACBAEoAAABBIBMJwAABEwlAAAARicCAwQBJwIEBAAfCgADAAQASxwAS0sFLQhLAiUAAAChJwICBEwnAgMEADsOAAMAAigAAEMFAlgsAABEADBkTnLhMaApuFBFtoGBWF0oM+hIeblwkUPh9ZPwAAAAJwBFBAMnAEYAACcARwEBJwBIBAEnAEkAASsAAEoAAAAAAAAAAAMAAAAAAAAAACYeAgAEAQoiBEQFFgoFBhwKBgcABCoHBAYnAgQBAAoqBQQHJAIABwAAANQnAggEADwGCAEeAgAFACkCAAcAA21Sfy0IAQgnAgkEBAAIAQkBJwMIBAEAIggCCS0KCQotDgcKACIKAgotDgUKACIKAgotDgYKJwIHBAktCAAJLQoICwAIAAcAJQAABV4tAgAALQoLBTMKAAUAByQCAAcAAAFGJQAABxkMIgJDBQoqBQQHJAIABwAAAV0lAAAHKykCAAUA71JTTS0IAQcnAggEBAAIAQgBJwMHBAEAIgcCCC0KCAktDgUJACIJAgktDEkJACIJAgktDgYJJwIGBAgtCAAILQoHCgAIAAYAJQAABV4tAgAALQoKBQoiBUYGCioGBAckAgAHAAABziUAAAc9HgIABAAvKgAFAAQABhwKBgcEHAoHBAACKgYEBywCAAQALV4Ji4K6N7Q7maExYRj9INQvUWbJ6fE/teplqW0eCm0EKgcEBhwKBggEHAoIBwACKgYHCAQqCAQGHAoGCQIcCgkIABwKCAkCHAoJCgEcCgoIAhwKCAkBHAoICgACKgYKCywCAAYAMDPqJG5QbomOl/Vwyv/XBMsLtGAxP7cgsp4TnlwQAAEEKgsGChwKCgwEHAoMCwACKgoLDAQqDAQKHAoKDAIcCgwEABwKBAwCHAoMDQEcCg0EAhwKBAwBHAoEDQACKgoNDgQqDgYKHAoKDQQcCg0GABwKBgoFFgoMBhwKBAwFHAoGBAUEKgwKBhwKCwoFFgoJCxwKCAkFHAoLCAUEKgkKCxwKBwoFHgIABwYMKgcKDSkCAAoFAAFRgCQCAA0AAAMuIwAAAxoEKgkLBAQqCAoGACoEBgMjAAADQgQqDAYIBCoECgYAKggGAyMAAANCDCoDAgYkAgAGAAADcCMAAANUAioDAgQOKgIDBiQCAAYAAANrJQAAB08jAAADficCBgUALQoGBCMAAAN+ACoHBAYOKgcGCCQCAAgAAAOVJQAAB2EeAgAEAC8qAAUABAAHACIFSQQeAgAIAC8qAAQACAAJJwIIAAIAKgUICh4CAAsALyoACgALAAwcCgcNBBwKDQsAHAoGBwAnAgYAICcCDgQPLQgADy0KCBEtCgYSAAgADgAlAAAHcy0CAAAtChENBCoHDQYAKgsGBycCBgBAJwINBA4tCAAOLQoIEC0KBhEACAANACUAAAdzLQIAAC0KEAsAKgcLBhwKAgcAJwICAEgnAg0EDi0IAA4tCggQLQoCEQAIAA0AJQAAB3MtAgAALQoQCwQqBwsCACoGAgcnAgIAaCcCCwQNLQgADS0KCA8tCgIQAAgACwAlAAAHcy0CAAAtCg8GACoHBgIcCgMGACcCAwBwJwILBA0tCAANLQoIDy0KAxAACAALACUAAAdzLQIAAC0KDwcEKgYHAwAqAgMGLQgBAicCAwQFAAgBAwEnAwIEAQAiAgIDLQoDBy0OBgcAIgcCBy0OCQcAIgcCBy0ODAcAIgcCBy0MSgctCAEDJwIHBAUACAEHAScDAwQBACICAgcAIgMCCD8PAAcACAAiA0gCLQsCAjAKAAYABTAKAAkABDAKAAwACicCAwADACoFAwQwCgACAAQmLQgBBCcCBQQFAAgBBQEnAwQEAQAiBAIFLQoFBi0MRgYAIgYCBi0MRgYAIgYCBi0MRgYAIgYCBi0MSgYnAgUEACcCBgQCLQoFAyMAAAWsCioDBQcAIgRICC0LCAgAKgQGCS0LCQkkAgAHAAAF1SMAAAXQLQoIAiYEIgNFBwYiB0ULCioLAwokAgAKAAAF8SUAAAhKDCIHRQokAgAKAAAGAyUAAAhcACICAgsAKgsHCi0LCgoAKggKCy0CBAMnAAQEBSUAAAhuLQgFCAAiCEgKLQ4LCgAiB0gKDioHCgskAgALAAAGSCUAAAdhDCIKRQskAgALAAAGWiUAAAhcACICAgwAKgwKCy0LCwsAKgkLCi0CCAMnAAQEBSUAAAhuLQgFCQAqCQYLLQ4KCwAiBEUILQsICAAqBwYKDioHCgskAgALAAAGqCUAAAdhDCIKRQckAgAHAAAGuiUAAAhcACICAgsAKgsKBy0LBwcAKggHCi0CCQMnAAQEBSUAAAhuLQgFBwAiB0UILQ4KCC0IAQQnAggEBQAIAQgBJwMEBAEAIgcCCAAiBAIJPw8ACAAJACIDSActCgcDIwAABawqAQABBdUSfSnC0ujtPAQCASYqAQABBV5tPy7czYcJPAQCASYqAQABBbq7IdeCMxhkPAQCASYqAQABBRu8ZdA/3OrcPAQCASYqAQABBdAH6/TLxmeQPAQCASYnAgcEAicCCAEBLQgBBicCCQQhAAgBCQEnAwYEAQAiBgIJJwIKBCBDA6oAAwAHAAoACAAJLQIJAy0CCgQlAAAIyCcCAwQhJwIHBCAtCEgELQhJBSMAAAfLDCoEAwgkAgAIAAAH4iMAAAfdLQoFAiYEKgUFCAIqBwQJDioEBwokAgAKAAAH/iUAAAdPDCoJBwokAgAKAAAIECUAAAhcACIGAgsAKgsJCi0LCgocCgoJAAQqCAIKBCoJCgsCKEkJCgQqCggJACoLCQUAIgRICC0KCAQjAAAHyyoBAAEFBQQbmSCvYEw8BAIBJioBAAEF5AhQRQK1jB88BAIBJi0BAwYKAAYCByQAAAcAAAjDLQABBQAAAQQBAAADBAktAAMKLQAFCyMAAAisLQEKCC0ECAsAAAoCCgAACwILDAAKCQwkAAAMAAAImicBBQQBIwAACMctAAMFJi0AAwcAAAMECAIACAIIIwAACPUtAQcFLQEIBi0EBgctBAUIAAAHAgcCAAgCCAwABwgJJAAACQAACNsm",
|
|
2140
|
+
"debug_symbols": "rZvdTpy7DobvZY45iJ0fJ9zKUlXRdrqEhGjFgi1tVdz7tp3E+WArWUOGk87Dy8w7dn6dfOXP6cf528vfX+8ff/7653T715/Tt6f7h4f7v78+/Pp+93z/65HVPycn/0CC062/4dd0uo38StBeY9Wza6/8M/Frce21/ozOt9dcXwFPt+AEiIGdEFMD7zrEBqEroSuxKzF0yA2S79CdCTvIV2SGDB1ih9KghA5N8RJ6BTZEjtkDKwgMCB3YGZHBQ4euhNCBDZFz9xKqQsIO1IC6Ql3JXcmpgTRthdihOQcXOvBXeA41SKgVqIHEXCE18F2RBq/Ahp5jDhJ8ha5EaiDB+yLASuBGCDIWAg+CIIOhgiiBQWIO3AURqYHnj4ckQA2CKCQgCjd4jKIUAWqQupK6Ql2hrkiLRSfASuTAYhGFY05YGnjOK3qB0kAyjUFAFI4wydCKSaA0SF1JXaGuUFeyKCQgCmeRZETFIsBK4sBIuqmCKBwhQfMhyE1B36ErXhQUyDVTkhZTRVpMIXZFWixxXiQtlsRZWizxp7LkTvztWd5MIEANUlfINZDgCQVKheKaUmQKV5CPc6YFWcnsXGQKZxCI7VcyhfVXIbdfRd8ht/fIzNX3yOKSvUBqIBM2k4Ao8uYCHZoCzjmjYJQ7yUxoZJoGXElcipDMhuKUWCsgFMDINFmCGgWj3ElyaWSaDNVG4oJCkljxSqIFIUmtUddAcmsUjHInya2RaZJbI3GRxRo0t6QkmizQoLlVMk1zqxSMcifNrZJpmlslcZE2Bc2tKMnC66RRQZLraCpKeh3DwGwoGXYcKuJANZPWRa9fgYqqSsZ1E2kYDeNQ41DTUFMYmA3JDyTDjAPHF9eMK+pXZMXS0deMKw4VhgpDxaHqPumKYhwo7wUZUV7TrBhhoMQLMjB0/+lI9gZZ00B2EcZsmP3AoZahFlODw4HJEGBgNEQ3MAwshlHNsqIEiZKm7j4d5Stk24IgC0dDjcyDYu4YnR84VEiGqA6omAxlyexYDMNQw1CjfoVXzD3IOOLVrashDVVrk4panTSUhvLSQ1G20I6mpppQRU1I5nnS2VKxJlQxGfqh+qHqFPFJMfaWTDU3Ra22Gg5VK66G2VBz86RIhpqbz4rJsAxV54WibpMgJQboRtlQC8aKOv0bDtUPVXMLEg4F6DFQzU1Rp3/Dg1oMdfo3lNyC9DFpbg3JMA81D7UMtZiatd+kauJKWaeetLpuqR2Hql3YMBn6ofqhhqGGoWpCFbWzGo6v0BEFWqDr8qoVsEN9b1HMhn6o9dsq6viVit7pYtOwGGpLNhwqDbUuNqCHBF1WUFFVL1gXm6CoqtT0oC2JSVHV9Pp6c+pHmK/PT+eznGAOZxo+6fy+ezo/Pp9uH18eHm5O/7l7eNE3/fP77lFfn++e+Lcc1vnxB7+y4c/7h7PQ6834tJt/lHdiKWH14yDbo1nEtx4w90ghhWaRAtFwyG8ccO7gpUxUA5+CfZ7g8gikSqkR8HI3iyDMHQL2RuRFvwyDzXbMMGvHNPcosq+pA88f+3yAy2MIZcQQIc9iyIuWhNwtEs+mWUuWuQNSN+Az6qwv11kEb1kECtMRuRgQXGb1EYV81p2lAYsxyRtZ7C3hDv3By+NbD7/oUUxoXVpg7rEYmbx1eosjjDj85VF4y6T4gPMoVmPTWacUV9zcg1azvFtwaWYO6Mvl3RqgZ8LF8XSew2J48mbWFysu1OLVA5QrsdkAXXpEW7HkoIJbHomieZDzMw9cjA05ZHQPLvvNIr9d+XAxQDH3pZNr69GtgG8d4vXTBNO102QZxYXTBPP10wTLtdNk2alQ+urHRW6adapfzDSuWbsF4aE5c9gcnp5mw9OvMvF6umqp8P42C8QvBihkdLYvZt4PpiaL0cEHdbn4qiYO52WOTysTB5aOc366gnm6eov2+co9epVIKYQjj5CnFddigPg4BnpchLHuWVs5IPP8nfVsWGz0WNA2leLzYc7CBzySLYLcx5se0apgB3HLg5sAzCPBpofNW89XLbsewTyQ9jwgknmktOlh2yw/BNmNI6dP8LA25QdHex442oMfGm16ZBsfHnbjGBs+3/Ptefhoc5+v9zY9bB30AbY98BM8rE0Dbs7bMOZt2J235G3OUdzsl2zrus9lc+4X6utYcK5MPf5l37dJx/eVLs8W9rTYHXKwhSyHMj0EpsWun6yQosPM/1AiiDASmRcwaXVw8oHGbDn2yjuP1ZbP5Ubf5VyguccqjjhWwljKlgc/b+weqbg9Dz7r9JlPLsPUY90xlO0g6LOblri0MiHe6LoJP/jEqUn4hMqS4idUlpSuriyJrqwsV4lcWllSubqyXIdR3AjjUI29D2M9OpLNfb7Yn5478qoq1Jvk2qL8iGBzNSWyGwse9/NAVsO0gO1zXFXFaa2dV81q220pY3yVt6nkxRCNeuWvDhHifLNde1ihzY/UaNPDpluUz215OLs3j8eb9w95oB1e4vFkuxsHLg5A6zjiiKOkPQ/v+pxj3I7DcvGAV7eHh8029cnagwuz6+OgshmHbbe8KG72SwjWLyHk3TisPUK8vj3CosDNy33Sj+3l4PFuCQLnP+Eu3IWrL8NdXG0NVmgjZNo0Qd8HCOLhYcv/m9BqNTysIMfrj3x5IHx5bC1SDtX6+0DWexSmNPaoMq3HAFY3l47KqKUylOlzhtWzCk523E3xXUyeu6wOU2lcpBBMH1f8WyRj53bpUOq+i2TRJgT2cJLAH9fVd3HE5bMGq7gxTT2WUdgVCB0f037EwdqTILsdB3RgN+OOtmIYp0p8s89tOcBWDIhoDt7txZCHA2zF4KM5xL0s7MqDdkfUIYstByhjmpfDTv9+3XKrs3lEO5unuGdhF4zyH1C2LPQ/RLXtxOc9i3HJwEvSXiK29rIFXtsWuxbjf3MgJLdpgcMCru6RXYvLaoSlxegRPNzYfMwCzALctYnsWlxa6gTYK3W+8E933++f3vxhyqt4Pd3ffXs4tx9/vjx+P/z2+b+/+2/6H7b8fvr1/fzj5eksTuOvW/ifv4JLNwHDl5sTyE98+gue5Cf5UYpKvkr+8iqx/A8="
|
|
2141
2141
|
},
|
|
2142
2142
|
{
|
|
2143
2143
|
"name": "update",
|
|
@@ -2196,8 +2196,8 @@
|
|
|
2196
2196
|
}
|
|
2197
2197
|
}
|
|
2198
2198
|
},
|
|
2199
|
-
"bytecode": "
|
|
2200
|
-
"debug_symbols": "
|
|
2199
|
+
"bytecode": "JwACBAEoAAABBIBNJwAABE0lAAAAQScCAwQBJwIEBAAfCgADAAQATC0ITAIlAAAAvycCAgRNJwIDBAA7DgADAAInAEMAAywAAEQALc/6U80Ocdp7SiJnezNCv8O5BD9Qgb6lg2itAI6qbzcsAABFADBkTnLhMaApuFBFtoGBWF0oM+hIeblwkUPh9ZPwAAAAJwBGBAMnAEcAACcASAEBJwBJBAEnAEoAASsAAEsAAAAAAAAAAAMAAAAAAAAAACYeAgAEAQoiBEUFFgoFBhwKBgcABCoHBAYnAgQBAAoqBQQHJAIABwAAAPInAggEADwGCAEeAgAFACkCAAcAA21Sfy0IAQgnAgkEBAAIAQkBJwMIBAEAIggCCS0KCQotDgcKACIKAgotDgUKACIKAgotDgYKJwIJBAotCAAKLQoIDAAIAAkAJQAABjwtAgAALQoMBTMKAAUACCQCAAgAAAFkJQAAB/ctCAEFJwIIBAQACAEIAScDBQQBACIFAggtCggJLQ4HCQAiCQIJLQxDCQAiCQIJLQ4CCScCCAQJLQgACS0KBQsACAAIACUAAAY8LQIAAC0KCwczCgAHAAUkAgAFAAAByCUAAAgJKQIABQDvUlNNLQgBBycCCAQEAAgBCAEnAwcEAQAiBwIILQoICS0OBQkAIgkCCS0MSgkAIgkCCS0OBgknAggECS0IAAktCgcLAAgACAAlAAAGPC0CAAAtCgsFCiIFRwcKKgcECCQCAAgAAAI5JQAACBseAgAEAC8qAAUABAAHACIFSgQeAgAIAC8qAAQACAAJJwIIAAIAKgUICh4CAAsALyoACgALAAwcCgcNBBwKDQsAHAoLBwUeAgALAC8qAAUACwANHAoNDgQcCg4LAAIqDQsOLAIACwAtXgmLgro3tDuZoTFhGP0g1C9RZsnp8T+16mWpbR4KbQQqDgsNHAoNDwQcCg8OAAIqDQ4PBCoPCw0cCg0QAhwKEA8AHAoPEAIcChARARwKEQ8CHAoPEAEcCg8RAAIqDRESLAIADQAwM+okblBuiY6X9XDK/9cEywu0YDE/tyCynhOeXBAAAQQqEg0THAoTFAQcChQSAAIqExIUBCoUCxMcChMUAhwKFAsAHAoLFAIcChQVARwKFQsCHAoLFAEcCgsVAAIqExUWBCoWDRMcChMWBBwKFg0AHAoNEwUWChQNHAoLFAUcCg0LBQQqFBMNHAoSEwUWChASHAoPEAUcChIPBQQqEBMSHAoOEwUeAgAWBgwqFhMXKQIAEwUAAVGAJAIAFwAAA94jAAADygQqEBILBCoPExAAKgsQAyMAAAPyBCoUDQ8EKgsTEAAqDxADIwAAA/IAKhYDCw4qFgsPJAIADwAABAklAAAILQwqFgcDFgoDBxwKAw8AHAoHAwAEKg8JBwQqAwwJACoHCQMcCgsHACcCCQAgJwIMBBYtCAAWLQoIGC0KCRkACAAMACUAAAg/LQIAAC0KGAsEKg4LCQAqBwkLJwIJAEAnAg4EFi0IABYtCggYLQoJGQAIAA4AJQAACD8tAgAALQoYDAQqEQwJACoLCQwcChIJACcCCwBIJwIPBBYtCAAWLQoIGC0KCxkACAAPACUAAAg/LQIAAC0KGA4EKgkOCwAqDAsJJwILAGgnAg4EFi0IABYtCggYLQoLGQAIAA4AJQAACD8tAgAALQoYDAQqFQwLACoJCwwcCg0JACcCCwBwJwIOBA8tCAAPLQoIES0KCxIACAAOACUAAAg/LQIAAC0KEQ0EKgkNCAAqDAgJLQgBCCcCCwQFAAgBCwEnAwgEAQAiCAILLQoLDC0OCQwAIgwCDC0OAwwAIgwCDC0OAgwAIgwCDC0MSwwtCAELJwIMBAUACAEMAScDCwQBACIIAgwAIgsCDT8PAAwADQAiC0kILQsICDAKAAkABTAKAAMABDAKAAIACgAiBUMEMAoACAAEJwIFBAUnAgkEAwAqBQkILQgBBAAIAQgBJwMEBAEAIgQCCC0OBQgAIggCCC0OBQgnAggEAwAqBAgFLQoFCC0MRAgAIggCCC0OBggAIggCCC0OAwgAIggCCC0OAggAIggCCC0OBwgnAgIEBQAiBAIFLQsFBScCBgQDACoEBgM3DgAFAAMmLQgBBCcCBQQFAAgBBQEnAwQEAQAiBAIFLQoFBi0MRwYAIgYCBi0MRwYAIgYCBi0MRwYAIgYCBi0MSwYnAgUEACcCBgQCLQoFAyMAAAaKCioDBQcAIgRJCC0LCAgAKgQGCS0LCQkkAgAHAAAGsyMAAAauLQoIAiYEIgNGBwYiB0YLCioLAwokAgAKAAAGzyUAAAkWDCIHRgokAgAKAAAG4SUAAAkoACICAgsAKgsHCi0LCgoAKggKCy0CBAMnAAQEBSUAAAk6LQgFCAAiCEkKLQ4LCgAiB0kKDioHCgskAgALAAAHJiUAAAgtDCIKRgskAgALAAAHOCUAAAkoACICAgwAKgwKCy0LCwsAKgkLCi0CCAMnAAQEBSUAAAk6LQgFCQAqCQYLLQ4KCwAiBEYILQsICAAqBwYKDioHCgskAgALAAAHhiUAAAgtDCIKRgckAgAHAAAHmCUAAAkoACICAgsAKgsKBy0LBwcAKggHCi0CCQMnAAQEBSUAAAk6LQgFBwAiB0YILQ4KCC0IAQQnAggEBQAIAQgBJwMEBAEAIgcCCAAiBAIJPw8ACAAJACIDSQctCgcDIwAABooqAQABBdUSfSnC0ujtPAQCASYqAQABBa6Sj2upjpKMPAQCASYqAQABBbq7IdeCMxhkPAQCASYqAQABBdAH6/TLxmeQPAQCASYnAgcEAicCCAEBLQgBBicCCQQhAAgBCQEnAwYEAQAiBgIJJwIKBCBDA6oAAwAHAAoACAAJLQIJAy0CCgQlAAAJlCcCAwQhJwIHBCAtCEkELQhKBSMAAAiXDCoEAwgkAgAIAAAIriMAAAipLQoFAiYEKgUFCAIqBwQJDioEBwokAgAKAAAIyiUAAAnPDCoJBwokAgAKAAAI3CUAAAkoACIGAgsAKgsJCi0LCgocCgoJAAQqCAIKBCoJCgsCKEoJCgQqCggJACoLCQUAIgRJCC0KCAQjAAAIlyoBAAEFBQQbmSCvYEw8BAIBJioBAAEF5AhQRQK1jB88BAIBJi0BAwYKAAYCByQAAAcAAAmPLQABBQAAAQQBAAADBAktAAMKLQAFCyMAAAl4LQEKCC0ECAsAAAoCCgAACwILDAAKCQwkAAAMAAAJZicBBQQBIwAACZMtAAMFJi0AAwcAAAMECAIACAIIIwAACcEtAQcFLQEIBi0EBgctBAUIAAAHAgcCAAgCCAwABwgJJAAACQAACacmKgEAAQUbvGXQP9zq3DwEAgEm",
|
|
2200
|
+
"debug_symbols": "tZvdbpwpD8fvZY5zgPl2b2VVVWmbriJFaZVtX+lVlXtf24D9JCvYCU/2pPMbz8wfGwwYnvT35evd519/frp//Pb9r8uHP35fPj/dPzzc//np4fuX25/33x/J+vvi+B9AuHwIN/SaLx/SzcU76K9J7B5cf6X3hV6966/9fQj9tbbX6C8fwDEUAlZKuUN2A1KHMixlWOqw1DigdsAwoCsH5wdwE5UAYEAagB18HDAs7HoDEvTkc4hk8UCQYAAp+0zAzjdIHcqwlGGpw8LON6gd2PkGpUFk5xtwE0jAzjdIA7ADO99gWNj5BiQYyNXIzgdPwM43IOVAgxLZ5wbYocQBw1KHpQ4L+9ygNEjsc4OunNjnBtREpD5MnCAN4oDagX1uMCycLQ1IMJLPiZ1vMCw5DiDHIoWc2PlEIadKP0/8US39I/Tto+xc+yhzIgtwJvN3Mrsq3/HkT4oMtQN7mBIDWTJ/h3s10wTI7Fjmj9gxgcyWzMAW6oTiwgD+OaVWgTCALdR64UaLY+AZQ00UmUICwxKHJQ5LGpbEFgqnZLYEBraQ85UjFeBIS2JIHWTWZga2kIc1sKUypA5xWOKwpGFJw8KzoCADWSpFUXkWVGBgCzlWeRY0YAt5WHHoYBwWbIAuDmALOY8QW6TIPSYW7rEGw8I9VhMDW0gZuceQ/AHHwSMIpUFebSzRiDUwCtVBsWcPURmU1JbUltWWyYaVqZANUagMqmqreRB3RqeohJ3ARaU6CGRJdYK89DluGbxYvWBRDGYNWZGHdmA0RMVkVk6wjlnEgqA0wZ0ERaxJUKyZsXpDs/LuMjAZ4kDvoqFZedYMFLHC2CKugmLl3vEt4oZmjWCYDFGxRdzQrDkYshjvZNS93ASAoFi5d7xEDEGwKKJZeUttGHg1GhgNURHMynnfUSKGKChNcK8HiRhQMCtKxB3NmsyazCo7ccdoiIolGFbFag23iAVljHmzJEwDo0Tc0axgVjCrN6tnJz33bwxgKN/lfIgSZseiyMsjDY5gVavExpskyMbXsZi1mLUGw6qIZkW1yjY4sChK7dExK3qz+mSoDacQDa2JGAytiWQNJ2siWxNSWXE1AElqq44HKypKhdXRrJK0kVNOttCBSRHMCmb1ZpVCq2NVlGKrY1GUarGjNSxJ21AGKyZBdjLywGZxvaM0wSOfZbAES/OMl4rSPGto1mBW6fWG0utcI4DsvB2lqxtKV3c0azFrK2R51ShSyoqTxfwtVaMoaFZJLsHqgqEUujwsVfaAjmaVgBpKQFzngOzoHSWgjlUxmTWZVVb7FATL6MnaYmuYFatZa1JEZyjlexTEgSixcX1FWBXBrDJbOsqxgfsBZSXoiIqyk3U0azJri43dQVnXmw8SW0NZ1zuaVWLrmBUltoSC0RA7eueioVnBrGDWNm6Vj1WyagQ5Ycmq0dCbVb7bUMa4o1mjWaNZk1kl+I5FsVgTEkWIfKqTHSckQfluZpQdp6NZW2uCrbV2LkyKreGGVbGYtZhV9pZQBaUJ7qi2m/IBwbdTXwQ+asr6y0cCQrFyFEGmSAzPzzeXcc799PPp7o6PuYeDLx2Hf9w+3T3+vHx4/PXwcHP53+3DL/nSXz9uH+X15+0TfUqt3j1+pVcS/Hb/cMf0fGO/dvOf1so1rfyaJkVRgfRSAeYKtBzGrpBjOSjUFwp+rhB4QRIB2uP19wWu9wD98CDFOPMgzhWiH11Imz2awFYvQp71Yp4rIAwBWk709xGu9YCOHk4Fkpt5UBe9CHw8ab1I837WizhX8GUIeJyO4yoGUAGkGnuai4tUoOk7conue2AWBCyyMSGfGFo/uMNY0Nb3UiOsRiN7jQRhrrHIyexCUD+i+RGu9yJoJBiin3uxyksXNTHpQDjXKKv5PSTolkkVfMDrhzXCiITW8ukMh0Vy0oI8linafNLZ9Exhlp4rhcQXGk0huzpT8P50gvtwPsF9PJ/gPp1N8KUXVya4L+cT3NezCb4c1usSPLj/NMEP6VmOuXV9gtcwfMBapwkeFtnJtyAjDI8WRn25GYdFWvg6tsKAh+EA/1IhnU/vkM+m99KLK9M71PPpHfBsei8HFXCsWnQ0yLNBjYstoHg/JIo/dGeNO8mJcVoixdWOGjUOpPuSmRNxkZx8oB+zjDj4qcgiM+jWkw+OTcT5edUd80rEgXriXJgXzuV01RjrybJxFQhi8RZHrDMn0iI5QrIkT7tuoDM3IE37Yp0d/CynZ0eEMMuOtMhSWulGovOZ+zDn4S0awTTqVGM5W1LSVZSehE1DWeUoPQ8a2UEc5v1R3mG2pPoOsyXh6dmS3cnZsgrk2tmS/enZ8i8jq3ss3wmm2cjm1U6PXssmesI2zdK1RtZygcZ4UyPpFcZx5r9Fg7oAVCPDpkYZ/RHgsHi8USOqhi97GnKZ2TVy3tTQW51Ad4CbGjW/g4b2KV2y7Gl46w96XLepUTU/Auz6YaVx8HFPIySd+yH7TQ1dB+lp4LaGfwcN7dPoN+dttHkbd+dt0dI0lLQ5LlXX9VBxc+5jGesYPRbFvV0/A+glx3zDrou9oUZdxmrE6SVHXdWlWqiXw7x/UxhZD1+54jSM1X2oc1pDuXic9fF6N6oeh7GWOj0sLCV0suHxcvqVBC72+5pgrKP0SO44T/JLjdUZsGrlQg/S4lRjGQpisNrFTZMLV2cnBJ30tMWkaeGBq1pf1x5EW3rwZXrhIj+T06cmCRZVx1IDtOqg8SmbGlrVJv7dlsYxluL3NLxWculY5r8tFk100iinY/GLinIdS7JYMO9pBDd2asJtPzSWAP50fwTYHJegS2minW5TQ69/SKOej6Xgph84VkI6A22ObYw6tjHWXT+0T2MKp/sjLqoOXF4iBTtNHjReLYXwLs+Y3uMh0+oiCrT68bRbbYr4MBLE+8Olxz9EvFutZIdV6Lg71Osdobtv7RE8FFGvHVnvlT5n2ytxelkJqwdO4Ara1UkFnD+WXV2NuWQXBnRArnOVRUQh2+m2wPQpyb95YhWEy4f77FeeuOW8cXYnRYvb9Gn36sETeP3DBThWMv/okXrd3bxP815dPnvK9uwpx51nTwX0DyAKhONe9coLv3x0pF74PNVYeqHn9HL8Q5C3KGh+FahuR8E70Acdrmz5YIcf/6J22FKALR+896oQ3J4P1RRgy4eQVCHtRaHn8rKbUYcothQAbdnDQ/X0eh1f3Rk7vYj3Lqc9Cb0F8w73vAD9EyXCuidhJ2oA2AtE9yKS8Gf7YldC/oy3S2S3KeFNAk6PyK7EdTXTUsJG5PhnX2+TAJUAdzaQXYlrS7/V45lV6feR3t1+uX968b8jn1nr6f7288Ndf/vt1+OXw6c///9jfDL+d+WPp+9f7r7+erpjJfsvlvTPH5EeccYcP95cgN/RyS2Wwu/4baBbOyqvPz6zL38D"
|
|
2201
2201
|
}
|
|
2202
2202
|
],
|
|
2203
2203
|
"outputs": {
|
|
@@ -2785,15 +2785,109 @@
|
|
|
2785
2785
|
"function_locations": [
|
|
2786
2786
|
{
|
|
2787
2787
|
"name": "aes128_encrypt",
|
|
2788
|
-
"start":
|
|
2788
|
+
"start": 351
|
|
2789
2789
|
},
|
|
2790
2790
|
{
|
|
2791
2791
|
"name": "aes128_encrypt_padded_input",
|
|
2792
|
-
"start":
|
|
2792
|
+
"start": 824
|
|
2793
2793
|
}
|
|
2794
2794
|
],
|
|
2795
2795
|
"path": "std/aes128.nr",
|
|
2796
|
-
"source": "// docs:start:aes128\n
|
|
2796
|
+
"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"
|
|
2797
|
+
},
|
|
2798
|
+
"148": {
|
|
2799
|
+
"function_locations": [
|
|
2800
|
+
{
|
|
2801
|
+
"name": "<impl Empty for AztecAddress>::empty",
|
|
2802
|
+
"start": 939
|
|
2803
|
+
},
|
|
2804
|
+
{
|
|
2805
|
+
"name": "<impl ToField for AztecAddress>::to_field",
|
|
2806
|
+
"start": 1039
|
|
2807
|
+
},
|
|
2808
|
+
{
|
|
2809
|
+
"name": "<impl FromField for AztecAddress>::from_field",
|
|
2810
|
+
"start": 1151
|
|
2811
|
+
},
|
|
2812
|
+
{
|
|
2813
|
+
"name": "AztecAddress::zero",
|
|
2814
|
+
"start": 1246
|
|
2815
|
+
},
|
|
2816
|
+
{
|
|
2817
|
+
"name": "AztecAddress::is_valid",
|
|
2818
|
+
"start": 1576
|
|
2819
|
+
},
|
|
2820
|
+
{
|
|
2821
|
+
"name": "AztecAddress::to_address_point",
|
|
2822
|
+
"start": 1951
|
|
2823
|
+
},
|
|
2824
|
+
{
|
|
2825
|
+
"name": "AztecAddress::is_positive",
|
|
2826
|
+
"start": 2604
|
|
2827
|
+
},
|
|
2828
|
+
{
|
|
2829
|
+
"name": "AztecAddress::get_y",
|
|
2830
|
+
"start": 3460
|
|
2831
|
+
},
|
|
2832
|
+
{
|
|
2833
|
+
"name": "AztecAddress::compute",
|
|
2834
|
+
"start": 3846
|
|
2835
|
+
},
|
|
2836
|
+
{
|
|
2837
|
+
"name": "AztecAddress::compute_from_class_id",
|
|
2838
|
+
"start": 7868
|
|
2839
|
+
},
|
|
2840
|
+
{
|
|
2841
|
+
"name": "AztecAddress::is_zero",
|
|
2842
|
+
"start": 8140
|
|
2843
|
+
},
|
|
2844
|
+
{
|
|
2845
|
+
"name": "AztecAddress::assert_is_zero",
|
|
2846
|
+
"start": 8205
|
|
2847
|
+
},
|
|
2848
|
+
{
|
|
2849
|
+
"name": "check_max_field_value",
|
|
2850
|
+
"start": 8289
|
|
2851
|
+
},
|
|
2852
|
+
{
|
|
2853
|
+
"name": "check_is_positive",
|
|
2854
|
+
"start": 8400
|
|
2855
|
+
},
|
|
2856
|
+
{
|
|
2857
|
+
"name": "check_embedded_curve_point_add",
|
|
2858
|
+
"start": 8921
|
|
2859
|
+
},
|
|
2860
|
+
{
|
|
2861
|
+
"name": "check_embedded_curve_point_add_2",
|
|
2862
|
+
"start": 9338
|
|
2863
|
+
},
|
|
2864
|
+
{
|
|
2865
|
+
"name": "compute_address_from_partial_and_pub_keys",
|
|
2866
|
+
"start": 9567
|
|
2867
|
+
},
|
|
2868
|
+
{
|
|
2869
|
+
"name": "compute_preaddress_from_partial_and_pub_keys",
|
|
2870
|
+
"start": 11398
|
|
2871
|
+
},
|
|
2872
|
+
{
|
|
2873
|
+
"name": "from_field_to_field",
|
|
2874
|
+
"start": 11747
|
|
2875
|
+
},
|
|
2876
|
+
{
|
|
2877
|
+
"name": "serde",
|
|
2878
|
+
"start": 11884
|
|
2879
|
+
},
|
|
2880
|
+
{
|
|
2881
|
+
"name": "to_address_point_valid",
|
|
2882
|
+
"start": 12290
|
|
2883
|
+
},
|
|
2884
|
+
{
|
|
2885
|
+
"name": "to_address_point_invalid",
|
|
2886
|
+
"start": 12954
|
|
2887
|
+
}
|
|
2888
|
+
],
|
|
2889
|
+
"path": "/home/aztec-dev/aztec-packages/noir-projects/noir-protocol-circuits/crates/types/src/address/aztec_address.nr",
|
|
2890
|
+
"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"
|
|
2797
2891
|
},
|
|
2798
2892
|
"15": {
|
|
2799
2893
|
"function_locations": [
|
|
@@ -2831,51 +2925,119 @@
|
|
|
2831
2925
|
},
|
|
2832
2926
|
{
|
|
2833
2927
|
"name": "EmbeddedCurveScalar::new",
|
|
2834
|
-
"start":
|
|
2928
|
+
"start": 3017
|
|
2835
2929
|
},
|
|
2836
2930
|
{
|
|
2837
2931
|
"name": "EmbeddedCurveScalar::from_field",
|
|
2838
|
-
"start":
|
|
2932
|
+
"start": 3202
|
|
2839
2933
|
},
|
|
2840
2934
|
{
|
|
2841
2935
|
"name": "EmbeddedCurveScalar::from_bytes",
|
|
2842
|
-
"start":
|
|
2936
|
+
"start": 3548
|
|
2843
2937
|
},
|
|
2844
2938
|
{
|
|
2845
2939
|
"name": "<impl Eq for EmbeddedCurveScalar>::eq",
|
|
2846
|
-
"start":
|
|
2940
|
+
"start": 3994
|
|
2847
2941
|
},
|
|
2848
2942
|
{
|
|
2849
2943
|
"name": "<impl Hash for EmbeddedCurveScalar>::hash",
|
|
2850
|
-
"start":
|
|
2944
|
+
"start": 4177
|
|
2851
2945
|
},
|
|
2852
2946
|
{
|
|
2853
2947
|
"name": "multi_scalar_mul",
|
|
2854
|
-
"start":
|
|
2948
|
+
"start": 4921
|
|
2949
|
+
},
|
|
2950
|
+
{
|
|
2951
|
+
"name": "multi_scalar_mul_array_return_blackbox",
|
|
2952
|
+
"start": 5190
|
|
2855
2953
|
},
|
|
2856
2954
|
{
|
|
2857
2955
|
"name": "multi_scalar_mul_array_return",
|
|
2858
|
-
"start":
|
|
2956
|
+
"start": 5356
|
|
2859
2957
|
},
|
|
2860
2958
|
{
|
|
2861
2959
|
"name": "fixed_base_scalar_mul",
|
|
2862
|
-
"start":
|
|
2960
|
+
"start": 5675
|
|
2863
2961
|
},
|
|
2864
2962
|
{
|
|
2865
2963
|
"name": "embedded_curve_add",
|
|
2866
|
-
"start":
|
|
2964
|
+
"start": 6197
|
|
2867
2965
|
},
|
|
2868
2966
|
{
|
|
2869
2967
|
"name": "embedded_curve_add_array_return",
|
|
2870
|
-
"start":
|
|
2968
|
+
"start": 6788
|
|
2871
2969
|
},
|
|
2872
2970
|
{
|
|
2873
2971
|
"name": "embedded_curve_add_inner",
|
|
2874
|
-
"start":
|
|
2972
|
+
"start": 6958
|
|
2875
2973
|
}
|
|
2876
2974
|
],
|
|
2877
2975
|
"path": "std/embedded_curve_ops.nr",
|
|
2878
|
-
"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
|
|
2976
|
+
"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 /// Create a new scalar using the provided (lo, hi) pair\n pub fn new(lo: Field, hi: Field) -> Self {\n EmbeddedCurveScalar { lo, hi }\n }\n\n /// Create a scalar from the given bn254 field value\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 /// 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)[0]\n}\n\n#[foreign(multi_scalar_mul)]\nfn multi_scalar_mul_array_return_blackbox<let N: u32>(\n points: [EmbeddedCurvePoint; N],\n scalars: [EmbeddedCurveScalar; N],\n predicate: bool,\n) -> [EmbeddedCurvePoint; 1] {}\n\npub(crate) fn multi_scalar_mul_array_return<let N: u32>(\n points: [EmbeddedCurvePoint; N],\n scalars: [EmbeddedCurveScalar; N],\n) -> [EmbeddedCurvePoint; 1] {\n let mut result = multi_scalar_mul_array_return_blackbox(points, scalars, true);\n result[0].is_infinite = (result[0].x == 0) & (result[0].y == 0);\n result\n}\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 let mut result = embedded_curve_add_array_return(point1, point2, true)[0];\n result.is_infinite = (result.x == 0) & (result.y == 0);\n result\n}\n"
|
|
2977
|
+
},
|
|
2978
|
+
"151": {
|
|
2979
|
+
"function_locations": [
|
|
2980
|
+
{
|
|
2981
|
+
"name": "<impl ToField for PartialAddress>::to_field",
|
|
2982
|
+
"start": 489
|
|
2983
|
+
},
|
|
2984
|
+
{
|
|
2985
|
+
"name": "<impl Empty for PartialAddress>::empty",
|
|
2986
|
+
"start": 574
|
|
2987
|
+
},
|
|
2988
|
+
{
|
|
2989
|
+
"name": "PartialAddress::from_field",
|
|
2990
|
+
"start": 677
|
|
2991
|
+
},
|
|
2992
|
+
{
|
|
2993
|
+
"name": "PartialAddress::compute",
|
|
2994
|
+
"start": 883
|
|
2995
|
+
},
|
|
2996
|
+
{
|
|
2997
|
+
"name": "PartialAddress::compute_from_salted_initialization_hash",
|
|
2998
|
+
"start": 1254
|
|
2999
|
+
},
|
|
3000
|
+
{
|
|
3001
|
+
"name": "PartialAddress::to_field",
|
|
3002
|
+
"start": 1496
|
|
3003
|
+
},
|
|
3004
|
+
{
|
|
3005
|
+
"name": "PartialAddress::is_zero",
|
|
3006
|
+
"start": 1557
|
|
3007
|
+
},
|
|
3008
|
+
{
|
|
3009
|
+
"name": "PartialAddress::assert_is_zero",
|
|
3010
|
+
"start": 1627
|
|
3011
|
+
},
|
|
3012
|
+
{
|
|
3013
|
+
"name": "test::serialization_of_partial_address",
|
|
3014
|
+
"start": 1835
|
|
3015
|
+
}
|
|
3016
|
+
],
|
|
3017
|
+
"path": "/home/aztec-dev/aztec-packages/noir-projects/noir-protocol-circuits/crates/types/src/address/partial_address.nr",
|
|
3018
|
+
"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"
|
|
3019
|
+
},
|
|
3020
|
+
"153": {
|
|
3021
|
+
"function_locations": [
|
|
3022
|
+
{
|
|
3023
|
+
"name": "<impl ToField for SaltedInitializationHash>::to_field",
|
|
3024
|
+
"start": 383
|
|
3025
|
+
},
|
|
3026
|
+
{
|
|
3027
|
+
"name": "SaltedInitializationHash::from_field",
|
|
3028
|
+
"start": 489
|
|
3029
|
+
},
|
|
3030
|
+
{
|
|
3031
|
+
"name": "SaltedInitializationHash::compute",
|
|
3032
|
+
"start": 620
|
|
3033
|
+
},
|
|
3034
|
+
{
|
|
3035
|
+
"name": "SaltedInitializationHash::assert_is_zero",
|
|
3036
|
+
"start": 848
|
|
3037
|
+
}
|
|
3038
|
+
],
|
|
3039
|
+
"path": "/home/aztec-dev/aztec-packages/noir-projects/noir-protocol-circuits/crates/types/src/address/salted_initialization_hash.nr",
|
|
3040
|
+
"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"
|
|
2879
3041
|
},
|
|
2880
3042
|
"16": {
|
|
2881
3043
|
"function_locations": [
|
|
@@ -3147,555 +3309,25 @@
|
|
|
3147
3309
|
},
|
|
3148
3310
|
{
|
|
3149
3311
|
"name": "tests::from_le_bits",
|
|
3150
|
-
"start": 24029
|
|
3151
|
-
},
|
|
3152
|
-
{
|
|
3153
|
-
"name": "tests::from_be_bits",
|
|
3154
|
-
"start": 24574
|
|
3155
|
-
},
|
|
3156
|
-
{
|
|
3157
|
-
"name": "tests::test_to_from_be_bits_bn254_edge_cases",
|
|
3158
|
-
"start": 24820
|
|
3159
|
-
},
|
|
3160
|
-
{
|
|
3161
|
-
"name": "tests::test_to_from_le_bits_bn254_edge_cases",
|
|
3162
|
-
"start": 26734
|
|
3163
|
-
}
|
|
3164
|
-
],
|
|
3165
|
-
"path": "std/field/mod.nr",
|
|
3166
|
-
"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"
|
|
3167
|
-
},
|
|
3168
|
-
"18": {
|
|
3169
|
-
"function_locations": [
|
|
3170
|
-
{
|
|
3171
|
-
"name": "sha256_compression",
|
|
3172
|
-
"start": 572
|
|
3173
|
-
},
|
|
3174
|
-
{
|
|
3175
|
-
"name": "keccakf1600",
|
|
3176
|
-
"start": 707
|
|
3177
|
-
},
|
|
3178
|
-
{
|
|
3179
|
-
"name": "keccak::keccakf1600",
|
|
3180
|
-
"start": 882
|
|
3181
|
-
},
|
|
3182
|
-
{
|
|
3183
|
-
"name": "blake2s",
|
|
3184
|
-
"start": 1044
|
|
3185
|
-
},
|
|
3186
|
-
{
|
|
3187
|
-
"name": "blake3",
|
|
3188
|
-
"start": 1142
|
|
3189
|
-
},
|
|
3190
|
-
{
|
|
3191
|
-
"name": "__blake3",
|
|
3192
|
-
"start": 1629
|
|
3193
|
-
},
|
|
3194
|
-
{
|
|
3195
|
-
"name": "pedersen_commitment",
|
|
3196
|
-
"start": 1747
|
|
3197
|
-
},
|
|
3198
|
-
{
|
|
3199
|
-
"name": "pedersen_commitment_with_separator",
|
|
3200
|
-
"start": 1976
|
|
3201
|
-
},
|
|
3202
|
-
{
|
|
3203
|
-
"name": "pedersen_hash",
|
|
3204
|
-
"start": 2460
|
|
3205
|
-
},
|
|
3206
|
-
{
|
|
3207
|
-
"name": "pedersen_hash_with_separator",
|
|
3208
|
-
"start": 2617
|
|
3209
|
-
},
|
|
3210
|
-
{
|
|
3211
|
-
"name": "derive_generators",
|
|
3212
|
-
"start": 3597
|
|
3213
|
-
},
|
|
3214
|
-
{
|
|
3215
|
-
"name": "__derive_generators",
|
|
3216
|
-
"start": 3956
|
|
3217
|
-
},
|
|
3218
|
-
{
|
|
3219
|
-
"name": "from_field_unsafe",
|
|
3220
|
-
"start": 4271
|
|
3221
|
-
},
|
|
3222
|
-
{
|
|
3223
|
-
"name": "poseidon2_permutation",
|
|
3224
|
-
"start": 4928
|
|
3225
|
-
},
|
|
3226
|
-
{
|
|
3227
|
-
"name": "poseidon2_permutation_internal",
|
|
3228
|
-
"start": 5324
|
|
3229
|
-
},
|
|
3230
|
-
{
|
|
3231
|
-
"name": "poseidon2_config_state_size",
|
|
3232
|
-
"start": 5417
|
|
3233
|
-
},
|
|
3234
|
-
{
|
|
3235
|
-
"name": "derive_hash",
|
|
3236
|
-
"start": 5728
|
|
3237
|
-
},
|
|
3238
|
-
{
|
|
3239
|
-
"name": "<impl BuildHasher for BuildHasherDefault<H>>::build_hasher",
|
|
3240
|
-
"start": 6699
|
|
3241
|
-
},
|
|
3242
|
-
{
|
|
3243
|
-
"name": "<impl Default for BuildHasherDefault<H>>::default",
|
|
3244
|
-
"start": 6831
|
|
3245
|
-
},
|
|
3246
|
-
{
|
|
3247
|
-
"name": "<impl Hash for Field>::hash",
|
|
3248
|
-
"start": 6963
|
|
3249
|
-
},
|
|
3250
|
-
{
|
|
3251
|
-
"name": "<impl Hash for u1>::hash",
|
|
3252
|
-
"start": 7093
|
|
3253
|
-
},
|
|
3254
|
-
{
|
|
3255
|
-
"name": "<impl Hash for u8>::hash",
|
|
3256
|
-
"start": 7232
|
|
3257
|
-
},
|
|
3258
|
-
{
|
|
3259
|
-
"name": "<impl Hash for u16>::hash",
|
|
3260
|
-
"start": 7372
|
|
3261
|
-
},
|
|
3262
|
-
{
|
|
3263
|
-
"name": "<impl Hash for u32>::hash",
|
|
3264
|
-
"start": 7512
|
|
3265
|
-
},
|
|
3266
|
-
{
|
|
3267
|
-
"name": "<impl Hash for u64>::hash",
|
|
3268
|
-
"start": 7652
|
|
3269
|
-
},
|
|
3270
|
-
{
|
|
3271
|
-
"name": "<impl Hash for u128>::hash",
|
|
3272
|
-
"start": 7793
|
|
3273
|
-
},
|
|
3274
|
-
{
|
|
3275
|
-
"name": "<impl Hash for i8>::hash",
|
|
3276
|
-
"start": 7932
|
|
3277
|
-
},
|
|
3278
|
-
{
|
|
3279
|
-
"name": "<impl Hash for i16>::hash",
|
|
3280
|
-
"start": 8078
|
|
3281
|
-
},
|
|
3282
|
-
{
|
|
3283
|
-
"name": "<impl Hash for i32>::hash",
|
|
3284
|
-
"start": 8225
|
|
3285
|
-
},
|
|
3286
|
-
{
|
|
3287
|
-
"name": "<impl Hash for i64>::hash",
|
|
3288
|
-
"start": 8372
|
|
3289
|
-
},
|
|
3290
|
-
{
|
|
3291
|
-
"name": "<impl Hash for bool>::hash",
|
|
3292
|
-
"start": 8520
|
|
3293
|
-
},
|
|
3294
|
-
{
|
|
3295
|
-
"name": "<impl Hash for ()>::hash",
|
|
3296
|
-
"start": 8667
|
|
3297
|
-
},
|
|
3298
|
-
{
|
|
3299
|
-
"name": "<impl Hash for [T; N]>::hash",
|
|
3300
|
-
"start": 8799
|
|
3301
|
-
},
|
|
3302
|
-
{
|
|
3303
|
-
"name": "<impl Hash for [T]>::hash",
|
|
3304
|
-
"start": 8988
|
|
3305
|
-
},
|
|
3306
|
-
{
|
|
3307
|
-
"name": "<impl Hash for (A, B)>::hash",
|
|
3308
|
-
"start": 9228
|
|
3309
|
-
},
|
|
3310
|
-
{
|
|
3311
|
-
"name": "<impl Hash for (A, B, C)>::hash",
|
|
3312
|
-
"start": 9444
|
|
3313
|
-
},
|
|
3314
|
-
{
|
|
3315
|
-
"name": "<impl Hash for (A, B, C, D)>::hash",
|
|
3316
|
-
"start": 9707
|
|
3317
|
-
},
|
|
3318
|
-
{
|
|
3319
|
-
"name": "<impl Hash for (A, B, C, D, E)>::hash",
|
|
3320
|
-
"start": 10017
|
|
3321
|
-
},
|
|
3322
|
-
{
|
|
3323
|
-
"name": "assert_pedersen",
|
|
3324
|
-
"start": 10413
|
|
3325
|
-
}
|
|
3326
|
-
],
|
|
3327
|
-
"path": "std/hash/mod.nr",
|
|
3328
|
-
"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"
|
|
3329
|
-
},
|
|
3330
|
-
"239": {
|
|
3331
|
-
"function_locations": [
|
|
3332
|
-
{
|
|
3333
|
-
"name": "assert_compatible_oracle_version",
|
|
3334
|
-
"start": 700
|
|
3335
|
-
},
|
|
3336
|
-
{
|
|
3337
|
-
"name": "assert_compatible_oracle_version_wrapper",
|
|
3338
|
-
"start": 1009
|
|
3339
|
-
},
|
|
3340
|
-
{
|
|
3341
|
-
"name": "assert_compatible_oracle_version_oracle",
|
|
3342
|
-
"start": 1199
|
|
3343
|
-
},
|
|
3344
|
-
{
|
|
3345
|
-
"name": "test::compatible_oracle_version",
|
|
3346
|
-
"start": 1350
|
|
3347
|
-
},
|
|
3348
|
-
{
|
|
3349
|
-
"name": "test::incompatible_oracle_version",
|
|
3350
|
-
"start": 1559
|
|
3351
|
-
}
|
|
3352
|
-
],
|
|
3353
|
-
"path": "/home/aztec-dev/aztec-packages/noir-projects/aztec-nr/aztec/src/oracle/version.nr",
|
|
3354
|
-
"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 and if the oracle version is incompatible an error is thrown.\npub global ORACLE_VERSION: Field = 18;\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"
|
|
3355
|
-
},
|
|
3356
|
-
"3": {
|
|
3357
|
-
"function_locations": [
|
|
3358
|
-
{
|
|
3359
|
-
"name": "[T; N]::len",
|
|
3360
|
-
"start": 480
|
|
3361
|
-
},
|
|
3362
|
-
{
|
|
3363
|
-
"name": "[T; N]::as_vector",
|
|
3364
|
-
"start": 735
|
|
3365
|
-
},
|
|
3366
|
-
{
|
|
3367
|
-
"name": "[T; N]::as_slice",
|
|
3368
|
-
"start": 1112
|
|
3369
|
-
},
|
|
3370
|
-
{
|
|
3371
|
-
"name": "[T; N]::map",
|
|
3372
|
-
"start": 1442
|
|
3373
|
-
},
|
|
3374
|
-
{
|
|
3375
|
-
"name": "[T; N]::mapi",
|
|
3376
|
-
"start": 2002
|
|
3377
|
-
},
|
|
3378
|
-
{
|
|
3379
|
-
"name": "[T; N]::for_each",
|
|
3380
|
-
"start": 2549
|
|
3381
|
-
},
|
|
3382
|
-
{
|
|
3383
|
-
"name": "[T; N]::for_eachi",
|
|
3384
|
-
"start": 2966
|
|
3385
|
-
},
|
|
3386
|
-
{
|
|
3387
|
-
"name": "[T; N]::fold",
|
|
3388
|
-
"start": 3832
|
|
3389
|
-
},
|
|
3390
|
-
{
|
|
3391
|
-
"name": "[T; N]::reduce",
|
|
3392
|
-
"start": 4349
|
|
3393
|
-
},
|
|
3394
|
-
{
|
|
3395
|
-
"name": "[T; N]::all",
|
|
3396
|
-
"start": 4858
|
|
3397
|
-
},
|
|
3398
|
-
{
|
|
3399
|
-
"name": "[T; N]::any",
|
|
3400
|
-
"start": 5330
|
|
3401
|
-
},
|
|
3402
|
-
{
|
|
3403
|
-
"name": "[T; N]::concat",
|
|
3404
|
-
"start": 5872
|
|
3405
|
-
},
|
|
3406
|
-
{
|
|
3407
|
-
"name": "[T; N]::sort",
|
|
3408
|
-
"start": 6768
|
|
3409
|
-
},
|
|
3410
|
-
{
|
|
3411
|
-
"name": "[T; N]::sort_via",
|
|
3412
|
-
"start": 7783
|
|
3413
|
-
},
|
|
3414
|
-
{
|
|
3415
|
-
"name": "[u8; N]::as_str_unchecked",
|
|
3416
|
-
"start": 8811
|
|
3417
|
-
},
|
|
3418
|
-
{
|
|
3419
|
-
"name": "<impl From<str<N>> for [u8; N]>::from",
|
|
3420
|
-
"start": 8938
|
|
3421
|
-
},
|
|
3422
|
-
{
|
|
3423
|
-
"name": "test::map_empty",
|
|
3424
|
-
"start": 9012
|
|
3425
|
-
},
|
|
3426
|
-
{
|
|
3427
|
-
"name": "test::sort_u32",
|
|
3428
|
-
"start": 10122
|
|
3429
|
-
},
|
|
3430
|
-
{
|
|
3431
|
-
"name": "test::test_sort",
|
|
3432
|
-
"start": 10177
|
|
3433
|
-
},
|
|
3434
|
-
{
|
|
3435
|
-
"name": "test::test_sort_100_values",
|
|
3436
|
-
"start": 10408
|
|
3437
|
-
},
|
|
3438
|
-
{
|
|
3439
|
-
"name": "test::test_sort_100_values_comptime",
|
|
3440
|
-
"start": 11576
|
|
3441
|
-
},
|
|
3442
|
-
{
|
|
3443
|
-
"name": "test::test_sort_via",
|
|
3444
|
-
"start": 11721
|
|
3445
|
-
},
|
|
3446
|
-
{
|
|
3447
|
-
"name": "test::test_sort_via_100_values",
|
|
3448
|
-
"start": 11968
|
|
3449
|
-
},
|
|
3450
|
-
{
|
|
3451
|
-
"name": "test::mapi_empty",
|
|
3452
|
-
"start": 13129
|
|
3453
|
-
},
|
|
3454
|
-
{
|
|
3455
|
-
"name": "test::for_each_empty",
|
|
3456
|
-
"start": 13224
|
|
3457
|
-
},
|
|
3458
|
-
{
|
|
3459
|
-
"name": "test::for_eachi_empty",
|
|
3460
|
-
"start": 13362
|
|
3461
|
-
},
|
|
3462
|
-
{
|
|
3463
|
-
"name": "test::map_example",
|
|
3464
|
-
"start": 13501
|
|
3465
|
-
},
|
|
3466
|
-
{
|
|
3467
|
-
"name": "test::mapi_example",
|
|
3468
|
-
"start": 13638
|
|
3469
|
-
},
|
|
3470
|
-
{
|
|
3471
|
-
"name": "test::for_each_example",
|
|
3472
|
-
"start": 13787
|
|
3473
|
-
},
|
|
3474
|
-
{
|
|
3475
|
-
"name": "test::for_eachi_example",
|
|
3476
|
-
"start": 14127
|
|
3477
|
-
},
|
|
3478
|
-
{
|
|
3479
|
-
"name": "test::concat",
|
|
3480
|
-
"start": 14338
|
|
3481
|
-
},
|
|
3482
|
-
{
|
|
3483
|
-
"name": "test::concat_zero_length_with_something",
|
|
3484
|
-
"start": 14597
|
|
3485
|
-
},
|
|
3486
|
-
{
|
|
3487
|
-
"name": "test::concat_something_with_zero_length",
|
|
3488
|
-
"start": 14800
|
|
3489
|
-
},
|
|
3490
|
-
{
|
|
3491
|
-
"name": "test::concat_zero_lengths",
|
|
3492
|
-
"start": 14989
|
|
3493
|
-
}
|
|
3494
|
-
],
|
|
3495
|
-
"path": "std/array/mod.nr",
|
|
3496
|
-
"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"
|
|
3497
|
-
},
|
|
3498
|
-
"307": {
|
|
3499
|
-
"function_locations": [
|
|
3500
|
-
{
|
|
3501
|
-
"name": "Poseidon2::hash",
|
|
3502
|
-
"start": 333
|
|
3503
|
-
},
|
|
3504
|
-
{
|
|
3505
|
-
"name": "Poseidon2::new",
|
|
3506
|
-
"start": 442
|
|
3507
|
-
},
|
|
3508
|
-
{
|
|
3509
|
-
"name": "Poseidon2::perform_duplex",
|
|
3510
|
-
"start": 649
|
|
3511
|
-
},
|
|
3512
|
-
{
|
|
3513
|
-
"name": "Poseidon2::absorb",
|
|
3514
|
-
"start": 926
|
|
3515
|
-
},
|
|
3516
|
-
{
|
|
3517
|
-
"name": "Poseidon2::squeeze",
|
|
3518
|
-
"start": 1456
|
|
3519
|
-
},
|
|
3520
|
-
{
|
|
3521
|
-
"name": "Poseidon2::hash_internal",
|
|
3522
|
-
"start": 1817
|
|
3523
|
-
},
|
|
3524
|
-
{
|
|
3525
|
-
"name": "<impl Hasher for Poseidon2Hasher>::finish",
|
|
3526
|
-
"start": 4117
|
|
3527
|
-
},
|
|
3528
|
-
{
|
|
3529
|
-
"name": "<impl Hasher for Poseidon2Hasher>::write",
|
|
3530
|
-
"start": 4438
|
|
3531
|
-
},
|
|
3532
|
-
{
|
|
3533
|
-
"name": "<impl Default for Poseidon2Hasher>::default",
|
|
3534
|
-
"start": 4561
|
|
3535
|
-
}
|
|
3536
|
-
],
|
|
3537
|
-
"path": "/home/aztec-dev/nargo/github.com/noir-lang/poseidon/v0.2.6/src/poseidon2.nr",
|
|
3538
|
-
"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"
|
|
3539
|
-
},
|
|
3540
|
-
"365": {
|
|
3541
|
-
"function_locations": [
|
|
3542
|
-
{
|
|
3543
|
-
"name": "<impl Empty for AztecAddress>::empty",
|
|
3544
|
-
"start": 939
|
|
3545
|
-
},
|
|
3546
|
-
{
|
|
3547
|
-
"name": "<impl ToField for AztecAddress>::to_field",
|
|
3548
|
-
"start": 1039
|
|
3549
|
-
},
|
|
3550
|
-
{
|
|
3551
|
-
"name": "<impl FromField for AztecAddress>::from_field",
|
|
3552
|
-
"start": 1151
|
|
3553
|
-
},
|
|
3554
|
-
{
|
|
3555
|
-
"name": "AztecAddress::zero",
|
|
3556
|
-
"start": 1246
|
|
3557
|
-
},
|
|
3558
|
-
{
|
|
3559
|
-
"name": "AztecAddress::is_valid",
|
|
3560
|
-
"start": 1576
|
|
3561
|
-
},
|
|
3562
|
-
{
|
|
3563
|
-
"name": "AztecAddress::to_address_point",
|
|
3564
|
-
"start": 1951
|
|
3565
|
-
},
|
|
3566
|
-
{
|
|
3567
|
-
"name": "AztecAddress::is_positive",
|
|
3568
|
-
"start": 2604
|
|
3569
|
-
},
|
|
3570
|
-
{
|
|
3571
|
-
"name": "AztecAddress::get_y",
|
|
3572
|
-
"start": 3460
|
|
3573
|
-
},
|
|
3574
|
-
{
|
|
3575
|
-
"name": "AztecAddress::compute",
|
|
3576
|
-
"start": 3846
|
|
3577
|
-
},
|
|
3578
|
-
{
|
|
3579
|
-
"name": "AztecAddress::compute_from_class_id",
|
|
3580
|
-
"start": 7868
|
|
3581
|
-
},
|
|
3582
|
-
{
|
|
3583
|
-
"name": "AztecAddress::is_zero",
|
|
3584
|
-
"start": 8140
|
|
3585
|
-
},
|
|
3586
|
-
{
|
|
3587
|
-
"name": "AztecAddress::assert_is_zero",
|
|
3588
|
-
"start": 8205
|
|
3589
|
-
},
|
|
3590
|
-
{
|
|
3591
|
-
"name": "check_max_field_value",
|
|
3592
|
-
"start": 8289
|
|
3593
|
-
},
|
|
3594
|
-
{
|
|
3595
|
-
"name": "check_is_positive",
|
|
3596
|
-
"start": 8400
|
|
3597
|
-
},
|
|
3598
|
-
{
|
|
3599
|
-
"name": "check_embedded_curve_point_add",
|
|
3600
|
-
"start": 8921
|
|
3601
|
-
},
|
|
3602
|
-
{
|
|
3603
|
-
"name": "check_embedded_curve_point_add_2",
|
|
3604
|
-
"start": 9338
|
|
3605
|
-
},
|
|
3606
|
-
{
|
|
3607
|
-
"name": "compute_address_from_partial_and_pub_keys",
|
|
3608
|
-
"start": 9567
|
|
3609
|
-
},
|
|
3610
|
-
{
|
|
3611
|
-
"name": "compute_preaddress_from_partial_and_pub_keys",
|
|
3612
|
-
"start": 11398
|
|
3613
|
-
},
|
|
3614
|
-
{
|
|
3615
|
-
"name": "from_field_to_field",
|
|
3616
|
-
"start": 11747
|
|
3617
|
-
},
|
|
3618
|
-
{
|
|
3619
|
-
"name": "serde",
|
|
3620
|
-
"start": 11884
|
|
3621
|
-
},
|
|
3622
|
-
{
|
|
3623
|
-
"name": "to_address_point_valid",
|
|
3624
|
-
"start": 12290
|
|
3625
|
-
},
|
|
3626
|
-
{
|
|
3627
|
-
"name": "to_address_point_invalid",
|
|
3628
|
-
"start": 12954
|
|
3629
|
-
}
|
|
3630
|
-
],
|
|
3631
|
-
"path": "/home/aztec-dev/aztec-packages/noir-projects/noir-protocol-circuits/crates/types/src/address/aztec_address.nr",
|
|
3632
|
-
"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"
|
|
3633
|
-
},
|
|
3634
|
-
"368": {
|
|
3635
|
-
"function_locations": [
|
|
3636
|
-
{
|
|
3637
|
-
"name": "<impl ToField for PartialAddress>::to_field",
|
|
3638
|
-
"start": 489
|
|
3639
|
-
},
|
|
3640
|
-
{
|
|
3641
|
-
"name": "<impl Empty for PartialAddress>::empty",
|
|
3642
|
-
"start": 574
|
|
3643
|
-
},
|
|
3644
|
-
{
|
|
3645
|
-
"name": "PartialAddress::from_field",
|
|
3646
|
-
"start": 677
|
|
3647
|
-
},
|
|
3648
|
-
{
|
|
3649
|
-
"name": "PartialAddress::compute",
|
|
3650
|
-
"start": 883
|
|
3651
|
-
},
|
|
3652
|
-
{
|
|
3653
|
-
"name": "PartialAddress::compute_from_salted_initialization_hash",
|
|
3654
|
-
"start": 1254
|
|
3655
|
-
},
|
|
3656
|
-
{
|
|
3657
|
-
"name": "PartialAddress::to_field",
|
|
3658
|
-
"start": 1496
|
|
3659
|
-
},
|
|
3660
|
-
{
|
|
3661
|
-
"name": "PartialAddress::is_zero",
|
|
3662
|
-
"start": 1557
|
|
3663
|
-
},
|
|
3664
|
-
{
|
|
3665
|
-
"name": "PartialAddress::assert_is_zero",
|
|
3666
|
-
"start": 1627
|
|
3667
|
-
},
|
|
3668
|
-
{
|
|
3669
|
-
"name": "test::serialization_of_partial_address",
|
|
3670
|
-
"start": 1835
|
|
3671
|
-
}
|
|
3672
|
-
],
|
|
3673
|
-
"path": "/home/aztec-dev/aztec-packages/noir-projects/noir-protocol-circuits/crates/types/src/address/partial_address.nr",
|
|
3674
|
-
"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"
|
|
3675
|
-
},
|
|
3676
|
-
"370": {
|
|
3677
|
-
"function_locations": [
|
|
3678
|
-
{
|
|
3679
|
-
"name": "<impl ToField for SaltedInitializationHash>::to_field",
|
|
3680
|
-
"start": 383
|
|
3312
|
+
"start": 24029
|
|
3681
3313
|
},
|
|
3682
3314
|
{
|
|
3683
|
-
"name": "
|
|
3684
|
-
"start":
|
|
3315
|
+
"name": "tests::from_be_bits",
|
|
3316
|
+
"start": 24574
|
|
3685
3317
|
},
|
|
3686
3318
|
{
|
|
3687
|
-
"name": "
|
|
3688
|
-
"start":
|
|
3319
|
+
"name": "tests::test_to_from_be_bits_bn254_edge_cases",
|
|
3320
|
+
"start": 24820
|
|
3689
3321
|
},
|
|
3690
3322
|
{
|
|
3691
|
-
"name": "
|
|
3692
|
-
"start":
|
|
3323
|
+
"name": "tests::test_to_from_le_bits_bn254_edge_cases",
|
|
3324
|
+
"start": 26734
|
|
3693
3325
|
}
|
|
3694
3326
|
],
|
|
3695
|
-
"path": "/
|
|
3696
|
-
"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"
|
|
3327
|
+
"path": "std/field/mod.nr",
|
|
3328
|
+
"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"
|
|
3697
3329
|
},
|
|
3698
|
-
"
|
|
3330
|
+
"171": {
|
|
3699
3331
|
"function_locations": [
|
|
3700
3332
|
{
|
|
3701
3333
|
"name": "DelayedPublicMutableValues<T, INITIAL_DELAY>::new",
|
|
@@ -3725,7 +3357,7 @@
|
|
|
3725
3357
|
"path": "/home/aztec-dev/aztec-packages/noir-projects/noir-protocol-circuits/crates/types/src/delayed_public_mutable/delayed_public_mutable_values.nr",
|
|
3726
3358
|
"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"
|
|
3727
3359
|
},
|
|
3728
|
-
"
|
|
3360
|
+
"174": {
|
|
3729
3361
|
"function_locations": [
|
|
3730
3362
|
{
|
|
3731
3363
|
"name": "ScheduledDelayChange<INITIAL_DELAY>::new",
|
|
@@ -3759,7 +3391,7 @@
|
|
|
3759
3391
|
"path": "/home/aztec-dev/aztec-packages/noir-projects/noir-protocol-circuits/crates/types/src/delayed_public_mutable/scheduled_delay_change.nr",
|
|
3760
3392
|
"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"
|
|
3761
3393
|
},
|
|
3762
|
-
"
|
|
3394
|
+
"176": {
|
|
3763
3395
|
"function_locations": [
|
|
3764
3396
|
{
|
|
3765
3397
|
"name": "ScheduledValueChange<T>::new",
|
|
@@ -3797,7 +3429,7 @@
|
|
|
3797
3429
|
"path": "/home/aztec-dev/aztec-packages/noir-projects/noir-protocol-circuits/crates/types/src/delayed_public_mutable/scheduled_value_change.nr",
|
|
3798
3430
|
"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"
|
|
3799
3431
|
},
|
|
3800
|
-
"
|
|
3432
|
+
"179": {
|
|
3801
3433
|
"function_locations": [
|
|
3802
3434
|
{
|
|
3803
3435
|
"name": "sha256_to_field",
|
|
@@ -3831,263 +3463,331 @@
|
|
|
3831
3463
|
"name": "create_protocol_nullifier",
|
|
3832
3464
|
"start": 6116
|
|
3833
3465
|
},
|
|
3466
|
+
{
|
|
3467
|
+
"name": "compute_log_tag",
|
|
3468
|
+
"start": 6480
|
|
3469
|
+
},
|
|
3834
3470
|
{
|
|
3835
3471
|
"name": "compute_siloed_private_log_first_field",
|
|
3836
|
-
"start":
|
|
3472
|
+
"start": 6651
|
|
3837
3473
|
},
|
|
3838
3474
|
{
|
|
3839
3475
|
"name": "compute_siloed_private_log",
|
|
3840
|
-
"start":
|
|
3476
|
+
"start": 6882
|
|
3841
3477
|
},
|
|
3842
3478
|
{
|
|
3843
3479
|
"name": "compute_contract_class_log_hash",
|
|
3844
|
-
"start":
|
|
3480
|
+
"start": 7142
|
|
3845
3481
|
},
|
|
3846
3482
|
{
|
|
3847
3483
|
"name": "compute_app_siloed_secret_key",
|
|
3848
|
-
"start":
|
|
3484
|
+
"start": 7333
|
|
3849
3485
|
},
|
|
3850
3486
|
{
|
|
3851
3487
|
"name": "compute_l2_to_l1_message_hash",
|
|
3852
|
-
"start":
|
|
3488
|
+
"start": 7628
|
|
3853
3489
|
},
|
|
3854
3490
|
{
|
|
3855
3491
|
"name": "accumulate_sha256",
|
|
3856
|
-
"start":
|
|
3492
|
+
"start": 8709
|
|
3857
3493
|
},
|
|
3858
3494
|
{
|
|
3859
3495
|
"name": "poseidon2_hash",
|
|
3860
|
-
"start":
|
|
3496
|
+
"start": 9037
|
|
3861
3497
|
},
|
|
3862
3498
|
{
|
|
3863
3499
|
"name": "poseidon2_hash_with_separator",
|
|
3864
|
-
"start":
|
|
3500
|
+
"start": 9228
|
|
3865
3501
|
},
|
|
3866
3502
|
{
|
|
3867
3503
|
"name": "poseidon2_hash_subarray",
|
|
3868
|
-
"start":
|
|
3504
|
+
"start": 9714
|
|
3869
3505
|
},
|
|
3870
3506
|
{
|
|
3871
3507
|
"name": "poseidon2_hash_with_separator_bounded_vec",
|
|
3872
|
-
"start":
|
|
3508
|
+
"start": 10126
|
|
3873
3509
|
},
|
|
3874
3510
|
{
|
|
3875
3511
|
"name": "poseidon2_hash_bytes",
|
|
3876
|
-
"start":
|
|
3512
|
+
"start": 10487
|
|
3877
3513
|
},
|
|
3878
3514
|
{
|
|
3879
3515
|
"name": "subarray_hash_matches_fixed",
|
|
3880
|
-
"start":
|
|
3516
|
+
"start": 11063
|
|
3881
3517
|
},
|
|
3882
3518
|
{
|
|
3883
3519
|
"name": "subarray_hash_matches_variable",
|
|
3884
|
-
"start":
|
|
3520
|
+
"start": 11462
|
|
3885
3521
|
},
|
|
3886
3522
|
{
|
|
3887
3523
|
"name": "smoke_sha256_to_field",
|
|
3888
|
-
"start":
|
|
3524
|
+
"start": 11878
|
|
3889
3525
|
},
|
|
3890
3526
|
{
|
|
3891
3527
|
"name": "unique_siloed_note_hash_matches_typescript",
|
|
3892
|
-
"start":
|
|
3528
|
+
"start": 13280
|
|
3893
3529
|
},
|
|
3894
3530
|
{
|
|
3895
3531
|
"name": "siloed_nullifier_matches_typescript",
|
|
3896
|
-
"start":
|
|
3532
|
+
"start": 14502
|
|
3897
3533
|
},
|
|
3898
3534
|
{
|
|
3899
3535
|
"name": "siloed_private_log_first_field_matches_typescript",
|
|
3900
|
-
"start":
|
|
3536
|
+
"start": 14882
|
|
3901
3537
|
},
|
|
3902
3538
|
{
|
|
3903
3539
|
"name": "empty_l2_to_l1_message_hash_matches_typescript",
|
|
3904
|
-
"start":
|
|
3540
|
+
"start": 15292
|
|
3905
3541
|
},
|
|
3906
3542
|
{
|
|
3907
3543
|
"name": "l2_to_l1_message_hash_matches_typescript",
|
|
3908
|
-
"start":
|
|
3544
|
+
"start": 15743
|
|
3909
3545
|
},
|
|
3910
3546
|
{
|
|
3911
3547
|
"name": "poseidon2_hash_with_separator_bounded_vec_matches_non_bounded_vec_version",
|
|
3912
|
-
"start":
|
|
3548
|
+
"start": 16359
|
|
3913
3549
|
}
|
|
3914
3550
|
],
|
|
3915
3551
|
"path": "/home/aztec-dev/aztec-packages/noir-projects/noir-protocol-circuits/crates/types/src/hash.nr",
|
|
3916
|
-
"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"
|
|
3552
|
+
"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_log_tag(raw_tag: Field, dom_sep: u32) -> Field {\n poseidon2_hash_with_separator([raw_tag], dom_sep)\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"
|
|
3917
3553
|
},
|
|
3918
|
-
"
|
|
3554
|
+
"18": {
|
|
3919
3555
|
"function_locations": [
|
|
3920
3556
|
{
|
|
3921
|
-
"name": "
|
|
3922
|
-
"start":
|
|
3557
|
+
"name": "sha256_compression",
|
|
3558
|
+
"start": 572
|
|
3923
3559
|
},
|
|
3924
3560
|
{
|
|
3925
|
-
"name": "
|
|
3926
|
-
"start":
|
|
3561
|
+
"name": "keccakf1600",
|
|
3562
|
+
"start": 707
|
|
3927
3563
|
},
|
|
3928
3564
|
{
|
|
3929
|
-
"name": "
|
|
3930
|
-
"start":
|
|
3565
|
+
"name": "keccak::keccakf1600",
|
|
3566
|
+
"start": 882
|
|
3931
3567
|
},
|
|
3932
3568
|
{
|
|
3933
|
-
"name": "
|
|
3934
|
-
"start":
|
|
3569
|
+
"name": "blake2s",
|
|
3570
|
+
"start": 1044
|
|
3935
3571
|
},
|
|
3936
3572
|
{
|
|
3937
|
-
"name": "
|
|
3938
|
-
"start":
|
|
3573
|
+
"name": "blake3",
|
|
3574
|
+
"start": 1142
|
|
3939
3575
|
},
|
|
3940
3576
|
{
|
|
3941
|
-
"name": "
|
|
3942
|
-
"start":
|
|
3577
|
+
"name": "__blake3",
|
|
3578
|
+
"start": 1629
|
|
3943
3579
|
},
|
|
3944
3580
|
{
|
|
3945
|
-
"name": "
|
|
3946
|
-
"start":
|
|
3581
|
+
"name": "pedersen_commitment",
|
|
3582
|
+
"start": 1747
|
|
3947
3583
|
},
|
|
3948
3584
|
{
|
|
3949
|
-
"name": "
|
|
3950
|
-
"start":
|
|
3585
|
+
"name": "pedersen_commitment_with_separator",
|
|
3586
|
+
"start": 1976
|
|
3951
3587
|
},
|
|
3952
3588
|
{
|
|
3953
|
-
"name": "
|
|
3954
|
-
"start":
|
|
3589
|
+
"name": "pedersen_hash",
|
|
3590
|
+
"start": 2460
|
|
3955
3591
|
},
|
|
3956
3592
|
{
|
|
3957
|
-
"name": "
|
|
3958
|
-
"start":
|
|
3593
|
+
"name": "pedersen_hash_with_separator",
|
|
3594
|
+
"start": 2617
|
|
3959
3595
|
},
|
|
3960
3596
|
{
|
|
3961
|
-
"name": "
|
|
3962
|
-
"start":
|
|
3597
|
+
"name": "derive_generators",
|
|
3598
|
+
"start": 3591
|
|
3963
3599
|
},
|
|
3964
3600
|
{
|
|
3965
|
-
"name": "
|
|
3966
|
-
"start":
|
|
3601
|
+
"name": "__derive_generators",
|
|
3602
|
+
"start": 3950
|
|
3967
3603
|
},
|
|
3968
3604
|
{
|
|
3969
|
-
"name": "
|
|
3970
|
-
"start":
|
|
3605
|
+
"name": "from_field_unsafe",
|
|
3606
|
+
"start": 4265
|
|
3971
3607
|
},
|
|
3972
3608
|
{
|
|
3973
|
-
"name": "
|
|
3974
|
-
"start":
|
|
3609
|
+
"name": "poseidon2_permutation",
|
|
3610
|
+
"start": 4922
|
|
3975
3611
|
},
|
|
3976
3612
|
{
|
|
3977
|
-
"name": "
|
|
3978
|
-
"start":
|
|
3613
|
+
"name": "poseidon2_permutation_internal",
|
|
3614
|
+
"start": 5318
|
|
3979
3615
|
},
|
|
3980
3616
|
{
|
|
3981
|
-
"name": "
|
|
3982
|
-
"start":
|
|
3617
|
+
"name": "poseidon2_config_state_size",
|
|
3618
|
+
"start": 5411
|
|
3983
3619
|
},
|
|
3984
3620
|
{
|
|
3985
|
-
"name": "
|
|
3986
|
-
"start":
|
|
3987
|
-
}
|
|
3988
|
-
],
|
|
3989
|
-
"path": "/home/aztec-dev/aztec-packages/noir-projects/noir-protocol-circuits/crates/types/src/logging.nr",
|
|
3990
|
-
"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"
|
|
3991
|
-
},
|
|
3992
|
-
"41": {
|
|
3993
|
-
"function_locations": [
|
|
3621
|
+
"name": "derive_hash",
|
|
3622
|
+
"start": 5722
|
|
3623
|
+
},
|
|
3994
3624
|
{
|
|
3995
|
-
"name": "
|
|
3996
|
-
"start":
|
|
3625
|
+
"name": "<impl BuildHasher for BuildHasherDefault<H>>::build_hasher",
|
|
3626
|
+
"start": 6693
|
|
3997
3627
|
},
|
|
3998
3628
|
{
|
|
3999
|
-
"name": "
|
|
4000
|
-
"start":
|
|
3629
|
+
"name": "<impl Default for BuildHasherDefault<H>>::default",
|
|
3630
|
+
"start": 6825
|
|
4001
3631
|
},
|
|
4002
3632
|
{
|
|
4003
|
-
"name": "
|
|
4004
|
-
"start":
|
|
3633
|
+
"name": "<impl Hash for Field>::hash",
|
|
3634
|
+
"start": 6957
|
|
4005
3635
|
},
|
|
4006
3636
|
{
|
|
4007
|
-
"name": "
|
|
4008
|
-
"start":
|
|
3637
|
+
"name": "<impl Hash for u1>::hash",
|
|
3638
|
+
"start": 7087
|
|
4009
3639
|
},
|
|
4010
3640
|
{
|
|
4011
|
-
"name": "
|
|
4012
|
-
"start":
|
|
3641
|
+
"name": "<impl Hash for u8>::hash",
|
|
3642
|
+
"start": 7226
|
|
4013
3643
|
},
|
|
4014
3644
|
{
|
|
4015
|
-
"name": "
|
|
4016
|
-
"start":
|
|
3645
|
+
"name": "<impl Hash for u16>::hash",
|
|
3646
|
+
"start": 7366
|
|
4017
3647
|
},
|
|
4018
3648
|
{
|
|
4019
|
-
"name": "
|
|
4020
|
-
"start":
|
|
3649
|
+
"name": "<impl Hash for u32>::hash",
|
|
3650
|
+
"start": 7506
|
|
4021
3651
|
},
|
|
4022
3652
|
{
|
|
4023
|
-
"name": "
|
|
4024
|
-
"start":
|
|
3653
|
+
"name": "<impl Hash for u64>::hash",
|
|
3654
|
+
"start": 7646
|
|
4025
3655
|
},
|
|
4026
3656
|
{
|
|
4027
|
-
"name": "
|
|
4028
|
-
"start":
|
|
3657
|
+
"name": "<impl Hash for u128>::hash",
|
|
3658
|
+
"start": 7787
|
|
4029
3659
|
},
|
|
4030
3660
|
{
|
|
4031
|
-
"name": "
|
|
4032
|
-
"start":
|
|
3661
|
+
"name": "<impl Hash for i8>::hash",
|
|
3662
|
+
"start": 7926
|
|
4033
3663
|
},
|
|
4034
3664
|
{
|
|
4035
|
-
"name": "
|
|
4036
|
-
"start":
|
|
3665
|
+
"name": "<impl Hash for i16>::hash",
|
|
3666
|
+
"start": 8072
|
|
4037
3667
|
},
|
|
4038
3668
|
{
|
|
4039
|
-
"name": "
|
|
4040
|
-
"start":
|
|
3669
|
+
"name": "<impl Hash for i32>::hash",
|
|
3670
|
+
"start": 8219
|
|
4041
3671
|
},
|
|
4042
3672
|
{
|
|
4043
|
-
"name": "
|
|
4044
|
-
"start":
|
|
3673
|
+
"name": "<impl Hash for i64>::hash",
|
|
3674
|
+
"start": 8366
|
|
4045
3675
|
},
|
|
4046
3676
|
{
|
|
4047
|
-
"name": "
|
|
4048
|
-
"start":
|
|
3677
|
+
"name": "<impl Hash for bool>::hash",
|
|
3678
|
+
"start": 8514
|
|
4049
3679
|
},
|
|
4050
3680
|
{
|
|
4051
|
-
"name": "
|
|
4052
|
-
"start":
|
|
3681
|
+
"name": "<impl Hash for ()>::hash",
|
|
3682
|
+
"start": 8661
|
|
4053
3683
|
},
|
|
4054
3684
|
{
|
|
4055
|
-
"name": "
|
|
4056
|
-
"start":
|
|
3685
|
+
"name": "<impl Hash for [T; N]>::hash",
|
|
3686
|
+
"start": 8793
|
|
4057
3687
|
},
|
|
4058
3688
|
{
|
|
4059
|
-
"name": "
|
|
4060
|
-
"start":
|
|
3689
|
+
"name": "<impl Hash for [T]>::hash",
|
|
3690
|
+
"start": 8982
|
|
4061
3691
|
},
|
|
4062
3692
|
{
|
|
4063
|
-
"name": "
|
|
4064
|
-
"start":
|
|
3693
|
+
"name": "<impl Hash for (A, B)>::hash",
|
|
3694
|
+
"start": 9222
|
|
4065
3695
|
},
|
|
4066
3696
|
{
|
|
4067
|
-
"name": "
|
|
4068
|
-
"start":
|
|
3697
|
+
"name": "<impl Hash for (A, B, C)>::hash",
|
|
3698
|
+
"start": 9438
|
|
4069
3699
|
},
|
|
4070
3700
|
{
|
|
4071
|
-
"name": "<impl
|
|
4072
|
-
"start":
|
|
3701
|
+
"name": "<impl Hash for (A, B, C, D)>::hash",
|
|
3702
|
+
"start": 9701
|
|
4073
3703
|
},
|
|
4074
3704
|
{
|
|
4075
|
-
"name": "<impl
|
|
4076
|
-
"start":
|
|
3705
|
+
"name": "<impl Hash for (A, B, C, D, E)>::hash",
|
|
3706
|
+
"start": 10011
|
|
4077
3707
|
},
|
|
4078
3708
|
{
|
|
4079
|
-
"name": "
|
|
4080
|
-
"start":
|
|
3709
|
+
"name": "assert_pedersen",
|
|
3710
|
+
"start": 10407
|
|
3711
|
+
}
|
|
3712
|
+
],
|
|
3713
|
+
"path": "std/hash/mod.nr",
|
|
3714
|
+
"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)[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"
|
|
3715
|
+
},
|
|
3716
|
+
"181": {
|
|
3717
|
+
"function_locations": [
|
|
3718
|
+
{
|
|
3719
|
+
"name": "fatal_log",
|
|
3720
|
+
"start": 395
|
|
4081
3721
|
},
|
|
4082
3722
|
{
|
|
4083
|
-
"name": "
|
|
4084
|
-
"start":
|
|
3723
|
+
"name": "error_log",
|
|
3724
|
+
"start": 473
|
|
3725
|
+
},
|
|
3726
|
+
{
|
|
3727
|
+
"name": "warn_log",
|
|
3728
|
+
"start": 550
|
|
3729
|
+
},
|
|
3730
|
+
{
|
|
3731
|
+
"name": "info_log",
|
|
3732
|
+
"start": 626
|
|
3733
|
+
},
|
|
3734
|
+
{
|
|
3735
|
+
"name": "verbose_log",
|
|
3736
|
+
"start": 705
|
|
3737
|
+
},
|
|
3738
|
+
{
|
|
3739
|
+
"name": "debug_log",
|
|
3740
|
+
"start": 785
|
|
3741
|
+
},
|
|
3742
|
+
{
|
|
3743
|
+
"name": "trace_log",
|
|
3744
|
+
"start": 863
|
|
3745
|
+
},
|
|
3746
|
+
{
|
|
3747
|
+
"name": "fatal_log_format",
|
|
3748
|
+
"start": 1033
|
|
3749
|
+
},
|
|
3750
|
+
{
|
|
3751
|
+
"name": "error_log_format",
|
|
3752
|
+
"start": 1161
|
|
3753
|
+
},
|
|
3754
|
+
{
|
|
3755
|
+
"name": "warn_log_format",
|
|
3756
|
+
"start": 1288
|
|
3757
|
+
},
|
|
3758
|
+
{
|
|
3759
|
+
"name": "info_log_format",
|
|
3760
|
+
"start": 1414
|
|
3761
|
+
},
|
|
3762
|
+
{
|
|
3763
|
+
"name": "verbose_log_format",
|
|
3764
|
+
"start": 1543
|
|
3765
|
+
},
|
|
3766
|
+
{
|
|
3767
|
+
"name": "debug_log_format",
|
|
3768
|
+
"start": 1673
|
|
3769
|
+
},
|
|
3770
|
+
{
|
|
3771
|
+
"name": "trace_log_format",
|
|
3772
|
+
"start": 1801
|
|
3773
|
+
},
|
|
3774
|
+
{
|
|
3775
|
+
"name": "log_format",
|
|
3776
|
+
"start": 1934
|
|
3777
|
+
},
|
|
3778
|
+
{
|
|
3779
|
+
"name": "log_oracle_wrapper",
|
|
3780
|
+
"start": 2248
|
|
3781
|
+
},
|
|
3782
|
+
{
|
|
3783
|
+
"name": "log_oracle",
|
|
3784
|
+
"start": 2801
|
|
4085
3785
|
}
|
|
4086
3786
|
],
|
|
4087
|
-
"path": "
|
|
4088
|
-
"source": "
|
|
3787
|
+
"path": "/home/aztec-dev/aztec-packages/noir-projects/noir-protocol-circuits/crates/types/src/logging.nr",
|
|
3788
|
+
"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// While the length parameter might seem unnecessary given that we have N, we keep it around because at the AVM\n// bytecode level we want to support non-comptime-known lengths for such opcodes, even if Noir code will not generally\n// take that route. The AVM transpiler maps this oracle to the DEBUGLOG opcode, which reads the fields size from memory.\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"
|
|
4089
3789
|
},
|
|
4090
|
-
"
|
|
3790
|
+
"199": {
|
|
4091
3791
|
"function_locations": [
|
|
4092
3792
|
{
|
|
4093
3793
|
"name": "<impl Hash for Point>::hash",
|
|
@@ -4133,17 +3833,7 @@
|
|
|
4133
3833
|
"path": "/home/aztec-dev/aztec-packages/noir-projects/noir-protocol-circuits/crates/types/src/point.nr",
|
|
4134
3834
|
"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"
|
|
4135
3835
|
},
|
|
4136
|
-
"
|
|
4137
|
-
"function_locations": [
|
|
4138
|
-
{
|
|
4139
|
-
"name": "panic",
|
|
4140
|
-
"start": 61
|
|
4141
|
-
}
|
|
4142
|
-
],
|
|
4143
|
-
"path": "std/panic.nr",
|
|
4144
|
-
"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"
|
|
4145
|
-
},
|
|
4146
|
-
"424": {
|
|
3836
|
+
"207": {
|
|
4147
3837
|
"function_locations": [
|
|
4148
3838
|
{
|
|
4149
3839
|
"name": "<impl ToPoint for NpkM>::to_point",
|
|
@@ -4201,7 +3891,7 @@
|
|
|
4201
3891
|
"path": "/home/aztec-dev/aztec-packages/noir-projects/noir-protocol-circuits/crates/types/src/public_keys.nr",
|
|
4202
3892
|
"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"
|
|
4203
3893
|
},
|
|
4204
|
-
"
|
|
3894
|
+
"212": {
|
|
4205
3895
|
"function_locations": [
|
|
4206
3896
|
{
|
|
4207
3897
|
"name": "derive_storage_slot_in_map",
|
|
@@ -4215,7 +3905,7 @@
|
|
|
4215
3905
|
"path": "/home/aztec-dev/aztec-packages/noir-projects/noir-protocol-circuits/crates/types/src/storage/map.nr",
|
|
4216
3906
|
"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"
|
|
4217
3907
|
},
|
|
4218
|
-
"
|
|
3908
|
+
"220": {
|
|
4219
3909
|
"function_locations": [
|
|
4220
3910
|
{
|
|
4221
3911
|
"name": "<impl Packable for bool>::pack",
|
|
@@ -4337,7 +4027,49 @@
|
|
|
4337
4027
|
"path": "/home/aztec-dev/aztec-packages/noir-projects/noir-protocol-circuits/crates/types/src/type_packing.nr",
|
|
4338
4028
|
"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"
|
|
4339
4029
|
},
|
|
4340
|
-
"
|
|
4030
|
+
"239": {
|
|
4031
|
+
"function_locations": [
|
|
4032
|
+
{
|
|
4033
|
+
"name": "Poseidon2::hash",
|
|
4034
|
+
"start": 333
|
|
4035
|
+
},
|
|
4036
|
+
{
|
|
4037
|
+
"name": "Poseidon2::new",
|
|
4038
|
+
"start": 442
|
|
4039
|
+
},
|
|
4040
|
+
{
|
|
4041
|
+
"name": "Poseidon2::perform_duplex",
|
|
4042
|
+
"start": 649
|
|
4043
|
+
},
|
|
4044
|
+
{
|
|
4045
|
+
"name": "Poseidon2::absorb",
|
|
4046
|
+
"start": 926
|
|
4047
|
+
},
|
|
4048
|
+
{
|
|
4049
|
+
"name": "Poseidon2::squeeze",
|
|
4050
|
+
"start": 1456
|
|
4051
|
+
},
|
|
4052
|
+
{
|
|
4053
|
+
"name": "Poseidon2::hash_internal",
|
|
4054
|
+
"start": 1817
|
|
4055
|
+
},
|
|
4056
|
+
{
|
|
4057
|
+
"name": "<impl Hasher for Poseidon2Hasher>::finish",
|
|
4058
|
+
"start": 4117
|
|
4059
|
+
},
|
|
4060
|
+
{
|
|
4061
|
+
"name": "<impl Hasher for Poseidon2Hasher>::write",
|
|
4062
|
+
"start": 4438
|
|
4063
|
+
},
|
|
4064
|
+
{
|
|
4065
|
+
"name": "<impl Default for Poseidon2Hasher>::default",
|
|
4066
|
+
"start": 4561
|
|
4067
|
+
}
|
|
4068
|
+
],
|
|
4069
|
+
"path": "/home/aztec-dev/nargo/github.com/noir-lang/poseidon/v0.2.6/src/poseidon2.nr",
|
|
4070
|
+
"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"
|
|
4071
|
+
},
|
|
4072
|
+
"242": {
|
|
4341
4073
|
"function_locations": [
|
|
4342
4074
|
{
|
|
4343
4075
|
"name": "Reader<N>::new",
|
|
@@ -4387,7 +4119,7 @@
|
|
|
4387
4119
|
"path": "/home/aztec-dev/aztec-packages/noir-projects/noir-protocol-circuits/crates/serde/src/reader.nr",
|
|
4388
4120
|
"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"
|
|
4389
4121
|
},
|
|
4390
|
-
"
|
|
4122
|
+
"243": {
|
|
4391
4123
|
"function_locations": [
|
|
4392
4124
|
{
|
|
4393
4125
|
"name": "derive_serialize",
|
|
@@ -4413,7 +4145,7 @@
|
|
|
4413
4145
|
"path": "/home/aztec-dev/aztec-packages/noir-projects/noir-protocol-circuits/crates/serde/src/serialization.nr",
|
|
4414
4146
|
"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"
|
|
4415
4147
|
},
|
|
4416
|
-
"
|
|
4148
|
+
"245": {
|
|
4417
4149
|
"function_locations": [
|
|
4418
4150
|
{
|
|
4419
4151
|
"name": "<impl Serialize for bool>::serialize",
|
|
@@ -4743,271 +4475,521 @@
|
|
|
4743
4475
|
"path": "/home/aztec-dev/aztec-packages/noir-projects/noir-protocol-circuits/crates/serde/src/type_impls.nr",
|
|
4744
4476
|
"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"
|
|
4745
4477
|
},
|
|
4478
|
+
"3": {
|
|
4479
|
+
"function_locations": [
|
|
4480
|
+
{
|
|
4481
|
+
"name": "[T; N]::len",
|
|
4482
|
+
"start": 480
|
|
4483
|
+
},
|
|
4484
|
+
{
|
|
4485
|
+
"name": "[T; N]::as_vector",
|
|
4486
|
+
"start": 735
|
|
4487
|
+
},
|
|
4488
|
+
{
|
|
4489
|
+
"name": "[T; N]::as_slice",
|
|
4490
|
+
"start": 1112
|
|
4491
|
+
},
|
|
4492
|
+
{
|
|
4493
|
+
"name": "[T; N]::map",
|
|
4494
|
+
"start": 1442
|
|
4495
|
+
},
|
|
4496
|
+
{
|
|
4497
|
+
"name": "[T; N]::mapi",
|
|
4498
|
+
"start": 2002
|
|
4499
|
+
},
|
|
4500
|
+
{
|
|
4501
|
+
"name": "[T; N]::for_each",
|
|
4502
|
+
"start": 2549
|
|
4503
|
+
},
|
|
4504
|
+
{
|
|
4505
|
+
"name": "[T; N]::for_eachi",
|
|
4506
|
+
"start": 2966
|
|
4507
|
+
},
|
|
4508
|
+
{
|
|
4509
|
+
"name": "[T; N]::fold",
|
|
4510
|
+
"start": 3832
|
|
4511
|
+
},
|
|
4512
|
+
{
|
|
4513
|
+
"name": "[T; N]::reduce",
|
|
4514
|
+
"start": 4349
|
|
4515
|
+
},
|
|
4516
|
+
{
|
|
4517
|
+
"name": "[T; N]::all",
|
|
4518
|
+
"start": 4858
|
|
4519
|
+
},
|
|
4520
|
+
{
|
|
4521
|
+
"name": "[T; N]::any",
|
|
4522
|
+
"start": 5330
|
|
4523
|
+
},
|
|
4524
|
+
{
|
|
4525
|
+
"name": "[T; N]::concat",
|
|
4526
|
+
"start": 5872
|
|
4527
|
+
},
|
|
4528
|
+
{
|
|
4529
|
+
"name": "[T; N]::sort",
|
|
4530
|
+
"start": 6768
|
|
4531
|
+
},
|
|
4532
|
+
{
|
|
4533
|
+
"name": "[T; N]::sort_via",
|
|
4534
|
+
"start": 7783
|
|
4535
|
+
},
|
|
4536
|
+
{
|
|
4537
|
+
"name": "[u8; N]::as_str_unchecked",
|
|
4538
|
+
"start": 8811
|
|
4539
|
+
},
|
|
4540
|
+
{
|
|
4541
|
+
"name": "<impl From<str<N>> for [u8; N]>::from",
|
|
4542
|
+
"start": 8938
|
|
4543
|
+
},
|
|
4544
|
+
{
|
|
4545
|
+
"name": "test::map_empty",
|
|
4546
|
+
"start": 9012
|
|
4547
|
+
},
|
|
4548
|
+
{
|
|
4549
|
+
"name": "test::sort_u32",
|
|
4550
|
+
"start": 10122
|
|
4551
|
+
},
|
|
4552
|
+
{
|
|
4553
|
+
"name": "test::test_sort",
|
|
4554
|
+
"start": 10177
|
|
4555
|
+
},
|
|
4556
|
+
{
|
|
4557
|
+
"name": "test::test_sort_100_values",
|
|
4558
|
+
"start": 10408
|
|
4559
|
+
},
|
|
4560
|
+
{
|
|
4561
|
+
"name": "test::test_sort_100_values_comptime",
|
|
4562
|
+
"start": 11576
|
|
4563
|
+
},
|
|
4564
|
+
{
|
|
4565
|
+
"name": "test::test_sort_via",
|
|
4566
|
+
"start": 11721
|
|
4567
|
+
},
|
|
4568
|
+
{
|
|
4569
|
+
"name": "test::test_sort_via_100_values",
|
|
4570
|
+
"start": 11968
|
|
4571
|
+
},
|
|
4572
|
+
{
|
|
4573
|
+
"name": "test::mapi_empty",
|
|
4574
|
+
"start": 13129
|
|
4575
|
+
},
|
|
4576
|
+
{
|
|
4577
|
+
"name": "test::for_each_empty",
|
|
4578
|
+
"start": 13224
|
|
4579
|
+
},
|
|
4580
|
+
{
|
|
4581
|
+
"name": "test::for_eachi_empty",
|
|
4582
|
+
"start": 13362
|
|
4583
|
+
},
|
|
4584
|
+
{
|
|
4585
|
+
"name": "test::map_example",
|
|
4586
|
+
"start": 13501
|
|
4587
|
+
},
|
|
4588
|
+
{
|
|
4589
|
+
"name": "test::mapi_example",
|
|
4590
|
+
"start": 13638
|
|
4591
|
+
},
|
|
4592
|
+
{
|
|
4593
|
+
"name": "test::for_each_example",
|
|
4594
|
+
"start": 13787
|
|
4595
|
+
},
|
|
4596
|
+
{
|
|
4597
|
+
"name": "test::for_eachi_example",
|
|
4598
|
+
"start": 14127
|
|
4599
|
+
},
|
|
4600
|
+
{
|
|
4601
|
+
"name": "test::concat",
|
|
4602
|
+
"start": 14338
|
|
4603
|
+
},
|
|
4604
|
+
{
|
|
4605
|
+
"name": "test::concat_zero_length_with_something",
|
|
4606
|
+
"start": 14597
|
|
4607
|
+
},
|
|
4608
|
+
{
|
|
4609
|
+
"name": "test::concat_something_with_zero_length",
|
|
4610
|
+
"start": 14800
|
|
4611
|
+
},
|
|
4612
|
+
{
|
|
4613
|
+
"name": "test::concat_zero_lengths",
|
|
4614
|
+
"start": 14989
|
|
4615
|
+
}
|
|
4616
|
+
],
|
|
4617
|
+
"path": "std/array/mod.nr",
|
|
4618
|
+
"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"
|
|
4619
|
+
},
|
|
4620
|
+
"41": {
|
|
4621
|
+
"function_locations": [
|
|
4622
|
+
{
|
|
4623
|
+
"name": "Option<T>::none",
|
|
4624
|
+
"start": 389
|
|
4625
|
+
},
|
|
4626
|
+
{
|
|
4627
|
+
"name": "Option<T>::some",
|
|
4628
|
+
"start": 553
|
|
4629
|
+
},
|
|
4630
|
+
{
|
|
4631
|
+
"name": "Option<T>::is_none",
|
|
4632
|
+
"start": 671
|
|
4633
|
+
},
|
|
4634
|
+
{
|
|
4635
|
+
"name": "Option<T>::is_some",
|
|
4636
|
+
"start": 772
|
|
4637
|
+
},
|
|
4638
|
+
{
|
|
4639
|
+
"name": "Option<T>::unwrap",
|
|
4640
|
+
"start": 896
|
|
4641
|
+
},
|
|
4642
|
+
{
|
|
4643
|
+
"name": "Option<T>::unwrap_unchecked",
|
|
4644
|
+
"start": 1194
|
|
4645
|
+
},
|
|
4646
|
+
{
|
|
4647
|
+
"name": "Option<T>::unwrap_or",
|
|
4648
|
+
"start": 1366
|
|
4649
|
+
},
|
|
4650
|
+
{
|
|
4651
|
+
"name": "Option<T>::unwrap_or_else",
|
|
4652
|
+
"start": 1666
|
|
4653
|
+
},
|
|
4654
|
+
{
|
|
4655
|
+
"name": "Option<T>::expect",
|
|
4656
|
+
"start": 1967
|
|
4657
|
+
},
|
|
4658
|
+
{
|
|
4659
|
+
"name": "Option<T>::map",
|
|
4660
|
+
"start": 2188
|
|
4661
|
+
},
|
|
4662
|
+
{
|
|
4663
|
+
"name": "Option<T>::map_or",
|
|
4664
|
+
"start": 2488
|
|
4665
|
+
},
|
|
4666
|
+
{
|
|
4667
|
+
"name": "Option<T>::map_or_else",
|
|
4668
|
+
"start": 2782
|
|
4669
|
+
},
|
|
4670
|
+
{
|
|
4671
|
+
"name": "Option<T>::and",
|
|
4672
|
+
"start": 3007
|
|
4673
|
+
},
|
|
4674
|
+
{
|
|
4675
|
+
"name": "Option<T>::and_then",
|
|
4676
|
+
"start": 3444
|
|
4677
|
+
},
|
|
4678
|
+
{
|
|
4679
|
+
"name": "Option<T>::or",
|
|
4680
|
+
"start": 3667
|
|
4681
|
+
},
|
|
4682
|
+
{
|
|
4683
|
+
"name": "Option<T>::or_else",
|
|
4684
|
+
"start": 3900
|
|
4685
|
+
},
|
|
4686
|
+
{
|
|
4687
|
+
"name": "Option<T>::xor",
|
|
4688
|
+
"start": 4190
|
|
4689
|
+
},
|
|
4690
|
+
{
|
|
4691
|
+
"name": "Option<T>::filter",
|
|
4692
|
+
"start": 4634
|
|
4693
|
+
},
|
|
4694
|
+
{
|
|
4695
|
+
"name": "Option<T>::flatten",
|
|
4696
|
+
"start": 5063
|
|
4697
|
+
},
|
|
4698
|
+
{
|
|
4699
|
+
"name": "<impl Default for Option<T>>::default",
|
|
4700
|
+
"start": 5240
|
|
4701
|
+
},
|
|
4702
|
+
{
|
|
4703
|
+
"name": "<impl Eq for Option<T>>::eq",
|
|
4704
|
+
"start": 5355
|
|
4705
|
+
},
|
|
4706
|
+
{
|
|
4707
|
+
"name": "<impl Hash for Option<T>>::hash",
|
|
4708
|
+
"start": 5704
|
|
4709
|
+
},
|
|
4710
|
+
{
|
|
4711
|
+
"name": "<impl Ord for Option<T>>::cmp",
|
|
4712
|
+
"start": 5973
|
|
4713
|
+
}
|
|
4714
|
+
],
|
|
4715
|
+
"path": "std/option.nr",
|
|
4716
|
+
"source": "use crate::cmp::{Eq, Ord, Ordering};\nuse crate::default::Default;\nuse crate::hash::{Hash, Hasher};\n\n/// Represents a value of type T or its absence.\n/// Use `Option::some(value)` to construct a value or `Option::none()` to record the absence of one.\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"
|
|
4717
|
+
},
|
|
4718
|
+
"42": {
|
|
4719
|
+
"function_locations": [
|
|
4720
|
+
{
|
|
4721
|
+
"name": "panic",
|
|
4722
|
+
"start": 196
|
|
4723
|
+
}
|
|
4724
|
+
],
|
|
4725
|
+
"path": "std/panic.nr",
|
|
4726
|
+
"source": "/// Halt the program at runtime with the given error message.\n///\n/// The provided error message must be either a `str` or a `fmtstr`.\npub 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"
|
|
4727
|
+
},
|
|
4746
4728
|
"5": {
|
|
4747
4729
|
"function_locations": [
|
|
4748
4730
|
{
|
|
4749
4731
|
"name": "derive_eq",
|
|
4750
|
-
"start":
|
|
4732
|
+
"start": 305
|
|
4751
4733
|
},
|
|
4752
4734
|
{
|
|
4753
4735
|
"name": "<impl Eq for Field>::eq",
|
|
4754
|
-
"start":
|
|
4736
|
+
"start": 851
|
|
4755
4737
|
},
|
|
4756
4738
|
{
|
|
4757
4739
|
"name": "<impl Eq for u128>::eq",
|
|
4758
|
-
"start":
|
|
4740
|
+
"start": 940
|
|
4759
4741
|
},
|
|
4760
4742
|
{
|
|
4761
4743
|
"name": "<impl Eq for u64>::eq",
|
|
4762
|
-
"start":
|
|
4744
|
+
"start": 1026
|
|
4763
4745
|
},
|
|
4764
4746
|
{
|
|
4765
4747
|
"name": "<impl Eq for u32>::eq",
|
|
4766
|
-
"start":
|
|
4748
|
+
"start": 1112
|
|
4767
4749
|
},
|
|
4768
4750
|
{
|
|
4769
4751
|
"name": "<impl Eq for u16>::eq",
|
|
4770
|
-
"start":
|
|
4752
|
+
"start": 1198
|
|
4771
4753
|
},
|
|
4772
4754
|
{
|
|
4773
4755
|
"name": "<impl Eq for u8>::eq",
|
|
4774
|
-
"start":
|
|
4756
|
+
"start": 1282
|
|
4775
4757
|
},
|
|
4776
4758
|
{
|
|
4777
4759
|
"name": "<impl Eq for u1>::eq",
|
|
4778
|
-
"start":
|
|
4760
|
+
"start": 1366
|
|
4779
4761
|
},
|
|
4780
4762
|
{
|
|
4781
4763
|
"name": "<impl Eq for i8>::eq",
|
|
4782
|
-
"start":
|
|
4764
|
+
"start": 1451
|
|
4783
4765
|
},
|
|
4784
4766
|
{
|
|
4785
4767
|
"name": "<impl Eq for i16>::eq",
|
|
4786
|
-
"start":
|
|
4768
|
+
"start": 1537
|
|
4787
4769
|
},
|
|
4788
4770
|
{
|
|
4789
4771
|
"name": "<impl Eq for i32>::eq",
|
|
4790
|
-
"start":
|
|
4772
|
+
"start": 1623
|
|
4791
4773
|
},
|
|
4792
4774
|
{
|
|
4793
4775
|
"name": "<impl Eq for i64>::eq",
|
|
4794
|
-
"start":
|
|
4776
|
+
"start": 1709
|
|
4795
4777
|
},
|
|
4796
4778
|
{
|
|
4797
4779
|
"name": "<impl Eq for ()>::eq",
|
|
4798
|
-
"start":
|
|
4780
|
+
"start": 1802
|
|
4799
4781
|
},
|
|
4800
4782
|
{
|
|
4801
4783
|
"name": "<impl Eq for bool>::eq",
|
|
4802
|
-
"start":
|
|
4784
|
+
"start": 1881
|
|
4803
4785
|
},
|
|
4804
4786
|
{
|
|
4805
4787
|
"name": "<impl Eq for [T; N]>::eq",
|
|
4806
|
-
"start":
|
|
4788
|
+
"start": 2006
|
|
4807
4789
|
},
|
|
4808
4790
|
{
|
|
4809
4791
|
"name": "<impl Eq for [T]>::eq",
|
|
4810
|
-
"start":
|
|
4792
|
+
"start": 2224
|
|
4811
4793
|
},
|
|
4812
4794
|
{
|
|
4813
4795
|
"name": "<impl Eq for str<N>>::eq",
|
|
4814
|
-
"start":
|
|
4796
|
+
"start": 2503
|
|
4815
4797
|
},
|
|
4816
4798
|
{
|
|
4817
4799
|
"name": "make_tuple_eq_body",
|
|
4818
|
-
"start":
|
|
4800
|
+
"start": 2683
|
|
4819
4801
|
},
|
|
4820
4802
|
{
|
|
4821
4803
|
"name": "<impl Eq for (A, B)>::eq",
|
|
4822
|
-
"start":
|
|
4804
|
+
"start": 2944
|
|
4823
4805
|
},
|
|
4824
4806
|
{
|
|
4825
4807
|
"name": "<impl Eq for (A, B, C)>::eq",
|
|
4826
|
-
"start":
|
|
4808
|
+
"start": 3076
|
|
4827
4809
|
},
|
|
4828
4810
|
{
|
|
4829
4811
|
"name": "<impl Eq for (A, B, C, D)>::eq",
|
|
4830
|
-
"start":
|
|
4812
|
+
"start": 3221
|
|
4831
4813
|
},
|
|
4832
4814
|
{
|
|
4833
4815
|
"name": "<impl Eq for (A, B, C, D, E)>::eq",
|
|
4834
|
-
"start":
|
|
4816
|
+
"start": 3379
|
|
4835
4817
|
},
|
|
4836
4818
|
{
|
|
4837
4819
|
"name": "<impl Eq for (A, B, C, D, E, F)>::eq",
|
|
4838
|
-
"start":
|
|
4820
|
+
"start": 3550
|
|
4839
4821
|
},
|
|
4840
4822
|
{
|
|
4841
4823
|
"name": "<impl Eq for (A, B, C, D, E, F, G)>::eq",
|
|
4842
|
-
"start":
|
|
4824
|
+
"start": 3734
|
|
4843
4825
|
},
|
|
4844
4826
|
{
|
|
4845
4827
|
"name": "<impl Eq for (A, B, C, D, E, F, G, H)>::eq",
|
|
4846
|
-
"start":
|
|
4828
|
+
"start": 3931
|
|
4847
4829
|
},
|
|
4848
4830
|
{
|
|
4849
4831
|
"name": "<impl Eq for (A, B, C, D, E, F, G, H, I)>::eq",
|
|
4850
|
-
"start":
|
|
4832
|
+
"start": 4141
|
|
4851
4833
|
},
|
|
4852
4834
|
{
|
|
4853
4835
|
"name": "<impl Eq for (A, B, C, D, E, F, G, H, I, J)>::eq",
|
|
4854
|
-
"start":
|
|
4836
|
+
"start": 4364
|
|
4855
4837
|
},
|
|
4856
4838
|
{
|
|
4857
4839
|
"name": "<impl Eq for (A, B, C, D, E, F, G, H, I, J, K)>::eq",
|
|
4858
|
-
"start":
|
|
4840
|
+
"start": 4601
|
|
4859
4841
|
},
|
|
4860
4842
|
{
|
|
4861
4843
|
"name": "<impl Eq for (A, B, C, D, E, F, G, H, I, J, K, L)>::eq",
|
|
4862
|
-
"start":
|
|
4844
|
+
"start": 4851
|
|
4863
4845
|
},
|
|
4864
4846
|
{
|
|
4865
4847
|
"name": "<impl Eq for Ordering>::eq",
|
|
4866
|
-
"start":
|
|
4848
|
+
"start": 4961
|
|
4867
4849
|
},
|
|
4868
4850
|
{
|
|
4869
4851
|
"name": "Ordering::less",
|
|
4870
|
-
"start":
|
|
4852
|
+
"start": 5562
|
|
4871
4853
|
},
|
|
4872
4854
|
{
|
|
4873
4855
|
"name": "Ordering::equal",
|
|
4874
|
-
"start":
|
|
4856
|
+
"start": 5633
|
|
4875
4857
|
},
|
|
4876
4858
|
{
|
|
4877
4859
|
"name": "Ordering::greater",
|
|
4878
|
-
"start":
|
|
4860
|
+
"start": 5706
|
|
4879
4861
|
},
|
|
4880
4862
|
{
|
|
4881
4863
|
"name": "derive_ord",
|
|
4882
|
-
"start":
|
|
4864
|
+
"start": 6077
|
|
4883
4865
|
},
|
|
4884
4866
|
{
|
|
4885
4867
|
"name": "<impl Ord for u128>::cmp",
|
|
4886
|
-
"start":
|
|
4868
|
+
"start": 6727
|
|
4887
4869
|
},
|
|
4888
4870
|
{
|
|
4889
4871
|
"name": "<impl Ord for u64>::cmp",
|
|
4890
|
-
"start":
|
|
4872
|
+
"start": 6974
|
|
4891
4873
|
},
|
|
4892
4874
|
{
|
|
4893
4875
|
"name": "<impl Ord for u32>::cmp",
|
|
4894
|
-
"start":
|
|
4876
|
+
"start": 7222
|
|
4895
4877
|
},
|
|
4896
4878
|
{
|
|
4897
4879
|
"name": "<impl Ord for u16>::cmp",
|
|
4898
|
-
"start":
|
|
4880
|
+
"start": 7470
|
|
4899
4881
|
},
|
|
4900
4882
|
{
|
|
4901
4883
|
"name": "<impl Ord for u8>::cmp",
|
|
4902
|
-
"start":
|
|
4884
|
+
"start": 7716
|
|
4903
4885
|
},
|
|
4904
4886
|
{
|
|
4905
4887
|
"name": "<impl Ord for i8>::cmp",
|
|
4906
|
-
"start":
|
|
4888
|
+
"start": 7962
|
|
4907
4889
|
},
|
|
4908
4890
|
{
|
|
4909
4891
|
"name": "<impl Ord for i16>::cmp",
|
|
4910
|
-
"start":
|
|
4892
|
+
"start": 8210
|
|
4911
4893
|
},
|
|
4912
4894
|
{
|
|
4913
4895
|
"name": "<impl Ord for i32>::cmp",
|
|
4914
|
-
"start":
|
|
4896
|
+
"start": 8458
|
|
4915
4897
|
},
|
|
4916
4898
|
{
|
|
4917
4899
|
"name": "<impl Ord for i64>::cmp",
|
|
4918
|
-
"start":
|
|
4900
|
+
"start": 8706
|
|
4919
4901
|
},
|
|
4920
4902
|
{
|
|
4921
4903
|
"name": "<impl Ord for ()>::cmp",
|
|
4922
|
-
"start":
|
|
4904
|
+
"start": 8960
|
|
4923
4905
|
},
|
|
4924
4906
|
{
|
|
4925
4907
|
"name": "<impl Ord for bool>::cmp",
|
|
4926
|
-
"start":
|
|
4908
|
+
"start": 9059
|
|
4927
4909
|
},
|
|
4928
4910
|
{
|
|
4929
4911
|
"name": "<impl Ord for [T; N]>::cmp",
|
|
4930
|
-
"start":
|
|
4912
|
+
"start": 9529
|
|
4931
4913
|
},
|
|
4932
4914
|
{
|
|
4933
4915
|
"name": "<impl Ord for [T]>::cmp",
|
|
4934
|
-
"start":
|
|
4916
|
+
"start": 9932
|
|
4935
4917
|
},
|
|
4936
4918
|
{
|
|
4937
4919
|
"name": "make_tuple_ord_body",
|
|
4938
|
-
"start":
|
|
4920
|
+
"start": 10500
|
|
4939
4921
|
},
|
|
4940
4922
|
{
|
|
4941
4923
|
"name": "<impl Ord for (A, B)>::cmp",
|
|
4942
|
-
"start":
|
|
4924
|
+
"start": 11122
|
|
4943
4925
|
},
|
|
4944
4926
|
{
|
|
4945
4927
|
"name": "<impl Ord for (A, B, C)>::cmp",
|
|
4946
|
-
"start":
|
|
4928
|
+
"start": 11264
|
|
4947
4929
|
},
|
|
4948
4930
|
{
|
|
4949
4931
|
"name": "<impl Ord for (A, B, C, D)>::cmp",
|
|
4950
|
-
"start":
|
|
4932
|
+
"start": 11420
|
|
4951
4933
|
},
|
|
4952
4934
|
{
|
|
4953
4935
|
"name": "<impl Ord for (A, B, C, D, E)>::cmp",
|
|
4954
|
-
"start":
|
|
4936
|
+
"start": 11590
|
|
4955
4937
|
},
|
|
4956
4938
|
{
|
|
4957
4939
|
"name": "<impl Ord for (A, B, C, D, E, F)>::cmp",
|
|
4958
|
-
"start":
|
|
4940
|
+
"start": 11774
|
|
4959
4941
|
},
|
|
4960
4942
|
{
|
|
4961
4943
|
"name": "<impl Ord for (A, B, C, D, E, F, G)>::cmp",
|
|
4962
|
-
"start":
|
|
4944
|
+
"start": 11972
|
|
4963
4945
|
},
|
|
4964
4946
|
{
|
|
4965
4947
|
"name": "<impl Ord for (A, B, C, D, E, F, G, H)>::cmp",
|
|
4966
|
-
"start":
|
|
4948
|
+
"start": 12184
|
|
4967
4949
|
},
|
|
4968
4950
|
{
|
|
4969
4951
|
"name": "<impl Ord for (A, B, C, D, E, F, G, H, I)>::cmp",
|
|
4970
|
-
"start":
|
|
4952
|
+
"start": 12410
|
|
4971
4953
|
},
|
|
4972
4954
|
{
|
|
4973
4955
|
"name": "<impl Ord for (A, B, C, D, E, F, G, H, I, J)>::cmp",
|
|
4974
|
-
"start":
|
|
4956
|
+
"start": 12650
|
|
4975
4957
|
},
|
|
4976
4958
|
{
|
|
4977
4959
|
"name": "<impl Ord for (A, B, C, D, E, F, G, H, I, J, K)>::cmp",
|
|
4978
|
-
"start":
|
|
4960
|
+
"start": 12905
|
|
4979
4961
|
},
|
|
4980
4962
|
{
|
|
4981
4963
|
"name": "<impl Ord for (A, B, C, D, E, F, G, H, I, J, K, L)>::cmp",
|
|
4982
|
-
"start":
|
|
4964
|
+
"start": 13174
|
|
4983
4965
|
},
|
|
4984
4966
|
{
|
|
4985
4967
|
"name": "max",
|
|
4986
|
-
"start":
|
|
4968
|
+
"start": 13536
|
|
4987
4969
|
},
|
|
4988
4970
|
{
|
|
4989
4971
|
"name": "min",
|
|
4990
|
-
"start":
|
|
4972
|
+
"start": 13913
|
|
4991
4973
|
},
|
|
4992
4974
|
{
|
|
4993
4975
|
"name": "cmp_tests::sanity_check_min",
|
|
4994
|
-
"start":
|
|
4976
|
+
"start": 14067
|
|
4995
4977
|
},
|
|
4996
4978
|
{
|
|
4997
4979
|
"name": "cmp_tests::sanity_check_max",
|
|
4998
|
-
"start":
|
|
4980
|
+
"start": 14263
|
|
4999
4981
|
},
|
|
5000
4982
|
{
|
|
5001
4983
|
"name": "cmp_tests::correctly_handles_unequal_length_vectors",
|
|
5002
|
-
"start":
|
|
4984
|
+
"start": 14485
|
|
5003
4985
|
},
|
|
5004
4986
|
{
|
|
5005
4987
|
"name": "cmp_tests::lexicographic_ordering_for_vectors",
|
|
5006
|
-
"start":
|
|
4988
|
+
"start": 14685
|
|
5007
4989
|
}
|
|
5008
4990
|
],
|
|
5009
4991
|
"path": "std/cmp.nr",
|
|
5010
|
-
"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"
|
|
4992
|
+
"source": "use crate::meta::ctstring::AsCtString;\nuse crate::meta::derive_via;\n\n/// Compare two values for equality\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.\n/// A value with three states: `Ordering::less()`, `Ordering::equal()` or `Ordering::greater()`.\n/// Most often used to encode the result of a comparison operation.\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/// Compare one object to another, returning whether it is less-than, equal-to,\n/// or greater-than the other object.\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"
|
|
5011
4993
|
},
|
|
5012
4994
|
"50": {
|
|
5013
4995
|
"function_locations": [
|
|
@@ -5577,13 +5559,39 @@
|
|
|
5577
5559
|
},
|
|
5578
5560
|
{
|
|
5579
5561
|
"name": "check_nullifier_exists_oracle",
|
|
5580
|
-
"start":
|
|
5562
|
+
"start": 2433
|
|
5581
5563
|
}
|
|
5582
5564
|
],
|
|
5583
5565
|
"path": "/home/aztec-dev/aztec-packages/noir-projects/noir-contracts/contracts/protocol/aztec_sublib/src/oracle/nullifiers.nr",
|
|
5584
|
-
"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(
|
|
5566
|
+
"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// TODO(F-498): review naming consistency\n#[oracle(aztec_utl_doesNullifierExist)]\nunconstrained fn check_nullifier_exists_oracle(_inner_nullifier: Field) -> bool {}\n"
|
|
5585
5567
|
},
|
|
5586
5568
|
"83": {
|
|
5569
|
+
"function_locations": [
|
|
5570
|
+
{
|
|
5571
|
+
"name": "assert_compatible_oracle_version",
|
|
5572
|
+
"start": 700
|
|
5573
|
+
},
|
|
5574
|
+
{
|
|
5575
|
+
"name": "assert_compatible_oracle_version_wrapper",
|
|
5576
|
+
"start": 1009
|
|
5577
|
+
},
|
|
5578
|
+
{
|
|
5579
|
+
"name": "assert_compatible_oracle_version_oracle",
|
|
5580
|
+
"start": 1199
|
|
5581
|
+
},
|
|
5582
|
+
{
|
|
5583
|
+
"name": "test::compatible_oracle_version",
|
|
5584
|
+
"start": 1350
|
|
5585
|
+
},
|
|
5586
|
+
{
|
|
5587
|
+
"name": "test::incompatible_oracle_version",
|
|
5588
|
+
"start": 1541
|
|
5589
|
+
}
|
|
5590
|
+
],
|
|
5591
|
+
"path": "/home/aztec-dev/aztec-packages/noir-projects/noir-contracts/contracts/protocol/aztec_sublib/src/oracle/version.nr",
|
|
5592
|
+
"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 and if the oracle version is incompatible an error is thrown.\npub global ORACLE_VERSION: Field = 21;\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 aztec cli 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"
|
|
5593
|
+
},
|
|
5594
|
+
"84": {
|
|
5587
5595
|
"function_locations": [
|
|
5588
5596
|
{
|
|
5589
5597
|
"name": "<impl StateVariable<(M + 1), Context> for DelayedPublicMutable<T, InitialDelay, Context>>::new",
|
|
@@ -5649,7 +5657,7 @@
|
|
|
5649
5657
|
"path": "/home/aztec-dev/aztec-packages/noir-projects/noir-contracts/contracts/protocol/aztec_sublib/src/state_vars/delayed_public_mutable.nr",
|
|
5650
5658
|
"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"
|
|
5651
5659
|
},
|
|
5652
|
-
"
|
|
5660
|
+
"85": {
|
|
5653
5661
|
"function_locations": [
|
|
5654
5662
|
{
|
|
5655
5663
|
"name": "<impl StateVariable<1, Context> for Map<K, V, Context>>::new",
|
|
@@ -5667,7 +5675,7 @@
|
|
|
5667
5675
|
"path": "/home/aztec-dev/aztec-packages/noir-projects/noir-contracts/contracts/protocol/aztec_sublib/src/state_vars/map.nr",
|
|
5668
5676
|
"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"
|
|
5669
5677
|
},
|
|
5670
|
-
"
|
|
5678
|
+
"91": {
|
|
5671
5679
|
"function_locations": [
|
|
5672
5680
|
{
|
|
5673
5681
|
"name": "WithHash<T, M>::new",
|