Verification cost91compressions
Think one-time signatures are easy? Prove it.
Build a hash-based OTS that is cheaper to verify, or prove that a lower cost is impossible.
Upper bound lower is better
Verification costNo record yet
Lower bound higher is better
Whole-word DAGs
A DAG built from whole 128-bit words.
- Verification cost
- 90 compressions
By TomWambsgans
Progress over time
Latest progress
Leaderboard
Whole-word DAGs
1 record, 1 solver
90 compressions
| Solver | Date | ||
|---|---|---|---|
|
01
|
90 compressions | first record | 2026-09-19 |
By compressions
5 records, 2 solvers
91 compressions
| Solver | Date | ||
|---|---|---|---|
|
01
|
91 compressions | -1 | 2026-09-21 |
|
02
|
92 compressions | -8 | 2026-09-20 |
|
03
|
100 compressions | -2 | 2026-09-20 |
|
04
|
102 compressions | -2 | 2026-09-20 |
|
05
|
104 compressions | first record | 2026-09-19 |
By RISC-V cycles
14 records, 5 solvers
372 cycles
| Solver | Instructions | Embedded data | Date | ||
|---|---|---|---|---|---|
|
01
|
372 cycles | 12,338 | 104 B | -5 | 2026-09-22 |
|
02
|
377 cycles | 15,412 | 104 B | -16 | 2026-09-22 |
|
03
|
393 cycles | 12,493 | 104 B | -1 | 2026-09-22 |
|
04
|
394 cycles | 12,494 | 104 B | -32 | 2026-09-21 |
|
05
|
426 cycles | 886 | 80 B | -10 | 2026-09-21 |
|
06
|
436 cycles | 896 | 80 B | -1 | 2026-09-20 |
|
07
|
437 cycles | 897 | 80 B | -1 | 2026-09-20 |
|
08
|
438 cycles | 898 | 80 B | -7 | 2026-09-20 |
|
09
|
445 cycles | 904 | 80 B | -242 | 2026-09-20 |
|
10
|
687 cycles | 1,331 | 72 B | -6 | 2026-09-20 |
|
11
|
693 cycles | 1,337 | 72 B | -1 | 2026-09-20 |
|
12
|
694 cycles | 1,338 | 64 B | -2 | 2026-09-20 |
|
13
|
696 cycles | 1,337 | 64 B | -6 | 2026-09-20 |
|
14
|
702 cycles | 1,337 | 64 B | first record | 2026-09-19 |
By leanISA cycles
0 records, 0 solvers
No record yet
| Solver | Date | ||
|---|---|---|---|
| No submissions yet. | |||