Modular precompiles (#99)

* Merkle precompile

* remove 8 columns from Merkle table (at the cost of not supporting height=1 anymore)

* missing constraint

* SliceHash precompile

* naming

* missing use of dot_product_be in recursion program

* fix

* EqPolyBaseExt Precompile

* prepare "table on demand"

* deactivate unused tables at runtime

* wip

* Poseidon16 "core" table

* Poseidon24 "core" table

* finally connect together the buses to poseidon core tables

* better recursion program

* w

* wip

* improve xmss guest program

* magic number

* multiple WHIR recursions proved together

* remove CounterHint

* new hint: private_input_start

* repeated whir proofs in memory for more realistic benchmark

* no rayon on small instances in multilinear-toolkit

* degree 2 in DotProduct table

* PARALLEL_THRESHOLD = 512

* fix

* small fix

* deps

* deps

* update readme

* clippy

* fix readme

---------

Co-authored-by: Tom Wambsgans <[email protected]>

Author: TomWambsgans

Cargo.lock

@@ -67,10 +67,13 @@ itertools = "0.14.0"
 colored = "3.0.0"
 tracing = "0.1.26"
 serde_json = "1.0.145"
+serde = { version = "1.0.228", features = ["derive"] }
+bincode = "1.3.3"
 num_enum = "0.7.5"
 tracing-subscriber = { version = "0.3.19", features = ["std", "env-filter"] }
 tracing-forest = { version = "0.3.0", features = ["ansi", "smallvec"] }
 p3-koala-bear = { git = "https://github.com/TomWambsgans/Plonky3.git", branch = "lean-multisig" }
+p3-baby-bear = { git = "https://github.com/TomWambsgans/Plonky3.git", branch = "lean-multisig" }
 p3-poseidon2 = { git = "https://github.com/TomWambsgans/Plonky3.git", branch = "lean-multisig" }
 p3-symmetric = { git = "https://github.com/TomWambsgans/Plonky3.git", branch = "lean-multisig" }
 p3-air = { git = "https://github.com/TomWambsgans/Plonky3.git", branch = "lean-multisig" }
@@ -92,25 +95,25 @@ multilinear-toolkit.workspace = true
 whir-p3.workspace = true
 
 # [patch."https://github.com/TomWambsgans/Plonky3.git"]
-# p3-koala-bear = { path = "../zk/Plonky3/koala-bear" }
-# p3-field = { path = "../zk/Plonky3/field" }
-# p3-poseidon2 = { path = "../zk/Plonky3/poseidon2" }
-# p3-symmetric = { path = "../zk/Plonky3/symmetric" }
-# p3-air = { path = "../zk/Plonky3/air" }
-# p3-merkle-tree = { path = "../zk/Plonky3/merkle-tree" }
-# p3-commit = { path = "../zk/Plonky3/commit" }
-# p3-matrix = { path = "../zk/Plonky3/matrix" }
-# p3-dft = { path = "../zk/Plonky3/dft" }
-# p3-challenger = { path = "../zk/Plonky3/challenger" }
-# p3-monty-31 = { path = "../zk/Plonky3/monty-31" }
-# p3-maybe-rayon = { path = "../zk/Plonky3/maybe-rayon" }
-# p3-util = { path = "../zk/Plonky3/util" }
+# p3-koala-bear = { path = "../Plonky3/koala-bear" }
+# p3-field = { path = "../Plonky3/field" }
+# p3-poseidon2 = { path = "../Plonky3/poseidon2" }
+# p3-symmetric = { path = "../Plonky3/symmetric" }
+# p3-air = { path = "../Plonky3/air" }
+# p3-merkle-tree = { path = "../Plonky3/merkle-tree" }
+# p3-commit = { path = "../Plonky3/commit" }
+# p3-matrix = { path = "../Plonky3/matrix" }
+# p3-dft = { path = "../Plonky3/dft" }
+# p3-challenger = { path = "../Plonky3/challenger" }
+# p3-monty-31 = { path = "../Plonky3/monty-31" }
+# p3-maybe-rayon = { path = "../Plonky3/maybe-rayon" }
+# p3-util = { path = "../Plonky3/util" }
 
 # [patch."https://github.com/TomWambsgans/whir-p3.git"]
-# whir-p3 = { path = "../zk/whir/fork-whir-p3" }
+# whir-p3 = { path = "../whir-p3" }
 
 # [patch."https://github.com/leanEthereum/multilinear-toolkit.git"]
-# multilinear-toolkit = { path = "../zk/multilinear-toolkit" }
+# multilinear-toolkit = { path = "../multilinear-toolkit" }
 
 # [profile.release]
 # opt-level = 1

Cargo.toml

@@ -2,6 +2,12 @@
 
 XMSS + minimal [zkVM](minimal_zkVM.pdf) = lightweight PQ signatures, with unbounded aggregation
 
+## Status
+
+- branch [main](https://github.com/leanEthereum/leanMultisig): optimized for **prover efficiency**
+- branch [lean-vm-simple](https://github.com/leanEthereum/leanMultisig/tree/lean-vm-simple): optimized for **simplicity**
+
+Both versions will eventually merge into one.
 
 ## Proving System
 
@@ -38,15 +44,17 @@ RUSTFLAGS='-C target-cpu=native' cargo run --release -- poseidon --log-n-perms 2
 The full recursion program is not finished yet. Instead, we prove validity of a WHIR opening, with 25 variables, and rate = 1/4.
 
 ```console
-RUSTFLAGS='-C target-cpu=native' cargo run --release -- recursion
+RUSTFLAGS='-C target-cpu=native' cargo run --release -- recursion --count 8
 ```
 
 ![Alt text](docs/benchmark_graphs/graphs/recursive_whir_opening.svg)
 
+Detail: before 4 December 2025, only 1 WHIR opening was benchmarked. Starting from now, we prove a dozen of openings together (to be closer to the n-to-1 aggregation scenario) and we report the proving time / WHIR.
+
 ### XMSS aggregation
 
 ```console
-RUSTFLAGS='-C target-cpu=native' cargo run --release -- xmss --n-signatures 1000
+RUSTFLAGS='-C target-cpu=native' cargo run --release -- xmss --n-signatures 1775
 ```
 
 [Trivial encoding](docs/XMSS_trivial_encoding.pdf) (for now).

README.md

@@ -40,6 +40,16 @@ where
         "TODO handle the case UNIVARIATE_SKIPS >= log_length"
     );
 
+    // crate::check_air_validity(
+    //     air,
+    //     &extra_data,
+    //     &columns_f,
+    //     &columns_ef,
+    //     last_row_shifted_f,
+    //     last_row_shifted_ef,
+    // )
+    // .unwrap();
+
     let alpha = prover_state.sample(); // random challenge for batching constraints
 
     *extra_data.alpha_powers_mut() = alpha

crates/air/src/prove.rs

@@ -170,7 +170,7 @@ fn test_air_helper<const VIRTUAL_COLUMN: bool>() {
         virtual_column_statement_prover,
         true,
     );
-    let mut verifier_state = build_verifier_state(&prover_state);
+    let mut verifier_state = build_verifier_state(prover_state);
 
     let virtual_column_statement_verifier = if VIRTUAL_COLUMN {
         let virtual_column_evaluation_point =

crates/air/tests/complex_air.rs

@@ -92,7 +92,7 @@ fn test_air_fibonacci() {
         None,
         true,
     );
-    let mut verifier_state = build_verifier_state(&prover_state);
+    let mut verifier_state = build_verifier_state(prover_state);
 
     let (point_verifier, evaluations_remaining_to_verify_f, evaluations_remaining_to_verify_ef) = verify_air(
         &mut verifier_state,