unused input removed

arbo/verifier.go

@@ -35,12 +35,7 @@ func isValid(api frontend.API, sibling, prevSibling, leaf, prevLeaf frontend.Var
 
 // CheckProof receives the parameters of a proof of Arbo to recalculate the
 // root with them and compare it with the provided one, verifiying the proof.
-func CheckProof(api frontend.API, key, value, root, nsiblings frontend.Variable, siblings []frontend.Variable) error {
-	// ensure that the number of valid siblings are less or equal to the number
-	// of provided siblings
-	api.AssertIsLessOrEqual(nsiblings, len(siblings))
-	// get a map with the valid siblings
-	// valid := validSiblings(api, siblings, nsiblings)
+func CheckProof(api frontend.API, key, value, root frontend.Variable, siblings []frontend.Variable) error {
 	// calculate the path from the provided key to decide which leaf is the
 	// correct one in every level of the tree
 	path := api.ToBinary(key, api.Compiler().FieldBitLen())

arbo/verifier_test.go

@@ -23,12 +23,11 @@ type testVerifierCircuit struct {
 	Root      frontend.Variable
 	Key       frontend.Variable
 	Value     frontend.Variable
-	NSiblings frontend.Variable
 	Siblings  [160]frontend.Variable
 }
 
 func (circuit *testVerifierCircuit) Define(api frontend.API) error {
-	return CheckProof(api, circuit.Key, circuit.Value, circuit.Root, circuit.NSiblings, circuit.Siblings[:])
+	return CheckProof(api, circuit.Key, circuit.Value, circuit.Root, circuit.Siblings[:])
 }
 
 func successInputs(t *testing.T, n int) testVerifierCircuit {
@@ -79,7 +78,6 @@ func successInputs(t *testing.T, n int) testVerifierCircuit {
 		Key:       arbo.BytesLEToBigInt(key),
 		Value:     value,
 		Siblings:  siblings,
-		NSiblings: new(big.Int).SetInt64(int64(len(uSiblings))),
 	}
 }