Warning: highly experimental.
Machine: Mac M4 Max
Our XMSS is specified in XMSS.pdf.
cargo run --release -- xmss --n-signatures 900 --log-inv-rate 1 --repeat 3XMSS aggregation, 900 signatures
cycles (VM steps) : 1,529,326 = 2^20.544 (1,699.251 / XMSS)
proven rows : 1,967,104 = 2^20.908 (filled to powers of two)
details : DEREF 2^18.97 (33.6%) SET 2^18.397 (22.6%) MUL 2^18.176 (19.4%) BLAKE2S 2^16.996 (8.5%) XOR 2^16.953 (8.3%) JUMP 2^16.825 (7.6%) PACK64X2 2^9.814 (0.1%) MEMORY 2^21.718 TOTAL_COMMITTED 2^26.185
proof size : 355.5 KiB
proving : 1.124 s ± 7.4% 800.966 XMSS/s peak memory 20.397 GiB
verifying : 0.00395 s
cargo run --release -- recursion --n 2 --log-inv-rate 2 --repeat 3recursion 2→1: 2 inner proofs of 1,472,223 cycles each
guest cycles (VM steps) : 728,277 = 2^19.474 (0.247 / inner cycle)
proven rows : 933,888 = 2^19.833 (filled to powers of two)
details : DEREF 2^17.975 (35.4%) MUL 2^17.754 (30.4%) XOR 2^17.324 (22.5%) SET 2^15.256 (5.4%) PACK64X2 2^14.321 (2.8%) BLAKE2S 2^14.097 (2.4%) JUMP 2^13.016 (1.1%) MEMORY 2^19.804 TOTAL_COMMITTED 2^24.664
proof size : 222.4 KiB
recursion proving : 0.512 s ± 2.3% peak memory 15.42 GiB
verification : 0.0284 s
cargo run --release -- fibonacci --n 2000000 --log-inv-rate 1 --repeat 3Fibonacci (in the exponent, i.e. modulo 2^64 - 1), N = 2,000,000
cycles (VM steps) : 2,127,881
details : MUL 2^20.937 (98.7%) DEREF 2^13.967 (0.8%) SET 2^12.552 (0.3%) JUMP 2^10.968 (0.1%) XOR 2^10.966 (0.1%) MEMORY 2^20.964 TOTAL_COMMITTED 2^25.263
proof size : 333.0 KiB
proving : 0.63 s ± 9.3% 3,380,073 cycles/s peak memory 12.128 GiB
verifying : 0.00298 s
- 128-bit (LDR Johnson, no proximity gaps conjecture)