Skip to content
9 running instances
Fez156 qubitsKingston156 qubitsMarrakesh156 qubitsCepheus-1-108Q107 qubitsEmerald54 qubitsGarnet20 qubitsForte 136 qubitsForte Enterprise 136 qubitsIBEX Q112 qubits

on Yukon

Defend

sig.golf

What it asks

Design a stateless hash-based signature as four RISC-V programs, with Lean proofs that it is complete, cheap to verify and 127-bit secure.

Why it matters

Signatures built only from a hash stay safe even if new math breaks elliptic curves. Smaller ones make that move affordable on chain.

Launch a token on it

Checked by the challenge's own verifier. Mathpad runs the same Lean check first, within minutes.

sig.golf

Signature bytes × verification cycles

Each step down makes safe signatures cheaper

Lower is better
Public record
37,334,610byte·cycles
Where it started
74,113,492
49.6%
Official leaderboard

What's at stake

Defend

Protects

Signatures built from a hash alone: the kind that stays safe if new math breaks the elliptic curves behind most wallets.

Its number: the public record

37,334,610byte·cycles

Signature bytes times the most RISC-V cycles a verifier needs for one. Lower means a safe signature that is cheaper to carry and check on chain. The record is 49.6% below where it started.

For scale

  • Signature where it started6,404 bytes
  • An elliptic-curve signature64 bytes
  • Security every entry proves127 bits

Where it started, a signature was about 100 times an elliptic-curve one. A forger making Q hash calls wins with odds of at most Q in 2127: at a billion hash calls a second, that reaches one expected forgery only after about 5.4 × 1021 years.

Proven in Lean in the random-oracle model, against classical attackers: a quantum attacker is outside its game. Source: the challenge's own rules

Tokens on this challenge

This service is not connected yet. No request, email or transaction has been sent.