From 0d65f77f0425440331f03ce9ea9e87a86934411a Mon Sep 17 00:00:00 2001 From: Gautam Botrel Date: Tue, 14 Jan 2025 12:25:04 -0600 Subject: [PATCH] fix: apply change to template --- ecc/bls12-377/fr/fft/domain.go | 8 ++++---- ecc/bls12-381/fr/fft/domain.go | 8 ++++---- ecc/bls24-315/fr/fft/domain.go | 8 ++++---- ecc/bls24-317/fr/fft/domain.go | 8 ++++---- ecc/bn254/fr/fft/domain.go | 4 ++-- ecc/bw6-633/fr/fft/domain.go | 8 ++++---- ecc/bw6-761/fr/fft/domain.go | 8 ++++---- field/babybear/fft/domain.go | 4 ++-- field/generator/internal/templates/fft/domain.go.tmpl | 8 ++++---- field/goldilocks/fft/domain.go | 4 ++-- field/koalabear/fft/domain.go | 4 ++-- 11 files changed, 36 insertions(+), 36 deletions(-) diff --git a/ecc/bls12-377/fr/fft/domain.go b/ecc/bls12-377/fr/fft/domain.go index 84be489163..1d44a171ac 100644 --- a/ecc/bls12-377/fr/fft/domain.go +++ b/ecc/bls12-377/fr/fft/domain.go @@ -45,10 +45,10 @@ type Domain struct { // we precompute these mostly to avoid the memory intensive bit reverse permutation in the groth16.Prover - // cosetTable u*<1,g,..,g^(n-1)> + // cosetTable <1, u, u², ..., uⁿ⁻¹> where u is the shifting element cosetTable []fr.Element - // cosetTable[i][j] = domain.Generator(i-th)SqrtInv ^ j + // cosetTableInv same as cosetTable but with u⁻¹ cosetTableInv []fr.Element } @@ -147,8 +147,8 @@ func (d *Domain) preComputeTwiddles() { var wg sync.WaitGroup - expTable := func(sqrt fr.Element, t []fr.Element) { - BuildExpTable(sqrt, t) + expTable := func(x fr.Element, t []fr.Element) { + BuildExpTable(x, t) wg.Done() } diff --git a/ecc/bls12-381/fr/fft/domain.go b/ecc/bls12-381/fr/fft/domain.go index c0f17725c6..03f1fbf491 100644 --- a/ecc/bls12-381/fr/fft/domain.go +++ b/ecc/bls12-381/fr/fft/domain.go @@ -45,10 +45,10 @@ type Domain struct { // we precompute these mostly to avoid the memory intensive bit reverse permutation in the groth16.Prover - // cosetTable u*<1,g,..,g^(n-1)> + // cosetTable <1, u, u², ..., uⁿ⁻¹> where u is the shifting element cosetTable []fr.Element - // cosetTable[i][j] = domain.Generator(i-th)SqrtInv ^ j + // cosetTableInv same as cosetTable but with u⁻¹ cosetTableInv []fr.Element } @@ -147,8 +147,8 @@ func (d *Domain) preComputeTwiddles() { var wg sync.WaitGroup - expTable := func(sqrt fr.Element, t []fr.Element) { - BuildExpTable(sqrt, t) + expTable := func(x fr.Element, t []fr.Element) { + BuildExpTable(x, t) wg.Done() } diff --git a/ecc/bls24-315/fr/fft/domain.go b/ecc/bls24-315/fr/fft/domain.go index 04094d7c75..1b8860e7d8 100644 --- a/ecc/bls24-315/fr/fft/domain.go +++ b/ecc/bls24-315/fr/fft/domain.go @@ -45,10 +45,10 @@ type Domain struct { // we precompute these mostly to avoid the memory intensive bit reverse permutation in the groth16.Prover - // cosetTable u*<1,g,..,g^(n-1)> + // cosetTable <1, u, u², ..., uⁿ⁻¹> where u is the shifting element cosetTable []fr.Element - // cosetTable[i][j] = domain.Generator(i-th)SqrtInv ^ j + // cosetTableInv same as cosetTable but with u⁻¹ cosetTableInv []fr.Element } @@ -147,8 +147,8 @@ func (d *Domain) preComputeTwiddles() { var wg sync.WaitGroup - expTable := func(sqrt fr.Element, t []fr.Element) { - BuildExpTable(sqrt, t) + expTable := func(x fr.Element, t []fr.Element) { + BuildExpTable(x, t) wg.Done() } diff --git a/ecc/bls24-317/fr/fft/domain.go b/ecc/bls24-317/fr/fft/domain.go index 82ec005569..c3745da086 100644 --- a/ecc/bls24-317/fr/fft/domain.go +++ b/ecc/bls24-317/fr/fft/domain.go @@ -45,10 +45,10 @@ type Domain struct { // we precompute these mostly to avoid the memory intensive bit reverse permutation in the groth16.Prover - // cosetTable u*<1,g,..,g^(n-1)> + // cosetTable <1, u, u², ..., uⁿ⁻¹> where u is the shifting element cosetTable []fr.Element - // cosetTable[i][j] = domain.Generator(i-th)SqrtInv ^ j + // cosetTableInv same as cosetTable but with u⁻¹ cosetTableInv []fr.Element } @@ -147,8 +147,8 @@ func (d *Domain) preComputeTwiddles() { var wg sync.WaitGroup - expTable := func(sqrt fr.Element, t []fr.Element) { - BuildExpTable(sqrt, t) + expTable := func(x fr.Element, t []fr.Element) { + BuildExpTable(x, t) wg.Done() } diff --git a/ecc/bn254/fr/fft/domain.go b/ecc/bn254/fr/fft/domain.go index a692030528..5c9d3e545c 100644 --- a/ecc/bn254/fr/fft/domain.go +++ b/ecc/bn254/fr/fft/domain.go @@ -45,10 +45,10 @@ type Domain struct { // we precompute these mostly to avoid the memory intensive bit reverse permutation in the groth16.Prover - // cosetTable <1,u,u**2,..,u**{n-1}> where u is the shifting element + // cosetTable <1, u, u², ..., uⁿ⁻¹> where u is the shifting element cosetTable []fr.Element - // cosetTableInv same as above but with u**-1 + // cosetTableInv same as cosetTable but with u⁻¹ cosetTableInv []fr.Element } diff --git a/ecc/bw6-633/fr/fft/domain.go b/ecc/bw6-633/fr/fft/domain.go index 40c0cc1e85..ab6cc41a90 100644 --- a/ecc/bw6-633/fr/fft/domain.go +++ b/ecc/bw6-633/fr/fft/domain.go @@ -45,10 +45,10 @@ type Domain struct { // we precompute these mostly to avoid the memory intensive bit reverse permutation in the groth16.Prover - // cosetTable u*<1,g,..,g^(n-1)> + // cosetTable <1, u, u², ..., uⁿ⁻¹> where u is the shifting element cosetTable []fr.Element - // cosetTable[i][j] = domain.Generator(i-th)SqrtInv ^ j + // cosetTableInv same as cosetTable but with u⁻¹ cosetTableInv []fr.Element } @@ -147,8 +147,8 @@ func (d *Domain) preComputeTwiddles() { var wg sync.WaitGroup - expTable := func(sqrt fr.Element, t []fr.Element) { - BuildExpTable(sqrt, t) + expTable := func(x fr.Element, t []fr.Element) { + BuildExpTable(x, t) wg.Done() } diff --git a/ecc/bw6-761/fr/fft/domain.go b/ecc/bw6-761/fr/fft/domain.go index c9c1c217ef..079b9ada80 100644 --- a/ecc/bw6-761/fr/fft/domain.go +++ b/ecc/bw6-761/fr/fft/domain.go @@ -45,10 +45,10 @@ type Domain struct { // we precompute these mostly to avoid the memory intensive bit reverse permutation in the groth16.Prover - // cosetTable u*<1,g,..,g^(n-1)> + // cosetTable <1, u, u², ..., uⁿ⁻¹> where u is the shifting element cosetTable []fr.Element - // cosetTable[i][j] = domain.Generator(i-th)SqrtInv ^ j + // cosetTableInv same as cosetTable but with u⁻¹ cosetTableInv []fr.Element } @@ -147,8 +147,8 @@ func (d *Domain) preComputeTwiddles() { var wg sync.WaitGroup - expTable := func(sqrt fr.Element, t []fr.Element) { - BuildExpTable(sqrt, t) + expTable := func(x fr.Element, t []fr.Element) { + BuildExpTable(x, t) wg.Done() } diff --git a/field/babybear/fft/domain.go b/field/babybear/fft/domain.go index b2ce700764..49a6ab8afb 100644 --- a/field/babybear/fft/domain.go +++ b/field/babybear/fft/domain.go @@ -45,10 +45,10 @@ type Domain struct { // we precompute these mostly to avoid the memory intensive bit reverse permutation in the groth16.Prover - // cosetTable <1,u,u**2,..,u**{n-1}> where u is the shifting element + // cosetTable <1, u, u², ..., uⁿ⁻¹> where u is the shifting element cosetTable []babybear.Element - // cosetTableInv same as above but with u**-1 + // cosetTableInv same as cosetTable but with u⁻¹ cosetTableInv []babybear.Element } diff --git a/field/generator/internal/templates/fft/domain.go.tmpl b/field/generator/internal/templates/fft/domain.go.tmpl index fd54a6f49d..7e1d2e0827 100644 --- a/field/generator/internal/templates/fft/domain.go.tmpl +++ b/field/generator/internal/templates/fft/domain.go.tmpl @@ -38,10 +38,10 @@ type Domain struct { // we precompute these mostly to avoid the memory intensive bit reverse permutation in the groth16.Prover - // cosetTable u*<1,g,..,g^(n-1)> + // cosetTable <1, u, u², ..., uⁿ⁻¹> where u is the shifting element cosetTable []{{ .FF }}.Element - // cosetTable[i][j] = domain.Generator(i-th)SqrtInv ^ j + // cosetTableInv same as cosetTable but with u⁻¹ cosetTableInv []{{ .FF }}.Element } @@ -142,8 +142,8 @@ func (d *Domain) preComputeTwiddles() { var wg sync.WaitGroup - expTable := func(sqrt {{ .FF }}.Element, t []{{ .FF }}.Element) { - BuildExpTable(sqrt, t) + expTable := func(x {{ .FF }}.Element, t []{{ .FF }}.Element) { + BuildExpTable(x, t) wg.Done() } diff --git a/field/goldilocks/fft/domain.go b/field/goldilocks/fft/domain.go index b1c97ada20..80e9902fe2 100644 --- a/field/goldilocks/fft/domain.go +++ b/field/goldilocks/fft/domain.go @@ -45,10 +45,10 @@ type Domain struct { // we precompute these mostly to avoid the memory intensive bit reverse permutation in the groth16.Prover - // cosetTable <1,u,u**2,..,u**{n-1}> where u is the shifting element + // cosetTable <1, u, u², ..., uⁿ⁻¹> where u is the shifting element cosetTable []goldilocks.Element - // cosetTableInv same as above but with u**-1 + // cosetTableInv same as cosetTable but with u⁻¹ cosetTableInv []goldilocks.Element } diff --git a/field/koalabear/fft/domain.go b/field/koalabear/fft/domain.go index 29f55879f3..6037f1d6c6 100644 --- a/field/koalabear/fft/domain.go +++ b/field/koalabear/fft/domain.go @@ -45,10 +45,10 @@ type Domain struct { // we precompute these mostly to avoid the memory intensive bit reverse permutation in the groth16.Prover - // cosetTable <1,u,u**2,..,u**{n-1}> where u is the shifting element + // cosetTable <1, u, u², ..., uⁿ⁻¹> where u is the shifting element cosetTable []koalabear.Element - // cosetTableInv same as above but with u**-1 + // cosetTableInv same as cosetTable but with u⁻¹ cosetTableInv []koalabear.Element }