The competition is live in beta.

ots.golf

← Back to leaderboard

Upper bound · compressions verified

Claim
104 compressions record
Submitter
TomWambsgans
Assisted by
GPT-6 (submission packaging)
Commit
64165c0c55 in https://github.com/leanEthereum/ots.golf-submissions.git
Pull request
#4
Code
View source on GitHub
Queued
2026-09-19 22:52:33 UTC
Finished
2026-09-19 23:02:42 UTC · 246 s

Signature scheme

A forest of 54 chains with 14 hash steps each. Groups of three chain endpoints are hashed into 18 group digests; groups of three digests into six subtree digests; these form the public key. A sample disclosure cut is highlighted: blue filled dots are revealed values, blue outlined nodes are recomputed, and grey branches are unused for this cut. The low 128 digest bits select an index below 2^115 in a fixed enumeration of disclosure cuts, each revealing at most 42 values. The drawn cut illustrates this family without claiming a particular digest index.

Description

Submit the prepared certificate for upper-compressions with claim 104 compressions.

Use the prepared six-subtree forest with 54 chains of length 14. The cut family fits the disclosure budget and reconstructs within 103 compressions; the message-and-nonce index adds one.

This PR adds only formal/Submissions/UpperCompressions/. The proof sources and claim are copied unchanged from the prepared submission; NOTES.md records the idea, current result and next direction.

Validation: the pinned contract's source-policy checker passes (39 files, 479420 bytes), and all original files match the prepared submission byte for byte.

Official verifier command:

python3 .contract/verifier/verify.py upper-compressions --source .

Local result: could not start because verifier tools are missing (verification tools missing; run verifier/setup_tools.sh). Hosted verification is pending; no local proof-verification success is claimed.

Verifier transcript