8411631094850346633429466206441955219061762119006426459772382946930606390748
- 9708419728795563670286566418307042748092204899363634976546883453490873071450
- 1
- 2
- 959253372465518657915465330794866170308951936404091375323782669660913720058
- 3
- 4
Created
May 30, 2024 20:40
-
-
Save Turupawn/5a1e91f940b58114b31313312ebe968c to your computer and use it in GitHub Desktop.
Circom
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
{ | |
"leaf": "1", | |
"root": "8411631094850346633429466206441955219061762119006426459772382946930606390748", | |
"pathElements": ["2", "959253372465518657915465330794866170308951936404091375323782669660913720058"], | |
"pathIndices": ["1", "1"] | |
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
pragma circom 2.0.0; | |
include "circomlib/circuits/poseidon.circom"; | |
include "circomlib/circuits/bitify.circom"; | |
include "circomlib/circuits/comparators.circom"; | |
// if s == 0 returns [in[0], in[1]] | |
// if s == 1 returns [in[1], in[0]] | |
template PositionSwitcher() { | |
signal input in[2]; | |
signal input s; | |
signal output out[2]; | |
s * (1 - s) === 0; | |
out[0] <== (in[1] - in[0])*s + in[0]; | |
out[1] <== (in[0] - in[1])*s + in[1]; | |
} | |
// Verifies that merkle path is correct for a given merkle root and leaf | |
// pathIndices input is an array of 0/1 selectors telling whether given | |
// pathElement is on the left or right side of merkle path | |
template VerifyMerklePath(levels) { | |
signal input leaf; | |
signal input root; | |
signal input pathElements[levels]; | |
signal input pathIndices[levels]; | |
component selectors[levels]; | |
component hashers[levels]; | |
signal computedPath[levels]; | |
for (var i = 0; i < levels; i++) { | |
selectors[i] = PositionSwitcher(); | |
selectors[i].in[0] <== i == 0 ? leaf : computedPath[i - 1]; | |
selectors[i].in[1] <== pathElements[i]; | |
selectors[i].s <== pathIndices[i]; | |
hashers[i] = Poseidon(2); | |
hashers[i].inputs[0] <== selectors[i].out[0]; | |
hashers[i].inputs[1] <== selectors[i].out[1]; | |
computedPath[i] <== hashers[i].out; | |
} | |
log(computedPath[levels - 1]); | |
root === computedPath[levels - 1]; | |
} | |
component main = VerifyMerklePath(2); |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment