arnaucube/go-snark-study
1
1
Fork 0
mirror of https://github.com/arnaucube/go-snark-study.git synced 2026-02-02 17:26:41 +01:00
Code Issues Packages Projects Releases Wiki Activity

small update, fix trusted setup ops over Field R

Browse Source
This commit is contained in:
arnaucube
2019-05-05 22:59:53 +02:00
parent 7d0c2ad53c
commit de33c12283
4 changed files with 41 additions and 25 deletions
Download Patch File Download Diff File Expand all files Collapse all files

16
r1csqap/r1csqap.go
View File

@@ -189,24 +189,24 @@ func (pf PolynomialField) R1CSToQAP(a, b, c [][]*big.Int) ([][]*big.Int, [][]*bi
// CombinePolynomials combine the given polynomials arrays into one, also returns the P(x)
func (pf PolynomialField) CombinePolynomials(r []*big.Int, ap, bp, cp [][]*big.Int) ([]*big.Int, []*big.Int, []*big.Int, []*big.Int) {
var alpha []*big.Int
var ax []*big.Int
for i := 0; i < len(r); i++ {
m := pf.Mul([]*big.Int{r[i]}, ap[i])
alpha = pf.Add(alpha, m)
ax = pf.Add(ax, m)
}
var beta []*big.Int
var bx []*big.Int
for i := 0; i < len(r); i++ {
m := pf.Mul([]*big.Int{r[i]}, bp[i])
beta = pf.Add(beta, m)
bx = pf.Add(bx, m)
}
var gamma []*big.Int
var cx []*big.Int
for i := 0; i < len(r); i++ {
m := pf.Mul([]*big.Int{r[i]}, cp[i])
gamma = pf.Add(gamma, m)
cx = pf.Add(cx, m)
}
px := pf.Sub(pf.Mul(alpha, beta), gamma)
return alpha, beta, gamma, px
px := pf.Sub(pf.Mul(ax, bx), cx)
return ax, bx, cx, px
}
// DivisorPolynomial returns the divisor polynomial given two polynomials