EligibilityNetlists must not contain REF. Circuits with references are ineligible for either mining pool.
Burn costb* = n + λburn · mn = NAND burned in this layer; m = LATCH burned in this layer
AreaA = g + λ · sg = total components (recursive), s = total LATCH (recursive)
Depthd = longest combinational pathit may end at an output pin, or at a register input
CostC = A · max(d,1)βDesign cost combining area and depth
Qualityq = clamp(Cref / C, 1/Q, Q)Design quality relative to the reference implementation
HashrateH = (b*×F + Ktask·q) × PF is the current holder’s on-chain boost factor and applies only to burn cost. Only the best original design earns the K_task·q premium.