Prover: development branch of the limitless prover

prover/Makefile

@@ -40,19 +40,19 @@ go-corset:
 ## Build and bundle the go-corset trace-expander dependency
 ##
 zkevm/arithmetization/zkevm.bin: go-corset
-	cd ../constraints && $(GO_CORSET) make zkevm.bin && mv zkevm.bin ../prover/zkevm/arithmetization
+	cd ../constraints && $(GO_CORSET) make zkevm_london.bin && mv zkevm_london.bin ../prover/zkevm/arithmetization/zkevm.bin
 
 ##
 ## Generate the setup for all provers job for sepolia (to be run with S3 access)
 ##
 setup-sepolia: bin/prover
-	bin/prover setup --config ./config/config-sepolia-full.toml --dict ./lib/compressor/compressor_dict.bin --assets-dir ./prover-assets
+	bin/prover setup --config ./config/config-sepolia-limitless.toml --dict ./lib/compressor/compressor_dict.bin --assets-dir ./prover-assets
 
 ##
 ## Generate the setup for all provers job for mainnet (to be run with S3 access)
 ##
 setup-mainnet: bin/prover
-	bin/prover setup --config ./config/config-mainnet-full.toml --dict ./lib/compressor/compressor_dict.bin --assets-dir ./prover-assets
+	bin/prover setup --config ./config/config-mainnet-limitless.toml --dict ./lib/compressor/compressor_dict.bin --assets-dir ./prover-assets
 
 ##
 ## Copy the prover assets to the S3 bucket (zkuat)
@@ -131,7 +131,7 @@ lib/compressor-and-shnarf-calculator-local: lib/compressor lib/shnarf_calculator
 ## Run all the unit-tests
 ##
 test:
-	go test ./...
+	go test -tags debug ./...
 
 ##
 ## Run the CI linting

prover/backend/aggregation/craft.go

@@ -309,15 +309,11 @@ func PackOffsets(unpacked []bool) []byte {
 	return resWrite.Bytes()
 }
 
-func nextMultipleOf(n, multiple int) int {
-	return multiple * ((n + multiple - 1) / multiple)
-}
-
 // Hash the L2 messages into Merkle trees or arity 2 and depth
 // `l2MsgMerkleTreeDepth`. The leaves are zero-padded on the right.
 func PackInMiniTrees(l2MsgHashes []string) []string {
 
-	paddedLen := nextMultipleOf(len(l2MsgHashes), l2MsgMerkleTreeMaxLeaves)
+	paddedLen := utils.NextMultipleOf(len(l2MsgHashes), l2MsgMerkleTreeMaxLeaves)
 	paddedL2MsgHashes := make([]string, paddedLen)
 	copy(paddedL2MsgHashes, l2MsgHashes)
 

prover/backend/aggregation/prove.go

@@ -214,14 +214,14 @@ func makeBw6Proof(
 	}
 
 	if bestSize == math.MaxInt {
-		if len(errs) > 0 {
-			return nil, 0, errors.Join(errs...)
-		} else {
-			return nil, 0, fmt.Errorf(
-				"could not find a setup large enough for %v proofs: the biggest available size is %v",
-				numProofClaims, biggestAvailable,
-			)
-		}
+
+		err := fmt.Errorf(
+			"could not find a setup large enough for %v proofs: the biggest available size is %v",
+			numProofClaims, biggestAvailable,
+		)
+
+		errs = append(errs, err)
+		return nil, 0, errors.Join(errs...)
 	}
 
 	logrus.Infof("reading the BW6 setup for %v proofs", bestSize)