github/arbo
1
1
Fork 0
mirror of https://github.com/vocdoni/arbo.git synced 2026-01-10 06:17:58 -05:00
Code Issues Packages Projects Releases Wiki Activity

fix key encoding

Browse Source
This commit is contained in:
Lucas Menendez
2025-04-10 10:11:10 +02:00
parent 32eb6a6930
commit fe46bde657
3 changed files with 111 additions and 30 deletions
Download Patch File Download Diff File Expand all files Collapse all files

68
testvectors/gnark/gnark_test.go
View File

@@ -14,26 +14,27 @@ import (
"github.com/vocdoni/arbo/memdb"
"github.com/vocdoni/gnark-crypto-primitives/hash/bn254/poseidon"
garbo "github.com/vocdoni/gnark-crypto-primitives/tree/arbo"
gsmt "github.com/vocdoni/gnark-crypto-primitives/tree/smt"
)
const nLevels = 160
type testCircuit struct {
type testCircuitArbo struct {
Root frontend.Variable
Key frontend.Variable
Value frontend.Variable
Siblings [nLevels]frontend.Variable
}
func (circuit *testCircuit) Define(api frontend.API) error {
func (circuit *testCircuitArbo) Define(api frontend.API) error {
return garbo.CheckInclusionProof(api, poseidon.MultiHash, circuit.Key, circuit.Value, circuit.Root, circuit.Siblings[:])
}
func TestGnarkSMTVerifier(t *testing.T) {
func TestGnarkArboVerifier(t *testing.T) {
c := qt.New(t)
tree, err := arbo.NewTree(arbo.Config{
Database: memdb.New(),
MaxLevels: 255,
MaxLevels: nLevels,
HashFunction: arbo.HashFunctionMultiPoseidon,
})
c.Assert(err, qt.IsNil)
@@ -66,7 +67,64 @@ func TestGnarkSMTVerifier(t *testing.T) {
}
assert := test.NewAssert(t)
assert.SolvingSucceeded(&testCircuit{}, &testCircuit{
assert.SolvingSucceeded(&testCircuitArbo{}, &testCircuitArbo{
Root: proof.Root,
Key: proof.Key,
Value: proof.Value,
Siblings: [160]frontend.Variable(paddedSiblings),
}, test.WithCurves(ecc.BN254), test.WithBackends(backend.GROTH16))
}
type testCircuitSMT struct {
Root frontend.Variable
Key frontend.Variable
Value frontend.Variable
Siblings [nLevels]frontend.Variable
}
func (circuit *testCircuitSMT) Define(api frontend.API) error {
gsmt.InclusionVerifier(api, poseidon.MultiHash, circuit.Root, circuit.Siblings[:], circuit.Key, circuit.Value)
return nil
}
func TestGnarkSMTVerifier(t *testing.T) {
c := qt.New(t)
tree, err := arbo.NewTree(arbo.Config{
Database: memdb.New(),
MaxLevels: nLevels,
HashFunction: arbo.HashFunctionMultiPoseidon,
})
c.Assert(err, qt.IsNil)
var (
keys []*big.Int
values [][]*big.Int
)
max, _ := new(big.Int).SetString("10000000000000000000000000", 10)
for range 100 {
k, err := rand.Int(rand.Reader, max)
qt.Assert(t, err, qt.IsNil)
v := new(big.Int).Mul(k, big.NewInt(2))
keys = append(keys, k)
values = append(values, []*big.Int{v})
}
_, err = tree.AddBatchBigInt(keys, values)
c.Assert(err, qt.IsNil)
proof, err := tree.GenerateGnarkVerifierProofBigInt(keys[0])
c.Assert(err, qt.IsNil)
var paddedSiblings [nLevels]frontend.Variable
for i := range paddedSiblings {
if i < len(proof.Siblings) {
paddedSiblings[i] = proof.Siblings[i]
continue
}
paddedSiblings[i] = 0
}
assert := test.NewAssert(t)
assert.SolvingSucceeded(&testCircuitSMT{}, &testCircuitSMT{
Root: proof.Root,
Key: proof.Key,
Value: proof.Value,