arnaucube/gnark-plonky2-verifier
1
0
Fork 0
mirror of https://github.com/arnaucube/gnark-plonky2-verifier.git synced 2026-01-12 09:01:32 +01:00
Code Issues Projects Releases Wiki Activity

fix for V-SCT-VUL-022

Browse Source
This commit is contained in:
Kevin Jue
2023-12-19 10:51:43 -08:00
parent cc064aeb3e
commit 318c3ce9de
1 changed files with 4 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
fri/fri.go
View File

@@ -128,13 +128,15 @@ func (f *Chip) verifyMerkleProofToCapWithCapIndex(
} }
const NUM_LEAF_LOOKUPS = 4 const NUM_LEAF_LOOKUPS = 4
// Each lookup gadget will connect to 4 merkleCap entries
const STRIDE_LENGTH = 4
var leafLookups [NUM_LEAF_LOOKUPS]poseidon.BN254HashOut var leafLookups [NUM_LEAF_LOOKUPS]poseidon.BN254HashOut
// First create the "leaf" lookup2 circuits // First create the "leaf" lookup2 circuits
// The will use the least significant bits of the capIndexBits array // This will use the least significant bits of the capIndexBits array
for i := 0; i < NUM_LEAF_LOOKUPS; i++ { for i := 0; i < NUM_LEAF_LOOKUPS; i++ {
leafLookups[i] = f.api.Lookup2( leafLookups[i] = f.api.Lookup2(
capIndexBits[0], capIndexBits[1], capIndexBits[0], capIndexBits[1],
merkleCap[i*NUM_LEAF_LOOKUPS], merkleCap[i*NUM_LEAF_LOOKUPS+1], merkleCap[i*NUM_LEAF_LOOKUPS+2], merkleCap[i*NUM_LEAF_LOOKUPS+3], merkleCap[i*STRIDE_LENGTH], merkleCap[i*STRIDE_LENGTH+1], merkleCap[i*STRIDE_LENGTH+2], merkleCap[i*STRIDE_LENGTH+3],
) )
} }