Skip to main content

Mining tasks

Tasks
On-chain
Combinational / sequential
Total reference NANDs
Total reference latches
Every task ships with an official reference implementation. Get your design cost C below it and pass on-chain verification to take the Best Original slot and the design premium.

That reference is already synthesized and already passing its test vectors. Its burn basis b* and design cost C_ref are locked on-chain when the task goes live — that's the number you have to beat.

There's only one thing to do: get your design cost C lower. Fewer gates and shallower logic mean a lower C. Then pass on-chain verification.

Each task has one Best Original slot per processor. It goes to the verified circuit with the lowest C — if two tie, the earlier commitment wins. A lower-C circuit takes the slot from whoever holds it, and the design premium K_task · q goes with it.

Category
Difficulty
Sort
Loading…
IDTaskDifficultyPinsReferenceK_task · C_refActions
Loading…