/Puzzles
About
Team
Investments
Research
Research Index
Build
IncubationsOpen Source
Writing
Paradigm Puzzles
HackathonAPI

Terms, Disclosures, Privacy

LinkedIn, Twitter, Contact

  1. [1]Trading
  2. [2]Language
  3. [3]Systems
  4. [4]Gaming
  5. [5]Math
  6. [6]Formally Verified Compiler
  7. [7]Cryptography

Compete in simulated environments. Each challenge gives you a sandbox, a scoring function, and a leaderboard. Ship a strategy or solution, see how it ranks, and iterate.

12 challenges live2483 players39354 submissions

Trading

AMM bonding curve visualizationfeex · y = kΔy / ΔxReserve XReserve Y
Simple AMMsolidity703 players · 6206 runs

Design a fee strategy for an AMM in Solidity. Compete against other strategies in a realistic EVM-based simulation.

Prop AMM custom swap function visualization
Election prediction market probability path50%YESNO

Language

Stylized fountain pen
Persuasiontext450 players · 14083 runs

Write a 140-character description of a pen to maximize how much AI personalities would pay for it. Score = median price across 15 diverse buyers.

Systems

avlsfenginescycles

Gaming

Dogfight arena visualization

Math

Data qubit

Formally Verified Compiler

solc + EVMLeansuccesssuccess=w:5w:5=panic:17reject≠events:1events:1=slot0:w:1slot0:w:1=1 divergence = 1 finding
Spec Hunt

Cryptography

Kryptos K4cipher

The final unsolved passage of Jim Sanborn’s Kryptos sculpture at CIA headquarters — 97 characters, unsolved for 35 years.

Paradigm Kryptos CTFctf

Ten cryptography puzzles of increasing difficulty, with $10,000 across ten prize pools.

compute_swap()inputoutputInputOutput
Prop AMMrust166 players · 1851 runs

Control the entire swap function, not just fees. Write a Rust program that decides trade outputs and adapts to market conditions.

p(t) = Pr(Zₜ > 0)settlement at TTimeProbability
Prediction Marketpython174 players · 1672 runs

Write a Python market-making strategy for a binary prediction market. Manage limit orders to maximize edge against informed and retail flow.

Negotiation — two agents exchanging resourcesBBHLLHHLBUSEROPPONENTSCORE 0.724SCORE 0.541ROUND 3/5BOOKSHATSBALLS
Negotiationtext184 players · 3506 runs

Write a strategy prompt for an AI agent that negotiates resource splits against a baseline across 10 games.

Anthropic Take-Home Challengepython618 players · 8737 runs

Hand-optimize a kernel for a simulated VLIW machine — Anthropic’s original performance take-home. Chase the lowest cycle count.

ARENA 1000 x 600SEED 042HP 5HP 3-50005000300600
Dogfightonnx25 players · 698 runs

Program an AI pilot to outmaneuver opponents in aerial combat. Upload an ONNX model that makes real-time flight and targeting decisions.

Chess board♔♖♕♙♙♙♘♚♜♝♟♟♟♟
Chessonnx6 players · 41 runs

Train a neural network to evaluate chess positions. Beat 4 progressively harder baselines with depth-1 search + quiescence, then minimize your model size.

ErrorCorrection
Quantum Error Correctionpython21 players · 877 runs

Build a decoder that corrects quantum errors better than MWPM. Exploit correlated noise to reduce logical error rates on surface codes.

Shape Packingjson42 players · 256 runs

Pack 15 unit semicircles into the smallest enclosing circle. Minimize the radius of the bounding circle.

solidity
17 players · 940 runs

Find a program where a formal Solidity semantics — written in Lean — disagrees with the real solc + EVM. Every accepted divergence is a concrete bug in the formal model.

✓ Solidus.compile_correct#print axioms → [propext, Choice, Quot]PUSH1 0x40MSTORECALLDATASIZEPUSH2 …JUMPIDUP2SWAP1RETURNgas 1,000,000gas 812,400gas 634,900↓cheaper, still proven
Formally Verified Compilerlean

Beat a formally verified Yul → EVM compiler on total gas — while its machine-checked correctness theorem still proves.