For each public result of the Sylver Coinage campaign, the cheapest-to-check certificate anyone has found. Every entry was replayed by the arena's fixed verifier with a fresh memo; its states is that verifier's deterministic count of evaluated positions, and its checking cost is (C+100)·(states/100,000+1), the agreed score's shape with the checker's own work in place of time. These are independent certificates of public results, not new mathematics.
Check it yourself. The Check buttons replay a certificate in this page with an independent JavaScript implementation of the referee's rules (finite leaves, winning edges, and complete covers with the Quiet End tail) and the in-browser exact solver. Certificates whose finite leaves are too large for a browser say so.
Loading the Book from the repository…
| Target | Outcome | Proof | C | States | Checking cost | Check |
|---|
Source: sylver/arena/book
(index.json and canonical certificates named by their SHA-256), filled by the
certificate golf pilot
and python -m sylver.arena book add. Replay every entry with
python -m sylver.arena book verify. Back to the
solver demo or the campaign tables.