Compare
Four documents, the same five questions.
No throughput league table and no yield. The cells are what this library is willing to say about the text.
| Question | SuperNova: Proving Universal Machine Executions without Universal Circuits |
|---|---|
| What the text proposes | SuperNova folds a universal machine by switching among circuits without a universal circuit that contains every instruction. |
| Who may write | Abhiram Kothapalli and Srinath Setty |
| What is settled | Non-uniform computation is the point. The program may change. |
| Load-bearing assumption | The paper is not a zkVM product. |
| What this library says afterwards | A reading of the public paper. Not a copy, not a benchmark, and not a claim about any later network. |
| Rights | Official external source only |