arnaucube/go-circom-prover-verifier
1
0
Fork 0
mirror of https://github.com/arnaucube/go-circom-prover-verifier.git synced 2026-02-06 19:06:43 +01:00
Code Issues Packages Projects Releases Wiki Activity

Fix use H polynomial

Browse Source
This commit is contained in:
arnaucube
2020-04-06 11:52:55 +02:00
parent d5c971e59a
commit 198eeee493
1 changed files with 1 additions and 5 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
prover.go
View File

@@ -2,7 +2,6 @@ package gocircomprover
import (
"crypto/rand"
"fmt"
"math/big"
bn256 "github.com/ethereum/go-ethereum/crypto/bn256/cloudflare"
@@ -91,9 +90,7 @@ func GenerateProof(pk *ProvingKey, w Witness) (*Proof, []*big.Int, error) {
proofBG1 = new(bn256.G1).Add(proofBG1, pk.VkBeta1)
proofBG1 = new(bn256.G1).Add(proofBG1, new(bn256.G1).ScalarMult(pk.VkDelta1, s))
// TODO
// h := calculateH(pk, w)
h := []*big.Int{} // TMP
h := calculateH(pk, w)
for i := 0; i < len(h); i++ {
proof.C = new(bn256.G1).Add(proof.C, new(bn256.G1).ScalarMult(pk.HExps[i], h[i]))
@@ -117,7 +114,6 @@ func calculateH(pk *ProvingKey, w Witness) []*big.Int {
for i := 0; i < pk.NVars; i++ {
for j := range pk.PolsA[i] {
polAT[j] = fAdd(polAT[j], fMul(w[i], pk.PolsA[i][j]))
fmt.Println(polAT[j])
}
for j := range pk.PolsB[i] {
polBT[j] = fAdd(polBT[j], fMul(w[i], pk.PolsB[i][j]))