1package plonky2_verifier
  2
  3import (
  4	. "gnark-plonky2-verifier/field"
  5
  6	"github.com/consensys/gnark/frontend"
  7)
  8
  9type PlonkOracle struct {
 10	index    uint64
 11	blinding bool
 12}
 13
 14var CONSTANTS_SIGMAS = PlonkOracle{
 15	index:    0,
 16	blinding: false,
 17}
 18
 19var WIRES = PlonkOracle{
 20	index:    1,
 21	blinding: true,
 22}
 23
 24var ZS_PARTIAL_PRODUCTS = PlonkOracle{
 25	index:    2,
 26	blinding: true,
 27}
 28
 29var QUOTIENT = PlonkOracle{
 30	index:    3,
 31	blinding: true,
 32}
 33
 34type PlonkChip struct {
 35	api   frontend.API           `gnark:"-"`
 36	qeAPI *QuadraticExtensionAPI `gnark:"-"`
 37
 38	commonData CommonCircuitData `gnark:"-"`
 39
 40	DEGREE        F                  `gnark:"-"`
 41	DEGREE_BITS_F F                  `gnark:"-"`
 42	DEGREE_QE     QuadraticExtension `gnark:"-"`
 43}
 44
 45func NewPlonkChip(api frontend.API, qeAPI *QuadraticExtensionAPI, commonData CommonCircuitData) *PlonkChip {
 46	// TODO:  Should degreeBits be verified that it fits within the field and that degree is within uint64?
 47
 48	return &PlonkChip{
 49		api:   api,
 50		qeAPI: qeAPI,
 51
 52		commonData: commonData,
 53
 54		DEGREE:        NewFieldElement(1 << commonData.DegreeBits),
 55		DEGREE_BITS_F: NewFieldElement(commonData.DegreeBits),
 56		DEGREE_QE:     QuadraticExtension{NewFieldElement(1 << commonData.DegreeBits), ZERO_F},
 57	}
 58}
 59
 60func (p *PlonkChip) expPowerOf2Extension(x QuadraticExtension) QuadraticExtension {
 61	for i := uint64(0); i < p.commonData.DegreeBits; i++ {
 62		x = p.qeAPI.SquareExtension(x)
 63	}
 64
 65	return x
 66}
 67
 68func (p *PlonkChip) evalL0(x QuadraticExtension, xPowN QuadraticExtension) QuadraticExtension {
 69	// L_0(x) = (x^n - 1) / (n * (x - 1))
 70	evalZeroPoly := p.qeAPI.SubExtension(
 71		xPowN,
 72		p.qeAPI.ONE_QE,
 73	)
 74	denominator := p.qeAPI.SubExtension(
 75		p.qeAPI.ScalarMulExtension(x, p.DEGREE),
 76		p.DEGREE_QE,
 77	)
 78	return p.qeAPI.DivExtension(
 79		evalZeroPoly,
 80		denominator,
 81	)
 82}
 83
 84func (p *PlonkChip) checkPartialProducts(
 85	numerators []QuadraticExtension,
 86	denominators []QuadraticExtension,
 87	challengeNum uint64,
 88	openings OpeningSet,
 89) []QuadraticExtension {
 90	numPartProds := p.commonData.NumPartialProducts
 91	quotDegreeFactor := p.commonData.QuotientDegreeFactor
 92
 93	productAccs := make([]QuadraticExtension, 0, numPartProds+2)
 94	productAccs = append(productAccs, openings.PlonkZs[challengeNum])
 95	productAccs = append(productAccs, openings.PartialProducts[challengeNum*numPartProds:(challengeNum+1)*numPartProds]...)
 96	productAccs = append(productAccs, openings.PlonkZsNext[challengeNum])
 97
 98	partialProductChecks := make([]QuadraticExtension, 0, numPartProds)
 99
100	for i := uint64(0); i <= numPartProds; i += 1 {
101		ppStartIdx := i * quotDegreeFactor
102		numeProduct := numerators[ppStartIdx]
103		denoProduct := denominators[ppStartIdx]
104		for j := uint64(1); j < quotDegreeFactor; j++ {
105			numeProduct = p.qeAPI.MulExtension(numeProduct, numerators[ppStartIdx+j])
106			denoProduct = p.qeAPI.MulExtension(denoProduct, denominators[ppStartIdx+j])
107		}
108
109		partialProductCheck := p.qeAPI.SubExtension(
110			p.qeAPI.MulExtension(productAccs[i], numeProduct),
111			p.qeAPI.MulExtension(productAccs[i+1], denoProduct),
112		)
113
114		partialProductChecks = append(partialProductChecks, partialProductCheck)
115	}
116	return partialProductChecks
117}
118
119func (p *PlonkChip) evaluateGateConstraints(vars EvaluationVars) []QuadraticExtension {
120	constraints := make([]QuadraticExtension, p.commonData.NumGateConstraints)
121
122	for i, gate := range p.commonData.Gates {
123		selectorIndex := p.commonData.SelectorsInfo.selectorIndices[i]
124
125		gateConstraints := p.evalFiltered(
126			gate,
127			vars,
128			uint64(i),
129			selectorIndex,
130			p.commonData.SelectorsInfo.groups[selectorIndex],
131			p.commonData.SelectorsInfo.NumSelectors(),
132		)
133
134		for i, constraint := range gateConstraints {
135			if uint64(i) >= p.commonData.NumGateConstraints {
136				panic("num_constraints() gave too low of a number")
137			}
138			constraints[i] = p.qeAPI.AddExtension(constraints[i], constraint)
139		}
140	}
141
142	return constraints
143}
144
145func (p *PlonkChip) evalVanishingPoly(vars EvaluationVars, proofChallenges ProofChallenges, openings OpeningSet, zetaPowN QuadraticExtension) []QuadraticExtension {
146	constraintTerms := p.evaluateGateConstraints(vars)
147
148	// Calculate the k[i] * x
149	sIDs := make([]QuadraticExtension, p.commonData.Config.NumRoutedWires)
150
151	for i := uint64(0); i < p.commonData.Config.NumRoutedWires; i++ {
152		sIDs[i] = p.qeAPI.ScalarMulExtension(proofChallenges.PlonkZeta, p.commonData.KIs[i])
153	}
154
155	// Calculate L_0(zeta)
156	l0Zeta := p.evalL0(proofChallenges.PlonkZeta, zetaPowN)
157
158	vanishingZ1Terms := make([]QuadraticExtension, 0, p.commonData.Config.NumChallenges)
159	vanishingPartialProductsTerms := make([]QuadraticExtension, 0, p.commonData.Config.NumChallenges*p.commonData.NumPartialProducts)
160	for i := uint64(0); i < p.commonData.Config.NumChallenges; i++ {
161		// L_0(zeta) (Z(zeta) - 1) = 0
162		z1_term := p.qeAPI.MulExtension(
163			l0Zeta,
164			p.qeAPI.SubExtension(openings.PlonkZs[i], p.qeAPI.ONE_QE))
165		vanishingZ1Terms = append(vanishingZ1Terms, z1_term)
166
167		numeratorValues := make([]QuadraticExtension, 0, p.commonData.Config.NumRoutedWires)
168		denominatorValues := make([]QuadraticExtension, 0, p.commonData.Config.NumRoutedWires)
169		for j := uint64(0); j < p.commonData.Config.NumRoutedWires; j++ {
170			// The numerator is `beta * s_id + wire_value + gamma`, and the denominator is
171			// `beta * s_sigma + wire_value + gamma`.
172			wireValuePlusGamma := p.qeAPI.AddExtension(
173				openings.Wires[j],
174				p.qeAPI.FieldToQE(proofChallenges.PlonkGammas[i]),
175			)
176
177			numerator := p.qeAPI.AddExtension(
178				p.qeAPI.MulExtension(
179					p.qeAPI.FieldToQE(proofChallenges.PlonkBetas[i]),
180					sIDs[j],
181				),
182				wireValuePlusGamma,
183			)
184
185			denominator := p.qeAPI.AddExtension(
186				p.qeAPI.MulExtension(
187					p.qeAPI.FieldToQE(proofChallenges.PlonkBetas[i]),
188					openings.PlonkSigmas[j],
189				),
190				wireValuePlusGamma,
191			)
192
193			numeratorValues = append(numeratorValues, numerator)
194			denominatorValues = append(denominatorValues, denominator)
195		}
196
197		vanishingPartialProductsTerms = append(
198			vanishingPartialProductsTerms,
199			p.checkPartialProducts(numeratorValues, denominatorValues, i, openings)...,
200		)
201	}
202
203	vanishingTerms := append(vanishingZ1Terms, vanishingPartialProductsTerms...)
204	vanishingTerms = append(vanishingTerms, constraintTerms...)
205
206	reducedValues := make([]QuadraticExtension, p.commonData.Config.NumChallenges)
207	for i := uint64(0); i < p.commonData.Config.NumChallenges; i++ {
208		reducedValues[i] = p.qeAPI.ZERO_QE
209	}
210
211	// reverse iterate the vanishingPartialProductsTerms array
212	for i := len(vanishingTerms) - 1; i >= 0; i-- {
213		for j := uint64(0); j < p.commonData.Config.NumChallenges; j++ {
214			reducedValues[j] = p.qeAPI.AddExtension(
215				vanishingTerms[i],
216				p.qeAPI.ScalarMulExtension(
217					reducedValues[j],
218					proofChallenges.PlonkAlphas[j],
219				),
220			)
221		}
222	}
223
224	return reducedValues
225}
226
227func (p *PlonkChip) Verify(proofChallenges ProofChallenges, openings OpeningSet, publicInputsHash Hash) {
228	// Calculate zeta^n
229	zetaPowN := p.expPowerOf2Extension(proofChallenges.PlonkZeta)
230
231	localConstants := openings.Constants
232	localWires := openings.Wires
233	vars := EvaluationVars{
234		localConstants,
235		localWires,
236		publicInputsHash,
237	}
238
239	vanishingPolysZeta := p.evalVanishingPoly(vars, proofChallenges, openings, zetaPowN)
240
241	// Calculate Z(H)
242	zHZeta := p.qeAPI.SubExtension(zetaPowN, p.qeAPI.ONE_QE)
243
244	// `quotient_polys_zeta` holds `num_challenges * quotient_degree_factor` evaluations.
245	// Each chunk of `quotient_degree_factor` holds the evaluations of `t_0(zeta),...,t_{quotient_degree_factor-1}(zeta)`
246	// where the "real" quotient polynomial is `t(X) = t_0(X) + t_1(X)*X^n + t_2(X)*X^{2n} + ...`.
247	// So to reconstruct `t(zeta)` we can compute `reduce_with_powers(chunk, zeta^n)` for each
248	// `quotient_degree_factor`-sized chunk of the original evaluations.
249	for i := 0; i < len(vanishingPolysZeta); i++ {
250		quotientPolysStartIdx := i * int(p.commonData.QuotientDegreeFactor)
251		quotientPolysEndIdx := quotientPolysStartIdx + int(p.commonData.QuotientDegreeFactor)
252		prod := p.qeAPI.MulExtension(
253			zHZeta,
254			p.qeAPI.ReduceWithPowers(
255				openings.QuotientPolys[quotientPolysStartIdx:quotientPolysEndIdx],
256				zetaPowN,
257			),
258		)
259
260		p.qeAPI.AssertIsEqual(vanishingPolysZeta[i], prod)
261	}
262}