On Bitcoin
Original inscription text
Exact UTF-8 text from the reveal transaction.
Your logic.
On Bitcoin.
A circuit starts with an idea.
Make it yours. Give it a home on Bitcoin.
01 /
Design your logic.
Build with NAND gates and latches.
Small primitives, infinite combinations.
02 /
See it in action.
Toggle inputs and trace each signal.
Test your logic before saving it.
03 /
Mint
Inscribe your circuit on Bitcoin.
A little logic.
All yours.
01
Design your circuit
Every connection is a possibility.
Start with a prompt.
Copy this prompt into your AI assistant. Paste its JSON reply into the JSON editor, then explore your circuit on Canvas.
Choose a difficulty, then select a challenge to optimize.
Copy this brief and ask your AI assistant to optimize the selected challenge.
Open the JSON editor and paste the reply to test it against the challenge.
Circuit challenges
Loading versioned challenge bank…
Design metrics
Measured on the flattened netlist- NAND
- — fewer is better
- LATCH
- — fewer is better
- Depth D shallower is better
- Area A
- — lower is better
- Cost C
- — A × D³ · lower is better
- Quality q
- — needs a reference
RANK PREVIEW
—POSITION
—RANK q
—BEST q
—BODY B
How are these measured?
Metrics use the flattened netlist that is validated on Bitcoin. Depth counts NAND levels from an input, constant or LATCH output to a circuit output or LATCH input. If outputs are not the last components in order, flattening adds two inverter levels and 2 × outputs NAND records. Area counts every record once; transistors have no cost yet. Cost C = A × D³, so depth weighs most. q = reference C ÷ your C, against the example you started from; above 1 beats it. C compares design efficiency. It is not a BTC fee. Rank preview uses the leaderboard formula, which also counts inscribed body bytes with the circuit name excluded, and appears only after the circuit passes challenge verification.
A connection starts at an output dot and ends at an input dot.
COMPONENTINPUT SIGNALS
Paste the AI reply
Clear the editor and paste your AI response. The canvas and simulation update as soon as the JSON is valid.
Uses the Bitstape circuit format. NAND and LATCH primitives only.
RANK
Circuit leaderboard
Confirmed mints compared inside each challenge. Lower cost wins.
Cost C = A × D³ × (1 + 0.25 × (B/Br − 1)). A counts NAND and LATCH records, D is critical-path depth, and B is inscribed bytes with the circuit name excluded. C compares design efficiency against the challenge reference; it is not a BTC fee.
Mint your
own logic.
Loading mint progress…
Mint a circuit
- 1Circuit
- 2Mode
- 3Fees
- 4Sign & pay
Your circuit JSON
Paste a Bitstape circuit definition or import a .json file. It is inscribed exactly as previewed.
Choose a mint mode
Fee preview
- Circuit size
- —
- Network fee
- —
- Protocol fee
- —
- UTXO occupancy
- —
- Estimated total
- —
Network fee = commit fee + reveal fee. Both transactions are paid from your wallet: the commit fee is deducted from your wallet balance, and the reveal fee is prepaid into the commit output.
- Commit—
- Reveal—
Sizes assume one funding input. If your wallet needs more UTXOs, the commit grows by about 58 vB per extra input, so the final fee can be slightly higher. The exact amounts are fixed in the transactions you sign in UniSat.
Sign & pay
You sign one ownership message and two Bitcoin transactions in UniSat. Mint success is checked after the reveal reaches 1 network confirmation.
YOUR LOGIC. YOUR COLLECTION.
Your assets.
Circuits, market and miners — one wallet view for everything your logic becomes on Bitcoin.
CircuitsYour logic, collected on Bitcoin.
MarketTrade and discover inscribed logic.
MinersMachines that turn logic into work.
Pending mints
Loading