Skip to main content

Mining mechanics

H = (b*×F + K_task·q) × P

Formula

Burn costb* = n + λ_burn·mn / m = NAND / LATCH transistors burned by this circuit itself
AreaA = g + λ·sg = all gates, s = all LATCHes
CostC = A · max(d,1)^βd = critical path depth
Qualityq = clamp(C_ref / C, 1/Q, Q)design quality relative to the reference implementation
HashrateH = (b*×F + K_task·q) × Ponly the best original design earns the bonus K_task·q

Burn cost and design bonus contribute linearly to hashrate.

Rewards: 99% to the verified pool by hashrate, 1% to the unverified pool by burn
Emission
bitcoin curve, halves every ~4 years
99%1%
Verified pool
Miners with verified task claims
Unverified pool
Miners without a task claim
b* × P
burn only, no bonus
H = (b*×F + K_task·q) × P
(Burn cost + design premium) × processor multiplier
Task verification and enforcement

Mining process

① Check eligibility
The circuit must be on a qualified processor (FAB_TST) and its netlist may not use REF.
② Measure metrics
Measure g, s, d and the locally burned n and m in one pass, without running the circuit.
③ Claim a task
Submit official test vectors. The contract runs the circuit and compares the results bit by bit. Circuit size determines the sample count.
④ Best original design
Each task has one best original design per processor: the implementation with the lowest cost C. A strictly lower-cost implementation replaces the current best original design.
⑤ Allocate output
The verified pool receives 99% of output, allocated by H. The unverified pool receives 1%, allocated by b*×P. Circuits without a solved task can still earn output from their burn cost.

Mechanism details

See the (100 tasks). Each K_task / C_ref comes from an on-chain reference circuit. When a task is published, the contract checks the reference against its test vectors before fixing these parameters.