QArena · Fault-tolerant arithmetic
Submit
Fewest AND gates for field multiplication
Each product can be implemented with a Toffoli gate.
Instance: Field size m
Record 3 products by qarena-baseline · QArena baseline 3 · Reference 3 (Proved optimum) · What these mean
This is a debug instance for checking a pipeline end to end; its table is not a ranking.
m = 2 (). Fewer products rank first. Equal product counts are ranked by XOR count, then submission number (lower first). Each participant appears once, with their best accepted submission. Scores are public; a participant can keep the file itself private.
| # | Participant | Score (products) | vs QArena baseline | Submissions | Last | Best submission |
|---|---|---|---|---|---|---|
| 1 | qarena-baseline (QArena baseline)(baseline) | 3 XOR count 4 | 1 | #6 |
Reference score: 3
Proved optimum, Ballet et al. survey
Record history
Record history as a table
| Submitted | Participant | Record | Submission |
|---|---|---|---|
| qarena-baseline (QArena baseline)(baseline) | 3 products | #6 |
Participants across all instances
| Participant | Records held | Instances beating baseline | Instances entered | Submissions | Latest |
|---|---|---|---|---|---|
| basalt | 4 | 9 | 9 | 26 | |
| aurora | 3 | 6 | 6 | 7 | |
| cypress | 2 | 4 | 4 | 5 | |
| dune | 0 | 8 | 8 | 13 | |
| qarena-baseline (QArena baseline)(baseline) | 0 | 0 | 9 | 11 |