A world of 512 by 512 cells that Ethereum orders and verifies but never runs. Every day it lives through 256 generations of Conway's Life, and every live cell belongs to someone. The work happens in nodes, this tab included. If anyone disagrees with what a node posts, a dispute narrows the argument to a single 8 by 8 tile, and the chain checks that tile once.
A light client used to take the chain's word for what happened. This one does not. It reads the ordered writes of the epoch, replays them, runs 256 generations, builds the tree over 4,096 tiles, and compares its own commitment with the one the chain was told.
If they match, nothing needs to happen, and nothing does. If they do not, this tab can open a dispute and play it to the end.
A liar takes the world in the die above, runs the epoch honestly, and at one generation plants four cells that were never there. From then on it computes faithfully, so its world is consistent with itself and wrong. Press play and watch an honest node find the exact step and the exact tile, while the chain does almost nothing.
When an epoch finalizes, the pot releases 10%. The proposer is paid 5% of that for posting the truth, and the rest becomes 16 prizes. Prize j goes to the owner of live cell number keccak256(seed, j) mod live, counted through the tree, so every live cell has the same chance and a dead one has none.
The seed is the drand round one minute after cutoff. Nobody can know it early and nobody can choose it. Anyone may settle a prize; it is always paid to the cell's owner.
| j | Cell | Owner | Prize | State |
|---|---|---|---|---|
| Nothing drawn yet. | ||||
| Contract | Role | Address |
|---|
| Parameter | Conditions | Typ | Unit |
|---|
Buy CWC on the ETH/CWC pool with 0.01 ETH or more. The hook launches one glider owned by your address, at a place the swap's own hash picks. The first time costs about 115,000 more gas, once; after that about 49,000.
Gliders go to the transaction's origin. If you trade through a relayer or a smart-wallet bundler, the glider is the relayer's. Write directly instead.
Approve the World to burn CWC, then call write(tiles, masks) with up to 32 tiles. Bit i of a mask is cell i = row * 8 + col. quote(cells) gives the exact burn first.
A block is four cells that live for ever unless something hits them. A glider is five that travel. Both are in the editor above.
The same logic as this page, as a program that never sleeps. It verifies every claim, proposes the truth, disputes a lie and plays every move, finalizes, and settles its own prizes.
node cwc_node.js # watch only
node cwc_node.js --act # propose, dispute, defendThe key goes in through a masked prompt into an environment variable, never a file. The file's header says how.
After cutoff, compute the epoch and call propose(e, rootHash, rootCount, drandSignature) with 0.03 ETH. After 12 undisputed hours anyone calls finalize(e). You get the bond back and 5% of the release.
challenge(claimId) with 0.03 ETH, then answer each move within the hour: pick the first segment you dispute, choose the first node that is wrong, and finish with resolveGeneration or resolveWrite. Win, and you take back your bond and the liar's.
sampleIndex(e, j) names the live cell; walk the tree's counts to its tile and call collect(e, j, tile, words, proof). Anyone may; the owner is paid. Then the owner calls withdraw(). Prizes wait 30 days, then return to the pot.
| Rating | Limit |
|---|---|
| Owner ids, ever | 65,535 |
| Gliders launched per epoch | 512 |
| Direct writes per epoch | 512 |
| Tiles per write call | 32 |
| Steps in one epoch | 1,280 |
| Moves in one dispute | 13 |
| Time per move | 1 h |
| Claim window | 12 h |
| Claim and dispute bond | 0.03 ETH |
| Prize life | 30 days |
| No. | Description |
|---|---|
| E1 | A false claim nobody disputes within 12 hours becomes the world. Every node checks every claim, and winning a dispute pays the liar's bond. The window is sized to daily prizes, not to billions. |
| E2 | Only the proposer can defend a claim. A proposer who walks away loses to anyone, even someone who is wrong. The truth can always be proposed again; that proposer's bond cannot be recovered. |
| E3 | The last writer before cutoff sees every earlier write of the epoch. That is what ordering is worth. The price of a cell rises with demand inside the epoch. |
| E4 | Gliders from buys go to the transaction's origin. Trades through relayers and bundlers launch the relayer's glider. |
| E5 | The verifier is optimistic: it catches a lie if one honest node objects in time. It is not a validity proof. It needs no trusted setup, no prover farm, and nothing but hashes. |
| E6 | Not audited. A fork simulation, an economics model and an adversarial review are not an audit. |