arnaucube/gnark-plonky2-verifier
1
0
Fork 0
mirror of https://github.com/arnaucube/gnark-plonky2-verifier.git synced 2026-01-12 00:51:33 +01:00
Code Issues Projects Releases Wiki Activity

Rename back

Browse Source
This commit is contained in:
Uma Roy
2023-10-11 11:37:45 -07:00
parent d8b919a403
commit 3b8611c6ac
16 changed files with 80 additions and 80 deletions
Download Patch File Download Diff File Expand all files Collapse all files

14
fri/fri.go
View File

@@ -33,7 +33,7 @@ func NewChip(
}
}
func (f *Chip) assertLeadingZeros(powWitness gl.GoldilocksVariable, friConfig types.FriConfig) {
func (f *Chip) assertLeadingZeros(powWitness gl.Variable, friConfig types.FriConfig) {
// Asserts that powWitness'es big-endian bit representation has at least `leading_zeros` leading zeros.
// Note that this is assuming that the Goldilocks field is being used. Specfically that the
// field is 64 bits long
@@ -58,7 +58,7 @@ func (f *Chip) fromOpeningsAndAlpha(
}
func (f *Chip) verifyMerkleProofToCapWithCapIndex(
leafData []gl.GoldilocksVariable,
leafData []gl.Variable,
leafIndexBits []frontend.Variable,
capIndexBits []frontend.Variable,
merkleCap types.FriMerkleCap,
@@ -139,7 +139,7 @@ func (f *Chip) assertNoncanonicalIndicesOK() {
func (f *Chip) expFromBitsConstBase(
base goldilocks.Element,
exponentBits []frontend.Variable,
) gl.GoldilocksVariable {
) gl.Variable {
product := gl.One()
for i, bit := range exponentBits {
// If the bit is on, we multiply product by base^pow.
@@ -167,7 +167,7 @@ func (f *Chip) expFromBitsConstBase(
func (f *Chip) calculateSubgroupX(
xIndexBits []frontend.Variable,
nLog uint64,
) gl.GoldilocksVariable {
) gl.Variable {
// Compute x from its index
// `subgroup_x` is `subgroup[x_index]`, i.e., the actual field element in the domain.
// TODO - Make these as global values
@@ -284,7 +284,7 @@ func (f *Chip) interpolate(
}
func (f *Chip) computeEvaluation(
x gl.GoldilocksVariable,
x gl.Variable,
xIndexWithinCosetBits []frontend.Variable,
arityBits uint64,
evals []gl.QuadraticExtensionVariable,
@@ -359,7 +359,7 @@ func (f *Chip) verifyQueryRound(
precomputedReducedEval []gl.QuadraticExtensionVariable,
initialMerkleCaps []types.FriMerkleCap,
proof *types.FriProof,
xIndex gl.GoldilocksVariable,
xIndex gl.Variable,
n uint64,
nLog uint64,
roundProof *types.FriQueryRound,
@@ -437,7 +437,7 @@ func (f *Chip) verifyQueryRound(
)
// Convert evals (array of QE) to fields by taking their 0th degree coefficients
fieldEvals := make([]gl.GoldilocksVariable, 0, 2*len(evals))
fieldEvals := make([]gl.Variable, 0, 2*len(evals))
for j := 0; j < len(evals); j++ {
fieldEvals = append(fieldEvals, evals[j][0])
fieldEvals = append(fieldEvals, evals[j][1])