forked from Consensys/gnark
-
Notifications
You must be signed in to change notification settings - Fork 0
/
setup.go
688 lines (574 loc) · 19.4 KB
/
setup.go
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
// Copyright 2020 ConsenSys Software Inc.
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
// Code generated by gnark DO NOT EDIT
package groth16
import (
"errors"
"github.com/consensys/gnark-crypto/ecc"
curve "github.com/consensys/gnark-crypto/ecc/bls24-315"
"github.com/consensys/gnark-crypto/ecc/bls24-315/fr"
"github.com/consensys/gnark-crypto/ecc/bls24-315/fr/fft"
"github.com/consensys/gnark-crypto/ecc/bls24-315/fr/pedersen"
"github.com/consensys/gnark/backend/groth16/internal"
"github.com/consensys/gnark/constraint"
cs "github.com/consensys/gnark/constraint/bls24-315"
"math/big"
"math/bits"
)
// ProvingKey is used by a Groth16 prover to encode a proof of a statement
// Notation follows Figure 4. in DIZK paper https://eprint.iacr.org/2018/691.pdf
type ProvingKey struct {
// domain
Domain fft.Domain
// [α]₁, [β]₁, [δ]₁
// [A(t)]₁, [B(t)]₁, [Kpk(t)]₁, [Z(t)]₁
G1 struct {
Alpha, Beta, Delta curve.G1Affine
A, B, Z []curve.G1Affine
K []curve.G1Affine // the indexes correspond to the private wires
}
// [β]₂, [δ]₂, [B(t)]₂
G2 struct {
Beta, Delta curve.G2Affine
B []curve.G2Affine
}
// if InfinityA[i] == true, the point G1.A[i] == infinity
InfinityA, InfinityB []bool
NbInfinityA, NbInfinityB uint64
CommitmentKeys []pedersen.ProvingKey
}
// VerifyingKey is used by a Groth16 verifier to verify the validity of a proof and a statement
// Notation follows Figure 4. in DIZK paper https://eprint.iacr.org/2018/691.pdf
type VerifyingKey struct {
// [α]₁, [Kvk]₁
G1 struct {
Alpha curve.G1Affine
Beta, Delta curve.G1Affine // unused, here for compatibility purposes
K []curve.G1Affine // The indexes correspond to the public wires
}
// [β]₂, [δ]₂, [γ]₂,
// -[δ]₂, -[γ]₂: see proof.Verify() for more details
G2 struct {
Beta, Delta, Gamma curve.G2Affine
deltaNeg, gammaNeg curve.G2Affine // not serialized
}
// e(α, β)
e curve.GT // not serialized
CommitmentKey pedersen.VerifyingKey
PublicAndCommitmentCommitted [][]int // indexes of public/commitment committed variables
}
// Setup constructs the SRS
func Setup(r1cs *cs.R1CS, pk *ProvingKey, vk *VerifyingKey) error {
/*
Setup
-----
To build the verifying keys:
- compile the r1cs system -> the number of gates is len(GateOrdering)+len(PureStructuralConstraints)+len(InpureStructuralConstraints)
- loop through the ordered computational constraints (=gate in r1cs system structure), eValuate A(X), B(X), C(X) with simple formula (the gate number is the current iterator)
- loop through the inpure structural constraints, eValuate A(X), B(X), C(X) with simple formula, the gate number is len(gateOrdering)+ current iterator
- loop through the pure structural constraints, eValuate A(X), B(X), C(X) with simple formula, the gate number is len(gateOrdering)+len(InpureStructuralConstraints)+current iterator
*/
// get R1CS nb constraints, wires and public/private inputs
nbWires := r1cs.NbInternalVariables + r1cs.GetNbPublicVariables() + r1cs.GetNbSecretVariables()
commitmentInfo := r1cs.CommitmentInfo.(constraint.Groth16Commitments)
commitmentWires := commitmentInfo.CommitmentIndexes()
privateCommitted := commitmentInfo.GetPrivateCommitted()
nbPrivateCommittedWires := internal.NbElements(privateCommitted)
// a commitment is itself defined by a hint so the prover considers it private
// but the verifier will need to inject the value itself so on the groth16
// level it must be considered public
nbPublicWires := r1cs.GetNbPublicVariables() + len(commitmentInfo)
nbPrivateWires := r1cs.GetNbSecretVariables() + r1cs.NbInternalVariables - nbPrivateCommittedWires - len(commitmentInfo)
// Setting group for fft
domain := fft.NewDomain(uint64(r1cs.GetNbConstraints()))
// samples toxic waste
toxicWaste, err := sampleToxicWaste()
if err != nil {
return err
}
// Setup coeffs to compute pk.G1.A, pk.G1.B, pk.G1.K
A, B, C := setupABC(r1cs, domain, toxicWaste)
// To fill in the Proving and Verifying keys, we need to perform a lot of ecc scalar multiplication (with generator)
// and convert the resulting points to affine
// this is done using the curve.BatchScalarMultiplicationGX API, which takes as input the base point
// (in our case the generator) and the list of scalars, and outputs a list of points (len(points) == len(scalars))
// to use this batch call, we need to order our scalars in the same slice
// we have 1 batch call for G1 and 1 batch call for G1
// scalars are fr.Element in non montgomery form
_, _, g1, g2 := curve.Generators()
// ---------------------------------------------------------------------------------------------
// G1 scalars
// the G1 scalars are ordered (arbitrary) as follows:
//
// [[α], [β], [δ], [A(i)], [B(i)], [pk.K(i)], [Z(i)], [vk.K(i)]]
// len(A) == len(B) == nbWires
// len(pk.K) == nbPrivateWires
// len(vk.K) == nbPublicWires
// len(Z) == domain.Cardinality
// compute scalars for pkK, vkK and ckK
pkK := make([]fr.Element, nbPrivateWires)
vkK := make([]fr.Element, nbPublicWires)
ckK := make([][]fr.Element, len(commitmentInfo))
for i := range commitmentInfo {
ckK[i] = make([]fr.Element, len(privateCommitted[i]))
}
var t0, t1 fr.Element
computeK := func(i int, coeff *fr.Element) { // TODO: Inline again
t1.Mul(&A[i], &toxicWaste.beta)
t0.Mul(&B[i], &toxicWaste.alpha)
t1.Add(&t1, &t0).
Add(&t1, &C[i]).
Mul(&t1, coeff)
}
vI := 0 // number of public wires seen so far
cI := make([]int, len(commitmentInfo)) // number of private committed wires seen so far for each commitment
nbPrivateCommittedSeen := 0 // = ∑ᵢ cI[i]
nbCommitmentsSeen := 0
for i := range A {
commitment := -1 // index of the commitment that commits to this variable as a private or commitment value
var isCommitment, isPublic bool
if isPublic = i < r1cs.GetNbPublicVariables(); !isPublic {
if nbCommitmentsSeen < len(commitmentWires) && commitmentWires[nbCommitmentsSeen] == i {
isCommitment = true
nbCommitmentsSeen++
}
for j := range commitmentInfo { // does commitment j commit to i?
if cI[j] < len(privateCommitted[j]) && privateCommitted[j][cI[j]] == i {
commitment = j
break // frontend guarantees that no private variable is committed to more than once
}
}
}
if isPublic || commitment != -1 || isCommitment {
computeK(i, &toxicWaste.gammaInv)
if isPublic || isCommitment {
vkK[vI] = t1
vI++
} else { // committed and private
ckK[commitment][cI[commitment]] = t1
cI[commitment]++
nbPrivateCommittedSeen++
}
} else {
computeK(i, &toxicWaste.deltaInv)
pkK[i-vI-nbPrivateCommittedSeen] = t1 // vI = nbPublicSeen + nbCommitmentsSeen
}
}
// Z part of the proving key (scalars)
Z := make([]fr.Element, domain.Cardinality)
one := fr.One()
var zdt fr.Element
zdt.Exp(toxicWaste.t, new(big.Int).SetUint64(domain.Cardinality)).
Sub(&zdt, &one).
Mul(&zdt, &toxicWaste.deltaInv) // sets Zdt to Zdt/delta
for i := 0; i < int(domain.Cardinality); i++ {
Z[i] = zdt
zdt.Mul(&zdt, &toxicWaste.t)
}
// mark points at infinity and filter them
pk.InfinityA = make([]bool, len(A))
pk.InfinityB = make([]bool, len(B))
n := 0
for i, e := range A {
if e.IsZero() {
pk.InfinityA[i] = true
continue
}
A[n] = A[i]
n++
}
A = A[:n]
pk.NbInfinityA = uint64(nbWires - n)
n = 0
for i, e := range B {
if e.IsZero() {
pk.InfinityB[i] = true
continue
}
B[n] = B[i]
n++
}
B = B[:n]
pk.NbInfinityB = uint64(nbWires - n)
// compute our batch scalar multiplication with g1 elements
g1Scalars := make([]fr.Element, 0, (nbWires*3)+int(domain.Cardinality)+3)
g1Scalars = append(g1Scalars, toxicWaste.alpha, toxicWaste.beta, toxicWaste.delta)
g1Scalars = append(g1Scalars, A...)
g1Scalars = append(g1Scalars, B...)
g1Scalars = append(g1Scalars, Z...)
g1Scalars = append(g1Scalars, vkK...)
g1Scalars = append(g1Scalars, pkK...)
for i := range ckK {
g1Scalars = append(g1Scalars, ckK[i]...)
}
g1PointsAff := curve.BatchScalarMultiplicationG1(&g1, g1Scalars)
// sets pk: [α]₁, [β]₁, [δ]₁
pk.G1.Alpha = g1PointsAff[0]
pk.G1.Beta = g1PointsAff[1]
pk.G1.Delta = g1PointsAff[2]
offset := 3
pk.G1.A = g1PointsAff[offset : offset+len(A)]
offset += len(A)
pk.G1.B = g1PointsAff[offset : offset+len(B)]
offset += len(B)
bitReverse(g1PointsAff[offset : offset+int(domain.Cardinality)])
sizeZ := int(domain.Cardinality) - 1 // deg(H)=deg(A*B-C/X^n-1)=(n-1)+(n-1)-n=n-2
pk.G1.Z = g1PointsAff[offset : offset+sizeZ]
offset += int(domain.Cardinality)
vk.G1.K = g1PointsAff[offset : offset+nbPublicWires]
offset += nbPublicWires
pk.G1.K = g1PointsAff[offset : offset+nbPrivateWires]
offset += nbPrivateWires
// ---------------------------------------------------------------------------------------------
// Commitment setup
commitmentBases := make([][]curve.G1Affine, len(commitmentInfo))
for i := range commitmentBases {
size := len(ckK[i])
commitmentBases[i] = g1PointsAff[offset : offset+size]
offset += size
}
if offset != len(g1PointsAff) {
return errors.New("didn't consume all G1 points") // TODO @Tabaie Remove this
}
pk.CommitmentKeys, vk.CommitmentKey, err = pedersen.Setup(commitmentBases...)
if err != nil {
return err
}
vk.PublicAndCommitmentCommitted = commitmentInfo.GetPublicAndCommitmentCommitted(commitmentWires, r1cs.GetNbPublicVariables())
// ---------------------------------------------------------------------------------------------
// G2 scalars
// the G2 scalars are ordered as follow:
//
// [[B(i)], [β], [δ], [γ]]
// len(B) == nbWires
// compute our batch scalar multiplication with g2 elements
g2Scalars := append(B, toxicWaste.beta, toxicWaste.delta, toxicWaste.gamma)
g2PointsAff := curve.BatchScalarMultiplicationG2(&g2, g2Scalars)
pk.G2.B = g2PointsAff[:len(B)]
// sets pk: [β]₂, [δ]₂
pk.G2.Beta = g2PointsAff[len(B)+0]
pk.G2.Delta = g2PointsAff[len(B)+1]
// sets vk: [δ]₂, [γ]₂
vk.G2.Delta = g2PointsAff[len(B)+1]
vk.G2.Gamma = g2PointsAff[len(B)+2]
// ---------------------------------------------------------------------------------------------
// Pairing: vk.e
vk.G1.Alpha = pk.G1.Alpha
vk.G2.Beta = pk.G2.Beta
// unused, here for compatibility purposes
vk.G1.Beta = pk.G1.Beta
vk.G1.Delta = pk.G1.Delta
if err := vk.Precompute(); err != nil {
return err
}
// set domain
pk.Domain = *domain
return nil
}
// Precompute sets e, -[δ]₂, -[γ]₂
// This is meant to be called internally during setup or deserialization.
func (vk *VerifyingKey) Precompute() error {
var err error
vk.e, err = curve.Pair([]curve.G1Affine{vk.G1.Alpha}, []curve.G2Affine{vk.G2.Beta})
if err != nil {
return err
}
vk.G2.deltaNeg.Neg(&vk.G2.Delta)
vk.G2.gammaNeg.Neg(&vk.G2.Gamma)
return nil
}
func setupABC(r1cs *cs.R1CS, domain *fft.Domain, toxicWaste toxicWaste) (A []fr.Element, B []fr.Element, C []fr.Element) {
nbWires := r1cs.NbInternalVariables + r1cs.GetNbPublicVariables() + r1cs.GetNbSecretVariables()
A = make([]fr.Element, nbWires)
B = make([]fr.Element, nbWires)
C = make([]fr.Element, nbWires)
one := fr.One()
// first we compute [t-w^i] and its inverse
var w fr.Element
w.Set(&domain.Generator)
wi := fr.One()
t := make([]fr.Element, r1cs.GetNbConstraints()+1)
for i := 0; i < len(t); i++ {
t[i].Sub(&toxicWaste.t, &wi)
wi.Mul(&wi, &w) // TODO this is already pre computed in fft.Domain
}
tInv := fr.BatchInvert(t)
// evaluation of the i-th lagrange polynomial at t
var L fr.Element
// L = 1/n*(t^n-1)/(t-1), Li+1 = w*Li*(t-w^i)/(t-w^(i+1))
// Setting L0
L.Exp(toxicWaste.t, new(big.Int).SetUint64(uint64(domain.Cardinality))).
Sub(&L, &one)
L.Mul(&L, &tInv[0]).
Mul(&L, &domain.CardinalityInv)
accumulate := func(res *fr.Element, t constraint.Term, value *fr.Element) {
cID := t.CoeffID()
switch cID {
case constraint.CoeffIdZero:
return
case constraint.CoeffIdOne:
res.Add(res, value)
case constraint.CoeffIdMinusOne:
res.Sub(res, value)
case constraint.CoeffIdTwo:
var buffer fr.Element
buffer.Double(value)
res.Add(res, &buffer)
default:
var buffer fr.Element
buffer.Mul(&r1cs.Coefficients[cID], value)
res.Add(res, &buffer)
}
}
// each constraint is in the form
// L * R == O
// L, R and O being linear expressions
// for each term appearing in the linear expression,
// we compute term.Coefficient * L, and cumulate it in
// A, B or C at the index of the variable
j := 0
it := r1cs.GetR1CIterator()
for c := it.Next(); c != nil; c = it.Next() {
for _, t := range c.L {
accumulate(&A[t.WireID()], t, &L)
}
for _, t := range c.R {
accumulate(&B[t.WireID()], t, &L)
}
for _, t := range c.O {
accumulate(&C[t.WireID()], t, &L)
}
// Li+1 = w*Li*(t-w^i)/(t-w^(i+1))
L.Mul(&L, &w)
L.Mul(&L, &t[j])
L.Mul(&L, &tInv[j+1])
j++
}
return
}
// toxicWaste toxic waste
type toxicWaste struct {
// Montgomery form of params
t, alpha, beta, gamma, delta fr.Element
gammaInv, deltaInv fr.Element
}
func sampleToxicWaste() (toxicWaste, error) {
res := toxicWaste{}
for res.t.IsZero() {
if _, err := res.t.SetRandom(); err != nil {
return res, err
}
}
for res.alpha.IsZero() {
if _, err := res.alpha.SetRandom(); err != nil {
return res, err
}
}
for res.beta.IsZero() {
if _, err := res.beta.SetRandom(); err != nil {
return res, err
}
}
for res.gamma.IsZero() {
if _, err := res.gamma.SetRandom(); err != nil {
return res, err
}
}
for res.delta.IsZero() {
if _, err := res.delta.SetRandom(); err != nil {
return res, err
}
}
res.gammaInv.Inverse(&res.gamma)
res.deltaInv.Inverse(&res.delta)
return res, nil
}
// DummySetup fills a random ProvingKey
// used for test or benchmarking purposes
func DummySetup(r1cs *cs.R1CS, pk *ProvingKey) error {
// get R1CS nb constraints, wires and public/private inputs
nbWires := r1cs.NbInternalVariables + r1cs.GetNbPublicVariables() + r1cs.GetNbSecretVariables()
nbConstraints := r1cs.GetNbConstraints()
commitmentInfo := r1cs.CommitmentInfo.(constraint.Groth16Commitments)
privateCommitted := commitmentInfo.GetPrivateCommitted()
nbPrivateWires := r1cs.GetNbSecretVariables() + r1cs.NbInternalVariables - internal.NbElements(privateCommitted) - len(commitmentInfo)
// Setting group for fft
domain := fft.NewDomain(uint64(nbConstraints))
// count number of infinity points we would have had we a normal setup
// in pk.G1.A, pk.G1.B, and pk.G2.B
nbZeroesA, nbZeroesB := dummyInfinityCount(r1cs)
// initialize proving key
pk.G1.A = make([]curve.G1Affine, nbWires-nbZeroesA)
pk.G1.B = make([]curve.G1Affine, nbWires-nbZeroesB)
pk.G1.K = make([]curve.G1Affine, nbPrivateWires)
pk.G1.Z = make([]curve.G1Affine, domain.Cardinality-1)
pk.G2.B = make([]curve.G2Affine, nbWires-nbZeroesB)
// set infinity markers
pk.InfinityA = make([]bool, nbWires)
pk.InfinityB = make([]bool, nbWires)
pk.NbInfinityA = uint64(nbZeroesA)
pk.NbInfinityB = uint64(nbZeroesB)
for i := 0; i < nbZeroesA; i++ {
pk.InfinityA[i] = true
}
for i := 0; i < nbZeroesB; i++ {
pk.InfinityB[i] = true
}
// samples toxic waste
toxicWaste, err := sampleToxicWaste()
if err != nil {
return err
}
var r1Jac curve.G1Jac
var r1Aff curve.G1Affine
var b big.Int
g1, g2, _, _ := curve.Generators()
r1Jac.ScalarMultiplication(&g1, toxicWaste.alpha.BigInt(&b))
r1Aff.FromJacobian(&r1Jac)
var r2Jac curve.G2Jac
var r2Aff curve.G2Affine
r2Jac.ScalarMultiplication(&g2, &b)
r2Aff.FromJacobian(&r2Jac)
for i := 0; i < len(pk.G1.A); i++ {
pk.G1.A[i] = r1Aff
}
for i := 0; i < len(pk.G1.B); i++ {
pk.G1.B[i] = r1Aff
}
for i := 0; i < len(pk.G2.B); i++ {
pk.G2.B[i] = r2Aff
}
for i := 0; i < len(pk.G1.Z); i++ {
pk.G1.Z[i] = r1Aff
}
for i := 0; i < len(pk.G1.K); i++ {
pk.G1.K[i] = r1Aff
}
pk.G1.Alpha = r1Aff
pk.G1.Beta = r1Aff
pk.G1.Delta = r1Aff
pk.G2.Beta = r2Aff
pk.G2.Delta = r2Aff
pk.Domain = *domain
// ---------------------------------------------------------------------------------------------
// Commitment setup
commitmentBases := make([][]curve.G1Affine, len(commitmentInfo))
for i := range commitmentBases {
size := len(privateCommitted[i])
commitmentBases[i] = make([]curve.G1Affine, size)
for j := range commitmentBases[i] {
commitmentBases[i][j] = r1Aff
}
}
pk.CommitmentKeys, _, err = pedersen.Setup(commitmentBases...)
if err != nil {
return err
}
return nil
}
// dummyInfinityCount helps us simulate the number of infinity points we have with the given R1CS
// in A and B as it directly impacts prover performance
func dummyInfinityCount(r1cs *cs.R1CS) (nbZeroesA, nbZeroesB int) {
nbWires := r1cs.NbInternalVariables + r1cs.GetNbPublicVariables() + r1cs.GetNbSecretVariables()
A := make([]bool, nbWires)
B := make([]bool, nbWires)
it := r1cs.GetR1CIterator()
for c := it.Next(); c != nil; c = it.Next() {
for _, t := range c.L {
A[t.WireID()] = true
}
for _, t := range c.R {
B[t.WireID()] = true
}
}
for i := 0; i < nbWires; i++ {
if !A[i] {
nbZeroesA++
}
if !B[i] {
nbZeroesB++
}
}
return
}
// IsDifferent returns true if provided vk is different than self
// this is used by groth16.Assert to ensure random sampling
func (vk *VerifyingKey) IsDifferent(_other interface{}) bool {
vk2 := _other.(*VerifyingKey)
for i := 0; i < len(vk.G1.K); i++ {
if !vk.G1.K[i].IsInfinity() {
if vk.G1.K[i].Equal(&vk2.G1.K[i]) {
return false
}
}
}
return true
}
// IsDifferent returns true if provided pk is different than self
// this is used by groth16.Assert to ensure random sampling
func (pk *ProvingKey) IsDifferent(_other interface{}) bool {
pk2 := _other.(*ProvingKey)
if pk.G1.Alpha.Equal(&pk2.G1.Alpha) ||
pk.G1.Beta.Equal(&pk2.G1.Beta) ||
pk.G1.Delta.Equal(&pk2.G1.Delta) {
return false
}
for i := 0; i < len(pk.G1.K); i++ {
if !pk.G1.K[i].IsInfinity() {
if pk.G1.K[i].Equal(&pk2.G1.K[i]) {
return false
}
}
}
return true
}
// CurveID returns the curveID
func (pk *ProvingKey) CurveID() ecc.ID {
return curve.ID
}
// CurveID returns the curveID
func (vk *VerifyingKey) CurveID() ecc.ID {
return curve.ID
}
// NbPublicWitness returns the number of elements in the expected public witness
func (vk *VerifyingKey) NbPublicWitness() int {
return (len(vk.G1.K) - 1)
}
// NbG1 returns the number of G1 elements in the VerifyingKey
func (vk *VerifyingKey) NbG1() int {
return 3 + len(vk.G1.K)
}
// NbG2 returns the number of G2 elements in the VerifyingKey
func (vk *VerifyingKey) NbG2() int {
return 3
}
// NbG1 returns the number of G1 elements in the ProvingKey
func (pk *ProvingKey) NbG1() int {
return 3 + len(pk.G1.A) + len(pk.G1.B) + len(pk.G1.Z) + len(pk.G1.K)
}
// NbG2 returns the number of G2 elements in the ProvingKey
func (pk *ProvingKey) NbG2() int {
return 2 + len(pk.G2.B)
}
// bitReverse permutation as in fft.BitReverse , but with []curve.G1Affine
func bitReverse(a []curve.G1Affine) {
n := uint(len(a))
nn := uint(bits.UintSize - bits.TrailingZeros(n))
for i := uint(0); i < n; i++ {
irev := bits.Reverse(i) >> nn
if irev > i {
a[i], a[irev] = a[irev], a[i]
}
}
}