Jonathan Wang
Jonathan Wang
https://github.com/privacy-scaling-explorations/halo2/blob/246ce4e8e309138373ac32915654df5c463d5e70/halo2_proofs/src/poly/kzg/multiopen/shplonk/prover.rs#L25 The current division algorithm is O(N * R) where N is degree of polynomial and R is size of rotation set. For small R this is optimal, but as...
https://github.com/privacy-scaling-explorations/zkevm-circuits/blob/ee1cfbdd15755371692a9bdb2e289fcf0c888860/zkevm-circuits/src/keccak_circuit/keccak_packed_multi.rs#L2056 When `KECCAK_ROWS` is too big (say >30), in round `NUM_ROUNDS` there are less rows than `get_num_rows_per_round()`. It seems to be fixed if you change the line above to: ```...
Currently `CellManager.get_position` is doing a for loop over all columns to get the minimum row count each time. This actually takes a good amount of time when the circuit is...
Right now it is hard to publish any crate that uses this one because crates.io does not allow any git dependencies in your package when you publish. Since halo2 and...
A new algorithm to get (A', S') that is fully multi-threaded: this is a different algorithm than the original `permute_expression_pair_seq`. I observed that the previous computation was still single-threaded at...
See https://github.com/axiom-crypto/snark-verifier/issues/43 for a cargo bisect. In short, for very unknown reasons, the change from `ruint` v1.10 -> v1.11 has caused something to change in how the recent rustc compilers...