Daniel Lubarov 8b71075154
Reduce constant_gate_size to 5 (#366)
This results in 8 constant polynomials, which means our Merkle tree containing preprocessed polynomials has leaves of size 80 + 8 = 88. A multiple of 8 is efficient in terms of how many gates it takes to hash a leaf. Saves 17 gates.
2021-11-16 09:29:22 -08:00
..
2021-11-16 21:18:27 +11:00
2021-11-16 21:18:27 +11:00
2021-11-16 21:18:27 +11:00