forked from worldcoin/semaphore-mtb
-
Notifications
You must be signed in to change notification settings - Fork 0
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
prover: insertion_circuit: implement EIP 4844
Co-authored-by: Marcin Kostrzewa <[email protected]> Signed-off-by: Wojciech Zmuda <[email protected]>
- Loading branch information
Showing
4 changed files
with
285 additions
and
41 deletions.
There are no files selected for viewing
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
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
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
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
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,152 @@ | ||
| package prover | ||
|
|
||
| import ( | ||
| "crypto/rand" | ||
| "math" | ||
| "math/big" | ||
| "testing" | ||
|
|
||
| "github.com/consensys/gnark-crypto/ecc" | ||
| bn254fr "github.com/consensys/gnark-crypto/ecc/bn254/fr" | ||
| "github.com/consensys/gnark/backend" | ||
| "github.com/consensys/gnark/frontend" | ||
| "github.com/consensys/gnark/test" | ||
| gokzg4844 "github.com/crate-crypto/go-kzg-4844" | ||
| "github.com/iden3/go-iden3-crypto/keccak256" | ||
| "github.com/stretchr/testify/require" | ||
|
|
||
| poseidon "worldcoin/gnark-mbu/poseidon_native" | ||
| ) | ||
|
|
||
| const ( | ||
| numGoRoutines = 0 | ||
| existingUsersCount = 1500 | ||
| batchSize = 20 | ||
| depth = 20 | ||
| ) | ||
|
|
||
| func TestInsertionCircuit(t *testing.T) { | ||
| incomingIds := generateRandomIdentities(batchSize) | ||
| smallTree := poseidon.NewTree(treeDepth(polynomialDegree)) | ||
| idComms := make([]frontend.Variable, batchSize) | ||
| for i, id := range incomingIds { | ||
| idComms[i] = id | ||
| smallTree.Update(i, id) | ||
| } | ||
| incomingIdsTreeRoot := smallTree.Root() | ||
| incomingIdsTreeRoot = *bytesToBn254BigInt(incomingIdsTreeRoot.Bytes()) | ||
|
|
||
| ctx, err := gokzg4844.NewContext4096Secure() | ||
| require.NoError(t, err) | ||
| blob := identitiesToBlob(incomingIds) | ||
| commitment, err := ctx.BlobToKZGCommitment(blob, numGoRoutines) | ||
| require.NoError(t, err) | ||
| commitment4844 := *bytesToBn254BigInt(commitment[:]) | ||
|
|
||
| challenge := bigIntsToChallenge([]big.Int{incomingIdsTreeRoot, commitment4844}) | ||
| proof, evaluation, err := ctx.ComputeKZGProof(blob, challenge, numGoRoutines) | ||
| require.NoError(t, err) | ||
| err = ctx.VerifyKZGProof(commitment, challenge, evaluation, proof) | ||
| require.NoError(t, err) | ||
|
|
||
| existingIds := generateRandomIdentities(existingUsersCount) | ||
| bigTree := poseidon.NewTree(depth) | ||
| for i, id := range existingIds { | ||
| bigTree.Update(i, id) | ||
| } | ||
| preRoot := bigTree.Root() | ||
| merkleProofs := make([][]frontend.Variable, batchSize) | ||
| for i, id := range incomingIds { | ||
| mp := bigTree.Update(i+existingUsersCount, id) | ||
| merkleProofs[i] = make([]frontend.Variable, len(mp)) | ||
| for j, v := range mp { | ||
| merkleProofs[i][j] = v | ||
| } | ||
| } | ||
| postRoot := bigTree.Root() | ||
|
|
||
| circuit := InsertionMbuCircuit{ | ||
| IdComms: make([]frontend.Variable, batchSize), | ||
| MerkleProofs: make([][]frontend.Variable, batchSize), | ||
| BatchSize: batchSize, | ||
| Depth: depth, | ||
| } | ||
| for i := range merkleProofs { | ||
| circuit.MerkleProofs[i] = make([]frontend.Variable, depth) | ||
| } | ||
|
|
||
| assignment := InsertionMbuCircuit{ | ||
| InputHash: incomingIdsTreeRoot, | ||
| ExpectedEvaluation: evaluation[:], | ||
| Commitment4844: commitment4844, | ||
| StartIndex: existingUsersCount, | ||
| PreRoot: preRoot, | ||
| PostRoot: postRoot, | ||
| IdComms: idComms, | ||
| MerkleProofs: merkleProofs, | ||
| BatchSize: batchSize, | ||
| Depth: depth, | ||
| } | ||
|
|
||
| assert := test.NewAssert(t) | ||
| assert.CheckCircuit( | ||
| &circuit, test.WithBackends(backend.GROTH16), test.WithCurves(ecc.BN254), | ||
| test.WithValidAssignment(&assignment), | ||
| ) | ||
| } | ||
|
|
||
| // generateRandomIdentities generates a slice of random big integers reduced modulo BN254 FR. | ||
| func generateRandomIdentities(count int) []big.Int { | ||
| ids := make([]big.Int, count) | ||
| for i := range ids { | ||
| n, _ := rand.Int(rand.Reader, bn254fr.Modulus()) | ||
| ids[i] = *n | ||
| } | ||
| return ids | ||
| } | ||
|
|
||
| // identitiesToBlob converts a slice of big.Int into a KZG 4844 Blob. | ||
| func identitiesToBlob(ids []big.Int) *gokzg4844.Blob { | ||
| if len(ids) > gokzg4844.ScalarsPerBlob { | ||
| panic("too many identities for a blob") | ||
| } | ||
| var blob gokzg4844.Blob | ||
| for i, id := range ids { | ||
| startByte := i * 32 | ||
| id.FillBytes(blob[startByte : startByte+32]) | ||
| } | ||
| return &blob | ||
| } | ||
|
|
||
| // bytesToBn254BigInt converts a slice of bytes to a *big.Int and reduces it by BN254 modulus | ||
| func bytesToBn254BigInt(b []byte) *big.Int { | ||
| n := new(big.Int).SetBytes(b) | ||
| modulus := bn254fr.Modulus() | ||
| return n.Mod(n, modulus) | ||
| } | ||
|
|
||
| // bigIntsToChallenge converts input bit.Ints to a challenge for a proof of knowledge of a polynomial. | ||
| // The challenge is defined as a gokzg4844.Scalar of a keccak256 hash of all input big.Ints reduced | ||
| // by BN254 modulus. | ||
| func bigIntsToChallenge(input []big.Int) (challenge gokzg4844.Scalar) { | ||
| var inputBytes []byte | ||
| for _, i := range input { | ||
| temp := make([]byte, 32) | ||
| inputBytes = append(inputBytes, i.FillBytes(temp)...) | ||
| } | ||
|
|
||
| // Reduce keccak because gokzg4844 API expects that | ||
| hashBytes := bytesToBn254BigInt(keccak256.Hash(inputBytes)).Bytes() | ||
|
|
||
| copy(challenge[:], hashBytes) | ||
| return challenge | ||
| } | ||
|
|
||
| // treeDepth calculates the depth of a binary tree containing the given number of leaves | ||
| func treeDepth(leavesCount int) (height int) { | ||
| if leavesCount <= 0 { | ||
| return 0 | ||
| } | ||
| height = int(math.Ceil(math.Log2(float64(leavesCount)))) | ||
| return | ||
| } |