What happens when someone finds a better Design
The Task remains open
A new Design can replace the current optimal Design
The strictly smaller C takes the optimal slot
The previous Design keeps its burn
But loses the Design premium
BEM Hashrate combines two forms of Work
Burn Work Design Work
The formula is H = (b* + Ktask × q) × P
The key idea is Mining comes from measurable Circuit Work
After building a Circuit
BEM does not simply trust the claimed result
The contract submits official vectors
The Circuit runs on chain
The output is checked bit by bit
BEM Area is calculated recursively
A = g + λ × s
g is the total recursive element count
s is the recursive LATCH count
λ is currently 6
This means state is not treated the same as pure logic
BEM measures Design through three structural properties
Area
Critical Path Depth
Burn Cost
A Design is not simply better because it uses fewer gates Its structure matters
Want to enter a BEM Task
First check qualification
The Netlist must contain no REF
REF based Circuits cannot enter the Mining pool
This prevents recursive reference shells from creating artificial Work
BEM does not simply reward how many transistors you burn
The Work Cost is b = n + λburn × m*
NAND Burn counts as n
LATCH Burn counts as m
The current λburn is 1
What matters is the actual Burn
How does BEM Mining actually work
Start with a Circuit
Build the Design
Tape Out the Circuit
Enter an eligible Mining Task
Verify the Design
Then let the Work become Hashrate
This is Proof of Design