Wish for a program
Sign a wish for any Solana program id with the price you would pay. No transaction, no deposit. Your record follows you on the list: every proof you paid for and every one you let pass.
Sign a wishReverse first,
get paid
after.
Hunters publish the proof, the source stays encrypted. Whoever wants it pays to decrypt it, and the archive opens in their browser against the hash printed on the ticket since day one.
Prove it on spec
Rebuild a closed program as a Rust crate, with or without a wish. Your browser encrypts it, the judge compiles it and replays real mainnet instructions against the original bytecode. You set the price, 25 USDC minimum.
Submit a cratePay to decrypt
The proof is public the minute the judge passes it. The buyer pays in USDC, the key comes back sealed to their browser, and the archive is checked against its commitment before it downloads.
Open the proof wall
Solana
USDC
Jupiter
Phantom
Solflare
RustAny closed Solana program, rebuilt as source and replayed against mainnet.
How the judge worksThe rules in numbers
92%
to the hunter at once
SourcePaid by the keeper as soon as the unlock payment lands, with a Memo on Solana.
7 days
for the requester
SourceA wish gives its signer the first right to buy a proof made on it, then the proof opens to everyone.
250 USDC
orphan fund cap
SourceProofs nobody buys are bought by the vault at the lower of their price and 250 USDC, and their source is published.
Submit a crate, get a verdict
Replay
The judge builds your crate itself with a pinned toolchain, then runs the original and your binary in two identical SVMs on the same mainnet instructions and account states.
Submission rulesverdict PASS
program MemoSq4g...DLGmfcHr
cases 1000/1000
fuzz 9998/9998
original f520eaf096361abbb9639ea4
candidate 687ba14a4362397e7dd5168f
corpus 99ac7150ecd65eb331cfc333
source 4937b5e236e0a20553140add
report d5429a43e3060052cb9b8417
toolchain decomp-replayer 1.0.0, litesvm 0.17.0
Every case must match: result, error code, every writable account byte, return data and logs. One difference is a FAIL, and the report shows it.
Re-run a verdictThe proof wall
PROOF #0001
ProgramMemoSq...GmfcHr
Match1,000/1,000
Fuzz9,998/9,998
Sourcepublic
Commit4937b5e236e0a205
Reportd5429a43e3060052
Memorecord pending
calibration
VERDICT FAIL
ProgramMemoSq...GmfcHr
Match27/1,000
Fuzz3,900/9,998
Sourcepublic
Commite0548128c46e22af
Report061a5e0f34006b2c
Memorecord pending
calibration
VERDICT FAIL
ProgramMemoSq...GmfcHr
Match1,000/1,000
Fuzz9,997/9,998
Sourcepublic
Commit6574efd2545e5d43
Report422605065375cb03
Memorecord pending
calibration
Original and candidate run side by side
Real mainnet instructions, then fuzzed ones
Compute-unit lines stripped, every other log line compared
The corpus is frozen when the target is snapshotted
Wanted, proven, sold
No wish signed yet. A wish costs nothing: a program id, the price you would pay, a signature.
Sign the first wishWant a closed program opened?
The judge builds the crate itself
A submitted binary is never trusted. The judge compiles your Rust crate with a pinned cargo build-sbf on its own machine, without secrets and with a ten minute cap, then replays the corpus against both binaries under the same compute budget. A PASS needs at least 100 cases where the original succeeds.
Read the judge docs