diff --git a/README.md b/README.md index facf211..f54eb57 100644 --- a/README.md +++ b/README.md @@ -163,6 +163,23 @@ prf, err := loom.Prove(statement, witness) err = loom.Verify(statement, prf) ``` +## Recursion + +`recursion/` provides a first Loom-native recursive wrapper: + +- `recursion.ProveNextLayer` checks one Loom proof and proves the verifier's algebraic core with Loom. +- `recursion.ProveAggregationLayer` folds two Loom proofs into one wrapper proof. + +Examples: + +```sh +go run ./examples/circuit_recursion +go run ./examples/aggregation +``` + +Current recursion is specialized to a concrete inner proof and arithmetizes the verifier core: public inputs, exposed values, Lagrange values, logup bus checks, AIR quotient identities, the DEEP-quotient-to-FRI bridge, FRI folding arithmetic, Poseidon2 transcript reconstruction, and Poseidon2 Merkle authentication for point sampling and FRI paths. + + ## Development ```sh diff --git a/board/board.go b/board/board.go index 1dcc688..c78d81b 100644 --- a/board/board.go +++ b/board/board.go @@ -199,7 +199,7 @@ func (b *Builder) addExposeRelativeIthValuePublicConstraint(module string, E exp // AddExposeIthValueStep adds a constraint Lagrange_pos * (expr - expr[pos]), and stores expr[pos] in the proof so the verifier has access to it // the 1 entry column expr[pos] is registered in the trace func (b *Builder) AddExposeIthValueStep(module string, E expr.Expr, out string, pos int) { - ctx := ExposeIthValueCtx{Pos: pos} + ctx := ExposeIthValueCtx{Module: module, Pos: pos} pvStep := ProverStep{ Ctx: ctx, Ins: []expr.Expr{E}, diff --git a/examples/aggregation/main.go b/examples/aggregation/main.go new file mode 100644 index 0000000..450d303 --- /dev/null +++ b/examples/aggregation/main.go @@ -0,0 +1,77 @@ +// Copyright 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. +// +// SPDX-License-Identifier: Apache-2.0 + +package main + +import ( + "fmt" + "log" + + "github.com/consensys/gnark-crypto/field/koalabear" + "github.com/consensys/loom/board" + "github.com/consensys/loom/expr" + "github.com/consensys/loom/prover" + "github.com/consensys/loom/recursion" + "github.com/consensys/loom/setup" + "github.com/consensys/loom/trace" + "github.com/consensys/loom/verifier" +) + +func main() { + left := proveFibonacci(4) + right := proveFibonacci(8) + + aggregated, err := recursion.ProveAggregationLayer( + recursion.AggregationInput{Left: left, Right: right}, + recursion.UsePoseidon2(), + ) + if err != nil { + log.Fatal(err) + } + if err := recursion.VerifyOutput(aggregated); err != nil { + log.Fatal(err) + } + + fmt.Printf("aggregated commitments=%d\n", len(aggregated.Proof.Commitments)) +} + +func proveFibonacci(n int) recursion.RecursionInput { + program, tr := fibonacciInstance(n) + prf, err := prover.Prove(tr, setup.ProvingKey{}, nil, program) + if err != nil { + log.Fatal(err) + } + if err := verifier.Verify(nil, setup.VerificationKey{}, program, prf); err != nil { + log.Fatal(err) + } + return recursion.RecursionInput{Program: program, Proof: prf} +} + +func fibonacciInstance(n int) (board.Program, trace.Trace) { + builder := board.NewBuilder() + module := board.NewModule("fibonacci") + module.N = n + module.AssertZeroExceptAt(expr.Rot("A", 1).Sub(expr.Col("B")), n-1) + module.AssertZeroExceptAt(expr.Rot("B", 1).Sub(expr.Col("C")), n-1) + module.AssertZero(expr.Col("C").Sub(expr.Col("A")).Sub(expr.Col("B"))) + builder.AddModule(module) + + program, err := board.Compile(&builder) + if err != nil { + log.Fatal(err) + } + + var a, b koalabear.Element + b.SetOne() + return program, prover.TraceFibonacci(n, a, b) +} diff --git a/examples/circuit_recursion/main.go b/examples/circuit_recursion/main.go new file mode 100644 index 0000000..fb125eb --- /dev/null +++ b/examples/circuit_recursion/main.go @@ -0,0 +1,72 @@ +// Copyright 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. +// +// SPDX-License-Identifier: Apache-2.0 + +package main + +import ( + "fmt" + "log" + + "github.com/consensys/gnark-crypto/field/koalabear" + "github.com/consensys/loom/board" + "github.com/consensys/loom/expr" + "github.com/consensys/loom/prover" + "github.com/consensys/loom/recursion" + "github.com/consensys/loom/setup" + "github.com/consensys/loom/trace" + "github.com/consensys/loom/verifier" +) + +func main() { + program, tr := fibonacciInstance(16) + + baseProof, err := prover.Prove(tr, setup.ProvingKey{}, nil, program) + if err != nil { + log.Fatal(err) + } + if err := verifier.Verify(nil, setup.VerificationKey{}, program, baseProof); err != nil { + log.Fatal(err) + } + + next, err := recursion.ProveNextLayer( + recursion.RecursionInput{Program: program, Proof: baseProof}, + recursion.UsePoseidon2(), + ) + if err != nil { + log.Fatal(err) + } + if err := recursion.VerifyOutput(next); err != nil { + log.Fatal(err) + } + + fmt.Printf("base commitments=%d recursive commitments=%d\n", len(baseProof.Commitments), len(next.Proof.Commitments)) +} + +func fibonacciInstance(n int) (board.Program, trace.Trace) { + builder := board.NewBuilder() + module := board.NewModule("fibonacci") + module.N = n + module.AssertZeroExceptAt(expr.Rot("A", 1).Sub(expr.Col("B")), n-1) + module.AssertZeroExceptAt(expr.Rot("B", 1).Sub(expr.Col("C")), n-1) + module.AssertZero(expr.Col("C").Sub(expr.Col("A")).Sub(expr.Col("B"))) + builder.AddModule(module) + + program, err := board.Compile(&builder) + if err != nil { + log.Fatal(err) + } + + var a, b koalabear.Element + b.SetOne() + return program, prover.TraceFibonacci(n, a, b) +} diff --git a/go.mod b/go.mod index 06165c7..e3afdc3 100644 --- a/go.mod +++ b/go.mod @@ -2,25 +2,24 @@ module github.com/consensys/loom go 1.25.7 -require github.com/consensys/gnark-crypto v0.20.1 +require ( + github.com/consensys/gnark v0.14.1-0.20260224185952-e002a37bb76c + github.com/consensys/gnark-crypto v0.20.2-0.20260518201312-fa008e990155 + github.com/consensys/go-corset v1.2.16 +) require ( github.com/bits-and-blooms/bitset v1.24.4 // indirect github.com/blang/semver/v4 v4.0.0 // indirect - github.com/consensys/gnark v0.14.1-0.20260224185952-e002a37bb76c // indirect - github.com/consensys/go-corset v1.2.16 // indirect github.com/fxamacker/cbor/v2 v2.9.0 // indirect github.com/google/pprof v0.0.0-20260202012954-cb029daf43ef // indirect - github.com/leanovate/gopter v0.2.11 // indirect github.com/mattn/go-colorable v0.1.14 // indirect github.com/mattn/go-isatty v0.0.20 // indirect - github.com/mmcloughlin/mathfmt v0.0.0-20240209192118-76b0fc98f057 // indirect github.com/ronanh/intcomp v1.1.1 // indirect github.com/rs/zerolog v1.34.0 // indirect github.com/sirupsen/logrus v1.9.4 // indirect github.com/x448/float16 v0.8.4 // indirect golang.org/x/crypto v0.48.0 // indirect - golang.org/x/sync v0.19.0 // indirect + golang.org/x/sync v0.20.0 // indirect golang.org/x/sys v0.43.0 // indirect - golang.org/x/tools v0.42.0 // indirect ) diff --git a/go.sum b/go.sum index 1bc1607..73a3d8a 100644 --- a/go.sum +++ b/go.sum @@ -1,664 +1,54 @@ -cloud.google.com/go v0.26.0/go.mod h1:aQUYkXzVsufM+DwF1aE+0xfcU+56JwCaLick0ClmMTw= -cloud.google.com/go v0.34.0/go.mod h1:aQUYkXzVsufM+DwF1aE+0xfcU+56JwCaLick0ClmMTw= -cloud.google.com/go v0.38.0/go.mod h1:990N+gfupTy94rShfmMCWGDn0LpTmnzTp2qbd1dvSRU= -cloud.google.com/go v0.44.1/go.mod h1:iSa0KzasP4Uvy3f1mN/7PiObzGgflwredwwASm/v6AU= -cloud.google.com/go v0.44.2/go.mod h1:60680Gw3Yr4ikxnPRS/oxxkBccT6SA1yMk63TGekxKY= -cloud.google.com/go v0.45.1/go.mod h1:RpBamKRgapWJb87xiFSdk4g1CME7QZg3uwTez+TSTjc= -cloud.google.com/go v0.46.3/go.mod h1:a6bKKbmY7er1mI7TEI4lsAkts/mkhTSZK8w33B4RAg0= -cloud.google.com/go v0.50.0/go.mod h1:r9sluTvynVuxRIOHXQEHMFffphuXHOMZMycpNR5e6To= -cloud.google.com/go v0.52.0/go.mod h1:pXajvRH/6o3+F9jDHZWQ5PbGhn+o8w9qiu/CffaVdO4= -cloud.google.com/go v0.53.0/go.mod h1:fp/UouUEsRkN6ryDKNW/Upv/JBKnv6WDthjR6+vze6M= -cloud.google.com/go v0.54.0/go.mod h1:1rq2OEkV3YMf6n/9ZvGWI3GWw0VoqH/1x2nd8Is/bPc= -cloud.google.com/go v0.56.0/go.mod h1:jr7tqZxxKOVYizybht9+26Z/gUq7tiRzu+ACVAMbKVk= -cloud.google.com/go v0.57.0/go.mod h1:oXiQ6Rzq3RAkkY7N6t3TcE6jE+CIBBbA36lwQ1JyzZs= -cloud.google.com/go v0.62.0/go.mod h1:jmCYTdRCQuc1PHIIJ/maLInMho30T/Y0M4hTdTShOYc= -cloud.google.com/go v0.65.0/go.mod h1:O5N8zS7uWy9vkA9vayVHs65eM1ubvY4h553ofrNHObY= -cloud.google.com/go v0.72.0/go.mod h1:M+5Vjvlc2wnp6tjzE102Dw08nGShTscUx2nZMufOKPI= -cloud.google.com/go v0.74.0/go.mod h1:VV1xSbzvo+9QJOxLDaJfTjx5e+MePCpCWwvftOeQmWk= -cloud.google.com/go v0.78.0/go.mod h1:QjdrLG0uq+YwhjoVOLsS1t7TW8fs36kLs4XO5R5ECHg= -cloud.google.com/go v0.79.0/go.mod h1:3bzgcEeQlzbuEAYu4mrWhKqWjmpprinYgKJLgKHnbb8= -cloud.google.com/go v0.81.0/go.mod h1:mk/AM35KwGk/Nm2YSeZbxXdrNK3KZOYHmLkOqC2V6E0= -cloud.google.com/go/bigquery v1.0.1/go.mod h1:i/xbL2UlR5RvWAURpBYZTtm/cXjCha9lbfbpx4poX+o= -cloud.google.com/go/bigquery v1.3.0/go.mod h1:PjpwJnslEMmckchkHFfq+HTD2DmtT67aNFKH1/VBDHE= -cloud.google.com/go/bigquery v1.4.0/go.mod h1:S8dzgnTigyfTmLBfrtrhyYhwRxG72rYxvftPBK2Dvzc= -cloud.google.com/go/bigquery v1.5.0/go.mod h1:snEHRnqQbz117VIFhE8bmtwIDY80NLUZUMb4Nv6dBIg= -cloud.google.com/go/bigquery v1.7.0/go.mod h1://okPTzCYNXSlb24MZs83e2Do+h+VXtc4gLoIoXIAPc= -cloud.google.com/go/bigquery v1.8.0/go.mod h1:J5hqkt3O0uAFnINi6JXValWIb1v0goeZM77hZzJN/fQ= -cloud.google.com/go/datastore v1.0.0/go.mod h1:LXYbyblFSglQ5pkeyhO+Qmw7ukd3C+pD7TKLgZqpHYE= -cloud.google.com/go/datastore v1.1.0/go.mod h1:umbIZjpQpHh4hmRpGhH4tLFup+FVzqBi1b3c64qFpCk= -cloud.google.com/go/firestore v1.1.0/go.mod h1:ulACoGHTpvq5r8rxGJ4ddJZBZqakUQqClKRT5SZwBmk= -cloud.google.com/go/pubsub v1.0.1/go.mod h1:R0Gpsv3s54REJCy4fxDixWD93lHJMoZTyQ2kNxGRt3I= -cloud.google.com/go/pubsub v1.1.0/go.mod h1:EwwdRX2sKPjnvnqCa270oGRyludottCI76h+R3AArQw= -cloud.google.com/go/pubsub v1.2.0/go.mod h1:jhfEVHT8odbXTkndysNHCcx0awwzvfOlguIAii9o8iA= -cloud.google.com/go/pubsub v1.3.1/go.mod h1:i+ucay31+CNRpDW4Lu78I4xXG+O1r/MAHgjpRVR+TSU= -cloud.google.com/go/storage v1.0.0/go.mod h1:IhtSnM/ZTZV8YYJWCY8RULGVqBDmpoyjwiyrjsg+URw= -cloud.google.com/go/storage v1.5.0/go.mod h1:tpKbwo567HUNpVclU5sGELwQWBDZ8gh0ZeosJ0Rtdos= -cloud.google.com/go/storage v1.6.0/go.mod h1:N7U0C8pVQ/+NIKOBQyamJIeKQKkZ+mxpohlUTyfDhBk= -cloud.google.com/go/storage v1.8.0/go.mod h1:Wv1Oy7z6Yz3DshWRJFhqM/UCfaWIRTdp0RXyy7KQOVs= -cloud.google.com/go/storage v1.10.0/go.mod h1:FLPqc6j+Ki4BU591ie1oL6qBQGu2Bl/tZ9ullr3+Kg0= -dmitri.shuralyov.com/gpu/mtl v0.0.0-20190408044501-666a987793e9/go.mod h1:H6x//7gZCb22OMCxBHrMx7a5I7Hp++hsVxbQ4BYO7hU= -github.com/BurntSushi/toml v0.3.1/go.mod h1:xHWCNGjB5oqiDr8zfno3MHue2Ht5sIBksp03qcyfWMU= -github.com/BurntSushi/xgb v0.0.0-20160522181843-27f122750802/go.mod h1:IVnqGOEym/WlBOVXweHU+Q+/VP0lqqI8lqeDx9IjBqo= -github.com/antihax/optional v1.0.0/go.mod h1:uupD/76wgC+ih3iEmQUL+0Ugr19nfwCT1kdvxnR2qWY= -github.com/armon/circbuf v0.0.0-20150827004946-bbbad097214e/go.mod h1:3U/XgcO3hCbHZ8TKRvWD2dDTCfh9M9ya+I9JpbB7O8o= -github.com/armon/go-metrics v0.0.0-20180917152333-f0300d1749da/go.mod h1:Q73ZrmVTwzkszR9V5SSuryQ31EELlFMUz1kKyl939pY= -github.com/armon/go-radix v0.0.0-20180808171621-7fddfc383310/go.mod h1:ufUuZ+zHj4x4TnLV4JWEpy2hxWSpsRywHrMgIH9cCH8= -github.com/bgentry/speakeasy v0.1.0/go.mod h1:+zsyZBPWlz7T6j88CTgSN5bM796AkVf0kBD4zp0CCIs= github.com/bits-and-blooms/bitset v1.24.4 h1:95H15Og1clikBrKr/DuzMXkQzECs1M6hhoGXLwLQOZE= github.com/bits-and-blooms/bitset v1.24.4/go.mod h1:7hO7Gc7Pp1vODcmWvKMRA9BNmbv6a/7QIWpPxHddWR8= -github.com/bketelsen/crypt v0.0.4/go.mod h1:aI6NrJ0pMGgvZKL1iVgXLnfIFJtfV+bKCoqOes/6LfM= github.com/blang/semver/v4 v4.0.0 h1:1PFHFE6yCCTv8C1TeyNNarDzntLi7wMI5i/pzqYIsAM= github.com/blang/semver/v4 v4.0.0/go.mod h1:IbckMUScFkM3pff0VJDNKRiT6TG/YpiHIM2yvyW5YoQ= -github.com/census-instrumentation/opencensus-proto v0.2.1/go.mod h1:f6KPmirojxKA12rnyqOA5BBL4O983OfeGPqjHWSTneU= -github.com/chzyer/logex v1.1.10/go.mod h1:+Ywpsq7O8HXn0nuIou7OrIPyXbp3wmkHB+jjWRnGsAI= -github.com/chzyer/readline v0.0.0-20180603132655-2972be24d48e/go.mod h1:nSuG5e5PlCu98SY8svDHJxuZscDgtXS6KTTbou5AhLI= -github.com/chzyer/test v0.0.0-20180213035817-a1ea475d72b1/go.mod h1:Q3SI9o4m/ZMnBNeIyt5eFwwo7qiLfzFZmjNmxjkiQlU= -github.com/client9/misspell v0.3.4/go.mod h1:qj6jICC3Q7zFZvVWo7KLAzC3yx5G7kyvSDkc90ppPyw= -github.com/cncf/udpa/go v0.0.0-20191209042840-269d4d468f6f/go.mod h1:M8M6+tZqaGXZJjfX53e64911xZQV5JYwmTeXPW+k8Sc= -github.com/cncf/udpa/go v0.0.0-20200629203442-efcf912fb354/go.mod h1:WmhPx2Nbnhtbo57+VJT5O0JRkEi1Wbu0z5j0R8u5Hbk= -github.com/cncf/udpa/go v0.0.0-20201120205902-5459f2c99403/go.mod h1:WmhPx2Nbnhtbo57+VJT5O0JRkEi1Wbu0z5j0R8u5Hbk= -github.com/consensys/gnark v0.14.0 h1:RG+8WxRanFSFBSlmCDRJnYMYYKpH3Ncs5SMzg24B5HQ= -github.com/consensys/gnark v0.14.0/go.mod h1:1IBpDPB/Rdyh55bQRR4b0z1WvfHQN1e0020jCvKP2Gk= github.com/consensys/gnark v0.14.1-0.20260224185952-e002a37bb76c h1:8TfWfD3VxRMuaIeeg6a5xPCIVAqa8d3obk74x3dNc2M= github.com/consensys/gnark v0.14.1-0.20260224185952-e002a37bb76c/go.mod h1:WO5JMTtKqULETq0ZEhdXu1DNnAcRD60SHLTom18lqqA= -github.com/consensys/gnark-crypto v0.19.2 h1:qrEAIXq3T4egxqiliFFoNrepkIWVEeIYwt3UL0fvS80= -github.com/consensys/gnark-crypto v0.19.2/go.mod h1:rT23F0XSZqE0mUA0+pRtnL56IbPxs6gp4CeRsBk4XS0= -github.com/consensys/gnark-crypto v0.19.3-0.20260224184411-30b4255fd898 h1:m1OulZPukY0eUB+rJEW4xDW5f0+E3Jr41X5b0XBZ7ec= -github.com/consensys/gnark-crypto v0.19.3-0.20260224184411-30b4255fd898/go.mod h1:LlrRbe6b7BIune9Un5L6sRTUUWrAIIqGK+L0duYwpoM= -github.com/consensys/gnark-crypto v0.20.1 h1:PXDUBvk8AzhvWowHLWBEAfUQcV1/aZgWIqD6eMpXmDg= -github.com/consensys/gnark-crypto v0.20.1/go.mod h1:RBWrSgy+IDbGR69RRV313th3M/aZU1ubk2om+qHuTSc= -github.com/consensys/go-corset v1.2.12 h1:AdfW9Xsw8XOwvzv/DYmyGmJdqbDTWMKFRKOfHsyE4+A= -github.com/consensys/go-corset v1.2.12/go.mod h1:QKFoNJZHdCrDslg9XFjk+GoFMgrhKSVdBNnx4hq7WJA= +github.com/consensys/gnark-crypto v0.20.2-0.20260518201312-fa008e990155 h1:SFzcWBIXjtFEw0wmCoFGXkjmS5OU9KzrM5u1HImyZVw= +github.com/consensys/gnark-crypto v0.20.2-0.20260518201312-fa008e990155/go.mod h1:NzeBHSZ49bIM7RtrNTYYR2kymTqwvI/A4eTgQlyQc+Q= github.com/consensys/go-corset v1.2.16 h1:IR+g8FQIZLbG/xh17UZ6y3J+KO4HwFyIyX1w6PdxRVw= github.com/consensys/go-corset v1.2.16/go.mod h1:QKFoNJZHdCrDslg9XFjk+GoFMgrhKSVdBNnx4hq7WJA= -github.com/coreos/go-semver v0.3.0/go.mod h1:nnelYz7RCh+5ahJtPPxZlU+153eP4D4r3EedlOD2RNk= -github.com/coreos/go-systemd/v22 v22.3.2/go.mod h1:Y58oyj3AT4RCenI/lSvhwexgC+NSVTIJ3seZv2GcEnc= github.com/coreos/go-systemd/v22 v22.5.0/go.mod h1:Y58oyj3AT4RCenI/lSvhwexgC+NSVTIJ3seZv2GcEnc= -github.com/cpuguy83/go-md2man/v2 v2.0.0/go.mod h1:maD7wRr/U5Z6m/iR4s+kqSMx2CaBsrgA7czyZG/E6dU= -github.com/davecgh/go-spew v1.1.0/go.mod h1:J7Y8YcW2NihsgmVo/mv3lAwl/skON4iLHjSsI+c5H38= github.com/davecgh/go-spew v1.1.1 h1:vj9j/u1bqnvCEfJOwUhtlOARqs3+rkHYY13jYWTU97c= github.com/davecgh/go-spew v1.1.1/go.mod h1:J7Y8YcW2NihsgmVo/mv3lAwl/skON4iLHjSsI+c5H38= -github.com/envoyproxy/go-control-plane v0.9.0/go.mod h1:YTl/9mNaCwkRvm6d1a2C3ymFceY/DCBVvsKhRF0iEA4= -github.com/envoyproxy/go-control-plane v0.9.1-0.20191026205805-5f8ba28d4473/go.mod h1:YTl/9mNaCwkRvm6d1a2C3ymFceY/DCBVvsKhRF0iEA4= -github.com/envoyproxy/go-control-plane v0.9.4/go.mod h1:6rpuAdCZL397s3pYoYcLgu1mIlRU8Am5FuJP05cCM98= -github.com/envoyproxy/go-control-plane v0.9.7/go.mod h1:cwu0lG7PUMfa9snN8LXBig5ynNVH9qI8YYLbd1fK2po= -github.com/envoyproxy/go-control-plane v0.9.9-0.20201210154907-fd9021fe5dad/go.mod h1:cXg6YxExXjJnVBQHBLXeUAgxn2UodCpnH306RInaBQk= -github.com/envoyproxy/go-control-plane v0.9.9-0.20210217033140-668b12f5399d/go.mod h1:cXg6YxExXjJnVBQHBLXeUAgxn2UodCpnH306RInaBQk= -github.com/envoyproxy/protoc-gen-validate v0.1.0/go.mod h1:iSmxcyjqTsJpI2R4NaDN7+kN2VEUnK/pcBlmesArF7c= -github.com/fatih/color v1.7.0/go.mod h1:Zm6kSWBoL9eyXnKyktHP6abPY2pDugNf5KwzbycvMj4= -github.com/fsnotify/fsnotify v1.4.9/go.mod h1:znqG4EE+3YCdAaPaxE2ZRY/06pZUdp0tY4IgpuI1SZQ= github.com/fxamacker/cbor/v2 v2.9.0 h1:NpKPmjDBgUfBms6tr6JZkTHtfFGcMKsw3eGcmD/sapM= github.com/fxamacker/cbor/v2 v2.9.0/go.mod h1:vM4b+DJCtHn+zz7h3FFp/hDAI9WNWCsZj23V5ytsSxQ= -github.com/ghodss/yaml v1.0.0/go.mod h1:4dBDuWmgqj2HViK6kFavaiC9ZROes6MMH2rRYeMEF04= -github.com/go-gl/glfw v0.0.0-20190409004039-e6da0acd62b1/go.mod h1:vR7hzQXu2zJy9AVAgeJqvqgH9Q5CA+iKCZ2gyEVpxRU= -github.com/go-gl/glfw/v3.3/glfw v0.0.0-20191125211704-12ad95a8df72/go.mod h1:tQ2UAYgL5IevRw8kRxooKSPJfGvJ9fJQFa0TUsXzTg8= -github.com/go-gl/glfw/v3.3/glfw v0.0.0-20200222043503-6f7a984d4dc4/go.mod h1:tQ2UAYgL5IevRw8kRxooKSPJfGvJ9fJQFa0TUsXzTg8= github.com/godbus/dbus/v5 v5.0.4/go.mod h1:xhWf0FNVPg57R7Z0UbKHbJfkEywrmjJnf7w5xrFpKfA= -github.com/gogo/protobuf v1.3.2/go.mod h1:P1XiOD3dCwIKUDQYPy72D8LYyHL2YPYrpS2s69NZV8Q= -github.com/golang/glog v0.0.0-20160126235308-23def4e6c14b/go.mod h1:SBH7ygxi8pfUlaOkMMuAQtPIUF8ecWP5IEl/CR7VP2Q= -github.com/golang/groupcache v0.0.0-20190702054246-869f871628b6/go.mod h1:cIg4eruTrX1D+g88fzRXU5OdNfaM+9IcxsU14FzY7Hc= -github.com/golang/groupcache v0.0.0-20191227052852-215e87163ea7/go.mod h1:cIg4eruTrX1D+g88fzRXU5OdNfaM+9IcxsU14FzY7Hc= -github.com/golang/groupcache v0.0.0-20200121045136-8c9f03a8e57e/go.mod h1:cIg4eruTrX1D+g88fzRXU5OdNfaM+9IcxsU14FzY7Hc= -github.com/golang/mock v1.1.1/go.mod h1:oTYuIxOrZwtPieC+H1uAHpcLFnEyAGVDL/k47Jfbm0A= -github.com/golang/mock v1.2.0/go.mod h1:oTYuIxOrZwtPieC+H1uAHpcLFnEyAGVDL/k47Jfbm0A= -github.com/golang/mock v1.3.1/go.mod h1:sBzyDLLjw3U8JLTeZvSv8jJB+tU5PVekmnlKIyFUx0Y= -github.com/golang/mock v1.4.0/go.mod h1:UOMv5ysSaYNkG+OFQykRIcU/QvvxJf3p21QfJ2Bt3cw= -github.com/golang/mock v1.4.1/go.mod h1:UOMv5ysSaYNkG+OFQykRIcU/QvvxJf3p21QfJ2Bt3cw= -github.com/golang/mock v1.4.3/go.mod h1:UOMv5ysSaYNkG+OFQykRIcU/QvvxJf3p21QfJ2Bt3cw= -github.com/golang/mock v1.4.4/go.mod h1:l3mdAwkq5BuhzHwde/uurv3sEJeZMXNpwsxVWU71h+4= -github.com/golang/mock v1.5.0/go.mod h1:CWnOUgYIOo4TcNZ0wHX3YZCqsaM1I1Jvs6v3mP3KVu8= -github.com/golang/protobuf v1.2.0/go.mod h1:6lQm79b+lXiMfvg/cZm0SGofjICqVBUtrP5yJMmIC1U= -github.com/golang/protobuf v1.3.1/go.mod h1:6lQm79b+lXiMfvg/cZm0SGofjICqVBUtrP5yJMmIC1U= -github.com/golang/protobuf v1.3.2/go.mod h1:6lQm79b+lXiMfvg/cZm0SGofjICqVBUtrP5yJMmIC1U= -github.com/golang/protobuf v1.3.3/go.mod h1:vzj43D7+SQXF/4pzW/hwtAqwc6iTitCiVSaWz5lYuqw= -github.com/golang/protobuf v1.3.4/go.mod h1:vzj43D7+SQXF/4pzW/hwtAqwc6iTitCiVSaWz5lYuqw= -github.com/golang/protobuf v1.3.5/go.mod h1:6O5/vntMXwX2lRkT1hjjk0nAC1IDOTvTlVgjlRvqsdk= -github.com/golang/protobuf v1.4.0-rc.1/go.mod h1:ceaxUfeHdC40wWswd/P6IGgMaK3YpKi5j83Wpe3EHw8= -github.com/golang/protobuf v1.4.0-rc.1.0.20200221234624-67d41d38c208/go.mod h1:xKAWHe0F5eneWXFV3EuXVDTCmh+JuBKY0li0aMyXATA= -github.com/golang/protobuf v1.4.0-rc.2/go.mod h1:LlEzMj4AhA7rCAGe4KMBDvJI+AwstrUpVNzEA03Pprs= -github.com/golang/protobuf v1.4.0-rc.4.0.20200313231945-b860323f09d0/go.mod h1:WU3c8KckQ9AFe+yFwt9sWVRKCVIyN9cPHBJSNnbL67w= -github.com/golang/protobuf v1.4.0/go.mod h1:jodUvKwWbYaEsadDk5Fwe5c77LiNKVO9IDvqG2KuDX0= -github.com/golang/protobuf v1.4.1/go.mod h1:U8fpvMrcmy5pZrNK1lt4xCsGvpyWQ/VVv6QDs8UjoX8= -github.com/golang/protobuf v1.4.2/go.mod h1:oDoupMAO8OvCJWAcko0GGGIgR6R6ocIYbsSw735rRwI= -github.com/golang/protobuf v1.4.3/go.mod h1:oDoupMAO8OvCJWAcko0GGGIgR6R6ocIYbsSw735rRwI= -github.com/golang/protobuf v1.5.0/go.mod h1:FsONVRAS9T7sI+LIUmWTfcYkHO4aIWwzhcaSAoJOfIk= -github.com/golang/protobuf v1.5.1/go.mod h1:DopwsBzvsk0Fs44TXzsVbJyPhcCPeIwnvohx4u74HPM= -github.com/golang/protobuf v1.5.2/go.mod h1:XVQd3VNwM+JqD3oG2Ue2ip4fOMUkwXdXDdiuN0vRsmY= -github.com/google/btree v0.0.0-20180813153112-4030bb1f1f0c/go.mod h1:lNA+9X1NB3Zf8V7Ke586lFgjr2dZNuvo3lPJSGZ5JPQ= -github.com/google/btree v1.0.0/go.mod h1:lNA+9X1NB3Zf8V7Ke586lFgjr2dZNuvo3lPJSGZ5JPQ= -github.com/google/go-cmp v0.2.0/go.mod h1:oXzfMopK8JAjlY9xF4vHSVASa0yLyX7SntLO5aqRK0M= -github.com/google/go-cmp v0.3.0/go.mod h1:8QqcDgzrUqlUb/G2PQTWiueGozuR1884gddMywk6iLU= -github.com/google/go-cmp v0.3.1/go.mod h1:8QqcDgzrUqlUb/G2PQTWiueGozuR1884gddMywk6iLU= -github.com/google/go-cmp v0.4.0/go.mod h1:v8dTdLbMG2kIc/vJvl+f65V22dbkXbowE6jgT/gNBxE= -github.com/google/go-cmp v0.4.1/go.mod h1:v8dTdLbMG2kIc/vJvl+f65V22dbkXbowE6jgT/gNBxE= -github.com/google/go-cmp v0.5.0/go.mod h1:v8dTdLbMG2kIc/vJvl+f65V22dbkXbowE6jgT/gNBxE= -github.com/google/go-cmp v0.5.1/go.mod h1:v8dTdLbMG2kIc/vJvl+f65V22dbkXbowE6jgT/gNBxE= -github.com/google/go-cmp v0.5.2/go.mod h1:v8dTdLbMG2kIc/vJvl+f65V22dbkXbowE6jgT/gNBxE= -github.com/google/go-cmp v0.5.3/go.mod h1:v8dTdLbMG2kIc/vJvl+f65V22dbkXbowE6jgT/gNBxE= -github.com/google/go-cmp v0.5.4/go.mod h1:v8dTdLbMG2kIc/vJvl+f65V22dbkXbowE6jgT/gNBxE= -github.com/google/go-cmp v0.5.5/go.mod h1:v8dTdLbMG2kIc/vJvl+f65V22dbkXbowE6jgT/gNBxE= -github.com/google/go-cmp v0.5.6/go.mod h1:v8dTdLbMG2kIc/vJvl+f65V22dbkXbowE6jgT/gNBxE= -github.com/google/gofuzz v1.0.0/go.mod h1:dBl0BpW6vV/+mYPU4Po3pmUjxk6FQPldtuIdl/M65Eg= -github.com/google/martian v2.1.0+incompatible/go.mod h1:9I4somxYTbIHy5NJKHRl3wXiIaQGbYVAs8BPL6v8lEs= -github.com/google/martian/v3 v3.0.0/go.mod h1:y5Zk1BBys9G+gd6Jrk0W3cC1+ELVxBWuIGO+w/tUAp0= -github.com/google/martian/v3 v3.1.0/go.mod h1:y5Zk1BBys9G+gd6Jrk0W3cC1+ELVxBWuIGO+w/tUAp0= -github.com/google/pprof v0.0.0-20181206194817-3ea8567a2e57/go.mod h1:zfwlbNMJ+OItoe0UupaVj+oy1omPYYDuagoSzA8v9mc= -github.com/google/pprof v0.0.0-20190515194954-54271f7e092f/go.mod h1:zfwlbNMJ+OItoe0UupaVj+oy1omPYYDuagoSzA8v9mc= -github.com/google/pprof v0.0.0-20191218002539-d4f498aebedc/go.mod h1:ZgVRPoUq/hfqzAqh7sHMqb3I9Rq5C59dIz2SbBwJ4eM= -github.com/google/pprof v0.0.0-20200212024743-f11f1df84d12/go.mod h1:ZgVRPoUq/hfqzAqh7sHMqb3I9Rq5C59dIz2SbBwJ4eM= -github.com/google/pprof v0.0.0-20200229191704-1ebb73c60ed3/go.mod h1:ZgVRPoUq/hfqzAqh7sHMqb3I9Rq5C59dIz2SbBwJ4eM= -github.com/google/pprof v0.0.0-20200430221834-fc25d7d30c6d/go.mod h1:ZgVRPoUq/hfqzAqh7sHMqb3I9Rq5C59dIz2SbBwJ4eM= -github.com/google/pprof v0.0.0-20200708004538-1a94d8640e99/go.mod h1:ZgVRPoUq/hfqzAqh7sHMqb3I9Rq5C59dIz2SbBwJ4eM= -github.com/google/pprof v0.0.0-20201023163331-3e6fc7fc9c4c/go.mod h1:kpwsk12EmLew5upagYY7GY0pfYCcupk39gWOCRROcvE= -github.com/google/pprof v0.0.0-20201203190320-1bf35d6f28c2/go.mod h1:kpwsk12EmLew5upagYY7GY0pfYCcupk39gWOCRROcvE= -github.com/google/pprof v0.0.0-20210122040257-d980be63207e/go.mod h1:kpwsk12EmLew5upagYY7GY0pfYCcupk39gWOCRROcvE= -github.com/google/pprof v0.0.0-20210226084205-cbba55b83ad5/go.mod h1:kpwsk12EmLew5upagYY7GY0pfYCcupk39gWOCRROcvE= +github.com/google/go-cmp v0.7.0 h1:wk8382ETsv4JYUZwIsn6YpYiWiBsYLSJiTsyBybVuN8= +github.com/google/go-cmp v0.7.0/go.mod h1:pXiqmnSA92OHEEa9HXL2W4E7lf9JzCmGVUdgjX3N/iU= github.com/google/pprof v0.0.0-20260202012954-cb029daf43ef h1:xpF9fUHpoIrrjX24DURVKiwHcFpw19ndIs+FwTSMbno= github.com/google/pprof v0.0.0-20260202012954-cb029daf43ef/go.mod h1:MxpfABSjhmINe3F1It9d+8exIHFvUqtLIRCdOGNXqiI= -github.com/google/renameio v0.1.0/go.mod h1:KWCgfxg9yswjAJkECMjeO8J8rahYeXnNhOm40UhjYkI= -github.com/google/uuid v1.1.2/go.mod h1:TIyPZe4MgqvfeYDBFedMoGGpEw/LqOeaOT+nhxU+yHo= -github.com/googleapis/gax-go/v2 v2.0.4/go.mod h1:0Wqv26UfaUD9n4G6kQubkQ+KchISgw+vpHVxEJEs9eg= -github.com/googleapis/gax-go/v2 v2.0.5/go.mod h1:DWXyrwAJ9X0FpwwEdw+IPEYBICEFu5mhpdKc/us6bOk= -github.com/gopherjs/gopherjs v0.0.0-20181017120253-0766667cb4d1/go.mod h1:wJfORRmW1u3UXTncJ5qlYoELFm8eSnnEO6hX4iZ3EWY= -github.com/gopherjs/gopherjs v1.17.2/go.mod h1:pRRIvn/QzFLrKfvEz3qUuEhtE/zLCWfreZ6J5gM2i+k= -github.com/grpc-ecosystem/grpc-gateway v1.16.0/go.mod h1:BDjrQk3hbvj6Nolgz8mAMFbcEtjT1g+wF4CSlocrBnw= -github.com/hashicorp/consul/api v1.1.0/go.mod h1:VmuI/Lkw1nC05EYQWNKwWGbkg+FbDBtguAZLlVdkD9Q= -github.com/hashicorp/consul/sdk v0.1.1/go.mod h1:VKf9jXwCTEY1QZP2MOLRhb5i/I/ssyNV1vwHyQBF0x8= -github.com/hashicorp/errwrap v1.0.0/go.mod h1:YH+1FKiLXxHSkmPseP+kNlulaMuP3n2brvKWEqk/Jc4= -github.com/hashicorp/go-cleanhttp v0.5.1/go.mod h1:JpRdi6/HCYpAwUzNwuwqhbovhLtngrth3wmdIIUrZ80= -github.com/hashicorp/go-immutable-radix v1.0.0/go.mod h1:0y9vanUI8NX6FsYoO3zeMjhV/C5i9g4Q3DwcSNZ4P60= -github.com/hashicorp/go-msgpack v0.5.3/go.mod h1:ahLV/dePpqEmjfWmKiqvPkv/twdG7iPBM1vqhUKIvfM= -github.com/hashicorp/go-multierror v1.0.0/go.mod h1:dHtQlpGsu+cZNNAkkCN/P3hoUDHhCYQXV3UM06sGGrk= -github.com/hashicorp/go-rootcerts v1.0.0/go.mod h1:K6zTfqpRlCUIjkwsN4Z+hiSfzSTQa6eBIzfwKfwNnHU= -github.com/hashicorp/go-sockaddr v1.0.0/go.mod h1:7Xibr9yA9JjQq1JpNB2Vw7kxv8xerXegt+ozgdvDeDU= -github.com/hashicorp/go-syslog v1.0.0/go.mod h1:qPfqrKkXGihmCqbJM2mZgkZGvKG1dFdvsLplgctolz4= -github.com/hashicorp/go-uuid v1.0.0/go.mod h1:6SBZvOh/SIDV7/2o3Jml5SYk/TvGqwFJ/bN7x4byOro= -github.com/hashicorp/go-uuid v1.0.1/go.mod h1:6SBZvOh/SIDV7/2o3Jml5SYk/TvGqwFJ/bN7x4byOro= -github.com/hashicorp/go.net v0.0.1/go.mod h1:hjKkEWcCURg++eb33jQU7oqQcI9XDCnUzHA0oac0k90= -github.com/hashicorp/golang-lru v0.5.0/go.mod h1:/m3WP610KZHVQ1SGc6re/UDhFvYD7pJ4Ao+sR/qLZy8= -github.com/hashicorp/golang-lru v0.5.1/go.mod h1:/m3WP610KZHVQ1SGc6re/UDhFvYD7pJ4Ao+sR/qLZy8= -github.com/hashicorp/hcl v1.0.0/go.mod h1:E5yfLk+7swimpb2L/Alb/PJmXilQ/rhwaUYs4T20WEQ= -github.com/hashicorp/logutils v1.0.0/go.mod h1:QIAnNjmIWmVIIkWDTG1z5v++HQmx9WQRO+LraFDTW64= -github.com/hashicorp/mdns v1.0.0/go.mod h1:tL+uN++7HEJ6SQLQ2/p+z2pH24WQKWjBPkE0mNTz8vQ= -github.com/hashicorp/memberlist v0.1.3/go.mod h1:ajVTdAv/9Im8oMAAj5G31PhhMCZJV2pPBoIllUwCN7I= -github.com/hashicorp/serf v0.8.2/go.mod h1:6hOLApaqBFA1NXqRQAsxw9QxuDEvNxSQRwA/JwenrHc= -github.com/ianlancetaylor/demangle v0.0.0-20181102032728-5e5cf60278f6/go.mod h1:aSSvb/t6k1mPoxDqO4vJh6VOCGPwU4O0C2/Eqndh1Sc= -github.com/ianlancetaylor/demangle v0.0.0-20200824232613-28f6c0f3b639/go.mod h1:aSSvb/t6k1mPoxDqO4vJh6VOCGPwU4O0C2/Eqndh1Sc= -github.com/inconshreveable/mousetrap v1.0.0/go.mod h1:PxqpIevigyE2G7u3NXJIT2ANytuPF1OarO4DADm73n8= -github.com/json-iterator/go v1.1.11/go.mod h1:KdQUCv79m/52Kvf8AW2vK1V8akMuk1QjK/uOdHXbAo4= -github.com/jstemmer/go-junit-report v0.0.0-20190106144839-af01ea7f8024/go.mod h1:6v2b51hI/fHJwM22ozAgKL4VKDeJcHhJFhtBdhmNjmU= -github.com/jstemmer/go-junit-report v0.9.1/go.mod h1:Brl9GWCQeLvo8nXZwPNNblvFj/XSXhF0NWZEnDohbsk= -github.com/jtolds/gls v4.20.0+incompatible/go.mod h1:QJZ7F/aHp+rZTRtaJ1ow/lLfFfVYBRgL+9YlvaHOwJU= -github.com/kisielk/errcheck v1.5.0/go.mod h1:pFxgyoBC7bSaBwPgfKdkLd5X25qrDl4LWUI2bnpBCr8= -github.com/kisielk/gotool v1.0.0/go.mod h1:XhKaO+MFFWcvkIS/tQcRk01m1F5IRFswLeQ+oQHNcck= -github.com/kr/fs v0.1.0/go.mod h1:FFnZGqtBN9Gxj7eW1uZ42v5BccTP0vu6NEaFoC2HwRg= -github.com/kr/pretty v0.1.0/go.mod h1:dAy3ld7l9f0ibDNOQOHHMYYIIbhfbHSm3C4ZsoJORNo= -github.com/kr/pty v1.1.1/go.mod h1:pFQYn66WHrOpPYNljwOMqo10TkYh1fy3cYio2l3bCsQ= -github.com/kr/text v0.1.0/go.mod h1:4Jbv+DJW3UT/LiOwJeYQe1efqtUx/iVham/4vfdArNI= github.com/leanovate/gopter v0.2.11 h1:vRjThO1EKPb/1NsDXuDrzldR28RLkBflWYcU9CvzWu4= github.com/leanovate/gopter v0.2.11/go.mod h1:aK3tzZP/C+p1m3SPRE4SYZFGP7jjkuSI4f7Xvpt0S9c= -github.com/magiconair/properties v1.8.5/go.mod h1:y3VJvCyxH9uVvJTWEGAELF3aiYNyPKd5NZ3oSwXrF60= -github.com/mattn/go-colorable v0.0.9/go.mod h1:9vuHe8Xs5qXnSaW/c/ABM9alt+Vo+STaOChaDxuIBZU= github.com/mattn/go-colorable v0.1.13/go.mod h1:7S9/ev0klgBDR4GtXTXX8a3vIGJpMovkB8vQcUbaXHg= github.com/mattn/go-colorable v0.1.14 h1:9A9LHSqF/7dyVVX6g0U9cwm9pG3kP9gSzcuIPHPsaIE= github.com/mattn/go-colorable v0.1.14/go.mod h1:6LmQG8QLFO4G5z1gPvYEzlUgJ2wF+stgPZH1UqBm1s8= -github.com/mattn/go-isatty v0.0.3/go.mod h1:M+lRXTBqGeGNdLjl/ufCoiOlB5xdOkqRJdNxMWT7Zi4= github.com/mattn/go-isatty v0.0.16/go.mod h1:kYGgaQfpe5nmfYZH+SKPsOc2e4SrIfOl2e/yFXSvRLM= github.com/mattn/go-isatty v0.0.19/go.mod h1:W+V8PltTTMOvKvAeJH7IuucS94S2C6jfK/D7dTCTo3Y= github.com/mattn/go-isatty v0.0.20 h1:xfD0iDuEKnDkl03q4limB+vH+GxLEtL/jb4xVJSWWEY= github.com/mattn/go-isatty v0.0.20/go.mod h1:W+V8PltTTMOvKvAeJH7IuucS94S2C6jfK/D7dTCTo3Y= -github.com/miekg/dns v1.0.14/go.mod h1:W1PPwlIAgtquWBMBEV9nkV9Cazfe8ScdGz/Lj7v3Nrg= -github.com/mitchellh/cli v1.0.0/go.mod h1:hNIlj7HEI86fIcpObd7a0FcrxTWetlwJDGcceTlRvqc= -github.com/mitchellh/go-homedir v1.0.0/go.mod h1:SfyaCUpYCn1Vlf4IUYiD9fPX4A5wJrkLzIz1N1q0pr0= -github.com/mitchellh/go-testing-interface v1.0.0/go.mod h1:kRemZodwjscx+RGhAo8eIhFbs2+BFgRtFPeD/KE+zxI= -github.com/mitchellh/gox v0.4.0/go.mod h1:Sd9lOJ0+aimLBi73mGofS1ycjY8lL3uZM3JPS42BGNg= -github.com/mitchellh/iochan v1.0.0/go.mod h1:JwYml1nuB7xOzsp52dPpHFffvOCDupsG0QubkSMEySY= -github.com/mitchellh/mapstructure v0.0.0-20160808181253-ca63d7c062ee/go.mod h1:FVVH3fgwuzCH5S8UJGiWEs2h04kUh9fWfEaFds41c1Y= -github.com/mitchellh/mapstructure v1.1.2/go.mod h1:FVVH3fgwuzCH5S8UJGiWEs2h04kUh9fWfEaFds41c1Y= -github.com/mitchellh/mapstructure v1.4.1/go.mod h1:bFUtVrKA4DC2yAKiSyO/QUcy7e+RRV2QTWOzhPopBRo= -github.com/mmcloughlin/mathfmt v0.0.0-20240209192118-76b0fc98f057 h1:X70iVQGXB2Mp/Ow6/wfnf/0bI+IOsjLiSBP9AygcgZk= -github.com/mmcloughlin/mathfmt v0.0.0-20240209192118-76b0fc98f057/go.mod h1:3cINdFOcFkLlkOZ+AFGWF2k6vCzrXYLZkY2pTZZbP1A= -github.com/modern-go/concurrent v0.0.0-20180228061459-e0a39a4cb421/go.mod h1:6dJC0mAP4ikYIbvyc7fijjWJddQyLn8Ig3JB5CqoB9Q= -github.com/modern-go/reflect2 v0.0.0-20180701023420-4b7aa43c6742/go.mod h1:bx2lNnkwVCuqBIxFjflWJWanXIb3RllmbCylyMrvgv0= -github.com/modern-go/reflect2 v1.0.1/go.mod h1:bx2lNnkwVCuqBIxFjflWJWanXIb3RllmbCylyMrvgv0= -github.com/neelance/astrewrite v0.0.0-20160511093645-99348263ae86/go.mod h1:kHJEU3ofeGjhHklVoIGuVj85JJwZ6kWPaJwCIxgnFmo= -github.com/neelance/sourcemap v0.0.0-20200213170602-2833bce08e4c/go.mod h1:Qr6/a/Q4r9LP1IltGz7tA7iOK1WonHEYhu1HRBA7ZiM= -github.com/pascaldekloe/goe v0.0.0-20180627143212-57f6aae5913c/go.mod h1:lzWF7FIEvWOWxwDKqyGYQf6ZUaNfKdP144TG7ZOy1lc= -github.com/pelletier/go-toml v1.9.3/go.mod h1:u1nR/EPcESfeI/szUZKdtJ0xRNbUoANCkoOuaOx1Y+c= -github.com/pkg/errors v0.8.1/go.mod h1:bwawxfHBFNV+L2hUp1rHADufV3IMtnDRdf1r5NINEl0= github.com/pkg/errors v0.9.1/go.mod h1:bwawxfHBFNV+L2hUp1rHADufV3IMtnDRdf1r5NINEl0= -github.com/pkg/sftp v1.10.1/go.mod h1:lYOWFsE0bwd1+KfKJaKeuokY15vzFx25BLbzYYoAxZI= github.com/pmezard/go-difflib v1.0.0 h1:4DBwDE0NGyQoBHbLQYPwSUPoCMWR5BEzIk/f1lZbAQM= github.com/pmezard/go-difflib v1.0.0/go.mod h1:iKH77koFhYxTK1pcRnkKkqfTogsbg7gZNVY4sRDYZ/4= -github.com/posener/complete v1.1.1/go.mod h1:em0nMJCgc9GFtwrmVmEMR/ZL6WyhyjMBndrE9hABlRI= -github.com/prometheus/client_model v0.0.0-20190812154241-14fe0d1b01d4/go.mod h1:xMI15A0UPsDsEKsMN9yxemIoYk6Tm2C1GtYGdfGttqA= -github.com/rogpeppe/fastuuid v1.2.0/go.mod h1:jVj6XXZzXRy/MSR5jhDC/2q6DgLz+nrA6LYCDYWNEvQ= -github.com/rogpeppe/go-internal v1.3.0/go.mod h1:M8bDsm7K2OlrFYOpmOWEs/qY81heoFRclV5y23lUDJ4= github.com/ronanh/intcomp v1.1.1 h1:+1bGV/wEBiHI0FvzS7RHgzqOpfbBJzLIxkqMJ9e6yxY= github.com/ronanh/intcomp v1.1.1/go.mod h1:7FOLy3P3Zj3er/kVrU/pl+Ql7JFZj7bwliMGketo0IU= github.com/rs/xid v1.6.0/go.mod h1:7XoLgs4eV+QndskICGsho+ADou8ySMSjJKDIan90Nz0= github.com/rs/zerolog v1.34.0 h1:k43nTLIwcTVQAncfCw4KZ2VY6ukYoZaBPNOE8txlOeY= github.com/rs/zerolog v1.34.0/go.mod h1:bJsvje4Z08ROH4Nhs5iH600c3IkWhwp44iRc54W6wYQ= -github.com/russross/blackfriday/v2 v2.0.1/go.mod h1:+Rmxgy9KzJVeS9/2gXHxylqXiyQDYRxCVz55jmeOWTM= -github.com/ryanuber/columnize v0.0.0-20160712163229-9b3edd62028f/go.mod h1:sm1tb6uqfes/u+d4ooFouqFdy9/2g9QGwK3SQygK0Ts= -github.com/sean-/seed v0.0.0-20170313163322-e2103e2c3529/go.mod h1:DxrIzT+xaE7yg65j358z/aeFdxmN0P9QXhEzd20vsDc= -github.com/shurcooL/go v0.0.0-20200502201357-93f07166e636/go.mod h1:TDJrrUr11Vxrven61rcy3hJMUqaf/CLWYhHNPmT14Lk= -github.com/shurcooL/httpfs v0.0.0-20190707220628-8d4bc4ba7749/go.mod h1:ZY1cvUeJuFPAdZ/B6v7RHavJWZn2YPVFQ1OSXhCGOkg= -github.com/shurcooL/sanitized_anchor_name v1.0.0/go.mod h1:1NzhyTcUVG4SuEtjjoZeVRXNmyL/1OwPU0+IJeTBvfc= -github.com/shurcooL/vfsgen v0.0.0-20200824052919-0d455de96546/go.mod h1:TrYk7fJVaAttu97ZZKrO9UbRa8izdowaMIZcxYMbVaw= -github.com/sirupsen/logrus v1.8.1/go.mod h1:yWOB1SBYBC5VeMP7gHvWumXLIWorT60ONWic61uBYv0= github.com/sirupsen/logrus v1.9.4 h1:TsZE7l11zFCLZnZ+teH4Umoq5BhEIfIzfRDZ1Uzql2w= github.com/sirupsen/logrus v1.9.4/go.mod h1:ftWc9WdOfJ0a92nsE2jF5u5ZwH8Bv2zdeOC42RjbV2g= -github.com/smarty/assertions v1.15.0/go.mod h1:yABtdzeQs6l1brC900WlRNwj6ZR55d7B+E8C6HtKdec= -github.com/smartystreets/assertions v0.0.0-20180927180507-b2de0cb4f26d/go.mod h1:OnSkiWE9lh6wB0YB77sQom3nweQdgAjqCqsofrRNTgc= -github.com/smartystreets/goconvey v1.6.4/go.mod h1:syvi0/a8iFYH4r/RixwvyeAJjdLS9QV7WQ/tjFTllLA= -github.com/smartystreets/goconvey v1.8.1/go.mod h1:+/u4qLyY6x1jReYOp7GOM2FSt8aP9CzCZL03bI28W60= -github.com/spf13/afero v1.6.0/go.mod h1:Ai8FlHk4v/PARR026UzYexafAt9roJ7LcLMAmO6Z93I= -github.com/spf13/cast v1.3.1/go.mod h1:Qx5cxh0v+4UWYiBimWS+eyWzqEqokIECu5etghLkUJE= -github.com/spf13/cobra v1.2.1/go.mod h1:ExllRjgxM/piMAM+3tAZvg8fsklGAf3tPfi+i8t68Nk= -github.com/spf13/jwalterweatherman v1.1.0/go.mod h1:aNWZUN0dPAAO/Ljvb5BEdw96iTZ0EXowPYD95IqWIGo= -github.com/spf13/pflag v1.0.5/go.mod h1:McXfInJRrz4CZXVZOBLb0bTZqETkiAhM9Iw0y3An2Bg= -github.com/spf13/viper v1.8.1/go.mod h1:o0Pch8wJ9BVSWGQMbra6iw0oQ5oktSIBaujf1rJH9Ns= -github.com/stretchr/objx v0.1.0/go.mod h1:HFkY916IF+rwdDfMAkV7OtwuqBVzrE8GR6GFx+wExME= -github.com/stretchr/testify v1.2.2/go.mod h1:a8OnRcib4nhh0OaRAV+Yts87kKdq0PP7pXfy6kDkUVs= -github.com/stretchr/testify v1.3.0/go.mod h1:M5WIy9Dh21IEIfnGCwXGc5bZfKNJtfHm1UVUgZn+9EI= -github.com/stretchr/testify v1.4.0/go.mod h1:j7eGeouHqKxXV5pUuKE4zz7dFj8WfuZ+81PSLYec5m4= -github.com/stretchr/testify v1.5.1/go.mod h1:5W2xD1RspED5o8YsWQXVCued0rvSQ+mT+I5cxcmMvtA= -github.com/stretchr/testify v1.6.1/go.mod h1:6Fq8oRcR53rry900zMqJjRRixrwX3KX962/h/Wwjteg= -github.com/stretchr/testify v1.7.0/go.mod h1:6Fq8oRcR53rry900zMqJjRRixrwX3KX962/h/Wwjteg= -github.com/stretchr/testify v1.10.0 h1:Xv5erBjTwe/5IxqUQTdXv5kgmIvbHo3QQyRwhJsOfJA= -github.com/stretchr/testify v1.10.0/go.mod h1:r2ic/lqez/lEtzL7wO/rwa5dbSLXVDPFyf8C91i36aY= -github.com/subosito/gotenv v1.2.0/go.mod h1:N0PQaV/YGNqwC0u51sEeR/aUtSLEXKX9iv69rRypqCw= +github.com/stretchr/testify v1.11.1 h1:7s2iGBzp5EwR7/aIZr8ao5+dra3wiQyKjjFuvgVKu7U= +github.com/stretchr/testify v1.11.1/go.mod h1:wZwfW3scLgRK+23gO65QZefKpKQRnfz6sD981Nm4B6U= github.com/x448/float16 v0.8.4 h1:qLwI1I70+NjRFUR3zs1JPUCgaCXSh3SW62uAKT1mSBM= github.com/x448/float16 v0.8.4/go.mod h1:14CWIYCyZA/cWjXOioeEpHeN/83MdbZDRQHoFcYsOfg= -github.com/yuin/goldmark v1.1.25/go.mod h1:3hX8gzYuyVAZsxl0MRgGTJEmQBFcNTphYh9decYSb74= -github.com/yuin/goldmark v1.1.27/go.mod h1:3hX8gzYuyVAZsxl0MRgGTJEmQBFcNTphYh9decYSb74= -github.com/yuin/goldmark v1.1.32/go.mod h1:3hX8gzYuyVAZsxl0MRgGTJEmQBFcNTphYh9decYSb74= -github.com/yuin/goldmark v1.2.1/go.mod h1:3hX8gzYuyVAZsxl0MRgGTJEmQBFcNTphYh9decYSb74= -github.com/yuin/goldmark v1.3.5/go.mod h1:mwnBkeHKe2W/ZEtQ+71ViKU8L12m81fl3OWwC1Zlc8k= -github.com/yuin/goldmark v1.4.13/go.mod h1:6yULJ656Px+3vBD8DxQVa3kxgyrAnzto9xy5taEt/CY= -go.etcd.io/etcd/api/v3 v3.5.0/go.mod h1:cbVKeC6lCfl7j/8jBhAK6aIYO9XOjdptoxU/nLQcPvs= -go.etcd.io/etcd/client/pkg/v3 v3.5.0/go.mod h1:IJHfcCEKxYu1Os13ZdwCwIUTUVGYTSAM3YSwc9/Ac1g= -go.etcd.io/etcd/client/v2 v2.305.0/go.mod h1:h9puh54ZTgAKtEbut2oe9P4L/oqKCVB6xsXlzd7alYQ= -go.opencensus.io v0.21.0/go.mod h1:mSImk1erAIZhrmZN+AvHh14ztQfjbGwt4TtuofqLduU= -go.opencensus.io v0.22.0/go.mod h1:+kGneAE2xo2IficOXnaByMWTGM9T73dGwxeWcUqIpI8= -go.opencensus.io v0.22.2/go.mod h1:yxeiOL68Rb0Xd1ddK5vPZ/oVn4vY4Ynel7k9FzqtOIw= -go.opencensus.io v0.22.3/go.mod h1:yxeiOL68Rb0Xd1ddK5vPZ/oVn4vY4Ynel7k9FzqtOIw= -go.opencensus.io v0.22.4/go.mod h1:yxeiOL68Rb0Xd1ddK5vPZ/oVn4vY4Ynel7k9FzqtOIw= -go.opencensus.io v0.22.5/go.mod h1:5pWMHQbX5EPX2/62yrJeAkowc+lfs/XD7Uxpq3pI6kk= -go.opencensus.io v0.23.0/go.mod h1:XItmlyltB5F7CS4xOC1DcqMoFqwtC6OG2xF7mCv7P7E= -go.uber.org/atomic v1.7.0/go.mod h1:fEN4uk6kAWBTFdckzkM89CLk9XfWZrxpCo0nPH17wJc= -go.uber.org/multierr v1.6.0/go.mod h1:cdWPpRnG4AhwMwsgIHip0KRBQjJy5kYEpYjJxpXp9iU= -go.uber.org/zap v1.17.0/go.mod h1:MXVU+bhUf/A7Xi2HNOnopQOrmycQ5Ih87HtOu4q5SSo= -golang.org/x/crypto v0.0.0-20181029021203-45a5f77698d3/go.mod h1:6SG95UA2DQfeDnfUPMdvaQW0Q7yPrPDi9nlGo2tz2b4= -golang.org/x/crypto v0.0.0-20190308221718-c2843e01d9a2/go.mod h1:djNgcEr1/C05ACkg1iLfiJU5Ep61QUkGW8qpdssI0+w= -golang.org/x/crypto v0.0.0-20190510104115-cbcb75029529/go.mod h1:yigFU9vqHzYiE8UmvKecakEJjdnWj3jj499lnFckfCI= -golang.org/x/crypto v0.0.0-20190605123033-f99c8df09eb5/go.mod h1:yigFU9vqHzYiE8UmvKecakEJjdnWj3jj499lnFckfCI= -golang.org/x/crypto v0.0.0-20190820162420-60c769a6c586/go.mod h1:yigFU9vqHzYiE8UmvKecakEJjdnWj3jj499lnFckfCI= -golang.org/x/crypto v0.0.0-20191011191535-87dc89f01550/go.mod h1:yigFU9vqHzYiE8UmvKecakEJjdnWj3jj499lnFckfCI= -golang.org/x/crypto v0.0.0-20200622213623-75b288015ac9/go.mod h1:LzIPMQfyMNhhGPhUkYOs5KpL4U8rLKemX1yGLhDgUto= -golang.org/x/crypto v0.0.0-20210711020723-a769d52b0f97/go.mod h1:GvvjBRRGRdwPK5ydBHafDWAxML/pGHZbMvKqRZ5+Abc= -golang.org/x/crypto v0.0.0-20210921155107-089bfa567519/go.mod h1:GvvjBRRGRdwPK5ydBHafDWAxML/pGHZbMvKqRZ5+Abc= golang.org/x/crypto v0.48.0 h1:/VRzVqiRSggnhY7gNRxPauEQ5Drw9haKdM0jqfcCFts= golang.org/x/crypto v0.48.0/go.mod h1:r0kV5h3qnFPlQnBSrULhlsRfryS2pmewsg+XfMgkVos= -golang.org/x/exp v0.0.0-20190121172915-509febef88a4/go.mod h1:CJ0aWSM057203Lf6IL+f9T1iT9GByDxfZKAQTCR3kQA= -golang.org/x/exp v0.0.0-20190306152737-a1d7652674e8/go.mod h1:CJ0aWSM057203Lf6IL+f9T1iT9GByDxfZKAQTCR3kQA= -golang.org/x/exp v0.0.0-20190510132918-efd6b22b2522/go.mod h1:ZjyILWgesfNpC6sMxTJOJm9Kp84zZh5NQWvqDGG3Qr8= -golang.org/x/exp v0.0.0-20190829153037-c13cbed26979/go.mod h1:86+5VVa7VpoJ4kLfm080zCjGlMRFzhUhsZKEZO7MGek= -golang.org/x/exp v0.0.0-20191030013958-a1ab85dbe136/go.mod h1:JXzH8nQsPlswgeRAPE3MuO9GYsAcnJvJ4vnMwN/5qkY= -golang.org/x/exp v0.0.0-20191129062945-2f5052295587/go.mod h1:2RIsYlXP63K8oxa1u096TMicItID8zy7Y6sNkU49FU4= -golang.org/x/exp v0.0.0-20191227195350-da58074b4299/go.mod h1:2RIsYlXP63K8oxa1u096TMicItID8zy7Y6sNkU49FU4= -golang.org/x/exp v0.0.0-20200119233911-0405dc783f0a/go.mod h1:2RIsYlXP63K8oxa1u096TMicItID8zy7Y6sNkU49FU4= -golang.org/x/exp v0.0.0-20200207192155-f17229e696bd/go.mod h1:J/WKrq2StrnmMY6+EHIKF9dgMWnmCNThgcyBT1FY9mM= -golang.org/x/exp v0.0.0-20200224162631-6cc2880d07d6/go.mod h1:3jZMyOhIsHpP37uCMkUooju7aAi5cS1Q23tOzKc+0MU= -golang.org/x/image v0.0.0-20190227222117-0694c2d4d067/go.mod h1:kZ7UVZpmo3dzQBMxlp+ypCbDeSB+sBbTgSJuh5dn5js= -golang.org/x/image v0.0.0-20190802002840-cff245a6509b/go.mod h1:FeLwcggjj3mMvU+oOTbSwawSJRM1uh48EjtB4UJZlP0= -golang.org/x/lint v0.0.0-20181026193005-c67002cb31c3/go.mod h1:UVdnD1Gm6xHRNCYTkRU2/jEulfH38KcIWyp/GAMgvoE= -golang.org/x/lint v0.0.0-20190227174305-5b3e6a55c961/go.mod h1:wehouNa3lNwaWXcvxsM5YxQ5yQlVC4a0KAMCusXpPoU= -golang.org/x/lint v0.0.0-20190301231843-5614ed5bae6f/go.mod h1:UVdnD1Gm6xHRNCYTkRU2/jEulfH38KcIWyp/GAMgvoE= -golang.org/x/lint v0.0.0-20190313153728-d0100b6bd8b3/go.mod h1:6SW0HCj/g11FgYtHlgUYUwCkIfeOF89ocIRzGO/8vkc= -golang.org/x/lint v0.0.0-20190409202823-959b441ac422/go.mod h1:6SW0HCj/g11FgYtHlgUYUwCkIfeOF89ocIRzGO/8vkc= -golang.org/x/lint v0.0.0-20190909230951-414d861bb4ac/go.mod h1:6SW0HCj/g11FgYtHlgUYUwCkIfeOF89ocIRzGO/8vkc= -golang.org/x/lint v0.0.0-20190930215403-16217165b5de/go.mod h1:6SW0HCj/g11FgYtHlgUYUwCkIfeOF89ocIRzGO/8vkc= -golang.org/x/lint v0.0.0-20191125180803-fdd1cda4f05f/go.mod h1:5qLYkcX4OjUUV8bRuDixDT3tpyyb+LUpUlRWLxfhWrs= -golang.org/x/lint v0.0.0-20200130185559-910be7a94367/go.mod h1:3xt1FjdF8hUf6vQPIChWIBhFzV8gjjsPE/fR3IyQdNY= -golang.org/x/lint v0.0.0-20200302205851-738671d3881b/go.mod h1:3xt1FjdF8hUf6vQPIChWIBhFzV8gjjsPE/fR3IyQdNY= -golang.org/x/lint v0.0.0-20201208152925-83fdc39ff7b5/go.mod h1:3xt1FjdF8hUf6vQPIChWIBhFzV8gjjsPE/fR3IyQdNY= -golang.org/x/lint v0.0.0-20210508222113-6edffad5e616/go.mod h1:3xt1FjdF8hUf6vQPIChWIBhFzV8gjjsPE/fR3IyQdNY= -golang.org/x/mobile v0.0.0-20190312151609-d3739f865fa6/go.mod h1:z+o9i4GpDbdi3rU15maQ/Ox0txvL9dWGYEHz965HBQE= -golang.org/x/mobile v0.0.0-20190719004257-d2bd2a29d028/go.mod h1:E/iHnbuqvinMTCcRqshq8CkpyQDoeVncDDYHnLhea+o= -golang.org/x/mod v0.0.0-20190513183733-4bf6d317e70e/go.mod h1:mXi4GBBbnImb6dmsKGUJ2LatrhH/nqhxcFungHvyanc= -golang.org/x/mod v0.1.0/go.mod h1:0QHyrYULN0/3qlju5TqG8bIK38QM8yzMo5ekMj3DlcY= -golang.org/x/mod v0.1.1-0.20191105210325-c90efee705ee/go.mod h1:QqPTAvyqsEbceGzBzNggFXnrqF1CaUcvgkdR5Ot7KZg= -golang.org/x/mod v0.1.1-0.20191107180719-034126e5016b/go.mod h1:QqPTAvyqsEbceGzBzNggFXnrqF1CaUcvgkdR5Ot7KZg= -golang.org/x/mod v0.2.0/go.mod h1:s0Qsj1ACt9ePp/hMypM3fl4fZqREWJwdYDEqhRiZZUA= -golang.org/x/mod v0.3.0/go.mod h1:s0Qsj1ACt9ePp/hMypM3fl4fZqREWJwdYDEqhRiZZUA= -golang.org/x/mod v0.4.0/go.mod h1:s0Qsj1ACt9ePp/hMypM3fl4fZqREWJwdYDEqhRiZZUA= -golang.org/x/mod v0.4.1/go.mod h1:s0Qsj1ACt9ePp/hMypM3fl4fZqREWJwdYDEqhRiZZUA= -golang.org/x/mod v0.4.2/go.mod h1:s0Qsj1ACt9ePp/hMypM3fl4fZqREWJwdYDEqhRiZZUA= -golang.org/x/mod v0.6.0-dev.0.20220419223038-86c51ed26bb4/go.mod h1:jJ57K6gSWd91VN4djpZkiMVwK6gcyfeH4XE8wZrZaV4= -golang.org/x/mod v0.8.0/go.mod h1:iBbtSCu2XBx23ZKBPSOrRkjjQPZFPuis4dIYUhu/chs= -golang.org/x/mod v0.9.0/go.mod h1:iBbtSCu2XBx23ZKBPSOrRkjjQPZFPuis4dIYUhu/chs= -golang.org/x/net v0.0.0-20180724234803-3673e40ba225/go.mod h1:mL1N/T3taQHkDXs73rZJwtUhF3w3ftmwwsq0BUmARs4= -golang.org/x/net v0.0.0-20180826012351-8a410e7b638d/go.mod h1:mL1N/T3taQHkDXs73rZJwtUhF3w3ftmwwsq0BUmARs4= -golang.org/x/net v0.0.0-20181023162649-9b4f9f5ad519/go.mod h1:mL1N/T3taQHkDXs73rZJwtUhF3w3ftmwwsq0BUmARs4= -golang.org/x/net v0.0.0-20181201002055-351d144fa1fc/go.mod h1:mL1N/T3taQHkDXs73rZJwtUhF3w3ftmwwsq0BUmARs4= -golang.org/x/net v0.0.0-20190108225652-1e06a53dbb7e/go.mod h1:mL1N/T3taQHkDXs73rZJwtUhF3w3ftmwwsq0BUmARs4= -golang.org/x/net v0.0.0-20190213061140-3a22650c66bd/go.mod h1:mL1N/T3taQHkDXs73rZJwtUhF3w3ftmwwsq0BUmARs4= -golang.org/x/net v0.0.0-20190311183353-d8887717615a/go.mod h1:t9HGtf8HONx5eT2rtn7q6eTqICYqUVnKs3thJo3Qplg= -golang.org/x/net v0.0.0-20190404232315-eb5bcb51f2a3/go.mod h1:t9HGtf8HONx5eT2rtn7q6eTqICYqUVnKs3thJo3Qplg= -golang.org/x/net v0.0.0-20190501004415-9ce7a6920f09/go.mod h1:t9HGtf8HONx5eT2rtn7q6eTqICYqUVnKs3thJo3Qplg= -golang.org/x/net v0.0.0-20190503192946-f4e77d36d62c/go.mod h1:t9HGtf8HONx5eT2rtn7q6eTqICYqUVnKs3thJo3Qplg= -golang.org/x/net v0.0.0-20190603091049-60506f45cf65/go.mod h1:HSz+uSET+XFnRR8LxR5pz3Of3rY3CfYBVs4xY44aLks= -golang.org/x/net v0.0.0-20190620200207-3b0461eec859/go.mod h1:z5CRVTTTmAJ677TzLLGU+0bjPO0LkuOLi4/5GtJWs/s= -golang.org/x/net v0.0.0-20190628185345-da137c7871d7/go.mod h1:z5CRVTTTmAJ677TzLLGU+0bjPO0LkuOLi4/5GtJWs/s= -golang.org/x/net v0.0.0-20190724013045-ca1201d0de80/go.mod h1:z5CRVTTTmAJ677TzLLGU+0bjPO0LkuOLi4/5GtJWs/s= -golang.org/x/net v0.0.0-20191209160850-c0dbc17a3553/go.mod h1:z5CRVTTTmAJ677TzLLGU+0bjPO0LkuOLi4/5GtJWs/s= -golang.org/x/net v0.0.0-20200114155413-6afb5195e5aa/go.mod h1:z5CRVTTTmAJ677TzLLGU+0bjPO0LkuOLi4/5GtJWs/s= -golang.org/x/net v0.0.0-20200202094626-16171245cfb2/go.mod h1:z5CRVTTTmAJ677TzLLGU+0bjPO0LkuOLi4/5GtJWs/s= -golang.org/x/net v0.0.0-20200222125558-5a598a2470a0/go.mod h1:z5CRVTTTmAJ677TzLLGU+0bjPO0LkuOLi4/5GtJWs/s= -golang.org/x/net v0.0.0-20200226121028-0de0cce0169b/go.mod h1:z5CRVTTTmAJ677TzLLGU+0bjPO0LkuOLi4/5GtJWs/s= -golang.org/x/net v0.0.0-20200301022130-244492dfa37a/go.mod h1:z5CRVTTTmAJ677TzLLGU+0bjPO0LkuOLi4/5GtJWs/s= -golang.org/x/net v0.0.0-20200324143707-d3edc9973b7e/go.mod h1:qpuaurCH72eLCgpAm/N6yyVIVM9cpaDIP3A8BGJEC5A= -golang.org/x/net v0.0.0-20200501053045-e0ff5e5a1de5/go.mod h1:qpuaurCH72eLCgpAm/N6yyVIVM9cpaDIP3A8BGJEC5A= -golang.org/x/net v0.0.0-20200506145744-7e3656a0809f/go.mod h1:qpuaurCH72eLCgpAm/N6yyVIVM9cpaDIP3A8BGJEC5A= -golang.org/x/net v0.0.0-20200513185701-a91f0712d120/go.mod h1:qpuaurCH72eLCgpAm/N6yyVIVM9cpaDIP3A8BGJEC5A= -golang.org/x/net v0.0.0-20200520182314-0ba52f642ac2/go.mod h1:qpuaurCH72eLCgpAm/N6yyVIVM9cpaDIP3A8BGJEC5A= -golang.org/x/net v0.0.0-20200625001655-4c5254603344/go.mod h1:/O7V0waA8r7cgGh81Ro3o1hOxt32SMVPicZroKQ2sZA= -golang.org/x/net v0.0.0-20200707034311-ab3426394381/go.mod h1:/O7V0waA8r7cgGh81Ro3o1hOxt32SMVPicZroKQ2sZA= -golang.org/x/net v0.0.0-20200822124328-c89045814202/go.mod h1:/O7V0waA8r7cgGh81Ro3o1hOxt32SMVPicZroKQ2sZA= -golang.org/x/net v0.0.0-20201021035429-f5854403a974/go.mod h1:sp8m0HH+o8qH0wwXwYZr8TS3Oi6o0r6Gce1SSxlDquU= -golang.org/x/net v0.0.0-20201031054903-ff519b6c9102/go.mod h1:sp8m0HH+o8qH0wwXwYZr8TS3Oi6o0r6Gce1SSxlDquU= -golang.org/x/net v0.0.0-20201110031124-69a78807bb2b/go.mod h1:sp8m0HH+o8qH0wwXwYZr8TS3Oi6o0r6Gce1SSxlDquU= -golang.org/x/net v0.0.0-20201209123823-ac852fbbde11/go.mod h1:m0MpNAwzfU5UDzcl9v0D8zg8gWTRqZa9RBIspLL5mdg= -golang.org/x/net v0.0.0-20210119194325-5f4716e94777/go.mod h1:m0MpNAwzfU5UDzcl9v0D8zg8gWTRqZa9RBIspLL5mdg= -golang.org/x/net v0.0.0-20210226172049-e18ecbb05110/go.mod h1:m0MpNAwzfU5UDzcl9v0D8zg8gWTRqZa9RBIspLL5mdg= -golang.org/x/net v0.0.0-20210316092652-d523dce5a7f4/go.mod h1:RBQZq4jEuRlivfhVLdyRGr576XBO4/greRjx4P4O3yc= -golang.org/x/net v0.0.0-20210405180319-a5a99cb37ef4/go.mod h1:p54w0d4576C0XHj96bSt6lcn1PtDYWL6XObtHCRCNQM= -golang.org/x/net v0.0.0-20220722155237-a158d28d115b/go.mod h1:XRhObCWvk6IyKnWLug+ECip1KBveYUHfp+8e9klMJ9c= -golang.org/x/net v0.6.0/go.mod h1:2Tu9+aMcznHK/AK1HMvgo6xiTLG5rD5rZLDS+rp2Bjs= -golang.org/x/net v0.8.0/go.mod h1:QVkue5JL9kW//ek3r6jTKnTFis1tRmNAW2P1shuFdJc= -golang.org/x/oauth2 v0.0.0-20180821212333-d2e6202438be/go.mod h1:N/0e6XlmueqKjAGxoOufVs8QHGRruUQn6yWY3a++T0U= -golang.org/x/oauth2 v0.0.0-20190226205417-e64efc72b421/go.mod h1:gOpvHmFTYa4IltrdGE7lF6nIHvwfUNPOp7c8zoXwtLw= -golang.org/x/oauth2 v0.0.0-20190604053449-0f29369cfe45/go.mod h1:gOpvHmFTYa4IltrdGE7lF6nIHvwfUNPOp7c8zoXwtLw= -golang.org/x/oauth2 v0.0.0-20191202225959-858c2ad4c8b6/go.mod h1:gOpvHmFTYa4IltrdGE7lF6nIHvwfUNPOp7c8zoXwtLw= -golang.org/x/oauth2 v0.0.0-20200107190931-bf48bf16ab8d/go.mod h1:gOpvHmFTYa4IltrdGE7lF6nIHvwfUNPOp7c8zoXwtLw= -golang.org/x/oauth2 v0.0.0-20200902213428-5d25da1a8d43/go.mod h1:KelEdhl1UZF7XfJ4dDtk6s++YSgaE7mD/BuKKDLBl4A= -golang.org/x/oauth2 v0.0.0-20201109201403-9fd604954f58/go.mod h1:KelEdhl1UZF7XfJ4dDtk6s++YSgaE7mD/BuKKDLBl4A= -golang.org/x/oauth2 v0.0.0-20201208152858-08078c50e5b5/go.mod h1:KelEdhl1UZF7XfJ4dDtk6s++YSgaE7mD/BuKKDLBl4A= -golang.org/x/oauth2 v0.0.0-20210218202405-ba52d332ba99/go.mod h1:KelEdhl1UZF7XfJ4dDtk6s++YSgaE7mD/BuKKDLBl4A= -golang.org/x/oauth2 v0.0.0-20210220000619-9bb904979d93/go.mod h1:KelEdhl1UZF7XfJ4dDtk6s++YSgaE7mD/BuKKDLBl4A= -golang.org/x/oauth2 v0.0.0-20210313182246-cd4f82c27b84/go.mod h1:KelEdhl1UZF7XfJ4dDtk6s++YSgaE7mD/BuKKDLBl4A= -golang.org/x/oauth2 v0.0.0-20210402161424-2e8d93401602/go.mod h1:KelEdhl1UZF7XfJ4dDtk6s++YSgaE7mD/BuKKDLBl4A= -golang.org/x/sync v0.0.0-20180314180146-1d60e4601c6f/go.mod h1:RxMgew5VJxzue5/jJTE5uejpjVlOe/izrB70Jof72aM= -golang.org/x/sync v0.0.0-20181108010431-42b317875d0f/go.mod h1:RxMgew5VJxzue5/jJTE5uejpjVlOe/izrB70Jof72aM= -golang.org/x/sync v0.0.0-20181221193216-37e7f081c4d4/go.mod h1:RxMgew5VJxzue5/jJTE5uejpjVlOe/izrB70Jof72aM= -golang.org/x/sync v0.0.0-20190227155943-e225da77a7e6/go.mod h1:RxMgew5VJxzue5/jJTE5uejpjVlOe/izrB70Jof72aM= -golang.org/x/sync v0.0.0-20190423024810-112230192c58/go.mod h1:RxMgew5VJxzue5/jJTE5uejpjVlOe/izrB70Jof72aM= -golang.org/x/sync v0.0.0-20190911185100-cd5d95a43a6e/go.mod h1:RxMgew5VJxzue5/jJTE5uejpjVlOe/izrB70Jof72aM= -golang.org/x/sync v0.0.0-20200317015054-43a5402ce75a/go.mod h1:RxMgew5VJxzue5/jJTE5uejpjVlOe/izrB70Jof72aM= -golang.org/x/sync v0.0.0-20200625203802-6e8e738ad208/go.mod h1:RxMgew5VJxzue5/jJTE5uejpjVlOe/izrB70Jof72aM= -golang.org/x/sync v0.0.0-20201020160332-67f06af15bc9/go.mod h1:RxMgew5VJxzue5/jJTE5uejpjVlOe/izrB70Jof72aM= -golang.org/x/sync v0.0.0-20201207232520-09787c993a3a/go.mod h1:RxMgew5VJxzue5/jJTE5uejpjVlOe/izrB70Jof72aM= -golang.org/x/sync v0.0.0-20210220032951-036812b2e83c/go.mod h1:RxMgew5VJxzue5/jJTE5uejpjVlOe/izrB70Jof72aM= -golang.org/x/sync v0.0.0-20220722155255-886fb9371eb4/go.mod h1:RxMgew5VJxzue5/jJTE5uejpjVlOe/izrB70Jof72aM= -golang.org/x/sync v0.1.0/go.mod h1:RxMgew5VJxzue5/jJTE5uejpjVlOe/izrB70Jof72aM= -golang.org/x/sync v0.19.0 h1:vV+1eWNmZ5geRlYjzm2adRgW2/mcpevXNg50YZtPCE4= -golang.org/x/sync v0.19.0/go.mod h1:9KTHXmSnoGruLpwFjVSX0lNNA75CykiMECbovNTZqGI= -golang.org/x/sys v0.0.0-20180823144017-11551d06cbcc/go.mod h1:STP8DvDyc/dI5b8T5hshtkjS+E42TnysNCUPdjciGhY= -golang.org/x/sys v0.0.0-20180830151530-49385e6e1522/go.mod h1:STP8DvDyc/dI5b8T5hshtkjS+E42TnysNCUPdjciGhY= -golang.org/x/sys v0.0.0-20181026203630-95b1ffbd15a5/go.mod h1:STP8DvDyc/dI5b8T5hshtkjS+E42TnysNCUPdjciGhY= -golang.org/x/sys v0.0.0-20190215142949-d0b11bdaac8a/go.mod h1:STP8DvDyc/dI5b8T5hshtkjS+E42TnysNCUPdjciGhY= -golang.org/x/sys v0.0.0-20190312061237-fead79001313/go.mod h1:h1NjWce9XRLGQEsW7wpKNCjG9DtNlClVuFLEZdDNbEs= -golang.org/x/sys v0.0.0-20190412213103-97732733099d/go.mod h1:h1NjWce9XRLGQEsW7wpKNCjG9DtNlClVuFLEZdDNbEs= -golang.org/x/sys v0.0.0-20190502145724-3ef323f4f1fd/go.mod h1:h1NjWce9XRLGQEsW7wpKNCjG9DtNlClVuFLEZdDNbEs= -golang.org/x/sys v0.0.0-20190507160741-ecd444e8653b/go.mod h1:h1NjWce9XRLGQEsW7wpKNCjG9DtNlClVuFLEZdDNbEs= -golang.org/x/sys v0.0.0-20190606165138-5da285871e9c/go.mod h1:h1NjWce9XRLGQEsW7wpKNCjG9DtNlClVuFLEZdDNbEs= -golang.org/x/sys v0.0.0-20190624142023-c5567b49c5d0/go.mod h1:h1NjWce9XRLGQEsW7wpKNCjG9DtNlClVuFLEZdDNbEs= -golang.org/x/sys v0.0.0-20190726091711-fc99dfbffb4e/go.mod h1:h1NjWce9XRLGQEsW7wpKNCjG9DtNlClVuFLEZdDNbEs= -golang.org/x/sys v0.0.0-20191001151750-bb3f8db39f24/go.mod h1:h1NjWce9XRLGQEsW7wpKNCjG9DtNlClVuFLEZdDNbEs= -golang.org/x/sys v0.0.0-20191005200804-aed5e4c7ecf9/go.mod h1:h1NjWce9XRLGQEsW7wpKNCjG9DtNlClVuFLEZdDNbEs= -golang.org/x/sys v0.0.0-20191026070338-33540a1f6037/go.mod h1:h1NjWce9XRLGQEsW7wpKNCjG9DtNlClVuFLEZdDNbEs= -golang.org/x/sys v0.0.0-20191204072324-ce4227a45e2e/go.mod h1:h1NjWce9XRLGQEsW7wpKNCjG9DtNlClVuFLEZdDNbEs= -golang.org/x/sys v0.0.0-20191228213918-04cbcbbfeed8/go.mod h1:h1NjWce9XRLGQEsW7wpKNCjG9DtNlClVuFLEZdDNbEs= -golang.org/x/sys v0.0.0-20200113162924-86b910548bc1/go.mod h1:h1NjWce9XRLGQEsW7wpKNCjG9DtNlClVuFLEZdDNbEs= -golang.org/x/sys v0.0.0-20200122134326-e047566fdf82/go.mod h1:h1NjWce9XRLGQEsW7wpKNCjG9DtNlClVuFLEZdDNbEs= -golang.org/x/sys v0.0.0-20200202164722-d101bd2416d5/go.mod h1:h1NjWce9XRLGQEsW7wpKNCjG9DtNlClVuFLEZdDNbEs= -golang.org/x/sys v0.0.0-20200212091648-12a6c2dcc1e4/go.mod h1:h1NjWce9XRLGQEsW7wpKNCjG9DtNlClVuFLEZdDNbEs= -golang.org/x/sys v0.0.0-20200223170610-d5e6a3e2c0ae/go.mod h1:h1NjWce9XRLGQEsW7wpKNCjG9DtNlClVuFLEZdDNbEs= -golang.org/x/sys v0.0.0-20200302150141-5c8b2ff67527/go.mod h1:h1NjWce9XRLGQEsW7wpKNCjG9DtNlClVuFLEZdDNbEs= -golang.org/x/sys v0.0.0-20200323222414-85ca7c5b95cd/go.mod h1:h1NjWce9XRLGQEsW7wpKNCjG9DtNlClVuFLEZdDNbEs= -golang.org/x/sys v0.0.0-20200331124033-c3d80250170d/go.mod h1:h1NjWce9XRLGQEsW7wpKNCjG9DtNlClVuFLEZdDNbEs= -golang.org/x/sys v0.0.0-20200501052902-10377860bb8e/go.mod h1:h1NjWce9XRLGQEsW7wpKNCjG9DtNlClVuFLEZdDNbEs= -golang.org/x/sys v0.0.0-20200511232937-7e40ca221e25/go.mod h1:h1NjWce9XRLGQEsW7wpKNCjG9DtNlClVuFLEZdDNbEs= -golang.org/x/sys v0.0.0-20200515095857-1151b9dac4a9/go.mod h1:h1NjWce9XRLGQEsW7wpKNCjG9DtNlClVuFLEZdDNbEs= -golang.org/x/sys v0.0.0-20200523222454-059865788121/go.mod h1:h1NjWce9XRLGQEsW7wpKNCjG9DtNlClVuFLEZdDNbEs= -golang.org/x/sys v0.0.0-20200803210538-64077c9b5642/go.mod h1:h1NjWce9XRLGQEsW7wpKNCjG9DtNlClVuFLEZdDNbEs= -golang.org/x/sys v0.0.0-20200905004654-be1d3432aa8f/go.mod h1:h1NjWce9XRLGQEsW7wpKNCjG9DtNlClVuFLEZdDNbEs= -golang.org/x/sys v0.0.0-20200930185726-fdedc70b468f/go.mod h1:h1NjWce9XRLGQEsW7wpKNCjG9DtNlClVuFLEZdDNbEs= -golang.org/x/sys v0.0.0-20201119102817-f84b799fce68/go.mod h1:h1NjWce9XRLGQEsW7wpKNCjG9DtNlClVuFLEZdDNbEs= -golang.org/x/sys v0.0.0-20201201145000-ef89a241ccb3/go.mod h1:h1NjWce9XRLGQEsW7wpKNCjG9DtNlClVuFLEZdDNbEs= -golang.org/x/sys v0.0.0-20210104204734-6f8348627aad/go.mod h1:h1NjWce9XRLGQEsW7wpKNCjG9DtNlClVuFLEZdDNbEs= -golang.org/x/sys v0.0.0-20210119212857-b64e53b001e4/go.mod h1:h1NjWce9XRLGQEsW7wpKNCjG9DtNlClVuFLEZdDNbEs= -golang.org/x/sys v0.0.0-20210220050731-9a76102bfb43/go.mod h1:h1NjWce9XRLGQEsW7wpKNCjG9DtNlClVuFLEZdDNbEs= -golang.org/x/sys v0.0.0-20210305230114-8fe3ee5dd75b/go.mod h1:h1NjWce9XRLGQEsW7wpKNCjG9DtNlClVuFLEZdDNbEs= -golang.org/x/sys v0.0.0-20210315160823-c6e025ad8005/go.mod h1:h1NjWce9XRLGQEsW7wpKNCjG9DtNlClVuFLEZdDNbEs= -golang.org/x/sys v0.0.0-20210320140829-1e4c9ba3b0c4/go.mod h1:h1NjWce9XRLGQEsW7wpKNCjG9DtNlClVuFLEZdDNbEs= -golang.org/x/sys v0.0.0-20210330210617-4fbd30eecc44/go.mod h1:h1NjWce9XRLGQEsW7wpKNCjG9DtNlClVuFLEZdDNbEs= -golang.org/x/sys v0.0.0-20210403161142-5e06dd20ab57/go.mod h1:h1NjWce9XRLGQEsW7wpKNCjG9DtNlClVuFLEZdDNbEs= -golang.org/x/sys v0.0.0-20210510120138-977fb7262007/go.mod h1:oPkhp1MJrh7nUepCBck5+mAzfO9JrbApNNgaTdGDITg= -golang.org/x/sys v0.0.0-20210615035016-665e8c7367d1/go.mod h1:oPkhp1MJrh7nUepCBck5+mAzfO9JrbApNNgaTdGDITg= -golang.org/x/sys v0.0.0-20210630005230-0f9fa26af87c/go.mod h1:oPkhp1MJrh7nUepCBck5+mAzfO9JrbApNNgaTdGDITg= -golang.org/x/sys v0.0.0-20220520151302-bc2c85ada10a/go.mod h1:oPkhp1MJrh7nUepCBck5+mAzfO9JrbApNNgaTdGDITg= -golang.org/x/sys v0.0.0-20220722155257-8c9f86f7a55f/go.mod h1:oPkhp1MJrh7nUepCBck5+mAzfO9JrbApNNgaTdGDITg= +golang.org/x/sync v0.20.0 h1:e0PTpb7pjO8GAtTs2dQ6jYa5BWYlMuX047Dco/pItO4= +golang.org/x/sync v0.20.0/go.mod h1:9xrNwdLfx4jkKbNva9FpL6vEN7evnE43NNNJQ2LF3+0= golang.org/x/sys v0.0.0-20220811171246-fbc7d0a398ab/go.mod h1:oPkhp1MJrh7nUepCBck5+mAzfO9JrbApNNgaTdGDITg= -golang.org/x/sys v0.5.0/go.mod h1:oPkhp1MJrh7nUepCBck5+mAzfO9JrbApNNgaTdGDITg= golang.org/x/sys v0.6.0/go.mod h1:oPkhp1MJrh7nUepCBck5+mAzfO9JrbApNNgaTdGDITg= golang.org/x/sys v0.12.0/go.mod h1:oPkhp1MJrh7nUepCBck5+mAzfO9JrbApNNgaTdGDITg= -golang.org/x/sys v0.41.0 h1:Ivj+2Cp/ylzLiEU89QhWblYnOE9zerudt9Ftecq2C6k= -golang.org/x/sys v0.41.0/go.mod h1:OgkHotnGiDImocRcuBABYBEXf8A9a87e/uXjp9XT3ks= golang.org/x/sys v0.43.0 h1:Rlag2XtaFTxp19wS8MXlJwTvoh8ArU6ezoyFsMyCTNI= golang.org/x/sys v0.43.0/go.mod h1:4GL1E5IUh+htKOUEOaiffhrAeqysfVGipDYzABqnCmw= -golang.org/x/term v0.0.0-20201126162022-7de9c90e9dd1/go.mod h1:bj7SfCRtBDWHUb9snDiAeCFNEtKQo2Wmx5Cou7ajbmo= -golang.org/x/term v0.0.0-20210927222741-03fcf44c2211/go.mod h1:jbD1KX2456YbFQfuXm/mYQcufACuNUgVhRMnK/tPxf8= -golang.org/x/term v0.5.0/go.mod h1:jMB1sMXY+tzblOD4FWmEbocvup2/aLOaQEp7JmGp78k= -golang.org/x/term v0.6.0/go.mod h1:m6U89DPEgQRMq3DNkDClhWw02AUbt2daBVO4cn4Hv9U= -golang.org/x/text v0.0.0-20170915032832-14c0d48ead0c/go.mod h1:NqM8EUOU14njkJ3fqMW+pc6Ldnwhi/IjpwHt7yyuwOQ= -golang.org/x/text v0.3.0/go.mod h1:NqM8EUOU14njkJ3fqMW+pc6Ldnwhi/IjpwHt7yyuwOQ= -golang.org/x/text v0.3.1-0.20180807135948-17ff2d5776d2/go.mod h1:NqM8EUOU14njkJ3fqMW+pc6Ldnwhi/IjpwHt7yyuwOQ= -golang.org/x/text v0.3.2/go.mod h1:bEr9sfX3Q8Zfm5fL9x+3itogRgK3+ptLWKqgva+5dAk= -golang.org/x/text v0.3.3/go.mod h1:5Zoc/QRtKVWzQhOtBMvqHzDpF6irO9z98xDceosuGiQ= -golang.org/x/text v0.3.4/go.mod h1:5Zoc/QRtKVWzQhOtBMvqHzDpF6irO9z98xDceosuGiQ= -golang.org/x/text v0.3.5/go.mod h1:5Zoc/QRtKVWzQhOtBMvqHzDpF6irO9z98xDceosuGiQ= -golang.org/x/text v0.3.7/go.mod h1:u+2+/6zg+i71rQMx5EYifcz6MCKuco9NR6JIITiCfzQ= -golang.org/x/text v0.7.0/go.mod h1:mrYo+phRRbMaCq/xk9113O4dZlRixOauAjOtrjsXDZ8= -golang.org/x/text v0.8.0/go.mod h1:e1OnstbJyHTd6l/uOt8jFFHp6TRDWZR/bV3emEE/zU8= -golang.org/x/time v0.0.0-20181108054448-85acf8d2951c/go.mod h1:tRJNPiyCQ0inRvYxbN9jk5I+vvW/OXSQhTDSoE431IQ= -golang.org/x/time v0.0.0-20190308202827-9d24e82272b4/go.mod h1:tRJNPiyCQ0inRvYxbN9jk5I+vvW/OXSQhTDSoE431IQ= -golang.org/x/time v0.0.0-20191024005414-555d28b269f0/go.mod h1:tRJNPiyCQ0inRvYxbN9jk5I+vvW/OXSQhTDSoE431IQ= -golang.org/x/tools v0.0.0-20180917221912-90fa682c2a6e/go.mod h1:n7NCudcB/nEzxVGmLbDWY5pfWTLqBcC2KZ6jyYvM4mQ= -golang.org/x/tools v0.0.0-20190114222345-bf090417da8b/go.mod h1:n7NCudcB/nEzxVGmLbDWY5pfWTLqBcC2KZ6jyYvM4mQ= -golang.org/x/tools v0.0.0-20190226205152-f727befe758c/go.mod h1:9Yl7xja0Znq3iFh3HoIrodX9oNMXvdceNzlUR8zjMvY= -golang.org/x/tools v0.0.0-20190311212946-11955173bddd/go.mod h1:LCzVGOaR6xXOjkQ3onu1FJEFr0SW1gC7cKk1uF8kGRs= -golang.org/x/tools v0.0.0-20190312151545-0bb0c0a6e846/go.mod h1:LCzVGOaR6xXOjkQ3onu1FJEFr0SW1gC7cKk1uF8kGRs= -golang.org/x/tools v0.0.0-20190312170243-e65039ee4138/go.mod h1:LCzVGOaR6xXOjkQ3onu1FJEFr0SW1gC7cKk1uF8kGRs= -golang.org/x/tools v0.0.0-20190328211700-ab21143f2384/go.mod h1:LCzVGOaR6xXOjkQ3onu1FJEFr0SW1gC7cKk1uF8kGRs= -golang.org/x/tools v0.0.0-20190425150028-36563e24a262/go.mod h1:RgjU9mgBXZiqYHBnxXauZ1Gv1EHHAz9KjViQ78xBX0Q= -golang.org/x/tools v0.0.0-20190506145303-2d16b83fe98c/go.mod h1:RgjU9mgBXZiqYHBnxXauZ1Gv1EHHAz9KjViQ78xBX0Q= -golang.org/x/tools v0.0.0-20190524140312-2c0ae7006135/go.mod h1:RgjU9mgBXZiqYHBnxXauZ1Gv1EHHAz9KjViQ78xBX0Q= -golang.org/x/tools v0.0.0-20190606124116-d0a3d012864b/go.mod h1:/rFqwRUd4F7ZHNgwSSTFct+R/Kf4OFW1sUzUTQQTgfc= -golang.org/x/tools v0.0.0-20190621195816-6e04913cbbac/go.mod h1:/rFqwRUd4F7ZHNgwSSTFct+R/Kf4OFW1sUzUTQQTgfc= -golang.org/x/tools v0.0.0-20190628153133-6cdbf07be9d0/go.mod h1:/rFqwRUd4F7ZHNgwSSTFct+R/Kf4OFW1sUzUTQQTgfc= -golang.org/x/tools v0.0.0-20190816200558-6889da9d5479/go.mod h1:b+2E5dAYhXwXZwtnZ6UAqBI28+e2cm9otk0dWdXHAEo= -golang.org/x/tools v0.0.0-20190911174233-4f2ddba30aff/go.mod h1:b+2E5dAYhXwXZwtnZ6UAqBI28+e2cm9otk0dWdXHAEo= -golang.org/x/tools v0.0.0-20191012152004-8de300cfc20a/go.mod h1:b+2E5dAYhXwXZwtnZ6UAqBI28+e2cm9otk0dWdXHAEo= -golang.org/x/tools v0.0.0-20191112195655-aa38f8e97acc/go.mod h1:b+2E5dAYhXwXZwtnZ6UAqBI28+e2cm9otk0dWdXHAEo= -golang.org/x/tools v0.0.0-20191113191852-77e3bb0ad9e7/go.mod h1:b+2E5dAYhXwXZwtnZ6UAqBI28+e2cm9otk0dWdXHAEo= -golang.org/x/tools v0.0.0-20191115202509-3a792d9c32b2/go.mod h1:b+2E5dAYhXwXZwtnZ6UAqBI28+e2cm9otk0dWdXHAEo= -golang.org/x/tools v0.0.0-20191119224855-298f0cb1881e/go.mod h1:b+2E5dAYhXwXZwtnZ6UAqBI28+e2cm9otk0dWdXHAEo= -golang.org/x/tools v0.0.0-20191125144606-a911d9008d1f/go.mod h1:b+2E5dAYhXwXZwtnZ6UAqBI28+e2cm9otk0dWdXHAEo= -golang.org/x/tools v0.0.0-20191130070609-6e064ea0cf2d/go.mod h1:b+2E5dAYhXwXZwtnZ6UAqBI28+e2cm9otk0dWdXHAEo= -golang.org/x/tools v0.0.0-20191216173652-a0e659d51361/go.mod h1:TB2adYChydJhpapKDTa4BR/hXlZSLoq2Wpct/0txZ28= -golang.org/x/tools v0.0.0-20191227053925-7b8e75db28f4/go.mod h1:TB2adYChydJhpapKDTa4BR/hXlZSLoq2Wpct/0txZ28= -golang.org/x/tools v0.0.0-20200117161641-43d50277825c/go.mod h1:TB2adYChydJhpapKDTa4BR/hXlZSLoq2Wpct/0txZ28= -golang.org/x/tools v0.0.0-20200122220014-bf1340f18c4a/go.mod h1:TB2adYChydJhpapKDTa4BR/hXlZSLoq2Wpct/0txZ28= -golang.org/x/tools v0.0.0-20200130002326-2f3ba24bd6e7/go.mod h1:TB2adYChydJhpapKDTa4BR/hXlZSLoq2Wpct/0txZ28= -golang.org/x/tools v0.0.0-20200204074204-1cc6d1ef6c74/go.mod h1:TB2adYChydJhpapKDTa4BR/hXlZSLoq2Wpct/0txZ28= -golang.org/x/tools v0.0.0-20200207183749-b753a1ba74fa/go.mod h1:TB2adYChydJhpapKDTa4BR/hXlZSLoq2Wpct/0txZ28= -golang.org/x/tools v0.0.0-20200212150539-ea181f53ac56/go.mod h1:TB2adYChydJhpapKDTa4BR/hXlZSLoq2Wpct/0txZ28= -golang.org/x/tools v0.0.0-20200224181240-023911ca70b2/go.mod h1:TB2adYChydJhpapKDTa4BR/hXlZSLoq2Wpct/0txZ28= -golang.org/x/tools v0.0.0-20200227222343-706bc42d1f0d/go.mod h1:TB2adYChydJhpapKDTa4BR/hXlZSLoq2Wpct/0txZ28= -golang.org/x/tools v0.0.0-20200304193943-95d2e580d8eb/go.mod h1:o4KQGtdN14AW+yjsvvwRTJJuXz8XRtIHtEnmAXLyFUw= -golang.org/x/tools v0.0.0-20200312045724-11d5b4c81c7d/go.mod h1:o4KQGtdN14AW+yjsvvwRTJJuXz8XRtIHtEnmAXLyFUw= -golang.org/x/tools v0.0.0-20200331025713-a30bf2db82d4/go.mod h1:Sl4aGygMT6LrqrWclx+PTx3U+LnKx/seiNR+3G19Ar8= -golang.org/x/tools v0.0.0-20200501065659-ab2804fb9c9d/go.mod h1:EkVYQZoAsY45+roYkvgYkIh4xh/qjgUK9TdY2XT94GE= -golang.org/x/tools v0.0.0-20200512131952-2bc93b1c0c88/go.mod h1:EkVYQZoAsY45+roYkvgYkIh4xh/qjgUK9TdY2XT94GE= -golang.org/x/tools v0.0.0-20200515010526-7d3b6ebf133d/go.mod h1:EkVYQZoAsY45+roYkvgYkIh4xh/qjgUK9TdY2XT94GE= -golang.org/x/tools v0.0.0-20200618134242-20370b0cb4b2/go.mod h1:EkVYQZoAsY45+roYkvgYkIh4xh/qjgUK9TdY2XT94GE= -golang.org/x/tools v0.0.0-20200619180055-7c47624df98f/go.mod h1:EkVYQZoAsY45+roYkvgYkIh4xh/qjgUK9TdY2XT94GE= -golang.org/x/tools v0.0.0-20200729194436-6467de6f59a7/go.mod h1:njjCfa9FT2d7l9Bc6FUM5FLjQPp3cFF28FI3qnDFljA= -golang.org/x/tools v0.0.0-20200804011535-6c149bb5ef0d/go.mod h1:njjCfa9FT2d7l9Bc6FUM5FLjQPp3cFF28FI3qnDFljA= -golang.org/x/tools v0.0.0-20200825202427-b303f430e36d/go.mod h1:njjCfa9FT2d7l9Bc6FUM5FLjQPp3cFF28FI3qnDFljA= -golang.org/x/tools v0.0.0-20200904185747-39188db58858/go.mod h1:Cj7w3i3Rnn0Xh82ur9kSqwfTHTeVxaDqrfMjpcNT6bE= -golang.org/x/tools v0.0.0-20201105001634-bc3cf281b174/go.mod h1:emZCQorbCU4vsT4fOWvOPXz4eW1wZW4PmDk9uLelYpA= -golang.org/x/tools v0.0.0-20201110124207-079ba7bd75cd/go.mod h1:emZCQorbCU4vsT4fOWvOPXz4eW1wZW4PmDk9uLelYpA= -golang.org/x/tools v0.0.0-20201201161351-ac6f37ff4c2a/go.mod h1:emZCQorbCU4vsT4fOWvOPXz4eW1wZW4PmDk9uLelYpA= -golang.org/x/tools v0.0.0-20201208233053-a543418bbed2/go.mod h1:emZCQorbCU4vsT4fOWvOPXz4eW1wZW4PmDk9uLelYpA= -golang.org/x/tools v0.0.0-20210105154028-b0ab187a4818/go.mod h1:emZCQorbCU4vsT4fOWvOPXz4eW1wZW4PmDk9uLelYpA= -golang.org/x/tools v0.0.0-20210106214847-113979e3529a/go.mod h1:emZCQorbCU4vsT4fOWvOPXz4eW1wZW4PmDk9uLelYpA= -golang.org/x/tools v0.1.0/go.mod h1:xkSsbof2nBLbhDlRMhhhyNLN/zl3eTqcnHD5viDpcZ0= -golang.org/x/tools v0.1.2/go.mod h1:o0xws9oXOQQZyjljx8fwUC0k7L1pTE6eaCbjGeHmOkk= -golang.org/x/tools v0.1.5/go.mod h1:o0xws9oXOQQZyjljx8fwUC0k7L1pTE6eaCbjGeHmOkk= -golang.org/x/tools v0.1.12/go.mod h1:hNGJHUnrk76NpqgfD5Aqm5Crs+Hm0VOH/i9J2+nxYbc= -golang.org/x/tools v0.6.0/go.mod h1:Xwgl3UAJ/d3gWutnCtw505GrjyAbvKui8lOU390QaIU= -golang.org/x/tools v0.7.0/go.mod h1:4pg6aUX35JBAogB10C9AtvVL+qowtN4pT3CGSQex14s= -golang.org/x/tools v0.42.0 h1:uNgphsn75Tdz5Ji2q36v/nsFSfR/9BRFvqhGBaJGd5k= -golang.org/x/tools v0.42.0/go.mod h1:Ma6lCIwGZvHK6XtgbswSoWroEkhugApmsXyrUmBhfr0= -golang.org/x/xerrors v0.0.0-20190717185122-a985d3407aa7/go.mod h1:I/5z698sn9Ka8TeJc9MKroUUfqBBauWjQqLJ2OPfmY0= -golang.org/x/xerrors v0.0.0-20191011141410-1b5146add898/go.mod h1:I/5z698sn9Ka8TeJc9MKroUUfqBBauWjQqLJ2OPfmY0= -golang.org/x/xerrors v0.0.0-20191204190536-9bdfabe68543/go.mod h1:I/5z698sn9Ka8TeJc9MKroUUfqBBauWjQqLJ2OPfmY0= -golang.org/x/xerrors v0.0.0-20200804184101-5ec99f83aff1/go.mod h1:I/5z698sn9Ka8TeJc9MKroUUfqBBauWjQqLJ2OPfmY0= -google.golang.org/api v0.4.0/go.mod h1:8k5glujaEP+g9n7WNsDg8QP6cUVNI86fCNMcbazEtwE= -google.golang.org/api v0.7.0/go.mod h1:WtwebWUNSVBH/HAw79HIFXZNqEvBhG+Ra+ax0hx3E3M= -google.golang.org/api v0.8.0/go.mod h1:o4eAsZoiT+ibD93RtjEohWalFOjRDx6CVaqeizhEnKg= -google.golang.org/api v0.9.0/go.mod h1:o4eAsZoiT+ibD93RtjEohWalFOjRDx6CVaqeizhEnKg= -google.golang.org/api v0.13.0/go.mod h1:iLdEw5Ide6rF15KTC1Kkl0iskquN2gFfn9o9XIsbkAI= -google.golang.org/api v0.14.0/go.mod h1:iLdEw5Ide6rF15KTC1Kkl0iskquN2gFfn9o9XIsbkAI= -google.golang.org/api v0.15.0/go.mod h1:iLdEw5Ide6rF15KTC1Kkl0iskquN2gFfn9o9XIsbkAI= -google.golang.org/api v0.17.0/go.mod h1:BwFmGc8tA3vsd7r/7kR8DY7iEEGSU04BFxCo5jP/sfE= -google.golang.org/api v0.18.0/go.mod h1:BwFmGc8tA3vsd7r/7kR8DY7iEEGSU04BFxCo5jP/sfE= -google.golang.org/api v0.19.0/go.mod h1:BwFmGc8tA3vsd7r/7kR8DY7iEEGSU04BFxCo5jP/sfE= -google.golang.org/api v0.20.0/go.mod h1:BwFmGc8tA3vsd7r/7kR8DY7iEEGSU04BFxCo5jP/sfE= -google.golang.org/api v0.22.0/go.mod h1:BwFmGc8tA3vsd7r/7kR8DY7iEEGSU04BFxCo5jP/sfE= -google.golang.org/api v0.24.0/go.mod h1:lIXQywCXRcnZPGlsd8NbLnOjtAoL6em04bJ9+z0MncE= -google.golang.org/api v0.28.0/go.mod h1:lIXQywCXRcnZPGlsd8NbLnOjtAoL6em04bJ9+z0MncE= -google.golang.org/api v0.29.0/go.mod h1:Lcubydp8VUV7KeIHD9z2Bys/sm/vGKnG1UHuDBSrHWM= -google.golang.org/api v0.30.0/go.mod h1:QGmEvQ87FHZNiUVJkT14jQNYJ4ZJjdRF23ZXz5138Fc= -google.golang.org/api v0.35.0/go.mod h1:/XrVsuzM0rZmrsbjJutiuftIzeuTQcEeaYcSk/mQ1dg= -google.golang.org/api v0.36.0/go.mod h1:+z5ficQTmoYpPn8LCUNVpK5I7hwkpjbcgqA7I34qYtE= -google.golang.org/api v0.40.0/go.mod h1:fYKFpnQN0DsDSKRVRcQSDQNtqWPfM9i+zNPxepjRCQ8= -google.golang.org/api v0.41.0/go.mod h1:RkxM5lITDfTzmyKFPt+wGrCJbVfniCr2ool8kTBzRTU= -google.golang.org/api v0.43.0/go.mod h1:nQsDGjRXMo4lvh5hP0TKqF244gqhGcr/YSIykhUk/94= -google.golang.org/api v0.44.0/go.mod h1:EBOGZqzyhtvMDoxwS97ctnh0zUmYY6CxqXsc1AvkYD8= -google.golang.org/appengine v1.1.0/go.mod h1:EbEs0AVv82hx2wNQdGPgUI5lhzA/G0D9YwlJXL52JkM= -google.golang.org/appengine v1.4.0/go.mod h1:xpcJRLb0r/rnEns0DIKYYv+WjYCduHsrkT7/EB5XEv4= -google.golang.org/appengine v1.5.0/go.mod h1:xpcJRLb0r/rnEns0DIKYYv+WjYCduHsrkT7/EB5XEv4= -google.golang.org/appengine v1.6.1/go.mod h1:i06prIuMbXzDqacNJfV5OdTW448YApPu5ww/cMBSeb0= -google.golang.org/appengine v1.6.5/go.mod h1:8WjMMxjGQR8xUklV/ARdw2HLXBOI7O7uCIDZVag1xfc= -google.golang.org/appengine v1.6.6/go.mod h1:8WjMMxjGQR8xUklV/ARdw2HLXBOI7O7uCIDZVag1xfc= -google.golang.org/appengine v1.6.7/go.mod h1:8WjMMxjGQR8xUklV/ARdw2HLXBOI7O7uCIDZVag1xfc= -google.golang.org/genproto v0.0.0-20180817151627-c66870c02cf8/go.mod h1:JiN7NxoALGmiZfu7CAH4rXhgtRTLTxftemlI0sWmxmc= -google.golang.org/genproto v0.0.0-20190307195333-5fe7a883aa19/go.mod h1:VzzqZJRnGkLBvHegQrXjBqPurQTc5/KpmUdxsrq26oE= -google.golang.org/genproto v0.0.0-20190418145605-e7d98fc518a7/go.mod h1:VzzqZJRnGkLBvHegQrXjBqPurQTc5/KpmUdxsrq26oE= -google.golang.org/genproto v0.0.0-20190425155659-357c62f0e4bb/go.mod h1:VzzqZJRnGkLBvHegQrXjBqPurQTc5/KpmUdxsrq26oE= -google.golang.org/genproto v0.0.0-20190502173448-54afdca5d873/go.mod h1:VzzqZJRnGkLBvHegQrXjBqPurQTc5/KpmUdxsrq26oE= -google.golang.org/genproto v0.0.0-20190801165951-fa694d86fc64/go.mod h1:DMBHOl98Agz4BDEuKkezgsaosCRResVns1a3J2ZsMNc= -google.golang.org/genproto v0.0.0-20190819201941-24fa4b261c55/go.mod h1:DMBHOl98Agz4BDEuKkezgsaosCRResVns1a3J2ZsMNc= -google.golang.org/genproto v0.0.0-20190911173649-1774047e7e51/go.mod h1:IbNlFCBrqXvoKpeg0TB2l7cyZUmoaFKYIwrEpbDKLA8= -google.golang.org/genproto v0.0.0-20191108220845-16a3f7862a1a/go.mod h1:n3cpQtvxv34hfy77yVDNjmbRyujviMdxYliBSkLhpCc= -google.golang.org/genproto v0.0.0-20191115194625-c23dd37a84c9/go.mod h1:n3cpQtvxv34hfy77yVDNjmbRyujviMdxYliBSkLhpCc= -google.golang.org/genproto v0.0.0-20191216164720-4f79533eabd1/go.mod h1:n3cpQtvxv34hfy77yVDNjmbRyujviMdxYliBSkLhpCc= -google.golang.org/genproto v0.0.0-20191230161307-f3c370f40bfb/go.mod h1:n3cpQtvxv34hfy77yVDNjmbRyujviMdxYliBSkLhpCc= -google.golang.org/genproto v0.0.0-20200115191322-ca5a22157cba/go.mod h1:n3cpQtvxv34hfy77yVDNjmbRyujviMdxYliBSkLhpCc= -google.golang.org/genproto v0.0.0-20200122232147-0452cf42e150/go.mod h1:n3cpQtvxv34hfy77yVDNjmbRyujviMdxYliBSkLhpCc= -google.golang.org/genproto v0.0.0-20200204135345-fa8e72b47b90/go.mod h1:GmwEX6Z4W5gMy59cAlVYjN9JhxgbQH6Gn+gFDQe2lzA= -google.golang.org/genproto v0.0.0-20200212174721-66ed5ce911ce/go.mod h1:55QSHmfGQM9UVYDPBsyGGes0y52j32PQ3BqQfXhyH3c= -google.golang.org/genproto v0.0.0-20200224152610-e50cd9704f63/go.mod h1:55QSHmfGQM9UVYDPBsyGGes0y52j32PQ3BqQfXhyH3c= -google.golang.org/genproto v0.0.0-20200228133532-8c2c7df3a383/go.mod h1:55QSHmfGQM9UVYDPBsyGGes0y52j32PQ3BqQfXhyH3c= -google.golang.org/genproto v0.0.0-20200305110556-506484158171/go.mod h1:55QSHmfGQM9UVYDPBsyGGes0y52j32PQ3BqQfXhyH3c= -google.golang.org/genproto v0.0.0-20200312145019-da6875a35672/go.mod h1:55QSHmfGQM9UVYDPBsyGGes0y52j32PQ3BqQfXhyH3c= -google.golang.org/genproto v0.0.0-20200331122359-1ee6d9798940/go.mod h1:55QSHmfGQM9UVYDPBsyGGes0y52j32PQ3BqQfXhyH3c= -google.golang.org/genproto v0.0.0-20200430143042-b979b6f78d84/go.mod h1:55QSHmfGQM9UVYDPBsyGGes0y52j32PQ3BqQfXhyH3c= -google.golang.org/genproto v0.0.0-20200511104702-f5ebc3bea380/go.mod h1:55QSHmfGQM9UVYDPBsyGGes0y52j32PQ3BqQfXhyH3c= -google.golang.org/genproto v0.0.0-20200513103714-09dca8ec2884/go.mod h1:55QSHmfGQM9UVYDPBsyGGes0y52j32PQ3BqQfXhyH3c= -google.golang.org/genproto v0.0.0-20200515170657-fc4c6c6a6587/go.mod h1:YsZOwe1myG/8QRHRsmBRE1LrgQY60beZKjly0O1fX9U= -google.golang.org/genproto v0.0.0-20200526211855-cb27e3aa2013/go.mod h1:NbSheEEYHJ7i3ixzK3sjbqSGDJWnxyFXZblF3eUsNvo= -google.golang.org/genproto v0.0.0-20200618031413-b414f8b61790/go.mod h1:jDfRM7FcilCzHH/e9qn6dsT145K34l5v+OpcnNgKAAA= -google.golang.org/genproto v0.0.0-20200729003335-053ba62fc06f/go.mod h1:FWY/as6DDZQgahTzZj3fqbO1CbirC29ZNUFHwi0/+no= -google.golang.org/genproto v0.0.0-20200804131852-c06518451d9c/go.mod h1:FWY/as6DDZQgahTzZj3fqbO1CbirC29ZNUFHwi0/+no= -google.golang.org/genproto v0.0.0-20200825200019-8632dd797987/go.mod h1:FWY/as6DDZQgahTzZj3fqbO1CbirC29ZNUFHwi0/+no= -google.golang.org/genproto v0.0.0-20200904004341-0bd0a958aa1d/go.mod h1:FWY/as6DDZQgahTzZj3fqbO1CbirC29ZNUFHwi0/+no= -google.golang.org/genproto v0.0.0-20201109203340-2640f1f9cdfb/go.mod h1:FWY/as6DDZQgahTzZj3fqbO1CbirC29ZNUFHwi0/+no= -google.golang.org/genproto v0.0.0-20201201144952-b05cb90ed32e/go.mod h1:FWY/as6DDZQgahTzZj3fqbO1CbirC29ZNUFHwi0/+no= -google.golang.org/genproto v0.0.0-20201210142538-e3217bee35cc/go.mod h1:FWY/as6DDZQgahTzZj3fqbO1CbirC29ZNUFHwi0/+no= -google.golang.org/genproto v0.0.0-20201214200347-8c77b98c765d/go.mod h1:FWY/as6DDZQgahTzZj3fqbO1CbirC29ZNUFHwi0/+no= -google.golang.org/genproto v0.0.0-20210222152913-aa3ee6e6a81c/go.mod h1:FWY/as6DDZQgahTzZj3fqbO1CbirC29ZNUFHwi0/+no= -google.golang.org/genproto v0.0.0-20210303154014-9728d6b83eeb/go.mod h1:FWY/as6DDZQgahTzZj3fqbO1CbirC29ZNUFHwi0/+no= -google.golang.org/genproto v0.0.0-20210310155132-4ce2db91004e/go.mod h1:FWY/as6DDZQgahTzZj3fqbO1CbirC29ZNUFHwi0/+no= -google.golang.org/genproto v0.0.0-20210319143718-93e7006c17a6/go.mod h1:FWY/as6DDZQgahTzZj3fqbO1CbirC29ZNUFHwi0/+no= -google.golang.org/genproto v0.0.0-20210402141018-6c239bbf2bb1/go.mod h1:9lPAdzaEmUacj36I+k7YKbEc5CXzPIeORRgDAUOu28A= -google.golang.org/genproto v0.0.0-20210602131652-f16073e35f0c/go.mod h1:UODoCrxHCcBojKKwX1terBiRUaqAsFqJiF615XL43r0= -google.golang.org/grpc v1.19.0/go.mod h1:mqu4LbDTu4XGKhr4mRzUsmM4RtVoemTSY81AxZiDr8c= -google.golang.org/grpc v1.20.1/go.mod h1:10oTOabMzJvdu6/UiuZezV6QK5dSlG84ov/aaiqXj38= -google.golang.org/grpc v1.21.1/go.mod h1:oYelfM1adQP15Ek0mdvEgi9Df8B9CZIaU1084ijfRaM= -google.golang.org/grpc v1.23.0/go.mod h1:Y5yQAOtifL1yxbo5wqy6BxZv8vAUGQwXBOALyacEbxg= -google.golang.org/grpc v1.25.1/go.mod h1:c3i+UQWmh7LiEpx4sFZnkU36qjEYZ0imhYfXVyQciAY= -google.golang.org/grpc v1.26.0/go.mod h1:qbnxyOmOxrQa7FizSgH+ReBfzJrCY1pSN7KXBS8abTk= -google.golang.org/grpc v1.27.0/go.mod h1:qbnxyOmOxrQa7FizSgH+ReBfzJrCY1pSN7KXBS8abTk= -google.golang.org/grpc v1.27.1/go.mod h1:qbnxyOmOxrQa7FizSgH+ReBfzJrCY1pSN7KXBS8abTk= -google.golang.org/grpc v1.28.0/go.mod h1:rpkK4SK4GF4Ach/+MFLZUBavHOvF2JJB5uozKKal+60= -google.golang.org/grpc v1.29.1/go.mod h1:itym6AZVZYACWQqET3MqgPpjcuV5QH3BxFS3IjizoKk= -google.golang.org/grpc v1.30.0/go.mod h1:N36X2cJ7JwdamYAgDz+s+rVMFjt3numwzf/HckM8pak= -google.golang.org/grpc v1.31.0/go.mod h1:N36X2cJ7JwdamYAgDz+s+rVMFjt3numwzf/HckM8pak= -google.golang.org/grpc v1.31.1/go.mod h1:N36X2cJ7JwdamYAgDz+s+rVMFjt3numwzf/HckM8pak= -google.golang.org/grpc v1.33.1/go.mod h1:fr5YgcSWrqhRRxogOsw7RzIpsmvOZ6IcH4kBYTpR3n0= -google.golang.org/grpc v1.33.2/go.mod h1:JMHMWHQWaTccqQQlmk3MJZS+GWXOdAesneDmEnv2fbc= -google.golang.org/grpc v1.34.0/go.mod h1:WotjhfgOW/POjDeRt8vscBtXq+2VjORFy659qA51WJ8= -google.golang.org/grpc v1.35.0/go.mod h1:qjiiYl8FncCW8feJPdyg3v6XW24KsRHe+dy9BAGRRjU= -google.golang.org/grpc v1.36.0/go.mod h1:qjiiYl8FncCW8feJPdyg3v6XW24KsRHe+dy9BAGRRjU= -google.golang.org/grpc v1.36.1/go.mod h1:qjiiYl8FncCW8feJPdyg3v6XW24KsRHe+dy9BAGRRjU= -google.golang.org/grpc v1.38.0/go.mod h1:NREThFqKR1f3iQ6oBuvc5LadQuXVGo9rkm5ZGrQdJfM= -google.golang.org/protobuf v0.0.0-20200109180630-ec00e32a8dfd/go.mod h1:DFci5gLYBciE7Vtevhsrf46CRTquxDuWsQurQQe4oz8= -google.golang.org/protobuf v0.0.0-20200221191635-4d8936d0db64/go.mod h1:kwYJMbMJ01Woi6D6+Kah6886xMZcty6N08ah7+eCXa0= -google.golang.org/protobuf v0.0.0-20200228230310-ab0ca4ff8a60/go.mod h1:cfTl7dwQJ+fmap5saPgwCLgHXTUD7jkjRqWcaiX5VyM= -google.golang.org/protobuf v1.20.1-0.20200309200217-e05f789c0967/go.mod h1:A+miEFZTKqfCUM6K7xSMQL9OKL/b6hQv+e19PK+JZNE= -google.golang.org/protobuf v1.21.0/go.mod h1:47Nbq4nVaFHyn7ilMalzfO3qCViNmqZ2kzikPIcrTAo= -google.golang.org/protobuf v1.22.0/go.mod h1:EGpADcykh3NcUnDUJcl1+ZksZNG86OlYog2l/sGQquU= -google.golang.org/protobuf v1.23.0/go.mod h1:EGpADcykh3NcUnDUJcl1+ZksZNG86OlYog2l/sGQquU= -google.golang.org/protobuf v1.23.1-0.20200526195155-81db48ad09cc/go.mod h1:EGpADcykh3NcUnDUJcl1+ZksZNG86OlYog2l/sGQquU= -google.golang.org/protobuf v1.24.0/go.mod h1:r/3tXBNzIEhYS9I1OUVjXDlt8tc493IdKGjtUeSXeh4= -google.golang.org/protobuf v1.25.0/go.mod h1:9JNX74DMeImyA3h4bdi1ymwjUzf21/xIlbajtzgsN7c= -google.golang.org/protobuf v1.26.0-rc.1/go.mod h1:jlhhOSvTdKEhbULTjvd4ARK9grFBp09yW+WbY/TyQbw= -google.golang.org/protobuf v1.26.0/go.mod h1:9q0QmTI4eRPtz6boOQmLYwt+qCgq0jsYwAQnmE0givc= -gopkg.in/check.v1 v0.0.0-20161208181325-20d25e280405/go.mod h1:Co6ibVJAznAaIkqp8huTwlJQCZ016jof/cbN4VW5Yz0= -gopkg.in/check.v1 v1.0.0-20180628173108-788fd7840127/go.mod h1:Co6ibVJAznAaIkqp8huTwlJQCZ016jof/cbN4VW5Yz0= -gopkg.in/errgo.v2 v2.1.0/go.mod h1:hNsd1EY+bozCKY1Ytp96fpM3vjJbqLJn88ws8XvfDNI= -gopkg.in/ini.v1 v1.62.0/go.mod h1:pNLf8WUiyNEtQjuu5G5vTm06TEv9tsIgeAvK8hOrP4k= -gopkg.in/yaml.v2 v2.2.2/go.mod h1:hI93XBmqTisBFMUTm0b8Fm+jr3Dg1NNxqwp+5A1VGuI= -gopkg.in/yaml.v2 v2.2.3/go.mod h1:hI93XBmqTisBFMUTm0b8Fm+jr3Dg1NNxqwp+5A1VGuI= -gopkg.in/yaml.v2 v2.2.8/go.mod h1:hI93XBmqTisBFMUTm0b8Fm+jr3Dg1NNxqwp+5A1VGuI= -gopkg.in/yaml.v2 v2.4.0/go.mod h1:RDklbk79AGWmwhnvt/jBztapEOGDOx6ZbXqjP6csGnQ= -gopkg.in/yaml.v3 v3.0.0-20200313102051-9f266ea9e77c/go.mod h1:K4uyk7z7BCEPqu6E+C64Yfv1cQ7kz7rIZviUmN+EgEM= -gopkg.in/yaml.v3 v3.0.0-20210107192922-496545a6307b/go.mod h1:K4uyk7z7BCEPqu6E+C64Yfv1cQ7kz7rIZviUmN+EgEM= gopkg.in/yaml.v3 v3.0.1 h1:fxVm/GzAzEWqLHuvctI91KS9hhNmmWOoWu0XTYJS7CA= gopkg.in/yaml.v3 v3.0.1/go.mod h1:K4uyk7z7BCEPqu6E+C64Yfv1cQ7kz7rIZviUmN+EgEM= -honnef.co/go/tools v0.0.0-20190102054323-c2f93a96b099/go.mod h1:rf3lG4BRIbNafJWhAfAdb/ePZxsR/4RtNHQocxwk9r4= -honnef.co/go/tools v0.0.0-20190106161140-3f1c8253044a/go.mod h1:rf3lG4BRIbNafJWhAfAdb/ePZxsR/4RtNHQocxwk9r4= -honnef.co/go/tools v0.0.0-20190418001031-e561f6794a2a/go.mod h1:rf3lG4BRIbNafJWhAfAdb/ePZxsR/4RtNHQocxwk9r4= -honnef.co/go/tools v0.0.0-20190523083050-ea95bdfd59fc/go.mod h1:rf3lG4BRIbNafJWhAfAdb/ePZxsR/4RtNHQocxwk9r4= -honnef.co/go/tools v0.0.1-2019.2.3/go.mod h1:a3bituU0lyd329TUQxRnasdCoJDkEUEAqEt0JzvZhAg= -honnef.co/go/tools v0.0.1-2020.1.3/go.mod h1:X/FiERA/W4tHapMX5mGpAtMSVEeEUOyHaw9vFzvIQ3k= -honnef.co/go/tools v0.0.1-2020.1.4/go.mod h1:X/FiERA/W4tHapMX5mGpAtMSVEeEUOyHaw9vFzvIQ3k= -rsc.io/binaryregexp v0.2.0/go.mod h1:qTv7/COck+e2FymRvadv62gMdZztPaShugOCi3I+8D8= -rsc.io/quote/v3 v3.1.0/go.mod h1:yEA65RcK8LyAZtP9Kv3t0HmxON59tX3rD+tICJqUlj0= -rsc.io/sampler v1.3.0/go.mod h1:T1hPZKmBbMNahiBKFy5HrXp6adAjACjK9JXDnKaTXpA= diff --git a/prover/prover.go b/prover/prover.go index 6bf088b..b1b9980 100644 --- a/prover/prover.go +++ b/prover/prover.go @@ -92,7 +92,7 @@ type proverRuntime struct { program board.Program zeta ext.E4 // point of evaluation to check the AIR relation with SZ alpha ext.E4 // folding challenge for N-grouped polynomials, used to build the DEEP quotient - mu sync.Mutex + mu *sync.Mutex setup setup.ProvingKey queryPositions []int fs *fiatshamir.Transcript @@ -123,7 +123,7 @@ func newProverRuntime(t trace.Trace, provingKey setup.ProvingKey, publicInputs p program: program, setup: provingKey, airTrace: trace.New(), - mu: sync.Mutex{}, // mutex to protect the trace when reading/writing (in case of parallelisation) + mu: new(sync.Mutex), // mutex to protect the trace when reading/writing (in case of parallelisation) hashBackend: hashBackend, } res.Proof.HashBackendID = hashBackend.ID @@ -404,7 +404,7 @@ func (pr *proverRuntime) ExecuteSteps() error { continue } - err := s.Execute(pr.t, &pr.program, &pr.Proof, &pr.mu) + err := s.Execute(pr.t, &pr.program, &pr.Proof, pr.mu) if err != nil { return err } diff --git a/recursion/poseidon2.go b/recursion/poseidon2.go new file mode 100644 index 0000000..f07bceb --- /dev/null +++ b/recursion/poseidon2.go @@ -0,0 +1,1117 @@ +// Copyright 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. +// +// SPDX-License-Identifier: Apache-2.0 + +package recursion + +import ( + "fmt" + + "github.com/consensys/gnark-crypto/field/koalabear" + ext "github.com/consensys/gnark-crypto/field/koalabear/extensions" + p2crypto "github.com/consensys/gnark-crypto/field/koalabear/poseidon2" + "github.com/consensys/loom/board" + "github.com/consensys/loom/expr" + "github.com/consensys/loom/field" + "github.com/consensys/loom/internal/commitment" + "github.com/consensys/loom/internal/constants" + "github.com/consensys/loom/internal/fri" + "github.com/consensys/loom/internal/hash" + "github.com/consensys/loom/internal/merkle" + "github.com/consensys/loom/proof" + "github.com/consensys/loom/prover" + "github.com/consensys/loom/trace" +) + +const ( + poseidon2DigestWidth = 8 + poseidon2MDWidth = 16 + poseidon2SpongeWidth = 24 + poseidon2MDHalfWidth = poseidon2MDWidth / 2 + poseidon2SpongeRate = 16 + poseidon2FullRounds = 6 + poseidon2PartialRounds = 21 + poseidon2LeafDomainTag = 0x4c454146 // "LEAF" + poseidon2NodeDomainTag = 0x4e4f4445 // "NODE" + poseidon2FSIDDomainTag = 0x46534944 // "FSID" +) + +type poseidon2OutputMode uint8 + +const ( + poseidon2OutputMD poseidon2OutputMode = iota + poseidon2OutputSponge +) + +type poseidon2MerkleTarget struct { + Namespace string + Input RecursionInput +} + +type poseidon2Op struct { + Label string + Width int + OutputMode poseidon2OutputMode + Input []koalabear.Element + WantOutput []koalabear.Element +} + +type poseidon2TranscriptChallenge struct { + name string + bindings [][]koalabear.Element + value hash.Digest + isComputed bool +} + +type poseidon2TranscriptRecorder struct { + challenges []poseidon2TranscriptChallenge + nameToChallengePos map[string]int +} + +type poseidon2ModuleBuilder struct { + module *board.Module + lagranges map[int]expr.Expr +} + +var ( + poseidon2Params16 = p2crypto.NewParameters(poseidon2MDWidth, poseidon2FullRounds, poseidon2PartialRounds) + poseidon2Params24 = p2crypto.NewParameters(poseidon2SpongeWidth, poseidon2FullRounds, poseidon2PartialRounds) +) + +func poseidon2Params(width int) (*p2crypto.Parameters, error) { + switch width { + case poseidon2MDWidth: + return poseidon2Params16, nil + case poseidon2SpongeWidth: + return poseidon2Params24, nil + default: + return nil, fmt.Errorf("recursion: unsupported Poseidon2 width %d", width) + } +} + +func buildPoseidon2VerifierModule(moduleName string, targets []poseidon2MerkleTarget) (board.Module, trace.Trace, error) { + ops := make([]poseidon2Op, 0) + for _, target := range targets { + targetOps, err := collectPoseidon2VerifierOps(target.Namespace, target.Input) + if err != nil { + return board.Module{}, trace.Trace{}, err + } + ops = append(ops, targetOps...) + } + if len(ops) == 0 { + return board.Module{}, trace.Trace{}, fmt.Errorf("recursion: no Poseidon2 Merkle operations to arithmetize") + } + + params, err := poseidon2Params(poseidon2MDWidth) + if err != nil { + return board.Module{}, trace.Trace{}, err + } + numRounds := params.NbFullRounds + params.NbPartialRounds + rowsPerOp := numRounds + 1 + n := nextPowerOfTwo(maxInt(2, len(ops)*rowsPerOp)) + + module := board.NewModule(moduleName) + module.N = n + builder := poseidon2ModuleBuilder{ + module: &module, + lagranges: make(map[int]expr.Expr), + } + + tr := trace.New() + stateNames := make([]string, poseidon2SpongeWidth) + stateCols := make([][]koalabear.Element, poseidon2SpongeWidth) + for i := range stateNames { + stateNames[i] = fmt.Sprintf("%s.state.%d", moduleName, i) + stateCols[i] = make([]koalabear.Element, n) + } + + for opIdx, op := range ops { + if op.Width != poseidon2MDWidth && op.Width != poseidon2SpongeWidth { + return board.Module{}, trace.Trace{}, fmt.Errorf("recursion: Poseidon2 op %s has unsupported width %d", op.Label, op.Width) + } + if len(op.Input) != op.Width { + return board.Module{}, trace.Trace{}, fmt.Errorf("recursion: Poseidon2 op %s has input width %d, want %d", op.Label, len(op.Input), op.Width) + } + if len(op.WantOutput) != poseidon2DigestWidth { + return board.Module{}, trace.Trace{}, fmt.Errorf("recursion: Poseidon2 op %s has output width %d, want %d", op.Label, len(op.WantOutput), poseidon2DigestWidth) + } + + params, err := poseidon2Params(op.Width) + if err != nil { + return board.Module{}, trace.Trace{}, err + } + startRow := opIdx * rowsPerOp + state := poseidon2MatMulExternalValues(op.Input) + for i := 0; i < poseidon2SpongeWidth; i++ { + if i < op.Width { + stateCols[i][startRow].Set(&state[i]) + builder.assertZeroAt(expr.Col(stateNames[i]).Sub(expr.Const(state[i])), startRow) + continue + } + builder.assertZeroAt(expr.Col(stateNames[i]), startRow) + } + + for round := 0; round < numRounds; round++ { + partial := poseidon2IsPartialRound(params, round) + state = poseidon2RoundValues(state, params.RoundKeys[round], partial) + row := startRow + round + 1 + for i := range state { + stateCols[i][row].Set(&state[i]) + } + } + + finalRow := startRow + numRounds + for i := 0; i < poseidon2DigestWidth; i++ { + var relation expr.Expr + switch op.OutputMode { + case poseidon2OutputMD: + relation = expr.Col(stateNames[poseidon2MDHalfWidth+i]). + Add(expr.Const(op.Input[poseidon2MDHalfWidth+i])). + Sub(expr.Const(op.WantOutput[i])) + case poseidon2OutputSponge: + relation = expr.Col(stateNames[i]).Sub(expr.Const(op.WantOutput[i])) + default: + return board.Module{}, trace.Trace{}, fmt.Errorf("recursion: Poseidon2 op %s has unsupported output mode %d", op.Label, op.OutputMode) + } + builder.assertZeroAt(relation, finalRow) + } + } + + for i := range stateNames { + tr.SetBase(stateNames[i], stateCols[i]) + } + + stateExprs := make([]expr.Expr, poseidon2SpongeWidth) + for i := range stateExprs { + stateExprs[i] = expr.Col(stateNames[i]) + } + for round := 0; round < numRounds; round++ { + transitionSelector := zeroExpr() + roundSelectors := map[int]expr.Expr{ + poseidon2MDWidth: zeroExpr(), + poseidon2SpongeWidth: zeroExpr(), + } + for opIdx, op := range ops { + selector := builder.lagrange(opIdx*rowsPerOp + round) + transitionSelector = transitionSelector.Add(selector) + roundSelectors[op.Width] = roundSelectors[op.Width].Add(selector) + } + + expectedNext := make([]expr.Expr, poseidon2SpongeWidth) + for i := range expectedNext { + expectedNext[i] = zeroExpr() + } + for _, width := range []int{poseidon2MDWidth, poseidon2SpongeWidth} { + selector := roundSelectors[width] + params, err := poseidon2Params(width) + if err != nil { + return board.Module{}, trace.Trace{}, err + } + next := poseidon2RoundExprs(stateExprs[:width], params.RoundKeys[round], poseidon2IsPartialRound(params, round)) + for i := range next { + expectedNext[i] = expectedNext[i].Add(selector.Mul(next[i])) + } + } + for i := range stateNames { + nextState := expr.Rot(stateNames[i], 1).Mul(transitionSelector) + builder.module.AssertZero(nextState.Sub(expectedNext[i])) + } + } + + return *builder.module, tr, nil +} + +func collectPoseidon2VerifierOps(namespace string, input RecursionInput) ([]poseidon2Op, error) { + transcriptOps, err := collectPoseidon2TranscriptOps(namespace, input) + if err != nil { + return nil, err + } + pointSamplingOps, err := collectPoseidon2PointSamplingMerkleOps(namespace, input) + if err != nil { + return nil, err + } + friOps, err := collectPoseidon2FRIMerkleOps(namespace, input) + if err != nil { + return nil, err + } + ops := append(transcriptOps, pointSamplingOps...) + return append(ops, friOps...), nil +} + +func collectPoseidon2TranscriptOps(namespace string, input RecursionInput) ([]poseidon2Op, error) { + recorder, err := recordPoseidon2Transcript(input) + if err != nil { + return nil, err + } + + ops := make([]poseidon2Op, 0) + for pos, challenge := range recorder.challenges { + if !challenge.isComputed { + return nil, fmt.Errorf("recursion: transcript challenge %q was registered but not computed", challenge.name) + } + writes := make([][]koalabear.Element, 0, 2+len(challenge.bindings)) + writes = append(writes, hash.StringToElements(poseidon2FSIDDomainTag, challenge.name)) + if pos != 0 { + writes = append(writes, recorder.challenges[pos-1].value[:]) + } + writes = append(writes, challenge.bindings...) + + expected := cloneBaseElements(challenge.value[:]) + _, challengeOps := poseidon2SpongeWriteOps(fmt.Sprintf("%s.transcript.%d.%s", namespace, pos, challenge.name), writes) + if len(challengeOps) == 0 { + return nil, fmt.Errorf("recursion: transcript challenge %q produced no Poseidon2 operations", challenge.name) + } + challengeOps[len(challengeOps)-1].WantOutput = expected + ops = append(ops, challengeOps...) + } + return ops, nil +} + +func recordPoseidon2Transcript(input RecursionInput) (*poseidon2TranscriptRecorder, error) { + hashBackend, err := resolveRecursionHashBackend(input, Config{hashBackend: commitment.Poseidon2HashBackend()}) + if err != nil { + return nil, err + } + if hashBackend.ID != commitment.HashBackendPoseidon2 { + return nil, fmt.Errorf("recursion: Poseidon2 arithmetization requires poseidon2 hash backend, got %q", hashBackend.ID) + } + + layout := prover.BuildLayout(input.Program, len(input.Setup.Roots)) + wantCommitments := layout.NumTrees - layout.SetupEnd + if len(input.Proof.Commitments) != wantCommitments { + return nil, fmt.Errorf("recursion: transcript proof has %d commitments, layout expects %d", len(input.Proof.Commitments), wantCommitments) + } + if len(input.Setup.Roots) != layout.SetupEnd-layout.SetupBegin { + return nil, fmt.Errorf("recursion: transcript setup has %d trees, layout expects %d", len(input.Setup.Roots), layout.SetupEnd-layout.SetupBegin) + } + + roots := make([]hash.Digest, layout.NumTrees) + for i, root := range input.Setup.Roots { + roots[layout.SetupBegin+i] = root + } + for i, root := range input.Proof.Commitments { + roots[layout.SetupEnd+i] = root + } + + recorder := newPoseidon2TranscriptRecorder() + numRounds := len(input.Program.FScolumnsDependencies) + for i := 0; i < numRounds; i++ { + if err := recorder.NewChallenge(constants.CanonicalChallengeName(i)); err != nil { + return nil, err + } + } + if err := recorder.NewChallenge(constants.FINAL_EVALUATION_POINT); err != nil { + return nil, err + } + if err := recorder.NewChallenge(constants.DEEP_ALPHA); err != nil { + return nil, err + } + + initialChallenge := constants.InitialChallengeName(numRounds) + if err := recorder.Bind(initialChallenge, hash.StringToElements(constants.HASH_BACKEND_DOMAIN_TAG, hashBackend.ID)); err != nil { + return nil, err + } + for _, root := range input.Setup.Roots { + if err := recorder.Bind(initialChallenge, root[:]); err != nil { + return nil, err + } + } + if len(input.PublicInputs) > 0 { + if err := recorder.Bind(initialChallenge, input.PublicInputs.TranscriptElements()); err != nil { + return nil, err + } + } + + for round := 0; round < numRounds; round++ { + challengeName := constants.CanonicalChallengeName(round) + for i := layout.TraceBegin[round]; i < layout.TraceEnd[round]; i++ { + if err := recorder.Bind(challengeName, roots[i][:]); err != nil { + return nil, err + } + } + if _, err := recorder.ComputeChallenge(challengeName); err != nil { + return nil, err + } + } + + for i := layout.AIRBegin; i < layout.AIREnd; i++ { + if err := recorder.Bind(constants.FINAL_EVALUATION_POINT, roots[i][:]); err != nil { + return nil, err + } + } + if _, err := recorder.ComputeChallenge(constants.FINAL_EVALUATION_POINT); err != nil { + return nil, err + } + + dqLayout := prover.BuildDeepQuotientLayout(input.Program) + if err := recorderBindDeepEvaluationClaims(recorder, input.Proof, dqLayout); err != nil { + return nil, err + } + if _, err := recorder.ComputeChallenge(constants.DEEP_ALPHA); err != nil { + return nil, err + } + + maxN, err := maxModuleSize(input.Program) + if err != nil { + return nil, err + } + if maxN <= 1 { + return recorder, nil + } + numFRIRounds, err := log2Exact(maxN) + if err != nil { + return nil, err + } + levelAtRound, err := poseidon2FRILevelAtRound(maxN, dqLayout.Sizes) + if err != nil { + return nil, err + } + if err := recorderRegisterFRIChallenges(recorder, numFRIRounds, levelAtRound); err != nil { + return nil, err + } + if len(input.Proof.DeepQuotientCommitment) != len(dqLayout.Sizes) { + return nil, fmt.Errorf("recursion: transcript FRI has %d DEEP quotient commitments, want %d", len(input.Proof.DeepQuotientCommitment), len(dqLayout.Sizes)) + } + wantFRIRoots := numFRIRounds - 1 + if numFRIRounds <= 1 { + wantFRIRoots = 0 + } + if len(input.Proof.DeepQuotientFriProof.FRIRoots) != wantFRIRoots { + return nil, fmt.Errorf("recursion: transcript FRI has %d running roots, want %d", len(input.Proof.DeepQuotientFriProof.FRIRoots), wantFRIRoots) + } + runningRoots := make([]hash.Digest, numFRIRounds) + runningRoots[0] = input.Proof.DeepQuotientCommitment[0] + for round := 1; round < numFRIRounds; round++ { + runningRoots[round] = input.Proof.DeepQuotientFriProof.FRIRoots[round-1] + } + + for round := 0; round < numFRIRounds; round++ { + if round > 0 { + if level, ok := levelAtRound[round]; ok { + gammaName := friLevelGammaName(level) + if err := recorder.Bind(gammaName, input.Proof.DeepQuotientCommitment[level][:]); err != nil { + return nil, err + } + if _, err := recorder.ComputeChallenge(gammaName); err != nil { + return nil, err + } + } + } + foldName := friFoldName(round) + if err := recorder.Bind(foldName, runningRoots[round][:]); err != nil { + return nil, err + } + if _, err := recorder.ComputeChallenge(foldName); err != nil { + return nil, err + } + } + + if input.Proof.DeepQuotientFriProof.FinalField != field.Ext { + return nil, fmt.Errorf("recursion: transcript FRI final field is %s, want %s", input.Proof.DeepQuotientFriProof.FinalField, field.Ext) + } + if err := recorder.Bind(friQueryName(0), friTranscriptExtPoly(input.Proof.DeepQuotientFriProof.FinalPolyExt)); err != nil { + return nil, err + } + for query := 0; query < constants.NUM_QUERIES; query++ { + challenge, err := recorder.ComputeChallenge(friQueryName(query)) + if err != nil { + return nil, err + } + if query < constants.NUM_QUERIES-1 { + if err := recorder.Bind(friQueryName(query+1), challenge[:]); err != nil { + return nil, err + } + } + } + return recorder, nil +} + +func newPoseidon2TranscriptRecorder() *poseidon2TranscriptRecorder { + return &poseidon2TranscriptRecorder{ + nameToChallengePos: make(map[string]int), + } +} + +func (r *poseidon2TranscriptRecorder) NewChallenge(challengeID string) error { + if _, ok := r.nameToChallengePos[challengeID]; ok { + return fmt.Errorf("recursion: transcript challenge %q already exists", challengeID) + } + r.nameToChallengePos[challengeID] = len(r.challenges) + r.challenges = append(r.challenges, poseidon2TranscriptChallenge{name: challengeID}) + return nil +} + +func (r *poseidon2TranscriptRecorder) Bind(challengeID string, bValue []koalabear.Element) error { + pos, ok := r.nameToChallengePos[challengeID] + if !ok { + return fmt.Errorf("recursion: transcript challenge %q not found", challengeID) + } + if r.challenges[pos].isComputed { + return fmt.Errorf("recursion: transcript challenge %q already computed", challengeID) + } + bCopy := cloneBaseElements(bValue) + r.challenges[pos].bindings = append(r.challenges[pos].bindings, bCopy) + return nil +} + +func (r *poseidon2TranscriptRecorder) ComputeChallenge(challengeID string) (hash.Digest, error) { + pos, ok := r.nameToChallengePos[challengeID] + if !ok { + return hash.Digest{}, fmt.Errorf("recursion: transcript challenge %q not found", challengeID) + } + challenge := &r.challenges[pos] + if challenge.isComputed { + return challenge.value, nil + } + writes := make([][]koalabear.Element, 0, 2+len(challenge.bindings)) + writes = append(writes, hash.StringToElements(poseidon2FSIDDomainTag, challengeID)) + if pos != 0 { + prev := r.challenges[pos-1] + if !prev.isComputed { + return hash.Digest{}, fmt.Errorf("recursion: transcript previous challenge %q not computed", prev.name) + } + writes = append(writes, prev.value[:]) + } + writes = append(writes, challenge.bindings...) + value := poseidon2SpongeDigestNative(writes) + challenge.value = value + challenge.isComputed = true + return value, nil +} + +func recorderBindDeepEvaluationClaims(recorder *poseidon2TranscriptRecorder, prf proof.Proof, layout prover.DEEPquotientLayout) error { + for i := range layout.Sizes { + for _, keysAtShift := range layout.Keys[i] { + for _, key := range keysAtShift { + if err := recorderBindValueAtZeta(recorder, prf, key); err != nil { + return err + } + } + } + for _, chunkName := range layout.AIRChunks[i] { + if err := recorderBindValueAtZeta(recorder, prf, chunkName); err != nil { + return err + } + } + } + return nil +} + +func recorderBindValueAtZeta(recorder *poseidon2TranscriptRecorder, prf proof.Proof, key string) error { + v, ok := prf.ValueAtZetaExt(key) + if !ok { + return fmt.Errorf("recursion: transcript ValuesAtZeta %q not found", key) + } + return recorder.Bind(constants.DEEP_ALPHA, poseidon2E4Elements(v)) +} + +func recorderRegisterFRIChallenges(recorder *poseidon2TranscriptRecorder, numRounds int, levelAtRound map[int]int) error { + if err := recorder.NewChallenge(friFoldName(0)); err != nil { + return err + } + for round := 1; round < numRounds; round++ { + if level, ok := levelAtRound[round]; ok { + if err := recorder.NewChallenge(friLevelGammaName(level)); err != nil { + return err + } + } + if err := recorder.NewChallenge(friFoldName(round)); err != nil { + return err + } + } + for query := 0; query < constants.NUM_QUERIES; query++ { + if err := recorder.NewChallenge(friQueryName(query)); err != nil { + return err + } + } + return nil +} + +func poseidon2FRILevelAtRound(maxN int, levelDs []int) (map[int]int, error) { + if len(levelDs) == 0 { + return nil, fmt.Errorf("recursion: transcript FRI has no DEEP quotient levels") + } + if levelDs[0] != maxN { + return nil, fmt.Errorf("recursion: transcript FRI first level D=%d, want max module size %d", levelDs[0], maxN) + } + numRounds, err := log2Exact(maxN) + if err != nil { + return nil, err + } + levelAtRound := make(map[int]int, len(levelDs)-1) + for level := 1; level < len(levelDs); level++ { + levelD := levelDs[level] + if levelD <= 0 || levelD&(levelD-1) != 0 { + return nil, fmt.Errorf("recursion: transcript FRI level %d D=%d is not a positive power of two", level, levelD) + } + ratio := maxN / levelD + if ratio <= 0 || ratio*levelD != maxN || ratio&(ratio-1) != 0 { + return nil, fmt.Errorf("recursion: transcript FRI level %d D=%d does not divide max D=%d by a power-of-two ratio", level, levelD, maxN) + } + round, err := log2Exact(ratio) + if err != nil { + return nil, err + } + if round < 1 || round >= numRounds { + return nil, fmt.Errorf("recursion: transcript FRI level %d introduction round %d outside 1..%d", level, round, numRounds-1) + } + if _, ok := levelAtRound[round]; ok { + return nil, fmt.Errorf("recursion: transcript FRI duplicate level introduction round %d", round) + } + levelAtRound[round] = level + } + return levelAtRound, nil +} + +func collectPoseidon2PointSamplingMerkleOps(namespace string, input RecursionInput) ([]poseidon2Op, error) { + layout := prover.BuildLayout(input.Program, len(input.Setup.Roots)) + if len(input.Proof.PointSamplings) != constants.NUM_QUERIES { + return nil, fmt.Errorf("recursion: point-sampling Merkle has %d queries, want %d", len(input.Proof.PointSamplings), constants.NUM_QUERIES) + } + + roots := make([]hash.Digest, layout.NumTrees) + for i, root := range input.Setup.Roots { + roots[layout.SetupBegin+i] = root + } + for i, root := range input.Proof.Commitments { + roots[layout.SetupEnd+i] = root + } + + ops := make([]poseidon2Op, 0) + for q, samplings := range input.Proof.PointSamplings { + if len(samplings) != layout.NumTrees { + return nil, fmt.Errorf("recursion: point-sampling query %d has %d trees, want %d", q, len(samplings), layout.NumTrees) + } + for treeIdx, wp := range samplings { + root := cloneBaseElements(roots[treeIdx][:]) + proofOps, err := collectPoseidon2MerkleProofOps(fmt.Sprintf("%s.ps.q%d.t%d", namespace, q, treeIdx), wp, wp.Proof, root) + if err != nil { + return nil, err + } + ops = append(ops, proofOps...) + } + } + return ops, nil +} + +func collectPoseidon2FRIMerkleOps(namespace string, input RecursionInput) ([]poseidon2Op, error) { + maxN, err := maxModuleSize(input.Program) + if err != nil { + return nil, err + } + if maxN <= 1 { + return nil, nil + } + numRounds, err := log2Exact(maxN) + if err != nil { + return nil, err + } + + dqLayout := prover.BuildDeepQuotientLayout(input.Program) + levelDs := dqLayout.Sizes + if len(levelDs) == 0 { + return nil, fmt.Errorf("recursion: FRI Merkle has no DEEP quotient levels") + } + if levelDs[0] != maxN { + return nil, fmt.Errorf("recursion: FRI Merkle first level D=%d, want max module size %d", levelDs[0], maxN) + } + if len(input.Proof.DeepQuotientCommitment) != len(levelDs) { + return nil, fmt.Errorf("recursion: FRI Merkle has %d DEEP quotient commitments, want %d", len(input.Proof.DeepQuotientCommitment), len(levelDs)) + } + + friProof := input.Proof.DeepQuotientFriProof + wantFRIRoots := numRounds - 1 + if numRounds <= 1 { + wantFRIRoots = 0 + } + if len(friProof.FRIRoots) != wantFRIRoots { + return nil, fmt.Errorf("recursion: FRI Merkle has %d running roots, want %d", len(friProof.FRIRoots), wantFRIRoots) + } + if len(friProof.FRIQueries) != constants.NUM_QUERIES { + return nil, fmt.Errorf("recursion: FRI Merkle has %d queries, want %d", len(friProof.FRIQueries), constants.NUM_QUERIES) + } + if len(friProof.LevelQueries) != len(levelDs)-1 { + return nil, fmt.Errorf("recursion: FRI Merkle has %d level query sets, want %d", len(friProof.LevelQueries), len(levelDs)-1) + } + + runningRoots := make([]hash.Digest, numRounds) + runningRoots[0] = input.Proof.DeepQuotientCommitment[0] + for round := 1; round < numRounds; round++ { + runningRoots[round] = friProof.FRIRoots[round-1] + } + + ops := make([]poseidon2Op, 0) + for q, query := range friProof.FRIQueries { + if len(query.Layers) != numRounds { + return nil, fmt.Errorf("recursion: FRI Merkle query %d has %d layers, want %d", q, len(query.Layers), numRounds) + } + for round, layer := range query.Layers { + root := cloneBaseElements(runningRoots[round][:]) + proofOps, err := collectPoseidon2MerkleProofOps(fmt.Sprintf("%s.fri.q%d.r%d", namespace, q, round), layer, layer.Path, root) + if err != nil { + return nil, err + } + ops = append(ops, proofOps...) + } + + for level := 1; level < len(levelDs); level++ { + if len(friProof.LevelQueries[level-1]) != constants.NUM_QUERIES { + return nil, fmt.Errorf("recursion: FRI Merkle level %d has %d queries, want %d", level, len(friProof.LevelQueries[level-1]), constants.NUM_QUERIES) + } + layer := friProof.LevelQueries[level-1][q] + root := cloneBaseElements(input.Proof.DeepQuotientCommitment[level][:]) + proofOps, err := collectPoseidon2MerkleProofOps(fmt.Sprintf("%s.fri.q%d.l%d", namespace, q, level), layer, layer.Path, root) + if err != nil { + return nil, err + } + ops = append(ops, proofOps...) + } + } + return ops, nil +} + +func collectPoseidon2MerkleProofOps(label string, leaf any, path merkle.Proof, root []koalabear.Element) ([]poseidon2Op, error) { + current, ops, err := poseidon2MerkleLeafDigestOps(label+".leaf", leaf) + if err != nil { + return nil, err + } + + idx := path.LeafIdx + for depth, sibling := range path.Siblings { + siblingVals := cloneBaseElements(sibling[:]) + left, right := current, siblingVals + if idx&1 == 1 { + left, right = siblingVals, current + } + var nodeOps []poseidon2Op + current, nodeOps = poseidon2NodeDigestOps(fmt.Sprintf("%s.node.%d", label, depth), left, right) + ops = append(ops, nodeOps...) + idx >>= 1 + } + + if len(root) != poseidon2DigestWidth { + return nil, fmt.Errorf("recursion: %s root has %d elements, want %d", label, len(root), poseidon2DigestWidth) + } + if len(ops) == 0 { + return nil, fmt.Errorf("recursion: %s produced no Poseidon2 operations", label) + } + ops[len(ops)-1].WantOutput = cloneBaseElements(root) + return ops, nil +} + +func poseidon2MerkleLeafDigestOps(label string, leaf any) ([]koalabear.Element, []poseidon2Op, error) { + switch v := leaf.(type) { + case commitment.WMerkleProof: + return poseidon2CommitmentLeafDigestOps(label, v.RawLeafBase, v.RawLeafExt) + case fri.QueryLayer: + switch v.Field { + case field.Base: + return poseidon2CommitmentLeafDigestOps(label, []commitment.PairBase{{v.LeafPBase, v.LeafQBase}}, nil) + case field.Ext: + return poseidon2CommitmentLeafDigestOps(label, nil, []commitment.PairExt{{v.LeafPExt, v.LeafQExt}}) + default: + return nil, nil, fmt.Errorf("field is %s, want base or ext", v.Field) + } + default: + return nil, nil, fmt.Errorf("recursion: unsupported Poseidon2 Merkle leaf type %T", leaf) + } +} + +func poseidon2CommitmentLeafDigestOps(label string, base []commitment.PairBase, ext []commitment.PairExt) ([]koalabear.Element, []poseidon2Op, error) { + leafElements := poseidon2LeafHashElements(base, ext) + digest, ops := poseidon2SpongeWriteOps(label, [][]koalabear.Element{leafElements}) + return digest, ops, nil +} + +func poseidon2LeafHashElements(base []commitment.PairBase, extPairs []commitment.PairExt) []koalabear.Element { + total := 3 + 2*len(base) + 8*len(extPairs) + res := make([]koalabear.Element, 0, total) + res = append(res, + hash.NewElement(poseidon2LeafDomainTag), + hash.NewElement(uint64(len(base))), + hash.NewElement(uint64(len(extPairs))), + ) + for _, pair := range base { + res = append(res, pair[0], pair[1]) + } + for _, pair := range extPairs { + res = append(res, poseidon2E4Elements(pair[0])...) + res = append(res, poseidon2E4Elements(pair[1])...) + } + return res +} + +func poseidon2NodeDigestOps(label string, left, right []koalabear.Element) ([]koalabear.Element, []poseidon2Op) { + inputs := make([]koalabear.Element, 0, 1+len(left)+len(right)) + inputs = append(inputs, hash.NewElement(poseidon2NodeDomainTag)) + inputs = append(inputs, left...) + inputs = append(inputs, right...) + return poseidon2MDDigestOps(label, inputs) +} + +func poseidon2MDDigestOps(label string, inputs []koalabear.Element) ([]koalabear.Element, []poseidon2Op) { + var state [poseidon2MDWidth]koalabear.Element + ops := make([]poseidon2Op, 0, (len(inputs)+poseidon2MDWidth-1)/poseidon2MDWidth+1) + pos := 0 + wrote := false + compressed := false + for _, input := range inputs { + state[pos].Set(&input) + pos++ + wrote = true + if pos == poseidon2MDWidth { + _, op := poseidon2MDCompressOp(fmt.Sprintf("%s.block.%d", label, len(ops)), &state) + ops = append(ops, op) + pos = poseidon2MDHalfWidth + compressed = true + } + } + if !wrote { + return make([]koalabear.Element, poseidon2DigestWidth), ops + } + if !compressed || pos > poseidon2MDHalfWidth { + for i := pos; i < poseidon2MDWidth; i++ { + state[i].SetZero() + } + _, op := poseidon2MDCompressOp(fmt.Sprintf("%s.block.%d", label, len(ops)), &state) + ops = append(ops, op) + } + return cloneBaseElements(state[:poseidon2DigestWidth]), ops +} + +func poseidon2MDCompressOp(label string, state *[poseidon2MDWidth]koalabear.Element) ([]koalabear.Element, poseidon2Op) { + input := cloneBaseElements(state[:]) + perm := poseidon2PermutationValues(input) + output := make([]koalabear.Element, poseidon2DigestWidth) + for i := range output { + output[i].Add(&perm[poseidon2MDHalfWidth+i], &input[poseidon2MDHalfWidth+i]) + } + for i := 0; i < poseidon2DigestWidth; i++ { + state[i].Set(&output[i]) + } + for i := poseidon2DigestWidth; i < poseidon2MDWidth; i++ { + state[i].SetZero() + } + return output, poseidon2Op{ + Label: label, + Width: poseidon2MDWidth, + OutputMode: poseidon2OutputMD, + Input: input, + WantOutput: cloneBaseElements(output), + } +} + +func poseidon2SpongeWriteOps(label string, writes [][]koalabear.Element) ([]koalabear.Element, []poseidon2Op) { + var state [poseidon2SpongeWidth]koalabear.Element + var block [poseidon2SpongeRate]koalabear.Element + blockLen := 0 + wrote := false + ops := make([]poseidon2Op, 0) + for _, write := range writes { + for _, input := range write { + block[blockLen].Set(&input) + blockLen++ + if blockLen == poseidon2SpongeRate { + copy(state[:poseidon2SpongeRate], block[:]) + _, op := poseidon2SpongePermuteOp(fmt.Sprintf("%s.block.%d", label, len(ops)), &state) + ops = append(ops, op) + for i := range block { + block[i].SetZero() + } + blockLen = 0 + wrote = true + } + } + } + if !wrote && blockLen == 0 { + return make([]koalabear.Element, poseidon2DigestWidth), ops + } + if blockLen > 0 { + for i := 0; i < blockLen; i++ { + state[i].Set(&block[i]) + } + _, op := poseidon2SpongePermuteOp(fmt.Sprintf("%s.block.%d", label, len(ops)), &state) + ops = append(ops, op) + } + return cloneBaseElements(state[:poseidon2DigestWidth]), ops +} + +func poseidon2SpongePermuteOp(label string, state *[poseidon2SpongeWidth]koalabear.Element) ([]koalabear.Element, poseidon2Op) { + input := cloneBaseElements(state[:]) + perm := poseidon2PermutationValues(input) + copy(state[:], perm) + output := cloneBaseElements(state[:poseidon2DigestWidth]) + return output, poseidon2Op{ + Label: label, + Width: poseidon2SpongeWidth, + OutputMode: poseidon2OutputSponge, + Input: input, + WantOutput: cloneBaseElements(output), + } +} + +func poseidon2SpongeDigestNative(writes [][]koalabear.Element) hash.Digest { + h := hash.NewPoseidon2SpongeHasher() + for _, write := range writes { + h.WriteElements(write...) + } + return h.Sum() +} + +func poseidon2E4Elements(v ext.E4) []koalabear.Element { + return []koalabear.Element{v.B0.A0, v.B0.A1, v.B1.A0, v.B1.A1} +} + +func poseidon2PermutationValues(input []koalabear.Element) []koalabear.Element { + params, err := poseidon2Params(len(input)) + if err != nil { + panic(err) + } + state := poseidon2MatMulExternalValues(input) + totalRounds := params.NbFullRounds + params.NbPartialRounds + for round := 0; round < totalRounds; round++ { + state = poseidon2RoundValues(state, params.RoundKeys[round], poseidon2IsPartialRound(params, round)) + } + return state +} + +func poseidon2IsPartialRound(params *p2crypto.Parameters, round int) bool { + rf := params.NbFullRounds / 2 + return round >= rf && round < rf+params.NbPartialRounds +} + +func (pb *poseidon2ModuleBuilder) lagrange(row int) expr.Expr { + if lagrange, ok := pb.lagranges[row]; ok { + return lagrange + } + lagrange := pb.module.LagrangeCol(row) + pb.lagranges[row] = lagrange + return lagrange +} + +func (pb *poseidon2ModuleBuilder) assertZeroAt(relation expr.Expr, row int) { + pb.module.AssertZero(relation.Mul(pb.lagrange(row))) +} + +func mergeTrace(dst trace.Trace, src trace.Trace) error { + for name, col := range src.Base { + if _, ok := dst.Base[name]; ok { + return fmt.Errorf("recursion: duplicate base trace column %q", name) + } + dst.SetBase(name, col) + } + for name, col := range src.Ext { + if _, ok := dst.Ext[name]; ok { + return fmt.Errorf("recursion: duplicate extension trace column %q", name) + } + dst.SetExt(name, col) + } + return nil +} + +func nextPowerOfTwo(n int) int { + if n <= 1 { + return 1 + } + p := 1 + for p < n { + p <<= 1 + } + return p +} + +func maxInt(a, b int) int { + if a > b { + return a + } + return b +} + +func poseidon2RoundValues(input []koalabear.Element, roundKey []koalabear.Element, partial bool) []koalabear.Element { + state := cloneBaseElements(input) + for i := range roundKey { + state[i].Add(&state[i], &roundKey[i]) + } + if partial { + state[0] = poseidon2SBoxValue(state[0]) + return poseidon2MatMulInternalValues(state) + } + for i := range state { + state[i] = poseidon2SBoxValue(state[i]) + } + return poseidon2MatMulExternalValues(state) +} + +func poseidon2RoundExprs(input []expr.Expr, roundKey []koalabear.Element, partial bool) []expr.Expr { + state := cloneExprs(input) + for i := range roundKey { + state[i] = state[i].Add(expr.Const(roundKey[i])) + } + if partial { + state[0] = poseidon2SBoxExpr(state[0]) + return poseidon2MatMulInternalExprs(state) + } + for i := range state { + state[i] = poseidon2SBoxExpr(state[i]) + } + return poseidon2MatMulExternalExprs(state) +} + +func poseidon2SBoxValue(value koalabear.Element) koalabear.Element { + var square, cube koalabear.Element + square.Square(&value) + cube.Mul(&square, &value) + return cube +} + +func poseidon2SBoxExpr(value expr.Expr) expr.Expr { + return value.Mul(value).Mul(value) +} + +func poseidon2MatMulExternalValues(input []koalabear.Element) []koalabear.Element { + state := poseidon2MatMulM4Values(input) + tmp := make([]koalabear.Element, 4) + for i := 0; i < len(state)/4; i++ { + for j := 0; j < 4; j++ { + tmp[j].Add(&tmp[j], &state[4*i+j]) + } + } + for i := 0; i < len(state)/4; i++ { + for j := 0; j < 4; j++ { + state[4*i+j].Add(&state[4*i+j], &tmp[j]) + } + } + return state +} + +func poseidon2MatMulExternalExprs(input []expr.Expr) []expr.Expr { + state := poseidon2MatMulM4Exprs(input) + tmp := make([]expr.Expr, 4) + for i := range tmp { + tmp[i] = zeroExpr() + } + for i := 0; i < len(state)/4; i++ { + for j := 0; j < 4; j++ { + tmp[j] = tmp[j].Add(state[4*i+j]) + } + } + for i := 0; i < len(state)/4; i++ { + for j := 0; j < 4; j++ { + state[4*i+j] = state[4*i+j].Add(tmp[j]) + } + } + return state +} + +func poseidon2MatMulM4Values(input []koalabear.Element) []koalabear.Element { + res := cloneBaseElements(input) + for i := 0; i < len(res)/4; i++ { + x0, x1, x2, x3 := res[4*i], res[4*i+1], res[4*i+2], res[4*i+3] + var t01, t23, t0123, t01123, t01233 koalabear.Element + t01.Add(&x0, &x1) + t23.Add(&x2, &x3) + t0123.Add(&t01, &t23) + t01123.Add(&t0123, &x1) + t01233.Add(&t0123, &x3) + res[4*i+3].Double(&x0).Add(&res[4*i+3], &t01233) + res[4*i+1].Double(&x2).Add(&res[4*i+1], &t01123) + res[4*i].Add(&t01, &t01123) + res[4*i+2].Add(&t23, &t01233) + } + return res +} + +func poseidon2MatMulM4Exprs(input []expr.Expr) []expr.Expr { + res := cloneExprs(input) + for i := 0; i < len(res)/4; i++ { + x0, x1, x2, x3 := res[4*i], res[4*i+1], res[4*i+2], res[4*i+3] + t01 := x0.Add(x1) + t23 := x2.Add(x3) + t0123 := t01.Add(t23) + t01123 := t0123.Add(x1) + t01233 := t0123.Add(x3) + res[4*i+3] = x0.Add(x0).Add(t01233) + res[4*i+1] = x2.Add(x2).Add(t01123) + res[4*i] = t01.Add(t01123) + res[4*i+2] = t23.Add(t01233) + } + return res +} + +func poseidon2MatMulInternalValues(input []koalabear.Element) []koalabear.Element { + diag := poseidon2InternalDiag(len(input)) + var sum koalabear.Element + for i := range input { + sum.Add(&sum, &input[i]) + } + res := make([]koalabear.Element, len(input)) + for i := range res { + var term koalabear.Element + term.Mul(&input[i], &diag[i]) + res[i].Add(&sum, &term) + } + return res +} + +func poseidon2MatMulInternalExprs(input []expr.Expr) []expr.Expr { + diag := poseidon2InternalDiag(len(input)) + sum := zeroExpr() + for i := range input { + sum = sum.Add(input[i]) + } + res := make([]expr.Expr, len(input)) + for i := range res { + res[i] = sum.Add(input[i].Mul(expr.Const(diag[i]))) + } + return res +} + +func poseidon2InternalDiag(width int) []koalabear.Element { + var vals []uint64 + switch width { + case poseidon2MDWidth: + vals = []uint64{ + 2130706431, 1, 2, 1065353217, + 3, 4, 1065353216, 2130706430, + 2130706429, 2122383361, 1864368129, 2130706306, + 8323072, 266338304, 133169152, 127, + } + case poseidon2SpongeWidth: + vals = []uint64{ + 2130706431, 1, 2, 1065353217, + 3, 4, 1065353216, 2130706430, + 2130706429, 2122383361, 1598029825, 1864368129, + 1997537281, 2064121857, 2097414145, 2130706306, + 8323072, 266338304, 133169152, 66584576, + 33292288, 16646144, 4161536, 127, + } + default: + panic(fmt.Errorf("recursion: unsupported Poseidon2 width %d", width)) + } + res := make([]koalabear.Element, len(vals)) + for i, v := range vals { + res[i].SetUint64(v) + } + return res +} + +func cloneBaseElements(input []koalabear.Element) []koalabear.Element { + res := make([]koalabear.Element, len(input)) + copy(res, input) + return res +} + +func cloneExprs(input []expr.Expr) []expr.Expr { + res := make([]expr.Expr, len(input)) + copy(res, input) + return res +} diff --git a/recursion/recursion.go b/recursion/recursion.go new file mode 100644 index 0000000..4ca3bc8 --- /dev/null +++ b/recursion/recursion.go @@ -0,0 +1,1698 @@ +// Copyright 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. +// +// SPDX-License-Identifier: Apache-2.0 + +// Package recursion builds Loom proofs whose constraints check the algebraic +// core of another Loom verifier invocation. +// +// The current wrapper is specialized to a concrete inner proof rather than a +// universal proof-bytes verifier. It arithmetizes public-column reconstruction, +// Lagrange values, logup bus checks, AIR quotient identities, the +// DEEP-quotient-to-FRI bridge, FRI folding arithmetic, Poseidon2 transcript +// reconstruction, and Poseidon2 Merkle paths for that proof. ProveNextLayer +// still native-verifies the full inner proof before producing the recursive +// wrapper. +package recursion + +import ( + "fmt" + "math/big" + "sort" + + "github.com/consensys/gnark-crypto/field/koalabear" + ext "github.com/consensys/gnark-crypto/field/koalabear/extensions" + "github.com/consensys/loom/board" + "github.com/consensys/loom/expr" + "github.com/consensys/loom/field" + "github.com/consensys/loom/internal/commitment" + "github.com/consensys/loom/internal/constants" + "github.com/consensys/loom/internal/dag" + fiatshamir "github.com/consensys/loom/internal/fiat-shamir" + "github.com/consensys/loom/internal/fri" + "github.com/consensys/loom/internal/hash" + "github.com/consensys/loom/internal/poly" + "github.com/consensys/loom/proof" + "github.com/consensys/loom/prover" + "github.com/consensys/loom/public" + "github.com/consensys/loom/setup" + "github.com/consensys/loom/trace" + "github.com/consensys/loom/verifier" +) + +const verifierCoreModule = "loom_recursion_core" + +// RecursionInput is the proof and verifier context for one recursion step. +type RecursionInput struct { + Program board.Program + Setup setup.VerificationKey + PublicInputs public.Inputs + Proof proof.Proof +} + +// RecursionOutput is the next-layer Loom proof and the specialized verifier +// program it proves. +type RecursionOutput struct { + Program board.Program + Proof proof.Proof +} + +// AggregationInput holds the two proofs folded into one recursive wrapper. +type AggregationInput struct { + Left RecursionInput + Right RecursionInput +} + +type Config struct { + verifyInner bool + innerVerifierOpts []verifier.Option + outerProverOpts []prover.Option + outerVerifierOpts []verifier.Option + hashBackend commitment.HashBackend + forceSkipInnerFRI bool + forceSkipOuterFRI bool + forceSkipOuterCheck bool + arithmetizePoseidon2 bool +} + +// Option configures ProveNextLayer. +type Option func(*Config) + +// WithoutInnerVerification skips the native verifier precheck. +// +// This is useful for testing that the generated outer Loom program rejects +// bad algebraic verifier-core equations. It should not be used by callers that +// want a recursive wrapper for a complete Loom proof. +func WithoutInnerVerification() Option { + return func(c *Config) { + c.verifyInner = false + } +} + +// SkipInnerFRI verifies only the inner verifier's algebraic core before +// producing the next layer. +func SkipInnerFRI() Option { + return func(c *Config) { + c.forceSkipInnerFRI = true + c.innerVerifierOpts = append(c.innerVerifierOpts, verifier.SkipFRI()) + } +} + +// SkipOuterFRI proves the recursive wrapper without the outer FRI phase. +func SkipOuterFRI() Option { + return func(c *Config) { + c.forceSkipOuterFRI = true + c.outerProverOpts = append(c.outerProverOpts, prover.SkipFRI()) + c.outerVerifierOpts = append(c.outerVerifierOpts, verifier.SkipFRI()) + } +} + +// UsePoseidon2 explicitly selects Loom's Poseidon2 hash backend for the inner +// verifier precheck, recursive wrapper proof, and verifier-core transcript +// reconstruction. Poseidon2 is Loom's default backend on current main, so this +// option is mostly kept for recursion callers that want an explicit setting. +func UsePoseidon2() Option { + return func(c *Config) { + backend := commitment.Poseidon2HashBackend() + c.arithmetizePoseidon2 = true + c.hashBackend = backend + c.innerVerifierOpts = append(c.innerVerifierOpts, verifier.WithHashBackend(backend)) + c.outerProverOpts = append(c.outerProverOpts, prover.WithHashBackend(backend)) + c.outerVerifierOpts = append(c.outerVerifierOpts, verifier.WithHashBackend(backend)) + } +} + +func defaultConfig() Config { + return Config{verifyInner: true, arithmetizePoseidon2: true} +} + +// ProveNextLayer native-verifies input.Proof and then proves, with Loom, that +// the inner verifier's algebraic core is satisfied. +func ProveNextLayer(input RecursionInput, opts ...Option) (RecursionOutput, error) { + config := defaultConfig() + for _, opt := range opts { + opt(&config) + } + + if config.verifyInner { + if err := verifier.Verify(input.PublicInputs, input.Setup, input.Program, input.Proof, config.innerVerifierOpts...); err != nil { + return RecursionOutput{}, fmt.Errorf("recursion: inner proof rejected: %w", err) + } + } + + program, tr, err := buildVerifierCore(input, config) + if err != nil { + return RecursionOutput{}, err + } + + prf, err := prover.Prove(tr, setup.ProvingKey{}, nil, program, config.outerProverOpts...) + if err != nil { + return RecursionOutput{}, fmt.Errorf("recursion: prove next layer: %w", err) + } + + if !config.forceSkipOuterCheck { + if err := verifier.Verify(nil, setup.VerificationKey{}, program, prf, config.outerVerifierOpts...); err != nil { + return RecursionOutput{}, fmt.Errorf("recursion: generated outer proof rejected: %w", err) + } + } + + return RecursionOutput{Program: program, Proof: prf}, nil +} + +// VerifyOutput verifies a recursive wrapper proof. +func VerifyOutput(output RecursionOutput, opts ...verifier.Option) error { + return verifier.Verify(nil, setup.VerificationKey{}, output.Program, output.Proof, opts...) +} + +// ProveAggregationLayer creates one Loom proof whose verifier-core constraints +// check both input proofs. +func ProveAggregationLayer(input AggregationInput, opts ...Option) (RecursionOutput, error) { + config := defaultConfig() + for _, opt := range opts { + opt(&config) + } + + if config.verifyInner { + if err := verifier.Verify(input.Left.PublicInputs, input.Left.Setup, input.Left.Program, input.Left.Proof, config.innerVerifierOpts...); err != nil { + return RecursionOutput{}, fmt.Errorf("recursion: left inner proof rejected: %w", err) + } + if err := verifier.Verify(input.Right.PublicInputs, input.Right.Setup, input.Right.Program, input.Right.Proof, config.innerVerifierOpts...); err != nil { + return RecursionOutput{}, fmt.Errorf("recursion: right inner proof rejected: %w", err) + } + } + + program, tr, err := buildAggregationCore(input, config) + if err != nil { + return RecursionOutput{}, err + } + + prf, err := prover.Prove(tr, setup.ProvingKey{}, nil, program, config.outerProverOpts...) + if err != nil { + return RecursionOutput{}, fmt.Errorf("recursion: prove aggregation layer: %w", err) + } + + if !config.forceSkipOuterCheck { + if err := verifier.Verify(nil, setup.VerificationKey{}, program, prf, config.outerVerifierOpts...); err != nil { + return RecursionOutput{}, fmt.Errorf("recursion: generated aggregation proof rejected: %w", err) + } + } + + return RecursionOutput{Program: program, Proof: prf}, nil +} + +// BuildVerifierCore returns a specialized Loom program and trace whose witness +// columns satisfy the inner verifier's algebraic core for input. +func BuildVerifierCore(input RecursionInput, opts ...Option) (board.Program, trace.Trace, error) { + config := defaultConfig() + for _, opt := range opts { + opt(&config) + } + return buildVerifierCore(input, config) +} + +func buildVerifierCore(input RecursionInput, config Config) (board.Program, trace.Trace, error) { + state, err := deriveVerifierState(input, config) + if err != nil { + return board.Program{}, trace.Trace{}, err + } + + builder := board.NewBuilder() + module := board.NewModule(verifierCoreModule) + module.N = 2 + cb := newCoreBuilder(&module, state) + cb.namespace = "single" + + if err := cb.addExposedColumnConstraints(input.Program, input.Proof); err != nil { + return board.Program{}, trace.Trace{}, err + } + if err := cb.addPublicInputColumnConstraints(input.Program, input.PublicInputs); err != nil { + return board.Program{}, trace.Trace{}, err + } + if err := cb.addProgramLagrangeConstraints(input.Program); err != nil { + return board.Program{}, trace.Trace{}, err + } + if err := cb.addLogupBusConstraints(input.Program, input.Proof); err != nil { + return board.Program{}, trace.Trace{}, err + } + if err := cb.addAIRConstraints(input.Program); err != nil { + return board.Program{}, trace.Trace{}, err + } + if !config.forceSkipInnerFRI { + if err := cb.addFRIBridgeConstraints(input); err != nil { + return board.Program{}, trace.Trace{}, err + } + if err := cb.addFRIFoldConstraints(input.Proof); err != nil { + return board.Program{}, trace.Trace{}, err + } + } + + builder.AddModule(module) + if !config.forceSkipInnerFRI && config.arithmetizePoseidon2 { + p2Module, p2Trace, err := buildPoseidon2VerifierModule( + verifierCoreModule+"_poseidon2", + []poseidon2MerkleTarget{{Namespace: "single", Input: input}}, + ) + if err != nil { + return board.Program{}, trace.Trace{}, err + } + builder.AddModule(p2Module) + if err := mergeTrace(cb.trace, p2Trace); err != nil { + return board.Program{}, trace.Trace{}, err + } + } + + program, err := board.Compile(&builder) + if err != nil { + return board.Program{}, trace.Trace{}, fmt.Errorf("recursion: compile verifier core: %w", err) + } + + return program, cb.trace, nil +} + +func buildAggregationCore(input AggregationInput, config Config) (board.Program, trace.Trace, error) { + leftState, err := deriveVerifierState(input.Left, config) + if err != nil { + return board.Program{}, trace.Trace{}, fmt.Errorf("recursion: derive left verifier state: %w", err) + } + rightState, err := deriveVerifierState(input.Right, config) + if err != nil { + return board.Program{}, trace.Trace{}, fmt.Errorf("recursion: derive right verifier state: %w", err) + } + + builder := board.NewBuilder() + module := board.NewModule(verifierCoreModule) + module.N = 2 + cb := newCoreBuilder(&module, verifierState{}) + + cb.state = leftState + cb.namespace = "left" + if err := cb.addExposedColumnConstraints(input.Left.Program, input.Left.Proof); err != nil { + return board.Program{}, trace.Trace{}, fmt.Errorf("recursion: left exposed columns: %w", err) + } + if err := cb.addPublicInputColumnConstraints(input.Left.Program, input.Left.PublicInputs); err != nil { + return board.Program{}, trace.Trace{}, fmt.Errorf("recursion: left public inputs: %w", err) + } + if err := cb.addProgramLagrangeConstraints(input.Left.Program); err != nil { + return board.Program{}, trace.Trace{}, fmt.Errorf("recursion: left lagranges: %w", err) + } + if err := cb.addLogupBusConstraints(input.Left.Program, input.Left.Proof); err != nil { + return board.Program{}, trace.Trace{}, fmt.Errorf("recursion: left logup: %w", err) + } + if err := cb.addAIRConstraints(input.Left.Program); err != nil { + return board.Program{}, trace.Trace{}, fmt.Errorf("recursion: left AIR: %w", err) + } + if !config.forceSkipInnerFRI { + if err := cb.addFRIBridgeConstraints(input.Left); err != nil { + return board.Program{}, trace.Trace{}, fmt.Errorf("recursion: left FRI bridge: %w", err) + } + if err := cb.addFRIFoldConstraints(input.Left.Proof); err != nil { + return board.Program{}, trace.Trace{}, fmt.Errorf("recursion: left FRI folds: %w", err) + } + } + + cb.state = rightState + cb.namespace = "right" + if err := cb.addExposedColumnConstraints(input.Right.Program, input.Right.Proof); err != nil { + return board.Program{}, trace.Trace{}, fmt.Errorf("recursion: right exposed columns: %w", err) + } + if err := cb.addPublicInputColumnConstraints(input.Right.Program, input.Right.PublicInputs); err != nil { + return board.Program{}, trace.Trace{}, fmt.Errorf("recursion: right public inputs: %w", err) + } + if err := cb.addProgramLagrangeConstraints(input.Right.Program); err != nil { + return board.Program{}, trace.Trace{}, fmt.Errorf("recursion: right lagranges: %w", err) + } + if err := cb.addLogupBusConstraints(input.Right.Program, input.Right.Proof); err != nil { + return board.Program{}, trace.Trace{}, fmt.Errorf("recursion: right logup: %w", err) + } + if err := cb.addAIRConstraints(input.Right.Program); err != nil { + return board.Program{}, trace.Trace{}, fmt.Errorf("recursion: right AIR: %w", err) + } + if !config.forceSkipInnerFRI { + if err := cb.addFRIBridgeConstraints(input.Right); err != nil { + return board.Program{}, trace.Trace{}, fmt.Errorf("recursion: right FRI bridge: %w", err) + } + if err := cb.addFRIFoldConstraints(input.Right.Proof); err != nil { + return board.Program{}, trace.Trace{}, fmt.Errorf("recursion: right FRI folds: %w", err) + } + } + + builder.AddModule(module) + if !config.forceSkipInnerFRI && config.arithmetizePoseidon2 { + p2Module, p2Trace, err := buildPoseidon2VerifierModule( + verifierCoreModule+"_poseidon2", + []poseidon2MerkleTarget{ + {Namespace: "left", Input: input.Left}, + {Namespace: "right", Input: input.Right}, + }, + ) + if err != nil { + return board.Program{}, trace.Trace{}, err + } + builder.AddModule(p2Module) + if err := mergeTrace(cb.trace, p2Trace); err != nil { + return board.Program{}, trace.Trace{}, err + } + } + + program, err := board.Compile(&builder) + if err != nil { + return board.Program{}, trace.Trace{}, fmt.Errorf("recursion: compile aggregation core: %w", err) + } + + return program, cb.trace, nil +} + +type verifierState struct { + values map[string]ext.E4 + zeta ext.E4 + alpha ext.E4 + fri friVerifierState +} + +type friVerifierState struct { + maxN int + numRounds int + levelAtRound map[int]int + foldAlphas []ext.E4 + levelGammas map[int]ext.E4 + queryIndices []int +} + +type coreBuilder struct { + module *board.Module + trace trace.Trace + state verifierState + namespace string + lagranges map[string]struct{} +} + +func newCoreBuilder(module *board.Module, state verifierState) *coreBuilder { + return &coreBuilder{ + module: module, + trace: trace.New(), + state: state, + namespace: "inner", + lagranges: make(map[string]struct{}), + } +} + +func (cb *coreBuilder) scopedName(kind, key string) string { + return fmt.Sprintf("rec.%s.%s.%s", cb.namespace, kind, key) +} + +func (cb *coreBuilder) setExtColumn(name string, value ext.E4) (expr.Expr, error) { + if existing, ok := cb.trace.Ext[name]; ok { + if len(existing) != cb.module.N { + return nil, fmt.Errorf("recursion: extension column %q has length %d, want %d", name, len(existing), cb.module.N) + } + for i := range existing { + if !existing[i].Equal(&value) { + return nil, fmt.Errorf("recursion: extension column %q reused with different value at row %d", name, i) + } + } + return expr.ExtCol(name), nil + } + + col := make(trace.ExtPolynomial, cb.module.N) + for i := range col { + col[i].Set(&value) + } + cb.trace.SetExt(name, col) + return expr.ExtCol(name), nil +} + +func (cb *coreBuilder) valueExpr(key string) (expr.Expr, error) { + value, ok := cb.state.values[key] + if !ok { + return nil, fmt.Errorf("recursion: verifier value %q not found", key) + } + return cb.setExtColumn(cb.scopedName("value", key), value) +} + +func (cb *coreBuilder) zetaExpr() (expr.Expr, error) { + return cb.setExtColumn(cb.scopedName("challenge", constants.FINAL_EVALUATION_POINT), cb.state.zeta) +} + +func (cb *coreBuilder) alphaExpr() (expr.Expr, error) { + return cb.setExtColumn(cb.scopedName("challenge", constants.DEEP_ALPHA), cb.state.alpha) +} + +func (cb *coreBuilder) friFoldAlphaExpr(round int) (expr.Expr, error) { + if round < 0 || round >= len(cb.state.fri.foldAlphas) { + return nil, fmt.Errorf("recursion: FRI fold alpha round %d out of range", round) + } + return cb.setExtColumn(cb.scopedName("challenge", friFoldName(round)), cb.state.fri.foldAlphas[round]) +} + +func (cb *coreBuilder) friLevelGammaExpr(level int) (expr.Expr, error) { + gamma, ok := cb.state.fri.levelGammas[level] + if !ok { + return nil, fmt.Errorf("recursion: FRI gamma for level %d not found", level) + } + return cb.setExtColumn(cb.scopedName("challenge", friLevelGammaName(level)), gamma) +} + +func (cb *coreBuilder) literalExpr(key string, value ext.E4) (expr.Expr, error) { + return cb.setExtColumn(cb.scopedName("literal", key), value) +} + +func (cb *coreBuilder) setVerifierValue(key string, value ext.E4) { + if cb.state.values == nil { + cb.state.values = make(map[string]ext.E4) + } + cb.state.values[key] = value +} + +func (cb *coreBuilder) addExposedColumnConstraints(program board.Program, prf proof.Proof) error { + moduleNames := sortedModuleNames(program.Modules) + for _, moduleName := range moduleNames { + innerModule := program.Modules[moduleName] + names := innerModule.VanishingRelation.Leaves(expr.NewConfig(expr.OnlyExposedColumns...)) + sort.Strings(names) + for _, name := range names { + pi, ok := prf.ExposedValues[name] + if !ok { + return fmt.Errorf("recursion: exposed column %q not found in proof.ExposedValues", name) + } + eval, err := cb.valueExpr(name) + if err != nil { + return fmt.Errorf("recursion: exposed column %q evaluation: %w", name, err) + } + + sum := zeroExpr() + for entryIndex, pe := range pi.Entries { + idx, err := normalizeIndex(pe.Idx, innerModule.N) + if err != nil { + return fmt.Errorf("recursion: exposed column %q entry %d: %w", name, entryIndex, err) + } + + lagKey := fmt.Sprintf("exposed.%s.%s.%d.%d.%d", moduleName, name, innerModule.N, idx, entryIndex) + if _, ok := cb.state.values[lagKey]; !ok { + cb.setVerifierValue(lagKey, poly.LagrangeAtZetaExt(cb.state.zeta, innerModule.N, idx)) + } + lag, err := cb.valueExpr(lagKey) + if err != nil { + return err + } + if err := cb.addLagrangeConstraint(lagKey, innerModule.N, idx); err != nil { + return fmt.Errorf("recursion: exposed column %q entry %d lagrange: %w", name, entryIndex, err) + } + + value, err := cb.exposedEntryExpr(name, entryIndex, pe) + if err != nil { + return fmt.Errorf("recursion: exposed column %q entry %d value: %w", name, entryIndex, err) + } + sum = sum.Add(value.Mul(lag)) + } + + cb.module.AssertZero(eval.Sub(sum)) + } + } + return nil +} + +func (cb *coreBuilder) addPublicInputColumnConstraints(program board.Program, inputs public.Inputs) error { + moduleNames := sortedModuleNames(program.Modules) + for _, moduleName := range moduleNames { + innerModule := program.Modules[moduleName] + names := innerModule.VanishingRelation.Leaves(expr.NewConfig(expr.OnlyPublicColumns...)) + sort.Strings(names) + for _, name := range names { + pi, ok := inputs[name] + if !ok { + return fmt.Errorf("recursion: public input column %q not found", name) + } + if pi.Module != moduleName { + return fmt.Errorf("recursion: public input column %q belongs to module %q, used from module %q", name, pi.Module, moduleName) + } + eval, err := cb.valueExpr(name) + if err != nil { + return fmt.Errorf("recursion: public input column %q evaluation: %w", name, err) + } + + sum := zeroExpr() + for entryIndex, pe := range pi.Entries { + if pe.Idx < 0 || pe.Idx >= innerModule.N { + return fmt.Errorf("recursion: public input column %q entry %d index %d out of bounds for module %q of size %d", name, entryIndex, pe.Idx, moduleName, innerModule.N) + } + + lagKey := fmt.Sprintf("public_input.%s.%s.%d.%d.%d", moduleName, name, innerModule.N, pe.Idx, entryIndex) + if _, ok := cb.state.values[lagKey]; !ok { + cb.setVerifierValue(lagKey, poly.LagrangeAtZetaExt(cb.state.zeta, innerModule.N, pe.Idx)) + } + lag, err := cb.valueExpr(lagKey) + if err != nil { + return err + } + if err := cb.addLagrangeConstraint(lagKey, innerModule.N, pe.Idx); err != nil { + return fmt.Errorf("recursion: public input column %q entry %d lagrange: %w", name, entryIndex, err) + } + + value, err := cb.publicInputEntryExpr(name, entryIndex, pe) + if err != nil { + return fmt.Errorf("recursion: public input column %q entry %d value: %w", name, entryIndex, err) + } + sum = sum.Add(value.Mul(lag)) + } + + cb.module.AssertZero(eval.Sub(sum)) + } + } + return nil +} + +func (cb *coreBuilder) publicInputEntryExpr(name string, entryIndex int, pe public.Entry) (expr.Expr, error) { + return cb.literalExpr(fmt.Sprintf("public_input.%s.%d", name, entryIndex), pe.ExtValue()) +} + +func (cb *coreBuilder) exposedEntryExpr(name string, entryIndex int, pe proof.ExposedEntry) (expr.Expr, error) { + return cb.literalExpr(fmt.Sprintf("exposed.%s.%d", name, entryIndex), pe.ExtValue()) +} + +func (cb *coreBuilder) addProgramLagrangeConstraints(program board.Program) error { + config := expr.OnlyLagranges + moduleNames := sortedModuleNames(program.Modules) + for _, moduleName := range moduleNames { + innerModule := program.Modules[moduleName] + lags := innerModule.VanishingRelation.Leaves(expr.NewConfig(config...)) + sort.Strings(lags) + for _, lag := range lags { + idx := constants.ParseLagrangeName(lag) + if idx < 0 { + idx = innerModule.N + idx + } + if err := cb.addLagrangeConstraint(lag, innerModule.N, idx); err != nil { + return err + } + } + } + return nil +} + +func (cb *coreBuilder) addLagrangeConstraint(name string, n, idx int) error { + idx, err := normalizeIndex(idx, n) + if err != nil { + return err + } + if uint64(n) > uint64(^uint32(0)) { + return fmt.Errorf("recursion: lagrange domain size %d exceeds expression exponent limit", n) + } + + lagrangeKey := cb.scopedName("lagrange", fmt.Sprintf("%s.%d.%d", name, n, idx)) + if _, ok := cb.lagranges[lagrangeKey]; ok { + return nil + } + cb.lagranges[lagrangeKey] = struct{}{} + + lag, err := cb.valueExpr(name) + if err != nil { + return err + } + zeta, err := cb.zetaExpr() + if err != nil { + return err + } + + omegaI, err := koalabear.Generator(uint64(n)) + if err != nil { + return err + } + omegaI.Exp(omegaI, big.NewInt(int64(idx))) + + left := lag.Mul(zeta.Sub(expr.Const(omegaI))).Mul(uintConst(uint64(n))) + right := zeta.Pow(uint32(n)).Sub(oneExpr()).Mul(expr.Const(omegaI)) + cb.module.AssertZero(left.Sub(right)) + return nil +} + +func (cb *coreBuilder) addLogupBusConstraints(program board.Program, prf proof.Proof) error { + for busIndex, bus := range program.LogupBus { + sum := zeroExpr() + for _, pos := range bus.Positive { + value, err := cb.logupPublicEntryExpr(prf, pos) + if err != nil { + return fmt.Errorf("recursion: logup bus %d positive %q: %w", busIndex, pos, err) + } + sum = sum.Add(value) + } + for _, neg := range bus.Negative { + value, err := cb.logupPublicEntryExpr(prf, neg) + if err != nil { + return fmt.Errorf("recursion: logup bus %d negative %q: %w", busIndex, neg, err) + } + sum = sum.Sub(value) + } + cb.module.AssertZero(sum) + } + return nil +} + +func (cb *coreBuilder) logupPublicEntryExpr(prf proof.Proof, name string) (expr.Expr, error) { + pi, ok := prf.ExposedValues[name] + if !ok { + return nil, fmt.Errorf("exposed column not found") + } + if len(pi.Entries) != 1 { + return nil, fmt.Errorf("has %d entries, want 1", len(pi.Entries)) + } + return cb.literalExpr("logup."+name, pi.Entries[0].ExtValue()) +} + +func (cb *coreBuilder) addAIRConstraints(program board.Program) error { + moduleNames := sortedModuleNames(program.Modules) + for _, moduleName := range moduleNames { + innerModule := program.Modules[moduleName] + zeta, err := cb.zetaExpr() + if err != nil { + return err + } + if uint64(innerModule.N) > uint64(^uint32(0)) { + return fmt.Errorf("recursion: module %q size %d exceeds expression exponent limit", moduleName, innerModule.N) + } + + qZeta := zeroExpr() + zetaPowIN := oneExpr() + zetaN := zeta.Pow(uint32(innerModule.N)) + for i := 0; ; i++ { + chunkName := constants.QuotientChunkName(moduleName, i) + if _, ok := cb.state.values[chunkName]; !ok { + break + } + chunk, err := cb.valueExpr(chunkName) + if err != nil { + return err + } + qZeta = qZeta.Add(zetaPowIN.Mul(chunk)) + zetaPowIN = zetaPowIN.Mul(zetaN) + } + + vZeta, err := cb.translateDAG(innerModule.VanishingRelation.Root) + if err != nil { + return fmt.Errorf("recursion: translate AIR relation for module %q: %w", moduleName, err) + } + cb.module.AssertZero(vZeta.Sub(zetaN.Sub(oneExpr()).Mul(qZeta))) + } + return nil +} + +func (cb *coreBuilder) translateDAG(node *dag.DAGNode) (expr.Expr, error) { + switch node.Kind { + case dag.KindLeaf: + if node.IsConst { + return expr.Const(node.ConstVal), nil + } + if node.Leaf == nil { + return nil, fmt.Errorf("leaf node has nil leaf") + } + return cb.valueExpr(node.Leaf.String()) + + case dag.KindAdd: + return cb.translateFold(node.Children, func(left, right expr.Expr) expr.Expr { + return left.Add(right) + }) + + case dag.KindSub: + if len(node.Children) != 2 { + return nil, fmt.Errorf("sub node has %d children, want 2", len(node.Children)) + } + left, err := cb.translateDAG(node.Children[0]) + if err != nil { + return nil, err + } + right, err := cb.translateDAG(node.Children[1]) + if err != nil { + return nil, err + } + return left.Sub(right), nil + + case dag.KindMul: + return cb.translateFold(node.Children, func(left, right expr.Expr) expr.Expr { + return left.Mul(right) + }) + + case dag.KindPow: + if len(node.Children) != 1 { + return nil, fmt.Errorf("pow node has %d children, want 1", len(node.Children)) + } + base, err := cb.translateDAG(node.Children[0]) + if err != nil { + return nil, err + } + return base.Pow(node.Exp), nil + + default: + return nil, fmt.Errorf("unknown DAG node kind %d", node.Kind) + } +} + +func (cb *coreBuilder) translateFold(children []*dag.DAGNode, op func(expr.Expr, expr.Expr) expr.Expr) (expr.Expr, error) { + if len(children) == 0 { + return zeroExpr(), nil + } + acc, err := cb.translateDAG(children[0]) + if err != nil { + return nil, err + } + for _, child := range children[1:] { + next, err := cb.translateDAG(child) + if err != nil { + return nil, err + } + acc = op(acc, next) + } + return acc, nil +} + +func (cb *coreBuilder) addFRIBridgeConstraints(input RecursionInput) error { + prf := input.Proof + if len(prf.DeepQuotientFriProof.FRIQueries) != constants.NUM_QUERIES { + return fmt.Errorf("recursion: FRI bridge has %d FRI queries, want %d", len(prf.DeepQuotientFriProof.FRIQueries), constants.NUM_QUERIES) + } + + layout := prover.BuildLayout(input.Program, len(input.Setup.Roots)) + dqLayout := prover.BuildDeepQuotientLayout(input.Program) + if len(dqLayout.Sizes) > 1 && len(prf.DeepQuotientFriProof.LevelQueries) < len(dqLayout.Sizes)-1 { + return fmt.Errorf("recursion: FRI bridge has %d level query sets, want at least %d", len(prf.DeepQuotientFriProof.LevelQueries), len(dqLayout.Sizes)-1) + } + + zeta, err := cb.zetaExpr() + if err != nil { + return err + } + alpha, err := cb.alphaExpr() + if err != nil { + return err + } + + for q := 0; q < constants.NUM_QUERIES; q++ { + query := prf.DeepQuotientFriProof.FRIQueries[q] + if len(query.Layers) == 0 { + return fmt.Errorf("recursion: FRI query %d has no layers", q) + } + sFull := query.Layers[0].Path.LeafIdx + + for level, n := range dqLayout.Sizes { + domainSize := constants.RATE * n + halfDomain := domainSize / 2 + if halfDomain <= 0 { + return fmt.Errorf("recursion: invalid FRI bridge domain size %d for N=%d", domainSize, n) + } + sLocal := sFull % halfDomain + + xBase, negXBase, err := bridgeSamplePoints(domainSize, sLocal) + if err != nil { + return err + } + x := liftBaseToExt(xBase) + negX := liftBaseToExt(negXBase) + + domainGenerator, err := koalabear.Generator(uint64(n)) + if err != nil { + return err + } + + deepAtX := zeroExpr() + deepAtNegX := zeroExpr() + var alphaAcc ext.E4 + alphaAcc.SetOne() + alphaAccExpr := oneExpr() + + for shiftIdx, shift := range dqLayout.Shifts[level] { + var omegaShift koalabear.Element + omegaShift.Exp(domainGenerator, big.NewInt(int64(shift))) + zetaAtShift := cb.state.zeta + zetaAtShift.MulByElement(&zetaAtShift, &omegaShift) + zetaAtShiftExpr := zeta.Mul(expr.Const(omegaShift)) + + vAtZeta := zeroExpr() + cAtX := zeroExpr() + cAtNegX := zeroExpr() + var vAtZetaVal, cAtXVal, cAtNegXVal ext.E4 + + names := dqLayout.Names[level][shiftIdx] + keys := dqLayout.Keys[level][shiftIdx] + for k := range names { + evalAtZetaVal, ok := cb.state.values[keys[k]] + if !ok { + return fmt.Errorf("recursion: FRI bridge value %q not found", keys[k]) + } + evalAtZeta, err := cb.valueExpr(keys[k]) + if err != nil { + return err + } + slot, ok := layout.ColSlot[names[k]] + if !ok { + return fmt.Errorf("recursion: FRI bridge column %q not found in layout", names[k]) + } + leafX, leafNegX, leafXVal, leafNegXVal, err := cb.bridgeSamplePair(prf, slot, q, fmt.Sprintf("q%d.l%d.s%d.c%d", q, level, shiftIdx, k)) + if err != nil { + return err + } + + vAtZeta = vAtZeta.Add(evalAtZeta.Mul(alphaAccExpr)) + cAtX = cAtX.Add(leafX.Mul(alphaAccExpr)) + cAtNegX = cAtNegX.Add(leafNegX.Mul(alphaAccExpr)) + addWeightedExt(&vAtZetaVal, evalAtZetaVal, alphaAcc) + addWeightedExt(&cAtXVal, leafXVal, alphaAcc) + addWeightedExt(&cAtNegXVal, leafNegXVal, alphaAcc) + + alphaAcc.Mul(&alphaAcc, &cb.state.alpha) + alphaAccExpr = alphaAccExpr.Mul(alpha) + } + + numXVal := subExt(vAtZetaVal, cAtXVal) + denomXVal := subExt(zetaAtShift, x) + quotXVal := divExt(numXVal, denomXVal) + quotX, err := cb.addBridgeFraction( + fmt.Sprintf("q%d.l%d.s%d.p", q, level, shiftIdx), + vAtZeta.Sub(cAtX), + zetaAtShiftExpr.Sub(expr.Const(xBase)), + quotXVal, + ) + if err != nil { + return err + } + deepAtX = deepAtX.Add(quotX) + + numNegXVal := subExt(vAtZetaVal, cAtNegXVal) + denomNegXVal := subExt(zetaAtShift, negX) + quotNegXVal := divExt(numNegXVal, denomNegXVal) + quotNegX, err := cb.addBridgeFraction( + fmt.Sprintf("q%d.l%d.s%d.q", q, level, shiftIdx), + vAtZeta.Sub(cAtNegX), + zetaAtShiftExpr.Sub(expr.Const(negXBase)), + quotNegXVal, + ) + if err != nil { + return err + } + deepAtNegX = deepAtNegX.Add(quotNegX) + } + + if len(dqLayout.AIRChunks[level]) > 0 { + vAtZeta := zeroExpr() + cAtX := zeroExpr() + cAtNegX := zeroExpr() + var vAtZetaVal, cAtXVal, cAtNegXVal ext.E4 + + for chunkIdx, chunkName := range dqLayout.AIRChunks[level] { + evalAtZetaVal, ok := cb.state.values[chunkName] + if !ok { + return fmt.Errorf("recursion: FRI bridge AIR chunk %q not found", chunkName) + } + evalAtZeta, err := cb.valueExpr(chunkName) + if err != nil { + return err + } + slot, ok := layout.AIRChunkSlot[chunkName] + if !ok { + return fmt.Errorf("recursion: FRI bridge AIR chunk %q not found in layout", chunkName) + } + leafX, leafNegX, leafXVal, leafNegXVal, err := cb.bridgeSamplePair(prf, slot, q, fmt.Sprintf("q%d.l%d.air%d", q, level, chunkIdx)) + if err != nil { + return err + } + + vAtZeta = vAtZeta.Add(evalAtZeta.Mul(alphaAccExpr)) + cAtX = cAtX.Add(leafX.Mul(alphaAccExpr)) + cAtNegX = cAtNegX.Add(leafNegX.Mul(alphaAccExpr)) + addWeightedExt(&vAtZetaVal, evalAtZetaVal, alphaAcc) + addWeightedExt(&cAtXVal, leafXVal, alphaAcc) + addWeightedExt(&cAtNegXVal, leafNegXVal, alphaAcc) + + alphaAcc.Mul(&alphaAcc, &cb.state.alpha) + alphaAccExpr = alphaAccExpr.Mul(alpha) + } + + numXVal := subExt(vAtZetaVal, cAtXVal) + denomXVal := subExt(cb.state.zeta, x) + quotXVal := divExt(numXVal, denomXVal) + quotX, err := cb.addBridgeFraction( + fmt.Sprintf("q%d.l%d.air.p", q, level), + vAtZeta.Sub(cAtX), + zeta.Sub(expr.Const(xBase)), + quotXVal, + ) + if err != nil { + return err + } + deepAtX = deepAtX.Add(quotX) + + numNegXVal := subExt(vAtZetaVal, cAtNegXVal) + denomNegXVal := subExt(cb.state.zeta, negX) + quotNegXVal := divExt(numNegXVal, denomNegXVal) + quotNegX, err := cb.addBridgeFraction( + fmt.Sprintf("q%d.l%d.air.q", q, level), + vAtZeta.Sub(cAtNegX), + zeta.Sub(expr.Const(negXBase)), + quotNegXVal, + ) + if err != nil { + return err + } + deepAtNegX = deepAtNegX.Add(quotNegX) + } + + actualX, actualNegX, err := cb.bridgeActualPair(prf, q, level) + if err != nil { + return err + } + cb.module.AssertZero(deepAtX.Sub(actualX)) + cb.module.AssertZero(deepAtNegX.Sub(actualNegX)) + } + } + + return nil +} + +func (cb *coreBuilder) bridgeSamplePair(prf proof.Proof, slot prover.Slot, q int, label string) (expr.Expr, expr.Expr, ext.E4, ext.E4, error) { + if q >= len(prf.PointSamplings) { + return nil, nil, ext.E4{}, ext.E4{}, fmt.Errorf("point sampling query %d out of range", q) + } + if slot.TreeIdx >= len(prf.PointSamplings[q]) { + return nil, nil, ext.E4{}, ext.E4{}, fmt.Errorf("point sampling query %d tree index %d out of range", q, slot.TreeIdx) + } + wp := prf.PointSamplings[q][slot.TreeIdx] + + var xVal, negXVal ext.E4 + if slot.Field == field.Ext { + if slot.PolyIdx >= len(wp.RawLeafExt) { + return nil, nil, ext.E4{}, ext.E4{}, fmt.Errorf("point sampling ext leaf index %d out of range for slot %+v", slot.PolyIdx, slot) + } + xVal = wp.RawLeafExt[slot.PolyIdx][0] + negXVal = wp.RawLeafExt[slot.PolyIdx][1] + } else { + if slot.PolyIdx >= len(wp.RawLeafBase) { + return nil, nil, ext.E4{}, ext.E4{}, fmt.Errorf("point sampling base leaf index %d out of range for slot %+v", slot.PolyIdx, slot) + } + xVal = liftBaseToExt(wp.RawLeafBase[slot.PolyIdx][0]) + negXVal = liftBaseToExt(wp.RawLeafBase[slot.PolyIdx][1]) + } + + x, err := cb.literalExpr("bridge.sample."+label+".p", xVal) + if err != nil { + return nil, nil, ext.E4{}, ext.E4{}, err + } + negX, err := cb.literalExpr("bridge.sample."+label+".q", negXVal) + if err != nil { + return nil, nil, ext.E4{}, ext.E4{}, err + } + return x, negX, xVal, negXVal, nil +} + +func (cb *coreBuilder) bridgeActualPair(prf proof.Proof, q, level int) (expr.Expr, expr.Expr, error) { + var layerField field.Kind + var xVal, negXVal ext.E4 + if level == 0 { + if q >= len(prf.DeepQuotientFriProof.FRIQueries) { + return nil, nil, fmt.Errorf("FRI query %d out of range", q) + } + if len(prf.DeepQuotientFriProof.FRIQueries[q].Layers) == 0 { + return nil, nil, fmt.Errorf("FRI query %d has no layers", q) + } + layer := prf.DeepQuotientFriProof.FRIQueries[q].Layers[0] + layerField = layer.Field + xVal = layer.LeafPExt + negXVal = layer.LeafQExt + } else { + if level-1 >= len(prf.DeepQuotientFriProof.LevelQueries) { + return nil, nil, fmt.Errorf("FRI level query set %d out of range", level-1) + } + if q >= len(prf.DeepQuotientFriProof.LevelQueries[level-1]) { + return nil, nil, fmt.Errorf("FRI level %d query %d out of range", level, q) + } + layer := prf.DeepQuotientFriProof.LevelQueries[level-1][q] + layerField = layer.Field + xVal = layer.LeafPExt + negXVal = layer.LeafQExt + } + if layerField != field.Ext { + return nil, nil, fmt.Errorf("expected extension FRI query layer, got %s", layerField) + } + + x, err := cb.literalExpr(fmt.Sprintf("bridge.actual.q%d.l%d.p", q, level), xVal) + if err != nil { + return nil, nil, err + } + negX, err := cb.literalExpr(fmt.Sprintf("bridge.actual.q%d.l%d.q", q, level), negXVal) + if err != nil { + return nil, nil, err + } + return x, negX, nil +} + +func (cb *coreBuilder) addBridgeFraction(label string, numerator, denominator expr.Expr, quotientValue ext.E4) (expr.Expr, error) { + quotient, err := cb.literalExpr("bridge.quot."+label, quotientValue) + if err != nil { + return nil, err + } + cb.module.AssertZero(quotient.Mul(denominator).Sub(numerator)) + return quotient, nil +} + +func (cb *coreBuilder) addFRIFoldConstraints(prf proof.Proof) error { + state := cb.state.fri + if state.numRounds == 0 { + return nil + } + friProof := prf.DeepQuotientFriProof + if friProof.FinalField != field.Ext { + return fmt.Errorf("recursion: FRI folds expected extension final polynomial, got %s", friProof.FinalField) + } + if len(friProof.FinalPolyExt) == 0 { + return fmt.Errorf("recursion: FRI folds final extension polynomial is empty") + } + if len(friProof.FRIQueries) != constants.NUM_QUERIES { + return fmt.Errorf("recursion: FRI folds have %d queries, want %d", len(friProof.FRIQueries), constants.NUM_QUERIES) + } + if len(state.queryIndices) != constants.NUM_QUERIES { + return fmt.Errorf("recursion: FRI fold state has %d query indices, want %d", len(state.queryIndices), constants.NUM_QUERIES) + } + + var two, invTwo koalabear.Element + two.SetUint64(2) + invTwo.Inverse(&two) + invTwoExpr := expr.Const(invTwo) + + for q := 0; q < constants.NUM_QUERIES; q++ { + query := friProof.FRIQueries[q] + if len(query.Layers) != state.numRounds { + return fmt.Errorf("recursion: FRI query %d has %d layers, want %d", q, len(query.Layers), state.numRounds) + } + s := state.queryIndices[q] + + for round := 0; round < state.numRounds; round++ { + nRound := constants.RATE * state.maxN >> round + if nRound <= 1 { + return fmt.Errorf("recursion: invalid FRI round %d domain size %d", round, nRound) + } + base := s % (nRound / 2) + layer := query.Layers[round] + if layer.Path.LeafIdx != base { + return fmt.Errorf("recursion: FRI query %d round %d opens leaf %d, want %d", q, round, layer.Path.LeafIdx, base) + } + + leafP, leafQ, err := cb.friLayerPairExpr(fmt.Sprintf("q%d.r%d", q, round), layer) + if err != nil { + return err + } + alpha, err := cb.friFoldAlphaExpr(round) + if err != nil { + return err + } + + generator, err := koalabear.Generator(uint64(nRound)) + if err != nil { + return err + } + var xInv koalabear.Element + xInv.Exp(generator, big.NewInt(int64(nRound-base))) + + expected := leafP.Add(leafQ).Mul(invTwoExpr). + Add(leafP.Sub(leafQ).Mul(invTwoExpr).Mul(expr.Const(xInv)).Mul(alpha)) + + if round < state.numRounds-1 { + nextRoundSize := nRound / 2 + nextLayer := query.Layers[round+1] + nextBase := s % (nextRoundSize / 2) + if nextLayer.Path.LeafIdx != nextBase { + return fmt.Errorf("recursion: FRI query %d round %d opens leaf %d, want %d", q, round+1, nextLayer.Path.LeafIdx, nextBase) + } + nextLeafP, nextLeafQ, err := cb.friLayerPairExpr(fmt.Sprintf("q%d.r%d", q, round+1), nextLayer) + if err != nil { + return err + } + + isLeafP := base < nextRoundSize/2 + if level, ok := state.levelAtRound[round+1]; ok { + levelLeaf, err := cb.friLevelContributionExpr(prf, q, level, isLeafP) + if err != nil { + return err + } + gamma, err := cb.friLevelGammaExpr(level) + if err != nil { + return err + } + expected = expected.Add(levelLeaf.Mul(gamma)) + } + + if isLeafP { + cb.module.AssertZero(expected.Sub(nextLeafP)) + } else { + cb.module.AssertZero(expected.Sub(nextLeafQ)) + } + continue + } + + finalVal := friProof.FinalPolyExt[s%len(friProof.FinalPolyExt)] + finalExpr, err := cb.literalExpr(fmt.Sprintf("fri.final.q%d", q), finalVal) + if err != nil { + return err + } + cb.module.AssertZero(expected.Sub(finalExpr)) + } + } + + return nil +} + +func (cb *coreBuilder) friLayerPairExpr(label string, layer fri.QueryLayer) (expr.Expr, expr.Expr, error) { + if layer.Field != field.Ext { + return nil, nil, fmt.Errorf("recursion: FRI layer %s has field %s, want %s", label, layer.Field, field.Ext) + } + leafP, err := cb.literalExpr("fri.layer."+label+".p", layer.LeafPExt) + if err != nil { + return nil, nil, err + } + leafQ, err := cb.literalExpr("fri.layer."+label+".q", layer.LeafQExt) + if err != nil { + return nil, nil, err + } + return leafP, leafQ, nil +} + +func (cb *coreBuilder) friLevelContributionExpr(prf proof.Proof, query, level int, useP bool) (expr.Expr, error) { + if level <= 0 || level-1 >= len(prf.DeepQuotientFriProof.LevelQueries) { + return nil, fmt.Errorf("recursion: FRI extra level %d out of range", level) + } + if query >= len(prf.DeepQuotientFriProof.LevelQueries[level-1]) { + return nil, fmt.Errorf("recursion: FRI extra level %d query %d out of range", level, query) + } + layer := prf.DeepQuotientFriProof.LevelQueries[level-1][query] + if layer.Field != field.Ext { + return nil, fmt.Errorf("recursion: FRI extra level %d query %d has field %s, want %s", level, query, layer.Field, field.Ext) + } + nLevel := constants.RATE * cb.state.fri.maxN >> cb.friRoundForLevel(level) + base := cb.state.fri.queryIndices[query] % (nLevel / 2) + if layer.Path.LeafIdx != base { + return nil, fmt.Errorf("recursion: FRI extra level %d query %d opens leaf %d, want %d", level, query, layer.Path.LeafIdx, base) + } + if useP { + return cb.literalExpr(fmt.Sprintf("fri.level.q%d.l%d.p", query, level), layer.LeafPExt) + } + return cb.literalExpr(fmt.Sprintf("fri.level.q%d.l%d.q", query, level), layer.LeafQExt) +} + +func (cb *coreBuilder) friRoundForLevel(level int) int { + for round, candidate := range cb.state.fri.levelAtRound { + if candidate == level { + return round + } + } + return 0 +} + +func resolveRecursionHashBackend(input RecursionInput, config Config) (commitment.HashBackend, error) { + keyID := input.Setup.HashBackendID + if keyID == "" { + keyID = input.Proof.HashBackendID + } + hashBackend, err := commitment.ResolveHashBackend(config.hashBackend, keyID) + if err != nil { + return commitment.HashBackend{}, err + } + if input.Setup.HashBackendID != "" && commitment.NormalizeHashBackendID(input.Setup.HashBackendID) != hashBackend.ID { + return commitment.HashBackend{}, fmt.Errorf("recursion: setup hash backend %q does not match verifier backend %q", input.Setup.HashBackendID, hashBackend.ID) + } + if input.Proof.HashBackendID != "" && commitment.NormalizeHashBackendID(input.Proof.HashBackendID) != hashBackend.ID { + return commitment.HashBackend{}, fmt.Errorf("recursion: proof hash backend %q does not match verifier backend %q", input.Proof.HashBackendID, hashBackend.ID) + } + return hashBackend, nil +} + +func deriveVerifierState(input RecursionInput, config Config) (verifierState, error) { + layout := prover.BuildLayout(input.Program, len(input.Setup.Roots)) + wantCommitments := layout.NumTrees - layout.SetupEnd + if len(input.Proof.Commitments) != wantCommitments { + return verifierState{}, fmt.Errorf("recursion: proof has %d commitments, layout expects %d", len(input.Proof.Commitments), wantCommitments) + } + + if len(input.Setup.Roots) != layout.SetupEnd-layout.SetupBegin { + return verifierState{}, fmt.Errorf("recursion: setup has %d trees, layout expects %d", len(input.Setup.Roots), layout.SetupEnd-layout.SetupBegin) + } + + hashBackend, err := resolveRecursionHashBackend(input, config) + if err != nil { + return verifierState{}, err + } + + roots := make([]hash.Digest, layout.NumTrees) + for i, root := range input.Setup.Roots { + roots[layout.SetupBegin+i] = root + } + for i, root := range input.Proof.Commitments { + roots[layout.SetupEnd+i] = root + } + + fs := fiatshamir.NewTranscript(hashBackend.NewTranscriptHasher()) + numRounds := len(input.Program.FScolumnsDependencies) + for i := 0; i < numRounds; i++ { + if err := fs.NewChallenge(constants.CanonicalChallengeName(i)); err != nil { + return verifierState{}, err + } + } + if err := fs.NewChallenge(constants.FINAL_EVALUATION_POINT); err != nil { + return verifierState{}, err + } + if err := fs.NewChallenge(constants.DEEP_ALPHA); err != nil { + return verifierState{}, err + } + + initialChallenge := constants.InitialChallengeName(numRounds) + if err := fs.Bind(initialChallenge, hash.StringToElements(constants.HASH_BACKEND_DOMAIN_TAG, hashBackend.ID)); err != nil { + return verifierState{}, err + } + for _, root := range input.Setup.Roots { + if err := fs.Bind(initialChallenge, root[:]); err != nil { + return verifierState{}, err + } + } + if len(input.PublicInputs) > 0 { + if err := fs.Bind(initialChallenge, input.PublicInputs.TranscriptElements()); err != nil { + return verifierState{}, err + } + } + + values := input.Proof.ExtValuesAtZeta() + for r := 0; r < numRounds; r++ { + challengeName := constants.CanonicalChallengeName(r) + for i := layout.TraceBegin[r]; i < layout.TraceEnd[r]; i++ { + if err := fs.Bind(challengeName, roots[i][:]); err != nil { + return verifierState{}, err + } + } + challenge, err := fs.ComputeChallenge(challengeName) + if err != nil { + return verifierState{}, err + } + values[challengeName] = hash.OutputToExt(challenge) + } + + for i := layout.AIRBegin; i < layout.AIREnd; i++ { + if err := fs.Bind(constants.FINAL_EVALUATION_POINT, roots[i][:]); err != nil { + return verifierState{}, err + } + } + zetaDigest, err := fs.ComputeChallenge(constants.FINAL_EVALUATION_POINT) + if err != nil { + return verifierState{}, err + } + zeta := hash.OutputToExt(zetaDigest) + + if err := computeExposedColumns(values, zeta, input.Program, input.Proof); err != nil { + return verifierState{}, err + } + if err := computePublicInputColumns(values, zeta, input.Program, input.PublicInputs); err != nil { + return verifierState{}, err + } + if err := computeLagranges(values, zeta, input.Program); err != nil { + return verifierState{}, err + } + + var alpha ext.E4 + var friState friVerifierState + if !config.forceSkipInnerFRI { + dqLayout := prover.BuildDeepQuotientLayout(input.Program) + if err := prover.BindDeepEvaluationClaims(fs, input.Proof, dqLayout); err != nil { + return verifierState{}, err + } + alphaDigest, err := fs.ComputeChallenge(constants.DEEP_ALPHA) + if err != nil { + return verifierState{}, err + } + alpha = hash.OutputToExt(alphaDigest) + friState, err = deriveFRIVerifierState(fs, input, dqLayout) + if err != nil { + return verifierState{}, err + } + } + + return verifierState{values: values, zeta: zeta, alpha: alpha, fri: friState}, nil +} + +func computeExposedColumns(values map[string]ext.E4, zeta ext.E4, program board.Program, prf proof.Proof) error { + moduleNames := sortedModuleNames(program.Modules) + for _, moduleName := range moduleNames { + innerModule := program.Modules[moduleName] + names := innerModule.VanishingRelation.Leaves(expr.NewConfig(expr.OnlyExposedColumns...)) + sort.Strings(names) + for _, name := range names { + pi, ok := prf.ExposedValues[name] + if !ok { + return fmt.Errorf("recursion: exposed column %q not found in proof.ExposedValues", name) + } + var lag ext.E4 + for _, pe := range pi.Entries { + idx, err := normalizeIndex(pe.Idx, innerModule.N) + if err != nil { + return fmt.Errorf("recursion: exposed column %q entry: %w", name, err) + } + tmp := poly.LagrangeAtZetaExt(zeta, innerModule.N, idx) + value := pe.ExtValue() + tmp.Mul(&tmp, &value) + lag.Add(&lag, &tmp) + } + values[name] = lag + } + } + return nil +} + +func computePublicInputColumns(values map[string]ext.E4, zeta ext.E4, program board.Program, inputs public.Inputs) error { + moduleNames := sortedModuleNames(program.Modules) + for _, moduleName := range moduleNames { + innerModule := program.Modules[moduleName] + names := innerModule.VanishingRelation.Leaves(expr.NewConfig(expr.OnlyPublicColumns...)) + sort.Strings(names) + for _, name := range names { + pi, ok := inputs[name] + if !ok { + return fmt.Errorf("recursion: public input column %q not found", name) + } + if pi.Module != moduleName { + return fmt.Errorf("recursion: public input column %q belongs to module %q, used from module %q", name, pi.Module, moduleName) + } + var lag ext.E4 + for entryIndex, pe := range pi.Entries { + if pe.Idx < 0 || pe.Idx >= innerModule.N { + return fmt.Errorf("recursion: public input column %q entry %d index %d out of bounds for module %q of size %d", name, entryIndex, pe.Idx, moduleName, innerModule.N) + } + tmp := poly.LagrangeAtZetaExt(zeta, innerModule.N, pe.Idx) + value := pe.ExtValue() + tmp.Mul(&tmp, &value) + lag.Add(&lag, &tmp) + } + values[name] = lag + } + } + return nil +} + +func computeLagranges(values map[string]ext.E4, zeta ext.E4, program board.Program) error { + config := expr.OnlyLagranges + for _, m := range program.Modules { + lags := m.VanishingRelation.Leaves(expr.NewConfig(config...)) + for _, lag := range lags { + if _, ok := values[lag]; ok { + continue + } + i := constants.ParseLagrangeName(lag) + if i < 0 { + i = m.N + i + } + if i < 0 || i >= m.N { + return fmt.Errorf("recursion: lagrange %q resolves to row %d outside module size %d", lag, i, m.N) + } + values[lag] = poly.LagrangeAtZetaExt(zeta, m.N, i) + } + } + return nil +} + +func deriveFRIVerifierState(fs *fiatshamir.Transcript, input RecursionInput, dqLayout prover.DEEPquotientLayout) (friVerifierState, error) { + maxN, err := maxModuleSize(input.Program) + if err != nil { + return friVerifierState{}, err + } + if maxN <= 1 { + return friVerifierState{}, nil + } + numRounds, err := log2Exact(maxN) + if err != nil { + return friVerifierState{}, err + } + + levelDs := dqLayout.Sizes + if len(levelDs) == 0 { + return friVerifierState{}, fmt.Errorf("recursion: FRI has no DEEP quotient levels") + } + if levelDs[0] != maxN { + return friVerifierState{}, fmt.Errorf("recursion: FRI first level D=%d, want max module size %d", levelDs[0], maxN) + } + if len(input.Proof.DeepQuotientCommitment) != len(levelDs) { + return friVerifierState{}, fmt.Errorf("recursion: FRI has %d DEEP quotient commitments, want %d", len(input.Proof.DeepQuotientCommitment), len(levelDs)) + } + + wantFRIRoots := numRounds - 1 + if numRounds <= 1 { + wantFRIRoots = 0 + } + if len(input.Proof.DeepQuotientFriProof.FRIRoots) != wantFRIRoots { + return friVerifierState{}, fmt.Errorf("recursion: FRI has %d running roots, want %d", len(input.Proof.DeepQuotientFriProof.FRIRoots), wantFRIRoots) + } + + levelAtRound := make(map[int]int, len(levelDs)-1) + for level := 1; level < len(levelDs); level++ { + levelD := levelDs[level] + if levelD <= 0 || levelD&(levelD-1) != 0 { + return friVerifierState{}, fmt.Errorf("recursion: FRI level %d D=%d is not a positive power of two", level, levelD) + } + ratio := maxN / levelD + if ratio <= 0 || ratio*levelD != maxN || ratio&(ratio-1) != 0 { + return friVerifierState{}, fmt.Errorf("recursion: FRI level %d D=%d does not divide max D=%d by a power-of-two ratio", level, levelD, maxN) + } + round, err := log2Exact(ratio) + if err != nil { + return friVerifierState{}, err + } + if round < 1 || round >= numRounds { + return friVerifierState{}, fmt.Errorf("recursion: FRI level %d introduction round %d outside 1..%d", level, round, numRounds-1) + } + if _, ok := levelAtRound[round]; ok { + return friVerifierState{}, fmt.Errorf("recursion: FRI duplicate level introduction round %d", round) + } + levelAtRound[round] = level + } + + if err := friRegisterChallenges(fs, numRounds, levelAtRound); err != nil { + return friVerifierState{}, err + } + + roots := make([]hash.Digest, numRounds) + roots[0] = input.Proof.DeepQuotientCommitment[0] + for round := 1; round < numRounds; round++ { + roots[round] = input.Proof.DeepQuotientFriProof.FRIRoots[round-1] + } + + foldAlphas := make([]ext.E4, numRounds) + levelGammas := make(map[int]ext.E4, len(levelAtRound)) + for round := 0; round < numRounds; round++ { + if round > 0 { + if level, ok := levelAtRound[round]; ok { + gammaName := friLevelGammaName(level) + if err := fs.Bind(gammaName, input.Proof.DeepQuotientCommitment[level][:]); err != nil { + return friVerifierState{}, err + } + challenge, err := fs.ComputeChallenge(gammaName) + if err != nil { + return friVerifierState{}, err + } + levelGammas[level] = hash.OutputToExt(challenge) + } + } + + foldName := friFoldName(round) + if err := fs.Bind(foldName, roots[round][:]); err != nil { + return friVerifierState{}, err + } + challenge, err := fs.ComputeChallenge(foldName) + if err != nil { + return friVerifierState{}, err + } + foldAlphas[round] = hash.OutputToExt(challenge) + } + + if input.Proof.DeepQuotientFriProof.FinalField != field.Ext { + return friVerifierState{}, fmt.Errorf("recursion: FRI final field is %s, want %s", input.Proof.DeepQuotientFriProof.FinalField, field.Ext) + } + if len(input.Proof.DeepQuotientFriProof.FinalPolyExt) == 0 { + return friVerifierState{}, fmt.Errorf("recursion: FRI final extension polynomial is empty") + } + if err := fs.Bind(friQueryName(0), friTranscriptExtPoly(input.Proof.DeepQuotientFriProof.FinalPolyExt)); err != nil { + return friVerifierState{}, err + } + + queryIndices := make([]int, constants.NUM_QUERIES) + queryModulus := constants.RATE * maxN / 2 + for query := 0; query < constants.NUM_QUERIES; query++ { + challenge, err := fs.ComputeChallenge(friQueryName(query)) + if err != nil { + return friVerifierState{}, err + } + queryIndices[query] = friQueryIndex(challenge, queryModulus) + if query < constants.NUM_QUERIES-1 { + if err := fs.Bind(friQueryName(query+1), challenge[:]); err != nil { + return friVerifierState{}, err + } + } + } + + return friVerifierState{ + maxN: maxN, + numRounds: numRounds, + levelAtRound: levelAtRound, + foldAlphas: foldAlphas, + levelGammas: levelGammas, + queryIndices: queryIndices, + }, nil +} + +func friRegisterChallenges(fs *fiatshamir.Transcript, numRounds int, levelAtRound map[int]int) error { + if err := fs.NewChallenge(friFoldName(0)); err != nil { + return err + } + for round := 1; round < numRounds; round++ { + if level, ok := levelAtRound[round]; ok { + if err := fs.NewChallenge(friLevelGammaName(level)); err != nil { + return err + } + } + if err := fs.NewChallenge(friFoldName(round)); err != nil { + return err + } + } + for query := 0; query < constants.NUM_QUERIES; query++ { + if err := fs.NewChallenge(friQueryName(query)); err != nil { + return err + } + } + return nil +} + +func friLevelGammaName(level int) string { + return fmt.Sprintf("fri_level_%d_gamma", level) +} + +func friFoldName(round int) string { + return fmt.Sprintf("fri_fold_%d", round) +} + +func friQueryName(query int) string { + return fmt.Sprintf("fri_query_%d", query) +} + +func friTranscriptExtPoly(poly []ext.E4) []koalabear.Element { + res := make([]koalabear.Element, 0, 2+4*len(poly)) + res = append(res, hash.NewElement(0x45585450), hash.NewElement(uint64(len(poly)))) // "EXTP" + for _, v := range poly { + res = append(res, v.B0.A0, v.B0.A1, v.B1.A0, v.B1.A1) + } + return res +} + +func friQueryIndex(challenge hash.Digest, modulus int) int { + if modulus <= 0 { + return 0 + } + v := (challenge[0].Uint64() << 31) ^ challenge[1].Uint64() + return int(v % uint64(modulus)) +} + +func sortedModuleNames(modules map[string]board.CompiledModule) []string { + names := make([]string, 0, len(modules)) + for name := range modules { + names = append(names, name) + } + sort.Strings(names) + return names +} + +func normalizeIndex(idx, n int) (int, error) { + if n <= 0 { + return 0, fmt.Errorf("domain size must be positive, got %d", n) + } + if idx < 0 { + idx = n + idx + } + if idx < 0 || idx >= n { + return 0, fmt.Errorf("row %d outside domain size %d", idx, n) + } + return idx, nil +} + +func maxModuleSize(program board.Program) (int, error) { + maxN := 0 + for name, module := range program.Modules { + if module.N <= 0 { + return 0, fmt.Errorf("recursion: module %q has invalid size %d", name, module.N) + } + if module.N > maxN { + maxN = module.N + } + } + if maxN == 0 { + return 0, fmt.Errorf("recursion: program has no modules") + } + return maxN, nil +} + +func log2Exact(n int) (int, error) { + if n <= 0 || n&(n-1) != 0 { + return 0, fmt.Errorf("recursion: %d is not a positive power of two", n) + } + res := 0 + for n > 1 { + n >>= 1 + res++ + } + return res, nil +} + +func bridgeSamplePoints(domainSize, idx int) (koalabear.Element, koalabear.Element, error) { + generator, err := koalabear.Generator(uint64(domainSize)) + if err != nil { + return koalabear.Element{}, koalabear.Element{}, err + } + var x, negX koalabear.Element + x.Exp(generator, big.NewInt(int64(idx))) + negX.Neg(&x) + return x, negX, nil +} + +func addWeightedExt(acc *ext.E4, value, weight ext.E4) { + var term ext.E4 + term.Mul(&value, &weight) + acc.Add(acc, &term) +} + +func subExt(left, right ext.E4) ext.E4 { + var res ext.E4 + res.Sub(&left, &right) + return res +} + +func divExt(numerator, denominator ext.E4) ext.E4 { + var inv, res ext.E4 + inv.Inverse(&denominator) + res.Mul(&numerator, &inv) + return res +} + +func liftBaseToExt(value koalabear.Element) ext.E4 { + var res ext.E4 + res.Lift(&value) + return res +} + +func zeroExpr() expr.Expr { + var z koalabear.Element + return expr.Const(z) +} + +func oneExpr() expr.Expr { + return expr.Const(koalabear.One()) +} + +func uintConst(v uint64) expr.Expr { + var z koalabear.Element + z.SetUint64(v) + return expr.Const(z) +} diff --git a/recursion/recursion_test.go b/recursion/recursion_test.go new file mode 100644 index 0000000..4a1beca --- /dev/null +++ b/recursion/recursion_test.go @@ -0,0 +1,261 @@ +// Copyright 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. +// +// SPDX-License-Identifier: Apache-2.0 + +package recursion + +import ( + "testing" + + "github.com/consensys/gnark-crypto/field/koalabear" + "github.com/consensys/loom/board" + "github.com/consensys/loom/expr" + "github.com/consensys/loom/prover" + "github.com/consensys/loom/setup" + "github.com/consensys/loom/verifier" +) + +func fibonacciProgram(t *testing.T, n int) (board.Program, koalabear.Element, koalabear.Element) { + t.Helper() + + builder := board.NewBuilder() + module := board.NewModule("fibonacci") + module.N = n + module.AssertZeroExceptAt(expr.Rot("A", 1).Sub(expr.Col("B")), n-1) + module.AssertZeroExceptAt(expr.Rot("B", 1).Sub(expr.Col("C")), n-1) + module.AssertZero(expr.Col("C").Sub(expr.Col("A")).Sub(expr.Col("B"))) + builder.AddModule(module) + + program, err := board.Compile(&builder) + if err != nil { + t.Fatal(err) + } + + var a, b koalabear.Element + b.SetOne() + return program, a, b +} + +func proveFibonacci(t *testing.T, n int) RecursionInput { + t.Helper() + + program, a, b := fibonacciProgram(t, n) + tr := prover.TraceFibonacci(n, a, b) + prf, err := prover.Prove(tr, setup.ProvingKey{}, nil, program) + if err != nil { + t.Fatal(err) + } + if err := verifier.Verify(nil, setup.VerificationKey{}, program, prf); err != nil { + t.Fatal(err) + } + + return RecursionInput{Program: program, Proof: prf} +} + +func exposedFibonacciProgram(t *testing.T, n int) (board.Program, koalabear.Element, koalabear.Element) { + t.Helper() + + builder := board.NewBuilder() + module := board.NewModule("fibonacci") + module.N = n + module.AssertZeroExceptAt(expr.Rot("A", 1).Sub(expr.Col("B")), n-1) + module.AssertZeroExceptAt(expr.Rot("B", 1).Sub(expr.Col("C")), n-1) + module.AssertZero(expr.Col("C").Sub(expr.Col("A")).Sub(expr.Col("B"))) + builder.AddModule(module) + builder.AddExposeIthValueStep("fibonacci", expr.Col("B"), "exposed_b0", 0) + + program, err := board.Compile(&builder) + if err != nil { + t.Fatal(err) + } + + var a, b koalabear.Element + b.SetOne() + return program, a, b +} + +func proveExposedFibonacci(t *testing.T, n int) RecursionInput { + t.Helper() + + program, a, b := exposedFibonacciProgram(t, n) + tr := prover.TraceFibonacci(n, a, b) + prf, err := prover.Prove(tr, setup.ProvingKey{}, nil, program) + if err != nil { + t.Fatal(err) + } + if len(prf.ExposedValues["exposed_b0"].Entries) != 1 { + t.Fatalf("expected one exposed entry, got %d", len(prf.ExposedValues["exposed_b0"].Entries)) + } + if err := verifier.Verify(nil, setup.VerificationKey{}, program, prf); err != nil { + t.Fatal(err) + } + + return RecursionInput{Program: program, Proof: prf} +} + +func TestProveNextLayerPoseidon2(t *testing.T) { + input := proveFibonacci(t, 4) + + output, err := ProveNextLayer(input, UsePoseidon2(), SkipOuterFRI()) + if err != nil { + t.Fatal(err) + } + if err := VerifyOutput(output, verifier.SkipFRI()); err != nil { + t.Fatal(err) + } +} + +func TestProveNextLayerPoseidon2WithExposedValue(t *testing.T) { + input := proveExposedFibonacci(t, 4) + + output, err := ProveNextLayer(input, UsePoseidon2(), SkipOuterFRI()) + if err != nil { + t.Fatal(err) + } + if err := VerifyOutput(output, verifier.SkipFRI()); err != nil { + t.Fatal(err) + } +} + +func TestProveAggregationLayerPoseidon2(t *testing.T) { + left := proveFibonacci(t, 4) + right := proveFibonacci(t, 8) + + output, err := ProveAggregationLayer(AggregationInput{Left: left, Right: right}, UsePoseidon2(), SkipOuterFRI()) + if err != nil { + t.Fatal(err) + } + if err := VerifyOutput(output, verifier.SkipFRI()); err != nil { + t.Fatal(err) + } +} + +func TestVerifierCoreRejectsBadAIRClaim(t *testing.T) { + input := proveFibonacci(t, 4) + + one := koalabear.One() + value, ok := input.Proof.ValuesAtZeta["A"] + if !ok { + t.Fatal("expected proof to contain A opening") + } + value.B0.A0.Add(&value.B0.A0, &one) + input.Proof.ValuesAtZeta["A"] = value + + if _, err := ProveNextLayer(input, UsePoseidon2(), WithoutInnerVerification(), SkipOuterFRI()); err == nil { + t.Fatal("expected recursive verifier core to reject tampered ValuesAtZeta") + } +} + +func TestVerifierCoreRejectsBadFRIBridgeClaim(t *testing.T) { + input := proveFibonacci(t, 4) + + if len(input.Proof.DeepQuotientFriProof.FRIQueries) == 0 || len(input.Proof.DeepQuotientFriProof.FRIQueries[0].Layers) == 0 { + t.Fatal("expected proof to contain FRI query layers") + } + + one := koalabear.One() + layer := input.Proof.DeepQuotientFriProof.FRIQueries[0].Layers[0] + layer.LeafPExt.B0.A0.Add(&layer.LeafPExt.B0.A0, &one) + input.Proof.DeepQuotientFriProof.FRIQueries[0].Layers[0] = layer + + if _, err := ProveNextLayer(input, UsePoseidon2(), WithoutInnerVerification(), SkipOuterFRI()); err == nil { + t.Fatal("expected recursive verifier core to reject tampered FRI bridge claim") + } +} + +func TestVerifierCoreRejectsBadFRIFoldClaim(t *testing.T) { + input := proveFibonacci(t, 4) + + if len(input.Proof.DeepQuotientFriProof.FRIQueries) == 0 || len(input.Proof.DeepQuotientFriProof.FRIQueries[0].Layers) < 2 { + t.Fatal("expected proof to contain at least two FRI folding layers") + } + + one := koalabear.One() + layer := input.Proof.DeepQuotientFriProof.FRIQueries[0].Layers[1] + layer.LeafPExt.B0.A0.Add(&layer.LeafPExt.B0.A0, &one) + layer.LeafQExt.B0.A0.Add(&layer.LeafQExt.B0.A0, &one) + input.Proof.DeepQuotientFriProof.FRIQueries[0].Layers[1] = layer + + if _, err := ProveNextLayer(input, UsePoseidon2(), WithoutInnerVerification(), SkipOuterFRI()); err == nil { + t.Fatal("expected recursive verifier core to reject tampered FRI fold claim") + } +} + +func TestPoseidon2MerkleModuleRejectsBadPointSamplingPath(t *testing.T) { + input := proveFibonacci(t, 4) + + if len(input.Proof.PointSamplings) == 0 || + len(input.Proof.PointSamplings[0]) == 0 || + len(input.Proof.PointSamplings[0][0].Proof.Siblings) == 0 { + t.Fatal("expected proof to contain point-sampling Merkle siblings") + } + sibling := input.Proof.PointSamplings[0][0].Proof.Siblings[0] + one := koalabear.One() + sibling[len(sibling)-1].Add(&sibling[len(sibling)-1], &one) + input.Proof.PointSamplings[0][0].Proof.Siblings[0] = sibling + + module, tr, err := buildPoseidon2VerifierModule( + verifierCoreModule+"_poseidon2_test", + []poseidon2MerkleTarget{{Namespace: "bad", Input: input}}, + ) + if err != nil { + t.Fatal(err) + } + builder := board.NewBuilder() + builder.AddModule(module) + program, err := board.Compile(&builder) + if err != nil { + t.Fatal(err) + } + prf, err := prover.Prove(tr, setup.ProvingKey{}, nil, program, prover.SkipFRI()) + if err != nil { + return + } + if err := verifier.Verify(nil, setup.VerificationKey{}, program, prf, verifier.SkipFRI()); err == nil { + t.Fatal("expected Poseidon2 Merkle module to reject tampered sibling") + } +} + +func TestPoseidon2MerkleModuleRejectsBadFRIPath(t *testing.T) { + input := proveFibonacci(t, 4) + + if len(input.Proof.DeepQuotientFriProof.FRIQueries) == 0 || + len(input.Proof.DeepQuotientFriProof.FRIQueries[0].Layers) == 0 || + len(input.Proof.DeepQuotientFriProof.FRIQueries[0].Layers[0].Path.Siblings) == 0 { + t.Fatal("expected proof to contain FRI Merkle siblings") + } + sibling := input.Proof.DeepQuotientFriProof.FRIQueries[0].Layers[0].Path.Siblings[0] + one := koalabear.One() + sibling[len(sibling)-1].Add(&sibling[len(sibling)-1], &one) + input.Proof.DeepQuotientFriProof.FRIQueries[0].Layers[0].Path.Siblings[0] = sibling + + module, tr, err := buildPoseidon2VerifierModule( + verifierCoreModule+"_poseidon2_fri_test", + []poseidon2MerkleTarget{{Namespace: "bad", Input: input}}, + ) + if err != nil { + t.Fatal(err) + } + builder := board.NewBuilder() + builder.AddModule(module) + program, err := board.Compile(&builder) + if err != nil { + t.Fatal(err) + } + prf, err := prover.Prove(tr, setup.ProvingKey{}, nil, program, prover.SkipFRI()) + if err != nil { + return + } + if err := verifier.Verify(nil, setup.VerificationKey{}, program, prf, verifier.SkipFRI()); err == nil { + t.Fatal("expected Poseidon2 Merkle module to reject tampered FRI sibling") + } +}