erwin
Verify Buy
Launching on Solana

Born from a quantum computer.

Erwin is a Solana memecoin whose mint address came out of an IBM quantum computer. The rule went public before the job ran, and anyone can check the math with plain Python.

View the code Verify it yourself

Mint address revealed at launch.

From the job record

Qubits measured
Shots in order
Bits of entropy

Fixed in public code before the quantum job ran

Built to be checked

A coin you can check, not one you have to trust

Every step was fixed in public code before the quantum job ran. Nothing on this page asks you to take our word for it.

The bits were the key

Until the mint existed on-chain, the measured bits were its private key. They went public right after launch.

Real quantum hardware

16 qubits on IBM Quantum hardware, not a simulator. The job runner refuses simulators.

RFC 8032, verbatim

The verifier's ed25519 code is copied from the standard. Diff it line by line.

Zero dependencies

verify.py runs on the Python standard library alone. Nothing to install, nothing to trust.

Hash in the launch memo

The SHA-256 of the results file is written in the token's create transaction, so the bits were fixed before anyone saw them.

How it works

  1. Measure

    1

    A Hadamard gate on each of 16 qubits, measured 16 times on IBM Quantum hardware

  2. Collect

    2

    The 16 bitstrings, in shot order, make 256 bits of quantum entropy

  3. Search

    3

    Hash the bits with a counter n from 0. The first n whose address ends in “erwin” wins

  4. Derive

    4

    The seed becomes an ed25519 keypair. Its public key is the mint address

By the numbers

Fixed before the job

Bits of entropy

16 qubits, measured 16 times. Concatenated in shot order, first shot first.

16 × 16 shots

Tries, on average

Expected length of the counter search for the “erwin” ending. Anyone can rerun it.

Public counter search

Dependencies

verify.py needs Python 3.8 or newer and nothing else.

Standard library only

Public steps

Commit, run, derive, launch, reveal. In that order, each one on the record.

Timeline below

Proof, not promises

Rule first,
job second

The derivation rule was committed and archived on web.archive.org before the quantum job ran. Nobody could pick the bits.

Nobody picked
the ending

The bits came from the quantum job. The ending came from a public counter search: n is the smallest counter, from 0, that works.

Bits locked
on-chain

The SHA-256 of the results file sits in the memo of the create transaction, so the bits were fixed before anyone could see them.

Receipts

Every claim has a receipt

Four public records tie the coin to the quantum job. Open each one and check it yourself.

Rule commit

The derivation rule, job runner and verifier, published on GitHub before any job ran.

Archive snapshot

A web.archive.org copy of the repository, timestamped before the IBM job.

Launch transaction

The create transaction's memo records the job ID, the counter and the results hash.

Results file

The 16 measured bitstrings, published right after the create transaction confirmed.

Timeline

Commit, run, derive, launch, reveal. In that order, each step on the public record.

  1. 01

    Commit

    Rule, job runner and verifier published before any job ran.

  2. 02

    Run

    16 qubits, 16 shots on real IBM Quantum hardware.

  3. 03

    Derive

    Counter search for the first address ending in “erwin”.

  4. 04

    Launch

    Token created on Solana at that exact address.

  5. 05

    Reveal

    Bits, counter, job ID and recording published for anyone to check.

Prove it yourself

Verify
Python
0/ dependencies

Run it on your own machine

Python 3.8 or newer. verify.py prints MATCH, and the hash must equal the memo in the launch transaction.

AI assistant
4/ steps

Have an assistant walk through every step

Paste this into any assistant that can run code.

IBM live
Live/ from IBM

IBM's own job record, fetched now

What it checks

  • Job status from IBM's API
  • 16 bitstrings compared with GitHub
  • Time on the quantum processor
  • Read-only key, kept on our server
  • Fetch time shown with the result
See live proof
Live from IBM Quantum

Live proof

The job record, fetched from IBM's API by our server. The fetch time is below.

Asking IBM…

Fetched live by our server from IBM's API with a read-only key. The key stays private because IBM's account API would also expose the owner's email.

Questions & answers

Frequently Asked Questions

Straight answers about the quantum claim, from the bits to the launch.

Verify it yourself
What is Erwin?

A Solana memecoin whose mint address came out of an IBM quantum computer.

Why a cat?

Erwin is named after Erwin Schrödinger. His cat is the most famous image in quantum physics: alive and dead at once, until someone looks. Our coin didn't exist either, until a quantum computer looked.

Why were the bits secret until launch?

Until the mint existed on-chain, the measured bits were its private key. They were published right after the create transaction confirmed.

Was the “erwin” ending chosen?

No. The bits came from the quantum job, and the ending came from a public counter search: n is the smallest counter, from 0, that makes the address end in “erwin”. Anyone can rerun the search.

How do I know the bits came from IBM?

The IBM job ID, the live record above and a one-take screen recording of the job tie the bits to real hardware. Doubt it? We'll re-run a fresh job live on an X Space.

What do I need to verify it?

Python 3.8 or newer and the published results file. verify.py uses only the standard library, and its ed25519 code is copied verbatim from RFC 8032.

Is Erwin an investment?

No. It's a memecoin: no promise of value or return. The only thing it proves is where its address came from.