diff --git a/docs/analysis/class-v6/floor/shadow-k.md b/docs/analysis/class-v6/floor/shadow-k.md
index a5c561c52..1b8667439 100644
--- a/docs/analysis/class-v6/floor/shadow-k.md
+++ b/docs/analysis/class-v6/floor/shadow-k.md
@@ -104,7 +104,7 @@ stock and at the 1,300 MHz lock, and 6.9 pJ per counted op on the Apple M5 Max (
 | lop3 (8-bit truth table) | 7,274 | 1.42 | 0.99 | 0.72 | 0.52 | 24.1 / 13.0 | 0.030 / 0.055 | | 0.11 | |
 | 32-lane xor-mask shuffle (butterfly over the 1 KB window), per lane-op | 181,580 | 1.24 | 0.87 | 0.63 | 0.45 | 55.8 / 29.4 | 0.011 / 0.021 | | 0.042 | routed with SPEF; 15:1x UK |
 | 32-lane general crossbar, per lane-op | ROW_XBAR |
-| 8 KB scratch, one random read (flop array: the pessimistic form) | ROW_SCRATCH |
+| 8 KB scratch, one random 32-bit read of a 2,048 x 32 flop array (the pessimistic form of a chip's L1; an SRAM macro reads lower) | 868,159 | 207 | 145 | 104 | 75 | 2,400 / 1,400 per L2 hit | 0.043 / 0.074 | | 0.15 | routed with SPEF, 19:4x UK; the card's shared-memory read is unmeasured (owed) |
 | int8 8x8x8 tile, per MAC | ROW_TILE |
 
 Reading the floors: a lane's add costs the chip about 2.2 pJ at ASAP7 and 1.1 at N3, against the 5090's 6.2
@@ -138,7 +138,7 @@ draws 13.9 mW, the run phase 36.9 mW for 8 lanes at 1.5 ns).
 | core, 8 lanes, 32 registers | synthesis only (no wires, no clock tree) | 186,443 | 6.9 | 4.8 | 3.5 | 2.5 | 11.3 / 6.2 / 6.9 | 0.31 / 0.56 / 0.50 | 0.22 / 0.40 / 0.36 | 1.1 | synthesised; 14:0x UK |
 | of which the sequential term (register file, imem and IR clock pins, no clock gating) | | | 2.4 | 1.7 | 1.2 | 0.9 | | | | | |
 | of which the units, the read muxes and the butterfly | | | 4.5 | 3.1 | 2.3 | 1.6 | | | | | |
-| core, 8 lanes, 32 registers | placed and routed, SPEF | ROW_CORE8_PLACED |
+| core, 8 lanes, 32 registers, ungated | placed and routed, SPEF, clock tree (one run length of 300 cycles, the load phase subtracted, about plus or minus 10 percent) | 444,478 | 11.3 | 7.9 | 5.6 | 4.1 | 11.3 / 6.2 / 6.9 | 0.50 / 0.91 / 0.82 | 0.36 / 0.66 / 0.59 | 1.8 | placed 16:0x UK on a rented pod; +64 percent over synthesis (wires, and a clock tree of 2.5 pJ per lane-op that gating removes) |
 | core, 32 lanes, 32 registers | synthesis only (steady state from 150 and 400 run cycles) | 600,381 | 5.55 | 3.9 | 2.8 | 2.0 | 11.3 / 6.2 / 6.9 | 0.25 / 0.45 / 0.41 | 0.18 / 0.32 / 0.29 | 0.90 | synthesised; 15:2x UK |
 | core, 32 lanes, 16 registers | synthesis only | 443,258 | 4.2 | 2.9 | 2.1 | 1.5 | 11.3 / 6.2 / 6.9 | 0.18 / 0.34 / 0.30 | 0.13 / 0.24 / 0.22 | 0.68 | synthesised; one run length, about plus or minus 10 percent; 15:0x UK |
 | the bare ARX lane (section 3, the floor) | routed | 11,631 | 2.2 | 1.5 | 1.1 | 0.8 | 11.3 / 6.2 / 6.9 | 0.10 / 0.18 / 0.16 | 0.07 / 0.13 / 0.11 | 0.35 | the lower bound |
@@ -203,6 +203,128 @@ takes back on the card's own node (3.6x to 2.4x), which is the design. Node-for-
 k 0.78 and the 64-register core at 1.09, so "near 0.9" is reached node-for-node by the window alone; what it does
 not survive is the node step a chip project would buy (an N3 core gives back 0.4x, an N2 core 0.8x).
 
+### 4c. The adversary's 64-register core: is the window a defence? (the coordinator's order, 15:3x UK)
+
+Every row in this section is a MODEL of a chip core, never a lower bound on what a chip maker can build; the
+synthesis gives the cost of the circuit as drawn, and a better circuit is always possible.
+
+**The live-state analysis** (`tools/chip-model/rtl/flow/livestate.py`, run on build-3: programs drawn as the
+core testbench draws them, the class v4 op weights, a load on one instruction in 16 as the dependent memory wait,
+dst and src uniform over the window, the result fold reading every register at the end of the block; 64 drawn
+programs, 1,024 waits per row):
+
+| Window R | Live values at a wait (mean, min to max) | Of which necessary (reach a later address or the result, transitively) | Dead writes per block |
+|---|---|---|---|
+| 8 (the class ISA) | 7.0 of 8 (6 to 7) | 6.9 | 2.9 percent |
+| 32 | 30.5 of 32 (29 to 31) | 30.0 | 2.9 percent |
+| 64 | 61.7 of 64 (59 to 63) | 61.0 | 2.8 percent |
+| 64 at a 1,024-instruction block | 61.5 of 64 (58 to 63) | 60.6 | 3.1 percent |
+
+So under a fold that reads every register, 95 percent of the window is live AND necessary across every memory
+wait: the adversary cannot shrink the state it keeps by liveness, and recomputing a value instead of keeping it
+costs the dependent chain that produced it (every value feeds the result transitively). The window is a
+defence ONLY because of the fold rule; a fold that read 8 of the 64 registers would let the chip drop the rest
+(the dead fraction would rise toward the fraction never read before the fold), so the fold-reads-all rule is the
+design rule that goes with the window.
+
+**What the adversary can do with the state it must keep** is make it cheaper per access, not smaller. The
+GPU-shaped row (4a, 64 registers in flops, every flop clocked every cycle, three 64:1 read muxes) is 9.7 pJ per
+lane-op at ASAP7. The forms a chip maker would use:
+
+| Form of the 64-register state (per lane, 256 bytes) | pJ per lane-op ASAP7 | N3 | k at the lock (N3) | Label |
+|---|---|---|---|---|
+| flops, no clock gating, 64:1 read muxes (the 4a row) | 9.7 | 4.9 | 0.78 | synthesised; a model |
+| flops with the register-file clock gated (one of 64 registers written per cycle; the ICG cells allowed back in and inferred by Yosys, 320 gates) | 6.2 (225,441 cells; sequential 0.2) | 3.1 | 0.50 (0.70 node-for-node) | synthesised 16:0x UK; a model |
+| the same gating on the 32-register base, for the penalty | 4.5 (156,833 cells; sequential 0.15) | 2.3 | 0.37 (0.51 node-for-node) | synthesised 16:0x UK; a model |
+| the gated 32-register base PLACED AND ROUTED (SPEF, clock tree, 379,633 cells; steady state solved from 150 and 600 run cycles) | 6.7 (+49 percent over synthesis) | 3.4 | 0.54 (0.76 node-for-node) | placed 19:5x UK; the GDDR7 board at the lock 2.4x node-for-node, 2.8x a node ahead: the morning's headline figures to the digit |
+| the gated 64-register window core PLACED AND ROUTED (563,339 cells; parasitics estimated from global routing, the SPEF lost to a full disk; steady state solved from 150 and 600 run cycles; plus or minus 15 percent) | 9.45 (+52 percent over synthesis; N5 6.6, N2 3.4) | 4.8 | 0.77 (1.07 node-for-node, 0.55 at N2) | placed 21:3x UK; the GDDR7 board at the lock 2.0x node-for-node, 2.45x a node ahead, 2.9x two ahead; the window's residual against the placed base +2.75 pJ per lane-op, +0.23 of k at the lock |
+| latch-based register file (the clocked element halved; about 30 percent under the gated flop file, approximate) | about 0.7 x the gated row | | | modelled |
+| SRAM-banked state shared across time-multiplexed lanes (one execution port serving many lanes' streams in turn, each lane's 256 bytes in a bank): modelled 8.5 to 10.5 from the access energies; BUILT as `core_tm` (8 lanes x 64 registers in banks, one port, round-robin, ungated): 8.8 pJ per lane-op synthesised (173,426 cells), against the SIMD ungated 9.7 | 8.8 (built) | 4.4 | 0.71 | synthesised 16:2x UK: port sharing saves 0.9 pJ of units and the bank-select muxes take most of it back; NOT the lever; the multi-family adversary lane's macro-window core reads 5.9 (its FakeRAM term modelled 2.0 to 7.0 pJ per access), within 5 percent of the gated flop row, so the file's form is not the lever either |
+| values recomputed instead of kept | not available: 95 percent of the window is necessary (above) | | | measured on drawn programs |
+
+The defence, then, is the penalty that remains after the adversary's best form: the gated 64-register file
+against the gated 32-register file (the two synthesised rows above when they land; measured: 6.2 against 4.5 pJ per lane-op at ASAP7 synthesised, a penalty of 1.7 pJ; PLACED 9.45 against 6.7, a
+penalty of 2.75 pJ, 1.4 at N3, +0.23 of k at the lock, 0.54 to 0.77 at N3 and 0.76 to 1.07 node-for-node; the
+analytic estimate had been 1.5 pJ). So on placed rows the window takes the GDDR7 board at the lock from 2.4x to
+2.0x node-for-node and from 2.8x to 2.45x a node ahead, for at most 5 percent per load on the card. Two corrections this
+forces: the honest adversary's BASE core is the gated one (k 0.37 at N3, 0.51 node-for-node), under the ungated
+0.56 and 0.78 of section 4, which are the GPU-shaped core a maker would not build; and placement costs more than
+the +20 to +40 percent estimated (the ungated placed base reads 11.3 against 6.9 pJ: wires plus a 2.5 pJ clock tree
+that gating removes), so the placed gated rows (on a rented pod, 17:30 UK) are the figures to serve. On the 32-lane core the same
+penalty applies per lane (the register file does not amortise), so the window moves the 32-lane core from k 0.45
+to about 0.57 at the lock at N3 (0.63 to about 0.80 node-for-node).
+
+**The GPU side** (the hash lane's hand): the compiled allocation of the 64-register measurement pack (ptxas
+registers per thread, local-memory spill bytes, occupancy) and the rate beside the 8-register base, clock
+18:00 UK; until then the modelled reading stands: about 110 of 255 registers per thread, occupancy about half,
+the rate expected to hold under the latency-bound chain (the 5090 hides about 330,000 ops per hash before compute
+binds) and the energy to move little, the per-lane register traffic the unmeasured term.
+
+The measured GPU side (the hash lane, 16:1x to 16:4x UK, RunPod secure pods, driver 580, the kit worker, 250 x
+2^24, nvidia-smi 1 Hz; ptxas from nvcc 12.8 -Xptxas -v on the pack's kernel; pods destroyed, USD 1.22):
+
+| Card, pack | MH/s | W | microjoules per hash | registers per thread (ptxas) | spill | blocks per SM (occupancy) | per load | Label |
+|---|---|---|---|---|---|---|---|---|
+| 5090, the base (mx8-devnet-epoch0) | 141.74 | 303.1 | 2.139 | 30 | 0 B | 24 (4,080 warps) | 16.7 nJ | measured |
+| 5090, the window, arithmetic-only (hl-reg64, twice the base's work by construction) | 80.38 | 308.6 | 3.839 | 96 | 0 B | 20 (83 percent) | 15.0 nJ | measured: level per unit of work |
+| 5090, the window, full chain (hl-reg64c: every load's address mixes all 64 registers) | 70.96 | 320.3 | 4.513 | 88 | 0 B | 20 (83 percent) | 17.6 nJ (+5 percent) | measured |
+| 4090, the base | 62.67 | 208.9 | 3.333 | 29 | 0 B | 24 | 26.0 nJ | measured |
+| 4090, the window, arithmetic-only | 31.57 | 210.3 | 6.663 | 104 | 0 B | 16 (67 percent) | 26.0 nJ | measured: level |
+| 4090, the window, full chain | 31.38 | 216.5 | 6.898 | 87 | 0 B | 20 (83 percent) | 27.0 nJ (+4 percent) | measured |
+
+So the card's side of the window defence is at most 5 percent per load: no spill on either card in either form, 88
+to 104 registers per thread, occupancy 67 to 83 percent, and the rate per unit of work held within 5 percent under
+the latency-bound chain. The sound class form is the full chain (the arithmetic-only fold fails the liveness rule;
+class string `+reg64c`, pack hl-v6-win with `check_window_liveness` in its suite). The chip's side (this section's
+gated rows) therefore carries the whole defence.
+
+### 4d. The connected-state variant (cs64s27x16, the connected-state lane's structure) on the adversary's core
+
+The connected-state lane's program (a 64-register window; per step a load whose address register is the previous
+block's last dst, the word landing in m_j, then a 27-instruction block whose first instruction reads m_j and every
+later one draws its src from the block's last four dsts, the last instruction injecting; 16 steps of text, 448
+instructions, 16 passes per block; its liveness tool: 63 of 64 live at every address, about 11 registers in the
+per-step dependent chain, about 20 touched per block) priced on the gated 64-register core with a 512-entry imem,
+the program drawn by those rules in the testbench (`CS` mode of `tb_core_common.vh`), synthesis-only:
+
+| Row | Cells | pJ per lane-op ASAP7 | N5 | N3 | N2 | k at the lock N5 / N3 / N2 | k at stock N5 / N3 |
+|---|---|---|---|---|---|---|---|
+| cs64s27x16 on the gated 64-register core, 512 imem | 253,059 | 6.3 | 4.4 | 3.2 | 2.3 | 0.71 / 0.51 / 0.37 | 0.39 / 0.28 |
+| the class v4 draw on the gated 64-register core, 256 imem (4c) | 225,441 | 6.2 | 4.3 | 3.1 | 2.2 | 0.70 / 0.50 / 0.36 | 0.38 / 0.27 |
+
+The chip's shadow for the program is 55,296 x 3.2 pJ = 0.18 microjoules per hash at N3 (0.24 node-for-node)
+against 0.13 for the genesis window on the same core; the card pays +0.6 percent for the window on the 5090 (the
+connected-state lane's measurement). The structure's other knobs do not reach the chip: the 16-pass loop and the
+448 text cost the shared imem about 0.1 pJ per lane-op, hot-set banking is not needed (the gated file charges only
+the written register), and the chain's width sets lane count, which is free. On the GDDR7 board at the lock the
+window moves the chip's edge by about 1.1x (3.6x to 3.3x node-for-node), under the 1.25x gate that lane set.
+
+### 4e. The mixed-resource lane's FP32 units (class-v6-mixedfp) on the adversary's lane
+
+The mixed-resource lane's candidate adds four FP32 families (fadd, fmul, ffma, fcvt) to the shadow's draw, every
+result injected by xor, with inputs masked to a 7-bit exponent range (never zero, denormal, NaN or Inf). The
+adversary's simplified units (`rtl/fp32_units.v`): an FMA with the 24 x 24 mantissa multiplier, a 100-bit
+alignment window, a full normaliser and RNE; a separate adder and multiplier; the int32 to float converter; the
+exponent path narrowed to the range; no NaN, Inf, denormal or flag logic. The lane: an 8 x 32-bit window, the
+four units, `d ^= bits(result)`. Routed with SPEF, random-input VCD, 42,936 cells, a 2 ns clock.
+
+| Op (every unit evaluating each cycle: an UPPER bound per op, no operand isolation) | pJ per op ASAP7 | N5 | N3 | N2 | 5090 fp32_fma stock / lock | k at N3 vs stock / lock |
+|---|---|---|---|---|---|---|
+| fadd | 6.6 | 4.6 | 3.3 | 2.4 | 9.2 / 5.2 | 0.36 / 0.64 |
+| fmul | 7.0 | 4.9 | 3.5 | 2.5 | 9.2 / 5.2 | 0.38 / 0.68 |
+| ffma | 6.7 | 4.7 | 3.4 | 2.4 | 9.2 / 5.2 | 0.37 / 0.65 |
+| fcvt | 6.9 | 4.8 | 3.5 | 2.5 | 9.2 / 5.2 (cvt unmeasured on the card) | 0.38 / 0.67 |
+| random mix | 7.1 | 4.9 | 3.6 | 2.6 | | 0.39 / 0.68 |
+
+Reading: the four read alike because all four units switch every cycle on the same operands, so each row is the
+upper bound for its op (a chip isolates the idle units; by cell share about ffma 3.5 to 4, fmul 2.5, fadd 2, fcvt
+1 pJ at ASAP7, approximate). Even on the upper bound the FP family is the chip's dearest per op relative to the
+card: k 0.65 at N3 at the lock against 0.18 for the integer ARX lane floor, because the card does an FMA for 5.2
+pJ (under its own int add at 6.2) while the chip's multiply, alignment and normaliser cost about three int ops.
+On the units' floors the shadow's k_eff rises from 0.097 (class v4) to about 0.14 at the fp12 mix and 0.17 at
+fp24 (0.20 and 0.24 with isolation taken as half), the core's per-op overhead on top. The GPU-cost budget (10
+percent of energy per hash) is the binding side, and the vendor-rounding question is the class's, not the chip's.
+
 ## 5. The chip edge at the measured k
 
 `E_chip = E_mem + N_ops x e_chip` (absolute: the chip's shadow cost is 102,100 x 3.5 pJ = 0.36 microjoules per hash
@@ -270,7 +392,7 @@ to 2.3x and the strongest chips at 2.6x to 4.2x.
 | 6 | prmt, lop3 | 0.64, 0.72 | 11.5, 13.0 | 0.056, 0.055 | not drawn (RTL rows only) |
 | 7 | mulhi | 0.68 | 21.0 | 0.032 | yes (6) |
 | 8 | 32-lane shuffle (butterfly) | 0.63 | 29.4 | 0.021 | yes (8) |
-| 9 | L1 scratch read (8 KB flop array) against the card's L2 hit | ROW_SCRATCH_K | 1,400 | pending | not drawn |
+| 9 | L1 scratch read (8 KB flop array) against the card's L2 hit | 104 (pJ per read) | 1,400 | 0.074 | not drawn |
 | 10 | int8 8x8x8 tile, per MAC | ROW_TILE_K | 2.2 | pending | not drawn (the tensor lever is dead on other grounds) |
 
 The order is set by the card's price, not the chip's: the chip pays 0.6 to 1.7 pJ for everything, and the card
diff --git a/docs/analysis/class-v6/rows/live-dataset-census-1a938abe4.md b/docs/analysis/class-v6/rows/live-dataset-census-1a938abe4.md
new file mode 100644
index 000000000..154e6b1a2
--- /dev/null
+++ b/docs/analysis/class-v6/rows/live-dataset-census-1a938abe4.md
@@ -0,0 +1,132 @@
+# The live-dataset census on the frozen object (Igneum 2.0 Phase 1 item (j)), 8 October 2026, 21:4x to 22:10 UK
+
+The frozen tree: class-v6 1a938abe4 (the draw and the acceptance of b24dfc162; nothing on it moves). The object: hl-v6-all, program 4de7b836cc40a4ea, generator 6, class mx8-erad810f22d+sh256x27+state+reg64c+fold+rw (the fold, the rw1 table, the 64-register full-chain window), the Devnet 3 genesis epoch hex edc4fa84... as the epoch and era seed, day 20730, the node1 state (block 159357, 93 leaves, root 1c583d35...). The harness: branch class-v6-census-all4 at b819c23a4 (the census commands on the 1a938abe4 crate; the binary all4-b819c23a, sha256 6448ade354bc665a... on build-5 and build-6, byte-identical). Boxes: build-5 (igneum-build-5, 32 cores) and build-6 (igneum-build-6, 32 cores), the lease pool at class v5, nice 19, every run under a pid file through the night driver (`tools/attack/v6-census/night-run.sh`: a job without its end marker is restarted up to three times and every restart is logged; the logs are beside the rows). Nothing ran on the Mac; nothing here touches a served page or the spec.
+
+**What "live" means here.** The acceptance's dynamic test, the attempts census and the earlier trace reads run on the closed-form stand-in. These rows run the kernel path's own interpreter (`verify::interpret_warp_core` under a tracing probe) on the chain's dataset: the memory-hard dataset the epoch derives from the day key with the mixer and the state leaves of the node1 stream (`Epoch::chain_dataset_day` with `--state`), so every address after the first load depends on live dataset bytes; and on the header-bound init words (`bind::block_init_words` over a prehash per header with the header's index as the high nonce word), four headers per box, the object split four headers per box (eight in all), 2^18 nonces per header on the object and 2^16 on each of sixteen chain-shaped seeds p18 to p33 under the frozen class.
+
+## 1. The census rows (the same statistics as the closed-form census, over the live dataset)
+
+Per run: per (iteration, site) cell and per site the address histogram over every read (A03's form: the most read address and its share), the distinct word indices against the window model `N - N^2 / 2W` at the site's window (the (c'') form), the one-count of every address bit inside the site's window above the alignment (the value-level read, 6 sigma), and over the program the top 0.1 percent of items' share of all reads against a flat control and a windowed control (each site's reads drawn uniformly over its own window, the same counts) at the same N (the F8 form's two nulls; the gate 1.2x over the window model).
+
+| Run (box) | Program | Headers; nonces per header | Reads | Worst address at any site, worst cell (count, share) | Min site distinct ratio (floors 0.98, 0.995) | Worst index bit inside its window (sigma; band 6) | Top 0.1 percent item share; against the controls (gate 1.2x) | Ideal cache 1 GiB / 256 MiB / 64 MiB (top K by count; sampling-inflated above the window model) |
+|---|---|---|---|---|---|---|---|---|
+| object-h0 (build-5) | 4de7b836cc40a4ea | 4 from 0; 262,144 nonces each | 268,435,456 | site 8: 0x07579830 x6 (1.0e-06); cell: 0x0ab39b50 x4 (4.0e-06) | 1.00007 | -3.51 (site 7, bit 1) | 0.002138; 1.0998x flat; **0.9989x** window model | 1.0000 / 0.3540 / 0.1035 |
+| seed-p18 (build-5) | 0b686c80e25cb4d3 | 4 from 0; 65,536 nonces each | 67,108,864 | site 0: 0x04b26299 x4 (2.0e-06); cell: 0x000e4f1d x3 (1.1e-05) | 0.99991 | 3.09 (site 24, bit 16) | 0.003391; 1.1032x flat; **1.0006x** window model | 1.0000 / 0.4404 / 0.1414 |
+| seed-p19 (build-5) | bf8510cd00c0c70f | 4 from 0; 65,536 nonces each | 67,108,864 | site 0: 0x0813e726 x4 (2.0e-06); cell: 0x06f0d11f x3 (1.1e-05) | 0.99986 | -3.81 (site 29, bit 7) | 0.003433; 1.1159x flat; **0.9996x** window model | 1.0000 / 0.4418 / 0.1426 |
+| seed-p20 (build-5) | 24133bd7265e958f | 4 from 0; 65,536 nonces each | 67,108,864 | site 2: 0x09d4fb1a x4 (2.0e-06); cell: 0x0ae65aa6 x3 (1.1e-05) | 0.99994 | -3.55 (site 30, bit 0) | 0.003434; 1.1175x flat; **1.0003x** window model | 1.0000 / 0.4443 / 0.1429 |
+| seed-p21 (build-5) | ed647abf60a5bd32 | 4 from 0; 65,536 nonces each | 67,108,864 | site 0: 0x04e14ec7 x4 (2.0e-06); cell: 0x03973640 x3 (1.1e-05) | 0.99990 | 3.90 (site 11, bit 9) | 0.003920; 1.2759x flat; **1.0008x** window model | 1.0000 / 0.4774 / 0.1605 |
+| seed-p22 (build-5) | f8e8969443448ecb | 4 from 0; 65,536 nonces each | 67,108,864 | site 6: 0x06a054ca x5 (2.0e-06); cell: 0x0342068e x3 (1.1e-05) | 0.99994 | 3.31 (site 13, bit 19) | 0.003237; 1.0540x flat; **0.9997x** window model | 1.0000 / 0.4271 / 0.1370 |
+| seed-p23 (build-5) | 160649503341aaab | 4 from 0; 65,536 nonces each | 67,108,864 | site 1: 0x0e3c2793 x4 (2.0e-06); cell: 0x051243d9 x3 (1.1e-05) | 0.99994 | -3.44 (site 25, bit 1) | 0.003338; 1.0854x flat; **0.9990x** window model | 1.0000 / 0.4315 / 0.1391 |
+| seed-p24 (build-5) | 62aa0bfc93f13028 | 4 from 0; 65,536 nonces each | 67,108,864 | site 2: 0x08bdfbf3 x4 (2.0e-06); cell: 0x0bd48627 x3 (1.1e-05) | 0.99991 | 3.46 (site 4, bit 15) | 0.003156; 1.0264x flat; **0.9988x** window model | 1.0000 / 0.4212 / 0.1338 |
+| seed-p25 (build-5) | 3f1af0bbaaef74fa | 4 from 0; 65,536 nonces each | 67,108,864 | site 2: 0x0fb1f63d x4 (2.0e-06); cell: 0x0f8343d0 x3 (1.1e-05) | 0.99993 | 3.27 (site 2, bit 5) | 0.003436; 1.1192x flat; **1.0014x** window model | 1.0000 / 0.4418 / 0.1426 |
+| object-h4 (build-6) | 4de7b836cc40a4ea | 4 from 0; 262,144 nonces each | 268,435,456 | site 21: 0x0436441b x6 (1.0e-06); cell: 0x0f45e0db x4 (4.0e-06) | 1.00010 | -3.06 (site 9, bit 1) | 0.002140; 1.1005x flat; **0.9995x** window model | 1.0000 / 0.3540 / 0.1035 |
+| seed-p26 (build-6) | 2b406490ba8d3c91 | 4 from 0; 65,536 nonces each | 67,108,864 | site 3: 0x03f3960e x4 (2.0e-06); cell: 0x0f26b8e6 x3 (1.1e-05) | 0.99992 | 3.61 (site 28, bit 20) | 0.003129; 1.0183x flat; **1.0003x** window model | 1.0000 / 0.4196 / 0.1328 |
+| seed-p27 (build-6) | c38b57d654ad08d4 | 4 from 0; 65,536 nonces each | 67,108,864 | site 2: 0x031a0ba8 x4 (2.0e-06); cell: 0x01c78316 x3 (1.1e-05) | 0.99995 | -2.90 (site 8, bit 16) | 0.003348; 1.0873x flat; **1.0010x** window model | 1.0000 / 0.4343 / 0.1396 |
+| seed-p28 (build-6) | 96e4f7fdccef6fd1 | 4 from 0; 65,536 nonces each | 67,108,864 | site 2: 0x030525f1 x4 (2.0e-06); cell: 0x03149070 x3 (1.1e-05) | 0.99993 | -3.99 (site 25, bit 11) | 0.003499; 1.1396x flat; **1.0005x** window model | 1.0000 / 0.4400 / 0.1434 |
+| seed-p29 (build-6) | 3f922ac24b46d2c2 | 4 from 0; 65,536 nonces each | 67,108,864 | site 7: 0x0e92f974 x4 (2.0e-06); cell: 0x0ef15836 x3 (1.1e-05) | 0.99997 | 3.00 (site 25, bit 18) | 0.003169; 1.0326x flat; **1.0004x** window model | 1.0000 / 0.4241 / 0.1350 |
+| seed-p30 (build-6) | edd13a08477407cf | 4 from 0; 65,536 nonces each | 67,108,864 | site 0: 0x0e3a012d x4 (2.0e-06); cell: 0x0e92237a x3 (1.1e-05) | 0.99991 | 2.59 (site 4, bit 26) | 0.003348; 1.0910x flat; **0.9981x** window model | 1.0000 / 0.4343 / 0.1395 |
+| seed-p31 (build-6) | e1409749e795c382 | 4 from 0; 65,536 nonces each | 67,108,864 | site 0: 0x0d3d1622 x4 (2.0e-06); cell: 0x0f8c1753 x3 (1.1e-05) | 0.99988 | -3.23 (site 7, bit 21) | 0.003432; 1.1164x flat; **0.9992x** window model | 1.0000 / 0.4417 / 0.1425 |
+| seed-p32 (build-6) | 0717ad9158d5937f | 4 from 0; 65,536 nonces each | 67,108,864 | site 4: 0x0cd645f0 x4 (2.0e-06); cell: 0x08695fc3 x3 (1.1e-05) | 0.99993 | 3.40 (site 6, bit 2) | 0.003378; 1.1000x flat; **1.0004x** window model | 1.0000 / 0.4390 / 0.1410 |
+| seed-p33 (build-6) | 9857a41ce42f4677 | 4 from 0; 65,536 nonces each | 67,108,864 | site 2: 0x0f425fde x4 (2.0e-06); cell: 0x03846806 x3 (1.1e-05) | 0.99994 | -3.95 (site 5, bit 5) | 0.003416; 1.1112x flat; **0.9996x** window model | 1.0000 / 0.4358 / 0.1410 |
+
+Reading: on the frozen object over 2^21 hashes and eight headers (two boxes), the top 0.1 percent of items hold 0.2138 and 0.2140 percent of reads against the windowed control's 0.2141 (0.9989x and 0.9995x; the flat control 1.10x, the era windows' layer 8 by design); every site's distinct ratio 1.0001 (uniform inside its window); the worst index bit inside any window under 4 sigma; the worst address at any site 6 to 7 reads of 134 million (5e-8) and the worst cell 4 of 4 million, the Poisson maxima of a uniform stream; every one of the 16,777,216 items touched. The sixteen chain-shaped seeds under the frozen class read the same: window-model ratios 0.998 to 1.001x, flat 1.03 to 1.28x (p21's 1.28x is its window draw), min site ratio 0.99986 to 0.99997, worst bit 2.6 to 4.0 sigma, worst address 4 to 5 reads of 2 million. Nothing a cache can key on beyond the era windows, which the GPU's L2 sees as well; the cache columns (top K items by sample count) sit above the window model by the sampling noise of ranking items by count, as in the A03 census (census-packs.md section 6), and the honest cache figures are the window model's (the object's 256 MiB share 0.354 measured at 2^20 hashes per box against 0.359 from its window draw).
+
+## 2. F06's live half: the window's liveness on live data
+
+The rule (`accept::check_window_liveness`, the chain's) flips each of the 64 registers by two probe words at the start of iteration 0 on the closed form at one base nonce and requires the first load's address and the hash to change in every lane. Here the same flips run on the live dataset under the header-bound init words, over four headers and 16 warps per box on the object (4,096 probes per register per box) and two headers and 8 warps on a chain seed, with every load of every iteration traced, so the least-changed load of the first iteration is read as well as the first.
+
+| Run (box) | Program | Headers; warps | Registers x probes | First-load address changed (fraction of lanes, least live register) | Hash changed | Least-changed first-iteration load | Verdict |
+|---|---|---|---|---|---|---|---|
+| liveness-object-h0 (build-5) | 4de7b836cc40a4ea | 4 from 0; 16 warps | 64 x 4096 | 1.000000 | 1.000000 | 1.000000 at (register 0, load 0) | **LIVE** |
+| liveness-p18 (build-5) | 0b686c80e25cb4d3 | 2 from 0; 8 warps | 64 x 1024 | 1.000000 | 1.000000 | 1.000000 at (register 0, load 0) | **LIVE** |
+| liveness-object-h4 (build-6) | 4de7b836cc40a4ea | 4 from 0; 16 warps | 64 x 4096 | 1.000000 | 1.000000 | 1.000000 at (register 0, load 0) | **LIVE** |
+| liveness-p26 (build-6) | 2b406490ba8d3c91 | 2 from 0; 8 warps | 64 x 1024 | 1.000000 | 1.000000 | 1.000000 at (register 0, load 0) | **LIVE** |
+
+Reading: every one of the 64 registers moves every lane's first address and every lane's hash under every probe on live data (1.000000 at the least live register over 4,096 probes on each box), and every first-iteration load's address moves in every lane under every flip (the least-changed cell 1.000000). The construction's claim ("every one of the 64 registers is read by the address of each of the 32 loads") holds as measured on the live dataset, not only by construction.
+
+## 3. The runs, the faults, the commands
+
+Every job and every restart, with the UK clock, from the drivers' logs (the one fault of the night: my job-list writer ran in a shell that does not split an unquoted list, so the eight seed jobs per box collapsed into one line that the harness refused with exit 2 three times on each box; the lists were rewritten with explicit splitting and the sixteen seed rows ran through the same driver at 22:01; nothing in the harness or the crate moved):
+
+```
+# night driver start 21:56 UK host igneum-build-5 jobs 5
+start 1 canary-p18 21:56 UK
+end 1 canary-p18 rc 0 21:56 UK
+start 1 object-h0 21:56 UK
+end 1 object-h0 rc 0 21:59 UK
+start 1 liveness-object-h0 21:59 UK
+end 1 liveness-object-h0 rc 0 21:59 UK
+start 1 seed-p18 19 20 21 22 23 24 25 21:59 UK
+end 1 seed-p18 19 20 21 22 23 24 25 rc 2 21:59 UK
+restart 2 seed-p18 19 20 21 22 23 24 25 21:59 UK
+start 2 seed-p18 19 20 21 22 23 24 25 21:59 UK
+end 2 seed-p18 19 20 21 22 23 24 25 rc 2 21:59 UK
+restart 3 seed-p18 19 20 21 22 23 24 25 21:59 UK
+start 3 seed-p18 19 20 21 22 23 24 25 21:59 UK
+end 3 seed-p18 19 20 21 22 23 24 25 rc 2 21:59 UK
+start 1 liveness-p18 21:59 UK
+end 1 liveness-p18 rc 0 21:59 UK
+# night driver end 21:59 UK
+# night driver start 22:01 UK host igneum-build-5 jobs 8
+start 1 seed-p18 22:01 UK
+end 1 seed-p18 rc 0 22:01 UK
+start 1 seed-p19 22:01 UK
+end 1 seed-p19 rc 0 22:02 UK
+start 1 seed-p20 22:02 UK
+end 1 seed-p20 rc 0 22:03 UK
+start 1 seed-p21 22:03 UK
+end 1 seed-p21 rc 0 22:03 UK
+start 1 seed-p22 22:03 UK
+end 1 seed-p22 rc 0 22:04 UK
+start 1 seed-p23 22:04 UK
+end 1 seed-p23 rc 0 22:05 UK
+start 1 seed-p24 22:05 UK
+end 1 seed-p24 rc 0 22:05 UK
+start 1 seed-p25 22:05 UK
+end 1 seed-p25 rc 0 22:06 UK
+# night driver end 22:06 UK
+# night driver start 21:56 UK host igneum-build-6 jobs 1
+start 1 canary-p18 21:56 UK
+end 1 canary-p18 rc 0 21:56 UK
+# night driver end 21:56 UK
+# night driver start 21:56 UK host igneum-build-6 jobs 5
+start 1 object-h4 21:56 UK
+end 1 object-h4 rc 0 22:00 UK
+start 1 liveness-object-h4 22:00 UK
+end 1 liveness-object-h4 rc 0 22:00 UK
+start 1 seed-p26 27 28 29 30 31 32 33 22:00 UK
+end 1 seed-p26 27 28 29 30 31 32 33 rc 2 22:00 UK
+restart 2 seed-p26 27 28 29 30 31 32 33 22:00 UK
+start 2 seed-p26 27 28 29 30 31 32 33 22:00 UK
+end 2 seed-p26 27 28 29 30 31 32 33 rc 2 22:00 UK
+restart 3 seed-p26 27 28 29 30 31 32 33 22:00 UK
+start 3 seed-p26 27 28 29 30 31 32 33 22:00 UK
+end 3 seed-p26 27 28 29 30 31 32 33 rc 2 22:00 UK
+start 1 liveness-p26 22:00 UK
+end 1 liveness-p26 rc 0 22:00 UK
+# night driver end 22:00 UK
+# night driver start 22:01 UK host igneum-build-6 jobs 8
+start 1 seed-p26 22:01 UK
+end 1 seed-p26 rc 0 22:02 UK
+start 1 seed-p27 22:02 UK
+end 1 seed-p27 rc 0 22:02 UK
+start 1 seed-p28 22:02 UK
+end 1 seed-p28 rc 0 22:03 UK
+start 1 seed-p29 22:03 UK
+end 1 seed-p29 rc 0 22:04 UK
+start 1 seed-p30 22:04 UK
+end 1 seed-p30 rc 0 22:05 UK
+start 1 seed-p31 22:05 UK
+end 1 seed-p31 rc 0 22:06 UK
+start 1 seed-p32 22:06 UK
+end 1 seed-p32 rc 0 22:07 UK
+start 1 seed-p33 22:07 UK
+end 1 seed-p33 rc 0 22:08 UK
+# night driver end 22:08 UK
+```
+
+The commands (the lists `night-jobs-<box>.tsv` and `night-seeds-<box>.tsv` beside the rows carry every one verbatim): the object, `addrsite --count 4 --header-from <0|4> --warps 8192 --threads 32 --epoch-hex <genesis> --day-hex 69676e65756d2d6461792ffa50000000000000 --class mx8+sh256x27+state+reg64c+fold+rw --era 0:<genesis> --state node1-state.igsd1`; a seed, the same with `--seed igneum-attack-f8/program/<n> --warps 2048`; the liveness, `liveness --count 4 --header-from <0|4> --warps 16 --threads 32` with the same object arguments. Every run under `lease pool 32 --min 4 --nice 19 --class v5 --owner class-v6-census` through `night-run.sh`, pid files under `/srv/builds/v6-census/pids/` on each box.
+
+## 4. Against the one acceptance rule, and what is owed
+
+On the live dataset the frozen object reads as the closed-form census read it: uniform inside every era window to the Poisson floor, no address bit biased inside its window, the window live on every register and every load. Nothing here moves the adversary's edge: the hot half of the dataset is the era windows' (layer 8), seen by a GPU's L2 and a chip's SRAM alike. Owed: the same rows at 2^24 nonces per header (the 64 x 2^24 live point every class owes; 50 to 100 core-hours per object); a per-site LRU trace for a cache figure free of the top-K ranking's sampling inflation.
diff --git a/docs/analysis/class-v6/rows/live-dataset-census-1a938abe4/build-5/liveness-object-h0.tsv b/docs/analysis/class-v6/rows/live-dataset-census-1a938abe4/build-5/liveness-object-h0.tsv
new file mode 100644
index 000000000..176a2c8ba
--- /dev/null
+++ b/docs/analysis/class-v6/rows/live-dataset-census-1a938abe4/build-5/liveness-object-h0.tsv
@@ -0,0 +1,67 @@
+# liveness: program 4de7b836cc40a4ea class mx8-erad810f22d+sh256x27+state+reg64c+fold+rw registers 64 day bytes:69676e65756d2d6461792ffa50000000000000 dataset 2^28 words (memory-hard) headers 4 warps 16 threads 32 probe words 2
+reg	probes	first_load_changed	hash_changed	least_changed_load	least_changed_frac
+0	4096	1.000000	1.000000	0	1.000000
+1	4096	1.000000	1.000000	0	1.000000
+2	4096	1.000000	1.000000	0	1.000000
+3	4096	1.000000	1.000000	0	1.000000
+4	4096	1.000000	1.000000	0	1.000000
+5	4096	1.000000	1.000000	0	1.000000
+6	4096	1.000000	1.000000	0	1.000000
+7	4096	1.000000	1.000000	0	1.000000
+8	4096	1.000000	1.000000	0	1.000000
+9	4096	1.000000	1.000000	0	1.000000
+10	4096	1.000000	1.000000	0	1.000000
+11	4096	1.000000	1.000000	0	1.000000
+12	4096	1.000000	1.000000	0	1.000000
+13	4096	1.000000	1.000000	0	1.000000
+14	4096	1.000000	1.000000	0	1.000000
+15	4096	1.000000	1.000000	0	1.000000
+16	4096	1.000000	1.000000	0	1.000000
+17	4096	1.000000	1.000000	0	1.000000
+18	4096	1.000000	1.000000	0	1.000000
+19	4096	1.000000	1.000000	0	1.000000
+20	4096	1.000000	1.000000	0	1.000000
+21	4096	1.000000	1.000000	0	1.000000
+22	4096	1.000000	1.000000	0	1.000000
+23	4096	1.000000	1.000000	0	1.000000
+24	4096	1.000000	1.000000	0	1.000000
+25	4096	1.000000	1.000000	0	1.000000
+26	4096	1.000000	1.000000	0	1.000000
+27	4096	1.000000	1.000000	0	1.000000
+28	4096	1.000000	1.000000	0	1.000000
+29	4096	1.000000	1.000000	0	1.000000
+30	4096	1.000000	1.000000	0	1.000000
+31	4096	1.000000	1.000000	0	1.000000
+32	4096	1.000000	1.000000	0	1.000000
+33	4096	1.000000	1.000000	0	1.000000
+34	4096	1.000000	1.000000	0	1.000000
+35	4096	1.000000	1.000000	0	1.000000
+36	4096	1.000000	1.000000	0	1.000000
+37	4096	1.000000	1.000000	0	1.000000
+38	4096	1.000000	1.000000	0	1.000000
+39	4096	1.000000	1.000000	0	1.000000
+40	4096	1.000000	1.000000	0	1.000000
+41	4096	1.000000	1.000000	0	1.000000
+42	4096	1.000000	1.000000	0	1.000000
+43	4096	1.000000	1.000000	0	1.000000
+44	4096	1.000000	1.000000	0	1.000000
+45	4096	1.000000	1.000000	0	1.000000
+46	4096	1.000000	1.000000	0	1.000000
+47	4096	1.000000	1.000000	0	1.000000
+48	4096	1.000000	1.000000	0	1.000000
+49	4096	1.000000	1.000000	0	1.000000
+50	4096	1.000000	1.000000	0	1.000000
+51	4096	1.000000	1.000000	0	1.000000
+52	4096	1.000000	1.000000	0	1.000000
+53	4096	1.000000	1.000000	0	1.000000
+54	4096	1.000000	1.000000	0	1.000000
+55	4096	1.000000	1.000000	0	1.000000
+56	4096	1.000000	1.000000	0	1.000000
+57	4096	1.000000	1.000000	0	1.000000
+58	4096	1.000000	1.000000	0	1.000000
+59	4096	1.000000	1.000000	0	1.000000
+60	4096	1.000000	1.000000	0	1.000000
+61	4096	1.000000	1.000000	0	1.000000
+62	4096	1.000000	1.000000	0	1.000000
+63	4096	1.000000	1.000000	0	1.000000
+# verdict: 64 registers over 4096 probes each; first-load address changed in 1.000000 of lanes at the least live register, the hash in 1.000000; the least changed (register, first-iteration load) is (0, 0) at 1.000000; LIVE on live data (every register moves every lane's first address and hash); 6.6 s
diff --git a/docs/analysis/class-v6/rows/live-dataset-census-1a938abe4/build-5/liveness-p18.tsv b/docs/analysis/class-v6/rows/live-dataset-census-1a938abe4/build-5/liveness-p18.tsv
new file mode 100644
index 000000000..c9d329ba9
--- /dev/null
+++ b/docs/analysis/class-v6/rows/live-dataset-census-1a938abe4/build-5/liveness-p18.tsv
@@ -0,0 +1,67 @@
+# liveness: program 0b686c80e25cb4d3 class mx8-erad810f22d+sh256x27+state+reg64c+fold+rw registers 64 day 2026-10-03 dataset 2^28 words (memory-hard) headers 2 warps 8 threads 32 probe words 2
+reg	probes	first_load_changed	hash_changed	least_changed_load	least_changed_frac
+0	1024	1.000000	1.000000	0	1.000000
+1	1024	1.000000	1.000000	0	1.000000
+2	1024	1.000000	1.000000	0	1.000000
+3	1024	1.000000	1.000000	0	1.000000
+4	1024	1.000000	1.000000	0	1.000000
+5	1024	1.000000	1.000000	0	1.000000
+6	1024	1.000000	1.000000	0	1.000000
+7	1024	1.000000	1.000000	0	1.000000
+8	1024	1.000000	1.000000	0	1.000000
+9	1024	1.000000	1.000000	0	1.000000
+10	1024	1.000000	1.000000	0	1.000000
+11	1024	1.000000	1.000000	0	1.000000
+12	1024	1.000000	1.000000	0	1.000000
+13	1024	1.000000	1.000000	0	1.000000
+14	1024	1.000000	1.000000	0	1.000000
+15	1024	1.000000	1.000000	0	1.000000
+16	1024	1.000000	1.000000	0	1.000000
+17	1024	1.000000	1.000000	0	1.000000
+18	1024	1.000000	1.000000	0	1.000000
+19	1024	1.000000	1.000000	0	1.000000
+20	1024	1.000000	1.000000	0	1.000000
+21	1024	1.000000	1.000000	0	1.000000
+22	1024	1.000000	1.000000	0	1.000000
+23	1024	1.000000	1.000000	0	1.000000
+24	1024	1.000000	1.000000	0	1.000000
+25	1024	1.000000	1.000000	0	1.000000
+26	1024	1.000000	1.000000	0	1.000000
+27	1024	1.000000	1.000000	0	1.000000
+28	1024	1.000000	1.000000	0	1.000000
+29	1024	1.000000	1.000000	0	1.000000
+30	1024	1.000000	1.000000	0	1.000000
+31	1024	1.000000	1.000000	0	1.000000
+32	1024	1.000000	1.000000	0	1.000000
+33	1024	1.000000	1.000000	0	1.000000
+34	1024	1.000000	1.000000	0	1.000000
+35	1024	1.000000	1.000000	0	1.000000
+36	1024	1.000000	1.000000	0	1.000000
+37	1024	1.000000	1.000000	0	1.000000
+38	1024	1.000000	1.000000	0	1.000000
+39	1024	1.000000	1.000000	0	1.000000
+40	1024	1.000000	1.000000	0	1.000000
+41	1024	1.000000	1.000000	0	1.000000
+42	1024	1.000000	1.000000	0	1.000000
+43	1024	1.000000	1.000000	0	1.000000
+44	1024	1.000000	1.000000	0	1.000000
+45	1024	1.000000	1.000000	0	1.000000
+46	1024	1.000000	1.000000	0	1.000000
+47	1024	1.000000	1.000000	0	1.000000
+48	1024	1.000000	1.000000	0	1.000000
+49	1024	1.000000	1.000000	0	1.000000
+50	1024	1.000000	1.000000	0	1.000000
+51	1024	1.000000	1.000000	0	1.000000
+52	1024	1.000000	1.000000	0	1.000000
+53	1024	1.000000	1.000000	0	1.000000
+54	1024	1.000000	1.000000	0	1.000000
+55	1024	1.000000	1.000000	0	1.000000
+56	1024	1.000000	1.000000	0	1.000000
+57	1024	1.000000	1.000000	0	1.000000
+58	1024	1.000000	1.000000	0	1.000000
+59	1024	1.000000	1.000000	0	1.000000
+60	1024	1.000000	1.000000	0	1.000000
+61	1024	1.000000	1.000000	0	1.000000
+62	1024	1.000000	1.000000	0	1.000000
+63	1024	1.000000	1.000000	0	1.000000
+# verdict: 64 registers over 1024 probes each; first-load address changed in 1.000000 of lanes at the least live register, the hash in 1.000000; the least changed (register, first-iteration load) is (0, 0) at 1.000000; LIVE on live data (every register moves every lane's first address and hash); 2.0 s
diff --git a/docs/analysis/class-v6/rows/live-dataset-census-1a938abe4/build-5/night-jobs-5.tsv b/docs/analysis/class-v6/rows/live-dataset-census-1a938abe4/build-5/night-jobs-5.tsv
new file mode 100644
index 000000000..121b8dac5
--- /dev/null
+++ b/docs/analysis/class-v6/rows/live-dataset-census-1a938abe4/build-5/night-jobs-5.tsv
@@ -0,0 +1,5 @@
+canary-p18	# F8 form	16	env IGNEUM_FAMILY_GATE=1 /srv/builds/v6-census/bin/all4-b819c23a/igneum-pow addrsite --count 1 --warps 256 --threads 16 --seed igneum-attack-f8/program/18 --day-hex 69676e65756d2d6461792ffa50000000000000 --class mx8+sh256x27+state+reg64c+fold+rw --era 0:edc4fa844da9dc98d37e965176f6558a31560e40502ab3ae5491b21aaaabfb07 --state /srv/builds/v6-census/packs/node1-state.igsd1
+object-h0	# F8 form	32	env IGNEUM_FAMILY_GATE=1 /srv/builds/v6-census/bin/all4-b819c23a/igneum-pow addrsite --count 4 --header-from 0 --warps 8192 --threads 32 --epoch-hex edc4fa844da9dc98d37e965176f6558a31560e40502ab3ae5491b21aaaabfb07 --day-hex 69676e65756d2d6461792ffa50000000000000 --class mx8+sh256x27+state+reg64c+fold+rw --era 0:edc4fa844da9dc98d37e965176f6558a31560e40502ab3ae5491b21aaaabfb07 --state /srv/builds/v6-census/packs/node1-state.igsd1
+liveness-object-h0	# verdict	32	env IGNEUM_FAMILY_GATE=1 /srv/builds/v6-census/bin/all4-b819c23a/igneum-pow liveness --count 4 --header-from 0 --warps 16 --threads 32 --epoch-hex edc4fa844da9dc98d37e965176f6558a31560e40502ab3ae5491b21aaaabfb07 --day-hex 69676e65756d2d6461792ffa50000000000000 --class mx8+sh256x27+state+reg64c+fold+rw --era 0:edc4fa844da9dc98d37e965176f6558a31560e40502ab3ae5491b21aaaabfb07 --state /srv/builds/v6-census/packs/node1-state.igsd1
+seed-p18 19 20 21 22 23 24 25	# F8 form	32	env IGNEUM_FAMILY_GATE=1 /srv/builds/v6-census/bin/all4-b819c23a/igneum-pow addrsite --count 4 --warps 2048 --threads 32 --seed igneum-attack-f8/program/18 19 20 21 22 23 24 25 --day-hex 69676e65756d2d6461792ffa50000000000000 --class mx8+sh256x27+state+reg64c+fold+rw --era 0:edc4fa844da9dc98d37e965176f6558a31560e40502ab3ae5491b21aaaabfb07 --state /srv/builds/v6-census/packs/node1-state.igsd1
+liveness-p18	# verdict	32	env IGNEUM_FAMILY_GATE=1 /srv/builds/v6-census/bin/all4-b819c23a/igneum-pow liveness --count 2 --warps 8 --threads 32 --seed igneum-attack-f8/program/18 --day-hex 69676e65756d2d6461792ffa50000000000000 --class mx8+sh256x27+state+reg64c+fold+rw --era 0:edc4fa844da9dc98d37e965176f6558a31560e40502ab3ae5491b21aaaabfb07 --state /srv/builds/v6-census/packs/node1-state.igsd1
diff --git a/docs/analysis/class-v6/rows/live-dataset-census-1a938abe4/build-5/night-seeds-5.tsv b/docs/analysis/class-v6/rows/live-dataset-census-1a938abe4/build-5/night-seeds-5.tsv
new file mode 100644
index 000000000..02d8cb8c9
--- /dev/null
+++ b/docs/analysis/class-v6/rows/live-dataset-census-1a938abe4/build-5/night-seeds-5.tsv
@@ -0,0 +1,8 @@
+seed-p18	# F8 form	32	env IGNEUM_FAMILY_GATE=1 /srv/builds/v6-census/bin/all4-b819c23a/igneum-pow addrsite --count 4 --warps 2048 --threads 32 --seed igneum-attack-f8/program/18 --day-hex 69676e65756d2d6461792ffa50000000000000 --class mx8+sh256x27+state+reg64c+fold+rw --era 0:edc4fa844da9dc98d37e965176f6558a31560e40502ab3ae5491b21aaaabfb07 --state /srv/builds/v6-census/packs/node1-state.igsd1
+seed-p19	# F8 form	32	env IGNEUM_FAMILY_GATE=1 /srv/builds/v6-census/bin/all4-b819c23a/igneum-pow addrsite --count 4 --warps 2048 --threads 32 --seed igneum-attack-f8/program/19 --day-hex 69676e65756d2d6461792ffa50000000000000 --class mx8+sh256x27+state+reg64c+fold+rw --era 0:edc4fa844da9dc98d37e965176f6558a31560e40502ab3ae5491b21aaaabfb07 --state /srv/builds/v6-census/packs/node1-state.igsd1
+seed-p20	# F8 form	32	env IGNEUM_FAMILY_GATE=1 /srv/builds/v6-census/bin/all4-b819c23a/igneum-pow addrsite --count 4 --warps 2048 --threads 32 --seed igneum-attack-f8/program/20 --day-hex 69676e65756d2d6461792ffa50000000000000 --class mx8+sh256x27+state+reg64c+fold+rw --era 0:edc4fa844da9dc98d37e965176f6558a31560e40502ab3ae5491b21aaaabfb07 --state /srv/builds/v6-census/packs/node1-state.igsd1
+seed-p21	# F8 form	32	env IGNEUM_FAMILY_GATE=1 /srv/builds/v6-census/bin/all4-b819c23a/igneum-pow addrsite --count 4 --warps 2048 --threads 32 --seed igneum-attack-f8/program/21 --day-hex 69676e65756d2d6461792ffa50000000000000 --class mx8+sh256x27+state+reg64c+fold+rw --era 0:edc4fa844da9dc98d37e965176f6558a31560e40502ab3ae5491b21aaaabfb07 --state /srv/builds/v6-census/packs/node1-state.igsd1
+seed-p22	# F8 form	32	env IGNEUM_FAMILY_GATE=1 /srv/builds/v6-census/bin/all4-b819c23a/igneum-pow addrsite --count 4 --warps 2048 --threads 32 --seed igneum-attack-f8/program/22 --day-hex 69676e65756d2d6461792ffa50000000000000 --class mx8+sh256x27+state+reg64c+fold+rw --era 0:edc4fa844da9dc98d37e965176f6558a31560e40502ab3ae5491b21aaaabfb07 --state /srv/builds/v6-census/packs/node1-state.igsd1
+seed-p23	# F8 form	32	env IGNEUM_FAMILY_GATE=1 /srv/builds/v6-census/bin/all4-b819c23a/igneum-pow addrsite --count 4 --warps 2048 --threads 32 --seed igneum-attack-f8/program/23 --day-hex 69676e65756d2d6461792ffa50000000000000 --class mx8+sh256x27+state+reg64c+fold+rw --era 0:edc4fa844da9dc98d37e965176f6558a31560e40502ab3ae5491b21aaaabfb07 --state /srv/builds/v6-census/packs/node1-state.igsd1
+seed-p24	# F8 form	32	env IGNEUM_FAMILY_GATE=1 /srv/builds/v6-census/bin/all4-b819c23a/igneum-pow addrsite --count 4 --warps 2048 --threads 32 --seed igneum-attack-f8/program/24 --day-hex 69676e65756d2d6461792ffa50000000000000 --class mx8+sh256x27+state+reg64c+fold+rw --era 0:edc4fa844da9dc98d37e965176f6558a31560e40502ab3ae5491b21aaaabfb07 --state /srv/builds/v6-census/packs/node1-state.igsd1
+seed-p25	# F8 form	32	env IGNEUM_FAMILY_GATE=1 /srv/builds/v6-census/bin/all4-b819c23a/igneum-pow addrsite --count 4 --warps 2048 --threads 32 --seed igneum-attack-f8/program/25 --day-hex 69676e65756d2d6461792ffa50000000000000 --class mx8+sh256x27+state+reg64c+fold+rw --era 0:edc4fa844da9dc98d37e965176f6558a31560e40502ab3ae5491b21aaaabfb07 --state /srv/builds/v6-census/packs/node1-state.igsd1
diff --git a/docs/analysis/class-v6/rows/live-dataset-census-1a938abe4/build-5/object-h0.tsv b/docs/analysis/class-v6/rows/live-dataset-census-1a938abe4/build-5/object-h0.tsv
new file mode 100644
index 000000000..72a0e9067
--- /dev/null
+++ b/docs/analysis/class-v6/rows/live-dataset-census-1a938abe4/build-5/object-h0.tsv
@@ -0,0 +1,42 @@
+# addrsite: program 4de7b836cc40a4ea class mx8-erad810f22d+sh256x27+state+reg64c+fold+rw attempt 0 generator v6 day bytes:69676e65756d2d6461792ffa50000000000000 dataset 2^28 words (memory-hard) headers 4 warps 8192 nonces/header 262144 threads 32
+# per (iteration, site) cell: the most read address and its share (A03's form); cells over 0.1 percent listed
+it	site	instr	reads	distinct	top_addr	top_count	top_share
+0	0	7	1048576	1044572	0x0f281e20	3	0.000003
+0	1	7	1048576	1044538	0x0e8e8ead	3	0.000003
+# worst cell: iteration 0 site 28 address 0x0ab39b50 in 4 reads, share 0.000004
+# per site, pooled over the 8 iterations (hit rates: an ideal cache of the site's top K items, K = bytes / 64; exp = min(1, K / window items))
+site	instr	win	window_items	reads	distinct	top_addr	top_count	top_share	hit_1GiB	hit_256MiB	hit_64MiB	exp_1GiB	exp_256MiB	exp_64MiB	distinct_ratio	bit_z_max	bit
+0	7	1	8388608	8388608	8132047	0x0cdad1e9	5	0.000001	1.0000	0.8679	0.3537	1.0000	0.5000	0.1250	1.00069	2.67	23
+1	7	1	8388608	8388608	8131951	0x0de9a70a	5	0.000001	1.0000	0.8677	0.3536	1.0000	0.5000	0.1250	1.00068	2.09	24
+2	8	1	8388608	8388608	8131945	0x09d3dc61	5	0.000001	1.0000	0.8680	0.3538	1.0000	0.5000	0.1250	1.00067	-2.55	23
+3	8	1	8388608	8388608	8132094	0x0fcde01e	4	0.000000	1.0000	0.8679	0.3538	1.0000	0.5000	0.1250	1.00069	2.49	25
+4	9	0	16777216	8388608	8258704	0x0ec34d5e	4	0.000000	1.0000	0.7130	0.2827	1.0000	0.2500	0.0625	1.00014	2.10	23
+5	9	0	16777216	8388608	8258085	0x0d7c7231	4	0.000000	1.0000	0.7131	0.2827	1.0000	0.2500	0.0625	1.00007	2.35	27
+6	10	1	8388608	8388608	8131678	0x09d64ddc	5	0.000001	1.0000	0.8678	0.3536	1.0000	0.5000	0.1250	1.00064	-1.97	11
+7	10	1	8388608	8388608	8131492	0x0fc03997	5	0.000001	1.0000	0.8680	0.3537	1.0000	0.5000	0.1250	1.00062	-3.51	1
+8	11	2	4194304	8388608	7886321	0x07579830	6	0.000001	1.0000	1.0000	0.4840	1.0000	1.0000	0.2500	1.00280	-2.78	24
+9	11	2	4194304	8388608	7884408	0x07f9a1d2	6	0.000001	1.0000	1.0000	0.4842	1.0000	1.0000	0.2500	1.00255	-2.38	21
+10	13	1	8388608	8388608	8131831	0x028ad7af	5	0.000001	1.0000	0.8679	0.3537	1.0000	0.5000	0.1250	1.00066	-2.29	2
+11	13	1	8388608	8388608	8131126	0x01eca4cf	5	0.000001	1.0000	0.8680	0.3537	1.0000	0.5000	0.1250	1.00057	-2.14	17
+12	29	0	16777216	8388608	8258636	0x020fff43	4	0.000000	1.0000	0.7133	0.2827	1.0000	0.2500	0.0625	1.00013	2.45	13
+13	29	0	16777216	8388608	8258639	0x0684affd	4	0.000000	1.0000	0.7130	0.2826	1.0000	0.2500	0.0625	1.00013	-2.24	20
+14	30	1	8388608	8388608	8131030	0x0156b5af	4	0.000000	1.0000	0.8678	0.3535	1.0000	0.5000	0.1250	1.00056	2.47	24
+15	30	1	8388608	8388608	8132231	0x05d7450b	4	0.000000	1.0000	0.8679	0.3536	1.0000	0.5000	0.1250	1.00071	2.75	26
+16	31	1	8388608	8388608	8131162	0x016f2f20	5	0.000001	1.0000	0.8680	0.3538	1.0000	0.5000	0.1250	1.00058	-1.51	12
+17	31	1	8388608	8388608	8131757	0x054cc4b7	5	0.000001	1.0000	0.8681	0.3538	1.0000	0.5000	0.1250	1.00065	2.20	18
+18	44	1	8388608	8388608	8131834	0x05606f45	5	0.000001	1.0000	0.8679	0.3537	1.0000	0.5000	0.1250	1.00066	-1.64	7
+19	44	1	8388608	8388608	8131163	0x02332e6c	5	0.000001	1.0000	0.8676	0.3535	1.0000	0.5000	0.1250	1.00058	2.39	8
+20	46	1	8388608	8388608	8132339	0x0282d27f	5	0.000001	1.0000	0.8679	0.3537	1.0000	0.5000	0.1250	1.00072	-2.20	12
+21	46	1	8388608	8388608	8131591	0x04dd4e3a	4	0.000000	1.0000	0.8678	0.3535	1.0000	0.5000	0.1250	1.00063	1.57	9
+22	47	2	4194304	8388608	7885706	0x0322c452	6	0.000001	1.0000	1.0000	0.4839	1.0000	1.0000	0.2500	1.00272	2.18	17
+23	47	2	4194304	8388608	7885403	0x025ac4be	6	0.000001	1.0000	1.0000	0.4841	1.0000	1.0000	0.2500	1.00268	2.00	21
+24	52	0	16777216	8388608	8258667	0x019ac84e	4	0.000000	1.0000	0.7132	0.2827	1.0000	0.2500	0.0625	1.00014	-2.28	14
+25	52	0	16777216	8388608	8259291	0x00a62c92	4	0.000000	1.0000	0.7130	0.2827	1.0000	0.2500	0.0625	1.00021	1.64	16
+26	56	0	16777216	8388608	8258968	0x09e1fab5	4	0.000000	1.0000	0.7132	0.2827	1.0000	0.2500	0.0625	1.00017	2.02	5
+27	56	0	16777216	8388608	8258927	0x0a3d57dc	4	0.000000	1.0000	0.7131	0.2827	1.0000	0.2500	0.0625	1.00017	-2.36	11
+28	58	1	8388608	8388608	8132535	0x0fac6ffa	5	0.000001	1.0000	0.8679	0.3537	1.0000	0.5000	0.1250	1.00075	2.80	0
+29	58	1	8388608	8388608	8131321	0x08555300	4	0.000000	1.0000	0.8680	0.3537	1.0000	0.5000	0.1250	1.00060	1.61	16
+30	63	0	16777216	8388608	8259105	0x0892bf3d	4	0.000000	1.0000	0.7132	0.2827	1.0000	0.2500	0.0625	1.00019	2.28	26
+31	63	0	16777216	8388608	8258645	0x03d6fb84	4	0.000000	1.0000	0.7130	0.2826	1.0000	0.2500	0.0625	1.00013	1.74	27
+# F8 form over the live stream: top 0.1 percent of items hold 0.002138 of reads; flat control 0.001944 (ratio 1.0998x), windowed control 0.002141 (ratio 0.9989x; the gate 1.2x); min site distinct ratio 1.00007 (floors 0.98 and 0.995); worst index bit inside its window -3.51 sigma at site 7 bit 1 (the band 6)
+# program: reads 268435456, distinct items 16777198, worst site 8 address 0x07579830 in 6 reads (share 0.000001); one cache over the program's reads: 1 GiB 1.0000, 256 MiB 0.3540, 64 MiB 0.1035; the per-site ideal caches summed: 1.0000, 0.8360, 0.3478; 159.5 s
diff --git a/docs/analysis/class-v6/rows/live-dataset-census-1a938abe4/build-5/restarts.log b/docs/analysis/class-v6/rows/live-dataset-census-1a938abe4/build-5/restarts.log
new file mode 100644
index 000000000..f556f07f7
--- /dev/null
+++ b/docs/analysis/class-v6/rows/live-dataset-census-1a938abe4/build-5/restarts.log
@@ -0,0 +1,36 @@
+# night driver start 21:56 UK host igneum-build-5 jobs 5
+start 1 canary-p18 21:56 UK
+end 1 canary-p18 rc 0 21:56 UK
+start 1 object-h0 21:56 UK
+end 1 object-h0 rc 0 21:59 UK
+start 1 liveness-object-h0 21:59 UK
+end 1 liveness-object-h0 rc 0 21:59 UK
+start 1 seed-p18 19 20 21 22 23 24 25 21:59 UK
+end 1 seed-p18 19 20 21 22 23 24 25 rc 2 21:59 UK
+restart 2 seed-p18 19 20 21 22 23 24 25 21:59 UK
+start 2 seed-p18 19 20 21 22 23 24 25 21:59 UK
+end 2 seed-p18 19 20 21 22 23 24 25 rc 2 21:59 UK
+restart 3 seed-p18 19 20 21 22 23 24 25 21:59 UK
+start 3 seed-p18 19 20 21 22 23 24 25 21:59 UK
+end 3 seed-p18 19 20 21 22 23 24 25 rc 2 21:59 UK
+start 1 liveness-p18 21:59 UK
+end 1 liveness-p18 rc 0 21:59 UK
+# night driver end 21:59 UK
+# night driver start 22:01 UK host igneum-build-5 jobs 8
+start 1 seed-p18 22:01 UK
+end 1 seed-p18 rc 0 22:01 UK
+start 1 seed-p19 22:01 UK
+end 1 seed-p19 rc 0 22:02 UK
+start 1 seed-p20 22:02 UK
+end 1 seed-p20 rc 0 22:03 UK
+start 1 seed-p21 22:03 UK
+end 1 seed-p21 rc 0 22:03 UK
+start 1 seed-p22 22:03 UK
+end 1 seed-p22 rc 0 22:04 UK
+start 1 seed-p23 22:04 UK
+end 1 seed-p23 rc 0 22:05 UK
+start 1 seed-p24 22:05 UK
+end 1 seed-p24 rc 0 22:05 UK
+start 1 seed-p25 22:05 UK
+end 1 seed-p25 rc 0 22:06 UK
+# night driver end 22:06 UK
diff --git a/docs/analysis/class-v6/rows/live-dataset-census-1a938abe4/build-5/seed-p18.tsv b/docs/analysis/class-v6/rows/live-dataset-census-1a938abe4/build-5/seed-p18.tsv
new file mode 100644
index 000000000..183e9429c
--- /dev/null
+++ b/docs/analysis/class-v6/rows/live-dataset-census-1a938abe4/build-5/seed-p18.tsv
@@ -0,0 +1,42 @@
+# addrsite: program 0b686c80e25cb4d3 class mx8-erad810f22d+sh256x27+state+reg64c+fold+rw attempt 0 generator v6 day 2026-10-03 dataset 2^28 words (memory-hard) headers 4 warps 2048 nonces/header 65536 threads 32
+# per (iteration, site) cell: the most read address and its share (A03's form); cells over 0.1 percent listed
+it	site	instr	reads	distinct	top_addr	top_count	top_share
+0	0	3	262144	261876	0x000e4f1d	3	0.000011
+0	1	3	262144	261871	0x029461b8	2	0.000008
+# worst cell: iteration 0 site 0 address 0x000e4f1d in 3 reads, share 0.000011
+# per site, pooled over the 8 iterations (hit rates: an ideal cache of the site's top K items, K = bytes / 64; exp = min(1, K / window items))
+site	instr	win	window_items	reads	distinct	top_addr	top_count	top_share	hit_1GiB	hit_256MiB	hit_64MiB	exp_1GiB	exp_256MiB	exp_64MiB	distinct_ratio	bit_z_max	bit
+0	3	1	8388608	2097152	2080929	0x04b26299	4	0.000002	1.0000	1.0000	0.6154	1.0000	0.5000	0.1250	1.00008	-2.60	22
+1	3	1	8388608	2097152	2080879	0x05b4d045	3	0.000001	1.0000	1.0000	0.6154	1.0000	0.5000	0.1250	1.00005	-2.51	18
+2	6	0	16777216	2097152	2089195	0x0e4e082d	3	0.000001	1.0000	1.0000	0.5598	1.0000	0.2500	0.0625	1.00011	-1.82	22
+3	6	0	16777216	2097152	2089046	0x01dc5cc3	3	0.000001	1.0000	1.0000	0.5599	1.0000	0.2500	0.0625	1.00004	-1.95	9
+4	11	1	8388608	2097152	2080698	0x0b201331	3	0.000001	1.0000	1.0000	0.6154	1.0000	0.5000	0.1250	0.99997	-1.88	21
+5	11	1	8388608	2097152	2080934	0x0fde6798	3	0.000001	1.0000	1.0000	0.6155	1.0000	0.5000	0.1250	1.00008	-2.87	7
+6	18	2	4194304	2097152	2064883	0x00482c0a	4	0.000002	1.0000	1.0000	0.7130	1.0000	1.0000	0.2500	1.00024	1.85	17
+7	18	2	4194304	2097152	2064474	0x02002d3b	4	0.000002	1.0000	1.0000	0.7127	1.0000	1.0000	0.2500	1.00004	2.09	17
+8	27	2	4194304	2097152	2064914	0x066b8f5f	4	0.000002	1.0000	1.0000	0.7132	1.0000	1.0000	0.2500	1.00026	-2.61	3
+9	27	2	4194304	2097152	2064236	0x04666edb	4	0.000002	1.0000	1.0000	0.7132	1.0000	1.0000	0.2500	0.99993	3.08	19
+10	34	2	4194304	2097152	2064642	0x000d13e3	3	0.000001	1.0000	1.0000	0.7129	1.0000	1.0000	0.2500	1.00012	2.44	14
+11	34	2	4194304	2097152	2064513	0x0214c14a	4	0.000002	1.0000	1.0000	0.7133	1.0000	1.0000	0.2500	1.00006	-1.94	17
+12	37	1	8388608	2097152	2080803	0x060b2662	3	0.000001	1.0000	1.0000	0.6153	1.0000	0.5000	0.1250	1.00002	-2.47	19
+13	37	1	8388608	2097152	2080758	0x0331a9a9	3	0.000001	1.0000	1.0000	0.6151	1.0000	0.5000	0.1250	1.00000	-2.26	13
+14	40	2	4194304	2097152	2064723	0x0d1e0fd4	4	0.000002	1.0000	1.0000	0.7132	1.0000	1.0000	0.2500	1.00016	-2.98	6
+15	40	2	4194304	2097152	2064774	0x0ec5a875	4	0.000002	1.0000	1.0000	0.7131	1.0000	1.0000	0.2500	1.00019	-1.61	22
+16	41	2	4194304	2097152	2064682	0x03ec6eec	4	0.000002	1.0000	1.0000	0.7131	1.0000	1.0000	0.2500	1.00014	-2.38	9
+17	41	2	4194304	2097152	2064788	0x01da8b47	3	0.000001	1.0000	1.0000	0.7131	1.0000	1.0000	0.2500	1.00020	2.55	20
+18	42	2	4194304	2097152	2064547	0x08cfd70a	4	0.000002	1.0000	1.0000	0.7127	1.0000	1.0000	0.2500	1.00008	1.76	9
+19	42	2	4194304	2097152	2064774	0x0b615202	4	0.000002	1.0000	1.0000	0.7129	1.0000	1.0000	0.2500	1.00019	1.98	6
+20	48	2	4194304	2097152	2064698	0x0cf47975	4	0.000002	1.0000	1.0000	0.7129	1.0000	1.0000	0.2500	1.00015	-2.57	10
+21	48	2	4194304	2097152	2064685	0x0cf6fe62	4	0.000002	1.0000	1.0000	0.7129	1.0000	1.0000	0.2500	1.00015	2.09	2
+22	50	0	16777216	2097152	2088969	0x00d21e2c	3	0.000001	1.0000	1.0000	0.5600	1.0000	0.2500	0.0625	1.00000	-2.30	23
+23	50	0	16777216	2097152	2088913	0x0ee7ed6f	3	0.000001	1.0000	1.0000	0.5599	1.0000	0.2500	0.0625	0.99998	-1.63	21
+24	55	2	4194304	2097152	2064704	0x0cc94d09	3	0.000001	1.0000	1.0000	0.7135	1.0000	1.0000	0.2500	1.00016	3.09	16
+25	55	2	4194304	2097152	2064810	0x0e04588b	3	0.000001	1.0000	1.0000	0.7130	1.0000	1.0000	0.2500	1.00021	1.79	23
+26	57	1	8388608	2097152	2080683	0x071707d2	4	0.000002	1.0000	1.0000	0.6152	1.0000	0.5000	0.1250	0.99996	2.26	18
+27	57	1	8388608	2097152	2080580	0x04f60cb6	3	0.000001	1.0000	1.0000	0.6151	1.0000	0.5000	0.1250	0.99991	-2.78	16
+28	60	1	8388608	2097152	2081125	0x0a64769a	3	0.000001	1.0000	1.0000	0.6153	1.0000	0.5000	0.1250	1.00017	-2.33	11
+29	60	1	8388608	2097152	2080624	0x0eada28b	3	0.000001	1.0000	1.0000	0.6152	1.0000	0.5000	0.1250	0.99993	-1.99	14
+30	62	0	16777216	2097152	2088835	0x0d3cb88c	3	0.000001	1.0000	1.0000	0.5600	1.0000	0.2500	0.0625	0.99994	1.61	15
+31	62	0	16777216	2097152	2088964	0x01baa343	3	0.000001	1.0000	1.0000	0.5601	1.0000	0.2500	0.0625	1.00000	-1.98	12
+# F8 form over the live stream: top 0.1 percent of items hold 0.003391 of reads; flat control 0.003074 (ratio 1.1032x), windowed control 0.003389 (ratio 1.0006x; the gate 1.2x); min site distinct ratio 0.99991 (floors 0.98 and 0.995); worst index bit inside its window 3.09 sigma at site 24 bit 16 (the band 6)
+# program: reads 67108864, distinct items 16288897, worst site 0 address 0x04b26299 in 4 reads (share 0.000002); one cache over the program's reads: 1 GiB 1.0000, 256 MiB 0.4404, 64 MiB 0.1414; the per-site ideal caches summed: 1.0000, 1.0000, 0.6538; 37.2 s
diff --git a/docs/analysis/class-v6/rows/live-dataset-census-1a938abe4/build-5/seed-p19.tsv b/docs/analysis/class-v6/rows/live-dataset-census-1a938abe4/build-5/seed-p19.tsv
new file mode 100644
index 000000000..1761c9040
--- /dev/null
+++ b/docs/analysis/class-v6/rows/live-dataset-census-1a938abe4/build-5/seed-p19.tsv
@@ -0,0 +1,42 @@
+# addrsite: program bf8510cd00c0c70f class mx8-erad810f22d+sh256x27+state+reg64c+fold+rw attempt 0 generator v6 day 2026-10-03 dataset 2^28 words (memory-hard) headers 4 warps 2048 nonces/header 65536 threads 32
+# per (iteration, site) cell: the most read address and its share (A03's form); cells over 0.1 percent listed
+it	site	instr	reads	distinct	top_addr	top_count	top_share
+0	0	3	262144	261655	0x0b1aa513	2	0.000008
+0	1	3	262144	261636	0x0a0aa4c2	2	0.000008
+# worst cell: iteration 0 site 2 address 0x06f0d11f in 3 reads, share 0.000011
+# per site, pooled over the 8 iterations (hit rates: an ideal cache of the site's top K items, K = bytes / 64; exp = min(1, K / window items))
+site	instr	win	window_items	reads	distinct	top_addr	top_count	top_share	hit_1GiB	hit_256MiB	hit_64MiB	exp_1GiB	exp_256MiB	exp_64MiB	distinct_ratio	bit_z_max	bit
+0	3	2	4194304	2097152	2064567	0x0813e726	4	0.000002	1.0000	1.0000	0.7131	1.0000	1.0000	0.2500	1.00009	1.97	3
+1	3	2	4194304	2097152	2064660	0x0bdd3cc7	4	0.000002	1.0000	1.0000	0.7134	1.0000	1.0000	0.2500	1.00013	-2.26	1
+2	5	2	4194304	2097152	2064744	0x06f31d4f	4	0.000002	1.0000	1.0000	0.7137	1.0000	1.0000	0.2500	1.00017	1.90	4
+3	5	2	4194304	2097152	2064476	0x04f74c73	4	0.000002	1.0000	1.0000	0.7131	1.0000	1.0000	0.2500	1.00004	-2.49	18
+4	8	0	16777216	2097152	2089084	0x0da80068	3	0.000001	1.0000	1.0000	0.5598	1.0000	0.2500	0.0625	1.00006	-2.56	15
+5	8	0	16777216	2097152	2088888	0x03c298f6	3	0.000001	1.0000	1.0000	0.5599	1.0000	0.2500	0.0625	0.99997	-1.86	27
+6	15	1	8388608	2097152	2080922	0x0cef3dd9	3	0.000001	1.0000	1.0000	0.6155	1.0000	0.5000	0.1250	1.00007	3.41	7
+7	15	1	8388608	2097152	2080961	0x0e2d839d	4	0.000002	1.0000	1.0000	0.6154	1.0000	0.5000	0.1250	1.00009	-1.93	17
+8	16	2	4194304	2097152	2064720	0x0ed37606	4	0.000002	1.0000	1.0000	0.7129	1.0000	1.0000	0.2500	1.00016	-2.29	3
+9	16	2	4194304	2097152	2064829	0x0ce21642	3	0.000001	1.0000	1.0000	0.7127	1.0000	1.0000	0.2500	1.00022	-2.40	25
+10	18	0	16777216	2097152	2088870	0x05d987d8	3	0.000001	1.0000	1.0000	0.5599	1.0000	0.2500	0.0625	0.99996	2.03	11
+11	18	0	16777216	2097152	2088983	0x029a3121	3	0.000001	1.0000	1.0000	0.5600	1.0000	0.2500	0.0625	1.00001	2.05	10
+12	20	0	16777216	2097152	2088932	0x0dadfb46	3	0.000001	1.0000	1.0000	0.5601	1.0000	0.2500	0.0625	0.99999	2.63	14
+13	20	0	16777216	2097152	2089010	0x04a10d8d	3	0.000001	1.0000	1.0000	0.5599	1.0000	0.2500	0.0625	1.00002	2.62	17
+14	24	0	16777216	2097152	2088971	0x0b3f9d83	3	0.000001	1.0000	1.0000	0.5601	1.0000	0.2500	0.0625	1.00001	-2.54	21
+15	24	0	16777216	2097152	2088658	0x0a5d1395	3	0.000001	1.0000	1.0000	0.5604	1.0000	0.2500	0.0625	0.99986	2.46	20
+16	28	1	8388608	2097152	2080835	0x0da33a05	3	0.000001	1.0000	1.0000	0.6149	1.0000	0.5000	0.1250	1.00003	2.25	17
+17	28	1	8388608	2097152	2080764	0x0cab0080	4	0.000002	1.0000	1.0000	0.6152	1.0000	0.5000	0.1250	1.00000	2.18	20
+18	29	1	8388608	2097152	2080979	0x056d2902	3	0.000001	1.0000	1.0000	0.6152	1.0000	0.5000	0.1250	1.00010	-1.88	9
+19	29	1	8388608	2097152	2080906	0x02f221f1	3	0.000001	1.0000	1.0000	0.6155	1.0000	0.5000	0.1250	1.00007	2.67	3
+20	35	1	8388608	2097152	2080716	0x0a2c3876	3	0.000001	1.0000	1.0000	0.6150	1.0000	0.5000	0.1250	0.99998	-2.34	22
+21	35	1	8388608	2097152	2080861	0x0ab58865	3	0.000001	1.0000	1.0000	0.6151	1.0000	0.5000	0.1250	1.00004	3.51	1
+22	41	1	8388608	2097152	2081104	0x0d4373fb	3	0.000001	1.0000	1.0000	0.6151	1.0000	0.5000	0.1250	1.00016	-2.57	5
+23	41	1	8388608	2097152	2080795	0x0e0c41fb	3	0.000001	1.0000	1.0000	0.6153	1.0000	0.5000	0.1250	1.00001	-1.83	6
+24	52	2	4194304	2097152	2064791	0x0b08686d	4	0.000002	1.0000	1.0000	0.7133	1.0000	1.0000	0.2500	1.00020	2.41	17
+25	52	2	4194304	2097152	2064688	0x0a04c3d9	4	0.000002	1.0000	1.0000	0.7130	1.0000	1.0000	0.2500	1.00015	-2.02	0
+26	54	2	4194304	2097152	2064789	0x03fcf023	4	0.000002	1.0000	1.0000	0.7126	1.0000	1.0000	0.2500	1.00020	-3.04	17
+27	54	2	4194304	2097152	2064622	0x03abef8c	4	0.000002	1.0000	1.0000	0.7129	1.0000	1.0000	0.2500	1.00012	-2.57	4
+28	55	0	16777216	2097152	2088972	0x017e612a	3	0.000001	1.0000	1.0000	0.5601	1.0000	0.2500	0.0625	1.00001	1.96	10
+29	55	0	16777216	2097152	2089045	0x02c2382b	3	0.000001	1.0000	1.0000	0.5598	1.0000	0.2500	0.0625	1.00004	-3.81	7
+30	62	0	16777216	2097152	2088837	0x07a76cac	3	0.000001	1.0000	1.0000	0.5599	1.0000	0.2500	0.0625	0.99994	1.85	7
+31	62	0	16777216	2097152	2089047	0x0b01583f	3	0.000001	1.0000	1.0000	0.5602	1.0000	0.2500	0.0625	1.00004	-1.68	20
+# F8 form over the live stream: top 0.1 percent of items hold 0.003433 of reads; flat control 0.003076 (ratio 1.1159x), windowed control 0.003434 (ratio 0.9996x; the gate 1.2x); min site distinct ratio 0.99986 (floors 0.98 and 0.995); worst index bit inside its window -3.81 sigma at site 29 bit 7 (the band 6)
+# program: reads 67108864, distinct items 16295371, worst site 0 address 0x0813e726 in 4 reads (share 0.000002); one cache over the program's reads: 1 GiB 1.0000, 256 MiB 0.4418, 64 MiB 0.1426; the per-site ideal caches summed: 1.0000, 1.0000, 0.6251; 37.5 s
diff --git a/docs/analysis/class-v6/rows/live-dataset-census-1a938abe4/build-5/seed-p20.tsv b/docs/analysis/class-v6/rows/live-dataset-census-1a938abe4/build-5/seed-p20.tsv
new file mode 100644
index 000000000..c80acded6
--- /dev/null
+++ b/docs/analysis/class-v6/rows/live-dataset-census-1a938abe4/build-5/seed-p20.tsv
@@ -0,0 +1,42 @@
+# addrsite: program 24133bd7265e958f class mx8-erad810f22d+sh256x27+state+reg64c+fold+rw attempt 0 generator v6 day 2026-10-03 dataset 2^28 words (memory-hard) headers 4 warps 2048 nonces/header 65536 threads 32
+# per (iteration, site) cell: the most read address and its share (A03's form); cells over 0.1 percent listed
+it	site	instr	reads	distinct	top_addr	top_count	top_share
+0	0	7	262144	261885	0x0343ee61	2	0.000008
+0	1	7	262144	261881	0x00f22a5f	2	0.000008
+# worst cell: iteration 0 site 2 address 0x0ae65aa6 in 3 reads, share 0.000011
+# per site, pooled over the 8 iterations (hit rates: an ideal cache of the site's top K items, K = bytes / 64; exp = min(1, K / window items))
+site	instr	win	window_items	reads	distinct	top_addr	top_count	top_share	hit_1GiB	hit_256MiB	hit_64MiB	exp_1GiB	exp_256MiB	exp_64MiB	distinct_ratio	bit_z_max	bit
+0	7	1	8388608	2097152	2080652	0x07d93627	3	0.000001	1.0000	1.0000	0.6149	1.0000	0.5000	0.1250	0.99994	2.09	15
+1	7	1	8388608	2097152	2080868	0x0686b399	3	0.000001	1.0000	1.0000	0.6152	1.0000	0.5000	0.1250	1.00005	1.62	1
+2	12	2	4194304	2097152	2064729	0x09d4fb1a	4	0.000002	1.0000	1.0000	0.7132	1.0000	1.0000	0.2500	1.00017	2.72	22
+3	12	2	4194304	2097152	2064685	0x091bcddd	4	0.000002	1.0000	1.0000	0.7132	1.0000	1.0000	0.2500	1.00015	-2.57	4
+4	16	0	16777216	2097152	2088927	0x091db95c	3	0.000001	1.0000	1.0000	0.5596	1.0000	0.2500	0.0625	0.99998	2.37	24
+5	16	0	16777216	2097152	2089036	0x089bc5e3	3	0.000001	1.0000	1.0000	0.5601	1.0000	0.2500	0.0625	1.00004	-2.18	3
+6	21	2	4194304	2097152	2064914	0x09526974	4	0.000002	1.0000	1.0000	0.7128	1.0000	1.0000	0.2500	1.00026	-1.99	5
+7	21	2	4194304	2097152	2065025	0x08d25517	4	0.000002	1.0000	1.0000	0.7129	1.0000	1.0000	0.2500	1.00031	2.32	15
+8	23	1	8388608	2097152	2080988	0x0e5dde91	3	0.000001	1.0000	1.0000	0.6150	1.0000	0.5000	0.1250	1.00011	-1.78	23
+9	23	1	8388608	2097152	2081037	0x0bdf5845	3	0.000001	1.0000	1.0000	0.6152	1.0000	0.5000	0.1250	1.00013	2.36	3
+10	26	1	8388608	2097152	2080754	0x003b1a48	4	0.000002	1.0000	1.0000	0.6156	1.0000	0.5000	0.1250	0.99999	2.56	8
+11	26	1	8388608	2097152	2080983	0x06b45091	3	0.000001	1.0000	1.0000	0.6151	1.0000	0.5000	0.1250	1.00010	-1.90	25
+12	31	0	16777216	2097152	2088910	0x0aa4ae37	3	0.000001	1.0000	1.0000	0.5601	1.0000	0.2500	0.0625	0.99998	-2.29	24
+13	31	0	16777216	2097152	2088934	0x081c8307	3	0.000001	1.0000	1.0000	0.5601	1.0000	0.2500	0.0625	0.99999	2.01	16
+14	37	0	16777216	2097152	2089016	0x0d26ec54	3	0.000001	1.0000	1.0000	0.5600	1.0000	0.2500	0.0625	1.00003	-2.15	12
+15	37	0	16777216	2097152	2088952	0x06846339	3	0.000001	1.0000	1.0000	0.5600	1.0000	0.2500	0.0625	1.00000	-2.47	7
+16	42	2	4194304	2097152	2064723	0x0fdf72bf	4	0.000002	1.0000	1.0000	0.7132	1.0000	1.0000	0.2500	1.00016	2.56	19
+17	42	2	4194304	2097152	2064835	0x0eac09aa	3	0.000001	1.0000	1.0000	0.7132	1.0000	1.0000	0.2500	1.00022	-2.12	10
+18	50	2	4194304	2097152	2065072	0x01c5480c	4	0.000002	1.0000	1.0000	0.7128	1.0000	1.0000	0.2500	1.00033	2.89	21
+19	50	2	4194304	2097152	2064560	0x02d4382d	4	0.000002	1.0000	1.0000	0.7131	1.0000	1.0000	0.2500	1.00009	2.32	7
+20	52	1	8388608	2097152	2080693	0x0465e729	3	0.000001	1.0000	1.0000	0.6152	1.0000	0.5000	0.1250	0.99996	2.31	17
+21	52	1	8388608	2097152	2080994	0x0326cf51	4	0.000002	1.0000	1.0000	0.6156	1.0000	0.5000	0.1250	1.00011	2.95	6
+22	55	1	8388608	2097152	2080816	0x00faef0c	3	0.000001	1.0000	1.0000	0.6152	1.0000	0.5000	0.1250	1.00002	3.53	8
+23	55	1	8388608	2097152	2080759	0x02721691	3	0.000001	1.0000	1.0000	0.6152	1.0000	0.5000	0.1250	1.00000	-2.40	26
+24	56	1	8388608	2097152	2080758	0x035ae275	3	0.000001	1.0000	1.0000	0.6154	1.0000	0.5000	0.1250	1.00000	2.13	5
+25	56	1	8388608	2097152	2080689	0x05953052	4	0.000002	1.0000	1.0000	0.6154	1.0000	0.5000	0.1250	0.99996	2.28	21
+26	57	2	4194304	2097152	2064382	0x09a2e80e	4	0.000002	1.0000	1.0000	0.7132	1.0000	1.0000	0.2500	1.00000	1.70	20
+27	57	2	4194304	2097152	2064898	0x086ecbc9	4	0.000002	1.0000	1.0000	0.7132	1.0000	1.0000	0.2500	1.00025	1.86	9
+28	59	2	4194304	2097152	2064762	0x02cf86d2	4	0.000002	1.0000	1.0000	0.7127	1.0000	1.0000	0.2500	1.00018	-1.49	22
+29	59	2	4194304	2097152	2064911	0x008d0c7b	4	0.000002	1.0000	1.0000	0.7127	1.0000	1.0000	0.2500	1.00026	2.31	20
+30	61	0	16777216	2097152	2088933	0x0e8cac4a	4	0.000002	1.0000	1.0000	0.5600	1.0000	0.2500	0.0625	0.99999	-3.55	0
+31	61	0	16777216	2097152	2089107	0x0278742c	3	0.000001	1.0000	1.0000	0.5599	1.0000	0.2500	0.0625	1.00007	1.93	26
+# F8 form over the live stream: top 0.1 percent of items hold 0.003434 of reads; flat control 0.003073 (ratio 1.1175x), windowed control 0.003433 (ratio 1.0003x; the gate 1.2x); min site distinct ratio 0.99994 (floors 0.98 and 0.995); worst index bit inside its window -3.55 sigma at site 30 bit 0 (the band 6)
+# program: reads 67108864, distinct items 16241632, worst site 2 address 0x09d4fb1a in 4 reads (share 0.000002); one cache over the program's reads: 1 GiB 1.0000, 256 MiB 0.4443, 64 MiB 0.1429; the per-site ideal caches summed: 1.0000, 1.0000, 0.6381; 37.2 s
diff --git a/docs/analysis/class-v6/rows/live-dataset-census-1a938abe4/build-5/seed-p21.tsv b/docs/analysis/class-v6/rows/live-dataset-census-1a938abe4/build-5/seed-p21.tsv
new file mode 100644
index 000000000..593a137d8
--- /dev/null
+++ b/docs/analysis/class-v6/rows/live-dataset-census-1a938abe4/build-5/seed-p21.tsv
@@ -0,0 +1,42 @@
+# addrsite: program ed647abf60a5bd32 class mx8-erad810f22d+sh256x27+state+reg64c+fold+rw attempt 0 generator v6 day 2026-10-03 dataset 2^28 words (memory-hard) headers 4 warps 2048 nonces/header 65536 threads 32
+# per (iteration, site) cell: the most read address and its share (A03's form); cells over 0.1 percent listed
+it	site	instr	reads	distinct	top_addr	top_count	top_share
+0	0	2	262144	261872	0x05f8d1aa	2	0.000008
+0	1	2	262144	261875	0x03973640	3	0.000011
+# worst cell: iteration 0 site 1 address 0x03973640 in 3 reads, share 0.000011
+# per site, pooled over the 8 iterations (hit rates: an ideal cache of the site's top K items, K = bytes / 64; exp = min(1, K / window items))
+site	instr	win	window_items	reads	distinct	top_addr	top_count	top_share	hit_1GiB	hit_256MiB	hit_64MiB	exp_1GiB	exp_256MiB	exp_64MiB	distinct_ratio	bit_z_max	bit
+0	2	1	8388608	2097152	2080802	0x04e14ec7	4	0.000002	1.0000	1.0000	0.6151	1.0000	0.5000	0.1250	1.00002	-2.58	25
+1	2	1	8388608	2097152	2080971	0x04211450	3	0.000001	1.0000	1.0000	0.6151	1.0000	0.5000	0.1250	1.00010	-2.65	21
+2	3	1	8388608	2097152	2080923	0x023d7abf	3	0.000001	1.0000	1.0000	0.6151	1.0000	0.5000	0.1250	1.00007	2.18	5
+3	3	1	8388608	2097152	2080683	0x04a06101	4	0.000002	1.0000	1.0000	0.6156	1.0000	0.5000	0.1250	0.99996	3.13	20
+4	7	0	16777216	2097152	2089101	0x052b5c58	3	0.000001	1.0000	1.0000	0.5600	1.0000	0.2500	0.0625	1.00007	2.28	12
+5	7	0	16777216	2097152	2088894	0x0ea8f6e0	4	0.000002	1.0000	1.0000	0.5602	1.0000	0.2500	0.0625	0.99997	-1.63	2
+6	9	2	4194304	2097152	2064761	0x01cfdee9	4	0.000002	1.0000	1.0000	0.7128	1.0000	1.0000	0.2500	1.00018	-1.55	24
+7	9	2	4194304	2097152	2064803	0x032825af	3	0.000001	1.0000	1.0000	0.7132	1.0000	1.0000	0.2500	1.00020	-1.84	8
+8	10	0	16777216	2097152	2088925	0x08f54043	3	0.000001	1.0000	1.0000	0.5599	1.0000	0.2500	0.0625	0.99998	2.69	21
+9	10	0	16777216	2097152	2088838	0x0ee50520	3	0.000001	1.0000	1.0000	0.5599	1.0000	0.2500	0.0625	0.99994	3.05	2
+10	27	0	16777216	2097152	2088759	0x0bd61849	3	0.000001	1.0000	1.0000	0.5596	1.0000	0.2500	0.0625	0.99990	-2.66	22
+11	27	0	16777216	2097152	2088929	0x0e72d133	3	0.000001	1.0000	1.0000	0.5600	1.0000	0.2500	0.0625	0.99999	3.90	9
+12	31	2	4194304	2097152	2064623	0x01d8e0aa	4	0.000002	1.0000	1.0000	0.7130	1.0000	1.0000	0.2500	1.00012	-2.24	12
+13	31	2	4194304	2097152	2064847	0x0027fdfb	4	0.000002	1.0000	1.0000	0.7132	1.0000	1.0000	0.2500	1.00022	-2.39	22
+14	33	0	16777216	2097152	2088973	0x04d07c60	3	0.000001	1.0000	1.0000	0.5602	1.0000	0.2500	0.0625	1.00001	-2.74	13
+15	33	0	16777216	2097152	2088959	0x002b5d5d	3	0.000001	1.0000	1.0000	0.5600	1.0000	0.2500	0.0625	1.00000	2.46	19
+16	36	1	8388608	2097152	2080712	0x05de5e64	4	0.000002	1.0000	1.0000	0.6156	1.0000	0.5000	0.1250	0.99997	1.81	3
+17	36	1	8388608	2097152	2080944	0x06b26a12	4	0.000002	1.0000	1.0000	0.6149	1.0000	0.5000	0.1250	1.00008	2.26	21
+18	38	2	4194304	2097152	2064895	0x0a4b211d	4	0.000002	1.0000	1.0000	0.7131	1.0000	1.0000	0.2500	1.00025	-2.38	6
+19	38	2	4194304	2097152	2064767	0x0b1e9590	4	0.000002	1.0000	1.0000	0.7131	1.0000	1.0000	0.2500	1.00019	-2.15	25
+20	43	2	4194304	2097152	2064538	0x00002183	4	0.000002	1.0000	1.0000	0.7127	1.0000	1.0000	0.2500	1.00007	2.47	15
+21	43	2	4194304	2097152	2064785	0x00f2fa9c	4	0.000002	1.0000	1.0000	0.7131	1.0000	1.0000	0.2500	1.00019	1.40	24
+22	45	0	16777216	2097152	2088974	0x0232deed	3	0.000001	1.0000	1.0000	0.5599	1.0000	0.2500	0.0625	1.00001	-2.78	10
+23	45	0	16777216	2097152	2088823	0x082dfbc8	3	0.000001	1.0000	1.0000	0.5602	1.0000	0.2500	0.0625	0.99993	-2.57	12
+24	46	1	8388608	2097152	2080831	0x05307add	3	0.000001	1.0000	1.0000	0.6150	1.0000	0.5000	0.1250	1.00003	2.35	26
+25	46	1	8388608	2097152	2080972	0x02c7003f	3	0.000001	1.0000	1.0000	0.6150	1.0000	0.5000	0.1250	1.00010	-2.73	13
+26	49	2	4194304	2097152	2064869	0x0ce514d8	4	0.000002	1.0000	1.0000	0.7131	1.0000	1.0000	0.2500	1.00023	3.14	1
+27	49	2	4194304	2097152	2064825	0x0d1a398d	4	0.000002	1.0000	1.0000	0.7131	1.0000	1.0000	0.2500	1.00021	-1.92	18
+28	51	1	8388608	2097152	2081035	0x036f523c	4	0.000002	1.0000	1.0000	0.6150	1.0000	0.5000	0.1250	1.00013	-2.44	22
+29	51	1	8388608	2097152	2080904	0x007d72c3	3	0.000001	1.0000	1.0000	0.6153	1.0000	0.5000	0.1250	1.00007	-2.38	17
+30	58	2	4194304	2097152	2064698	0x0fb2a665	4	0.000002	1.0000	1.0000	0.7128	1.0000	1.0000	0.2500	1.00015	-2.02	18
+31	58	2	4194304	2097152	2064756	0x0d9fb4df	4	0.000002	1.0000	1.0000	0.7130	1.0000	1.0000	0.2500	1.00018	2.81	4
+# F8 form over the live stream: top 0.1 percent of items hold 0.003920 of reads; flat control 0.003072 (ratio 1.2759x), windowed control 0.003916 (ratio 1.0008x; the gate 1.2x); min site distinct ratio 0.99990 (floors 0.98 and 0.995); worst index bit inside its window 3.90 sigma at site 11 bit 9 (the band 6)
+# program: reads 67108864, distinct items 16068557, worst site 0 address 0x04e14ec7 in 4 reads (share 0.000002); one cache over the program's reads: 1 GiB 1.0000, 256 MiB 0.4774, 64 MiB 0.1605; the per-site ideal caches summed: 1.0000, 1.0000, 0.6346; 38.1 s
diff --git a/docs/analysis/class-v6/rows/live-dataset-census-1a938abe4/build-5/seed-p22.tsv b/docs/analysis/class-v6/rows/live-dataset-census-1a938abe4/build-5/seed-p22.tsv
new file mode 100644
index 000000000..7ae5ecba7
--- /dev/null
+++ b/docs/analysis/class-v6/rows/live-dataset-census-1a938abe4/build-5/seed-p22.tsv
@@ -0,0 +1,42 @@
+# addrsite: program f8e8969443448ecb class mx8-erad810f22d+sh256x27+state+reg64c+fold+rw attempt 0 generator v6 day 2026-10-03 dataset 2^28 words (memory-hard) headers 4 warps 2048 nonces/header 65536 threads 32
+# per (iteration, site) cell: the most read address and its share (A03's form); cells over 0.1 percent listed
+it	site	instr	reads	distinct	top_addr	top_count	top_share
+0	0	10	262144	261667	0x0342068e	3	0.000011
+0	1	10	262144	261665	0x037fe51f	2	0.000008
+# worst cell: iteration 0 site 0 address 0x0342068e in 3 reads, share 0.000011
+# per site, pooled over the 8 iterations (hit rates: an ideal cache of the site's top K items, K = bytes / 64; exp = min(1, K / window items))
+site	instr	win	window_items	reads	distinct	top_addr	top_count	top_share	hit_1GiB	hit_256MiB	hit_64MiB	exp_1GiB	exp_256MiB	exp_64MiB	distinct_ratio	bit_z_max	bit
+0	10	2	4194304	2097152	2064542	0x015c50c8	4	0.000002	1.0000	1.0000	0.7135	1.0000	1.0000	0.2500	1.00008	1.73	11
+1	10	2	4194304	2097152	2064770	0x020b2e49	4	0.000002	1.0000	1.0000	0.7129	1.0000	1.0000	0.2500	1.00019	1.63	7
+2	16	0	16777216	2097152	2089059	0x06fd1db0	3	0.000001	1.0000	1.0000	0.5601	1.0000	0.2500	0.0625	1.00005	2.34	17
+3	16	0	16777216	2097152	2088990	0x07e58ba5	3	0.000001	1.0000	1.0000	0.5599	1.0000	0.2500	0.0625	1.00001	-2.10	10
+4	17	0	16777216	2097152	2088994	0x0fd5d743	3	0.000001	1.0000	1.0000	0.5599	1.0000	0.2500	0.0625	1.00002	-1.94	25
+5	17	0	16777216	2097152	2089076	0x00f95406	3	0.000001	1.0000	1.0000	0.5600	1.0000	0.2500	0.0625	1.00006	-1.74	10
+6	21	2	4194304	2097152	2064659	0x06a054ca	5	0.000002	1.0000	1.0000	0.7131	1.0000	1.0000	0.2500	1.00013	-1.93	6
+7	21	2	4194304	2097152	2064885	0x05a7e0c2	3	0.000001	1.0000	1.0000	0.7129	1.0000	1.0000	0.2500	1.00024	2.54	1
+8	23	1	8388608	2097152	2080870	0x0b827be5	3	0.000001	1.0000	1.0000	0.6153	1.0000	0.5000	0.1250	1.00005	2.19	17
+9	23	1	8388608	2097152	2080956	0x0c78df5f	3	0.000001	1.0000	1.0000	0.6151	1.0000	0.5000	0.1250	1.00009	-2.98	8
+10	28	0	16777216	2097152	2088984	0x0cb359c8	3	0.000001	1.0000	1.0000	0.5599	1.0000	0.2500	0.0625	1.00001	-2.26	18
+11	28	0	16777216	2097152	2088903	0x0638beab	3	0.000001	1.0000	1.0000	0.5600	1.0000	0.2500	0.0625	0.99997	1.54	2
+12	29	0	16777216	2097152	2088841	0x01838b36	3	0.000001	1.0000	1.0000	0.5599	1.0000	0.2500	0.0625	0.99994	-2.28	4
+13	29	0	16777216	2097152	2088956	0x0e442134	3	0.000001	1.0000	1.0000	0.5599	1.0000	0.2500	0.0625	1.00000	3.31	19
+14	33	1	8388608	2097152	2080793	0x001b8dc0	4	0.000002	1.0000	1.0000	0.6151	1.0000	0.5000	0.1250	1.00001	-2.16	11
+15	33	1	8388608	2097152	2081029	0x04edfa10	3	0.000001	1.0000	1.0000	0.6153	1.0000	0.5000	0.1250	1.00013	2.26	24
+16	34	0	16777216	2097152	2089107	0x0dd04c77	3	0.000001	1.0000	1.0000	0.5598	1.0000	0.2500	0.0625	1.00007	2.56	13
+17	34	0	16777216	2097152	2088893	0x0ae5097a	3	0.000001	1.0000	1.0000	0.5599	1.0000	0.2500	0.0625	0.99997	-2.69	19
+18	35	0	16777216	2097152	2089009	0x0bb3b40d	3	0.000001	1.0000	1.0000	0.5601	1.0000	0.2500	0.0625	1.00002	-2.43	23
+19	35	0	16777216	2097152	2088933	0x070a0621	3	0.000001	1.0000	1.0000	0.5601	1.0000	0.2500	0.0625	0.99999	-2.19	24
+20	37	0	16777216	2097152	2089027	0x03099106	3	0.000001	1.0000	1.0000	0.5598	1.0000	0.2500	0.0625	1.00003	2.22	7
+21	37	0	16777216	2097152	2088999	0x08d383ff	3	0.000001	1.0000	1.0000	0.5599	1.0000	0.2500	0.0625	1.00002	-1.53	13
+22	40	1	8388608	2097152	2081031	0x0e4fb3b6	4	0.000002	1.0000	1.0000	0.6154	1.0000	0.5000	0.1250	1.00013	2.33	15
+23	40	1	8388608	2097152	2080995	0x0d096fc6	3	0.000001	1.0000	1.0000	0.6154	1.0000	0.5000	0.1250	1.00011	-1.96	24
+24	41	1	8388608	2097152	2080943	0x02b4d894	3	0.000001	1.0000	1.0000	0.6154	1.0000	0.5000	0.1250	1.00008	-2.94	22
+25	41	1	8388608	2097152	2080678	0x054cd53d	3	0.000001	1.0000	1.0000	0.6153	1.0000	0.5000	0.1250	0.99996	-2.78	8
+26	54	2	4194304	2097152	2064942	0x07779f4e	4	0.000002	1.0000	1.0000	0.7125	1.0000	1.0000	0.2500	1.00027	1.74	11
+27	54	2	4194304	2097152	2064927	0x076d6cc7	4	0.000002	1.0000	1.0000	0.7130	1.0000	1.0000	0.2500	1.00026	-1.95	22
+28	61	0	16777216	2097152	2089030	0x0bed0704	3	0.000001	1.0000	1.0000	0.5598	1.0000	0.2500	0.0625	1.00003	-1.96	8
+29	61	0	16777216	2097152	2088963	0x0192583c	3	0.000001	1.0000	1.0000	0.5599	1.0000	0.2500	0.0625	1.00000	2.10	26
+30	62	2	4194304	2097152	2064643	0x0cad5999	4	0.000002	1.0000	1.0000	0.7130	1.0000	1.0000	0.2500	1.00013	2.80	22
+31	62	2	4194304	2097152	2064563	0x0c00d56f	4	0.000002	1.0000	1.0000	0.7127	1.0000	1.0000	0.2500	1.00009	2.03	6
+# F8 form over the live stream: top 0.1 percent of items hold 0.003237 of reads; flat control 0.003071 (ratio 1.0540x), windowed control 0.003238 (ratio 0.9997x; the gate 1.2x); min site distinct ratio 0.99994 (floors 0.98 and 0.995); worst index bit inside its window 3.31 sigma at site 13 bit 19 (the band 6)
+# program: reads 67108864, distinct items 16386023, worst site 6 address 0x06a054ca in 5 reads (share 0.000002); one cache over the program's reads: 1 GiB 1.0000, 256 MiB 0.4271, 64 MiB 0.1370; the per-site ideal caches summed: 1.0000, 1.0000, 0.6120; 37.5 s
diff --git a/docs/analysis/class-v6/rows/live-dataset-census-1a938abe4/build-5/seed-p23.tsv b/docs/analysis/class-v6/rows/live-dataset-census-1a938abe4/build-5/seed-p23.tsv
new file mode 100644
index 000000000..edac89cfc
--- /dev/null
+++ b/docs/analysis/class-v6/rows/live-dataset-census-1a938abe4/build-5/seed-p23.tsv
@@ -0,0 +1,42 @@
+# addrsite: program 160649503341aaab class mx8-erad810f22d+sh256x27+state+reg64c+fold+rw attempt 1 generator v6 day 2026-10-03 dataset 2^28 words (memory-hard) headers 4 warps 2048 nonces/header 65536 threads 32
+# per (iteration, site) cell: the most read address and its share (A03's form); cells over 0.1 percent listed
+it	site	instr	reads	distinct	top_addr	top_count	top_share
+0	0	1	262144	261626	0x0c36e229	2	0.000008
+0	1	1	262144	261575	0x0c4df63a	2	0.000008
+# worst cell: iteration 0 site 5 address 0x051243d9 in 3 reads, share 0.000011
+# per site, pooled over the 8 iterations (hit rates: an ideal cache of the site's top K items, K = bytes / 64; exp = min(1, K / window items))
+site	instr	win	window_items	reads	distinct	top_addr	top_count	top_share	hit_1GiB	hit_256MiB	hit_64MiB	exp_1GiB	exp_256MiB	exp_64MiB	distinct_ratio	bit_z_max	bit
+0	1	2	4194304	2097152	2064620	0x0f20f08a	3	0.000001	1.0000	1.0000	0.7130	1.0000	1.0000	0.2500	1.00011	-1.75	0
+1	1	2	4194304	2097152	2064664	0x0e3c2793	4	0.000002	1.0000	1.0000	0.7129	1.0000	1.0000	0.2500	1.00014	-2.22	24
+2	8	1	8388608	2097152	2080742	0x05aa1636	3	0.000001	1.0000	1.0000	0.6153	1.0000	0.5000	0.1250	0.99999	2.43	4
+3	8	1	8388608	2097152	2080803	0x0174c4bf	3	0.000001	1.0000	1.0000	0.6151	1.0000	0.5000	0.1250	1.00002	2.23	5
+4	9	0	16777216	2097152	2089015	0x07bfc86f	3	0.000001	1.0000	1.0000	0.5602	1.0000	0.2500	0.0625	1.00003	2.56	3
+5	9	0	16777216	2097152	2089059	0x027b30bc	3	0.000001	1.0000	1.0000	0.5599	1.0000	0.2500	0.0625	1.00005	2.13	11
+6	13	1	8388608	2097152	2080752	0x08a9e70c	3	0.000001	1.0000	1.0000	0.6153	1.0000	0.5000	0.1250	0.99999	-1.82	22
+7	13	1	8388608	2097152	2080802	0x0d6c89d5	3	0.000001	1.0000	1.0000	0.6151	1.0000	0.5000	0.1250	1.00002	2.45	0
+8	22	0	16777216	2097152	2089102	0x07323aba	3	0.000001	1.0000	1.0000	0.5602	1.0000	0.2500	0.0625	1.00007	-2.58	8
+9	22	0	16777216	2097152	2089143	0x0a707102	3	0.000001	1.0000	1.0000	0.5601	1.0000	0.2500	0.0625	1.00009	-2.02	24
+10	26	2	4194304	2097152	2064711	0x0f35989a	4	0.000002	1.0000	1.0000	0.7132	1.0000	1.0000	0.2500	1.00016	-2.87	25
+11	26	2	4194304	2097152	2064898	0x0e10140d	4	0.000002	1.0000	1.0000	0.7133	1.0000	1.0000	0.2500	1.00025	-2.79	1
+12	33	0	16777216	2097152	2088937	0x0cc52d13	3	0.000001	1.0000	1.0000	0.5599	1.0000	0.2500	0.0625	0.99999	-1.77	0
+13	33	0	16777216	2097152	2089065	0x0451d2fd	3	0.000001	1.0000	1.0000	0.5599	1.0000	0.2500	0.0625	1.00005	-2.38	13
+14	34	1	8388608	2097152	2080864	0x0a1af540	3	0.000001	1.0000	1.0000	0.6149	1.0000	0.5000	0.1250	1.00005	-2.69	2
+15	34	1	8388608	2097152	2080867	0x0a3d0ae9	4	0.000002	1.0000	1.0000	0.6153	1.0000	0.5000	0.1250	1.00005	2.95	21
+16	35	0	16777216	2097152	2088945	0x025f3be0	3	0.000001	1.0000	1.0000	0.5601	1.0000	0.2500	0.0625	0.99999	-1.83	23
+17	35	0	16777216	2097152	2089147	0x0c8f9740	3	0.000001	1.0000	1.0000	0.5598	1.0000	0.2500	0.0625	1.00009	-2.67	14
+18	44	1	8388608	2097152	2080826	0x02e56123	3	0.000001	1.0000	1.0000	0.6149	1.0000	0.5000	0.1250	1.00003	1.72	22
+19	44	1	8388608	2097152	2080916	0x01310f61	3	0.000001	1.0000	1.0000	0.6153	1.0000	0.5000	0.1250	1.00007	-2.93	11
+20	46	0	16777216	2097152	2089144	0x03bd5597	3	0.000001	1.0000	1.0000	0.5598	1.0000	0.2500	0.0625	1.00009	2.14	12
+21	46	0	16777216	2097152	2088957	0x09024473	3	0.000001	1.0000	1.0000	0.5602	1.0000	0.2500	0.0625	1.00000	2.32	5
+22	50	0	16777216	2097152	2088845	0x0445d9d5	3	0.000001	1.0000	1.0000	0.5600	1.0000	0.2500	0.0625	0.99994	2.80	23
+23	50	0	16777216	2097152	2089093	0x04df6ce7	3	0.000001	1.0000	1.0000	0.5599	1.0000	0.2500	0.0625	1.00006	2.74	17
+24	54	0	16777216	2097152	2088933	0x0a07a102	3	0.000001	1.0000	1.0000	0.5600	1.0000	0.2500	0.0625	0.99999	-2.02	2
+25	54	0	16777216	2097152	2089030	0x0c1379f3	3	0.000001	1.0000	1.0000	0.5598	1.0000	0.2500	0.0625	1.00003	-3.44	1
+26	55	0	16777216	2097152	2088878	0x085501a8	3	0.000001	1.0000	1.0000	0.5600	1.0000	0.2500	0.0625	0.99996	-3.12	25
+27	55	0	16777216	2097152	2088948	0x0bbd318e	4	0.000002	1.0000	1.0000	0.5599	1.0000	0.2500	0.0625	0.99999	-2.15	15
+28	60	2	4194304	2097152	2064493	0x08396e6d	4	0.000002	1.0000	1.0000	0.7132	1.0000	1.0000	0.2500	1.00005	-2.12	20
+29	60	2	4194304	2097152	2064724	0x0868b1b5	4	0.000002	1.0000	1.0000	0.7132	1.0000	1.0000	0.2500	1.00016	-2.12	0
+30	63	0	16777216	2097152	2089012	0x0678c249	3	0.000001	1.0000	1.0000	0.5597	1.0000	0.2500	0.0625	1.00002	-1.83	13
+31	63	0	16777216	2097152	2089134	0x02233538	3	0.000001	1.0000	1.0000	0.5601	1.0000	0.2500	0.0625	1.00008	2.22	15
+# F8 form over the live stream: top 0.1 percent of items hold 0.003338 of reads; flat control 0.003075 (ratio 1.0854x), windowed control 0.003341 (ratio 0.9990x; the gate 1.2x); min site distinct ratio 0.99994 (floors 0.98 and 0.995); worst index bit inside its window -3.44 sigma at site 25 bit 1 (the band 6)
+# program: reads 67108864, distinct items 16370394, worst site 1 address 0x0e3c2793 in 4 reads (share 0.000002); one cache over the program's reads: 1 GiB 1.0000, 256 MiB 0.4315, 64 MiB 0.1391; the per-site ideal caches summed: 1.0000, 1.0000, 0.6025; 37.7 s
diff --git a/docs/analysis/class-v6/rows/live-dataset-census-1a938abe4/build-5/seed-p24.tsv b/docs/analysis/class-v6/rows/live-dataset-census-1a938abe4/build-5/seed-p24.tsv
new file mode 100644
index 000000000..a14fb6cad
--- /dev/null
+++ b/docs/analysis/class-v6/rows/live-dataset-census-1a938abe4/build-5/seed-p24.tsv
@@ -0,0 +1,42 @@
+# addrsite: program 62aa0bfc93f13028 class mx8-erad810f22d+sh256x27+state+reg64c+fold+rw attempt 0 generator v6 day 2026-10-03 dataset 2^28 words (memory-hard) headers 4 warps 2048 nonces/header 65536 threads 32
+# per (iteration, site) cell: the most read address and its share (A03's form); cells over 0.1 percent listed
+it	site	instr	reads	distinct	top_addr	top_count	top_share
+0	0	2	262144	262018	0x0e42540a	2	0.000008
+0	1	2	262144	262009	0x0e87042e	2	0.000008
+# worst cell: iteration 0 site 3 address 0x0bd48627 in 3 reads, share 0.000011
+# per site, pooled over the 8 iterations (hit rates: an ideal cache of the site's top K items, K = bytes / 64; exp = min(1, K / window items))
+site	instr	win	window_items	reads	distinct	top_addr	top_count	top_share	hit_1GiB	hit_256MiB	hit_64MiB	exp_1GiB	exp_256MiB	exp_64MiB	distinct_ratio	bit_z_max	bit
+0	2	0	16777216	2097152	2089004	0x0cd23206	3	0.000001	1.0000	1.0000	0.5600	1.0000	0.2500	0.0625	1.00002	-3.31	11
+1	2	0	16777216	2097152	2089074	0x01eacf3c	3	0.000001	1.0000	1.0000	0.5601	1.0000	0.2500	0.0625	1.00005	-3.36	10
+2	14	2	4194304	2097152	2064697	0x08bdfbf3	4	0.000002	1.0000	1.0000	0.7129	1.0000	1.0000	0.2500	1.00015	-2.16	3
+3	14	2	4194304	2097152	2064991	0x0adf7230	4	0.000002	1.0000	1.0000	0.7133	1.0000	1.0000	0.2500	1.00029	-2.24	2
+4	15	1	8388608	2097152	2080753	0x0b5b8ced	3	0.000001	1.0000	1.0000	0.6150	1.0000	0.5000	0.1250	0.99999	3.46	15
+5	15	1	8388608	2097152	2080866	0x0eb45afa	4	0.000002	1.0000	1.0000	0.6152	1.0000	0.5000	0.1250	1.00005	-3.01	9
+6	16	0	16777216	2097152	2088985	0x09e312bd	3	0.000001	1.0000	1.0000	0.5601	1.0000	0.2500	0.0625	1.00001	-2.32	21
+7	16	0	16777216	2097152	2089013	0x0e41d3af	3	0.000001	1.0000	1.0000	0.5601	1.0000	0.2500	0.0625	1.00003	-3.46	23
+8	21	0	16777216	2097152	2089074	0x0233b8e7	3	0.000001	1.0000	1.0000	0.5598	1.0000	0.2500	0.0625	1.00005	3.40	15
+9	21	0	16777216	2097152	2088934	0x04dda3e6	3	0.000001	1.0000	1.0000	0.5598	1.0000	0.2500	0.0625	0.99999	-2.18	24
+10	26	2	4194304	2097152	2064727	0x00d5209f	4	0.000002	1.0000	1.0000	0.7130	1.0000	1.0000	0.2500	1.00017	2.10	15
+11	26	2	4194304	2097152	2064833	0x0282a4be	4	0.000002	1.0000	1.0000	0.7131	1.0000	1.0000	0.2500	1.00022	-1.77	15
+12	30	0	16777216	2097152	2088776	0x0486d4e0	3	0.000001	1.0000	1.0000	0.5598	1.0000	0.2500	0.0625	0.99991	-3.05	1
+13	30	0	16777216	2097152	2089051	0x05d602a3	3	0.000001	1.0000	1.0000	0.5600	1.0000	0.2500	0.0625	1.00004	2.14	17
+14	32	2	4194304	2097152	2064617	0x06a3fec8	4	0.000002	1.0000	1.0000	0.7134	1.0000	1.0000	0.2500	1.00011	-2.67	2
+15	32	2	4194304	2097152	2064708	0x05c925e7	4	0.000002	1.0000	1.0000	0.7134	1.0000	1.0000	0.2500	1.00016	3.15	21
+16	36	1	8388608	2097152	2080776	0x08c73031	4	0.000002	1.0000	1.0000	0.6153	1.0000	0.5000	0.1250	1.00000	1.81	2
+17	36	1	8388608	2097152	2080754	0x0de40a50	3	0.000001	1.0000	1.0000	0.6154	1.0000	0.5000	0.1250	0.99999	1.74	26
+18	39	2	4194304	2097152	2064597	0x000af8f5	4	0.000002	1.0000	1.0000	0.7129	1.0000	1.0000	0.2500	1.00010	2.75	18
+19	39	2	4194304	2097152	2064470	0x005eaed8	4	0.000002	1.0000	1.0000	0.7128	1.0000	1.0000	0.2500	1.00004	-2.00	19
+20	44	1	8388608	2097152	2080775	0x007f50dc	3	0.000001	1.0000	1.0000	0.6157	1.0000	0.5000	0.1250	1.00000	-1.98	0
+21	44	1	8388608	2097152	2080944	0x070ee707	3	0.000001	1.0000	1.0000	0.6150	1.0000	0.5000	0.1250	1.00008	2.92	4
+22	45	1	8388608	2097152	2080867	0x062f7ddd	3	0.000001	1.0000	1.0000	0.6154	1.0000	0.5000	0.1250	1.00005	-2.07	18
+23	45	1	8388608	2097152	2081022	0x075a2ba5	3	0.000001	1.0000	1.0000	0.6150	1.0000	0.5000	0.1250	1.00012	1.94	18
+24	50	0	16777216	2097152	2089068	0x0fee120f	3	0.000001	1.0000	1.0000	0.5601	1.0000	0.2500	0.0625	1.00005	2.18	17
+25	50	0	16777216	2097152	2088928	0x0a8c8847	4	0.000002	1.0000	1.0000	0.5599	1.0000	0.2500	0.0625	0.99998	1.97	2
+26	60	1	8388608	2097152	2080743	0x0e047ef5	4	0.000002	1.0000	1.0000	0.6156	1.0000	0.5000	0.1250	0.99999	-2.67	15
+27	60	1	8388608	2097152	2080946	0x08edd8b2	4	0.000002	1.0000	1.0000	0.6153	1.0000	0.5000	0.1250	1.00009	2.95	9
+28	61	0	16777216	2097152	2088889	0x0a37d852	3	0.000001	1.0000	1.0000	0.5600	1.0000	0.2500	0.0625	0.99997	-1.90	17
+29	61	0	16777216	2097152	2088952	0x0961c7e8	3	0.000001	1.0000	1.0000	0.5599	1.0000	0.2500	0.0625	1.00000	1.94	11
+30	63	1	8388608	2097152	2081084	0x0e81d734	3	0.000001	1.0000	1.0000	0.6149	1.0000	0.5000	0.1250	1.00015	-2.27	16
+31	63	1	8388608	2097152	2080785	0x0e871b55	3	0.000001	1.0000	1.0000	0.6154	1.0000	0.5000	0.1250	1.00001	2.09	7
+# F8 form over the live stream: top 0.1 percent of items hold 0.003156 of reads; flat control 0.003075 (ratio 1.0264x), windowed control 0.003160 (ratio 0.9988x; the gate 1.2x); min site distinct ratio 0.99991 (floors 0.98 and 0.995); worst index bit inside its window 3.46 sigma at site 4 bit 15 (the band 6)
+# program: reads 67108864, distinct items 16429212, worst site 2 address 0x08bdfbf3 in 4 reads (share 0.000002); one cache over the program's reads: 1 GiB 1.0000, 256 MiB 0.4212, 64 MiB 0.1338; the per-site ideal caches summed: 1.0000, 1.0000, 0.6190; 37.5 s
diff --git a/docs/analysis/class-v6/rows/live-dataset-census-1a938abe4/build-5/seed-p25.tsv b/docs/analysis/class-v6/rows/live-dataset-census-1a938abe4/build-5/seed-p25.tsv
new file mode 100644
index 000000000..e4dd3f622
--- /dev/null
+++ b/docs/analysis/class-v6/rows/live-dataset-census-1a938abe4/build-5/seed-p25.tsv
@@ -0,0 +1,42 @@
+# addrsite: program 3f1af0bbaaef74fa class mx8-erad810f22d+sh256x27+state+reg64c+fold+rw attempt 0 generator v6 day 2026-10-03 dataset 2^28 words (memory-hard) headers 4 warps 2048 nonces/header 65536 threads 32
+# per (iteration, site) cell: the most read address and its share (A03's form); cells over 0.1 percent listed
+it	site	instr	reads	distinct	top_addr	top_count	top_share
+0	0	3	262144	262002	0x07f134b1	2	0.000008
+0	1	3	262144	262012	0x0a8848bb	2	0.000008
+# worst cell: iteration 0 site 2 address 0x0f8343d0 in 3 reads, share 0.000011
+# per site, pooled over the 8 iterations (hit rates: an ideal cache of the site's top K items, K = bytes / 64; exp = min(1, K / window items))
+site	instr	win	window_items	reads	distinct	top_addr	top_count	top_share	hit_1GiB	hit_256MiB	hit_64MiB	exp_1GiB	exp_256MiB	exp_64MiB	distinct_ratio	bit_z_max	bit
+0	3	0	16777216	2097152	2088996	0x0cbb59da	3	0.000001	1.0000	1.0000	0.5600	1.0000	0.2500	0.0625	1.00002	2.18	1
+1	3	0	16777216	2097152	2089183	0x0a718089	3	0.000001	1.0000	1.0000	0.5598	1.0000	0.2500	0.0625	1.00011	2.08	11
+2	5	1	8388608	2097152	2080847	0x0fb1f63d	4	0.000002	1.0000	1.0000	0.6150	1.0000	0.5000	0.1250	1.00004	3.27	5
+3	5	1	8388608	2097152	2080897	0x0d06ab75	3	0.000001	1.0000	1.0000	0.6151	1.0000	0.5000	0.1250	1.00006	-2.05	24
+4	13	2	4194304	2097152	2064814	0x05e5885b	4	0.000002	1.0000	1.0000	0.7132	1.0000	1.0000	0.2500	1.00021	-2.58	4
+5	13	2	4194304	2097152	2064602	0x047ac946	4	0.000002	1.0000	1.0000	0.7127	1.0000	1.0000	0.2500	1.00011	-1.81	5
+6	15	2	4194304	2097152	2064413	0x0b1385e8	4	0.000002	1.0000	1.0000	0.7128	1.0000	1.0000	0.2500	1.00001	-2.35	15
+7	15	2	4194304	2097152	2064991	0x0a8c2bdc	4	0.000002	1.0000	1.0000	0.7129	1.0000	1.0000	0.2500	1.00029	1.95	5
+8	16	2	4194304	2097152	2064808	0x0e3d532a	4	0.000002	1.0000	1.0000	0.7131	1.0000	1.0000	0.2500	1.00021	-2.07	6
+9	16	2	4194304	2097152	2064803	0x0f1eb20a	4	0.000002	1.0000	1.0000	0.7130	1.0000	1.0000	0.2500	1.00020	-2.16	20
+10	24	0	16777216	2097152	2088991	0x0550bb50	3	0.000001	1.0000	1.0000	0.5602	1.0000	0.2500	0.0625	1.00001	-3.16	1
+11	24	0	16777216	2097152	2088858	0x0d44845f	3	0.000001	1.0000	1.0000	0.5600	1.0000	0.2500	0.0625	0.99995	-2.00	20
+12	33	2	4194304	2097152	2064743	0x0fcb1fc5	4	0.000002	1.0000	1.0000	0.7128	1.0000	1.0000	0.2500	1.00017	2.21	4
+13	33	2	4194304	2097152	2064971	0x0d9a081b	4	0.000002	1.0000	1.0000	0.7128	1.0000	1.0000	0.2500	1.00028	-2.21	19
+14	37	1	8388608	2097152	2080823	0x08014036	4	0.000002	1.0000	1.0000	0.6158	1.0000	0.5000	0.1250	1.00003	2.52	4
+15	37	1	8388608	2097152	2080830	0x0c1b3d35	3	0.000001	1.0000	1.0000	0.6152	1.0000	0.5000	0.1250	1.00003	1.48	5
+16	44	2	4194304	2097152	2064369	0x0f89e882	4	0.000002	1.0000	1.0000	0.7135	1.0000	1.0000	0.2500	0.99999	-2.00	7
+17	44	2	4194304	2097152	2064584	0x0d4704d5	4	0.000002	1.0000	1.0000	0.7131	1.0000	1.0000	0.2500	1.00010	2.59	18
+18	45	2	4194304	2097152	2064707	0x0a38b699	4	0.000002	1.0000	1.0000	0.7129	1.0000	1.0000	0.2500	1.00016	2.00	7
+19	45	2	4194304	2097152	2064395	0x088409e8	4	0.000002	1.0000	1.0000	0.7132	1.0000	1.0000	0.2500	1.00001	2.25	3
+20	51	2	4194304	2097152	2064454	0x00cb2b66	4	0.000002	1.0000	1.0000	0.7130	1.0000	1.0000	0.2500	1.00003	2.08	23
+21	51	2	4194304	2097152	2064670	0x0034b787	4	0.000002	1.0000	1.0000	0.7131	1.0000	1.0000	0.2500	1.00014	2.21	2
+22	53	1	8388608	2097152	2080753	0x0696b0ab	3	0.000001	1.0000	1.0000	0.6152	1.0000	0.5000	0.1250	0.99999	-2.50	9
+23	53	1	8388608	2097152	2080886	0x005b4fa2	4	0.000002	1.0000	1.0000	0.6151	1.0000	0.5000	0.1250	1.00006	1.75	7
+24	57	0	16777216	2097152	2088898	0x0bb45708	3	0.000001	1.0000	1.0000	0.5602	1.0000	0.2500	0.0625	0.99997	2.93	25
+25	57	0	16777216	2097152	2089068	0x0e8a9b07	3	0.000001	1.0000	1.0000	0.5597	1.0000	0.2500	0.0625	1.00005	1.83	2
+26	59	0	16777216	2097152	2088887	0x022c48f7	3	0.000001	1.0000	1.0000	0.5602	1.0000	0.2500	0.0625	0.99997	3.26	1
+27	59	0	16777216	2097152	2088972	0x07d98200	3	0.000001	1.0000	1.0000	0.5599	1.0000	0.2500	0.0625	1.00001	2.05	16
+28	61	0	16777216	2097152	2088836	0x053563a9	3	0.000001	1.0000	1.0000	0.5602	1.0000	0.2500	0.0625	0.99994	-2.43	12
+29	61	0	16777216	2097152	2088824	0x0e2d271f	3	0.000001	1.0000	1.0000	0.5601	1.0000	0.2500	0.0625	0.99993	-2.10	19
+30	62	0	16777216	2097152	2088923	0x033cc4ac	3	0.000001	1.0000	1.0000	0.5599	1.0000	0.2500	0.0625	0.99998	-2.29	15
+31	62	0	16777216	2097152	2088953	0x04cd2576	3	0.000001	1.0000	1.0000	0.5602	1.0000	0.2500	0.0625	1.00000	-1.60	6
+# F8 form over the live stream: top 0.1 percent of items hold 0.003436 of reads; flat control 0.003070 (ratio 1.1192x), windowed control 0.003432 (ratio 1.0014x; the gate 1.2x); min site distinct ratio 0.99993 (floors 0.98 and 0.995); worst index bit inside its window 3.27 sigma at site 2 bit 5 (the band 6)
+# program: reads 67108864, distinct items 16295799, worst site 2 address 0x0fb1f63d in 4 reads (share 0.000002); one cache over the program's reads: 1 GiB 1.0000, 256 MiB 0.4418, 64 MiB 0.1426; the per-site ideal caches summed: 1.0000, 1.0000, 0.6373; 37.1 s
diff --git a/docs/analysis/class-v6/rows/live-dataset-census-1a938abe4/build-6/liveness-object-h4.tsv b/docs/analysis/class-v6/rows/live-dataset-census-1a938abe4/build-6/liveness-object-h4.tsv
new file mode 100644
index 000000000..6e8b39441
--- /dev/null
+++ b/docs/analysis/class-v6/rows/live-dataset-census-1a938abe4/build-6/liveness-object-h4.tsv
@@ -0,0 +1,67 @@
+# liveness: program 4de7b836cc40a4ea class mx8-erad810f22d+sh256x27+state+reg64c+fold+rw registers 64 day bytes:69676e65756d2d6461792ffa50000000000000 dataset 2^28 words (memory-hard) headers 4 warps 16 threads 32 probe words 2
+reg	probes	first_load_changed	hash_changed	least_changed_load	least_changed_frac
+0	4096	1.000000	1.000000	0	1.000000
+1	4096	1.000000	1.000000	0	1.000000
+2	4096	1.000000	1.000000	0	1.000000
+3	4096	1.000000	1.000000	0	1.000000
+4	4096	1.000000	1.000000	0	1.000000
+5	4096	1.000000	1.000000	0	1.000000
+6	4096	1.000000	1.000000	0	1.000000
+7	4096	1.000000	1.000000	0	1.000000
+8	4096	1.000000	1.000000	0	1.000000
+9	4096	1.000000	1.000000	0	1.000000
+10	4096	1.000000	1.000000	0	1.000000
+11	4096	1.000000	1.000000	0	1.000000
+12	4096	1.000000	1.000000	0	1.000000
+13	4096	1.000000	1.000000	0	1.000000
+14	4096	1.000000	1.000000	0	1.000000
+15	4096	1.000000	1.000000	0	1.000000
+16	4096	1.000000	1.000000	0	1.000000
+17	4096	1.000000	1.000000	0	1.000000
+18	4096	1.000000	1.000000	0	1.000000
+19	4096	1.000000	1.000000	0	1.000000
+20	4096	1.000000	1.000000	0	1.000000
+21	4096	1.000000	1.000000	0	1.000000
+22	4096	1.000000	1.000000	0	1.000000
+23	4096	1.000000	1.000000	0	1.000000
+24	4096	1.000000	1.000000	0	1.000000
+25	4096	1.000000	1.000000	0	1.000000
+26	4096	1.000000	1.000000	0	1.000000
+27	4096	1.000000	1.000000	0	1.000000
+28	4096	1.000000	1.000000	0	1.000000
+29	4096	1.000000	1.000000	0	1.000000
+30	4096	1.000000	1.000000	0	1.000000
+31	4096	1.000000	1.000000	0	1.000000
+32	4096	1.000000	1.000000	0	1.000000
+33	4096	1.000000	1.000000	0	1.000000
+34	4096	1.000000	1.000000	0	1.000000
+35	4096	1.000000	1.000000	0	1.000000
+36	4096	1.000000	1.000000	0	1.000000
+37	4096	1.000000	1.000000	0	1.000000
+38	4096	1.000000	1.000000	0	1.000000
+39	4096	1.000000	1.000000	0	1.000000
+40	4096	1.000000	1.000000	0	1.000000
+41	4096	1.000000	1.000000	0	1.000000
+42	4096	1.000000	1.000000	0	1.000000
+43	4096	1.000000	1.000000	0	1.000000
+44	4096	1.000000	1.000000	0	1.000000
+45	4096	1.000000	1.000000	0	1.000000
+46	4096	1.000000	1.000000	0	1.000000
+47	4096	1.000000	1.000000	0	1.000000
+48	4096	1.000000	1.000000	0	1.000000
+49	4096	1.000000	1.000000	0	1.000000
+50	4096	1.000000	1.000000	0	1.000000
+51	4096	1.000000	1.000000	0	1.000000
+52	4096	1.000000	1.000000	0	1.000000
+53	4096	1.000000	1.000000	0	1.000000
+54	4096	1.000000	1.000000	0	1.000000
+55	4096	1.000000	1.000000	0	1.000000
+56	4096	1.000000	1.000000	0	1.000000
+57	4096	1.000000	1.000000	0	1.000000
+58	4096	1.000000	1.000000	0	1.000000
+59	4096	1.000000	1.000000	0	1.000000
+60	4096	1.000000	1.000000	0	1.000000
+61	4096	1.000000	1.000000	0	1.000000
+62	4096	1.000000	1.000000	0	1.000000
+63	4096	1.000000	1.000000	0	1.000000
+# verdict: 64 registers over 4096 probes each; first-load address changed in 1.000000 of lanes at the least live register, the hash in 1.000000; the least changed (register, first-iteration load) is (0, 0) at 1.000000; LIVE on live data (every register moves every lane's first address and hash); 18.3 s
diff --git a/docs/analysis/class-v6/rows/live-dataset-census-1a938abe4/build-6/liveness-p26.tsv b/docs/analysis/class-v6/rows/live-dataset-census-1a938abe4/build-6/liveness-p26.tsv
new file mode 100644
index 000000000..df184e588
--- /dev/null
+++ b/docs/analysis/class-v6/rows/live-dataset-census-1a938abe4/build-6/liveness-p26.tsv
@@ -0,0 +1,67 @@
+# liveness: program 2b406490ba8d3c91 class mx8-erad810f22d+sh256x27+state+reg64c+fold+rw registers 64 day 2026-10-03 dataset 2^28 words (memory-hard) headers 2 warps 8 threads 32 probe words 2
+reg	probes	first_load_changed	hash_changed	least_changed_load	least_changed_frac
+0	1024	1.000000	1.000000	0	1.000000
+1	1024	1.000000	1.000000	0	1.000000
+2	1024	1.000000	1.000000	0	1.000000
+3	1024	1.000000	1.000000	0	1.000000
+4	1024	1.000000	1.000000	0	1.000000
+5	1024	1.000000	1.000000	0	1.000000
+6	1024	1.000000	1.000000	0	1.000000
+7	1024	1.000000	1.000000	0	1.000000
+8	1024	1.000000	1.000000	0	1.000000
+9	1024	1.000000	1.000000	0	1.000000
+10	1024	1.000000	1.000000	0	1.000000
+11	1024	1.000000	1.000000	0	1.000000
+12	1024	1.000000	1.000000	0	1.000000
+13	1024	1.000000	1.000000	0	1.000000
+14	1024	1.000000	1.000000	0	1.000000
+15	1024	1.000000	1.000000	0	1.000000
+16	1024	1.000000	1.000000	0	1.000000
+17	1024	1.000000	1.000000	0	1.000000
+18	1024	1.000000	1.000000	0	1.000000
+19	1024	1.000000	1.000000	0	1.000000
+20	1024	1.000000	1.000000	0	1.000000
+21	1024	1.000000	1.000000	0	1.000000
+22	1024	1.000000	1.000000	0	1.000000
+23	1024	1.000000	1.000000	0	1.000000
+24	1024	1.000000	1.000000	0	1.000000
+25	1024	1.000000	1.000000	0	1.000000
+26	1024	1.000000	1.000000	0	1.000000
+27	1024	1.000000	1.000000	0	1.000000
+28	1024	1.000000	1.000000	0	1.000000
+29	1024	1.000000	1.000000	0	1.000000
+30	1024	1.000000	1.000000	0	1.000000
+31	1024	1.000000	1.000000	0	1.000000
+32	1024	1.000000	1.000000	0	1.000000
+33	1024	1.000000	1.000000	0	1.000000
+34	1024	1.000000	1.000000	0	1.000000
+35	1024	1.000000	1.000000	0	1.000000
+36	1024	1.000000	1.000000	0	1.000000
+37	1024	1.000000	1.000000	0	1.000000
+38	1024	1.000000	1.000000	0	1.000000
+39	1024	1.000000	1.000000	0	1.000000
+40	1024	1.000000	1.000000	0	1.000000
+41	1024	1.000000	1.000000	0	1.000000
+42	1024	1.000000	1.000000	0	1.000000
+43	1024	1.000000	1.000000	0	1.000000
+44	1024	1.000000	1.000000	0	1.000000
+45	1024	1.000000	1.000000	0	1.000000
+46	1024	1.000000	1.000000	0	1.000000
+47	1024	1.000000	1.000000	0	1.000000
+48	1024	1.000000	1.000000	0	1.000000
+49	1024	1.000000	1.000000	0	1.000000
+50	1024	1.000000	1.000000	0	1.000000
+51	1024	1.000000	1.000000	0	1.000000
+52	1024	1.000000	1.000000	0	1.000000
+53	1024	1.000000	1.000000	0	1.000000
+54	1024	1.000000	1.000000	0	1.000000
+55	1024	1.000000	1.000000	0	1.000000
+56	1024	1.000000	1.000000	0	1.000000
+57	1024	1.000000	1.000000	0	1.000000
+58	1024	1.000000	1.000000	0	1.000000
+59	1024	1.000000	1.000000	0	1.000000
+60	1024	1.000000	1.000000	0	1.000000
+61	1024	1.000000	1.000000	0	1.000000
+62	1024	1.000000	1.000000	0	1.000000
+63	1024	1.000000	1.000000	0	1.000000
+# verdict: 64 registers over 1024 probes each; first-load address changed in 1.000000 of lanes at the least live register, the hash in 1.000000; the least changed (register, first-iteration load) is (0, 0) at 1.000000; LIVE on live data (every register moves every lane's first address and hash); 4.7 s
diff --git a/docs/analysis/class-v6/rows/live-dataset-census-1a938abe4/build-6/night-jobs-6.tsv b/docs/analysis/class-v6/rows/live-dataset-census-1a938abe4/build-6/night-jobs-6.tsv
new file mode 100644
index 000000000..fda777164
--- /dev/null
+++ b/docs/analysis/class-v6/rows/live-dataset-census-1a938abe4/build-6/night-jobs-6.tsv
@@ -0,0 +1,5 @@
+canary-p18	# F8 form	16	env IGNEUM_FAMILY_GATE=1 /srv/builds/v6-census/bin/all4-b819c23a/igneum-pow addrsite --count 1 --warps 256 --threads 16 --seed igneum-attack-f8/program/18 --day-hex 69676e65756d2d6461792ffa50000000000000 --class mx8+sh256x27+state+reg64c+fold+rw --era 0:edc4fa844da9dc98d37e965176f6558a31560e40502ab3ae5491b21aaaabfb07 --state /srv/builds/v6-census/packs/node1-state.igsd1
+object-h4	# F8 form	32	env IGNEUM_FAMILY_GATE=1 /srv/builds/v6-census/bin/all4-b819c23a/igneum-pow addrsite --count 4 --header-from 4 --warps 8192 --threads 32 --epoch-hex edc4fa844da9dc98d37e965176f6558a31560e40502ab3ae5491b21aaaabfb07 --day-hex 69676e65756d2d6461792ffa50000000000000 --class mx8+sh256x27+state+reg64c+fold+rw --era 0:edc4fa844da9dc98d37e965176f6558a31560e40502ab3ae5491b21aaaabfb07 --state /srv/builds/v6-census/packs/node1-state.igsd1
+liveness-object-h4	# verdict	32	env IGNEUM_FAMILY_GATE=1 /srv/builds/v6-census/bin/all4-b819c23a/igneum-pow liveness --count 4 --header-from 4 --warps 16 --threads 32 --epoch-hex edc4fa844da9dc98d37e965176f6558a31560e40502ab3ae5491b21aaaabfb07 --day-hex 69676e65756d2d6461792ffa50000000000000 --class mx8+sh256x27+state+reg64c+fold+rw --era 0:edc4fa844da9dc98d37e965176f6558a31560e40502ab3ae5491b21aaaabfb07 --state /srv/builds/v6-census/packs/node1-state.igsd1
+seed-p26 27 28 29 30 31 32 33	# F8 form	32	env IGNEUM_FAMILY_GATE=1 /srv/builds/v6-census/bin/all4-b819c23a/igneum-pow addrsite --count 4 --warps 2048 --threads 32 --seed igneum-attack-f8/program/26 27 28 29 30 31 32 33 --day-hex 69676e65756d2d6461792ffa50000000000000 --class mx8+sh256x27+state+reg64c+fold+rw --era 0:edc4fa844da9dc98d37e965176f6558a31560e40502ab3ae5491b21aaaabfb07 --state /srv/builds/v6-census/packs/node1-state.igsd1
+liveness-p26	# verdict	32	env IGNEUM_FAMILY_GATE=1 /srv/builds/v6-census/bin/all4-b819c23a/igneum-pow liveness --count 2 --warps 8 --threads 32 --seed igneum-attack-f8/program/26 --day-hex 69676e65756d2d6461792ffa50000000000000 --class mx8+sh256x27+state+reg64c+fold+rw --era 0:edc4fa844da9dc98d37e965176f6558a31560e40502ab3ae5491b21aaaabfb07 --state /srv/builds/v6-census/packs/node1-state.igsd1
diff --git a/docs/analysis/class-v6/rows/live-dataset-census-1a938abe4/build-6/night-seeds-6.tsv b/docs/analysis/class-v6/rows/live-dataset-census-1a938abe4/build-6/night-seeds-6.tsv
new file mode 100644
index 000000000..6ea5f6a7c
--- /dev/null
+++ b/docs/analysis/class-v6/rows/live-dataset-census-1a938abe4/build-6/night-seeds-6.tsv
@@ -0,0 +1,8 @@
+seed-p26	# F8 form	32	env IGNEUM_FAMILY_GATE=1 /srv/builds/v6-census/bin/all4-b819c23a/igneum-pow addrsite --count 4 --warps 2048 --threads 32 --seed igneum-attack-f8/program/26 --day-hex 69676e65756d2d6461792ffa50000000000000 --class mx8+sh256x27+state+reg64c+fold+rw --era 0:edc4fa844da9dc98d37e965176f6558a31560e40502ab3ae5491b21aaaabfb07 --state /srv/builds/v6-census/packs/node1-state.igsd1
+seed-p27	# F8 form	32	env IGNEUM_FAMILY_GATE=1 /srv/builds/v6-census/bin/all4-b819c23a/igneum-pow addrsite --count 4 --warps 2048 --threads 32 --seed igneum-attack-f8/program/27 --day-hex 69676e65756d2d6461792ffa50000000000000 --class mx8+sh256x27+state+reg64c+fold+rw --era 0:edc4fa844da9dc98d37e965176f6558a31560e40502ab3ae5491b21aaaabfb07 --state /srv/builds/v6-census/packs/node1-state.igsd1
+seed-p28	# F8 form	32	env IGNEUM_FAMILY_GATE=1 /srv/builds/v6-census/bin/all4-b819c23a/igneum-pow addrsite --count 4 --warps 2048 --threads 32 --seed igneum-attack-f8/program/28 --day-hex 69676e65756d2d6461792ffa50000000000000 --class mx8+sh256x27+state+reg64c+fold+rw --era 0:edc4fa844da9dc98d37e965176f6558a31560e40502ab3ae5491b21aaaabfb07 --state /srv/builds/v6-census/packs/node1-state.igsd1
+seed-p29	# F8 form	32	env IGNEUM_FAMILY_GATE=1 /srv/builds/v6-census/bin/all4-b819c23a/igneum-pow addrsite --count 4 --warps 2048 --threads 32 --seed igneum-attack-f8/program/29 --day-hex 69676e65756d2d6461792ffa50000000000000 --class mx8+sh256x27+state+reg64c+fold+rw --era 0:edc4fa844da9dc98d37e965176f6558a31560e40502ab3ae5491b21aaaabfb07 --state /srv/builds/v6-census/packs/node1-state.igsd1
+seed-p30	# F8 form	32	env IGNEUM_FAMILY_GATE=1 /srv/builds/v6-census/bin/all4-b819c23a/igneum-pow addrsite --count 4 --warps 2048 --threads 32 --seed igneum-attack-f8/program/30 --day-hex 69676e65756d2d6461792ffa50000000000000 --class mx8+sh256x27+state+reg64c+fold+rw --era 0:edc4fa844da9dc98d37e965176f6558a31560e40502ab3ae5491b21aaaabfb07 --state /srv/builds/v6-census/packs/node1-state.igsd1
+seed-p31	# F8 form	32	env IGNEUM_FAMILY_GATE=1 /srv/builds/v6-census/bin/all4-b819c23a/igneum-pow addrsite --count 4 --warps 2048 --threads 32 --seed igneum-attack-f8/program/31 --day-hex 69676e65756d2d6461792ffa50000000000000 --class mx8+sh256x27+state+reg64c+fold+rw --era 0:edc4fa844da9dc98d37e965176f6558a31560e40502ab3ae5491b21aaaabfb07 --state /srv/builds/v6-census/packs/node1-state.igsd1
+seed-p32	# F8 form	32	env IGNEUM_FAMILY_GATE=1 /srv/builds/v6-census/bin/all4-b819c23a/igneum-pow addrsite --count 4 --warps 2048 --threads 32 --seed igneum-attack-f8/program/32 --day-hex 69676e65756d2d6461792ffa50000000000000 --class mx8+sh256x27+state+reg64c+fold+rw --era 0:edc4fa844da9dc98d37e965176f6558a31560e40502ab3ae5491b21aaaabfb07 --state /srv/builds/v6-census/packs/node1-state.igsd1
+seed-p33	# F8 form	32	env IGNEUM_FAMILY_GATE=1 /srv/builds/v6-census/bin/all4-b819c23a/igneum-pow addrsite --count 4 --warps 2048 --threads 32 --seed igneum-attack-f8/program/33 --day-hex 69676e65756d2d6461792ffa50000000000000 --class mx8+sh256x27+state+reg64c+fold+rw --era 0:edc4fa844da9dc98d37e965176f6558a31560e40502ab3ae5491b21aaaabfb07 --state /srv/builds/v6-census/packs/node1-state.igsd1
diff --git a/docs/analysis/class-v6/rows/live-dataset-census-1a938abe4/build-6/object-h4.tsv b/docs/analysis/class-v6/rows/live-dataset-census-1a938abe4/build-6/object-h4.tsv
new file mode 100644
index 000000000..93772a7d5
--- /dev/null
+++ b/docs/analysis/class-v6/rows/live-dataset-census-1a938abe4/build-6/object-h4.tsv
@@ -0,0 +1,42 @@
+# addrsite: program 4de7b836cc40a4ea class mx8-erad810f22d+sh256x27+state+reg64c+fold+rw attempt 0 generator v6 day bytes:69676e65756d2d6461792ffa50000000000000 dataset 2^28 words (memory-hard) headers 4 warps 8192 nonces/header 262144 threads 32
+# per (iteration, site) cell: the most read address and its share (A03's form); cells over 0.1 percent listed
+it	site	instr	reads	distinct	top_addr	top_count	top_share
+0	0	7	1048576	1044536	0x0e05c4a9	3	0.000003
+0	1	7	1048576	1044607	0x08697f24	3	0.000003
+# worst cell: iteration 0 site 28 address 0x0f45e0db in 4 reads, share 0.000004
+# per site, pooled over the 8 iterations (hit rates: an ideal cache of the site's top K items, K = bytes / 64; exp = min(1, K / window items))
+site	instr	win	window_items	reads	distinct	top_addr	top_count	top_share	hit_1GiB	hit_256MiB	hit_64MiB	exp_1GiB	exp_256MiB	exp_64MiB	distinct_ratio	bit_z_max	bit
+0	7	1	8388608	8388608	8131224	0x08f95f48	4	0.000000	1.0000	0.8679	0.3537	1.0000	0.5000	0.1250	1.00059	-2.28	12
+1	7	1	8388608	8388608	8132204	0x0a60bde7	4	0.000000	1.0000	0.8678	0.3536	1.0000	0.5000	0.1250	1.00071	-2.24	21
+2	8	1	8388608	8388608	8132174	0x0d9d2d01	5	0.000001	1.0000	0.8680	0.3536	1.0000	0.5000	0.1250	1.00070	-2.48	13
+3	8	1	8388608	8388608	8131438	0x0899c671	5	0.000001	1.0000	0.8678	0.3536	1.0000	0.5000	0.1250	1.00061	-2.83	6
+4	9	0	16777216	8388608	8258753	0x08a8b28d	4	0.000000	1.0000	0.7130	0.2826	1.0000	0.2500	0.0625	1.00015	1.88	14
+5	9	0	16777216	8388608	8259388	0x03d1dc2b	4	0.000000	1.0000	0.7131	0.2827	1.0000	0.2500	0.0625	1.00022	2.64	25
+6	10	1	8388608	8388608	8132147	0x0ee46b12	5	0.000001	1.0000	0.8679	0.3536	1.0000	0.5000	0.1250	1.00070	1.88	15
+7	10	1	8388608	8388608	8132252	0x087b47fa	4	0.000000	1.0000	0.8679	0.3536	1.0000	0.5000	0.1250	1.00071	2.82	7
+8	11	2	4194304	8388608	7885782	0x07578642	5	0.000001	1.0000	1.0000	0.4839	1.0000	1.0000	0.2500	1.00273	-2.39	1
+9	11	2	4194304	8388608	7884591	0x048afc00	5	0.000001	1.0000	1.0000	0.4841	1.0000	1.0000	0.2500	1.00258	-3.06	1
+10	13	1	8388608	8388608	8131079	0x02be2d07	4	0.000000	1.0000	0.8681	0.3537	1.0000	0.5000	0.1250	1.00057	-2.24	7
+11	13	1	8388608	8388608	8131565	0x04d6955b	4	0.000000	1.0000	0.8680	0.3538	1.0000	0.5000	0.1250	1.00063	-1.87	17
+12	29	0	16777216	8388608	8259329	0x08f9a4bf	4	0.000000	1.0000	0.7130	0.2826	1.0000	0.2500	0.0625	1.00022	1.99	25
+13	29	0	16777216	8388608	8258841	0x0a5492cf	4	0.000000	1.0000	0.7130	0.2826	1.0000	0.2500	0.0625	1.00016	-2.54	14
+14	30	1	8388608	8388608	8131950	0x02134f18	5	0.000001	1.0000	0.8677	0.3535	1.0000	0.5000	0.1250	1.00068	-2.31	16
+15	30	1	8388608	8388608	8132719	0x04eec855	5	0.000001	1.0000	0.8679	0.3537	1.0000	0.5000	0.1250	1.00077	-2.37	24
+16	31	1	8388608	8388608	8131259	0x055f81c2	4	0.000000	1.0000	0.8680	0.3537	1.0000	0.5000	0.1250	1.00059	2.65	23
+17	31	1	8388608	8388608	8132146	0x00887025	5	0.000001	1.0000	0.8679	0.3537	1.0000	0.5000	0.1250	1.00070	-2.40	24
+18	44	1	8388608	8388608	8132643	0x06da0c02	4	0.000000	1.0000	0.8679	0.3537	1.0000	0.5000	0.1250	1.00076	-2.11	11
+19	44	1	8388608	8388608	8131442	0x033fda08	4	0.000000	1.0000	0.8678	0.3537	1.0000	0.5000	0.1250	1.00061	-2.04	20
+20	46	1	8388608	8388608	8132391	0x00647e1d	5	0.000001	1.0000	0.8680	0.3538	1.0000	0.5000	0.1250	1.00073	2.73	24
+21	46	1	8388608	8388608	8131479	0x0436441b	6	0.000001	1.0000	0.8678	0.3536	1.0000	0.5000	0.1250	1.00062	2.56	17
+22	47	2	4194304	8388608	7885914	0x0173a911	5	0.000001	1.0000	1.0000	0.4842	1.0000	1.0000	0.2500	1.00275	-1.67	11
+23	47	2	4194304	8388608	7885359	0x01fa7113	5	0.000001	1.0000	1.0000	0.4839	1.0000	1.0000	0.2500	1.00268	-1.60	2
+24	52	0	16777216	8388608	8258931	0x08292ca1	4	0.000000	1.0000	0.7130	0.2826	1.0000	0.2500	0.0625	1.00017	2.73	11
+25	52	0	16777216	8388608	8258747	0x064542dc	4	0.000000	1.0000	0.7130	0.2826	1.0000	0.2500	0.0625	1.00015	-2.33	0
+26	56	0	16777216	8388608	8259124	0x084f5e4c	4	0.000000	1.0000	0.7131	0.2827	1.0000	0.2500	0.0625	1.00019	-1.40	5
+27	56	0	16777216	8388608	8259571	0x0eefc792	4	0.000000	1.0000	0.7130	0.2826	1.0000	0.2500	0.0625	1.00025	2.08	6
+28	58	1	8388608	8388608	8131558	0x0d472d62	4	0.000000	1.0000	0.8676	0.3535	1.0000	0.5000	0.1250	1.00063	-1.62	17
+29	58	1	8388608	8388608	8132744	0x0ac6b454	5	0.000001	1.0000	0.8680	0.3536	1.0000	0.5000	0.1250	1.00077	-1.80	23
+30	63	0	16777216	8388608	8258365	0x077876fc	4	0.000000	1.0000	0.7130	0.2827	1.0000	0.2500	0.0625	1.00010	2.87	25
+31	63	0	16777216	8388608	8258808	0x011e117e	4	0.000000	1.0000	0.7130	0.2827	1.0000	0.2500	0.0625	1.00015	2.46	27
+# F8 form over the live stream: top 0.1 percent of items hold 0.002140 of reads; flat control 0.001944 (ratio 1.1005x), windowed control 0.002141 (ratio 0.9995x; the gate 1.2x); min site distinct ratio 1.00010 (floors 0.98 and 0.995); worst index bit inside its window -3.06 sigma at site 9 bit 1 (the band 6)
+# program: reads 268435456, distinct items 16777198, worst site 21 address 0x0436441b in 6 reads (share 0.000001); one cache over the program's reads: 1 GiB 1.0000, 256 MiB 0.3540, 64 MiB 0.1035; the per-site ideal caches summed: 1.0000, 0.8360, 0.3478; 213.8 s
diff --git a/docs/analysis/class-v6/rows/live-dataset-census-1a938abe4/build-6/restarts.log b/docs/analysis/class-v6/rows/live-dataset-census-1a938abe4/build-6/restarts.log
new file mode 100644
index 000000000..b383748b2
--- /dev/null
+++ b/docs/analysis/class-v6/rows/live-dataset-census-1a938abe4/build-6/restarts.log
@@ -0,0 +1,38 @@
+# night driver start 21:56 UK host igneum-build-6 jobs 1
+start 1 canary-p18 21:56 UK
+end 1 canary-p18 rc 0 21:56 UK
+# night driver end 21:56 UK
+# night driver start 21:56 UK host igneum-build-6 jobs 5
+start 1 object-h4 21:56 UK
+end 1 object-h4 rc 0 22:00 UK
+start 1 liveness-object-h4 22:00 UK
+end 1 liveness-object-h4 rc 0 22:00 UK
+start 1 seed-p26 27 28 29 30 31 32 33 22:00 UK
+end 1 seed-p26 27 28 29 30 31 32 33 rc 2 22:00 UK
+restart 2 seed-p26 27 28 29 30 31 32 33 22:00 UK
+start 2 seed-p26 27 28 29 30 31 32 33 22:00 UK
+end 2 seed-p26 27 28 29 30 31 32 33 rc 2 22:00 UK
+restart 3 seed-p26 27 28 29 30 31 32 33 22:00 UK
+start 3 seed-p26 27 28 29 30 31 32 33 22:00 UK
+end 3 seed-p26 27 28 29 30 31 32 33 rc 2 22:00 UK
+start 1 liveness-p26 22:00 UK
+end 1 liveness-p26 rc 0 22:00 UK
+# night driver end 22:00 UK
+# night driver start 22:01 UK host igneum-build-6 jobs 8
+start 1 seed-p26 22:01 UK
+end 1 seed-p26 rc 0 22:02 UK
+start 1 seed-p27 22:02 UK
+end 1 seed-p27 rc 0 22:02 UK
+start 1 seed-p28 22:02 UK
+end 1 seed-p28 rc 0 22:03 UK
+start 1 seed-p29 22:03 UK
+end 1 seed-p29 rc 0 22:04 UK
+start 1 seed-p30 22:04 UK
+end 1 seed-p30 rc 0 22:05 UK
+start 1 seed-p31 22:05 UK
+end 1 seed-p31 rc 0 22:06 UK
+start 1 seed-p32 22:06 UK
+end 1 seed-p32 rc 0 22:07 UK
+start 1 seed-p33 22:07 UK
+end 1 seed-p33 rc 0 22:08 UK
+# night driver end 22:08 UK
diff --git a/docs/analysis/class-v6/rows/live-dataset-census-1a938abe4/build-6/seed-p26.tsv b/docs/analysis/class-v6/rows/live-dataset-census-1a938abe4/build-6/seed-p26.tsv
new file mode 100644
index 000000000..a5f8d7872
--- /dev/null
+++ b/docs/analysis/class-v6/rows/live-dataset-census-1a938abe4/build-6/seed-p26.tsv
@@ -0,0 +1,42 @@
+# addrsite: program 2b406490ba8d3c91 class mx8-erad810f22d+sh256x27+state+reg64c+fold+rw attempt 0 generator v6 day 2026-10-03 dataset 2^28 words (memory-hard) headers 4 warps 2048 nonces/header 65536 threads 32
+# per (iteration, site) cell: the most read address and its share (A03's form); cells over 0.1 percent listed
+it	site	instr	reads	distinct	top_addr	top_count	top_share
+0	0	3	262144	261881	0x0796afa2	2	0.000008
+0	1	3	262144	261869	0x01cee15a	2	0.000008
+# worst cell: iteration 0 site 6 address 0x0f26b8e6 in 3 reads, share 0.000011
+# per site, pooled over the 8 iterations (hit rates: an ideal cache of the site's top K items, K = bytes / 64; exp = min(1, K / window items))
+site	instr	win	window_items	reads	distinct	top_addr	top_count	top_share	hit_1GiB	hit_256MiB	hit_64MiB	exp_1GiB	exp_256MiB	exp_64MiB	distinct_ratio	bit_z_max	bit
+0	3	1	8388608	2097152	2080650	0x0741db04	3	0.000001	1.0000	1.0000	0.6151	1.0000	0.5000	0.1250	0.99994	2.85	24
+1	3	1	8388608	2097152	2080597	0x029d5b9c	3	0.000001	1.0000	1.0000	0.6150	1.0000	0.5000	0.1250	0.99992	1.78	12
+2	7	2	4194304	2097152	2064742	0x0121006a	3	0.000001	1.0000	1.0000	0.7130	1.0000	1.0000	0.2500	1.00017	-2.28	24
+3	7	2	4194304	2097152	2064903	0x03f3960e	4	0.000002	1.0000	1.0000	0.7125	1.0000	1.0000	0.2500	1.00025	-1.90	12
+4	10	0	16777216	2097152	2089002	0x002c876d	3	0.000001	1.0000	1.0000	0.5599	1.0000	0.2500	0.0625	1.00002	-2.20	5
+5	10	0	16777216	2097152	2088876	0x07df131c	3	0.000001	1.0000	1.0000	0.5600	1.0000	0.2500	0.0625	0.99996	1.78	11
+6	17	1	8388608	2097152	2080848	0x0884b4b7	3	0.000001	1.0000	1.0000	0.6152	1.0000	0.5000	0.1250	1.00004	-2.05	7
+7	17	1	8388608	2097152	2081059	0x0d8689c5	4	0.000002	1.0000	1.0000	0.6154	1.0000	0.5000	0.1250	1.00014	-2.04	4
+8	18	1	8388608	2097152	2080725	0x0977d37e	3	0.000001	1.0000	1.0000	0.6155	1.0000	0.5000	0.1250	0.99998	2.78	23
+9	18	1	8388608	2097152	2080924	0x0b418382	4	0.000002	1.0000	1.0000	0.6149	1.0000	0.5000	0.1250	1.00007	2.18	12
+10	19	1	8388608	2097152	2080842	0x08d357f6	3	0.000001	1.0000	1.0000	0.6155	1.0000	0.5000	0.1250	1.00004	-1.92	4
+11	19	1	8388608	2097152	2080982	0x0df9e9cd	3	0.000001	1.0000	1.0000	0.6154	1.0000	0.5000	0.1250	1.00010	1.58	0
+12	20	1	8388608	2097152	2081066	0x025615ff	3	0.000001	1.0000	1.0000	0.6150	1.0000	0.5000	0.1250	1.00014	-2.18	12
+13	20	1	8388608	2097152	2080599	0x01ff4b28	3	0.000001	1.0000	1.0000	0.6153	1.0000	0.5000	0.1250	0.99992	-1.92	1
+14	23	2	4194304	2097152	2064627	0x0a245421	4	0.000002	1.0000	1.0000	0.7130	1.0000	1.0000	0.2500	1.00012	3.51	14
+15	23	2	4194304	2097152	2064463	0x0a5c53c6	4	0.000002	1.0000	1.0000	0.7131	1.0000	1.0000	0.2500	1.00004	-2.44	2
+16	26	1	8388608	2097152	2080876	0x058fa156	3	0.000001	1.0000	1.0000	0.6151	1.0000	0.5000	0.1250	1.00005	2.43	7
+17	26	1	8388608	2097152	2080706	0x04338f74	3	0.000001	1.0000	1.0000	0.6154	1.0000	0.5000	0.1250	0.99997	2.00	12
+18	27	0	16777216	2097152	2089001	0x095e38fe	3	0.000001	1.0000	1.0000	0.5601	1.0000	0.2500	0.0625	1.00002	2.48	12
+19	27	0	16777216	2097152	2088914	0x06fa25cf	3	0.000001	1.0000	1.0000	0.5599	1.0000	0.2500	0.0625	0.99998	-2.19	27
+20	28	1	8388608	2097152	2080721	0x029a3077	3	0.000001	1.0000	1.0000	0.6156	1.0000	0.5000	0.1250	0.99998	-2.11	26
+21	28	1	8388608	2097152	2081033	0x001ea1b6	4	0.000002	1.0000	1.0000	0.6149	1.0000	0.5000	0.1250	1.00013	2.67	15
+22	36	2	4194304	2097152	2064724	0x0cfd1910	4	0.000002	1.0000	1.0000	0.7128	1.0000	1.0000	0.2500	1.00016	-1.69	7
+23	36	2	4194304	2097152	2064729	0x0e8d39a5	4	0.000002	1.0000	1.0000	0.7134	1.0000	1.0000	0.2500	1.00017	2.12	18
+24	39	1	8388608	2097152	2080666	0x07f5b296	3	0.000001	1.0000	1.0000	0.6154	1.0000	0.5000	0.1250	0.99995	-1.47	3
+25	39	1	8388608	2097152	2080855	0x03721473	3	0.000001	1.0000	1.0000	0.6152	1.0000	0.5000	0.1250	1.00004	2.67	18
+26	40	2	4194304	2097152	2064757	0x0d652b7d	4	0.000002	1.0000	1.0000	0.7131	1.0000	1.0000	0.2500	1.00018	2.01	5
+27	40	2	4194304	2097152	2064796	0x0e2a2c8c	4	0.000002	1.0000	1.0000	0.7129	1.0000	1.0000	0.2500	1.00020	1.88	7
+28	52	0	16777216	2097152	2089053	0x02e3b79a	4	0.000002	1.0000	1.0000	0.5597	1.0000	0.2500	0.0625	1.00004	3.61	20
+29	52	0	16777216	2097152	2089018	0x00cf2ad8	3	0.000001	1.0000	1.0000	0.5601	1.0000	0.2500	0.0625	1.00003	1.53	23
+30	56	2	4194304	2097152	2064646	0x06d6a083	4	0.000002	1.0000	1.0000	0.7125	1.0000	1.0000	0.2500	1.00013	1.94	8
+31	56	2	4194304	2097152	2064990	0x05536f11	4	0.000002	1.0000	1.0000	0.7129	1.0000	1.0000	0.2500	1.00029	2.82	23
+# F8 form over the live stream: top 0.1 percent of items hold 0.003129 of reads; flat control 0.003073 (ratio 1.0183x), windowed control 0.003129 (ratio 1.0003x; the gate 1.2x); min site distinct ratio 0.99992 (floors 0.98 and 0.995); worst index bit inside its window 3.61 sigma at site 28 bit 20 (the band 6)
+# program: reads 67108864, distinct items 16434319, worst site 3 address 0x03f3960e in 4 reads (share 0.000002); one cache over the program's reads: 1 GiB 1.0000, 256 MiB 0.4196, 64 MiB 0.1328; the per-site ideal caches summed: 1.0000, 1.0000, 0.6354; 50.6 s
diff --git a/docs/analysis/class-v6/rows/live-dataset-census-1a938abe4/build-6/seed-p27.tsv b/docs/analysis/class-v6/rows/live-dataset-census-1a938abe4/build-6/seed-p27.tsv
new file mode 100644
index 000000000..df09b9754
--- /dev/null
+++ b/docs/analysis/class-v6/rows/live-dataset-census-1a938abe4/build-6/seed-p27.tsv
@@ -0,0 +1,42 @@
+# addrsite: program c38b57d654ad08d4 class mx8-erad810f22d+sh256x27+state+reg64c+fold+rw attempt 0 generator v6 day 2026-10-03 dataset 2^28 words (memory-hard) headers 4 warps 2048 nonces/header 65536 threads 32
+# per (iteration, site) cell: the most read address and its share (A03's form); cells over 0.1 percent listed
+it	site	instr	reads	distinct	top_addr	top_count	top_share
+0	0	3	262144	261997	0x07d1eebf	2	0.000008
+0	1	3	262144	262019	0x0e939f6a	2	0.000008
+# worst cell: iteration 0 site 2 address 0x01c78316 in 3 reads, share 0.000011
+# per site, pooled over the 8 iterations (hit rates: an ideal cache of the site's top K items, K = bytes / 64; exp = min(1, K / window items))
+site	instr	win	window_items	reads	distinct	top_addr	top_count	top_share	hit_1GiB	hit_256MiB	hit_64MiB	exp_1GiB	exp_256MiB	exp_64MiB	distinct_ratio	bit_z_max	bit
+0	3	0	16777216	2097152	2089066	0x038a399f	3	0.000001	1.0000	1.0000	0.5600	1.0000	0.2500	0.0625	1.00005	2.10	6
+1	3	0	16777216	2097152	2089052	0x00223010	3	0.000001	1.0000	1.0000	0.5598	1.0000	0.2500	0.0625	1.00004	-2.32	1
+2	5	1	8388608	2097152	2080951	0x031a0ba8	4	0.000002	1.0000	1.0000	0.6148	1.0000	0.5000	0.1250	1.00009	-2.01	1
+3	5	1	8388608	2097152	2080827	0x01cef2a6	3	0.000001	1.0000	1.0000	0.6154	1.0000	0.5000	0.1250	1.00003	1.85	25
+4	6	0	16777216	2097152	2088908	0x06f84932	3	0.000001	1.0000	1.0000	0.5600	1.0000	0.2500	0.0625	0.99998	-1.71	12
+5	6	0	16777216	2097152	2089038	0x0a9f3c2e	3	0.000001	1.0000	1.0000	0.5600	1.0000	0.2500	0.0625	1.00004	1.74	16
+6	8	2	4194304	2097152	2064774	0x06a7b797	4	0.000002	1.0000	1.0000	0.7130	1.0000	1.0000	0.2500	1.00019	2.13	23
+7	8	2	4194304	2097152	2065283	0x0540406b	4	0.000002	1.0000	1.0000	0.7129	1.0000	1.0000	0.2500	1.00044	-2.06	24
+8	18	0	16777216	2097152	2088890	0x0bf8b2ea	3	0.000001	1.0000	1.0000	0.5600	1.0000	0.2500	0.0625	0.99997	-2.90	16
+9	18	0	16777216	2097152	2088889	0x0ef39ae7	3	0.000001	1.0000	1.0000	0.5599	1.0000	0.2500	0.0625	0.99997	-1.77	20
+10	20	0	16777216	2097152	2088949	0x092b13a6	3	0.000001	1.0000	1.0000	0.5599	1.0000	0.2500	0.0625	0.99999	2.27	3
+11	20	0	16777216	2097152	2089093	0x062cbd71	3	0.000001	1.0000	1.0000	0.5599	1.0000	0.2500	0.0625	1.00006	-1.74	26
+12	39	1	8388608	2097152	2080772	0x045ba978	4	0.000002	1.0000	1.0000	0.6154	1.0000	0.5000	0.1250	1.00000	-2.34	14
+13	39	1	8388608	2097152	2080878	0x00133859	3	0.000001	1.0000	1.0000	0.6153	1.0000	0.5000	0.1250	1.00005	2.22	9
+14	45	1	8388608	2097152	2081020	0x0f39bd80	3	0.000001	1.0000	1.0000	0.6154	1.0000	0.5000	0.1250	1.00012	-2.29	2
+15	45	1	8388608	2097152	2080852	0x09dc13e3	3	0.000001	1.0000	1.0000	0.6153	1.0000	0.5000	0.1250	1.00004	2.11	0
+16	47	1	8388608	2097152	2080863	0x09e38573	3	0.000001	1.0000	1.0000	0.6152	1.0000	0.5000	0.1250	1.00005	-1.93	13
+17	47	1	8388608	2097152	2080695	0x0ccd34c5	3	0.000001	1.0000	1.0000	0.6157	1.0000	0.5000	0.1250	0.99996	2.01	20
+18	48	0	16777216	2097152	2088968	0x0ec9cce7	3	0.000001	1.0000	1.0000	0.5599	1.0000	0.2500	0.0625	1.00000	2.79	23
+19	48	0	16777216	2097152	2089007	0x07a0a4f2	3	0.000001	1.0000	1.0000	0.5599	1.0000	0.2500	0.0625	1.00002	1.83	7
+20	50	1	8388608	2097152	2080975	0x05fd559e	3	0.000001	1.0000	1.0000	0.6149	1.0000	0.5000	0.1250	1.00010	-2.56	19
+21	50	1	8388608	2097152	2080734	0x0286bedb	3	0.000001	1.0000	1.0000	0.6151	1.0000	0.5000	0.1250	0.99998	2.80	1
+22	51	0	16777216	2097152	2089049	0x0121e88c	3	0.000001	1.0000	1.0000	0.5599	1.0000	0.2500	0.0625	1.00004	-2.09	9
+23	51	0	16777216	2097152	2088846	0x0732038a	3	0.000001	1.0000	1.0000	0.5602	1.0000	0.2500	0.0625	0.99995	2.45	19
+24	53	0	16777216	2097152	2088905	0x0b3dfd67	3	0.000001	1.0000	1.0000	0.5599	1.0000	0.2500	0.0625	0.99997	-1.75	9
+25	53	0	16777216	2097152	2088998	0x0872ca75	3	0.000001	1.0000	1.0000	0.5601	1.0000	0.2500	0.0625	1.00002	-2.30	5
+26	54	1	8388608	2097152	2080735	0x00baa42d	3	0.000001	1.0000	1.0000	0.6151	1.0000	0.5000	0.1250	0.99998	-2.13	6
+27	54	1	8388608	2097152	2080896	0x0566331d	3	0.000001	1.0000	1.0000	0.6150	1.0000	0.5000	0.1250	1.00006	2.38	25
+28	59	2	4194304	2097152	2064408	0x0e2a3d91	4	0.000002	1.0000	1.0000	0.7133	1.0000	1.0000	0.2500	1.00001	2.85	13
+29	59	2	4194304	2097152	2064617	0x0f88d3d4	3	0.000001	1.0000	1.0000	0.7128	1.0000	1.0000	0.2500	1.00011	2.61	7
+30	63	1	8388608	2097152	2080907	0x03195a58	4	0.000002	1.0000	1.0000	0.6153	1.0000	0.5000	0.1250	1.00007	2.18	5
+31	63	1	8388608	2097152	2080916	0x030e7e56	3	0.000001	1.0000	1.0000	0.6152	1.0000	0.5000	0.1250	1.00007	-2.03	6
+# F8 form over the live stream: top 0.1 percent of items hold 0.003348 of reads; flat control 0.003079 (ratio 1.0873x), windowed control 0.003344 (ratio 1.0010x; the gate 1.2x); min site distinct ratio 0.99995 (floors 0.98 and 0.995); worst index bit inside its window -2.90 sigma at site 8 bit 16 (the band 6)
+# program: reads 67108864, distinct items 16328481, worst site 2 address 0x031a0ba8 in 4 reads (share 0.000002); one cache over the program's reads: 1 GiB 1.0000, 256 MiB 0.4343, 64 MiB 0.1396; the per-site ideal caches summed: 1.0000, 1.0000, 0.6033; 50.8 s
diff --git a/docs/analysis/class-v6/rows/live-dataset-census-1a938abe4/build-6/seed-p28.tsv b/docs/analysis/class-v6/rows/live-dataset-census-1a938abe4/build-6/seed-p28.tsv
new file mode 100644
index 000000000..7dc94cebe
--- /dev/null
+++ b/docs/analysis/class-v6/rows/live-dataset-census-1a938abe4/build-6/seed-p28.tsv
@@ -0,0 +1,42 @@
+# addrsite: program 96e4f7fdccef6fd1 class mx8-erad810f22d+sh256x27+state+reg64c+fold+rw attempt 0 generator v6 day 2026-10-03 dataset 2^28 words (memory-hard) headers 4 warps 2048 nonces/header 65536 threads 32
+# per (iteration, site) cell: the most read address and its share (A03's form); cells over 0.1 percent listed
+it	site	instr	reads	distinct	top_addr	top_count	top_share
+0	0	4	262144	262014	0x0fef6e9b	2	0.000008
+0	1	4	262144	262012	0x0c0fc40d	2	0.000008
+# worst cell: iteration 0 site 7 address 0x03149070 in 3 reads, share 0.000011
+# per site, pooled over the 8 iterations (hit rates: an ideal cache of the site's top K items, K = bytes / 64; exp = min(1, K / window items))
+site	instr	win	window_items	reads	distinct	top_addr	top_count	top_share	hit_1GiB	hit_256MiB	hit_64MiB	exp_1GiB	exp_256MiB	exp_64MiB	distinct_ratio	bit_z_max	bit
+0	4	0	16777216	2097152	2088962	0x0f297121	3	0.000001	1.0000	1.0000	0.5601	1.0000	0.2500	0.0625	1.00000	-2.85	15
+1	4	0	16777216	2097152	2088985	0x0ed393d0	3	0.000001	1.0000	1.0000	0.5601	1.0000	0.2500	0.0625	1.00001	-3.21	1
+2	8	1	8388608	2097152	2080764	0x030525f1	4	0.000002	1.0000	1.0000	0.6153	1.0000	0.5000	0.1250	1.00000	3.54	3
+3	8	1	8388608	2097152	2080858	0x067bb746	3	0.000001	1.0000	1.0000	0.6149	1.0000	0.5000	0.1250	1.00004	-2.62	18
+4	9	2	4194304	2097152	2064518	0x0dd0a987	4	0.000002	1.0000	1.0000	0.7132	1.0000	1.0000	0.2500	1.00006	-2.41	18
+5	9	2	4194304	2097152	2064686	0x0ec38ef5	4	0.000002	1.0000	1.0000	0.7130	1.0000	1.0000	0.2500	1.00015	-2.48	7
+6	11	2	4194304	2097152	2064652	0x003f4555	4	0.000002	1.0000	1.0000	0.7133	1.0000	1.0000	0.2500	1.00013	-2.27	0
+7	11	2	4194304	2097152	2064759	0x03c88d86	4	0.000002	1.0000	1.0000	0.7131	1.0000	1.0000	0.2500	1.00018	2.18	5
+8	12	0	16777216	2097152	2088812	0x0b0da342	3	0.000001	1.0000	1.0000	0.5598	1.0000	0.2500	0.0625	0.99993	1.96	10
+9	12	0	16777216	2097152	2089058	0x068f7410	3	0.000001	1.0000	1.0000	0.5599	1.0000	0.2500	0.0625	1.00005	-2.50	13
+10	23	0	16777216	2097152	2088888	0x0089f2ab	3	0.000001	1.0000	1.0000	0.5601	1.0000	0.2500	0.0625	0.99997	1.50	15
+11	23	0	16777216	2097152	2088888	0x06daaad0	3	0.000001	1.0000	1.0000	0.5601	1.0000	0.2500	0.0625	0.99997	-1.89	0
+12	24	1	8388608	2097152	2080872	0x043fe3db	3	0.000001	1.0000	1.0000	0.6154	1.0000	0.5000	0.1250	1.00005	-1.85	15
+13	24	1	8388608	2097152	2080950	0x01ffb71c	3	0.000001	1.0000	1.0000	0.6153	1.0000	0.5000	0.1250	1.00009	-3.46	6
+14	26	1	8388608	2097152	2080924	0x0ceac1e0	3	0.000001	1.0000	1.0000	0.6152	1.0000	0.5000	0.1250	1.00007	1.83	4
+15	26	1	8388608	2097152	2080753	0x0f54ef61	3	0.000001	1.0000	1.0000	0.6152	1.0000	0.5000	0.1250	0.99999	-1.66	23
+16	27	2	4194304	2097152	2064761	0x06ea3773	4	0.000002	1.0000	1.0000	0.7126	1.0000	1.0000	0.2500	1.00018	-1.84	3
+17	27	2	4194304	2097152	2064907	0x04b668aa	4	0.000002	1.0000	1.0000	0.7133	1.0000	1.0000	0.2500	1.00025	-1.92	5
+18	30	1	8388608	2097152	2080959	0x02a62f63	3	0.000001	1.0000	1.0000	0.6149	1.0000	0.5000	0.1250	1.00009	-2.76	20
+19	30	1	8388608	2097152	2080936	0x03b294e3	4	0.000002	1.0000	1.0000	0.6152	1.0000	0.5000	0.1250	1.00008	2.59	12
+20	37	0	16777216	2097152	2089043	0x07e38f1d	3	0.000001	1.0000	1.0000	0.5599	1.0000	0.2500	0.0625	1.00004	-3.09	0
+21	37	0	16777216	2097152	2088987	0x07cc45d0	3	0.000001	1.0000	1.0000	0.5597	1.0000	0.2500	0.0625	1.00001	2.34	1
+22	39	2	4194304	2097152	2064545	0x00823b70	4	0.000002	1.0000	1.0000	0.7132	1.0000	1.0000	0.2500	1.00008	2.16	5
+23	39	2	4194304	2097152	2064803	0x00354b28	4	0.000002	1.0000	1.0000	0.7131	1.0000	1.0000	0.2500	1.00020	2.46	22
+24	44	0	16777216	2097152	2089015	0x0f9cd92e	3	0.000001	1.0000	1.0000	0.5600	1.0000	0.2500	0.0625	1.00003	2.14	16
+25	44	0	16777216	2097152	2088808	0x0237ee9c	3	0.000001	1.0000	1.0000	0.5600	1.0000	0.2500	0.0625	0.99993	-3.99	11
+26	52	2	4194304	2097152	2065077	0x0b35596e	4	0.000002	1.0000	1.0000	0.7130	1.0000	1.0000	0.2500	1.00034	2.05	4
+27	52	2	4194304	2097152	2064762	0x09ecc32b	4	0.000002	1.0000	1.0000	0.7129	1.0000	1.0000	0.2500	1.00018	2.29	10
+28	53	1	8388608	2097152	2080801	0x0b3620c0	3	0.000001	1.0000	1.0000	0.6152	1.0000	0.5000	0.1250	1.00002	2.45	9
+29	53	1	8388608	2097152	2080894	0x0a454d53	3	0.000001	1.0000	1.0000	0.6155	1.0000	0.5000	0.1250	1.00006	-1.99	14
+30	63	2	4194304	2097152	2064520	0x034a2155	4	0.000002	1.0000	1.0000	0.7132	1.0000	1.0000	0.2500	1.00007	-2.38	25
+31	63	2	4194304	2097152	2064832	0x02c50431	4	0.000002	1.0000	1.0000	0.7126	1.0000	1.0000	0.2500	1.00022	1.66	14
+# F8 form over the live stream: top 0.1 percent of items hold 0.003499 of reads; flat control 0.003071 (ratio 1.1396x), windowed control 0.003498 (ratio 1.0005x; the gate 1.2x); min site distinct ratio 0.99993 (floors 0.98 and 0.995); worst index bit inside its window -3.99 sigma at site 25 bit 11 (the band 6)
+# program: reads 67108864, distinct items 16340448, worst site 2 address 0x030525f1 in 4 reads (share 0.000002); one cache over the program's reads: 1 GiB 1.0000, 256 MiB 0.4400, 64 MiB 0.1434; the per-site ideal caches summed: 1.0000, 1.0000, 0.6346; 50.1 s
diff --git a/docs/analysis/class-v6/rows/live-dataset-census-1a938abe4/build-6/seed-p29.tsv b/docs/analysis/class-v6/rows/live-dataset-census-1a938abe4/build-6/seed-p29.tsv
new file mode 100644
index 000000000..4242f99a1
--- /dev/null
+++ b/docs/analysis/class-v6/rows/live-dataset-census-1a938abe4/build-6/seed-p29.tsv
@@ -0,0 +1,42 @@
+# addrsite: program 3f922ac24b46d2c2 class mx8-erad810f22d+sh256x27+state+reg64c+fold+rw attempt 1 generator v6 day 2026-10-03 dataset 2^28 words (memory-hard) headers 4 warps 2048 nonces/header 65536 threads 32
+# per (iteration, site) cell: the most read address and its share (A03's form); cells over 0.1 percent listed
+it	site	instr	reads	distinct	top_addr	top_count	top_share
+0	0	3	262144	261878	0x0c2ec6c7	2	0.000008
+0	1	3	262144	261865	0x0ef15836	3	0.000011
+# worst cell: iteration 0 site 1 address 0x0ef15836 in 3 reads, share 0.000011
+# per site, pooled over the 8 iterations (hit rates: an ideal cache of the site's top K items, K = bytes / 64; exp = min(1, K / window items))
+site	instr	win	window_items	reads	distinct	top_addr	top_count	top_share	hit_1GiB	hit_256MiB	hit_64MiB	exp_1GiB	exp_256MiB	exp_64MiB	distinct_ratio	bit_z_max	bit
+0	3	1	8388608	2097152	2080901	0x0b8c7476	3	0.000001	1.0000	1.0000	0.6148	1.0000	0.5000	0.1250	1.00006	2.12	3
+1	3	1	8388608	2097152	2080842	0x0e0e9857	3	0.000001	1.0000	1.0000	0.6156	1.0000	0.5000	0.1250	1.00004	-2.70	13
+2	6	0	16777216	2097152	2088910	0x0ccf2db5	3	0.000001	1.0000	1.0000	0.5598	1.0000	0.2500	0.0625	0.99998	2.21	22
+3	6	0	16777216	2097152	2088975	0x067df852	3	0.000001	1.0000	1.0000	0.5602	1.0000	0.2500	0.0625	1.00001	2.42	23
+4	9	0	16777216	2097152	2088942	0x0b41129a	3	0.000001	1.0000	1.0000	0.5602	1.0000	0.2500	0.0625	0.99999	1.71	0
+5	9	0	16777216	2097152	2088972	0x07e0c715	3	0.000001	1.0000	1.0000	0.5603	1.0000	0.2500	0.0625	1.00001	-2.30	24
+6	11	0	16777216	2097152	2088998	0x0b5b69b9	3	0.000001	1.0000	1.0000	0.5598	1.0000	0.2500	0.0625	1.00002	2.44	17
+7	11	0	16777216	2097152	2088921	0x0e92f974	4	0.000002	1.0000	1.0000	0.5601	1.0000	0.2500	0.0625	0.99998	1.98	14
+8	12	0	16777216	2097152	2088931	0x0d9e4e72	3	0.000001	1.0000	1.0000	0.5598	1.0000	0.2500	0.0625	0.99999	-1.66	5
+9	12	0	16777216	2097152	2088899	0x043a0980	3	0.000001	1.0000	1.0000	0.5600	1.0000	0.2500	0.0625	0.99997	-1.73	13
+10	19	1	8388608	2097152	2081053	0x0d78029b	4	0.000002	1.0000	1.0000	0.6148	1.0000	0.5000	0.1250	1.00014	1.94	1
+11	19	1	8388608	2097152	2080725	0x09ff33fa	3	0.000001	1.0000	1.0000	0.6154	1.0000	0.5000	0.1250	0.99998	1.97	8
+12	21	1	8388608	2097152	2080850	0x085bed84	3	0.000001	1.0000	1.0000	0.6154	1.0000	0.5000	0.1250	1.00004	2.29	20
+13	21	1	8388608	2097152	2080735	0x0cfb8ada	4	0.000002	1.0000	1.0000	0.6155	1.0000	0.5000	0.1250	0.99998	-1.89	25
+14	28	0	16777216	2097152	2089104	0x010e3e04	3	0.000001	1.0000	1.0000	0.5602	1.0000	0.2500	0.0625	1.00007	2.81	26
+15	28	0	16777216	2097152	2089028	0x0ff2d25e	3	0.000001	1.0000	1.0000	0.5600	1.0000	0.2500	0.0625	1.00003	2.24	16
+16	34	2	4194304	2097152	2064689	0x0226eb19	3	0.000001	1.0000	1.0000	0.7134	1.0000	1.0000	0.2500	1.00015	2.50	12
+17	34	2	4194304	2097152	2064744	0x02f7f431	4	0.000002	1.0000	1.0000	0.7127	1.0000	1.0000	0.2500	1.00017	-2.07	3
+18	37	2	4194304	2097152	2064562	0x04069af3	4	0.000002	1.0000	1.0000	0.7132	1.0000	1.0000	0.2500	1.00009	-2.93	23
+19	37	2	4194304	2097152	2064860	0x077eea20	4	0.000002	1.0000	1.0000	0.7129	1.0000	1.0000	0.2500	1.00023	-2.24	19
+20	50	2	4194304	2097152	2064569	0x0b2e4e25	4	0.000002	1.0000	1.0000	0.7129	1.0000	1.0000	0.2500	1.00009	2.76	6
+21	50	2	4194304	2097152	2064719	0x0a183716	4	0.000002	1.0000	1.0000	0.7134	1.0000	1.0000	0.2500	1.00016	-2.06	23
+22	53	2	4194304	2097152	2064699	0x0739628d	4	0.000002	1.0000	1.0000	0.7131	1.0000	1.0000	0.2500	1.00015	-1.62	21
+23	53	2	4194304	2097152	2064379	0x068d23d5	4	0.000002	1.0000	1.0000	0.7132	1.0000	1.0000	0.2500	1.00000	-1.92	15
+24	55	0	16777216	2097152	2089025	0x04daf1b2	3	0.000001	1.0000	1.0000	0.5599	1.0000	0.2500	0.0625	1.00003	-1.69	2
+25	55	0	16777216	2097152	2089136	0x0f760a24	3	0.000001	1.0000	1.0000	0.5598	1.0000	0.2500	0.0625	1.00008	3.00	18
+26	57	1	8388608	2097152	2081024	0x01e33a42	4	0.000002	1.0000	1.0000	0.6152	1.0000	0.5000	0.1250	1.00012	1.65	10
+27	57	1	8388608	2097152	2080955	0x033c7675	4	0.000002	1.0000	1.0000	0.6153	1.0000	0.5000	0.1250	1.00009	2.57	4
+28	59	2	4194304	2097152	2064717	0x0ec174b6	3	0.000001	1.0000	1.0000	0.7130	1.0000	1.0000	0.2500	1.00016	2.24	2
+29	59	2	4194304	2097152	2064609	0x0e2fdb21	4	0.000002	1.0000	1.0000	0.7128	1.0000	1.0000	0.2500	1.00011	2.69	12
+30	62	1	8388608	2097152	2080947	0x0ae4acab	3	0.000001	1.0000	1.0000	0.6151	1.0000	0.5000	0.1250	1.00009	1.96	10
+31	62	1	8388608	2097152	2080771	0x0d5adff3	3	0.000001	1.0000	1.0000	0.6150	1.0000	0.5000	0.1250	1.00000	-1.68	7
+# F8 form over the live stream: top 0.1 percent of items hold 0.003169 of reads; flat control 0.003069 (ratio 1.0326x), windowed control 0.003168 (ratio 1.0004x; the gate 1.2x); min site distinct ratio 0.99997 (floors 0.98 and 0.995); worst index bit inside its window 3.00 sigma at site 25 bit 18 (the band 6)
+# program: reads 67108864, distinct items 16398093, worst site 7 address 0x0e92f974 in 4 reads (share 0.000002); one cache over the program's reads: 1 GiB 1.0000, 256 MiB 0.4241, 64 MiB 0.1350; the per-site ideal caches summed: 1.0000, 1.0000, 0.6251; 50.5 s
diff --git a/docs/analysis/class-v6/rows/live-dataset-census-1a938abe4/build-6/seed-p30.tsv b/docs/analysis/class-v6/rows/live-dataset-census-1a938abe4/build-6/seed-p30.tsv
new file mode 100644
index 000000000..df7d7f252
--- /dev/null
+++ b/docs/analysis/class-v6/rows/live-dataset-census-1a938abe4/build-6/seed-p30.tsv
@@ -0,0 +1,42 @@
+# addrsite: program edd13a08477407cf class mx8-erad810f22d+sh256x27+state+reg64c+fold+rw attempt 0 generator v6 day 2026-10-03 dataset 2^28 words (memory-hard) headers 4 warps 2048 nonces/header 65536 threads 32
+# per (iteration, site) cell: the most read address and its share (A03's form); cells over 0.1 percent listed
+it	site	instr	reads	distinct	top_addr	top_count	top_share
+0	0	2	262144	261596	0x0e92237a	3	0.000011
+0	1	2	262144	261624	0x0e452649	3	0.000011
+# worst cell: iteration 0 site 0 address 0x0e92237a in 3 reads, share 0.000011
+# per site, pooled over the 8 iterations (hit rates: an ideal cache of the site's top K items, K = bytes / 64; exp = min(1, K / window items))
+site	instr	win	window_items	reads	distinct	top_addr	top_count	top_share	hit_1GiB	hit_256MiB	hit_64MiB	exp_1GiB	exp_256MiB	exp_64MiB	distinct_ratio	bit_z_max	bit
+0	2	2	4194304	2097152	2064660	0x0e3a012d	4	0.000002	1.0000	1.0000	0.7135	1.0000	1.0000	0.2500	1.00013	-2.13	19
+1	2	2	4194304	2097152	2064792	0x0efd0e64	4	0.000002	1.0000	1.0000	0.7130	1.0000	1.0000	0.2500	1.00020	-1.88	10
+2	3	0	16777216	2097152	2089026	0x089fe2f1	3	0.000001	1.0000	1.0000	0.5601	1.0000	0.2500	0.0625	1.00003	-2.04	19
+3	3	0	16777216	2097152	2088866	0x0f538658	3	0.000001	1.0000	1.0000	0.5600	1.0000	0.2500	0.0625	0.99996	2.06	2
+4	5	1	8388608	2097152	2081083	0x0113a588	4	0.000002	1.0000	1.0000	0.6155	1.0000	0.5000	0.1250	1.00015	2.59	26
+5	5	1	8388608	2097152	2080739	0x00b80889	3	0.000001	1.0000	1.0000	0.6151	1.0000	0.5000	0.1250	0.99999	-1.31	1
+6	7	2	4194304	2097152	2064766	0x06e15152	4	0.000002	1.0000	1.0000	0.7129	1.0000	1.0000	0.2500	1.00019	-1.63	1
+7	7	2	4194304	2097152	2064743	0x075b8ab1	4	0.000002	1.0000	1.0000	0.7130	1.0000	1.0000	0.2500	1.00017	1.80	0
+8	10	2	4194304	2097152	2064536	0x0aa9d2e5	4	0.000002	1.0000	1.0000	0.7130	1.0000	1.0000	0.2500	1.00007	-1.82	14
+9	10	2	4194304	2097152	2064775	0x0a458569	4	0.000002	1.0000	1.0000	0.7129	1.0000	1.0000	0.2500	1.00019	-2.15	3
+10	12	2	4194304	2097152	2064772	0x047b5d50	4	0.000002	1.0000	1.0000	0.7132	1.0000	1.0000	0.2500	1.00019	1.72	6
+11	12	2	4194304	2097152	2064471	0x072c3ae9	4	0.000002	1.0000	1.0000	0.7131	1.0000	1.0000	0.2500	1.00004	-2.31	18
+12	14	0	16777216	2097152	2089071	0x07f185e5	3	0.000001	1.0000	1.0000	0.5599	1.0000	0.2500	0.0625	1.00005	2.53	14
+13	14	0	16777216	2097152	2089027	0x0551ac9e	4	0.000002	1.0000	1.0000	0.5604	1.0000	0.2500	0.0625	1.00003	1.99	3
+14	35	1	8388608	2097152	2081160	0x071cdd6f	4	0.000002	1.0000	1.0000	0.6152	1.0000	0.5000	0.1250	1.00019	-1.66	12
+15	35	1	8388608	2097152	2080869	0x028dc39f	3	0.000001	1.0000	1.0000	0.6151	1.0000	0.5000	0.1250	1.00005	-2.47	4
+16	41	0	16777216	2097152	2088900	0x070d37d0	3	0.000001	1.0000	1.0000	0.5601	1.0000	0.2500	0.0625	0.99997	2.48	12
+17	41	0	16777216	2097152	2089041	0x05e5c1d2	3	0.000001	1.0000	1.0000	0.5599	1.0000	0.2500	0.0625	1.00004	2.13	24
+18	42	0	16777216	2097152	2089192	0x0f074fdc	3	0.000001	1.0000	1.0000	0.5600	1.0000	0.2500	0.0625	1.00011	1.85	11
+19	42	0	16777216	2097152	2089007	0x05de0df0	3	0.000001	1.0000	1.0000	0.5600	1.0000	0.2500	0.0625	1.00002	-2.08	25
+20	49	2	4194304	2097152	2064790	0x08b805dd	4	0.000002	1.0000	1.0000	0.7129	1.0000	1.0000	0.2500	1.00020	1.78	15
+21	49	2	4194304	2097152	2064415	0x08429932	4	0.000002	1.0000	1.0000	0.7131	1.0000	1.0000	0.2500	1.00002	-2.19	18
+22	50	0	16777216	2097152	2088881	0x03d794a9	4	0.000002	1.0000	1.0000	0.5601	1.0000	0.2500	0.0625	0.99996	1.81	2
+23	50	0	16777216	2097152	2088771	0x0906f3bb	3	0.000001	1.0000	1.0000	0.5602	1.0000	0.2500	0.0625	0.99991	2.30	16
+24	54	2	4194304	2097152	2064447	0x01174ec0	4	0.000002	1.0000	1.0000	0.7131	1.0000	1.0000	0.2500	1.00003	-2.38	19
+25	54	2	4194304	2097152	2064637	0x00f5480b	4	0.000002	1.0000	1.0000	0.7131	1.0000	1.0000	0.2500	1.00012	1.97	15
+26	56	0	16777216	2097152	2088993	0x0248a45d	3	0.000001	1.0000	1.0000	0.5601	1.0000	0.2500	0.0625	1.00002	2.31	22
+27	56	0	16777216	2097152	2089061	0x0e415537	4	0.000002	1.0000	1.0000	0.5599	1.0000	0.2500	0.0625	1.00005	2.14	18
+28	58	1	8388608	2097152	2080959	0x03cc4951	3	0.000001	1.0000	1.0000	0.6151	1.0000	0.5000	0.1250	1.00009	-1.96	24
+29	58	1	8388608	2097152	2080841	0x0780a964	4	0.000002	1.0000	1.0000	0.6153	1.0000	0.5000	0.1250	1.00004	-2.22	19
+30	62	0	16777216	2097152	2089002	0x034a75de	3	0.000001	1.0000	1.0000	0.5600	1.0000	0.2500	0.0625	1.00002	-2.32	5
+31	62	0	16777216	2097152	2089002	0x0f5d6282	3	0.000001	1.0000	1.0000	0.5600	1.0000	0.2500	0.0625	1.00002	-2.03	6
+# F8 form over the live stream: top 0.1 percent of items hold 0.003348 of reads; flat control 0.003069 (ratio 1.0910x), windowed control 0.003355 (ratio 0.9981x; the gate 1.2x); min site distinct ratio 0.99991 (floors 0.98 and 0.995); worst index bit inside its window 2.59 sigma at site 4 bit 26 (the band 6)
+# program: reads 67108864, distinct items 16327902, worst site 0 address 0x0e3a012d in 4 reads (share 0.000002); one cache over the program's reads: 1 GiB 1.0000, 256 MiB 0.4343, 64 MiB 0.1395; the per-site ideal caches summed: 1.0000, 1.0000, 0.6278; 50.7 s
diff --git a/docs/analysis/class-v6/rows/live-dataset-census-1a938abe4/build-6/seed-p31.tsv b/docs/analysis/class-v6/rows/live-dataset-census-1a938abe4/build-6/seed-p31.tsv
new file mode 100644
index 000000000..ac1d3bba3
--- /dev/null
+++ b/docs/analysis/class-v6/rows/live-dataset-census-1a938abe4/build-6/seed-p31.tsv
@@ -0,0 +1,42 @@
+# addrsite: program e1409749e795c382 class mx8-erad810f22d+sh256x27+state+reg64c+fold+rw attempt 0 generator v6 day 2026-10-03 dataset 2^28 words (memory-hard) headers 4 warps 2048 nonces/header 65536 threads 32
+# per (iteration, site) cell: the most read address and its share (A03's form); cells over 0.1 percent listed
+it	site	instr	reads	distinct	top_addr	top_count	top_share
+0	0	1	262144	261603	0x0f8c1753	3	0.000011
+0	1	1	262144	261651	0x0d5543d7	3	0.000011
+# worst cell: iteration 0 site 0 address 0x0f8c1753 in 3 reads, share 0.000011
+# per site, pooled over the 8 iterations (hit rates: an ideal cache of the site's top K items, K = bytes / 64; exp = min(1, K / window items))
+site	instr	win	window_items	reads	distinct	top_addr	top_count	top_share	hit_1GiB	hit_256MiB	hit_64MiB	exp_1GiB	exp_256MiB	exp_64MiB	distinct_ratio	bit_z_max	bit
+0	1	2	4194304	2097152	2064417	0x0d3d1622	4	0.000002	1.0000	1.0000	0.7128	1.0000	1.0000	0.2500	1.00002	3.14	14
+1	1	2	4194304	2097152	2064840	0x0fa5865f	4	0.000002	1.0000	1.0000	0.7134	1.0000	1.0000	0.2500	1.00022	-2.46	6
+2	3	1	8388608	2097152	2080966	0x03d01c00	4	0.000002	1.0000	1.0000	0.6154	1.0000	0.5000	0.1250	1.00010	-2.56	14
+3	3	1	8388608	2097152	2080827	0x01743ea9	3	0.000001	1.0000	1.0000	0.6150	1.0000	0.5000	0.1250	1.00003	2.27	10
+4	4	1	8388608	2097152	2080757	0x07072358	3	0.000001	1.0000	1.0000	0.6149	1.0000	0.5000	0.1250	0.99999	-1.68	10
+5	4	1	8388608	2097152	2080892	0x02f59100	4	0.000002	1.0000	1.0000	0.6149	1.0000	0.5000	0.1250	1.00006	-2.12	23
+6	7	1	8388608	2097152	2080928	0x039d6050	4	0.000002	1.0000	1.0000	0.6153	1.0000	0.5000	0.1250	1.00008	-3.16	18
+7	7	1	8388608	2097152	2080806	0x04c9f0c0	4	0.000002	1.0000	1.0000	0.6150	1.0000	0.5000	0.1250	1.00002	-3.23	21
+8	11	1	8388608	2097152	2080660	0x0f16f53b	3	0.000001	1.0000	1.0000	0.6150	1.0000	0.5000	0.1250	0.99995	2.46	21
+9	11	1	8388608	2097152	2080780	0x0db21bbc	3	0.000001	1.0000	1.0000	0.6152	1.0000	0.5000	0.1250	1.00001	3.16	20
+10	12	0	16777216	2097152	2088897	0x066eced5	3	0.000001	1.0000	1.0000	0.5600	1.0000	0.2500	0.0625	0.99997	-2.05	11
+11	12	0	16777216	2097152	2088940	0x0a429328	3	0.000001	1.0000	1.0000	0.5602	1.0000	0.2500	0.0625	0.99999	-2.17	25
+12	13	0	16777216	2097152	2088856	0x083b252d	3	0.000001	1.0000	1.0000	0.5600	1.0000	0.2500	0.0625	0.99995	-3.06	8
+13	13	0	16777216	2097152	2088909	0x00cf618b	3	0.000001	1.0000	1.0000	0.5598	1.0000	0.2500	0.0625	0.99998	2.43	25
+14	21	0	16777216	2097152	2089005	0x0987e15e	3	0.000001	1.0000	1.0000	0.5600	1.0000	0.2500	0.0625	1.00002	-2.48	1
+15	21	0	16777216	2097152	2089048	0x0521f8d9	3	0.000001	1.0000	1.0000	0.5599	1.0000	0.2500	0.0625	1.00004	2.42	26
+16	28	0	16777216	2097152	2089052	0x076ce703	3	0.000001	1.0000	1.0000	0.5602	1.0000	0.2500	0.0625	1.00004	-1.85	0
+17	28	0	16777216	2097152	2088783	0x0294ce2e	3	0.000001	1.0000	1.0000	0.5599	1.0000	0.2500	0.0625	0.99992	2.21	23
+18	41	1	8388608	2097152	2080761	0x0aa1f1bb	3	0.000001	1.0000	1.0000	0.6150	1.0000	0.5000	0.1250	1.00000	-2.71	6
+19	41	1	8388608	2097152	2080520	0x0e3e5fbc	3	0.000001	1.0000	1.0000	0.6153	1.0000	0.5000	0.1250	0.99988	-2.07	17
+20	43	2	4194304	2097152	2064966	0x0aff5e6c	4	0.000002	1.0000	1.0000	0.7131	1.0000	1.0000	0.2500	1.00028	-3.05	3
+21	43	2	4194304	2097152	2064713	0x0947d9e2	4	0.000002	1.0000	1.0000	0.7130	1.0000	1.0000	0.2500	1.00016	-2.94	10
+22	47	0	16777216	2097152	2088775	0x09c797b7	3	0.000001	1.0000	1.0000	0.5601	1.0000	0.2500	0.0625	0.99991	-2.99	11
+23	47	0	16777216	2097152	2088930	0x0cd8eb21	3	0.000001	1.0000	1.0000	0.5600	1.0000	0.2500	0.0625	0.99999	2.00	17
+24	54	1	8388608	2097152	2080730	0x0a57503c	3	0.000001	1.0000	1.0000	0.6150	1.0000	0.5000	0.1250	0.99998	3.06	0
+25	54	1	8388608	2097152	2080989	0x0c0438a7	3	0.000001	1.0000	1.0000	0.6152	1.0000	0.5000	0.1250	1.00011	-1.78	23
+26	56	2	4194304	2097152	2064734	0x0939f6e7	4	0.000002	1.0000	1.0000	0.7127	1.0000	1.0000	0.2500	1.00017	-1.76	5
+27	56	2	4194304	2097152	2064767	0x089d01aa	4	0.000002	1.0000	1.0000	0.7135	1.0000	1.0000	0.2500	1.00019	1.85	15
+28	61	1	8388608	2097152	2081039	0x09fd07dd	3	0.000001	1.0000	1.0000	0.6149	1.0000	0.5000	0.1250	1.00013	-2.61	14
+29	61	1	8388608	2097152	2080997	0x0d5cf9e2	3	0.000001	1.0000	1.0000	0.6153	1.0000	0.5000	0.1250	1.00011	2.21	5
+30	62	0	16777216	2097152	2089098	0x06ff173a	3	0.000001	1.0000	1.0000	0.5599	1.0000	0.2500	0.0625	1.00007	2.65	14
+31	62	0	16777216	2097152	2088898	0x0b984754	3	0.000001	1.0000	1.0000	0.5601	1.0000	0.2500	0.0625	0.99997	-2.51	25
+# F8 form over the live stream: top 0.1 percent of items hold 0.003432 of reads; flat control 0.003075 (ratio 1.1164x), windowed control 0.003435 (ratio 0.9992x; the gate 1.2x); min site distinct ratio 0.99988 (floors 0.98 and 0.995); worst index bit inside its window -3.23 sigma at site 7 bit 21 (the band 6)
+# program: reads 67108864, distinct items 16295937, worst site 0 address 0x0d3d1622 in 4 reads (share 0.000002); one cache over the program's reads: 1 GiB 1.0000, 256 MiB 0.4417, 64 MiB 0.1425; the per-site ideal caches summed: 1.0000, 1.0000, 0.6128; 50.5 s
diff --git a/docs/analysis/class-v6/rows/live-dataset-census-1a938abe4/build-6/seed-p32.tsv b/docs/analysis/class-v6/rows/live-dataset-census-1a938abe4/build-6/seed-p32.tsv
new file mode 100644
index 000000000..1d4a3ff9a
--- /dev/null
+++ b/docs/analysis/class-v6/rows/live-dataset-census-1a938abe4/build-6/seed-p32.tsv
@@ -0,0 +1,42 @@
+# addrsite: program 0717ad9158d5937f class mx8-erad810f22d+sh256x27+state+reg64c+fold+rw attempt 2 generator v6 day 2026-10-03 dataset 2^28 words (memory-hard) headers 4 warps 2048 nonces/header 65536 threads 32
+# per (iteration, site) cell: the most read address and its share (A03's form); cells over 0.1 percent listed
+it	site	instr	reads	distinct	top_addr	top_count	top_share
+0	0	2	262144	261895	0x08695fc3	3	0.000011
+0	1	2	262144	261887	0x0955348b	2	0.000008
+# worst cell: iteration 0 site 0 address 0x08695fc3 in 3 reads, share 0.000011
+# per site, pooled over the 8 iterations (hit rates: an ideal cache of the site's top K items, K = bytes / 64; exp = min(1, K / window items))
+site	instr	win	window_items	reads	distinct	top_addr	top_count	top_share	hit_1GiB	hit_256MiB	hit_64MiB	exp_1GiB	exp_256MiB	exp_64MiB	distinct_ratio	bit_z_max	bit
+0	2	1	8388608	2097152	2081067	0x0d4f9faf	3	0.000001	1.0000	1.0000	0.6154	1.0000	0.5000	0.1250	1.00014	-2.72	25
+1	2	1	8388608	2097152	2081036	0x0ed453f1	3	0.000001	1.0000	1.0000	0.6152	1.0000	0.5000	0.1250	1.00013	-1.92	3
+2	14	1	8388608	2097152	2080837	0x03443ba9	3	0.000001	1.0000	1.0000	0.6155	1.0000	0.5000	0.1250	1.00003	1.81	6
+3	14	1	8388608	2097152	2080665	0x01575a10	3	0.000001	1.0000	1.0000	0.6154	1.0000	0.5000	0.1250	0.99995	-2.30	14
+4	20	2	4194304	2097152	2064959	0x0cd645f0	4	0.000002	1.0000	1.0000	0.7131	1.0000	1.0000	0.2500	1.00028	-2.07	5
+5	20	2	4194304	2097152	2064678	0x0c6a1d56	4	0.000002	1.0000	1.0000	0.7132	1.0000	1.0000	0.2500	1.00014	-2.29	13
+6	29	0	16777216	2097152	2088928	0x03b55570	3	0.000001	1.0000	1.0000	0.5600	1.0000	0.2500	0.0625	0.99998	3.40	2
+7	29	0	16777216	2097152	2089054	0x06afe3b6	3	0.000001	1.0000	1.0000	0.5597	1.0000	0.2500	0.0625	1.00004	-3.05	16
+8	31	1	8388608	2097152	2081166	0x0a04bf02	3	0.000001	1.0000	1.0000	0.6151	1.0000	0.5000	0.1250	1.00019	-2.47	20
+9	31	1	8388608	2097152	2080744	0x0e56cd9d	3	0.000001	1.0000	1.0000	0.6152	1.0000	0.5000	0.1250	0.99999	-1.94	15
+10	32	2	4194304	2097152	2064477	0x0e061843	4	0.000002	1.0000	1.0000	0.7129	1.0000	1.0000	0.2500	1.00005	2.82	18
+11	32	2	4194304	2097152	2064673	0x0df8ef99	4	0.000002	1.0000	1.0000	0.7133	1.0000	1.0000	0.2500	1.00014	-2.17	8
+12	33	0	16777216	2097152	2089016	0x0f28266b	3	0.000001	1.0000	1.0000	0.5601	1.0000	0.2500	0.0625	1.00003	-2.04	26
+13	33	0	16777216	2097152	2089185	0x07578dbd	3	0.000001	1.0000	1.0000	0.5600	1.0000	0.2500	0.0625	1.00011	-2.69	5
+14	39	1	8388608	2097152	2080978	0x0211cb12	3	0.000001	1.0000	1.0000	0.6151	1.0000	0.5000	0.1250	1.00010	-2.03	6
+15	39	1	8388608	2097152	2081059	0x061d30a0	3	0.000001	1.0000	1.0000	0.6153	1.0000	0.5000	0.1250	1.00014	2.14	16
+16	42	2	4194304	2097152	2064856	0x0746f9ef	4	0.000002	1.0000	1.0000	0.7127	1.0000	1.0000	0.2500	1.00023	-2.12	0
+17	42	2	4194304	2097152	2064582	0x07aac484	3	0.000001	1.0000	1.0000	0.7134	1.0000	1.0000	0.2500	1.00010	-1.97	10
+18	43	1	8388608	2097152	2080783	0x0d8fccc6	4	0.000002	1.0000	1.0000	0.6153	1.0000	0.5000	0.1250	1.00001	-2.22	4
+19	43	1	8388608	2097152	2080755	0x0b1fc588	3	0.000001	1.0000	1.0000	0.6153	1.0000	0.5000	0.1250	0.99999	-2.48	14
+20	44	0	16777216	2097152	2089111	0x03453f54	3	0.000001	1.0000	1.0000	0.5600	1.0000	0.2500	0.0625	1.00007	1.76	5
+21	44	0	16777216	2097152	2089070	0x0751e392	3	0.000001	1.0000	1.0000	0.5599	1.0000	0.2500	0.0625	1.00005	-1.92	18
+22	47	1	8388608	2097152	2080841	0x0313f4d1	3	0.000001	1.0000	1.0000	0.6153	1.0000	0.5000	0.1250	1.00004	1.46	3
+23	47	1	8388608	2097152	2080811	0x0561317b	4	0.000002	1.0000	1.0000	0.6149	1.0000	0.5000	0.1250	1.00002	3.14	1
+24	48	2	4194304	2097152	2064886	0x050e620b	4	0.000002	1.0000	1.0000	0.7131	1.0000	1.0000	0.2500	1.00024	2.87	1
+25	48	2	4194304	2097152	2064825	0x0704c911	4	0.000002	1.0000	1.0000	0.7130	1.0000	1.0000	0.2500	1.00021	1.89	6
+26	49	0	16777216	2097152	2089046	0x04c89672	3	0.000001	1.0000	1.0000	0.5601	1.0000	0.2500	0.0625	1.00004	1.73	8
+27	49	0	16777216	2097152	2088824	0x031c13c0	3	0.000001	1.0000	1.0000	0.5599	1.0000	0.2500	0.0625	0.99993	2.76	7
+28	51	0	16777216	2097152	2089054	0x06747e52	3	0.000001	1.0000	1.0000	0.5600	1.0000	0.2500	0.0625	1.00004	2.00	7
+29	51	0	16777216	2097152	2089115	0x018b83fc	3	0.000001	1.0000	1.0000	0.5600	1.0000	0.2500	0.0625	1.00007	2.42	5
+30	52	0	16777216	2097152	2088883	0x07e795d6	3	0.000001	1.0000	1.0000	0.5600	1.0000	0.2500	0.0625	0.99996	-2.45	9
+31	52	0	16777216	2097152	2089172	0x0e17768c	3	0.000001	1.0000	1.0000	0.5598	1.0000	0.2500	0.0625	1.00010	2.22	2
+# F8 form over the live stream: top 0.1 percent of items hold 0.003378 of reads; flat control 0.003071 (ratio 1.1000x), windowed control 0.003377 (ratio 1.0004x; the gate 1.2x); min site distinct ratio 0.99993 (floors 0.98 and 0.995); worst index bit inside its window 3.40 sigma at site 6 bit 2 (the band 6)
+# program: reads 67108864, distinct items 16303463, worst site 4 address 0x0cd645f0 in 4 reads (share 0.000002); one cache over the program's reads: 1 GiB 1.0000, 256 MiB 0.4390, 64 MiB 0.1410; the per-site ideal caches summed: 1.0000, 1.0000, 0.6190; 50.7 s
diff --git a/docs/analysis/class-v6/rows/live-dataset-census-1a938abe4/build-6/seed-p33.tsv b/docs/analysis/class-v6/rows/live-dataset-census-1a938abe4/build-6/seed-p33.tsv
new file mode 100644
index 000000000..e1743422d
--- /dev/null
+++ b/docs/analysis/class-v6/rows/live-dataset-census-1a938abe4/build-6/seed-p33.tsv
@@ -0,0 +1,42 @@
+# addrsite: program 9857a41ce42f4677 class mx8-erad810f22d+sh256x27+state+reg64c+fold+rw attempt 0 generator v6 day 2026-10-03 dataset 2^28 words (memory-hard) headers 4 warps 2048 nonces/header 65536 threads 32
+# per (iteration, site) cell: the most read address and its share (A03's form); cells over 0.1 percent listed
+it	site	instr	reads	distinct	top_addr	top_count	top_share
+0	0	4	262144	261854	0x03886725	2	0.000008
+0	1	4	262144	261876	0x06d3ba58	2	0.000008
+# worst cell: iteration 0 site 14 address 0x03846806 in 3 reads, share 0.000011
+# per site, pooled over the 8 iterations (hit rates: an ideal cache of the site's top K items, K = bytes / 64; exp = min(1, K / window items))
+site	instr	win	window_items	reads	distinct	top_addr	top_count	top_share	hit_1GiB	hit_256MiB	hit_64MiB	exp_1GiB	exp_256MiB	exp_64MiB	distinct_ratio	bit_z_max	bit
+0	4	1	8388608	2097152	2080828	0x034e20ad	3	0.000001	1.0000	1.0000	0.6153	1.0000	0.5000	0.1250	1.00003	2.61	5
+1	4	1	8388608	2097152	2080697	0x0082ff20	3	0.000001	1.0000	1.0000	0.6150	1.0000	0.5000	0.1250	0.99997	2.86	26
+2	6	2	4194304	2097152	2064740	0x0f425fde	4	0.000002	1.0000	1.0000	0.7130	1.0000	1.0000	0.2500	1.00017	2.45	3
+3	6	2	4194304	2097152	2064712	0x0d43bd52	4	0.000002	1.0000	1.0000	0.7129	1.0000	1.0000	0.2500	1.00016	-1.82	5
+4	7	1	8388608	2097152	2080884	0x099e7c18	3	0.000001	1.0000	1.0000	0.6151	1.0000	0.5000	0.1250	1.00006	2.38	20
+5	7	1	8388608	2097152	2080853	0x0e58403c	3	0.000001	1.0000	1.0000	0.6155	1.0000	0.5000	0.1250	1.00004	-3.95	5
+6	8	0	16777216	2097152	2088995	0x012d4547	3	0.000001	1.0000	1.0000	0.5601	1.0000	0.2500	0.0625	1.00002	2.05	6
+7	8	0	16777216	2097152	2089049	0x08a3d7fc	3	0.000001	1.0000	1.0000	0.5601	1.0000	0.2500	0.0625	1.00004	1.96	24
+8	10	0	16777216	2097152	2088976	0x0ba1a02e	3	0.000001	1.0000	1.0000	0.5597	1.0000	0.2500	0.0625	1.00001	-2.65	6
+9	10	0	16777216	2097152	2088946	0x060bcdb9	3	0.000001	1.0000	1.0000	0.5603	1.0000	0.2500	0.0625	0.99999	-2.50	17
+10	13	0	16777216	2097152	2088889	0x05e3d58e	4	0.000002	1.0000	1.0000	0.5601	1.0000	0.2500	0.0625	0.99997	1.28	5
+11	13	0	16777216	2097152	2089025	0x0b78defd	3	0.000001	1.0000	1.0000	0.5600	1.0000	0.2500	0.0625	1.00003	-1.84	26
+12	14	1	8388608	2097152	2080873	0x04877c20	3	0.000001	1.0000	1.0000	0.6150	1.0000	0.5000	0.1250	1.00005	1.45	24
+13	14	1	8388608	2097152	2081038	0x003a2c13	3	0.000001	1.0000	1.0000	0.6151	1.0000	0.5000	0.1250	1.00013	2.52	0
+14	21	2	4194304	2097152	2064428	0x01e0e6f5	4	0.000002	1.0000	1.0000	0.7130	1.0000	1.0000	0.2500	1.00002	-2.45	7
+15	21	2	4194304	2097152	2064800	0x028d9855	4	0.000002	1.0000	1.0000	0.7127	1.0000	1.0000	0.2500	1.00020	1.68	5
+16	26	2	4194304	2097152	2064895	0x036bf80b	4	0.000002	1.0000	1.0000	0.7129	1.0000	1.0000	0.2500	1.00025	1.95	19
+17	26	2	4194304	2097152	2064720	0x01d12723	4	0.000002	1.0000	1.0000	0.7131	1.0000	1.0000	0.2500	1.00016	1.82	10
+18	30	0	16777216	2097152	2088921	0x08a5d6a0	3	0.000001	1.0000	1.0000	0.5599	1.0000	0.2500	0.0625	0.99998	-2.74	5
+19	30	0	16777216	2097152	2088982	0x02d7209d	3	0.000001	1.0000	1.0000	0.5596	1.0000	0.2500	0.0625	1.00001	2.31	19
+20	41	1	8388608	2097152	2080644	0x04f6d097	4	0.000002	1.0000	1.0000	0.6155	1.0000	0.5000	0.1250	0.99994	2.59	14
+21	41	1	8388608	2097152	2080991	0x03743b6f	4	0.000002	1.0000	1.0000	0.6152	1.0000	0.5000	0.1250	1.00011	-2.05	6
+22	42	0	16777216	2097152	2088965	0x0a107c86	3	0.000001	1.0000	1.0000	0.5602	1.0000	0.2500	0.0625	1.00000	1.89	21
+23	42	0	16777216	2097152	2088980	0x0bed59ae	3	0.000001	1.0000	1.0000	0.5598	1.0000	0.2500	0.0625	1.00001	2.68	23
+24	43	0	16777216	2097152	2088957	0x043578b0	3	0.000001	1.0000	1.0000	0.5600	1.0000	0.2500	0.0625	1.00000	2.73	12
+25	43	0	16777216	2097152	2088906	0x0cc002e5	3	0.000001	1.0000	1.0000	0.5600	1.0000	0.2500	0.0625	0.99997	1.78	9
+26	48	1	8388608	2097152	2080828	0x0b9e1d33	3	0.000001	1.0000	1.0000	0.6152	1.0000	0.5000	0.1250	1.00003	-1.88	12
+27	48	1	8388608	2097152	2080665	0x08abccb4	3	0.000001	1.0000	1.0000	0.6153	1.0000	0.5000	0.1250	0.99995	1.96	25
+28	49	0	16777216	2097152	2088834	0x0761a1b4	3	0.000001	1.0000	1.0000	0.5599	1.0000	0.2500	0.0625	0.99994	2.50	1
+29	49	0	16777216	2097152	2088962	0x0c8f7caa	3	0.000001	1.0000	1.0000	0.5599	1.0000	0.2500	0.0625	1.00000	-1.91	18
+30	62	0	16777216	2097152	2088884	0x0d7a8fad	3	0.000001	1.0000	1.0000	0.5601	1.0000	0.2500	0.0625	0.99996	-2.31	0
+31	62	0	16777216	2097152	2089107	0x0fc73850	3	0.000001	1.0000	1.0000	0.5599	1.0000	0.2500	0.0625	1.00007	2.92	16
+# F8 form over the live stream: top 0.1 percent of items hold 0.003416 of reads; flat control 0.003074 (ratio 1.1112x), windowed control 0.003417 (ratio 0.9996x; the gate 1.2x); min site distinct ratio 0.99994 (floors 0.98 and 0.995); worst index bit inside its window -3.95 sigma at site 5 bit 5 (the band 6)
+# program: reads 67108864, distinct items 16348197, worst site 2 address 0x0f425fde in 4 reads (share 0.000002); one cache over the program's reads: 1 GiB 1.0000, 256 MiB 0.4358, 64 MiB 0.1410; the per-site ideal caches summed: 1.0000, 1.0000, 0.6059; 50.8 s
diff --git a/docs/analysis/class-v6/rows/live-dataset-census-1a938abe4/rows.md b/docs/analysis/class-v6/rows/live-dataset-census-1a938abe4/rows.md
new file mode 100644
index 000000000..8b1378917
--- /dev/null
+++ b/docs/analysis/class-v6/rows/live-dataset-census-1a938abe4/rows.md
@@ -0,0 +1 @@
+
diff --git a/docs/evidence.md b/docs/evidence.md
index c314d7089..09bcf7fad 100644
--- a/docs/evidence.md
+++ b/docs/evidence.md
@@ -38,7 +38,7 @@ Every row carries its release evidence packet at the end of its Result cell: par
 | 3 | The 64-register window per lane costs a GPU under 1 percent of rate at stock, and at most 5 percent per load with the liveness chain | The litepaper (class v6); `docs/plans/igneum-2.0.md` D1 (the placed 64-register rows) | TEAM-REPORTED; tested by the team | `docs/analysis/class-v6/connected-state.md` section 4; `docs/design/class-v6-rotating-family.md` section 10.0e | The class v5 nvcc harness and the kit worker, both packs on the same card minutes apart, 250 batches of 2^24, nvidia-smi at 1 Hz, vectors PASS on every row (`connected-state.md` section 4); the per-load rows of the full chain against the base (`class-v6-rotating-family.md` 10.0e) | 8 October 2026, rented RTX 5090 (575 W cap) and RTX 4090 (450 W cap) at stock: energy per hash +0.6 percent on the RTX 5090 and -0.9 percent on the RTX 4090, inside the run-to-run noise; under 1 percent of rate; 80 to 87 registers per thread, no spill (all measured). Per load: RTX 5090 16.7 nJ base, 17.6 nJ full chain; RTX 4090 26.0 nJ, 27.0 nJ (measured). The lock row on the project's own rigs is owed Case: GPU-03 | none yet. Packet: parameters a rented RTX 5090 and RTX 4090 at stock, the liveness chain, class v4; procedure the hash lane's harness rows in connected-state.md section 4; raw result energy per hash +0.6 percent and -0.9 percent, at most 5 percent per load; reproduction none yet; review scope none; unresolved two cards, one day, no AMD or Apple row |
 | 4 | Reorganising the same work around live state (the connected-state variant, experiment D2(a)) does not reduce a specialised chip's edge: KILL as a class | `docs/plans/igneum-2.0.md` D2(a); this page | TEAM-REPORTED; tested by the team (a published failure) | `docs/analysis/class-v6/connected-state.md` (the verdict, section 6) | The census, liveness and GPU rows in `connected-state.md` sections 2 to 4; the chip side priced on the drawn program by synthesis (a model, never a lower bound) | 8 October 2026, verdict 17:25 UK: the window is necessary (63 of 64 registers live at every address, measured) but only its width reaches the chip, +1.2 pJ per lane-op at N5 (synthesised); the window moves the chip's edge 1.10x node for node against a 1.25x gate (modelled); the GPU side +0.6 percent energy per hash on the RTX 5090, -0.9 percent on the RTX 4090 at stock (measured). Rearranging the dependency graph of the same operations moves neither side Case: POW-04 | none yet. Packet: parameters the connected-state generator variant behind a flag, the census TSVs; procedure connected-state.md; raw result +1.2 pJ per lane-op at N5 on the chip side, the GPU side unmoved; reproduction none yet; review scope none; unresolved the chip side is modelled, not measured |
 | 5 | "A GPU-secured network for Ethereum-compatible applications and verifiable computation." served on every page | Every page | PROPOSED; designed (served) | `docs/plans/igneum-2.0.md` (the objective: the positioning line) | `node tools/ci/ledger-text-check.mjs`: the sentence pinned (R0) on the home page, the litepaper and this page | 8 October 2026: on this page; the home page and the litepaper carry it as their 2.0 text lands (designed) Case: GOV-08 | none yet. Packet: parameters none (a served sentence); procedure the ledger-text check pins it on every page; raw result the check's count; reproduction not applicable; review scope the three external reviews the founder accepted; unresolved none |
-| 6 | The chip claim as served: "Igneum remains competitive on accessible commodity GPUs even when specialised mining hardware is assumed to exist, remain compatible and seek profit; its security does not rely on identifying that hardware or retiring it through emergency changes." Under it the three statements, separate: energy ("Current modelling estimates a 1.5x to 3.1x energy-efficiency advantage for the specialised designs assessed as complete machines against the GPU tier, from a board on commodity DRAM at 1.5x to an SRAM-store die at 3.1x (1.5x to 2.3x on the GPU's own node). For the board on commodity DRAM the two independent chip models agree after placement: 1.5x to 2.1x as a complete machine and 2.0x to 2.9x for the board alone on the GPU's own node; a node ahead 1.8x to 2.4x and 2.45x to 3.3x (placed and routed on ASAP7, both lanes, the node scaling claimed, the machine terms modelled; the 2.9x end is the resizer-downsized floor of the placed 32-lane comparator, not a point, until the placed core32 lands). The standard's P04 target reads FAIL at both ends, served as such. The standard's P04 target as approved: R_E at most 1.5 on the same node and one node ahead; today's placed bracket reads against it as a FAIL to work against." Per machine on the same node and a node ahead: the DRAM board 1.5x to 1.6x and 1.8x, the hybrid 1.9x to 2.1x and 2.4x to 2.6x, the die 2.3x and 3.1x; across the adversary's lane-count choice the same-node bracket is 1.5x to 2.1x and a node ahead 1.8x to 2.6x; 3x to 6x per dollar of hardware at list price. MODELLED: the GPU side measured, the chip's core placed and routed, the rest of the machine modelled, no chip measured, hardware cost approximate within 2x), economic and response capability, rotation an optional improvement. Class v5 derives the dataset from chain state; whether that excludes a specialised design is under evaluation (Deliverable 3), since a design that tracks state is not excluded by staleness. The dataset policy (decided 8 October 2026, 20:05 UK: the genesis size is 4 GiB, the lane's recommendation taken; 2 GiB and 5.5 GiB the costed alternatives beside it; later steps at 5 percent): "The dataset’s size is a one-off hardware ticket on specialised designs and a running energy tax on commodity cards: at 4 to 5.5 GiB a locked Blackwell card pays 12 to 14 percent more energy per hash than at 1 GiB (an 8 GB AMD card under 3 percent of rate), while the board on commodity DRAM pays nothing and the SRAM designs pay a hardware cost that does not change their outcome. So the dataset starts at 4 GiB, the largest size that keeps every entry card and a 12 GB card’s mining and proving together, decided at genesis, and every later step is scored at 5 percent against it and taken only when the chain’s own state outgrows the dataset, not on a calendar." (decided; the energy-against-size curve on the litepaper: 1, 2, 4 and 5.5 GiB at stock and at the lock measured on an RTX 5090 against its own 1 GiB control, +0.7 and +4.3 percent at stock, +11.7 and +13.4 at the lock for 4 and 5.5 GiB, the 2 GiB knee cell a paired read in flight; the exclusions by memory; the SRAM tickets modelled). A failure, reported as found: "ECO-05, the standard's coexistence sweep, was run on a register frozen before any result against a sourced revenue reference of USD 31.65 million a year of miner revenue (Ethereum Classic's trailing year at its current era 6 reward) and FAILS the envelope as the chain stands. Of sixteen revenue and tariff worlds (a quarter, one, four and ten times the reference; electricity at 3, 10, 25 and 40 cents per kilowatt-hour) only one sustains new entry across two vendors, ten times the reference at 3 cents (about USD 316 million a year), because on this hash the measured AMD and Intel cards cost four to six times a Blackwell card per joule and never earn a new entrant's purchase back at list price below that world; in that one world no specialised design sits inside the envelope against the whole cohort (the board on commodity DRAM is within the envelope only against the best Blackwell card, the die and the hybrid against no card of today's), and the quarter-reference worlds at 25 and 40 cents are collapse worlds with no rational profitable operator. What moves the result is the specialist's hardware cost per unit of work, the honest cards' own efficiency on this hash, above all the AMD and Intel cards' energy, and the dataset's size floor; not a smaller network, a higher token price or any chip's death. Reported as found; the register, the full result cube and the model are published for independent reproduction." (Labels: the register frozen at 18:37 UK on 8 October 2026, the reference corrected by a second public read and the run repeated with the verdict unchanged, the cube MODELLED on measured card rows, two cohort rows BLOCKED, the RX 7600's knee and the Arc's watts, their measurement running tonight; the registry row ECO-05 on /acceptance; the results file docs/analysis/class-v6/eco-05-results.md.) The energy ratio is not the pass criterion: the coexistence model ([docs/analysis/class-v6/coexistence-model.md](https://git.igneum.network/igneum-network/igneum/src/branch/master/docs/analysis/class-v6/coexistence-model.md)) is, and its first run's result is served with its conditions: A specialised supplier may earn a normal return; ordinary GPUs remain sufficiently close in total cost, widely obtainable and useful outside mining that new operators can still compete. On today's modelled rows that holds for the chip anyone can build, a stored-dataset board on commodity DRAM, at a productive life of one to three years: its cost per accepted unit of work sits within the range of the best GPU owner and entrant, it passes six of the seven conditions (a third of the network in boards now costs less than a year's revenue at the final hardware price), and a fleet of it holds a minority of the network with GPU entrants still setting the price. For the SRAM-store die the outcome turns on its hardware cost per unit of work, not its energy advantage: at the reconciled machine cost, set by the power train and the shadow core rather than the die, it fails the cost, hardware, fleet and margin conditions at every point of the band, a modest fleet holds about two fifths of a growing network and three fifths of a flat one on arrival and takes every flat or shrinking network within five years, and the only coexistence-shaped outcome is private supply in a growing network; what holds it is the investment decision, since its economics are project economics. A third design, a DRAM board with the hottest half of the dataset in on-board SRAM, sits between the two: it coexists only in a growing network at cheap GPU electricity and fails the cost conditions in a flat or shrinking one, and the dataset's size floor is a real lever on it where it was none on the SRAM die. What holds the die is the investment decision, not the hash; every chip figure here is modelled, not measured, and the chip's hardware cost per unit of work is approximate within 2x. | The litepaper (the chip model) | MODELLED; designed (the bracket modelled; the GPU side tested by the team) | `docs/design/class-v6-rotating-family.md` section 10 (10.0h to 10.0n, 8 October 2026); `docs/plans/igneum-2.0.md` D3 and D4 | the scoring rule in the close (the minimum over workloads of the maximum over free adversarial designs of the GPU's joules per hash over the adversary's, under the 10 percent GPU-cost budget at the lock, the verifier limit, cross-vendor correctness and hardware accessibility); the placed rows are D3's | the GPU side measured: the RTX 5080 at its 1,100 MHz lock 2.06 microjoules per hash and the RTX 5090 at its 1,300 MHz lock 2.33 (8 October 2026, the project's own rigs and rented pods); the chip side synthesised and claimed, its placed gated row pending Case: ADV-01 | none yet. Packet: parameters the placed full 18-family core on ASAP7, claimed node scaling, the GDDR7 board, the RTX 5090 at its 1,300 MHz lock on class v4; procedure class-v6-rotating-family.md section 10 and coexistence-model.md; raw result the energies and verdicts as served; reproduction none yet; review scope three external reviews of the close, findings taken; unresolved no chip measured, hardware cost approximate within 2x, the k lane's 32-lane placed row pending |
+| 6 | The chip claim as served: "Igneum remains competitive on accessible commodity GPUs even when specialised mining hardware is assumed to exist, remain compatible and seek profit; its security does not rely on identifying that hardware or retiring it through emergency changes." Under it the three statements, separate: energy ("Current modelling estimates a 1.5x to 3.1x energy-efficiency advantage for the specialised designs assessed as complete machines against the GPU tier, from a board on commodity DRAM at 1.5x to an SRAM-store die at 3.1x (1.5x to 2.3x on the GPU's own node). For the board on commodity DRAM the two independent chip models agree after placement: 1.5x to 2.1x as a complete machine and 2.0x to 2.9x for the board alone on the GPU's own node; a node ahead 1.8x to 2.4x and 2.45x to 3.3x (placed and routed on ASAP7, both lanes, the node scaling claimed, the machine terms modelled; the 2.9x end is the resizer-downsized floor of the placed 32-lane comparator, not a point, until the placed core32 lands). The standard's P04 target reads FAIL at both ends, served as such. The standard's P04 target as approved: R_E at most 1.5 on the same node and one node ahead; today's placed bracket reads against it as a FAIL to work against." Per machine on the same node and a node ahead: the DRAM board 1.5x to 1.6x and 1.8x, the hybrid 1.9x to 2.1x and 2.4x to 2.6x, the die 2.3x and 3.1x; across the adversary's lane-count choice the same-node bracket is 1.5x to 2.1x and a node ahead 1.8x to 2.6x; 3x to 6x per dollar of hardware at list price. MODELLED: the GPU side measured, the chip's core placed and routed, the rest of the machine modelled, no chip measured, hardware cost approximate within 2x), economic and response capability, rotation an optional improvement. Class v5 derives the dataset from chain state; whether that excludes a specialised design is under evaluation (Deliverable 3), since a design that tracks state is not excluded by staleness. The dataset policy (decided 8 October 2026, 20:05 UK: the genesis size is 4 GiB, the lane's recommendation taken; 2 GiB and 5.5 GiB the costed alternatives beside it; later steps at 5 percent): "The dataset’s size is a one-off hardware ticket on specialised designs and a running energy tax on commodity cards: at 4 to 5.5 GiB a locked Blackwell card pays 12 to 14 percent more energy per hash than at 1 GiB (an 8 GB AMD card under 3 percent of rate), while the board on commodity DRAM pays nothing and the SRAM designs pay a hardware cost that does not change their outcome. So the dataset starts at 4 GiB, the largest size that keeps every entry card and a 12 GB card’s mining and proving together, decided at genesis, and every later step is scored at 5 percent against it and taken only when the chain’s own state outgrows the dataset, not on a calendar." (decided; the energy-against-size curve on the litepaper: 1, 2, 4 and 5.5 GiB at stock and at the lock measured on an RTX 5090 against its own 1 GiB control, +0.7 and +4.3 percent at stock, +11.7 and +13.4 at the lock for 4 and 5.5 GiB, the 2 GiB knee cell a paired read in flight; the exclusions by memory; the SRAM tickets modelled). A failure, reported as found: "ECO-05, the standard's coexistence sweep, was run on a register frozen before any result against a sourced revenue reference of USD 31.65 million a year of miner revenue (Ethereum Classic's trailing year at its current era 6 reward) and FAILS the envelope as the chain stands. Of sixteen revenue and tariff worlds (a quarter, one, four and ten times the reference; electricity at 3, 10, 25 and 40 cents per kilowatt-hour) one sustains new entry across two vendors on the measured cards, ten times the reference at 3 cents (about USD 316 million a year), and a second, ten times the reference at 10 cents, on the RX 7600's modelled efficiency point, which the metered row due in the morning keeps at or below 5.4 microjoules per hash and takes away above about 5.6; the cause is that on this hash the measured AMD and Intel cards cost four to six times a Blackwell card per joule and never earn a new entrant's purchase back at list price below those worlds; the verdict is FAIL either way; in those worlds no specialised design sits inside the envelope against the whole cohort (the board on commodity DRAM is within the envelope only against the best Blackwell card, the die and the hybrid against no card of today's), and the quarter-reference worlds at 25 and 40 cents are collapse worlds with no rational profitable operator. What moves the result is the specialist's hardware cost per unit of work, the honest cards' own efficiency on this hash, above all the AMD and Intel cards' energy, and the dataset's size floor; not a smaller network, a higher token price or any chip's death. Reported as found; the register, the full result cube and the model are published for independent reproduction." (Labels: the register frozen at 18:37 UK on 8 October 2026, the reference corrected by a second public read and the run repeated with the verdict unchanged, the cube MODELLED on measured card rows, two cohort rows BLOCKED, the RX 7600's knee and the Arc's watts, their measurement running tonight; the registry row ECO-05 on /acceptance; the results file docs/analysis/class-v6/eco-05-results.md.) The energy ratio is not the pass criterion: the coexistence model ([docs/analysis/class-v6/coexistence-model.md](https://git.igneum.network/igneum-network/igneum/src/branch/master/docs/analysis/class-v6/coexistence-model.md)) is, and its first run's result is served with its conditions: A specialised supplier may earn a normal return; ordinary GPUs remain sufficiently close in total cost, widely obtainable and useful outside mining that new operators can still compete. On today's modelled rows that holds for the chip anyone can build, a stored-dataset board on commodity DRAM, at a productive life of one to three years: its cost per accepted unit of work sits within the range of the best GPU owner and entrant, it passes six of the seven conditions (a third of the network in boards now costs less than a year's revenue at the final hardware price), and a fleet of it holds a minority of the network with GPU entrants still setting the price. For the SRAM-store die the outcome turns on its hardware cost per unit of work, not its energy advantage: at the reconciled machine cost, set by the power train and the shadow core rather than the die, it fails the cost, hardware, fleet and margin conditions at every point of the band, a modest fleet holds about two fifths of a growing network and three fifths of a flat one on arrival and takes every flat or shrinking network within five years, and the only coexistence-shaped outcome is private supply in a growing network; what holds it is the investment decision, since its economics are project economics. A third design, a DRAM board with the hottest half of the dataset in on-board SRAM, sits between the two: it coexists only in a growing network at cheap GPU electricity and fails the cost conditions in a flat or shrinking one, and the dataset's size floor is a real lever on it where it was none on the SRAM die. What holds the die is the investment decision, not the hash; every chip figure here is modelled, not measured, and the chip's hardware cost per unit of work is approximate within 2x. | The litepaper (the chip model) | MODELLED; designed (the bracket modelled; the GPU side tested by the team) | `docs/design/class-v6-rotating-family.md` section 10 (10.0h to 10.0n, 8 October 2026); `docs/plans/igneum-2.0.md` D3 and D4 | the scoring rule in the close (the minimum over workloads of the maximum over free adversarial designs of the GPU's joules per hash over the adversary's, under the 10 percent GPU-cost budget at the lock, the verifier limit, cross-vendor correctness and hardware accessibility); the placed rows are D3's | the GPU side measured: the RTX 5080 at its 1,100 MHz lock 2.06 microjoules per hash and the RTX 5090 at its 1,300 MHz lock 2.33 (8 October 2026, the project's own rigs and rented pods); the chip side synthesised and claimed, its placed gated row pending Case: ADV-01 | none yet. Packet: parameters the placed full 18-family core on ASAP7, claimed node scaling, the GDDR7 board, the RTX 5090 at its 1,300 MHz lock on class v4; procedure class-v6-rotating-family.md section 10 and coexistence-model.md; raw result the energies and verdicts as served; reproduction none yet; review scope three external reviews of the close, findings taken; unresolved no chip measured, hardware cost approximate within 2x, the k lane's 32-lane placed row pending |
 | 7 | Mining and proving together on one card needs a 16 GB card at the proposed 5.5 GiB dataset (the genesis size is 4 GiB, decided 8 October 2026; at 4 GiB the miner holds less and the rule is not yet measured there): the miner holds about 6.1 GiB and a compressed shard proof peaks at about 7.5 GiB, so 8 GB and 12 GB cards time-share (the app pauses the miner for the proof). NVIDIA proves; AMD and Apple mine | The litepaper (Proving, vs RandomX); the miner page | TEAM-REPORTED; tested by the team | `docs/analysis/class-v6/coexist-rows.md` (the 5.5 GiB ds55 miner beside igneum-prove-host-0317, compressed at threshold 2^26, the served sm_86 and sm_89 floors) | the RESULT rows in that file, verbatim from the runs | rented RTX 3060 12 GB: 26.82 MH/s at 117.4 W with 6,129 MiB resident; the compressed shard 13.2 s, peak 7,525 MiB (6,129 + 7,525 = 13,654 MiB against 12,288); rented RTX 4060 8 GB: 18.84 MH/s, 6,116 MiB resident; the shard 8.2 s, peak 7,532 MiB; 8 October 2026 Case: GPU-05 | none yet. Packet: parameters the 5.5 GiB ds55 miner, igneum-prove-host-0317 compressed at threshold 2^26, sm_86 and sm_89; procedure coexist-rows.md; raw result the RESULT rows verbatim; reproduction none yet; review scope none; unresolved two cards on one day, the 6 October rows stand as 1 GiB-dataset rows |
 | 8 | Finality is active on the Igneum 2.0 devnet from checkpoint 241, 115 minutes after block one, with 78 percent of active weight signing | The live page's strip; the explorer; this page | TEAM-REPORTED; activated: the first lock at 19:08:25 UK on 8 October 2026 (checkpoint 241, DAA 7,247, 77.8 percent of active weight; checkpoint 242 at 19:08:48) | the node's checkpoint state through the observer (/api/live finality.active, latest_locked_index); node 4cdcc488 on release-2.0.0-node | the observer's finality fields read at the edge (supported true, active true, latest_locked_index 244 at 19:10 UK). Case: FIN-01 | 8 October 2026, 19:08 UK: the first lock 115 minutes after the first block at 17:14; the weight window filled at DAA 7,200. Packet: parameters rule v3 from checkpoint DAA 0, the 7,200 DAA presence window, two thirds of active and of total weight; procedure the observer's checkpoint table; raw result checkpoint 241 locked at DAA 7,247 with 77.8 percent of active weight; reproduction none yet; review scope none; unresolved a pause has not yet been observed on this chain | none yet |
 | 9 | The reference population and the cost per accepted unit of work: The reference population is the discrete-GPU classes the network protects, from the RTX 5090 to the RX 7600 8 GB and the Arc B580, with Apple reported beside them; for each the table gives the cost per accepted unit of work for an existing owner (power, wear, fees, over accepted work) and for a new entrant (purchase at list and street price, two years of operation, resale), at three electricity prices, with every figure labelled measured or modelled. On today's rows the cheapest honest owner is a 16 GB Blackwell card at its efficiency point and the cheapest entrant the same card at list price; the specialised board on commodity DRAM costs more per accepted unit than any owner and sits between the entrant's list and street figures. | The litepaper (the chip model); /scorecard | MODELLED; designed (the card rows measured, the chip rows modelled with hardware cost approximate within 2x) | `docs/analysis/class-v6/reference-population.md` (floor lane 3 for the research lane, on master at 10aa76d7, 8 October 2026) | the table's own cells, each labelled measured or modelled; the two tests per class as the plan's D1 names them. Case: GPU-02 | 8 October 2026: the cheapest honest owner a 16 GB Blackwell card at its efficiency point, the cheapest entrant the same card at list price, the DRAM board above every owner and between the entrant's list and street figures. Packet: parameters the reference cohort (RTX 5090 to RX 7600 8 GB and Arc B580, Apple beside), three electricity prices, two years of operation; procedure the table's method section; raw result the table; reproduction none yet; review scope none; unresolved the Arc's watts and the RX 7600's knee rows are BLOCKED | none yet |
diff --git a/docs/plans/counter-asic-3-status.md b/docs/plans/counter-asic-3-status.md
index 3627be2ae..942781d36 100644
--- a/docs/plans/counter-asic-3-status.md
+++ b/docs/plans/counter-asic-3-status.md
@@ -565,6 +565,34 @@ THE NIGHT RULE (main's words, the founder to bed, 21:3x UK): (1) From this line
 A FAULT FOUND AT 21:28 (the build-server lane by pid; the coordinator's read at 21:29): a dl-host deploy running from the Mac with no recorded pid, `node /Users/joshm/Projects/igneum/tools/workers/push.mjs` (pid 47013, parent launchd, started 21:28:00; npm exec vercel 50070, cwd igneum-dlsite), re-hashing the 5.9 GB dl/ tree each fire: the launchd agent com.igneum.workers-push (~/Library/LaunchAgents/com.igneum.workers-push.plist), the old Mac workers publish still scheduled after the hand-over to build-1; the class the founder named; the fix: the agent unloaded by its label and its plist retired by whoever installed it (the site lane), never a kill by name; the build-server lane's one Arc deploy serialized behind it with its pid recorded.
 THE LAUNCHD AGENT UNLOADED (21:30 UK, the site lane, read back): com.igneum.workers-push unloaded by its label (launchctl bootout gui/501/com.igneum.workers-push), its plist renamed .retired-20261008, launchctl list no longer showing it; its running upload (pid 47013) had ended on its own, nothing killed; nothing publishes from the Mac now but tools/site-deploy-from-mirror.sh with its pid file. Candidate (c) e8773ff5 all six suites green on the final tree (184/143/74/30/38/19), the pair building, then the canaries and the id read-back. The night rule broadcast to every lane at 21:3x with its stay or release.
 
+MAIN's ADDITION TO THE 08:00 READ-BACK (21:3x): the accepted-block count since the devnet-4 genesis for each of the mini, PC 1 and PC 2, the time each first mined on 2.0.1 or 2.0.2 and its current rate, from their logs through the relay and the mini's api, the first line (the founder noting they have mined almost nothing since 2.0); the launchd workers-push agent confirmed retired by main's own read.
+
+THE FOUNDER'S WORD at 21:33 UK: "Do not let anything die or bug out overnight. I want to wake up to serious progress. Build at maximum speed." Two amendments to the night rule (the messaging rule unchanged: real changes only, one line an hour from the coordinator, the 08:00 read-back). (1) NOTHING DIES: every long-running job runs under a watcher that restarts it by pid and records the restart; the fleet lane reads the chain every 15 minutes (blocks per minute, key count, time since the last lock, seed slot counts, the home machines' peers); infrastructure faults are fixed as they occur under the pid rule (a dead seed, a banned IP, a stalled roll, a filled disk, a dead pod); only consensus-level intervention stays forbidden (no hand-made lock, no reorg by hand), and a consensus-level stall is the first line at 08:00 with its evidence; the rented ceiling stands. (2) MAXIMUM SPEED: Phase 1 of the execution plan starts tonight with the lanes that stay; new lanes are permitted overnight for a defined Phase 1 deliverable with a morning clock, each briefed with the four rules (pkill refused; fleet binaries only from the shipper's kit, "cut" only on the build-1 read-back; nothing published from the Mac but the site lane's script; a slip once, no "done" unread), the kill guard and the canary rule. Idle builders are a fault: build-5, 6, 8 and 9 carry work all night.
+PHASE 1 (owner, clock UK): (a) the 2.0.2 cut with the fresh-install canary, the fleet roll and the three home machines mining on it: shipper (cut on green, about 23:15), fleet (the roll after, 01:00), relay (both PCs MINING-ON, PC 1 at the cap 04:50), the mini the shipper's; (b) the cross-backend same-work test on the frozen object across node, CPU, CUDA, Metal, OpenCL and pool: steward with the fleet (the spec page landed; the runs from the freeze, 06:00); (c) the two-node cache-history test: node with proving (03:00); (d) key succession H and W named from tonight's real next-pair run and the pin landed on the 2.0.2 line: node with proving (the RESULT 21:40; H and W proposed in the 08:00 read-back for the founder's word, the pin tool landed tonight, the real pin on his word); (e) the native 40/40/20 finality case and the backfill case on rented boxes: node (the plan 23:00, the runs on build-7/8/9 from 00:30, rows 07:00); (f) GOV-03's node build made reproducible: build-server (the build-id try 22:00, the result 23:00, the link-order try after if needed, 04:00); (g) the two-hour declared-load hold on 2.0.2 with the outcome ledger: fleet with proving (from the cut plus one hour, rows 04:00); (h) the mine-evict-prove-rebuild rows on 8, 12 and 16 GB cards: fleet with V6-07 (first rows 01:00, the 16 GB cell on the 2.0.2 modes 05:00); (i) the comparative rows and the KAWPOW chip model: the comparative lane (first landing 02:30, the chip model 09:00); (j) the live-dataset census on the frozen object: hash (overnight on build-6, rows 07:00); (k) the D5 rehearsal plan written for the morning: node (06:00); (l) /acceptance regenerated and /prize live: site (the regeneration's edge read 22:00, /prize 23:00); (m) PC 1's knee rows at 05:30 and the layer-8 verdict ready for 08:00: hash (the grid's cap 04:50, the knee rows 05:30, the verdict 07:30).
+BUILDERS ALL NIGHT: build-5 the hash lane's P01 OpenCL/Arc reference generation and the live-dataset census's second half; build-6 the live-dataset census (hash); build-7 the enforced lane's succession and stage runs, then the finality cases (node); build-8 the finality cases and GOV-03's reproducible builds (node, build-server); build-9 the 2.0.2 chain and the two-node cache test (node); build-1 and build-2 the gates; build-4 the comparative lane's rows and the same-work runs (steward).
+THE EVIDENCE CLASSES LANDED (21:31 UK, read back): box master 45b87ee8 (ci-evidence-added d7689a43, 89 checks, under the lock, pushed on try 1): rule 2 binding modified and deleted evidence files only (a new file landing free), the recorder refusing a missing or directory path at record time, the kills batch citing the two experiments' own files; F03 (1fd509d5) in its gate; rule 33's canary check, guards and registry case on ci-rule33-canary by 22:00. The 2.0.2 line 45e7b910: the miner suite green (33), the rest of its gate on build-9. (c)'s pair built, placement and canaries next.
+
+THE 21:3x TO 21:4x LINES. THE FIRST POST-ROLL LOCK: hub-1 checkpoint 620, block 8b2d4553, blue score 10,338, DAA 18,570, at 21:34:33 BST, signed 1,029 = 80.8 percent of active (63.2 percent of total, 63.3 percent of the table frozen at lock 619), finality active; 18,576 blocks, hub-1 peers 7, 4 keys over its last 300 blocks (the fleet's fixed miners); both public seeds listening with zero fleet inbound slots at 21:35 (the hub-only SEED set on 89 of 92 fleet boxes, applying at each 2.0.2 restart); the fleet's 15-minute watch from 21:34 (blocks per minute, the key count, the time since the last tallied lock, the five dial ports, the seeds' fleet slots, the mini's node, the fleet jobs' pids, hub-1's disk; faults fixed by pid with each restart logged; consensus never touched); the pid-only tree on master at 94ef14e7 (its four gate reds fixed inside 25 minutes; the founder's name scrubbed from box-dn3.sh by the pre-public scrub). A SECOND FRESH-INSTALL CLASS (the node lane, from build-1's two fresh-sync runs at 21:20 and 21:24 to 21:29): a fresh 7cfa422a node from genesis does NOT reach the tip: IBD takes the first 3,600 blocks, the executor reaches tip 1,943 (the last chain block of epoch 0) and stops; the IBD waits on "a class v5 header chunk waits for this node's execution state (class v5 needs the execution state after the epoch's seed block 92137840)" and after 300 s ends "this node's executor did not reach the class v5 epoch's seed block within 300 s", disconnects, re-dials and repeats; no "not held yet", no ban; so PC 2's 3,847 (the proof-missing class, the hubs' lost records) is the second stop, and this one comes first for every fresh node: a node fault of 2.0.1's own, the tip lag of 417c4a57 (the follower keeping the last two chain blocks of every path for the next pass) withholding the epoch's seed block at a chunk boundary while the class v5 catch-up waits for exactly that block: a deadlock at the first epoch boundary of every fresh install (the 17:58 fresh-join read passed because the seed was still in epoch 0); the fix: the lag applies only at a live tip (a sink whose timestamp is within ten minutes of now), on a stale sink the follower takes the path whole, with a known-failed test; 6c7abacb on successor-2.0.1 with the record-store take (a9ff0a25), the fresh-sync read on build-1 against the pair as the pass line (the node reaching the seed's tip from genesis through the epoch boundaries and the 3,685 to 3,847 band under lock 270); stage C's fresh joiners stalling at 3,600 the same class. PC 2's probe verdict (21:28:11 to 21:42): the empty-datadir restart's fresh 2.0.1 node stalling where the peerless boxes do (IBD 3598 blocks at 21:33:37, then "node behind", 0 MH/s); PC 2 mines again only on the 2.0.2 node entry (through its own update path the minute it publishes); PC 2's relay agent silent since 21:27 as it ran that restart, its revive through the signed-jobs channel by pid; the relay lane's two re-arm loops under a watchdog. The shipper: the app lane released (its quit fix ab37532c in release-2.0.2 at 7cb51f73); rules 17 and 18 on master (5fc4283d); hub-1's miner rolling on the 2.0.1 kit; the three rule-33 canaries briefed (the fleet kit on lp-4090-11, Windows on PC 2, the Mac DMG on the mini) with the steward's record form and build-1:/srv/canary/<sha>/; the 2.0.2 node sha = 6c7abacb + the 2.0.2 bump about 22:50 (45e7b910 if red), the cut about 23:15, the entries after their canaries about 00:00. The 2.0.2 line 45e7b910 six suites green (33/95/183/143/38/19), the pair placed on both boxes, the canary be5f4068 on both empty nodes, chain id 0x1171: green end to end; 6c7abacb's gate on build-9. LANE D's 6.11 AND 6.12 ON MASTER at 885327402 (21:39, read back; the logs, the harness diffs, the batch family-gate-20261008b at manifest ac86d7910, method native; the pairing read back at 1a938abe4, both pack ids equal); lane D released. THE CENSUS LANE's LAST LINE (21:36): the (c''') read rerun at the final sha 1a938abe4 reproducing hl-v6-all 0x4de7b836cc40a4ea and reading identical to the b24dfc162 rows (harness class-v6-census-all4 c7e41d5f2); the freeze's census rows standing. FLOOR LANE 2's PLACED 64-REGISTER WINDOW CORE (21:32, read back from the pod; D3's acceptance-rule chip side; the genesis families, the register file clock-gated, 8 lanes; placed and routed on ASAP7, 563,339 cells, parasitics from global routing, the SPEF lost to the full disk; gate-level VCD, steady state from 150 and 600 run cycles; a model, never a lower bound): 9.45 pJ per lane-op at ASAP7 plus or minus 15 percent (+52 percent over its synthesis, inside the band); 6.6 at N5, 4.8 at N3, 3.4 at N2; k at the lock 1.07 / 0.77 / 0.55; the GDDR7 board at the 5090's lock 2.0x node for node, 2.45x a node ahead, 2.9x two ahead on the board identity; the window's residual against the placed gated base (6.7) +2.75 pJ per lane-op, +0.23 of k at the lock: THE WINDOW TAKES THE BOARD FROM 2.4x TO 2.0x node for node and 2.8x to 2.45x a node ahead for at most 5 percent per load on the card, a real defence, the expected 2.5x and 2.1x to the digit; F05: the chip's energy per hash at N3 from 0.82 to 0.95 microjoules with the window, floor lane 3's prefix-tree share 2.6 to about 2.2 percent; 86e5b0fb2 on class-v6-floor-k, gating with the landing hand; the crossbar, tile, core8r64 and core32 rows at 22:30. THE ADVERSARY DELTA LANDED (21:42): box master 01ce4e451 (Merge class-v6-adversary-docs-3 ac0bc17e; 89 checks): the document whole, the two cells and the batch (nine cases, ADV-05 included), no repeat of the steward's rows; thirty-two landings; the placed 32-lane full core's slip once: 22:45 to 23:15 (the slower Xeon host's run dying at the clock-tree step, the timing repair peaking at 252 GB on a 251 GB host; the fleet host's run in its global placement's last passes at 503 GB, the CTS repair skipped). THE WORKERS PAGE READ IN A PLAYWRIGHT RENDER on build-2 at 21:34:33 and 21:37:52 (the build-server lane): ten server cards (the nine boxes with their OS lines and "igneum-mini, the Mac build box, M6" with "no report yet"), the crew row (the nine boxes, MacBook-Pro, PC 1, PC 2), no hardcoded feed map (the FEEDS check false), the root 302 to /workers.html, the home page's six icon links and the five icon files served (favicon.ico 200); committed e344886c and 4b4d91d3 on build-server; the old dl bookmark's redirect stub queued on the serialized dl deploy; build-3 rendering up because its feed answers tonight (the box reachable again). THE ENFORCED LANE's SLIP, ONCE: the succession RESULT and batch 21:40 to 22:10 (pausing the attacker's miner made it worse, A never adopting the honest tip in 300 s twice; reverted to a running miner with a 600 s rejoin, 9c93fd95b, from 21:34 on build-8; the node's behaviour right on every carried record in every run, the open item the harness reading all six); its Phase 1 defaults: (c) the cache-history fast-time case on 3f672661 (a proof refused for context at carrier n then paid under a matching statement; invalid bytes cached once and refused at every later carrier without a second verify) on build-9 by 03:00; (d) W one epoch of the live object (pow_epoch_blocks DAA), H the first epoch boundary after a clean 24-hour run of the live chain on the 2.0.2 line with no pause and no reorg over depth 3, the fast-time runs as the evidence; (g) the outcome ledger over every fleet box's prover-state.json and prover.log at cut plus three hours, rows by 04:00. The pool seat: pool-2.0 986252e7 (the binding switch) read back; batch 03 landing. The shipper lacks ids for an Ember lane and a comparative lane (none spawned through the coordinator); F11 NOT RUN, dispatched, if no Ember lane exists.
+THE FINALITY NATIVE-RUNS PLAN ON MASTER (21:4x, the node lane): 9e9d2532e (gate green on a470362a, read back, five mirrors): docs/plans/finality-native-runs-2026-10-09.md, PLANNED, the runs from 00:30: section 1 the 40/40/20 case past the window (honest; the equivocator on one island; on both, the 6.5 bound with two recovery certificates and lockKind "recovery" on both, the FAIL line a recovery lock presented as final; the pause-only variant); 2 the pause-only alternative with the historical-checkpoint backfill, a node with its finality state removed, every old key returning; 3 authority succession and strip, a voter's restart, certificates in reverse order (the hub-1 263-then-262 read), the seed boundary inside a pause; 4 the Sepolia verifier on a final and on a recovery certificate; 5 V6-09 on the minimum validator with the enforced-proving lane; 6 the two-node cache-history test (F01) on build-7 by 03:00; build-8 sections 1 and 2 (rows by 05:00), build-9 sections 3 and 4 after the 2.0.2 line's gate (rows by 06:00) and section 5 (rows by 12:00), build-7 section 6; every run under the lease pool with a pid file and a watcher; the rows into sim/results_v2.md with the registry batch by 07:00; the runs' lane spawned once the 2.0.2 sha is out (about 22:35), the harness extensions (the third island, the equivocating key, the backfill joiner) its first commits.
+
+A FREEZE-LEVEL FACT (21:5x BST, the steward's same-work hand, read back by the node lane): the frozen pack hl-v6-all (0x4de7b836cc40a4ea) was drawn with the genesis epoch seed edc4fa84 over a node1 state stream whose block is af89be5d, and IgneumEngine::epoch_for's class v5 pairing check refuses that pair ("the provider's stream is for chain block ..., not the seed block"); on the chain's own seed af89be5d the engine draws 2a1d6caab4c24564, not the pack's; the node and pool readers cannot re-check the frozen object AS PACKED, the CPU and CUDA readers can (no pairing check); the steward's ruling for the same-work test: a second job context on the chain-seed object 2a1d6caab4c24564 run on every reader first (the same-work row), the frozen-pack context a CPU/CUDA-only row with the reason. THE COORDINATOR'S DEFAULT unless the hash lane rules otherwise with evidence by 22:30: the D1 object is the generator tree 1a938abe4 with its freeze fingerprint and the dataset policy (the chain drawing per epoch from its own seed); the id named in F0's signing block and the D1 record the chain-seed draw read back equal from the node's engine and the CPU and CUDA readers on the same (seed, state) pair; the pack's id the research reference at its own pairing; the census hand and lane D resumed for one re-read each on the chain-seed draw (by 23:00 and 23:15); the shipper's 23:30 condition the engine's draw at devnet-4's epoch 0 seed from the placed pair equal to the CPU reader's; a FAIL or a disagreement reads "frozen pending" with this cause. THE CLASS: a pack is a (generator, seed, state) triple and the state must be the seed block's; the export tool paired them without the engine's check; the research reads at the mismatched pair are reads of the generator's draw at that pair, named so.
+THE PAIRING READ BACK (21:46:55 BST, the node lane, from the placed (c) pair /srv/artefacts/200-e8773ff5/node-lane/igneum-miner, sha 2ee4893d, the 1a938abe4 tree): `igneum-miner program-id --epoch-hex af89be5d --era-hex af89be5d --day 20730 --class v6 --state <the v5-genesis state.igsd1, sha abb58003, block 159357 af89be5d, root 1c583d35>` printing "program-id class v6 attempt 0 id 442a1691b3e3507f seed af89be5d era af89be5d day 20730 state 1c583d35", EQUAL to the freeze CLI's export of the same class on the same inputs at 1a938abe4 on build-5 (generator 6, attempt 0, id 0x442a1691b3e3507f, loads 256, era label 93a14ac6; the hash lane's decision (a)): the D1 object is the tree 1a938abe4 (fingerprint 5f4d6dc6199294db89042171004e6420c1e5791e716d4b39b73d375818c10b6f, the class-v6-review freeze line) with the dataset policy; the id in F0's signing block and the D1 record the chain-seed draw 442a1691b3e3507f at (seed af89be5d, era af89be5d, day 20730, state abb58003), read back equal from the node's engine and the freeze CLI on one pair; the pack's 0x4de7b836cc40a4ea the research reference at its own pairing (seed edc4fa84 over the same state, refused by the engine's class v5 rule by construction); the steward's 2a1d6caab4c24564 the engine's draw on MIXED inputs (epoch af89be5d, era edc4fa84), a third instance; the same-work test's node and pool contexts on the real pairing expecting 442a1691b3e3507f; the chain-seed pack for the census and lane D re-reads /srv/artefacts/packs/hl-v6-all-chainseed.tgz on build-1; (c)'s canary condition PASS on this read. A 2.0.2-BLOCKING FAULT (the V6-07 sub-lane, 21:5x, with evidence): master's proving host after the V6-10 commit 7604fcf5d writes every guest input with the first field format = 3 (core/src/shard.rs GUEST_INPUT_FORMAT, check_input_format in the guest) while master's pinned guests are the 5 October pair (elf/igneum-prove-program.elf last changed at 15bb6cdd4, the manifest pinned_at 2026-10-05T16:20:38Z with no input-format or source-commit field; pin C held on p22-stage-2-pin); measured: a host built from box master cef5234b5 with cuda (66662219a3630772) executing fees-v1-shards2 shard 0 to "public values are 0 bytes, expected 328" on an RTX 3060 and an RTX 4060, the served 0317 host (71bc2438) proving and verifying the same shard in 14.1 s on the same card; nothing built from master's proving crate proves against the pinned guest; the fix by default: the host writing the input format the pinned manifest names (format 3 only when the manifest's pair is pin C, the manifest carrying input_format and source_commit), a known-failed test, and a CI check (a GUEST_INPUT_FORMAT change without an elf/ and manifest change fails), the enforced lane's by 22:30, the 2.0.2 kit's prover held on it; the V6-07 rows' default path on the served 0317 host, the proving rows on master's host NOT RUN with the cause. THE 2.0.1 LEDGER BASELINE (the enforced lane's dry run on lp-4090-01 and lp-4090-02 over 10.2 hours, pulled 21:45): 160 claimed jobs, paid 2, active 32 (submitted and waiting), expired 98 (97 unpaid after a submit, 1 held past its deadline), cancelled 28 (17 shards refused, 8 segment records refused, 3 chain failures), abandoned 0, the conservation holding; paid completions 2 segments and 47 shards, 3.72 IGN, median end to end 212 s, median time to pay 232 s; missed deadlines a median 24 DAA past with a median margin of 434 DAA at the claim; 11,862 of 13,489 GPU seconds wasted, 8,700 on records accepted and never carried in time; 0.2 segments an hour per two boxes, 2.7 percent of seconds paid; the loss the carrier side (97 of 160), not the prover (3 chain failures) nor the claim margin: the cell the 2.0.2 hold must move (the record store and relay caps, V6-08's lease and backpressure); if the unpaid share does not fall from 61 percent, 2.0.2 did not fix the carrier path; a 4090 box earning 1.86 IGN in ten hours at this rate, a home card nothing it can rely on; the 47-box pull at the cut plus three hours (about 02:15), rows by 04:00 per tier and kind with this as the 2.0.1 column. THE 17 GB CLASS CLOSED BY CONSTRUCTION (21:46, the build-server lane): two jobs deploys running at once again (pids 15981 and 27252, publish-jobs.sh from other lanes, the Mac's dozens of worktree copies carrying no lock); the fix at /opt/homebrew/bin/npx, a serializer taking an exclusive lock on ~/.igneum-guard/vercel-deploy.lock for any `npx ... vercel ... deploy`, inherited by the tree, released on exit, a second deploy waiting (the holder named) and refusing with exit 75 after 15 minutes, every other npx call passing through (the Homebrew link kept as a backup), tested with two concurrent fake deploys, logged; the script side on dl-publish-off-mac d0005844 (publish-workers.sh refusing on a Mac, publish-fleet.sh refusing unless IGNEUM_MAC_DEPLOY_OK=1 with a pid-recorded process group, publish-jobs.sh with the lock and IGNEUM_DL_PUBLISH=box, docs/release/dl-publish.md naming the split: the jobs triple movable to build-1's Caddy under a dl-jobs host with no app change after one last deploy whose vercel.json 307s the feed there); the flip held on the coordinator's word: after the 2.0.2 entries are live and PC 2 reads MINING-ON, on the shipper's word with PC 2's fetch through the redirect as the canary, else the morning's first item; the old bookmark redirecting (307) since 21:44:19.
+MAIN'S RULING ON THE PAIRING (21:5x): the coordinator's default is the ruling (D1 freezes the generator tree 1a938abe4 with its fingerprint and the dataset policy; the chain draws per epoch from its own seed; the id in F0 and the D1 record the chain-seed draw read back equal from the node's engine and the CPU and CUDA readers on the same (seed, state) pair; the mismatched pack's id the research reference at its pairing, labelled; the census hand and lane D rerunning on the chain-seed draw by 23:00 and 23:15; the shipper's 23:30 condition the engine's draw at devnet-4's epoch 0 seed from the placed pair; a FAIL or a disagreement "frozen pending" with this cause); the class in the record; the export tool gains the engine's pairing check before any pack is named again (the hash lane, with the freeze note); the hash lane's 22:30 window for a contrary ruling with evidence standing. GOV-03's CLASS NAMED (21:49, the build-server lane): the cross-box igneumd difference a C __DATE__/__TIME__ compiled into a C dependency (mimalloc's version banner), not Rust nondeterminism: build-1's igneumd carrying "Oct  7 2026" and "02:53:46" (its sccache serving yesterday's object), build-8's "Oct  8 2026" and "18:58:34", build-9's "20:31:38"; .text and .rodata differing only by that string's shift, .eh_frame, .data and .data.rel.ro identical, no build-id note in any (zig linking none, so --build-id=none a no-op); the earlier "identical string tables" read (strings -n 12) missing the 11-character date, corrected once; the fix SOURCE_DATE_EPOCH set to the node commit's time for every ship build (zig's clang pinning __DATE__/__TIME__ to it), forwarded to the box and part of the object hash, folded into the ship-v3-sysroot change in tools/build-remote.sh; the test the 7cfa422a seed pair built on build-8 and build-9 byte-identical, the row PASS on that read by 04:00; the miner pair already bit-identical; the 2.0.2 chains holding the served prover pair (host 71bc2438, export 263bf4ce) unless the enforced lane's format fix lands green before the cut.
+THE HASH LANE's RULING (22:00): the pairing holds; the freeze CLI at 1a938abe4 on the engine's inputs (epoch seed af89be5d, era 0:edc4fa84, day 20730, the node1 state 1c583d35 at block 159357) drawing generator 6, attempt 0, id 0x2a1d6caab4c24564, equal by its read to the engine's program-id line on the placed (c) pair; the pack's pairing (the genesis string seed edc4fa84 over the state after af89be5d) a deliberate research pairing from the W = 8 lane's 14:00 recipe, not a tool fault (the CLI having no seed-block check; the engine's check the chain's rule); the D1 object agreed as the tree 1a938abe4 with its fingerprint and the dataset policy; the five packs re-exported on the chain pairing as a parallel set (hl-v6-all-cs and partners) by 22:30. A DISAGREEMENT on the signing id (22:0x): the node lane's 442a1691b3e3507f (--era-hex af89be5d) against the hash lane's 2a1d6caab4c24564 (era 0:edc4fa84), the era field the question; closed by a live read: the node lane reading the program-id line the live devnet-4 node prints (build-1's seed log or lp-4090-11's miner log, epoch 0, day 20730, the era label) by 22:15, that id F0's; the census and lane D holding ten minutes for the inputs; the export tool's pairing check still owed by main's word (a CLI without the seed-block check having produced the mismatched pack).
+THE SIGNING ID CORRECTED (22:05, the hash lane): the id read back EQUAL by the node's engine and the CLI is 2a1d6caab4c24564: the node lane's engine line at 21:46:55 reading "program-id class v6 attempt 0 id 2a1d6caab4c24564 seed af89be5d era edc4fa84 day 20730 state 1c583d35" (the era the chain's era seed edc4fa84, not the block hash), the CLI at 1a938abe4 on those inputs drawing the same (build-5, 21:48); 442a1691b3e3507f the CLI's draw with the block hash as the era (the hash lane's first read at 21:45:59, the census hand's 21:48 read the same wrong era), matching no engine run; F0 and D1 naming 2a1d6caab4c24564 at seed af89be5d, era edc4fa84, day 20730, state abb58003 (root 1c583d35), the node lane's live log line by 22:15 as the confirmation; the export tool's pairing check with its known-failed test on class-v6 tonight. THE PROVER DECISION (22:0x, the enforced lane, said once to the shipper): the host-format fault's root older than the format tag (master's proving crate writing inputs the 5 October guests cannot read since the D4 flag landed on master without its pin, 34f5914d2, compounded by stages 1 and 2 and the format tag; the only host proving against the served pair one built at the pin's source 15bb6cdd4, the 0317 host); the 2.0.2 kits ship the served 0317 prover pair (host 71bc2438, export 263bf4ce); a host rewritten in forty minutes and rolled to 47 boxes the fault class the founder forbade; the layout-by-manifest host on 2.0.3 with a card-measured proof first; on master before the cut by 22:25: the manifest's provenance for the served pair (source_commit 15bb6cdd4, guest_input_format 1), the host refusing at start when its input format is not the manifest's (naming the source commit to build from, never "0 bytes"), the known-failed test, the CI check (a GUEST_INPUT_FORMAT differing from the manifest's red unless the same diff moves elf/; the kit's prover built from the manifest's source_commit, never master's tip, until pin C moves). V6-07's floor patch 8c1fb754c (sha 9098c3e5, the one the landed server db37c38b was built from).
+The coordinator's 442a line withdrawn once (22:1x; it carried the node lane's mis-quoted argument); F0 names 2a1d6caab4c24564 at (epoch seed af89be5d, era 0:edc4fa84, day 20730, the node1 state at block 159357, root 1c583d35, sha abb58003), the live node's program-id line the confirmation by 22:15; the steward's same-work hand's second context on it with hl-v6-all-cs.tgz and its CPU reference by 23:00. The pool seat released (22:0x): pool-2.0 986252e7 (the daemon refusing jobs while its node reads unsynced, blocked or reexecuting), batch 03 with the corrected cause and docs/analysis/pool/pool-pair-2026-10-08.md on master at 499c5c9b (21:49; UX-05 the vote-key PASS in the crate, the live pair NOT RUN; UX-04 NOT RUN with the synced-node dependency). The whole fleet's miners on 2.0.1 (hub-1's rolled at 21:43, 102 blocks in 343 s, zero refusals; the shipper's read).
+THE SIGNING ID CLOSED (the node lane's verbatim lines from the placed (c) pair, igneum-miner sha 2ee4893d, the 1a938abe4 tree, on build-1): (1) 21:41:51 BST on epoch af89be5d, era edc4fa84, day 20730, the node1 IGSD1 state (sha abb58003): "program-id class v6 attempt 0 id 2a1d6caab4c24564 seed af89be5ddbadb6f6b4aee28ac8f249713be5d4c12621e3cea7f83ceada3c66b3 era edc4fa844da9dc98d37e965176f6558a31560e40502ab3ae5491b21aaaabfb07 day 20730 state 1c583d352bb9c75a06dadb8d82d42836ebe8afa82d0b413be87bf921741f1526"; (2) 21:46:55 with the block hash as the era: id 442a1691b3e3507f, the wrong argument for F0 (the chain's era seed is edc4fa84, the era VDF's output, not the block hash), named once; F0 AND D1 NAME 2a1d6caab4c24564 at (seed af89be5d, era edc4fa84, day 20730, state 1c583d35), the pack's 0x4de7b836cc40a4ea the research reference. (3) The live node's own line: the live chain is class v5, generator 5 (no class v6 epoch on any live chain, by construction of the freeze); build-1's seed and the fixed miner at the live epoch 2: "epoch seed 3c3fab434f7fd894ce6db0b09f298c3865726253e4fc68fd77acd163ccea8221 day 20734 (daa 8565): program and 256 MiB cache ready in 2604 ms; class v5 program id 81fbfa3aa413173f", and the (c) pair at 22:50:21 on those inputs with the live epoch-2 stream (igneum_getPowStateLeaves on 3c3fab43, 21,132 bytes) reading "program-id class v5 attempt 0 id 81fbfa3aa413173f seed 3c3fab43 era 0000...0000 day 20734" and the same id with era 3c3fab43 (class v5's id not reading the era, which enters from class v3's era rungs under the ladder, never active on devnet-4): the live node's id reproduced exactly by the placed (c) pair; the pairing witness for class v6 is line (1); for devnet-4's epoch 0 instance of the v6 object the (c) pair drew attempt 1 id a3764f0fc4c3d9f3 (era = genesis) and 1c54a42911b93e1e (era = zero) on the genesis stream at 21:48:17, the hash lane naming which era devnet-4's epoch 0 carries if the register wants that row. (The node lane's "22:50:21" stamp is its box's, two hours ahead of the Mac's; the Mac read 21:5x.)
+F03 LANDED (21:52 UK, read back): box master ee3e0245 (ci-f03-manifest 69b51369, 89 checks, under the lock, try 1): release-manifest-check with the provenance rule, build-from-manifest, the same-work spec page, p01-vectors --job-context/--phase, the cells harness:release-manifest and harness:same-work, GOV-01 moved with the F0 page, the generators keeping evidence_records on regeneration; one fault read back: R2-F03-R01 reading NOT RUN though its cell recorded PASS (the normalizer's lifted legacy "record" entry, a reason with no run, counted by the combined decision), the fix (a reason-only entry never counting, dropped when a real cell lands) with the guest-format landing by 22:10; rule 33's gate on 5fc267f9.
+THE EXPORT TOOL's PAIRING CHECK (21:58 BST, read back): class-v6 ce6e6902f45f40e727726cf3e0dbf0e1c924658a (the suite on build-7 151 passed, 0 failed, 8 ignored: the freeze's 147 plus 4): StateStream::check_pairing first on every --state command (export, bench, hash, hash-bound); a seed whose block is not the stream's block exits 2 with the engine's reason and writes nothing; a string seed never pairs; --unpaired-state recording a research pairing on purpose and printing it; the known-failed test (tests/pairing.rs) exporting the hl-v6-all shape and reading the refusal, then the same with --unpaired-state and the chain's own pairing; the generator untouched (state.rs, main.rs and the test only), the frozen object still 1a938abe4's draw; the five chain-paired packs exported at 1a938abe4 on build-5 (hl-v6-all-cs 0x2a1d6caab4c24564; the four partners' ids and shas about 22:15).
+RULE 33 LANDED (22:01 UK, read back): box master d2e1c192 (ci-rule33-canary 8687874e, 91 checks, under the lock, try 1): tools/ci/canary-check.sh (the record tools/ci/canary/<sha>.json, one file per sha with an artefacts list fleet/windows/mac/hive, each block its own non-AVX-512 box and eight read-back lines; --artefact <kind>; --form), the guards in packaging/ota/publish-manifest.sh (--release-sha, refused without a PASS block for each platform published; loopback test writes and --verify-only not gated) and publish-public.sh (the sha from the manifest's "release: <sha>" note; hive its own block), deploy-win.sh covered through them; the registry: INT-07 BLOCKED on cell canary:fresh-install (no 2.0.x sha with a record; the shipper's 2.0.2 canary the first), POW-03 and POW-07 citing their own files (the merge replaying modified batches too); the guest-format check (a format bump without elf/ red at the merge; a manifest field off the source red only without provenance) and the recorder's lifted-record fix queued behind it.
+THE CHAIN-PAIRED PACKS READ BACK (22:03 BST, build-1 /srv/artefacts/packs/, sha256sum -c OK): hl-v6-all-cs 0x2a1d6caab4c24564 attempt 0 loads 256, tgz a4742bfefdc632a1f3977c9dfb8f66417c2f132436dcd9ad72c32a608638d6ca; hl-v6-all-nowin-cs 0x4e1897e6ee262228 attempt 0, 6ef02eeea5d078f5215b09145239e27a83c8a41e6bccb11bd638d3170b0538bb; hl-v6-foldrw-cs 0xb53d00f2bf629076 attempt 0 loads 128, 4f2abd36aee600d97d230b5b09f10680f228448007c6c7062fca737bf6351748; hl-v5-nowin-cs 0xa02b1a9dee6b8587 attempt 1 loads 128, e2eb2840879d264a8d3562751f983ce57d821087ae6d52796eccf3ef48484b8e; hl-v6-all-prefix-cs 0x2a1d6caab4c24564 (the F05 prefix text), a9e01f13d6f26f133504c6d62e73b86ee460b53d8798218100b2f250e0ac8ca5; all at 1a938abe4 on the pair epoch af89be5d, era edc4fa84, day 20730, state abb58003, generator 6, each with identity.json. The P01 CPU reference of the signing object: /srv/artefacts/packs/p01-vectors/hl-v6-all-cs.txt, 1,000,000 lines, sha256 b77c61d874aed238394fd0e556113192acf21e0762871b1044796f3fbaea338a (first line "0 2394c9f10f9447a2", last "999999 cdaadae412c7d9c1"), build-5 21:55 to 22:02; the OpenCL read on PC 1's RX 7600 queued behind the knee rows; the Metal read the morning's; the row docs/analysis/class-v6/rows/pairing-20261008.md with batch hash-lane-20261008-batch3 landing next.
+UX-01's WRITE-BACK ON MASTER (21:43 UK, read back by the relay lane): dc94dda9 (the batch ux-01-20261008-win-2.0.0.json replayed; manifest aa354ed5; method team-reported; the cell pc:install-update covering UX-01 as team-run evidence with the P10 study NOT RUN, UX-07's install classes and OPS-03's update path; the evidence docs/plans/evidence/UX-01-20261008.md with PC 2's 2.0.0 and 2.0.1 read-back lines and the two network classes); four earlier attempts refused by rule 26 while other lanes landed docs: the shape that lands is a branch carrying only the batch, the cell and the evidence, never the registry or the generated page (the class for every lane's write-back).
+GOV-03 PASS (22:05 BST, the build-server lane, read back on the boxes): the 7cfa422a seed pair built on build-8 and on build-9 byte-identical (igneumd 6502b3c7d58a16dfa5adaef30ffc696714f1a09f117648c62b4973fe129a8075, igneum-miner b4748308e0887982c7f2ce3f06bc64802aa6ea9780adb61413fcbb8934f69e37), the C banner reading the commit's author time ("Oct  8 2026" "18:44:40"), the fingerprint cbc5bd0aa10585c8 in both; the exact cause under the date: SOURCE_DATE_EPOCH exported but sccache's server compiling C in its own environment so clang never saw it; the fix defining __DATE__/__TIME__ on the compiler command line (both caches keying on it), ship-v3-sysroot 5c494c08; one class left: a non-ship native build through sccache still baking the wall clock, only the --ship path pinned. THE V3 KIT (a correction first: the 2,018 zmm lines were blake3 1.8.3's AVX-512 assembly, cpuid-dispatched, not glibc; under zig glibc is dynamic): the certified build --ship seed/linux at target-cpu x86-64-v3 with blake3's pure feature (no AVX-512 code linked), -mpclmul for rocksdb's crc32c, an ISA gate on the box failing the run on any AVX-512 line; read back zmm 0, ymm 371,416, runs ("igneumd 2.0.1"), GLIBC_2.34 floor; the hive/rig class defaulting to x86-64 (v1) on purpose (common HiveOS rig CPUs without AVX2; a v3 igneum-miner dying with SIGILL), zero zmm there too; the branch pushed not merged, the shipper deciding if the 2.0.2 cut takes it (green before the cut); the cost blake3 pure dropping the AVX-512 hash path on AVX-512 seeds, hashing only; the 2.0.2 dual-chain script staged (app202/run-202.sh, asserting the served prover pair, a kit-isa line per binary); two gaps for the shipper: the DMG and the Setup exes outside the chain (the Mac lock, the PC job), the lab hive's archive renamed to the brief's name with its inner directory igneum-lab/.
+THE SUCCESSION CASE PASSES (22:04 UK, the enforced lane; build-8, 21:34 to 22:04, the F01/F02 fix node 3f672661, floor 360, window 300, two real proofs per phase): below H the next pair refused on its pair and the prior on its statement; in the window both on their statements, none on a pair; after H+W the prior on its pair and the next on its statement; nothing paid; no stale refusal replayed; the batch enforced-proving-20261008-02 (harness:proving-enforcement, seven cases, manifest 3f672661) in the gate with the harness and docs/design/key-succession-schedule.md, THE H AND W PROPOSAL for the 08:00 read-back: W one live epoch (3,600 DAA); H the first epoch boundary at least an epoch after a clean 24-hour run of the live chain on 2.0.2 (no pause, no reorg over depth 3, every fleet node on the cut); pin C the next pair, the served pair the prior; the evidence table carrying the five runs. Phase 1 item (d)'s evidence complete.
+
+A CONSENSUS-LEVEL FAULT (22:08 BST, the node lane, read from build-1): igneum-devnet-4 split into at least four chains at the class v5 epoch cuts. The matrix (eth_getBlockByHash on each node at 22:06): build-1's seed (188.40.146.49:26631, a dial target) stuck at executed tip 6,162 (daa 10,799, its epoch-3 boundary) since 21:34, holding 1a87e870 as chain block 5,760 (its epoch-3 seed); the hand (26671) holding the same 1a87e870 at 5,760 then its own epoch-4 seed 550eab88 at 7,988, tip 8,144 (daa 14,474), still mined; the light reader (26882) holding neither, its epoch seed f8dffb78 at 5,560, tip 6,919 (daa 20,496), locking checkpoints 681 to 683 at 59.7 percent of total; the fleet's chain (peers 213.173.111.10, 203.57.40.129, hub 64.119.209.250) on 756ff5bd as its epoch-3 seed, absent from all three; the seed refusing every fleet epoch-3 header ("header rejected before the PoW engine: invalid proof of work", strikes, bans), the fleet banning the seed for 600 s (N6) for re-advertising its refused tip f09df69b; the seed's, the hand's and the light reader's IBD attempts against fleet peers dying in the 300 s wait "no published state stream after 756ff5bd (the block is not on its chain)"; the seed logging voter EQUIVOCATIONS at indexes 76 to 83, 250 and 262 and holding locks 260 and 261 by certificate with zero local votes: the voters split across the chains. THE CAUSE (two node classes, both in 2.0.1 and in 6c7abacb): (1) the class v5 IBD catch-up syncing bodies once, before the first deferred chunk, so every further epoch boundary costs the 300 s state wait and an IBD restart (measured on 6c7abacb's fresh node: 1,943 for 300 s, then 2,645 to 3,843 in 20 s after the restart); (2) structural: a node whose executor captured block X as epoch N's reference validating only epoch-N headers seeded by X; another chain's epoch-N headers (seed Y) refused for want of the state after Y, their post-cut weight never counting, GHOSTDAG never moving the virtual to Y's chain, the executor never capturing Y: once two nodes differ at a cut they can never rejoin, each extending its own chain with whatever miner points at it; a lock above the fork (the seed's 260/261) making it permanent: THE D5 PARTITION HAPPENING LIVE WITHOUT A PARTITION, THE EPOCH CUT ITSELF THE PARTITION. The fresh-sync read on 6c7abacb's pair red for the wrong reason (1,943 to 3,843 across the first two cuts, then 3,844 whose carried proof no build-1 node serves in 20 s, the records lost after the hub reorg; the lock rule unable to cover it on a fresh node; the seed's "tip" a dead fork). THE NODE LANE'S DEFAULTS unless main says otherwise by 22:40: (a) fix (1) on the 2.0.2 line as one commit by 22:45 (bodies re-synced to the highest validated deferred header on every state wait, the 300 s budget reset on progress), the six suites read back; the 2.0.2 name sliding once from 22:35 to 23:30; (b) fix (2), the foreign-seed capture (on the state wait for Y, the executor executing Y's selected-parent chain from the fork point in a scratch state and publishing the stream under Y's hash, so the headers validate, the weight counts and the virtual can move), designed with the enforced and hash lanes (class v5 design section 5) and built on the 2.0.2 line tonight, suites by 02:00, the two-node cache test's shape as its gate; (c) nothing by hand on the chain (no seed restart, its datadir the fork; no lock; no reorg); (d) the 23:20 freeze line standing on its own inputs (the D1 candidates gated on the live line before the split). Devnet-4 as it stands cannot heal with 2.0.1 binaries on the fleet; a reset (a devnet-5 genesis, or a coordinated restart from one chosen chain's snapshot) main's call, the node lane recommending a reset once (b) is read back; the coordinator's default to main: the chain left as it stands overnight under the guards, the 2.0.2 roll with fix (1) proceeding, the reset the 08:00 read-back's first item with (b)'s evidence, no genesis cut without main's word; the shipper's cut held on fix (1); the canary's pass line the node reaching the FLEET's chain tip from genesis through every cut, never build-1's seed; the fleet lane reading which chain the hubs, the rented miners and the voters' majority weight extend by 22:40.
+MAIN'S RULING ON THE SPLIT (22:1x UK): (a), (b), (c), (d) standing as the node lane set them; the 2.0.2 cut proceeding with fix (1) for the fleet kit (the fleet one chain, the roll keeping it one); no home-machine entry (Mac, Windows, HiveOS) publishing until its rule 33 canary proves a fresh install reaches the fleet's majority tip (within ten blocks of hub-1's) with the entry's dial targets verified by the fleet lane as nodes on that chain; the entries waiting on fix (2) if it needs it (a fresh install syncing to a dead seed's chain worse than no entry); the reset the founder's decision: the chain left overnight under the guards, the fleet rolling 2.0.2 with fix (1), the home machines waiting, the 08:00 read-back opening with the split, its cause, fix (2)'s evidence and the node lane's recommendation (a devnet-5 genesis against a coordinated restart from the majority chain's snapshot) with the cost of each; no genesis cut without his word. FOR THE REGISTER (main's words): the epoch cut acted as a partition and the network did not heal on its own: the D5 property tested live and FAILED on 2.0.1; the fix is software rolled, never hands.
+
 A SHARED-DEVNET FACT FROM THE FLEET (not this lane's, with the shipper and the infra lane): the Hetzner live seed 188.245.5.161:26611 is still on the old override object (digest eada4bda) 1 h 40 min after the 0.3.20 sweep (the fleet never touches Hetzner nodes, so it was outside the sweep); the 0.3.21 wipe canary c22-1 took five digest-mismatch rejects from it; an app with the packaged peers is refused at the seed and syncs through node1 and the hub only, a fresh joiner with only the seed cannot join, the 14 voters and the hub are unaffected; the owner puts the floor file ov16-floor-900000.json (sha 294f1f80) and the c4459193 pin on it. 0.3.21's STAGING (the node lane): the order dry-merges onto 55768f88 with nothing moving to 0.3.22; the late-join fix is 52e96c94 (70e4601e rebased onto 55768f88, exec suite 33 green with both new tests); f067f7c1, b0444f51 and 437f0438 merge clean in order; 2e32d5f6's one conflict (DST_ADDRESS beside pool-finish's DST_BINDING in consensus/core/src/finality.rs) kept both; the live-file digest eada4bda after each (every switch at never); the staging waits on the shipper's sweep-end word; the re-pin held. PC 2 DOWN AGAIN (main, 16:5x UK): the founder takes PC 2 down for cable work (PC 1 back but his desk); both PCs out of the sweep's waves, each updates on its poller on return; no PC job to PC 1; the Windows G1 completed before the outage, nothing reruns. 0.3.21's SECOND GATE LINE on 55768f88 (sha256 279b1b690e854fc9): the ten-minute mixed-version gate beside the 5899f603 pair, 13:37:40Z to 13:47:52Z, SUMMARY PASS (one digest b0afb2ee on five nodes; 223 new and 381 old blocks accepted by the old hub, 0 rejected; counts equal at 319, 486 and 604 through both clean joins and the restart step at 13:45:22Z; no panic); the node lane's two lines on 0.3.21's first candidate complete, in plan 6.9 on ca3-v4-node; the fleet's set on it (the bare-child 12 GB line, the wipe, the kept read, the cases) is the fleet's. 0.3.21's FIRST GATE LINE on 55768f88 (sha256 279b1b690e854fc9, the string read back; pairing igneum-pow 8c728ca3 at byte 5): the digest gate 13:35:41Z to 13:37:19Z SUMMARY PASS (a89be8a7 on both binaries with the peers; db9a85f9 refused, no peer; the live file's eada4bda unmoved); the ten-minute mixed-version gate from 13:37:40Z, line about 13:50Z. The 0.3.21 order as the shipper sent it: 55768f88; f067f7c1 and 70e4601e; b0444f51; 6eb21fc9; db28d331; then the re-pin from 8bdcbdd8 on the coordinator's word; suites between, the digest read after every one; the mirror's release-0.3.20-node back at the pin c4459193, release-0.3.21-node open at 55768f88. THE LATE-JOIN COMMIT (N9's second half, the node lane): 70e4601e on the box mirror as branch proof-hold-fix, from c4459193, two files (igneum/exec/src/proving.rs, protocol/flows/src/v10/proving.rs); the gap was the fetch side on the joiner (the served record ran the native check against the joiner's trailing exec state before anything was stored, the check refused it, the proof was never held, the body rule read "not held" for 20 s and failed the IBD); the fix holds the proof by hash before the checks (the pool entry still needs them) and the serve side says when it holds fewer than asked; the exec suite 32 passed at 13:26Z with the known-failed shape first, the flows check green 13:28Z, igneumd on build-1 at the 0321 worktree path built 13:32Z, sha256 17649eeb2f7d1290, string read back; with the testnet lane (the resume form, B alone); it joins the 0.3.21 staging as its own commit. THE WIPE CANARY ON c19-1, c4459193 (sha 45be9b02d1b002f5, string read back): FORM END rc 0 at 13:50:53Z. Wipe synced 13:35:50Z (57 minutes, inside the 98-minute class); mining 13:36:00Z to 13:47:07Z, 66 mined, 66 accepted, 0 rejected, isSynced true at the tip throughout; the hub holds 41 of its blocks in its last 700 with 0 rejects (13:47:09Z); the restart on its kept datadir at 13:47:15Z: the old process stopped at once (the new process's first lock line seven seconds after the marker; the watchdog held nothing, the b7cc37e7 fault closed), synced again at 13:48:39Z after 84 s, 109 templates read with max 3,432 ms and 0 timeouts; the kept read on pool-1's 0.3.17 copy on the same pod passed at 13:38Z (the rewrite line once, a clean second start). The pin's set on c4459193: the digest gate PASS, the mixed-version gate PASS, the wipe canary PASS, the kept read PASS, the restart PASS, the 12 GB line proves and verifies (paid is a race, not a gate); CASES END from c20-1 (about 14:50Z) is the last pin line. THE INTEROP FACT stands from the void run: the 5899f603 hub accepted 235 object-byte-5 blocks from the 8097d600 node with 0 rejected, one digest on all five nodes on the live sixteen-field file. The gates: the digest test and the kaspa-pow vector test (the amended devnet epoch-0 id 1a4230699a6b9c60 must equal, c120d7963abdcd96 must differ, the v3 control unchanged) on the box; the mixed-version Devnet 2 gate (the amended 0.3.20 node beside a 5899f603 node for ten minutes on the live file without the v4 fields) after the Mac build; the fresh-join canary the 0.3.20 cut's |
 | Main's rulings (7 October, morning) | no generator change to v4 on the live devnet; the record's null is the window model with numbers, sent by the hash lane to the attack-pass lane so AP-F8-1 re-gates against it; a fault beyond the model (a low-entropy source at site 15) stops at the coordinator with the two options priced (a 0.3.19 class amendment before the flip, or the flip held at the floor), nothing shipping without the founder's word; the tighter tail, an acceptance bound on the hot-set share, is a CLASS V5 item (sent to the v5 lane a6410f3b8abefb762 with the 64-seed census as its gate; the bound's number follows from the model) |
 
diff --git a/docs/plans/igneum-2.0-register.md b/docs/plans/igneum-2.0-register.md
index 2e7b1c80e..c790d3659 100644
--- a/docs/plans/igneum-2.0-register.md
+++ b/docs/plans/igneum-2.0-register.md
@@ -41,7 +41,7 @@ Built 8 October 2026, 18:3x BST (the founder's order: no feature left out, no st
 | 35 | D4. A five-year coexistence model (p. 13) | Profit-maximising operator simulation: mine, internal prove, external prove, off; under a proving demand spike, a token price fall, a major prover leaving, a specialised entrant in either market. Pass if pricing and capacity rules restore service without an administrator. | research lane (ad6a2bd47d4a46105) | 21:00 tonight | in flight: operator-simulation.md landed 859b3daa, the four shocks run on floor lane 3 by 20:15 | docs/analysis/class-v6/operator-simulation.md | INC-03, INC-04 |
 | 36 | D5. A no-rescue network exercise (p. 19) | Prerequisite: proof verification enforced in consensus (verifier_in_consensus, proof_rule_active_from) live on the exercise network. | enforced-proving lane (a6e8f84588b809d62) | landed | PASSED: verifier_in_consensus live on igneum-devnet-4 from block zero (4cdcc488), the seven refusals and the fast-time crossing PASS at 17:22 | docs/spec/proving-enforcement.md | ZKP-01, ZKP-08 |
 | 37 | D5. A no-rescue network exercise (p. 19) | No founder-operated mining, proving, aggregation or mandatory distribution infrastructure. | node lane (a283f5f0d364ceef0) | days two and three | open: the three ex-testnet seeds held for it | | OPS-01 |
-| 38 | D5. A no-rescue network exercise (p. 19) | Cross epoch boundaries, interrupt signing, partition the network, remove major operators, hostile proof submissions, independently written clients. | finality lane (aca0f5ed924a2a99b) | days two and three | in flight: the partition row landed ec9ea053d (rule v4); the rest of the scenario table owed | docs/spec/finality-guarantees.md | FIN-02, FIN-03, FIN-04, FIN-08, ROT-01 |
+| 38 | D5. A no-rescue network exercise (p. 19) | Cross epoch boundaries, interrupt signing, partition the network, remove major operators, hostile proof submissions, independently written clients. | finality lane (aca0f5ed924a2a99b) | days two and three | in flight: the partition row landed ec9ea053d (rule v4); the rest of the scenario table owed; LIVE, 8 October 22:08 UK: igneum-devnet-4 split into at least four chains at the class v5 epoch cuts (a node that captured block X as epoch N's reference validates only epoch-N headers seeded by X; another chain's headers are refused and their weight never counts, so the virtual never moves and the nodes never rejoin; a lock above the fork makes it permanent): the epoch cut acted as a partition and the network did not heal on its own, the D5 property tested live and FAILED on 2.0.1; the fix is software rolled (the IBD catch-up re-syncing bodies on every state wait on the 2.0.2 line by 22:45; the foreign-seed capture built tonight with suites by 02:00), never hands; the reset the founder's decision | docs/spec/finality-guarantees.md | FIN-02, FIN-03, FIN-04, FIN-08, ROT-01 |
 | 39 | D5. A no-rescue network exercise (p. 19) | A withholding concentrated prover: replacement operators, usable inputs, reassignment, explicit behaviour during proof delays. | enforced-proving lane (a6e8f84588b809d62) | days two and three | open | | CAP-07, INC-08 |
 | 40 | Pools, software and participation (launch requirements) (p. 14) | Vote keys stay with the miner at protocol level: the member's retained voting key committed into its work, payment aggregation separate, verifiable, pool identity substitution resisted. | pool design seat (a3832b1c3b274b310) | tomorrow 18:00 | in flight: the design on master 637e508b (the header commitment, the key on job and share); the code the pool branches rebase first | docs/design/pool-vote-key-commitment.md | UX-05, FIN-05 |
 | 41 | Pools, software and participation (launch requirements) (p. 14) | Non-custodial payouts, practical minimum payouts, local work verification, low-bandwidth participation (P2Pool as precedent, not code). | pool design seat (a3832b1c3b274b310) | tomorrow 18:00 | open: designed in the same file | | UX-04 |
diff --git a/docs/plans/igneum-2.0-test-harness-map.md b/docs/plans/igneum-2.0-test-harness-map.md
index 26d5bf651..4d401d387 100644
--- a/docs/plans/igneum-2.0-test-harness-map.md
+++ b/docs/plans/igneum-2.0-test-harness-map.md
@@ -400,6 +400,22 @@ Rule: a case maps to a cell only where the cell's tests visibly answer it; cover
 - Cases:
   - INT-07 One v6 object agrees in node, pool, CPU verifier and each supported GPU host across activation.: partial: V6-12's clean-install half (one published object installed fresh, synced, mined, proved and paid on one host per artefact); the cross-host agreement half (node, pool, CPU verifier, each GPU host across activation) is harness:same-work's
 
+### review:k-lane-shadow-k
+
+- Command: `floor lane 2's placed and routed cores on ASAP7 in tools/chip-model/rtl (the rows in docs/analysis/class-v6/floor/shadow-k.md); the register landing 50ff1611f recorded ADV-06 against it before the recorder existed`
+- Box class: none
+- Fixtures: none
+- Cases:
+  - ADV-06 Separate process advantage from specialisation: partial: the placed gated cores and the adversary's forms are modelled in shadow-k.md; the independent review remains
+
+### kit:class-v6-fingerprints
+
+- Command: `KITS_BOX_SCRIPT=kits-v6-on-box.sh tools/class-v5/kits-remote.sh --box 1 (the kit zip with its emulation check), then the kit's workers on every platform: the box's CPU emulation (--check, 96 of 96 vector lanes), the fleet's CUDA 4090 (--check and --bench at 2^24, base nonce 0), the Mac's Metal (proto-metal/packbench.swift --pack) and Apple OpenCL (proto-opencl/host.c --pack --bench-pack), PC 1's RTX 5090 and RX 7600 (tools/class-v5/pc1-v6-bench.ps1), PC 2's Arc B580 (tools/class-v5/arc-v6-bench.ps1); the fingerprint of the 2^24 outputs at base nonce 0 equal on every platform for the all pack and for its known-failed partner, the two distinct`
+- Box class: build box + pods + Mac + PC 1 + PC 2
+- Fixtures: F0, F2
+- Cases:
+  - R2-F03-R02 Same job context produces identical accepted work in node, CPU reference, CUDA, Metal, OpenCL and pool.: partial: the worker half (CPU reference, CUDA, Metal, OpenCL) on the same program packs; the node's and the pool's accepted work on the same job context are the CI steward's and the pool lane's cells; PASS only when every listed platform reads one fingerprint and the node and pool halves are green
+
 ## Automated cases with no harness in the matrix (NOT RUN, the reason)
 
 - GOV-02 Approve thresholds before results: the approval is recorded in the registry's approval field; the automated half (thresholds frozen before any run_status) is the gate rule landing by 21:00
@@ -409,7 +425,6 @@ Rule: a case maps to a cell only where the cell's tests visibly answer it; cover
 - GPU-06 Measure accepted work under ordinary connectivity: accepted work under ordinary connectivity needs the fault network F4
 - GPU-07 Survive sustained thermal and power operation: the sustained thermal and power soak has no harness tonight: the project's own rig mines nothing under the the earlier devnet off order
 - POW-05 Prevent amortised cheap winning attempts: amortised cheap winning attempts are the attack lanes' grind and era harnesses (tools/attack/f7-era, f9-grind), not in the release matrix; their rows come from those lanes
-- ADV-06 Separate process advantage from specialisation: process-advantage separation is the adversary lanes' chip study
 - ROT-03 Test miner-voted bring-forward governance: miner-voted bring-forward needs a vote harness on the fault network F4
 - ROT-04 Resist seed selection and faster evaluators: seed-selection resistance is the census harness (the class v6 invention lane), not yet in the matrix
 - EVM-01 Match the selected EVM semantics: no EVM conformance-vector harness is mapped tonight; the exec suite does not run the reference test vectors
@@ -551,4 +566,4 @@ Rule: a case maps to a cell only where the cell's tests visibly answer it; cover
 
 ## Count
 
-171 automated cases: 82 mapped to a cell, 146 NOT RUN with a reason.
+171 automated cases: 83 mapped to a cell, 145 NOT RUN with a reason.
diff --git a/docs/plans/igneum-2.0-test-registry.json b/docs/plans/igneum-2.0-test-registry.json
index acf2d5852..e7f2a9b63 100644
--- a/docs/plans/igneum-2.0-test-registry.json
+++ b/docs/plans/igneum-2.0-test-registry.json
@@ -52,7 +52,7 @@
           "run_status": "NOT RUN",
           "evidence_path": "docs/plans/igneum-2.0-f0-manifest.md; build-4:/srv/builds/igneum-wt-f03-201/vendor/igneum-node/packaging/pow-freeze.txt; build-4:/srv/builds/igneum-wt-f03-201",
           "run_id": "f03-manifest-20261008-01",
-          "updated": "2026-10-08T20:51:07.788Z",
+          "updated": "2026-10-08T21:11:46.383Z",
           "evidence_record": {
             "requirement_id": "GOV-01",
             "decision": "NOT RUN",
@@ -73,7 +73,7 @@
             },
             "claim_impact": "F03's first rung: one manifest, one build, no unpublished vendor tree; the same-work rung (R02) and the transition rung (R03) stay NOT RUN until the readers run on the job context",
             "reviewer": "",
-            "at": "2026-10-08T20:51:07.788Z"
+            "at": "2026-10-08T21:11:46.383Z"
           },
           "in_progress_since": "2026-10-08T19:32:50.856Z",
           "approvals": {
@@ -103,7 +103,7 @@
               },
               "claim_impact": "F03's first rung: one manifest, one build, no unpublished vendor tree; the same-work rung (R02) and the transition rung (R03) stay NOT RUN until the readers run on the job context",
               "reviewer": "",
-              "at": "2026-10-08T20:51:07.788Z"
+              "at": "2026-10-08T21:11:46.383Z"
             }
           }
         },
@@ -952,7 +952,20 @@
           "updated": "2026-10-08T21:00:32.846Z",
           "evidence_record": {
             "reason": "the memory-clock ladder has no harness tonight: the project's own rig mines nothing under the the earlier devnet off order",
-            "at": "2026-10-08T21:00:32.846Z"
+            "at": "2026-10-08T21:00:32.846Z",
+            "method": "static",
+            "requirement_id": "GPU-04",
+            "decision": "NOT RUN",
+            "reviewer": "",
+            "claim_impact": "",
+            "release_identity": {
+              "commit": "",
+              "lockfile": "",
+              "binary": "",
+              "network_object": "",
+              "activation": "",
+              "profile_hashes": ""
+            }
           },
           "in_progress_since": "2026-10-08 18:3x UK",
           "approvals": {
@@ -1187,7 +1200,20 @@
           "updated": "2026-10-08T21:00:32.846Z",
           "evidence_record": {
             "reason": "the sustained thermal and power soak has no harness tonight: the project's own rig mines nothing under the the earlier devnet off order",
-            "at": "2026-10-08T21:00:32.846Z"
+            "at": "2026-10-08T21:00:32.846Z",
+            "method": "static",
+            "requirement_id": "GPU-07",
+            "decision": "NOT RUN",
+            "reviewer": "",
+            "claim_impact": "",
+            "release_identity": {
+              "commit": "",
+              "lockfile": "",
+              "binary": "",
+              "network_object": "",
+              "activation": "",
+              "profile_hashes": ""
+            }
           },
           "in_progress_since": "2026-10-08 18:3x UK",
           "approvals": {
@@ -1412,21 +1438,21 @@
           "manual_page": 24,
           "owner_lane": "hash lane (a690540514aa453d7)",
           "run_status": "NOT RUN",
-          "evidence_path": "docs/analysis/review-2026-10-08-b/f10/packfile-test.log;docs/analysis/review-2026-10-08-b/f10/geometry-check-mini.log; docs/analysis/class-v6/family-gate.md",
-          "run_id": "family-gate-20261008b",
-          "updated": "2026-10-08T20:38:55.360Z",
+          "evidence_path": "docs/analysis/review-2026-10-08-b/f10/packfile-test.log;docs/analysis/review-2026-10-08-b/f10/geometry-check-mini.log; docs/analysis/class-v6/family-gate.md; docs/analysis/class-v6/rows/live-dataset-census-1a938abe4.md",
+          "run_id": "census-v6-live-20261008-2210",
+          "updated": "2026-10-08T21:20:19.390Z",
           "evidence_record": {
             "requirement_id": "POW-02",
-            "decision": "NOT RUN",
+            "decision": "PASS",
             "method": "native",
-            "cell": "harness:family-gate",
-            "manifest_sha": "ac86d7910",
-            "run_id": "family-gate-20261008b",
-            "evidence": "docs/analysis/class-v6/family-gate.md",
+            "cell": "census:class-v6",
+            "manifest_sha": "1a938abe4",
+            "run_id": "census-v6-live-20261008-2210",
+            "evidence": "docs/analysis/class-v6/rows/live-dataset-census-1a938abe4.md",
             "in_progress": false,
-            "coverage": "partial: the acceptance rule's measured rates on drawn classes (the per-candidate rejection, the attempt histogram, the exhaustion count against the independent-attempt arithmetic, the (c'') and (c''') floors' refuse rates and the pre-floor ratio spread per width), the per-site largest-bucket and index-bit statistics at the rule's own 2^20 sample with the seven known-failed seeds (p4, p8, p10, p34, p212, p225, p15), and the F8-form census at 2^20 on the F8 seed set where the attack-f8 mirror validates (0 of 96 warps mismatching); the semantics, termination and memory-bound half and the independent re-implementation are the suite's and the hash lane's; the effect-size limits are the family-gate.md thresholds, predeclared in its section 3",
+            "coverage": "partial: the fold's index statistics and the grammar bounds on 256 seeds plus the F8 set; the malformed programs are owed to harness:parser-malformed",
             "release_identity": {
-              "commit": "ac86d7910",
+              "commit": "1a938abe4",
               "lockfile": "",
               "binary": "",
               "network_object": "",
@@ -1435,7 +1461,7 @@
             },
             "claim_impact": "",
             "reviewer": "",
-            "at": "2026-10-08T20:38:55.360Z"
+            "at": "2026-10-08T21:20:19.390Z"
           },
           "in_progress_since": "2026-10-08T20:07:26.255Z",
           "approvals": {
@@ -1490,6 +1516,28 @@
               "claim_impact": "",
               "reviewer": "",
               "at": "2026-10-08T20:38:55.360Z"
+            },
+            "census:class-v6": {
+              "requirement_id": "POW-02",
+              "decision": "PASS",
+              "method": "native",
+              "cell": "census:class-v6",
+              "manifest_sha": "1a938abe4",
+              "run_id": "census-v6-live-20261008-2210",
+              "evidence": "docs/analysis/class-v6/rows/live-dataset-census-1a938abe4.md",
+              "in_progress": false,
+              "coverage": "partial: the fold's index statistics and the grammar bounds on 256 seeds plus the F8 set; the malformed programs are owed to harness:parser-malformed",
+              "release_identity": {
+                "commit": "1a938abe4",
+                "lockfile": "",
+                "binary": "",
+                "network_object": "",
+                "activation": "",
+                "profile_hashes": ""
+              },
+              "claim_impact": "",
+              "reviewer": "",
+              "at": "2026-10-08T21:20:19.390Z"
             }
           }
         },
@@ -2561,21 +2609,21 @@
           "manual_page": 28,
           "owner_lane": "k lane (a3c9601a6d4686fe1)",
           "run_status": "NOT RUN",
-          "evidence_path": "docs/analysis/class-v6/multi-family-adversary.md; docs/analysis/class-v6/floor/shadow-k.md; docs/analysis/class-v6/multi-family-adversary.md",
-          "run_id": "adversary-20261008-placed-8lane",
-          "updated": "2026-10-08T20:41:20.327Z",
+          "evidence_path": "docs/analysis/class-v6/multi-family-adversary.md; docs/analysis/class-v6/floor/shadow-k.md; docs/analysis/class-v6/floor/shadow-k.md",
+          "run_id": "floor-k-20261008-rows-repeat",
+          "updated": "2026-10-08T21:09:38.300Z",
           "evidence_record": {
             "requirement_id": "ADV-05",
             "decision": "NOT RUN",
             "method": "model",
             "cell": "adversary:mf-placed",
-            "manifest_sha": "3a8874fef",
-            "run_id": "adversary-20261008-placed-8lane",
-            "evidence": "docs/analysis/class-v6/multi-family-adversary.md",
+            "manifest_sha": "86e5b0fb",
+            "run_id": "floor-k-20261008-rows-repeat",
+            "evidence": "docs/analysis/class-v6/floor/shadow-k.md",
             "in_progress": true,
             "coverage": "partial: the SRAM macros, ports, wiring, clocking and the complete-board terms are modelled in sections 2.3, 5 and 6 with the unmodelled items carried as uncertainty; the calibration against an existing hardware block is the k lane's bare-lane row beside it, owed as a named comparison",
             "release_identity": {
-              "commit": "3a8874fef",
+              "commit": "86e5b0fb",
               "lockfile": "",
               "binary": "",
               "network_object": "",
@@ -2584,7 +2632,7 @@
             },
             "claim_impact": "",
             "reviewer": "",
-            "at": "2026-10-08T20:41:20.327Z"
+            "at": "2026-10-08T21:09:38.300Z"
           },
           "in_progress_since": "2026-10-08 18:3x UK",
           "approvals": {
@@ -2621,13 +2669,13 @@
               "decision": "NOT RUN",
               "method": "model",
               "cell": "adversary:mf-placed",
-              "manifest_sha": "3a8874fef",
-              "run_id": "adversary-20261008-placed-8lane",
-              "evidence": "docs/analysis/class-v6/multi-family-adversary.md",
+              "manifest_sha": "86e5b0fb",
+              "run_id": "floor-k-20261008-rows-repeat",
+              "evidence": "docs/analysis/class-v6/floor/shadow-k.md",
               "in_progress": true,
               "coverage": "partial: the SRAM macros, ports, wiring, clocking and the complete-board terms are modelled in sections 2.3, 5 and 6 with the unmodelled items carried as uncertainty; the calibration against an existing hardware block is the k lane's bare-lane row beside it, owed as a named comparison",
               "release_identity": {
-                "commit": "3a8874fef",
+                "commit": "86e5b0fb",
                 "lockfile": "",
                 "binary": "",
                 "network_object": "",
@@ -2636,7 +2684,7 @@
               },
               "claim_impact": "",
               "reviewer": "",
-              "at": "2026-10-08T20:41:20.327Z"
+              "at": "2026-10-08T21:09:38.300Z"
             }
           }
         },
@@ -2669,24 +2717,29 @@
           "owner_lane": "k lane (a3c9601a6d4686fe1)",
           "run_status": "NOT RUN",
           "evidence_path": "docs/analysis/class-v6/floor/shadow-k.md",
-          "run_id": "team-2026-10-08",
-          "updated": "2026-10-08T20:10:24.556Z",
+          "run_id": "floor-k-20261008-rows-repeat",
+          "updated": "2026-10-08T21:09:38.300Z",
           "evidence_record": {
-            "reason": "process-advantage separation is the adversary lanes' chip study",
-            "at": "2026-10-08T20:10:24.556Z",
-            "method": "static",
             "requirement_id": "ADV-06",
             "decision": "NOT RUN",
-            "reviewer": "",
-            "claim_impact": "",
+            "method": "model",
+            "cell": "review:k-lane-shadow-k",
+            "manifest_sha": "86e5b0fb",
+            "run_id": "floor-k-20261008-rows-repeat",
+            "evidence": "docs/analysis/class-v6/floor/shadow-k.md",
+            "in_progress": false,
+            "coverage": "partial: the placed gated cores and the adversary's forms are modelled in shadow-k.md; the independent review remains",
             "release_identity": {
-              "commit": "",
+              "commit": "86e5b0fb",
               "lockfile": "",
               "binary": "",
               "network_object": "",
               "activation": "",
               "profile_hashes": ""
-            }
+            },
+            "claim_impact": "",
+            "reviewer": "",
+            "at": "2026-10-08T21:09:38.300Z"
           },
           "in_progress_since": "2026-10-08 18:3x UK",
           "approvals": {
@@ -2717,6 +2770,28 @@
               "run_id": "team-2026-10-08",
               "evidence": "docs/analysis/class-v6/floor/shadow-k.md",
               "in_progress": true
+            },
+            "review:k-lane-shadow-k": {
+              "requirement_id": "ADV-06",
+              "decision": "NOT RUN",
+              "method": "model",
+              "cell": "review:k-lane-shadow-k",
+              "manifest_sha": "86e5b0fb",
+              "run_id": "floor-k-20261008-rows-repeat",
+              "evidence": "docs/analysis/class-v6/floor/shadow-k.md",
+              "in_progress": false,
+              "coverage": "partial: the placed gated cores and the adversary's forms are modelled in shadow-k.md; the independent review remains",
+              "release_identity": {
+                "commit": "86e5b0fb",
+                "lockfile": "",
+                "binary": "",
+                "network_object": "",
+                "activation": "",
+                "profile_hashes": ""
+              },
+              "claim_impact": "",
+              "reviewer": "",
+              "at": "2026-10-08T21:09:38.300Z"
             }
           }
         },
@@ -9915,31 +9990,31 @@
           "owner": "Desktop product + pool leads; independent usability study",
           "manual_page": 58,
           "owner_lane": "shipper (ae892a8b0f78fe31c)",
-          "run_status": "PASS",
+          "run_status": "FAIL",
           "evidence_path": "docs/release/evidence/ux-shipper-2026-10-08.md",
-          "run_id": "canary-miner-fix-7cfa422a",
-          "updated": "2026-10-08T21:02:23.682Z",
+          "run_id": "incident-u64-coinbase-2026-10-08",
+          "updated": "2026-10-08T21:21:34.528Z",
           "evidence_record": {
             "requirement_id": "UX-06",
-            "decision": "PASS",
+            "decision": "FAIL",
             "method": "team-reported",
             "cell": "suite:miner",
-            "manifest_sha": "7cfa422a",
-            "run_id": "canary-miner-fix-7cfa422a",
+            "manifest_sha": "4cdcc488",
+            "run_id": "incident-u64-coinbase-2026-10-08",
             "evidence": "docs/release/evidence/ux-shipper-2026-10-08.md",
             "in_progress": false,
             "coverage": "partial: the miner's own template selection tests",
             "release_identity": {
-              "commit": "7cfa422a",
+              "commit": "4cdcc488",
               "lockfile": "",
               "binary": "",
               "network_object": "",
               "activation": "",
               "profile_hashes": ""
             },
-            "claim_impact": "the miner takes every template the network gives it, including coinbases above a u64",
+            "claim_impact": "no miner could take the work templates the network gave it above 18.4 IGN of merged subsidy",
             "reviewer": "",
-            "at": "2026-10-08T21:02:23.682Z"
+            "at": "2026-10-08T21:21:34.528Z"
           },
           "approvals": {
             "scope_approved": null,
@@ -9950,25 +10025,25 @@
           "evidence_records": {
             "suite:miner": {
               "requirement_id": "UX-06",
-              "decision": "PASS",
+              "decision": "FAIL",
               "method": "team-reported",
               "cell": "suite:miner",
-              "manifest_sha": "7cfa422a",
-              "run_id": "canary-miner-fix-7cfa422a",
+              "manifest_sha": "4cdcc488",
+              "run_id": "incident-u64-coinbase-2026-10-08",
               "evidence": "docs/release/evidence/ux-shipper-2026-10-08.md",
               "in_progress": false,
               "coverage": "partial: the miner's own template selection tests",
               "release_identity": {
-                "commit": "7cfa422a",
+                "commit": "4cdcc488",
                 "lockfile": "",
                 "binary": "",
                 "network_object": "",
                 "activation": "",
                 "profile_hashes": ""
               },
-              "claim_impact": "the miner takes every template the network gives it, including coinbases above a u64",
+              "claim_impact": "no miner could take the work templates the network gave it above 18.4 IGN of merged subsidy",
               "reviewer": "",
-              "at": "2026-10-08T21:02:23.682Z"
+              "at": "2026-10-08T21:21:34.528Z"
             }
           }
         },
@@ -11952,7 +12027,7 @@
           "finding_title": "The bundle contains a v6 candidate, not a demonstrated integrated v6 release",
           "finding_priority": "P0 - freeze/integration blocker",
           "owner_lane": "CI steward, hash lane (ProgramClass::V6 on freeze), pool lane",
-          "run_status": "NOT RUN",
+          "run_status": "PASS",
           "base_test_ids": [
             "GOV-01",
             "GOV-03",
@@ -11961,7 +12036,7 @@
           ],
           "run_id": "f03-manifest-20261008-01",
           "evidence_path": "build-1:/srv/artefacts/tas/f03-manifest-20261008-01/build-from-manifest-c30ab32c-build4.log; build-4:/srv/builds/igneum-wt-f03-201; tools/ci/build-from-manifest.sh; tools/ci/release-manifest-check.sh",
-          "updated": "2026-10-08T20:51:07.788Z",
+          "updated": "2026-10-08T21:11:46.383Z",
           "evidence_record": {
             "requirement_id": "R2-F03-R01",
             "decision": "PASS",
@@ -11982,27 +12057,9 @@
             },
             "claim_impact": "F03's first rung: one manifest, one build, no unpublished vendor tree; the same-work rung (R02) and the transition rung (R03) stay NOT RUN until the readers run on the job context",
             "reviewer": "",
-            "at": "2026-10-08T20:51:07.788Z"
+            "at": "2026-10-08T21:11:46.383Z"
           },
           "evidence_records": {
-            "record": {
-              "reason": "R2-F03 (P0, the external review): the regression's harness is the owner lane's (CI steward, hash lane (ProgramClass::V6 on freeze), pool lane); not yet named in the map",
-              "at": "2026-10-08T20:10:24.556Z",
-              "method": "static",
-              "requirement_id": "R2-F03-R01",
-              "decision": "NOT RUN",
-              "reviewer": "",
-              "claim_impact": "",
-              "release_identity": {
-                "commit": "",
-                "lockfile": "",
-                "binary": "",
-                "network_object": "",
-                "activation": "",
-                "profile_hashes": ""
-              },
-              "in_progress": false
-            },
             "harness:release-manifest": {
               "requirement_id": "R2-F03-R01",
               "decision": "PASS",
@@ -12023,7 +12080,7 @@
               },
               "claim_impact": "F03's first rung: one manifest, one build, no unpublished vendor tree; the same-work rung (R02) and the transition rung (R03) stay NOT RUN until the readers run on the job context",
               "reviewer": "",
-              "at": "2026-10-08T20:51:07.788Z"
+              "at": "2026-10-08T21:11:46.383Z"
             }
           },
           "approvals": {
@@ -12064,44 +12121,56 @@
             "POW-01",
             "ROT-02"
           ],
-          "updated": "2026-10-08T20:10:24.556Z",
+          "run_id": "kit-class-v6-20261008-01",
+          "evidence_path": "docs/design/class-v5-stored-state.md; build-1:/srv/artefacts/packs/packs-class-v6-20261008T202808Z.zip; build-1:/srv/builds/_log/v5-class/kits-20261008T202808Z/emu-check.log",
+          "updated": "2026-10-08T21:18:18.084Z",
           "evidence_record": {
-            "reason": "R2-F03 (P0, the external review): the regression's harness is the owner lane's (CI steward, hash lane (ProgramClass::V6 on freeze), pool lane); not yet named in the map",
-            "at": "2026-10-08T20:10:24.556Z",
-            "method": "static",
             "requirement_id": "R2-F03-R02",
             "decision": "NOT RUN",
-            "reviewer": "",
-            "claim_impact": "",
+            "method": "GPU",
+            "cell": "kit:class-v6-fingerprints",
+            "manifest_sha": "ef0f2ed8",
+            "run_id": "kit-class-v6-20261008-01",
+            "evidence": "docs/design/class-v5-stored-state.md; build-1:/srv/artefacts/packs/packs-class-v6-20261008T202808Z.zip; build-1:/srv/builds/_log/v5-class/kits-20261008T202808Z/emu-check.log",
+            "in_progress": true,
+            "coverage": "partial: the worker half (CPU reference, CUDA, Metal, OpenCL) on the same program packs; the node's and the pool's accepted work on the same job context are the CI steward's and the pool lane's cells; PASS only when every listed platform reads one fingerprint and the node and pool halves are green",
             "release_identity": {
-              "commit": "",
+              "commit": "ef0f2ed8",
               "lockfile": "",
               "binary": "",
               "network_object": "",
               "activation": "",
               "profile_hashes": ""
-            }
+            },
+            "claim_impact": "",
+            "reviewer": "",
+            "at": "2026-10-08T21:18:18.084Z"
           },
           "evidence_records": {
-            "record": {
-              "reason": "R2-F03 (P0, the external review): the regression's harness is the owner lane's (CI steward, hash lane (ProgramClass::V6 on freeze), pool lane); not yet named in the map",
-              "at": "2026-10-08T20:10:24.556Z",
-              "method": "static",
+            "kit:class-v6-fingerprints": {
               "requirement_id": "R2-F03-R02",
               "decision": "NOT RUN",
-              "reviewer": "",
-              "claim_impact": "",
+              "method": "GPU",
+              "cell": "kit:class-v6-fingerprints",
+              "manifest_sha": "ef0f2ed8",
+              "run_id": "kit-class-v6-20261008-01",
+              "evidence": "docs/design/class-v5-stored-state.md; build-1:/srv/artefacts/packs/packs-class-v6-20261008T202808Z.zip; build-1:/srv/builds/_log/v5-class/kits-20261008T202808Z/emu-check.log",
+              "in_progress": true,
+              "coverage": "partial: the worker half (CPU reference, CUDA, Metal, OpenCL) on the same program packs; the node's and the pool's accepted work on the same job context are the CI steward's and the pool lane's cells; PASS only when every listed platform reads one fingerprint and the node and pool halves are green",
               "release_identity": {
-                "commit": "",
+                "commit": "ef0f2ed8",
                 "lockfile": "",
                 "binary": "",
                 "network_object": "",
                 "activation": "",
                 "profile_hashes": ""
               },
-              "in_progress": false
+              "claim_impact": "",
+              "reviewer": "",
+              "at": "2026-10-08T21:18:18.084Z"
             }
           },
+          "in_progress_since": "2026-10-08T21:18:18.084Z",
           "approvals": {
             "scope_approved": null,
             "implementation_complete": null,
@@ -15219,6 +15288,8 @@
           "owner_lane": "CI steward with the hash lane (a690540514aa453d7) and the worker lane (a9e87343f008e0edd)",
           "run_status": "BLOCKED",
           "master_status": "PROPOSED / NOT RUN",
+          "run_id": "canary-20261008-01",
+          "evidence_path": "tools/ci/canary-check.sh; packaging/ota/publish-manifest.sh; packaging/ota/publish-public.sh",
           "updated": "2026-10-08T21:00:32.846Z",
           "evidence_record": {
             "requirement_id": "INT-07",
@@ -15289,9 +15360,7 @@
             "implementation_complete": null,
             "evidence_reproduced": null,
             "claim_authorised": null
-          },
-          "run_id": "canary-20261008-01",
-          "evidence_path": "tools/ci/canary-check.sh; packaging/ota/publish-manifest.sh; packaging/ota/publish-public.sh"
+          }
         },
         {
           "id": "INT-08",
diff --git a/docs/site/audit-2.0.md b/docs/site/audit-2.0.md
index 74ea36054..9189839c2 100644
--- a/docs/site/audit-2.0.md
+++ b/docs/site/audit-2.0.md
@@ -68,7 +68,8 @@ Labels: the five served labels are TEAM-REPORTED, MODELLED, PROPOSED, PENDING an
 | randomx.html | +14 -17. Generated from the litepaper's randomx section (50f517120) | Same as litepaper#randomx; rebuilt from litepaper#randomx: the dataset row reads the dataset policy (site-2.0-audit) | Same as litepaper#randomx: the 2 GB dataset row | measured, proposed, approximate | None |
 | receipt.html | +27 -46. "Devnet 3" becomes "the devnet"; the testnet chain entry gone | The two receipt kinds (transaction-inclusion and payment), the proof boundary, data availability, the three boundaries, the positioning line (5e5ba9b8a); both sentences start in capitals; the unlabelled 30 to 90 s finality figure dropped (site-2.0-audit) | Two sentences start in lower case, "the devnet, no value" | The receipt kind on every result; no five-label word. No label: "about 30 to 90 s after it executes" | None |
 | scenes.html | +11 -14. Chrome only; the body is unchanged | The legend reads finalised checkpoint and the Forge note finalised; the four words paragraph added (site-2.0-audit) | The legend reads pending, included, excluded, proven, locked checkpoint, and "everything under it is final" | No label | None |
-| scorecard.html | +314, new (9bdee3727); in the sitemap (1281d01fb) | The whole page: twelve gates from the plan's section 23, evidence required, do not substitute, the Today label; the release evidence packet; the wording ladder | None | TEAM-REPORTED 4, MODELLED 3, PROPOSED 2, PENDING 5, EXCLUDED 3 | The reference-population sentences land at 21:00; the Sustained proving cell needs economics to serve the 24-hour reading as history; no square og PNG |
+| prize.html | New: the disclosure prize terms page, from the scorecard shell; in the nav Learn panel, the sitemap, the share cards and the capture list | The terms: what it pays for (a placed or measured adversarial implementation that beats the served bracket under the one acceptance rule, or a reproduced shortcut in the served kit), what it does not pay for (confirmations, synthesis-only results, work outside the budget, excluded classes), judged in-house, the finding served either way, reports to hello@igneum.network | None | No label: the amount line reads "set by the founder and served here when set" | The amount |
+| scorecard.html | +314, new (9bdee3727); in the sitemap (1281d01fb) | The whole page: twelve gates from the plan's section 23, evidence required, do not substitute, the Today label; the release evidence packet; the wording ladder | None | TEAM-REPORTED 4, MODELLED 3, PROPOSED 2, PENDING 5, EXCLUDED 3 | the Sustained proving cell needs economics to serve the 24-hour reading as history; no square og PNG |
 | swap.html | +37 -40. "Devnet 3" becomes "the devnet"; chain igneum-devnet-4; the addresses pointer becomes "docs/contracts"; the wallet version requirement gone | The intro: "on Igneum, with proven execution" | None found | No label: "Every swap is a devnet block" | `docs/contracts/` holds devnet-3.json and sepolia.json, no igneum-devnet-4 file; the swap og card PNG still prints "Devnet 3" |
 | tx.html | +24 -26. Title and crumb; network "The devnet"; chips and lock state "finalised" and "not yet finalised" | The four words and definitions (5c8fdfa29, b45bf6d45); the source line names one node on the build box; the fee sentence reads 80 percent to the miner and 20 percent to the developer registrations, none to the provers, as on economics (site-2.0-audit) | "Read from node1-dn3 on the build box since 12:25 UTC on 8 October 2026"; "The priority fee splits 80/20 between the including miner and the proving pool", which economics no longer states | No label | The explorer og card PNG still prints "Devnet 3" |
 | wallet.html | +15 -19. "0.1.5" becomes "the current build"; download v0.1.6; the testnet notice gone | Nothing | Screenshots from mock state of 7 October 2026 | One "Measured" heading; otherwise no label | None beyond the label |
@@ -78,6 +79,4 @@ Labels: the five served labels are TEAM-REPORTED, MODELLED, PROPOSED, PENDING an
 - The share cards: explorer, swap, faucet and oracle PNGs were not re-rendered after their text changed in `site/og/pages.mjs` and still print the devnet number (the explorer card serves /explorer, /block, /address, /tx and /proving); the home card still prints the pre-reset line; scorecard has no square card. Rendering runs on a build box, never on the Mac.
 - /oracle states the deployed Sepolia contract's chain ids 4463 and 4464 until it is redeployed.
 - The miner page's hero screenshot is an older build.
-- /prize does not exist yet (due by 12:00 tomorrow); it gets a line here when it lands.
-- The reference-population sentences land at 21:00 (scorecard, facts page, litepaper#roadmap).
-- The 4 GiB dataset step is PROPOSED pending the founder's word (litepaper#mining, the facts page row 7, miner, app, randomx).
+- /prize serves its terms without an amount; the amount line fills when the founder sets it.
diff --git a/igneum-pow/src/accept.rs b/igneum-pow/src/accept.rs
index e02c92efe..f96ab824b 100644
--- a/igneum-pow/src/accept.rs
+++ b/igneum-pow/src/accept.rs
@@ -489,7 +489,11 @@ pub fn is_class_v4_shape(class: &LoadClass) -> bool {
         // class v5 (docs/design/class-v5-stored-state.md) is judged under the same rules: its state flag is set aside;
         // class v6 lane 1's index fold and re-weight table are set aside too (the address path and the op table are
         // not the shape)
-        && LoadClass { era: None, shadow: None, state: false, fold: false, rw: 0, ..*class } == LoadClass { shadow: None, ..V4_CLASS }
+        // the window and layer 8 off are set aside too (lane D's finding of 8 October 2026, 19:1x UK: a +nowin or +reg64c
+        // program was judged by the class v2 parts alone on the chain's path; the harness's own predicate hid it)
+        // and the era's drawn width (lane D's second finding, 20:0x UK: an era whose width set has more than one width
+        // writes the drawn width into `mix`, and the rule must judge every width of the family, not the pinned one alone)
+        && LoadClass { era: None, shadow: None, state: false, fold: false, rw: 0, nowin: false, reg64: false, reg64_chain: false, mix: V4_CLASS.mix, ..*class } == LoadClass { shadow: None, ..V4_CLASS }
 }
 
 /// One pass of the dataflow freshness over the base program then the shadow block (the order of one iteration),
@@ -849,6 +853,12 @@ pub fn check_dynamic(p: &Program) -> Result<AcceptReport, Reject> {
             check_distinct_indices_v4(p)?;
         }
     }
+    // the reg64 window's liveness rule (the window's acceptance tool, wired 8 October 2026, 19:5x UK): keyed on the
+    // window flag so no other class's verdict moves; the arithmetic-only window is refused at its first dead register,
+    // the full chain passes (129 one-warp interpretations on the closed form, under a second)
+    if p.class.reg64 {
+        check_window_liveness(p)?;
+    }
     let half = (ACCEPT_HASHES / 2) as u32;
     let mut bias_max = 0u32;
     for (bit, &ones) in acc.bit_ones.iter().enumerate() {
diff --git a/igneum-pow/src/bind.rs b/igneum-pow/src/bind.rs
index 94edea2bd..dd18b3069 100644
--- a/igneum-pow/src/bind.rs
+++ b/igneum-pow/src/bind.rs
@@ -91,10 +91,21 @@ pub fn hex(bytes: &[u8]) -> String {
 
 /// Bytes from hex (either case). `None` on odd length or a bad digit.
 pub fn unhex(s: &str) -> Option<Vec<u8>> {
-    if s.len() % 2 != 0 {
+    // on bytes, never on char boundaries (the fuzz of 8 October 2026 found a multi-byte character inside the text
+    // panicked the slice; a non-ASCII byte is a bad digit)
+    let b = s.as_bytes();
+    if b.len() % 2 != 0 {
         return None;
     }
-    (0..s.len()).step_by(2).map(|i| u8::from_str_radix(&s[i..i + 2], 16).ok()).collect()
+    let digit = |c: u8| -> Option<u8> {
+        match c {
+            b'0'..=b'9' => Some(c - b'0'),
+            b'a'..=b'f' => Some(c - b'a' + 10),
+            b'A'..=b'F' => Some(c - b'A' + 10),
+            _ => None,
+        }
+    };
+    b.chunks(2).map(|c| Some(digit(c[0])? << 4 | digit(c[1])?)).collect()
 }
 
 impl Epoch {
diff --git a/igneum-pow/src/emit.rs b/igneum-pow/src/emit.rs
index 25f14e983..13ffe7d88 100644
--- a/igneum-pow/src/emit.rs
+++ b/igneum-pow/src/emit.rs
@@ -255,7 +255,11 @@ fn program_class_header_lines(p: &Program) -> String {
         return String::new();
     }
     let mut s = String::new();
-    if p.program_class() == ProgramClass::V5 {
+    if p.program_class() == ProgramClass::V6 {
+        s.push_str("// Program class v6 (the Igneum 2.0 D1 object, docs/design/class-v6-rotating-family.md): generator version 6, class v5's\n");
+        s.push_str("// stored-state dataset with the index fold, the re-weight table and the 64-register window (the v6 flags in the class\n");
+        s.push_str("// string); a worker that runs another class refuses this pack, and a job line names the class it wants (class=v6 era=<hex>).\n");
+    } else if p.program_class() == ProgramClass::V5 {
         s.push_str("// Program class v5 (proof of stored state and of following, docs/design/class-v5-stored-state.md): generator version 5,\n");
         s.push_str("// class v4 over a dataset whose every item is keyed by the window's execution state (IGNEUM_STATE_* below, leaves.bin);\n");
         s.push_str("// a worker that runs another class refuses this pack, and a job line names the class it wants (class=v5 era=<hex>).\n");
@@ -352,7 +356,7 @@ fn class_header_lines(p: &Program) -> String {
     s.push_str(&format!("#define IGNEUM_LOAD_WIDTH_COUNTS {{ {}, {}, {} }}   // loads of 4, 16, 64 bytes per program
 ", c[0], c[1], c[2]));
     s.push_str(&format!("#define IGNEUM_BYTES_PER_HASH {}
-", p.bytes_per_hash()));
+", p.bytes_per_hash_executed()));
     s.push_str(&format!("#define IGNEUM_FOLD_ROT {FOLD_ROT}
 "));
     s.push_str(&format!("#define IGNEUM_FOLD_MUL {}
@@ -503,8 +507,16 @@ fn shadow_block(p: &Program, dialect: CoreDialect) -> String {
     ));
     let ty = if dialect == CoreDialect::Cuda { "uint32_t" } else { "uint" };
     s.push_str(&format!("        for ({ty} sh = 0u; sh < {reps}u; ++sh) {{\n"));
+    let prefix = dialect == CoreDialect::Cuda && p.address_mix() && reg64_prefix();
     for (k, ins) in p.shadow.iter().enumerate() {
+        if prefix {
+            // F05 prefix form: the shadow's writes move S too (the fold reads the live registers)
+            s.push_str(&format!("            t_ = {};\n", reg64_term(ins.dst as usize)));
+        }
         s.push_str(&format!("            {}  // s{k} {}\n", shadow_instr_line(dialect, ins), ins.op.name()));
+        if prefix {
+            s.push_str(&format!("            S ^= t_ ^ {};\n", reg64_term(ins.dst as usize)));
+        }
     }
     s.push_str("        }\n");
     s
@@ -1161,13 +1173,60 @@ fn reg_decl(p: &Program, ty: &str) -> String {
         return format!("    {ty} r0, r1, r2, r3, r4, r5, r6, r7;\n");
     }
     let names: Vec<String> = (0..p.registers()).map(|k| format!("r{k}")).collect();
-    let m = if p.address_mix() { format!("\n    {ty} m;  // reg64 full chain: the address mix of all 64 registers before every load") } else { String::new() };
+    let m = if p.address_mix() {
+        if ty == "uint32_t" && reg64_prefix() {
+            format!("\n    {ty} m, S, p_, t_;  // reg64 full chain in the F05 prefix form: S the running xor of the rotated registers, p_ the prefix, t_ the old term")
+        } else {
+            format!("\n    {ty} m;  // reg64 full chain: the address mix of all 64 registers before every load")
+        }
+    } else {
+        String::new()
+    };
     format!("    {ty} {};  // reg64: 64 live registers per lane (two 32-register windows){m}\n", names.join(", "))
 }
 
 /// reg64 full chain: the mix statement before a load, `m = r0; m = rotl_imm(m, 1u) ^ r1; ... ^ r63;` over the 63
 /// registers other than the load's source `src` (the verifier's `addr_src`, the same chain), one line; the same
 /// text in the three dialects (`rotl_imm` is defined in each).
+/// Review B's F05 (8 October 2026): the CUDA texts carry the reg64 address mix in its closed prefix form when this
+/// switch is on (`igneum-pow export --reg64-prefix`): `S` is the xor of `a[k] = rotl(r[k], (63 - k) mod 32)` over
+/// the 64 registers, kept per lane and updated after every write; a load's source is
+/// `r[s] ^ ror(P_s, 1) ^ (S ^ P_s ^ a[s])` with `P_s` the xor of the first `s` terms. The same hash, the same vectors
+/// (`verify::reg64_address_source`); a measurement text for the fleet, never the definition. OpenCL and Metal keep
+/// the fold.
+static REG64_PREFIX: std::sync::atomic::AtomicBool = std::sync::atomic::AtomicBool::new(false);
+
+pub fn set_reg64_prefix(on: bool) {
+    REG64_PREFIX.store(on, std::sync::atomic::Ordering::Relaxed);
+}
+
+pub fn reg64_prefix() -> bool {
+    REG64_PREFIX.load(std::sync::atomic::Ordering::Relaxed)
+}
+
+/// `rotl(rK, (63 - k) mod 32)` as text; a rotation of 0 is the register itself (`rotl_imm` takes 1..31).
+fn reg64_term(k: usize) -> String {
+    let n = (63 - k) % 32;
+    if n == 0 { format!("r{k}") } else { format!("rotl_imm(r{k}, {n}u)") }
+}
+
+/// The prefix-form mix statement before a load of source `src` (the F05 text): `m = ror(P, 1) ^ S ^ P ^ a[src]`.
+fn reg64_prefix_mix_line(src: u8) -> String {
+    let s = src as usize;
+    let prefix: Vec<String> = (0..s).map(reg64_term).collect();
+    let p = if prefix.is_empty() { "0u".to_string() } else { prefix.join(" ^ ") };
+    format!("p_ = {p}; m = rotr_var(p_, 1u) ^ S ^ p_ ^ {};", reg64_term(s))
+}
+
+/// The prefix form's running total after the register init: `S = a[0] ^ ... ^ a[63]`.
+fn reg64_prefix_init(p: &Program) -> String {
+    if !p.class.reg64 || !p.address_mix() || !reg64_prefix() {
+        return String::new();
+    }
+    let terms: Vec<String> = (0..p.registers()).map(reg64_term).collect();
+    format!("    // F05 prefix form: the running xor of every rotated register\n    S = {};\n", terms.join(" ^ "))
+}
+
 fn reg64_mix_line(p: &Program, src: u8) -> String {
     let mut s = String::new();
     for k in 0..p.registers() {
@@ -1223,8 +1282,13 @@ fn cuda_instr_lines(p: &Program, geom: DatasetGeom) -> String {
         let d = format!("r{}", ins.dst);
         let a = format!("r{}", ins.src);
         let b = format!("r{}", ins.src2);
+        let prefix = address_mix && reg64_prefix();
         if address_mix && ins.op == Op::Load {
-            s.push_str(&format!("        {}\n", reg64_mix_line(p, ins.src)));
+            s.push_str(&format!("        {}\n", if prefix { reg64_prefix_mix_line(ins.src) } else { reg64_mix_line(p, ins.src) }));
+        }
+        if prefix {
+            // the old term of the destination, so S can drop it after the write
+            s.push_str(&format!("        t_ = {};\n", reg64_term(ins.dst as usize)));
         }
         let line = match ins.op {
             // Metal select(A, B, c) returns c ? B : A, so the true branch is imm2 here as well.
@@ -1252,6 +1316,9 @@ fn cuda_instr_lines(p: &Program, geom: DatasetGeom) -> String {
             Op::Hot => hot_stmt(CoreDialect::Cuda, &d, &a),
         };
         s.push_str(&format!("        {line}  // {k} {}\n", ins.op.name()));
+        if prefix {
+            s.push_str(&format!("        S ^= t_ ^ {};\n", reg64_term(ins.dst as usize)));
+        }
     }
     s
 }
@@ -1371,6 +1438,7 @@ pub fn cuda_kernel_geom(p: &Program, memhard: Option<&MixParams>, geom: DatasetG
         s.push_str(&init_line(p, "uint32_t", i));
     }
     s.push_str(&reg64_init(p));
+    s.push_str(&reg64_prefix_init(p));
     s.push_str(&format!("\n    for (uint32_t it = 0u; it < {ITERATIONS}u; ++it) {{\n        uint32_t sel = r0;\n"));
     s.push_str(&cuda_instr_lines(p, geom));
     s.push_str(&shadow_block(p, CoreDialect::Cuda));
@@ -1536,6 +1604,7 @@ pub fn cuda_kernel_bound_geom(p: &Program, memhard: Option<&MixParams>, geom: Da
         ));
     }
     s.push_str(&reg64_init(p));
+    s.push_str(&reg64_prefix_init(p));
     s.push_str(&format!("\n    for (uint32_t it = 0u; it < {ITERATIONS}u; ++it) {{\n        uint32_t sel = r0;\n"));
     s.push_str(&cuda_instr_lines(p, geom));
     s.push_str(&shadow_block(p, CoreDialect::Cuda));
@@ -1947,7 +2016,10 @@ pub fn program_header(p: &Program, day: &str, ds: &DatasetSource) -> String {
     s.push_str("#define IGNEUM_LANES 32\n");
     s.push_str(&format!("#define IGNEUM_ITERATIONS {ITERATIONS}\n"));
     s.push_str(&format!("#define IGNEUM_INSTR_COUNT {INSTR_COUNT}\n"));
-    s.push_str(&format!("#define IGNEUM_LOADS_PER_HASH {}\n", p.loads_per_hash()));
+    if p.class.reg64 {
+        s.push_str("// the executed counts per nonce (review B's V6-02): twice the drawn program's under the 64-register window\n");
+    }
+    s.push_str(&format!("#define IGNEUM_LOADS_PER_HASH {}\n", p.loads_per_hash_executed()));
     s.push_str(&format!("#define IGNEUM_WIDE_LOADS_PER_HASH {}\n", p.wide_loads_per_hash()));
     s.push_str(&format!("#define IGNEUM_OP_MIX {}\n", jstr(&p.op_mix())));
     s.push_str(&program_class_header_lines(p));
@@ -2189,7 +2261,7 @@ pub fn program_json(p: &Program, day: &str, ds: &DatasetSource) -> String {
     s.push_str("  \"registers\": 8,\n");
     s.push_str(&format!("  \"iterations\": {ITERATIONS},\n"));
     s.push_str(&format!("  \"instruction_count\": {INSTR_COUNT},\n"));
-    s.push_str(&format!("  \"loads_per_hash\": {},\n", p.loads_per_hash()));
+    s.push_str(&format!("  \"loads_per_hash\": {},\n", p.loads_per_hash_executed()));
     if p.program_class() != ProgramClass::V2 {
         s.push_str(&format!("  \"program_class\": {},\n", jstr(p.program_class().name())));
         if p.program_class() == ProgramClass::V4 {
@@ -2239,7 +2311,7 @@ pub fn program_json(p: &Program, day: &str, ds: &DatasetSource) -> String {
         s.push_str(&format!("  \"load_slots\": {},\n", p.class.load_slots));
         s.push_str(&format!("  \"load_mix_percent_4_16_64\": [{}, {}, {}],\n", p.class.mix[0], p.class.mix[1], p.class.mix[2]));
         s.push_str(&format!("  \"load_width_counts_4_16_64\": [{}, {}, {}],\n", c[0], c[1], c[2]));
-        s.push_str(&format!("  \"bytes_per_hash\": {},\n", p.bytes_per_hash()));
+        s.push_str(&format!("  \"bytes_per_hash\": {},\n", p.bytes_per_hash_executed()));
         if p.has_scratch() {
             s.push_str(&format!("  \"scratch_ops_per_hash\": {},\n", p.scratch_ops_per_hash()));
             s.push_str(&format!("  \"scratch_kib_per_warp\": {},\n", p.class.scratch_kb));
@@ -2610,19 +2682,42 @@ pub fn export_pack(epoch: &Epoch, day: &str, source: &str) -> Pack {
         v.hot_fnv = h.fnv1a64();
     }
     let is_mh = memhard.is_some();
-    let mut files = vec![
-        ("program.json".to_string(), program_json(p, day, ds)),
-        ("vectors.json".to_string(), vectors_json_geom(p, day, geom, &bases, &outs, &v, source, is_mh)),
+    let texts: Vec<(String, String)> = vec![
         ("kernel.cu".to_string(), cuda_kernel_geom(p, memhard, geom)),
         ("kernel.cl".to_string(), opencl_kernel_geom(p, memhard, geom)),
-        ("program.h".to_string(), program_header(p, day, ds)),
-        ("vectors.h".to_string(), vectors_header(p, &bases, &outs, &v, mask, source, is_mh)),
         ("program.metal".to_string(), metal_program_geom(p, geom, LoadSource::Stored)),
         // Header-bound kernels (3 October 2026, bind.rs): new files, the seven above are unchanged.
         ("program_bound.metal".to_string(), metal_program_bound_geom(p, geom)),
         ("kernel_bound.cu".to_string(), cuda_kernel_bound_geom(p, memhard, geom)),
         ("kernel_bound.cl".to_string(), opencl_kernel_bound_geom(p, memhard, geom)),
     ];
+    // A06 (the external review of 8 October 2026): the pack authenticates its kernel texts by hash, not by metadata:
+    // identity.json carries the program id, the dataset and era identities and the BLAKE2b-256 of every kernel file.
+    // A file of its own, so every pinned pack's twelve files stay byte for byte (the readers ignore it).
+    let hashes: Vec<String> = texts.iter().map(|(n, t)| format!("    {}: \"{}\"", jstr(n), hex_bytes(&crate::blake2b::blake2b_256(&[t.as_bytes()])))).collect();
+    let identity = format!(
+        "{{\n  \"program_id\": \"{:#018x}\",\n  \"load_class\": {},\n  \"generator\": {},\n  \"day\": {},\n  \"dataset_bytes\": {},\n  \"kernel_blake2b256\": {{\n{}\n  }},\n  \"rule\": \"the external review's A06 (8 October 2026): a pack's program, dataset and work identities are distinct, and its kernel texts are authenticated by the hash of their bytes, never by the metadata beside them\"\n}}\n",
+        p.program_id(),
+        jstr(&p.class.name()),
+        p.generator,
+        jstr(day),
+        (ds.geom.words as u128) * 4,
+        hashes.join(",\n")
+    );
+    // the pack's file order as the pinned packs carry it, identity.json second
+    let mut texts = texts.into_iter();
+    let kernel_cu = texts.next().unwrap();
+    let kernel_cl = texts.next().unwrap();
+    let mut files = vec![
+        ("program.json".to_string(), program_json(p, day, ds)),
+        ("identity.json".to_string(), identity),
+        ("vectors.json".to_string(), vectors_json_geom(p, day, geom, &bases, &outs, &v, source, is_mh)),
+        kernel_cu,
+        kernel_cl,
+        ("program.h".to_string(), program_header(p, day, ds)),
+        ("vectors.h".to_string(), vectors_header(p, &bases, &outs, &v, mask, source, is_mh)),
+    ];
+    files.extend(texts);
     if let Some(mp) = memhard {
         files.push(("memhard.h".to_string(), cuda_memhard_header(p, mp)));
         files.push(("memhard.metal".to_string(), metal_memhard_for(p, mp)));
diff --git a/igneum-pow/src/generator.rs b/igneum-pow/src/generator.rs
index 61fe4874b..ce0084681 100644
--- a/igneum-pow/src/generator.rs
+++ b/igneum-pow/src/generator.rs
@@ -255,6 +255,11 @@ pub struct LoadClass {
     /// optimiser split [`NONLOAD_WEIGHTS_RW`] (sum 83, `or` never drawn); 2 the census lane's neighbouring table
     /// [`NONLOAD_WEIGHTS_RW2`] (sum 75). The draw rolls against the table's own sum ([`LoadClass::nonload_weights`]).
     pub rw: u8,
+    /// D2 experiment "layer 8 off" (the coordinator's order, 8 October 2026, 18:12 UK; a research class behind `+nowin`):
+    /// the era layout's window-layer draw is removed, every load site reads the whole dataset (`win = 0`, `off = 0`).
+    /// The program stream still consumes the two window draws per instruction, so the base program's instructions are
+    /// the class's without the flag; only the windows move. `false` for every other class.
+    pub nowin: bool,
     /// The 64-register window (the hash lane's reg64 measurement, 8 October 2026, a research class behind `+reg64`
     /// and `--reg64`): each lane holds 64 live 32-bit registers. r0..r7 are seeded as today, r8..r63 derived from them
     /// (`r[k] = r[k & 7] * 0x9E3779B9 + k`); the 64 drawn instructions run twice per iteration in an interleaved
@@ -455,13 +460,13 @@ impl LoadClass {
 impl LoadClass {
     /// Generator version 2 as adopted on 4 October 2026: 16 loads of one word. The lottery hash.
     pub const V2: LoadClass =
-        LoadClass { mix: [100, 0, 0], load_slots: LOAD_SLOTS as u8, scratch: None, scratch_kb: 0, mixer_mult: 1, growth: false, era: None, hot: None, derive_len: 0, shadow: None, state: false, wide8: false, fold: false, rw: 0, reg64: false, reg64_chain: false };
+        LoadClass { mix: [100, 0, 0], load_slots: LOAD_SLOTS as u8, scratch: None, scratch_kb: 0, mixer_mult: 1, growth: false, era: None, hot: None, derive_len: 0, shadow: None, state: false, wide8: false, fold: false, rw: 0, nowin: false, reg64: false, reg64_chain: false };
 
     /// The construction decided for program class v3 on 5 October 2026 (Counter ASIC 2.0, `docs/plans/mixer-x4.md`):
     /// version 2 loads (16 slots of one word, no scratch, no width roll, so the program stream is version 2's), the
     /// mixer applied 4 times per round, and the cache growth rule. Name "mx4".
     pub const MX4: LoadClass =
-        LoadClass { mix: [100, 0, 0], load_slots: LOAD_SLOTS as u8, scratch: None, scratch_kb: 0, mixer_mult: 4, growth: true, era: None, hot: None, derive_len: 0, shadow: None, state: false, wide8: false, fold: false, rw: 0, reg64: false, reg64_chain: false };
+        LoadClass { mix: [100, 0, 0], load_slots: LOAD_SLOTS as u8, scratch: None, scratch_kb: 0, mixer_mult: 4, growth: true, era: None, hot: None, derive_len: 0, shadow: None, state: false, wide8: false, fold: false, rw: 0, nowin: false, reg64: false, reg64_chain: false };
 
     /// The era class over `base` (`docs/plans/era-layout.md`): the parameters drawn by [`era_draw`]; when `allowed`
     /// has more than one width the drawn width becomes the class mix (every load that width), otherwise the base
@@ -634,6 +639,21 @@ impl LoadClass {
         LoadClass { rw, ..self }
     }
 
+    /// D2 "layer 8 off": the class with the window-layer draw removed (every load site reads the whole dataset).
+    pub fn with_nowin(self) -> LoadClass {
+        LoadClass { nowin: true, ..self }
+    }
+
+    /// The class v6 object's draw rules (the external review of 8 October 2026, A02 and A08, fixed by construction for
+    /// every class carrying a v6 flag: the index fold, a re-weight table, the register window or layer 8 off): five
+    /// of the non-load slots are shuffles whose masks are the five lane dimensions 1, 2, 4, 8, 16 in a drawn order, so
+    /// every accepted program mixes all 32 lanes by construction; and a `mad` never names its destination as its
+    /// second source (`d = a * d + d` is `d * (a + 1)`, not a bijection in `d` when `a` is odd). Every other class
+    /// draws as before.
+    pub fn is_v6(&self) -> bool {
+        self.fold || self.rw != 0 || self.reg64 || self.nowin
+    }
+
     /// The non-load op table this class draws from, in draw order, and its sum (the roll's range). The plain table
     /// for every class without the re-weight flag, so their streams are byte for byte what they were.
     pub fn nonload_weights(&self) -> (&'static [(Op, u64); 10], u64) {
@@ -677,6 +697,10 @@ impl LoadClass {
     pub fn parse(s: &str) -> Option<LoadClass> {
         // class v6 lane 1: "<class>+fold" (the index fold) and "<class>+rw" / "<class>+rw2" (the re-weight table) over
         // any class, in any order, outermost of all
+        // D2 "layer 8 off": "<class>+nowin" over any class, in any order with the other suffixes
+        if let Some(base) = s.strip_suffix("+nowin") {
+            return Some(LoadClass::parse(base)?.with_nowin());
+        }
         if let Some(base) = s.strip_suffix("+fold") {
             return Some(LoadClass::parse(base)?.with_fold());
         }
@@ -829,6 +853,10 @@ impl LoadClass {
         if self.fold {
             return format!("{}+fold", LoadClass { fold: false, ..*self }.name());
         }
+        if self.nowin {
+            // D2 "layer 8 off": "+nowin" sits inside "+fold" and "+rw" and outside "+reg64" and "+state"
+            return format!("{}+nowin", LoadClass { nowin: false, ..*self }.name());
+        }
         if self.reg64 {
             // "<class>+reg64" / "+reg64c": the 64-register window is a suffix on any class, outermost
             let base = LoadClass { reg64: false, reg64_chain: false, ..*self }.name();
@@ -935,6 +963,10 @@ pub const GENERATOR_VERSION_V4: u32 = 4;
 /// Generator version of a class v5 program (proof of stored state and of following, 7 October 2026, PROPOSED:
 /// `program_id(5, seed, attempt)`; `docs/design/class-v5-stored-state.md`).
 pub const GENERATOR_VERSION_V5: u32 = 5;
+/// Class v6 (the Igneum 2.0 D1 object, 8 October 2026; review B's F03): the class v5 draw with the v6 rules (the index fold, the
+/// re-weight table, the 64-register window with the full chain, the five shuffle dimensions and the mad operand rule by
+/// construction, layer 8 off when the flag says so), generator 6.
+pub const GENERATOR_VERSION_V6: u32 = 6;
 
 /// The program class of an epoch (Counter ASIC 2.0, 5 October 2026, `docs/plans/counter-asic-2-rollout.md`): one
 /// height switch in the node, `program_class_v3_activation_daa`, rounded up to an epoch boundary, decides which
@@ -951,6 +983,8 @@ pub enum ProgramClass {
     /// Class v5 (`docs/design/class-v5-stored-state.md`, behind `program_class_v5_activation_daa`): class v4's program
     /// over a dataset whose every item is keyed by the window's execution state ([`V5_CLASS`]), generator 5.
     V5,
+    /// Class v6 (the Igneum 2.0 D1 object; review B's F03, 8 October 2026): [`V6_CLASS`], generator 6.
+    V6,
 }
 
 /// The load class of program class v3, decided 5 October 2026 (Counter ASIC 2.0, `docs/plans/counter-asic-2-status.md`
@@ -973,6 +1007,9 @@ pub const V4_CLASS: LoadClass = LoadClass { shadow: Some(ShadowClass { instrs: V
 /// program draw, the shadow block, the era draw and the ladder rung are class v4's, draw for draw; only the item
 /// derivation and the program id change.
 pub const V5_CLASS: LoadClass = LoadClass { state: true, ..V4_CLASS };
+/// The class v6 object ("mx8+sh256x27+state+reg64c+fold+rw"): class v5 with the index fold, the k lane's re-weight table
+/// and the 64-register window with the full chain; layer 8 off is the fifth flag, drawn by the chain's family flags.
+pub const V6_CLASS: LoadClass = LoadClass { fold: true, rw: 1, reg64: true, reg64_chain: true, ..V5_CLASS };
 
 /// The shadow block size of class v4 at every rung of the latency ladder (`docs/design/latency-ladder.md`): 256
 /// instructions. The ladder moves the pass count alone.
@@ -1037,6 +1074,8 @@ pub fn era_generator_of(base: &LoadClass) -> u32 {
     match ProgramClass::of_load_class(base) {
         Some(ProgramClass::V4) => GENERATOR_VERSION_V4,
         Some(ProgramClass::V5) => GENERATOR_VERSION_V5,
+        Some(ProgramClass::V6) => GENERATOR_VERSION_V6,
+        _ if base.is_v6() => GENERATOR_VERSION_V6,
         _ if base.state => GENERATOR_VERSION_V5,
         _ => GENERATOR_VERSION_V3,
     }
@@ -1067,6 +1106,7 @@ impl ProgramClass {
             ProgramClass::V3 => V3_CLASS,
             ProgramClass::V4 => V4_CLASS,
             ProgramClass::V5 => V5_CLASS,
+            ProgramClass::V6 => V6_CLASS,
         }
     }
 
@@ -1077,12 +1117,13 @@ impl ProgramClass {
             ProgramClass::V3 => GENERATOR_VERSION_V3,
             ProgramClass::V4 => GENERATOR_VERSION_V4,
             ProgramClass::V5 => GENERATOR_VERSION_V5,
+            ProgramClass::V6 => GENERATOR_VERSION_V6,
         }
     }
 
     /// Whether the class's dataset is keyed by the window's execution state (class v5).
     pub fn has_state(&self) -> bool {
-        *self == ProgramClass::V5
+        matches!(self, ProgramClass::V5 | ProgramClass::V6)
     }
 
     /// The class of a generator version: 2, 3 and 4 are the three classes, anything else is no class this crate runs.
@@ -1092,6 +1133,7 @@ impl ProgramClass {
             GENERATOR_VERSION_V3 => Some(ProgramClass::V3),
             GENERATOR_VERSION_V4 => Some(ProgramClass::V4),
             GENERATOR_VERSION_V5 => Some(ProgramClass::V5),
+            GENERATOR_VERSION_V6 => Some(ProgramClass::V6),
             _ => None,
         }
     }
@@ -1103,6 +1145,7 @@ impl ProgramClass {
             ProgramClass::V3 => "v3",
             ProgramClass::V4 => "v4",
             ProgramClass::V5 => "v5",
+            ProgramClass::V6 => "v6",
         }
     }
 
@@ -1112,6 +1155,7 @@ impl ProgramClass {
             "v3" => Some(ProgramClass::V3),
             "v4" => Some(ProgramClass::V4),
             "v5" => Some(ProgramClass::V5),
+            "v6" => Some(ProgramClass::V6),
             _ => None,
         }
     }
@@ -1125,6 +1169,7 @@ impl ProgramClass {
     /// is v3, [`V4_CLASS`] is v4; a measurement class (a width, a derivation length, another shadow size) is none.
     pub fn of_load_class(class: &LoadClass) -> Option<ProgramClass> {
         let base = LoadClass { era: None, reg64: false, reg64_chain: false, ..*class };
+        let v6base = LoadClass { era: None, nowin: false, ..*class };
         if base == LoadClass::V2 {
             Some(ProgramClass::V2)
         } else if base == V3_CLASS {
@@ -1133,6 +1178,8 @@ impl ProgramClass {
             Some(ProgramClass::V4)
         } else if base == V5_CLASS {
             Some(ProgramClass::V5)
+        } else if v6base == V6_CLASS {
+            Some(ProgramClass::V6)
         } else {
             None
         }
@@ -1194,9 +1241,25 @@ impl Program {
         }
         out
     }
+    /// The drawn program's memory operations per nonce (16 load slots times the eight iterations on every class):
+    /// the count the acceptance rule and the draw's bookkeeping read (the acceptance judges the drawn program's
+    /// sites). The hash EXECUTES [`Program::loads_per_hash_executed`] of them, twice this under the 64-register
+    /// window; the served figures and the pack's headers name the executed count (review B's V6-02).
     pub fn loads_per_hash(&self) -> usize {
         self.instrs.iter().filter(|i| i.op.is_load()).count() * ITERATIONS
     }
+
+    /// Memory operations the hash EXECUTES per nonce (review B's V6-02, 8 October 2026): the scheduled statements
+    /// (the drawn program's loads, twice under the 64-register window) times the eight iterations; asserted to
+    /// agree with the drawn count except by the window's factor of two. The emitters alone read it (program.h,
+    /// program.json): the acceptance reads the drawn count, so no verdict moves with the served figure (the first
+    /// form of this change, 0266c9ec0, routed the executed count into the acceptance and moved every reg64 verdict).
+    pub fn loads_per_hash_executed(&self) -> usize {
+        let drawn = self.loads_per_hash();
+        let executed = self.scheduled().iter().filter(|i| i.op.is_load()).count() * ITERATIONS;
+        assert!(executed == drawn || (self.class.reg64 && executed == 2 * drawn), "the executed load count {executed} disagrees with the drawn {drawn}");
+        executed
+    }
     pub fn wide_loads_per_hash(&self) -> usize {
         self.instrs.iter().filter(|i| i.op == Op::WLoad).count() * ITERATIONS
     }
@@ -1204,9 +1267,21 @@ impl Program {
         self.instrs.iter().any(|i| i.op == Op::WLoad)
     }
     /// Dataset bytes read per hash: 4 per one-word load, 16 and 64 for the wider loads of the experiment.
+    /// Dataset bytes the drawn program's loads demand per nonce (the acceptance's and the draw's figure).
     pub fn bytes_per_hash(&self) -> usize {
         self.instrs.iter().filter(|i| i.op == Op::Load).map(|i| i.width as usize * 4).sum::<usize>() * ITERATIONS
     }
+
+    /// Dataset bytes the hash's EXECUTED loads demand per nonce (review B's V6-02): the scheduled loads' widths in
+    /// words times 4, times the eight iterations; a demand figure, not the memory's transactions (a 4-byte load is
+    /// a 32-byte sector on NVIDIA and a 64-byte line on AMD; the served text names the model it quotes). The
+    /// emitters alone read it.
+    pub fn bytes_per_hash_executed(&self) -> usize {
+        let drawn = self.bytes_per_hash();
+        let executed = self.scheduled().iter().filter(|i| i.op == Op::Load).map(|i| i.width as usize * 4).sum::<usize>() * ITERATIONS;
+        assert!(executed == drawn || (self.class.reg64 && executed == 2 * drawn), "the executed byte demand {executed} disagrees with the drawn {drawn}");
+        executed
+    }
     /// Scratch read-modify-writes per hash (variant 5): each reads 16 bytes and writes 16 bytes.
     pub fn scratch_ops_per_hash(&self) -> usize {
         self.instrs.iter().filter(|i| i.op == Op::Scratch).count() * ITERATIONS
@@ -1328,6 +1403,7 @@ impl Program {
             GENERATOR_VERSION_V3 => ProgramClass::V3,
             GENERATOR_VERSION_V4 => ProgramClass::V4,
             GENERATOR_VERSION_V5 => ProgramClass::V5,
+            GENERATOR_VERSION_V6 => ProgramClass::V6,
             _ => ProgramClass::V2,
         }
     }
@@ -1458,6 +1534,14 @@ pub fn program_id_class_recipe(generator: u32, seed: &[u32; 8], attempt: u32, cl
         // class v6 lane 1: the index fold moves every era load address
         r.lit(b"fold/");
     }
+    if class.nowin {
+        // D2 "layer 8 off": the window layer is part of the construction
+        r.lit(b"nowin/");
+    }
+    if class.is_v6() {
+        // the v6 draw rules (A02 five shuffle dimensions, A08 the mad operand rule) are part of the construction
+        r.lit(b"v6draw/");
+    }
     if class.rw != 0 {
         // class v6 lane 1: the re-weight table moves the op draw
         r.lit(b"rw/");
@@ -1626,6 +1710,23 @@ pub fn candidate_from_words_class(
     for &slot in &p[..slots] {
         is_load[slot as usize] = true;
     }
+    // class v6 (A02, by construction): five of the non-load slots are shuffles over the five lane dimensions in a
+    // drawn order; drawn from the stream after the load slots, so no other class's stream moves
+    let mut is_shfl = [false; INSTR_COUNT];
+    let mut shfl_masks = [1u8, 2, 4, 8, 16];
+    if class.is_v6() {
+        let rest = &mut p[slots..];
+        for i in 0..5 {
+            let j = i + rng.below((rest.len() - i) as u64) as usize;
+            rest.swap(i, j);
+            is_shfl[rest[i] as usize] = true;
+        }
+        for i in 0..5 {
+            let j = i + rng.below((5 - i) as u64) as usize;
+            shfl_masks.swap(i, j);
+        }
+    }
+    let mut shfl_next = 0usize;
     // Variant 5: the first k drawn load slots (a uniform k-subset, the draw order is random) are scratch ops.
     let mut is_scratch = [false; INSTR_COUNT];
     for &slot in &p[..class.scratch_slots()] {
@@ -1652,7 +1753,7 @@ pub fn candidate_from_words_class(
     // class v6 lane 1: the index fold and the re-weight table are set aside too (the address path and the table are not
     // the shape; a +fold or +rw program draws its sources under the same rule)
     let source_rule_v4 = matches!(class.shadow, Some(ShadowClass { instrs: V4_SHADOW_INSTRS, .. }))
-        && LoadClass { era: None, shadow: None, state: false, fold: false, rw: 0, ..class } == LoadClass { shadow: None, ..V4_CLASS };
+        && LoadClass { era: None, shadow: None, state: false, fold: false, rw: 0, nowin: false, reg64: false, reg64_chain: false, mix: V4_CLASS.mix, ..class } == LoadClass { shadow: None, ..V4_CLASS };
     // the op table and the roll's range: the plain table at 75 for every class without the re-weight flag
     let (weights, weights_sum) = class.nonload_weights();
     let mut fresh = [false; 8];
@@ -1682,6 +1783,9 @@ pub fn candidate_from_words_class(
                 Op::Load
             };
         }
+        if is_shfl[k] {
+            op = Op::Shfl;
+        }
         let dst = rng.below(8);
         let src = if op.is_load() {
             let mut eligible = [0u64; 8];
@@ -1710,12 +1814,21 @@ pub fn candidate_from_words_class(
                 a
             }
         };
-        let b = rng.below(8);
+        let mut b = rng.below(8);
+        // class v6 (A08, by construction): a mad's second source is never its destination
+        if class.is_v6() && op == Op::Mad && b == dst {
+            b = (b + 1) & 7;
+        }
         let imm = rng.next() as u32;
         let imm2 = rng.next() as u32;
         let rot = 1 + rng.below(31) as u32;
         let bit = rng.below(32);
-        let mask = 1u8 << rng.below(5);
+        let mut mask = 1u8 << rng.below(5);
+        // class v6 (A02): the reserved shuffle slots take the five dimensions in the drawn order
+        if is_shfl[k] {
+            mask = shfl_masks[shfl_next];
+            shfl_next += 1;
+        }
         // Version 2 loads take no width roll, so a mixer class with version 2 loads draws the version 2 program
         let width = if class.takes_width_roll() { class.width_for_roll(rng.below(100)) } else { 1 };
         let width = if op == Op::Load { width } else { 1 };
@@ -1723,7 +1836,8 @@ pub fn candidate_from_words_class(
         let (win, off) = if class.era.is_some() {
             let k = rng.below(3) as u8;
             let o = (rng.next() as u32 & ((1u32 << k) - 1)) as u8;
-            if op == Op::Load {
+            // D2 "layer 8 off": the draws are consumed (the stream is the class's) and every site reads the whole dataset
+            if op == Op::Load && !class.nowin {
                 (k, o)
             } else {
                 (0, 0)
@@ -1963,6 +2077,7 @@ pub fn generate_from_seed_bytes_program_class(seed_string: &str, seed_bytes: &[u
         (ProgramClass::V3, Some(era)) => return generate_era(seed_string, seed_bytes, V3_CLASS, era, &V3_ALLOWED),
         (ProgramClass::V4, Some(era)) => return generate_era_generator(seed_string, seed_bytes, V4_CLASS, era, &V3_ALLOWED, GENERATOR_VERSION_V4),
         // Class v5: the same draw inside V5_CLASS (V4_CLASS plus the state flag, which the draw does not read), generator 5.
+        (ProgramClass::V6, Some(era)) => return generate_era_generator(seed_string, seed_bytes, V6_CLASS, era, &V3_ALLOWED, GENERATOR_VERSION_V6),
         (ProgramClass::V5, Some(era)) => return generate_era_generator(seed_string, seed_bytes, V5_CLASS, era, &V3_ALLOWED, GENERATOR_VERSION_V5),
         _ => {}
     }
@@ -1980,11 +2095,11 @@ pub fn generate_from_seed_bytes_program_class(seed_string: &str, seed_bytes: &[u
 /// and class v4 at rung 0, is [`generate_from_seed_bytes_program_class`] byte for byte. The base program, the 16 loads
 /// and the era draw do not move with the rung: only the pass count of the shadow block does.
 pub fn generate_from_seed_bytes_program_class_shadow(seed_string: &str, seed_bytes: &[u8], class: ProgramClass, era_bytes: Option<&[u8]>, shadow_reps: u16) -> Program {
-    if !matches!(class, ProgramClass::V4 | ProgramClass::V5) || shadow_reps == 0 || shadow_reps == V4_SHADOW_REPS {
+    if !matches!(class, ProgramClass::V4 | ProgramClass::V5 | ProgramClass::V6) || shadow_reps == 0 || shadow_reps == V4_SHADOW_REPS {
         return generate_from_seed_bytes_program_class(seed_string, seed_bytes, class, era_bytes);
     }
     // class v5 at a rung: class v4's rung with the state flag, generator 5
-    let (base, generator) = if class == ProgramClass::V5 { (v5_class_at(shadow_reps), GENERATOR_VERSION_V5) } else { (v4_class_at(shadow_reps), GENERATOR_VERSION_V4) };
+    let (base, generator) = if class == ProgramClass::V6 { (LoadClass { fold: true, rw: 1, reg64: true, reg64_chain: true, ..v5_class_at(shadow_reps) }, GENERATOR_VERSION_V6) } else if class == ProgramClass::V5 { (v5_class_at(shadow_reps), GENERATOR_VERSION_V5) } else { (v4_class_at(shadow_reps), GENERATOR_VERSION_V4) };
     match era_bytes {
         Some(era) => generate_era_generator(seed_string, seed_bytes, base, era, &V3_ALLOWED, generator),
         None => {
@@ -2330,14 +2445,15 @@ mod tests {
         assert_eq!(v3.program_id(), program_id(GENERATOR_VERSION_V3, &v3.seed, v3.attempt));
         assert_ne!(v3.program_id(), program_id(GENERATOR_VERSION, &v3.seed, v3.attempt));
         assert_ne!(v3.program_id(), v2.program_id());
-        for c in [ProgramClass::V2, ProgramClass::V3, ProgramClass::V4, ProgramClass::V5] {
+        for c in [ProgramClass::V2, ProgramClass::V3, ProgramClass::V4, ProgramClass::V5, ProgramClass::V6] {
             assert_eq!(ProgramClass::parse(c.name()), Some(c));
             assert_eq!(ProgramClass::from_generator(c.generator_version()), Some(c));
             assert_eq!(ProgramClass::from_u8(c.as_u8()), Some(c));
         }
         assert_eq!(ProgramClass::from_generator(1), None);
-        assert_eq!(ProgramClass::from_generator(6), None);
-        assert_eq!(ProgramClass::parse("v6"), None);
+        assert_eq!(ProgramClass::from_generator(6), Some(ProgramClass::V6), "class v6 is generator 6 (review B's F03, 8 October 2026)");
+        assert_eq!(ProgramClass::from_generator(7), None);
+        assert_eq!(ProgramClass::parse("v7"), None);
         assert_eq!(ProgramClass::default(), ProgramClass::V2);
         assert_eq!(ProgramClass::V2.load_class(), LoadClass::V2);
         assert!(!ProgramClass::V2.has_era() && ProgramClass::V3.has_era() && ProgramClass::V4.has_era() && ProgramClass::V5.has_era());
diff --git a/igneum-pow/src/main.rs b/igneum-pow/src/main.rs
index 393b1eb81..205f6ce66 100644
--- a/igneum-pow/src/main.rs
+++ b/igneum-pow/src/main.rs
@@ -122,7 +122,8 @@ fn usage() -> ! {
          \x20 --era-widths 4[,16,32,64]  the width set the era draws from, in bytes (default 4: pinned; more lets the era draw it; 32 only with the w32 class)\n\
          \x20 --dataset-words N       research class ds55: the dataset at N words (a multiple of 65,536 in 2^28 ..= 2^31; 1476395008 = 5.5 GiB); a non-power-of-two uses idx = (src * N) >> 32 in every load (spec 01 section 1.13.3), a power of two is --dataset-log2\n\\
          \x20 --reg64                 the 64-register window per lane over the class (research; the same as --class <class>+reg64; CUDA, OpenCL and Metal texts)\n\
-         \x20 --reg64-chain           reg64 with the full-chain address mix: every load's address consumes all 64 registers (the same as --class <class>+reg64c)"
+         \x20 --reg64-chain           reg64 with the full-chain address mix: every load's address consumes all 64 registers (the same as --class <class>+reg64c)\n\
+         \x20 --reg64-prefix          export: the CUDA texts carry the reg64 chain in its closed prefix form (review B's F05; the same hash and vectors, a measurement text)"
     );
     std::process::exit(2)
 }
@@ -189,6 +190,7 @@ fn parse() -> Args {
                 a.reg64 = true;
                 a.reg64_chain = true;
             }
+            "--reg64-prefix" => igneum_pow::emit::set_reg64_prefix(true),
             _ => usage(),
         }
     }
@@ -229,10 +231,29 @@ fn main() {
                 // gate G2 (5 October 2026, ported from branch ca2-era for the class v4 gate run): `--count N` prints
                 // "nonce hash" for N consecutive 64-bit nonces from --nonce, one epoch build, to re-hash a worker's
                 // found lines (the same prehash, target ff..ff)
-                for k in 0..a.count {
-                    let n = a.nonce.wrapping_add(k);
-                    println!("{n} {:016x}", e.hash_bound(&prehash, n));
+                // one warp per 32 nonces (the P01 campaign, 8 October 2026: a million nonces per pack in minutes, not
+                // hours; the per-nonce form hashed the whole aligned group for every nonce)
+                let end = a.nonce.wrapping_add(a.count);
+                let mut n = a.nonce;
+                let mut out = String::with_capacity(1 << 16);
+                use std::io::Write;
+                let stdout = std::io::stdout();
+                let mut lock = stdout.lock();
+                while n != end {
+                    let base = n & !31;
+                    let warp = e.hash_warp_bound(&prehash, base);
+                    let mut m = n;
+                    while m != end && (m & !31) == base {
+                        out.push_str(&format!("{m} {:016x}\n", warp[(m & 31) as usize]));
+                        m = m.wrapping_add(1);
+                    }
+                    n = m;
+                    if out.len() > (1 << 15) {
+                        lock.write_all(out.as_bytes()).unwrap();
+                        out.clear();
+                    }
                 }
+                lock.write_all(out.as_bytes()).unwrap();
                 return;
             }
             let init = igneum_pow::bind::block_init_words(&prehash, a.nonce);
diff --git a/igneum-pow/src/packcheck.rs b/igneum-pow/src/packcheck.rs
index a7cbea7f5..b75e5a073 100644
--- a/igneum-pow/src/packcheck.rs
+++ b/igneum-pow/src/packcheck.rs
@@ -199,14 +199,14 @@ pub fn verify_pack_texts_chain(
     // carries IGNEUM_STATE_ROOT_HEX (and the shadow block of v4) and no other generator does.
     let state_root_hex = define_str(program_h, "IGNEUM_STATE_ROOT_HEX");
     match (class, state_root_hex.is_some()) {
-        (ProgramClass::V5, false) => return Err(PackFault::Disagree("IGNEUM_GENERATOR 5 (class v5) without IGNEUM_STATE_ROOT_HEX: not a class v5 pack".into())),
-        (ProgramClass::V5, true) => {}
+        (ProgramClass::V5 | ProgramClass::V6, false) => return Err(PackFault::Disagree("IGNEUM_GENERATOR 5 or 6 (a state class) without IGNEUM_STATE_ROOT_HEX: not a class v5 pack".into())),
+        (ProgramClass::V5 | ProgramClass::V6, true) => {}
         (_, true) => return Err(PackFault::Disagree(format!("IGNEUM_GENERATOR {generator} with class v5 state lines: a program over state leaves is generator 5 (export the pack as class v5)"))),
         _ => {}
     }
     match (class, shadow > 0) {
         (ProgramClass::V4, false) => return Err(PackFault::Disagree("IGNEUM_GENERATOR 4 (class v4) without IGNEUM_SHADOW_INSTRS: not a class v4 pack".into())),
-        (ProgramClass::V5, false) => return Err(PackFault::Disagree("IGNEUM_GENERATOR 5 (class v5) without IGNEUM_SHADOW_INSTRS: not a class v5 pack".into())),
+        (ProgramClass::V5 | ProgramClass::V6, false) => return Err(PackFault::Disagree("IGNEUM_GENERATOR 5 or 6 (a state class) without IGNEUM_SHADOW_INSTRS: not a class v5 pack".into())),
         // the class v4 stream sub-version (AP-F8-1 amendment, 7 October 2026): a generator 4 pack from before the
         // load-source rule carries no IGNEUM_PROGRAM_SUBVERSION and its program id is another stream's; refused
         (ProgramClass::V4, true) if define_u32(program_h, "IGNEUM_PROGRAM_SUBVERSION") != Some(u32::from(crate::generator::PROGRAM_SUBVERSION_V4)) => {
diff --git a/igneum-pow/src/verify.rs b/igneum-pow/src/verify.rs
index 75ea927b1..c0dc217b8 100644
--- a/igneum-pow/src/verify.rs
+++ b/igneum-pow/src/verify.rs
@@ -1172,3 +1172,91 @@ mod tests {
         assert!(!e.verify_block(0, w[0] - 1));
     }
 }
+
+
+/// Review B's F05 (8 October 2026): the reg64 full-chain address source in closed form. The reference fold
+/// (`m = r[k0]; m = rotl(m, 1) ^ r[k1]; ...` over the 63 registers other than `s`, in index order) equals
+/// `r[s] ^ ror(P_s, 1) ^ (S ^ P_s ^ a[s])` with `a[k] = rotl(r[k], (63 - k) mod 32)`, `S` the xor of every `a[k]`
+/// and `P_s` the xor of `a[k]` for `k < s`: a prefix-xor structure answers every load from one `S` and one prefix,
+/// which is the incremental form a chip would keep. The verifier keeps the fold as the definition; this form is the
+/// test's and the fleet's measurement's.
+pub fn reg64_address_source(r: &[u32; 64], s: usize) -> u32 {
+    let a = |k: usize| r[k].rotate_left(((63 - k) % 32) as u32);
+    let mut total = 0u32;
+    let mut prefix = 0u32;
+    for k in 0..64 {
+        total ^= a(k);
+        if k < s {
+            prefix ^= a(k);
+        }
+    }
+    r[s] ^ prefix.rotate_right(1) ^ (total ^ prefix ^ a(s))
+}
+
+/// The reference fold of [`reg64_address_source`] on one lane's registers, as `interpret_warp_core` computes it.
+pub fn reg64_address_source_reference(r: &[u32; 64], s: usize) -> u32 {
+    let mut m = 0u32;
+    let mut started = false;
+    for (k, &v) in r.iter().enumerate() {
+        if k == s {
+            continue;
+        }
+        m = if started { m.rotate_left(1) ^ v } else { v };
+        started = true;
+    }
+    r[s] ^ m
+}
+
+#[cfg(test)]
+mod reg64_mix_tests {
+    use super::*;
+
+    /// Review B's F05, known-failed first: a form with one rotation off (every term rotated as if it sat after the
+    /// source) disagrees with the reference on some source; the closed form agrees on every source register over
+    /// 256 register states drawn from a fixed stream and over the states a real program leaves in its registers.
+    #[test]
+    fn reg64_closed_form_equals_the_reference_fold_on_every_source() {
+        let wrong = |r: &[u32; 64], s: usize| -> u32 {
+            let a = |k: usize| r[k].rotate_left(((63 - k) % 32) as u32);
+            let total: u32 = (0..64).map(a).fold(0, |x, y| x ^ y);
+            r[s] ^ total ^ a(s)
+        };
+        let mut x = 0x9e37_79b9_7f4a_7c15u64;
+        let mut next = || {
+            x = x.wrapping_add(0x9e37_79b9_7f4a_7c15);
+            let mut z = x;
+            z = (z ^ (z >> 30)).wrapping_mul(0xbf58_476d_1ce4_e5b9);
+            z = (z ^ (z >> 27)).wrapping_mul(0x94d0_49bb_1331_11eb);
+            (z ^ (z >> 31)) as u32
+        };
+        let mut wrong_differs = false;
+        for _ in 0..256 {
+            let mut r = [0u32; 64];
+            for v in r.iter_mut() {
+                *v = next();
+            }
+            for s in 0..64 {
+                assert_eq!(reg64_address_source(&r, s), reg64_address_source_reference(&r, s), "source r{s}");
+                if wrong(&r, s) != reg64_address_source_reference(&r, s) {
+                    wrong_differs = true;
+                }
+            }
+        }
+        assert!(wrong_differs, "the known-failed form must disagree somewhere");
+        // the init rule's registers (r0..r7 seeded, r[k] = r[k & 7] * 0x9e3779b9 + k) and a few real updates
+        let mut r = [0u32; 64];
+        for (k, v) in r.iter_mut().enumerate().take(8) {
+            *v = next() ^ (k as u32);
+        }
+        for k in 8..64 {
+            r[k] = r[k & 7].wrapping_mul(0x9e37_79b9).wrapping_add(k as u32);
+        }
+        for step in 0..64 {
+            let d = (step * 7 + 3) % 64;
+            r[d] = r[d].wrapping_mul(r[(d + 13) % 64]).wrapping_add(next());
+            for s in 0..64 {
+                assert_eq!(reg64_address_source(&r, s), reg64_address_source_reference(&r, s), "step {step} source r{s}");
+            }
+        }
+    }
+}
diff --git a/igneum-pow/tests/ds55.rs b/igneum-pow/tests/ds55.rs
index 821cd76cf..4bff40706 100644
--- a/igneum-pow/tests/ds55.rs
+++ b/igneum-pow/tests/ds55.rs
@@ -68,8 +68,11 @@ fn power_of_two_path_is_byte_identical_to_the_pinned_pack() {
     assert!(!e.dataset.geom.mulshift);
     assert_eq!(e.dataset.geom, DatasetGeom::pow2(28));
     let out = export_pack(e, &day_label(), SOURCE);
-    assert_eq!(out.files.len(), 12, "the pack's twelve files");
+    assert_eq!(out.files.len(), 13, "the pack's thirteen files");
     for (name, text) in &out.files {
+        if name == "identity.json" {
+            continue; // A06's identity file is new beside the pinned twelve
+        }
         let want = pinned(name);
         assert!(text == &want, "mx8-devnet-epoch0/{name} differs from the default path's export");
     }
@@ -219,7 +222,7 @@ fn ds55_pack_fields_and_vectors() {
     assert_eq!(e.program.seed[0], 0x667d_0fbd);
     assert_eq!(e.program.seed[1], 0x7b8e_5963);
     let out = export_pack(e, &day_label(), SOURCE);
-    assert_eq!(out.files.len(), 12);
+    assert_eq!(out.files.len(), 13);
     let pj = &out.files.iter().find(|(n, _)| n == "program.json").unwrap().1;
     let j: Value = serde_json::from_str(pj).expect("program.json is valid JSON");
     assert_eq!(j["program_id"].as_str().unwrap(), "0x73bcbfe8ccf988f1");
diff --git a/igneum-pow/tests/fuzz_parsers.rs b/igneum-pow/tests/fuzz_parsers.rs
new file mode 100644
index 000000000..a52ac6ea3
--- /dev/null
+++ b/igneum-pow/tests/fuzz_parsers.rs
@@ -0,0 +1,132 @@
+//! POW-01 and POW-02's malformed-input half (the Test and Acceptance Standard, 8 October 2026): 10,000 mutated inputs
+//! per parser, every one refused cleanly or accepted, never a panic. The parsers: the class string (`LoadClass::parse`,
+//! `ProgramClass::parse`), the hex reader (`bind::unhex`), the IGSD1 state stream (`StateStream::decode`), the era
+//! string form (`"<n>:<64 hex>"`, the exporter's `parse_era` re-stated here since main.rs keeps it private). The
+//! mutations: byte flips, truncation, insertion, duplication and random bytes over a valid seed input, drawn from a
+//! fixed SplitMix64 so the run is reproducible; a panic in any parser fails the test (the harness catches none).
+use igneum_pow::bind::unhex;
+use igneum_pow::generator::{LoadClass, ProgramClass};
+use igneum_pow::state::StateStream;
+
+struct Rng(u64);
+impl Rng {
+    fn next(&mut self) -> u64 {
+        self.0 = self.0.wrapping_add(0x9e3779b97f4a7c15);
+        let mut z = self.0;
+        z = (z ^ (z >> 30)).wrapping_mul(0xbf58476d1ce4e5b9);
+        z = (z ^ (z >> 27)).wrapping_mul(0x94d049bb133111eb);
+        z ^ (z >> 31)
+    }
+    fn below(&mut self, n: usize) -> usize {
+        (self.next() % (n.max(1) as u64)) as usize
+    }
+}
+
+/// One mutation of `seed`: a flipped byte, a truncation, an insertion, a doubled slice, or random bytes of a random length.
+fn mutate(rng: &mut Rng, seed: &[u8]) -> Vec<u8> {
+    let mut v = seed.to_vec();
+    match rng.below(6) {
+        0 => {
+            if !v.is_empty() {
+                let i = rng.below(v.len());
+                v[i] ^= 1 << rng.below(8);
+            }
+        }
+        1 => {
+            let n = rng.below(v.len() + 1);
+            v.truncate(n);
+        }
+        2 => {
+            let i = rng.below(v.len() + 1);
+            v.insert(i, rng.next() as u8);
+        }
+        3 => {
+            if v.len() > 1 {
+                let a = rng.below(v.len());
+                let b = a + rng.below(v.len() - a);
+                let slice = v[a..b].to_vec();
+                v.splice(a..a, slice);
+            }
+        }
+        4 => {
+            let n = rng.below(300);
+            v = (0..n).map(|_| rng.next() as u8).collect();
+        }
+        _ => {
+            if !v.is_empty() {
+                let i = rng.below(v.len());
+                v[i] = rng.next() as u8;
+            }
+        }
+    }
+    v
+}
+
+const N: usize = 10_000;
+
+#[test]
+fn class_strings_never_panic() {
+    let seeds = ["mx8+sh256x27+state+reg64c+fold+rw", "mx8+sh256x27+state+nowin", "w32m8g-erad810f22d+sh256x27+state", "v2", "mix50-35-15", "scr4k32+hot64k4a", "mx4", "p4,p16,p64", "w64x4", "mx8+rw2"];
+    let mut rng = Rng(1);
+    let (mut some, mut none) = (0, 0);
+    for k in 0..N {
+        let s = mutate(&mut rng, seeds[k % seeds.len()].as_bytes());
+        let text = String::from_utf8_lossy(&s);
+        match LoadClass::parse(&text) {
+            Some(c) => {
+                // an accepted string names back to something the parser accepts again
+                assert!(LoadClass::parse(&c.name()).is_some(), "{text:?} -> {} does not re-parse", c.name());
+                some += 1;
+            }
+            None => none += 1,
+        }
+        let _ = ProgramClass::parse(&text);
+    }
+    println!("class strings: {some} accepted, {none} refused of {N}");
+    assert!(none > N / 2, "the mutations refuse at least half");
+}
+
+#[test]
+fn hex_and_era_strings_never_panic() {
+    let hex = "edc4fa844da9dc98d37e965176f6558a31560e40502ab3ae5491b21aaaabfb07";
+    let mut rng = Rng(2);
+    let mut refused = 0;
+    for _ in 0..N {
+        let s = mutate(&mut rng, hex.as_bytes());
+        let text = String::from_utf8_lossy(&s);
+        if unhex(&text).is_none() {
+            refused += 1;
+        }
+        // the era string "<n>:<64 hex>" as the exporter reads it
+        let era = format!("{}:{}", rng.below(1000), text);
+        let parsed = era.split_once(':').and_then(|(n, h)| n.parse::<u64>().ok().zip(unhex(h))).filter(|(_, b)| b.len() == 32);
+        if let Some((_, b)) = parsed {
+            assert_eq!(b.len(), 32);
+        }
+    }
+    println!("hex strings: {refused} refused of {N}");
+    assert!(refused > 0);
+}
+
+#[test]
+fn state_streams_never_panic() {
+    // a small valid stream: three records under a fixed root and block
+    let stream = StateStream { number: 159357, block: [7u8; 32], root: [9u8; 32], records: vec![vec![1, 2, 3], vec![], (0..200u8).collect()] };
+    let valid = stream.encode();
+    assert_eq!(StateStream::decode(&valid).map(|s| s.records.len()), Ok(3));
+    let mut rng = Rng(3);
+    let (mut ok, mut err) = (0, 0);
+    for _ in 0..N {
+        let bytes = mutate(&mut rng, &valid);
+        match StateStream::decode(&bytes) {
+            Ok(s) => {
+                // an accepted stream re-encodes to the bytes it was read from
+                assert_eq!(s.encode(), bytes, "an accepted stream must round-trip");
+                ok += 1;
+            }
+            Err(_) => err += 1,
+        }
+    }
+    println!("state streams: {ok} accepted, {err} refused of {N}");
+    assert!(err > N / 2);
+}
diff --git a/igneum-pow/tests/mixer.rs b/igneum-pow/tests/mixer.rs
index f4644ae8d..43ddeeb41 100644
--- a/igneum-pow/tests/mixer.rs
+++ b/igneum-pow/tests/mixer.rs
@@ -347,8 +347,8 @@ fn determinism_v3() {
     };
     println!("determinism {}: two builds equal, against the pinned pack {}", class.name(), dir.display());
     for (name, text) in &pa.files {
-        if name == "vectors.json" || name == "vectors.h" {
-            continue; // the source string differs ("a" here)
+        if name == "vectors.json" || name == "vectors.h" || name == "identity.json" {
+            continue; // the source string differs ("a" here); identity.json is new beside the pinned twelve (A06)
         }
         let on_disk = std::fs::read_to_string(dir.join(name)).unwrap();
         assert_eq!(&on_disk, text, "{name}");
diff --git a/igneum-pow/tests/packs.rs b/igneum-pow/tests/packs.rs
index 9b3aecf48..cd872c6a5 100644
--- a/igneum-pow/tests/packs.rs
+++ b/igneum-pow/tests/packs.rs
@@ -433,7 +433,9 @@ fn check_export(pack: &str) {
     if e.dataset.mode() == DatasetMode::MemoryHard {
         expected.extend(["memhard.h", "memhard.metal"]);
     }
-    assert_eq!(out.files.iter().map(|(n, _)| n.as_str()).collect::<Vec<_>>(), expected);
+    let mut with_identity: Vec<&str> = expected.clone();
+    with_identity.insert(1, "identity.json");
+    assert_eq!(out.files.iter().map(|(n, _)| n.as_str()).collect::<Vec<_>>(), with_identity);
     let mut on_disk: Vec<String> = std::fs::read_dir(pack_dir(pack))
         .unwrap()
         .map(|d| d.unwrap().file_name().to_string_lossy().to_string())
@@ -646,6 +648,9 @@ fn era_emitted_sources_match_and_loads_have_the_era_form() {
         let source = era_json(pack, "vectors.json")["source"].as_str().unwrap().to_string();
         let out = export_pack(e, &day, &source);
         for (name, text) in &out.files {
+            if name == "identity.json" {
+                continue; // A06's identity file is new beside the pinned files
+            }
             let want = era_read(pack, name);
             assert!(text == &want, "{pack}/{name} differs from the emitter");
         }
@@ -655,7 +660,7 @@ fn era_emitted_sources_match_and_loads_have_the_era_form() {
             .filter(|n| !n.starts_with('.') && n != "seeds.txt")
             .collect();
         on_disk.sort();
-        let mut want: Vec<String> = out.files.iter().map(|(n, _)| n.clone()).collect();
+        let mut want: Vec<String> = out.files.iter().map(|(n, _)| n.clone()).filter(|n| n != "identity.json").collect();
         want.sort();
         assert_eq!(on_disk, want, "{pack}: the pack holds the export's files and seeds.txt only");
         let era = e.program.class.era.unwrap();
@@ -869,7 +874,7 @@ fn hot_packs_emitted_sources_and_load_forms() {
         let file = |name: &str| -> &str { &out.files.iter().find(|(n, _)| n == name).unwrap().1 };
         hassert_same_text(pack, "vectors.json", file("vectors.json"));
         hassert_same_text(pack, "vectors.h", file("vectors.h"));
-        assert_eq!(out.files.len(), 12);
+        assert_eq!(out.files.len(), 13);
         // One form per dialect, exactly 16 - k masked dataset loads and k hot loads in every hash kernel; the fill
         // kernel is present once per source that builds the table.
         for (file, load, masked, hot) in [
@@ -974,6 +979,9 @@ fn v5_pack_is_the_v4_program_over_the_state_leaves() {
         let v = v5_json(pack, "vectors.json");
         let out = export_pack(e, v["day"].as_str().unwrap(), v["source"].as_str().unwrap());
         for (name, text) in &out.files {
+            if name == "identity.json" {
+                continue; // A06's identity file is new beside the pinned files
+            }
             assert_eq!(v5_read(pack, name), *text, "{pack}/{name} differs from the export");
         }
         for (name, bytes) in &out.binaries {
@@ -1032,8 +1040,11 @@ fn reg64_plain_path_reexports_the_pinned_devnet_pack_unchanged() {
     assert_eq!(e.program.registers(), 8);
     assert_eq!(e.program.scheduled(), e.program.instrs, "without the flag the schedule is the drawn program");
     let out = export_pack(e, &day_label(pack), PINNED_SOURCE);
-    assert_eq!(out.files.len(), 12);
+    assert_eq!(out.files.len(), 13);
     for (name, text) in &out.files {
+        if name == "identity.json" {
+            continue; // A06's identity file is new beside the pinned twelve
+        }
         assert_same_text(pack, name, text);
     }
 }
@@ -1222,4 +1233,64 @@ fn reg64_liveness_rule_refuses_the_subset_fold_and_passes_the_full_chain() {
     let mut chain = epoch_reg64_of_devnet();
     chain.program.class = chain.program.class.with_reg64_chain();
     assert_eq!(check_window_liveness(&chain.program), Ok(()), "the full chain keeps all 64 registers live across the chain");
+    // wired into the acceptance (8 October 2026): `accept::check` refuses the arithmetic-only window as a dead register
+    // and never refuses the chain program for liveness; the plain pack's verdict does not move
+    use igneum_pow::accept::check;
+    assert!(matches!(check(&window.program), Err(Reject::DeadWindowRegister { .. })), "the acceptance refuses the arithmetic-only window");
+    assert!(!matches!(check(&chain.program), Err(Reject::DeadWindowRegister { .. }) | Err(Reject::NotAWindow)), "the chain program is never refused for liveness");
+    assert!(check(&plain.program).is_ok(), "the pinned devnet program's verdict does not move");
+}
+
+/// The external review's A07 (8 October 2026): the bound hash of a nonce is the lane of the aligned 32-nonce group that
+/// contains it, in the verifier by construction (`Epoch::hash_bound`), across the group's tail and the low-32 rollover;
+/// the high 32 bits of the nonce enter the init words, so two nonces 2^32 apart never share a hash. The launchers
+/// refuse a job whose nonce_start is not 32-aligned or whose count is not a multiple of 32 (worker.cpp's job line).
+#[test]
+fn a07_bound_hash_is_group_aligned_across_tails_and_rollover() {
+    use igneum_pow::bind::block_init_words;
+    let e = epoch("mx8-devnet-epoch0");
+    let prehash = [0x5au8; 32];
+    for &n in &[0u64, 1, 2, 31, 32, 33, 63, (1u64 << 32) - 1, 1u64 << 32, (1u64 << 32) + 1, u64::MAX - 1, u64::MAX] {
+        let base = n & !31;
+        let warp = e.hash_warp_bound(&prehash, base);
+        assert_eq!(e.hash_bound(&prehash, n), warp[(n & 31) as usize], "nonce {n}: the lane of its aligned group");
+        assert_eq!(e.hash_warp_bound(&prehash, n), warp, "nonce {n}: the group is the same from any of its nonces");
+        let distinct: std::collections::HashSet<u64> = warp.iter().copied().collect();
+        assert!(distinct.len() >= 31, "nonce {n}: the lanes of a group are distinct hashes");
+    }
+    assert_ne!(e.hash_bound(&prehash, 2), e.hash_bound(&prehash, 2 + (1u64 << 32)), "the high 32 bits reach the hash");
+    assert_ne!(block_init_words(&prehash, 2), block_init_words(&prehash, 2 + (1u64 << 32)));
+}
+
+/// The external review's A04 (8 October 2026): the acceptance executes the shadow block as the hash does (class v4
+/// sub-version 3), so a shadow that zeroes the registers fails acceptance; the pinned program with its own shadow passes.
+#[test]
+fn a04_a_zeroing_shadow_fails_acceptance() {
+    use igneum_pow::accept::check;
+    // a class v4 program (the shadow block is class v4's): the same seed and era as the lib's program_classes test
+    let era = [7u8; 32];
+    let p = generate_from_seed_bytes_program_class("igneum-genesis", b"igneum-genesis", ProgramClass::V4, Some(&era));
+    assert!(check(&p).is_ok(), "the class v4 program of the genesis seed passes");
+    let mut z = p.clone();
+    assert!(!z.shadow.is_empty(), "class v4 has a shadow block");
+    for ins in z.shadow.iter_mut() {
+        ins.op = Op::Xor;
+        ins.src = ins.dst;
+    }
+    assert!(check(&z).is_err(), "a shadow of xor d, d zeroes every register it touches and must fail");
+}
+
+/// The external review's A06 (8 October 2026): the pack's identity.json authenticates every kernel text by BLAKE2b-256.
+#[test]
+fn a06_program_json_hashes_every_kernel_text() {
+    let e = epoch("mx8-devnet-epoch0");
+    let out = export_pack(&e, &day_label("mx8-devnet-epoch0"), "test");
+    let file = |n: &str| out.files.iter().find(|(f, _)| f == n).map(|(_, t)| t.clone()).unwrap();
+    let j: Value = serde_json::from_str(&file("identity.json")).unwrap();
+    let h = j["kernel_blake2b256"].as_object().expect("kernel_blake2b256");
+    assert_eq!(j["program_id"].as_str().unwrap(), format!("{:#018x}", e.program.program_id()));
+    for n in ["kernel.cu", "kernel.cl", "program.metal", "program_bound.metal", "kernel_bound.cu", "kernel_bound.cl"] {
+        let want: String = igneum_pow::blake2b::blake2b_256(&[file(n).as_bytes()]).iter().map(|x| format!("{x:02x}")).collect();
+        assert_eq!(h[n].as_str().unwrap(), want, "{n}");
+    }
 }
diff --git a/igneum-pow/tests/v6fold.rs b/igneum-pow/tests/v6fold.rs
index 956ae5b86..c66c73d65 100644
--- a/igneum-pow/tests/v6fold.rs
+++ b/igneum-pow/tests/v6fold.rs
@@ -8,7 +8,7 @@ use igneum_pow::accept::{index_bit_sigma, index_bit_sigma_max, ACCEPT_UNITS_DIST
 use igneum_pow::emit::export_pack;
 use igneum_pow::generator::{
     candidate_class, generate_era_generator, LoadClass, Op, Program, ProgramClass, EraParams, INSTR_COUNT, NONLOAD_WEIGHTS,
-    NONLOAD_WEIGHTS_RW, NONLOAD_WEIGHTS_RW2, NONLOAD_WEIGHTS_RW2_SUM, NONLOAD_WEIGHTS_RW_SUM, V3_ALLOWED, V4_CLASS, V5_CLASS,
+    NONLOAD_WEIGHTS_RW, NONLOAD_WEIGHTS_RW2, NONLOAD_WEIGHTS_RW2_SUM, NONLOAD_WEIGHTS_RW_SUM, V3_ALLOWED, V3_CLASS, V4_CLASS, V5_CLASS,
 };
 use igneum_pow::seed::seed_words_from_bytes;
 use igneum_pow::verify::{load_index, stride, DatasetGeom, Epoch, INDEX_FOLD_SHIFT};
@@ -182,6 +182,123 @@ fn class_v6_all_flags_parse_name_and_id() {
     assert!(p.class.era.unwrap().fold);
 }
 
+/// 1c. D2 "layer 8 off" (8 October 2026): "+nowin" parses in any order and names back inside "+fold"/"+rw"; the draw
+/// keeps every instruction of the class without the flag and sets every load site's window to the whole dataset;
+/// the id moves; the era and the stride do not.
+#[test]
+fn nowin_removes_the_window_layer_and_nothing_else() {
+    let c = LoadClass::parse("mx8+sh256x27+state+nowin+fold+rw").unwrap();
+    assert!(c.nowin && c.fold && c.rw == 1 && c.state);
+    assert_eq!(c.name(), "mx8+sh256x27+state+nowin+fold+rw");
+    assert_eq!(LoadClass::parse("mx8+sh256x27+state+fold+rw+nowin"), Some(c));
+    assert_eq!(LoadClass::parse("mx8+sh256x27+state+reg64c+nowin").unwrap().name(), "mx8+sh256x27+state+reg64c+nowin");
+    assert!(!V5_CLASS.nowin);
+    let era = f8_bytes("era", 4);
+    let seed = f8_bytes("program", 4);
+    // both sides of the pair draw under the v6 rules (the five shuffle slots and the mad operand rule enter the
+    // stream for every class with a v6 flag), so the pair is the fold class with and without layer 8 off
+    let plain = candidate_class("p4-attack-f8", &seed, 0, LoadClass::era(V5_CLASS.with_fold(), &era, &V3_ALLOWED));
+    let off = candidate_class("p4-attack-f8", &seed, 0, LoadClass::era(V5_CLASS.with_fold().with_nowin(), &era, &V3_ALLOWED));
+    assert_ne!(plain.program_id(), off.program_id(), "the id carries the flag");
+    assert_eq!(plain.instrs.len(), off.instrs.len());
+    let mut windows_plain = 0;
+    for (a, b) in plain.instrs.iter().zip(off.instrs.iter()) {
+        assert_eq!((a.op, a.dst, a.src, a.src2, a.imm, a.imm2, a.rot, a.bit, a.mask, a.width), (b.op, b.dst, b.src, b.src2, b.imm, b.imm2, b.rot, b.bit, b.mask, b.width), "the instruction is the class's without the flag");
+        assert_eq!((b.win, b.off), (0, 0), "every site reads the whole dataset");
+        if a.win != 0 {
+            windows_plain += 1;
+        }
+    }
+    assert!(windows_plain > 0, "the plain draw has at least one shrunk window on this seed");
+    assert_eq!(plain.shadow, off.shadow);
+    assert_eq!(plain.class.era.map(|e| EraParams { fold: e.fold, ..e }), off.class.era.map(|e| EraParams { fold: e.fold, ..e }), "the era draw is untouched");
+}
+
+/// The external review's A02 and A08 (8 October 2026), fixed by construction for every class carrying a v6 flag:
+/// every candidate of 64 seeds (attempt 0, no acceptance pass) carries shuffles over all five lane dimensions, and no
+/// `mad` names its destination as its second source; the plain class v5 draw is untouched (the pinned pack test
+/// reads that); the v6 draw's id carries the rule.
+#[test]
+fn v6_draw_connects_all_lanes_and_keeps_mad_bijective_by_construction() {
+    let era = f8_bytes("era", 4);
+    let classes = [V5_CLASS.with_fold(), V5_CLASS.with_rw(1), V5_CLASS.with_nowin(), LoadClass::parse("mx8+sh256x27+state+reg64c+fold+rw").unwrap()];
+    for c in classes {
+        assert!(c.is_v6());
+        for k in 0..64u32 {
+            let seed = f8_bytes("program", k);
+            let p = candidate_class("p-a02", &seed, 0, LoadClass::era(c, &era, &V3_ALLOWED));
+            let mut dims = [false; 5];
+            for ins in &p.instrs {
+                if ins.op == Op::Shfl {
+                    dims[ins.mask.trailing_zeros() as usize] = true;
+                }
+                if ins.op == Op::Mad {
+                    assert_ne!(ins.src2, ins.dst, "seed {k} class {}: a mad with src2 == dst", c.name());
+                }
+            }
+            assert!(dims.iter().all(|&d| d), "seed {k} class {}: shuffle dimensions {:?}", c.name(), dims);
+            assert_eq!(p.instrs.len(), 64);
+            assert_eq!(p.instrs.iter().filter(|i| i.op.is_load()).count(), 16, "the load slots are the class's");
+        }
+    }
+    assert!(!V5_CLASS.is_v6() && !V3_CLASS.is_v6());
+    // a plain class v5 candidate of the same seed can lack a dimension: the rule is the v6 construction's, not a filter
+    let seed = f8_bytes("program", 4);
+    let a = candidate_class("p-a02", &seed, 0, LoadClass::era(V5_CLASS, &era, &V3_ALLOWED));
+    let b = candidate_class("p-a02", &seed, 0, LoadClass::era(V5_CLASS.with_fold(), &era, &V3_ALLOWED));
+    assert_ne!(a.program_id(), b.program_id());
+}
+
+/// Lane D's finding (8 October 2026): every class v6 flag is set aside by the acceptance's class v4 shape predicate,
+/// so a +nowin, +reg64 or +reg64c program is judged by the full rule (the fresh-source rule, the saturated-source
+/// check, the index floors and the attempt cap with the last resort), not by the class v2 parts; the draw's source
+/// rule reads the same shape.
+#[test]
+fn every_v6_flag_keeps_the_class_v4_acceptance_shape() {
+    use igneum_pow::accept::is_class_v4_shape;
+    use igneum_pow::generator::max_attempts_for;
+    let all = LoadClass::parse("mx8+sh256x27+state+reg64c+nowin+fold+rw").unwrap();
+    for c in [V5_CLASS, V5_CLASS.with_nowin(), V5_CLASS.with_reg64(), V5_CLASS.with_reg64().with_reg64_chain(), V5_CLASS.with_fold(), all] {
+        assert!(is_class_v4_shape(&c), "{}", c.name());
+        assert!(is_class_v4_shape(&LoadClass::era(c, &f8_bytes("era", 4), &V3_ALLOWED)), "{} under an era", c.name());
+        assert_eq!(max_attempts_for(&c), max_attempts_for(&V5_CLASS), "{}: the same attempt cap and last resort", c.name());
+    }
+    assert!(!is_class_v4_shape(&V3_CLASS) && !is_class_v4_shape(&LoadClass::V2));
+    // lane D's second finding: an era drawn from a width set with more than one width writes the drawn width into
+    // `mix`; the shape (and so the full rule) must hold at every width of the family
+    let wide = LoadClass::era(V5_CLASS, &f8_bytes("era", 4), &[1u8, 4, 16]);
+    assert!(wide.era.is_some());
+    assert!(is_class_v4_shape(&wide), "{} (mix {:?})", wide.name(), wide.mix);
+    assert!(is_class_v4_shape(&LoadClass::era(all, &f8_bytes("era", 9), &[1u8, 4, 16])));
+}
+
+/// Review B's F03 (8 October 2026): class v6 is a program class of its own, generator 6: the object class names it,
+/// every class carrying a v6 flag draws as generator 6 under an era, the pack's program_class reads "v6", and the
+/// class v5 draw and its generator number do not move.
+#[test]
+fn program_class_v6_is_generator_6() {
+    use igneum_pow::generator::{era_generator_of, GENERATOR_VERSION_V5, GENERATOR_VERSION_V6, V6_CLASS};
+    assert_eq!(ProgramClass::parse("v6"), Some(ProgramClass::V6));
+    assert_eq!(ProgramClass::V6.name(), "v6");
+    assert_eq!(ProgramClass::V6.generator_version(), GENERATOR_VERSION_V6);
+    assert_eq!(ProgramClass::from_generator(6), Some(ProgramClass::V6));
+    assert!(ProgramClass::V6.has_state());
+    assert_eq!(ProgramClass::V6.load_class(), V6_CLASS);
+    assert_eq!(V6_CLASS.name(), "mx8+sh256x27+state+reg64c+fold+rw");
+    assert_eq!(ProgramClass::of_load_class(&V6_CLASS), Some(ProgramClass::V6));
+    assert_eq!(ProgramClass::of_load_class(&V6_CLASS.with_nowin()), Some(ProgramClass::V6));
+    assert_eq!(ProgramClass::of_load_class(&V5_CLASS), Some(ProgramClass::V5));
+    let era = f8_bytes("era", 4);
+    for c in [V6_CLASS, V6_CLASS.with_nowin(), V5_CLASS.with_fold(), V5_CLASS.with_rw(1), V5_CLASS.with_nowin()] {
+        assert_eq!(era_generator_of(&LoadClass::era(c, &era, &V3_ALLOWED)), GENERATOR_VERSION_V6, "{}", c.name());
+    }
+    assert_eq!(era_generator_of(&LoadClass::era(V5_CLASS, &era, &V3_ALLOWED)), GENERATOR_VERSION_V5);
+    let seed = f8_bytes("program", 4);
+    let p = candidate_class("p-f03", &seed, 0, LoadClass::era(V6_CLASS, &era, &V3_ALLOWED));
+    assert!(p.class.name().starts_with("mx8-era") && p.class.name().ends_with("+sh256x27+state+reg64c+fold+rw"), "{}", p.class.name());
+    // candidate_class draws without stamping the generator; the era path stamps 6 (era_generator_of above)
+}
+
 /// 2. The fold's form: `y = x * M; y ^= y >> 16; y = rotl(y, R)`, and nothing else moves. The plain era's stride is
 /// `rotl(x * M, R)` byte for byte.
 #[test]
@@ -201,14 +318,18 @@ fn fold_form_and_the_plain_stride_unchanged() {
     assert!(differ > 9_000, "the fold moved {differ} of 10,000 addresses");
     // the program of a fold class is the program of the plain class: the same instructions when the same attempt
     // is accepted (the fold does not enter the draw; the indices it moves can move (c'') and (c''') verdicts)
-    let p = f8_program(4, ProgramClass::V4, false);
-    let f = f8_program(4, ProgramClass::V4, true);
-    if p.attempt == f.attempt {
-        assert_eq!(p.instrs, f.instrs);
-        assert_eq!(p.shadow, f.shadow);
-    }
-    assert_eq!(f.class.name(), format!("{}+fold", p.class.name()));
+    // since the review's draw rules (8 October 2026) a fold class draws under the v6 rules, so the pair is the v6
+    // re-weight class with and without the fold: the same instructions, the fold moving the addresses alone
+    let era = f8_bytes("era", 4);
+    let seed = f8_bytes("program", 4);
+    let p = candidate_class("p4-attack-f8", &seed, 0, LoadClass::era(V5_CLASS.with_rw(1), &era, &V3_ALLOWED));
+    let f = candidate_class("p4-attack-f8", &seed, 0, LoadClass::era(V5_CLASS.with_rw(1).with_fold(), &era, &V3_ALLOWED));
+    assert_eq!(p.instrs, f.instrs);
+    assert_eq!(p.shadow, f.shadow);
     assert_ne!(p.program_id(), f.program_id());
+    // the name orders the fold inside the re-weight suffix ("...+state+fold+rw"); both spellings parse to the class
+    assert!(f.class.name().ends_with("+sh256x27+state+fold+rw"), "{}", f.class.name());
+    assert_eq!(LoadClass::parse("mx8+sh256x27+state+rw+fold"), Some(V5_CLASS.with_rw(1).with_fold()));
     // and load_index reads the fold through the era
     let ins = p.instrs.iter().find(|i| i.op == Op::Load).unwrap();
     let (pe, fe) = (p.class.era.unwrap(), f.class.era.unwrap());
@@ -285,8 +406,11 @@ fn plain_class_draw_is_byte_identical_to_the_pinned_pack() {
     let e = Epoch { program, dataset };
     assert_eq!(e.program.program_id(), PINNED_ID);
     let out = export_pack(&e, &format!("bytes:{DAY_HEX}"), SOURCE);
-    assert_eq!(out.files.len(), 12, "the pack's twelve files");
+    assert_eq!(out.files.len(), 13, "the pack's thirteen files");
     for (name, text) in &out.files {
+        if name == "identity.json" {
+            continue; // A06's identity file is new beside the pinned twelve
+        }
         let want = pinned(name);
         assert!(text == &want, "mx8-devnet-epoch0/{name} differs from the default path's export");
     }
diff --git a/proto-cuda/nvrtc/packfile-fuzz.c b/proto-cuda/nvrtc/packfile-fuzz.c
new file mode 100644
index 000000000..9cafb5519
--- /dev/null
+++ b/proto-cuda/nvrtc/packfile-fuzz.c
@@ -0,0 +1,57 @@
+/* packfile-fuzz.c: POW-01's malformed-input half for the pack reader (8 October 2026). Copies a pack directory, mutates
+ * one of its files N times (a flipped byte, a truncation, an inserted byte, a doubled slice, random bytes) and calls
+ * pf_load on the copy each time; the run passes when every call returns 0 (refused with a message) or 1 (accepted),
+ * and the process never crashes. One line per 1,000 rounds, a RESULT line at the end.
+ *   cc -O2 -o packfile-fuzz packfile-fuzz.c && ./packfile-fuzz <pack dir> <rounds> <scratch dir>
+ */
+#include "packfile.h"
+#include <sys/stat.h>
+
+static uint64_t rs = 0x1234567;
+static uint64_t rnext(void) { rs += 0x9e3779b97f4a7c15ull; uint64_t z = rs; z = (z ^ (z >> 30)) * 0xbf58476d1ce4e5b9ull; z = (z ^ (z >> 27)) * 0x94d049bb133111ebull; return z ^ (z >> 31); }
+static size_t below(size_t n) { return n ? (size_t)(rnext() % n) : 0; }
+
+static int copy_file(const char* from, const char* to) {
+    size_t n = 0; char* b = pf_read_file(from, &n); if (!b) { remove(to); return 0; }
+    FILE* f = fopen(to, "wb"); if (!f) { free(b); return 0; }
+    fwrite(b, 1, n, f); fclose(f); free(b); return 1;
+}
+
+static void write_mutated(const char* src, const char* dst) {
+    size_t n = 0; char* b = pf_read_file(src, &n);
+    if (!b) { remove(dst); return; }   /* a pack without this file: the mutation is its absence */
+    size_t cap = n + 400; char* v = (char*)malloc(cap ? cap : 1); size_t len = n; if (n) memcpy(v, b, n);
+    switch (below(6)) {
+        case 0: if (len) v[below(len)] ^= (char)(1 << below(8)); break;
+        case 1: len = below(len + 1); break;
+        case 2: { size_t i = below(len + 1); memmove(v + i + 1, v + i, len - i); v[i] = (char)rnext(); len++; } break;
+        case 3: if (len > 1) { size_t a = below(len), bl = below(len - a); if (bl > 300) bl = 300; memmove(v + a + bl, v + a, len - a); memcpy(v + a, b + a, bl); len += bl; } break;
+        case 4: len = below(300); for (size_t i = 0; i < len; i++) v[i] = (char)rnext(); break;
+        default: if (len) v[below(len)] = (char)rnext(); break;
+    }
+    FILE* f = fopen(dst, "wb"); if (f) { fwrite(v, 1, len, f); fclose(f); }
+    free(v); free(b);
+}
+
+int main(int argc, char** argv) {
+    if (argc < 4) { fprintf(stderr, "usage: packfile-fuzz <pack dir> <rounds> <scratch dir>\n"); return 2; }
+    const char* pack = argv[1]; long rounds = atol(argv[2]); const char* scratch = argv[3];
+    const char* files[] = { "program.h", "vectors.h", "seeds.txt", "memhard.h" };
+    mkdir(scratch, 0755);
+    char from[1024], to[1024];
+    for (int i = 0; i < 4; i++) { snprintf(from, sizeof from, "%s/%s", pack, files[i]); snprintf(to, sizeof to, "%s/%s", scratch, files[i]); copy_file(from, to); }
+    PfPack pk; char err[512];
+    int base = pf_load(pack, &pk, err, sizeof err);
+    printf("base pack %s: %s%s\n", pack, base ? "accepted" : "refused: ", base ? "" : err);
+    long accepted = 0, refused = 0;
+    for (long r = 0; r < rounds; r++) {
+        int which = (int)below(4);
+        for (int i = 0; i < 4; i++) { snprintf(from, sizeof from, "%s/%s", pack, files[i]); snprintf(to, sizeof to, "%s/%s", scratch, files[i]); if (i == which) write_mutated(from, to); else copy_file(from, to); }
+        memset(&pk, 0, sizeof pk); err[0] = 0;
+        int ok = pf_load(scratch, &pk, err, sizeof err);
+        if (ok) accepted++; else refused++;
+        if ((r + 1) % 1000 == 0) printf("round %ld: accepted %ld refused %ld\n", r + 1, accepted, refused);
+    }
+    printf("RESULT packfile-fuzz pack=%s rounds=%ld accepted=%ld refused=%ld crashes=0 verdict=PASS\n", pack, rounds, accepted, refused);
+    return 0;
+}
diff --git a/proto-cuda/nvrtc/packfile.h b/proto-cuda/nvrtc/packfile.h
index f99ddd87d..edf156948 100644
--- a/proto-cuda/nvrtc/packfile.h
+++ b/proto-cuda/nvrtc/packfile.h
@@ -333,11 +333,13 @@ static int pf_load(const char* dir, PfPack* pk, char* err, size_t cap) {
      * kernel text, so this loader needs nothing new beyond the number and the class token), generator 5 is class v5
      * (proof of stored state, 7 October 2026: class v4 over a dataset keyed by the window's state leaves, leaves.bin,
      * which the host uploads for igneum_build; the kernel text carries the leaf read). */
-    if (pk->generator != 2 && pk->generator != 3 && pk->generator != 4 && pk->generator != 5) {
-        char m[200]; snprintf(m, sizeof(m), "program pack generator %u is not a generator version this worker runs (2, 3, 4 or 5)", (unsigned)pk->generator);
+    if (pk->generator != 2 && pk->generator != 3 && pk->generator != 4 && pk->generator != 5 && pk->generator != 6) {
+        char m[200]; snprintf(m, sizeof(m), "program pack generator %u is not a generator version this worker runs (2, 3, 4, 5 or 6)", (unsigned)pk->generator);
         free(prog); return pf_fail(err, cap, m);
     }
-    strcpy(pk->programClass, pk->generator == 5 ? "v5" : pk->generator == 4 ? "v4" : pk->generator == 3 ? "v3" : "v2");
+    /* generator 6 (class v6, the Igneum 2.0 D1 object, 8 October 2026): class v5's stored-state dataset with the v6 rules in the kernel text;
+     * the worker runs it as it runs class v5 (the shadow block, the state leaves), the pack's texts carry the rest */
+    strcpy(pk->programClass, pk->generator == 6 ? "v6" : pk->generator == 5 ? "v5" : pk->generator == 4 ? "v4" : pk->generator == 3 ? "v3" : "v2");
     {
         /* Counter ASIC 3.0 (6 October 2026): the shadow block marks class v4. A generator 3 pack with IGNEUM_SHADOW_INSTRS
          * is a v4 program stamped as v3 (the old export path; it carried the v3 control's program id) and is refused;
@@ -345,7 +347,7 @@ static int pf_load(const char* dir, PfPack* pk, char* err, size_t cap) {
         uint32_t shadow = 0;
         if (!pf_define_u32(prog, "IGNEUM_SHADOW_INSTRS", &shadow)) shadow = 0;
         if (pk->generator == 4 && shadow == 0) { free(prog); return pf_fail(err, cap, "program pack generator 4 (class v4) without IGNEUM_SHADOW_INSTRS: not a class v4 pack"); }
-        if (pk->generator == 5 && shadow == 0) { free(prog); return pf_fail(err, cap, "program pack generator 5 (class v5) without IGNEUM_SHADOW_INSTRS: not a class v5 pack (class v5 is class v4 over the state leaves)"); }
+        if ((pk->generator == 5 || pk->generator == 6) && shadow == 0) { free(prog); return pf_fail(err, cap, "program pack generator 5 (class v5) without IGNEUM_SHADOW_INSTRS: not a class v5 pack (class v5 is class v4 over the state leaves)"); }
         if (pk->generator == 3 && shadow != 0) {   /* a generator 2 pack with a shadow is the measurement ladder (a class-bearing id) and loads */
             char m[220]; snprintf(m, sizeof(m), "program pack generator %u with a shadow block (IGNEUM_SHADOW_INSTRS %u): a class v4 program is generator 4 (export the pack as class v4)", (unsigned)pk->generator, (unsigned)shadow);
             free(prog); return pf_fail(err, cap, m);
@@ -365,8 +367,8 @@ static int pf_load(const char* dir, PfPack* pk, char* err, size_t cap) {
     pk->stateLeaves = 0; pk->stateLeavesFnv = 0; pk->stateRootHex[0] = 0; pk->stateBlockHex[0] = 0;
     strcpy(pk->stateLeavesFile, "leaves.bin");
     if (!pf_define_u32(prog, "IGNEUM_STATE_LEAVES", &pk->stateLeaves)) pk->stateLeaves = 0;
-    if (pk->generator == 5 && pk->stateLeaves == 0) { free(prog); return pf_fail(err, cap, "program pack generator 5 (class v5) without IGNEUM_STATE_LEAVES: no state leaves to key the dataset (export the pack with --state)"); }
-    if (pk->generator != 5 && pk->stateLeaves != 0) {
+    if ((pk->generator == 5 || pk->generator == 6) && pk->stateLeaves == 0) { free(prog); return pf_fail(err, cap, "program pack generator 5 (class v5) without IGNEUM_STATE_LEAVES: no state leaves to key the dataset (export the pack with --state)"); }
+    if (pk->generator != 5 && pk->generator != 6 && pk->stateLeaves != 0) {
         char m[200]; snprintf(m, sizeof(m), "program pack generator %u carries IGNEUM_STATE_LEAVES %u: state leaves belong to class v5 (generator 5)", (unsigned)pk->generator, (unsigned)pk->stateLeaves);
         free(prog); return pf_fail(err, cap, m);
     }
diff --git a/proto-metal/main.swift b/proto-metal/main.swift
index 6c7e48823..87cda6f40 100644
--- a/proto-metal/main.swift
+++ b/proto-metal/main.swift
@@ -2992,9 +2992,10 @@ final class ServeDataset {
 /// Counter ASIC 2.0 and 3.0: the classes this worker runs from a prepared pack only (never from the Swift version 2
 /// generator): class v3 (generator 3) and class v4 (generator 4, class v3 plus the latency-shadow block, which is in
 /// the pack's own program_bound.metal). Each carries an era seed.
-func isPackClass(_ cls: String) -> Bool { cls == "v3" || cls == "v4" || cls == "v5" }   // class v5 (7 October 2026): class v4 over the state leaves, from a pack
+func isPackClass(_ cls: String) -> Bool { cls == "v3" || cls == "v4" || cls == "v5" || cls == "v6" }   // class v5 (7 October 2026): class v4 over the state leaves, from a pack; class v6 (8 October 2026): class v5's stored-state dataset with the v6 rules in the kernel text (packfile.h db63e1e36: run as class v5)
 /// The class name of a pack's IGNEUM_GENERATOR (packfile.h's rule).
-func packClassOf(generator: UInt32) -> String { generator == 5 ? "v5" : generator == 4 ? "v4" : generator == 3 ? "v3" : "v2" }
+func packClassOf(generator: UInt32) -> String { generator == 6 ? "v6" : generator == 5 ? "v5" : generator == 4 ? "v4" : generator == 3 ? "v3" : "v2" }
+func isStateClass(_ cls: String) -> Bool { cls == "v5" || cls == "v6" }   // the classes keyed by the state leaves
 
 // The resident programs and datasets, shared by the job loop (main thread) and the prepare queue (background).
 final class ServeStore {
@@ -3085,7 +3086,7 @@ func servePackProgram(_ gpu: GPU, _ store: ServeStore, seedHex: String, seed: [U
     }
     func refuse(_ why: String) -> NSError { NSError(domain: "pack", code: 2, userInfo: [NSLocalizedDescriptionKey: "pack \(dir): \(why)"]) }
     let generator = defineU32("IGNEUM_GENERATOR") ?? 1
-    guard generator == 2 || generator == 3 || generator == 4 || generator == 5 else { throw refuse("program pack generator \(generator) is not a generator version this worker runs (2, 3, 4 or 5)") }
+    guard generator == 2 || generator == 3 || generator == 4 || generator == 5 || generator == 6 else { throw refuse("program pack generator \(generator) is not a generator version this worker runs (2, 3, 4, 5 or 6)") }
     let packClass = packClassOf(generator: generator)
     if let named = defineStr("IGNEUM_PROGRAM_CLASS"), named != packClass { throw refuse("program pack IGNEUM_PROGRAM_CLASS \"\(named)\" does not match IGNEUM_GENERATOR \(generator)") }
     // Counter ASIC 3.0 (6 October 2026): the shadow block marks class v4 (packfile.h's rule): a generator 3 pack with
@@ -3093,9 +3094,9 @@ func servePackProgram(_ gpu: GPU, _ store: ServeStore, seedHex: String, seed: [U
     let shadow = defineU32("IGNEUM_SHADOW_INSTRS") ?? 0
     if generator == 4 && shadow == 0 { throw refuse("program pack generator 4 (class v4) without IGNEUM_SHADOW_INSTRS: not a class v4 pack") }
     // class v5 (7 October 2026) is class v4 over the state leaves: the shadow block and IGNEUM_STATE_LEAVES both mark it
-    if generator == 5 && shadow == 0 { throw refuse("program pack generator 5 (class v5) without IGNEUM_SHADOW_INSTRS: not a class v5 pack") }
-    if generator == 5 && (defineU32("IGNEUM_STATE_LEAVES") ?? 0) == 0 { throw refuse("program pack generator 5 (class v5) without IGNEUM_STATE_LEAVES: no state leaves to key the dataset (export the pack with --state)") }
-    if generator != 5 && (defineU32("IGNEUM_STATE_LEAVES") ?? 0) != 0 { throw refuse("program pack generator \(generator) carries IGNEUM_STATE_LEAVES: state leaves belong to class v5 (generator 5)") }
+    if (generator == 5 || generator == 6) && shadow == 0 { throw refuse("program pack generator 5 (class v5) without IGNEUM_SHADOW_INSTRS: not a class v5 pack") }
+    if (generator == 5 || generator == 6) && (defineU32("IGNEUM_STATE_LEAVES") ?? 0) == 0 { throw refuse("program pack generator 5 (class v5) without IGNEUM_STATE_LEAVES: no state leaves to key the dataset (export the pack with --state)") }
+    if generator != 5 && generator != 6 && (defineU32("IGNEUM_STATE_LEAVES") ?? 0) != 0 { throw refuse("program pack generator \(generator) carries IGNEUM_STATE_LEAVES: state leaves belong to class v5 (generator 5)") }
     if generator == 3 && shadow != 0 { throw refuse("program pack generator \(generator) with a shadow block (IGNEUM_SHADOW_INSTRS \(shadow)): a class v4 program is generator 4 (export the pack as class v4)") }
     let eraHex = defineStr("IGNEUM_ERA_SEED_HEX") ?? ""
     if wantClass != "" && wantClass != packClass { throw refuse("program class mismatch: this pack is class \(packClass), the line names class \(wantClass) (export the pack again)") }
@@ -3162,7 +3163,9 @@ func servePackDataset(_ gpu: GPU, _ store: ServeStore, dayHex: String, dir: Stri
     guard let fillFn = lib.makeFunction(name: "igneum_cache_fill"), let buildFn = lib.makeFunction(name: "igneum_build") else { throw refuse("memhard.metal lacks igneum_cache_fill or igneum_build") }
     let fillPipe = try gpu.device.makeComputePipelineState(function: fillFn)
     let buildPipe = try gpu.device.makeComputePipelineState(function: buildFn)
-    let words = 1 << datasetLog2
+    // ds55 (the class v6 research packs, 8 October 2026): a non-power-of-two dataset carries IGNEUM_DATASET_WORDS (the
+    // buffer's size) and IGNEUM_DATASET_ITEMS beside IGNEUM_DATASET_LOG2 (the floor); the kernel text maps (src * words) >> 32
+    let words = defineU64("IGNEUM_DATASET_WORDS").map { Int($0) } ?? (1 << datasetLog2)
     // Class v5 (docs/design/class-v5-stored-state.md, 7 October 2026): the window's state leaves, leaves.bin beside program.h
     // (IGNEUM_STATE_LEAVES leaves of 16 little-endian words), checked against the pack's count and FNV-1a 64
     // (IGNEUM_STATE_LEAVES_FNV64) and bound as buffer 2 of igneum_build with the count in buffer 3 (packbench.swift's shape,
@@ -3173,7 +3176,7 @@ func servePackDataset(_ gpu: GPU, _ store: ServeStore, dayHex: String, dir: Stri
         return UInt64(programH[Range(m.range(at: 1), in: programH)!], radix: 16)
     }
     let stateLeaves = defineU32("IGNEUM_STATE_LEAVES") ?? 0
-    if (packClass == "v5") != (stateLeaves > 0) { throw refuse(packClass == "v5" ? "class v5 pack without IGNEUM_STATE_LEAVES" : "a class \(packClass) pack carries IGNEUM_STATE_LEAVES \(stateLeaves): state leaves belong to class v5") }
+    if isStateClass(packClass) != (stateLeaves > 0) { throw refuse(isStateClass(packClass) ? "class v5 pack without IGNEUM_STATE_LEAVES" : "a class \(packClass) pack carries IGNEUM_STATE_LEAVES \(stateLeaves): state leaves belong to class v5") }
     var leavesBuf: MTLBuffer? = nil
     var nLeaves: UInt32 = 0
     if stateLeaves > 0 {
diff --git a/proto-metal/packbench.swift b/proto-metal/packbench.swift
index a382ddd7d..6e8a8fa88 100644
--- a/proto-metal/packbench.swift
+++ b/proto-metal/packbench.swift
@@ -93,8 +93,12 @@ let cacheFnvWant = hex64(vj["cache_fnv1a64"] as! String)
 let hotFnvWant: UInt64? = (vj["hot_fnv1a64"] as? String).map(hex64)
 
 guard let device = MTLCreateSystemDefaultDevice(), let queue = device.makeCommandQueue() else { fail("no Metal device") }
-let words = 1 << datasetLog2
-let mask = UInt32(words - 1)
+// ds55 (the class v6 research packs, 8 October 2026): a non-power-of-two dataset carries IGNEUM_DATASET_WORDS and
+// IGNEUM_DATASET_ITEMS beside IGNEUM_DATASET_LOG2 (the floor); the buffer is sized by the words, the items by ITEMS,
+// and the kernel text maps an address as (src * words) >> 32, so the mask is the kernel's business, not this host's
+let datasetWordsDefine = defineU64("IGNEUM_DATASET_WORDS")
+let words = datasetWordsDefine.map { Int($0) } ?? (1 << datasetLog2)
+let mask = UInt32(truncatingIfNeeded: (1 << datasetLog2) - 1)
 let cacheWords = 1 << cacheLog2
 
 func compile(_ file: String) -> MTLLibrary {
@@ -138,7 +142,7 @@ func fnv1a64(_ p: UnsafeRawPointer, _ n: Int) -> UInt64 {
     for i in 0..<n { h ^= UInt64(b[i]); h = h &* 0x100000001b3 }
     return h
 }
-let items = words / 16
+let items = defineU64("IGNEUM_DATASET_ITEMS").map { Int($0) } ?? (words / 16)
 // class v5 (docs/design/class-v5-stored-state.md): a pack with IGNEUM_STATE_LEAVES carries leaves.bin (16 words per leaf), bound
 // as buffer 2 of igneum_build with the count in buffer 3; the pack's FNV of the leaves is checked first
 var leavesBuf: MTLBuffer? = nil
diff --git a/site/404.html b/site/404.html
index 1102df2aa..ba5b80e78 100644
--- a/site/404.html
+++ b/site/404.html
@@ -117,7 +117,7 @@ main{flex:1}
         <div class="panel-list">
           <a href="/litepaper" data-nav="litepaper"><b>Litepaper</b><span>The design, as published.</span></a>
           <a href="/income" data-nav="income"><b>Income</b><span>What your card would mine, from the live network.</span></a>
-          <a href="/economics" data-nav="economics"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/acceptance" data-nav="acceptance"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
+          <a href="/economics" data-nav="economics"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/prize" data-nav="prize"><b>Prize</b><span>A better adversary or a reproduced shortcut, never a confirmation: the terms.</span></a><a href="/acceptance" data-nav="acceptance"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
           <a href="/ledger" data-nav="ledger"><b>Ledger</b><span>Every criticism, answered or conceded.</span></a>
           <a href="/claims" data-nav="claims"><b>What Igneum does not claim</b><span>The limits, stated first.</span></a>
           <a href="/randomx" data-nav="randomx"><b>Igneum vs RandomX</b><span>What was kept and what was rebuilt for GPUs.</span></a>
@@ -157,7 +157,7 @@ main{flex:1}
       <div class="sheet-group"><div class="sheet-head">Learn</div>
         <a href="/litepaper" data-nav="litepaper"><b>Litepaper</b><span>The design, as published.</span></a>
         <a href="/income" data-nav="income"><b>Income</b><span>What your card would mine, from the live network.</span></a>
-        <a href="/economics" data-nav="economics"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/acceptance" data-nav="acceptance"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
+        <a href="/economics" data-nav="economics"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/prize" data-nav="prize"><b>Prize</b><span>A better adversary or a reproduced shortcut, never a confirmation: the terms.</span></a><a href="/acceptance" data-nav="acceptance"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
         <a href="/ledger" data-nav="ledger"><b>Ledger</b><span>Every criticism, answered or conceded.</span></a>
         <a href="/claims" data-nav="claims"><b>What Igneum does not claim</b><span>The limits, stated first.</span></a>
         <a href="/randomx" data-nav="randomx"><b>Igneum vs RandomX</b><span>What was kept and what was rebuilt for GPUs.</span></a>
diff --git a/site/acceptance.html b/site/acceptance.html
index ea8ede581..b9019be8e 100644
--- a/site/acceptance.html
+++ b/site/acceptance.html
@@ -4,13 +4,13 @@
 <meta charset="utf-8">
 <meta name="viewport" content="width=device-width, initial-scale=1, viewport-fit=cover">
 <title>Igneum Test and Acceptance Standard: every case, shown as it passes</title>
-<meta name="description" content="The Igneum 2.0 Test and Acceptance Standard, 128 cases in 16 suites, case by case: each case in the standard’s words, the five gates, the profiles and the fixtures. A checklist, never a completion dashboard.">
+<meta name="description" content="The Igneum 2.0 Test and Acceptance Standard, 190 cases in 18 suites, case by case: each case in the standard’s words, the five gates, the profiles and the fixtures. A checklist, never a completion dashboard.">
 <link rel="canonical" href="https://igneum.network/acceptance">
 <!-- share:start -->
 <meta property="og:type" content="website">
 <meta property="og:site_name" content="Igneum">
 <meta property="og:title" content="Igneum Test and Acceptance Standard: every case, shown as it passes">
-<meta property="og:description" content="The Igneum 2.0 Test and Acceptance Standard, 128 cases in 16 suites, case by case: each case in the standard’s words, the five gates, the profiles and the fixtures. A checklist, never a completion dashboard.">
+<meta property="og:description" content="The Igneum 2.0 Test and Acceptance Standard, 190 cases in 18 suites, case by case: each case in the standard’s words, the five gates, the profiles and the fixtures. A checklist, never a completion dashboard.">
 <meta property="og:url" content="https://igneum.network/acceptance">
 <meta property="og:image" content="https://igneum.network/og/home.png?v=4">
 <meta property="og:image:type" content="image/png">
@@ -24,7 +24,7 @@
 <meta property="og:image:alt" content="The GPU-mined chain that proves every block. igneum.network">
 <meta name="twitter:card" content="summary_large_image">
 <meta name="twitter:title" content="Igneum Test and Acceptance Standard: every case, shown as it passes">
-<meta name="twitter:description" content="The Igneum 2.0 Test and Acceptance Standard, 128 cases in 16 suites, case by case: each case in the standard’s words, the five gates, the profiles and the fixtures. A checklist, never a completion dashboard.">
+<meta name="twitter:description" content="The Igneum 2.0 Test and Acceptance Standard, 190 cases in 18 suites, case by case: each case in the standard’s words, the five gates, the profiles and the fixtures. A checklist, never a completion dashboard.">
 <meta name="twitter:image" content="https://igneum.network/og/home.png?v=4">
 <meta name="twitter:image:alt" content="The GPU-mined chain that proves every block. igneum.network">
 <!-- share:end -->
@@ -260,7 +260,7 @@
         <div class="panel-list">
           <a href="/litepaper" data-nav="litepaper"><b>Litepaper</b><span>The design, as published.</span></a>
           <a href="/income" data-nav="income"><b>Income</b><span>What your card would mine, from the live network.</span></a>
-          <a href="/economics" data-nav="economics"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/acceptance" data-nav="acceptance" aria-current="page"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
+          <a href="/economics" data-nav="economics"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/prize" data-nav="prize"><b>Prize</b><span>A better adversary or a reproduced shortcut, never a confirmation: the terms.</span></a><a href="/acceptance" data-nav="acceptance" aria-current="page"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
           <a href="/ledger" data-nav="ledger"><b>Ledger</b><span>Every criticism, answered or conceded.</span></a>
           <a href="/claims" data-nav="claims"><b>What Igneum does not claim</b><span>The limits, stated first.</span></a>
           <a href="/randomx" data-nav="randomx"><b>Igneum vs RandomX</b><span>What was kept and what was rebuilt for GPUs.</span></a>
@@ -300,7 +300,7 @@
       <div class="sheet-group"><div class="sheet-head">Learn</div>
         <a href="/litepaper" data-nav="litepaper"><b>Litepaper</b><span>The design, as published.</span></a>
         <a href="/income" data-nav="income"><b>Income</b><span>What your card would mine, from the live network.</span></a>
-        <a href="/economics" data-nav="economics"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/acceptance" data-nav="acceptance" aria-current="page"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
+        <a href="/economics" data-nav="economics"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/prize" data-nav="prize"><b>Prize</b><span>A better adversary or a reproduced shortcut, never a confirmation: the terms.</span></a><a href="/acceptance" data-nav="acceptance" aria-current="page"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
         <a href="/ledger" data-nav="ledger"><b>Ledger</b><span>Every criticism, answered or conceded.</span></a>
         <a href="/claims" data-nav="claims"><b>What Igneum does not claim</b><span>The limits, stated first.</span></a>
         <a href="/randomx" data-nav="randomx"><b>Igneum vs RandomX</b><span>What was kept and what was rebuilt for GPUs.</span></a>
@@ -368,8 +368,8 @@
 <!-- nav:end -->
 <main id="main">
 <!-- acceptance:start -->
-<div id="acc-root"><section class="page-hero acc-hero"><div class="container"><div class="eyebrow"><span class="line"></span>Igneum 2.0 acceptance</div><h1 class="acc-title">Test and Acceptance Standard 1.0</h1><p class="lead">Every case of the standard, shown as it is run, in the standard’s own words. A checklist, never a completion score: a gate passes only when every case it depends on has passed.</p><p class="acc-basis"><span>Basis</span> IGNEUM_2.0_Plan.pdf, 37 pages, 8 October 2026. The standard runs to 73 pages. Registry dated 8 October 2026.</p><div class="acc-tally" id="acc-tally"><div class="acc-words"><span class="acc-word approved">APPROVED AS PROPOSED 8 OCTOBER 2026</span><span class="acc-word deferred">P13 DEFERRED</span></div><p class="acc-line">Test and Acceptance Standard 1.0: APPROVED AS PROPOSED by the founder, 8 October 2026; P13 (maintenance continuity) DEFERRED; 172 cases: 3 passed under the standard, 74 running with team evidence, 4 failed, 1 blocked, 89 not run, 1 deferred</p><div class="acc-bar" role="img" aria-label="172 cases: 3 passed under the standard, 74 running with team evidence, 4 failed, 1 blocked, 89 not run, 1 deferred"><span class="seg g-pass" style="flex-grow:3" title="3 PASS"></span><span class="seg g-fail" style="flex-grow:4" title="4 FAIL"></span><span class="seg g-blocked" style="flex-grow:1" title="1 BLOCKED"></span><span class="seg g-running" style="flex-grow:74" title="74 RUNNING"></span><span class="seg g-notrun" style="flex-grow:89" title="89 NOT RUN"></span><span class="seg g-deferred" style="flex-grow:1" title="1 DEFERRED"></span></div><ul class="acc-legend"><li><i class="sw g-pass" aria-hidden="true"></i><b>3</b> pass</li><li><i class="sw g-fail" aria-hidden="true"></i><b>4</b> fail</li><li><i class="sw g-blocked" aria-hidden="true"></i><b>1</b> blocked</li><li><i class="sw g-running" aria-hidden="true"></i><b>74</b> running</li><li><i class="sw g-notrun" aria-hidden="true"></i><b>89</b> not run</li><li><i class="sw g-deferred" aria-hidden="true"></i><b>1</b> deferred</li></ul></div></div></section><nav class="acc-jump container" aria-label="Suites"><a href="#gates">Gates</a><a href="#suite-GOV">GOV</a><a href="#suite-GPU">GPU</a><a href="#suite-POW">POW</a><a href="#suite-ADV">ADV</a><a href="#suite-ROT">ROT</a><a href="#suite-ECO">ECO</a><a href="#suite-EVM">EVM</a><a href="#suite-ZKP">ZKP</a><a href="#suite-CAP">CAP</a><a href="#suite-INC">INC</a><a href="#suite-FIN">FIN</a><a href="#suite-VER">VER</a><a href="#suite-OPS">OPS</a><a href="#suite-UX">UX</a><a href="#suite-COM">COM</a><a href="#suite-LEAD">LEAD</a><a href="#suite-REV">REV</a><a href="#profiles">Profiles</a><a href="#fixtures">Fixtures</a></nav><section class="section acc-gates-sec" id="gates"><div class="container"><div class="eyebrow"><span class="line"></span>The gates</div><h2>Five gates, and the freeze before them.</h2><p class="acc-sub">A gate reads NOT RUN until every case it depends on has run, RUNNING while any is running, BLOCKED if any is blocked, FAIL if any fails, and PASS only when every case passes. No gate is weighted into an average.</p><div class="acc-g0"><article class="acc-gate st-running small" id="gate-G0" data-gate-state="RUNNING"><div class="acc-gate-top"><span class="acc-gate-id">G0</span><span class="acc-chip s-running" data-state="RUNNING">RUNNING</span></div><h3>Freeze</h3><p class="acc-gate-d">Release identity</p><p class="acc-gate-c">No formal run or public pass before approval.</p><div class="acc-bar" role="img" aria-label="Freeze: 8 cases: 0 passed under the standard, 4 running with team evidence, 4 not run, 0 deferred"><span class="seg g-running" style="flex-grow:4" title="4 RUNNING"></span><span class="seg g-notrun" style="flex-grow:4" title="4 NOT RUN"></span></div><p class="acc-gate-n">8 cases: 0 passed under the standard, 4 running with team evidence, 4 not run, 0 deferred</p><ul class="acc-gs"><li><a href="#suite-GOV">GOV</a><span class="acc-gs-n">8 cases</span><span class="acc-chip s-running" data-state="RUNNING">RUNNING</span></li></ul></article></div><div class="acc-five"><article class="acc-gate st-running" id="gate-G1" data-gate-state="RUNNING"><div class="acc-gate-top"><span class="acc-gate-id">G1</span><span class="acc-chip s-running" data-state="RUNNING">RUNNING</span></div><h3>Baseline</h3><p class="acc-gate-d">D1</p><p class="acc-gate-c">No validated hardware claim without reproduction.</p><div class="acc-bar" role="img" aria-label="Baseline: 16 cases: 0 passed under the standard, 10 running with team evidence, 6 not run, 0 deferred"><span class="seg g-running" style="flex-grow:10" title="10 RUNNING"></span><span class="seg g-notrun" style="flex-grow:6" title="6 NOT RUN"></span></div><p class="acc-gate-n">16 cases: 0 passed under the standard, 10 running with team evidence, 6 not run, 0 deferred</p><ul class="acc-gs"><li><a href="#suite-GOV">GOV</a><span class="acc-gs-n">8 cases</span><span class="acc-chip s-running" data-state="RUNNING">RUNNING</span></li><li><a href="#suite-GPU">GPU</a><span class="acc-gs-n">8 cases</span><span class="acc-chip s-running" data-state="RUNNING">RUNNING</span></li></ul></article><article class="acc-gate st-blocked" id="gate-G2" data-gate-state="BLOCKED"><div class="acc-gate-top"><span class="acc-gate-id">G2</span><span class="acc-chip s-blocked" data-state="BLOCKED">BLOCKED</span></div><h3>Experiments</h3><p class="acc-gate-d">D2</p><p class="acc-gate-c">No improvement claim from a negative hypothesis.</p><div class="acc-bar" role="img" aria-label="Experiments: 32 cases: 1 passed under the standard, 22 running with team evidence, 1 blocked, 8 not run, 0 deferred"><span class="seg g-pass" style="flex-grow:1" title="1 PASS"></span><span class="seg g-blocked" style="flex-grow:1" title="1 BLOCKED"></span><span class="seg g-running" style="flex-grow:22" title="22 RUNNING"></span><span class="seg g-notrun" style="flex-grow:8" title="8 NOT RUN"></span></div><p class="acc-gate-n">32 cases: 1 passed under the standard, 22 running with team evidence, 1 blocked, 8 not run, 0 deferred</p><ul class="acc-gs"><li><a href="#suite-GOV">GOV</a><span class="acc-gs-n">8 cases</span><span class="acc-chip s-running" data-state="RUNNING">RUNNING</span></li><li><a href="#suite-GPU">GPU</a><span class="acc-gs-n">8 cases</span><span class="acc-chip s-running" data-state="RUNNING">RUNNING</span></li><li><a href="#suite-POW">POW</a><span class="acc-gs-n">8 cases</span><span class="acc-chip s-blocked" data-state="BLOCKED">BLOCKED</span></li><li><a href="#suite-ROT">ROT</a><span class="acc-gs-n">8 cases</span><span class="acc-chip s-running" data-state="RUNNING">RUNNING</span></li></ul></article><article class="acc-gate st-running" id="gate-G3" data-gate-state="RUNNING"><div class="acc-gate-top"><span class="acc-gate-id">G3</span><span class="acc-chip s-running" data-state="RUNNING">RUNNING</span></div><h3>Adversary</h3><p class="acc-gate-d">D3</p><p class="acc-gate-c">No broad resistance claim from one weak design.</p><div class="acc-bar" role="img" aria-label="Adversary: 16 cases: 0 passed under the standard, 11 running with team evidence, 5 not run, 0 deferred"><span class="seg g-running" style="flex-grow:11" title="11 RUNNING"></span><span class="seg g-notrun" style="flex-grow:5" title="5 NOT RUN"></span></div><p class="acc-gate-n">16 cases: 0 passed under the standard, 11 running with team evidence, 5 not run, 0 deferred</p><ul class="acc-gs"><li><a href="#suite-GOV">GOV</a><span class="acc-gs-n">8 cases</span><span class="acc-chip s-running" data-state="RUNNING">RUNNING</span></li><li><a href="#suite-ADV">ADV</a><span class="acc-gs-n">8 cases</span><span class="acc-chip s-running" data-state="RUNNING">RUNNING</span></li></ul></article><article class="acc-gate st-fail" id="gate-G4" data-gate-state="FAIL"><div class="acc-gate-top"><span class="acc-gate-id">G4</span><span class="acc-chip s-fail" data-state="FAIL">FAIL</span></div><h3>Coexistence</h3><p class="acc-gate-d">D4</p><p class="acc-gate-c">No durability claim based on assumed chip expiry.</p><div class="acc-bar" role="img" aria-label="Coexistence: 24 cases: 0 passed under the standard, 16 running with team evidence, 1 failed, 7 not run, 0 deferred"><span class="seg g-fail" style="flex-grow:1" title="1 FAIL"></span><span class="seg g-running" style="flex-grow:16" title="16 RUNNING"></span><span class="seg g-notrun" style="flex-grow:7" title="7 NOT RUN"></span></div><p class="acc-gate-n">24 cases: 0 passed under the standard, 16 running with team evidence, 1 failed, 7 not run, 0 deferred</p><ul class="acc-gs"><li><a href="#suite-GOV">GOV</a><span class="acc-gs-n">8 cases</span><span class="acc-chip s-running" data-state="RUNNING">RUNNING</span></li><li><a href="#suite-ECO">ECO</a><span class="acc-gs-n">8 cases</span><span class="acc-chip s-fail" data-state="FAIL">FAIL</span></li><li><a href="#suite-INC">INC</a><span class="acc-gs-n">8 cases</span><span class="acc-chip s-running" data-state="RUNNING">RUNNING</span></li></ul></article><article class="acc-gate st-running" id="gate-G5" data-gate-state="RUNNING"><div class="acc-gate-top"><span class="acc-gate-id">G5</span><span class="acc-chip s-running" data-state="RUNNING">RUNNING</span></div><h3>No rescue</h3><p class="acc-gate-d">D5</p><p class="acc-gate-c">No no-rescue claim from a founder-supported demo.</p><div class="acc-bar" role="img" aria-label="No rescue: 56 cases: 2 passed under the standard, 37 running with team evidence, 17 not run, 0 deferred"><span class="seg g-pass" style="flex-grow:2" title="2 PASS"></span><span class="seg g-running" style="flex-grow:37" title="37 RUNNING"></span><span class="seg g-notrun" style="flex-grow:17" title="17 NOT RUN"></span></div><p class="acc-gate-n">56 cases: 2 passed under the standard, 37 running with team evidence, 17 not run, 0 deferred</p><ul class="acc-gs"><li><a href="#suite-GOV">GOV</a><span class="acc-gs-n">8 cases</span><span class="acc-chip s-running" data-state="RUNNING">RUNNING</span></li><li><a href="#suite-ROT">ROT</a><span class="acc-gs-n">8 cases</span><span class="acc-chip s-running" data-state="RUNNING">RUNNING</span></li><li><a href="#suite-ZKP">ZKP</a><span class="acc-gs-n">8 cases</span><span class="acc-chip s-running" data-state="RUNNING">RUNNING</span></li><li><a href="#suite-INC">INC</a><span class="acc-gs-n">8 cases</span><span class="acc-chip s-running" data-state="RUNNING">RUNNING</span></li><li><a href="#suite-FIN">FIN</a><span class="acc-gs-n">8 cases</span><span class="acc-chip s-running" data-state="RUNNING">RUNNING</span></li><li><a href="#suite-OPS">OPS</a><span class="acc-gs-n">8 cases</span><span class="acc-chip s-running" data-state="RUNNING">RUNNING</span></li><li><a href="#suite-UX">UX</a><span class="acc-gs-n">8 cases</span><span class="acc-chip s-running" data-state="RUNNING">RUNNING</span></li></ul></article></div><h3 class="acc-tracks-h">The three named gates</h3><div class="acc-tracks"><article class="acc-gate st-fail small" id="gate-TR" data-gate-state="FAIL"><div class="acc-gate-top"><span class="acc-gate-id"></span><span class="acc-chip s-fail" data-state="FAIL">FAIL</span></div><h3>Technical readiness</h3><p class="acc-gate-d">Execution control</p><p class="acc-gate-c">No mainnet-ready claim with missing enforcement or safety.</p><div class="acc-bar" role="img" aria-label="Technical readiness: 64 cases: 3 passed under the standard, 41 running with team evidence, 3 failed, 1 blocked, 16 not run, 0 deferred"><span class="seg g-pass" style="flex-grow:3" title="3 PASS"></span><span class="seg g-fail" style="flex-grow:3" title="3 FAIL"></span><span class="seg g-blocked" style="flex-grow:1" title="1 BLOCKED"></span><span class="seg g-running" style="flex-grow:41" title="41 RUNNING"></span><span class="seg g-notrun" style="flex-grow:16" title="16 NOT RUN"></span></div><p class="acc-gate-n">64 cases: 3 passed under the standard, 41 running with team evidence, 3 failed, 1 blocked, 16 not run, 0 deferred</p><ul class="acc-gs"><li><a href="#suite-GOV">GOV</a><span class="acc-gs-n">8 cases</span><span class="acc-chip s-running" data-state="RUNNING">RUNNING</span></li><li><a href="#suite-POW">POW</a><span class="acc-gs-n">8 cases</span><span class="acc-chip s-blocked" data-state="BLOCKED">BLOCKED</span></li><li><a href="#suite-EVM">EVM</a><span class="acc-gs-n">8 cases</span><span class="acc-chip s-running" data-state="RUNNING">RUNNING</span></li><li><a href="#suite-ZKP">ZKP</a><span class="acc-gs-n">8 cases</span><span class="acc-chip s-running" data-state="RUNNING">RUNNING</span></li><li><a href="#suite-CAP">CAP</a><span class="acc-gs-n">8 cases</span><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></li><li><a href="#suite-FIN">FIN</a><span class="acc-gs-n">8 cases</span><span class="acc-chip s-running" data-state="RUNNING">RUNNING</span></li><li><a href="#suite-VER">VER</a><span class="acc-gs-n">8 cases</span><span class="acc-chip s-fail" data-state="FAIL">FAIL</span></li><li><a href="#suite-UX">UX</a><span class="acc-gs-n">8 cases</span><span class="acc-chip s-running" data-state="RUNNING">RUNNING</span></li></ul></article><article class="acc-gate st-running small" id="gate-CE" data-gate-state="RUNNING"><div class="acc-gate-top"><span class="acc-gate-id"></span><span class="acc-chip s-running" data-state="RUNNING">RUNNING</span></div><h3>Commercial evidence</h3><p class="acc-gate-d">Execution control</p><p class="acc-gate-c">Devnet activity is insufficient.</p><div class="acc-bar" role="img" aria-label="Commercial evidence: 24 cases: 0 passed under the standard, 4 running with team evidence, 19 not run, 1 deferred"><span class="seg g-running" style="flex-grow:4" title="4 RUNNING"></span><span class="seg g-notrun" style="flex-grow:19" title="19 NOT RUN"></span><span class="seg g-deferred" style="flex-grow:1" title="1 DEFERRED"></span></div><p class="acc-gate-n">24 cases: 0 passed under the standard, 4 running with team evidence, 19 not run, 1 deferred</p><ul class="acc-gs"><li><a href="#suite-GOV">GOV</a><span class="acc-gs-n">8 cases</span><span class="acc-chip s-running" data-state="RUNNING">RUNNING</span></li><li><a href="#suite-CAP">CAP</a><span class="acc-gs-n">8 cases</span><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></li><li><a href="#suite-COM">COM</a><span class="acc-gs-n">8 cases</span><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></li></ul></article><article class="acc-gate st-fail small" id="gate-CD" data-gate-state="FAIL"><div class="acc-gate-top"><span class="acc-gate-id"></span><span class="acc-chip s-fail" data-state="FAIL">FAIL</span></div><h3>Leadership-contender decision</h3><p class="acc-gate-d">Execution control</p><p class="acc-gate-c">Supports a scoped contention assessment, not a guaranteed rank.</p><div class="acc-bar" role="img" aria-label="Leadership-contender decision: 172 cases: 3 passed under the standard, 74 running with team evidence, 4 failed, 1 blocked, 89 not run, 1 deferred"><span class="seg g-pass" style="flex-grow:3" title="3 PASS"></span><span class="seg g-fail" style="flex-grow:4" title="4 FAIL"></span><span class="seg g-blocked" style="flex-grow:1" title="1 BLOCKED"></span><span class="seg g-running" style="flex-grow:74" title="74 RUNNING"></span><span class="seg g-notrun" style="flex-grow:89" title="89 NOT RUN"></span><span class="seg g-deferred" style="flex-grow:1" title="1 DEFERRED"></span></div><p class="acc-gate-n">172 cases: 3 passed under the standard, 74 running with team evidence, 4 failed, 1 blocked, 89 not run, 1 deferred</p><ul class="acc-gs"><li><a href="#suite-GOV">GOV</a><span class="acc-gs-n">8 cases</span><span class="acc-chip s-running" data-state="RUNNING">RUNNING</span></li><li><a href="#suite-GPU">GPU</a><span class="acc-gs-n">8 cases</span><span class="acc-chip s-running" data-state="RUNNING">RUNNING</span></li><li><a href="#suite-POW">POW</a><span class="acc-gs-n">8 cases</span><span class="acc-chip s-blocked" data-state="BLOCKED">BLOCKED</span></li><li><a href="#suite-ADV">ADV</a><span class="acc-gs-n">8 cases</span><span class="acc-chip s-running" data-state="RUNNING">RUNNING</span></li><li><a href="#suite-ROT">ROT</a><span class="acc-gs-n">8 cases</span><span class="acc-chip s-running" data-state="RUNNING">RUNNING</span></li><li><a href="#suite-ECO">ECO</a><span class="acc-gs-n">8 cases</span><span class="acc-chip s-fail" data-state="FAIL">FAIL</span></li><li><a href="#suite-EVM">EVM</a><span class="acc-gs-n">8 cases</span><span class="acc-chip s-running" data-state="RUNNING">RUNNING</span></li><li><a href="#suite-ZKP">ZKP</a><span class="acc-gs-n">8 cases</span><span class="acc-chip s-running" data-state="RUNNING">RUNNING</span></li><li><a href="#suite-CAP">CAP</a><span class="acc-gs-n">8 cases</span><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></li><li><a href="#suite-INC">INC</a><span class="acc-gs-n">8 cases</span><span class="acc-chip s-running" data-state="RUNNING">RUNNING</span></li><li><a href="#suite-FIN">FIN</a><span class="acc-gs-n">8 cases</span><span class="acc-chip s-running" data-state="RUNNING">RUNNING</span></li><li><a href="#suite-VER">VER</a><span class="acc-gs-n">8 cases</span><span class="acc-chip s-fail" data-state="FAIL">FAIL</span></li><li><a href="#suite-OPS">OPS</a><span class="acc-gs-n">8 cases</span><span class="acc-chip s-running" data-state="RUNNING">RUNNING</span></li><li><a href="#suite-UX">UX</a><span class="acc-gs-n">8 cases</span><span class="acc-chip s-running" data-state="RUNNING">RUNNING</span></li><li><a href="#suite-COM">COM</a><span class="acc-gs-n">8 cases</span><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></li><li><a href="#suite-LEAD">LEAD</a><span class="acc-gs-n">8 cases</span><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></li><li><a href="#suite-REV">REV</a><span class="acc-gs-n">44 cases</span><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></li></ul></article></div></div></section><section class="section acc-suite" id="suite-GOV"><div class="container"><div class="acc-suite-head"><div class="acc-suite-code"><span class="n">01</span>GOV</div><div class="acc-suite-t"><h2>Release identity and evidence</h2><p class="acc-sub">Prevent a favourable result from being attached to the wrong code, assumptions or public claim.</p></div><div class="acc-suite-st"><span class="acc-chip s-running" data-state="RUNNING">RUNNING</span></div></div><dl class="acc-facts"><div><dt>Owner</dt><dd>Release lead + independent assurance</dd></div><div><dt>Gate</dt><dd>G0 / all gates <span class="acc-gl"><a href="#gate-G0">G0</a> <a href="#gate-G1">G1</a> <a href="#gate-G2">G2</a> <a href="#gate-G3">G3</a> <a href="#gate-G4">G4</a> <a href="#gate-G5">G5</a></span></dd></div><div><dt>Fixtures</dt><dd>F0 manifest; F1 source/build archives; F9 evidence vault</dd></div><div><dt>Plan pages</dt><dd>5, 21, 23, 25, 26, 27</dd></div></dl><div class="acc-suite-bar"><div class="acc-bar" role="img" aria-label="GOV: 8 cases: 0 passed under the standard, 4 running with team evidence, 4 not run, 0 deferred"><span class="seg g-running" style="flex-grow:4" title="4 RUNNING"></span><span class="seg g-notrun" style="flex-grow:4" title="4 NOT RUN"></span></div><span>8 cases: 0 passed under the standard, 4 running with team evidence, 4 not run, 0 deferred</span></div><div class="acc-cases"><div class="acc-cases-h" aria-hidden="true"><span>Case</span><span>Title</span><span>Priority</span><span>Profile</span><span>Status</span><span>Evidence</span><span>Last run</span><span></span></div><details class="acc-case" id="case-GOV-01" data-case="GOV-01" data-state="RUNNING"><summary><span class="c-id">GOV-01</span><span class="c-title">Freeze the release and its claims</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P00</span><span class="c-st"><span class="acc-chip s-running" data-state="RUNNING">RUNNING</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:32 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Candidate source, binaries, public documentation and the 2.0 plan are available; no run is yet accepted.</p><h4>Steps</h4><ol><li>Record exact commits, binary hashes, dependencies, genesis/network identity, mining class, datasets, execution fork, verifier IDs and fee rules in F0.</li><li>Map every promised capability and plan requirement to a test ID; distinguish supported mining, proving and wallet combinations.</li><li>Sign the manifest with protocol, product and independent review owners before confirmatory runs.</li></ol><h4>Accept</h4><p>Every material rule and claim has an unambiguous version and test. Conflicts or unknown activation rules produce BLOCKED, not an inferred default. Changes create a new manifest and invalidate affected results.</p><h4>Evidence the case requires</h4><p>Signed F0; source-to-test map; claim inventory; unresolved-field register.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>node lane (a283f5f0d364ceef0)</dd></div><div><dt>Run</dt><dd>201-7cfa422a-aa0e0f45</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>18</dd></div><div><dt>Plan pages</dt><dd>5, 21, 23, 25, 26, 27</dd></div></dl></div></details><details class="acc-case" id="case-GOV-02" data-case="GOV-02" data-state="RUNNING"><summary><span class="c-id">GOV-02</span><span class="c-title">Approve thresholds before results</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P00</span><span class="c-st"><span class="acc-chip s-running" data-state="RUNNING">RUNNING</span></span><span class="c-ev"><span class="lbl">Evidence </span><a href="https://git.igneum.network/igneum-network/igneum/src/branch/master/docs/plans/igneum-2.0-test-registry.json" rel="noopener">record</a></span><span class="c-run"><span class="lbl">Last run </span>2026-10-08 18:3x UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>This manual supplies proposed test thresholds, not source-approved protocol parameters.</p><h4>Steps</h4><ol><li>Approve or replace every P-profile before confirmatory testing; give each change a rationale and independent approver.</li><li>Register hardware cohorts, mandatory economic worlds, customer workloads, peer dimensions and exclusion rules.</li><li>Lock the profile hash and hold out seeds/workloads from the developers doing optimisation.</li></ol><h4>Accept</h4><p>No decision-critical field is TBD. Numeric limits are frozen, commercially meaningful and not chosen from observed results. A weakened limit after failure requires a new protocol, full affected rerun and explicit claim downgrade review.</p><h4>Evidence the case requires</h4><p>Approved profile register; timestamped holdout commitments; change log.</p></blockquote><h4>Evidence record of the run</h4><dl class="acc-meta acc-rec"><div><dt>What was run</dt><dd>the profiles approved as proposed by the founder at 18:2x UK before any confirmatory run; P13 deferred</dd></div><div><dt>Run by</dt><dd>CI steward (a2ecfa95d3206016c)</dd></div><div><dt>Under the standard</dt><dd>no: team-run before the standard's procedure; the status is RUNNING until the case is re-run under its steps with the profile's numbers and an independent run where the profile asks one</dd></div><div><dt>Pass or fail today</dt><dd>not judged under the standard yet</dd></div></dl><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>CI steward (a2ecfa95d3206016c)</dd></div><div><dt>Run</dt><dd>team-2026-10-08</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>18</dd></div><div><dt>Plan pages</dt><dd>5, 21, 23, 25, 26, 27</dd></div></dl></div></details><details class="acc-case" id="case-GOV-03" data-case="GOV-03" data-state="NOT RUN"><summary><span class="c-id">GOV-03</span><span class="c-title">Reproduce builds outside the founding team</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P00, P02</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>2026-10-08 18:3x UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Provide public source and documented build instructions to three unaffiliated operators.</p><h4>Steps</h4><ol><li>Build on clean declared environments without private files, tokens or founder assistance.</li><li>Compare reproducible payload hashes; isolate signatures, notarisation and permitted non-deterministic wrappers.</li><li>Run reference vectors and restart a node using only documented artifacts.</li></ol><h4>Accept</h4><p>All independent builds reproduce the same consensus payload or an independently explained, pre-approved wrapper difference; reference outputs match exactly. Missing private prerequisites block release.</p><h4>Evidence the case requires</h4><p>Build logs; dependency lockfiles; binary comparison; operator attestations.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Independent reproduction</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>build-server lane (a352e49ff4613df86)</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>18</dd></div><div><dt>Plan pages</dt><dd>5, 21, 23, 25, 26, 27</dd></div></dl></div></details><details class="acc-case" id="case-GOV-04" data-case="GOV-04" data-state="NOT RUN"><summary><span class="c-id">GOV-04</span><span class="c-title">Preserve raw and negative evidence</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P00</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:22 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Enable append-only storage for run outputs and a separate analysis workspace.</p><h4>Steps</h4><ol><li>Capture failed, aborted and successful runs with timestamps, seeds and environment hashes.</li><li>Recompute one published figure from raw records on a clean machine.</li><li>Modify a retained artifact deliberately and test integrity verification.</li></ol><h4>Accept</h4><p>Every headline can be regenerated; tampering is detected; exclusions have pre-registered reasons. Failed or missing runs remain visible and are never replaced silently by a successful retry.</p><h4>Evidence the case requires</h4><p>Artifact manifest; hashes; reproduction script; exclusion ledger; negative-run archive.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>CI steward (a2ecfa95d3206016c)</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>19</dd></div><div><dt>Plan pages</dt><dd>5, 21, 23, 25, 26, 27</dd></div></dl></div></details><details class="acc-case" id="case-GOV-05" data-case="GOV-05" data-state="RUNNING"><summary><span class="c-id">GOV-05</span><span class="c-title">Prove the test oracle detects broken behaviour</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P01</span><span class="c-st"><span class="acc-chip s-running" data-state="RUNNING">RUNNING</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 19:28 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Create controlled defective variants on an isolated network only.</p><h4>Steps</h4><ol><li>Disable proof verification, change one reward, accept an expired authority set and alter one hash output in separate mutants.</li><li>Run the corresponding ZKP, INC, FIN and POW tests without telling the runner which mutant is active.</li><li>Confirm the baseline still accepts authorised valid cases.</li></ol><h4>Accept</h4><p>Every deliberately introduced fault is caught by its mapped test; valid controls pass. Any undetected critical mutant blocks acceptance of that test family until the oracle is repaired.</p><h4>Evidence the case requires</h4><p>Mutation catalogue; blinded run results; baseline controls; oracle review.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>fast-time lane (a8be71a0db962911c)</dd></div><div><dt>Run</dt><dd>200-417c4a57-b2</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>19</dd></div><div><dt>Plan pages</dt><dd>5, 21, 23, 25, 26, 27</dd></div></dl></div></details><details class="acc-case" id="case-GOV-06" data-case="GOV-06" data-state="RUNNING"><summary><span class="c-id">GOV-06</span><span class="c-title">Enforce scope and optional-feature discipline</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P00</span><span class="c-st"><span class="acc-chip s-running" data-state="RUNNING">RUNNING</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 19:28 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Inventory FP32 experiments, receipts/oracles and all retained or excluded mining levers.</p><h4>Steps</h4><ol><li>Mark each capability CORE, CLAIMED-OPTIONAL or EXCLUDED before release testing.</li><li>For excluded code, check binaries, protocol activation and product copy for accidental enablement or implied availability.</li><li>For each claimed option, require the complete associated test set rather than a demonstration.</li></ol><h4>Accept</h4><p>Every core and claimed-option obligation passes. Excluded items are shown as EXCLUDED, never PASS and never counted as achievements. Removing a failed core requirement prevents an all-2.0-pass claim.</p><h4>Evidence the case requires</h4><p>Scope manifest; activation scan; product-copy comparison; exclusions register.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>CI steward (a2ecfa95d3206016c)</dd></div><div><dt>Run</dt><dd>200-417c4a57-b2</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>19</dd></div><div><dt>Plan pages</dt><dd>5, 21, 23, 25, 26, 27</dd></div></dl></div></details><details class="acc-case" id="case-GOV-07" data-case="GOV-07" data-state="NOT RUN"><summary><span class="c-id">GOV-07</span><span class="c-title">Independent review and finding closure</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P09</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>2026-10-08 18:3x UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Nominate reviewers with declared conflicts and scopes covering cryptography, consensus and hardware.</p><h4>Steps</h4><ol><li>Provide pinned code, raw data, adversarial models and prior failures, including negative results.</li><li>Track each finding to remediation and an independent retest; do not use the author as sole approver.</li><li>Have reviewers state unreviewed surfaces and model limitations in their signed conclusions.</li></ol><h4>Accept</h4><p>No unresolved critical or high-severity finding affects the claimed release. A finite review is described by scope, not as proof of universal security. Independent reproduction and review are both evidenced.</p><h4>Evidence the case requires</h4><p>Signed scoped reports; conflict declarations; finding/retest ledger.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Independent specialist review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>main / the founder</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>20</dd></div><div><dt>Plan pages</dt><dd>5, 21, 23, 25, 26, 27</dd></div></dl></div></details><details class="acc-case" id="case-GOV-08" data-case="GOV-08" data-state="NOT RUN"><summary><span class="c-id">GOV-08</span><span class="c-title">Invalidate stale evidence and control public status</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P00</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:22 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Create a simulated post-test change to a verifier, mining class, dataset and fee rule.</p><h4>Steps</h4><ol><li>Calculate affected test dependencies and invalidate their former PASS statuses.</li><li>Regenerate public status pages from F0 and the evidence register.</li><li>Attempt to publish a rank-one, guaranteed-profit or automatic-chip-death claim without the required evidence.</li></ol><h4>Accept</h4><p>Affected gates return to NOT RUN or BLOCKED. Public claims retain version, limits and date; unsupported claims are withheld. No stale result remains attached to a different release.</p><h4>Evidence the case requires</h4><p>Dependency impact report; regenerated status page; rejected claim examples.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>CI steward (a2ecfa95d3206016c)</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>20</dd></div><div><dt>Plan pages</dt><dd>5, 21, 23, 25, 26, 27</dd></div></dl></div></details></div></div></section><section class="section acc-suite" id="suite-GPU"><div class="container"><div class="acc-suite-head"><div class="acc-suite-code"><span class="n">02</span>GPU</div><div class="acc-suite-t"><h2>Whole-system GPU measurements</h2><p class="acc-sub">Close the pending measurements and evaluate the actual configuration, including costs hidden by kernel-only results.</p></div><div class="acc-suite-st"><span class="acc-chip s-running" data-state="RUNNING">RUNNING</span></div></div><dl class="acc-facts"><div><dt>Owner</dt><dd>GPU lead + three independent operators</dd></div><div><dt>Gate</dt><dd>G1 / G2 <span class="acc-gl"><a href="#gate-G1">G1</a> <a href="#gate-G2">G2</a></span></dd></div><div><dt>Fixtures</dt><dd>F2 retail-hardware cohort; F3 paired benchmark workloads; F9 calibrated evidence</dd></div><div><dt>Plan pages</dt><dd>6, 7, 8, 14, 18, 23</dd></div></dl><div class="acc-suite-bar"><div class="acc-bar" role="img" aria-label="GPU: 8 cases: 0 passed under the standard, 6 running with team evidence, 2 not run, 0 deferred"><span class="seg g-running" style="flex-grow:6" title="6 RUNNING"></span><span class="seg g-notrun" style="flex-grow:2" title="2 NOT RUN"></span></div><span>8 cases: 0 passed under the standard, 6 running with team evidence, 2 not run, 0 deferred</span></div><div class="acc-cases"><div class="acc-cases-h" aria-hidden="true"><span>Case</span><span>Title</span><span>Priority</span><span>Profile</span><span>Status</span><span>Evidence</span><span>Last run</span><span></span></div><details class="acc-case" id="case-GPU-01" data-case="GPU-01" data-state="RUNNING"><summary><span class="c-id">GPU-01</span><span class="c-title">Cover the declared commodity population</span><span class="c-pri"><span class="lbl">Priority </span>GATE</span><span class="c-prof"><span class="lbl">Profile </span>P02</span><span class="c-st"><span class="acc-chip s-running" data-state="RUNNING">RUNNING</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:10 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Freeze the P02 cohort, supported role matrix and the final v6 configuration.</p><h4>Steps</h4><ol><li>Inventory physical SKU, usable memory, driver, operating system, firmware, cooling and acquisition channel.</li><li>Run mining on every supported cohort cell and proving on every separately advertised prover cell.</li><li>Include lower-memory, used-generation and all advertised vendor cases; retain unsupported results separately.</li></ol><h4>Accept</h4><p>All declared cells are tested, with no after-the-fact removal of weak cards. At least the P02 minimum coverage is met. Mining-only support is never reported as proof-generation support.</p><h4>Evidence the case requires</h4><p>Cohort manifest; compatibility matrix; raw results by SKU and role.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>research lane (ad6a2bd47d4a46105)</dd></div><div><dt>Run</dt><dd>p02-fleet-pods-20261008-01</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>21</dd></div><div><dt>Plan pages</dt><dd>6, 7, 8, 14, 18, 23</dd></div></dl></div></details><details class="acc-case" id="case-GPU-02" data-case="GPU-02" data-state="RUNNING"><summary><span class="c-id">GPU-02</span><span class="c-title">Reproduce Ember clock-lock savings</span><span class="c-pri"><span class="lbl">Priority </span>GATE</span><span class="c-prof"><span class="lbl">Profile </span>P02, P03</span><span class="c-st"><span class="acc-chip s-running" data-state="RUNNING">RUNNING</span></span><span class="c-ev"><span class="lbl">Evidence </span><a href="https://git.igneum.network/igneum-network/igneum/src/branch/master/docs/analysis/class-v6/rows/run-ca3-pc1-readwidth-5090-20261008-b.md" rel="noopener">record</a></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 19:41 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Use paired stock and tuned runs on the same board, host, workload and ambient conditions.</p><h4>Steps</h4><ol><li>Warm to stability; randomise stock/tuned order and run P02 repeated sessions.</li><li>Measure accepted work, calibrated wall energy, device telemetry and rejected work.</li><li>Calculate paired energy and rate changes with run-level uncertainty, retaining failed tuning attempts.</li></ol><h4>Accept</h4><p>Tuning preserves correctness and meets approved P03 operating limits. The historical 34-41% saving and under-2% rate-loss statement is reproduced only for qualifying configurations; otherwise that claim is corrected. Existing savings are not counted twice.</p><h4>Evidence the case requires</h4><p>Raw power/time series; paired analysis; tuning settings; claim-by-SKU table.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>hash lane (a690540514aa453d7)</dd></div><div><dt>Run</dt><dd>hash-lane-20261008-batch1</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>21</dd></div><div><dt>Plan pages</dt><dd>6, 7, 8, 14, 18, 23</dd></div></dl></div></details><details class="acc-case" id="case-GPU-03" data-case="GPU-03" data-state="RUNNING"><summary><span class="c-id">GPU-03</span><span class="c-title">Measure the real 64-register GPU cost</span><span class="c-pri"><span class="lbl">Priority </span>GATE</span><span class="c-prof"><span class="lbl">Profile </span>P02, P03</span><span class="c-st"><span class="acc-chip s-running" data-state="RUNNING">RUNNING</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:10 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Build the baseline and window variant with identical dataset, reads and semantic workload.</p><h4>Steps</h4><ol><li>Inspect compiled register allocation, spills, occupancy and memory traffic on each supported backend.</li><li>Measure paired complete-system energy and accepted throughput, including host work.</li><li>Repeat during proving coexistence and expose any memory or scheduling cliff.</li></ol><h4>Accept</h4><p>Any production window meets P03 budgets for every mandatory SKU; no hidden spills or correctness changes. Zero GPU cost is claimed only where measurement supports it within uncertainty. Results feed the redesigned adversary, not an old core estimate.</p><h4>Evidence the case requires</h4><p>Compiler reports; allocation traces; paired energy/rate data; coexistence runs.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>hash lane (a690540514aa453d7)</dd></div><div><dt>Run</dt><dd>p02-fleet-pods-20261008-01</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>21</dd></div><div><dt>Plan pages</dt><dd>6, 7, 8, 14, 18, 23</dd></div></dl></div></details><details class="acc-case" id="case-GPU-04" data-case="GPU-04" data-state="RUNNING"><summary><span class="c-id">GPU-04</span><span class="c-title">Find the memory-clock operating ladder</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P01, P02</span><span class="c-st"><span class="acc-chip s-running" data-state="RUNNING">RUNNING</span></span><span class="c-ev"><span class="lbl">Evidence </span><a href="https://git.igneum.network/igneum-network/igneum/src/branch/master/docs/analysis/class-v6/floor/sm-sparse.md" rel="noopener">record</a></span><span class="c-run"><span class="lbl">Last run </span>2026-10-08 18:3x UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Use safe vendor-supported settings only; record operator permission and original settings.</p><h4>Steps</h4><ol><li>Sweep approved core and memory operating points while holding workload constant.</li><li>Measure error rate, accepted throughput, wall energy and thermal equilibrium.</li><li>Repeat the selected knee after reboot and restore defaults after a failed or interrupted tuning session.</li></ol><h4>Accept</h4><p>Selected profiles are stable, reproducible and not dependent on unsafe clocks. Every accepted hash remains correct; saved settings restore predictably. Tuning failure leaves a working safe configuration.</p><h4>Evidence the case requires</h4><p>Clock ladder; safe bounds; thermal/error logs; reboot and rollback record.</p></blockquote><h4>Evidence record of the run</h4><dl class="acc-meta acc-rec"><div><dt>What was run</dt><dd>the memory-clock ladder at the lock (floor lane 1, b1b8d833)</dd></div><div><dt>Run by</dt><dd>hash lane (a690540514aa453d7)</dd></div><div><dt>Under the standard</dt><dd>no: team-run before the standard's procedure; the status is RUNNING until the case is re-run under its steps with the profile's numbers and an independent run where the profile asks one</dd></div><div><dt>Pass or fail today</dt><dd>not judged under the standard yet</dd></div></dl><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>hash lane (a690540514aa453d7)</dd></div><div><dt>Run</dt><dd>team-2026-10-08</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>22</dd></div><div><dt>Plan pages</dt><dd>6, 7, 8, 14, 18, 23</dd></div></dl></div></details><details class="acc-case" id="case-GPU-05" data-case="GPU-05" data-state="RUNNING"><summary><span class="c-id">GPU-05</span><span class="c-title">Test dataset fit and support-horizon costs</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P01, P02, P06</span><span class="c-st"><span class="acc-chip s-running" data-state="RUNNING">RUNNING</span></span><span class="c-ev"><span class="lbl">Evidence </span><a href="https://git.igneum.network/igneum-network/igneum/src/branch/master/docs/analysis/class-v6/rows/run-ca3-pc1-amd-cardin-20261008T1703.md" rel="noopener">record</a></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 19:41 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Test 5.5, 8.5 and 11.5 GiB only as source-proposed candidates; F0 determines activated sizes.</p><h4>Steps</h4><ol><li>Measure allocation plus driver, display, prover and OS headroom on the 8 GB and other cohort tiers.</li><li>Run near-full-memory, fragmentation, restart and next-epoch construction scenarios.</li><li>Compare time-sharing/eviction with concurrent mining/proving, including reload cost.</li></ol><h4>Accept</h4><p>Every advertised combination completes without OOM or silent corruption. Unsupported future sizes are identified before activation. GPU exclusions and lost proving capacity appear in ECO evaluation; retirement of a tier is not a success metric.</p><h4>Evidence the case requires</h4><p>Memory budget per SKU; OOM traces; support horizon; concurrency cost table.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>hash lane (a690540514aa453d7)</dd></div><div><dt>Run</dt><dd>hash-lane-20261008-batch1</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>22</dd></div><div><dt>Plan pages</dt><dd>6, 7, 8, 14, 18, 23</dd></div></dl></div></details><details class="acc-case" id="case-GPU-06" data-case="GPU-06" data-state="NOT RUN"><summary><span class="c-id">GPU-06</span><span class="c-title">Measure accepted work under ordinary connectivity</span><span class="c-pri"><span class="lbl">Priority </span>GATE</span><span class="c-prof"><span class="lbl">Profile </span>P02, P10</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:22 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Use the same hardware against clean, delayed, lossy and intermittent links in F4.</p><h4>Steps</h4><ol><li>Measure kernel rate and accepted work separately under home and datacentre link profiles.</li><li>Include reconnects, template changes, expired submissions and pool failover.</li><li>Attribute loss to network, local software, validation and protocol causes.</li></ol><h4>Accept</h4><p>Results use accepted work, never kernel rate alone. Ordinary-link incremental rejection stays within P10; all losses remain priced in ECO. Unreachable links may pause but must not claim paid work.</p><h4>Evidence the case requires</h4><p>Per-submission ledger; network trace; rejection reasons; accepted-work comparison.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>fleet lane (ac055d60427caab99)</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>22</dd></div><div><dt>Plan pages</dt><dd>6, 7, 8, 14, 18, 23</dd></div></dl></div></details><details class="acc-case" id="case-GPU-07" data-case="GPU-07" data-state="RUNNING"><summary><span class="c-id">GPU-07</span><span class="c-title">Survive sustained thermal and power operation</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P01, P02, P10</span><span class="c-st"><span class="acc-chip s-running" data-state="RUNNING">RUNNING</span></span><span class="c-ev"><span class="lbl">Evidence </span><a href="https://git.igneum.network/igneum-network/igneum/src/branch/master/docs/analysis/class-v6/floor/sm-sparse.md" rel="noopener">record</a></span><span class="c-run"><span class="lbl">Last run </span>2026-10-08 18:3x UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Run the selected profile on actual reference machines for the P02 soak period.</p><h4>Steps</h4><ol><li>Track wall power, temperatures, clocks, memory and accepted work continuously.</li><li>Inject safe power interruptions, process restarts and normal competing desktop load.</li><li>Check restored settings and compare late-run efficiency with the first stable period.</li></ol><h4>Accept</h4><p>No invalid work or unsafe persistent settings; P02/P10 stability limits hold. Thermal throttling, crashes and recovery time remain in throughput and energy denominators. A crash-free short benchmark cannot substitute for the soak.</p><h4>Evidence the case requires</h4><p>Seven-day time series; crash reports; settings-restoration checks; drift analysis.</p></blockquote><h4>Evidence record of the run</h4><dl class="acc-meta acc-rec"><div><dt>What was run</dt><dd>the 5090 lock pass, 66 minutes at 1,300 MHz with the four-minute reserve (floor lane 1)</dd></div><div><dt>Run by</dt><dd>hash lane (a690540514aa453d7)</dd></div><div><dt>Under the standard</dt><dd>no: team-run before the standard's procedure; the status is RUNNING until the case is re-run under its steps with the profile's numbers and an independent run where the profile asks one</dd></div><div><dt>Pass or fail today</dt><dd>not judged under the standard yet</dd></div></dl><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>hash lane (a690540514aa453d7)</dd></div><div><dt>Run</dt><dd>team-2026-10-08</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>23</dd></div><div><dt>Plan pages</dt><dd>6, 7, 8, 14, 18, 23</dd></div></dl></div></details><details class="acc-case" id="case-GPU-08" data-case="GPU-08" data-state="NOT RUN"><summary><span class="c-id">GPU-08</span><span class="c-title">Reproduce the full baseline independently</span><span class="c-pri"><span class="lbl">Priority </span>GATE</span><span class="c-prof"><span class="lbl">Profile </span>P02</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>2026-10-08 18:3x UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Three unaffiliated operators receive F0, F2 and F3, including the final miner/prover build.</p><h4>Steps</h4><ol><li>Repeat identical-SKU paired runs with documented meter calibration and environment differences.</li><li>Recompute joules and total cost per accepted work from the shared raw schema.</li><li>Investigate divergence before accepting a pooled headline or uncertainty band.</li></ol><h4>Accept</h4><p>Reproductions meet P02 tolerance and exact correctness. No unexplained divergence or selectively missing low-end cell remains. Report manufactured GPU measurements separately from modelled specialist estimates.</p><h4>Evidence the case requires</h4><p>Three signed reproduction packs; reconciliation report; final baseline table.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Independent reproduction</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>fleet lane (ac055d60427caab99)</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>23</dd></div><div><dt>Plan pages</dt><dd>6, 7, 8, 14, 18, 23</dd></div></dl></div></details></div></div></section><section class="section acc-suite" id="suite-POW"><div class="container"><div class="acc-suite-head"><div class="acc-suite-code"><span class="n">03</span>POW</div><div class="acc-suite-t"><h2>Proof-of-work correctness and coupling</h2><p class="acc-sub">Find semantic disagreements and structural shortcuts before treating a harder-looking program as a stronger defence.</p></div><div class="acc-suite-st"><span class="acc-chip s-blocked" data-state="BLOCKED">BLOCKED</span></div></div><dl class="acc-facts"><div><dt>Owner</dt><dd>Cryptography + GPU lead</dd></div><div><dt>Gate</dt><dd>G2 / technical readiness <span class="acc-gl"><a href="#gate-G2">G2</a></span></dd></div><div><dt>Fixtures</dt><dd>F0 rule set; F3 independent CPU/GPU oracles; F5 mutation corpus</dd></div><div><dt>Plan pages</dt><dd>7, 9, 10, 23</dd></div></dl><div class="acc-suite-bar"><div class="acc-bar" role="img" aria-label="POW: 8 cases: 1 passed under the standard, 6 running with team evidence, 1 blocked, 0 not run, 0 deferred"><span class="seg g-pass" style="flex-grow:1" title="1 PASS"></span><span class="seg g-blocked" style="flex-grow:1" title="1 BLOCKED"></span><span class="seg g-running" style="flex-grow:6" title="6 RUNNING"></span></div><span>8 cases: 1 passed under the standard, 6 running with team evidence, 1 blocked, 0 not run, 0 deferred</span></div><div class="acc-cases"><div class="acc-cases-h" aria-hidden="true"><span>Case</span><span>Title</span><span>Priority</span><span>Profile</span><span>Status</span><span>Evidence</span><span>Last run</span><span></span></div><details class="acc-case" id="case-POW-01" data-case="POW-01" data-state="RUNNING"><summary><span class="c-id">POW-01</span><span class="c-title">Match independent execution across every backend</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P01</span><span class="c-st"><span class="acc-chip s-running" data-state="RUNNING">RUNNING</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:32 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Implement an independently written reference evaluator, not a wrapper around the production GPU path.</p><h4>Steps</h4><ol><li>Execute the P01 corpus across every family, boundary seed and supported backend.</li><li>Exercise zero, maximum, sign, shift, rotate, overflow and unaligned-address cases allowed by the spec.</li><li>Minimise every mismatch and rerun it on clean builds.</li></ol><h4>Accept</h4><p>Bit-for-bit agreement for all valid cases and identical rejection for invalid cases. One unexplained mismatch is a blocker. Large sample counts are evidence of testing, not proof that unseen disagreements cannot exist.</p><h4>Evidence the case requires</h4><p>Reference implementation review; seeds/vectors; backend matrix; mismatch archive.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>hash lane (a690540514aa453d7)</dd></div><div><dt>Run</dt><dd>201-7cfa422a-aa0e0f45</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>24</dd></div><div><dt>Plan pages</dt><dd>7, 9, 10, 23</dd></div></dl></div></details><details class="acc-case" id="case-POW-02" data-case="POW-02" data-state="PASS"><summary><span class="c-id">POW-02</span><span class="c-title">Validate generated programs and index folding</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P01</span><span class="c-st"><span class="acc-chip s-pass" data-state="PASS">PASS</span></span><span class="c-ev"><span class="lbl">Evidence </span><a href="https://git.igneum.network/igneum-network/igneum/src/branch/master/docs/analysis/class-v6/census-packs.md" rel="noopener">record</a></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:54 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Use the frozen grammar, opcode semantics and index-fold rule; include boundary and malformed programs.</p><h4>Steps</h4><ol><li>Enumerate small constrained programs and fuzz the full generator at P01 depth.</li><li>Check bounds, valid dependencies, address distribution and forbidden encodings.</li><li>Compare source-level operations with optimised compiled code for removed or altered work.</li></ol><h4>Accept</h4><p>No accepted program violates semantics, termination or memory bounds. Distribution claims have predeclared tests and effect-size limits; passing randomness checks is not treated as a cryptographic proof.</p><h4>Evidence the case requires</h4><p>Generator/fuzzer logs; reduced counterexamples; disassembly comparison; index tests.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>hash lane (a690540514aa453d7)</dd></div><div><dt>Run</dt><dd>census-v6-20261008-2034</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>24</dd></div><div><dt>Plan pages</dt><dd>7, 9, 10, 23</dd></div></dl></div></details><details class="acc-case" id="case-POW-03" data-case="POW-03" data-state="RUNNING"><summary><span class="c-id">POW-03</span><span class="c-title">Test whether live state is unavoidable</span><span class="c-pri"><span class="lbl">Priority </span>GATE</span><span class="c-prof"><span class="lbl">Profile </span>P03, P04</span><span class="c-st"><span class="acc-chip s-running" data-state="RUNNING">RUNNING</span></span><span class="c-ev"><span class="lbl">Evidence </span><a href="https://git.igneum.network/igneum-network/igneum/src/branch/master/docs/analysis/class-v6/connected-state.md" rel="noopener">record</a></span><span class="c-run"><span class="lbl">Last run </span>2026-10-08 18:3x UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Take the 64-register candidate and the cheapest independently proposed storage organisations.</p><h4>Steps</h4><ol><li>Trace value liveness across dependent reads and final output, distinguishing distinct information from duplicated values.</li><li>Try banking, compression, recomputation, fewer ports and time-multiplexed contexts.</li><li>Quantify the best complete-system cost/throughput trade-off rather than the reference register count.</li></ol><h4>Accept</h4><p>Production selection is supported by measured or physically modelled penalties after these alternatives. G2 requires the P03 improvement; an attractive source-level register count alone does not pass.</p><h4>Evidence the case requires</h4><p>Liveness traces; alternative implementations; Pareto table; reviewer analysis.</p></blockquote><h4>Evidence record of the run</h4><dl class="acc-meta acc-rec"><div><dt>What was run</dt><dd>the connected-state class KILLED (1.10x against the 1.25x gate; live state costs a clock-gated file nothing)</dd></div><div><dt>Run by</dt><dd>adversary lane (a1a9876a88f5a72fc)</dd></div><div><dt>Under the standard</dt><dd>no: team-run before the standard's procedure; the status is RUNNING until the case is re-run under its steps with the profile's numbers and an independent run where the profile asks one</dd></div><div><dt>Pass or fail today</dt><dd>not judged under the standard yet</dd></div></dl><dl class="acc-meta"><div><dt>Method</dt><dd>Experiment + independent hardware review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>adversary lane (a1a9876a88f5a72fc)</dd></div><div><dt>Run</dt><dd>team-2026-10-08</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>24</dd></div><div><dt>Plan pages</dt><dd>7, 9, 10, 23</dd></div></dl></div></details><details class="acc-case" id="case-POW-04" data-case="POW-04" data-state="RUNNING"><summary><span class="c-id">POW-04</span><span class="c-title">Evaluate connected-resource restructuring</span><span class="c-pri"><span class="lbl">Priority </span>GATE</span><span class="c-prof"><span class="lbl">Profile </span>P03, P04</span><span class="c-st"><span class="acc-chip s-running" data-state="RUNNING">RUNNING</span></span><span class="c-ev"><span class="lbl">Evidence </span><a href="https://git.igneum.network/igneum-network/igneum/src/branch/master/docs/analysis/class-v6/connected-state.md" rel="noopener">record</a></span><span class="c-run"><span class="lbl">Last run </span>2026-10-08 18:3x UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Use a candidate initially matched to baseline instruction count, read count and dataset size.</p><h4>Steps</h4><ol><li>Connect state, addresses, arithmetic and lane communication according to the written hypothesis.</li><li>Measure GPU cost and allow the specialist reviewer to redesign the entire core.</li><li>Repeat on held-out program seeds and compare the worst supported adversary, not only the original design.</li></ol><h4>Accept</h4><p>The selected upgrade meets P03 and improves the adversarial result outside declared uncertainty. A negative experiment remains a negative outcome; adopting a different design requires a new frozen comparison.</p><h4>Evidence the case requires</h4><p>Matched workloads; GPU runs; redesigned core estimates; held-out results.</p></blockquote><h4>Evidence record of the run</h4><dl class="acc-meta acc-rec"><div><dt>What was run</dt><dd>the same experiment, D2(a) closed</dd></div><div><dt>Run by</dt><dd>adversary lane (a1a9876a88f5a72fc)</dd></div><div><dt>Under the standard</dt><dd>no: team-run before the standard's procedure; the status is RUNNING until the case is re-run under its steps with the profile's numbers and an independent run where the profile asks one</dd></div><div><dt>Pass or fail today</dt><dd>not judged under the standard yet</dd></div></dl><dl class="acc-meta"><div><dt>Method</dt><dd>Controlled experiment</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>adversary lane (a1a9876a88f5a72fc)</dd></div><div><dt>Run</dt><dd>team-2026-10-08</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>25</dd></div><div><dt>Plan pages</dt><dd>7, 9, 10, 23</dd></div></dl></div></details><details class="acc-case" id="case-POW-05" data-case="POW-05" data-state="BLOCKED"><summary><span class="c-id">POW-05</span><span class="c-title">Prevent amortised cheap winning attempts</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P01, P04</span><span class="c-st"><span class="acc-chip s-blocked" data-state="BLOCKED">BLOCKED</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>2026-10-08 18:13Z</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Prepare valid templates, nonces, intermediate-state captures and independent acceptance checks.</p><h4>Steps</h4><ol><li>Vary nonce, payout identity, transactions, roots and other committed fields after expensive work.</li><li>Try replay, precomputation, shared prefixes, partial evaluation and many cheap suffix candidates.</li><li>Price any valid strategy against fresh evaluation; independently review all bindings.</li></ol><h4>Accept</h4><p>Invalid modifications are rejected. Any valid cost-saving strategy is incorporated into ADV and must still meet P04/ECO gates. No unresolved shortcut is hidden behind passing reference vectors.</p><h4>Evidence the case requires</h4><p>Attack implementations; valid/invalid controls; work-cost analysis; binding review.</p></blockquote><h4>Evidence record of the run</h4><dl class="acc-meta acc-rec"><div><dt>What was run</dt><dd>the binding review: twelve reuse paths, none below the honest cost; five open questions B1 to B5</dd></div><div><dt>Run by</dt><dd>pool design seat (a3832b1c3b274b310)</dd></div><div><dt>Under the standard</dt><dd>no: team-run before the standard's procedure; the status is RUNNING until the case is re-run under its steps with the profile's numbers and an independent run where the profile asks one</dd></div><div><dt>Pass or fail today</dt><dd>not judged under the standard yet</dd></div></dl><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>pool design seat (a3832b1c3b274b310)</dd></div><div><dt>Run</dt><dd>binding-review-2026-10-08-a05</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>25</dd></div><div><dt>Plan pages</dt><dd>7, 9, 10, 23</dd></div></dl></div></details><details class="acc-case" id="case-POW-06" data-case="POW-06" data-state="RUNNING"><summary><span class="c-id">POW-06</span><span class="c-title">Bound verifier work and malformed-input cost</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P01, P09</span><span class="c-st"><span class="acc-chip s-running" data-state="RUNNING">RUNNING</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 19:28 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Use ordinary CPU validators with a manifest-defined resource budget and untrusted submissions.</p><h4>Steps</h4><ol><li>Submit shortest/longest programs, malformed encodings and adversarial memory references.</li><li>Measure verification time, peak memory and work amplification across valid and invalid inputs.</li><li>Sustain the approved hostile request rate while ordinary valid traffic continues.</li></ol><h4>Accept</h4><p>All semantics remain correct and P09 resource budgets hold. Invalid traffic cannot cause unbounded allocation, crashes or disproportionate free work. Rate limits must not replace consensus validation.</p><h4>Evidence the case requires</h4><p>CPU profiles; adversarial corpus; allocation traces; valid-traffic latency.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>hash lane (a690540514aa453d7)</dd></div><div><dt>Run</dt><dd>p01-partb-20261008-01</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>25</dd></div><div><dt>Plan pages</dt><dd>7, 9, 10, 23</dd></div></dl></div></details><details class="acc-case" id="case-POW-07" data-case="POW-07" data-state="RUNNING"><summary><span class="c-id">POW-07</span><span class="c-title">Constrain any mixed-resource or FP32 branch</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P00, P01, P03</span><span class="c-st"><span class="acc-chip s-running" data-state="RUNNING">RUNNING</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:32 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>If this branch is excluded, verify that it is unreachable and not claimed; if included, use a separate frozen candidate.</p><h4>Steps</h4><ol><li>Specify exact rounding, fusion, special values and backend behaviour before compiling.</li><li>Differentially test all supported architectures and allow numerical-domain simplification in the specialist model.</li><li>Include verifier cost and candidate energy in P03/P04, not just arithmetic-unit area.</li></ol><h4>Accept</h4><p>Included branches achieve exact agreed semantics and all hardware budgets. An excluded branch earns no performance credit. No approximate operation or unspecified compiler choice enters consensus.</p><h4>Evidence the case requires</h4><p>Scope decision; semantic specification; vectors; simplified datapath model.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Conditional implementation test</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>hash lane (a690540514aa453d7)</dd></div><div><dt>Run</dt><dd>201-7cfa422a-aa0e0f45</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>26</dd></div><div><dt>Plan pages</dt><dd>7, 9, 10, 23</dd></div></dl></div></details><details class="acc-case" id="case-POW-08" data-case="POW-08" data-state="RUNNING"><summary><span class="c-id">POW-08</span><span class="c-title">Keep rejected mechanisms out of the shipped claim</span><span class="c-pri"><span class="lbl">Priority </span>GATE</span><span class="c-prof"><span class="lbl">Profile </span>P00, P03</span><span class="c-st"><span class="acc-chip s-running" data-state="RUNNING">RUNNING</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:32 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Inventory long programs, select trees, SM gating, wider reads, sealed classes, random epoch lengths, per-tier scoring and VRF draws.</p><h4>Steps</h4><ol><li>Retain their historic negative tests and realistic SRAM instruction-memory control.</li><li>Inspect the release for reintroduction through renamed settings or hidden paths.</li><li>Require a new written hypothesis and complete adversarial retest for any proposed return.</li></ol><h4>Accept</h4><p>Excluded levers remain excluded unless separately approved and retested. Flip-flop instruction-memory area is never presented as the cost of a realistic SRAM implementation.</p><h4>Evidence the case requires</h4><p>Decision register; binary/config scan; negative-control results.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>hash lane (a690540514aa453d7)</dd></div><div><dt>Run</dt><dd>201-7cfa422a-aa0e0f45</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>26</dd></div><div><dt>Plan pages</dt><dd>7, 9, 10, 23</dd></div></dl></div></details></div></div></section><section class="section acc-suite" id="suite-ADV"><div class="container"><div class="acc-suite-head"><div class="acc-suite-code"><span class="n">04</span>ADV</div><div class="acc-suite-t"><h2>Programmable specialist adversaries</h2><p class="acc-sub">Give the opponent permission to adapt, share resources and remain operational; test cost rather than imagined chip death.</p></div><div class="acc-suite-st"><span class="acc-chip s-running" data-state="RUNNING">RUNNING</span></div></div><dl class="acc-facts"><div><dt>Owner</dt><dd>Independent hardware team</dd></div><div><dt>Gate</dt><dd>G3 <span class="acc-gl"><a href="#gate-G3">G3</a></span></dd></div><div><dt>Fixtures</dt><dd>F2 reference GPUs; F6 RTL/physical models; all published families</dd></div><div><dt>Plan pages</dt><dd>8, 10, 12, 22, 23</dd></div></dl><div class="acc-suite-bar"><div class="acc-bar" role="img" aria-label="ADV: 8 cases: 0 passed under the standard, 7 running with team evidence, 1 not run, 0 deferred"><span class="seg g-running" style="flex-grow:7" title="7 RUNNING"></span><span class="seg g-notrun" style="flex-grow:1" title="1 NOT RUN"></span></div><span>8 cases: 0 passed under the standard, 7 running with team evidence, 1 not run, 0 deferred</span></div><div class="acc-cases"><div class="acc-cases-h" aria-hidden="true"><span>Case</span><span>Title</span><span>Priority</span><span>Profile</span><span>Status</span><span>Evidence</span><span>Last run</span><span></span></div><details class="acc-case" id="case-ADV-01" data-case="ADV-01" data-state="RUNNING"><summary><span class="c-id">ADV-01</span><span class="c-title">Build a multi-family programmable opponent</span><span class="c-pri"><span class="lbl">Priority </span>GATE</span><span class="c-prof"><span class="lbl">Profile </span>P01, P04</span><span class="c-st"><span class="acc-chip s-running" data-state="RUNNING">RUNNING</span></span><span class="c-ev"><span class="lbl">Evidence </span><a href="https://git.igneum.network/igneum-network/igneum/src/branch/master/docs/analysis/class-v6/multi-family-adversary.md" rel="noopener">record</a></span><span class="c-run"><span class="lbl">Last run </span>2026-10-08 18:3x UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Provide the complete published family bank and future known parameter schedule to the reviewer.</p><h4>Steps</h4><ol><li>Design one programmable architecture that supports all retained families, including firmware and emulation paths.</li><li>Optimise clocks, lanes, ports and pipelines without requiring a graphics-card layout.</li><li>Verify its outputs against POW vectors before measuring any advantage.</li></ol><h4>Accept</h4><p>At least the P04 design diversity is evaluated; every estimated competitive design is functionally validated. Inability of one narrow design to adapt is not evidence that all chips expire.</p><h4>Evidence the case requires</h4><p>Architecture reports; functional simulations; adaptation matrix; reviewer signature.</p></blockquote><h4>Evidence record of the run</h4><dl class="acc-meta acc-rec"><div><dt>What was run</dt><dd>the 18-family programmable core placed and routed (9.36 pJ per lane-op, k 0.64 same-node)</dd></div><div><dt>Run by</dt><dd>adversary lane (a1a9876a88f5a72fc)</dd></div><div><dt>Under the standard</dt><dd>no: team-run before the standard's procedure; the status is RUNNING until the case is re-run under its steps with the profile's numbers and an independent run where the profile asks one</dd></div><div><dt>Pass or fail today</dt><dd>not judged under the standard yet</dd></div></dl><dl class="acc-meta"><div><dt>Method</dt><dd>Independent hardware study</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>adversary lane (a1a9876a88f5a72fc)</dd></div><div><dt>Run</dt><dd>team-2026-10-08</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>27</dd></div><div><dt>Plan pages</dt><dd>8, 10, 12, 22, 23</dd></div></dl></div></details><details class="acc-case" id="case-ADV-02" data-case="ADV-02" data-state="RUNNING"><summary><span class="c-id">ADV-02</span><span class="c-title">Price shared, reduced and reconstructed memory</span><span class="c-pri"><span class="lbl">Priority </span>GATE</span><span class="c-prof"><span class="lbl">Profile </span>P04</span><span class="c-st"><span class="acc-chip s-running" data-state="RUNNING">RUNNING</span></span><span class="c-ev"><span class="lbl">Evidence </span><a href="https://git.igneum.network/igneum-network/igneum/src/branch/master/docs/analysis/class-v6/multi-family-adversary.md" rel="noopener">record</a></span><span class="c-run"><span class="lbl">Last run </span>2026-10-08 18:3x UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Allow multiple engines to share a dataset and to store selected fractions rather than a complete per-engine copy.</p><h4>Steps</h4><ol><li>Sweep sharing factors, memory fractions, caches and recomputation depth across many simultaneous hashes.</li><li>Include construction/update amortisation, bandwidth contention and retained state.</li><li>Take the most favourable feasible point for the specialist into the complete-board model.</li></ol><h4>Accept</h4><p>No omitted feasible trade-off materially lowers the accepted cost estimate. Any winning alternative is included in P04 and ECO; capacity alone is not accepted as an energy bound.</p><h4>Evidence the case requires</h4><p>Sweep definitions; energy/bandwidth data; best-feasible envelope; excluded-design reasons.</p></blockquote><h4>Evidence record of the run</h4><dl class="acc-meta acc-rec"><div><dt>What was run</dt><dd>D2(b): the stored-half hybrid, memory sharing, recomputation priced (the placed hybrid 1.93x same-node at the mean hit)</dd></div><div><dt>Run by</dt><dd>adversary lane (a1a9876a88f5a72fc)</dd></div><div><dt>Under the standard</dt><dd>no: team-run before the standard's procedure; the status is RUNNING until the case is re-run under its steps with the profile's numbers and an independent run where the profile asks one</dd></div><div><dt>Pass or fail today</dt><dd>not judged under the standard yet</dd></div></dl><dl class="acc-meta"><div><dt>Method</dt><dd>Model + adversarial implementation</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>adversary lane (a1a9876a88f5a72fc)</dd></div><div><dt>Run</dt><dd>team-2026-10-08</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>27</dd></div><div><dt>Plan pages</dt><dd>8, 10, 12, 22, 23</dd></div></dl></div></details><details class="acc-case" id="case-ADV-03" data-case="ADV-03" data-state="RUNNING"><summary><span class="c-id">ADV-03</span><span class="c-title">Attack with data-local and hybrid execution</span><span class="c-pri"><span class="lbl">Priority </span>GATE</span><span class="c-prof"><span class="lbl">Profile </span>P04</span><span class="c-st"><span class="acc-chip s-running" data-state="RUNNING">RUNNING</span></span><span class="c-ev"><span class="lbl">Evidence </span><a href="https://git.igneum.network/igneum-network/igneum/src/branch/master/docs/analysis/class-v6/multi-family-adversary.md" rel="noopener">record</a></span><span class="c-run"><span class="lbl">Last run </span>2026-10-08 18:3x UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Permit distributed memories, state migration and companion CPU/GPU/FPGA components.</p><h4>Steps</h4><ol><li>Compare moving computation, intermediate state or fetched data to each read location.</li><li>Test specialised mining alongside outsourced proof generation rather than assuming one physical GPU does both.</li><li>Include interconnect, host, synchronisation, idle and conversion costs.</li></ol><h4>Accept</h4><p>The cheapest feasible combined system is included in the adversarial envelope and economic model. A worker identity or account is never treated as proof of a single physical device.</p><h4>Evidence the case requires</h4><p>Hybrid architecture diagrams; traffic traces; system cost and energy ledger.</p></blockquote><h4>Evidence record of the run</h4><dl class="acc-meta acc-rec"><div><dt>What was run</dt><dd>data-local execution moves nothing (2,112 bits of live state against an 80-bit read)</dd></div><div><dt>Run by</dt><dd>adversary lane (a1a9876a88f5a72fc)</dd></div><div><dt>Under the standard</dt><dd>no: team-run before the standard's procedure; the status is RUNNING until the case is re-run under its steps with the profile's numbers and an independent run where the profile asks one</dd></div><div><dt>Pass or fail today</dt><dd>not judged under the standard yet</dd></div></dl><dl class="acc-meta"><div><dt>Method</dt><dd>Independent system modelling</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>adversary lane (a1a9876a88f5a72fc)</dd></div><div><dt>Run</dt><dd>team-2026-10-08</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>27</dd></div><div><dt>Plan pages</dt><dd>8, 10, 12, 22, 23</dd></div></dl></div></details><details class="acc-case" id="case-ADV-04" data-case="ADV-04" data-state="RUNNING"><summary><span class="c-id">ADV-04</span><span class="c-title">Measure profitable selective participation</span><span class="c-pri"><span class="lbl">Priority </span>GATE</span><span class="c-prof"><span class="lbl">Profile </span>P04, P12</span><span class="c-st"><span class="acc-chip s-running" data-state="RUNNING">RUNNING</span></span><span class="c-ev"><span class="lbl">Evidence </span><a href="https://git.igneum.network/igneum-network/igneum/src/branch/master/docs/analysis/class-v6/multi-family-adversary.md" rel="noopener">record</a></span><span class="c-run"><span class="lbl">Last run </span>2026-10-08 18:3x UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Use all declared families plus held-out generated programs and the protocol difficulty rule.</p><h4>Steps</h4><ol><li>Identify favourable execution paths and add cheap fallbacks for other periods.</li><li>Simulate entry/exit around profitable periods, including idle time, compilation and re-entry costs.</li><li>Evaluate revenue and costs across the full schedule, not just average program energy.</li></ol><h4>Accept</h4><p>Intermittent specialists meet P04/ECO limits when evaluated on full-period economics. A weak tail cannot be concealed by a favourable mean; known valid shortcuts must be priced.</p><h4>Evidence the case requires</h4><p>Per-program advantage distribution; policy simulator; full-period returns.</p></blockquote><h4>Evidence record of the run</h4><dl class="acc-meta acc-rec"><div><dt>What was run</dt><dd>selective participation 9 percent spread across 2,000 era draws</dd></div><div><dt>Run by</dt><dd>adversary lane (a1a9876a88f5a72fc)</dd></div><div><dt>Under the standard</dt><dd>no: team-run before the standard's procedure; the status is RUNNING until the case is re-run under its steps with the profile's numbers and an independent run where the profile asks one</dd></div><div><dt>Pass or fail today</dt><dd>not judged under the standard yet</dd></div></dl><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>adversary lane (a1a9876a88f5a72fc)</dd></div><div><dt>Run</dt><dd>team-2026-10-08</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>28</dd></div><div><dt>Plan pages</dt><dd>8, 10, 12, 22, 23</dd></div></dl></div></details><details class="acc-case" id="case-ADV-05" data-case="ADV-05" data-state="RUNNING"><summary><span class="c-id">ADV-05</span><span class="c-title">Validate physical and complete-board costs</span><span class="c-pri"><span class="lbl">Priority </span>GATE</span><span class="c-prof"><span class="lbl">Profile </span>P04</span><span class="c-st"><span class="acc-chip s-running" data-state="RUNNING">RUNNING</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>2026-10-08 18:3x UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Use feasible process/library assumptions and documented component boundaries; no fabricated foundry access.</p><h4>Steps</h4><ol><li>Model SRAM macros, ports, wiring, clocking, memory PHYs, external memory, host and power conversion.</li><li>Run place-and-route where available; mark unmodelled items as uncertainty rather than zero.</li><li>Compare against a calibrated existing hardware block or equivalent validation case.</li></ol><h4>Accept</h4><p>No decision-critical cost is omitted. Physically unvalidated or proprietary estimates are labelled and independently bounded; synthesis alone cannot earn a manufactured-chip claim.</p><h4>Evidence the case requires</h4><p>Netlist/physical reports; macro assumptions; bill of materials; model calibration.</p></blockquote><h4>Evidence record of the run</h4><dl class="acc-meta acc-rec"><div><dt>What was run</dt><dd>the complete GDDR7 machine 1.5x same-node, 1.8x a node ahead at the placed energy; the honest same-node bracket 1.5x to 2.1x: FAIL against P04 at R_E 1.5, served as such</dd></div><div><dt>Run by</dt><dd>k lane (a3c9601a6d4686fe1)</dd></div><div><dt>Under the standard</dt><dd>no: team-run before the standard's procedure; the status is RUNNING until the case is re-run under its steps with the profile's numbers and an independent run where the profile asks one</dd></div><div><dt>Pass or fail today</dt><dd>FAIL against P04 at R_E 1.5</dd></div></dl><dl class="acc-meta"><div><dt>Method</dt><dd>Independent physical-design review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>k lane (a3c9601a6d4686fe1)</dd></div><div><dt>Run</dt><dd>team-2026-10-08</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>28</dd></div><div><dt>Plan pages</dt><dd>8, 10, 12, 22, 23</dd></div></dl></div></details><details class="acc-case" id="case-ADV-06" data-case="ADV-06" data-state="RUNNING"><summary><span class="c-id">ADV-06</span><span class="c-title">Separate process advantage from specialisation</span><span class="c-pri"><span class="lbl">Priority </span>GATE</span><span class="c-prof"><span class="lbl">Profile </span>P04, P12</span><span class="c-st"><span class="acc-chip s-running" data-state="RUNNING">RUNNING</span></span><span class="c-ev"><span class="lbl">Evidence </span><a href="https://git.igneum.network/igneum-network/igneum/src/branch/master/docs/analysis/class-v6/floor/shadow-k.md" rel="noopener">record</a></span><span class="c-run"><span class="lbl">Last run </span>2026-10-08 18:3x UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Evaluate same-node, one-node-ahead and two-node-ahead scenarios with explicit technology definitions.</p><h4>Steps</h4><ol><li>Use independently justified process factors, voltages, memory and packaging assumptions for each design.</li><li>Allow reusable IP and modular revisions; credit GPU improvement consistently.</li><li>Evaluate measurement confidence and model-parameter sensitivity separately.</li></ol><h4>Accept</h4><p>P04 primary limits hold for all competitive-reference cells; two-node futures are reported and pass the predeclared economic stress envelope. A model range is never labelled a statistical confidence interval without justification.</p><h4>Evidence the case requires</h4><p>Node-specific reports; factor provenance; uncertainty and sensitivity tables.</p></blockquote><h4>Evidence record of the run</h4><dl class="acc-meta acc-rec"><div><dt>What was run</dt><dd>the node column: same-node and a node ahead kept separate (k 0.78 / 0.56 / 0.40 at N5 / N3 / N2)</dd></div><div><dt>Run by</dt><dd>k lane (a3c9601a6d4686fe1)</dd></div><div><dt>Under the standard</dt><dd>no: team-run before the standard's procedure; the status is RUNNING until the case is re-run under its steps with the profile's numbers and an independent run where the profile asks one</dd></div><div><dt>Pass or fail today</dt><dd>not judged under the standard yet</dd></div></dl><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>k lane (a3c9601a6d4686fe1)</dd></div><div><dt>Run</dt><dd>team-2026-10-08</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>28</dd></div><div><dt>Plan pages</dt><dd>8, 10, 12, 22, 23</dd></div></dl></div></details><details class="acc-case" id="case-ADV-07" data-case="ADV-07" data-state="RUNNING"><summary><span class="c-id">ADV-07</span><span class="c-title">Evaluate lifetime without forced obsolescence</span><span class="c-pri"><span class="lbl">Priority </span>GATE</span><span class="c-prof"><span class="lbl">Profile </span>P04, P12</span><span class="c-st"><span class="acc-chip s-running" data-state="RUNNING">RUNNING</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>2026-10-08 18:3x UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Assume multi-year productive survival and known schedule support before testing optional retirement penalties.</p><h4>Steps</h4><ol><li>Price firmware, emulation, memory expansion, companion hardware and incremental redesign.</li><li>Include 1-, 3- and 5-year productive lifetimes plus idle/resale possibilities.</li><li>Grant a retirement credit only if all feasible cheaper adaptations lose competitiveness.</li></ol><h4>Accept</h4><p>The primary case does not require chip death or a fresh full development bill per family. Every retirement credit has a documented adaptation comparison; incompatible and unprofitable are reported separately.</p><h4>Evidence the case requires</h4><p>Lifetime/adaptation ledger; revision costs; feasible-alternative analysis.</p></blockquote><h4>Evidence record of the run</h4><dl class="acc-meta acc-rec"><div><dt>What was run</dt><dd>the transition matrix: no row loses competitiveness, the three-year life holds, zero obsolescence credit</dd></div><div><dt>Run by</dt><dd>adversary lane (a1a9876a88f5a72fc)</dd></div><div><dt>Under the standard</dt><dd>no: team-run before the standard's procedure; the status is RUNNING until the case is re-run under its steps with the profile's numbers and an independent run where the profile asks one</dd></div><div><dt>Pass or fail today</dt><dd>not judged under the standard yet</dd></div></dl><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>adversary lane (a1a9876a88f5a72fc)</dd></div><div><dt>Run</dt><dd>team-2026-10-08</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>29</dd></div><div><dt>Plan pages</dt><dd>8, 10, 12, 22, 23</dd></div></dl></div></details><details class="acc-case" id="case-ADV-08" data-case="ADV-08" data-state="NOT RUN"><summary><span class="c-id">ADV-08</span><span class="c-title">Independently challenge the best-cost envelope</span><span class="c-pri"><span class="lbl">Priority </span>GATE</span><span class="c-prof"><span class="lbl">Profile </span>P04</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>2026-10-08 18:3x UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Publish the non-sensitive model and negative results; commission an unaffiliated second hardware reviewer.</p><h4>Steps</h4><ol><li>Reward cheaper valid designs and reproduced shortcuts, not confirmation of the preferred number.</li><li>Re-run P04 with the strongest submitted feasible design, including a low-cost funded-development case.</li><li>Record unresolved modelling disagreements and future technology exclusions.</li></ol><h4>Accept</h4><p>Both reviews accept the scoped envelope or all material disagreements are resolved transparently. Passing supports only evaluated designs and conditions, never a universal bound on all future silicon.</p><h4>Evidence the case requires</h4><p>Two review reports; challenge log; final envelope; unresolved-limit statement.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Independent challenge/review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>adversary lane (a1a9876a88f5a72fc)</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>29</dd></div><div><dt>Plan pages</dt><dd>8, 10, 12, 22, 23</dd></div></dl></div></details></div></div></section><section class="section acc-suite" id="suite-ROT"><div class="container"><div class="acc-suite-head"><div class="acc-suite-code"><span class="n">05</span>ROT</div><div class="acc-suite-t"><h2>Epochs, seeds and memory transitions</h2><p class="acc-sub">Transitions must agree across nodes and remain usable during failures; crossing a boundary is not a chip-retirement test.</p></div><div class="acc-suite-st"><span class="acc-chip s-running" data-state="RUNNING">RUNNING</span></div></div><dl class="acc-facts"><div><dt>Owner</dt><dd>Consensus + GPU leads</dd></div><div><dt>Gate</dt><dd>G5 / G2 <span class="acc-gl"><a href="#gate-G5">G5</a> <a href="#gate-G2">G2</a></span></dd></div><div><dt>Fixtures</dt><dd>F0 activation rules; F4 fault network; F5 historical and boundary vectors</dd></div><div><dt>Plan pages</dt><dd>7, 11, 19, 21</dd></div></dl><div class="acc-suite-bar"><div class="acc-bar" role="img" aria-label="ROT: 8 cases: 0 passed under the standard, 6 running with team evidence, 2 not run, 0 deferred"><span class="seg g-running" style="flex-grow:6" title="6 RUNNING"></span><span class="seg g-notrun" style="flex-grow:2" title="2 NOT RUN"></span></div><span>8 cases: 0 passed under the standard, 6 running with team evidence, 2 not run, 0 deferred</span></div><div class="acc-cases"><div class="acc-cases-h" aria-hidden="true"><span>Case</span><span>Title</span><span>Priority</span><span>Profile</span><span>Status</span><span>Evidence</span><span>Last run</span><span></span></div><details class="acc-case" id="case-ROT-01" data-case="ROT-01" data-state="RUNNING"><summary><span class="c-id">ROT-01</span><span class="c-title">Agree across every hourly boundary</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P01, P08</span><span class="c-st"><span class="acc-chip s-running" data-state="RUNNING">RUNNING</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>2026-10-08 18:3x UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Use real nodes, CPU/GPU miners and independent clocks around successive program boundaries.</p><h4>Steps</h4><ol><li>Submit valid work immediately before, at and after the activation boundary under clock skew and delayed delivery.</li><li>Restart nodes from both sides and replay the same headers.</li><li>Compare selected seed, program, validity, rewards and local wall-clock dependence.</li></ol><h4>Accept</h4><p>All honest nodes derive identical consensus outcomes from the frozen rule. Late work is handled exactly as specified; no wall-clock ambiguity or cross-backend split occurs.</p><h4>Evidence the case requires</h4><p>Boundary vectors; node/miner traces; acceptance and reward matrix.</p></blockquote><h4>Evidence record of the run</h4><dl class="acc-meta acc-rec"><div><dt>What was run</dt><dd>the fast-time crossings PASS on 4cdcc488 (17:29:58) and 617cb441 (17:30:44) with the cold restart</dd></div><div><dt>Run by</dt><dd>fast-time lane (a8be71a0db962911c)</dd></div><div><dt>Under the standard</dt><dd>no: team-run before the standard's procedure; the status is RUNNING until the case is re-run under its steps with the profile's numbers and an independent run where the profile asks one</dd></div><div><dt>Pass or fail today</dt><dd>not judged under the standard yet</dd></div></dl><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>fast-time lane (a8be71a0db962911c)</dd></div><div><dt>Run</dt><dd>team-2026-10-08</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>30</dd></div><div><dt>Plan pages</dt><dd>7, 11, 19, 21</dd></div></dl></div></details><details class="acc-case" id="case-ROT-02" data-case="ROT-02" data-state="RUNNING"><summary><span class="c-id">ROT-02</span><span class="c-title">Cross weekly and family boundaries together</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P01, P03, P08</span><span class="c-st"><span class="acc-chip s-running" data-state="RUNNING">RUNNING</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>2026-10-08 18:3x UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Use the retained schedule in F0, including coincident program, parameter and family changes.</p><h4>Steps</h4><ol><li>Run every known family transition and all coincident-boundary combinations on production code.</li><li>Interrupt downloads, compilation and restart during activation; include mixed old/new clients.</li><li>Repeat selected cases under real elapsed time and the remainder under disclosed accelerated time.</li></ol><h4>Accept</h4><p>Deterministic activation, documented old-client behaviour and no unsafe fallback. Compilation/setup costs satisfy P03; accelerated runs are not reported as years of operating history.</p><h4>Evidence the case requires</h4><p>Transition matrix; code-path evidence; compile timing; old-client logs.</p></blockquote><h4>Evidence record of the run</h4><dl class="acc-meta acc-rec"><div><dt>What was run</dt><dd>the class v6 object crossing at its floor on 617cb441</dd></div><div><dt>Run by</dt><dd>fast-time lane (a8be71a0db962911c)</dd></div><div><dt>Under the standard</dt><dd>no: team-run before the standard's procedure; the status is RUNNING until the case is re-run under its steps with the profile's numbers and an independent run where the profile asks one</dd></div><div><dt>Pass or fail today</dt><dd>not judged under the standard yet</dd></div></dl><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>fast-time lane (a8be71a0db962911c)</dd></div><div><dt>Run</dt><dd>team-2026-10-08</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>30</dd></div><div><dt>Plan pages</dt><dd>7, 11, 19, 21</dd></div></dl></div></details><details class="acc-case" id="case-ROT-03" data-case="ROT-03" data-state="RUNNING"><summary><span class="c-id">ROT-03</span><span class="c-title">Test miner-voted bring-forward governance</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P00, P01, P08</span><span class="c-st"><span class="acc-chip s-running" data-state="RUNNING">RUNNING</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>2026-10-08 18:3x UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Freeze eligibility, threshold, windows and activation semantics before testing; do not invent a no-veto rule.</p><h4>Steps</h4><ol><li>Attempt threshold-minus-one, threshold, conflicting proposals, duplicate votes and coalition withholding.</li><li>Partition voters, restore them and test vote-key substitution through pools.</li><li>Verify adoption and refusal behaviour of already running nodes.</li></ol><h4>Accept</h4><p>The actual mechanism enforces F0, with authenticated voting and no conflicting activation. Any coalition capable of blocking or manipulating changes is disclosed; labels such as no veto do not override arithmetic.</p><h4>Evidence the case requires</h4><p>Executable governance model; signed-vote corpus; coalition/partition results.</p></blockquote><h4>Evidence record of the run</h4><dl class="acc-meta acc-rec"><div><dt>What was run</dt><dd>the bring-forward mechanism specified in the D5 block</dd></div><div><dt>Run by</dt><dd>node lane (a283f5f0d364ceef0)</dd></div><div><dt>Under the standard</dt><dd>no: team-run before the standard's procedure; the status is RUNNING until the case is re-run under its steps with the profile's numbers and an independent run where the profile asks one</dd></div><div><dt>Pass or fail today</dt><dd>not judged under the standard yet</dd></div></dl><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>node lane (a283f5f0d364ceef0)</dd></div><div><dt>Run</dt><dd>team-2026-10-08</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>30</dd></div><div><dt>Plan pages</dt><dd>7, 11, 19, 21</dd></div></dl></div></details><details class="acc-case" id="case-ROT-04" data-case="ROT-04" data-state="NOT RUN"><summary><span class="c-id">ROT-04</span><span class="c-title">Resist seed selection and faster evaluators</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P00, P01, P08</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:22 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Provide the specified seed pipeline and delay proof implementation plus independently parameterised fast-adversary models.</p><h4>Steps</h4><ol><li>Try withholding candidate seeds, grinding alternatives, replaying delay proofs and biased checkpoint selection.</li><li>Vary adversarial speed advantage and outage duration; trace influence on program choice.</li><li>Validate inputs, parameters and proofs against independent vectors.</li></ol><h4>Accept</h4><p>No invalid seed or proof is accepted; selection advantage stays within the approved threat-model bound. Missing bounds block this gate. A delay mechanism is not credited as generic ASIC resistance.</p><h4>Evidence the case requires</h4><p>Seed/grinding simulations; speed sensitivity; proof vectors; threat-model signoff.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>node lane (a283f5f0d364ceef0)</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>31</dd></div><div><dt>Plan pages</dt><dd>7, 11, 19, 21</dd></div></dl></div></details><details class="acc-case" id="case-ROT-05" data-case="ROT-05" data-state="RUNNING"><summary><span class="c-id">ROT-05</span><span class="c-title">Continue or pause correctly when finality stops</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P01, P08</span><span class="c-st"><span class="acc-chip s-running" data-state="RUNNING">RUNNING</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:32 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Stop checkpoint signing while mining continues, then cross seed and family boundaries.</p><h4>Steps</h4><ol><li>Remove the required signing weight and observe the documented fallback or safe pause.</li><li>Prevent access to any founder seed service; restart from persisted state.</li><li>Restore the stated fault assumptions and verify deterministic recovery.</li></ol><h4>Accept</h4><p>Mining/seed behaviour matches F0 without manufacturing certificates or reinterpreting finality. Safety holds during the outage; liveness is required only after its stated assumptions return.</p><h4>Evidence the case requires</h4><p>Fault timeline; seed/certificate history; node-state comparison; recovery log.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>finality lane (aca0f5ed924a2a99b)</dd></div><div><dt>Run</dt><dd>201-7cfa422a-aa0e0f45</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>31</dd></div><div><dt>Plan pages</dt><dd>7, 11, 19, 21</dd></div></dl></div></details><details class="acc-case" id="case-ROT-06" data-case="ROT-06" data-state="RUNNING"><summary><span class="c-id">ROT-06</span><span class="c-title">Activate datasets without hidden exclusions</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P01, P06</span><span class="c-st"><span class="acc-chip s-running" data-state="RUNNING">RUNNING</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:32 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Freeze memory sizes, support horizon and sync/update procedure; test all advertised roles.</p><h4>Steps</h4><ol><li>Construct the next dataset while current work remains active; test slow disks, low free memory and interruption.</li><li>Try stale-state/dataset submissions and maliciously expensive state growth where coupling exists.</li><li>Measure data transfer, restart and excluded-card costs before approving progression.</li></ol><h4>Accept</h4><p>No invalid stale work is accepted, no supported card silently fails, and P06 is met. Hardware retirement and sync burden are included in the economic decision, not treated as automatic chip protection.</p><h4>Evidence the case requires</h4><p>Dataset hashes; memory/update traces; stale-work tests; exclusion decision.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>hash lane (a690540514aa453d7)</dd></div><div><dt>Run</dt><dd>201-7cfa422a-aa0e0f45</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>31</dd></div><div><dt>Plan pages</dt><dd>7, 11, 19, 21</dd></div></dl></div></details><details class="acc-case" id="case-ROT-07" data-case="ROT-07" data-state="RUNNING"><summary><span class="c-id">ROT-07</span><span class="c-title">Ablate redundant rotation layers</span><span class="c-pri"><span class="lbl">Priority </span>GATE</span><span class="c-prof"><span class="lbl">Profile </span>P03, P04</span><span class="c-st"><span class="acc-chip s-running" data-state="RUNNING">RUNNING</span></span><span class="c-ev"><span class="lbl">Evidence </span><a href="https://git.igneum.network/igneum-network/igneum/src/branch/master/docs/analysis/class-v6/family-gate.md" rel="noopener">record</a></span><span class="c-run"><span class="lbl">Last run </span>2026-10-08 18:3x UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Use matched baseline and ablated variants in the lab; do not change a running public network.</p><h4>Steps</h4><ol><li>Remove each weekly/family component independently and measure adversarial cost, GPU setup and verifier complexity.</li><li>Include favourable-period specialists and all retained known families.</li><li>Keep a layer only with a distinct, independently supported benefit or a documented non-resistance purpose.</li></ol><h4>Accept</h4><p>Every retained layer has explicit justification and full boundary coverage. Redundant complexity is removed or its rationale recorded; the security model does not double-count the same versatility cost.</p><h4>Evidence the case requires</h4><p>Ablation report; decision log; complexity/cost comparison.</p></blockquote><h4>Evidence record of the run</h4><dl class="acc-meta acc-rec"><div><dt>What was run</dt><dd>the family gate's coverage (38,000 eras) and the rotation prototype paused as the no-rescue control</dd></div><div><dt>Run by</dt><dd>lane D family gate (a07a99a3788566af2)</dd></div><div><dt>Under the standard</dt><dd>no: team-run before the standard's procedure; the status is RUNNING until the case is re-run under its steps with the profile's numbers and an independent run where the profile asks one</dd></div><div><dt>Pass or fail today</dt><dd>not judged under the standard yet</dd></div></dl><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>lane D family gate (a07a99a3788566af2)</dd></div><div><dt>Run</dt><dd>team-2026-10-08</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>32</dd></div><div><dt>Plan pages</dt><dd>7, 11, 19, 21</dd></div></dl></div></details><details class="acc-case" id="case-ROT-08" data-case="ROT-08" data-state="NOT RUN"><summary><span class="c-id">ROT-08</span><span class="c-title">Pass the no-new-rules counterfactual</span><span class="c-pri"><span class="lbl">Priority </span>GATE</span><span class="c-prof"><span class="lbl">Profile </span>P04, P12</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:22 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Freeze the complete published rule bank and known schedule for the five-year evaluation.</p><h4>Steps</h4><ol><li>Allow a programmable adversary to know and survive all planned changes.</li><li>Remove assumed future emergency instructions and manual retirement actions from the model.</li><li>Run the required ECO scenarios and link them to independent network-transition tests.</li></ol><h4>Accept</h4><p>Competitiveness survives the approved envelope without future rescue assumptions. Any result that needs unannounced changes fails this claim; ordinary bug maintenance is distinguished from anti-chip intervention.</p><h4>Evidence the case requires</h4><p>Frozen-rule model; scenario results; excluded-rescue audit; G5 evidence.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>node lane (a283f5f0d364ceef0)</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>32</dd></div><div><dt>Plan pages</dt><dd>7, 11, 19, 21</dd></div></dl></div></details></div></div></section><section class="section acc-suite" id="suite-ECO"><div class="container"><div class="acc-suite-head"><div class="acc-suite-code"><span class="n">06</span>ECO</div><div class="acc-suite-t"><h2>Five-year coexistence economics</h2><p class="acc-sub">Test the world after specialised hardware exists, including new entrants and an already-funded competitor.</p></div><div class="acc-suite-st"><span class="acc-chip s-fail" data-state="FAIL">FAIL</span></div></div><dl class="acc-facts"><div><dt>Owner</dt><dd>Economics lead + independent reviewer</dd></div><div><dt>Gate</dt><dd>G4 <span class="acc-gl"><a href="#gate-G4">G4</a></span></dd></div><div><dt>Fixtures</dt><dd>F6 adversarial costs; F7 scenario model; F2 operator costs</dd></div><div><dt>Plan pages</dt><dd>8, 13, 18, 24, 26</dd></div></dl><div class="acc-suite-bar"><div class="acc-bar" role="img" aria-label="ECO: 8 cases: 0 passed under the standard, 7 running with team evidence, 1 failed, 0 not run, 0 deferred"><span class="seg g-fail" style="flex-grow:1" title="1 FAIL"></span><span class="seg g-running" style="flex-grow:7" title="7 RUNNING"></span></div><span>8 cases: 0 passed under the standard, 7 running with team evidence, 1 failed, 0 not run, 0 deferred</span></div><div class="acc-cases"><div class="acc-cases-h" aria-hidden="true"><span>Case</span><span>Title</span><span>Priority</span><span>Profile</span><span>Status</span><span>Evidence</span><span>Last run</span><span></span></div><details class="acc-case" id="case-ECO-01" data-case="ECO-01" data-state="RUNNING"><summary><span class="c-id">ECO-01</span><span class="c-title">Reconcile complete cost per accepted work</span><span class="c-pri"><span class="lbl">Priority </span>GATE</span><span class="c-prof"><span class="lbl">Profile </span>P12</span><span class="c-st"><span class="acc-chip s-running" data-state="RUNNING">RUNNING</span></span><span class="c-ev"><span class="lbl">Evidence </span><a href="https://git.igneum.network/igneum-network/igneum/src/branch/master/sim/economy/coexist/README.md" rel="noopener">record</a></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:55 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Use benchmark outputs, current-source cost inputs recorded at execution time and separate reference scenarios.</p><h4>Steps</h4><ol><li>Calculate hardware annualisation, electricity, host, cooling/hosting, failures, fees, downtime and residual value.</li><li>Use actual accepted work and independently verify units and period conversions.</li><li>Cross-check formulas using hand-worked fixtures, edge cases and a second implementation.</li></ol><h4>Accept</h4><p>All material costs and rejected-work effects appear once; model totals reconcile to raw inputs. No GPU upgrade is free, development cost is not double-counted, and burn is not mislabelled operator income.</p><h4>Evidence the case requires</h4><p>Versioned model; unit fixtures; independent reconciliation; input sources.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>research lane (ad6a2bd47d4a46105)</dd></div><div><dt>Run</dt><dd>eco05-20261008-01b</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>33</dd></div><div><dt>Plan pages</dt><dd>8, 13, 18, 24, 26</dd></div></dl></div></details><details class="acc-case" id="case-ECO-02" data-case="ECO-02" data-state="RUNNING"><summary><span class="c-id">ECO-02</span><span class="c-title">Separate existing-owner and new-entrant viability</span><span class="c-pri"><span class="lbl">Priority </span>GATE</span><span class="c-prof"><span class="lbl">Profile </span>P12</span><span class="c-st"><span class="acc-chip s-running" data-state="RUNNING">RUNNING</span></span><span class="c-ev"><span class="lbl">Evidence </span><a href="https://git.igneum.network/igneum-network/igneum/src/branch/master/docs/analysis/class-v6/coexistence-model.md" rel="noopener">record</a></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:55 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Use both installed hardware and purchasable replacement hardware in every mandatory cohort.</p><h4>Steps</h4><ol><li>Evaluate marginal operation separately from recovery of a new purchase.</li><li>Stress resale at zero, hardware failures, financing and replacement cycles.</li><li>Report break-even power price and total cost relative to the strongest feasible specialist.</li></ol><h4>Accept</h4><p>P12 competitiveness conditions hold for the predeclared cohorts in required sustainable worlds. Existing-owner profitability cannot substitute for viable new entry; cards outside the envelope remain visible.</p><h4>Evidence the case requires</h4><p>Owner/entrant curves; price-date records; break-even tables; cohort outcomes.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>research lane (ad6a2bd47d4a46105)</dd></div><div><dt>Run</dt><dd>eco-d4-20261008-01</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>33</dd></div><div><dt>Plan pages</dt><dd>8, 13, 18, 24, 26</dd></div></dl></div></details><details class="acc-case" id="case-ECO-03" data-case="ECO-03" data-state="RUNNING"><summary><span class="c-id">ECO-03</span><span class="c-title">Let the specialist keep its sunk development</span><span class="c-pri"><span class="lbl">Priority </span>GATE</span><span class="c-prof"><span class="lbl">Profile </span>P12</span><span class="c-st"><span class="acc-chip s-running" data-state="RUNNING">RUNNING</span></span><span class="c-ev"><span class="lbl">Evidence </span><a href="https://git.igneum.network/igneum-network/igneum/src/branch/master/docs/analysis/class-v6/coexistence-model.md" rel="noopener">record</a></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:55 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Use three development cases: fully funded elsewhere, source-range low and source-range high.</p><h4>Steps</h4><ol><li>Evaluate private mining, public hardware sales and a hybrid business model.</li><li>Allow shared IP, incremental revisions, multi-year survival and resale where justified.</li><li>Re-evaluate GPU entry after the specialist fleet is already installed.</li></ol><h4>Accept</h4><p>The coexistence claim does not depend on recovering the original chip research bill. Required P12 cases meet the approved envelope even at zero incremental development cost; failures cannot be hidden by the $23M/$340M source thresholds.</p><h4>Evidence the case requires</h4><p>Business-model variants; sunk-cost case; full cash-flow and adaptation records.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>research lane (ad6a2bd47d4a46105)</dd></div><div><dt>Run</dt><dd>eco-d4-20261008-01</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>33</dd></div><div><dt>Plan pages</dt><dd>8, 13, 18, 24, 26</dd></div></dl></div></details><details class="acc-case" id="case-ECO-04" data-case="ECO-04" data-state="RUNNING"><summary><span class="c-id">ECO-04</span><span class="c-title">Model entry, exit and difficulty response</span><span class="c-pri"><span class="lbl">Priority </span>GATE</span><span class="c-prof"><span class="lbl">Profile </span>P12</span><span class="c-st"><span class="acc-chip s-running" data-state="RUNNING">RUNNING</span></span><span class="c-ev"><span class="lbl">Evidence </span><a href="https://git.igneum.network/igneum-network/igneum/src/branch/master/docs/analysis/class-v6/coexistence-model.md" rel="noopener">record</a></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:55 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Use independently reviewed dynamic operator policies, not fixed market shares.</p><h4>Steps</h4><ol><li>Let agents buy, sell, switch off, re-enter and choose tasks based on declared costs and expected income.</li><li>Apply the actual difficulty/reward rules and test optimistic and adversarial liquidity/capital availability.</li><li>Compare equilibrium and transient outcomes across independent starting conditions.</li></ol><h4>Accept</h4><p>Mandatory worlds satisfy P12 without an imposed GPU share or artificial specialist capacity limit. Concentration, oscillations and excluded regions are reported; model behaviour matches unit and conservation checks.</p><h4>Evidence the case requires</h4><p>Agent policies; sensitivity seeds; market-share paths; independent model review.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>research lane (ad6a2bd47d4a46105)</dd></div><div><dt>Run</dt><dd>eco-d4-20261008-01</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>34</dd></div><div><dt>Plan pages</dt><dd>8, 13, 18, 24, 26</dd></div></dl></div></details><details class="acc-case" id="case-ECO-05" data-case="ECO-05" data-state="FAIL"><summary><span class="c-id">ECO-05</span><span class="c-title">Stress success, contraction and cheap electricity</span><span class="c-pri"><span class="lbl">Priority </span>GATE</span><span class="c-prof"><span class="lbl">Profile </span>P12</span><span class="c-st"><span class="acc-chip s-fail" data-state="FAIL">FAIL</span></span><span class="c-ev"><span class="lbl">Evidence </span><a href="https://git.igneum.network/igneum-network/igneum/src/branch/master/docs/analysis/class-v6/eco-05-results.md" rel="noopener">record</a></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:55 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Freeze mandatory scenarios before results: revenue bands, tariff range, lifetimes and demand states.</p><h4>Steps</h4><ol><li>Run the P12 factorial grid plus adversarial combinations selected by the independent reviewer.</li><li>Test a large successful network as well as weak-revenue and heterogeneous-tariff cases.</li><li>Distinguish feasible sustained-entry worlds from collapse scenarios with no rational profitable operator.</li></ol><h4>Accept</h4><p>No small-network or token-appreciation assumption props up the primary claim. Required viable worlds pass the envelope; collapse worlds show honest contraction and safety, not fabricated profits. Failure regions are explicit.</p><h4>Evidence the case requires</h4><p>Scenario register; full result cube; boundary plots; failed-world explanations.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>research lane (ad6a2bd47d4a46105)</dd></div><div><dt>Run</dt><dd>eco05-20261008-01b</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>34</dd></div><div><dt>Plan pages</dt><dd>8, 13, 18, 24, 26</dd></div></dl></div></details><details class="acc-case" id="case-ECO-06" data-case="ECO-06" data-state="RUNNING"><summary><span class="c-id">ECO-06</span><span class="c-title">Fund security and proving as issuance falls</span><span class="c-pri"><span class="lbl">Priority </span>GATE</span><span class="c-prof"><span class="lbl">Profile </span>P12</span><span class="c-st"><span class="acc-chip s-running" data-state="RUNNING">RUNNING</span></span><span class="c-ev"><span class="lbl">Evidence </span><a href="https://git.igneum.network/igneum-network/igneum/src/branch/master/docs/analysis/class-v6/coexistence-model.md" rel="noopener">record</a></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:55 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Use the frozen supply, halving, fee, burn and reward rules rather than source prose assumptions.</p><h4>Steps</h4><ol><li>Reconcile revenue reaching miners, internal provers, developers and burns over the full horizon.</li><li>Test flat/declining fees and no external proving income; separately introduce external demand.</li><li>Calculate capacity and security-provider coverage after each reward transition.</li></ol><h4>Accept</h4><p>Recurring compensation is explicit and internally consistent; mandatory sustainable scenarios meet P12. Burned amounts are never counted as payments, and external operator income is not assumed to fund internal work automatically.</p><h4>Evidence the case requires</h4><p>Issuance/fee ledger; scenario cash flows; funding-shortfall report.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>research lane (ad6a2bd47d4a46105)</dd></div><div><dt>Run</dt><dd>eco-d4-20261008-01</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>34</dd></div><div><dt>Plan pages</dt><dd>8, 13, 18, 24, 26</dd></div></dl></div></details><details class="acc-case" id="case-ECO-07" data-case="ECO-07" data-state="RUNNING"><summary><span class="c-id">ECO-07</span><span class="c-title">Price memory growth and honest-card displacement</span><span class="c-pri"><span class="lbl">Priority </span>GATE</span><span class="c-prof"><span class="lbl">Profile </span>P06, P12</span><span class="c-st"><span class="acc-chip s-running" data-state="RUNNING">RUNNING</span></span><span class="c-ev"><span class="lbl">Evidence </span><a href="https://git.igneum.network/igneum-network/igneum/src/branch/master/docs/analysis/class-v6/coexistence-model.md" rel="noopener">record</a></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:55 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Use GPU-05 and ROT-06 costs with the cheapest specialist adaptation.</p><h4>Steps</h4><ol><li>For each dataset increment, compare specialist cost increases with excluded cards and lost proving capacity.</li><li>Include ordinary-owner replacement, resale and reloading expenses.</li><li>Run alternate bounded schedules without assigning automatic chip death.</li></ol><h4>Accept</h4><p>The retained schedule meets P06/P12 and has an evidence-backed net competitiveness benefit. A schedule that mainly harms accessible GPUs fails; excluded tiers and mitigations are documented before activation.</p><h4>Evidence the case requires</h4><p>Per-step cost/retention table; alternative schedules; approval record.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>research lane (ad6a2bd47d4a46105)</dd></div><div><dt>Run</dt><dd>eco-d4-20261008-01</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>35</dd></div><div><dt>Plan pages</dt><dd>8, 13, 18, 24, 26</dd></div></dl></div></details><details class="acc-case" id="case-ECO-08" data-case="ECO-08" data-state="RUNNING"><summary><span class="c-id">ECO-08</span><span class="c-title">Reproduce and adversarially audit the model</span><span class="c-pri"><span class="lbl">Priority </span>GATE</span><span class="c-prof"><span class="lbl">Profile </span>P12</span><span class="c-st"><span class="acc-chip s-running" data-state="RUNNING">RUNNING</span></span><span class="c-ev"><span class="lbl">Evidence </span><a href="https://git.igneum.network/igneum-network/igneum/src/branch/master/sim/economy/coexist/README.md" rel="noopener">record</a></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:55 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Give an independent economist or qualified analyst the code, inputs and frozen success criteria.</p><h4>Steps</h4><ol><li>Recalculate required worlds and perturb favourable assumptions against the team.</li><li>Check dependence on discounts, utilisation, capital limits, artificial prices and future upgrades.</li><li>Publish the sensitivity range and state which conclusions are conditional.</li></ol><h4>Accept</h4><p>Material results reproduce, required scenarios pass and no unacknowledged assumption dominates the claim. The model supports a bounded coexistence conclusion, not a percentage probability that no chip will appear.</p><h4>Evidence the case requires</h4><p>Independent report; rerun outputs; model limitations; approved claim envelope.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Independent economic review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>research lane (ad6a2bd47d4a46105)</dd></div><div><dt>Run</dt><dd>eco05-20261008-01b</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>35</dd></div><div><dt>Plan pages</dt><dd>8, 13, 18, 24, 26</dd></div></dl></div></details></div></div></section><section class="section acc-suite" id="suite-EVM"><div class="container"><div class="acc-suite-head"><div class="acc-suite-code"><span class="n">07</span>EVM</div><div class="acc-suite-t"><h2>Execution and developer compatibility</h2><p class="acc-sub">Keep familiar applications while making every difference and metering rule explicit and reproducible.</p></div><div class="acc-suite-st"><span class="acc-chip s-running" data-state="RUNNING">RUNNING</span></div></div><dl class="acc-facts"><div><dt>Owner</dt><dd>Execution lead + independent implementer</dd></div><div><dt>Gate</dt><dd>Technical readiness</dd></div><div><dt>Fixtures</dt><dd>F0 execution-fork semantics; F5 transactions/contracts; F4 multi-node network</dd></div><div><dt>Plan pages</dt><dd>15, 25, 34, 35, 36, 37</dd></div></dl><div class="acc-suite-bar"><div class="acc-bar" role="img" aria-label="EVM: 8 cases: 0 passed under the standard, 7 running with team evidence, 1 not run, 0 deferred"><span class="seg g-running" style="flex-grow:7" title="7 RUNNING"></span><span class="seg g-notrun" style="flex-grow:1" title="1 NOT RUN"></span></div><span>8 cases: 0 passed under the standard, 7 running with team evidence, 1 not run, 0 deferred</span></div><div class="acc-cases"><div class="acc-cases-h" aria-hidden="true"><span>Case</span><span>Title</span><span>Priority</span><span>Profile</span><span>Status</span><span>Evidence</span><span>Last run</span><span></span></div><details class="acc-case" id="case-EVM-01" data-case="EVM-01" data-state="RUNNING"><summary><span class="c-id">EVM-01</span><span class="c-title">Match the selected EVM semantics</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P01, P09</span><span class="c-st"><span class="acc-chip s-running" data-state="RUNNING">RUNNING</span></span><span class="c-ev"><span class="lbl">Evidence </span><a href="https://git.igneum.network/igneum-network/igneum/src/branch/master/docs/build/compatibility.md" rel="noopener">record</a></span><span class="c-run"><span class="lbl">Last run </span>2026-10-08 18:3x UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Pin the intended execution fork, revm version and all Igneum deviations in F0.</p><h4>Steps</h4><ol><li>Run the applicable upstream execution/state fixtures plus independently written deviation tests.</li><li>Execute identical blocks on multiple nodes and compare roots, receipts, logs, gas and failure outcomes.</li><li>Minimise mismatches and distinguish intended differences from implementation defects.</li></ol><h4>Accept</h4><p>All applicable vectors match; every deviation has a documented test and developer consequence. No claim of universal Ethereum equivalence or Ethereum settlement security is inferred.</p><h4>Evidence the case requires</h4><p>Fixture/version inventory; root/receipt diffs; deviation matrix.</p></blockquote><h4>Evidence record of the run</h4><dl class="acc-meta acc-rec"><div><dt>What was run</dt><dd>/compatibility 20 of 20 rows PASSED on igneum-devnet-4</dd></div><div><dt>Run by</dt><dd>reference-apps lane (a2060899d2a27d31c)</dd></div><div><dt>Under the standard</dt><dd>no: team-run before the standard's procedure; the status is RUNNING until the case is re-run under its steps with the profile's numbers and an independent run where the profile asks one</dd></div><div><dt>Pass or fail today</dt><dd>not judged under the standard yet</dd></div></dl><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>reference-apps lane (a2060899d2a27d31c)</dd></div><div><dt>Run</dt><dd>team-2026-10-08</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>36</dd></div><div><dt>Plan pages</dt><dd>15, 25, 34, 35, 36, 37</dd></div></dl></div></details><details class="acc-case" id="case-EVM-02" data-case="EVM-02" data-state="RUNNING"><summary><span class="c-id">EVM-02</span><span class="c-title">Preserve transaction binding and replay protection</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P01</span><span class="c-st"><span class="acc-chip s-running" data-state="RUNNING">RUNNING</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:32 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Use signed transfers, contract calls and deployment transactions with boundary field values.</p><h4>Steps</h4><ol><li>Alter chain identity, nonce, signature, fee caps and recipient after signing.</li><li>Replay across nodes, forks and distinct test networks; resubmit around reorganisation.</li><li>Check mempool admission and final consensus execution independently.</li></ol><h4>Accept</h4><p>Unauthorised, wrong-network or duplicate spends are rejected according to F0. Valid replacements follow the declared rule; mempool filtering alone is not evidence of consensus enforcement.</p><h4>Evidence the case requires</h4><p>Signed corpus; admission/execution outcomes; account-state reconciliation.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>reference-apps lane (a2060899d2a27d31c)</dd></div><div><dt>Run</dt><dd>201-7cfa422a-aa0e0f45</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>36</dd></div><div><dt>Plan pages</dt><dd>15, 25, 34, 35, 36, 37</dd></div></dl></div></details><details class="acc-case" id="case-EVM-03" data-case="EVM-03" data-state="RUNNING"><summary><span class="c-id">EVM-03</span><span class="c-title">Test two-dimensional fees and proving limits</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P01, P09</span><span class="c-st"><span class="acc-chip s-running" data-state="RUNNING">RUNNING</span></span><span class="c-ev"><span class="lbl">Evidence </span><a href="https://git.igneum.network/igneum-network/igneum/src/branch/master/tools/reference-apps/compat/results.json" rel="noopener">record</a></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:13 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Freeze fee dimensions, estimator rules, abort behaviour and refund policy.</p><h4>Steps</h4><ol><li>Run workloads near and beyond execution and proving budgets, including state-heavy pathological cases.</li><li>Compare estimated fees with charged fees and validate rollback/receipt status on abort.</li><li>Mutate a block producer to omit or undercharge expensive work.</li></ol><h4>Accept</h4><p>Deterministic metering, charged amounts and aborted state agree across nodes and proofs. Resource bounds hold; fee estimates meet P09 for accepted supported cases. Undercharged invalid blocks cannot bypass consensus.</p><h4>Evidence the case requires</h4><p>Metering traces; fee fixtures; estimator errors; invalid-block rejection.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>reference-apps lane (a2060899d2a27d31c)</dd></div><div><dt>Run</dt><dd>ra-20261008T1744-evm</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>36</dd></div><div><dt>Plan pages</dt><dd>15, 25, 34, 35, 36, 37</dd></div></dl></div></details><details class="acc-case" id="case-EVM-04" data-case="EVM-04" data-state="RUNNING"><summary><span class="c-id">EVM-04</span><span class="c-title">Exercise block context and randomness assumptions</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P01, P09</span><span class="c-st"><span class="acc-chip s-running" data-state="RUNNING">RUNNING</span></span><span class="c-ev"><span class="lbl">Evidence </span><a href="https://git.igneum.network/igneum-network/igneum/src/branch/master/tools/reference-apps/compat/results.json" rel="noopener">record</a></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:13 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Use contracts sensitive to timestamp, height/context, randomness and ordering.</p><h4>Steps</h4><ol><li>Compare the declared Igneum semantics with developers' documented expectations.</li><li>Test boundary transitions, miner-influenced inputs and adversarial ordering in the isolated network.</li><li>Run dependency reviews for applications using these values for economic decisions.</li></ol><h4>Accept</h4><p>Semantics match F0 and differences are surfaced in compatibility documentation. No source of miner influence is marketed as unbiased randomness; incompatible applications are not included in the compatibility claim.</p><h4>Evidence the case requires</h4><p>Context-contract results; threat notes; compatibility exclusions.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>reference-apps lane (a2060899d2a27d31c)</dd></div><div><dt>Run</dt><dd>ra-20261008T1744-evm</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>37</dd></div><div><dt>Plan pages</dt><dd>15, 25, 34, 35, 36, 37</dd></div></dl></div></details><details class="acc-case" id="case-EVM-05" data-case="EVM-05" data-state="RUNNING"><summary><span class="c-id">EVM-05</span><span class="c-title">Run representative contract integration journeys</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P01, P09</span><span class="c-st"><span class="acc-chip s-running" data-state="RUNNING">RUNNING</span></span><span class="c-ev"><span class="lbl">Evidence </span><a href="https://git.igneum.network/igneum-network/igneum/src/branch/master/tools/reference-apps/compat/results.json" rel="noopener">record</a></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:13 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Use versioned transfer/token, NFT, multisignature, exchange and upgrade-pattern fixtures where supported.</p><h4>Steps</h4><ol><li>Deploy, initialise, transact, revert and upgrade each contract using ordinary tooling.</li><li>Exercise events, logs, balances, storage and call traces across node restart/reorganisation.</li><li>Compare expected application invariants with native execution and proved results.</li></ol><h4>Accept</h4><p>Supported journeys preserve their stated invariants; all deviations are documented. Example deployment success alone cannot stand in for application-level correctness or financial audit.</p><h4>Evidence the case requires</h4><p>Contract fixture hashes; transaction journeys; invariant and state comparisons.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>reference-apps lane (a2060899d2a27d31c)</dd></div><div><dt>Run</dt><dd>ra-20261008T1744-evm</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>37</dd></div><div><dt>Plan pages</dt><dd>15, 25, 34, 35, 36, 37</dd></div></dl></div></details><details class="acc-case" id="case-EVM-06" data-case="EVM-06" data-state="RUNNING"><summary><span class="c-id">EVM-06</span><span class="c-title">Validate wallets, RPC and indexers</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P01, P09</span><span class="c-st"><span class="acc-chip s-running" data-state="RUNNING">RUNNING</span></span><span class="c-ev"><span class="lbl">Evidence </span><a href="https://git.igneum.network/igneum-network/igneum/src/branch/master/tools/reference-apps/compat/results.json" rel="noopener">record</a></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:13 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Pin supported RPC methods and response semantics; use normal developer clients and an independent indexer.</p><h4>Steps</h4><ol><li>Test fee estimation, pending/final states, subscriptions, pagination and reconnects.</li><li>Reindex from genesis or the documented trust anchor after pruning and restart.</li><li>Compare logs, receipts and balances with independently validated chain state.</li></ol><h4>Accept</h4><p>No missing/duplicate canonical records; unsupported methods are explicit. UI states distinguish included, executed, proven and finalised. Malformed RPC input cannot crash validators or leak secrets.</p><h4>Evidence the case requires</h4><p>RPC conformance report; reindex comparison; reconnect/edge-case logs.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>reference-apps lane (a2060899d2a27d31c)</dd></div><div><dt>Run</dt><dd>ra-20261008T1744-evm</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>37</dd></div><div><dt>Plan pages</dt><dd>15, 25, 34, 35, 36, 37</dd></div></dl></div></details><details class="acc-case" id="case-EVM-07" data-case="EVM-07" data-state="NOT RUN"><summary><span class="c-id">EVM-07</span><span class="c-title">Handle execution denial-of-service workloads</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P01, P09</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:22 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Create bounded pathological bytecode, calls, state growth, storage and precompile inputs.</p><h4>Steps</h4><ol><li>Measure CPU, memory, disk and proving cost against charged budgets.</li><li>Saturate admission with invalid/expensive requests while valid workloads continue.</li><li>Restart mid-execution and verify atomic state recovery.</li></ol><h4>Accept</h4><p>P09 limits hold with no unbounded free work or divergent rollback. State remains consistent after crash; availability under overload follows the declared admission policy, not silent dropping of accepted transactions.</p><h4>Evidence the case requires</h4><p>Resource profiles; adversarial corpus; state recovery comparisons.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>reference-apps lane (a2060899d2a27d31c)</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>38</dd></div><div><dt>Plan pages</dt><dd>15, 25, 34, 35, 36, 37</dd></div></dl></div></details><details class="acc-case" id="case-EVM-08" data-case="EVM-08" data-state="RUNNING"><summary><span class="c-id">EVM-08</span><span class="c-title">Verify controlled execution and verifier upgrades</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P01, P08, P09</span><span class="c-st"><span class="acc-chip s-running" data-state="RUNNING">RUNNING</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:03 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Prepare two authorised versions and malicious, stale or unknown versions.</p><h4>Steps</h4><ol><li>Cross activation with mixed clients, queued transactions and proofs from both versions.</li><li>Bind each accepted proof to the correct execution semantics and program identity.</li><li>Exercise a failed software distribution without altering consensus activation.</li></ol><h4>Accept</h4><p>No unknown or wrong-version execution is accepted. Pre/post-boundary handling is deterministic and documented; software delivery cannot silently redefine transaction semantics or proof acceptance.</p><h4>Evidence the case requires</h4><p>Upgrade vectors; mixed-version traces; manifest/version bindings.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>enforced-proving lane (a6e8f84588b809d62)</dd></div><div><dt>Run</dt><dd>enforced-proving-20261008-01</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>38</dd></div><div><dt>Plan pages</dt><dd>15, 25, 34, 35, 36, 37</dd></div></dl></div></details></div></div></section><section class="section acc-suite" id="suite-ZKP"><div class="container"><div class="acc-suite-head"><div class="acc-suite-code"><span class="n">08</span>ZKP</div><div class="acc-suite-t"><h2>Consensus-enforced proof validity</h2><p class="acc-sub">The validator, not merely the official producer, must reject unauthorised or invalid proof records and rewards.</p></div><div class="acc-suite-st"><span class="acc-chip s-running" data-state="RUNNING">RUNNING</span></div></div><dl class="acc-facts"><div><dt>Owner</dt><dd>Proving + protocol leads; independent cryptography review</dd></div><div><dt>Gate</dt><dd>Technical readiness / G5 <span class="acc-gl"><a href="#gate-G5">G5</a></span></dd></div><div><dt>Fixtures</dt><dd>F0 pinned programs/verifiers; F5 valid and hostile proof corpus; unmodified validators</dd></div><div><dt>Plan pages</dt><dd>16, 20, 24, 25, 36, 37</dd></div></dl><div class="acc-suite-bar"><div class="acc-bar" role="img" aria-label="ZKP: 8 cases: 0 passed under the standard, 7 running with team evidence, 1 not run, 0 deferred"><span class="seg g-running" style="flex-grow:7" title="7 RUNNING"></span><span class="seg g-notrun" style="flex-grow:1" title="1 NOT RUN"></span></div><span>8 cases: 0 passed under the standard, 7 running with team evidence, 1 not run, 0 deferred</span></div><div class="acc-cases"><div class="acc-cases-h" aria-hidden="true"><span>Case</span><span>Title</span><span>Priority</span><span>Profile</span><span>Status</span><span>Evidence</span><span>Last run</span><span></span></div><details class="acc-case" id="case-ZKP-01" data-case="ZKP-01" data-state="RUNNING"><summary><span class="c-id">ZKP-01</span><span class="c-title">Reject missing and invalid proofs</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P01, P09</span><span class="c-st"><span class="acc-chip s-running" data-state="RUNNING">RUNNING</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:32 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Start from a native-correct statement and an independently verified valid proof.</p><h4>Steps</h4><ol><li>Submit the statement with no proof, truncated bytes, random bytes and targeted proof mutations using a modified producer.</li><li>Submit the genuine proof as a positive control through ordinary network paths.</li><li>Inspect block acceptance and resulting reward/state on unmodified validators.</li></ol><h4>Accept</h4><p>Every invalid proof record is rejected and earns no reward; valid controls succeed. A producer-side filter is not sufficient. Record rejection semantics exactly as defined by F0.</p><h4>Evidence the case requires</h4><p>Hostile record corpus; validator decisions; before/after balances; positive controls.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>enforced-proving lane (a6e8f84588b809d62)</dd></div><div><dt>Run</dt><dd>201-7cfa422a-aa0e0f45</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>39</dd></div><div><dt>Plan pages</dt><dd>16, 20, 24, 25, 36, 37</dd></div></dl></div></details><details class="acc-case" id="case-ZKP-02" data-case="ZKP-02" data-state="RUNNING"><summary><span class="c-id">ZKP-02</span><span class="c-title">Bind program, verifier and security parameters</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P01, P09</span><span class="c-st"><span class="acc-chip s-running" data-state="RUNNING">RUNNING</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:03 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Use valid proofs from authorised and unauthorised programs and parameter sets.</p><h4>Steps</h4><ol><li>Swap program digest, verifier version, security settings and verification key where applicable.</li><li>Attempt downgrade through configuration, serialized metadata or an old node path.</li><li>Test authorised boundary transitions and unsupported future identities.</li></ol><h4>Accept</h4><p>Only explicitly authorised combinations are accepted in the correct epoch. No implicit trust in producer-supplied metadata or lower-security fallback; all accepted settings have scoped soundness review.</p><h4>Evidence the case requires</h4><p>Identity/parameter matrix; rejection traces; cryptographic review.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>enforced-proving lane (a6e8f84588b809d62)</dd></div><div><dt>Run</dt><dd>enforced-proving-20261008-01</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>39</dd></div><div><dt>Plan pages</dt><dd>16, 20, 24, 25, 36, 37</dd></div></dl></div></details><details class="acc-case" id="case-ZKP-03" data-case="ZKP-03" data-state="RUNNING"><summary><span class="c-id">ZKP-03</span><span class="c-title">Bind network, epoch, job and state roots</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P01</span><span class="c-st"><span class="acc-chip s-running" data-state="RUNNING">RUNNING</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:32 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Prepare valid proofs for distinct chains, epochs, jobs and initial/final states.</p><h4>Steps</h4><ol><li>Replay each proof under another network, job, epoch, shard range or state commitment.</li><li>Alter public inputs while retaining the proof and test valid-but-wrong-context statements.</li><li>Check duplicated and reordered records across forks and replayed sync data.</li></ol><h4>Accept</h4><p>Every misbound proof is rejected; valid authorised replays follow only explicitly allowed semantics and never create extra rewards. Native reexecution cannot conceal missing proof-context binding.</p><h4>Evidence the case requires</h4><p>Binding matrix; public-input hashes; replay traces; reward reconciliation.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>enforced-proving lane (a6e8f84588b809d62)</dd></div><div><dt>Run</dt><dd>201-7cfa422a-aa0e0f45</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>39</dd></div><div><dt>Plan pages</dt><dd>16, 20, 24, 25, 36, 37</dd></div></dl></div></details><details class="acc-case" id="case-ZKP-04" data-case="ZKP-04" data-state="RUNNING"><summary><span class="c-id">ZKP-04</span><span class="c-title">Prevent reward and payout substitution</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P01</span><span class="c-st"><span class="acc-chip s-running" data-state="RUNNING">RUNNING</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:03 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Use proofs that commit to authorisation and all reward-relevant fields required by F0.</p><h4>Steps</h4><ol><li>Alter payout key, amount, beneficiary, source work or fee allocation independently.</li><li>Supply correct execution over malicious producer-provided consensus/reward inputs.</li><li>Compare consensus-derived rewards with the proved/publicly authenticated derivation.</li></ol><h4>Accept</h4><p>Unauthorised payout changes and incorrect consensus inputs are rejected; no statement accepted merely because execution over supplied inputs is internally correct. Legitimate authorisations are preserved.</p><h4>Evidence the case requires</h4><p>Mutation cases; reward derivation trace; signature/proof binding review.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>enforced-proving lane (a6e8f84588b809d62)</dd></div><div><dt>Run</dt><dd>enforced-proving-20261008-01</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>40</dd></div><div><dt>Plan pages</dt><dd>16, 20, 24, 25, 36, 37</dd></div></dl></div></details><details class="acc-case" id="case-ZKP-05" data-case="ZKP-05" data-state="RUNNING"><summary><span class="c-id">ZKP-05</span><span class="c-title">Make proof payment idempotent across races</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P01</span><span class="c-st"><span class="acc-chip s-running" data-state="RUNNING">RUNNING</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:03 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Use competing provers submitting valid results for the same work and simulate retries/reorganisations.</p><h4>Steps</h4><ol><li>Submit simultaneous duplicates, reordered receipts and repeated messages after disconnects.</li><li>Crash validators between validation and reward application, then recover.</li><li>Reconcile canonical payouts against the exact F0 duplicate policy.</li></ol><h4>Accept</h4><p>Only the authorised total payment is made; no double payout, lost accepted entitlement or fork-retained balance. Transactions and payout records recover atomically.</p><h4>Evidence the case requires</h4><p>Concurrency schedule; canonical payment ledger; crash/recovery evidence.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>enforced-proving lane (a6e8f84588b809d62)</dd></div><div><dt>Run</dt><dd>enforced-proving-20261008-01</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>40</dd></div><div><dt>Plan pages</dt><dd>16, 20, 24, 25, 36, 37</dd></div></dl></div></details><details class="acc-case" id="case-ZKP-06" data-case="ZKP-06" data-state="RUNNING"><summary><span class="c-id">ZKP-06</span><span class="c-title">Verify aggregation coverage and completeness</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P01, P09</span><span class="c-st"><span class="acc-chip s-running" data-state="RUNNING">RUNNING</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:32 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Build valid multi-shard workloads plus omitted, duplicated, overlapping and misordered shard sets.</p><h4>Steps</h4><ol><li>Attempt an aggregate with a correct outer proof but wrong coverage/public-input construction.</li><li>Alter shard ranges, roots and aggregation-program identity.</li><li>Verify native execution, aggregate validity and coverage commitments independently.</li></ol><h4>Accept</h4><p>Only complete, correctly ordered authorised coverage is accepted. No valid proof of the wrong computation becomes an accepted chain result; aggregation failures do not fabricate successful delivery.</p><h4>Evidence the case requires</h4><p>Coverage corpus; aggregate/public-input verification; rejection ledger.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>enforced-proving lane (a6e8f84588b809d62)</dd></div><div><dt>Run</dt><dd>201-7cfa422a-aa0e0f45</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>40</dd></div><div><dt>Plan pages</dt><dd>16, 20, 24, 25, 36, 37</dd></div></dl></div></details><details class="acc-case" id="case-ZKP-07" data-case="ZKP-07" data-state="NOT RUN"><summary><span class="c-id">ZKP-07</span><span class="c-title">Review soundness and verifier resource limits</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P01, P09</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>2026-10-08 18:3x UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Provide proof-system code, parameters, patches and the pinned verification path to an independent specialist.</p><h4>Steps</h4><ol><li>Review soundness assumptions, parameter margins and consequences of performance patches.</li><li>Fuzz deserialization and adversarial proofs; measure verification CPU and memory under load.</li><li>Cross-check an independent verifier or reference path and test crash containment.</li></ol><h4>Accept</h4><p>P09 review and resource requirements pass with no unresolved critical/high finding. Random proof rejection counts are not described as evidence of a particular cryptographic security level.</p><h4>Evidence the case requires</h4><p>Scoped soundness review; parameter sheet; fuzzer corpus; verifier profiles.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Independent cryptographic review + testing</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>enforced-proving lane (a6e8f84588b809d62)</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>41</dd></div><div><dt>Plan pages</dt><dd>16, 20, 24, 25, 36, 37</dd></div></dl></div></details><details class="acc-case" id="case-ZKP-08" data-case="ZKP-08" data-state="RUNNING"><summary><span class="c-id">ZKP-08</span><span class="c-title">Preserve authority and audit all acceptance paths</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P01, P07, P08</span><span class="c-st"><span class="acc-chip s-running" data-state="RUNNING">RUNNING</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:03 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Inspect block import, sync, RPC, light verification, database restoration and fast paths.</p><h4>Steps</h4><ol><li>Try bypassing validation via each path with a proof rejected by the normal path.</li><li>Remove the dominant prover/aggregator and have independent replacements process available inputs.</li><li>Attempt to use proof-production status as ordering, voting or finality authority.</li></ol><h4>Accept</h4><p>No bypass accepts invalid work; proofs alone confer no unauthorised consensus control. Replacement and pause behaviour meet F0/P07/P08 without privileged keys or a trusted aggregator shortcut.</p><h4>Evidence the case requires</h4><p>Path coverage report; bypass corpus; replacement run; authority checks.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>enforced-proving lane (a6e8f84588b809d62)</dd></div><div><dt>Run</dt><dd>enforced-proving-20261008-01</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>41</dd></div><div><dt>Plan pages</dt><dd>16, 20, 24, 25, 36, 37</dd></div></dl></div></details></div></div></section><section class="section acc-suite" id="suite-CAP"><div class="container"><div class="acc-suite-head"><div class="acc-suite-code"><span class="n">09</span>CAP</div><div class="acc-suite-t"><h2>Sustained proving and delivery</h2><p class="acc-sub">A correct fast shard is only one stage; capacity, latency, payment and retries must work together.</p></div><div class="acc-suite-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></div></div><dl class="acc-facts"><div><dt>Owner</dt><dd>Proving lead + independent operators</dd></div><div><dt>Gate</dt><dd>Technical readiness / commercial track</dd></div><div><dt>Fixtures</dt><dd>F3 meaningful workload catalogue; F4 network; F8 external job harness</dd></div><div><dt>Plan pages</dt><dd>17, 18, 24, 25</dd></div></dl><div class="acc-suite-bar"><div class="acc-bar" role="img" aria-label="CAP: 8 cases: 0 passed under the standard, 0 running with team evidence, 8 not run, 0 deferred"><span class="seg g-notrun" style="flex-grow:8" title="8 NOT RUN"></span></div><span>8 cases: 0 passed under the standard, 0 running with team evidence, 8 not run, 0 deferred</span></div><div class="acc-cases"><div class="acc-cases-h" aria-hidden="true"><span>Case</span><span>Title</span><span>Priority</span><span>Profile</span><span>Status</span><span>Evidence</span><span>Last run</span><span></span></div><details class="acc-case" id="case-CAP-01" data-case="CAP-01" data-state="NOT RUN"><summary><span class="c-id">CAP-01</span><span class="c-title">Reproduce the historical consumer-shard result</span><span class="c-pri"><span class="lbl">Priority </span>GATE</span><span class="c-prof"><span class="lbl">Profile </span>P02, P07</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:22 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Recover the exact source-era workload/build if available; keep it separate from the release-candidate workload.</p><h4>Steps</h4><ol><li>Attempt independent reproduction of the 4,717,439-cycle workload and reported 3060/4060/4070 results.</li><li>Record proof format, memory, energy, host and whether aggregation/compression are included.</li><li>Repeat on the final release and label all configuration changes.</li></ol><h4>Accept</h4><p>Historical figures are either reproduced within P02 tolerance or corrected/labelled non-reproduced. Release acceptance uses the current complete workload, never an unmatched historical time or a smaller substituted shard.</p><h4>Evidence the case requires</h4><p>Historical/current manifests; proof verification; timing and memory records.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>fleet lane (ac055d60427caab99)</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>42</dd></div><div><dt>Plan pages</dt><dd>17, 18, 24, 25</dd></div></dl></div></details><details class="acc-case" id="case-CAP-02" data-case="CAP-02" data-state="NOT RUN"><summary><span class="c-id">CAP-02</span><span class="c-title">Prove on the actual mining configuration</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P01, P06, P07</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:22 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Use final dataset sizes, registers, clocks, drivers and proof pipeline on every advertised proving tier.</p><h4>Steps</h4><ol><li>Run mining alone, proving alone, concurrent execution and supported time-sharing.</li><li>Measure wall energy, memory headroom, reloads, proof latency and forgone accepted mining work.</li><li>Induce memory pressure and GPU task failure without losing wallet control.</li></ol><h4>Accept</h4><p>Every advertised mode completes correctly and meets P06/P07. Net output includes opportunity cost; unsupported concurrency is not claimed. Mining-only vendor support remains separately labelled.</p><h4>Evidence the case requires</h4><p>Four-mode results; OOM/failure logs; memory and opportunity-cost ledger.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>fleet lane (ac055d60427caab99)</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>42</dd></div><div><dt>Plan pages</dt><dd>17, 18, 24, 25</dd></div></dl></div></details><details class="acc-case" id="case-CAP-03" data-case="CAP-03" data-state="NOT RUN"><summary><span class="c-id">CAP-03</span><span class="c-title">Measure the entire request-to-payment path</span><span class="c-pri"><span class="lbl">Priority </span>GATE</span><span class="c-prof"><span class="lbl">Profile </span>P07</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:22 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Assign a unique job ID and immutable timestamps to every stage of F3/F8 jobs.</p><h4>Steps</h4><ol><li>Record request, input availability, assignment, execution, shard proof, aggregation, verification, delivery and payment.</li><li>Compare monotonic elapsed time with any protocol/DAA clock and document their relationship.</li><li>Reconcile failed, censored, retried and abandoned jobs with the original request denominator.</li></ol><h4>Accept</h4><p>No hidden stage or missing job; latency distributions and cost cover the complete path. Delivery, finality and payment are reported separately; protocol seconds are not silently relabelled wall-clock seconds.</p><h4>Evidence the case requires</h4><p>Stage event ledger; clock calibration; end-to-end latency/cost report.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>fleet lane (ac055d60427caab99)</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>42</dd></div><div><dt>Plan pages</dt><dd>17, 18, 24, 25</dd></div></dl></div></details><details class="acc-case" id="case-CAP-04" data-case="CAP-04" data-state="NOT RUN"><summary><span class="c-id">CAP-04</span><span class="c-title">Sustain meaningful load without queue growth</span><span class="c-pri"><span class="lbl">Priority </span>GATE</span><span class="c-prof"><span class="lbl">Profile </span>P07</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:22 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Freeze W: payload mix, input sizes, execution work and per-hour demand; prohibit tiny-workload substitution.</p><h4>Steps</h4><ol><li>Run 72 hours at W and a separate 24 hours at 1.2W on the declared fleet.</li><li>Measure arrival/completion counts, backlog trend, oldest-job age, deadlines and all retries.</li><li>Use held-out workloads and an independent observer to detect discarded or delayed requests.</li></ol><h4>Accept</h4><p>P07 completion, tail-latency and bounded-backlog criteria hold. Capacity is stated for the tested W/fleet, not as universal TPS. A queue that grows indefinitely or shrinks through silent loss fails.</p><h4>Evidence the case requires</h4><p>Request/completion reconciliation; backlog series; held-out results; observer report.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>fleet lane (ac055d60427caab99)</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>43</dd></div><div><dt>Plan pages</dt><dd>17, 18, 24, 25</dd></div></dl></div></details><details class="acc-case" id="case-CAP-05" data-case="CAP-05" data-state="NOT RUN"><summary><span class="c-id">CAP-05</span><span class="c-title">Overload and recover without false acceptance</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P01, P07</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:22 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Start at W and inject 2W for 15 minutes with valid and invalid jobs, then return to W.</p><h4>Steps</h4><ol><li>Observe admission, explicit backpressure, reservations and deadline estimates.</li><li>Track accepted jobs to valid completion or the pre-agreed failure/refund outcome.</li><li>Measure recovery time and ensure ordinary users are not silently starved.</li></ol><h4>Accept</h4><p>P07 overload policy and recovery limits hold; no accepted job vanishes or earns an invalid reward. Rejected demand is reported separately from delivery success, preventing denominator manipulation.</p><h4>Evidence the case requires</h4><p>Overload timeline; admission/refund logs; backlog-drain proof.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>fleet lane (ac055d60427caab99)</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>43</dd></div><div><dt>Plan pages</dt><dd>17, 18, 24, 25</dd></div></dl></div></details><details class="acc-case" id="case-CAP-06" data-case="CAP-06" data-state="NOT RUN"><summary><span class="c-id">CAP-06</span><span class="c-title">Calibrate assignment windows to paid completion</span><span class="c-pri"><span class="lbl">Priority </span>GATE</span><span class="c-prof"><span class="lbl">Profile </span>P07, P12</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:22 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Use a heterogeneous proving fleet, including the slowest advertised consumer tier.</p><h4>Steps</h4><ol><li>Measure actual completion distributions with network delay, competing load and failed attempts.</li><li>Test the chosen exclusive window, open claiming and faster challengers after expiry.</li><li>Compare assignment frequency, paid completions and wasted work by tier.</li></ol><h4>Accept</h4><p>P07 fairness and wasted-work limits hold for advertised tiers. A provisional 10-DAA-second window is not treated as approved. Fair assignment counts alone cannot pass; payment outcomes and operator margins matter.</p><h4>Evidence the case requires</h4><p>Window sweep; paid-completion distribution; wasted-work and margin report.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>fleet lane (ac055d60427caab99)</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>43</dd></div><div><dt>Plan pages</dt><dd>17, 18, 24, 25</dd></div></dl></div></details><details class="acc-case" id="case-CAP-07" data-case="CAP-07" data-state="NOT RUN"><summary><span class="c-id">CAP-07</span><span class="c-title">Reassign work when inputs or providers disappear</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P01, P07, P08</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:22 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Remove input providers, assigned provers and the dominant aggregator independently and together.</p><h4>Steps</h4><ol><li>Have replacement operators retrieve authenticated inputs without founder files.</li><li>Retry expired assignments while preserving idempotent reward and customer outcomes.</li><li>Restore providers and test late submissions racing with replacements.</li></ol><h4>Accept</h4><p>P07/P08 replacement deadlines hold when availability assumptions permit. Otherwise a truthful bounded pause/refund occurs; no fake proof, double payment or hidden privileged input source is used.</p><h4>Evidence the case requires</h4><p>Failure schedule; input hashes; reassignment and payout ledger; recovery trace.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>fleet lane (ac055d60427caab99)</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>44</dd></div><div><dt>Plan pages</dt><dd>17, 18, 24, 25</dd></div></dl></div></details><details class="acc-case" id="case-CAP-08" data-case="CAP-08" data-state="NOT RUN"><summary><span class="c-id">CAP-08</span><span class="c-title">Deliver customer-verifiable output at scale</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P01, P07, P14</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:22 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Run the external workload using a customer-controlled verifier and independently operated workers.</p><h4>Steps</h4><ol><li>Verify every delivered proof against the contracted program and input commitment.</li><li>Reject wrong-format, stale and partial deliveries; test customer retry and delivery failure.</li><li>Reconcile delivery, acceptance, payment and refund records without exposing private inputs publicly.</li></ol><h4>Accept</h4><p>P07 delivery performance and exact validity hold. Payment depends on the contracted correct result; a valid proof for the wrong job is not a successful delivery.</p><h4>Evidence the case requires</h4><p>Customer verification log; proof-format contract; settlement reconciliation.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>fleet lane (ac055d60427caab99)</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>44</dd></div><div><dt>Plan pages</dt><dd>17, 18, 24, 25</dd></div></dl></div></details></div></div></section><section class="section acc-suite" id="suite-INC"><div class="container"><div class="acc-suite-head"><div class="acc-suite-code"><span class="n">10</span>INC</div><div class="acc-suite-t"><h2>Rewards, incentives and selfish operators</h2><p class="acc-sub">Assume operators optimise their own returns. Do not depend on the official client choosing a less profitable task.</p></div><div class="acc-suite-st"><span class="acc-chip s-running" data-state="RUNNING">RUNNING</span></div></div><dl class="acc-facts"><div><dt>Owner</dt><dd>Protocol economics + proving leads</dd></div><div><dt>Gate</dt><dd>G4 / G5 <span class="acc-gl"><a href="#gate-G4">G4</a> <a href="#gate-G5">G5</a></span></dd></div><div><dt>Fixtures</dt><dd>F0 fee/reward rules; F4 adversarial operators; F7 incentive models</dd></div><div><dt>Plan pages</dt><dd>13, 16, 17, 18, 24, 26</dd></div></dl><div class="acc-suite-bar"><div class="acc-bar" role="img" aria-label="INC: 8 cases: 0 passed under the standard, 5 running with team evidence, 3 not run, 0 deferred"><span class="seg g-running" style="flex-grow:5" title="5 RUNNING"></span><span class="seg g-notrun" style="flex-grow:3" title="3 NOT RUN"></span></div><span>8 cases: 0 passed under the standard, 5 running with team evidence, 3 not run, 0 deferred</span></div><div class="acc-cases"><div class="acc-cases-h" aria-hidden="true"><span>Case</span><span>Title</span><span>Priority</span><span>Profile</span><span>Status</span><span>Evidence</span><span>Last run</span><span></span></div><details class="acc-case" id="case-INC-01" data-case="INC-01" data-state="RUNNING"><summary><span class="c-id">INC-01</span><span class="c-title">Reconcile issuance, fees, burns and recipients</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P01, P12</span><span class="c-st"><span class="acc-chip s-running" data-state="RUNNING">RUNNING</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:32 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Use a deterministic short chain containing all reward types, fee paths and rounding cases.</p><h4>Steps</h4><ol><li>Calculate balances, total supply changes, burns and distributions independently.</li><li>Execute identical blocks natively and through the proving path.</li><li>Test zero, minimum, maximum and transition-boundary values plus malformed producer accounting.</li></ol><h4>Accept</h4><p>Conservation and recipient rules match F0 exactly; no inflation, rounding leakage or duplicate reward. Fee-table and prose discrepancies are resolved before the run, not guessed by the tester.</p><h4>Evidence the case requires</h4><p>Independent accounting ledger; balance/supply diffs; boundary vectors.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>enforced-proving lane (a6e8f84588b809d62)</dd></div><div><dt>Run</dt><dd>201-7cfa422a-aa0e0f45</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>45</dd></div><div><dt>Plan pages</dt><dd>13, 16, 17, 18, 24, 26</dd></div></dl></div></details><details class="acc-case" id="case-INC-02" data-case="INC-02" data-state="RUNNING"><summary><span class="c-id">INC-02</span><span class="c-title">Keep revenue streams and claims separate</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P01, P12, P14</span><span class="c-st"><span class="acc-chip s-running" data-state="RUNNING">RUNNING</span></span><span class="c-ev"><span class="lbl">Evidence </span><a href="https://git.igneum.network/igneum-network/igneum/src/branch/master/docs/analysis/class-v6/coexistence-model.md" rel="noopener">record</a></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:55 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Prepare jobs and blocks producing mining income, internal proof rewards and external payments.</p><h4>Steps</h4><ol><li>Trace money from source to operator, protocol, developer and any burn.</li><li>Compare node records, settlement records and Ember displays.</li><li>Attempt to classify testnet rewards, reimbursed purchases or token appreciation as external customer revenue.</li></ol><h4>Accept</h4><p>Every stream reconciles and is labelled correctly. No double-counted revenue or fabricated protocol demand; mining subsidy and external service income remain distinct in dashboards and ECO.</p><h4>Evidence the case requires</h4><p>Money-flow register; UI reconciliation; rejected classifications.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>research lane (ad6a2bd47d4a46105)</dd></div><div><dt>Run</dt><dd>eco-d4-20261008-01</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>45</dd></div><div><dt>Plan pages</dt><dd>13, 16, 17, 18, 24, 26</dd></div></dl></div></details><details class="acc-case" id="case-INC-03" data-case="INC-03" data-state="RUNNING"><summary><span class="c-id">INC-03</span><span class="c-title">Let a modified client choose the most profitable task</span><span class="c-pri"><span class="lbl">Priority </span>GATE</span><span class="c-prof"><span class="lbl">Profile </span>P07, P12</span><span class="c-st"><span class="acc-chip s-running" data-state="RUNNING">RUNNING</span></span><span class="c-ev"><span class="lbl">Evidence </span><a href="https://git.igneum.network/igneum-network/igneum/src/branch/master/docs/analysis/class-v6/coexistence-model.md" rel="noopener">record</a></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:55 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Permit independent schedulers to mine, prove internally, prove externally or switch off.</p><h4>Steps</h4><ol><li>Publish common costs and vary relative task rewards, memory pressure and switching costs.</li><li>Run clients that ignore the official scheduling recommendation.</li><li>Measure realised operator margin, internal capacity and network progress.</li></ol><h4>Accept</h4><p>Required P12 sustainable worlds maintain paid essential capacity without compelled altruism. Profitability and availability are based on realised outcomes, including switching and wasted work.</p><h4>Evidence the case requires</h4><p>Scheduler source/policies; switching traces; capacity and margin series.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>research lane (ad6a2bd47d4a46105)</dd></div><div><dt>Run</dt><dd>eco-d4-20261008-01</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>45</dd></div><div><dt>Plan pages</dt><dd>13, 16, 17, 18, 24, 26</dd></div></dl></div></details><details class="acc-case" id="case-INC-04" data-case="INC-04" data-state="RUNNING"><summary><span class="c-id">INC-04</span><span class="c-title">Survive external-demand spikes and token declines</span><span class="c-pri"><span class="lbl">Priority </span>GATE</span><span class="c-prof"><span class="lbl">Profile </span>P07, P08, P12</span><span class="c-st"><span class="acc-chip s-running" data-state="RUNNING">RUNNING</span></span><span class="c-ev"><span class="lbl">Evidence </span><a href="https://git.igneum.network/igneum-network/igneum/src/branch/master/docs/analysis/class-v6/coexistence-model.md" rel="noopener">record</a></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:55 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Use F7 scenarios with 10x external job offers and token-denominated mining-income shocks.</p><h4>Steps</h4><ol><li>Allow miners/provers to switch freely under the declared reward and difficulty rules.</li><li>Observe hash participation, proof backlog, fees and recovery without an administrator.</li><li>Repeat with external demand dropping to zero and with a dominant operator withdrawn.</li></ol><h4>Accept</h4><p>Mandatory viable worlds meet P07/P12; stressed nonviable worlds fail or pause safely with truthful status. No emergency rule, fabricated demand or unofficial subsidy is inserted to force a pass.</p><h4>Evidence the case requires</h4><p>Shock timeline; fee/hash/capacity paths; failure-region report.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>research lane (ad6a2bd47d4a46105)</dd></div><div><dt>Run</dt><dd>eco-d4-20261008-01</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>46</dd></div><div><dt>Plan pages</dt><dd>13, 16, 17, 18, 24, 26</dd></div></dl></div></details><details class="acc-case" id="case-INC-05" data-case="INC-05" data-state="NOT RUN"><summary><span class="c-id">INC-05</span><span class="c-title">Contain job reservation and identity-splitting abuse</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P01, P07, P09</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:22 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Freeze the actual assignment/payment mechanism; do not assume unimplemented collateral or identity controls.</p><h4>Steps</h4><ol><li>Create many worker identities, reserve jobs, withhold proofs and submit late results.</li><li>Attempt free option-taking, duplicate work rewards and displacement of honest assignments.</li><li>Price attacker costs and observe honest completion under the approved abuse load.</li></ol><h4>Accept</h4><p>F0 rules and P07 service limits hold under the declared adversary. Identity splitting does not create unauthorised rewards or control; any unmitigated starvation path blocks the permissionless-service claim.</p><h4>Evidence the case requires</h4><p>Attack clients; assignment trace; cost-to-disrupt analysis; honest-user outcomes.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>enforced-proving lane (a6e8f84588b809d62)</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>46</dd></div><div><dt>Plan pages</dt><dd>13, 16, 17, 18, 24, 26</dd></div></dl></div></details><details class="acc-case" id="case-INC-06" data-case="INC-06" data-state="NOT RUN"><summary><span class="c-id">INC-06</span><span class="c-title">Test difficulty and timestamp manipulation</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P01, P08, P12</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:22 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Use the actual adjustment algorithm and consensus timestamp rule with independent miners.</p><h4>Steps</h4><ol><li>Inject large hashrate arrivals/departures, periodic selective mining and boundary-timed bursts.</li><li>Try allowed and invalid timestamp skew, withheld blocks and replayed work.</li><li>Observe block intervals, reward allocation and recovery after hashrate stabilises.</li></ol><h4>Accept</h4><p>Invalid inputs are rejected; valid adversarial strategies remain within F0/P08 bounds and are priced in ECO. No unexplained reward amplification, permanent stall or conflicting accepted work.</p><h4>Evidence the case requires</h4><p>Difficulty trace; timestamp corpus; revenue analysis; independent rule review.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>research lane (ad6a2bd47d4a46105)</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>46</dd></div><div><dt>Plan pages</dt><dd>13, 16, 17, 18, 24, 26</dd></div></dl></div></details><details class="acc-case" id="case-INC-07" data-case="INC-07" data-state="NOT RUN"><summary><span class="c-id">INC-07</span><span class="c-title">Resist self-dealing fees and fake proving demand</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P01, P12, P14</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:22 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Use self-funded operators and related customer identities in the isolated economic model/network.</p><h4>Steps</h4><ol><li>Cycle funds through jobs, tips, developer shares and rebates to seek net reward extraction.</li><li>Attempt to inflate external-demand metrics without genuine unrelated customer expenditure.</li><li>Reconcile all counterparties and net cash contribution rather than gross transaction volume.</li></ol><h4>Accept</h4><p>No unauthorised subsidy extraction or metric inflation passes. Related-party volume is disclosed/excluded from P14; net external cash and legitimate protocol incentives are reported separately.</p><h4>Evidence the case requires</h4><p>Circular-flow tests; ownership/conflict review; net-cash reconciliation.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>enforced-proving lane (a6e8f84588b809d62)</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>47</dd></div><div><dt>Plan pages</dt><dd>13, 16, 17, 18, 24, 26</dd></div></dl></div></details><details class="acc-case" id="case-INC-08" data-case="INC-08" data-state="RUNNING"><summary><span class="c-id">INC-08</span><span class="c-title">Quantify provider and supplier failure concentration</span><span class="c-pri"><span class="lbl">Priority </span>GATE</span><span class="c-prof"><span class="lbl">Profile </span>P08, P11, P12</span><span class="c-st"><span class="acc-chip s-running" data-state="RUNNING">RUNNING</span></span><span class="c-ev"><span class="lbl">Evidence </span><a href="https://git.igneum.network/igneum-network/igneum/src/branch/master/docs/analysis/class-v6/coexistence-model.md" rel="noopener">record</a></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:55 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Model control of hashing, signing, proving, aggregation and hardware supply separately.</p><h4>Steps</h4><ol><li>Remove each largest operational dependency and combine correlated failures.</li><li>Measure replacement cost/time and whether essential roles share hidden ownership.</li><li>Compare results with the approved fault model and no-rescue exercise.</li></ol><h4>Accept</h4><p>No hidden single dependency defeats the claimed independence; within-tolerance withdrawals recover under P08/P11. Hardware supply concentration is disclosed without equating vendor sales to operator voting control.</p><h4>Evidence the case requires</h4><p>Role/ownership map; dependency removals; recovery and concentration report.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>research lane (ad6a2bd47d4a46105)</dd></div><div><dt>Run</dt><dd>eco-d4-20261008-01</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>47</dd></div><div><dt>Plan pages</dt><dd>13, 16, 17, 18, 24, 26</dd></div></dl></div></details></div></div></section><section class="section acc-suite" id="suite-FIN"><div class="container"><div class="acc-suite-head"><div class="acc-suite-code"><span class="n">11</span>FIN</div><div class="acc-suite-t"><h2>Consensus safety and recovery</h2><p class="acc-sub">Test safety under the stated fault bounds. Demand liveness only when synchrony and participation assumptions actually hold.</p></div><div class="acc-suite-st"><span class="acc-chip s-running" data-state="RUNNING">RUNNING</span></div></div><dl class="acc-facts"><div><dt>Owner</dt><dd>Consensus lead + independent formal/security review</dd></div><div><dt>Gate</dt><dd>G5 / technical readiness <span class="acc-gl"><a href="#gate-G5">G5</a></span></dd></div><div><dt>Fixtures</dt><dd>F0 exact fault model; F4 real-node partitions; F5 certificates and historical failures</dd></div><div><dt>Plan pages</dt><dd>19, 21, 24, 25</dd></div></dl><div class="acc-suite-bar"><div class="acc-bar" role="img" aria-label="FIN: 8 cases: 2 passed under the standard, 6 running with team evidence, 0 not run, 0 deferred"><span class="seg g-pass" style="flex-grow:2" title="2 PASS"></span><span class="seg g-running" style="flex-grow:6" title="6 RUNNING"></span></div><span>8 cases: 2 passed under the standard, 6 running with team evidence, 0 not run, 0 deferred</span></div><div class="acc-cases"><div class="acc-cases-h" aria-hidden="true"><span>Case</span><span>Title</span><span>Priority</span><span>Profile</span><span>Status</span><span>Evidence</span><span>Last run</span><span></span></div><details class="acc-case" id="case-FIN-01" data-case="FIN-01" data-state="RUNNING"><summary><span class="c-id">FIN-01</span><span class="c-title">Agree on ordering, work and executed state</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P01, P08</span><span class="c-st"><span class="acc-chip s-running" data-state="RUNNING">RUNNING</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:32 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Use real fork-choice/DAG handling and independent miners, not only a simplified simulator.</p><h4>Steps</h4><ol><li>Generate concurrent branches, delayed blocks, duplicates and invalid work with deterministic seeds.</li><li>Compare selected ordering, accumulated work, transaction execution and state roots after delivery converges.</li><li>Replay from independent checkpoints and from genesis where practical.</li></ol><h4>Accept</h4><p>Honest nodes converge under F0 assumptions with exact roots and rewards. No duplicated work accounting or undocumented ordering dependence; simulator-only success cannot substitute.</p><h4>Evidence the case requires</h4><p>Block/ordering corpus; root/work diffs; real-node replay logs.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>fast-time lane (a8be71a0db962911c)</dd></div><div><dt>Run</dt><dd>201-7cfa422a-aa0e0f45</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>48</dd></div><div><dt>Plan pages</dt><dd>19, 21, 24, 25</dd></div></dl></div></details><details class="acc-case" id="case-FIN-02" data-case="FIN-02" data-state="PASS"><summary><span class="c-id">FIN-02</span><span class="c-title">Attack finality with split honest populations</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P01, P08</span><span class="c-st"><span class="acc-chip s-pass" data-state="PASS">PASS</span></span><span class="c-ev"><span class="lbl">Evidence </span><a href="https://git.igneum.network/igneum-network/igneum/src/branch/master/sim/finality-attacks-results/v4-pause-fix.md" rel="noopener">record</a></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:43 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Use the source-discussed 40/40/20 weight split, plus threshold-boundary splits under F0.</p><h4>Steps</h4><ol><li>Let the 20% adversarial group sign conflicting histories while honest groups are partitioned.</li><li>Delay messages and eligibility updates independently; keep total historical weights auditable.</li><li>Try to form two certificates and reconnect nodes to observe accepted final history.</li></ol><h4>Accept</h4><p>No conflicting final certificates are accepted within the declared fault bound. A safe pause is valid when quorum is unavailable; making progress on both sides is not required.</p><h4>Evidence the case requires</h4><p>Signed votes; certificate attempts; voter-table snapshots; safety checker output.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>finality lane (aca0f5ed924a2a99b)</dd></div><div><dt>Run</dt><dd>fin-v4-realnode-20261008T2025Z</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>48</dd></div><div><dt>Plan pages</dt><dd>19, 21, 24, 25</dd></div></dl></div></details><details class="acc-case" id="case-FIN-03" data-case="FIN-03" data-state="RUNNING"><summary><span class="c-id">FIN-03</span><span class="c-title">Cross authority expiry in a long partition</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P01, P08</span><span class="c-st"><span class="acc-chip s-running" data-state="RUNNING">RUNNING</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:32 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Recover historical expiry failures where available; use the actual current authority-transition rules.</p><h4>Steps</h4><ol><li>Partition for 31, 35, 60 and 90 logical days and around every retention/expiry boundary.</li><li>Attempt independently renewed authority sets and conflicting checkpoint locks.</li><li>Repeat selected boundary cases on real nodes with accelerated timers explicitly labelled.</li></ol><h4>Accept</h4><p>Authority continuity remains authenticated and no conflicting final history appears within F0 assumptions. A timeout is not accepted as proof absent voters ceased to exist. Compressed time is not multi-month field evidence.</p><h4>Evidence the case requires</h4><p>Expiry timeline; table/certificate history; historical regression tests.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>finality lane (aca0f5ed924a2a99b)</dd></div><div><dt>Run</dt><dd>201-7cfa422a-aa0e0f45</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>48</dd></div><div><dt>Plan pages</dt><dd>19, 21, 24, 25</dd></div></dl></div></details><details class="acc-case" id="case-FIN-04" data-case="FIN-04" data-state="RUNNING"><summary><span class="c-id">FIN-04</span><span class="c-title">Stop signing while mining continues</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P01, P08</span><span class="c-st"><span class="acc-chip s-running" data-state="RUNNING">RUNNING</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:32 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Remove enough signing participation to invalidate the liveness assumption without forging votes.</p><h4>Steps</h4><ol><li>Continue mining and execution, cross seed boundaries and monitor proof queues.</li><li>Check which user-visible states advance and which remain unfinalised.</li><li>Restore eligible weight and bounded message delay, then verify recovery.</li></ol><h4>Accept</h4><p>No false finality or fabricated authority. Behaviour matches F0 during the pause and P08 after assumptions return; unfinished transactions are not displayed as irreversible.</p><h4>Evidence the case requires</h4><p>Signing/mining trace; UI/RPC states; recovery roots and timing.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>finality lane (aca0f5ed924a2a99b)</dd></div><div><dt>Run</dt><dd>201-7cfa422a-aa0e0f45</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>49</dd></div><div><dt>Plan pages</dt><dd>19, 21, 24, 25</dd></div></dl></div></details><details class="acc-case" id="case-FIN-05" data-case="FIN-05" data-state="RUNNING"><summary><span class="c-id">FIN-05</span><span class="c-title">Authenticate voter-set changes and pooled keys</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P01, P08</span><span class="c-st"><span class="acc-chip s-running" data-state="RUNNING">RUNNING</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:32 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Use normal transitions, pool members retaining keys and malicious substitution attempts.</p><h4>Steps</h4><ol><li>Alter voter weights, membership proofs, miner/pool identity bindings and prior-certificate links.</li><li>Race updates across boundaries and replay old signed changes.</li><li>Have a new node verify the authority chain from its declared trust anchor.</li></ol><h4>Accept</h4><p>Only correctly authenticated changes are accepted; weights cannot be double-counted or redirected by a pool. All honest nodes agree on the active authority set for each certified point.</p><h4>Evidence the case requires</h4><p>Authority-chain fixtures; substitution attacks; new-node verification log.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>finality lane (aca0f5ed924a2a99b)</dd></div><div><dt>Run</dt><dd>201-7cfa422a-aa0e0f45</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>49</dd></div><div><dt>Plan pages</dt><dd>19, 21, 24, 25</dd></div></dl></div></details><details class="acc-case" id="case-FIN-06" data-case="FIN-06" data-state="RUNNING"><summary><span class="c-id">FIN-06</span><span class="c-title">Analyse old-key compromise and long-range histories</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P01, P08</span><span class="c-st"><span class="acc-chip s-running" data-state="RUNNING">RUNNING</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>2026-10-08 18:3x UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Freeze assumptions about key erasure, retained weights, trust anchors and offline recovery.</p><h4>Steps</h4><ol><li>Use previously eligible keys to build alternative histories after their operators disappear.</li><li>Present these histories to recently offline and newly joining clients.</li><li>Test replayed certificates, stale anchors and compromised signer subsets.</li></ol><h4>Accept</h4><p>Acceptance matches the explicit security model with no hidden trusted recovery step. Any reliance on a recent trusted anchor is disclosed and tested; hashpower assumptions cannot replace old-key analysis.</p><h4>Evidence the case requires</h4><p>Long-range corpus; trust-anchor policy; key-compromise review; client results.</p></blockquote><h4>Evidence record of the run</h4><dl class="acc-meta acc-rec"><div><dt>What was run</dt><dd>bought and stolen keys in the simulator rows</dd></div><div><dt>Run by</dt><dd>finality lane (aca0f5ed924a2a99b)</dd></div><div><dt>Under the standard</dt><dd>no: team-run before the standard's procedure; the status is RUNNING until the case is re-run under its steps with the profile's numbers and an independent run where the profile asks one</dd></div><div><dt>Pass or fail today</dt><dd>not judged under the standard yet</dd></div></dl><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>finality lane (aca0f5ed924a2a99b)</dd></div><div><dt>Run</dt><dd>team-2026-10-08</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>49</dd></div><div><dt>Plan pages</dt><dd>19, 21, 24, 25</dd></div></dl></div></details><details class="acc-case" id="case-FIN-07" data-case="FIN-07" data-state="PASS"><summary><span class="c-id">FIN-07</span><span class="c-title">Recover deterministically after reconnection and crash</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P01, P08</span><span class="c-st"><span class="acc-chip s-pass" data-state="PASS">PASS</span></span><span class="c-ev"><span class="lbl">Evidence </span><a href="https://git.igneum.network/igneum-network/igneum/src/branch/master/sim/finality-attacks-results/v4-pause-fix.md" rel="noopener">record</a></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:43 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Combine partitions with node crash, partial writes, restarts and proof backlog.</p><h4>Steps</h4><ol><li>Reconnect networks under bounded latency and restore required honest participation.</li><li>Verify fork choice, unfinalised reorganisation, finality, reward rollback and proof reassignments.</li><li>Compare all honest nodes and customer-visible receipts after recovery.</li></ol><h4>Accept</h4><p>P08 recovery holds without reversing a previously valid final guarantee. Only permitted unfinalised state is reorganised; no duplicate rewards or inconsistent receipt statuses survive.</p><h4>Evidence the case requires</h4><p>Recovery timelines; roots/certificates; payout rollback; customer-state reconciliation.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>finality lane (aca0f5ed924a2a99b)</dd></div><div><dt>Run</dt><dd>fin-v4-realnode-20261008T2025Z</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>50</dd></div><div><dt>Plan pages</dt><dd>19, 21, 24, 25</dd></div></dl></div></details><details class="acc-case" id="case-FIN-08" data-case="FIN-08" data-state="RUNNING"><summary><span class="c-id">FIN-08</span><span class="c-title">Combine boundaries, faults and adversarial scheduling</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P01, P08</span><span class="c-st"><span class="acc-chip s-running" data-state="RUNNING">RUNNING</span></span><span class="c-ev"><span class="lbl">Evidence </span><a href="https://git.igneum.network/igneum-network/igneum/src/branch/master/sim/results_v2.md" rel="noopener">record</a></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:43 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Use an independent model checker/scheduler and production-node scenarios from F4.</p><h4>Steps</h4><ol><li>Combine epoch changes, authority transitions, mining churn, data delays and prover/aggregator loss.</li><li>Explore bounded adversarial message schedules and minimise any counterexample.</li><li>Replay model findings on real code and have an independent reviewer assess uncovered states.</li></ol><h4>Accept</h4><p>No unresolved safety failure; liveness claims hold only within declared assumptions and P08. Model bounds and untested schedules are published, not described as proof over every possible execution.</p><h4>Evidence the case requires</h4><p>Model/spec artifacts; schedule corpus; replay evidence; independent assessment.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Model checking + real-node testing</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>fast-time lane (a8be71a0db962911c)</dd></div><div><dt>Run</dt><dd>fin-v4-realnode-20261008T2025Z</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>50</dd></div><div><dt>Plan pages</dt><dd>19, 21, 24, 25</dd></div></dl></div></details></div></div></section><section class="section acc-suite" id="suite-VER"><div class="container"><div class="acc-suite-head"><div class="acc-suite-code"><span class="n">12</span>VER</div><div class="acc-suite-t"><h2>Wallets, receipts and data availability</h2><p class="acc-sub">Verify the exact property shown to the user. An inclusion proof, execution proof and finality certificate are not interchangeable.</p></div><div class="acc-suite-st"><span class="acc-chip s-fail" data-state="FAIL">FAIL</span></div></div><dl class="acc-facts"><div><dt>Owner</dt><dd>Wallet + light-client lead; independent security review</dd></div><div><dt>Gate</dt><dd>Technical readiness / claimed options</dd></div><div><dt>Fixtures</dt><dd>F0 trust/availability model; F5 malformed roots, receipts and authority chains</dd></div><div><dt>Plan pages</dt><dd>20, 25, 35, 37</dd></div></dl><div class="acc-suite-bar"><div class="acc-bar" role="img" aria-label="VER: 8 cases: 0 passed under the standard, 4 running with team evidence, 3 failed, 1 not run, 0 deferred"><span class="seg g-fail" style="flex-grow:3" title="3 FAIL"></span><span class="seg g-running" style="flex-grow:4" title="4 RUNNING"></span><span class="seg g-notrun" style="flex-grow:1" title="1 NOT RUN"></span></div><span>8 cases: 0 passed under the standard, 4 running with team evidence, 3 failed, 1 not run, 0 deferred</span></div><div class="acc-cases"><div class="acc-cases-h" aria-hidden="true"><span>Case</span><span>Title</span><span>Priority</span><span>Profile</span><span>Status</span><span>Evidence</span><span>Last run</span><span></span></div><details class="acc-case" id="case-VER-01" data-case="VER-01" data-state="FAIL"><summary><span class="c-id">VER-01</span><span class="c-title">Authenticate light-client bootstrap</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P01, P09</span><span class="c-st"><span class="acc-chip s-fail" data-state="FAIL">FAIL</span></span><span class="c-ev"><span class="lbl">Evidence </span><a href="https://git.igneum.network/igneum-network/igneum/src/branch/master/tools/reference-apps/ver/evidence/VER-01.json" rel="noopener">record</a></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:46 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Give a clean client malicious RPC responses, fabricated voter tables and valid-looking signatures.</p><h4>Steps</h4><ol><li>Start from the approved trust anchor and verify every required link to the advertised state.</li><li>Substitute otherwise well-formed but unauthorised keys, weights and checkpoints.</li><li>Remove the bootstrap service and use another independently operated source.</li></ol><h4>Accept</h4><p>The client rejects unauthorised authority and discloses any trust anchor. Signatures over a node-supplied table do not by themselves pass; missing authentication never silently degrades to trusted RPC.</p><h4>Evidence the case requires</h4><p>Bootstrap corpus; trust-chain trace; fail-closed tests.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>reference-apps lane (a2060899d2a27d31c)</dd></div><div><dt>Run</dt><dd>ra-20261008T1915-ver</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>51</dd></div><div><dt>Plan pages</dt><dd>20, 25, 35, 37</dd></div></dl></div></details><details class="acc-case" id="case-VER-02" data-case="VER-02" data-state="FAIL"><summary><span class="c-id">VER-02</span><span class="c-title">Verify evolving authority and execution statements</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P01, P09</span><span class="c-st"><span class="acc-chip s-fail" data-state="FAIL">FAIL</span></span><span class="c-ev"><span class="lbl">Evidence </span><a href="https://git.igneum.network/igneum-network/igneum/src/branch/master/tools/reference-apps/ver/evidence/VER-01.json" rel="noopener">record</a></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:46 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Use valid state proofs paired with wrong execution statements or stale authority histories.</p><h4>Steps</h4><ol><li>Cross voter and verifier changes with offline clients returning after long intervals.</li><li>Alter roots, aggregate identity and proof/public-input bindings independently.</li><li>Check local verification rather than merely a server-reported verified flag.</li></ol><h4>Accept</h4><p>All advertised proof checks occur locally or the remaining trust is explicitly disclosed. Wrong roots and unauthenticated authority are rejected; unsupported verification paths are not claimed.</p><h4>Evidence the case requires</h4><p>Client verification trace; corrupted inputs; offline/upgrade results.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>reference-apps lane (a2060899d2a27d31c)</dd></div><div><dt>Run</dt><dd>ra-20261008T1915-ver</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>51</dd></div><div><dt>Plan pages</dt><dd>20, 25, 35, 37</dd></div></dl></div></details><details class="acc-case" id="case-VER-03" data-case="VER-03" data-state="RUNNING"><summary><span class="c-id">VER-03</span><span class="c-title">Prove successful payment rather than inclusion</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P01, P09</span><span class="c-st"><span class="acc-chip s-running" data-state="RUNNING">RUNNING</span></span><span class="c-ev"><span class="lbl">Evidence </span><a href="https://git.igneum.network/igneum-network/igneum/src/branch/master/tools/reference-apps/ver/evidence/summary.json" rel="noopener">record</a></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:46 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Create successful, reverted, wrong-asset, wrong-recipient and wrong-amount transfers.</p><h4>Steps</h4><ol><li>Generate receipts for included transactions, including failures and replaced/unfinalised transactions.</li><li>Verify execution status plus asset, recipient, amount and canonical-state/receipt commitment.</li><li>Replay the receipt on another chain and after an allowed unfinalised reorganisation.</li></ol><h4>Accept</h4><p>Only the actual successful, correctly bound transfer is labelled payment proof. Inclusion-only receipts are labelled as such; no node-reported success flag substitutes for authenticated outcome.</p><h4>Evidence the case requires</h4><p>Payment fixture corpus; receipt verification; merchant-facing status checks.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>reference-apps lane (a2060899d2a27d31c)</dd></div><div><dt>Run</dt><dd>ra-20261008T1915-ver</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>51</dd></div><div><dt>Plan pages</dt><dd>20, 25, 35, 37</dd></div></dl></div></details><details class="acc-case" id="case-VER-04" data-case="VER-04" data-state="RUNNING"><summary><span class="c-id">VER-04</span><span class="c-title">Bound cross-chain oracle trust and replay</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P00, P01, P09</span><span class="c-st"><span class="acc-chip s-running" data-state="RUNNING">RUNNING</span></span><span class="c-ev"><span class="lbl">Evidence </span><a href="https://git.igneum.network/igneum-network/igneum/src/branch/master/tools/reference-apps/ver/evidence/summary.json" rel="noopener">record</a></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:46 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>For a claimed oracle, freeze destination verifier, authority updates, accepted proof types and replay policy.</p><h4>Steps</h4><ol><li>Try deployer-substituted keys, stale certificates, unchecked signatures and wrong source/destination identities.</li><li>Exercise legitimate authority updates and source reorganisations under the approved model.</li><li>Measure gas/cost with realistic header sets and test disabled/unavailable verification.</li></ol><h4>Accept</h4><p>The oracle enforces its declared trust model and fails closed. Deployer privileges and unavailable guarantees are explicit; no trustless-bridge claim exceeds the checks performed. Excluded oracle scope earns no pass credit.</p><h4>Evidence the case requires</h4><p>Oracle code/parameters; attack cases; cost report; privilege disclosure.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Claimed-option verification</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>reference-apps lane (a2060899d2a27d31c)</dd></div><div><dt>Run</dt><dd>ra-20261008T1915-ver</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>52</dd></div><div><dt>Plan pages</dt><dd>20, 25, 35, 37</dd></div></dl></div></details><details class="acc-case" id="case-VER-05" data-case="VER-05" data-state="FAIL"><summary><span class="c-id">VER-05</span><span class="c-title">Reconstruct required state without founder storage</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P01, P08, P09</span><span class="c-st"><span class="acc-chip s-fail" data-state="FAIL">FAIL</span></span><span class="c-ev"><span class="lbl">Evidence </span><a href="https://git.igneum.network/igneum-network/igneum/src/branch/master/tools/reference-apps/ver/evidence/VER-05.json" rel="noopener">record</a></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:46 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Remove founder archival/input services and start an independent operator from the documented entry point.</p><h4>Steps</h4><ol><li>Fetch authenticated blocks, state/proof inputs and any required witnesses from permitted peers.</li><li>Rebuild the expected state and continue validation/proving.</li><li>Measure bandwidth, disk, time and retention requirements against advertised operator budgets.</li></ol><h4>Accept</h4><p>Required data can be obtained and verified within the declared availability model. Hidden archives or unpublished files block independence. A valid execution proof alone does not satisfy this test.</p><h4>Evidence the case requires</h4><p>Download/reconstruction logs; data hashes; resource costs; dependency inventory.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>reference-apps lane (a2060899d2a27d31c)</dd></div><div><dt>Run</dt><dd>ra-20261008T1915-ver</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>52</dd></div><div><dt>Plan pages</dt><dd>20, 25, 35, 37</dd></div></dl></div></details><details class="acc-case" id="case-VER-06" data-case="VER-06" data-state="RUNNING"><summary><span class="c-id">VER-06</span><span class="c-title">Detect withholding, corruption and stale data</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P01, P08, P09</span><span class="c-st"><span class="acc-chip s-running" data-state="RUNNING">RUNNING</span></span><span class="c-ev"><span class="lbl">Evidence </span><a href="https://git.igneum.network/igneum-network/igneum/src/branch/master/tools/reference-apps/ver/evidence/summary.json" rel="noopener">record</a></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:46 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Serve valid commitments with missing data, corrupted chunks, stale witnesses and conflicting peer replies.</p><h4>Steps</h4><ol><li>Attempt to make a validator or light client accept an unavailable or incorrect state under F0.</li><li>Test retrieval from independent peers and expiry/retry policy.</li><li>Restore data and check that recovery cannot alter an already verified commitment.</li></ol><h4>Accept</h4><p>No unjustified available/verified status; safety and admission rules match F0. Recovery is bounded where assumptions permit, and unavailable-data states remain visible instead of hidden behind proofs.</p><h4>Evidence the case requires</h4><p>Withholding corpus; peer retrieval traces; availability/status checks.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>reference-apps lane (a2060899d2a27d31c)</dd></div><div><dt>Run</dt><dd>ra-20261008T1915-ver</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>52</dd></div><div><dt>Plan pages</dt><dd>20, 25, 35, 37</dd></div></dl></div></details><details class="acc-case" id="case-VER-07" data-case="VER-07" data-state="NOT RUN"><summary><span class="c-id">VER-07</span><span class="c-title">Protect wallet keys, signing and recovery</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P01, P09</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:22 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Use test-only keys, encrypted backups and clean replacement devices; no real user funds.</p><h4>Steps</h4><ol><li>Attempt secret access from proving jobs, logs, crash dumps, clipboard and telemetry paths.</li><li>Verify transaction destination/amount before signing; test backup/restore and wrong-password handling.</li><li>Upgrade and recover without silently changing signing authority or exposing seed material.</li></ol><h4>Accept</h4><p>No unintended secret disclosure or unauthorised signature. Supported recovery restores the correct keys and accounts; users receive explicit risk/backup information. Logs are sanitised without hiding security evidence.</p><h4>Evidence the case requires</h4><p>Security review; canary-secret tests; signing fixtures; restore journey.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>shipper (ae892a8b0f78fe31c)</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>53</dd></div><div><dt>Plan pages</dt><dd>20, 25, 35, 37</dd></div></dl></div></details><details class="acc-case" id="case-VER-08" data-case="VER-08" data-state="RUNNING"><summary><span class="c-id">VER-08</span><span class="c-title">Keep every user-facing state truthful</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P01, P09</span><span class="c-st"><span class="acc-chip s-running" data-state="RUNNING">RUNNING</span></span><span class="c-ev"><span class="lbl">Evidence </span><a href="https://git.igneum.network/igneum-network/igneum/src/branch/master/tools/reference-apps/ver/evidence/summary.json" rel="noopener">record</a></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:46 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Create included-only, executed, proven, finalised, reverted, stale and paused examples.</p><h4>Steps</h4><ol><li>Compare explorer, wallet, receipt, RPC and customer API labels against authenticated evidence.</li><li>Interrupt finality and proof services and observe refresh/reconnect behaviour.</li><li>Check statements about privacy, Ethereum security and device support.</li></ol><h4>Accept</h4><p>No stronger state is implied than verified; stale data is marked and failures are actionable. EVM compatibility is not labelled Ethereum security, and ZK technology is not automatically labelled transaction privacy.</p><h4>Evidence the case requires</h4><p>Cross-surface screenshots/logs; state mapping; claim review.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>reference-apps lane (a2060899d2a27d31c)</dd></div><div><dt>Run</dt><dd>ra-20261008T1915-ver</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>53</dd></div><div><dt>Plan pages</dt><dd>20, 25, 35, 37</dd></div></dl></div></details></div></div></section><section class="section acc-suite" id="suite-OPS"><div class="container"><div class="acc-suite-head"><div class="acc-suite-code"><span class="n">13</span>OPS</div><div class="acc-suite-t"><h2>Independent operation and release security</h2><p class="acc-sub">A permissionless specification must remain operational without privileged infrastructure or unsafe automatic updates.</p></div><div class="acc-suite-st"><span class="acc-chip s-running" data-state="RUNNING">RUNNING</span></div></div><dl class="acc-facts"><div><dt>Owner</dt><dd>Operations + release leads; independent operators</dd></div><div><dt>Gate</dt><dd>G5 <span class="acc-gl"><a href="#gate-G5">G5</a></span></dd></div><div><dt>Fixtures</dt><dd>F4 isolated multi-operator network; F0 signed releases; F9 telemetry</dd></div><div><dt>Plan pages</dt><dd>21, 24, 25, 26</dd></div></dl><div class="acc-suite-bar"><div class="acc-bar" role="img" aria-label="OPS: 8 cases: 0 passed under the standard, 2 running with team evidence, 6 not run, 0 deferred"><span class="seg g-running" style="flex-grow:2" title="2 RUNNING"></span><span class="seg g-notrun" style="flex-grow:6" title="6 NOT RUN"></span></div><span>8 cases: 0 passed under the standard, 2 running with team evidence, 6 not run, 0 deferred</span></div><div class="acc-cases"><div class="acc-cases-h" aria-hidden="true"><span>Case</span><span>Title</span><span>Priority</span><span>Profile</span><span>Status</span><span>Evidence</span><span>Last run</span><span></span></div><details class="acc-case" id="case-OPS-01" data-case="OPS-01" data-state="NOT RUN"><summary><span class="c-id">OPS-01</span><span class="c-title">Run the complete no-founder exercise</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P07, P08, P11</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:22 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Use the P11 independent network, adequate honest participation and enough non-founder capacity for W.</p><h4>Steps</h4><ol><li>Remove founder miners, provers, aggregators, RPC, DNS/bootstrap dependencies and private support access.</li><li>Run the full P11 period while crossing real and separately labelled accelerated boundaries.</li><li>Introduce scheduled faults and have independent operators recover using published instructions.</li></ol><h4>Accept</h4><p>No founder action, secret file, privileged key or emergency anti-chip rule is needed. P07/P08 outcomes hold within assumptions; any intervention is recorded as a failed no-rescue run, not erased.</p><h4>Evidence the case requires</h4><p>Operator roster/conflict checks; dependency removals; full activity/intervention log.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>node lane (a283f5f0d364ceef0)</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>54</dd></div><div><dt>Plan pages</dt><dd>21, 24, 25, 26</dd></div></dl></div></details><details class="acc-case" id="case-OPS-02" data-case="OPS-02" data-state="NOT RUN"><summary><span class="c-id">OPS-02</span><span class="c-title">Diversify bootstrap and resist peer isolation</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P01, P08, P09</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:22 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Start nodes without the default bootstrap host and give others adversarial peer lists.</p><h4>Steps</h4><ol><li>Attempt eclipse through peer concentration, stale discovery, poisoned DNS and repeated identities in an isolated lab.</li><li>Use independent documented discovery paths and validate returned chain data.</li><li>Measure synchronisation, peer diversity and recovery after benign connectivity returns.</li></ol><h4>Accept</h4><p>No unauthenticated history is trusted; bootstrap has no hidden single-provider requirement. Isolation is detected/contained according to F0 and recovery meets P08 when assumptions return.</p><h4>Evidence the case requires</h4><p>Peer/discovery traces; eclipse scenarios; startup and recovery evidence.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>build-server lane (a352e49ff4613df86)</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>54</dd></div><div><dt>Plan pages</dt><dd>21, 24, 25, 26</dd></div></dl></div></details><details class="acc-case" id="case-OPS-03" data-case="OPS-03" data-state="NOT RUN"><summary><span class="c-id">OPS-03</span><span class="c-title">Separate update distribution from consensus authority</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P01, P09</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:56 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Use test signing keys and clean desktop/node installations with valid, stale and malicious packages.</p><h4>Steps</h4><ol><li>Offer signed updates with unexpected consensus rules, downgraded binaries and corrupted payloads.</li><li>Test explicit operator acceptance and the published signing-key incident procedure.</li><li>Confirm that distribution-key possession cannot independently activate new consensus rules.</li></ol><h4>Accept</h4><p>Tampering/unauthorised rollback is rejected; updates do not silently transfer authority. Approved acceptance and activation are separate. No test touches production signing material.</p><h4>Evidence the case requires</h4><p>Package corpus; approval/activation traces; compromised-key rehearsal.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>shipper (ae892a8b0f78fe31c)</dd></div><div><dt>Run</dt><dd>site-manifest-20261008-01</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>54</dd></div><div><dt>Plan pages</dt><dd>21, 24, 25, 26</dd></div></dl></div></details><details class="acc-case" id="case-OPS-04" data-case="OPS-04" data-state="RUNNING"><summary><span class="c-id">OPS-04</span><span class="c-title">Recover nodes from crash and storage damage</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P01, P08</span><span class="c-st"><span class="acc-chip s-running" data-state="RUNNING">RUNNING</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:32 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Use production database/snapshot paths with controlled interrupted writes and corrupted test storage.</p><h4>Steps</h4><ol><li>Crash during import, proof acceptance, reward application and snapshot generation.</li><li>Restore from independently verified snapshots or re-sync through documented procedures.</li><li>Compare roots, certificates, balances and processed-job IDs with an unaffected node.</li></ol><h4>Accept</h4><p>No corrupt snapshot is trusted, no duplicate payout and no loss of authenticated final state. Recovery meets P08 where data is available; ambiguous corruption fails closed and is actionable.</p><h4>Evidence the case requires</h4><p>Crash schedule; snapshot hashes; root/balance diffs; recovery timing.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>node lane (a283f5f0d364ceef0)</dd></div><div><dt>Run</dt><dd>201-7cfa422a-aa0e0f45</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>55</dd></div><div><dt>Plan pages</dt><dd>21, 24, 25, 26</dd></div></dl></div></details><details class="acc-case" id="case-OPS-05" data-case="OPS-05" data-state="NOT RUN"><summary><span class="c-id">OPS-05</span><span class="c-title">Isolate untrusted proving workloads</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P01, P09</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:22 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Run hostile test jobs with secret canaries and restrictive worker permissions.</p><h4>Steps</h4><ol><li>Attempt filesystem escape, process spawning, resource exhaustion, network access and key-store reads.</li><li>Crash workers and inspect host, wallet and node availability plus dump/log contents.</li><li>Retry on every supported isolation backend and check dependency vulnerability handling.</li></ol><h4>Accept</h4><p>No secret leakage or unauthorised host action; P09 resource containment holds. Worker failure does not compromise validator/wallet authority; unsupported isolation is not marketed as safe execution.</p><h4>Evidence the case requires</h4><p>Sandbox penetration report; canary logs; resource limits; host-integrity checks.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>build-server lane (a352e49ff4613df86)</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>55</dd></div><div><dt>Plan pages</dt><dd>21, 24, 25, 26</dd></div></dl></div></details><details class="acc-case" id="case-OPS-06" data-case="OPS-06" data-state="RUNNING"><summary><span class="c-id">OPS-06</span><span class="c-title">Contain malicious network and API traffic</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P01, P09</span><span class="c-st"><span class="acc-chip s-running" data-state="RUNNING">RUNNING</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:32 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Use an authorised isolated load environment with declared resource and request-rate budgets.</p><h4>Steps</h4><ol><li>Send malformed headers, proofs, oversized messages, floods and invalid peer sequences.</li><li>Measure legitimate traffic, memory/disk growth and validator CPU use.</li><li>Test limit resets, peer reconnect and graceful degradation without disabling validation.</li></ol><h4>Accept</h4><p>P09 abuse budgets hold; no unbounded allocation, persistent crash or invalid acceptance. Backpressure is visible and honest users retain the specified service at admitted load.</p><h4>Evidence the case requires</h4><p>Load/corpus manifests; resource series; valid-traffic metrics; incident traces.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>build-server lane (a352e49ff4613df86)</dd></div><div><dt>Run</dt><dd>201-7cfa422a-aa0e0f45</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>55</dd></div><div><dt>Plan pages</dt><dd>21, 24, 25, 26</dd></div></dl></div></details><details class="acc-case" id="case-OPS-07" data-case="OPS-07" data-state="NOT RUN"><summary><span class="c-id">OPS-07</span><span class="c-title">Detect failures with usable evidence and runbooks</span><span class="c-pri"><span class="lbl">Priority </span>GATE</span><span class="c-prof"><span class="lbl">Profile </span>P09, P10</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:22 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Define alerts for invalid acceptance, conflicting finality, backlog, data loss, payout mismatch and stale status.</p><h4>Steps</h4><ol><li>Inject one instance of each monitored failure in the lab.</li><li>Have an unaffiliated operator diagnose it using only emitted evidence and published instructions.</li><li>Test redaction, metric freshness and duplicate-alert suppression without suppressing serious failures.</li></ol><h4>Accept</h4><p>P10 alert/detection limits hold; every blocker produces actionable evidence. Monitoring does not leak secrets or mislabel intentional safe pauses as successful finality.</p><h4>Evidence the case requires</h4><p>Alert matrix; detection timelines; independent runbook exercise.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>build-server lane (a352e49ff4613df86)</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>56</dd></div><div><dt>Plan pages</dt><dd>21, 24, 25, 26</dd></div></dl></div></details><details class="acc-case" id="case-OPS-08" data-case="OPS-08" data-state="NOT RUN"><summary><span class="c-id">OPS-08</span><span class="c-title">Repeat independent operation across releases</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P00, P08, P11</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:22 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Use a clean previous supported version and the final candidate with independent operators.</p><h4>Steps</h4><ol><li>Perform documented rolling upgrade, rollback of non-consensus software where allowed and resynchronisation.</li><li>Cross activation with mixed versions and unavailable founder distribution hosts.</li><li>Re-run affected gates after changes and preserve prior failures and incident lessons.</li></ol><h4>Accept</h4><p>No undocumented privileged migration or automatic consensus rewrite. All affected evidence is refreshed; P11 no-rescue results remain tied to the final release, not an earlier build.</p><h4>Evidence the case requires</h4><p>Upgrade/replay logs; invalidation map; repeated gate signatures.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>build-server lane (a352e49ff4613df86)</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>56</dd></div><div><dt>Plan pages</dt><dd>21, 24, 25, 26</dd></div></dl></div></details></div></div></section><section class="section acc-suite" id="suite-UX"><div class="container"><div class="acc-suite-head"><div class="acc-suite-code"><span class="n">14</span>UX</div><div class="acc-suite-t"><h2>Ember, payouts and operator control</h2><p class="acc-sub">Successful participation must be practical for ordinary owners without hidden custody or loss of consensus authority.</p></div><div class="acc-suite-st"><span class="acc-chip s-running" data-state="RUNNING">RUNNING</span></div></div><dl class="acc-facts"><div><dt>Owner</dt><dd>Desktop product + pool leads; independent usability study</dd></div><div><dt>Gate</dt><dd>Operator readiness / G5 <span class="acc-gl"><a href="#gate-G5">G5</a></span></dd></div><div><dt>Fixtures</dt><dd>F2 supported desktops; F8 user study; F4 honest/malicious pools</dd></div><div><dt>Plan pages</dt><dd>14, 21, 25, 26</dd></div></dl><div class="acc-suite-bar"><div class="acc-bar" role="img" aria-label="UX: 8 cases: 0 passed under the standard, 7 running with team evidence, 1 not run, 0 deferred"><span class="seg g-running" style="flex-grow:7" title="7 RUNNING"></span><span class="seg g-notrun" style="flex-grow:1" title="1 NOT RUN"></span></div><span>8 cases: 0 passed under the standard, 7 running with team evidence, 1 not run, 0 deferred</span></div><div class="acc-cases"><div class="acc-cases-h" aria-hidden="true"><span>Case</span><span>Title</span><span>Priority</span><span>Profile</span><span>Status</span><span>Evidence</span><span>Last run</span><span></span></div><details class="acc-case" id="case-UX-01" data-case="UX-01" data-state="NOT RUN"><summary><span class="c-id">UX-01</span><span class="c-title">Onboard ordinary owners on native desktop apps</span><span class="c-pri"><span class="lbl">Priority </span>GATE</span><span class="c-prof"><span class="lbl">Profile </span>P10</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>2026-10-08 18:3x UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Recruit the P10 first-time user cohort across Windows and macOS using supported physical hardware.</p><h4>Steps</h4><ol><li>Observe install, hardware detection, safety explanation and first accepted work without staff intervention.</li><li>Record download/data preparation separately as well as complete end-to-end time.</li><li>Test unsupported hardware and insufficient memory messaging rather than forcing a failed start.</li></ol><h4>Accept</h4><p>P10 completion/time targets hold with no unsafe default or concealed prerequisite. The product is tested as the actual desktop app, not only a browser preview.</p><h4>Evidence the case requires</h4><p>Consent-based study records; task timings; failure reasons; compatibility outcomes.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Independent observed user study</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>update-return lane (a22d765a2e0355a9f)</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>57</dd></div><div><dt>Plan pages</dt><dd>14, 21, 25, 26</dd></div></dl></div></details><details class="acc-case" id="case-UX-02" data-case="UX-02" data-state="RUNNING"><summary><span class="c-id">UX-02</span><span class="c-title">Make pause, stop and safe tuning reliable</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P01, P10</span><span class="c-st"><span class="acc-chip s-running" data-state="RUNNING">RUNNING</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:32 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Run mining/proving on active desktops under contention and safe thermal stress.</p><h4>Steps</h4><ol><li>Use pause, stop, power limit, task selection and emergency local shutdown controls.</li><li>Crash or restart the UI while workers run and verify ownership of background processes.</li><li>Restore the original hardware settings and test power-saving/low-battery behaviour where supported.</li></ol><h4>Accept</h4><p>P10 control latency and safe-state requirements hold. Stopping does not strand an uncontrolled process; tuning never depends on unsafe settings or silent privilege escalation.</p><h4>Evidence the case requires</h4><p>Control timings; process/settings audit; restart and safety traces.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>shipper (ae892a8b0f78fe31c)</dd></div><div><dt>Run</dt><dd>201-7cfa422a-aa0e0f45</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>57</dd></div><div><dt>Plan pages</dt><dd>14, 21, 25, 26</dd></div></dl></div></details><details class="acc-case" id="case-UX-03" data-case="UX-03" data-state="RUNNING"><summary><span class="c-id">UX-03</span><span class="c-title">Show net earnings and compatibility honestly</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P01, P10, P12</span><span class="c-st"><span class="acc-chip s-running" data-state="RUNNING">RUNNING</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:32 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Use known rewards, fees, energy readings, retries and operator-entered tariffs.</p><h4>Steps</h4><ol><li>Compare mining, internal proof and external proof income with authoritative ledgers.</li><li>Show gross/net estimates, measurement boundaries, tariff assumptions and payout status.</li><li>Test stale data, losses, negative margins and mining-only versus proving-compatible devices.</li></ol><h4>Accept</h4><p>P10 reconciliation limits hold and uncertainty is visible. No guaranteed profits, fabricated fiat price or inferred proving support; provisional earnings are not shown as settled payments.</p><h4>Evidence the case requires</h4><p>UI/ledger comparisons; tariff fixtures; stale/negative examples.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>shipper (ae892a8b0f78fe31c)</dd></div><div><dt>Run</dt><dd>201-7cfa422a-aa0e0f45</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>57</dd></div><div><dt>Plan pages</dt><dd>14, 21, 25, 26</dd></div></dl></div></details><details class="acc-case" id="case-UX-04" data-case="UX-04" data-state="RUNNING"><summary><span class="c-id">UX-04</span><span class="c-title">Pay small operators without hidden custody</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P01, P10</span><span class="c-st"><span class="acc-chip s-running" data-state="RUNNING">RUNNING</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:32 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Use ordinary single-card balances and the actual pooling/payment path.</p><h4>Steps</h4><ol><li>Earn, request/receive payment, disconnect and reconnect; include low balances, fees and a pool outage.</li><li>Attempt redirection, delayed accounting and withdrawal of another user's entitlement.</li><li>Reconcile displayed balances with canonical entitlement and actual settlement.</li></ol><h4>Accept</h4><p>P10 payout limits hold for the declared small-operator case. No unauthorised custody, redirection or unexplained loss; thresholds and fees are disclosed rather than masked by larger test balances.</p><h4>Evidence the case requires</h4><p>Single-card payout ledger; pool failure record; custody/authorisation review.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>pool design seat (a3832b1c3b274b310)</dd></div><div><dt>Run</dt><dd>201-7cfa422a-aa0e0f45</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>58</dd></div><div><dt>Plan pages</dt><dd>14, 21, 25, 26</dd></div></dl></div></details><details class="acc-case" id="case-UX-05" data-case="UX-05" data-state="RUNNING"><summary><span class="c-id">UX-05</span><span class="c-title">Keep voting keys with the miner through pooling</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P01, P09</span><span class="c-st"><span class="acc-chip s-running" data-state="RUNNING">RUNNING</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:22 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Use an honest pool and a modified pool that replaces worker identity or voting credentials.</p><h4>Steps</h4><ol><li>Verify the consensus binding from performed work to the miner's retained key.</li><li>Attempt substitution, replay and reassignment without the miner's authorisation.</li><li>Leave the pool and verify retained voting/finality rights under F0.</li></ol><h4>Accept</h4><p>No silent transfer of governance/finality authority. If the protocol cannot establish retained keys, this requirement fails; a pool-protocol name or user-interface promise does not pass.</p><h4>Evidence the case requires</h4><p>Work/key binding vectors; malicious-pool attempts; leave-pool authority check.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>pool design seat (a3832b1c3b274b310)</dd></div><div><dt>Run</dt><dd>pool-2.0-20261008-01</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>58</dd></div><div><dt>Plan pages</dt><dd>14, 21, 25, 26</dd></div></dl></div></details><details class="acc-case" id="case-UX-06" data-case="UX-06" data-state="RUNNING"><summary><span class="c-id">UX-06</span><span class="c-title">Verify actual miner-selected work templates</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P01, P10</span><span class="c-st"><span class="acc-chip s-running" data-state="RUNNING">RUNNING</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:32 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Provide a pool interface with declared job-declaration support and independent miner templates.</p><h4>Steps</h4><ol><li>Submit miner-selected valid transaction templates and verify what is actually hashed and accepted.</li><li>Have a pool substitute or censor templates and test local verification/fallback.</li><li>Measure payout and acceptance consequences without moving authority to the pool.</li></ol><h4>Accept</h4><p>The advertised selection control exists in accepted work, not only configuration. Undisclosed substitution is detected; supported independent operation remains practical under P10.</p><h4>Evidence the case requires</h4><p>Template commitments; accepted-block evidence; malicious-pool/fallback report.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>shipper (ae892a8b0f78fe31c)</dd></div><div><dt>Run</dt><dd>201-7cfa422a-aa0e0f45</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>58</dd></div><div><dt>Plan pages</dt><dd>14, 21, 25, 26</dd></div></dl></div></details><details class="acc-case" id="case-UX-07" data-case="UX-07" data-state="RUNNING"><summary><span class="c-id">UX-07</span><span class="c-title">Expose actionable failures and safe updates</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P09, P10</span><span class="c-st"><span class="acc-chip s-running" data-state="RUNNING">RUNNING</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:32 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Create failed proofs, memory pressure, expired jobs, missing payouts and available software updates.</p><h4>Steps</h4><ol><li>Ask independent users to identify the issue, stop safely and follow the recommended action.</li><li>Test explicit update approval, version visibility and a failed/corrupt update.</li><li>Confirm diagnostic exports remove keys and private inputs while retaining useful evidence.</li></ol><h4>Accept</h4><p>P10 task-success requirements hold; no silent update or false success state. Recovery instructions work on supported desktops and secret canaries never enter exported logs.</p><h4>Evidence the case requires</h4><p>Observed tasks; update traces; sanitised export tests.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>shipper (ae892a8b0f78fe31c)</dd></div><div><dt>Run</dt><dd>201-7cfa422a-aa0e0f45</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>59</dd></div><div><dt>Plan pages</dt><dd>14, 21, 25, 26</dd></div></dl></div></details><details class="acc-case" id="case-UX-08" data-case="UX-08" data-state="RUNNING"><summary><span class="c-id">UX-08</span><span class="c-title">Publish competitive accessible software</span><span class="c-pri"><span class="lbl">Priority </span>GATE</span><span class="c-prof"><span class="lbl">Profile </span>P02, P10</span><span class="c-st"><span class="acc-chip s-running" data-state="RUNNING">RUNNING</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 19:28 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Provide open documented builds, tuning parameters and known fee conditions for all supported platforms.</p><h4>Steps</h4><ol><li>Compare Ember against independently optimised permissible implementations on identical work.</li><li>Measure efficiency, fees, false rejection, installation and update transparency.</li><li>Scan for hidden developer fees, hardware whitelists, per-address privilege or undisclosed remote controls.</li></ol><h4>Accept</h4><p>P10 relative-efficiency limits hold and all fees/privileges are explicit. No self-reported device tier earns consensus advantage. A superior external implementation triggers investigation, not selective exclusion.</p><h4>Evidence the case requires</h4><p>Matched software comparison; code/config review; fee/privilege inventory.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>hash lane (a690540514aa453d7)</dd></div><div><dt>Run</dt><dd>200-417c4a57-b2</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>59</dd></div><div><dt>Plan pages</dt><dd>14, 21, 25, 26</dd></div></dl></div></details></div></div></section><section class="section acc-suite" id="suite-COM"><div class="container"><div class="acc-suite-head"><div class="acc-suite-code"><span class="n">15</span>COM</div><div class="acc-suite-t"><h2>Paid demand and sustainable delivery</h2><p class="acc-sub">Devnet payouts and subsidised pilots demonstrate mechanics, not independent willingness to pay.</p></div><div class="acc-suite-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></div></div><dl class="acc-facts"><div><dt>Owner</dt><dd>Commercial lead + independent financial/customer reviewer</dd></div><div><dt>Gate</dt><dd>Commercial evidence</dd></div><div><dt>Fixtures</dt><dd>F8 real consenting customers; F7 full service costs; private identity proofs</dd></div><div><dt>Plan pages</dt><dd>4, 17, 18, 24, 26, 27, 31, 32, 33</dd></div></dl><div class="acc-suite-bar"><div class="acc-bar" role="img" aria-label="COM: 8 cases: 0 passed under the standard, 0 running with team evidence, 7 not run, 1 deferred"><span class="seg g-notrun" style="flex-grow:7" title="7 NOT RUN"></span><span class="seg g-deferred" style="flex-grow:1" title="1 DEFERRED"></span></div><span>8 cases: 0 passed under the standard, 0 running with team evidence, 7 not run, 1 deferred</span></div><div class="acc-cases"><div class="acc-cases-h" aria-hidden="true"><span>Case</span><span>Title</span><span>Priority</span><span>Profile</span><span>Status</span><span>Evidence</span><span>Last run</span><span></span></div><details class="acc-case" id="case-COM-01" data-case="COM-01" data-state="NOT RUN"><summary><span class="c-id">COM-01</span><span class="c-title">Deliver a genuine contracted proof pilot</span><span class="c-pri"><span class="lbl">Priority </span>GATE</span><span class="c-prof"><span class="lbl">Profile </span>P07, P14</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:22 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Select one real external customer with a meaningful fixed workload and no required migration to Igneum.</p><h4>Steps</h4><ol><li>Agree program, inputs, proof format, deadline, price, failure/refund policy and verification method.</li><li>Run paid jobs through ordinary independently operated infrastructure.</li><li>Have the customer verify usefulness, correctness and its reason for choosing the service.</li></ol><h4>Accept</h4><p>The pilot satisfies its actual contract and settles genuine external payment. Trial subsidies are disclosed and cannot satisfy the repeat-demand gate; no invented customer or testimonial.</p><h4>Evidence the case requires</h4><p>Redacted contract; verified jobs; settlement proof; consented customer confirmation.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>main / the founder</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>60</dd></div><div><dt>Plan pages</dt><dd>4, 17, 18, 24, 26, 27, 31, 32, 33</dd></div></dl></div></details><details class="acc-case" id="case-COM-02" data-case="COM-02" data-state="NOT RUN"><summary><span class="c-id">COM-02</span><span class="c-title">Establish independent repeat purchasing</span><span class="c-pri"><span class="lbl">Priority </span>GATE</span><span class="c-prof"><span class="lbl">Profile </span>P14</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:22 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Use the P14 multi-customer observation period and ownership/conflict checks.</p><h4>Steps</h4><ol><li>Track paid purchases on distinct occasions, including refunds and stopped customers.</li><li>Audit related parties, project reimbursements, token grants and circular funding.</li><li>Reconcile external cash received with correctly delivered meaningful work.</li></ol><h4>Accept</h4><p>P14 buyer, duration and volume minima are met without reimbursement or related-party substitution. Repeat orders are separate buying decisions, not a single payment split into many jobs.</p><h4>Evidence the case requires</h4><p>Anonymised buyer ledger; repeat-order dates; conflict review; net receipts.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>main / the founder</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>60</dd></div><div><dt>Plan pages</dt><dd>4, 17, 18, 24, 26, 27, 31, 32, 33</dd></div></dl></div></details><details class="acc-case" id="case-COM-03" data-case="COM-03" data-state="NOT RUN"><summary><span class="c-id">COM-03</span><span class="c-title">Demonstrate service and operator margins</span><span class="c-pri"><span class="lbl">Priority </span>GATE</span><span class="c-prof"><span class="lbl">Profile </span>P12, P14</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:22 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Allocate all delivery costs, including aggregation, retries, hardware, power, host, network and support.</p><h4>Steps</h4><ol><li>Calculate gross contribution and fully loaded unit costs for each contracted workload.</li><li>Reconcile a representative operator's realised earnings against metered costs and opportunity cost.</li><li>Repeat under the declared demand and price sensitivities.</li></ol><h4>Accept</h4><p>P14 contribution targets hold and at least the required operator cohort has positive realised contribution. Excluded overhead is visible; token appreciation or unpriced founder labour cannot silently create profitability.</p><h4>Evidence the case requires</h4><p>Unit-economics ledger; metered operator sample; allocation rules; sensitivity report.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>main / the founder</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>60</dd></div><div><dt>Plan pages</dt><dd>4, 17, 18, 24, 26, 27, 31, 32, 33</dd></div></dl></div></details><details class="acc-case" id="case-COM-04" data-case="COM-04" data-state="NOT RUN"><summary><span class="c-id">COM-04</span><span class="c-title">Meet the customer service guarantee</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P01, P07, P14</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:22 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Observe actual delivery deadlines, validity, failure handling and support over the contracted period.</p><h4>Steps</h4><ol><li>Count all accepted jobs, including failed, retried and abandoned cases.</li><li>Have the customer independently verify results and invoke one authorised refund/failure exercise.</li><li>Compare offered capacity and quoted price with what was actually delivered.</li></ol><h4>Accept</h4><p>P07 and contracted obligations hold; validity has zero accepted exceptions. Failure terms are honoured, and demand beyond capacity is explicitly refused rather than quietly omitted from metrics.</p><h4>Evidence the case requires</h4><p>Customer-verifier records; SLO report; refunds; promised-versus-delivered comparison.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>main / the founder</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>61</dd></div><div><dt>Plan pages</dt><dd>4, 17, 18, 24, 26, 27, 31, 32, 33</dd></div></dl></div></details><details class="acc-case" id="case-COM-05" data-case="COM-05" data-state="NOT RUN"><summary><span class="c-id">COM-05</span><span class="c-title">Compare against the buyer's real alternative</span><span class="c-pri"><span class="lbl">Priority </span>GATE</span><span class="c-prof"><span class="lbl">Profile </span>P14, P15</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:22 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Identify a credible alternative supplier or in-house option for the same workload, proof format and security.</p><h4>Steps</h4><ol><li>Obtain comparable quotes or consented measured trials at the evaluation date.</li><li>Include integration, verification, deadlines and all operational costs, not only proof-generation time.</li><li>Document the customer's actual trade-off without inventing unavailable comparator evidence.</li></ol><h4>Accept</h4><p>P15 commercial comparison is satisfied with like-for-like scope and a evidenced purchase reason. Missing alternative data remains MISSING; it is not scored as an Igneum win.</p><h4>Evidence the case requires</h4><p>Dated comparison; workload/security match; customer decision record.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>main / the founder</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>61</dd></div><div><dt>Plan pages</dt><dd>4, 17, 18, 24, 26, 27, 31, 32, 33</dd></div></dl></div></details><details class="acc-case" id="case-COM-06" data-case="COM-06" data-state="NOT RUN"><summary><span class="c-id">COM-06</span><span class="c-title">Retain buyers after the pilot and subsidy period</span><span class="c-pri"><span class="lbl">Priority </span>GATE</span><span class="c-prof"><span class="lbl">Profile </span>P14</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:22 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Follow all recruited customers through the P14 observation period, including churn.</p><h4>Steps</h4><ol><li>Remove disclosed trial incentives before measuring repeat demand.</li><li>Track renewal, expansion, cancellation reasons, unresolved incidents and buyer concentration.</li><li>Review whether one affiliated or subsidised buyer dominates the apparent market.</li></ol><h4>Accept</h4><p>P14 repeat/concentration conditions hold with honest denominator and churn reporting. Paying demand survives beyond a demonstration; unsatisfied or departed buyers are not removed retrospectively.</p><h4>Evidence the case requires</h4><p>Cohort/renewal ledger; churn notes; concentration and incentive report.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>main / the founder</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>61</dd></div><div><dt>Plan pages</dt><dd>4, 17, 18, 24, 26, 27, 31, 32, 33</dd></div></dl></div></details><details class="acc-case" id="case-COM-07" data-case="COM-07" data-state="DEFERRED"><summary><span class="c-id">COM-07</span><span class="c-title">Fund maintenance without assumed appreciation</span><span class="c-pri"><span class="lbl">Priority </span>GATE</span><span class="c-prof"><span class="lbl">Profile </span>P13</span><span class="c-st"><span class="acc-chip s-deferred" data-state="DEFERRED">DEFERRED</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>2026-10-08 18:3x UK (the founder: forget P13 for now)</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Prepare a costed plan for development, review, infrastructure, support and incident response.</p><h4>Steps</h4><ol><li>Separate committed resources from revenue dependent on adoption or token price.</li><li>Stress lower income and an unexpected security/operations expense.</li><li>Verify responsible owners and continuity arrangements without changing fair-launch promises.</li></ol><h4>Accept</h4><p>P13 committed-runway requirement holds and downside responses are documented. No uncommitted financing, rising token price or burn accounting is presented as available maintenance funding.</p><h4>Evidence the case requires</h4><p>Budget and commitment evidence; downside plan; owner/continuity roster.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>main / the founder</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>62</dd></div><div><dt>Plan pages</dt><dd>4, 17, 18, 24, 26, 27, 31, 32, 33</dd></div></dl></div></details><details class="acc-case" id="case-COM-08" data-case="COM-08" data-state="NOT RUN"><summary><span class="c-id">COM-08</span><span class="c-title">Let independent developers build useful integrations</span><span class="c-pri"><span class="lbl">Priority </span>GATE</span><span class="c-prof"><span class="lbl">Profile </span>P09, P14</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>2026-10-08 18:3x UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Recruit unaffiliated developers unfamiliar with unpublished implementation details.</p><h4>Steps</h4><ol><li>Use public docs to deploy a supported application or integrate an external proof request and verification flow.</li><li>Record time, undocumented dependencies, workarounds and correctness issues.</li><li>Retest after documentation fixes without founder-written hidden integration code.</li></ol><h4>Accept</h4><p>P14 developer-task minimum passes on the final release; all required public instructions exist. Successful bytecode deployment alone does not count as a working application or service integration.</p><h4>Evidence the case requires</h4><p>Consented developer logs; public examples; issue closure; verified end-to-end journeys.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Independent integration study</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>main / the founder</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>62</dd></div><div><dt>Plan pages</dt><dd>4, 17, 18, 24, 26, 27, 31, 32, 33</dd></div></dl></div></details></div></div></section><section class="section acc-suite" id="suite-LEAD"><div class="container"><div class="acc-suite-head"><div class="acc-suite-code"><span class="n">16</span>LEAD</div><div class="acc-suite-t"><h2>Comparative leadership evidence</h2><p class="acc-sub">A serious contention claim requires comparative outcomes and real adoption evidence, not just an internally green test dashboard.</p></div><div class="acc-suite-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></div></div><dl class="acc-facts"><div><dt>Owner</dt><dd>Independent assessment panel + product/economics reviewers</dd></div><div><dt>Gate</dt><dd>Leadership-contender decision</dd></div><div><dt>Fixtures</dt><dd>F8 peer/customer studies; full signed technical evidence; 90-day observation</dd></div><div><dt>Plan pages</dt><dd>4, 22, 25, 27, 31, 32, 33</dd></div></dl><div class="acc-suite-bar"><div class="acc-bar" role="img" aria-label="LEAD: 8 cases: 0 passed under the standard, 0 running with team evidence, 8 not run, 0 deferred"><span class="seg g-notrun" style="flex-grow:8" title="8 NOT RUN"></span></div><span>8 cases: 0 passed under the standard, 0 running with team evidence, 8 not run, 0 deferred</span></div><div class="acc-cases"><div class="acc-cases-h" aria-hidden="true"><span>Case</span><span>Title</span><span>Priority</span><span>Profile</span><span>Status</span><span>Evidence</span><span>Last run</span><span></span></div><details class="acc-case" id="case-LEAD-01" data-case="LEAD-01" data-state="NOT RUN"><summary><span class="c-id">LEAD-01</span><span class="c-title">Register a fair contemporary comparison</span><span class="c-pri"><span class="lbl">Priority </span>GATE</span><span class="c-prof"><span class="lbl">Profile </span>P15</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>2026-10-08 18:3x UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Choose at least the P15 peer coverage and an evaluation date before collecting confirmatory results.</p><h4>Steps</h4><ol><li>Include the plan's Ravencoin, Ergo and Firo reference set where comparable, then check for other relevant current options.</li><li>Freeze versions, supported hardware, methods, noninferiority margins and commercial alternatives.</li><li>Publish exclusions and prohibit cross-algorithm raw-hashrate comparisons.</li></ol><h4>Accept</h4><p>The protocol covers material alternatives fairly and is signed independently. A missing or non-comparable feature is not scored zero; no arbitrary universal rank is inferred from selected metrics.</p><h4>Evidence the case requires</h4><p>Timestamped peer protocol; source/version records; comparison/exclusion rationale.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Pre-registered comparative study</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>main / the founder</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>63</dd></div><div><dt>Plan pages</dt><dd>4, 22, 25, 27, 31, 32, 33</dd></div></dl></div></details><details class="acc-case" id="case-LEAD-02" data-case="LEAD-02" data-state="NOT RUN"><summary><span class="c-id">LEAD-02</span><span class="c-title">Demonstrate comparable operator advantages</span><span class="c-pri"><span class="lbl">Priority </span>GATE</span><span class="c-prof"><span class="lbl">Profile </span>P02, P10, P15</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:22 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Use matched user tasks and operating conditions on the selected GPU-first networks.</p><h4>Steps</h4><ol><li>Measure install-to-first-accepted-work, software overhead versus each network's tuned baseline, payout friction and retained control.</li><li>Measure rejection/availability under the same network conditions; report fees separately.</li><li>Use blinded analysis where possible and independent runs for decisive differences.</li></ol><h4>Accept</h4><p>P15 noninferiority and superiority requirements hold on meaningful comparable dimensions. No raw hashes from different algorithms are compared, and transient token price is not labelled engineering superiority.</p><h4>Evidence the case requires</h4><p>Matched task data; uncertainty/effect sizes; independent comparison report.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>site lane (a846fd66b5403e35a)</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>63</dd></div><div><dt>Plan pages</dt><dd>4, 22, 25, 27, 31, 32, 33</dd></div></dl></div></details><details class="acc-case" id="case-LEAD-03" data-case="LEAD-03" data-state="NOT RUN"><summary><span class="c-id">LEAD-03</span><span class="c-title">Substantiate the specialist-coexistence claim</span><span class="c-pri"><span class="lbl">Priority </span>GATE</span><span class="c-prof"><span class="lbl">Profile </span>P04, P12, P15</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:22 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Assemble G1-G4 plus frozen rules and all surviving-adversary assumptions.</p><h4>Steps</h4><ol><li>Have independent reviewers trace each public competitiveness statement to its narrowest evidence.</li><li>Separate measured GPUs, modelled silicon and economic scenarios in all summaries.</li><li>Evaluate residual uncertainty, excluded technologies and the no-new-rules counterfactual.</li></ol><h4>Accept</h4><p>All claimed envelopes meet P04/P12 without unsupported universal bounds. Reviewers agree the evidence supports scoped commodity competitiveness even when chips remain compatible; an exact chip-arrival probability is not inferred.</p><h4>Evidence the case requires</h4><p>Claim-to-evidence map; signed envelope review; limitations statement.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>main / the founder</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>63</dd></div><div><dt>Plan pages</dt><dd>4, 22, 25, 27, 31, 32, 33</dd></div></dl></div></details><details class="acc-case" id="case-LEAD-04" data-case="LEAD-04" data-state="NOT RUN"><summary><span class="c-id">LEAD-04</span><span class="c-title">Observe ordinary-operator retention and margins</span><span class="c-pri"><span class="lbl">Priority </span>GATE</span><span class="c-prof"><span class="lbl">Profile </span>P12, P16</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:22 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Recruit the P16 independent cohort before observing results; use privacy-preserving evidence.</p><h4>Steps</h4><ol><li>Follow participation, realised margin, hardware changes, failures and reasons for leaving for 90 days.</li><li>Report trial incentives separately and include every initial participant in retention denominators.</li><li>Compare behaviour with matched alternatives where feasible; disclose absence of an actual downturn.</li></ol><h4>Accept</h4><p>P16 retention/margin minima hold with verified independence and no removal of churned users. Simulated downturns cannot be called observed bear-market retention; historical claims stay limited to the period measured.</p><h4>Evidence the case requires</h4><p>Pseudonymous cohort ledger; margin/retention calculations; departure reasons.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>main / the founder</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>64</dd></div><div><dt>Plan pages</dt><dd>4, 22, 25, 27, 31, 32, 33</dd></div></dl></div></details><details class="acc-case" id="case-LEAD-05" data-case="LEAD-05" data-state="NOT RUN"><summary><span class="c-id">LEAD-05</span><span class="c-title">Measure control and dependency concentration</span><span class="c-pri"><span class="lbl">Priority </span>GATE</span><span class="c-prof"><span class="lbl">Profile </span>P11, P16</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:22 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Audit operational control of mining, voting, proving, aggregation, hosting and software distribution separately.</p><h4>Steps</h4><ol><li>Use opt-in attestations, observed dependencies and independent corroboration; disclose uncertain common ownership.</li><li>Compare concentration and provider-removal outcomes to the approved security and availability assumptions.</li><li>Check that pooled payments do not hide authority concentration and hardware vendors are not equated with operators.</li></ol><h4>Accept</h4><p>P11/P16 concentration requirements hold within disclosed uncertainty; unidentified control cannot be counted as independent. No single removable dependency is falsely marketed as decentralised operation.</p><h4>Evidence the case requires</h4><p>Control/failure-domain map; uncertainty notes; concentration/removal results.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>main / the founder</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>64</dd></div><div><dt>Plan pages</dt><dd>4, 22, 25, 27, 31, 32, 33</dd></div></dl></div></details><details class="acc-case" id="case-LEAD-06" data-case="LEAD-06" data-state="NOT RUN"><summary><span class="c-id">LEAD-06</span><span class="c-title">Complete the reliability observation window</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P01, P16</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:22 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Observe the final candidate and approved compatible updates for the full P16 real-time period.</p><h4>Steps</h4><ol><li>Measure promised service availability, invalid acceptance, finality safety, payouts and incident impact.</li><li>Reconcile external probes, customer records and operator logs, including maintenance and exclusions.</li><li>Repeat affected critical tests after every material change; reset observation where comparability breaks.</li></ol><h4>Accept</h4><p>P16 availability and safety criteria hold on live observation; no hidden downtime or compressed-time substitution. This supports the recorded window only, not multi-year operational maturity.</p><h4>Evidence the case requires</h4><p>90-day SLO ledger; independent probes; incident reports; change/retest history.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>main / the founder</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>64</dd></div><div><dt>Plan pages</dt><dd>4, 22, 25, 27, 31, 32, 33</dd></div></dl></div></details><details class="acc-case" id="case-LEAD-07" data-case="LEAD-07" data-state="NOT RUN"><summary><span class="c-id">LEAD-07</span><span class="c-title">Issue an independent contender assessment</span><span class="c-pri"><span class="lbl">Priority </span>GATE</span><span class="c-prof"><span class="lbl">Profile </span>P00, P15, P16</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>2026-10-08 18:3x UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Provide the full evidence packet, commercial results, comparative study and unresolved-limit register to the panel.</p><h4>Steps</h4><ol><li>Check every mandatory and claimed-option test, source requirement and approved threshold.</li><li>Require separate signoffs for hardware/economics, security/operations and customer/operator evidence.</li><li>Document dissent and challenge any inference that passing an internal checklist proves number-one rank.</li></ol><h4>Accept</h4><p>Every required gate is PASS with no unresolved material challenge, critical/high defect or missing comparator/customer evidence. The panel supports a credible leadership-contender conclusion within scope, not a guaranteed rank.</p><h4>Evidence the case requires</h4><p>Signed assessment; full status index; dissent/limitations; approved claim wording.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Independent final assessment</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>main / the founder</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>65</dd></div><div><dt>Plan pages</dt><dd>4, 22, 25, 27, 31, 32, 33</dd></div></dl></div></details><details class="acc-case" id="case-LEAD-08" data-case="LEAD-08" data-state="NOT RUN"><summary><span class="c-id">LEAD-08</span><span class="c-title">Keep leadership claims valid after release</span><span class="c-pri"><span class="lbl">Priority </span>GATE</span><span class="c-prof"><span class="lbl">Profile </span>P00, P16</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:22 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Define material-change triggers and scheduled reviews before publishing the assessment.</p><h4>Steps</h4><ol><li>Refresh competitor, hardware-cost, demand and security evidence at the P16 cadence.</li><li>Test a newly credible specialist, lost customer, major outage and verifier change against invalidation rules.</li><li>Withdraw or narrow stale claims promptly while publishing the new evidence status.</li></ol><h4>Accept</h4><p>Claims remain dated, scoped and revisable; material contrary evidence reopens the appropriate gate. The network may remain usable while a leadership claim is suspended. No permanent self-awarded certification.</p><h4>Evidence the case requires</h4><p>Review calendar; invalidation drills; versioned public claim register.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>main / the founder</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>65</dd></div><div><dt>Plan pages</dt><dd>4, 22, 25, 27, 31, 32, 33</dd></div></dl></div></details></div></div></section><section class="section acc-suite" id="suite-REV"><div class="container"><div class="acc-suite-head"><div class="acc-suite-code"><span class="n">17</span>REV</div><div class="acc-suite-t"><h2>REV: the external review's required regressions</h2><p class="acc-sub">44 regressions from 14 findings; each reads NOT RUN until its owner lane records a run</p></div><div class="acc-suite-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></div></div><dl class="acc-facts"><div><dt>Owner</dt><dd>the owner lanes per the dispatch table</dd></div><div><dt>Gate</dt><dd>Review findings closed</dd></div><div><dt>Fixtures</dt><dd>F0,F5</dd></div><div><dt>Plan pages</dt><dd>docs/analysis/review-2026-10-08-b/findings.json and docs/analysis/review-2026-10-08-b/dispatch.md</dd></div></dl><div class="acc-suite-bar"><div class="acc-bar" role="img" aria-label="REV: 44 cases: 0 passed under the standard, 0 running with team evidence, 44 not run, 0 deferred"><span class="seg g-notrun" style="flex-grow:44" title="44 NOT RUN"></span></div><span>44 cases: 0 passed under the standard, 0 running with team evidence, 44 not run, 0 deferred</span></div><div class="acc-cases"><div class="acc-cases-h" aria-hidden="true"><span>Case</span><span>Title</span><span>Priority</span><span>Profile</span><span>Status</span><span>Evidence</span><span>Last run</span><span></span></div><details class="acc-case" id="case-REV-F01-1" data-case="REV-F01-1" data-state="NOT RUN"><summary><span class="c-id">REV-F01-1</span><span class="c-title">Valid proof A, warm cache, carried statement B: refuse exactly as a cold node does.</span><span class="c-pri"><span class="lbl">Priority </span>P0</span><span class="c-prof"><span class="lbl">Profile </span>P00</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:32 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>The regression F01 requires (review finding F01: Proof-verdict cache omits the statement being verified).</p><h4>Steps</h4><ol><li>Valid proof A, warm cache, carried statement B: refuse exactly as a cold node does.</li></ol><h4>Accept</h4><p>Valid proof A, warm cache, carried statement B: refuse exactly as a cold node does.</p><h4>Evidence the case requires</h4><p>The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Every release candidate</dd></div><div><dt>Owner</dt><dd>proving lane, node lane</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Plan pages</dt><dd>F01</dd></div></dl></div></details><details class="acc-case" id="case-REV-F01-2" data-case="REV-F01-2" data-state="NOT RUN"><summary><span class="c-id">REV-F01-2</span><span class="c-title">Run valid/invalid contexts in both orders, concurrently and across cache eviction/restart.</span><span class="c-pri"><span class="lbl">Priority </span>P0</span><span class="c-prof"><span class="lbl">Profile </span>P00</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:32 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>The regression F01 requires (review finding F01: Proof-verdict cache omits the statement being verified).</p><h4>Steps</h4><ol><li>Run valid/invalid contexts in both orders, concurrently and across cache eviction/restart.</li></ol><h4>Accept</h4><p>Run valid/invalid contexts in both orders, concurrently and across cache eviction/restart.</p><h4>Evidence the case requires</h4><p>The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Every release candidate</dd></div><div><dt>Owner</dt><dd>proving lane, node lane</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Plan pages</dt><dd>F01</dd></div></dl></div></details><details class="acc-case" id="case-REV-F01-3" data-case="REV-F01-3" data-state="NOT RUN"><summary><span class="c-id">REV-F01-3</span><span class="c-title">Change payout, network, kind, program ID and activation context; no accepted misbinding.</span><span class="c-pri"><span class="lbl">Priority </span>P0</span><span class="c-prof"><span class="lbl">Profile </span>P00</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:32 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>The regression F01 requires (review finding F01: Proof-verdict cache omits the statement being verified).</p><h4>Steps</h4><ol><li>Change payout, network, kind, program ID and activation context; no accepted misbinding.</li></ol><h4>Accept</h4><p>Change payout, network, kind, program ID and activation context; no accepted misbinding.</p><h4>Evidence the case requires</h4><p>The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Every release candidate</dd></div><div><dt>Owner</dt><dd>proving lane, node lane</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Plan pages</dt><dd>F01</dd></div></dl></div></details><details class="acc-case" id="case-REV-F01-4" data-case="REV-F01-4" data-state="NOT RUN"><summary><span class="c-id">REV-F01-4</span><span class="c-title">A native two-node test must agree on block validity and payouts despite different cache histories.</span><span class="c-pri"><span class="lbl">Priority </span>P0</span><span class="c-prof"><span class="lbl">Profile </span>P00</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:32 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>The regression F01 requires (review finding F01: Proof-verdict cache omits the statement being verified).</p><h4>Steps</h4><ol><li>A native two-node test must agree on block validity and payouts despite different cache histories.</li></ol><h4>Accept</h4><p>A native two-node test must agree on block validity and payouts despite different cache histories.</p><h4>Evidence the case requires</h4><p>The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Every release candidate</dd></div><div><dt>Owner</dt><dd>proving lane, node lane</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Plan pages</dt><dd>F01</dd></div></dl></div></details><details class="acc-case" id="case-REV-F02-1" data-case="REV-F02-1" data-state="NOT RUN"><summary><span class="c-id">REV-F02-1</span><span class="c-title">Release build cannot activate test bypass.</span><span class="c-pri"><span class="lbl">Priority </span>P0</span><span class="c-prof"><span class="lbl">Profile </span>P00</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:32 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>The regression F02 requires (review finding F02: Proof-rule infrastructure can fail open).</p><h4>Steps</h4><ol><li>Release build cannot activate test bypass.</li></ol><h4>Accept</h4><p>Release build cannot activate test bypass.</p><h4>Evidence the case requires</h4><p>The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Every release candidate</dd></div><div><dt>Owner</dt><dd>proving lane, CI steward</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Plan pages</dt><dd>F02</dd></div></dl></div></details><details class="acc-case" id="case-REV-F02-2" data-case="REV-F02-2" data-state="NOT RUN"><summary><span class="c-id">REV-F02-2</span><span class="c-title">Missing oracle or pinned keys prevents service readiness after enforcement activation.</span><span class="c-pri"><span class="lbl">Priority </span>P0</span><span class="c-prof"><span class="lbl">Profile </span>P00</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:32 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>The regression F02 requires (review finding F02: Proof-rule infrastructure can fail open).</p><h4>Steps</h4><ol><li>Missing oracle or pinned keys prevents service readiness after enforcement activation.</li></ol><h4>Accept</h4><p>Missing oracle or pinned keys prevents service readiness after enforcement activation.</p><h4>Evidence the case requires</h4><p>The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Every release candidate</dd></div><div><dt>Owner</dt><dd>proving lane, CI steward</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Plan pages</dt><dd>F02</dd></div></dl></div></details><details class="acc-case" id="case-REV-F02-3" data-case="REV-F02-3" data-state="NOT RUN"><summary><span class="c-id">REV-F02-3</span><span class="c-title">Missing proof bytes retry without incorrectly marking a valid block permanently invalid.</span><span class="c-pri"><span class="lbl">Priority </span>P0</span><span class="c-prof"><span class="lbl">Profile </span>P00</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:32 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>The regression F02 requires (review finding F02: Proof-rule infrastructure can fail open).</p><h4>Steps</h4><ol><li>Missing proof bytes retry without incorrectly marking a valid block permanently invalid.</li></ol><h4>Accept</h4><p>Missing proof bytes retry without incorrectly marking a valid block permanently invalid.</p><h4>Evidence the case requires</h4><p>The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Every release candidate</dd></div><div><dt>Owner</dt><dd>proving lane, CI steward</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Plan pages</dt><dd>F02</dd></div></dl></div></details><details class="acc-case" id="case-REV-F03-1" data-case="REV-F03-1" data-state="NOT RUN"><summary><span class="c-id">REV-F03-1</span><span class="c-title">Clean build from one manifest, including the pool and workers, with no unpublished vendor tree.</span><span class="c-pri"><span class="lbl">Priority </span>P0</span><span class="c-prof"><span class="lbl">Profile </span>P00</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:32 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>The regression F03 requires (review finding F03: The bundle contains a v6 candidate, not a demonstrated integrated v6 release).</p><h4>Steps</h4><ol><li>Clean build from one manifest, including the pool and workers, with no unpublished vendor tree.</li></ol><h4>Accept</h4><p>Clean build from one manifest, including the pool and workers, with no unpublished vendor tree.</p><h4>Evidence the case requires</h4><p>The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Every release candidate</dd></div><div><dt>Owner</dt><dd>CI steward, hash lane (ProgramClass::V6 on freeze), pool lane</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Plan pages</dt><dd>F03</dd></div></dl></div></details><details class="acc-case" id="case-REV-F03-2" data-case="REV-F03-2" data-state="NOT RUN"><summary><span class="c-id">REV-F03-2</span><span class="c-title">Same job context produces identical accepted work in node, CPU reference, CUDA, Metal, OpenCL and pool.</span><span class="c-pri"><span class="lbl">Priority </span>P0</span><span class="c-prof"><span class="lbl">Profile </span>P00</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:32 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>The regression F03 requires (review finding F03: The bundle contains a v6 candidate, not a demonstrated integrated v6 release).</p><h4>Steps</h4><ol><li>Same job context produces identical accepted work in node, CPU reference, CUDA, Metal, OpenCL and pool.</li></ol><h4>Accept</h4><p>Same job context produces identical accepted work in node, CPU reference, CUDA, Metal, OpenCL and pool.</p><h4>Evidence the case requires</h4><p>The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Every release candidate</dd></div><div><dt>Owner</dt><dd>CI steward, hash lane (ProgramClass::V6 on freeze), pool lane</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Plan pages</dt><dd>F03</dd></div></dl></div></details><details class="acc-case" id="case-REV-F03-3" data-case="REV-F03-3" data-state="NOT RUN"><summary><span class="c-id">REV-F03-3</span><span class="c-title">Cross every scheduled transition with old/new client behavior documented and identical rule identities.</span><span class="c-pri"><span class="lbl">Priority </span>P0</span><span class="c-prof"><span class="lbl">Profile </span>P00</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:32 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>The regression F03 requires (review finding F03: The bundle contains a v6 candidate, not a demonstrated integrated v6 release).</p><h4>Steps</h4><ol><li>Cross every scheduled transition with old/new client behavior documented and identical rule identities.</li></ol><h4>Accept</h4><p>Cross every scheduled transition with old/new client behavior documented and identical rule identities.</p><h4>Evidence the case requires</h4><p>The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Every release candidate</dd></div><div><dt>Owner</dt><dd>CI steward, hash lane (ProgramClass::V6 on freeze), pool lane</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Plan pages</dt><dd>F03</dd></div></dl></div></details><details class="acc-case" id="case-REV-F04-1" data-case="REV-F04-1" data-state="NOT RUN"><summary><span class="c-id">REV-F04-1</span><span class="c-title">Native multi-node 40/40/20 partition, equivocation and dust-valid mining on both sides past the window.</span><span class="c-pri"><span class="lbl">Priority </span>P0</span><span class="c-prof"><span class="lbl">Profile </span>P00</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:32 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>The regression F04 requires (review finding F04: Finality v4 recovery deliberately has a weaker safety boundary).</p><h4>Steps</h4><ol><li>Native multi-node 40/40/20 partition, equivocation and dust-valid mining on both sides past the window.</li></ol><h4>Accept</h4><p>Native multi-node 40/40/20 partition, equivocation and dust-valid mining on both sides past the window.</p><h4>Evidence the case requires</h4><p>The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Every release candidate</dd></div><div><dt>Owner</dt><dd>node lane, reference apps, site (explorer)</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Plan pages</dt><dd>F04</dd></div></dl></div></details><details class="acc-case" id="case-REV-F04-2" data-case="REV-F04-2" data-state="NOT RUN"><summary><span class="c-id">REV-F04-2</span><span class="c-title">Proof that the chosen recovery guarantee matches the public finality claim; two valid contradictory certificates are a hard failure for strong finality.</span><span class="c-pri"><span class="lbl">Priority </span>P0</span><span class="c-prof"><span class="lbl">Profile </span>P00</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:32 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>The regression F04 requires (review finding F04: Finality v4 recovery deliberately has a weaker safety boundary).</p><h4>Steps</h4><ol><li>Proof that the chosen recovery guarantee matches the public finality claim; two valid contradictory certificates are a hard failure for strong finality.</li></ol><h4>Accept</h4><p>Proof that the chosen recovery guarantee matches the public finality claim; two valid contradictory certificates are a hard failure for strong finality.</p><h4>Evidence the case requires</h4><p>The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Every release candidate</dd></div><div><dt>Owner</dt><dd>node lane, reference apps, site (explorer)</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Plan pages</dt><dd>F04</dd></div></dl></div></details><details class="acc-case" id="case-REV-F04-3" data-case="REV-F04-3" data-state="NOT RUN"><summary><span class="c-id">REV-F04-3</span><span class="c-title">Pause-only resume with historical backfill, missing historical data and all old keys returning.</span><span class="c-pri"><span class="lbl">Priority </span>P0</span><span class="c-prof"><span class="lbl">Profile </span>P00</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:32 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>The regression F04 requires (review finding F04: Finality v4 recovery deliberately has a weaker safety boundary).</p><h4>Steps</h4><ol><li>Pause-only resume with historical backfill, missing historical data and all old keys returning.</li></ol><h4>Accept</h4><p>Pause-only resume with historical backfill, missing historical data and all old keys returning.</p><h4>Evidence the case requires</h4><p>The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Every release candidate</dd></div><div><dt>Owner</dt><dd>node lane, reference apps, site (explorer)</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Plan pages</dt><dd>F04</dd></div></dl></div></details><details class="acc-case" id="case-REV-F04-4" data-case="REV-F04-4" data-state="NOT RUN"><summary><span class="c-id">REV-F04-4</span><span class="c-title">Wallet, receipt and oracle consumers distinguish any weaker recovery state.</span><span class="c-pri"><span class="lbl">Priority </span>P0</span><span class="c-prof"><span class="lbl">Profile </span>P00</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:32 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>The regression F04 requires (review finding F04: Finality v4 recovery deliberately has a weaker safety boundary).</p><h4>Steps</h4><ol><li>Wallet, receipt and oracle consumers distinguish any weaker recovery state.</li></ol><h4>Accept</h4><p>Wallet, receipt and oracle consumers distinguish any weaker recovery state.</p><h4>Evidence the case requires</h4><p>The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Every release candidate</dd></div><div><dt>Owner</dt><dd>node lane, reference apps, site (explorer)</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Plan pages</dt><dd>F04</dd></div></dl></div></details><details class="acc-case" id="case-REV-F05-1" data-case="REV-F05-1" data-state="NOT RUN"><summary><span class="c-id">REV-F05-1</span><span class="c-title">Native reference-vs-incremental expression equivalence across all source registers and real instruction updates.</span><span class="c-pri"><span class="lbl">Priority </span>P1</span><span class="c-prof"><span class="lbl">Profile </span>P00</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:32 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>The regression F05 requires (review finding F05: reg64 address coupling has an exact incremental alternative).</p><h4>Steps</h4><ol><li>Native reference-vs-incremental expression equivalence across all source registers and real instruction updates.</li></ol><h4>Accept</h4><p>Native reference-vs-incremental expression equivalence across all source registers and real instruction updates.</p><h4>Evidence the case requires</h4><p>The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Every release candidate</dd></div><div><dt>Owner</dt><dd>hash lane, adversary lane, floor lane 3</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Plan pages</dt><dd>F05</dd></div></dl></div></details><details class="acc-case" id="case-REV-F05-2" data-case="REV-F05-2" data-state="NOT RUN"><summary><span class="c-id">REV-F05-2</span><span class="c-title">Full-kernel output equivalence, registers, spills, wall power and accepted throughput across target GPUs.</span><span class="c-pri"><span class="lbl">Priority </span>P1</span><span class="c-prof"><span class="lbl">Profile </span>P00</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:32 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>The regression F05 requires (review finding F05: reg64 address coupling has an exact incremental alternative).</p><h4>Steps</h4><ol><li>Full-kernel output equivalence, registers, spills, wall power and accepted throughput across target GPUs.</li></ol><h4>Accept</h4><p>Full-kernel output equivalence, registers, spills, wall power and accepted throughput across target GPUs.</p><h4>Evidence the case requires</h4><p>The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Every release candidate</dd></div><div><dt>Owner</dt><dd>hash lane, adversary lane, floor lane 3</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Plan pages</dt><dd>F05</dd></div></dl></div></details><details class="acc-case" id="case-REV-F05-3" data-case="REV-F05-3" data-state="NOT RUN"><summary><span class="c-id">REV-F05-3</span><span class="c-title">Adversary physical design includes prefix caching/recomputation cost; no assumed full 63-read cost on every load.</span><span class="c-pri"><span class="lbl">Priority </span>P1</span><span class="c-prof"><span class="lbl">Profile </span>P00</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:32 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>The regression F05 requires (review finding F05: reg64 address coupling has an exact incremental alternative).</p><h4>Steps</h4><ol><li>Adversary physical design includes prefix caching/recomputation cost; no assumed full 63-read cost on every load.</li></ol><h4>Accept</h4><p>Adversary physical design includes prefix caching/recomputation cost; no assumed full 63-read cost on every load.</p><h4>Evidence the case requires</h4><p>The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Every release candidate</dd></div><div><dt>Owner</dt><dd>hash lane, adversary lane, floor lane 3</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Plan pages</dt><dd>F05</dd></div></dl></div></details><details class="acc-case" id="case-REV-F06-1" data-case="REV-F06-1" data-state="NOT RUN"><summary><span class="c-id">REV-F06-1</span><span class="c-title">Acceptance/reference/emitter evaluate the same activated schedule.</span><span class="c-pri"><span class="lbl">Priority </span>P1</span><span class="c-prof"><span class="lbl">Profile </span>P00</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:32 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>The regression F06 requires (review finding F06: The v6 acceptance and census gates are not complete for the final execution).</p><h4>Steps</h4><ol><li>Acceptance/reference/emitter evaluate the same activated schedule.</li></ol><h4>Accept</h4><p>Acceptance/reference/emitter evaluate the same activated schedule.</p><h4>Evidence the case requires</h4><p>The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Every release candidate</dd></div><div><dt>Owner</dt><dd>hash lane, research lane D</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Plan pages</dt><dd>F06</dd></div></dl></div></details><details class="acc-case" id="case-REV-F06-2" data-case="REV-F06-2" data-state="NOT RUN"><summary><span class="c-id">REV-F06-2</span><span class="c-title">Full live-dataset census on unseen seeds and the complete v6 pack.</span><span class="c-pri"><span class="lbl">Priority </span>P1</span><span class="c-prof"><span class="lbl">Profile </span>P00</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:32 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>The regression F06 requires (review finding F06: The v6 acceptance and census gates are not complete for the final execution).</p><h4>Steps</h4><ol><li>Full live-dataset census on unseen seeds and the complete v6 pack.</li></ol><h4>Accept</h4><p>Full live-dataset census on unseen seeds and the complete v6 pack.</p><h4>Evidence the case requires</h4><p>The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Every release candidate</dd></div><div><dt>Owner</dt><dd>hash lane, research lane D</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Plan pages</dt><dd>F06</dd></div></dl></div></details><details class="acc-case" id="case-REV-F06-3" data-case="REV-F06-3" data-state="NOT RUN"><summary><span class="c-id">REV-F06-3</span><span class="c-title">A failed experimental rule does not silently exhaust generation or bypass the intended resource requirement.</span><span class="c-pri"><span class="lbl">Priority </span>P1</span><span class="c-prof"><span class="lbl">Profile </span>P00</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:32 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>The regression F06 requires (review finding F06: The v6 acceptance and census gates are not complete for the final execution).</p><h4>Steps</h4><ol><li>A failed experimental rule does not silently exhaust generation or bypass the intended resource requirement.</li></ol><h4>Accept</h4><p>A failed experimental rule does not silently exhaust generation or bypass the intended resource requirement.</p><h4>Evidence the case requires</h4><p>The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Every release candidate</dd></div><div><dt>Owner</dt><dd>hash lane, research lane D</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Plan pages</dt><dd>F06</dd></div></dl></div></details><details class="acc-case" id="case-REV-F07-1" data-case="REV-F07-1" data-state="NOT RUN"><summary><span class="c-id">REV-F07-1</span><span class="c-title">Same final v6 configuration: mine -&gt; evict -&gt; prove -&gt; aggregate -&gt; submit -&gt; rebuild -&gt; resume; no leaked reservations.</span><span class="c-pri"><span class="lbl">Priority </span>P1</span><span class="c-prof"><span class="lbl">Profile </span>P00</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:32 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>The regression F07 requires (review finding F07: VRAM admission and proving deadlines need one operator-level scheduler).</p><h4>Steps</h4><ol><li>Same final v6 configuration: mine -&gt; evict -&gt; prove -&gt; aggregate -&gt; submit -&gt; rebuild -&gt; resume; no leaked reservations.</li></ol><h4>Accept</h4><p>Same final v6 configuration: mine -&gt; evict -&gt; prove -&gt; aggregate -&gt; submit -&gt; rebuild -&gt; resume; no leaked reservations.</p><h4>Evidence the case requires</h4><p>The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Every release candidate</dd></div><div><dt>Owner</dt><dd>app lane, fleet lane</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Plan pages</dt><dd>F07</dd></div></dl></div></details><details class="acc-case" id="case-REV-F07-2" data-case="REV-F07-2" data-state="NOT RUN"><summary><span class="c-id">REV-F07-2</span><span class="c-title">OOM, process crash and stale work recover without losing wallet state or silently consuming power.</span><span class="c-pri"><span class="lbl">Priority </span>P1</span><span class="c-prof"><span class="lbl">Profile </span>P00</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:32 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>The regression F07 requires (review finding F07: VRAM admission and proving deadlines need one operator-level scheduler).</p><h4>Steps</h4><ol><li>OOM, process crash and stale work recover without losing wallet state or silently consuming power.</li></ol><h4>Accept</h4><p>OOM, process crash and stale work recover without losing wallet state or silently consuming power.</p><h4>Evidence the case requires</h4><p>The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Every release candidate</dd></div><div><dt>Owner</dt><dd>app lane, fleet lane</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Plan pages</dt><dd>F07</dd></div></dl></div></details><details class="acc-case" id="case-REV-F07-3" data-case="REV-F07-3" data-state="NOT RUN"><summary><span class="c-id">REV-F07-3</span><span class="c-title">16 GB+ simultaneous mode only after measured peak plus next-epoch headroom; smaller-card modes labelled separately.</span><span class="c-pri"><span class="lbl">Priority </span>P1</span><span class="c-prof"><span class="lbl">Profile </span>P00</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:32 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>The regression F07 requires (review finding F07: VRAM admission and proving deadlines need one operator-level scheduler).</p><h4>Steps</h4><ol><li>16 GB+ simultaneous mode only after measured peak plus next-epoch headroom; smaller-card modes labelled separately.</li></ol><h4>Accept</h4><p>16 GB+ simultaneous mode only after measured peak plus next-epoch headroom; smaller-card modes labelled separately.</p><h4>Evidence the case requires</h4><p>The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Every release candidate</dd></div><div><dt>Owner</dt><dd>app lane, fleet lane</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Plan pages</dt><dd>F07</dd></div></dl></div></details><details class="acc-case" id="case-REV-F08-1" data-case="REV-F08-1" data-state="NOT RUN"><summary><span class="c-id">REV-F08-1</span><span class="c-title">Report every eligible job outcome, including expired work; a bounded list cannot hide losses.</span><span class="c-pri"><span class="lbl">Priority </span>P1</span><span class="c-prof"><span class="lbl">Profile </span>P00</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:32 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>The regression F08 requires (review finding F08: The proving pipeline reports waste and deadline censoring, not sustained capacity).</p><h4>Steps</h4><ol><li>Report every eligible job outcome, including expired work; a bounded list cannot hide losses.</li></ol><h4>Accept</h4><p>Report every eligible job outcome, including expired work; a bounded list cannot hide losses.</p><h4>Evidence the case requires</h4><p>The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Every release candidate</dd></div><div><dt>Owner</dt><dd>proving lane, fleet lane, site (ops page)</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Plan pages</dt><dd>F08</dd></div></dl></div></details><details class="acc-case" id="case-REV-F08-2" data-case="REV-F08-2" data-state="NOT RUN"><summary><span class="c-id">REV-F08-2</span><span class="c-title">Consumer tiers complete and receive payment for declared jobs before claims about income.</span><span class="c-pri"><span class="lbl">Priority </span>P1</span><span class="c-prof"><span class="lbl">Profile </span>P00</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:32 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>The regression F08 requires (review finding F08: The proving pipeline reports waste and deadline censoring, not sustained capacity).</p><h4>Steps</h4><ol><li>Consumer tiers complete and receive payment for declared jobs before claims about income.</li></ol><h4>Accept</h4><p>Consumer tiers complete and receive payment for declared jobs before claims about income.</p><h4>Evidence the case requires</h4><p>The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Every release candidate</dd></div><div><dt>Owner</dt><dd>proving lane, fleet lane, site (ops page)</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Plan pages</dt><dd>F08</dd></div></dl></div></details><details class="acc-case" id="case-REV-F08-3" data-case="REV-F08-3" data-state="NOT RUN"><summary><span class="c-id">REV-F08-3</span><span class="c-title">Sustained real workload across class transitions, with restart/retry and no publisher intervention.</span><span class="c-pri"><span class="lbl">Priority </span>P1</span><span class="c-prof"><span class="lbl">Profile </span>P00</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:32 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>The regression F08 requires (review finding F08: The proving pipeline reports waste and deadline censoring, not sustained capacity).</p><h4>Steps</h4><ol><li>Sustained real workload across class transitions, with restart/retry and no publisher intervention.</li></ol><h4>Accept</h4><p>Sustained real workload across class transitions, with restart/retry and no publisher intervention.</p><h4>Evidence the case requires</h4><p>The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Every release candidate</dd></div><div><dt>Owner</dt><dd>proving lane, fleet lane, site (ops page)</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Plan pages</dt><dd>F08</dd></div></dl></div></details><details class="acc-case" id="case-REV-F09-1" data-case="REV-F09-1" data-state="NOT RUN"><summary><span class="c-id">REV-F09-1</span><span class="c-title">Generate all pass/fail cells directly from the declared inequalities and inputs.</span><span class="c-pri"><span class="lbl">Priority </span>P1</span><span class="c-prof"><span class="lbl">Profile </span>P00</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:32 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>The regression F09 requires (review finding F09: The economic model explicitly retains a failed specialist case).</p><h4>Steps</h4><ol><li>Generate all pass/fail cells directly from the declared inequalities and inputs.</li></ol><h4>Accept</h4><p>Generate all pass/fail cells directly from the declared inequalities and inputs.</p><h4>Evidence the case requires</h4><p>The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Every release candidate</dd></div><div><dt>Owner</dt><dd>research lane, floor lane 3, coordinator</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Plan pages</dt><dd>F09</dd></div></dl></div></details><details class="acc-case" id="case-REV-F09-2" data-case="REV-F09-2" data-state="NOT RUN"><summary><span class="c-id">REV-F09-2</span><span class="c-title">Independent feasibility and cost evaluation of the strongest modeled SRAM/hybrid opponent.</span><span class="c-pri"><span class="lbl">Priority </span>P1</span><span class="c-prof"><span class="lbl">Profile </span>P00</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:32 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>The regression F09 requires (review finding F09: The economic model explicitly retains a failed specialist case).</p><h4>Steps</h4><ol><li>Independent feasibility and cost evaluation of the strongest modeled SRAM/hybrid opponent.</li></ol><h4>Accept</h4><p>Independent feasibility and cost evaluation of the strongest modeled SRAM/hybrid opponent.</p><h4>Evidence the case requires</h4><p>The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Every release candidate</dd></div><div><dt>Owner</dt><dd>research lane, floor lane 3, coordinator</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Plan pages</dt><dd>F09</dd></div></dl></div></details><details class="acc-case" id="case-REV-F09-3" data-case="REV-F09-3" data-state="NOT RUN"><summary><span class="c-id">REV-F09-3</span><span class="c-title">GPU owners and entrants remain viable under the approved scenario envelope without assuming chip absence or death.</span><span class="c-pri"><span class="lbl">Priority </span>P1</span><span class="c-prof"><span class="lbl">Profile </span>P00</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:32 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>The regression F09 requires (review finding F09: The economic model explicitly retains a failed specialist case).</p><h4>Steps</h4><ol><li>GPU owners and entrants remain viable under the approved scenario envelope without assuming chip absence or death.</li></ol><h4>Accept</h4><p>GPU owners and entrants remain viable under the approved scenario envelope without assuming chip absence or death.</p><h4>Evidence the case requires</h4><p>The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Every release candidate</dd></div><div><dt>Owner</dt><dd>research lane, floor lane 3, coordinator</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Plan pages</dt><dd>F09</dd></div></dl></div></details><details class="acc-case" id="case-REV-F10-1" data-case="REV-F10-1" data-state="NOT RUN"><summary><span class="c-id">REV-F10-1</span><span class="c-title">Compare exact found nonce/hash sets with full-read mode, including all-hit overflow and zero-hit cases.</span><span class="c-pri"><span class="lbl">Priority </span>P2</span><span class="c-prof"><span class="lbl">Profile </span>P00</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:32 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>The regression F10 requires (review finding F10: CUDA production readback has an existing OpenCL optimization to borrow).</p><h4>Steps</h4><ol><li>Compare exact found nonce/hash sets with full-read mode, including all-hit overflow and zero-hit cases.</li></ol><h4>Accept</h4><p>Compare exact found nonce/hash sets with full-read mode, including all-hit overflow and zero-hit cases.</p><h4>Evidence the case requires</h4><p>The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Every release candidate</dd></div><div><dt>Owner</dt><dd>worker lane (new)</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Plan pages</dt><dd>F10</dd></div></dl></div></details><details class="acc-case" id="case-REV-F10-2" data-case="REV-F10-2" data-state="NOT RUN"><summary><span class="c-id">REV-F10-2</span><span class="c-title">Test stale jobs, high-32 rollover, tail batches and asynchronous buffer reuse.</span><span class="c-pri"><span class="lbl">Priority </span>P2</span><span class="c-prof"><span class="lbl">Profile </span>P00</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:32 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>The regression F10 requires (review finding F10: CUDA production readback has an existing OpenCL optimization to borrow).</p><h4>Steps</h4><ol><li>Test stale jobs, high-32 rollover, tail batches and asynchronous buffer reuse.</li></ol><h4>Accept</h4><p>Test stale jobs, high-32 rollover, tail batches and asynchronous buffer reuse.</p><h4>Evidence the case requires</h4><p>The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Every release candidate</dd></div><div><dt>Owner</dt><dd>worker lane (new)</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Plan pages</dt><dd>F10</dd></div></dl></div></details><details class="acc-case" id="case-REV-F10-3" data-case="REV-F10-3" data-state="NOT RUN"><summary><span class="c-id">REV-F10-3</span><span class="c-title">Compare production throughput and wall energy, not only the isolated kernel timer.</span><span class="c-pri"><span class="lbl">Priority </span>P2</span><span class="c-prof"><span class="lbl">Profile </span>P00</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:32 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>The regression F10 requires (review finding F10: CUDA production readback has an existing OpenCL optimization to borrow).</p><h4>Steps</h4><ol><li>Compare production throughput and wall energy, not only the isolated kernel timer.</li></ol><h4>Accept</h4><p>Compare production throughput and wall energy, not only the isolated kernel timer.</p><h4>Evidence the case requires</h4><p>The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Every release candidate</dd></div><div><dt>Owner</dt><dd>worker lane (new)</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Plan pages</dt><dd>F10</dd></div></dl></div></details><details class="acc-case" id="case-REV-F11-1" data-case="REV-F11-1" data-state="NOT RUN"><summary><span class="c-id">REV-F11-1</span><span class="c-title">Goal switch from an efficiency prior can explore higher core/power when policy allows.</span><span class="c-pri"><span class="lbl">Priority </span>P2</span><span class="c-prof"><span class="lbl">Profile </span>P00</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:32 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>The regression F11 requires (review finding F11: Ember needs workload-aware identity and objective-aware search).</p><h4>Steps</h4><ol><li>Goal switch from an efficiency prior can explore higher core/power when policy allows.</li></ol><h4>Accept</h4><p>Goal switch from an efficiency prior can explore higher core/power when policy allows.</p><h4>Evidence the case requires</h4><p>The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Every release candidate</dd></div><div><dt>Owner</dt><dd>Ember lane (new)</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Plan pages</dt><dd>F11</dd></div></dl></div></details><details class="acc-case" id="case-REV-F11-2" data-case="REV-F11-2" data-state="NOT RUN"><summary><span class="c-id">REV-F11-2</span><span class="c-title">Driver, workload, dataset, compiler and device changes invalidate certification while retaining optional hints.</span><span class="c-pri"><span class="lbl">Priority </span>P2</span><span class="c-prof"><span class="lbl">Profile </span>P00</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:32 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>The regression F11 requires (review finding F11: Ember needs workload-aware identity and objective-aware search).</p><h4>Steps</h4><ol><li>Driver, workload, dataset, compiler and device changes invalidate certification while retaining optional hints.</li></ol><h4>Accept</h4><p>Driver, workload, dataset, compiler and device changes invalidate certification while retaining optional hints.</p><h4>Evidence the case requires</h4><p>The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Every release candidate</dd></div><div><dt>Owner</dt><dd>Ember lane (new)</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Plan pages</dt><dd>F11</dd></div></dl></div></details><details class="acc-case" id="case-REV-F11-3" data-case="REV-F11-3" data-state="NOT RUN"><summary><span class="c-id">REV-F11-3</span><span class="c-title">Thermal/error/late-share events revert safely, including process or machine crash.</span><span class="c-pri"><span class="lbl">Priority </span>P2</span><span class="c-prof"><span class="lbl">Profile </span>P00</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:32 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>The regression F11 requires (review finding F11: Ember needs workload-aware identity and objective-aware search).</p><h4>Steps</h4><ol><li>Thermal/error/late-share events revert safely, including process or machine crash.</li></ol><h4>Accept</h4><p>Thermal/error/late-share events revert safely, including process or machine crash.</p><h4>Evidence the case requires</h4><p>The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Every release candidate</dd></div><div><dt>Owner</dt><dd>Ember lane (new)</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Plan pages</dt><dd>F11</dd></div></dl></div></details><details class="acc-case" id="case-REV-F12-1" data-case="REV-F12-1" data-state="NOT RUN"><summary><span class="c-id">REV-F12-1</span><span class="c-title">Crash before/after broadcast, response timeout, restart before snapshot: no duplicate payment or silent debt loss.</span><span class="c-pri"><span class="lbl">Priority </span>P1</span><span class="c-prof"><span class="lbl">Profile </span>P00</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:32 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>The regression F12 requires (review finding F12: Pool payouts have a broadcast-before-durable-intent window).</p><h4>Steps</h4><ol><li>Crash before/after broadcast, response timeout, restart before snapshot: no duplicate payment or silent debt loss.</li></ol><h4>Accept</h4><p>Crash before/after broadcast, response timeout, restart before snapshot: no duplicate payment or silent debt loss.</p><h4>Evidence the case requires</h4><p>The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Every release candidate</dd></div><div><dt>Owner</dt><dd>pool lane (new)</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Plan pages</dt><dd>F12</dd></div></dl></div></details><details class="acc-case" id="case-REV-F12-2" data-case="REV-F12-2" data-state="NOT RUN"><summary><span class="c-id">REV-F12-2</span><span class="c-title">Same signed transaction retried, fee replacement reconciled by intent, not a new payment.</span><span class="c-pri"><span class="lbl">Priority </span>P1</span><span class="c-prof"><span class="lbl">Profile </span>P00</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:32 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>The regression F12 requires (review finding F12: Pool payouts have a broadcast-before-durable-intent window).</p><h4>Steps</h4><ol><li>Same signed transaction retried, fee replacement reconciled by intent, not a new payment.</li></ol><h4>Accept</h4><p>Same signed transaction retried, fee replacement reconciled by intent, not a new payment.</p><h4>Evidence the case requires</h4><p>The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Every release candidate</dd></div><div><dt>Owner</dt><dd>pool lane (new)</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Plan pages</dt><dd>F12</dd></div></dl></div></details><details class="acc-case" id="case-REV-F12-3" data-case="REV-F12-3" data-state="NOT RUN"><summary><span class="c-id">REV-F12-3</span><span class="c-title">Receipt reorg and finality pause leave correct pending obligations.</span><span class="c-pri"><span class="lbl">Priority </span>P1</span><span class="c-prof"><span class="lbl">Profile </span>P00</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:32 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>The regression F12 requires (review finding F12: Pool payouts have a broadcast-before-durable-intent window).</p><h4>Steps</h4><ol><li>Receipt reorg and finality pause leave correct pending obligations.</li></ol><h4>Accept</h4><p>Receipt reorg and finality pause leave correct pending obligations.</p><h4>Evidence the case requires</h4><p>The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Every release candidate</dd></div><div><dt>Owner</dt><dd>pool lane (new)</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Plan pages</dt><dd>F12</dd></div></dl></div></details><details class="acc-case" id="case-REV-F13-1" data-case="REV-F13-1" data-state="NOT RUN"><summary><span class="c-id">REV-F13-1</span><span class="c-title">Repeated authorization rejected or atomically replaces and cleans prior state.</span><span class="c-pri"><span class="lbl">Priority </span>P1</span><span class="c-prof"><span class="lbl">Profile </span>P00</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:32 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>The regression F13 requires (review finding F13: Pool admission and membership need bounded resources).</p><h4>Steps</h4><ol><li>Repeated authorization rejected or atomically replaces and cleans prior state.</li></ol><h4>Accept</h4><p>Repeated authorization rejected or atomically replaces and cleans prior state.</p><h4>Evidence the case requires</h4><p>The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Every release candidate</dd></div><div><dt>Owner</dt><dd>pool lane (new)</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Plan pages</dt><dd>F13</dd></div></dl></div></details><details class="acc-case" id="case-REV-F13-2" data-case="REV-F13-2" data-state="NOT RUN"><summary><span class="c-id">REV-F13-2</span><span class="c-title">Oversized unterminated frame rejected within fixed memory/time budget.</span><span class="c-pri"><span class="lbl">Priority </span>P1</span><span class="c-prof"><span class="lbl">Profile </span>P00</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:32 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>The regression F13 requires (review finding F13: Pool admission and membership need bounded resources).</p><h4>Steps</h4><ol><li>Oversized unterminated frame rejected within fixed memory/time budget.</li></ol><h4>Accept</h4><p>Oversized unterminated frame rejected within fixed memory/time budget.</p><h4>Evidence the case requires</h4><p>The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Every release candidate</dd></div><div><dt>Owner</dt><dd>pool lane (new)</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Plan pages</dt><dd>F13</dd></div></dl></div></details><details class="acc-case" id="case-REV-F13-3" data-case="REV-F13-3" data-state="NOT RUN"><summary><span class="c-id">REV-F13-3</span><span class="c-title">Slow clients and invalid share floods cannot grow unbounded member, nonce or outgoing state.</span><span class="c-pri"><span class="lbl">Priority </span>P1</span><span class="c-prof"><span class="lbl">Profile </span>P00</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:32 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>The regression F13 requires (review finding F13: Pool admission and membership need bounded resources).</p><h4>Steps</h4><ol><li>Slow clients and invalid share floods cannot grow unbounded member, nonce or outgoing state.</li></ol><h4>Accept</h4><p>Slow clients and invalid share floods cannot grow unbounded member, nonce or outgoing state.</p><h4>Evidence the case requires</h4><p>The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Every release candidate</dd></div><div><dt>Owner</dt><dd>pool lane (new)</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Plan pages</dt><dd>F13</dd></div></dl></div></details><details class="acc-case" id="case-REV-F14-1" data-case="REV-F14-1" data-state="NOT RUN"><summary><span class="c-id">REV-F14-1</span><span class="c-title">Public build has no default arbitrary remote execution and a documented least-privilege boundary.</span><span class="c-pri"><span class="lbl">Priority </span>P1</span><span class="c-prof"><span class="lbl">Profile </span>P00</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:32 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>The regression F14 requires (review finding F14: Developer fleet control must not silently become the public client trust model).</p><h4>Steps</h4><ol><li>Public build has no default arbitrary remote execution and a documented least-privilege boundary.</li></ol><h4>Accept</h4><p>Public build has no default arbitrary remote execution and a documented least-privilege boundary.</p><h4>Evidence the case requires</h4><p>The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Every release candidate</dd></div><div><dt>Owner</dt><dd>app lane, relay lane</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Plan pages</dt><dd>F14</dd></div></dl></div></details><details class="acc-case" id="case-REV-F14-2" data-case="REV-F14-2" data-state="NOT RUN"><summary><span class="c-id">REV-F14-2</span><span class="c-title">Automatic updates off remains off for urgent manifests until explicit action.</span><span class="c-pri"><span class="lbl">Priority </span>P1</span><span class="c-prof"><span class="lbl">Profile </span>P00</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:32 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>The regression F14 requires (review finding F14: Developer fleet control must not silently become the public client trust model).</p><h4>Steps</h4><ol><li>Automatic updates off remains off for urgent manifests until explicit action.</li></ol><h4>Accept</h4><p>Automatic updates off remains off for urgent manifests until explicit action.</p><h4>Evidence the case requires</h4><p>The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Every release candidate</dd></div><div><dt>Owner</dt><dd>app lane, relay lane</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Plan pages</dt><dd>F14</dd></div></dl></div></details><details class="acc-case" id="case-REV-F14-3" data-case="REV-F14-3" data-state="NOT RUN"><summary><span class="c-id">REV-F14-3</span><span class="c-title">A compromised fleet/update signing key cannot silently acquire wallet access or activate a consensus change.</span><span class="c-pri"><span class="lbl">Priority </span>P1</span><span class="c-prof"><span class="lbl">Profile </span>P00</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:32 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>The regression F14 requires (review finding F14: Developer fleet control must not silently become the public client trust model).</p><h4>Steps</h4><ol><li>A compromised fleet/update signing key cannot silently acquire wallet access or activate a consensus change.</li></ol><h4>Accept</h4><p>A compromised fleet/update signing key cannot silently acquire wallet access or activate a consensus change.</p><h4>Evidence the case requires</h4><p>The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Every release candidate</dd></div><div><dt>Owner</dt><dd>app lane, relay lane</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Plan pages</dt><dd>F14</dd></div></dl></div></details></div></div></section><section class="section acc-profiles" id="profiles"><div class="container"><div class="eyebrow"><span class="line"></span>Profiles</div><h2>The numbers each case is held to.</h2><p class="acc-sub">17 profiles, P00 to P16. A profile is frozen before the confirmatory run; weakening a target after a failure creates a different claim.</p><div class="acc-prof-grid"><article class="acc-prof approved" id="profile-P00"><div class="acc-prof-top"><span class="acc-prof-id">P00</span><span class="acc-pstate approved">Approved as proposed</span></div><h3>Frozen scope and approval</h3><ol class="acc-req"><li>Approve the release manifest, supported roles, numerical profiles, mandatory scenarios, trust/fault model, workload W, adapters and claims before confirmatory tests. Unknown values are BLOCKED, not defaults.</li><li>Core safety and authentication invariants admit no waiver. Proposed performance or commercial targets may be replaced only before the confirmatory run, with an independent rationale and a versioned public scope.</li><li>After a failure, weakening a target creates a different claim and requires a new assessment. Preserve all failed runs; do not average a blocker away.</li></ol><p class="acc-prof-n">Cited by 58 cases. The profile’s own line in the registry: PROPOSED, REQUIRES APPROVAL.</p></article><article class="acc-prof approved" id="profile-P01"><div class="acc-prof-top"><span class="acc-prof-id">P01</span><span class="acc-pstate approved">Approved as proposed</span></div><h3>Correctness and negative-test depth</h3><ol class="acc-req"><li>Zero observed invalid acceptance, unauthorised signature, conflicting finality within assumptions, duplicated reward or unexplained cross-backend state/hash disagreement.</li><li>Minimum proposed campaign: 1,000,000 full-hash vectors per supported backend across all families, plus at least 10,000 malformed/boundary cases per relevant parser or binding class. Include exhaustive small-domain cases and historical regressions.</li><li>All prescribed critical mutants must be detected. This sampling target is not a bound on cryptographic failure probability and does not replace independent reasoning about soundness or safety.</li></ol><p class="acc-prof-n">Cited by 69 cases. The profile’s own line in the registry: PROPOSED, REQUIRES APPROVAL.</p></article><article class="acc-prof approved" id="profile-P02"><div class="acc-prof-top"><span class="acc-prof-id">P02</span><span class="acc-pstate approved">Approved as proposed</span></div><h3>Hardware coverage and reproducibility</h3><ol class="acc-req"><li>At least 12 physical retail configurations: at least 3 NVIDIA, 3 AMD and 2 Apple configurations, at least two discrete-GPU generations, an advertised 8 GB mining tier and 12 GB proving tiers where claimed. Record usable, not nominal, memory.</li><li>Declare a competitive core of at least 6 configurations spanning every advertised vendor and at least two discrete generations before optimisation. The wider cohort remains mandatory for access and economic tests; it cannot be silently dropped.</li><li>Use 5 paired 30-minute steady-state runs per primary cell after at least 15 minutes of warm-up and a stable temperature trend. Calibrated wall meter uncertainty must be at most 2%. Run a 7-day soak on representative low/mid/high tiers.</li><li>Three unaffiliated operators participate; every competitive-core cell is reproduced by at least two. Identical-SKU energy/accepted-work results must agree within 5% after declared environment corrections; unexplained variance blocks the headline.</li></ol><p class="acc-prof-n">Cited by 12 cases. The profile’s own line in the registry: PROPOSED, REQUIRES APPROVAL.</p></article><article class="acc-prof approved" id="profile-P03"><div class="acc-prof-top"><span class="acc-prof-id">P03</span><span class="acc-pstate approved">Approved as proposed</span></div><h3>Candidate improvement and honest-card budget</h3><ol class="acc-req"><li>For production candidate changes, per mandatory GPU cell: no more than 5% increase in joules per accepted work and no more than 2% decrease in accepted throughput versus the paired tuned baseline. Absolute safety limits always apply.</li><li>G2 requires at least a 10% reduction in the strongest evaluated specialist advantage after redesign, outside the declared measurement/model uncertainty, while meeting those budgets. A failed experiment is not a successful upgrade.</li><li>Existing clock-lock savings belong in the baseline. Long programs cannot pass by adding enough equally costly work to both devices to improve a ratio while materially worsening honest operation.</li></ol><p class="acc-prof-n">Cited by 8 cases. The profile’s own line in the registry: PROPOSED, REQUIRES APPROVAL.</p></article><article class="acc-prof approved" id="profile-P04"><div class="acc-prof-top"><span class="acc-prof-id">P04</span><span class="acc-pstate approved">Approved as proposed</span></div><h3>Scoped specialist-competition target</h3><ol class="acc-req"><li>Define R_E as GPU wall joules per accepted work divided by the lowest credible complete-system specialist joules for that same work. The proposed target is R_E at most 1.5 for every competitive-core cell at the same node and one node ahead.</li><li>Evaluate at least three materially distinct specialist architectures, with one programmable multi-family design, and a second independent reviewer. Include shared/reduced memory, hybrid execution, selective participation and realistic power/host costs.</li><li>Publish two-node-ahead and modular/reused-IP stress cases; they must satisfy the predeclared P12 economic envelope. No universal ceiling for unknown future hardware is claimed. Report model bounds separately from statistical confidence.</li><li>A lower-bound specialist estimate, not a convenient average or a deliberately constrained reference architecture, drives the conservative comparison. Undefined or unbounded decision-critical assumptions make the result BLOCKED.</li></ol><p class="acc-note"><span class="acc-chip s-fail" data-state="FAIL">FAIL</span> <span>R_E target at most 1.5 at the same node and one node ahead; today's placed bracket 1.5x to 2.1x: FAIL</span></p><p class="acc-prof-n">Cited by 14 cases. The profile’s own line in the registry: PROPOSED, REQUIRES APPROVAL.</p></article><article class="acc-prof approved" id="profile-P05"><div class="acc-prof-top"><span class="acc-prof-id">P05</span><span class="acc-pstate approved">Approved as proposed</span></div><h3>Measurement and inference protocol</h3><ol class="acc-req"><li>Pre-register primary metrics, cohorts, holdout seeds, run order, exclusions and analysis before confirmation. Keep tuning/training runs separate from holdout runs.</li><li>Use independent runs/operators as measurement units. Report point estimates, two-sided 95% measurement intervals and absolute sample counts; handle time-series dependence with a declared block or run-level method.</li><li>Apply conservative uncertainty to pass decisions. A confidence interval around measured GPU energy does not capture unknown ASIC architectures; model parameter ranges and expert judgement must be reported as such.</li><li>Never compare raw hashes per second across different algorithms. Do not transform a five-year scenario sweep into a probability of chip arrival or a guarantee of future profitability.</li></ol><p class="acc-prof-n">Cited by 0 cases. The profile’s own line in the registry: PROPOSED, REQUIRES APPROVAL.</p></article><article class="acc-prof approved" id="profile-P06"><div class="acc-prof-top"><span class="acc-prof-id">P06</span><span class="acc-pstate approved">Approved as proposed</span></div><h3>Memory and support policy</h3><ol class="acc-req"><li>All advertised role/configuration combinations must finish without OOM, corruption or unsafe fallback. Publish a component memory budget, including display/OS, driver, miner, prover, aggregation and epoch construction.</li><li>Proposed support horizon: at least 24 months of known schedule compatibility for the advertised entry tier, unless a narrower horizon is prominently approved before sale or launch. Removal changes the claim and must pass ECO-07.</li><li>Treat 5.5 / 8.5 / 11.5 GiB as source candidates, not imposed final rules. Simultaneous operation, eviction and time-sharing are distinct advertised modes with separately measured cost.</li></ol><p class="acc-prof-n">Cited by 4 cases. The profile’s own line in the registry: PROPOSED, REQUIRES APPROVAL.</p></article><article class="acc-prof approved" id="profile-P07"><div class="acc-prof-top"><span class="acc-prof-id">P07</span><span class="acc-pstate approved">Approved as proposed</span></div><h3>Proof service capacity and fairness</h3><ol class="acc-req"><li>Freeze W as a meaningful workload mix, input sizes, proof format, fleet and requests/hour. Primary proposed target: 72 hours at W, plus 24 hours at 1.2W; at least 99.5% accepted jobs delivered valid within the contracted deadline.</li><li>Default delivery targets for the declared internal reference workload: p95 at most 60 seconds and p99 at most 120 seconds from input-ready assignment through verified delivery. Also publish request-to-delivery including input wait; no claim may omit that delay.</li><li>Request-to-delivery p99 must meet the separately approved customer deadline. Payment p99 must be at most 10 minutes after verified payable eligibility, with chain finality time reported separately. These defaults do not override a stricter contract.</li><li>No statistically supported positive backlog drift at steady load, no silent drops; after 2W for 15 minutes, drain excess backlog within 30 minutes of return to W. Report rejected demand and accepted-job success separately.</li><li>Proposed advertised-tier fairness: at least 90% timely valid assigned completions are paid under the approved rules; avoidable duplicate/retry work is at most 10% of total work. Reassignment policy must bound abandonment without promising every assignment a reward.</li></ol><p class="acc-prof-n">Cited by 15 cases. The profile’s own line in the registry: PROPOSED, REQUIRES APPROVAL.</p></article><article class="acc-prof approved" id="profile-P08"><div class="acc-prof-top"><span class="acc-prof-id">P08</span><span class="acc-pstate approved">Approved as proposed</span></div><h3>Fault assumptions and recovery</h3><ol class="acc-req"><li>F0 must state the exact safety threshold, quorum and authority-transition rule; the synchrony/participation assumptions for liveness; trusted inputs; and clock/expiry semantics. This manual supplies no substitute consensus rule.</li><li>Exercise threshold-minus/at/plus cases, the 40/40/20 partition fixture, signing outages and 31/35/60/90 logical-day expiry cases. Preserve safety when liveness assumptions fail; do not demand finality from an unavailable quorum.</li><li>After assumptions and input availability are restored: service replacement within 10 minutes and deterministic network convergence within 30 minutes on the reference topology. Different certified bounds must be approved beforehand.</li><li>Accelerated-time simulation and real elapsed operation are separate evidence classes. Recovery may not reverse a guarantee previously represented as final.</li></ol><p class="acc-prof-n">Cited by 25 cases. The profile’s own line in the registry: PROPOSED, REQUIRES APPROVAL.</p></article><article class="acc-prof approved" id="profile-P09"><div class="acc-prof-top"><span class="acc-prof-id">P09</span><span class="acc-pstate approved">Approved as proposed</span></div><h3>Security and bounded resource requirements</h3><ol class="acc-req"><li>Zero unresolved critical or high-severity security findings on the claimed release. Independent scopes must cover consensus, proof soundness/parameters, implementation bypasses, wallet/isolation and relevant operational controls.</li><li>Review the intended proof-system security level and assumptions explicitly; do not infer a security-bit claim from random rejection tests. Version every verifier, program and parameter set.</li><li>Freeze maximum valid/invalid verification time, memory, disk and admission rates for ordinary validator hardware. At rated valid load plus the approved hostile load, no unbounded growth, invalid acceptance or unrecoverable process failure.</li><li>For supported wallet fee-estimation cases, proposed absolute error at most 5% versus the specified charge when inputs are unchanged; deterministic fee-cap handling and explicit uncertainty otherwise. Customer contracts remain separately binding.</li></ol><p class="acc-prof-n">Cited by 30 cases. The profile’s own line in the registry: PROPOSED, REQUIRES APPROVAL.</p></article><article class="acc-prof approved" id="profile-P10"><div class="acc-prof-top"><span class="acc-prof-id">P10</span><span class="acc-pstate approved">Approved as proposed</span></div><h3>Ordinary-operator product targets</h3><ol class="acc-req"><li>At least 30 unaffiliated first-time study participants across supported Windows/macOS combinations. At least 90% install, configure safely and submit accepted work without staff help; p90 active setup at most 15 minutes. Publish complete download/dataset time separately.</li><li>Pause/stop acknowledgement within 2 seconds, safe worker stop within 5 seconds where no documented atomic operation prevents it, and reliable restoration of original tuning settings. No hidden custody or silent update.</li><li>Net-energy/fee displays reconcile within 5% under the declared measurement boundary. Incremental rejected-work loss on the normal home-link profile is at most 2 percentage points over the matched datacentre profile.</li><li>Open miner efficiency is within 5% of the best independently tuned permitted implementation on identical work. For the declared single-card payout case, p95 payable-to-payment at most 24 hours and total payout friction at most 2% of earned value.</li><li>Critical alerts are emitted within 60 seconds of detectable evidence. At least 90% of study users can identify the injected failure and follow the published safe action. No control target excuses a security failure.</li></ol><p class="acc-prof-n">Cited by 11 cases. The profile’s own line in the registry: PROPOSED, REQUIRES APPROVAL.</p></article><article class="acc-prof approved" id="profile-P11"><div class="acc-prof-top"><span class="acc-prof-id">P11</span><span class="acc-pstate approved">Approved as proposed</span></div><h3>No-founder exercise and independence</h3><ol class="acc-req"><li>At least 10 verified unaffiliated operators, three independently administered network/hosting domains and sufficient honest weight/capacity to satisfy F0 and W after founders are removed.</li><li>Run at least 30 real elapsed days without founder mining, proving, aggregation, bootstrap, required RPC, private files or privileged interventions. Cross all known logical transitions separately without calling accelerated time real history.</li><li>Document control by role and common dependencies; uncertain identities are not counted as independent. Within-assumption withdrawals must satisfy P08; losing more than the assumed quorum may cause a visible safe pause.</li></ol><p class="acc-prof-n">Cited by 4 cases. The profile’s own line in the registry: PROPOSED, REQUIRES APPROVAL.</p></article><article class="acc-prof approved" id="profile-P12"><div class="acc-prof-top"><span class="acc-prof-id">P12</span><span class="acc-pstate approved">Approved as proposed</span></div><h3>Five-year coexistence envelope</h3><ol class="acc-req"><li>Freeze a sourced revenue reference R and mandatory worlds before results. Sweep 0.25R, R, 4R and 10R; electricity at $0.03/$0.10/$0.25/$0.40 per kWh; 1/3/5-year productive life; zero/$20M/$75M development; private mining and hardware sales; no/normal/spiking external demand.</li><li>Those values are proposed stress inputs, not current prices or forecasts. Declare which worlds have enough funded demand for rational ongoing service before running; retain collapse worlds as explicit safety/exit tests, not profitable successes.</li><li>Proposed matched-tariff new-entry target in every mandatory sustainable world: median GPU/specialist total cost per accepted work at most 1.5, 90th percentile at most 1.75, and no advertised competitive-core cell above 2.0. Publish every cell, including heterogeneous tariffs.</li><li>At least three purchasable GPU configurations across at least two advertised vendors must have positive modelled new-entry economics; at least 75% of the entry cohort must have positive marginal operating economics in those worlds. Report model uncertainty and failure regions.</li><li>Do not impose GPU market share, specialist production limits, token appreciation, full research-cost recovery or automatic chip death to force the result. Any such condition must become an explicit limitation rather than a hidden assumption.</li></ol><p class="acc-prof-n">Cited by 24 cases. The profile’s own line in the registry: PROPOSED, REQUIRES APPROVAL.</p></article><article class="acc-prof deferred" id="profile-P13"><div class="acc-prof-top"><span class="acc-prof-id">P13</span><span class="acc-pstate deferred">Deferred by the founder</span></div><h3>Maintenance continuity</h3><ol class="acc-req"><li>Before a readiness claim, document at least 12 months of committed maintenance resources at the approved operating scope. Include engineering, security review, infrastructure, support and incident response.</li><li>Use independently reviewable commitments and downside budgets. Uncommitted future sales, rising token prices, burned fees or assumed fundraising are not available resources.</li><li>This is a proposed governance test, not a directive to change the supply cap, issuance allocation or fair-launch design.</li></ol><p class="acc-prof-n">Cited by 1 case. The profile’s own line in the registry: PROPOSED, REQUIRES APPROVAL.</p></article><article class="acc-prof approved" id="profile-P14"><div class="acc-prof-top"><span class="acc-prof-id">P14</span><span class="acc-pstate approved">Approved as proposed</span></div><h3>Genuine commercial and developer proof</h3><ol class="acc-req"><li>At least three unrelated paying buyer organisations, each making at least three separate purchase decisions across at least 30 days; at least 1,000 meaningful verified external jobs in aggregate. Split invoices do not create independent demand.</li><li>No project reimbursement, circular funding or undisclosed related party counts. Report customer concentration and churn; proposed maximum largest-buyer share is 70% of qualifying revenue.</li><li>At least 20% aggregate contribution margin after directly attributable delivery costs, retries, refunds and support; publish fully loaded economics separately. At least 75% of sampled eligible operators have positive realised contribution on the declared workload.</li><li>At least five unaffiliated developers complete a useful supported application or proof-service integration using public documentation. Customer confirmation and raw commercial evidence may remain confidential to the reviewer.</li></ol><p class="acc-prof-n">Cited by 10 cases. The profile’s own line in the registry: PROPOSED, REQUIRES APPROVAL.</p></article><article class="acc-prof approved" id="profile-P15"><div class="acc-prof-top"><span class="acc-prof-id">P15</span><span class="acc-pstate approved">Approved as proposed</span></div><h3>Comparative contention threshold</h3><ol class="acc-req"><li>Pre-register at least three relevant operating GPU-first peers, plus a real proving alternative for customer comparisons. Verify current versions at execution time. The source reference set is a starting point, not a claim about current rankings.</li><li>Require at least three meaningful comparable dimensions with no material inferiority beyond a pre-agreed 10% margin against the best valid comparator, and at least two independently evidenced advantages against at least two peers.</li><li>Advantages must be either a greater-than-10% measured improvement outside uncertainty or a directly tested control/capability difference with demonstrated user value. Non-comparable or missing data is not a win.</li><li>A panel with hardware/economics, security/operations and customer/operator expertise must support the scoped contender conclusion. Passing these judgement-based thresholds does not certify a universal number-one ranking.</li></ol><p class="acc-prof-n">Cited by 5 cases. The profile’s own line in the registry: PROPOSED, REQUIRES APPROVAL.</p></article><article class="acc-prof approved" id="profile-P16"><div class="acc-prof-top"><span class="acc-prof-id">P16</span><span class="acc-pstate approved">Approved as proposed</span></div><h3>Observed durability and claim freshness</h3><ol class="acc-req"><li>At least 90 real elapsed days on the final compatible release family, at least 30 independently verified operators, and transparent eligibility/churn denominators. Material uncomparable changes reset affected observations.</li><li>Proposed outcomes: at least 60% day-90 operator retention and at least 75% of eligible observed operators with positive measured marginal operation over the period. Report incentives and electricity assumptions; do not claim a downturn was observed if it was not.</li><li>At least 99.9% availability for the declared customer service during eligible operating conditions, with all-in availability also reported; zero accepted invalid proofs or conflicting finality within F0 assumptions. Do not remove real incidents as maintenance to force a pass.</li><li>Run fault injection on isolated infrastructure, not unsuspecting customers. Publish planned test windows separately. Reassess claims at least quarterly and immediately after material hardware, protocol, economics or security changes.</li></ol><p class="acc-prof-n">Cited by 5 cases. The profile’s own line in the registry: PROPOSED, REQUIRES APPROVAL.</p></article></div></div></section><section class="section acc-fixtures" id="fixtures"><div class="container"><div class="eyebrow"><span class="line"></span>Fixtures</div><h2>What every run is built on.</h2><div class="acc-fix-grid"><article class="acc-fix" id="fixture-F0"><span class="acc-fix-id">F0</span><h3>Release and assurance manifest</h3><p>Exact commits, binaries, genesis/network ID, mining class, dataset schedule, EVM fork/deviations, program/verifier IDs, fees, supply, quorum/fault rules, trust anchors, activation and supported roles.</p></article><article class="acc-fix" id="fixture-F1"><span class="acc-fix-id">F1</span><h3>Clean build environments</h3><p>Pinned toolchains, dependency locks, clean OS images and documented signing/notarisation boundaries. No production secrets or private founder files.</p></article><article class="acc-fix" id="fixture-F2"><span class="acc-fix-id">F2</span><h3>Hardware and measurement lab</h3><p>Approved physical GPU cohort, calibrated wall meters, stable thermal conditions, driver/OS images and realistic home/datacentre link conditions.</p></article><article class="acc-fix" id="fixture-F3"><span class="acc-fix-id">F3</span><h3>Workload and oracle catalogue</h3><p>Fixed full-hash and EVM/proving jobs, independent reference implementations, real customer-sized payloads, held-out seeds and complete expected results.</p></article><article class="acc-fix" id="fixture-F4"><span class="acc-fix-id">F4</span><h3>Authorised fault network</h3><p>Independent nodes/operators; controllable latency, loss, clocks, partitions, storage faults and role withdrawals. Actual consensus paths plus separately labelled simulators.</p></article><article class="acc-fix" id="fixture-F5"><span class="acc-fix-id">F5</span><h3>Negative and regression corpus</h3><p>Malformed transactions/proofs, wrong roots/IDs, duplicate payments, bad authority tables, historical failures and deliberately faulty code mutants.</p></article><article class="acc-fix" id="fixture-F6"><span class="acc-fix-id">F6</span><h3>Specialist implementation pack</h3><p>Functionally checked architectures, RTL/physical estimates where feasible, memory and board assumptions, cost inputs, adaptation paths and uncertainty ranges.</p></article><article class="acc-fix" id="fixture-F7"><span class="acc-fix-id">F7</span><h3>Economic and incentive models</h3><p>Independently reproducible costs, entry/exit/difficulty policies, scenario grid, operator opportunity costs and money-flow conservation fixtures.</p></article><article class="acc-fix" id="fixture-F8"><span class="acc-fix-id">F8</span><h3>User/customer/peer studies</h3><p>Consenting unaffiliated users, contracted meaningful workloads, private ownership checks, dated competitor methods and independent analysis.</p></article><article class="acc-fix" id="fixture-F9"><span class="acc-fix-id">F9</span><h3>Evidence and status vault</h3><p>Immutable run IDs, raw logs, hashes, analysis code, exclusions, defects, reviewers, signatures, privacy controls and public redacted summaries.</p></article></div></div></section><section class="section acc-foot" id="notes"><div class="container"><div class="acc-foot-card"><div class="eyebrow"><span class="line"></span>What a full pass means</div><p class="acc-allpass">Independent passage of all mandatory and claimed-option gates, including commercial and comparative observation, can support a scoped leadership-contender assessment. It does not prove a universal rank or eliminate unknown future hardware risks.</p><p>Test design, not executed evidence. All numeric additions are proposed, not source-approved protocol rules. Optional claimed features require their tests; excluded features earn no pass credit.</p><h3>Rules in force</h3><ul class="acc-rules"><li>P03: a candidate change pays at most 5 percent of joules per accepted work and loses at most 2 percent of accepted throughput against the paired tuned baseline (replaces the 10 percent budget from 18:2x UK)</li><li>P04: R_E at most 1.5 for every competitive-core cell at the same node and one node ahead against the lowest credible complete-system specialist; today's placed bracket (1.5x to 2.1x same-node) is a FAIL to work against and is served as such</li><li>P12: the matched-tariff median at most 1.5, p90 at most 1.75, no core cell above 2.0</li><li>P02: twelve retail configurations, three unaffiliated operators, the seven-day soak define D1's reproduction</li></ul><p class="acc-never" data-never-served>Never served: guaranteed chip death, a universal ASIC-efficiency ceiling, chip-arrival probabilities, guaranteed profits, Ethereum security by compatibility, privacy from ZK, a numerical rank.</p><p class="acc-src"><b>Source:</b> <code>docs/plans/igneum-2.0-test-registry.json</code>, version 1.0, dated 8 October 2026, plan sha256 <code>418b3b9f68f96a41</code>. <span id="acc-live">This copy was written when the page was built; the page checks the registry on the public git host every 60 seconds.</span></p></div></div></section></div>
-<script type="application/json" id="acceptance-data">{"title":"IGNEUM 2.0 - Test and Acceptance Standard","version":"1.0","date":"2026-10-08","status":"APPROVED 8 October 2026 (the founder, 18:2x UK): \"approve as proposed in the tests, forget P13 for now\"; the test design stands as PROPOSED, NOT EXECUTED until a case runs under it","basis":"IGNEUM_2.0_Plan.pdf, 37 pages, 8 October 2026","suites":[{"code":"GOV","title":"Release identity and evidence","source":[5,21,23,25,26,27],"gate":"G0 / all gates","owner":"Release lead + independent assurance","fixtures":"F0 manifest; F1 source/build archives; F9 evidence vault","summary":"Prevent a favourable result from being attached to the wrong code, assumptions or public claim.","tests":[{"id":"GOV-01","title":"Freeze the release and its claims","setup":"Candidate source, binaries, public documentation and the 2.0 plan are available; no run is yet accepted.","steps":["Record exact commits, binary hashes, dependencies, genesis/network identity, mining class, datasets, execution fork, verifier IDs and fee rules in F0.","Map every promised capability and plan requirement to a test ID; distinguish supported mining, proving and wallet combinations.","Sign the manifest with protocol, product and independent review owners before confirmatory runs."],"accept":"Every material rule and claim has an unambiguous version and test. Conflicts or unknown activation rules produce BLOCKED, not an inferred default. Changes create a new manifest and invalidate affected results.","evidence":"Signed F0; source-to-test map; claim inventory; unresolved-field register.","priority":"BLOCKER","profile":"P00","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[5,21,23,25,26,27],"gate":"G0 / all gates","owner":"Release lead + independent assurance","manual_page":18,"owner_lane":"node lane (a283f5f0d364ceef0)","run_status":"RUNNING","evidence_path":"docs/plans/igneum-2.0-f0-manifest.md; packaging/pow-freeze.txt; build-1:/srv/artefacts/tas/201-7cfa422a-aa0e0f45/node-7cfa422a/box4-kaspad-check.log","run_id":"201-7cfa422a-aa0e0f45","updated":"2026-10-08T19:32:50.856Z","evidence_record":{"cell":"check:freeze","manifest_sha":"7cfa422a","coverage":{"GOV-01":"partial: the linked igneum-pow tree's fingerprint must match a listed freeze or the build fails, the binary prints which; the manifest (igneum_getManifest) names the object digest; the signed F0 manifest is the node lane's row tonight"},"at":"2026-10-08T19:32:50.856Z"}},{"id":"GOV-02","title":"Approve thresholds before results","setup":"This manual supplies proposed test thresholds, not source-approved protocol parameters.","steps":["Approve or replace every P-profile before confirmatory testing; give each change a rationale and independent approver.","Register hardware cohorts, mandatory economic worlds, customer workloads, peer dimensions and exclusion rules.","Lock the profile hash and hold out seeds/workloads from the developers doing optimisation."],"accept":"No decision-critical field is TBD. Numeric limits are frozen, commercially meaningful and not chosen from observed results. A weakened limit after failure requires a new protocol, full affected rerun and explicit claim downgrade review.","evidence":"Approved profile register; timestamped holdout commitments; change log.","priority":"BLOCKER","profile":"P00","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[5,21,23,25,26,27],"gate":"G0 / all gates","owner":"Release lead + independent assurance","manual_page":18,"owner_lane":"CI steward (a2ecfa95d3206016c)","run_status":"RUNNING","evidence_path":"docs/plans/igneum-2.0-test-registry.json","run_id":"team-2026-10-08","updated":"2026-10-08 18:3x UK","evidence_record":{"what_was_run":"the profiles approved as proposed by the founder at 18:2x UK before any confirmatory run; P13 deferred","run_by":"CI steward (a2ecfa95d3206016c)","under_the_standard":"no: team-run before the standard's procedure; the status is RUNNING until the case is re-run under its steps with the profile's numbers and an independent run where the profile asks one","pass_or_fail_today":"not judged under the standard yet"}},{"id":"GOV-03","title":"Reproduce builds outside the founding team","setup":"Provide public source and documented build instructions to three unaffiliated operators.","steps":["Build on clean declared environments without private files, tokens or founder assistance.","Compare reproducible payload hashes; isolate signatures, notarisation and permitted non-deterministic wrappers.","Run reference vectors and restart a node using only documented artifacts."],"accept":"All independent builds reproduce the same consensus payload or an independently explained, pre-approved wrapper difference; reference outputs match exactly. Missing private prerequisites block release.","evidence":"Build logs; dependency lockfiles; binary comparison; operator attestations.","priority":"BLOCKER","profile":"P00; P02","cadence":"Release candidate; repeat after relevant changes","method":"Independent reproduction","status":"NOT RUN","source":[5,21,23,25,26,27],"gate":"G0 / all gates","owner":"Release lead + independent assurance","manual_page":18,"owner_lane":"build-server lane (a352e49ff4613df86)","run_status":"NOT RUN","evidence_path":"","run_id":"","updated":"2026-10-08 18:3x UK"},{"id":"GOV-04","title":"Preserve raw and negative evidence","setup":"Enable append-only storage for run outputs and a separate analysis workspace.","steps":["Capture failed, aborted and successful runs with timestamps, seeds and environment hashes.","Recompute one published figure from raw records on a clean machine.","Modify a retained artifact deliberately and test integrity verification."],"accept":"Every headline can be regenerated; tampering is detected; exclusions have pre-registered reasons. Failed or missing runs remain visible and are never replaced silently by a successful retry.","evidence":"Artifact manifest; hashes; reproduction script; exclusion ledger; negative-run archive.","priority":"BLOCKER","profile":"P00","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[5,21,23,25,26,27],"gate":"G0 / all gates","owner":"Release lead + independent assurance","manual_page":19,"owner_lane":"CI steward (a2ecfa95d3206016c)","run_status":"NOT RUN","evidence_path":"","run_id":"","updated":"2026-10-08T19:22:31.798Z","evidence_record":{"reason":"the evidence vault F9 (raw and negative evidence preserved) is the gate rule landing by 21:00: a PASS must carry its evidence file","at":"2026-10-08T19:22:31.798Z"}},{"id":"GOV-05","title":"Prove the test oracle detects broken behaviour","setup":"Create controlled defective variants on an isolated network only.","steps":["Disable proof verification, change one reward, accept an expired authority set and alter one hash output in separate mutants.","Run the corresponding ZKP, INC, FIN and POW tests without telling the runner which mutant is active.","Confirm the baseline still accepts authorised valid cases."],"accept":"Every deliberately introduced fault is caught by its mapped test; valid controls pass. Any undetected critical mutant blocks acceptance of that test family until the oracle is repaired.","evidence":"Mutation catalogue; blinded run results; baseline controls; oracle review.","priority":"BLOCKER","profile":"P01","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[5,21,23,25,26,27],"gate":"G0 / all gates","owner":"Release lead + independent assurance","manual_page":19,"owner_lane":"fast-time lane (a8be71a0db962911c)","run_status":"RUNNING","evidence_path":"build-1:/srv/artefacts/tas/200-417c4a57-b2/gate/gate-rule26.log","run_id":"200-417c4a57-b2","updated":"2026-10-08T18:28:32.408Z","evidence_record":{"cell":"gate:pre-push","manifest_sha":"417c4a57","coverage":{"GOV-05":"partial: every gate check carries a self-test that fires on a known failure and passes a known success (77 checks); the suites' own oracles are their mutation rows","GOV-06":"partial: the launch-gates, forbidden-strings and scope checks on the served site","UX-08":"partial: the site gate on every served page, plus docs/build/tuning.md (the published tuning and build-settings half, the hash lane's); the open builds and the fee conditions are the shipper's and the site lane's"},"at":"2026-10-08T18:28:32.408Z"}},{"id":"GOV-06","title":"Enforce scope and optional-feature discipline","setup":"Inventory FP32 experiments, receipts/oracles and all retained or excluded mining levers.","steps":["Mark each capability CORE, CLAIMED-OPTIONAL or EXCLUDED before release testing.","For excluded code, check binaries, protocol activation and product copy for accidental enablement or implied availability.","For each claimed option, require the complete associated test set rather than a demonstration."],"accept":"Every core and claimed-option obligation passes. Excluded items are shown as EXCLUDED, never PASS and never counted as achievements. Removing a failed core requirement prevents an all-2.0-pass claim.","evidence":"Scope manifest; activation scan; product-copy comparison; exclusions register.","priority":"BLOCKER","profile":"P00","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[5,21,23,25,26,27],"gate":"G0 / all gates","owner":"Release lead + independent assurance","manual_page":19,"owner_lane":"CI steward (a2ecfa95d3206016c)","run_status":"RUNNING","evidence_path":"build-1:/srv/artefacts/tas/200-417c4a57-b2/gate/gate-rule26.log","run_id":"200-417c4a57-b2","updated":"2026-10-08T18:28:32.408Z","evidence_record":{"cell":"gate:pre-push","manifest_sha":"417c4a57","coverage":{"GOV-05":"partial: every gate check carries a self-test that fires on a known failure and passes a known success (77 checks); the suites' own oracles are their mutation rows","GOV-06":"partial: the launch-gates, forbidden-strings and scope checks on the served site","UX-08":"partial: the site gate on every served page, plus docs/build/tuning.md (the published tuning and build-settings half, the hash lane's); the open builds and the fee conditions are the shipper's and the site lane's"},"at":"2026-10-08T18:28:32.408Z"}},{"id":"GOV-07","title":"Independent review and finding closure","setup":"Nominate reviewers with declared conflicts and scopes covering cryptography, consensus and hardware.","steps":["Provide pinned code, raw data, adversarial models and prior failures, including negative results.","Track each finding to remediation and an independent retest; do not use the author as sole approver.","Have reviewers state unreviewed surfaces and model limitations in their signed conclusions."],"accept":"No unresolved critical or high-severity finding affects the claimed release. A finite review is described by scope, not as proof of universal security. Independent reproduction and review are both evidenced.","evidence":"Signed scoped reports; conflict declarations; finding/retest ledger.","priority":"BLOCKER","profile":"P09","cadence":"Release candidate; repeat after relevant changes","method":"Independent specialist review","status":"NOT RUN","source":[5,21,23,25,26,27],"gate":"G0 / all gates","owner":"Release lead + independent assurance","manual_page":20,"owner_lane":"main / the founder","run_status":"NOT RUN","evidence_path":"","run_id":"","updated":"2026-10-08 18:3x UK"},{"id":"GOV-08","title":"Invalidate stale evidence and control public status","setup":"Create a simulated post-test change to a verifier, mining class, dataset and fee rule.","steps":["Calculate affected test dependencies and invalidate their former PASS statuses.","Regenerate public status pages from F0 and the evidence register.","Attempt to publish a rank-one, guaranteed-profit or automatic-chip-death claim without the required evidence."],"accept":"Affected gates return to NOT RUN or BLOCKED. Public claims retain version, limits and date; unsupported claims are withheld. No stale result remains attached to a different release.","evidence":"Dependency impact report; regenerated status page; rejected claim examples.","priority":"BLOCKER","profile":"P00","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[5,21,23,25,26,27],"gate":"G0 / all gates","owner":"Release lead + independent assurance","manual_page":20,"owner_lane":"CI steward (a2ecfa95d3206016c)","run_status":"NOT RUN","evidence_path":"","run_id":"","updated":"2026-10-08T19:22:31.798Z","evidence_record":{"reason":"the stale-evidence rule (evidence older than the manifest sha reads NOT RUN) is the gate rule landing by 21:00","at":"2026-10-08T19:22:31.798Z"}}]},{"code":"GPU","title":"Whole-system GPU measurements","source":[6,7,8,14,18,23],"gate":"G1 / G2","owner":"GPU lead + three independent operators","fixtures":"F2 retail-hardware cohort; F3 paired benchmark workloads; F9 calibrated evidence","summary":"Close the pending measurements and evaluate the actual configuration, including costs hidden by kernel-only results.","tests":[{"id":"GPU-01","title":"Cover the declared commodity population","setup":"Freeze the P02 cohort, supported role matrix and the final v6 configuration.","steps":["Inventory physical SKU, usable memory, driver, operating system, firmware, cooling and acquisition channel.","Run mining on every supported cohort cell and proving on every separately advertised prover cell.","Include lower-memory, used-generation and all advertised vendor cases; retain unsupported results separately."],"accept":"All declared cells are tested, with no after-the-fact removal of weak cards. At least the P02 minimum coverage is met. Mining-only support is never reported as proof-generation support.","evidence":"Cohort manifest; compatibility matrix; raw results by SKU and role.","priority":"GATE","profile":"P02","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[6,7,8,14,18,23],"gate":"G1 / G2","owner":"GPU lead + three independent operators","manual_page":21,"owner_lane":"research lane (ad6a2bd47d4a46105)","run_status":"RUNNING","evidence_path":"build-1:/srv/artefacts/tas/p02-rows/p02-rows.txt","run_id":"p02-fleet-pods-20261008-01","updated":"2026-10-08T19:10:14.605Z","evidence_record":{"cell":"bench:fleet-pods","manifest_sha":"417c4a57","coverage":{"GPU-01":"partial: the NVIDIA cells of P02 that RunPod carries","GPU-03":"partial: the 4090 cell","POW-08":"partial: W = 16 on four cards"},"at":"2026-10-08T19:10:14.605Z"}},{"id":"GPU-02","title":"Reproduce Ember clock-lock savings","setup":"Use paired stock and tuned runs on the same board, host, workload and ambient conditions.","steps":["Warm to stability; randomise stock/tuned order and run P02 repeated sessions.","Measure accepted work, calibrated wall energy, device telemetry and rejected work.","Calculate paired energy and rate changes with run-level uncertainty, retaining failed tuning attempts."],"accept":"Tuning preserves correctness and meets approved P03 operating limits. The historical 34-41% saving and under-2% rate-loss statement is reproduced only for qualifying configurations; otherwise that claim is corrected. Existing savings are not counted twice.","evidence":"Raw power/time series; paired analysis; tuning settings; claim-by-SKU table.","priority":"GATE","profile":"P02; P03","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[6,7,8,14,18,23],"gate":"G1 / G2","owner":"GPU lead + three independent operators","manual_page":21,"owner_lane":"hash lane (a690540514aa453d7)","run_status":"RUNNING","evidence_path":"docs/analysis/class-v6/rows/run-ca3-pc1-readwidth-5090-20261008-b.md","run_id":"hash-lane-20261008-batch1","updated":"2026-10-08T18:41:01.185Z","evidence_record":{"cell":"bench:pc1-packs","manifest_sha":"c245d50b9","coverage":{"GPU-02":"partial: the paired stock and locked rows on the same board, host and workload (the rate held, 2.37 against 3.26 microjoules per hash on the class v5 pack); the historical 34 to 41 percent claim's full configuration set is owed","GPU-03":"partial: hl-v6-all against hl-v6-foldrw on the 5090, the window's cost per unit of work, registers and blocks per SM, no spill; the mandatory-SKU set is owed","GPU-05":"partial: v3-1g, v3-ds29, v3-ds30, ds55, ds4g-ms complete with their fingerprints, energy per step at stock and at the knee on the 5090 and the 7600; the 8.5 and 11.5 GiB candidates are owed","POW-08":"partial: rw-w4, rw-w32, rw-w64 and the 1p5x long-program packs as regression controls for the excluded levers"},"at":"2026-10-08T18:41:01.185Z"}},{"id":"GPU-03","title":"Measure the real 64-register GPU cost","setup":"Build the baseline and window variant with identical dataset, reads and semantic workload.","steps":["Inspect compiled register allocation, spills, occupancy and memory traffic on each supported backend.","Measure paired complete-system energy and accepted throughput, including host work.","Repeat during proving coexistence and expose any memory or scheduling cliff."],"accept":"Any production window meets P03 budgets for every mandatory SKU; no hidden spills or correctness changes. Zero GPU cost is claimed only where measurement supports it within uncertainty. Results feed the redesigned adversary, not an old core estimate.","evidence":"Compiler reports; allocation traces; paired energy/rate data; coexistence runs.","priority":"GATE","profile":"P02; P03","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[6,7,8,14,18,23],"gate":"G1 / G2","owner":"GPU lead + three independent operators","manual_page":21,"owner_lane":"hash lane (a690540514aa453d7)","run_status":"RUNNING","evidence_path":"build-1:/srv/artefacts/tas/p02-rows/p02-rows.txt","run_id":"p02-fleet-pods-20261008-01","updated":"2026-10-08T19:10:14.605Z","evidence_record":{"cell":"bench:fleet-pods","manifest_sha":"417c4a57","coverage":{"GPU-01":"partial: the NVIDIA cells of P02 that RunPod carries","GPU-03":"partial: the 4090 cell","POW-08":"partial: W = 16 on four cards"},"at":"2026-10-08T19:10:14.605Z"}},{"id":"GPU-04","title":"Find the memory-clock operating ladder","setup":"Use safe vendor-supported settings only; record operator permission and original settings.","steps":["Sweep approved core and memory operating points while holding workload constant.","Measure error rate, accepted throughput, wall energy and thermal equilibrium.","Repeat the selected knee after reboot and restore defaults after a failed or interrupted tuning session."],"accept":"Selected profiles are stable, reproducible and not dependent on unsafe clocks. Every accepted hash remains correct; saved settings restore predictably. Tuning failure leaves a working safe configuration.","evidence":"Clock ladder; safe bounds; thermal/error logs; reboot and rollback record.","priority":"BLOCKER","profile":"P01; P02","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[6,7,8,14,18,23],"gate":"G1 / G2","owner":"GPU lead + three independent operators","manual_page":22,"owner_lane":"hash lane (a690540514aa453d7)","run_status":"RUNNING","evidence_path":"docs/analysis/class-v6/floor/sm-sparse.md","run_id":"team-2026-10-08","updated":"2026-10-08 18:3x UK","evidence_record":{"what_was_run":"the memory-clock ladder at the lock (floor lane 1, b1b8d833)","run_by":"hash lane (a690540514aa453d7)","under_the_standard":"no: team-run before the standard's procedure; the status is RUNNING until the case is re-run under its steps with the profile's numbers and an independent run where the profile asks one","pass_or_fail_today":"not judged under the standard yet"}},{"id":"GPU-05","title":"Test dataset fit and support-horizon costs","setup":"Test 5.5, 8.5 and 11.5 GiB only as source-proposed candidates; F0 determines activated sizes.","steps":["Measure allocation plus driver, display, prover and OS headroom on the 8 GB and other cohort tiers.","Run near-full-memory, fragmentation, restart and next-epoch construction scenarios.","Compare time-sharing/eviction with concurrent mining/proving, including reload cost."],"accept":"Every advertised combination completes without OOM or silent corruption. Unsupported future sizes are identified before activation. GPU exclusions and lost proving capacity appear in ECO evaluation; retirement of a tier is not a success metric.","evidence":"Memory budget per SKU; OOM traces; support horizon; concurrency cost table.","priority":"BLOCKER","profile":"P01; P02; P06","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[6,7,8,14,18,23],"gate":"G1 / G2","owner":"GPU lead + three independent operators","manual_page":22,"owner_lane":"hash lane (a690540514aa453d7)","run_status":"RUNNING","evidence_path":"docs/analysis/class-v6/rows/run-ca3-pc1-amd-cardin-20261008T1703.md","run_id":"hash-lane-20261008-batch1","updated":"2026-10-08T18:41:01.185Z","evidence_record":{"cell":"bench:pc1-amd","manifest_sha":"c245d50b9","coverage":{"GPU-01":"partial: the 8 GB AMD cell, fingerprints and rates at 1, 2, 4 and 5.5 GiB; one cell of P02's twelve","GPU-05":"partial: the 8 GB tier's fit rows"},"at":"2026-10-08T18:41:01.185Z"}},{"id":"GPU-06","title":"Measure accepted work under ordinary connectivity","setup":"Use the same hardware against clean, delayed, lossy and intermittent links in F4.","steps":["Measure kernel rate and accepted work separately under home and datacentre link profiles.","Include reconnects, template changes, expired submissions and pool failover.","Attribute loss to network, local software, validation and protocol causes."],"accept":"Results use accepted work, never kernel rate alone. Ordinary-link incremental rejection stays within P10; all losses remain priced in ECO. Unreachable links may pause but must not claim paid work.","evidence":"Per-submission ledger; network trace; rejection reasons; accepted-work comparison.","priority":"GATE","profile":"P02; P10","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[6,7,8,14,18,23],"gate":"G1 / G2","owner":"GPU lead + three independent operators","manual_page":22,"owner_lane":"fleet lane (ac055d60427caab99)","run_status":"NOT RUN","evidence_path":"","run_id":"","updated":"2026-10-08T19:22:31.798Z","evidence_record":{"reason":"accepted work under ordinary connectivity needs the fault network F4","at":"2026-10-08T19:22:31.798Z"}},{"id":"GPU-07","title":"Survive sustained thermal and power operation","setup":"Run the selected profile on actual reference machines for the P02 soak period.","steps":["Track wall power, temperatures, clocks, memory and accepted work continuously.","Inject safe power interruptions, process restarts and normal competing desktop load.","Check restored settings and compare late-run efficiency with the first stable period."],"accept":"No invalid work or unsafe persistent settings; P02/P10 stability limits hold. Thermal throttling, crashes and recovery time remain in throughput and energy denominators. A crash-free short benchmark cannot substitute for the soak.","evidence":"Seven-day time series; crash reports; settings-restoration checks; drift analysis.","priority":"BLOCKER","profile":"P01; P02; P10","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[6,7,8,14,18,23],"gate":"G1 / G2","owner":"GPU lead + three independent operators","manual_page":23,"owner_lane":"hash lane (a690540514aa453d7)","run_status":"RUNNING","evidence_path":"docs/analysis/class-v6/floor/sm-sparse.md","run_id":"team-2026-10-08","updated":"2026-10-08 18:3x UK","evidence_record":{"what_was_run":"the 5090 lock pass, 66 minutes at 1,300 MHz with the four-minute reserve (floor lane 1)","run_by":"hash lane (a690540514aa453d7)","under_the_standard":"no: team-run before the standard's procedure; the status is RUNNING until the case is re-run under its steps with the profile's numbers and an independent run where the profile asks one","pass_or_fail_today":"not judged under the standard yet"}},{"id":"GPU-08","title":"Reproduce the full baseline independently","setup":"Three unaffiliated operators receive F0, F2 and F3, including the final miner/prover build.","steps":["Repeat identical-SKU paired runs with documented meter calibration and environment differences.","Recompute joules and total cost per accepted work from the shared raw schema.","Investigate divergence before accepting a pooled headline or uncertainty band."],"accept":"Reproductions meet P02 tolerance and exact correctness. No unexplained divergence or selectively missing low-end cell remains. Report manufactured GPU measurements separately from modelled specialist estimates.","evidence":"Three signed reproduction packs; reconciliation report; final baseline table.","priority":"GATE","profile":"P02","cadence":"Release candidate; repeat after relevant changes","method":"Independent reproduction","status":"NOT RUN","source":[6,7,8,14,18,23],"gate":"G1 / G2","owner":"GPU lead + three independent operators","manual_page":23,"owner_lane":"fleet lane (ac055d60427caab99)","run_status":"NOT RUN","evidence_path":"","run_id":"","updated":"2026-10-08 18:3x UK"}]},{"code":"POW","title":"Proof-of-work correctness and coupling","source":[7,9,10,23],"gate":"G2 / technical readiness","owner":"Cryptography + GPU lead","fixtures":"F0 rule set; F3 independent CPU/GPU oracles; F5 mutation corpus","summary":"Find semantic disagreements and structural shortcuts before treating a harder-looking program as a stronger defence.","tests":[{"id":"POW-01","title":"Match independent execution across every backend","setup":"Implement an independently written reference evaluator, not a wrapper around the production GPU path.","steps":["Execute the P01 corpus across every family, boundary seed and supported backend.","Exercise zero, maximum, sign, shift, rotate, overflow and unaligned-address cases allowed by the spec.","Minimise every mismatch and rerun it on clean builds."],"accept":"Bit-for-bit agreement for all valid cases and identical rejection for invalid cases. One unexplained mismatch is a blocker. Large sample counts are evidence of testing, not proof that unseen disagreements cannot exist.","evidence":"Reference implementation review; seeds/vectors; backend matrix; mismatch archive.","priority":"BLOCKER","profile":"P01","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[7,9,10,23],"gate":"G2 / technical readiness","owner":"Cryptography + GPU lead","manual_page":24,"owner_lane":"hash lane (a690540514aa453d7)","run_status":"RUNNING","evidence_path":"build-1:/srv/artefacts/tas/201-7cfa422a-aa0e0f45/node-7cfa422a/box4-miner.log","run_id":"201-7cfa422a-aa0e0f45","updated":"2026-10-08T19:32:50.856Z","evidence_record":{"cell":"suite:miner","manifest_sha":"7cfa422a","coverage":{"UX-06":"partial: the miner's own template selection tests","UX-04":"partial: payout label and share accounting tests; custody is the pool lane's row","POW-01":"partial: the pack re-check seam against the pack's 96 vectors (recheck_pack); the million-vector campaign is harness:p01-vectors"},"at":"2026-10-08T19:32:50.856Z"}},{"id":"POW-02","title":"Validate generated programs and index folding","setup":"Use the frozen grammar, opcode semantics and index-fold rule; include boundary and malformed programs.","steps":["Enumerate small constrained programs and fuzz the full generator at P01 depth.","Check bounds, valid dependencies, address distribution and forbidden encodings.","Compare source-level operations with optimised compiled code for removed or altered work."],"accept":"No accepted program violates semantics, termination or memory bounds. Distribution claims have predeclared tests and effect-size limits; passing randomness checks is not treated as a cryptographic proof.","evidence":"Generator/fuzzer logs; reduced counterexamples; disassembly comparison; index tests.","priority":"BLOCKER","profile":"P01","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[7,9,10,23],"gate":"G2 / technical readiness","owner":"Cryptography + GPU lead","manual_page":24,"owner_lane":"hash lane (a690540514aa453d7)","run_status":"PASS","evidence_path":"docs/analysis/class-v6/census-packs.md","run_id":"census-v6-20261008-2034","updated":"2026-10-08T19:54:05.114Z","evidence_record":{"cell":"census:class-v6","manifest_sha":"9415e9c89","coverage":{"POW-02":"partial: the fold's index statistics and the grammar bounds on 256 seeds plus the F8 set; the malformed programs are owed to harness:parser-malformed"},"at":"2026-10-08T19:54:05.114Z"}},{"id":"POW-03","title":"Test whether live state is unavoidable","setup":"Take the 64-register candidate and the cheapest independently proposed storage organisations.","steps":["Trace value liveness across dependent reads and final output, distinguishing distinct information from duplicated values.","Try banking, compression, recomputation, fewer ports and time-multiplexed contexts.","Quantify the best complete-system cost/throughput trade-off rather than the reference register count."],"accept":"Production selection is supported by measured or physically modelled penalties after these alternatives. G2 requires the P03 improvement; an attractive source-level register count alone does not pass.","evidence":"Liveness traces; alternative implementations; Pareto table; reviewer analysis.","priority":"GATE","profile":"P03; P04","cadence":"Release candidate; repeat after relevant changes","method":"Experiment + independent hardware review","status":"NOT RUN","source":[7,9,10,23],"gate":"G2 / technical readiness","owner":"Cryptography + GPU lead","manual_page":24,"owner_lane":"adversary lane (a1a9876a88f5a72fc)","run_status":"RUNNING","evidence_path":"docs/analysis/class-v6/connected-state.md","run_id":"team-2026-10-08","updated":"2026-10-08 18:3x UK","evidence_record":{"what_was_run":"the connected-state class KILLED (1.10x against the 1.25x gate; live state costs a clock-gated file nothing)","run_by":"adversary lane (a1a9876a88f5a72fc)","under_the_standard":"no: team-run before the standard's procedure; the status is RUNNING until the case is re-run under its steps with the profile's numbers and an independent run where the profile asks one","pass_or_fail_today":"not judged under the standard yet"}},{"id":"POW-04","title":"Evaluate connected-resource restructuring","setup":"Use a candidate initially matched to baseline instruction count, read count and dataset size.","steps":["Connect state, addresses, arithmetic and lane communication according to the written hypothesis.","Measure GPU cost and allow the specialist reviewer to redesign the entire core.","Repeat on held-out program seeds and compare the worst supported adversary, not only the original design."],"accept":"The selected upgrade meets P03 and improves the adversarial result outside declared uncertainty. A negative experiment remains a negative outcome; adopting a different design requires a new frozen comparison.","evidence":"Matched workloads; GPU runs; redesigned core estimates; held-out results.","priority":"GATE","profile":"P03; P04","cadence":"Release candidate; repeat after relevant changes","method":"Controlled experiment","status":"NOT RUN","source":[7,9,10,23],"gate":"G2 / technical readiness","owner":"Cryptography + GPU lead","manual_page":25,"owner_lane":"adversary lane (a1a9876a88f5a72fc)","run_status":"RUNNING","evidence_path":"docs/analysis/class-v6/connected-state.md","run_id":"team-2026-10-08","updated":"2026-10-08 18:3x UK","evidence_record":{"what_was_run":"the same experiment, D2(a) closed","run_by":"adversary lane (a1a9876a88f5a72fc)","under_the_standard":"no: team-run before the standard's procedure; the status is RUNNING until the case is re-run under its steps with the profile's numbers and an independent run where the profile asks one","pass_or_fail_today":"not judged under the standard yet"}},{"id":"POW-05","title":"Prevent amortised cheap winning attempts","setup":"Prepare valid templates, nonces, intermediate-state captures and independent acceptance checks.","steps":["Vary nonce, payout identity, transactions, roots and other committed fields after expensive work.","Try replay, precomputation, shared prefixes, partial evaluation and many cheap suffix candidates.","Price any valid strategy against fresh evaluation; independently review all bindings."],"accept":"Invalid modifications are rejected. Any valid cost-saving strategy is incorporated into ADV and must still meet P04/ECO gates. No unresolved shortcut is hidden behind passing reference vectors.","evidence":"Attack implementations; valid/invalid controls; work-cost analysis; binding review.","priority":"BLOCKER","profile":"P01; P04","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[7,9,10,23],"gate":"G2 / technical readiness","owner":"Cryptography + GPU lead","manual_page":25,"owner_lane":"pool design seat (a3832b1c3b274b310)","run_status":"REVIEWED: fixed by construction (binding), not applicable (final digest); native tests ok on build-2; no change for 2.0","evidence_path":"docs/analysis/binding-review-2026-10.md (sections 1 to 5a; master ad5a54c5)","run_id":"binding-review-2026-10-08-a05","updated":"2026-10-08 18:13Z","evidence_record":{"what_was_run":"the binding review: twelve reuse paths, none below the honest cost; five open questions B1 to B5","run_by":"pool design seat (a3832b1c3b274b310)","under_the_standard":"no: team-run before the standard's procedure; the status is RUNNING until the case is re-run under its steps with the profile's numbers and an independent run where the profile asks one","pass_or_fail_today":"not judged under the standard yet"}},{"id":"POW-06","title":"Bound verifier work and malformed-input cost","setup":"Use ordinary CPU validators with a manifest-defined resource budget and untrusted submissions.","steps":["Submit shortest/longest programs, malformed encodings and adversarial memory references.","Measure verification time, peak memory and work amplification across valid and invalid inputs.","Sustain the approved hostile request rate while ordinary valid traffic continues."],"accept":"All semantics remain correct and P09 resource budgets hold. Invalid traffic cannot cause unbounded allocation, crashes or disproportionate free work. Rate limits must not replace consensus validation.","evidence":"CPU profiles; adversarial corpus; allocation traces; valid-traffic latency.","priority":"BLOCKER","profile":"P01; P09","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[7,9,10,23],"gate":"G2 / technical readiness","owner":"Cryptography + GPU lead","manual_page":25,"owner_lane":"hash lane (a690540514aa453d7)","run_status":"RUNNING","evidence_path":"build-1:/srv/artefacts/tas/p01-partb-20261008-01/summary.jsonl","run_id":"p01-partb-20261008-01","updated":"2026-10-08T18:28:32.463Z","evidence_record":{"cell":"harness:parser-malformed","manifest_sha":"417c4a57","coverage":{"POW-06":"partial: three parsers of external bytes (the state stream, the igneum_ RPC params, the pool job line), ten thousand seeded malformed cases each, zero panics, every case under 500 ms (the slowest 152 microseconds); 'accepted' counts mutations that left a valid input, not a parser fault; the verifier work bound (the other half of the accept text) is the proving lane's measurement"},"at":"2026-10-08T18:28:32.463Z"}},{"id":"POW-07","title":"Constrain any mixed-resource or FP32 branch","setup":"If this branch is excluded, verify that it is unreachable and not claimed; if included, use a separate frozen candidate.","steps":["Specify exact rounding, fusion, special values and backend behaviour before compiling.","Differentially test all supported architectures and allow numerical-domain simplification in the specialist model.","Include verifier cost and candidate energy in P03/P04, not just arithmetic-unit area."],"accept":"Included branches achieve exact agreed semantics and all hardware budgets. An excluded branch earns no performance credit. No approximate operation or unspecified compiler choice enters consensus.","evidence":"Scope decision; semantic specification; vectors; simplified datapath model.","priority":"BLOCKER","profile":"P00; P01; P03","cadence":"Release candidate; repeat after relevant changes","method":"Conditional implementation test","status":"NOT RUN","source":[7,9,10,23],"gate":"G2 / technical readiness","owner":"Cryptography + GPU lead","manual_page":26,"owner_lane":"hash lane (a690540514aa453d7)","run_status":"RUNNING","evidence_path":"build-1:/srv/artefacts/tas/201-7cfa422a-aa0e0f45/miner-9c844503/box2-pow.log","run_id":"201-7cfa422a-aa0e0f45","updated":"2026-10-08T19:32:50.856Z","evidence_record":{"cell":"suite:pow","manifest_sha":"7cfa422a","coverage":{"POW-02":"partial: program derivation, ds55 geometry, the v6 fold, the packs and the spec read-back tests; the independent re-implementation and the index-fold census are the hash lane's harnesses","POW-08":"partial: the freeze list and the generator version pin; the public-claim scrub is the site gate's","POW-07":"the mixed FP32 branch is excluded and unreachable: no class flag reaches an FP op in igneum-pow on master (the mixedfp lane's branch is not on master); evidence the grep of the emitters on master, recorded by the hash lane"},"at":"2026-10-08T19:32:50.856Z"}},{"id":"POW-08","title":"Keep rejected mechanisms out of the shipped claim","setup":"Inventory long programs, select trees, SM gating, wider reads, sealed classes, random epoch lengths, per-tier scoring and VRF draws.","steps":["Retain their historic negative tests and realistic SRAM instruction-memory control.","Inspect the release for reintroduction through renamed settings or hidden paths.","Require a new written hypothesis and complete adversarial retest for any proposed return."],"accept":"Excluded levers remain excluded unless separately approved and retested. Flip-flop instruction-memory area is never presented as the cost of a realistic SRAM implementation.","evidence":"Decision register; binary/config scan; negative-control results.","priority":"GATE","profile":"P00; P03","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[7,9,10,23],"gate":"G2 / technical readiness","owner":"Cryptography + GPU lead","manual_page":26,"owner_lane":"hash lane (a690540514aa453d7)","run_status":"RUNNING","evidence_path":"build-1:/srv/artefacts/tas/201-7cfa422a-aa0e0f45/miner-9c844503/box2-pow.log","run_id":"201-7cfa422a-aa0e0f45","updated":"2026-10-08T19:32:50.856Z","evidence_record":{"cell":"suite:pow","manifest_sha":"7cfa422a","coverage":{"POW-02":"partial: program derivation, ds55 geometry, the v6 fold, the packs and the spec read-back tests; the independent re-implementation and the index-fold census are the hash lane's harnesses","POW-08":"partial: the freeze list and the generator version pin; the public-claim scrub is the site gate's","POW-07":"the mixed FP32 branch is excluded and unreachable: no class flag reaches an FP op in igneum-pow on master (the mixedfp lane's branch is not on master); evidence the grep of the emitters on master, recorded by the hash lane"},"at":"2026-10-08T19:32:50.856Z"}}]},{"code":"ADV","title":"Programmable specialist adversaries","source":[8,10,12,22,23],"gate":"G3","owner":"Independent hardware team","fixtures":"F2 reference GPUs; F6 RTL/physical models; all published families","summary":"Give the opponent permission to adapt, share resources and remain operational; test cost rather than imagined chip death.","tests":[{"id":"ADV-01","title":"Build a multi-family programmable opponent","setup":"Provide the complete published family bank and future known parameter schedule to the reviewer.","steps":["Design one programmable architecture that supports all retained families, including firmware and emulation paths.","Optimise clocks, lanes, ports and pipelines without requiring a graphics-card layout.","Verify its outputs against POW vectors before measuring any advantage."],"accept":"At least the P04 design diversity is evaluated; every estimated competitive design is functionally validated. Inability of one narrow design to adapt is not evidence that all chips expire.","evidence":"Architecture reports; functional simulations; adaptation matrix; reviewer signature.","priority":"GATE","profile":"P01; P04","cadence":"Release candidate; repeat after relevant changes","method":"Independent hardware study","status":"NOT RUN","source":[8,10,12,22,23],"gate":"G3","owner":"Independent hardware team","manual_page":27,"owner_lane":"adversary lane (a1a9876a88f5a72fc)","run_status":"RUNNING","evidence_path":"docs/analysis/class-v6/multi-family-adversary.md","run_id":"team-2026-10-08","updated":"2026-10-08 18:3x UK","evidence_record":{"what_was_run":"the 18-family programmable core placed and routed (9.36 pJ per lane-op, k 0.64 same-node)","run_by":"adversary lane (a1a9876a88f5a72fc)","under_the_standard":"no: team-run before the standard's procedure; the status is RUNNING until the case is re-run under its steps with the profile's numbers and an independent run where the profile asks one","pass_or_fail_today":"not judged under the standard yet"}},{"id":"ADV-02","title":"Price shared, reduced and reconstructed memory","setup":"Allow multiple engines to share a dataset and to store selected fractions rather than a complete per-engine copy.","steps":["Sweep sharing factors, memory fractions, caches and recomputation depth across many simultaneous hashes.","Include construction/update amortisation, bandwidth contention and retained state.","Take the most favourable feasible point for the specialist into the complete-board model."],"accept":"No omitted feasible trade-off materially lowers the accepted cost estimate. Any winning alternative is included in P04 and ECO; capacity alone is not accepted as an energy bound.","evidence":"Sweep definitions; energy/bandwidth data; best-feasible envelope; excluded-design reasons.","priority":"GATE","profile":"P04","cadence":"Release candidate; repeat after relevant changes","method":"Model + adversarial implementation","status":"NOT RUN","source":[8,10,12,22,23],"gate":"G3","owner":"Independent hardware team","manual_page":27,"owner_lane":"adversary lane (a1a9876a88f5a72fc)","run_status":"RUNNING","evidence_path":"docs/analysis/class-v6/multi-family-adversary.md","run_id":"team-2026-10-08","updated":"2026-10-08 18:3x UK","evidence_record":{"what_was_run":"D2(b): the stored-half hybrid, memory sharing, recomputation priced (the placed hybrid 1.93x same-node at the mean hit)","run_by":"adversary lane (a1a9876a88f5a72fc)","under_the_standard":"no: team-run before the standard's procedure; the status is RUNNING until the case is re-run under its steps with the profile's numbers and an independent run where the profile asks one","pass_or_fail_today":"not judged under the standard yet"}},{"id":"ADV-03","title":"Attack with data-local and hybrid execution","setup":"Permit distributed memories, state migration and companion CPU/GPU/FPGA components.","steps":["Compare moving computation, intermediate state or fetched data to each read location.","Test specialised mining alongside outsourced proof generation rather than assuming one physical GPU does both.","Include interconnect, host, synchronisation, idle and conversion costs."],"accept":"The cheapest feasible combined system is included in the adversarial envelope and economic model. A worker identity or account is never treated as proof of a single physical device.","evidence":"Hybrid architecture diagrams; traffic traces; system cost and energy ledger.","priority":"GATE","profile":"P04","cadence":"Release candidate; repeat after relevant changes","method":"Independent system modelling","status":"NOT RUN","source":[8,10,12,22,23],"gate":"G3","owner":"Independent hardware team","manual_page":27,"owner_lane":"adversary lane (a1a9876a88f5a72fc)","run_status":"RUNNING","evidence_path":"docs/analysis/class-v6/multi-family-adversary.md","run_id":"team-2026-10-08","updated":"2026-10-08 18:3x UK","evidence_record":{"what_was_run":"data-local execution moves nothing (2,112 bits of live state against an 80-bit read)","run_by":"adversary lane (a1a9876a88f5a72fc)","under_the_standard":"no: team-run before the standard's procedure; the status is RUNNING until the case is re-run under its steps with the profile's numbers and an independent run where the profile asks one","pass_or_fail_today":"not judged under the standard yet"}},{"id":"ADV-04","title":"Measure profitable selective participation","setup":"Use all declared families plus held-out generated programs and the protocol difficulty rule.","steps":["Identify favourable execution paths and add cheap fallbacks for other periods.","Simulate entry/exit around profitable periods, including idle time, compilation and re-entry costs.","Evaluate revenue and costs across the full schedule, not just average program energy."],"accept":"Intermittent specialists meet P04/ECO limits when evaluated on full-period economics. A weak tail cannot be concealed by a favourable mean; known valid shortcuts must be priced.","evidence":"Per-program advantage distribution; policy simulator; full-period returns.","priority":"GATE","profile":"P04; P12","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[8,10,12,22,23],"gate":"G3","owner":"Independent hardware team","manual_page":28,"owner_lane":"adversary lane (a1a9876a88f5a72fc)","run_status":"RUNNING","evidence_path":"docs/analysis/class-v6/multi-family-adversary.md","run_id":"team-2026-10-08","updated":"2026-10-08 18:3x UK","evidence_record":{"what_was_run":"selective participation 9 percent spread across 2,000 era draws","run_by":"adversary lane (a1a9876a88f5a72fc)","under_the_standard":"no: team-run before the standard's procedure; the status is RUNNING until the case is re-run under its steps with the profile's numbers and an independent run where the profile asks one","pass_or_fail_today":"not judged under the standard yet"}},{"id":"ADV-05","title":"Validate physical and complete-board costs","setup":"Use feasible process/library assumptions and documented component boundaries; no fabricated foundry access.","steps":["Model SRAM macros, ports, wiring, clocking, memory PHYs, external memory, host and power conversion.","Run place-and-route where available; mark unmodelled items as uncertainty rather than zero.","Compare against a calibrated existing hardware block or equivalent validation case."],"accept":"No decision-critical cost is omitted. Physically unvalidated or proprietary estimates are labelled and independently bounded; synthesis alone cannot earn a manufactured-chip claim.","evidence":"Netlist/physical reports; macro assumptions; bill of materials; model calibration.","priority":"GATE","profile":"P04","cadence":"Release candidate; repeat after relevant changes","method":"Independent physical-design review","status":"NOT RUN","source":[8,10,12,22,23],"gate":"G3","owner":"Independent hardware team","manual_page":28,"owner_lane":"k lane (a3c9601a6d4686fe1)","run_status":"RUNNING","evidence_path":"docs/analysis/class-v6/multi-family-adversary.md; docs/analysis/class-v6/floor/shadow-k.md","run_id":"team-2026-10-08","updated":"2026-10-08 18:3x UK","evidence_record":{"what_was_run":"the complete GDDR7 machine 1.5x same-node, 1.8x a node ahead at the placed energy; the honest same-node bracket 1.5x to 2.1x: FAIL against P04 at R_E 1.5, served as such","run_by":"k lane (a3c9601a6d4686fe1)","under_the_standard":"no: team-run before the standard's procedure; the status is RUNNING until the case is re-run under its steps with the profile's numbers and an independent run where the profile asks one","pass_or_fail_today":"FAIL against P04 at R_E 1.5"}},{"id":"ADV-06","title":"Separate process advantage from specialisation","setup":"Evaluate same-node, one-node-ahead and two-node-ahead scenarios with explicit technology definitions.","steps":["Use independently justified process factors, voltages, memory and packaging assumptions for each design.","Allow reusable IP and modular revisions; credit GPU improvement consistently.","Evaluate measurement confidence and model-parameter sensitivity separately."],"accept":"P04 primary limits hold for all competitive-reference cells; two-node futures are reported and pass the predeclared economic stress envelope. A model range is never labelled a statistical confidence interval without justification.","evidence":"Node-specific reports; factor provenance; uncertainty and sensitivity tables.","priority":"GATE","profile":"P04; P12","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[8,10,12,22,23],"gate":"G3","owner":"Independent hardware team","manual_page":28,"owner_lane":"k lane (a3c9601a6d4686fe1)","run_status":"RUNNING","evidence_path":"docs/analysis/class-v6/floor/shadow-k.md","run_id":"team-2026-10-08","updated":"2026-10-08 18:3x UK","evidence_record":{"what_was_run":"the node column: same-node and a node ahead kept separate (k 0.78 / 0.56 / 0.40 at N5 / N3 / N2)","run_by":"k lane (a3c9601a6d4686fe1)","under_the_standard":"no: team-run before the standard's procedure; the status is RUNNING until the case is re-run under its steps with the profile's numbers and an independent run where the profile asks one","pass_or_fail_today":"not judged under the standard yet"}},{"id":"ADV-07","title":"Evaluate lifetime without forced obsolescence","setup":"Assume multi-year productive survival and known schedule support before testing optional retirement penalties.","steps":["Price firmware, emulation, memory expansion, companion hardware and incremental redesign.","Include 1-, 3- and 5-year productive lifetimes plus idle/resale possibilities.","Grant a retirement credit only if all feasible cheaper adaptations lose competitiveness."],"accept":"The primary case does not require chip death or a fresh full development bill per family. Every retirement credit has a documented adaptation comparison; incompatible and unprofitable are reported separately.","evidence":"Lifetime/adaptation ledger; revision costs; feasible-alternative analysis.","priority":"GATE","profile":"P04; P12","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[8,10,12,22,23],"gate":"G3","owner":"Independent hardware team","manual_page":29,"owner_lane":"adversary lane (a1a9876a88f5a72fc)","run_status":"RUNNING","evidence_path":"docs/analysis/class-v6/multi-family-adversary.md section 14","run_id":"team-2026-10-08","updated":"2026-10-08 18:3x UK","evidence_record":{"what_was_run":"the transition matrix: no row loses competitiveness, the three-year life holds, zero obsolescence credit","run_by":"adversary lane (a1a9876a88f5a72fc)","under_the_standard":"no: team-run before the standard's procedure; the status is RUNNING until the case is re-run under its steps with the profile's numbers and an independent run where the profile asks one","pass_or_fail_today":"not judged under the standard yet"}},{"id":"ADV-08","title":"Independently challenge the best-cost envelope","setup":"Publish the non-sensitive model and negative results; commission an unaffiliated second hardware reviewer.","steps":["Reward cheaper valid designs and reproduced shortcuts, not confirmation of the preferred number.","Re-run P04 with the strongest submitted feasible design, including a low-cost funded-development case.","Record unresolved modelling disagreements and future technology exclusions."],"accept":"Both reviews accept the scoped envelope or all material disagreements are resolved transparently. Passing supports only evaluated designs and conditions, never a universal bound on all future silicon.","evidence":"Two review reports; challenge log; final envelope; unresolved-limit statement.","priority":"GATE","profile":"P04","cadence":"Release candidate; repeat after relevant changes","method":"Independent challenge/review","status":"NOT RUN","source":[8,10,12,22,23],"gate":"G3","owner":"Independent hardware team","manual_page":29,"owner_lane":"adversary lane (a1a9876a88f5a72fc)","run_status":"NOT RUN","evidence_path":"","run_id":"","updated":"2026-10-08 18:3x UK"}]},{"code":"ROT","title":"Epochs, seeds and memory transitions","source":[7,11,19,21],"gate":"G5 / G2","owner":"Consensus + GPU leads","fixtures":"F0 activation rules; F4 fault network; F5 historical and boundary vectors","summary":"Transitions must agree across nodes and remain usable during failures; crossing a boundary is not a chip-retirement test.","tests":[{"id":"ROT-01","title":"Agree across every hourly boundary","setup":"Use real nodes, CPU/GPU miners and independent clocks around successive program boundaries.","steps":["Submit valid work immediately before, at and after the activation boundary under clock skew and delayed delivery.","Restart nodes from both sides and replay the same headers.","Compare selected seed, program, validity, rewards and local wall-clock dependence."],"accept":"All honest nodes derive identical consensus outcomes from the frozen rule. Late work is handled exactly as specified; no wall-clock ambiguity or cross-backend split occurs.","evidence":"Boundary vectors; node/miner traces; acceptance and reward matrix.","priority":"BLOCKER","profile":"P01; P08","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[7,11,19,21],"gate":"G5 / G2","owner":"Consensus + GPU leads","manual_page":30,"owner_lane":"fast-time lane (a8be71a0db962911c)","run_status":"RUNNING","evidence_path":"v5-fasttime 92bf6a7f","run_id":"team-2026-10-08","updated":"2026-10-08 18:3x UK","evidence_record":{"what_was_run":"the fast-time crossings PASS on 4cdcc488 (17:29:58) and 617cb441 (17:30:44) with the cold restart","run_by":"fast-time lane (a8be71a0db962911c)","under_the_standard":"no: team-run before the standard's procedure; the status is RUNNING until the case is re-run under its steps with the profile's numbers and an independent run where the profile asks one","pass_or_fail_today":"not judged under the standard yet"}},{"id":"ROT-02","title":"Cross weekly and family boundaries together","setup":"Use the retained schedule in F0, including coincident program, parameter and family changes.","steps":["Run every known family transition and all coincident-boundary combinations on production code.","Interrupt downloads, compilation and restart during activation; include mixed old/new clients.","Repeat selected cases under real elapsed time and the remainder under disclosed accelerated time."],"accept":"Deterministic activation, documented old-client behaviour and no unsafe fallback. Compilation/setup costs satisfy P03; accelerated runs are not reported as years of operating history.","evidence":"Transition matrix; code-path evidence; compile timing; old-client logs.","priority":"BLOCKER","profile":"P01; P03; P08","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[7,11,19,21],"gate":"G5 / G2","owner":"Consensus + GPU leads","manual_page":30,"owner_lane":"fast-time lane (a8be71a0db962911c)","run_status":"RUNNING","evidence_path":"v5-fasttime 92bf6a7f","run_id":"team-2026-10-08","updated":"2026-10-08 18:3x UK","evidence_record":{"what_was_run":"the class v6 object crossing at its floor on 617cb441","run_by":"fast-time lane (a8be71a0db962911c)","under_the_standard":"no: team-run before the standard's procedure; the status is RUNNING until the case is re-run under its steps with the profile's numbers and an independent run where the profile asks one","pass_or_fail_today":"not judged under the standard yet"}},{"id":"ROT-03","title":"Test miner-voted bring-forward governance","setup":"Freeze eligibility, threshold, windows and activation semantics before testing; do not invent a no-veto rule.","steps":["Attempt threshold-minus-one, threshold, conflicting proposals, duplicate votes and coalition withholding.","Partition voters, restore them and test vote-key substitution through pools.","Verify adoption and refusal behaviour of already running nodes."],"accept":"The actual mechanism enforces F0, with authenticated voting and no conflicting activation. Any coalition capable of blocking or manipulating changes is disclosed; labels such as no veto do not override arithmetic.","evidence":"Executable governance model; signed-vote corpus; coalition/partition results.","priority":"BLOCKER","profile":"P00; P01; P08","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[7,11,19,21],"gate":"G5 / G2","owner":"Consensus + GPU leads","manual_page":30,"owner_lane":"node lane (a283f5f0d364ceef0)","run_status":"RUNNING","evidence_path":"docs/plans/igneum-2.0.md D5","run_id":"team-2026-10-08","updated":"2026-10-08 18:3x UK","evidence_record":{"what_was_run":"the bring-forward mechanism specified in the D5 block","run_by":"node lane (a283f5f0d364ceef0)","under_the_standard":"no: team-run before the standard's procedure; the status is RUNNING until the case is re-run under its steps with the profile's numbers and an independent run where the profile asks one","pass_or_fail_today":"not judged under the standard yet"}},{"id":"ROT-04","title":"Resist seed selection and faster evaluators","setup":"Provide the specified seed pipeline and delay proof implementation plus independently parameterised fast-adversary models.","steps":["Try withholding candidate seeds, grinding alternatives, replaying delay proofs and biased checkpoint selection.","Vary adversarial speed advantage and outage duration; trace influence on program choice.","Validate inputs, parameters and proofs against independent vectors."],"accept":"No invalid seed or proof is accepted; selection advantage stays within the approved threat-model bound. Missing bounds block this gate. A delay mechanism is not credited as generic ASIC resistance.","evidence":"Seed/grinding simulations; speed sensitivity; proof vectors; threat-model signoff.","priority":"BLOCKER","profile":"P00; P01; P08","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[7,11,19,21],"gate":"G5 / G2","owner":"Consensus + GPU leads","manual_page":31,"owner_lane":"node lane (a283f5f0d364ceef0)","run_status":"NOT RUN","evidence_path":"","run_id":"","updated":"2026-10-08T19:22:31.798Z","evidence_record":{"reason":"seed-selection resistance is the census harness (the class v6 invention lane), not yet in the matrix","at":"2026-10-08T19:22:31.798Z"}},{"id":"ROT-05","title":"Continue or pause correctly when finality stops","setup":"Stop checkpoint signing while mining continues, then cross seed and family boundaries.","steps":["Remove the required signing weight and observe the documented fallback or safe pause.","Prevent access to any founder seed service; restart from persisted state.","Restore the stated fault assumptions and verify deterministic recovery."],"accept":"Mining/seed behaviour matches F0 without manufacturing certificates or reinterpreting finality. Safety holds during the outage; liveness is required only after its stated assumptions return.","evidence":"Fault timeline; seed/certificate history; node-state comparison; recovery log.","priority":"BLOCKER","profile":"P01; P08","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[7,11,19,21],"gate":"G5 / G2","owner":"Consensus + GPU leads","manual_page":31,"owner_lane":"finality lane (aca0f5ed924a2a99b)","run_status":"RUNNING","evidence_path":"build-1:/srv/artefacts/tas/201-7cfa422a-aa0e0f45/node-7cfa422a/box4-consensus.log","run_id":"201-7cfa422a-aa0e0f45","updated":"2026-10-08T19:32:50.856Z","evidence_record":{"cell":"suite:consensus","manifest_sha":"7cfa422a","coverage":{"FIN-01":"partial: the finality processes' agreement tests","FIN-03":"partial: rule v4's anchored table and authority expiry tests (bee41b5e)","FIN-04":"partial: the frozen table without its time expiry (rule v4)","FIN-05":"partial: key succession and another scheme's vote refused","FIN-07":"partial: majority-continuity recovery (rule v4)","ROT-05":"partial: the finality-stopped pause tests","ZKP-01":"partial: a proof-less or wrong-statement block refused by consensus"},"at":"2026-10-08T19:32:50.856Z"}},{"id":"ROT-06","title":"Activate datasets without hidden exclusions","setup":"Freeze memory sizes, support horizon and sync/update procedure; test all advertised roles.","steps":["Construct the next dataset while current work remains active; test slow disks, low free memory and interruption.","Try stale-state/dataset submissions and maliciously expensive state growth where coupling exists.","Measure data transfer, restart and excluded-card costs before approving progression."],"accept":"No invalid stale work is accepted, no supported card silently fails, and P06 is met. Hardware retirement and sync burden are included in the economic decision, not treated as automatic chip protection.","evidence":"Dataset hashes; memory/update traces; stale-work tests; exclusion decision.","priority":"BLOCKER","profile":"P01; P06","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[7,11,19,21],"gate":"G5 / G2","owner":"Consensus + GPU leads","manual_page":31,"owner_lane":"hash lane (a690540514aa453d7)","run_status":"RUNNING","evidence_path":"build-1:/srv/artefacts/tas/201-7cfa422a-aa0e0f45/node-7cfa422a/box4-core.log","run_id":"201-7cfa422a-aa0e0f45","updated":"2026-10-08T19:32:50.856Z","evidence_record":{"cell":"suite:core","manifest_sha":"7cfa422a","coverage":{"FIN-01":"partial: the finality field and checkpoint tests on the object; ordering under load is the consensus suite and the sim","INC-01":"partial: emission, fee and payout arithmetic tests; the reconciliation over a live chain is the economics lane's","ROT-06":"partial: the dataset activation and digest tests; a live activation is the fast-time harness"},"at":"2026-10-08T19:32:50.856Z"}},{"id":"ROT-07","title":"Ablate redundant rotation layers","setup":"Use matched baseline and ablated variants in the lab; do not change a running public network.","steps":["Remove each weekly/family component independently and measure adversarial cost, GPU setup and verifier complexity.","Include favourable-period specialists and all retained known families.","Keep a layer only with a distinct, independently supported benefit or a documented non-resistance purpose."],"accept":"Every retained layer has explicit justification and full boundary coverage. Redundant complexity is removed or its rationale recorded; the security model does not double-count the same versatility cost.","evidence":"Ablation report; decision log; complexity/cost comparison.","priority":"GATE","profile":"P03; P04","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[7,11,19,21],"gate":"G5 / G2","owner":"Consensus + GPU leads","manual_page":32,"owner_lane":"lane D family gate (a07a99a3788566af2)","run_status":"RUNNING","evidence_path":"docs/analysis/class-v6/family-gate.md","run_id":"team-2026-10-08","updated":"2026-10-08 18:3x UK","evidence_record":{"what_was_run":"the family gate's coverage (38,000 eras) and the rotation prototype paused as the no-rescue control","run_by":"lane D family gate (a07a99a3788566af2)","under_the_standard":"no: team-run before the standard's procedure; the status is RUNNING until the case is re-run under its steps with the profile's numbers and an independent run where the profile asks one","pass_or_fail_today":"not judged under the standard yet"}},{"id":"ROT-08","title":"Pass the no-new-rules counterfactual","setup":"Freeze the complete published rule bank and known schedule for the five-year evaluation.","steps":["Allow a programmable adversary to know and survive all planned changes.","Remove assumed future emergency instructions and manual retirement actions from the model.","Run the required ECO scenarios and link them to independent network-transition tests."],"accept":"Competitiveness survives the approved envelope without future rescue assumptions. Any result that needs unannounced changes fails this claim; ordinary bug maintenance is distinguished from anti-chip intervention.","evidence":"Frozen-rule model; scenario results; excluded-rescue audit; G5 evidence.","priority":"GATE","profile":"P04; P12","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[7,11,19,21],"gate":"G5 / G2","owner":"Consensus + GPU leads","manual_page":32,"owner_lane":"node lane (a283f5f0d364ceef0)","run_status":"NOT RUN","evidence_path":"","run_id":"","updated":"2026-10-08T19:22:31.798Z","evidence_record":{"reason":"the no-new-rules counterfactual is a research harness","at":"2026-10-08T19:22:31.798Z"}}]},{"code":"ECO","title":"Five-year coexistence economics","source":[8,13,18,24,26],"gate":"G4","owner":"Economics lead + independent reviewer","fixtures":"F6 adversarial costs; F7 scenario model; F2 operator costs","summary":"Test the world after specialised hardware exists, including new entrants and an already-funded competitor.","tests":[{"id":"ECO-01","title":"Reconcile complete cost per accepted work","setup":"Use benchmark outputs, current-source cost inputs recorded at execution time and separate reference scenarios.","steps":["Calculate hardware annualisation, electricity, host, cooling/hosting, failures, fees, downtime and residual value.","Use actual accepted work and independently verify units and period conversions.","Cross-check formulas using hand-worked fixtures, edge cases and a second implementation."],"accept":"All material costs and rejected-work effects appear once; model totals reconcile to raw inputs. No GPU upgrade is free, development cost is not double-counted, and burn is not mislabelled operator income.","evidence":"Versioned model; unit fixtures; independent reconciliation; input sources.","priority":"GATE","profile":"P12","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[8,13,18,24,26],"gate":"G4","owner":"Economics lead + independent reviewer","manual_page":33,"owner_lane":"research lane (ad6a2bd47d4a46105)","run_status":"RUNNING","evidence_path":"sim/economy/coexist/README.md","run_id":"eco05-20261008-01b","updated":"2026-10-08T19:55:03.415Z","evidence_record":{"cell":"model:coexist-fixtures","manifest_sha":"24883757","coverage":{"ECO-01":"partial: the hand-worked fixtures and the second implementation; the independent reconciliation of inputs and units remains","ECO-08":"partial: the package runs from the served files (README, inputs with sources and labels, fixtures); the independent report, the rerun and the perturbations remain"},"at":"2026-10-08T19:55:03.415Z"}},{"id":"ECO-02","title":"Separate existing-owner and new-entrant viability","setup":"Use both installed hardware and purchasable replacement hardware in every mandatory cohort.","steps":["Evaluate marginal operation separately from recovery of a new purchase.","Stress resale at zero, hardware failures, financing and replacement cycles.","Report break-even power price and total cost relative to the strongest feasible specialist."],"accept":"P12 competitiveness conditions hold for the predeclared cohorts in required sustainable worlds. Existing-owner profitability cannot substitute for viable new entry; cards outside the envelope remain visible.","evidence":"Owner/entrant curves; price-date records; break-even tables; cohort outcomes.","priority":"GATE","profile":"P12","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[8,13,18,24,26],"gate":"G4","owner":"Economics lead + independent reviewer","manual_page":33,"owner_lane":"research lane (ad6a2bd47d4a46105)","run_status":"RUNNING","evidence_path":"docs/analysis/class-v6/coexistence-model.md","run_id":"eco-d4-20261008-01","updated":"2026-10-08T19:55:03.336Z","evidence_record":{"cell":"harness:economics-model","manifest_sha":"db424d20","coverage":{"ECO-02":"partial: the existing-owner and new-entrant tests per class at three tariffs, MSRP and street, with resale (reference-population.md); resale at zero, failures and financing not yet stressed","ECO-03":"partial: the sunk-development case first with low and high ranges, private mining, hardware sales and the hybrid, GPU re-entry after the fleet (coexistence-model.md sections 2, 8a, 12 to 12c; the surface in floor/sram-and-floor.md 4.4); the source thresholds retired to coexistence-workbook.md","ECO-04":"partial: a per-class supply curve with the installed base as a cap and re-entry (coexistence-model.md), the market-structure axis (8a), the operator simulation (operator-simulation.md); dynamic agent policies beyond the single-rule reaction are the simulation second cut","ECO-06":"partial: the recipients and burns reconciled on the chain block-one split (docs/design/proving-payment.md), proving demand as an income axis at none, launch and spike (coexistence-model.md); the full-horizon issuance ledger owed","ECO-07":"partial: each dataset size scored by adversary burden against commodity burden on measured card rows and modelled chip tickets (docs/design/class-v6-rotating-family.md 10.0u); the 8.5 and 11.5 GiB knee costs expected, not measured","INC-02":"partial: the income streams kept separate in the model (mining subsidy, internal proving, external jobs; burns never counted as payment); the node-record and Ember reconciliation are the node and app lanes","INC-03":"partial: the profit-maximising operator simulation first run (mine, internal prove, external prove, off); per-card agents and switching costs are the second cut","INC-04":"partial: the four shocks in the operator simulation (the demand spike, the price fall, the largest provers leaving, the entrants), restored or not and in how many periods","INC-08":"partial: the supplier and operator dependence table (coexistence-model.md 8a); the signing, proving and aggregation roles are the node lane"},"at":"2026-10-08T19:55:03.336Z"}},{"id":"ECO-03","title":"Let the specialist keep its sunk development","setup":"Use three development cases: fully funded elsewhere, source-range low and source-range high.","steps":["Evaluate private mining, public hardware sales and a hybrid business model.","Allow shared IP, incremental revisions, multi-year survival and resale where justified.","Re-evaluate GPU entry after the specialist fleet is already installed."],"accept":"The coexistence claim does not depend on recovering the original chip research bill. Required P12 cases meet the approved envelope even at zero incremental development cost; failures cannot be hidden by the $23M/$340M source thresholds.","evidence":"Business-model variants; sunk-cost case; full cash-flow and adaptation records.","priority":"GATE","profile":"P12","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[8,13,18,24,26],"gate":"G4","owner":"Economics lead + independent reviewer","manual_page":33,"owner_lane":"research lane (ad6a2bd47d4a46105)","run_status":"RUNNING","evidence_path":"docs/analysis/class-v6/coexistence-model.md","run_id":"eco-d4-20261008-01","updated":"2026-10-08T19:55:03.336Z","evidence_record":{"cell":"harness:economics-model","manifest_sha":"db424d20","coverage":{"ECO-02":"partial: the existing-owner and new-entrant tests per class at three tariffs, MSRP and street, with resale (reference-population.md); resale at zero, failures and financing not yet stressed","ECO-03":"partial: the sunk-development case first with low and high ranges, private mining, hardware sales and the hybrid, GPU re-entry after the fleet (coexistence-model.md sections 2, 8a, 12 to 12c; the surface in floor/sram-and-floor.md 4.4); the source thresholds retired to coexistence-workbook.md","ECO-04":"partial: a per-class supply curve with the installed base as a cap and re-entry (coexistence-model.md), the market-structure axis (8a), the operator simulation (operator-simulation.md); dynamic agent policies beyond the single-rule reaction are the simulation second cut","ECO-06":"partial: the recipients and burns reconciled on the chain block-one split (docs/design/proving-payment.md), proving demand as an income axis at none, launch and spike (coexistence-model.md); the full-horizon issuance ledger owed","ECO-07":"partial: each dataset size scored by adversary burden against commodity burden on measured card rows and modelled chip tickets (docs/design/class-v6-rotating-family.md 10.0u); the 8.5 and 11.5 GiB knee costs expected, not measured","INC-02":"partial: the income streams kept separate in the model (mining subsidy, internal proving, external jobs; burns never counted as payment); the node-record and Ember reconciliation are the node and app lanes","INC-03":"partial: the profit-maximising operator simulation first run (mine, internal prove, external prove, off); per-card agents and switching costs are the second cut","INC-04":"partial: the four shocks in the operator simulation (the demand spike, the price fall, the largest provers leaving, the entrants), restored or not and in how many periods","INC-08":"partial: the supplier and operator dependence table (coexistence-model.md 8a); the signing, proving and aggregation roles are the node lane"},"at":"2026-10-08T19:55:03.336Z"}},{"id":"ECO-04","title":"Model entry, exit and difficulty response","setup":"Use independently reviewed dynamic operator policies, not fixed market shares.","steps":["Let agents buy, sell, switch off, re-enter and choose tasks based on declared costs and expected income.","Apply the actual difficulty/reward rules and test optimistic and adversarial liquidity/capital availability.","Compare equilibrium and transient outcomes across independent starting conditions."],"accept":"Mandatory worlds satisfy P12 without an imposed GPU share or artificial specialist capacity limit. Concentration, oscillations and excluded regions are reported; model behaviour matches unit and conservation checks.","evidence":"Agent policies; sensitivity seeds; market-share paths; independent model review.","priority":"GATE","profile":"P12","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[8,13,18,24,26],"gate":"G4","owner":"Economics lead + independent reviewer","manual_page":34,"owner_lane":"research lane (ad6a2bd47d4a46105)","run_status":"RUNNING","evidence_path":"docs/analysis/class-v6/coexistence-model.md","run_id":"eco-d4-20261008-01","updated":"2026-10-08T19:55:03.336Z","evidence_record":{"cell":"harness:economics-model","manifest_sha":"db424d20","coverage":{"ECO-02":"partial: the existing-owner and new-entrant tests per class at three tariffs, MSRP and street, with resale (reference-population.md); resale at zero, failures and financing not yet stressed","ECO-03":"partial: the sunk-development case first with low and high ranges, private mining, hardware sales and the hybrid, GPU re-entry after the fleet (coexistence-model.md sections 2, 8a, 12 to 12c; the surface in floor/sram-and-floor.md 4.4); the source thresholds retired to coexistence-workbook.md","ECO-04":"partial: a per-class supply curve with the installed base as a cap and re-entry (coexistence-model.md), the market-structure axis (8a), the operator simulation (operator-simulation.md); dynamic agent policies beyond the single-rule reaction are the simulation second cut","ECO-06":"partial: the recipients and burns reconciled on the chain block-one split (docs/design/proving-payment.md), proving demand as an income axis at none, launch and spike (coexistence-model.md); the full-horizon issuance ledger owed","ECO-07":"partial: each dataset size scored by adversary burden against commodity burden on measured card rows and modelled chip tickets (docs/design/class-v6-rotating-family.md 10.0u); the 8.5 and 11.5 GiB knee costs expected, not measured","INC-02":"partial: the income streams kept separate in the model (mining subsidy, internal proving, external jobs; burns never counted as payment); the node-record and Ember reconciliation are the node and app lanes","INC-03":"partial: the profit-maximising operator simulation first run (mine, internal prove, external prove, off); per-card agents and switching costs are the second cut","INC-04":"partial: the four shocks in the operator simulation (the demand spike, the price fall, the largest provers leaving, the entrants), restored or not and in how many periods","INC-08":"partial: the supplier and operator dependence table (coexistence-model.md 8a); the signing, proving and aggregation roles are the node lane"},"at":"2026-10-08T19:55:03.336Z"}},{"id":"ECO-05","title":"Stress success, contraction and cheap electricity","setup":"Freeze mandatory scenarios before results: revenue bands, tariff range, lifetimes and demand states.","steps":["Run the P12 factorial grid plus adversarial combinations selected by the independent reviewer.","Test a large successful network as well as weak-revenue and heterogeneous-tariff cases.","Distinguish feasible sustained-entry worlds from collapse scenarios with no rational profitable operator."],"accept":"No small-network or token-appreciation assumption props up the primary claim. Required viable worlds pass the envelope; collapse worlds show honest contraction and safety, not fabricated profits. Failure regions are explicit.","evidence":"Scenario register; full result cube; boundary plots; failed-world explanations.","priority":"GATE","profile":"P12","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[8,13,18,24,26],"gate":"G4","owner":"Economics lead + independent reviewer","manual_page":34,"owner_lane":"research lane (ad6a2bd47d4a46105)","run_status":"FAIL","evidence_path":"docs/analysis/class-v6/eco-05-results.md","run_id":"eco05-20261008-01b","updated":"2026-10-08T19:55:03.415Z","evidence_record":{"cell":"model:eco05","manifest_sha":"24883757","coverage":{"ECO-05":"full on the frozen register's grid and the eight adversarial rows at the team's reconciled specialist rows; the independent reviewer's own adversarial rows (ECO-08) remain"},"at":"2026-10-08T19:55:03.415Z"}},{"id":"ECO-06","title":"Fund security and proving as issuance falls","setup":"Use the frozen supply, halving, fee, burn and reward rules rather than source prose assumptions.","steps":["Reconcile revenue reaching miners, internal provers, developers and burns over the full horizon.","Test flat/declining fees and no external proving income; separately introduce external demand.","Calculate capacity and security-provider coverage after each reward transition."],"accept":"Recurring compensation is explicit and internally consistent; mandatory sustainable scenarios meet P12. Burned amounts are never counted as payments, and external operator income is not assumed to fund internal work automatically.","evidence":"Issuance/fee ledger; scenario cash flows; funding-shortfall report.","priority":"GATE","profile":"P12","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[8,13,18,24,26],"gate":"G4","owner":"Economics lead + independent reviewer","manual_page":34,"owner_lane":"research lane (ad6a2bd47d4a46105)","run_status":"RUNNING","evidence_path":"docs/analysis/class-v6/coexistence-model.md","run_id":"eco-d4-20261008-01","updated":"2026-10-08T19:55:03.336Z","evidence_record":{"cell":"harness:economics-model","manifest_sha":"db424d20","coverage":{"ECO-02":"partial: the existing-owner and new-entrant tests per class at three tariffs, MSRP and street, with resale (reference-population.md); resale at zero, failures and financing not yet stressed","ECO-03":"partial: the sunk-development case first with low and high ranges, private mining, hardware sales and the hybrid, GPU re-entry after the fleet (coexistence-model.md sections 2, 8a, 12 to 12c; the surface in floor/sram-and-floor.md 4.4); the source thresholds retired to coexistence-workbook.md","ECO-04":"partial: a per-class supply curve with the installed base as a cap and re-entry (coexistence-model.md), the market-structure axis (8a), the operator simulation (operator-simulation.md); dynamic agent policies beyond the single-rule reaction are the simulation second cut","ECO-06":"partial: the recipients and burns reconciled on the chain block-one split (docs/design/proving-payment.md), proving demand as an income axis at none, launch and spike (coexistence-model.md); the full-horizon issuance ledger owed","ECO-07":"partial: each dataset size scored by adversary burden against commodity burden on measured card rows and modelled chip tickets (docs/design/class-v6-rotating-family.md 10.0u); the 8.5 and 11.5 GiB knee costs expected, not measured","INC-02":"partial: the income streams kept separate in the model (mining subsidy, internal proving, external jobs; burns never counted as payment); the node-record and Ember reconciliation are the node and app lanes","INC-03":"partial: the profit-maximising operator simulation first run (mine, internal prove, external prove, off); per-card agents and switching costs are the second cut","INC-04":"partial: the four shocks in the operator simulation (the demand spike, the price fall, the largest provers leaving, the entrants), restored or not and in how many periods","INC-08":"partial: the supplier and operator dependence table (coexistence-model.md 8a); the signing, proving and aggregation roles are the node lane"},"at":"2026-10-08T19:55:03.336Z"}},{"id":"ECO-07","title":"Price memory growth and honest-card displacement","setup":"Use GPU-05 and ROT-06 costs with the cheapest specialist adaptation.","steps":["For each dataset increment, compare specialist cost increases with excluded cards and lost proving capacity.","Include ordinary-owner replacement, resale and reloading expenses.","Run alternate bounded schedules without assigning automatic chip death."],"accept":"The retained schedule meets P06/P12 and has an evidence-backed net competitiveness benefit. A schedule that mainly harms accessible GPUs fails; excluded tiers and mitigations are documented before activation.","evidence":"Per-step cost/retention table; alternative schedules; approval record.","priority":"GATE","profile":"P06; P12","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[8,13,18,24,26],"gate":"G4","owner":"Economics lead + independent reviewer","manual_page":35,"owner_lane":"research lane (ad6a2bd47d4a46105)","run_status":"RUNNING","evidence_path":"docs/analysis/class-v6/coexistence-model.md","run_id":"eco-d4-20261008-01","updated":"2026-10-08T19:55:03.336Z","evidence_record":{"cell":"harness:economics-model","manifest_sha":"db424d20","coverage":{"ECO-02":"partial: the existing-owner and new-entrant tests per class at three tariffs, MSRP and street, with resale (reference-population.md); resale at zero, failures and financing not yet stressed","ECO-03":"partial: the sunk-development case first with low and high ranges, private mining, hardware sales and the hybrid, GPU re-entry after the fleet (coexistence-model.md sections 2, 8a, 12 to 12c; the surface in floor/sram-and-floor.md 4.4); the source thresholds retired to coexistence-workbook.md","ECO-04":"partial: a per-class supply curve with the installed base as a cap and re-entry (coexistence-model.md), the market-structure axis (8a), the operator simulation (operator-simulation.md); dynamic agent policies beyond the single-rule reaction are the simulation second cut","ECO-06":"partial: the recipients and burns reconciled on the chain block-one split (docs/design/proving-payment.md), proving demand as an income axis at none, launch and spike (coexistence-model.md); the full-horizon issuance ledger owed","ECO-07":"partial: each dataset size scored by adversary burden against commodity burden on measured card rows and modelled chip tickets (docs/design/class-v6-rotating-family.md 10.0u); the 8.5 and 11.5 GiB knee costs expected, not measured","INC-02":"partial: the income streams kept separate in the model (mining subsidy, internal proving, external jobs; burns never counted as payment); the node-record and Ember reconciliation are the node and app lanes","INC-03":"partial: the profit-maximising operator simulation first run (mine, internal prove, external prove, off); per-card agents and switching costs are the second cut","INC-04":"partial: the four shocks in the operator simulation (the demand spike, the price fall, the largest provers leaving, the entrants), restored or not and in how many periods","INC-08":"partial: the supplier and operator dependence table (coexistence-model.md 8a); the signing, proving and aggregation roles are the node lane"},"at":"2026-10-08T19:55:03.336Z"}},{"id":"ECO-08","title":"Reproduce and adversarially audit the model","setup":"Give an independent economist or qualified analyst the code, inputs and frozen success criteria.","steps":["Recalculate required worlds and perturb favourable assumptions against the team.","Check dependence on discounts, utilisation, capital limits, artificial prices and future upgrades.","Publish the sensitivity range and state which conclusions are conditional."],"accept":"Material results reproduce, required scenarios pass and no unacknowledged assumption dominates the claim. The model supports a bounded coexistence conclusion, not a percentage probability that no chip will appear.","evidence":"Independent report; rerun outputs; model limitations; approved claim envelope.","priority":"GATE","profile":"P12","cadence":"Release candidate; repeat after relevant changes","method":"Independent economic review","status":"NOT RUN","source":[8,13,18,24,26],"gate":"G4","owner":"Economics lead + independent reviewer","manual_page":35,"owner_lane":"research lane (ad6a2bd47d4a46105)","run_status":"RUNNING","evidence_path":"sim/economy/coexist/README.md","run_id":"eco05-20261008-01b","updated":"2026-10-08T19:55:03.415Z","evidence_record":{"cell":"model:coexist-fixtures","manifest_sha":"24883757","coverage":{"ECO-01":"partial: the hand-worked fixtures and the second implementation; the independent reconciliation of inputs and units remains","ECO-08":"partial: the package runs from the served files (README, inputs with sources and labels, fixtures); the independent report, the rerun and the perturbations remain"},"at":"2026-10-08T19:55:03.415Z"}}]},{"code":"EVM","title":"Execution and developer compatibility","source":[15,25,34,35,36,37],"gate":"Technical readiness","owner":"Execution lead + independent implementer","fixtures":"F0 execution-fork semantics; F5 transactions/contracts; F4 multi-node network","summary":"Keep familiar applications while making every difference and metering rule explicit and reproducible.","tests":[{"id":"EVM-01","title":"Match the selected EVM semantics","setup":"Pin the intended execution fork, revm version and all Igneum deviations in F0.","steps":["Run the applicable upstream execution/state fixtures plus independently written deviation tests.","Execute identical blocks on multiple nodes and compare roots, receipts, logs, gas and failure outcomes.","Minimise mismatches and distinguish intended differences from implementation defects."],"accept":"All applicable vectors match; every deviation has a documented test and developer consequence. No claim of universal Ethereum equivalence or Ethereum settlement security is inferred.","evidence":"Fixture/version inventory; root/receipt diffs; deviation matrix.","priority":"BLOCKER","profile":"P01; P09","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[15,25,34,35,36,37],"gate":"Technical readiness","owner":"Execution lead + independent implementer","manual_page":36,"owner_lane":"reference-apps lane (a2060899d2a27d31c)","run_status":"RUNNING","evidence_path":"docs/build/compatibility.md","run_id":"team-2026-10-08","updated":"2026-10-08 18:3x UK","evidence_record":{"what_was_run":"/compatibility 20 of 20 rows PASSED on igneum-devnet-4","run_by":"reference-apps lane (a2060899d2a27d31c)","under_the_standard":"no: team-run before the standard's procedure; the status is RUNNING until the case is re-run under its steps with the profile's numbers and an independent run where the profile asks one","pass_or_fail_today":"not judged under the standard yet"}},{"id":"EVM-02","title":"Preserve transaction binding and replay protection","setup":"Use signed transfers, contract calls and deployment transactions with boundary field values.","steps":["Alter chain identity, nonce, signature, fee caps and recipient after signing.","Replay across nodes, forks and distinct test networks; resubmit around reorganisation.","Check mempool admission and final consensus execution independently."],"accept":"Unauthorised, wrong-network or duplicate spends are rejected according to F0. Valid replacements follow the declared rule; mempool filtering alone is not evidence of consensus enforcement.","evidence":"Signed corpus; admission/execution outcomes; account-state reconciliation.","priority":"BLOCKER","profile":"P01","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[15,25,34,35,36,37],"gate":"Technical readiness","owner":"Execution lead + independent implementer","manual_page":36,"owner_lane":"reference-apps lane (a2060899d2a27d31c)","run_status":"RUNNING","evidence_path":"build-1:/srv/artefacts/tas/201-7cfa422a-aa0e0f45/node-7cfa422a/box4-exec.log","run_id":"201-7cfa422a-aa0e0f45","updated":"2026-10-08T19:32:50.856Z","evidence_record":{"cell":"suite:exec","manifest_sha":"7cfa422a","coverage":{"ZKP-01":"partial: a real proof verifies, a wrong statement and garbage are refused (nativeverify)","ZKP-03":"partial: a snapshot under another digest refused, the epoch streams bound to the digest","OPS-04":"partial: snapshot install, replay and genesis recapture after a crash","EVM-02":"partial: the replay tests on the day stream; the signature and chain-id binding vectors are an EVM harness still to map"},"at":"2026-10-08T19:32:50.856Z"}},{"id":"EVM-03","title":"Test two-dimensional fees and proving limits","setup":"Freeze fee dimensions, estimator rules, abort behaviour and refund policy.","steps":["Run workloads near and beyond execution and proving budgets, including state-heavy pathological cases.","Compare estimated fees with charged fees and validate rollback/receipt status on abort.","Mutate a block producer to omit or undercharge expensive work."],"accept":"Deterministic metering, charged amounts and aborted state agree across nodes and proofs. Resource bounds hold; fee estimates meet P09 for accepted supported cases. Undercharged invalid blocks cannot bypass consensus.","evidence":"Metering traces; fee fixtures; estimator errors; invalid-block rejection.","priority":"BLOCKER","profile":"P01; P09","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[15,25,34,35,36,37],"gate":"Technical readiness","owner":"Execution lead + independent implementer","manual_page":36,"owner_lane":"reference-apps lane (a2060899d2a27d31c)","run_status":"RUNNING","evidence_path":"tools/reference-apps/compat/results.json","run_id":"ra-20261008T1744-evm","updated":"2026-10-08T19:13:20.781Z","evidence_record":{"cell":"harness:reference-apps-compat","manifest_sha":"4cdcc488","coverage":{"EVM-02":"partial: a transaction signed for the previous devnet's chain id is refused and a signed transaction sent twice is refused on the live devnet; the F0 replacement rule and the mempool-independent evidence are the exec suite's","EVM-03":"partial: fee quotes, eth_estimateGas against gasUsed for a transfer and a call, the documented 21,000 local-limit difference and the pgas receipt fields on the live devnet; determinism across nodes and proofs and the P09 bounds are the proving-limit harness (not run)","EVM-04":"partial: block.number, timestamp, chainid, basefee, blockhash(number-1), CREATE2 address, block.coinbase and block.prevrandao read against the chain and the documented differences; conformance vectors for F0 are EVM-01's","EVM-05":"partial: ERC-20 deploy, transfer, approve/transferFrom, a probe contract, a persisting counter, a revert with reason and an out-of-gas call on the live devnet; application-level invariants of the DEX integration set are the DEX lane's","EVM-06":"partial: receipt fields and logsBloom recompute, the block's receipts trie root rebuilds, eth_getLogs by address/topic/range, eth_getBlockByNumber with full transactions and eth_getBlockReceipts; wallet UI states (included, executed, proven, finalised) and the indexer's canonical-record check are the wallet and explorer lanes' rows"},"at":"2026-10-08T19:13:20.781Z"}},{"id":"EVM-04","title":"Exercise block context and randomness assumptions","setup":"Use contracts sensitive to timestamp, height/context, randomness and ordering.","steps":["Compare the declared Igneum semantics with developers' documented expectations.","Test boundary transitions, miner-influenced inputs and adversarial ordering in the isolated network.","Run dependency reviews for applications using these values for economic decisions."],"accept":"Semantics match F0 and differences are surfaced in compatibility documentation. No source of miner influence is marketed as unbiased randomness; incompatible applications are not included in the compatibility claim.","evidence":"Context-contract results; threat notes; compatibility exclusions.","priority":"BLOCKER","profile":"P01; P09","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[15,25,34,35,36,37],"gate":"Technical readiness","owner":"Execution lead + independent implementer","manual_page":37,"owner_lane":"reference-apps lane (a2060899d2a27d31c)","run_status":"RUNNING","evidence_path":"tools/reference-apps/compat/results.json","run_id":"ra-20261008T1744-evm","updated":"2026-10-08T19:13:20.781Z","evidence_record":{"cell":"harness:reference-apps-compat","manifest_sha":"4cdcc488","coverage":{"EVM-02":"partial: a transaction signed for the previous devnet's chain id is refused and a signed transaction sent twice is refused on the live devnet; the F0 replacement rule and the mempool-independent evidence are the exec suite's","EVM-03":"partial: fee quotes, eth_estimateGas against gasUsed for a transfer and a call, the documented 21,000 local-limit difference and the pgas receipt fields on the live devnet; determinism across nodes and proofs and the P09 bounds are the proving-limit harness (not run)","EVM-04":"partial: block.number, timestamp, chainid, basefee, blockhash(number-1), CREATE2 address, block.coinbase and block.prevrandao read against the chain and the documented differences; conformance vectors for F0 are EVM-01's","EVM-05":"partial: ERC-20 deploy, transfer, approve/transferFrom, a probe contract, a persisting counter, a revert with reason and an out-of-gas call on the live devnet; application-level invariants of the DEX integration set are the DEX lane's","EVM-06":"partial: receipt fields and logsBloom recompute, the block's receipts trie root rebuilds, eth_getLogs by address/topic/range, eth_getBlockByNumber with full transactions and eth_getBlockReceipts; wallet UI states (included, executed, proven, finalised) and the indexer's canonical-record check are the wallet and explorer lanes' rows"},"at":"2026-10-08T19:13:20.781Z"}},{"id":"EVM-05","title":"Run representative contract integration journeys","setup":"Use versioned transfer/token, NFT, multisignature, exchange and upgrade-pattern fixtures where supported.","steps":["Deploy, initialise, transact, revert and upgrade each contract using ordinary tooling.","Exercise events, logs, balances, storage and call traces across node restart/reorganisation.","Compare expected application invariants with native execution and proved results."],"accept":"Supported journeys preserve their stated invariants; all deviations are documented. Example deployment success alone cannot stand in for application-level correctness or financial audit.","evidence":"Contract fixture hashes; transaction journeys; invariant and state comparisons.","priority":"BLOCKER","profile":"P01; P09","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[15,25,34,35,36,37],"gate":"Technical readiness","owner":"Execution lead + independent implementer","manual_page":37,"owner_lane":"reference-apps lane (a2060899d2a27d31c)","run_status":"RUNNING","evidence_path":"tools/reference-apps/compat/results.json","run_id":"ra-20261008T1744-evm","updated":"2026-10-08T19:13:20.781Z","evidence_record":{"cell":"harness:reference-apps-compat","manifest_sha":"4cdcc488","coverage":{"EVM-02":"partial: a transaction signed for the previous devnet's chain id is refused and a signed transaction sent twice is refused on the live devnet; the F0 replacement rule and the mempool-independent evidence are the exec suite's","EVM-03":"partial: fee quotes, eth_estimateGas against gasUsed for a transfer and a call, the documented 21,000 local-limit difference and the pgas receipt fields on the live devnet; determinism across nodes and proofs and the P09 bounds are the proving-limit harness (not run)","EVM-04":"partial: block.number, timestamp, chainid, basefee, blockhash(number-1), CREATE2 address, block.coinbase and block.prevrandao read against the chain and the documented differences; conformance vectors for F0 are EVM-01's","EVM-05":"partial: ERC-20 deploy, transfer, approve/transferFrom, a probe contract, a persisting counter, a revert with reason and an out-of-gas call on the live devnet; application-level invariants of the DEX integration set are the DEX lane's","EVM-06":"partial: receipt fields and logsBloom recompute, the block's receipts trie root rebuilds, eth_getLogs by address/topic/range, eth_getBlockByNumber with full transactions and eth_getBlockReceipts; wallet UI states (included, executed, proven, finalised) and the indexer's canonical-record check are the wallet and explorer lanes' rows"},"at":"2026-10-08T19:13:20.781Z"}},{"id":"EVM-06","title":"Validate wallets, RPC and indexers","setup":"Pin supported RPC methods and response semantics; use normal developer clients and an independent indexer.","steps":["Test fee estimation, pending/final states, subscriptions, pagination and reconnects.","Reindex from genesis or the documented trust anchor after pruning and restart.","Compare logs, receipts and balances with independently validated chain state."],"accept":"No missing/duplicate canonical records; unsupported methods are explicit. UI states distinguish included, executed, proven and finalised. Malformed RPC input cannot crash validators or leak secrets.","evidence":"RPC conformance report; reindex comparison; reconnect/edge-case logs.","priority":"BLOCKER","profile":"P01; P09","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[15,25,34,35,36,37],"gate":"Technical readiness","owner":"Execution lead + independent implementer","manual_page":37,"owner_lane":"reference-apps lane (a2060899d2a27d31c)","run_status":"RUNNING","evidence_path":"tools/reference-apps/compat/results.json","run_id":"ra-20261008T1744-evm","updated":"2026-10-08T19:13:20.781Z","evidence_record":{"cell":"harness:reference-apps-compat","manifest_sha":"4cdcc488","coverage":{"EVM-02":"partial: a transaction signed for the previous devnet's chain id is refused and a signed transaction sent twice is refused on the live devnet; the F0 replacement rule and the mempool-independent evidence are the exec suite's","EVM-03":"partial: fee quotes, eth_estimateGas against gasUsed for a transfer and a call, the documented 21,000 local-limit difference and the pgas receipt fields on the live devnet; determinism across nodes and proofs and the P09 bounds are the proving-limit harness (not run)","EVM-04":"partial: block.number, timestamp, chainid, basefee, blockhash(number-1), CREATE2 address, block.coinbase and block.prevrandao read against the chain and the documented differences; conformance vectors for F0 are EVM-01's","EVM-05":"partial: ERC-20 deploy, transfer, approve/transferFrom, a probe contract, a persisting counter, a revert with reason and an out-of-gas call on the live devnet; application-level invariants of the DEX integration set are the DEX lane's","EVM-06":"partial: receipt fields and logsBloom recompute, the block's receipts trie root rebuilds, eth_getLogs by address/topic/range, eth_getBlockByNumber with full transactions and eth_getBlockReceipts; wallet UI states (included, executed, proven, finalised) and the indexer's canonical-record check are the wallet and explorer lanes' rows"},"at":"2026-10-08T19:13:20.781Z"}},{"id":"EVM-07","title":"Handle execution denial-of-service workloads","setup":"Create bounded pathological bytecode, calls, state growth, storage and precompile inputs.","steps":["Measure CPU, memory, disk and proving cost against charged budgets.","Saturate admission with invalid/expensive requests while valid workloads continue.","Restart mid-execution and verify atomic state recovery."],"accept":"P09 limits hold with no unbounded free work or divergent rollback. State remains consistent after crash; availability under overload follows the declared admission policy, not silent dropping of accepted transactions.","evidence":"Resource profiles; adversarial corpus; state recovery comparisons.","priority":"BLOCKER","profile":"P01; P09","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[15,25,34,35,36,37],"gate":"Technical readiness","owner":"Execution lead + independent implementer","manual_page":38,"owner_lane":"reference-apps lane (a2060899d2a27d31c)","run_status":"NOT RUN","evidence_path":"","run_id":"","updated":"2026-10-08T19:22:31.798Z","evidence_record":{"reason":"execution DoS workloads need the workload catalogue F3","at":"2026-10-08T19:22:31.798Z"}},{"id":"EVM-08","title":"Verify controlled execution and verifier upgrades","setup":"Prepare two authorised versions and malicious, stale or unknown versions.","steps":["Cross activation with mixed clients, queued transactions and proofs from both versions.","Bind each accepted proof to the correct execution semantics and program identity.","Exercise a failed software distribution without altering consensus activation."],"accept":"No unknown or wrong-version execution is accepted. Pre/post-boundary handling is deterministic and documented; software delivery cannot silently redefine transaction semantics or proof acceptance.","evidence":"Upgrade vectors; mixed-version traces; manifest/version bindings.","priority":"BLOCKER","profile":"P01; P08; P09","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[15,25,34,35,36,37],"gate":"Technical readiness","owner":"Execution lead + independent implementer","manual_page":38,"owner_lane":"enforced-proving lane (a6e8f84588b809d62)","run_status":"RUNNING","evidence_path":"build-2:/home/build/enforced-fixtures/floor-240-expect-refuse.json","run_id":"enforced-proving-20261008-01","updated":"2026-10-08T19:03:30.171Z","evidence_record":{"cell":"harness:proving-enforcement","manifest_sha":"417c4a57","coverage":{"ZKP-01":"partial: the seven refusals as named tests (no proof never inserted; a wrong proof and another program id invalidate the block; the honest record paid once) and the fast-time crossing with a modified producer; the genuine-proof positive control through ordinary network paths is the testnet's live read, not run here","ZKP-02":"partial: the pinned-id refusal on a real proof, the daemon's start refusal, key succession (the epochs, the accepted ids, a verdict counting only where its pair is accepted, the seven refusals on both sides of the height, the start refusal under a succession, the real-proof refusal of a pair the epoch does not accept) and the fast-time crossing of a scheduled succession with a real proof under each pair; the downgrade through an old node path is not run","ZKP-03":"partial: the chain binding (a record signed for another network), the replay, a wrong block, a wrong shard, a stale record outside the window; the fork and replayed-sync steps are not run","ZKP-04":"partial: an altered payout address (after signing and re-signed), a statement over altered rewards or payouts vetoed natively, the inputs commitment of P22 stage 1 (shard 0 and the aggregator carry the commitment the node recomputes) and the derivation commitment of stage 2 (the payouts derived in the guest from the carried records); the rewards' proved derivation is P22 stage 3, PENDING","ZKP-05":"partial: a duplicate of a paid record pays nothing and the honest record pays once; the race, reorder and crash-recover steps are not run","ZKP-08":"partial: the body rule and the payment rule read one floor, a producer with its body rule off still pays nothing on honest nodes (the fast-time crossing); the replacement-prover and authority steps are not run; the proof side of the derivation is P22 stage 3, PENDING","EVM-08":"partial: the controlled verifier upgrade as a key succession (both pairs embedded, the window, the start refusal) and its fast-time crossing; the mixed-client crossing on the live network and the failed-distribution step are not run"},"at":"2026-10-08T19:03:30.171Z"},"dependency":"the first pin into elf/prior/ (the node lane, key-succession-pin, tonight by 21:00) and the devnet-4 succession height (main, by 22:00 under the floor rule)"}]},{"code":"ZKP","title":"Consensus-enforced proof validity","source":[16,20,24,25,36,37],"gate":"Technical readiness / G5","owner":"Proving + protocol leads; independent cryptography review","fixtures":"F0 pinned programs/verifiers; F5 valid and hostile proof corpus; unmodified validators","summary":"The validator, not merely the official producer, must reject unauthorised or invalid proof records and rewards.","tests":[{"id":"ZKP-01","title":"Reject missing and invalid proofs","setup":"Start from a native-correct statement and an independently verified valid proof.","steps":["Submit the statement with no proof, truncated bytes, random bytes and targeted proof mutations using a modified producer.","Submit the genuine proof as a positive control through ordinary network paths.","Inspect block acceptance and resulting reward/state on unmodified validators."],"accept":"Every invalid proof record is rejected and earns no reward; valid controls succeed. A producer-side filter is not sufficient. Record rejection semantics exactly as defined by F0.","evidence":"Hostile record corpus; validator decisions; before/after balances; positive controls.","priority":"BLOCKER","profile":"P01; P09","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[16,20,24,25,36,37],"gate":"Technical readiness / G5","owner":"Proving + protocol leads; independent cryptography review","manual_page":39,"owner_lane":"enforced-proving lane (a6e8f84588b809d62)","run_status":"RUNNING","evidence_path":"build-1:/srv/artefacts/tas/201-7cfa422a-aa0e0f45/node-7cfa422a/box4-exec.log","run_id":"201-7cfa422a-aa0e0f45","updated":"2026-10-08T19:32:50.856Z","evidence_record":{"cell":"suite:exec","manifest_sha":"7cfa422a","coverage":{"ZKP-01":"partial: a real proof verifies, a wrong statement and garbage are refused (nativeverify)","ZKP-03":"partial: a snapshot under another digest refused, the epoch streams bound to the digest","OPS-04":"partial: snapshot install, replay and genesis recapture after a crash","EVM-02":"partial: the replay tests on the day stream; the signature and chain-id binding vectors are an EVM harness still to map"},"at":"2026-10-08T19:32:50.856Z"}},{"id":"ZKP-02","title":"Bind program, verifier and security parameters","setup":"Use valid proofs from authorised and unauthorised programs and parameter sets.","steps":["Swap program digest, verifier version, security settings and verification key where applicable.","Attempt downgrade through configuration, serialized metadata or an old node path.","Test authorised boundary transitions and unsupported future identities."],"accept":"Only explicitly authorised combinations are accepted in the correct epoch. No implicit trust in producer-supplied metadata or lower-security fallback; all accepted settings have scoped soundness review.","evidence":"Identity/parameter matrix; rejection traces; cryptographic review.","priority":"BLOCKER","profile":"P01; P09","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[16,20,24,25,36,37],"gate":"Technical readiness / G5","owner":"Proving + protocol leads; independent cryptography review","manual_page":39,"owner_lane":"enforced-proving lane (a6e8f84588b809d62)","run_status":"RUNNING","evidence_path":"build-2:/home/build/enforced-fixtures/floor-240-expect-refuse.json","run_id":"enforced-proving-20261008-01","updated":"2026-10-08T19:03:30.171Z","evidence_record":{"cell":"harness:proving-enforcement","manifest_sha":"417c4a57","coverage":{"ZKP-01":"partial: the seven refusals as named tests (no proof never inserted; a wrong proof and another program id invalidate the block; the honest record paid once) and the fast-time crossing with a modified producer; the genuine-proof positive control through ordinary network paths is the testnet's live read, not run here","ZKP-02":"partial: the pinned-id refusal on a real proof, the daemon's start refusal, key succession (the epochs, the accepted ids, a verdict counting only where its pair is accepted, the seven refusals on both sides of the height, the start refusal under a succession, the real-proof refusal of a pair the epoch does not accept) and the fast-time crossing of a scheduled succession with a real proof under each pair; the downgrade through an old node path is not run","ZKP-03":"partial: the chain binding (a record signed for another network), the replay, a wrong block, a wrong shard, a stale record outside the window; the fork and replayed-sync steps are not run","ZKP-04":"partial: an altered payout address (after signing and re-signed), a statement over altered rewards or payouts vetoed natively, the inputs commitment of P22 stage 1 (shard 0 and the aggregator carry the commitment the node recomputes) and the derivation commitment of stage 2 (the payouts derived in the guest from the carried records); the rewards' proved derivation is P22 stage 3, PENDING","ZKP-05":"partial: a duplicate of a paid record pays nothing and the honest record pays once; the race, reorder and crash-recover steps are not run","ZKP-08":"partial: the body rule and the payment rule read one floor, a producer with its body rule off still pays nothing on honest nodes (the fast-time crossing); the replacement-prover and authority steps are not run; the proof side of the derivation is P22 stage 3, PENDING","EVM-08":"partial: the controlled verifier upgrade as a key succession (both pairs embedded, the window, the start refusal) and its fast-time crossing; the mixed-client crossing on the live network and the failed-distribution step are not run"},"at":"2026-10-08T19:03:30.171Z"},"dependency":"the mixed-pair crossing needs the node lane's first pin into elf/prior/ (key-succession-pin, tonight by 21:00) and the next-pair proof (build-2:/home/build/enforced-fixtures/next-pair-block-56-shard-0-compressed.bin)"},{"id":"ZKP-03","title":"Bind network, epoch, job and state roots","setup":"Prepare valid proofs for distinct chains, epochs, jobs and initial/final states.","steps":["Replay each proof under another network, job, epoch, shard range or state commitment.","Alter public inputs while retaining the proof and test valid-but-wrong-context statements.","Check duplicated and reordered records across forks and replayed sync data."],"accept":"Every misbound proof is rejected; valid authorised replays follow only explicitly allowed semantics and never create extra rewards. Native reexecution cannot conceal missing proof-context binding.","evidence":"Binding matrix; public-input hashes; replay traces; reward reconciliation.","priority":"BLOCKER","profile":"P01","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[16,20,24,25,36,37],"gate":"Technical readiness / G5","owner":"Proving + protocol leads; independent cryptography review","manual_page":39,"owner_lane":"enforced-proving lane (a6e8f84588b809d62)","run_status":"RUNNING","evidence_path":"build-1:/srv/artefacts/tas/201-7cfa422a-aa0e0f45/node-7cfa422a/box4-exec.log","run_id":"201-7cfa422a-aa0e0f45","updated":"2026-10-08T19:32:50.856Z","evidence_record":{"cell":"suite:exec","manifest_sha":"7cfa422a","coverage":{"ZKP-01":"partial: a real proof verifies, a wrong statement and garbage are refused (nativeverify)","ZKP-03":"partial: a snapshot under another digest refused, the epoch streams bound to the digest","OPS-04":"partial: snapshot install, replay and genesis recapture after a crash","EVM-02":"partial: the replay tests on the day stream; the signature and chain-id binding vectors are an EVM harness still to map"},"at":"2026-10-08T19:32:50.856Z"}},{"id":"ZKP-04","title":"Prevent reward and payout substitution","setup":"Use proofs that commit to authorisation and all reward-relevant fields required by F0.","steps":["Alter payout key, amount, beneficiary, source work or fee allocation independently.","Supply correct execution over malicious producer-provided consensus/reward inputs.","Compare consensus-derived rewards with the proved/publicly authenticated derivation."],"accept":"Unauthorised payout changes and incorrect consensus inputs are rejected; no statement accepted merely because execution over supplied inputs is internally correct. Legitimate authorisations are preserved.","evidence":"Mutation cases; reward derivation trace; signature/proof binding review.","priority":"BLOCKER","profile":"P01","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[16,20,24,25,36,37],"gate":"Technical readiness / G5","owner":"Proving + protocol leads; independent cryptography review","manual_page":40,"owner_lane":"enforced-proving lane (a6e8f84588b809d62)","run_status":"RUNNING","evidence_path":"build-2:/home/build/enforced-fixtures/floor-240-expect-refuse.json","run_id":"enforced-proving-20261008-01","updated":"2026-10-08T19:03:30.171Z","evidence_record":{"cell":"harness:proving-enforcement","manifest_sha":"417c4a57","coverage":{"ZKP-01":"partial: the seven refusals as named tests (no proof never inserted; a wrong proof and another program id invalidate the block; the honest record paid once) and the fast-time crossing with a modified producer; the genuine-proof positive control through ordinary network paths is the testnet's live read, not run here","ZKP-02":"partial: the pinned-id refusal on a real proof, the daemon's start refusal, key succession (the epochs, the accepted ids, a verdict counting only where its pair is accepted, the seven refusals on both sides of the height, the start refusal under a succession, the real-proof refusal of a pair the epoch does not accept) and the fast-time crossing of a scheduled succession with a real proof under each pair; the downgrade through an old node path is not run","ZKP-03":"partial: the chain binding (a record signed for another network), the replay, a wrong block, a wrong shard, a stale record outside the window; the fork and replayed-sync steps are not run","ZKP-04":"partial: an altered payout address (after signing and re-signed), a statement over altered rewards or payouts vetoed natively, the inputs commitment of P22 stage 1 (shard 0 and the aggregator carry the commitment the node recomputes) and the derivation commitment of stage 2 (the payouts derived in the guest from the carried records); the rewards' proved derivation is P22 stage 3, PENDING","ZKP-05":"partial: a duplicate of a paid record pays nothing and the honest record pays once; the race, reorder and crash-recover steps are not run","ZKP-08":"partial: the body rule and the payment rule read one floor, a producer with its body rule off still pays nothing on honest nodes (the fast-time crossing); the replacement-prover and authority steps are not run; the proof side of the derivation is P22 stage 3, PENDING","EVM-08":"partial: the controlled verifier upgrade as a key succession (both pairs embedded, the window, the start refusal) and its fast-time crossing; the mixed-client crossing on the live network and the failed-distribution step are not run"},"at":"2026-10-08T19:03:30.171Z"},"dependency":"the proof side of the derivation (P22 stages 1 to 3) changes both guests' public values and so both program ids, so it ships only through a key succession (docs/design/key-succession.md, key-succession-node 291ee6ae); stage 1 (the inputs commitment carried by shard 0 and the aggregator, vetoed natively) is on branch p22-stage-1 under test since 18:46 UK; the clocks (stage 1 09:00, stage 2 14:00, stage 3's design 18:00 UK on 9 October 2026) stand because the succession's first height is asked of main by 22:00 under the floor rule; without a named height the stages are built and tested on their branch and wait for the succession that carries them"},{"id":"ZKP-05","title":"Make proof payment idempotent across races","setup":"Use competing provers submitting valid results for the same work and simulate retries/reorganisations.","steps":["Submit simultaneous duplicates, reordered receipts and repeated messages after disconnects.","Crash validators between validation and reward application, then recover.","Reconcile canonical payouts against the exact F0 duplicate policy."],"accept":"Only the authorised total payment is made; no double payout, lost accepted entitlement or fork-retained balance. Transactions and payout records recover atomically.","evidence":"Concurrency schedule; canonical payment ledger; crash/recovery evidence.","priority":"BLOCKER","profile":"P01","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[16,20,24,25,36,37],"gate":"Technical readiness / G5","owner":"Proving + protocol leads; independent cryptography review","manual_page":40,"owner_lane":"enforced-proving lane (a6e8f84588b809d62)","run_status":"RUNNING","evidence_path":"build-2:/home/build/enforced-fixtures/floor-240-expect-refuse.json","run_id":"enforced-proving-20261008-01","updated":"2026-10-08T19:03:30.171Z","evidence_record":{"cell":"harness:proving-enforcement","manifest_sha":"417c4a57","coverage":{"ZKP-01":"partial: the seven refusals as named tests (no proof never inserted; a wrong proof and another program id invalidate the block; the honest record paid once) and the fast-time crossing with a modified producer; the genuine-proof positive control through ordinary network paths is the testnet's live read, not run here","ZKP-02":"partial: the pinned-id refusal on a real proof, the daemon's start refusal, key succession (the epochs, the accepted ids, a verdict counting only where its pair is accepted, the seven refusals on both sides of the height, the start refusal under a succession, the real-proof refusal of a pair the epoch does not accept) and the fast-time crossing of a scheduled succession with a real proof under each pair; the downgrade through an old node path is not run","ZKP-03":"partial: the chain binding (a record signed for another network), the replay, a wrong block, a wrong shard, a stale record outside the window; the fork and replayed-sync steps are not run","ZKP-04":"partial: an altered payout address (after signing and re-signed), a statement over altered rewards or payouts vetoed natively, the inputs commitment of P22 stage 1 (shard 0 and the aggregator carry the commitment the node recomputes) and the derivation commitment of stage 2 (the payouts derived in the guest from the carried records); the rewards' proved derivation is P22 stage 3, PENDING","ZKP-05":"partial: a duplicate of a paid record pays nothing and the honest record pays once; the race, reorder and crash-recover steps are not run","ZKP-08":"partial: the body rule and the payment rule read one floor, a producer with its body rule off still pays nothing on honest nodes (the fast-time crossing); the replacement-prover and authority steps are not run; the proof side of the derivation is P22 stage 3, PENDING","EVM-08":"partial: the controlled verifier upgrade as a key succession (both pairs embedded, the window, the start refusal) and its fast-time crossing; the mixed-client crossing on the live network and the failed-distribution step are not run"},"at":"2026-10-08T19:03:30.171Z"}},{"id":"ZKP-06","title":"Verify aggregation coverage and completeness","setup":"Build valid multi-shard workloads plus omitted, duplicated, overlapping and misordered shard sets.","steps":["Attempt an aggregate with a correct outer proof but wrong coverage/public-input construction.","Alter shard ranges, roots and aggregation-program identity.","Verify native execution, aggregate validity and coverage commitments independently."],"accept":"Only complete, correctly ordered authorised coverage is accepted. No valid proof of the wrong computation becomes an accepted chain result; aggregation failures do not fabricate successful delivery.","evidence":"Coverage corpus; aggregate/public-input verification; rejection ledger.","priority":"BLOCKER","profile":"P01; P09","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[16,20,24,25,36,37],"gate":"Technical readiness / G5","owner":"Proving + protocol leads; independent cryptography review","manual_page":40,"owner_lane":"enforced-proving lane (a6e8f84588b809d62)","run_status":"RUNNING","evidence_path":"build-1:/srv/artefacts/tas/201-7cfa422a-aa0e0f45/node-7cfa422a/box4-p2p-flows.log","run_id":"201-7cfa422a-aa0e0f45","updated":"2026-10-08T19:32:50.856Z","evidence_record":{"cell":"suite:p2p-flows","manifest_sha":"7cfa422a","coverage":{"OPS-06":"partial: malformed relay messages refused; traffic containment under load is an OPS harness","ZKP-06":"partial: proof relay coverage tests; aggregation completeness is the proving lane's test set"},"at":"2026-10-08T19:32:50.856Z"}},{"id":"ZKP-07","title":"Review soundness and verifier resource limits","setup":"Provide proof-system code, parameters, patches and the pinned verification path to an independent specialist.","steps":["Review soundness assumptions, parameter margins and consequences of performance patches.","Fuzz deserialization and adversarial proofs; measure verification CPU and memory under load.","Cross-check an independent verifier or reference path and test crash containment."],"accept":"P09 review and resource requirements pass with no unresolved critical/high finding. Random proof rejection counts are not described as evidence of a particular cryptographic security level.","evidence":"Scoped soundness review; parameter sheet; fuzzer corpus; verifier profiles.","priority":"BLOCKER","profile":"P01; P09","cadence":"Release candidate; repeat after relevant changes","method":"Independent cryptographic review + testing","status":"NOT RUN","source":[16,20,24,25,36,37],"gate":"Technical readiness / G5","owner":"Proving + protocol leads; independent cryptography review","manual_page":41,"owner_lane":"enforced-proving lane (a6e8f84588b809d62)","run_status":"NOT RUN","evidence_path":"","run_id":"","updated":"2026-10-08 18:3x UK"},{"id":"ZKP-08","title":"Preserve authority and audit all acceptance paths","setup":"Inspect block import, sync, RPC, light verification, database restoration and fast paths.","steps":["Try bypassing validation via each path with a proof rejected by the normal path.","Remove the dominant prover/aggregator and have independent replacements process available inputs.","Attempt to use proof-production status as ordering, voting or finality authority."],"accept":"No bypass accepts invalid work; proofs alone confer no unauthorised consensus control. Replacement and pause behaviour meet F0/P07/P08 without privileged keys or a trusted aggregator shortcut.","evidence":"Path coverage report; bypass corpus; replacement run; authority checks.","priority":"BLOCKER","profile":"P01; P07; P08","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[16,20,24,25,36,37],"gate":"Technical readiness / G5","owner":"Proving + protocol leads; independent cryptography review","manual_page":41,"owner_lane":"enforced-proving lane (a6e8f84588b809d62)","run_status":"RUNNING","evidence_path":"build-2:/home/build/enforced-fixtures/floor-240-expect-refuse.json","run_id":"enforced-proving-20261008-01","updated":"2026-10-08T19:03:30.171Z","evidence_record":{"cell":"harness:proving-enforcement","manifest_sha":"417c4a57","coverage":{"ZKP-01":"partial: the seven refusals as named tests (no proof never inserted; a wrong proof and another program id invalidate the block; the honest record paid once) and the fast-time crossing with a modified producer; the genuine-proof positive control through ordinary network paths is the testnet's live read, not run here","ZKP-02":"partial: the pinned-id refusal on a real proof, the daemon's start refusal, key succession (the epochs, the accepted ids, a verdict counting only where its pair is accepted, the seven refusals on both sides of the height, the start refusal under a succession, the real-proof refusal of a pair the epoch does not accept) and the fast-time crossing of a scheduled succession with a real proof under each pair; the downgrade through an old node path is not run","ZKP-03":"partial: the chain binding (a record signed for another network), the replay, a wrong block, a wrong shard, a stale record outside the window; the fork and replayed-sync steps are not run","ZKP-04":"partial: an altered payout address (after signing and re-signed), a statement over altered rewards or payouts vetoed natively, the inputs commitment of P22 stage 1 (shard 0 and the aggregator carry the commitment the node recomputes) and the derivation commitment of stage 2 (the payouts derived in the guest from the carried records); the rewards' proved derivation is P22 stage 3, PENDING","ZKP-05":"partial: a duplicate of a paid record pays nothing and the honest record pays once; the race, reorder and crash-recover steps are not run","ZKP-08":"partial: the body rule and the payment rule read one floor, a producer with its body rule off still pays nothing on honest nodes (the fast-time crossing); the replacement-prover and authority steps are not run; the proof side of the derivation is P22 stage 3, PENDING","EVM-08":"partial: the controlled verifier upgrade as a key succession (both pairs embedded, the window, the start refusal) and its fast-time crossing; the mixed-client crossing on the live network and the failed-distribution step are not run"},"at":"2026-10-08T19:03:30.171Z"},"dependency":"the proof side of the derivation (P22 stages 1 to 3) changes both guests' public values and so both program ids, so it ships only through a key succession (docs/design/key-succession.md, key-succession-node 291ee6ae); stage 1 (the inputs commitment carried by shard 0 and the aggregator, vetoed natively) is on branch p22-stage-1 under test since 18:46 UK; the clocks (stage 1 09:00, stage 2 14:00, stage 3's design 18:00 UK on 9 October 2026) stand because the succession's first height is asked of main by 22:00 under the floor rule; without a named height the stages are built and tested on their branch and wait for the succession that carries them"}]},{"code":"CAP","title":"Sustained proving and delivery","source":[17,18,24,25],"gate":"Technical readiness / commercial track","owner":"Proving lead + independent operators","fixtures":"F3 meaningful workload catalogue; F4 network; F8 external job harness","summary":"A correct fast shard is only one stage; capacity, latency, payment and retries must work together.","tests":[{"id":"CAP-01","title":"Reproduce the historical consumer-shard result","setup":"Recover the exact source-era workload/build if available; keep it separate from the release-candidate workload.","steps":["Attempt independent reproduction of the 4,717,439-cycle workload and reported 3060/4060/4070 results.","Record proof format, memory, energy, host and whether aggregation/compression are included.","Repeat on the final release and label all configuration changes."],"accept":"Historical figures are either reproduced within P02 tolerance or corrected/labelled non-reproduced. Release acceptance uses the current complete workload, never an unmatched historical time or a smaller substituted shard.","evidence":"Historical/current manifests; proof verification; timing and memory records.","priority":"GATE","profile":"P02; P07","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[17,18,24,25],"gate":"Technical readiness / commercial track","owner":"Proving lead + independent operators","manual_page":42,"owner_lane":"fleet lane (ac055d60427caab99)","run_status":"NOT RUN","evidence_path":"","run_id":"","updated":"2026-10-08T19:22:31.798Z","evidence_record":{"reason":"the consumer-shard reproduction is the fleet lane's pods","at":"2026-10-08T19:22:31.798Z"}},{"id":"CAP-02","title":"Prove on the actual mining configuration","setup":"Use final dataset sizes, registers, clocks, drivers and proof pipeline on every advertised proving tier.","steps":["Run mining alone, proving alone, concurrent execution and supported time-sharing.","Measure wall energy, memory headroom, reloads, proof latency and forgone accepted mining work.","Induce memory pressure and GPU task failure without losing wallet control."],"accept":"Every advertised mode completes correctly and meets P06/P07. Net output includes opportunity cost; unsupported concurrency is not claimed. Mining-only vendor support remains separately labelled.","evidence":"Four-mode results; OOM/failure logs; memory and opportunity-cost ledger.","priority":"BLOCKER","profile":"P01; P06; P07","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[17,18,24,25],"gate":"Technical readiness / commercial track","owner":"Proving lead + independent operators","manual_page":42,"owner_lane":"fleet lane (ac055d60427caab99)","run_status":"NOT RUN","evidence_path":"","run_id":"","updated":"2026-10-08T19:22:31.798Z","evidence_record":{"reason":"proving on the mining configuration is the fleet lane's","at":"2026-10-08T19:22:31.798Z"}},{"id":"CAP-03","title":"Measure the entire request-to-payment path","setup":"Assign a unique job ID and immutable timestamps to every stage of F3/F8 jobs.","steps":["Record request, input availability, assignment, execution, shard proof, aggregation, verification, delivery and payment.","Compare monotonic elapsed time with any protocol/DAA clock and document their relationship.","Reconcile failed, censored, retried and abandoned jobs with the original request denominator."],"accept":"No hidden stage or missing job; latency distributions and cost cover the complete path. Delivery, finality and payment are reported separately; protocol seconds are not silently relabelled wall-clock seconds.","evidence":"Stage event ledger; clock calibration; end-to-end latency/cost report.","priority":"GATE","profile":"P07","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[17,18,24,25],"gate":"Technical readiness / commercial track","owner":"Proving lead + independent operators","manual_page":42,"owner_lane":"fleet lane (ac055d60427caab99)","run_status":"NOT RUN","evidence_path":"","run_id":"","updated":"2026-10-08T19:22:31.798Z","evidence_record":{"reason":"the request-to-payment path is the proving fleet's measurement","at":"2026-10-08T19:22:31.798Z"}},{"id":"CAP-04","title":"Sustain meaningful load without queue growth","setup":"Freeze W: payload mix, input sizes, execution work and per-hour demand; prohibit tiny-workload substitution.","steps":["Run 72 hours at W and a separate 24 hours at 1.2W on the declared fleet.","Measure arrival/completion counts, backlog trend, oldest-job age, deadlines and all retries.","Use held-out workloads and an independent observer to detect discarded or delayed requests."],"accept":"P07 completion, tail-latency and bounded-backlog criteria hold. Capacity is stated for the tested W/fleet, not as universal TPS. A queue that grows indefinitely or shrinks through silent loss fails.","evidence":"Request/completion reconciliation; backlog series; held-out results; observer report.","priority":"GATE","profile":"P07","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[17,18,24,25],"gate":"Technical readiness / commercial track","owner":"Proving lead + independent operators","manual_page":43,"owner_lane":"fleet lane (ac055d60427caab99)","run_status":"NOT RUN","evidence_path":"","run_id":"","updated":"2026-10-08T19:22:31.798Z","evidence_record":{"reason":"sustained load is the proving fleet's","at":"2026-10-08T19:22:31.798Z"}},{"id":"CAP-05","title":"Overload and recover without false acceptance","setup":"Start at W and inject 2W for 15 minutes with valid and invalid jobs, then return to W.","steps":["Observe admission, explicit backpressure, reservations and deadline estimates.","Track accepted jobs to valid completion or the pre-agreed failure/refund outcome.","Measure recovery time and ensure ordinary users are not silently starved."],"accept":"P07 overload policy and recovery limits hold; no accepted job vanishes or earns an invalid reward. Rejected demand is reported separately from delivery success, preventing denominator manipulation.","evidence":"Overload timeline; admission/refund logs; backlog-drain proof.","priority":"BLOCKER","profile":"P01; P07","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[17,18,24,25],"gate":"Technical readiness / commercial track","owner":"Proving lead + independent operators","manual_page":43,"owner_lane":"fleet lane (ac055d60427caab99)","run_status":"NOT RUN","evidence_path":"","run_id":"","updated":"2026-10-08T19:22:31.798Z","evidence_record":{"reason":"overload and recovery is the proving fleet's","at":"2026-10-08T19:22:31.798Z"}},{"id":"CAP-06","title":"Calibrate assignment windows to paid completion","setup":"Use a heterogeneous proving fleet, including the slowest advertised consumer tier.","steps":["Measure actual completion distributions with network delay, competing load and failed attempts.","Test the chosen exclusive window, open claiming and faster challengers after expiry.","Compare assignment frequency, paid completions and wasted work by tier."],"accept":"P07 fairness and wasted-work limits hold for advertised tiers. A provisional 10-DAA-second window is not treated as approved. Fair assignment counts alone cannot pass; payment outcomes and operator margins matter.","evidence":"Window sweep; paid-completion distribution; wasted-work and margin report.","priority":"GATE","profile":"P07; P12","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[17,18,24,25],"gate":"Technical readiness / commercial track","owner":"Proving lead + independent operators","manual_page":43,"owner_lane":"fleet lane (ac055d60427caab99)","run_status":"NOT RUN","evidence_path":"","run_id":"","updated":"2026-10-08T19:22:31.798Z","evidence_record":{"reason":"assignment windows are the proving fleet's","at":"2026-10-08T19:22:31.798Z"}},{"id":"CAP-07","title":"Reassign work when inputs or providers disappear","setup":"Remove input providers, assigned provers and the dominant aggregator independently and together.","steps":["Have replacement operators retrieve authenticated inputs without founder files.","Retry expired assignments while preserving idempotent reward and customer outcomes.","Restore providers and test late submissions racing with replacements."],"accept":"P07/P08 replacement deadlines hold when availability assumptions permit. Otherwise a truthful bounded pause/refund occurs; no fake proof, double payment or hidden privileged input source is used.","evidence":"Failure schedule; input hashes; reassignment and payout ledger; recovery trace.","priority":"BLOCKER","profile":"P01; P07; P08","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[17,18,24,25],"gate":"Technical readiness / commercial track","owner":"Proving lead + independent operators","manual_page":44,"owner_lane":"fleet lane (ac055d60427caab99)","run_status":"NOT RUN","evidence_path":"","run_id":"","updated":"2026-10-08T19:22:31.798Z","evidence_record":{"reason":"reassignment is the proving fleet's","at":"2026-10-08T19:22:31.798Z"}},{"id":"CAP-08","title":"Deliver customer-verifiable output at scale","setup":"Run the external workload using a customer-controlled verifier and independently operated workers.","steps":["Verify every delivered proof against the contracted program and input commitment.","Reject wrong-format, stale and partial deliveries; test customer retry and delivery failure.","Reconcile delivery, acceptance, payment and refund records without exposing private inputs publicly."],"accept":"P07 delivery performance and exact validity hold. Payment depends on the contracted correct result; a valid proof for the wrong job is not a successful delivery.","evidence":"Customer verification log; proof-format contract; settlement reconciliation.","priority":"BLOCKER","profile":"P01; P07; P14","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[17,18,24,25],"gate":"Technical readiness / commercial track","owner":"Proving lead + independent operators","manual_page":44,"owner_lane":"fleet lane (ac055d60427caab99)","run_status":"NOT RUN","evidence_path":"","run_id":"","updated":"2026-10-08T19:22:31.798Z","evidence_record":{"reason":"customer-verifiable output is the reference apps plus the fleet","at":"2026-10-08T19:22:31.798Z"}}]},{"code":"INC","title":"Rewards, incentives and selfish operators","source":[13,16,17,18,24,26],"gate":"G4 / G5","owner":"Protocol economics + proving leads","fixtures":"F0 fee/reward rules; F4 adversarial operators; F7 incentive models","summary":"Assume operators optimise their own returns. Do not depend on the official client choosing a less profitable task.","tests":[{"id":"INC-01","title":"Reconcile issuance, fees, burns and recipients","setup":"Use a deterministic short chain containing all reward types, fee paths and rounding cases.","steps":["Calculate balances, total supply changes, burns and distributions independently.","Execute identical blocks natively and through the proving path.","Test zero, minimum, maximum and transition-boundary values plus malformed producer accounting."],"accept":"Conservation and recipient rules match F0 exactly; no inflation, rounding leakage or duplicate reward. Fee-table and prose discrepancies are resolved before the run, not guessed by the tester.","evidence":"Independent accounting ledger; balance/supply diffs; boundary vectors.","priority":"BLOCKER","profile":"P01; P12","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[13,16,17,18,24,26],"gate":"G4 / G5","owner":"Protocol economics + proving leads","manual_page":45,"owner_lane":"enforced-proving lane (a6e8f84588b809d62)","run_status":"RUNNING","evidence_path":"build-1:/srv/artefacts/tas/201-7cfa422a-aa0e0f45/node-7cfa422a/box4-core.log","run_id":"201-7cfa422a-aa0e0f45","updated":"2026-10-08T19:32:50.856Z","evidence_record":{"cell":"suite:core","manifest_sha":"7cfa422a","coverage":{"FIN-01":"partial: the finality field and checkpoint tests on the object; ordering under load is the consensus suite and the sim","INC-01":"partial: emission, fee and payout arithmetic tests; the reconciliation over a live chain is the economics lane's","ROT-06":"partial: the dataset activation and digest tests; a live activation is the fast-time harness"},"at":"2026-10-08T19:32:50.856Z"}},{"id":"INC-02","title":"Keep revenue streams and claims separate","setup":"Prepare jobs and blocks producing mining income, internal proof rewards and external payments.","steps":["Trace money from source to operator, protocol, developer and any burn.","Compare node records, settlement records and Ember displays.","Attempt to classify testnet rewards, reimbursed purchases or token appreciation as external customer revenue."],"accept":"Every stream reconciles and is labelled correctly. No double-counted revenue or fabricated protocol demand; mining subsidy and external service income remain distinct in dashboards and ECO.","evidence":"Money-flow register; UI reconciliation; rejected classifications.","priority":"BLOCKER","profile":"P01; P12; P14","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[13,16,17,18,24,26],"gate":"G4 / G5","owner":"Protocol economics + proving leads","manual_page":45,"owner_lane":"research lane (ad6a2bd47d4a46105)","run_status":"RUNNING","evidence_path":"docs/analysis/class-v6/coexistence-model.md","run_id":"eco-d4-20261008-01","updated":"2026-10-08T19:55:03.336Z","evidence_record":{"cell":"harness:economics-model","manifest_sha":"db424d20","coverage":{"ECO-02":"partial: the existing-owner and new-entrant tests per class at three tariffs, MSRP and street, with resale (reference-population.md); resale at zero, failures and financing not yet stressed","ECO-03":"partial: the sunk-development case first with low and high ranges, private mining, hardware sales and the hybrid, GPU re-entry after the fleet (coexistence-model.md sections 2, 8a, 12 to 12c; the surface in floor/sram-and-floor.md 4.4); the source thresholds retired to coexistence-workbook.md","ECO-04":"partial: a per-class supply curve with the installed base as a cap and re-entry (coexistence-model.md), the market-structure axis (8a), the operator simulation (operator-simulation.md); dynamic agent policies beyond the single-rule reaction are the simulation second cut","ECO-06":"partial: the recipients and burns reconciled on the chain block-one split (docs/design/proving-payment.md), proving demand as an income axis at none, launch and spike (coexistence-model.md); the full-horizon issuance ledger owed","ECO-07":"partial: each dataset size scored by adversary burden against commodity burden on measured card rows and modelled chip tickets (docs/design/class-v6-rotating-family.md 10.0u); the 8.5 and 11.5 GiB knee costs expected, not measured","INC-02":"partial: the income streams kept separate in the model (mining subsidy, internal proving, external jobs; burns never counted as payment); the node-record and Ember reconciliation are the node and app lanes","INC-03":"partial: the profit-maximising operator simulation first run (mine, internal prove, external prove, off); per-card agents and switching costs are the second cut","INC-04":"partial: the four shocks in the operator simulation (the demand spike, the price fall, the largest provers leaving, the entrants), restored or not and in how many periods","INC-08":"partial: the supplier and operator dependence table (coexistence-model.md 8a); the signing, proving and aggregation roles are the node lane"},"at":"2026-10-08T19:55:03.336Z"}},{"id":"INC-03","title":"Let a modified client choose the most profitable task","setup":"Permit independent schedulers to mine, prove internally, prove externally or switch off.","steps":["Publish common costs and vary relative task rewards, memory pressure and switching costs.","Run clients that ignore the official scheduling recommendation.","Measure realised operator margin, internal capacity and network progress."],"accept":"Required P12 sustainable worlds maintain paid essential capacity without compelled altruism. Profitability and availability are based on realised outcomes, including switching and wasted work.","evidence":"Scheduler source/policies; switching traces; capacity and margin series.","priority":"GATE","profile":"P07; P12","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[13,16,17,18,24,26],"gate":"G4 / G5","owner":"Protocol economics + proving leads","manual_page":45,"owner_lane":"research lane (ad6a2bd47d4a46105)","run_status":"RUNNING","evidence_path":"docs/analysis/class-v6/coexistence-model.md","run_id":"eco-d4-20261008-01","updated":"2026-10-08T19:55:03.336Z","evidence_record":{"cell":"harness:economics-model","manifest_sha":"db424d20","coverage":{"ECO-02":"partial: the existing-owner and new-entrant tests per class at three tariffs, MSRP and street, with resale (reference-population.md); resale at zero, failures and financing not yet stressed","ECO-03":"partial: the sunk-development case first with low and high ranges, private mining, hardware sales and the hybrid, GPU re-entry after the fleet (coexistence-model.md sections 2, 8a, 12 to 12c; the surface in floor/sram-and-floor.md 4.4); the source thresholds retired to coexistence-workbook.md","ECO-04":"partial: a per-class supply curve with the installed base as a cap and re-entry (coexistence-model.md), the market-structure axis (8a), the operator simulation (operator-simulation.md); dynamic agent policies beyond the single-rule reaction are the simulation second cut","ECO-06":"partial: the recipients and burns reconciled on the chain block-one split (docs/design/proving-payment.md), proving demand as an income axis at none, launch and spike (coexistence-model.md); the full-horizon issuance ledger owed","ECO-07":"partial: each dataset size scored by adversary burden against commodity burden on measured card rows and modelled chip tickets (docs/design/class-v6-rotating-family.md 10.0u); the 8.5 and 11.5 GiB knee costs expected, not measured","INC-02":"partial: the income streams kept separate in the model (mining subsidy, internal proving, external jobs; burns never counted as payment); the node-record and Ember reconciliation are the node and app lanes","INC-03":"partial: the profit-maximising operator simulation first run (mine, internal prove, external prove, off); per-card agents and switching costs are the second cut","INC-04":"partial: the four shocks in the operator simulation (the demand spike, the price fall, the largest provers leaving, the entrants), restored or not and in how many periods","INC-08":"partial: the supplier and operator dependence table (coexistence-model.md 8a); the signing, proving and aggregation roles are the node lane"},"at":"2026-10-08T19:55:03.336Z"}},{"id":"INC-04","title":"Survive external-demand spikes and token declines","setup":"Use F7 scenarios with 10x external job offers and token-denominated mining-income shocks.","steps":["Allow miners/provers to switch freely under the declared reward and difficulty rules.","Observe hash participation, proof backlog, fees and recovery without an administrator.","Repeat with external demand dropping to zero and with a dominant operator withdrawn."],"accept":"Mandatory viable worlds meet P07/P12; stressed nonviable worlds fail or pause safely with truthful status. No emergency rule, fabricated demand or unofficial subsidy is inserted to force a pass.","evidence":"Shock timeline; fee/hash/capacity paths; failure-region report.","priority":"GATE","profile":"P07; P08; P12","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[13,16,17,18,24,26],"gate":"G4 / G5","owner":"Protocol economics + proving leads","manual_page":46,"owner_lane":"research lane (ad6a2bd47d4a46105)","run_status":"RUNNING","evidence_path":"docs/analysis/class-v6/coexistence-model.md","run_id":"eco-d4-20261008-01","updated":"2026-10-08T19:55:03.336Z","evidence_record":{"cell":"harness:economics-model","manifest_sha":"db424d20","coverage":{"ECO-02":"partial: the existing-owner and new-entrant tests per class at three tariffs, MSRP and street, with resale (reference-population.md); resale at zero, failures and financing not yet stressed","ECO-03":"partial: the sunk-development case first with low and high ranges, private mining, hardware sales and the hybrid, GPU re-entry after the fleet (coexistence-model.md sections 2, 8a, 12 to 12c; the surface in floor/sram-and-floor.md 4.4); the source thresholds retired to coexistence-workbook.md","ECO-04":"partial: a per-class supply curve with the installed base as a cap and re-entry (coexistence-model.md), the market-structure axis (8a), the operator simulation (operator-simulation.md); dynamic agent policies beyond the single-rule reaction are the simulation second cut","ECO-06":"partial: the recipients and burns reconciled on the chain block-one split (docs/design/proving-payment.md), proving demand as an income axis at none, launch and spike (coexistence-model.md); the full-horizon issuance ledger owed","ECO-07":"partial: each dataset size scored by adversary burden against commodity burden on measured card rows and modelled chip tickets (docs/design/class-v6-rotating-family.md 10.0u); the 8.5 and 11.5 GiB knee costs expected, not measured","INC-02":"partial: the income streams kept separate in the model (mining subsidy, internal proving, external jobs; burns never counted as payment); the node-record and Ember reconciliation are the node and app lanes","INC-03":"partial: the profit-maximising operator simulation first run (mine, internal prove, external prove, off); per-card agents and switching costs are the second cut","INC-04":"partial: the four shocks in the operator simulation (the demand spike, the price fall, the largest provers leaving, the entrants), restored or not and in how many periods","INC-08":"partial: the supplier and operator dependence table (coexistence-model.md 8a); the signing, proving and aggregation roles are the node lane"},"at":"2026-10-08T19:55:03.336Z"}},{"id":"INC-05","title":"Contain job reservation and identity-splitting abuse","setup":"Freeze the actual assignment/payment mechanism; do not assume unimplemented collateral or identity controls.","steps":["Create many worker identities, reserve jobs, withhold proofs and submit late results.","Attempt free option-taking, duplicate work rewards and displacement of honest assignments.","Price attacker costs and observe honest completion under the approved abuse load."],"accept":"F0 rules and P07 service limits hold under the declared adversary. Identity splitting does not create unauthorised rewards or control; any unmitigated starvation path blocks the permissionless-service claim.","evidence":"Attack clients; assignment trace; cost-to-disrupt analysis; honest-user outcomes.","priority":"BLOCKER","profile":"P01; P07; P09","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[13,16,17,18,24,26],"gate":"G4 / G5","owner":"Protocol economics + proving leads","manual_page":46,"owner_lane":"enforced-proving lane (a6e8f84588b809d62)","run_status":"NOT RUN","evidence_path":"","run_id":"","updated":"2026-10-08T19:22:31.798Z","evidence_record":{"reason":"reservation abuse needs the capacity harness","at":"2026-10-08T19:22:31.798Z"}},{"id":"INC-06","title":"Test difficulty and timestamp manipulation","setup":"Use the actual adjustment algorithm and consensus timestamp rule with independent miners.","steps":["Inject large hashrate arrivals/departures, periodic selective mining and boundary-timed bursts.","Try allowed and invalid timestamp skew, withheld blocks and replayed work.","Observe block intervals, reward allocation and recovery after hashrate stabilises."],"accept":"Invalid inputs are rejected; valid adversarial strategies remain within F0/P08 bounds and are priced in ECO. No unexplained reward amplification, permanent stall or conflicting accepted work.","evidence":"Difficulty trace; timestamp corpus; revenue analysis; independent rule review.","priority":"BLOCKER","profile":"P01; P08; P12","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[13,16,17,18,24,26],"gate":"G4 / G5","owner":"Protocol economics + proving leads","manual_page":46,"owner_lane":"research lane (ad6a2bd47d4a46105)","run_status":"NOT RUN","evidence_path":"","run_id":"","updated":"2026-10-08T19:22:31.798Z","evidence_record":{"reason":"difficulty and timestamp manipulation needs the fault network F4","at":"2026-10-08T19:22:31.798Z"}},{"id":"INC-07","title":"Resist self-dealing fees and fake proving demand","setup":"Use self-funded operators and related customer identities in the isolated economic model/network.","steps":["Cycle funds through jobs, tips, developer shares and rebates to seek net reward extraction.","Attempt to inflate external-demand metrics without genuine unrelated customer expenditure.","Reconcile all counterparties and net cash contribution rather than gross transaction volume."],"accept":"No unauthorised subsidy extraction or metric inflation passes. Related-party volume is disclosed/excluded from P14; net external cash and legitimate protocol incentives are reported separately.","evidence":"Circular-flow tests; ownership/conflict review; net-cash reconciliation.","priority":"BLOCKER","profile":"P01; P12; P14","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[13,16,17,18,24,26],"gate":"G4 / G5","owner":"Protocol economics + proving leads","manual_page":47,"owner_lane":"enforced-proving lane (a6e8f84588b809d62)","run_status":"NOT RUN","evidence_path":"","run_id":"","updated":"2026-10-08T19:22:31.798Z","evidence_record":{"reason":"self-dealing fees need the economic model and a live window","at":"2026-10-08T19:22:31.798Z"}},{"id":"INC-08","title":"Quantify provider and supplier failure concentration","setup":"Model control of hashing, signing, proving, aggregation and hardware supply separately.","steps":["Remove each largest operational dependency and combine correlated failures.","Measure replacement cost/time and whether essential roles share hidden ownership.","Compare results with the approved fault model and no-rescue exercise."],"accept":"No hidden single dependency defeats the claimed independence; within-tolerance withdrawals recover under P08/P11. Hardware supply concentration is disclosed without equating vendor sales to operator voting control.","evidence":"Role/ownership map; dependency removals; recovery and concentration report.","priority":"GATE","profile":"P08; P11; P12","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[13,16,17,18,24,26],"gate":"G4 / G5","owner":"Protocol economics + proving leads","manual_page":47,"owner_lane":"research lane (ad6a2bd47d4a46105)","run_status":"RUNNING","evidence_path":"docs/analysis/class-v6/coexistence-model.md","run_id":"eco-d4-20261008-01","updated":"2026-10-08T19:55:03.336Z","evidence_record":{"cell":"harness:economics-model","manifest_sha":"db424d20","coverage":{"ECO-02":"partial: the existing-owner and new-entrant tests per class at three tariffs, MSRP and street, with resale (reference-population.md); resale at zero, failures and financing not yet stressed","ECO-03":"partial: the sunk-development case first with low and high ranges, private mining, hardware sales and the hybrid, GPU re-entry after the fleet (coexistence-model.md sections 2, 8a, 12 to 12c; the surface in floor/sram-and-floor.md 4.4); the source thresholds retired to coexistence-workbook.md","ECO-04":"partial: a per-class supply curve with the installed base as a cap and re-entry (coexistence-model.md), the market-structure axis (8a), the operator simulation (operator-simulation.md); dynamic agent policies beyond the single-rule reaction are the simulation second cut","ECO-06":"partial: the recipients and burns reconciled on the chain block-one split (docs/design/proving-payment.md), proving demand as an income axis at none, launch and spike (coexistence-model.md); the full-horizon issuance ledger owed","ECO-07":"partial: each dataset size scored by adversary burden against commodity burden on measured card rows and modelled chip tickets (docs/design/class-v6-rotating-family.md 10.0u); the 8.5 and 11.5 GiB knee costs expected, not measured","INC-02":"partial: the income streams kept separate in the model (mining subsidy, internal proving, external jobs; burns never counted as payment); the node-record and Ember reconciliation are the node and app lanes","INC-03":"partial: the profit-maximising operator simulation first run (mine, internal prove, external prove, off); per-card agents and switching costs are the second cut","INC-04":"partial: the four shocks in the operator simulation (the demand spike, the price fall, the largest provers leaving, the entrants), restored or not and in how many periods","INC-08":"partial: the supplier and operator dependence table (coexistence-model.md 8a); the signing, proving and aggregation roles are the node lane"},"at":"2026-10-08T19:55:03.336Z"}}]},{"code":"FIN","title":"Consensus safety and recovery","source":[19,21,24,25],"gate":"G5 / technical readiness","owner":"Consensus lead + independent formal/security review","fixtures":"F0 exact fault model; F4 real-node partitions; F5 certificates and historical failures","summary":"Test safety under the stated fault bounds. Demand liveness only when synchrony and participation assumptions actually hold.","tests":[{"id":"FIN-01","title":"Agree on ordering, work and executed state","setup":"Use real fork-choice/DAG handling and independent miners, not only a simplified simulator.","steps":["Generate concurrent branches, delayed blocks, duplicates and invalid work with deterministic seeds.","Compare selected ordering, accumulated work, transaction execution and state roots after delivery converges.","Replay from independent checkpoints and from genesis where practical."],"accept":"Honest nodes converge under F0 assumptions with exact roots and rewards. No duplicated work accounting or undocumented ordering dependence; simulator-only success cannot substitute.","evidence":"Block/ordering corpus; root/work diffs; real-node replay logs.","priority":"BLOCKER","profile":"P01; P08","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[19,21,24,25],"gate":"G5 / technical readiness","owner":"Consensus lead + independent formal/security review","manual_page":48,"owner_lane":"fast-time lane (a8be71a0db962911c)","run_status":"RUNNING","evidence_path":"build-1:/srv/artefacts/tas/201-7cfa422a-aa0e0f45/node-7cfa422a/box4-consensus.log","run_id":"201-7cfa422a-aa0e0f45","updated":"2026-10-08T19:32:50.856Z","evidence_record":{"cell":"suite:consensus","manifest_sha":"7cfa422a","coverage":{"FIN-01":"partial: the finality processes' agreement tests","FIN-03":"partial: rule v4's anchored table and authority expiry tests (bee41b5e)","FIN-04":"partial: the frozen table without its time expiry (rule v4)","FIN-05":"partial: key succession and another scheme's vote refused","FIN-07":"partial: majority-continuity recovery (rule v4)","ROT-05":"partial: the finality-stopped pause tests","ZKP-01":"partial: a proof-less or wrong-statement block refused by consensus"},"at":"2026-10-08T19:32:50.856Z"}},{"id":"FIN-02","title":"Attack finality with split honest populations","setup":"Use the source-discussed 40/40/20 weight split, plus threshold-boundary splits under F0.","steps":["Let the 20% adversarial group sign conflicting histories while honest groups are partitioned.","Delay messages and eligibility updates independently; keep total historical weights auditable.","Try to form two certificates and reconnect nodes to observe accepted final history."],"accept":"No conflicting final certificates are accepted within the declared fault bound. A safe pause is valid when quorum is unavailable; making progress on both sides is not required.","evidence":"Signed votes; certificate attempts; voter-table snapshots; safety checker output.","priority":"BLOCKER","profile":"P01; P08","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[19,21,24,25],"gate":"G5 / technical readiness","owner":"Consensus lead + independent formal/security review","manual_page":48,"owner_lane":"finality lane (aca0f5ed924a2a99b)","run_status":"PASS","evidence_path":"sim/finality-attacks-results/v4-pause-fix.md","run_id":"fin-v4-realnode-20261008T2025Z","updated":"2026-10-08T19:43:19.697Z","evidence_record":{"cell":"node:finality-realnode","manifest_sha":"12424341","coverage":{"FIN-02":"partial: the real-node half; independent operators and the review remain","FIN-07":"partial: deterministic recovery after reconnection and crash on real nodes (the HEAL reruns)"},"at":"2026-10-08T19:43:19.697Z"}},{"id":"FIN-03","title":"Cross authority expiry in a long partition","setup":"Recover historical expiry failures where available; use the actual current authority-transition rules.","steps":["Partition for 31, 35, 60 and 90 logical days and around every retention/expiry boundary.","Attempt independently renewed authority sets and conflicting checkpoint locks.","Repeat selected boundary cases on real nodes with accelerated timers explicitly labelled."],"accept":"Authority continuity remains authenticated and no conflicting final history appears within F0 assumptions. A timeout is not accepted as proof absent voters ceased to exist. Compressed time is not multi-month field evidence.","evidence":"Expiry timeline; table/certificate history; historical regression tests.","priority":"BLOCKER","profile":"P01; P08","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[19,21,24,25],"gate":"G5 / technical readiness","owner":"Consensus lead + independent formal/security review","manual_page":48,"owner_lane":"finality lane (aca0f5ed924a2a99b)","run_status":"RUNNING","evidence_path":"build-1:/srv/artefacts/tas/201-7cfa422a-aa0e0f45/node-7cfa422a/box4-consensus.log","run_id":"201-7cfa422a-aa0e0f45","updated":"2026-10-08T19:32:50.856Z","evidence_record":{"cell":"suite:consensus","manifest_sha":"7cfa422a","coverage":{"FIN-01":"partial: the finality processes' agreement tests","FIN-03":"partial: rule v4's anchored table and authority expiry tests (bee41b5e)","FIN-04":"partial: the frozen table without its time expiry (rule v4)","FIN-05":"partial: key succession and another scheme's vote refused","FIN-07":"partial: majority-continuity recovery (rule v4)","ROT-05":"partial: the finality-stopped pause tests","ZKP-01":"partial: a proof-less or wrong-statement block refused by consensus"},"at":"2026-10-08T19:32:50.856Z"}},{"id":"FIN-04","title":"Stop signing while mining continues","setup":"Remove enough signing participation to invalidate the liveness assumption without forging votes.","steps":["Continue mining and execution, cross seed boundaries and monitor proof queues.","Check which user-visible states advance and which remain unfinalised.","Restore eligible weight and bounded message delay, then verify recovery."],"accept":"No false finality or fabricated authority. Behaviour matches F0 during the pause and P08 after assumptions return; unfinished transactions are not displayed as irreversible.","evidence":"Signing/mining trace; UI/RPC states; recovery roots and timing.","priority":"BLOCKER","profile":"P01; P08","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[19,21,24,25],"gate":"G5 / technical readiness","owner":"Consensus lead + independent formal/security review","manual_page":49,"owner_lane":"finality lane (aca0f5ed924a2a99b)","run_status":"RUNNING","evidence_path":"build-1:/srv/artefacts/tas/201-7cfa422a-aa0e0f45/node-7cfa422a/box4-consensus.log","run_id":"201-7cfa422a-aa0e0f45","updated":"2026-10-08T19:32:50.856Z","evidence_record":{"cell":"suite:consensus","manifest_sha":"7cfa422a","coverage":{"FIN-01":"partial: the finality processes' agreement tests","FIN-03":"partial: rule v4's anchored table and authority expiry tests (bee41b5e)","FIN-04":"partial: the frozen table without its time expiry (rule v4)","FIN-05":"partial: key succession and another scheme's vote refused","FIN-07":"partial: majority-continuity recovery (rule v4)","ROT-05":"partial: the finality-stopped pause tests","ZKP-01":"partial: a proof-less or wrong-statement block refused by consensus"},"at":"2026-10-08T19:32:50.856Z"}},{"id":"FIN-05","title":"Authenticate voter-set changes and pooled keys","setup":"Use normal transitions, pool members retaining keys and malicious substitution attempts.","steps":["Alter voter weights, membership proofs, miner/pool identity bindings and prior-certificate links.","Race updates across boundaries and replay old signed changes.","Have a new node verify the authority chain from its declared trust anchor."],"accept":"Only correctly authenticated changes are accepted; weights cannot be double-counted or redirected by a pool. All honest nodes agree on the active authority set for each certified point.","evidence":"Authority-chain fixtures; substitution attacks; new-node verification log.","priority":"BLOCKER","profile":"P01; P08","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[19,21,24,25],"gate":"G5 / technical readiness","owner":"Consensus lead + independent formal/security review","manual_page":49,"owner_lane":"finality lane (aca0f5ed924a2a99b)","run_status":"RUNNING","evidence_path":"build-1:/srv/artefacts/tas/201-7cfa422a-aa0e0f45/node-7cfa422a/box4-consensus.log","run_id":"201-7cfa422a-aa0e0f45","updated":"2026-10-08T19:32:50.856Z","evidence_record":{"cell":"suite:consensus","manifest_sha":"7cfa422a","coverage":{"FIN-01":"partial: the finality processes' agreement tests","FIN-03":"partial: rule v4's anchored table and authority expiry tests (bee41b5e)","FIN-04":"partial: the frozen table without its time expiry (rule v4)","FIN-05":"partial: key succession and another scheme's vote refused","FIN-07":"partial: majority-continuity recovery (rule v4)","ROT-05":"partial: the finality-stopped pause tests","ZKP-01":"partial: a proof-less or wrong-statement block refused by consensus"},"at":"2026-10-08T19:32:50.856Z"}},{"id":"FIN-06","title":"Analyse old-key compromise and long-range histories","setup":"Freeze assumptions about key erasure, retained weights, trust anchors and offline recovery.","steps":["Use previously eligible keys to build alternative histories after their operators disappear.","Present these histories to recently offline and newly joining clients.","Test replayed certificates, stale anchors and compromised signer subsets."],"accept":"Acceptance matches the explicit security model with no hidden trusted recovery step. Any reliance on a recent trusted anchor is disclosed and tested; hashpower assumptions cannot replace old-key analysis.","evidence":"Long-range corpus; trust-anchor policy; key-compromise review; client results.","priority":"BLOCKER","profile":"P01; P08","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[19,21,24,25],"gate":"G5 / technical readiness","owner":"Consensus lead + independent formal/security review","manual_page":49,"owner_lane":"finality lane (aca0f5ed924a2a99b)","run_status":"RUNNING","evidence_path":"sim/results_v2.md Rule v4","run_id":"team-2026-10-08","updated":"2026-10-08 18:3x UK","evidence_record":{"what_was_run":"bought and stolen keys in the simulator rows","run_by":"finality lane (aca0f5ed924a2a99b)","under_the_standard":"no: team-run before the standard's procedure; the status is RUNNING until the case is re-run under its steps with the profile's numbers and an independent run where the profile asks one","pass_or_fail_today":"not judged under the standard yet"}},{"id":"FIN-07","title":"Recover deterministically after reconnection and crash","setup":"Combine partitions with node crash, partial writes, restarts and proof backlog.","steps":["Reconnect networks under bounded latency and restore required honest participation.","Verify fork choice, unfinalised reorganisation, finality, reward rollback and proof reassignments.","Compare all honest nodes and customer-visible receipts after recovery."],"accept":"P08 recovery holds without reversing a previously valid final guarantee. Only permitted unfinalised state is reorganised; no duplicate rewards or inconsistent receipt statuses survive.","evidence":"Recovery timelines; roots/certificates; payout rollback; customer-state reconciliation.","priority":"BLOCKER","profile":"P01; P08","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[19,21,24,25],"gate":"G5 / technical readiness","owner":"Consensus lead + independent formal/security review","manual_page":50,"owner_lane":"finality lane (aca0f5ed924a2a99b)","run_status":"PASS","evidence_path":"sim/finality-attacks-results/v4-pause-fix.md","run_id":"fin-v4-realnode-20261008T2025Z","updated":"2026-10-08T19:43:19.697Z","evidence_record":{"cell":"node:finality-realnode","manifest_sha":"12424341","coverage":{"FIN-02":"partial: the real-node half; independent operators and the review remain","FIN-07":"partial: deterministic recovery after reconnection and crash on real nodes (the HEAL reruns)"},"at":"2026-10-08T19:43:19.697Z"}},{"id":"FIN-08","title":"Combine boundaries, faults and adversarial scheduling","setup":"Use an independent model checker/scheduler and production-node scenarios from F4.","steps":["Combine epoch changes, authority transitions, mining churn, data delays and prover/aggregator loss.","Explore bounded adversarial message schedules and minimise any counterexample.","Replay model findings on real code and have an independent reviewer assess uncovered states."],"accept":"No unresolved safety failure; liveness claims hold only within declared assumptions and P08. Model bounds and untested schedules are published, not described as proof over every possible execution.","evidence":"Model/spec artifacts; schedule corpus; replay evidence; independent assessment.","priority":"BLOCKER","profile":"P01; P08","cadence":"Release candidate; repeat after relevant changes","method":"Model checking + real-node testing","status":"NOT RUN","source":[19,21,24,25],"gate":"G5 / technical readiness","owner":"Consensus lead + independent formal/security review","manual_page":50,"owner_lane":"fast-time lane (a8be71a0db962911c)","run_status":"RUNNING","evidence_path":"sim/results_v2.md","run_id":"fin-v4-realnode-20261008T2025Z","updated":"2026-10-08T19:43:19.697Z","evidence_record":{"cell":"harness:finality-sim","manifest_sha":"12424341","coverage":{"FIN-08":"partial: the combined boundary and fault scenarios in the simulator with adversarial schedules; model checking is the formal review"},"at":"2026-10-08T19:43:19.697Z"}}],"notes":[{"at":"2026-10-08T19:32:50.918Z","text":"F04 (Review B), the founder's ruling 8 October 19:57 UK: the recovery lock is kept and is always labelled 'recovery', never 'final', on every surface (the checkpoint field, the explorer, receipts, the light client, the oracle, the site)"}]},{"code":"VER","title":"Wallets, receipts and data availability","source":[20,25,35,37],"gate":"Technical readiness / claimed options","owner":"Wallet + light-client lead; independent security review","fixtures":"F0 trust/availability model; F5 malformed roots, receipts and authority chains","summary":"Verify the exact property shown to the user. An inclusion proof, execution proof and finality certificate are not interchangeable.","tests":[{"id":"VER-01","title":"Authenticate light-client bootstrap","setup":"Give a clean client malicious RPC responses, fabricated voter tables and valid-looking signatures.","steps":["Start from the approved trust anchor and verify every required link to the advertised state.","Substitute otherwise well-formed but unauthorised keys, weights and checkpoints.","Remove the bootstrap service and use another independently operated source."],"accept":"The client rejects unauthorised authority and discloses any trust anchor. Signatures over a node-supplied table do not by themselves pass; missing authentication never silently degrades to trusted RPC.","evidence":"Bootstrap corpus; trust-chain trace; fail-closed tests.","priority":"BLOCKER","profile":"P01; P09","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[20,25,35,37],"gate":"Technical readiness / claimed options","owner":"Wallet + light-client lead; independent security review","manual_page":51,"owner_lane":"reference-apps lane (a2060899d2a27d31c)","run_status":"FAIL","evidence_path":"tools/reference-apps/ver/evidence/VER-01.json","run_id":"ra-20261008T1915-ver","updated":"2026-10-08T19:46:20.696Z","evidence_record":{"cell":"harness:reference-apps-ver-trust-anchor","manifest_sha":"4cdcc488","coverage":{"VER-01":"fails today, disclosed: the light client authenticates the certificate's signatures and the header path but the voter table is a node-supplied trust anchor named on /light; a forged table signature and a wrong-network certificate are refused","VER-02":"fails today, disclosed: the execution statement's proof is verified by the nodes and the browser verifies the aggregator signature and the post root under it; an in-browser verifier for the permitted proof and a table commitment close it"},"at":"2026-10-08T19:46:20.696Z"}},{"id":"VER-02","title":"Verify evolving authority and execution statements","setup":"Use valid state proofs paired with wrong execution statements or stale authority histories.","steps":["Cross voter and verifier changes with offline clients returning after long intervals.","Alter roots, aggregate identity and proof/public-input bindings independently.","Check local verification rather than merely a server-reported verified flag."],"accept":"All advertised proof checks occur locally or the remaining trust is explicitly disclosed. Wrong roots and unauthenticated authority are rejected; unsupported verification paths are not claimed.","evidence":"Client verification trace; corrupted inputs; offline/upgrade results.","priority":"BLOCKER","profile":"P01; P09","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[20,25,35,37],"gate":"Technical readiness / claimed options","owner":"Wallet + light-client lead; independent security review","manual_page":51,"owner_lane":"reference-apps lane (a2060899d2a27d31c)","run_status":"FAIL","evidence_path":"tools/reference-apps/ver/evidence/VER-01.json","run_id":"ra-20261008T1915-ver","updated":"2026-10-08T19:46:20.696Z","evidence_record":{"cell":"harness:reference-apps-ver-trust-anchor","manifest_sha":"4cdcc488","coverage":{"VER-01":"fails today, disclosed: the light client authenticates the certificate's signatures and the header path but the voter table is a node-supplied trust anchor named on /light; a forged table signature and a wrong-network certificate are refused","VER-02":"fails today, disclosed: the execution statement's proof is verified by the nodes and the browser verifies the aggregator signature and the post root under it; an in-browser verifier for the permitted proof and a table commitment close it"},"at":"2026-10-08T19:46:20.696Z"}},{"id":"VER-03","title":"Prove successful payment rather than inclusion","setup":"Create successful, reverted, wrong-asset, wrong-recipient and wrong-amount transfers.","steps":["Generate receipts for included transactions, including failures and replaced/unfinalised transactions.","Verify execution status plus asset, recipient, amount and canonical-state/receipt commitment.","Replay the receipt on another chain and after an allowed unfinalised reorganisation."],"accept":"Only the actual successful, correctly bound transfer is labelled payment proof. Inclusion-only receipts are labelled as such; no node-reported success flag substitutes for authenticated outcome.","evidence":"Payment fixture corpus; receipt verification; merchant-facing status checks.","priority":"BLOCKER","profile":"P01; P09","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[20,25,35,37],"gate":"Technical readiness / claimed options","owner":"Wallet + light-client lead; independent security review","manual_page":51,"owner_lane":"reference-apps lane (a2060899d2a27d31c)","run_status":"RUNNING","evidence_path":"tools/reference-apps/ver/evidence/summary.json","run_id":"ra-20261008T1915-ver","updated":"2026-10-08T19:46:20.696Z","evidence_record":{"cell":"harness:reference-apps-ver","manifest_sha":"4cdcc488","coverage":{"VER-03":"partial: a payment receipt is labelled payment only when the receipt is proven against the segment statement's receipts commitment under the finality certificate, inclusion-only receipts read inclusion, a tampered receipt and a flipped status fail; run on the Devnet 3 fixtures, the 2.0 devnet re-run waits for its first paid segment whose last block carries a transaction; Review B F04: a receipt claiming lock_state final under a certificate the node reports as a recovery lock is refused, a recovery lock prints as recovery lock, not final (Node and browser negative cases on the fixtures; the field is not live on devnet-4 tonight, so no live recovery lock was seen)","VER-04":"partial: the oracle's trust() names the deployer-installed table and the unchecked aggregator signature, a second hash at a stored certificate index is refused, a root claim at an unknown index is refused, another chain id is refused (tools/reference-apps/oracle/test.mjs on Sepolia); Review B F04: the Sepolia verifiers apply the two-thirds rule only, carry no lock-kind field, and an under-threshold (recovery-rule) certificate fails closed in submitCertificate, so no stored root is a recovery lock (the DEX lane's docs/bridge/light-client-bridge.md paragraph); the claimed-option review of the trust model is the reviewer's","VER-06":"partial: the read service never serves a certificate from another network, a withheld header in the path and a corrupted proof node are detected, stale data prints its lock age beside every balance, and a client told no certificate never falls back to a trusted RPC balance; detection on the fault network F4 is not run","VER-08":"partial: every served state on /light, /receipt and /oracle uses one of included, executed, proven, finalised from the shared definition block, the lock line serves the live DAA before the first certificate, and the trust assumptions are listed on each page; the wallet and explorer surfaces are their lanes' rows; Review B F04: /light, /receipt, the receipt file and the one-file verifier show a node-reported recovery lock as recovery lock, not final, /oracle says recovery locks are not accepted by its verifier, the terms block defines the recovery lock"},"at":"2026-10-08T19:46:20.696Z"}},{"id":"VER-04","title":"Bound cross-chain oracle trust and replay","setup":"For a claimed oracle, freeze destination verifier, authority updates, accepted proof types and replay policy.","steps":["Try deployer-substituted keys, stale certificates, unchecked signatures and wrong source/destination identities.","Exercise legitimate authority updates and source reorganisations under the approved model.","Measure gas/cost with realistic header sets and test disabled/unavailable verification."],"accept":"The oracle enforces its declared trust model and fails closed. Deployer privileges and unavailable guarantees are explicit; no trustless-bridge claim exceeds the checks performed. Excluded oracle scope earns no pass credit.","evidence":"Oracle code/parameters; attack cases; cost report; privilege disclosure.","priority":"BLOCKER","profile":"P00; P01; P09","cadence":"Release candidate; repeat after relevant changes","method":"Claimed-option verification","status":"NOT RUN","source":[20,25,35,37],"gate":"Technical readiness / claimed options","owner":"Wallet + light-client lead; independent security review","manual_page":52,"owner_lane":"reference-apps lane (a2060899d2a27d31c)","run_status":"RUNNING","evidence_path":"tools/reference-apps/ver/evidence/summary.json","run_id":"ra-20261008T1915-ver","updated":"2026-10-08T19:46:20.696Z","evidence_record":{"cell":"harness:reference-apps-ver","manifest_sha":"4cdcc488","coverage":{"VER-03":"partial: a payment receipt is labelled payment only when the receipt is proven against the segment statement's receipts commitment under the finality certificate, inclusion-only receipts read inclusion, a tampered receipt and a flipped status fail; run on the Devnet 3 fixtures, the 2.0 devnet re-run waits for its first paid segment whose last block carries a transaction; Review B F04: a receipt claiming lock_state final under a certificate the node reports as a recovery lock is refused, a recovery lock prints as recovery lock, not final (Node and browser negative cases on the fixtures; the field is not live on devnet-4 tonight, so no live recovery lock was seen)","VER-04":"partial: the oracle's trust() names the deployer-installed table and the unchecked aggregator signature, a second hash at a stored certificate index is refused, a root claim at an unknown index is refused, another chain id is refused (tools/reference-apps/oracle/test.mjs on Sepolia); Review B F04: the Sepolia verifiers apply the two-thirds rule only, carry no lock-kind field, and an under-threshold (recovery-rule) certificate fails closed in submitCertificate, so no stored root is a recovery lock (the DEX lane's docs/bridge/light-client-bridge.md paragraph); the claimed-option review of the trust model is the reviewer's","VER-06":"partial: the read service never serves a certificate from another network, a withheld header in the path and a corrupted proof node are detected, stale data prints its lock age beside every balance, and a client told no certificate never falls back to a trusted RPC balance; detection on the fault network F4 is not run","VER-08":"partial: every served state on /light, /receipt and /oracle uses one of included, executed, proven, finalised from the shared definition block, the lock line serves the live DAA before the first certificate, and the trust assumptions are listed on each page; the wallet and explorer surfaces are their lanes' rows; Review B F04: /light, /receipt, the receipt file and the one-file verifier show a node-reported recovery lock as recovery lock, not final, /oracle says recovery locks are not accepted by its verifier, the terms block defines the recovery lock"},"at":"2026-10-08T19:46:20.696Z"}},{"id":"VER-05","title":"Reconstruct required state without founder storage","setup":"Remove founder archival/input services and start an independent operator from the documented entry point.","steps":["Fetch authenticated blocks, state/proof inputs and any required witnesses from permitted peers.","Rebuild the expected state and continue validation/proving.","Measure bandwidth, disk, time and retention requirements against advertised operator budgets."],"accept":"Required data can be obtained and verified within the declared availability model. Hidden archives or unpublished files block independence. A valid execution proof alone does not satisfy this test.","evidence":"Download/reconstruction logs; data hashes; resource costs; dependency inventory.","priority":"BLOCKER","profile":"P01; P08; P09","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[20,25,35,37],"gate":"Technical readiness / claimed options","owner":"Wallet + light-client lead; independent security review","manual_page":52,"owner_lane":"reference-apps lane (a2060899d2a27d31c)","run_status":"FAIL","evidence_path":"tools/reference-apps/ver/evidence/VER-05.json","run_id":"ra-20261008T1915-ver","updated":"2026-10-08T19:46:20.696Z","evidence_record":{"cell":"harness:reference-apps-ver-availability","manifest_sha":"4cdcc488","coverage":{"VER-05":"partial: the public read node must report startedFrom genesis (no snapshot) and the reference reader on build-1 executed the 2.0 devnet from genesis with no snapshot; the pages fetch headers, certificates, coinbase bodies and account proofs from the public read RPC only; the archive and availability model beyond the 2,048-block state ring is the OPS no-founder exercise. Run ra-20261008T1915-ver: FAIL, the public node reports startedFrom snapshot (restarted from a snapshot after 17:46 UK); the reader on build-1 still from genesis"},"at":"2026-10-08T19:46:20.696Z"}},{"id":"VER-06","title":"Detect withholding, corruption and stale data","setup":"Serve valid commitments with missing data, corrupted chunks, stale witnesses and conflicting peer replies.","steps":["Attempt to make a validator or light client accept an unavailable or incorrect state under F0.","Test retrieval from independent peers and expiry/retry policy.","Restore data and check that recovery cannot alter an already verified commitment."],"accept":"No unjustified available/verified status; safety and admission rules match F0. Recovery is bounded where assumptions permit, and unavailable-data states remain visible instead of hidden behind proofs.","evidence":"Withholding corpus; peer retrieval traces; availability/status checks.","priority":"BLOCKER","profile":"P01; P08; P09","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[20,25,35,37],"gate":"Technical readiness / claimed options","owner":"Wallet + light-client lead; independent security review","manual_page":52,"owner_lane":"reference-apps lane (a2060899d2a27d31c)","run_status":"RUNNING","evidence_path":"tools/reference-apps/ver/evidence/summary.json","run_id":"ra-20261008T1915-ver","updated":"2026-10-08T19:46:20.696Z","evidence_record":{"cell":"harness:reference-apps-ver","manifest_sha":"4cdcc488","coverage":{"VER-03":"partial: a payment receipt is labelled payment only when the receipt is proven against the segment statement's receipts commitment under the finality certificate, inclusion-only receipts read inclusion, a tampered receipt and a flipped status fail; run on the Devnet 3 fixtures, the 2.0 devnet re-run waits for its first paid segment whose last block carries a transaction; Review B F04: a receipt claiming lock_state final under a certificate the node reports as a recovery lock is refused, a recovery lock prints as recovery lock, not final (Node and browser negative cases on the fixtures; the field is not live on devnet-4 tonight, so no live recovery lock was seen)","VER-04":"partial: the oracle's trust() names the deployer-installed table and the unchecked aggregator signature, a second hash at a stored certificate index is refused, a root claim at an unknown index is refused, another chain id is refused (tools/reference-apps/oracle/test.mjs on Sepolia); Review B F04: the Sepolia verifiers apply the two-thirds rule only, carry no lock-kind field, and an under-threshold (recovery-rule) certificate fails closed in submitCertificate, so no stored root is a recovery lock (the DEX lane's docs/bridge/light-client-bridge.md paragraph); the claimed-option review of the trust model is the reviewer's","VER-06":"partial: the read service never serves a certificate from another network, a withheld header in the path and a corrupted proof node are detected, stale data prints its lock age beside every balance, and a client told no certificate never falls back to a trusted RPC balance; detection on the fault network F4 is not run","VER-08":"partial: every served state on /light, /receipt and /oracle uses one of included, executed, proven, finalised from the shared definition block, the lock line serves the live DAA before the first certificate, and the trust assumptions are listed on each page; the wallet and explorer surfaces are their lanes' rows; Review B F04: /light, /receipt, the receipt file and the one-file verifier show a node-reported recovery lock as recovery lock, not final, /oracle says recovery locks are not accepted by its verifier, the terms block defines the recovery lock"},"at":"2026-10-08T19:46:20.696Z"}},{"id":"VER-07","title":"Protect wallet keys, signing and recovery","setup":"Use test-only keys, encrypted backups and clean replacement devices; no real user funds.","steps":["Attempt secret access from proving jobs, logs, crash dumps, clipboard and telemetry paths.","Verify transaction destination/amount before signing; test backup/restore and wrong-password handling.","Upgrade and recover without silently changing signing authority or exposing seed material."],"accept":"No unintended secret disclosure or unauthorised signature. Supported recovery restores the correct keys and accounts; users receive explicit risk/backup information. Logs are sanitised without hiding security evidence.","evidence":"Security review; canary-secret tests; signing fixtures; restore journey.","priority":"BLOCKER","profile":"P01; P09","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[20,25,35,37],"gate":"Technical readiness / claimed options","owner":"Wallet + light-client lead; independent security review","manual_page":53,"owner_lane":"shipper (ae892a8b0f78fe31c)","run_status":"NOT RUN","evidence_path":"","run_id":"","updated":"2026-10-08T19:22:31.798Z","evidence_record":{"reason":"wallet key protection is the wallet lane's security row","at":"2026-10-08T19:22:31.798Z"}},{"id":"VER-08","title":"Keep every user-facing state truthful","setup":"Create included-only, executed, proven, finalised, reverted, stale and paused examples.","steps":["Compare explorer, wallet, receipt, RPC and customer API labels against authenticated evidence.","Interrupt finality and proof services and observe refresh/reconnect behaviour.","Check statements about privacy, Ethereum security and device support."],"accept":"No stronger state is implied than verified; stale data is marked and failures are actionable. EVM compatibility is not labelled Ethereum security, and ZK technology is not automatically labelled transaction privacy.","evidence":"Cross-surface screenshots/logs; state mapping; claim review.","priority":"BLOCKER","profile":"P01; P09","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[20,25,35,37],"gate":"Technical readiness / claimed options","owner":"Wallet + light-client lead; independent security review","manual_page":53,"owner_lane":"reference-apps lane (a2060899d2a27d31c)","run_status":"RUNNING","evidence_path":"tools/reference-apps/ver/evidence/summary.json","run_id":"ra-20261008T1915-ver","updated":"2026-10-08T19:46:20.696Z","evidence_record":{"cell":"harness:reference-apps-ver","manifest_sha":"4cdcc488","coverage":{"VER-03":"partial: a payment receipt is labelled payment only when the receipt is proven against the segment statement's receipts commitment under the finality certificate, inclusion-only receipts read inclusion, a tampered receipt and a flipped status fail; run on the Devnet 3 fixtures, the 2.0 devnet re-run waits for its first paid segment whose last block carries a transaction; Review B F04: a receipt claiming lock_state final under a certificate the node reports as a recovery lock is refused, a recovery lock prints as recovery lock, not final (Node and browser negative cases on the fixtures; the field is not live on devnet-4 tonight, so no live recovery lock was seen)","VER-04":"partial: the oracle's trust() names the deployer-installed table and the unchecked aggregator signature, a second hash at a stored certificate index is refused, a root claim at an unknown index is refused, another chain id is refused (tools/reference-apps/oracle/test.mjs on Sepolia); Review B F04: the Sepolia verifiers apply the two-thirds rule only, carry no lock-kind field, and an under-threshold (recovery-rule) certificate fails closed in submitCertificate, so no stored root is a recovery lock (the DEX lane's docs/bridge/light-client-bridge.md paragraph); the claimed-option review of the trust model is the reviewer's","VER-06":"partial: the read service never serves a certificate from another network, a withheld header in the path and a corrupted proof node are detected, stale data prints its lock age beside every balance, and a client told no certificate never falls back to a trusted RPC balance; detection on the fault network F4 is not run","VER-08":"partial: every served state on /light, /receipt and /oracle uses one of included, executed, proven, finalised from the shared definition block, the lock line serves the live DAA before the first certificate, and the trust assumptions are listed on each page; the wallet and explorer surfaces are their lanes' rows; Review B F04: /light, /receipt, the receipt file and the one-file verifier show a node-reported recovery lock as recovery lock, not final, /oracle says recovery locks are not accepted by its verifier, the terms block defines the recovery lock"},"at":"2026-10-08T19:46:20.696Z"}}]},{"code":"OPS","title":"Independent operation and release security","source":[21,24,25,26],"gate":"G5","owner":"Operations + release leads; independent operators","fixtures":"F4 isolated multi-operator network; F0 signed releases; F9 telemetry","summary":"A permissionless specification must remain operational without privileged infrastructure or unsafe automatic updates.","tests":[{"id":"OPS-01","title":"Run the complete no-founder exercise","setup":"Use the P11 independent network, adequate honest participation and enough non-founder capacity for W.","steps":["Remove founder miners, provers, aggregators, RPC, DNS/bootstrap dependencies and private support access.","Run the full P11 period while crossing real and separately labelled accelerated boundaries.","Introduce scheduled faults and have independent operators recover using published instructions."],"accept":"No founder action, secret file, privileged key or emergency anti-chip rule is needed. P07/P08 outcomes hold within assumptions; any intervention is recorded as a failed no-rescue run, not erased.","evidence":"Operator roster/conflict checks; dependency removals; full activity/intervention log.","priority":"BLOCKER","profile":"P07; P08; P11","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[21,24,25,26],"gate":"G5","owner":"Operations + release leads; independent operators","manual_page":54,"owner_lane":"node lane (a283f5f0d364ceef0)","run_status":"NOT RUN","evidence_path":"","run_id":"","updated":"2026-10-08T19:22:31.798Z","evidence_record":{"reason":"the no-founder exercise is an operations run, not a suite","at":"2026-10-08T19:22:31.798Z"}},{"id":"OPS-02","title":"Diversify bootstrap and resist peer isolation","setup":"Start nodes without the default bootstrap host and give others adversarial peer lists.","steps":["Attempt eclipse through peer concentration, stale discovery, poisoned DNS and repeated identities in an isolated lab.","Use independent documented discovery paths and validate returned chain data.","Measure synchronisation, peer diversity and recovery after benign connectivity returns."],"accept":"No unauthenticated history is trusted; bootstrap has no hidden single-provider requirement. Isolation is detected/contained according to F0 and recovery meets P08 when assumptions return.","evidence":"Peer/discovery traces; eclipse scenarios; startup and recovery evidence.","priority":"BLOCKER","profile":"P01; P08; P09","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[21,24,25,26],"gate":"G5","owner":"Operations + release leads; independent operators","manual_page":54,"owner_lane":"build-server lane (a352e49ff4613df86)","run_status":"NOT RUN","evidence_path":"","run_id":"","updated":"2026-10-08T19:22:31.798Z","evidence_record":{"reason":"bootstrap diversity needs the fault network F4","at":"2026-10-08T19:22:31.798Z"}},{"id":"OPS-03","title":"Separate update distribution from consensus authority","setup":"Use test signing keys and clean desktop/node installations with valid, stale and malicious packages.","steps":["Offer signed updates with unexpected consensus rules, downgraded binaries and corrupted payloads.","Test explicit operator acceptance and the published signing-key incident procedure.","Confirm that distribution-key possession cannot independently activate new consensus rules."],"accept":"Tampering/unauthorised rollback is rejected; updates do not silently transfer authority. Approved acceptance and activation are separate. No test touches production signing material.","evidence":"Package corpus; approval/activation traces; compromised-key rehearsal.","priority":"BLOCKER","profile":"P01; P09","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[21,24,25,26],"gate":"G5","owner":"Operations + release leads; independent operators","manual_page":54,"owner_lane":"shipper (ae892a8b0f78fe31c)","run_status":"NOT RUN","evidence_path":"site/release-manifest.json at the landing sha","run_id":"site-manifest-20261008-01","updated":"2026-10-08T19:56:31.001Z","evidence_record":{"cell":"site:manifest","manifest_sha":"3f1a3f332","coverage":{"OPS-03":"partial: the manifest's versions and network blocks regenerate from their sources; the separation itself is the node suites' (suite:exec, suite:p2p-flows)"},"at":"2026-10-08T19:56:31.001Z"}},{"id":"OPS-04","title":"Recover nodes from crash and storage damage","setup":"Use production database/snapshot paths with controlled interrupted writes and corrupted test storage.","steps":["Crash during import, proof acceptance, reward application and snapshot generation.","Restore from independently verified snapshots or re-sync through documented procedures.","Compare roots, certificates, balances and processed-job IDs with an unaffected node."],"accept":"No corrupt snapshot is trusted, no duplicate payout and no loss of authenticated final state. Recovery meets P08 where data is available; ambiguous corruption fails closed and is actionable.","evidence":"Crash schedule; snapshot hashes; root/balance diffs; recovery timing.","priority":"BLOCKER","profile":"P01; P08","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[21,24,25,26],"gate":"G5","owner":"Operations + release leads; independent operators","manual_page":55,"owner_lane":"node lane (a283f5f0d364ceef0)","run_status":"RUNNING","evidence_path":"build-1:/srv/artefacts/tas/201-7cfa422a-aa0e0f45/node-7cfa422a/box4-exec.log","run_id":"201-7cfa422a-aa0e0f45","updated":"2026-10-08T19:32:50.856Z","evidence_record":{"cell":"suite:exec","manifest_sha":"7cfa422a","coverage":{"ZKP-01":"partial: a real proof verifies, a wrong statement and garbage are refused (nativeverify)","ZKP-03":"partial: a snapshot under another digest refused, the epoch streams bound to the digest","OPS-04":"partial: snapshot install, replay and genesis recapture after a crash","EVM-02":"partial: the replay tests on the day stream; the signature and chain-id binding vectors are an EVM harness still to map"},"at":"2026-10-08T19:32:50.856Z"}},{"id":"OPS-05","title":"Isolate untrusted proving workloads","setup":"Run hostile test jobs with secret canaries and restrictive worker permissions.","steps":["Attempt filesystem escape, process spawning, resource exhaustion, network access and key-store reads.","Crash workers and inspect host, wallet and node availability plus dump/log contents.","Retry on every supported isolation backend and check dependency vulnerability handling."],"accept":"No secret leakage or unauthorised host action; P09 resource containment holds. Worker failure does not compromise validator/wallet authority; unsupported isolation is not marketed as safe execution.","evidence":"Sandbox penetration report; canary logs; resource limits; host-integrity checks.","priority":"BLOCKER","profile":"P01; P09","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[21,24,25,26],"gate":"G5","owner":"Operations + release leads; independent operators","manual_page":55,"owner_lane":"build-server lane (a352e49ff4613df86)","run_status":"NOT RUN","evidence_path":"","run_id":"","updated":"2026-10-08T19:22:31.798Z","evidence_record":{"reason":"proving workload isolation is the fleet's pod row","at":"2026-10-08T19:22:31.798Z"}},{"id":"OPS-06","title":"Contain malicious network and API traffic","setup":"Use an authorised isolated load environment with declared resource and request-rate budgets.","steps":["Send malformed headers, proofs, oversized messages, floods and invalid peer sequences.","Measure legitimate traffic, memory/disk growth and validator CPU use.","Test limit resets, peer reconnect and graceful degradation without disabling validation."],"accept":"P09 abuse budgets hold; no unbounded allocation, persistent crash or invalid acceptance. Backpressure is visible and honest users retain the specified service at admitted load.","evidence":"Load/corpus manifests; resource series; valid-traffic metrics; incident traces.","priority":"BLOCKER","profile":"P01; P09","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[21,24,25,26],"gate":"G5","owner":"Operations + release leads; independent operators","manual_page":55,"owner_lane":"build-server lane (a352e49ff4613df86)","run_status":"RUNNING","evidence_path":"build-1:/srv/artefacts/tas/201-7cfa422a-aa0e0f45/node-7cfa422a/box4-p2p-flows.log","run_id":"201-7cfa422a-aa0e0f45","updated":"2026-10-08T19:32:50.856Z","evidence_record":{"cell":"suite:p2p-flows","manifest_sha":"7cfa422a","coverage":{"OPS-06":"partial: malformed relay messages refused; traffic containment under load is an OPS harness","ZKP-06":"partial: proof relay coverage tests; aggregation completeness is the proving lane's test set"},"at":"2026-10-08T19:32:50.856Z"}},{"id":"OPS-07","title":"Detect failures with usable evidence and runbooks","setup":"Define alerts for invalid acceptance, conflicting finality, backlog, data loss, payout mismatch and stale status.","steps":["Inject one instance of each monitored failure in the lab.","Have an unaffiliated operator diagnose it using only emitted evidence and published instructions.","Test redaction, metric freshness and duplicate-alert suppression without suppressing serious failures."],"accept":"P10 alert/detection limits hold; every blocker produces actionable evidence. Monitoring does not leak secrets or mislabel intentional safe pauses as successful finality.","evidence":"Alert matrix; detection timelines; independent runbook exercise.","priority":"GATE","profile":"P09; P10","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[21,24,25,26],"gate":"G5","owner":"Operations + release leads; independent operators","manual_page":56,"owner_lane":"build-server lane (a352e49ff4613df86)","run_status":"NOT RUN","evidence_path":"","run_id":"","updated":"2026-10-08T19:22:31.798Z","evidence_record":{"reason":"runbook detection is an operations run","at":"2026-10-08T19:22:31.798Z"}},{"id":"OPS-08","title":"Repeat independent operation across releases","setup":"Use a clean previous supported version and the final candidate with independent operators.","steps":["Perform documented rolling upgrade, rollback of non-consensus software where allowed and resynchronisation.","Cross activation with mixed versions and unavailable founder distribution hosts.","Re-run affected gates after changes and preserve prior failures and incident lessons."],"accept":"No undocumented privileged migration or automatic consensus rewrite. All affected evidence is refreshed; P11 no-rescue results remain tied to the final release, not an earlier build.","evidence":"Upgrade/replay logs; invalidation map; repeated gate signatures.","priority":"BLOCKER","profile":"P00; P08; P11","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[21,24,25,26],"gate":"G5","owner":"Operations + release leads; independent operators","manual_page":56,"owner_lane":"build-server lane (a352e49ff4613df86)","run_status":"NOT RUN","evidence_path":"","run_id":"","updated":"2026-10-08T19:22:31.798Z","evidence_record":{"reason":"repeat independent operation is a cross-release observation","at":"2026-10-08T19:22:31.798Z"}}],"notes":[{"at":"2026-10-08T19:32:50.976Z","text":"F14 (Review B), the founder's ruling 8 October 19:57 UK: the public miner ships from 2.0.2 without remote jobs; our own fleet runs the lab build with its own signing root"}]},{"code":"UX","title":"Ember, payouts and operator control","source":[14,21,25,26],"gate":"Operator readiness / G5","owner":"Desktop product + pool leads; independent usability study","fixtures":"F2 supported desktops; F8 user study; F4 honest/malicious pools","summary":"Successful participation must be practical for ordinary owners without hidden custody or loss of consensus authority.","tests":[{"id":"UX-01","title":"Onboard ordinary owners on native desktop apps","setup":"Recruit the P10 first-time user cohort across Windows and macOS using supported physical hardware.","steps":["Observe install, hardware detection, safety explanation and first accepted work without staff intervention.","Record download/data preparation separately as well as complete end-to-end time.","Test unsupported hardware and insufficient memory messaging rather than forcing a failed start."],"accept":"P10 completion/time targets hold with no unsafe default or concealed prerequisite. The product is tested as the actual desktop app, not only a browser preview.","evidence":"Consent-based study records; task timings; failure reasons; compatibility outcomes.","priority":"GATE","profile":"P10","cadence":"Release candidate; repeat after relevant changes","method":"Independent observed user study","status":"NOT RUN","source":[14,21,25,26],"gate":"Operator readiness / G5","owner":"Desktop product + pool leads; independent usability study","manual_page":57,"owner_lane":"update-return lane (a22d765a2e0355a9f)","run_status":"NOT RUN","evidence_path":"","run_id":"","updated":"2026-10-08 18:3x UK"},{"id":"UX-02","title":"Make pause, stop and safe tuning reliable","setup":"Run mining/proving on active desktops under contention and safe thermal stress.","steps":["Use pause, stop, power limit, task selection and emergency local shutdown controls.","Crash or restart the UI while workers run and verify ownership of background processes.","Restore the original hardware settings and test power-saving/low-battery behaviour where supported."],"accept":"P10 control latency and safe-state requirements hold. Stopping does not strand an uncontrolled process; tuning never depends on unsafe settings or silent privilege escalation.","evidence":"Control timings; process/settings audit; restart and safety traces.","priority":"BLOCKER","profile":"P01; P10","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[14,21,25,26],"gate":"Operator readiness / G5","owner":"Desktop product + pool leads; independent usability study","manual_page":57,"owner_lane":"shipper (ae892a8b0f78fe31c)","run_status":"RUNNING","evidence_path":"build-1:/srv/artefacts/tas/201-7cfa422a-aa0e0f45/miner-9c844503/box2-app.log","run_id":"201-7cfa422a-aa0e0f45","updated":"2026-10-08T19:32:50.856Z","evidence_record":{"cell":"suite:app","manifest_sha":"7cfa422a","coverage":{"UX-02":"partial: the engine state machine's pause, stop and knob tests; the operator study is UX-01's","UX-03":"partial: the card and earnings rendering tests; the net-earnings model against real bills is COM/ECO evidence","UX-07":"partial: the refused-update and manifest tests; the update-return lane's install classes are its own rows","VER-08":"partial: the app's own state-word tests; the wallet and light client rows are VER-01 to VER-03"},"at":"2026-10-08T19:32:50.856Z"}},{"id":"UX-03","title":"Show net earnings and compatibility honestly","setup":"Use known rewards, fees, energy readings, retries and operator-entered tariffs.","steps":["Compare mining, internal proof and external proof income with authoritative ledgers.","Show gross/net estimates, measurement boundaries, tariff assumptions and payout status.","Test stale data, losses, negative margins and mining-only versus proving-compatible devices."],"accept":"P10 reconciliation limits hold and uncertainty is visible. No guaranteed profits, fabricated fiat price or inferred proving support; provisional earnings are not shown as settled payments.","evidence":"UI/ledger comparisons; tariff fixtures; stale/negative examples.","priority":"BLOCKER","profile":"P01; P10; P12","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[14,21,25,26],"gate":"Operator readiness / G5","owner":"Desktop product + pool leads; independent usability study","manual_page":57,"owner_lane":"shipper (ae892a8b0f78fe31c)","run_status":"RUNNING","evidence_path":"build-1:/srv/artefacts/tas/201-7cfa422a-aa0e0f45/miner-9c844503/box2-app.log","run_id":"201-7cfa422a-aa0e0f45","updated":"2026-10-08T19:32:50.856Z","evidence_record":{"cell":"suite:app","manifest_sha":"7cfa422a","coverage":{"UX-02":"partial: the engine state machine's pause, stop and knob tests; the operator study is UX-01's","UX-03":"partial: the card and earnings rendering tests; the net-earnings model against real bills is COM/ECO evidence","UX-07":"partial: the refused-update and manifest tests; the update-return lane's install classes are its own rows","VER-08":"partial: the app's own state-word tests; the wallet and light client rows are VER-01 to VER-03"},"at":"2026-10-08T19:32:50.856Z"}},{"id":"UX-04","title":"Pay small operators without hidden custody","setup":"Use ordinary single-card balances and the actual pooling/payment path.","steps":["Earn, request/receive payment, disconnect and reconnect; include low balances, fees and a pool outage.","Attempt redirection, delayed accounting and withdrawal of another user's entitlement.","Reconcile displayed balances with canonical entitlement and actual settlement."],"accept":"P10 payout limits hold for the declared small-operator case. No unauthorised custody, redirection or unexplained loss; thresholds and fees are disclosed rather than masked by larger test balances.","evidence":"Single-card payout ledger; pool failure record; custody/authorisation review.","priority":"BLOCKER","profile":"P01; P10","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[14,21,25,26],"gate":"Operator readiness / G5","owner":"Desktop product + pool leads; independent usability study","manual_page":58,"owner_lane":"pool design seat (a3832b1c3b274b310)","run_status":"RUNNING","evidence_path":"build-1:/srv/artefacts/tas/201-7cfa422a-aa0e0f45/node-7cfa422a/box4-miner.log","run_id":"201-7cfa422a-aa0e0f45","updated":"2026-10-08T19:32:50.856Z","evidence_record":{"cell":"suite:miner","manifest_sha":"7cfa422a","coverage":{"UX-06":"partial: the miner's own template selection tests","UX-04":"partial: payout label and share accounting tests; custody is the pool lane's row","POW-01":"partial: the pack re-check seam against the pack's 96 vectors (recheck_pack); the million-vector campaign is harness:p01-vectors"},"at":"2026-10-08T19:32:50.856Z"}},{"id":"UX-05","title":"Keep voting keys with the miner through pooling","setup":"Use an honest pool and a modified pool that replaces worker identity or voting credentials.","steps":["Verify the consensus binding from performed work to the miner's retained key.","Attempt substitution, replay and reassignment without the miner's authorisation.","Leave the pool and verify retained voting/finality rights under F0."],"accept":"No silent transfer of governance/finality authority. If the protocol cannot establish retained keys, this requirement fails; a pool-protocol name or user-interface promise does not pass.","evidence":"Work/key binding vectors; malicious-pool attempts; leave-pool authority check.","priority":"BLOCKER","profile":"P01; P09","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[14,21,25,26],"gate":"Operator readiness / G5","owner":"Desktop product + pool leads; independent usability study","manual_page":58,"owner_lane":"pool design seat (a3832b1c3b274b310)","run_status":"RUNNING","evidence_path":"build-2 suite 30 of 30 ok on 72cc306e8 (the vote-key known-pass and known-fail and the sidechain key check among them); the devnet-4 pair runs pending","run_id":"pool-2.0-20261008-01","updated":"2026-10-08T19:22:31.798Z","evidence_record":{"cell":"suite:pool","manifest_sha":"72cc306e8","coverage":{"UX-05":"partial: the vote-key commitment on the wire (verify::tests::a_share_under_another_key_is_refused_before_the_hash: known-pass the member's key, known-fail another key on the share and a job naming another key, refused with code vote_key before the hash), the open pool's sidechain::check_key (the claimed key, the header's key and the reveal are one key), the same-nonce-other-template wrong_hash test, the TLS binding test; the malicious-pool run and the leave-and-retain run on the devnet-4 pair are the UX-05 batch's other evidence","UX-04":"partial: PPLNS distribution tests (fee first, never overpays, late joiner), the payout key file round trip, the signed transfer decode; the live payout path on the devnet-4 pair is the UX-04 batch's evidence"},"at":"2026-10-08T19:22:31.798Z"}},{"id":"UX-06","title":"Verify actual miner-selected work templates","setup":"Provide a pool interface with declared job-declaration support and independent miner templates.","steps":["Submit miner-selected valid transaction templates and verify what is actually hashed and accepted.","Have a pool substitute or censor templates and test local verification/fallback.","Measure payout and acceptance consequences without moving authority to the pool."],"accept":"The advertised selection control exists in accepted work, not only configuration. Undisclosed substitution is detected; supported independent operation remains practical under P10.","evidence":"Template commitments; accepted-block evidence; malicious-pool/fallback report.","priority":"BLOCKER","profile":"P01; P10","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[14,21,25,26],"gate":"Operator readiness / G5","owner":"Desktop product + pool leads; independent usability study","manual_page":58,"owner_lane":"shipper (ae892a8b0f78fe31c)","run_status":"RUNNING","evidence_path":"build-1:/srv/artefacts/tas/201-7cfa422a-aa0e0f45/node-7cfa422a/box4-miner.log","run_id":"201-7cfa422a-aa0e0f45","updated":"2026-10-08T19:32:50.856Z","evidence_record":{"cell":"suite:miner","manifest_sha":"7cfa422a","coverage":{"UX-06":"partial: the miner's own template selection tests","UX-04":"partial: payout label and share accounting tests; custody is the pool lane's row","POW-01":"partial: the pack re-check seam against the pack's 96 vectors (recheck_pack); the million-vector campaign is harness:p01-vectors"},"at":"2026-10-08T19:32:50.856Z"}},{"id":"UX-07","title":"Expose actionable failures and safe updates","setup":"Create failed proofs, memory pressure, expired jobs, missing payouts and available software updates.","steps":["Ask independent users to identify the issue, stop safely and follow the recommended action.","Test explicit update approval, version visibility and a failed/corrupt update.","Confirm diagnostic exports remove keys and private inputs while retaining useful evidence."],"accept":"P10 task-success requirements hold; no silent update or false success state. Recovery instructions work on supported desktops and secret canaries never enter exported logs.","evidence":"Observed tasks; update traces; sanitised export tests.","priority":"BLOCKER","profile":"P09; P10","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[14,21,25,26],"gate":"Operator readiness / G5","owner":"Desktop product + pool leads; independent usability study","manual_page":59,"owner_lane":"shipper (ae892a8b0f78fe31c)","run_status":"RUNNING","evidence_path":"build-1:/srv/artefacts/tas/201-7cfa422a-aa0e0f45/miner-9c844503/box2-app.log","run_id":"201-7cfa422a-aa0e0f45","updated":"2026-10-08T19:32:50.856Z","evidence_record":{"cell":"suite:app","manifest_sha":"7cfa422a","coverage":{"UX-02":"partial: the engine state machine's pause, stop and knob tests; the operator study is UX-01's","UX-03":"partial: the card and earnings rendering tests; the net-earnings model against real bills is COM/ECO evidence","UX-07":"partial: the refused-update and manifest tests; the update-return lane's install classes are its own rows","VER-08":"partial: the app's own state-word tests; the wallet and light client rows are VER-01 to VER-03"},"at":"2026-10-08T19:32:50.856Z"}},{"id":"UX-08","title":"Publish competitive accessible software","setup":"Provide open documented builds, tuning parameters and known fee conditions for all supported platforms.","steps":["Compare Ember against independently optimised permissible implementations on identical work.","Measure efficiency, fees, false rejection, installation and update transparency.","Scan for hidden developer fees, hardware whitelists, per-address privilege or undisclosed remote controls."],"accept":"P10 relative-efficiency limits hold and all fees/privileges are explicit. No self-reported device tier earns consensus advantage. A superior external implementation triggers investigation, not selective exclusion.","evidence":"Matched software comparison; code/config review; fee/privilege inventory.","priority":"GATE","profile":"P02; P10","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[14,21,25,26],"gate":"Operator readiness / G5","owner":"Desktop product + pool leads; independent usability study","manual_page":59,"owner_lane":"hash lane (a690540514aa453d7)","run_status":"RUNNING","evidence_path":"build-1:/srv/artefacts/tas/200-417c4a57-b2/gate/gate-rule26.log","run_id":"200-417c4a57-b2","updated":"2026-10-08T18:28:32.408Z","evidence_record":{"cell":"gate:pre-push","manifest_sha":"417c4a57","coverage":{"GOV-05":"partial: every gate check carries a self-test that fires on a known failure and passes a known success (77 checks); the suites' own oracles are their mutation rows","GOV-06":"partial: the launch-gates, forbidden-strings and scope checks on the served site","UX-08":"partial: the site gate on every served page, plus docs/build/tuning.md (the published tuning and build-settings half, the hash lane's); the open builds and the fee conditions are the shipper's and the site lane's"},"at":"2026-10-08T18:28:32.408Z"}}],"notes":[{"at":"2026-10-08T19:32:51.045Z","text":"F14 (Review B), the founder's ruling 8 October 19:57 UK: the public miner ships from 2.0.2 without remote jobs; our own fleet runs the lab build with its own signing root"}]},{"code":"COM","title":"Paid demand and sustainable delivery","source":[4,17,18,24,26,27,31,32,33],"gate":"Commercial evidence","owner":"Commercial lead + independent financial/customer reviewer","fixtures":"F8 real consenting customers; F7 full service costs; private identity proofs","summary":"Devnet payouts and subsidised pilots demonstrate mechanics, not independent willingness to pay.","tests":[{"id":"COM-01","title":"Deliver a genuine contracted proof pilot","setup":"Select one real external customer with a meaningful fixed workload and no required migration to Igneum.","steps":["Agree program, inputs, proof format, deadline, price, failure/refund policy and verification method.","Run paid jobs through ordinary independently operated infrastructure.","Have the customer verify usefulness, correctness and its reason for choosing the service."],"accept":"The pilot satisfies its actual contract and settles genuine external payment. Trial subsidies are disclosed and cannot satisfy the repeat-demand gate; no invented customer or testimonial.","evidence":"Redacted contract; verified jobs; settlement proof; consented customer confirmation.","priority":"GATE","profile":"P07; P14","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[4,17,18,24,26,27,31,32,33],"gate":"Commercial evidence","owner":"Commercial lead + independent financial/customer reviewer","manual_page":60,"owner_lane":"main / the founder","run_status":"NOT RUN","evidence_path":"","run_id":"","updated":"2026-10-08T19:22:31.798Z","evidence_record":{"reason":"commercial evidence, no automated harness","at":"2026-10-08T19:22:31.798Z"}},{"id":"COM-02","title":"Establish independent repeat purchasing","setup":"Use the P14 multi-customer observation period and ownership/conflict checks.","steps":["Track paid purchases on distinct occasions, including refunds and stopped customers.","Audit related parties, project reimbursements, token grants and circular funding.","Reconcile external cash received with correctly delivered meaningful work."],"accept":"P14 buyer, duration and volume minima are met without reimbursement or related-party substitution. Repeat orders are separate buying decisions, not a single payment split into many jobs.","evidence":"Anonymised buyer ledger; repeat-order dates; conflict review; net receipts.","priority":"GATE","profile":"P14","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[4,17,18,24,26,27,31,32,33],"gate":"Commercial evidence","owner":"Commercial lead + independent financial/customer reviewer","manual_page":60,"owner_lane":"main / the founder","run_status":"NOT RUN","evidence_path":"","run_id":"","updated":"2026-10-08T19:22:31.798Z","evidence_record":{"reason":"commercial evidence","at":"2026-10-08T19:22:31.798Z"}},{"id":"COM-03","title":"Demonstrate service and operator margins","setup":"Allocate all delivery costs, including aggregation, retries, hardware, power, host, network and support.","steps":["Calculate gross contribution and fully loaded unit costs for each contracted workload.","Reconcile a representative operator's realised earnings against metered costs and opportunity cost.","Repeat under the declared demand and price sensitivities."],"accept":"P14 contribution targets hold and at least the required operator cohort has positive realised contribution. Excluded overhead is visible; token appreciation or unpriced founder labour cannot silently create profitability.","evidence":"Unit-economics ledger; metered operator sample; allocation rules; sensitivity report.","priority":"GATE","profile":"P12; P14","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[4,17,18,24,26,27,31,32,33],"gate":"Commercial evidence","owner":"Commercial lead + independent financial/customer reviewer","manual_page":60,"owner_lane":"main / the founder","run_status":"NOT RUN","evidence_path":"","run_id":"","updated":"2026-10-08T19:22:31.798Z","evidence_record":{"reason":"commercial evidence","at":"2026-10-08T19:22:31.798Z"}},{"id":"COM-04","title":"Meet the customer service guarantee","setup":"Observe actual delivery deadlines, validity, failure handling and support over the contracted period.","steps":["Count all accepted jobs, including failed, retried and abandoned cases.","Have the customer independently verify results and invoke one authorised refund/failure exercise.","Compare offered capacity and quoted price with what was actually delivered."],"accept":"P07 and contracted obligations hold; validity has zero accepted exceptions. Failure terms are honoured, and demand beyond capacity is explicitly refused rather than quietly omitted from metrics.","evidence":"Customer-verifier records; SLO report; refunds; promised-versus-delivered comparison.","priority":"BLOCKER","profile":"P01; P07; P14","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[4,17,18,24,26,27,31,32,33],"gate":"Commercial evidence","owner":"Commercial lead + independent financial/customer reviewer","manual_page":61,"owner_lane":"main / the founder","run_status":"NOT RUN","evidence_path":"","run_id":"","updated":"2026-10-08T19:22:31.798Z","evidence_record":{"reason":"commercial evidence","at":"2026-10-08T19:22:31.798Z"}},{"id":"COM-05","title":"Compare against the buyer's real alternative","setup":"Identify a credible alternative supplier or in-house option for the same workload, proof format and security.","steps":["Obtain comparable quotes or consented measured trials at the evaluation date.","Include integration, verification, deadlines and all operational costs, not only proof-generation time.","Document the customer's actual trade-off without inventing unavailable comparator evidence."],"accept":"P15 commercial comparison is satisfied with like-for-like scope and a evidenced purchase reason. Missing alternative data remains MISSING; it is not scored as an Igneum win.","evidence":"Dated comparison; workload/security match; customer decision record.","priority":"GATE","profile":"P14; P15","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[4,17,18,24,26,27,31,32,33],"gate":"Commercial evidence","owner":"Commercial lead + independent financial/customer reviewer","manual_page":61,"owner_lane":"main / the founder","run_status":"NOT RUN","evidence_path":"","run_id":"","updated":"2026-10-08T19:22:31.798Z","evidence_record":{"reason":"commercial evidence","at":"2026-10-08T19:22:31.798Z"}},{"id":"COM-06","title":"Retain buyers after the pilot and subsidy period","setup":"Follow all recruited customers through the P14 observation period, including churn.","steps":["Remove disclosed trial incentives before measuring repeat demand.","Track renewal, expansion, cancellation reasons, unresolved incidents and buyer concentration.","Review whether one affiliated or subsidised buyer dominates the apparent market."],"accept":"P14 repeat/concentration conditions hold with honest denominator and churn reporting. Paying demand survives beyond a demonstration; unsatisfied or departed buyers are not removed retrospectively.","evidence":"Cohort/renewal ledger; churn notes; concentration and incentive report.","priority":"GATE","profile":"P14","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[4,17,18,24,26,27,31,32,33],"gate":"Commercial evidence","owner":"Commercial lead + independent financial/customer reviewer","manual_page":61,"owner_lane":"main / the founder","run_status":"NOT RUN","evidence_path":"","run_id":"","updated":"2026-10-08T19:22:31.798Z","evidence_record":{"reason":"commercial evidence","at":"2026-10-08T19:22:31.798Z"}},{"id":"COM-07","title":"Fund maintenance without assumed appreciation","setup":"Prepare a costed plan for development, review, infrastructure, support and incident response.","steps":["Separate committed resources from revenue dependent on adoption or token price.","Stress lower income and an unexpected security/operations expense.","Verify responsible owners and continuity arrangements without changing fair-launch promises."],"accept":"P13 committed-runway requirement holds and downside responses are documented. No uncommitted financing, rising token price or burn accounting is presented as available maintenance funding.","evidence":"Budget and commitment evidence; downside plan; owner/continuity roster.","priority":"GATE","profile":"P13","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[4,17,18,24,26,27,31,32,33],"gate":"Commercial evidence","owner":"Commercial lead + independent financial/customer reviewer","manual_page":62,"owner_lane":"main / the founder","run_status":"DEFERRED","evidence_path":"","run_id":"","updated":"2026-10-08 18:3x UK (the founder: forget P13 for now)"},{"id":"COM-08","title":"Let independent developers build useful integrations","setup":"Recruit unaffiliated developers unfamiliar with unpublished implementation details.","steps":["Use public docs to deploy a supported application or integrate an external proof request and verification flow.","Record time, undocumented dependencies, workarounds and correctness issues.","Retest after documentation fixes without founder-written hidden integration code."],"accept":"P14 developer-task minimum passes on the final release; all required public instructions exist. Successful bytecode deployment alone does not count as a working application or service integration.","evidence":"Consented developer logs; public examples; issue closure; verified end-to-end journeys.","priority":"GATE","profile":"P09; P14","cadence":"Release candidate; repeat after relevant changes","method":"Independent integration study","status":"NOT RUN","source":[4,17,18,24,26,27,31,32,33],"gate":"Commercial evidence","owner":"Commercial lead + independent financial/customer reviewer","manual_page":62,"owner_lane":"main / the founder","run_status":"NOT RUN","evidence_path":"","run_id":"","updated":"2026-10-08 18:3x UK"}]},{"code":"LEAD","title":"Comparative leadership evidence","source":[4,22,25,27,31,32,33],"gate":"Leadership-contender decision","owner":"Independent assessment panel + product/economics reviewers","fixtures":"F8 peer/customer studies; full signed technical evidence; 90-day observation","summary":"A serious contention claim requires comparative outcomes and real adoption evidence, not just an internally green test dashboard.","tests":[{"id":"LEAD-01","title":"Register a fair contemporary comparison","setup":"Choose at least the P15 peer coverage and an evaluation date before collecting confirmatory results.","steps":["Include the plan's Ravencoin, Ergo and Firo reference set where comparable, then check for other relevant current options.","Freeze versions, supported hardware, methods, noninferiority margins and commercial alternatives.","Publish exclusions and prohibit cross-algorithm raw-hashrate comparisons."],"accept":"The protocol covers material alternatives fairly and is signed independently. A missing or non-comparable feature is not scored zero; no arbitrary universal rank is inferred from selected metrics.","evidence":"Timestamped peer protocol; source/version records; comparison/exclusion rationale.","priority":"GATE","profile":"P15","cadence":"Release candidate; repeat after relevant changes","method":"Pre-registered comparative study","status":"NOT RUN","source":[4,22,25,27,31,32,33],"gate":"Leadership-contender decision","owner":"Independent assessment panel + product/economics reviewers","manual_page":63,"owner_lane":"main / the founder","run_status":"NOT RUN","evidence_path":"","run_id":"","updated":"2026-10-08 18:3x UK"},{"id":"LEAD-02","title":"Demonstrate comparable operator advantages","setup":"Use matched user tasks and operating conditions on the selected GPU-first networks.","steps":["Measure install-to-first-accepted-work, software overhead versus each network's tuned baseline, payout friction and retained control.","Measure rejection/availability under the same network conditions; report fees separately.","Use blinded analysis where possible and independent runs for decisive differences."],"accept":"P15 noninferiority and superiority requirements hold on meaningful comparable dimensions. No raw hashes from different algorithms are compared, and transient token price is not labelled engineering superiority.","evidence":"Matched task data; uncertainty/effect sizes; independent comparison report.","priority":"GATE","profile":"P02; P10; P15","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[4,22,25,27,31,32,33],"gate":"Leadership-contender decision","owner":"Independent assessment panel + product/economics reviewers","manual_page":63,"owner_lane":"site lane (a846fd66b5403e35a)","run_status":"NOT RUN","evidence_path":"","run_id":"","updated":"2026-10-08T19:22:31.798Z","evidence_record":{"reason":"leadership comparison, an observation window","at":"2026-10-08T19:22:31.798Z"}},{"id":"LEAD-03","title":"Substantiate the specialist-coexistence claim","setup":"Assemble G1-G4 plus frozen rules and all surviving-adversary assumptions.","steps":["Have independent reviewers trace each public competitiveness statement to its narrowest evidence.","Separate measured GPUs, modelled silicon and economic scenarios in all summaries.","Evaluate residual uncertainty, excluded technologies and the no-new-rules counterfactual."],"accept":"All claimed envelopes meet P04/P12 without unsupported universal bounds. Reviewers agree the evidence supports scoped commodity competitiveness even when chips remain compatible; an exact chip-arrival probability is not inferred.","evidence":"Claim-to-evidence map; signed envelope review; limitations statement.","priority":"GATE","profile":"P04; P12; P15","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[4,22,25,27,31,32,33],"gate":"Leadership-contender decision","owner":"Independent assessment panel + product/economics reviewers","manual_page":63,"owner_lane":"main / the founder","run_status":"NOT RUN","evidence_path":"","run_id":"","updated":"2026-10-08T19:22:31.798Z","evidence_record":{"reason":"observation window","at":"2026-10-08T19:22:31.798Z"}},{"id":"LEAD-04","title":"Observe ordinary-operator retention and margins","setup":"Recruit the P16 independent cohort before observing results; use privacy-preserving evidence.","steps":["Follow participation, realised margin, hardware changes, failures and reasons for leaving for 90 days.","Report trial incentives separately and include every initial participant in retention denominators.","Compare behaviour with matched alternatives where feasible; disclose absence of an actual downturn."],"accept":"P16 retention/margin minima hold with verified independence and no removal of churned users. Simulated downturns cannot be called observed bear-market retention; historical claims stay limited to the period measured.","evidence":"Pseudonymous cohort ledger; margin/retention calculations; departure reasons.","priority":"GATE","profile":"P12; P16","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[4,22,25,27,31,32,33],"gate":"Leadership-contender decision","owner":"Independent assessment panel + product/economics reviewers","manual_page":64,"owner_lane":"main / the founder","run_status":"NOT RUN","evidence_path":"","run_id":"","updated":"2026-10-08T19:22:31.798Z","evidence_record":{"reason":"observation window","at":"2026-10-08T19:22:31.798Z"}},{"id":"LEAD-05","title":"Measure control and dependency concentration","setup":"Audit operational control of mining, voting, proving, aggregation, hosting and software distribution separately.","steps":["Use opt-in attestations, observed dependencies and independent corroboration; disclose uncertain common ownership.","Compare concentration and provider-removal outcomes to the approved security and availability assumptions.","Check that pooled payments do not hide authority concentration and hardware vendors are not equated with operators."],"accept":"P11/P16 concentration requirements hold within disclosed uncertainty; unidentified control cannot be counted as independent. No single removable dependency is falsely marketed as decentralised operation.","evidence":"Control/failure-domain map; uncertainty notes; concentration/removal results.","priority":"GATE","profile":"P11; P16","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[4,22,25,27,31,32,33],"gate":"Leadership-contender decision","owner":"Independent assessment panel + product/economics reviewers","manual_page":64,"owner_lane":"main / the founder","run_status":"NOT RUN","evidence_path":"","run_id":"","updated":"2026-10-08T19:22:31.798Z","evidence_record":{"reason":"observation window","at":"2026-10-08T19:22:31.798Z"}},{"id":"LEAD-06","title":"Complete the reliability observation window","setup":"Observe the final candidate and approved compatible updates for the full P16 real-time period.","steps":["Measure promised service availability, invalid acceptance, finality safety, payouts and incident impact.","Reconcile external probes, customer records and operator logs, including maintenance and exclusions.","Repeat affected critical tests after every material change; reset observation where comparability breaks."],"accept":"P16 availability and safety criteria hold on live observation; no hidden downtime or compressed-time substitution. This supports the recorded window only, not multi-year operational maturity.","evidence":"90-day SLO ledger; independent probes; incident reports; change/retest history.","priority":"BLOCKER","profile":"P01; P16","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[4,22,25,27,31,32,33],"gate":"Leadership-contender decision","owner":"Independent assessment panel + product/economics reviewers","manual_page":64,"owner_lane":"main / the founder","run_status":"NOT RUN","evidence_path":"","run_id":"","updated":"2026-10-08T19:22:31.798Z","evidence_record":{"reason":"observation window","at":"2026-10-08T19:22:31.798Z"}},{"id":"LEAD-07","title":"Issue an independent contender assessment","setup":"Provide the full evidence packet, commercial results, comparative study and unresolved-limit register to the panel.","steps":["Check every mandatory and claimed-option test, source requirement and approved threshold.","Require separate signoffs for hardware/economics, security/operations and customer/operator evidence.","Document dissent and challenge any inference that passing an internal checklist proves number-one rank."],"accept":"Every required gate is PASS with no unresolved material challenge, critical/high defect or missing comparator/customer evidence. The panel supports a credible leadership-contender conclusion within scope, not a guaranteed rank.","evidence":"Signed assessment; full status index; dissent/limitations; approved claim wording.","priority":"GATE","profile":"P00; P15; P16","cadence":"Release candidate; repeat after relevant changes","method":"Independent final assessment","status":"NOT RUN","source":[4,22,25,27,31,32,33],"gate":"Leadership-contender decision","owner":"Independent assessment panel + product/economics reviewers","manual_page":65,"owner_lane":"main / the founder","run_status":"NOT RUN","evidence_path":"","run_id":"","updated":"2026-10-08 18:3x UK"},{"id":"LEAD-08","title":"Keep leadership claims valid after release","setup":"Define material-change triggers and scheduled reviews before publishing the assessment.","steps":["Refresh competitor, hardware-cost, demand and security evidence at the P16 cadence.","Test a newly credible specialist, lost customer, major outage and verifier change against invalidation rules.","Withdraw or narrow stale claims promptly while publishing the new evidence status."],"accept":"Claims remain dated, scoped and revisable; material contrary evidence reopens the appropriate gate. The network may remain usable while a leadership claim is suspended. No permanent self-awarded certification.","evidence":"Review calendar; invalidation drills; versioned public claim register.","priority":"GATE","profile":"P00; P16","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[4,22,25,27,31,32,33],"gate":"Leadership-contender decision","owner":"Independent assessment panel + product/economics reviewers","manual_page":65,"owner_lane":"main / the founder","run_status":"NOT RUN","evidence_path":"","run_id":"","updated":"2026-10-08T19:22:31.798Z","evidence_record":{"reason":"observation window","at":"2026-10-08T19:22:31.798Z"}}]},{"code":"REV","title":"REV: the external review's required regressions","source":"docs/analysis/review-2026-10-08-b/findings.json and docs/analysis/review-2026-10-08-b/dispatch.md","gate":"Review findings closed","owner":"the owner lanes per the dispatch table","fixtures":["F0","F5"],"summary":"44 regressions from 14 findings; each reads NOT RUN until its owner lane records a run","tests":[{"id":"REV-F01-1","title":"Valid proof A, warm cache, carried statement B: refuse exactly as a cold node does.","setup":"The regression F01 requires (review finding F01: Proof-verdict cache omits the statement being verified).","steps":["Valid proof A, warm cache, carried statement B: refuse exactly as a cold node does."],"accept":"Valid proof A, warm cache, carried statement B: refuse exactly as a cold node does.","evidence":"The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.","priority":"P0","profile":"P00","cadence":"Every release candidate","method":"Automated + independent review","status":"NOT RUN","source":["F01"],"gate":"Review findings closed","owner":"proving lane, node lane","manual_page":null,"finding":"F01","finding_title":"Proof-verdict cache omits the statement being verified","finding_priority":"P0 - public/value-bearing release blocker","owner_lane":"proving lane, node lane","run_status":"NOT RUN","updated":"2026-10-08T19:32:50.856Z","evidence_record":{"reason":"F01 (P0, the external review): the regression's harness is the owner lane's (proving lane, node lane); not yet named in the map","at":"2026-10-08T19:32:50.856Z"}},{"id":"REV-F01-2","title":"Run valid/invalid contexts in both orders, concurrently and across cache eviction/restart.","setup":"The regression F01 requires (review finding F01: Proof-verdict cache omits the statement being verified).","steps":["Run valid/invalid contexts in both orders, concurrently and across cache eviction/restart."],"accept":"Run valid/invalid contexts in both orders, concurrently and across cache eviction/restart.","evidence":"The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.","priority":"P0","profile":"P00","cadence":"Every release candidate","method":"Automated + independent review","status":"NOT RUN","source":["F01"],"gate":"Review findings closed","owner":"proving lane, node lane","manual_page":null,"finding":"F01","finding_title":"Proof-verdict cache omits the statement being verified","finding_priority":"P0 - public/value-bearing release blocker","owner_lane":"proving lane, node lane","run_status":"NOT RUN","updated":"2026-10-08T19:32:50.856Z","evidence_record":{"reason":"F01 (P0, the external review): the regression's harness is the owner lane's (proving lane, node lane); not yet named in the map","at":"2026-10-08T19:32:50.856Z"}},{"id":"REV-F01-3","title":"Change payout, network, kind, program ID and activation context; no accepted misbinding.","setup":"The regression F01 requires (review finding F01: Proof-verdict cache omits the statement being verified).","steps":["Change payout, network, kind, program ID and activation context; no accepted misbinding."],"accept":"Change payout, network, kind, program ID and activation context; no accepted misbinding.","evidence":"The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.","priority":"P0","profile":"P00","cadence":"Every release candidate","method":"Automated + independent review","status":"NOT RUN","source":["F01"],"gate":"Review findings closed","owner":"proving lane, node lane","manual_page":null,"finding":"F01","finding_title":"Proof-verdict cache omits the statement being verified","finding_priority":"P0 - public/value-bearing release blocker","owner_lane":"proving lane, node lane","run_status":"NOT RUN","updated":"2026-10-08T19:32:50.856Z","evidence_record":{"reason":"F01 (P0, the external review): the regression's harness is the owner lane's (proving lane, node lane); not yet named in the map","at":"2026-10-08T19:32:50.856Z"}},{"id":"REV-F01-4","title":"A native two-node test must agree on block validity and payouts despite different cache histories.","setup":"The regression F01 requires (review finding F01: Proof-verdict cache omits the statement being verified).","steps":["A native two-node test must agree on block validity and payouts despite different cache histories."],"accept":"A native two-node test must agree on block validity and payouts despite different cache histories.","evidence":"The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.","priority":"P0","profile":"P00","cadence":"Every release candidate","method":"Automated + independent review","status":"NOT RUN","source":["F01"],"gate":"Review findings closed","owner":"proving lane, node lane","manual_page":null,"finding":"F01","finding_title":"Proof-verdict cache omits the statement being verified","finding_priority":"P0 - public/value-bearing release blocker","owner_lane":"proving lane, node lane","run_status":"NOT RUN","updated":"2026-10-08T19:32:50.856Z","evidence_record":{"reason":"F01 (P0, the external review): the regression's harness is the owner lane's (proving lane, node lane); not yet named in the map","at":"2026-10-08T19:32:50.856Z"}},{"id":"REV-F02-1","title":"Release build cannot activate test bypass.","setup":"The regression F02 requires (review finding F02: Proof-rule infrastructure can fail open).","steps":["Release build cannot activate test bypass."],"accept":"Release build cannot activate test bypass.","evidence":"The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.","priority":"P0","profile":"P00","cadence":"Every release candidate","method":"Automated + independent review","status":"NOT RUN","source":["F02"],"gate":"Review findings closed","owner":"proving lane, CI steward","manual_page":null,"finding":"F02","finding_title":"Proof-rule infrastructure can fail open","finding_priority":"P0 - release configuration blocker","owner_lane":"proving lane, CI steward","run_status":"NOT RUN","updated":"2026-10-08T19:32:50.856Z","evidence_record":{"reason":"F02 (P0, the external review): the regression's harness is the owner lane's (proving lane, CI steward); not yet named in the map","at":"2026-10-08T19:32:50.856Z"}},{"id":"REV-F02-2","title":"Missing oracle or pinned keys prevents service readiness after enforcement activation.","setup":"The regression F02 requires (review finding F02: Proof-rule infrastructure can fail open).","steps":["Missing oracle or pinned keys prevents service readiness after enforcement activation."],"accept":"Missing oracle or pinned keys prevents service readiness after enforcement activation.","evidence":"The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.","priority":"P0","profile":"P00","cadence":"Every release candidate","method":"Automated + independent review","status":"NOT RUN","source":["F02"],"gate":"Review findings closed","owner":"proving lane, CI steward","manual_page":null,"finding":"F02","finding_title":"Proof-rule infrastructure can fail open","finding_priority":"P0 - release configuration blocker","owner_lane":"proving lane, CI steward","run_status":"NOT RUN","updated":"2026-10-08T19:32:50.856Z","evidence_record":{"reason":"F02 (P0, the external review): the regression's harness is the owner lane's (proving lane, CI steward); not yet named in the map","at":"2026-10-08T19:32:50.856Z"}},{"id":"REV-F02-3","title":"Missing proof bytes retry without incorrectly marking a valid block permanently invalid.","setup":"The regression F02 requires (review finding F02: Proof-rule infrastructure can fail open).","steps":["Missing proof bytes retry without incorrectly marking a valid block permanently invalid."],"accept":"Missing proof bytes retry without incorrectly marking a valid block permanently invalid.","evidence":"The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.","priority":"P0","profile":"P00","cadence":"Every release candidate","method":"Automated + independent review","status":"NOT RUN","source":["F02"],"gate":"Review findings closed","owner":"proving lane, CI steward","manual_page":null,"finding":"F02","finding_title":"Proof-rule infrastructure can fail open","finding_priority":"P0 - release configuration blocker","owner_lane":"proving lane, CI steward","run_status":"NOT RUN","updated":"2026-10-08T19:32:50.856Z","evidence_record":{"reason":"F02 (P0, the external review): the regression's harness is the owner lane's (proving lane, CI steward); not yet named in the map","at":"2026-10-08T19:32:50.856Z"}},{"id":"REV-F03-1","title":"Clean build from one manifest, including the pool and workers, with no unpublished vendor tree.","setup":"The regression F03 requires (review finding F03: The bundle contains a v6 candidate, not a demonstrated integrated v6 release).","steps":["Clean build from one manifest, including the pool and workers, with no unpublished vendor tree."],"accept":"Clean build from one manifest, including the pool and workers, with no unpublished vendor tree.","evidence":"The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.","priority":"P0","profile":"P00","cadence":"Every release candidate","method":"Automated + independent review","status":"NOT RUN","source":["F03"],"gate":"Review findings closed","owner":"CI steward, hash lane (ProgramClass::V6 on freeze), pool lane","manual_page":null,"finding":"F03","finding_title":"The bundle contains a v6 candidate, not a demonstrated integrated v6 release","finding_priority":"P0 - freeze/integration blocker","owner_lane":"CI steward, hash lane (ProgramClass::V6 on freeze), pool lane","run_status":"NOT RUN","updated":"2026-10-08T19:32:50.856Z","evidence_record":{"reason":"F03 (P0, the external review): the regression's harness is the owner lane's (CI steward, hash lane (ProgramClass::V6 on freeze), pool lane); not yet named in the map","at":"2026-10-08T19:32:50.856Z"}},{"id":"REV-F03-2","title":"Same job context produces identical accepted work in node, CPU reference, CUDA, Metal, OpenCL and pool.","setup":"The regression F03 requires (review finding F03: The bundle contains a v6 candidate, not a demonstrated integrated v6 release).","steps":["Same job context produces identical accepted work in node, CPU reference, CUDA, Metal, OpenCL and pool."],"accept":"Same job context produces identical accepted work in node, CPU reference, CUDA, Metal, OpenCL and pool.","evidence":"The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.","priority":"P0","profile":"P00","cadence":"Every release candidate","method":"Automated + independent review","status":"NOT RUN","source":["F03"],"gate":"Review findings closed","owner":"CI steward, hash lane (ProgramClass::V6 on freeze), pool lane","manual_page":null,"finding":"F03","finding_title":"The bundle contains a v6 candidate, not a demonstrated integrated v6 release","finding_priority":"P0 - freeze/integration blocker","owner_lane":"CI steward, hash lane (ProgramClass::V6 on freeze), pool lane","run_status":"NOT RUN","updated":"2026-10-08T19:32:50.856Z","evidence_record":{"reason":"F03 (P0, the external review): the regression's harness is the owner lane's (CI steward, hash lane (ProgramClass::V6 on freeze), pool lane); not yet named in the map","at":"2026-10-08T19:32:50.856Z"}},{"id":"REV-F03-3","title":"Cross every scheduled transition with old/new client behavior documented and identical rule identities.","setup":"The regression F03 requires (review finding F03: The bundle contains a v6 candidate, not a demonstrated integrated v6 release).","steps":["Cross every scheduled transition with old/new client behavior documented and identical rule identities."],"accept":"Cross every scheduled transition with old/new client behavior documented and identical rule identities.","evidence":"The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.","priority":"P0","profile":"P00","cadence":"Every release candidate","method":"Automated + independent review","status":"NOT RUN","source":["F03"],"gate":"Review findings closed","owner":"CI steward, hash lane (ProgramClass::V6 on freeze), pool lane","manual_page":null,"finding":"F03","finding_title":"The bundle contains a v6 candidate, not a demonstrated integrated v6 release","finding_priority":"P0 - freeze/integration blocker","owner_lane":"CI steward, hash lane (ProgramClass::V6 on freeze), pool lane","run_status":"NOT RUN","updated":"2026-10-08T19:32:50.856Z","evidence_record":{"reason":"F03 (P0, the external review): the regression's harness is the owner lane's (CI steward, hash lane (ProgramClass::V6 on freeze), pool lane); not yet named in the map","at":"2026-10-08T19:32:50.856Z"}},{"id":"REV-F04-1","title":"Native multi-node 40/40/20 partition, equivocation and dust-valid mining on both sides past the window.","setup":"The regression F04 requires (review finding F04: Finality v4 recovery deliberately has a weaker safety boundary).","steps":["Native multi-node 40/40/20 partition, equivocation and dust-valid mining on both sides past the window."],"accept":"Native multi-node 40/40/20 partition, equivocation and dust-valid mining on both sides past the window.","evidence":"The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.","priority":"P0","profile":"P00","cadence":"Every release candidate","method":"Automated + independent review","status":"NOT RUN","source":["F04"],"gate":"Review findings closed","owner":"node lane, reference apps, site (explorer)","manual_page":null,"finding":"F04","finding_title":"Finality v4 recovery deliberately has a weaker safety boundary","finding_priority":"P0 - finality guarantee decision","owner_lane":"node lane, reference apps, site (explorer)","run_status":"NOT RUN","updated":"2026-10-08T19:32:50.856Z","evidence_record":{"reason":"F04 (P0, the external review): the regression's harness is the owner lane's (node lane, reference apps, site (explorer)); not yet named in the map","at":"2026-10-08T19:32:50.856Z"}},{"id":"REV-F04-2","title":"Proof that the chosen recovery guarantee matches the public finality claim; two valid contradictory certificates are a hard failure for strong finality.","setup":"The regression F04 requires (review finding F04: Finality v4 recovery deliberately has a weaker safety boundary).","steps":["Proof that the chosen recovery guarantee matches the public finality claim; two valid contradictory certificates are a hard failure for strong finality."],"accept":"Proof that the chosen recovery guarantee matches the public finality claim; two valid contradictory certificates are a hard failure for strong finality.","evidence":"The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.","priority":"P0","profile":"P00","cadence":"Every release candidate","method":"Automated + independent review","status":"NOT RUN","source":["F04"],"gate":"Review findings closed","owner":"node lane, reference apps, site (explorer)","manual_page":null,"finding":"F04","finding_title":"Finality v4 recovery deliberately has a weaker safety boundary","finding_priority":"P0 - finality guarantee decision","owner_lane":"node lane, reference apps, site (explorer)","run_status":"NOT RUN","updated":"2026-10-08T19:32:50.856Z","evidence_record":{"reason":"F04 (P0, the external review): the regression's harness is the owner lane's (node lane, reference apps, site (explorer)); not yet named in the map","at":"2026-10-08T19:32:50.856Z"}},{"id":"REV-F04-3","title":"Pause-only resume with historical backfill, missing historical data and all old keys returning.","setup":"The regression F04 requires (review finding F04: Finality v4 recovery deliberately has a weaker safety boundary).","steps":["Pause-only resume with historical backfill, missing historical data and all old keys returning."],"accept":"Pause-only resume with historical backfill, missing historical data and all old keys returning.","evidence":"The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.","priority":"P0","profile":"P00","cadence":"Every release candidate","method":"Automated + independent review","status":"NOT RUN","source":["F04"],"gate":"Review findings closed","owner":"node lane, reference apps, site (explorer)","manual_page":null,"finding":"F04","finding_title":"Finality v4 recovery deliberately has a weaker safety boundary","finding_priority":"P0 - finality guarantee decision","owner_lane":"node lane, reference apps, site (explorer)","run_status":"NOT RUN","updated":"2026-10-08T19:32:50.856Z","evidence_record":{"reason":"F04 (P0, the external review): the regression's harness is the owner lane's (node lane, reference apps, site (explorer)); not yet named in the map","at":"2026-10-08T19:32:50.856Z"}},{"id":"REV-F04-4","title":"Wallet, receipt and oracle consumers distinguish any weaker recovery state.","setup":"The regression F04 requires (review finding F04: Finality v4 recovery deliberately has a weaker safety boundary).","steps":["Wallet, receipt and oracle consumers distinguish any weaker recovery state."],"accept":"Wallet, receipt and oracle consumers distinguish any weaker recovery state.","evidence":"The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.","priority":"P0","profile":"P00","cadence":"Every release candidate","method":"Automated + independent review","status":"NOT RUN","source":["F04"],"gate":"Review findings closed","owner":"node lane, reference apps, site (explorer)","manual_page":null,"finding":"F04","finding_title":"Finality v4 recovery deliberately has a weaker safety boundary","finding_priority":"P0 - finality guarantee decision","owner_lane":"node lane, reference apps, site (explorer)","run_status":"NOT RUN","updated":"2026-10-08T19:32:50.856Z","evidence_record":{"reason":"F04 (P0, the external review): the regression's harness is the owner lane's (node lane, reference apps, site (explorer)); not yet named in the map","at":"2026-10-08T19:32:50.856Z"}},{"id":"REV-F05-1","title":"Native reference-vs-incremental expression equivalence across all source registers and real instruction updates.","setup":"The regression F05 requires (review finding F05: reg64 address coupling has an exact incremental alternative).","steps":["Native reference-vs-incremental expression equivalence across all source registers and real instruction updates."],"accept":"Native reference-vs-incremental expression equivalence across all source registers and real instruction updates.","evidence":"The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.","priority":"P1","profile":"P00","cadence":"Every release candidate","method":"Automated + independent review","status":"NOT RUN","source":["F05"],"gate":"Review findings closed","owner":"hash lane, adversary lane, floor lane 3","manual_page":null,"finding":"F05","finding_title":"reg64 address coupling has an exact incremental alternative","finding_priority":"P1 - adversarial hardware evaluation","owner_lane":"hash lane, adversary lane, floor lane 3","run_status":"NOT RUN","updated":"2026-10-08T19:32:50.856Z","evidence_record":{"reason":"F05 (P1, the external review): the regression's harness is the owner lane's (hash lane, adversary lane, floor lane 3); not yet named in the map","at":"2026-10-08T19:32:50.856Z"}},{"id":"REV-F05-2","title":"Full-kernel output equivalence, registers, spills, wall power and accepted throughput across target GPUs.","setup":"The regression F05 requires (review finding F05: reg64 address coupling has an exact incremental alternative).","steps":["Full-kernel output equivalence, registers, spills, wall power and accepted throughput across target GPUs."],"accept":"Full-kernel output equivalence, registers, spills, wall power and accepted throughput across target GPUs.","evidence":"The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.","priority":"P1","profile":"P00","cadence":"Every release candidate","method":"Automated + independent review","status":"NOT RUN","source":["F05"],"gate":"Review findings closed","owner":"hash lane, adversary lane, floor lane 3","manual_page":null,"finding":"F05","finding_title":"reg64 address coupling has an exact incremental alternative","finding_priority":"P1 - adversarial hardware evaluation","owner_lane":"hash lane, adversary lane, floor lane 3","run_status":"NOT RUN","updated":"2026-10-08T19:32:50.856Z","evidence_record":{"reason":"F05 (P1, the external review): the regression's harness is the owner lane's (hash lane, adversary lane, floor lane 3); not yet named in the map","at":"2026-10-08T19:32:50.856Z"}},{"id":"REV-F05-3","title":"Adversary physical design includes prefix caching/recomputation cost; no assumed full 63-read cost on every load.","setup":"The regression F05 requires (review finding F05: reg64 address coupling has an exact incremental alternative).","steps":["Adversary physical design includes prefix caching/recomputation cost; no assumed full 63-read cost on every load."],"accept":"Adversary physical design includes prefix caching/recomputation cost; no assumed full 63-read cost on every load.","evidence":"The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.","priority":"P1","profile":"P00","cadence":"Every release candidate","method":"Automated + independent review","status":"NOT RUN","source":["F05"],"gate":"Review findings closed","owner":"hash lane, adversary lane, floor lane 3","manual_page":null,"finding":"F05","finding_title":"reg64 address coupling has an exact incremental alternative","finding_priority":"P1 - adversarial hardware evaluation","owner_lane":"hash lane, adversary lane, floor lane 3","run_status":"NOT RUN","updated":"2026-10-08T19:32:50.856Z","evidence_record":{"reason":"F05 (P1, the external review): the regression's harness is the owner lane's (hash lane, adversary lane, floor lane 3); not yet named in the map","at":"2026-10-08T19:32:50.856Z"}},{"id":"REV-F06-1","title":"Acceptance/reference/emitter evaluate the same activated schedule.","setup":"The regression F06 requires (review finding F06: The v6 acceptance and census gates are not complete for the final execution).","steps":["Acceptance/reference/emitter evaluate the same activated schedule."],"accept":"Acceptance/reference/emitter evaluate the same activated schedule.","evidence":"The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.","priority":"P1","profile":"P00","cadence":"Every release candidate","method":"Automated + independent review","status":"NOT RUN","source":["F06"],"gate":"Review findings closed","owner":"hash lane, research lane D","manual_page":null,"finding":"F06","finding_title":"The v6 acceptance and census gates are not complete for the final execution","finding_priority":"P1 - freeze blocker","owner_lane":"hash lane, research lane D","run_status":"NOT RUN","updated":"2026-10-08T19:32:50.856Z","evidence_record":{"reason":"F06 (P1, the external review): the regression's harness is the owner lane's (hash lane, research lane D); not yet named in the map","at":"2026-10-08T19:32:50.856Z"}},{"id":"REV-F06-2","title":"Full live-dataset census on unseen seeds and the complete v6 pack.","setup":"The regression F06 requires (review finding F06: The v6 acceptance and census gates are not complete for the final execution).","steps":["Full live-dataset census on unseen seeds and the complete v6 pack."],"accept":"Full live-dataset census on unseen seeds and the complete v6 pack.","evidence":"The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.","priority":"P1","profile":"P00","cadence":"Every release candidate","method":"Automated + independent review","status":"NOT RUN","source":["F06"],"gate":"Review findings closed","owner":"hash lane, research lane D","manual_page":null,"finding":"F06","finding_title":"The v6 acceptance and census gates are not complete for the final execution","finding_priority":"P1 - freeze blocker","owner_lane":"hash lane, research lane D","run_status":"NOT RUN","updated":"2026-10-08T19:32:50.856Z","evidence_record":{"reason":"F06 (P1, the external review): the regression's harness is the owner lane's (hash lane, research lane D); not yet named in the map","at":"2026-10-08T19:32:50.856Z"}},{"id":"REV-F06-3","title":"A failed experimental rule does not silently exhaust generation or bypass the intended resource requirement.","setup":"The regression F06 requires (review finding F06: The v6 acceptance and census gates are not complete for the final execution).","steps":["A failed experimental rule does not silently exhaust generation or bypass the intended resource requirement."],"accept":"A failed experimental rule does not silently exhaust generation or bypass the intended resource requirement.","evidence":"The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.","priority":"P1","profile":"P00","cadence":"Every release candidate","method":"Automated + independent review","status":"NOT RUN","source":["F06"],"gate":"Review findings closed","owner":"hash lane, research lane D","manual_page":null,"finding":"F06","finding_title":"The v6 acceptance and census gates are not complete for the final execution","finding_priority":"P1 - freeze blocker","owner_lane":"hash lane, research lane D","run_status":"NOT RUN","updated":"2026-10-08T19:32:50.856Z","evidence_record":{"reason":"F06 (P1, the external review): the regression's harness is the owner lane's (hash lane, research lane D); not yet named in the map","at":"2026-10-08T19:32:50.856Z"}},{"id":"REV-F07-1","title":"Same final v6 configuration: mine -> evict -> prove -> aggregate -> submit -> rebuild -> resume; no leaked reservations.","setup":"The regression F07 requires (review finding F07: VRAM admission and proving deadlines need one operator-level scheduler).","steps":["Same final v6 configuration: mine -> evict -> prove -> aggregate -> submit -> rebuild -> resume; no leaked reservations."],"accept":"Same final v6 configuration: mine -> evict -> prove -> aggregate -> submit -> rebuild -> resume; no leaked reservations.","evidence":"The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.","priority":"P1","profile":"P00","cadence":"Every release candidate","method":"Automated + independent review","status":"NOT RUN","source":["F07"],"gate":"Review findings closed","owner":"app lane, fleet lane","manual_page":null,"finding":"F07","finding_title":"VRAM admission and proving deadlines need one operator-level scheduler","finding_priority":"P1 - miner economics and reliability","owner_lane":"app lane, fleet lane","run_status":"NOT RUN","updated":"2026-10-08T19:32:50.856Z","evidence_record":{"reason":"F07 (P1, the external review): the regression's harness is the owner lane's (app lane, fleet lane); not yet named in the map","at":"2026-10-08T19:32:50.856Z"}},{"id":"REV-F07-2","title":"OOM, process crash and stale work recover without losing wallet state or silently consuming power.","setup":"The regression F07 requires (review finding F07: VRAM admission and proving deadlines need one operator-level scheduler).","steps":["OOM, process crash and stale work recover without losing wallet state or silently consuming power."],"accept":"OOM, process crash and stale work recover without losing wallet state or silently consuming power.","evidence":"The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.","priority":"P1","profile":"P00","cadence":"Every release candidate","method":"Automated + independent review","status":"NOT RUN","source":["F07"],"gate":"Review findings closed","owner":"app lane, fleet lane","manual_page":null,"finding":"F07","finding_title":"VRAM admission and proving deadlines need one operator-level scheduler","finding_priority":"P1 - miner economics and reliability","owner_lane":"app lane, fleet lane","run_status":"NOT RUN","updated":"2026-10-08T19:32:50.856Z","evidence_record":{"reason":"F07 (P1, the external review): the regression's harness is the owner lane's (app lane, fleet lane); not yet named in the map","at":"2026-10-08T19:32:50.856Z"}},{"id":"REV-F07-3","title":"16 GB+ simultaneous mode only after measured peak plus next-epoch headroom; smaller-card modes labelled separately.","setup":"The regression F07 requires (review finding F07: VRAM admission and proving deadlines need one operator-level scheduler).","steps":["16 GB+ simultaneous mode only after measured peak plus next-epoch headroom; smaller-card modes labelled separately."],"accept":"16 GB+ simultaneous mode only after measured peak plus next-epoch headroom; smaller-card modes labelled separately.","evidence":"The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.","priority":"P1","profile":"P00","cadence":"Every release candidate","method":"Automated + independent review","status":"NOT RUN","source":["F07"],"gate":"Review findings closed","owner":"app lane, fleet lane","manual_page":null,"finding":"F07","finding_title":"VRAM admission and proving deadlines need one operator-level scheduler","finding_priority":"P1 - miner economics and reliability","owner_lane":"app lane, fleet lane","run_status":"NOT RUN","updated":"2026-10-08T19:32:50.856Z","evidence_record":{"reason":"F07 (P1, the external review): the regression's harness is the owner lane's (app lane, fleet lane); not yet named in the map","at":"2026-10-08T19:32:50.856Z"}},{"id":"REV-F08-1","title":"Report every eligible job outcome, including expired work; a bounded list cannot hide losses.","setup":"The regression F08 requires (review finding F08: The proving pipeline reports waste and deadline censoring, not sustained capacity).","steps":["Report every eligible job outcome, including expired work; a bounded list cannot hide losses."],"accept":"Report every eligible job outcome, including expired work; a bounded list cannot hide losses.","evidence":"The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.","priority":"P1","profile":"P00","cadence":"Every release candidate","method":"Automated + independent review","status":"NOT RUN","source":["F08"],"gate":"Review findings closed","owner":"proving lane, fleet lane, site (ops page)","manual_page":null,"finding":"F08","finding_title":"The proving pipeline reports waste and deadline censoring, not sustained capacity","finding_priority":"P1 - proving product gate","owner_lane":"proving lane, fleet lane, site (ops page)","run_status":"NOT RUN","updated":"2026-10-08T19:32:50.856Z","evidence_record":{"reason":"F08 (P1, the external review): the regression's harness is the owner lane's (proving lane, fleet lane, site (ops page)); not yet named in the map","at":"2026-10-08T19:32:50.856Z"}},{"id":"REV-F08-2","title":"Consumer tiers complete and receive payment for declared jobs before claims about income.","setup":"The regression F08 requires (review finding F08: The proving pipeline reports waste and deadline censoring, not sustained capacity).","steps":["Consumer tiers complete and receive payment for declared jobs before claims about income."],"accept":"Consumer tiers complete and receive payment for declared jobs before claims about income.","evidence":"The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.","priority":"P1","profile":"P00","cadence":"Every release candidate","method":"Automated + independent review","status":"NOT RUN","source":["F08"],"gate":"Review findings closed","owner":"proving lane, fleet lane, site (ops page)","manual_page":null,"finding":"F08","finding_title":"The proving pipeline reports waste and deadline censoring, not sustained capacity","finding_priority":"P1 - proving product gate","owner_lane":"proving lane, fleet lane, site (ops page)","run_status":"NOT RUN","updated":"2026-10-08T19:32:50.856Z","evidence_record":{"reason":"F08 (P1, the external review): the regression's harness is the owner lane's (proving lane, fleet lane, site (ops page)); not yet named in the map","at":"2026-10-08T19:32:50.856Z"}},{"id":"REV-F08-3","title":"Sustained real workload across class transitions, with restart/retry and no publisher intervention.","setup":"The regression F08 requires (review finding F08: The proving pipeline reports waste and deadline censoring, not sustained capacity).","steps":["Sustained real workload across class transitions, with restart/retry and no publisher intervention."],"accept":"Sustained real workload across class transitions, with restart/retry and no publisher intervention.","evidence":"The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.","priority":"P1","profile":"P00","cadence":"Every release candidate","method":"Automated + independent review","status":"NOT RUN","source":["F08"],"gate":"Review findings closed","owner":"proving lane, fleet lane, site (ops page)","manual_page":null,"finding":"F08","finding_title":"The proving pipeline reports waste and deadline censoring, not sustained capacity","finding_priority":"P1 - proving product gate","owner_lane":"proving lane, fleet lane, site (ops page)","run_status":"NOT RUN","updated":"2026-10-08T19:32:50.856Z","evidence_record":{"reason":"F08 (P1, the external review): the regression's harness is the owner lane's (proving lane, fleet lane, site (ops page)); not yet named in the map","at":"2026-10-08T19:32:50.856Z"}},{"id":"REV-F09-1","title":"Generate all pass/fail cells directly from the declared inequalities and inputs.","setup":"The regression F09 requires (review finding F09: The economic model explicitly retains a failed specialist case).","steps":["Generate all pass/fail cells directly from the declared inequalities and inputs."],"accept":"Generate all pass/fail cells directly from the declared inequalities and inputs.","evidence":"The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.","priority":"P1","profile":"P00","cadence":"Every release candidate","method":"Automated + independent review","status":"NOT RUN","source":["F09"],"gate":"Review findings closed","owner":"research lane, floor lane 3, coordinator","manual_page":null,"finding":"F09","finding_title":"The economic model explicitly retains a failed specialist case","finding_priority":"P1 - founding claim not yet earned","owner_lane":"research lane, floor lane 3, coordinator","run_status":"NOT RUN","updated":"2026-10-08T19:32:50.856Z","evidence_record":{"reason":"F09 (P1, the external review): the regression's harness is the owner lane's (research lane, floor lane 3, coordinator); not yet named in the map","at":"2026-10-08T19:32:50.856Z"}},{"id":"REV-F09-2","title":"Independent feasibility and cost evaluation of the strongest modeled SRAM/hybrid opponent.","setup":"The regression F09 requires (review finding F09: The economic model explicitly retains a failed specialist case).","steps":["Independent feasibility and cost evaluation of the strongest modeled SRAM/hybrid opponent."],"accept":"Independent feasibility and cost evaluation of the strongest modeled SRAM/hybrid opponent.","evidence":"The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.","priority":"P1","profile":"P00","cadence":"Every release candidate","method":"Automated + independent review","status":"NOT RUN","source":["F09"],"gate":"Review findings closed","owner":"research lane, floor lane 3, coordinator","manual_page":null,"finding":"F09","finding_title":"The economic model explicitly retains a failed specialist case","finding_priority":"P1 - founding claim not yet earned","owner_lane":"research lane, floor lane 3, coordinator","run_status":"NOT RUN","updated":"2026-10-08T19:32:50.856Z","evidence_record":{"reason":"F09 (P1, the external review): the regression's harness is the owner lane's (research lane, floor lane 3, coordinator); not yet named in the map","at":"2026-10-08T19:32:50.856Z"}},{"id":"REV-F09-3","title":"GPU owners and entrants remain viable under the approved scenario envelope without assuming chip absence or death.","setup":"The regression F09 requires (review finding F09: The economic model explicitly retains a failed specialist case).","steps":["GPU owners and entrants remain viable under the approved scenario envelope without assuming chip absence or death."],"accept":"GPU owners and entrants remain viable under the approved scenario envelope without assuming chip absence or death.","evidence":"The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.","priority":"P1","profile":"P00","cadence":"Every release candidate","method":"Automated + independent review","status":"NOT RUN","source":["F09"],"gate":"Review findings closed","owner":"research lane, floor lane 3, coordinator","manual_page":null,"finding":"F09","finding_title":"The economic model explicitly retains a failed specialist case","finding_priority":"P1 - founding claim not yet earned","owner_lane":"research lane, floor lane 3, coordinator","run_status":"NOT RUN","updated":"2026-10-08T19:32:50.856Z","evidence_record":{"reason":"F09 (P1, the external review): the regression's harness is the owner lane's (research lane, floor lane 3, coordinator); not yet named in the map","at":"2026-10-08T19:32:50.856Z"}},{"id":"REV-F10-1","title":"Compare exact found nonce/hash sets with full-read mode, including all-hit overflow and zero-hit cases.","setup":"The regression F10 requires (review finding F10: CUDA production readback has an existing OpenCL optimization to borrow).","steps":["Compare exact found nonce/hash sets with full-read mode, including all-hit overflow and zero-hit cases."],"accept":"Compare exact found nonce/hash sets with full-read mode, including all-hit overflow and zero-hit cases.","evidence":"The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.","priority":"P2","profile":"P00","cadence":"Every release candidate","method":"Automated + independent review","status":"NOT RUN","source":["F10"],"gate":"Review findings closed","owner":"worker lane (new)","manual_page":null,"finding":"F10","finding_title":"CUDA production readback has an existing OpenCL optimization to borrow","finding_priority":"P2 - byte-preserving performance experiment","owner_lane":"worker lane (new)","run_status":"NOT RUN","updated":"2026-10-08T19:32:50.856Z","evidence_record":{"reason":"F10 (P2, the external review): the regression's harness is the owner lane's (worker lane (new)); not yet named in the map","at":"2026-10-08T19:32:50.856Z"}},{"id":"REV-F10-2","title":"Test stale jobs, high-32 rollover, tail batches and asynchronous buffer reuse.","setup":"The regression F10 requires (review finding F10: CUDA production readback has an existing OpenCL optimization to borrow).","steps":["Test stale jobs, high-32 rollover, tail batches and asynchronous buffer reuse."],"accept":"Test stale jobs, high-32 rollover, tail batches and asynchronous buffer reuse.","evidence":"The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.","priority":"P2","profile":"P00","cadence":"Every release candidate","method":"Automated + independent review","status":"NOT RUN","source":["F10"],"gate":"Review findings closed","owner":"worker lane (new)","manual_page":null,"finding":"F10","finding_title":"CUDA production readback has an existing OpenCL optimization to borrow","finding_priority":"P2 - byte-preserving performance experiment","owner_lane":"worker lane (new)","run_status":"NOT RUN","updated":"2026-10-08T19:32:50.856Z","evidence_record":{"reason":"F10 (P2, the external review): the regression's harness is the owner lane's (worker lane (new)); not yet named in the map","at":"2026-10-08T19:32:50.856Z"}},{"id":"REV-F10-3","title":"Compare production throughput and wall energy, not only the isolated kernel timer.","setup":"The regression F10 requires (review finding F10: CUDA production readback has an existing OpenCL optimization to borrow).","steps":["Compare production throughput and wall energy, not only the isolated kernel timer."],"accept":"Compare production throughput and wall energy, not only the isolated kernel timer.","evidence":"The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.","priority":"P2","profile":"P00","cadence":"Every release candidate","method":"Automated + independent review","status":"NOT RUN","source":["F10"],"gate":"Review findings closed","owner":"worker lane (new)","manual_page":null,"finding":"F10","finding_title":"CUDA production readback has an existing OpenCL optimization to borrow","finding_priority":"P2 - byte-preserving performance experiment","owner_lane":"worker lane (new)","run_status":"NOT RUN","updated":"2026-10-08T19:32:50.856Z","evidence_record":{"reason":"F10 (P2, the external review): the regression's harness is the owner lane's (worker lane (new)); not yet named in the map","at":"2026-10-08T19:32:50.856Z"}},{"id":"REV-F11-1","title":"Goal switch from an efficiency prior can explore higher core/power when policy allows.","setup":"The regression F11 requires (review finding F11: Ember needs workload-aware identity and objective-aware search).","steps":["Goal switch from an efficiency prior can explore higher core/power when policy allows."],"accept":"Goal switch from an efficiency prior can explore higher core/power when policy allows.","evidence":"The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.","priority":"P2","profile":"P00","cadence":"Every release candidate","method":"Automated + independent review","status":"NOT RUN","source":["F11"],"gate":"Review findings closed","owner":"Ember lane (new)","manual_page":null,"finding":"F11","finding_title":"Ember needs workload-aware identity and objective-aware search","finding_priority":"P2 - product performance","owner_lane":"Ember lane (new)","run_status":"NOT RUN","updated":"2026-10-08T19:32:50.856Z","evidence_record":{"reason":"F11 (P2, the external review): the regression's harness is the owner lane's (Ember lane (new)); not yet named in the map","at":"2026-10-08T19:32:50.856Z"}},{"id":"REV-F11-2","title":"Driver, workload, dataset, compiler and device changes invalidate certification while retaining optional hints.","setup":"The regression F11 requires (review finding F11: Ember needs workload-aware identity and objective-aware search).","steps":["Driver, workload, dataset, compiler and device changes invalidate certification while retaining optional hints."],"accept":"Driver, workload, dataset, compiler and device changes invalidate certification while retaining optional hints.","evidence":"The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.","priority":"P2","profile":"P00","cadence":"Every release candidate","method":"Automated + independent review","status":"NOT RUN","source":["F11"],"gate":"Review findings closed","owner":"Ember lane (new)","manual_page":null,"finding":"F11","finding_title":"Ember needs workload-aware identity and objective-aware search","finding_priority":"P2 - product performance","owner_lane":"Ember lane (new)","run_status":"NOT RUN","updated":"2026-10-08T19:32:50.856Z","evidence_record":{"reason":"F11 (P2, the external review): the regression's harness is the owner lane's (Ember lane (new)); not yet named in the map","at":"2026-10-08T19:32:50.856Z"}},{"id":"REV-F11-3","title":"Thermal/error/late-share events revert safely, including process or machine crash.","setup":"The regression F11 requires (review finding F11: Ember needs workload-aware identity and objective-aware search).","steps":["Thermal/error/late-share events revert safely, including process or machine crash."],"accept":"Thermal/error/late-share events revert safely, including process or machine crash.","evidence":"The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.","priority":"P2","profile":"P00","cadence":"Every release candidate","method":"Automated + independent review","status":"NOT RUN","source":["F11"],"gate":"Review findings closed","owner":"Ember lane (new)","manual_page":null,"finding":"F11","finding_title":"Ember needs workload-aware identity and objective-aware search","finding_priority":"P2 - product performance","owner_lane":"Ember lane (new)","run_status":"NOT RUN","updated":"2026-10-08T19:32:50.856Z","evidence_record":{"reason":"F11 (P2, the external review): the regression's harness is the owner lane's (Ember lane (new)); not yet named in the map","at":"2026-10-08T19:32:50.856Z"}},{"id":"REV-F12-1","title":"Crash before/after broadcast, response timeout, restart before snapshot: no duplicate payment or silent debt loss.","setup":"The regression F12 requires (review finding F12: Pool payouts have a broadcast-before-durable-intent window).","steps":["Crash before/after broadcast, response timeout, restart before snapshot: no duplicate payment or silent debt loss."],"accept":"Crash before/after broadcast, response timeout, restart before snapshot: no duplicate payment or silent debt loss.","evidence":"The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.","priority":"P1","profile":"P00","cadence":"Every release candidate","method":"Automated + independent review","status":"NOT RUN","source":["F12"],"gate":"Review findings closed","owner":"pool lane (new)","manual_page":null,"finding":"F12","finding_title":"Pool payouts have a broadcast-before-durable-intent window","finding_priority":"P1 - payment integrity","owner_lane":"pool lane (new)","run_status":"NOT RUN","updated":"2026-10-08T19:32:50.856Z","evidence_record":{"reason":"F12 (P1, the external review): the regression's harness is the owner lane's (pool lane (new)); not yet named in the map","at":"2026-10-08T19:32:50.856Z"}},{"id":"REV-F12-2","title":"Same signed transaction retried, fee replacement reconciled by intent, not a new payment.","setup":"The regression F12 requires (review finding F12: Pool payouts have a broadcast-before-durable-intent window).","steps":["Same signed transaction retried, fee replacement reconciled by intent, not a new payment."],"accept":"Same signed transaction retried, fee replacement reconciled by intent, not a new payment.","evidence":"The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.","priority":"P1","profile":"P00","cadence":"Every release candidate","method":"Automated + independent review","status":"NOT RUN","source":["F12"],"gate":"Review findings closed","owner":"pool lane (new)","manual_page":null,"finding":"F12","finding_title":"Pool payouts have a broadcast-before-durable-intent window","finding_priority":"P1 - payment integrity","owner_lane":"pool lane (new)","run_status":"NOT RUN","updated":"2026-10-08T19:32:50.856Z","evidence_record":{"reason":"F12 (P1, the external review): the regression's harness is the owner lane's (pool lane (new)); not yet named in the map","at":"2026-10-08T19:32:50.856Z"}},{"id":"REV-F12-3","title":"Receipt reorg and finality pause leave correct pending obligations.","setup":"The regression F12 requires (review finding F12: Pool payouts have a broadcast-before-durable-intent window).","steps":["Receipt reorg and finality pause leave correct pending obligations."],"accept":"Receipt reorg and finality pause leave correct pending obligations.","evidence":"The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.","priority":"P1","profile":"P00","cadence":"Every release candidate","method":"Automated + independent review","status":"NOT RUN","source":["F12"],"gate":"Review findings closed","owner":"pool lane (new)","manual_page":null,"finding":"F12","finding_title":"Pool payouts have a broadcast-before-durable-intent window","finding_priority":"P1 - payment integrity","owner_lane":"pool lane (new)","run_status":"NOT RUN","updated":"2026-10-08T19:32:50.856Z","evidence_record":{"reason":"F12 (P1, the external review): the regression's harness is the owner lane's (pool lane (new)); not yet named in the map","at":"2026-10-08T19:32:50.856Z"}},{"id":"REV-F13-1","title":"Repeated authorization rejected or atomically replaces and cleans prior state.","setup":"The regression F13 requires (review finding F13: Pool admission and membership need bounded resources).","steps":["Repeated authorization rejected or atomically replaces and cleans prior state."],"accept":"Repeated authorization rejected or atomically replaces and cleans prior state.","evidence":"The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.","priority":"P1","profile":"P00","cadence":"Every release candidate","method":"Automated + independent review","status":"NOT RUN","source":["F13"],"gate":"Review findings closed","owner":"pool lane (new)","manual_page":null,"finding":"F13","finding_title":"Pool admission and membership need bounded resources","finding_priority":"P1 - service resilience","owner_lane":"pool lane (new)","run_status":"NOT RUN","updated":"2026-10-08T19:32:50.856Z","evidence_record":{"reason":"F13 (P1, the external review): the regression's harness is the owner lane's (pool lane (new)); not yet named in the map","at":"2026-10-08T19:32:50.856Z"}},{"id":"REV-F13-2","title":"Oversized unterminated frame rejected within fixed memory/time budget.","setup":"The regression F13 requires (review finding F13: Pool admission and membership need bounded resources).","steps":["Oversized unterminated frame rejected within fixed memory/time budget."],"accept":"Oversized unterminated frame rejected within fixed memory/time budget.","evidence":"The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.","priority":"P1","profile":"P00","cadence":"Every release candidate","method":"Automated + independent review","status":"NOT RUN","source":["F13"],"gate":"Review findings closed","owner":"pool lane (new)","manual_page":null,"finding":"F13","finding_title":"Pool admission and membership need bounded resources","finding_priority":"P1 - service resilience","owner_lane":"pool lane (new)","run_status":"NOT RUN","updated":"2026-10-08T19:32:50.856Z","evidence_record":{"reason":"F13 (P1, the external review): the regression's harness is the owner lane's (pool lane (new)); not yet named in the map","at":"2026-10-08T19:32:50.856Z"}},{"id":"REV-F13-3","title":"Slow clients and invalid share floods cannot grow unbounded member, nonce or outgoing state.","setup":"The regression F13 requires (review finding F13: Pool admission and membership need bounded resources).","steps":["Slow clients and invalid share floods cannot grow unbounded member, nonce or outgoing state."],"accept":"Slow clients and invalid share floods cannot grow unbounded member, nonce or outgoing state.","evidence":"The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.","priority":"P1","profile":"P00","cadence":"Every release candidate","method":"Automated + independent review","status":"NOT RUN","source":["F13"],"gate":"Review findings closed","owner":"pool lane (new)","manual_page":null,"finding":"F13","finding_title":"Pool admission and membership need bounded resources","finding_priority":"P1 - service resilience","owner_lane":"pool lane (new)","run_status":"NOT RUN","updated":"2026-10-08T19:32:50.856Z","evidence_record":{"reason":"F13 (P1, the external review): the regression's harness is the owner lane's (pool lane (new)); not yet named in the map","at":"2026-10-08T19:32:50.856Z"}},{"id":"REV-F14-1","title":"Public build has no default arbitrary remote execution and a documented least-privilege boundary.","setup":"The regression F14 requires (review finding F14: Developer fleet control must not silently become the public client trust model).","steps":["Public build has no default arbitrary remote execution and a documented least-privilege boundary."],"accept":"Public build has no default arbitrary remote execution and a documented least-privilege boundary.","evidence":"The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.","priority":"P1","profile":"P00","cadence":"Every release candidate","method":"Automated + independent review","status":"NOT RUN","source":["F14"],"gate":"Review findings closed","owner":"app lane, relay lane","manual_page":null,"finding":"F14","finding_title":"Developer fleet control must not silently become the public client trust model","finding_priority":"P1 - public client/independence gate","owner_lane":"app lane, relay lane","run_status":"NOT RUN","updated":"2026-10-08T19:32:50.856Z","evidence_record":{"reason":"F14 (P1, the external review): the regression's harness is the owner lane's (app lane, relay lane); not yet named in the map","at":"2026-10-08T19:32:50.856Z"}},{"id":"REV-F14-2","title":"Automatic updates off remains off for urgent manifests until explicit action.","setup":"The regression F14 requires (review finding F14: Developer fleet control must not silently become the public client trust model).","steps":["Automatic updates off remains off for urgent manifests until explicit action."],"accept":"Automatic updates off remains off for urgent manifests until explicit action.","evidence":"The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.","priority":"P1","profile":"P00","cadence":"Every release candidate","method":"Automated + independent review","status":"NOT RUN","source":["F14"],"gate":"Review findings closed","owner":"app lane, relay lane","manual_page":null,"finding":"F14","finding_title":"Developer fleet control must not silently become the public client trust model","finding_priority":"P1 - public client/independence gate","owner_lane":"app lane, relay lane","run_status":"NOT RUN","updated":"2026-10-08T19:32:50.856Z","evidence_record":{"reason":"F14 (P1, the external review): the regression's harness is the owner lane's (app lane, relay lane); not yet named in the map","at":"2026-10-08T19:32:50.856Z"}},{"id":"REV-F14-3","title":"A compromised fleet/update signing key cannot silently acquire wallet access or activate a consensus change.","setup":"The regression F14 requires (review finding F14: Developer fleet control must not silently become the public client trust model).","steps":["A compromised fleet/update signing key cannot silently acquire wallet access or activate a consensus change."],"accept":"A compromised fleet/update signing key cannot silently acquire wallet access or activate a consensus change.","evidence":"The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.","priority":"P1","profile":"P00","cadence":"Every release candidate","method":"Automated + independent review","status":"NOT RUN","source":["F14"],"gate":"Review findings closed","owner":"app lane, relay lane","manual_page":null,"finding":"F14","finding_title":"Developer fleet control must not silently become the public client trust model","finding_priority":"P1 - public client/independence gate","owner_lane":"app lane, relay lane","run_status":"NOT RUN","updated":"2026-10-08T19:32:50.856Z","evidence_record":{"reason":"F14 (P1, the external review): the regression's harness is the owner lane's (app lane, relay lane); not yet named in the map","at":"2026-10-08T19:32:50.856Z"}}]}],"profiles":{"P00":{"title":"Frozen scope and approval","requirements":["Approve the release manifest, supported roles, numerical profiles, mandatory scenarios, trust/fault model, workload W, adapters and claims before confirmatory tests. Unknown values are BLOCKED, not defaults.","Core safety and authentication invariants admit no waiver. Proposed performance or commercial targets may be replaced only before the confirmatory run, with an independent rationale and a versioned public scope.","After a failure, weakening a target creates a different claim and requires a new assessment. Preserve all failed runs; do not average a blocker away."],"status":"PROPOSED - REQUIRES APPROVAL"},"P01":{"title":"Correctness and negative-test depth","requirements":["Zero observed invalid acceptance, unauthorised signature, conflicting finality within assumptions, duplicated reward or unexplained cross-backend state/hash disagreement.","Minimum proposed campaign: 1,000,000 full-hash vectors per supported backend across all families, plus at least 10,000 malformed/boundary cases per relevant parser or binding class. Include exhaustive small-domain cases and historical regressions.","All prescribed critical mutants must be detected. This sampling target is not a bound on cryptographic failure probability and does not replace independent reasoning about soundness or safety."],"status":"PROPOSED - REQUIRES APPROVAL"},"P02":{"title":"Hardware coverage and reproducibility","requirements":["At least 12 physical retail configurations: at least 3 NVIDIA, 3 AMD and 2 Apple configurations, at least two discrete-GPU generations, an advertised 8 GB mining tier and 12 GB proving tiers where claimed. Record usable, not nominal, memory.","Declare a competitive core of at least 6 configurations spanning every advertised vendor and at least two discrete generations before optimisation. The wider cohort remains mandatory for access and economic tests; it cannot be silently dropped.","Use 5 paired 30-minute steady-state runs per primary cell after at least 15 minutes of warm-up and a stable temperature trend. Calibrated wall meter uncertainty must be at most 2%. Run a 7-day soak on representative low/mid/high tiers.","Three unaffiliated operators participate; every competitive-core cell is reproduced by at least two. Identical-SKU energy/accepted-work results must agree within 5% after declared environment corrections; unexplained variance blocks the headline."],"status":"PROPOSED - REQUIRES APPROVAL"},"P03":{"title":"Candidate improvement and honest-card budget","requirements":["For production candidate changes, per mandatory GPU cell: no more than 5% increase in joules per accepted work and no more than 2% decrease in accepted throughput versus the paired tuned baseline. Absolute safety limits always apply.","G2 requires at least a 10% reduction in the strongest evaluated specialist advantage after redesign, outside the declared measurement/model uncertainty, while meeting those budgets. A failed experiment is not a successful upgrade.","Existing clock-lock savings belong in the baseline. Long programs cannot pass by adding enough equally costly work to both devices to improve a ratio while materially worsening honest operation."],"status":"PROPOSED - REQUIRES APPROVAL"},"P04":{"title":"Scoped specialist-competition target","requirements":["Define R_E as GPU wall joules per accepted work divided by the lowest credible complete-system specialist joules for that same work. The proposed target is R_E at most 1.5 for every competitive-core cell at the same node and one node ahead.","Evaluate at least three materially distinct specialist architectures, with one programmable multi-family design, and a second independent reviewer. Include shared/reduced memory, hybrid execution, selective participation and realistic power/host costs.","Publish two-node-ahead and modular/reused-IP stress cases; they must satisfy the predeclared P12 economic envelope. No universal ceiling for unknown future hardware is claimed. Report model bounds separately from statistical confidence.","A lower-bound specialist estimate, not a convenient average or a deliberately constrained reference architecture, drives the conservative comparison. Undefined or unbounded decision-critical assumptions make the result BLOCKED."],"status":"PROPOSED - REQUIRES APPROVAL"},"P05":{"title":"Measurement and inference protocol","requirements":["Pre-register primary metrics, cohorts, holdout seeds, run order, exclusions and analysis before confirmation. Keep tuning/training runs separate from holdout runs.","Use independent runs/operators as measurement units. Report point estimates, two-sided 95% measurement intervals and absolute sample counts; handle time-series dependence with a declared block or run-level method.","Apply conservative uncertainty to pass decisions. A confidence interval around measured GPU energy does not capture unknown ASIC architectures; model parameter ranges and expert judgement must be reported as such.","Never compare raw hashes per second across different algorithms. Do not transform a five-year scenario sweep into a probability of chip arrival or a guarantee of future profitability."],"status":"PROPOSED - REQUIRES APPROVAL"},"P06":{"title":"Memory and support policy","requirements":["All advertised role/configuration combinations must finish without OOM, corruption or unsafe fallback. Publish a component memory budget, including display/OS, driver, miner, prover, aggregation and epoch construction.","Proposed support horizon: at least 24 months of known schedule compatibility for the advertised entry tier, unless a narrower horizon is prominently approved before sale or launch. Removal changes the claim and must pass ECO-07.","Treat 5.5 / 8.5 / 11.5 GiB as source candidates, not imposed final rules. Simultaneous operation, eviction and time-sharing are distinct advertised modes with separately measured cost."],"status":"PROPOSED - REQUIRES APPROVAL"},"P07":{"title":"Proof service capacity and fairness","requirements":["Freeze W as a meaningful workload mix, input sizes, proof format, fleet and requests/hour. Primary proposed target: 72 hours at W, plus 24 hours at 1.2W; at least 99.5% accepted jobs delivered valid within the contracted deadline.","Default delivery targets for the declared internal reference workload: p95 at most 60 seconds and p99 at most 120 seconds from input-ready assignment through verified delivery. Also publish request-to-delivery including input wait; no claim may omit that delay.","Request-to-delivery p99 must meet the separately approved customer deadline. Payment p99 must be at most 10 minutes after verified payable eligibility, with chain finality time reported separately. These defaults do not override a stricter contract.","No statistically supported positive backlog drift at steady load, no silent drops; after 2W for 15 minutes, drain excess backlog within 30 minutes of return to W. Report rejected demand and accepted-job success separately.","Proposed advertised-tier fairness: at least 90% timely valid assigned completions are paid under the approved rules; avoidable duplicate/retry work is at most 10% of total work. Reassignment policy must bound abandonment without promising every assignment a reward."],"status":"PROPOSED - REQUIRES APPROVAL"},"P08":{"title":"Fault assumptions and recovery","requirements":["F0 must state the exact safety threshold, quorum and authority-transition rule; the synchrony/participation assumptions for liveness; trusted inputs; and clock/expiry semantics. This manual supplies no substitute consensus rule.","Exercise threshold-minus/at/plus cases, the 40/40/20 partition fixture, signing outages and 31/35/60/90 logical-day expiry cases. Preserve safety when liveness assumptions fail; do not demand finality from an unavailable quorum.","After assumptions and input availability are restored: service replacement within 10 minutes and deterministic network convergence within 30 minutes on the reference topology. Different certified bounds must be approved beforehand.","Accelerated-time simulation and real elapsed operation are separate evidence classes. Recovery may not reverse a guarantee previously represented as final."],"status":"PROPOSED - REQUIRES APPROVAL"},"P09":{"title":"Security and bounded resource requirements","requirements":["Zero unresolved critical or high-severity security findings on the claimed release. Independent scopes must cover consensus, proof soundness/parameters, implementation bypasses, wallet/isolation and relevant operational controls.","Review the intended proof-system security level and assumptions explicitly; do not infer a security-bit claim from random rejection tests. Version every verifier, program and parameter set.","Freeze maximum valid/invalid verification time, memory, disk and admission rates for ordinary validator hardware. At rated valid load plus the approved hostile load, no unbounded growth, invalid acceptance or unrecoverable process failure.","For supported wallet fee-estimation cases, proposed absolute error at most 5% versus the specified charge when inputs are unchanged; deterministic fee-cap handling and explicit uncertainty otherwise. Customer contracts remain separately binding."],"status":"PROPOSED - REQUIRES APPROVAL"},"P10":{"title":"Ordinary-operator product targets","requirements":["At least 30 unaffiliated first-time study participants across supported Windows/macOS combinations. At least 90% install, configure safely and submit accepted work without staff help; p90 active setup at most 15 minutes. Publish complete download/dataset time separately.","Pause/stop acknowledgement within 2 seconds, safe worker stop within 5 seconds where no documented atomic operation prevents it, and reliable restoration of original tuning settings. No hidden custody or silent update.","Net-energy/fee displays reconcile within 5% under the declared measurement boundary. Incremental rejected-work loss on the normal home-link profile is at most 2 percentage points over the matched datacentre profile.","Open miner efficiency is within 5% of the best independently tuned permitted implementation on identical work. For the declared single-card payout case, p95 payable-to-payment at most 24 hours and total payout friction at most 2% of earned value.","Critical alerts are emitted within 60 seconds of detectable evidence. At least 90% of study users can identify the injected failure and follow the published safe action. No control target excuses a security failure."],"status":"PROPOSED - REQUIRES APPROVAL"},"P11":{"title":"No-founder exercise and independence","requirements":["At least 10 verified unaffiliated operators, three independently administered network/hosting domains and sufficient honest weight/capacity to satisfy F0 and W after founders are removed.","Run at least 30 real elapsed days without founder mining, proving, aggregation, bootstrap, required RPC, private files or privileged interventions. Cross all known logical transitions separately without calling accelerated time real history.","Document control by role and common dependencies; uncertain identities are not counted as independent. Within-assumption withdrawals must satisfy P08; losing more than the assumed quorum may cause a visible safe pause."],"status":"PROPOSED - REQUIRES APPROVAL"},"P12":{"title":"Five-year coexistence envelope","requirements":["Freeze a sourced revenue reference R and mandatory worlds before results. Sweep 0.25R, R, 4R and 10R; electricity at $0.03/$0.10/$0.25/$0.40 per kWh; 1/3/5-year productive life; zero/$20M/$75M development; private mining and hardware sales; no/normal/spiking external demand.","Those values are proposed stress inputs, not current prices or forecasts. Declare which worlds have enough funded demand for rational ongoing service before running; retain collapse worlds as explicit safety/exit tests, not profitable successes.","Proposed matched-tariff new-entry target in every mandatory sustainable world: median GPU/specialist total cost per accepted work at most 1.5, 90th percentile at most 1.75, and no advertised competitive-core cell above 2.0. Publish every cell, including heterogeneous tariffs.","At least three purchasable GPU configurations across at least two advertised vendors must have positive modelled new-entry economics; at least 75% of the entry cohort must have positive marginal operating economics in those worlds. Report model uncertainty and failure regions.","Do not impose GPU market share, specialist production limits, token appreciation, full research-cost recovery or automatic chip death to force the result. Any such condition must become an explicit limitation rather than a hidden assumption."],"status":"PROPOSED - REQUIRES APPROVAL"},"P13":{"title":"Maintenance continuity","requirements":["Before a readiness claim, document at least 12 months of committed maintenance resources at the approved operating scope. Include engineering, security review, infrastructure, support and incident response.","Use independently reviewable commitments and downside budgets. Uncommitted future sales, rising token prices, burned fees or assumed fundraising are not available resources.","This is a proposed governance test, not a directive to change the supply cap, issuance allocation or fair-launch design."],"status":"PROPOSED - REQUIRES APPROVAL"},"P14":{"title":"Genuine commercial and developer proof","requirements":["At least three unrelated paying buyer organisations, each making at least three separate purchase decisions across at least 30 days; at least 1,000 meaningful verified external jobs in aggregate. Split invoices do not create independent demand.","No project reimbursement, circular funding or undisclosed related party counts. Report customer concentration and churn; proposed maximum largest-buyer share is 70% of qualifying revenue.","At least 20% aggregate contribution margin after directly attributable delivery costs, retries, refunds and support; publish fully loaded economics separately. At least 75% of sampled eligible operators have positive realised contribution on the declared workload.","At least five unaffiliated developers complete a useful supported application or proof-service integration using public documentation. Customer confirmation and raw commercial evidence may remain confidential to the reviewer."],"status":"PROPOSED - REQUIRES APPROVAL"},"P15":{"title":"Comparative contention threshold","requirements":["Pre-register at least three relevant operating GPU-first peers, plus a real proving alternative for customer comparisons. Verify current versions at execution time. The source reference set is a starting point, not a claim about current rankings.","Require at least three meaningful comparable dimensions with no material inferiority beyond a pre-agreed 10% margin against the best valid comparator, and at least two independently evidenced advantages against at least two peers.","Advantages must be either a greater-than-10% measured improvement outside uncertainty or a directly tested control/capability difference with demonstrated user value. Non-comparable or missing data is not a win.","A panel with hardware/economics, security/operations and customer/operator expertise must support the scoped contender conclusion. Passing these judgement-based thresholds does not certify a universal number-one ranking."],"status":"PROPOSED - REQUIRES APPROVAL"},"P16":{"title":"Observed durability and claim freshness","requirements":["At least 90 real elapsed days on the final compatible release family, at least 30 independently verified operators, and transparent eligibility/churn denominators. Material uncomparable changes reset affected observations.","Proposed outcomes: at least 60% day-90 operator retention and at least 75% of eligible observed operators with positive measured marginal operation over the period. Report incentives and electricity assumptions; do not claim a downturn was observed if it was not.","At least 99.9% availability for the declared customer service during eligible operating conditions, with all-in availability also reported; zero accepted invalid proofs or conflicting finality within F0 assumptions. Do not remove real incidents as maintenance to force a pass.","Run fault injection on isolated infrastructure, not unsuspecting customers. Publish planned test windows separately. Reassess claims at least quarterly and immediately after material hardware, protocol, economics or security changes."],"status":"PROPOSED - REQUIRES APPROVAL"}},"fixtures":[{"id":"F0","title":"Release and assurance manifest","contents":"Exact commits, binaries, genesis/network ID, mining class, dataset schedule, EVM fork/deviations, program/verifier IDs, fees, supply, quorum/fault rules, trust anchors, activation and supported roles."},{"id":"F1","title":"Clean build environments","contents":"Pinned toolchains, dependency locks, clean OS images and documented signing/notarisation boundaries. No production secrets or private founder files."},{"id":"F2","title":"Hardware and measurement lab","contents":"Approved physical GPU cohort, calibrated wall meters, stable thermal conditions, driver/OS images and realistic home/datacentre link conditions."},{"id":"F3","title":"Workload and oracle catalogue","contents":"Fixed full-hash and EVM/proving jobs, independent reference implementations, real customer-sized payloads, held-out seeds and complete expected results."},{"id":"F4","title":"Authorised fault network","contents":"Independent nodes/operators; controllable latency, loss, clocks, partitions, storage faults and role withdrawals. Actual consensus paths plus separately labelled simulators."},{"id":"F5","title":"Negative and regression corpus","contents":"Malformed transactions/proofs, wrong roots/IDs, duplicate payments, bad authority tables, historical failures and deliberately faulty code mutants."},{"id":"F6","title":"Specialist implementation pack","contents":"Functionally checked architectures, RTL/physical estimates where feasible, memory and board assumptions, cost inputs, adaptation paths and uncertainty ranges."},{"id":"F7","title":"Economic and incentive models","contents":"Independently reproducible costs, entry/exit/difficulty policies, scenario grid, operator opportunity costs and money-flow conservation fixtures."},{"id":"F8","title":"User/customer/peer studies","contents":"Consenting unaffiliated users, contracted meaningful workloads, private ownership checks, dated competitor methods and independent analysis."},{"id":"F9","title":"Evidence and status vault","contents":"Immutable run IDs, raw logs, hashes, analysis code, exclusions, defects, reviewers, signatures, privacy controls and public redacted summaries."}],"source_sha256":"418b3b9f68f96a413872fecb16f8508a40063891c70054c65e92e6e5f5fb70b6","scope_note":"Test design, not executed evidence. All numeric additions are proposed, not source-approved protocol rules. Optional claimed features require their tests; excluded features earn no pass credit.","all_pass_note":"Independent passage of all mandatory and claimed-option gates, including commercial and comparative observation, can support a scoped leadership-contender assessment. It does not prove a universal rank or eliminate unknown future hardware risks.","manual_page_count":73,"approval":{"by":"the founder","at":"2026-10-08 18:2x UK","word":"approve as proposed in the tests, forget P13 for now","profiles":{"P00":"APPROVED AS PROPOSED","P01":"APPROVED AS PROPOSED","P02":"APPROVED AS PROPOSED","P03":"APPROVED AS PROPOSED","P04":"APPROVED AS PROPOSED","P05":"APPROVED AS PROPOSED","P06":"APPROVED AS PROPOSED","P07":"APPROVED AS PROPOSED","P08":"APPROVED AS PROPOSED","P09":"APPROVED AS PROPOSED","P10":"APPROVED AS PROPOSED","P11":"APPROVED AS PROPOSED","P12":"APPROVED AS PROPOSED","P13":"DEFERRED by the founder","P14":"APPROVED AS PROPOSED","P15":"APPROVED AS PROPOSED","P16":"APPROVED AS PROPOSED"},"rules_in_force":["P03: a candidate change pays at most 5 percent of joules per accepted work and loses at most 2 percent of accepted throughput against the paired tuned baseline (replaces the 10 percent budget from 18:2x UK)","P04: R_E at most 1.5 for every competitive-core cell at the same node and one node ahead against the lowest credible complete-system specialist; today's placed bracket (1.5x to 2.1x same-node) is a FAIL to work against and is served as such","P12: the matched-tariff median at most 1.5, p90 at most 1.75, no core cell above 2.0","P02: twelve retail configurations, three unaffiliated operators, the seven-day soak define D1's reproduction"]},"live_fields":{"run_status":"NOT RUN | RUNNING | PASS | FAIL | BLOCKED | DEFERRED (P13 only)","owner_lane":"the lane that runs the case, with its id","evidence_path":"the file on the box mirror master that holds the evidence record in the standard's template","run_id":"the run that produced the latest status","updated":"the minute the lane last wrote the case"}}</script>
+<div id="acc-root"><section class="page-hero acc-hero"><div class="container"><div class="eyebrow"><span class="line"></span>Igneum 2.0 acceptance</div><h1 class="acc-title">Test and Acceptance Standard 1.0</h1><p class="lead">Every case of the standard, shown as it is run, in the standard’s own words. A checklist, never a completion score: a gate passes only when every case it depends on has passed.</p><p class="acc-basis"><span>Basis</span> IGNEUM_2.0_Plan.pdf, 37 pages, 8 October 2026. The standard runs to 73 pages. Registry dated 8 October 2026.</p><div class="acc-tally" id="acc-tally"><div class="acc-words"><span class="acc-word approved">APPROVED AS PROPOSED 8 OCTOBER 2026</span><span class="acc-word deferred">P13 DEFERRED</span></div><p class="acc-line">Test and Acceptance Standard 1.0: APPROVED AS PROPOSED by the founder, 8 October 2026; P13 (maintenance continuity) DEFERRED; 190 cases: 2 passed under the standard, 0 running with team evidence, 6 failed, 182 not run, 0 deferred</p><div class="acc-bar" role="img" aria-label="190 cases: 2 passed under the standard, 0 running with team evidence, 6 failed, 182 not run, 0 deferred"><span class="seg g-pass" style="flex-grow:2" title="2 PASS"></span><span class="seg g-fail" style="flex-grow:6" title="6 FAIL"></span><span class="seg g-notrun" style="flex-grow:182" title="182 NOT RUN"></span></div><ul class="acc-legend"><li><i class="sw g-pass" aria-hidden="true"></i><b>2</b> pass</li><li><i class="sw g-fail" aria-hidden="true"></i><b>6</b> fail</li><li><i class="sw g-blocked" aria-hidden="true"></i><b>0</b> blocked</li><li><i class="sw g-running" aria-hidden="true"></i><b>0</b> running</li><li><i class="sw g-notrun" aria-hidden="true"></i><b>182</b> not run</li><li><i class="sw g-deferred" aria-hidden="true"></i><b>0</b> deferred</li></ul></div></div></section><nav class="acc-jump container" aria-label="Suites"><a href="#gates">Gates</a><a href="#suite-GOV">GOV</a><a href="#suite-GPU">GPU</a><a href="#suite-POW">POW</a><a href="#suite-ADV">ADV</a><a href="#suite-ROT">ROT</a><a href="#suite-ECO">ECO</a><a href="#suite-EVM">EVM</a><a href="#suite-ZKP">ZKP</a><a href="#suite-CAP">CAP</a><a href="#suite-INC">INC</a><a href="#suite-FIN">FIN</a><a href="#suite-VER">VER</a><a href="#suite-OPS">OPS</a><a href="#suite-UX">UX</a><a href="#suite-COM">COM</a><a href="#suite-LEAD">LEAD</a><a href="#suite-REV">REV</a><a href="#suite-INT">INT</a><a href="#profiles">Profiles</a><a href="#fixtures">Fixtures</a></nav><section class="section acc-gates-sec" id="gates"><div class="container"><div class="eyebrow"><span class="line"></span>The gates</div><h2>Five gates, and the freeze before them.</h2><p class="acc-sub">A gate reads NOT RUN until every case it depends on has run, RUNNING while any is running, BLOCKED if any is blocked, FAIL if any fails, and PASS only when every case passes. No gate is weighted into an average.</p><div class="acc-g0"><article class="acc-gate st-notrun small" id="gate-G0" data-gate-state="NOT RUN"><div class="acc-gate-top"><span class="acc-gate-id">G0</span><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></div><h3>Freeze</h3><p class="acc-gate-d">Release identity</p><p class="acc-gate-c">No formal run or public pass before approval.</p><div class="acc-bar" role="img" aria-label="Freeze: 8 cases: 0 passed under the standard, 0 running with team evidence, 8 not run, 0 deferred"><span class="seg g-notrun" style="flex-grow:8" title="8 NOT RUN"></span></div><p class="acc-gate-n">8 cases: 0 passed under the standard, 0 running with team evidence, 8 not run, 0 deferred</p><ul class="acc-gs"><li><a href="#suite-GOV">GOV</a><span class="acc-gs-n">8 cases</span><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></li></ul></article></div><div class="acc-five"><article class="acc-gate st-notrun" id="gate-G1" data-gate-state="NOT RUN"><div class="acc-gate-top"><span class="acc-gate-id">G1</span><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></div><h3>Baseline</h3><p class="acc-gate-d">D1</p><p class="acc-gate-c">No validated hardware claim without reproduction.</p><div class="acc-bar" role="img" aria-label="Baseline: 16 cases: 0 passed under the standard, 0 running with team evidence, 16 not run, 0 deferred"><span class="seg g-notrun" style="flex-grow:16" title="16 NOT RUN"></span></div><p class="acc-gate-n">16 cases: 0 passed under the standard, 0 running with team evidence, 16 not run, 0 deferred</p><ul class="acc-gs"><li><a href="#suite-GOV">GOV</a><span class="acc-gs-n">8 cases</span><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></li><li><a href="#suite-GPU">GPU</a><span class="acc-gs-n">8 cases</span><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></li></ul></article><article class="acc-gate st-fail" id="gate-G2" data-gate-state="FAIL"><div class="acc-gate-top"><span class="acc-gate-id">G2</span><span class="acc-chip s-fail" data-state="FAIL">FAIL</span></div><h3>Experiments</h3><p class="acc-gate-d">D2</p><p class="acc-gate-c">No improvement claim from a negative hypothesis.</p><div class="acc-bar" role="img" aria-label="Experiments: 32 cases: 0 passed under the standard, 0 running with team evidence, 2 failed, 30 not run, 0 deferred"><span class="seg g-fail" style="flex-grow:2" title="2 FAIL"></span><span class="seg g-notrun" style="flex-grow:30" title="30 NOT RUN"></span></div><p class="acc-gate-n">32 cases: 0 passed under the standard, 0 running with team evidence, 2 failed, 30 not run, 0 deferred</p><ul class="acc-gs"><li><a href="#suite-GOV">GOV</a><span class="acc-gs-n">8 cases</span><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></li><li><a href="#suite-GPU">GPU</a><span class="acc-gs-n">8 cases</span><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></li><li><a href="#suite-POW">POW</a><span class="acc-gs-n">8 cases</span><span class="acc-chip s-fail" data-state="FAIL">FAIL</span></li><li><a href="#suite-ROT">ROT</a><span class="acc-gs-n">8 cases</span><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></li></ul></article><article class="acc-gate st-notrun" id="gate-G3" data-gate-state="NOT RUN"><div class="acc-gate-top"><span class="acc-gate-id">G3</span><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></div><h3>Adversary</h3><p class="acc-gate-d">D3</p><p class="acc-gate-c">No broad resistance claim from one weak design.</p><div class="acc-bar" role="img" aria-label="Adversary: 16 cases: 0 passed under the standard, 0 running with team evidence, 16 not run, 0 deferred"><span class="seg g-notrun" style="flex-grow:16" title="16 NOT RUN"></span></div><p class="acc-gate-n">16 cases: 0 passed under the standard, 0 running with team evidence, 16 not run, 0 deferred</p><ul class="acc-gs"><li><a href="#suite-GOV">GOV</a><span class="acc-gs-n">8 cases</span><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></li><li><a href="#suite-ADV">ADV</a><span class="acc-gs-n">8 cases</span><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></li></ul></article><article class="acc-gate st-fail" id="gate-G4" data-gate-state="FAIL"><div class="acc-gate-top"><span class="acc-gate-id">G4</span><span class="acc-chip s-fail" data-state="FAIL">FAIL</span></div><h3>Coexistence</h3><p class="acc-gate-d">D4</p><p class="acc-gate-c">No durability claim based on assumed chip expiry.</p><div class="acc-bar" role="img" aria-label="Coexistence: 24 cases: 0 passed under the standard, 0 running with team evidence, 1 failed, 23 not run, 0 deferred"><span class="seg g-fail" style="flex-grow:1" title="1 FAIL"></span><span class="seg g-notrun" style="flex-grow:23" title="23 NOT RUN"></span></div><p class="acc-gate-n">24 cases: 0 passed under the standard, 0 running with team evidence, 1 failed, 23 not run, 0 deferred</p><ul class="acc-gs"><li><a href="#suite-GOV">GOV</a><span class="acc-gs-n">8 cases</span><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></li><li><a href="#suite-ECO">ECO</a><span class="acc-gs-n">8 cases</span><span class="acc-chip s-fail" data-state="FAIL">FAIL</span></li><li><a href="#suite-INC">INC</a><span class="acc-gs-n">8 cases</span><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></li></ul></article><article class="acc-gate st-notrun" id="gate-G5" data-gate-state="NOT RUN"><div class="acc-gate-top"><span class="acc-gate-id">G5</span><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></div><h3>No rescue</h3><p class="acc-gate-d">D5</p><p class="acc-gate-c">No no-rescue claim from a founder-supported demo.</p><div class="acc-bar" role="img" aria-label="No rescue: 56 cases: 2 passed under the standard, 0 running with team evidence, 54 not run, 0 deferred"><span class="seg g-pass" style="flex-grow:2" title="2 PASS"></span><span class="seg g-notrun" style="flex-grow:54" title="54 NOT RUN"></span></div><p class="acc-gate-n">56 cases: 2 passed under the standard, 0 running with team evidence, 54 not run, 0 deferred</p><ul class="acc-gs"><li><a href="#suite-GOV">GOV</a><span class="acc-gs-n">8 cases</span><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></li><li><a href="#suite-ROT">ROT</a><span class="acc-gs-n">8 cases</span><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></li><li><a href="#suite-ZKP">ZKP</a><span class="acc-gs-n">8 cases</span><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></li><li><a href="#suite-INC">INC</a><span class="acc-gs-n">8 cases</span><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></li><li><a href="#suite-FIN">FIN</a><span class="acc-gs-n">8 cases</span><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></li><li><a href="#suite-OPS">OPS</a><span class="acc-gs-n">8 cases</span><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></li><li><a href="#suite-UX">UX</a><span class="acc-gs-n">8 cases</span><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></li></ul></article></div><h3 class="acc-tracks-h">The three named gates</h3><div class="acc-tracks"><article class="acc-gate st-fail small" id="gate-TR" data-gate-state="FAIL"><div class="acc-gate-top"><span class="acc-gate-id"></span><span class="acc-chip s-fail" data-state="FAIL">FAIL</span></div><h3>Technical readiness</h3><p class="acc-gate-d">Execution control</p><p class="acc-gate-c">No mainnet-ready claim with missing enforcement or safety.</p><div class="acc-bar" role="img" aria-label="Technical readiness: 64 cases: 2 passed under the standard, 0 running with team evidence, 5 failed, 57 not run, 0 deferred"><span class="seg g-pass" style="flex-grow:2" title="2 PASS"></span><span class="seg g-fail" style="flex-grow:5" title="5 FAIL"></span><span class="seg g-notrun" style="flex-grow:57" title="57 NOT RUN"></span></div><p class="acc-gate-n">64 cases: 2 passed under the standard, 0 running with team evidence, 5 failed, 57 not run, 0 deferred</p><ul class="acc-gs"><li><a href="#suite-GOV">GOV</a><span class="acc-gs-n">8 cases</span><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></li><li><a href="#suite-POW">POW</a><span class="acc-gs-n">8 cases</span><span class="acc-chip s-fail" data-state="FAIL">FAIL</span></li><li><a href="#suite-EVM">EVM</a><span class="acc-gs-n">8 cases</span><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></li><li><a href="#suite-ZKP">ZKP</a><span class="acc-gs-n">8 cases</span><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></li><li><a href="#suite-CAP">CAP</a><span class="acc-gs-n">8 cases</span><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></li><li><a href="#suite-FIN">FIN</a><span class="acc-gs-n">8 cases</span><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></li><li><a href="#suite-VER">VER</a><span class="acc-gs-n">8 cases</span><span class="acc-chip s-fail" data-state="FAIL">FAIL</span></li><li><a href="#suite-UX">UX</a><span class="acc-gs-n">8 cases</span><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></li></ul></article><article class="acc-gate st-notrun small" id="gate-CE" data-gate-state="NOT RUN"><div class="acc-gate-top"><span class="acc-gate-id"></span><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></div><h3>Commercial evidence</h3><p class="acc-gate-d">Execution control</p><p class="acc-gate-c">Devnet activity is insufficient.</p><div class="acc-bar" role="img" aria-label="Commercial evidence: 24 cases: 0 passed under the standard, 0 running with team evidence, 24 not run, 0 deferred"><span class="seg g-notrun" style="flex-grow:24" title="24 NOT RUN"></span></div><p class="acc-gate-n">24 cases: 0 passed under the standard, 0 running with team evidence, 24 not run, 0 deferred</p><ul class="acc-gs"><li><a href="#suite-GOV">GOV</a><span class="acc-gs-n">8 cases</span><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></li><li><a href="#suite-CAP">CAP</a><span class="acc-gs-n">8 cases</span><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></li><li><a href="#suite-COM">COM</a><span class="acc-gs-n">8 cases</span><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></li></ul></article><article class="acc-gate st-fail small" id="gate-CD" data-gate-state="FAIL"><div class="acc-gate-top"><span class="acc-gate-id"></span><span class="acc-chip s-fail" data-state="FAIL">FAIL</span></div><h3>Leadership-contender decision</h3><p class="acc-gate-d">Execution control</p><p class="acc-gate-c">Supports a scoped contention assessment, not a guaranteed rank.</p><div class="acc-bar" role="img" aria-label="Leadership-contender decision: 190 cases: 2 passed under the standard, 0 running with team evidence, 6 failed, 182 not run, 0 deferred"><span class="seg g-pass" style="flex-grow:2" title="2 PASS"></span><span class="seg g-fail" style="flex-grow:6" title="6 FAIL"></span><span class="seg g-notrun" style="flex-grow:182" title="182 NOT RUN"></span></div><p class="acc-gate-n">190 cases: 2 passed under the standard, 0 running with team evidence, 6 failed, 182 not run, 0 deferred</p><ul class="acc-gs"><li><a href="#suite-GOV">GOV</a><span class="acc-gs-n">8 cases</span><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></li><li><a href="#suite-GPU">GPU</a><span class="acc-gs-n">8 cases</span><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></li><li><a href="#suite-POW">POW</a><span class="acc-gs-n">8 cases</span><span class="acc-chip s-fail" data-state="FAIL">FAIL</span></li><li><a href="#suite-ADV">ADV</a><span class="acc-gs-n">8 cases</span><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></li><li><a href="#suite-ROT">ROT</a><span class="acc-gs-n">8 cases</span><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></li><li><a href="#suite-ECO">ECO</a><span class="acc-gs-n">8 cases</span><span class="acc-chip s-fail" data-state="FAIL">FAIL</span></li><li><a href="#suite-EVM">EVM</a><span class="acc-gs-n">8 cases</span><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></li><li><a href="#suite-ZKP">ZKP</a><span class="acc-gs-n">8 cases</span><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></li><li><a href="#suite-CAP">CAP</a><span class="acc-gs-n">8 cases</span><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></li><li><a href="#suite-INC">INC</a><span class="acc-gs-n">8 cases</span><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></li><li><a href="#suite-FIN">FIN</a><span class="acc-gs-n">8 cases</span><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></li><li><a href="#suite-VER">VER</a><span class="acc-gs-n">8 cases</span><span class="acc-chip s-fail" data-state="FAIL">FAIL</span></li><li><a href="#suite-OPS">OPS</a><span class="acc-gs-n">8 cases</span><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></li><li><a href="#suite-UX">UX</a><span class="acc-gs-n">8 cases</span><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></li><li><a href="#suite-COM">COM</a><span class="acc-gs-n">8 cases</span><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></li><li><a href="#suite-LEAD">LEAD</a><span class="acc-gs-n">8 cases</span><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></li><li><a href="#suite-REV">REV</a><span class="acc-gs-n">44 cases</span><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></li><li><a href="#suite-INT">INT</a><span class="acc-gs-n">18 cases</span><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></li></ul></article></div></div></section><section class="section acc-suite" id="suite-GOV"><div class="container"><div class="acc-suite-head"><div class="acc-suite-code"><span class="n">01</span>GOV</div><div class="acc-suite-t"><h2>Release identity and evidence</h2><p class="acc-sub">Prevent a favourable result from being attached to the wrong code, assumptions or public claim.</p></div><div class="acc-suite-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></div></div><dl class="acc-facts"><div><dt>Owner</dt><dd>Release lead + independent assurance</dd></div><div><dt>Gate</dt><dd>G0 / all gates <span class="acc-gl"><a href="#gate-G0">G0</a> <a href="#gate-G1">G1</a> <a href="#gate-G2">G2</a> <a href="#gate-G3">G3</a> <a href="#gate-G4">G4</a> <a href="#gate-G5">G5</a></span></dd></div><div><dt>Fixtures</dt><dd>F0 manifest; F1 source/build archives; F9 evidence vault</dd></div><div><dt>Plan pages</dt><dd>5, 21, 23, 25, 26, 27</dd></div></dl><div class="acc-suite-bar"><div class="acc-bar" role="img" aria-label="GOV: 8 cases: 0 passed under the standard, 0 running with team evidence, 8 not run, 0 deferred"><span class="seg g-notrun" style="flex-grow:8" title="8 NOT RUN"></span></div><span>8 cases: 0 passed under the standard, 0 running with team evidence, 8 not run, 0 deferred</span></div><div class="acc-cases"><div class="acc-cases-h" aria-hidden="true"><span>Case</span><span>Title</span><span>Priority</span><span>Profile</span><span>Status</span><span>Evidence</span><span>Last run</span><span></span></div><details class="acc-case" id="case-GOV-01" data-case="GOV-01" data-state="NOT RUN"><summary><span class="c-id">GOV-01</span><span class="c-title">Freeze the release and its claims</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P00</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:32 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Candidate source, binaries, public documentation and the 2.0 plan are available; no run is yet accepted.</p><h4>Steps</h4><ol><li>Record exact commits, binary hashes, dependencies, genesis/network identity, mining class, datasets, execution fork, verifier IDs and fee rules in F0.</li><li>Map every promised capability and plan requirement to a test ID; distinguish supported mining, proving and wallet combinations.</li><li>Sign the manifest with protocol, product and independent review owners before confirmatory runs.</li></ol><h4>Accept</h4><p>Every material rule and claim has an unambiguous version and test. Conflicts or unknown activation rules produce BLOCKED, not an inferred default. Changes create a new manifest and invalidate affected results.</p><h4>Evidence the case requires</h4><p>Signed F0; source-to-test map; claim inventory; unresolved-field register.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>node lane (a283f5f0d364ceef0)</dd></div><div><dt>Run</dt><dd>201-7cfa422a-aa0e0f45</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>18</dd></div><div><dt>Plan pages</dt><dd>5, 21, 23, 25, 26, 27</dd></div></dl></div></details><details class="acc-case" id="case-GOV-02" data-case="GOV-02" data-state="NOT RUN"><summary><span class="c-id">GOV-02</span><span class="c-title">Approve thresholds before results</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P00</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><a href="https://git.igneum.network/igneum-network/igneum/src/branch/master/docs/plans/igneum-2.0-test-registry.json" rel="noopener">record</a></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 21:10 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>This manual supplies proposed test thresholds, not source-approved protocol parameters.</p><h4>Steps</h4><ol><li>Approve or replace every P-profile before confirmatory testing; give each change a rationale and independent approver.</li><li>Register hardware cohorts, mandatory economic worlds, customer workloads, peer dimensions and exclusion rules.</li><li>Lock the profile hash and hold out seeds/workloads from the developers doing optimisation.</li></ol><h4>Accept</h4><p>No decision-critical field is TBD. Numeric limits are frozen, commercially meaningful and not chosen from observed results. A weakened limit after failure requires a new protocol, full affected rerun and explicit claim downgrade review.</p><h4>Evidence the case requires</h4><p>Approved profile register; timestamped holdout commitments; change log.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>CI steward (a2ecfa95d3206016c)</dd></div><div><dt>Run</dt><dd>team-2026-10-08</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>18</dd></div><div><dt>Plan pages</dt><dd>5, 21, 23, 25, 26, 27</dd></div></dl></div></details><details class="acc-case" id="case-GOV-03" data-case="GOV-03" data-state="NOT RUN"><summary><span class="c-id">GOV-03</span><span class="c-title">Reproduce builds outside the founding team</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P00, P02</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>2026-10-08 18:3x UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Provide public source and documented build instructions to three unaffiliated operators.</p><h4>Steps</h4><ol><li>Build on clean declared environments without private files, tokens or founder assistance.</li><li>Compare reproducible payload hashes; isolate signatures, notarisation and permitted non-deterministic wrappers.</li><li>Run reference vectors and restart a node using only documented artifacts.</li></ol><h4>Accept</h4><p>All independent builds reproduce the same consensus payload or an independently explained, pre-approved wrapper difference; reference outputs match exactly. Missing private prerequisites block release.</p><h4>Evidence the case requires</h4><p>Build logs; dependency lockfiles; binary comparison; operator attestations.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Independent reproduction</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>build-server lane (a352e49ff4613df86)</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>18</dd></div><div><dt>Plan pages</dt><dd>5, 21, 23, 25, 26, 27</dd></div></dl></div></details><details class="acc-case" id="case-GOV-04" data-case="GOV-04" data-state="NOT RUN"><summary><span class="c-id">GOV-04</span><span class="c-title">Preserve raw and negative evidence</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P00</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:22 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Enable append-only storage for run outputs and a separate analysis workspace.</p><h4>Steps</h4><ol><li>Capture failed, aborted and successful runs with timestamps, seeds and environment hashes.</li><li>Recompute one published figure from raw records on a clean machine.</li><li>Modify a retained artifact deliberately and test integrity verification.</li></ol><h4>Accept</h4><p>Every headline can be regenerated; tampering is detected; exclusions have pre-registered reasons. Failed or missing runs remain visible and are never replaced silently by a successful retry.</p><h4>Evidence the case requires</h4><p>Artifact manifest; hashes; reproduction script; exclusion ledger; negative-run archive.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>CI steward (a2ecfa95d3206016c)</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>19</dd></div><div><dt>Plan pages</dt><dd>5, 21, 23, 25, 26, 27</dd></div></dl></div></details><details class="acc-case" id="case-GOV-05" data-case="GOV-05" data-state="NOT RUN"><summary><span class="c-id">GOV-05</span><span class="c-title">Prove the test oracle detects broken behaviour</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P01</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 19:28 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Create controlled defective variants on an isolated network only.</p><h4>Steps</h4><ol><li>Disable proof verification, change one reward, accept an expired authority set and alter one hash output in separate mutants.</li><li>Run the corresponding ZKP, INC, FIN and POW tests without telling the runner which mutant is active.</li><li>Confirm the baseline still accepts authorised valid cases.</li></ol><h4>Accept</h4><p>Every deliberately introduced fault is caught by its mapped test; valid controls pass. Any undetected critical mutant blocks acceptance of that test family until the oracle is repaired.</p><h4>Evidence the case requires</h4><p>Mutation catalogue; blinded run results; baseline controls; oracle review.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>fast-time lane (a8be71a0db962911c)</dd></div><div><dt>Run</dt><dd>200-417c4a57-b2</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>19</dd></div><div><dt>Plan pages</dt><dd>5, 21, 23, 25, 26, 27</dd></div></dl></div></details><details class="acc-case" id="case-GOV-06" data-case="GOV-06" data-state="NOT RUN"><summary><span class="c-id">GOV-06</span><span class="c-title">Enforce scope and optional-feature discipline</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P00</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 19:28 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Inventory FP32 experiments, receipts/oracles and all retained or excluded mining levers.</p><h4>Steps</h4><ol><li>Mark each capability CORE, CLAIMED-OPTIONAL or EXCLUDED before release testing.</li><li>For excluded code, check binaries, protocol activation and product copy for accidental enablement or implied availability.</li><li>For each claimed option, require the complete associated test set rather than a demonstration.</li></ol><h4>Accept</h4><p>Every core and claimed-option obligation passes. Excluded items are shown as EXCLUDED, never PASS and never counted as achievements. Removing a failed core requirement prevents an all-2.0-pass claim.</p><h4>Evidence the case requires</h4><p>Scope manifest; activation scan; product-copy comparison; exclusions register.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>CI steward (a2ecfa95d3206016c)</dd></div><div><dt>Run</dt><dd>200-417c4a57-b2</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>19</dd></div><div><dt>Plan pages</dt><dd>5, 21, 23, 25, 26, 27</dd></div></dl></div></details><details class="acc-case" id="case-GOV-07" data-case="GOV-07" data-state="NOT RUN"><summary><span class="c-id">GOV-07</span><span class="c-title">Independent review and finding closure</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P09</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>2026-10-08 18:3x UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Nominate reviewers with declared conflicts and scopes covering cryptography, consensus and hardware.</p><h4>Steps</h4><ol><li>Provide pinned code, raw data, adversarial models and prior failures, including negative results.</li><li>Track each finding to remediation and an independent retest; do not use the author as sole approver.</li><li>Have reviewers state unreviewed surfaces and model limitations in their signed conclusions.</li></ol><h4>Accept</h4><p>No unresolved critical or high-severity finding affects the claimed release. A finite review is described by scope, not as proof of universal security. Independent reproduction and review are both evidenced.</p><h4>Evidence the case requires</h4><p>Signed scoped reports; conflict declarations; finding/retest ledger.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Independent specialist review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>main / the founder</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>20</dd></div><div><dt>Plan pages</dt><dd>5, 21, 23, 25, 26, 27</dd></div></dl></div></details><details class="acc-case" id="case-GOV-08" data-case="GOV-08" data-state="NOT RUN"><summary><span class="c-id">GOV-08</span><span class="c-title">Invalidate stale evidence and control public status</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P00</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:22 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Create a simulated post-test change to a verifier, mining class, dataset and fee rule.</p><h4>Steps</h4><ol><li>Calculate affected test dependencies and invalidate their former PASS statuses.</li><li>Regenerate public status pages from F0 and the evidence register.</li><li>Attempt to publish a rank-one, guaranteed-profit or automatic-chip-death claim without the required evidence.</li></ol><h4>Accept</h4><p>Affected gates return to NOT RUN or BLOCKED. Public claims retain version, limits and date; unsupported claims are withheld. No stale result remains attached to a different release.</p><h4>Evidence the case requires</h4><p>Dependency impact report; regenerated status page; rejected claim examples.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>CI steward (a2ecfa95d3206016c)</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>20</dd></div><div><dt>Plan pages</dt><dd>5, 21, 23, 25, 26, 27</dd></div></dl></div></details></div></div></section><section class="section acc-suite" id="suite-GPU"><div class="container"><div class="acc-suite-head"><div class="acc-suite-code"><span class="n">02</span>GPU</div><div class="acc-suite-t"><h2>Whole-system GPU measurements</h2><p class="acc-sub">Close the pending measurements and evaluate the actual configuration, including costs hidden by kernel-only results.</p></div><div class="acc-suite-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></div></div><dl class="acc-facts"><div><dt>Owner</dt><dd>GPU lead + three independent operators</dd></div><div><dt>Gate</dt><dd>G1 / G2 <span class="acc-gl"><a href="#gate-G1">G1</a> <a href="#gate-G2">G2</a></span></dd></div><div><dt>Fixtures</dt><dd>F2 retail-hardware cohort; F3 paired benchmark workloads; F9 calibrated evidence</dd></div><div><dt>Plan pages</dt><dd>6, 7, 8, 14, 18, 23</dd></div></dl><div class="acc-suite-bar"><div class="acc-bar" role="img" aria-label="GPU: 8 cases: 0 passed under the standard, 0 running with team evidence, 8 not run, 0 deferred"><span class="seg g-notrun" style="flex-grow:8" title="8 NOT RUN"></span></div><span>8 cases: 0 passed under the standard, 0 running with team evidence, 8 not run, 0 deferred</span></div><div class="acc-cases"><div class="acc-cases-h" aria-hidden="true"><span>Case</span><span>Title</span><span>Priority</span><span>Profile</span><span>Status</span><span>Evidence</span><span>Last run</span><span></span></div><details class="acc-case" id="case-GPU-01" data-case="GPU-01" data-state="NOT RUN"><summary><span class="c-id">GPU-01</span><span class="c-title">Cover the declared commodity population</span><span class="c-pri"><span class="lbl">Priority </span>GATE</span><span class="c-prof"><span class="lbl">Profile </span>P02</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><a href="https://git.igneum.network/igneum-network/igneum/src/branch/master/docs/analysis/class-v6/rows/fleet-f05-20261008.md" rel="noopener">record</a></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:59 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Freeze the P02 cohort, supported role matrix and the final v6 configuration.</p><h4>Steps</h4><ol><li>Inventory physical SKU, usable memory, driver, operating system, firmware, cooling and acquisition channel.</li><li>Run mining on every supported cohort cell and proving on every separately advertised prover cell.</li><li>Include lower-memory, used-generation and all advertised vendor cases; retain unsupported results separately.</li></ol><h4>Accept</h4><p>All declared cells are tested, with no after-the-fact removal of weak cards. At least the P02 minimum coverage is met. Mining-only support is never reported as proof-generation support.</p><h4>Evidence the case requires</h4><p>Cohort manifest; compatibility matrix; raw results by SKU and role.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>research lane (ad6a2bd47d4a46105)</dd></div><div><dt>Run</dt><dd>hash-lane-20261008-batch2</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>21</dd></div><div><dt>Plan pages</dt><dd>6, 7, 8, 14, 18, 23</dd></div></dl></div></details><details class="acc-case" id="case-GPU-02" data-case="GPU-02" data-state="NOT RUN"><summary><span class="c-id">GPU-02</span><span class="c-title">Reproduce Ember clock-lock savings</span><span class="c-pri"><span class="lbl">Priority </span>GATE</span><span class="c-prof"><span class="lbl">Profile </span>P02, P03</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><a href="https://git.igneum.network/igneum-network/igneum/src/branch/master/docs/analysis/class-v6/rows/run-ca3-pc1-readwidth-5090-20261008-b.md" rel="noopener">record</a></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 19:41 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Use paired stock and tuned runs on the same board, host, workload and ambient conditions.</p><h4>Steps</h4><ol><li>Warm to stability; randomise stock/tuned order and run P02 repeated sessions.</li><li>Measure accepted work, calibrated wall energy, device telemetry and rejected work.</li><li>Calculate paired energy and rate changes with run-level uncertainty, retaining failed tuning attempts.</li></ol><h4>Accept</h4><p>Tuning preserves correctness and meets approved P03 operating limits. The historical 34-41% saving and under-2% rate-loss statement is reproduced only for qualifying configurations; otherwise that claim is corrected. Existing savings are not counted twice.</p><h4>Evidence the case requires</h4><p>Raw power/time series; paired analysis; tuning settings; claim-by-SKU table.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>hash lane (a690540514aa453d7)</dd></div><div><dt>Run</dt><dd>hash-lane-20261008-batch1</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>21</dd></div><div><dt>Plan pages</dt><dd>6, 7, 8, 14, 18, 23</dd></div></dl></div></details><details class="acc-case" id="case-GPU-03" data-case="GPU-03" data-state="NOT RUN"><summary><span class="c-id">GPU-03</span><span class="c-title">Measure the real 64-register GPU cost</span><span class="c-pri"><span class="lbl">Priority </span>GATE</span><span class="c-prof"><span class="lbl">Profile </span>P02, P03</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 21:18 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Build the baseline and window variant with identical dataset, reads and semantic workload.</p><h4>Steps</h4><ol><li>Inspect compiled register allocation, spills, occupancy and memory traffic on each supported backend.</li><li>Measure paired complete-system energy and accepted throughput, including host work.</li><li>Repeat during proving coexistence and expose any memory or scheduling cliff.</li></ol><h4>Accept</h4><p>Any production window meets P03 budgets for every mandatory SKU; no hidden spills or correctness changes. Zero GPU cost is claimed only where measurement supports it within uncertainty. Results feed the redesigned adversary, not an old core estimate.</p><h4>Evidence the case requires</h4><p>Compiler reports; allocation traces; paired energy/rate data; coexistence runs.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>hash lane (a690540514aa453d7)</dd></div><div><dt>Run</dt><dd>amd-intel-energy-20261008-01</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>21</dd></div><div><dt>Plan pages</dt><dd>6, 7, 8, 14, 18, 23</dd></div></dl></div></details><details class="acc-case" id="case-GPU-04" data-case="GPU-04" data-state="NOT RUN"><summary><span class="c-id">GPU-04</span><span class="c-title">Find the memory-clock operating ladder</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P01, P02</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><a href="https://git.igneum.network/igneum-network/igneum/src/branch/master/docs/analysis/class-v6/floor/sm-sparse.md" rel="noopener">record</a></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 21:10 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Use safe vendor-supported settings only; record operator permission and original settings.</p><h4>Steps</h4><ol><li>Sweep approved core and memory operating points while holding workload constant.</li><li>Measure error rate, accepted throughput, wall energy and thermal equilibrium.</li><li>Repeat the selected knee after reboot and restore defaults after a failed or interrupted tuning session.</li></ol><h4>Accept</h4><p>Selected profiles are stable, reproducible and not dependent on unsafe clocks. Every accepted hash remains correct; saved settings restore predictably. Tuning failure leaves a working safe configuration.</p><h4>Evidence the case requires</h4><p>Clock ladder; safe bounds; thermal/error logs; reboot and rollback record.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>hash lane (a690540514aa453d7)</dd></div><div><dt>Run</dt><dd>team-2026-10-08</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>22</dd></div><div><dt>Plan pages</dt><dd>6, 7, 8, 14, 18, 23</dd></div></dl></div></details><details class="acc-case" id="case-GPU-05" data-case="GPU-05" data-state="NOT RUN"><summary><span class="c-id">GPU-05</span><span class="c-title">Test dataset fit and support-horizon costs</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P01, P02, P06</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><a href="https://git.igneum.network/igneum-network/igneum/src/branch/master/docs/analysis/class-v6/rows/run-ca3-pc1-amd-cardin-20261008T1703.md" rel="noopener">record</a></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 19:41 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Test 5.5, 8.5 and 11.5 GiB only as source-proposed candidates; F0 determines activated sizes.</p><h4>Steps</h4><ol><li>Measure allocation plus driver, display, prover and OS headroom on the 8 GB and other cohort tiers.</li><li>Run near-full-memory, fragmentation, restart and next-epoch construction scenarios.</li><li>Compare time-sharing/eviction with concurrent mining/proving, including reload cost.</li></ol><h4>Accept</h4><p>Every advertised combination completes without OOM or silent corruption. Unsupported future sizes are identified before activation. GPU exclusions and lost proving capacity appear in ECO evaluation; retirement of a tier is not a success metric.</p><h4>Evidence the case requires</h4><p>Memory budget per SKU; OOM traces; support horizon; concurrency cost table.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>hash lane (a690540514aa453d7)</dd></div><div><dt>Run</dt><dd>hash-lane-20261008-batch1</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>22</dd></div><div><dt>Plan pages</dt><dd>6, 7, 8, 14, 18, 23</dd></div></dl></div></details><details class="acc-case" id="case-GPU-06" data-case="GPU-06" data-state="NOT RUN"><summary><span class="c-id">GPU-06</span><span class="c-title">Measure accepted work under ordinary connectivity</span><span class="c-pri"><span class="lbl">Priority </span>GATE</span><span class="c-prof"><span class="lbl">Profile </span>P02, P10</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:22 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Use the same hardware against clean, delayed, lossy and intermittent links in F4.</p><h4>Steps</h4><ol><li>Measure kernel rate and accepted work separately under home and datacentre link profiles.</li><li>Include reconnects, template changes, expired submissions and pool failover.</li><li>Attribute loss to network, local software, validation and protocol causes.</li></ol><h4>Accept</h4><p>Results use accepted work, never kernel rate alone. Ordinary-link incremental rejection stays within P10; all losses remain priced in ECO. Unreachable links may pause but must not claim paid work.</p><h4>Evidence the case requires</h4><p>Per-submission ledger; network trace; rejection reasons; accepted-work comparison.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>fleet lane (ac055d60427caab99)</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>22</dd></div><div><dt>Plan pages</dt><dd>6, 7, 8, 14, 18, 23</dd></div></dl></div></details><details class="acc-case" id="case-GPU-07" data-case="GPU-07" data-state="NOT RUN"><summary><span class="c-id">GPU-07</span><span class="c-title">Survive sustained thermal and power operation</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P01, P02, P10</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><a href="https://git.igneum.network/igneum-network/igneum/src/branch/master/docs/analysis/class-v6/floor/sm-sparse.md" rel="noopener">record</a></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 21:10 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Run the selected profile on actual reference machines for the P02 soak period.</p><h4>Steps</h4><ol><li>Track wall power, temperatures, clocks, memory and accepted work continuously.</li><li>Inject safe power interruptions, process restarts and normal competing desktop load.</li><li>Check restored settings and compare late-run efficiency with the first stable period.</li></ol><h4>Accept</h4><p>No invalid work or unsafe persistent settings; P02/P10 stability limits hold. Thermal throttling, crashes and recovery time remain in throughput and energy denominators. A crash-free short benchmark cannot substitute for the soak.</p><h4>Evidence the case requires</h4><p>Seven-day time series; crash reports; settings-restoration checks; drift analysis.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>hash lane (a690540514aa453d7)</dd></div><div><dt>Run</dt><dd>team-2026-10-08</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>23</dd></div><div><dt>Plan pages</dt><dd>6, 7, 8, 14, 18, 23</dd></div></dl></div></details><details class="acc-case" id="case-GPU-08" data-case="GPU-08" data-state="NOT RUN"><summary><span class="c-id">GPU-08</span><span class="c-title">Reproduce the full baseline independently</span><span class="c-pri"><span class="lbl">Priority </span>GATE</span><span class="c-prof"><span class="lbl">Profile </span>P02</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>2026-10-08 18:3x UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Three unaffiliated operators receive F0, F2 and F3, including the final miner/prover build.</p><h4>Steps</h4><ol><li>Repeat identical-SKU paired runs with documented meter calibration and environment differences.</li><li>Recompute joules and total cost per accepted work from the shared raw schema.</li><li>Investigate divergence before accepting a pooled headline or uncertainty band.</li></ol><h4>Accept</h4><p>Reproductions meet P02 tolerance and exact correctness. No unexplained divergence or selectively missing low-end cell remains. Report manufactured GPU measurements separately from modelled specialist estimates.</p><h4>Evidence the case requires</h4><p>Three signed reproduction packs; reconciliation report; final baseline table.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Independent reproduction</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>fleet lane (ac055d60427caab99)</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>23</dd></div><div><dt>Plan pages</dt><dd>6, 7, 8, 14, 18, 23</dd></div></dl></div></details></div></div></section><section class="section acc-suite" id="suite-POW"><div class="container"><div class="acc-suite-head"><div class="acc-suite-code"><span class="n">03</span>POW</div><div class="acc-suite-t"><h2>Proof-of-work correctness and coupling</h2><p class="acc-sub">Find semantic disagreements and structural shortcuts before treating a harder-looking program as a stronger defence.</p></div><div class="acc-suite-st"><span class="acc-chip s-fail" data-state="FAIL">FAIL</span></div></div><dl class="acc-facts"><div><dt>Owner</dt><dd>Cryptography + GPU lead</dd></div><div><dt>Gate</dt><dd>G2 / technical readiness <span class="acc-gl"><a href="#gate-G2">G2</a></span></dd></div><div><dt>Fixtures</dt><dd>F0 rule set; F3 independent CPU/GPU oracles; F5 mutation corpus</dd></div><div><dt>Plan pages</dt><dd>7, 9, 10, 23</dd></div></dl><div class="acc-suite-bar"><div class="acc-bar" role="img" aria-label="POW: 8 cases: 0 passed under the standard, 0 running with team evidence, 2 failed, 6 not run, 0 deferred"><span class="seg g-fail" style="flex-grow:2" title="2 FAIL"></span><span class="seg g-notrun" style="flex-grow:6" title="6 NOT RUN"></span></div><span>8 cases: 0 passed under the standard, 0 running with team evidence, 2 failed, 6 not run, 0 deferred</span></div><div class="acc-cases"><div class="acc-cases-h" aria-hidden="true"><span>Case</span><span>Title</span><span>Priority</span><span>Profile</span><span>Status</span><span>Evidence</span><span>Last run</span><span></span></div><details class="acc-case" id="case-POW-01" data-case="POW-01" data-state="NOT RUN"><summary><span class="c-id">POW-01</span><span class="c-title">Match independent execution across every backend</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P01</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 21:10 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Implement an independently written reference evaluator, not a wrapper around the production GPU path.</p><h4>Steps</h4><ol><li>Execute the P01 corpus across every family, boundary seed and supported backend.</li><li>Exercise zero, maximum, sign, shift, rotate, overflow and unaligned-address cases allowed by the spec.</li><li>Minimise every mismatch and rerun it on clean builds.</li></ol><h4>Accept</h4><p>Bit-for-bit agreement for all valid cases and identical rejection for invalid cases. One unexplained mismatch is a blocker. Large sample counts are evidence of testing, not proof that unseen disagreements cannot exist.</p><h4>Evidence the case requires</h4><p>Reference implementation review; seeds/vectors; backend matrix; mismatch archive.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>hash lane (a690540514aa453d7)</dd></div><div><dt>Run</dt><dd>p01-20261008-01</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>24</dd></div><div><dt>Plan pages</dt><dd>7, 9, 10, 23</dd></div></dl></div></details><details class="acc-case" id="case-POW-02" data-case="POW-02" data-state="NOT RUN"><summary><span class="c-id">POW-02</span><span class="c-title">Validate generated programs and index folding</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P01</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 21:38 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Use the frozen grammar, opcode semantics and index-fold rule; include boundary and malformed programs.</p><h4>Steps</h4><ol><li>Enumerate small constrained programs and fuzz the full generator at P01 depth.</li><li>Check bounds, valid dependencies, address distribution and forbidden encodings.</li><li>Compare source-level operations with optimised compiled code for removed or altered work.</li></ol><h4>Accept</h4><p>No accepted program violates semantics, termination or memory bounds. Distribution claims have predeclared tests and effect-size limits; passing randomness checks is not treated as a cryptographic proof.</p><h4>Evidence the case requires</h4><p>Generator/fuzzer logs; reduced counterexamples; disassembly comparison; index tests.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>hash lane (a690540514aa453d7)</dd></div><div><dt>Run</dt><dd>family-gate-20261008b</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>24</dd></div><div><dt>Plan pages</dt><dd>7, 9, 10, 23</dd></div></dl></div></details><details class="acc-case" id="case-POW-03" data-case="POW-03" data-state="FAIL"><summary><span class="c-id">POW-03</span><span class="c-title">Test whether live state is unavoidable</span><span class="c-pri"><span class="lbl">Priority </span>GATE</span><span class="c-prof"><span class="lbl">Profile </span>P03, P04</span><span class="c-st"><span class="acc-chip s-fail" data-state="FAIL">FAIL</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 21:41 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Take the 64-register candidate and the cheapest independently proposed storage organisations.</p><h4>Steps</h4><ol><li>Trace value liveness across dependent reads and final output, distinguishing distinct information from duplicated values.</li><li>Try banking, compression, recomputation, fewer ports and time-multiplexed contexts.</li><li>Quantify the best complete-system cost/throughput trade-off rather than the reference register count.</li></ol><h4>Accept</h4><p>Production selection is supported by measured or physically modelled penalties after these alternatives. G2 requires the P03 improvement; an attractive source-level register count alone does not pass.</p><h4>Evidence the case requires</h4><p>Liveness traces; alternative implementations; Pareto table; reviewer analysis.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Experiment + independent hardware review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>adversary lane (a1a9876a88f5a72fc)</dd></div><div><dt>Run</dt><dd>adversary-20261008-placed-8lane</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>24</dd></div><div><dt>Plan pages</dt><dd>7, 9, 10, 23</dd></div></dl></div></details><details class="acc-case" id="case-POW-04" data-case="POW-04" data-state="NOT RUN"><summary><span class="c-id">POW-04</span><span class="c-title">Evaluate connected-resource restructuring</span><span class="c-pri"><span class="lbl">Priority </span>GATE</span><span class="c-prof"><span class="lbl">Profile </span>P03, P04</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 21:41 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Use a candidate initially matched to baseline instruction count, read count and dataset size.</p><h4>Steps</h4><ol><li>Connect state, addresses, arithmetic and lane communication according to the written hypothesis.</li><li>Measure GPU cost and allow the specialist reviewer to redesign the entire core.</li><li>Repeat on held-out program seeds and compare the worst supported adversary, not only the original design.</li></ol><h4>Accept</h4><p>The selected upgrade meets P03 and improves the adversarial result outside declared uncertainty. A negative experiment remains a negative outcome; adopting a different design requires a new frozen comparison.</p><h4>Evidence the case requires</h4><p>Matched workloads; GPU runs; redesigned core estimates; held-out results.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Controlled experiment</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>adversary lane (a1a9876a88f5a72fc)</dd></div><div><dt>Run</dt><dd>adversary-20261008-placed-8lane</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>25</dd></div><div><dt>Plan pages</dt><dd>7, 9, 10, 23</dd></div></dl></div></details><details class="acc-case" id="case-POW-05" data-case="POW-05" data-state="NOT RUN"><summary><span class="c-id">POW-05</span><span class="c-title">Prevent amortised cheap winning attempts</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P01, P04</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 21:10 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Prepare valid templates, nonces, intermediate-state captures and independent acceptance checks.</p><h4>Steps</h4><ol><li>Vary nonce, payout identity, transactions, roots and other committed fields after expensive work.</li><li>Try replay, precomputation, shared prefixes, partial evaluation and many cheap suffix candidates.</li><li>Price any valid strategy against fresh evaluation; independently review all bindings.</li></ol><h4>Accept</h4><p>Invalid modifications are rejected. Any valid cost-saving strategy is incorporated into ADV and must still meet P04/ECO gates. No unresolved shortcut is hidden behind passing reference vectors.</p><h4>Evidence the case requires</h4><p>Attack implementations; valid/invalid controls; work-cost analysis; binding review.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>pool design seat (a3832b1c3b274b310)</dd></div><div><dt>Run</dt><dd>binding-review-2026-10-08-a05</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>25</dd></div><div><dt>Plan pages</dt><dd>7, 9, 10, 23</dd></div></dl></div></details><details class="acc-case" id="case-POW-06" data-case="POW-06" data-state="NOT RUN"><summary><span class="c-id">POW-06</span><span class="c-title">Bound verifier work and malformed-input cost</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P01, P09</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 19:28 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Use ordinary CPU validators with a manifest-defined resource budget and untrusted submissions.</p><h4>Steps</h4><ol><li>Submit shortest/longest programs, malformed encodings and adversarial memory references.</li><li>Measure verification time, peak memory and work amplification across valid and invalid inputs.</li><li>Sustain the approved hostile request rate while ordinary valid traffic continues.</li></ol><h4>Accept</h4><p>All semantics remain correct and P09 resource budgets hold. Invalid traffic cannot cause unbounded allocation, crashes or disproportionate free work. Rate limits must not replace consensus validation.</p><h4>Evidence the case requires</h4><p>CPU profiles; adversarial corpus; allocation traces; valid-traffic latency.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>hash lane (a690540514aa453d7)</dd></div><div><dt>Run</dt><dd>p01-partb-20261008-01</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>25</dd></div><div><dt>Plan pages</dt><dd>7, 9, 10, 23</dd></div></dl></div></details><details class="acc-case" id="case-POW-07" data-case="POW-07" data-state="FAIL"><summary><span class="c-id">POW-07</span><span class="c-title">Constrain any mixed-resource or FP32 branch</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P00, P01, P03</span><span class="c-st"><span class="acc-chip s-fail" data-state="FAIL">FAIL</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 21:10 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>If this branch is excluded, verify that it is unreachable and not claimed; if included, use a separate frozen candidate.</p><h4>Steps</h4><ol><li>Specify exact rounding, fusion, special values and backend behaviour before compiling.</li><li>Differentially test all supported architectures and allow numerical-domain simplification in the specialist model.</li><li>Include verifier cost and candidate energy in P03/P04, not just arithmetic-unit area.</li></ol><h4>Accept</h4><p>Included branches achieve exact agreed semantics and all hardware budgets. An excluded branch earns no performance credit. No approximate operation or unspecified compiler choice enters consensus.</p><h4>Evidence the case requires</h4><p>Scope decision; semantic specification; vectors; simplified datapath model.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Conditional implementation test</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>hash lane (a690540514aa453d7)</dd></div><div><dt>Run</dt><dd>kills-20261008</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>26</dd></div><div><dt>Plan pages</dt><dd>7, 9, 10, 23</dd></div></dl></div></details><details class="acc-case" id="case-POW-08" data-case="POW-08" data-state="NOT RUN"><summary><span class="c-id">POW-08</span><span class="c-title">Keep rejected mechanisms out of the shipped claim</span><span class="c-pri"><span class="lbl">Priority </span>GATE</span><span class="c-prof"><span class="lbl">Profile </span>P00, P03</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><a href="https://git.igneum.network/igneum-network/igneum/src/branch/master/docs/analysis/class-v6/rows/pow-07-fp32-unreachable.md" rel="noopener">record</a></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:59 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Inventory long programs, select trees, SM gating, wider reads, sealed classes, random epoch lengths, per-tier scoring and VRF draws.</p><h4>Steps</h4><ol><li>Retain their historic negative tests and realistic SRAM instruction-memory control.</li><li>Inspect the release for reintroduction through renamed settings or hidden paths.</li><li>Require a new written hypothesis and complete adversarial retest for any proposed return.</li></ol><h4>Accept</h4><p>Excluded levers remain excluded unless separately approved and retested. Flip-flop instruction-memory area is never presented as the cost of a realistic SRAM implementation.</p><h4>Evidence the case requires</h4><p>Decision register; binary/config scan; negative-control results.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>hash lane (a690540514aa453d7)</dd></div><div><dt>Run</dt><dd>hash-lane-20261008-batch2</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>26</dd></div><div><dt>Plan pages</dt><dd>7, 9, 10, 23</dd></div></dl></div></details></div></div></section><section class="section acc-suite" id="suite-ADV"><div class="container"><div class="acc-suite-head"><div class="acc-suite-code"><span class="n">04</span>ADV</div><div class="acc-suite-t"><h2>Programmable specialist adversaries</h2><p class="acc-sub">Give the opponent permission to adapt, share resources and remain operational; test cost rather than imagined chip death.</p></div><div class="acc-suite-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></div></div><dl class="acc-facts"><div><dt>Owner</dt><dd>Independent hardware team</dd></div><div><dt>Gate</dt><dd>G3 <span class="acc-gl"><a href="#gate-G3">G3</a></span></dd></div><div><dt>Fixtures</dt><dd>F2 reference GPUs; F6 RTL/physical models; all published families</dd></div><div><dt>Plan pages</dt><dd>8, 10, 12, 22, 23</dd></div></dl><div class="acc-suite-bar"><div class="acc-bar" role="img" aria-label="ADV: 8 cases: 0 passed under the standard, 0 running with team evidence, 8 not run, 0 deferred"><span class="seg g-notrun" style="flex-grow:8" title="8 NOT RUN"></span></div><span>8 cases: 0 passed under the standard, 0 running with team evidence, 8 not run, 0 deferred</span></div><div class="acc-cases"><div class="acc-cases-h" aria-hidden="true"><span>Case</span><span>Title</span><span>Priority</span><span>Profile</span><span>Status</span><span>Evidence</span><span>Last run</span><span></span></div><details class="acc-case" id="case-ADV-01" data-case="ADV-01" data-state="NOT RUN"><summary><span class="c-id">ADV-01</span><span class="c-title">Build a multi-family programmable opponent</span><span class="c-pri"><span class="lbl">Priority </span>GATE</span><span class="c-prof"><span class="lbl">Profile </span>P01, P04</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><a href="https://git.igneum.network/igneum-network/igneum/src/branch/master/docs/analysis/class-v6/multi-family-adversary.md" rel="noopener">record</a></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 21:41 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Provide the complete published family bank and future known parameter schedule to the reviewer.</p><h4>Steps</h4><ol><li>Design one programmable architecture that supports all retained families, including firmware and emulation paths.</li><li>Optimise clocks, lanes, ports and pipelines without requiring a graphics-card layout.</li><li>Verify its outputs against POW vectors before measuring any advantage.</li></ol><h4>Accept</h4><p>At least the P04 design diversity is evaluated; every estimated competitive design is functionally validated. Inability of one narrow design to adapt is not evidence that all chips expire.</p><h4>Evidence the case requires</h4><p>Architecture reports; functional simulations; adaptation matrix; reviewer signature.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Independent hardware study</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>adversary lane (a1a9876a88f5a72fc)</dd></div><div><dt>Run</dt><dd>adversary-20261008-placed-8lane</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>27</dd></div><div><dt>Plan pages</dt><dd>8, 10, 12, 22, 23</dd></div></dl></div></details><details class="acc-case" id="case-ADV-02" data-case="ADV-02" data-state="NOT RUN"><summary><span class="c-id">ADV-02</span><span class="c-title">Price shared, reduced and reconstructed memory</span><span class="c-pri"><span class="lbl">Priority </span>GATE</span><span class="c-prof"><span class="lbl">Profile </span>P04</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><a href="https://git.igneum.network/igneum-network/igneum/src/branch/master/docs/analysis/class-v6/multi-family-adversary.md" rel="noopener">record</a></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 21:41 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Allow multiple engines to share a dataset and to store selected fractions rather than a complete per-engine copy.</p><h4>Steps</h4><ol><li>Sweep sharing factors, memory fractions, caches and recomputation depth across many simultaneous hashes.</li><li>Include construction/update amortisation, bandwidth contention and retained state.</li><li>Take the most favourable feasible point for the specialist into the complete-board model.</li></ol><h4>Accept</h4><p>No omitted feasible trade-off materially lowers the accepted cost estimate. Any winning alternative is included in P04 and ECO; capacity alone is not accepted as an energy bound.</p><h4>Evidence the case requires</h4><p>Sweep definitions; energy/bandwidth data; best-feasible envelope; excluded-design reasons.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Model + adversarial implementation</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>adversary lane (a1a9876a88f5a72fc)</dd></div><div><dt>Run</dt><dd>adversary-20261008-placed-8lane</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>27</dd></div><div><dt>Plan pages</dt><dd>8, 10, 12, 22, 23</dd></div></dl></div></details><details class="acc-case" id="case-ADV-03" data-case="ADV-03" data-state="NOT RUN"><summary><span class="c-id">ADV-03</span><span class="c-title">Attack with data-local and hybrid execution</span><span class="c-pri"><span class="lbl">Priority </span>GATE</span><span class="c-prof"><span class="lbl">Profile </span>P04</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><a href="https://git.igneum.network/igneum-network/igneum/src/branch/master/docs/analysis/class-v6/multi-family-adversary.md" rel="noopener">record</a></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 21:41 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Permit distributed memories, state migration and companion CPU/GPU/FPGA components.</p><h4>Steps</h4><ol><li>Compare moving computation, intermediate state or fetched data to each read location.</li><li>Test specialised mining alongside outsourced proof generation rather than assuming one physical GPU does both.</li><li>Include interconnect, host, synchronisation, idle and conversion costs.</li></ol><h4>Accept</h4><p>The cheapest feasible combined system is included in the adversarial envelope and economic model. A worker identity or account is never treated as proof of a single physical device.</p><h4>Evidence the case requires</h4><p>Hybrid architecture diagrams; traffic traces; system cost and energy ledger.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Independent system modelling</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>adversary lane (a1a9876a88f5a72fc)</dd></div><div><dt>Run</dt><dd>adversary-20261008-placed-8lane</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>27</dd></div><div><dt>Plan pages</dt><dd>8, 10, 12, 22, 23</dd></div></dl></div></details><details class="acc-case" id="case-ADV-04" data-case="ADV-04" data-state="NOT RUN"><summary><span class="c-id">ADV-04</span><span class="c-title">Measure profitable selective participation</span><span class="c-pri"><span class="lbl">Priority </span>GATE</span><span class="c-prof"><span class="lbl">Profile </span>P04, P12</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><a href="https://git.igneum.network/igneum-network/igneum/src/branch/master/docs/analysis/class-v6/multi-family-adversary.md" rel="noopener">record</a></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 21:41 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Use all declared families plus held-out generated programs and the protocol difficulty rule.</p><h4>Steps</h4><ol><li>Identify favourable execution paths and add cheap fallbacks for other periods.</li><li>Simulate entry/exit around profitable periods, including idle time, compilation and re-entry costs.</li><li>Evaluate revenue and costs across the full schedule, not just average program energy.</li></ol><h4>Accept</h4><p>Intermittent specialists meet P04/ECO limits when evaluated on full-period economics. A weak tail cannot be concealed by a favourable mean; known valid shortcuts must be priced.</p><h4>Evidence the case requires</h4><p>Per-program advantage distribution; policy simulator; full-period returns.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>adversary lane (a1a9876a88f5a72fc)</dd></div><div><dt>Run</dt><dd>adversary-20261008-placed-8lane</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>28</dd></div><div><dt>Plan pages</dt><dd>8, 10, 12, 22, 23</dd></div></dl></div></details><details class="acc-case" id="case-ADV-05" data-case="ADV-05" data-state="NOT RUN"><summary><span class="c-id">ADV-05</span><span class="c-title">Validate physical and complete-board costs</span><span class="c-pri"><span class="lbl">Priority </span>GATE</span><span class="c-prof"><span class="lbl">Profile </span>P04</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 21:41 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Use feasible process/library assumptions and documented component boundaries; no fabricated foundry access.</p><h4>Steps</h4><ol><li>Model SRAM macros, ports, wiring, clocking, memory PHYs, external memory, host and power conversion.</li><li>Run place-and-route where available; mark unmodelled items as uncertainty rather than zero.</li><li>Compare against a calibrated existing hardware block or equivalent validation case.</li></ol><h4>Accept</h4><p>No decision-critical cost is omitted. Physically unvalidated or proprietary estimates are labelled and independently bounded; synthesis alone cannot earn a manufactured-chip claim.</p><h4>Evidence the case requires</h4><p>Netlist/physical reports; macro assumptions; bill of materials; model calibration.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Independent physical-design review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>k lane (a3c9601a6d4686fe1)</dd></div><div><dt>Run</dt><dd>adversary-20261008-placed-8lane</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>28</dd></div><div><dt>Plan pages</dt><dd>8, 10, 12, 22, 23</dd></div></dl></div></details><details class="acc-case" id="case-ADV-06" data-case="ADV-06" data-state="NOT RUN"><summary><span class="c-id">ADV-06</span><span class="c-title">Separate process advantage from specialisation</span><span class="c-pri"><span class="lbl">Priority </span>GATE</span><span class="c-prof"><span class="lbl">Profile </span>P04, P12</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><a href="https://git.igneum.network/igneum-network/igneum/src/branch/master/docs/analysis/class-v6/floor/shadow-k.md" rel="noopener">record</a></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 21:10 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Evaluate same-node, one-node-ahead and two-node-ahead scenarios with explicit technology definitions.</p><h4>Steps</h4><ol><li>Use independently justified process factors, voltages, memory and packaging assumptions for each design.</li><li>Allow reusable IP and modular revisions; credit GPU improvement consistently.</li><li>Evaluate measurement confidence and model-parameter sensitivity separately.</li></ol><h4>Accept</h4><p>P04 primary limits hold for all competitive-reference cells; two-node futures are reported and pass the predeclared economic stress envelope. A model range is never labelled a statistical confidence interval without justification.</p><h4>Evidence the case requires</h4><p>Node-specific reports; factor provenance; uncertainty and sensitivity tables.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>k lane (a3c9601a6d4686fe1)</dd></div><div><dt>Run</dt><dd>team-2026-10-08</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>28</dd></div><div><dt>Plan pages</dt><dd>8, 10, 12, 22, 23</dd></div></dl></div></details><details class="acc-case" id="case-ADV-07" data-case="ADV-07" data-state="NOT RUN"><summary><span class="c-id">ADV-07</span><span class="c-title">Evaluate lifetime without forced obsolescence</span><span class="c-pri"><span class="lbl">Priority </span>GATE</span><span class="c-prof"><span class="lbl">Profile </span>P04, P12</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 21:41 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Assume multi-year productive survival and known schedule support before testing optional retirement penalties.</p><h4>Steps</h4><ol><li>Price firmware, emulation, memory expansion, companion hardware and incremental redesign.</li><li>Include 1-, 3- and 5-year productive lifetimes plus idle/resale possibilities.</li><li>Grant a retirement credit only if all feasible cheaper adaptations lose competitiveness.</li></ol><h4>Accept</h4><p>The primary case does not require chip death or a fresh full development bill per family. Every retirement credit has a documented adaptation comparison; incompatible and unprofitable are reported separately.</p><h4>Evidence the case requires</h4><p>Lifetime/adaptation ledger; revision costs; feasible-alternative analysis.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>adversary lane (a1a9876a88f5a72fc)</dd></div><div><dt>Run</dt><dd>adversary-20261008-placed-8lane</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>29</dd></div><div><dt>Plan pages</dt><dd>8, 10, 12, 22, 23</dd></div></dl></div></details><details class="acc-case" id="case-ADV-08" data-case="ADV-08" data-state="NOT RUN"><summary><span class="c-id">ADV-08</span><span class="c-title">Independently challenge the best-cost envelope</span><span class="c-pri"><span class="lbl">Priority </span>GATE</span><span class="c-prof"><span class="lbl">Profile </span>P04</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><a href="https://git.igneum.network/igneum-network/igneum/src/branch/master/docs/analysis/class-v6/multi-family-adversary.md" rel="noopener">record</a></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 21:41 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Publish the non-sensitive model and negative results; commission an unaffiliated second hardware reviewer.</p><h4>Steps</h4><ol><li>Reward cheaper valid designs and reproduced shortcuts, not confirmation of the preferred number.</li><li>Re-run P04 with the strongest submitted feasible design, including a low-cost funded-development case.</li><li>Record unresolved modelling disagreements and future technology exclusions.</li></ol><h4>Accept</h4><p>Both reviews accept the scoped envelope or all material disagreements are resolved transparently. Passing supports only evaluated designs and conditions, never a universal bound on all future silicon.</p><h4>Evidence the case requires</h4><p>Two review reports; challenge log; final envelope; unresolved-limit statement.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Independent challenge/review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>adversary lane (a1a9876a88f5a72fc)</dd></div><div><dt>Run</dt><dd>adversary-20261008-placed-8lane</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>29</dd></div><div><dt>Plan pages</dt><dd>8, 10, 12, 22, 23</dd></div></dl></div></details></div></div></section><section class="section acc-suite" id="suite-ROT"><div class="container"><div class="acc-suite-head"><div class="acc-suite-code"><span class="n">05</span>ROT</div><div class="acc-suite-t"><h2>Epochs, seeds and memory transitions</h2><p class="acc-sub">Transitions must agree across nodes and remain usable during failures; crossing a boundary is not a chip-retirement test.</p></div><div class="acc-suite-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></div></div><dl class="acc-facts"><div><dt>Owner</dt><dd>Consensus + GPU leads</dd></div><div><dt>Gate</dt><dd>G5 / G2 <span class="acc-gl"><a href="#gate-G5">G5</a> <a href="#gate-G2">G2</a></span></dd></div><div><dt>Fixtures</dt><dd>F0 activation rules; F4 fault network; F5 historical and boundary vectors</dd></div><div><dt>Plan pages</dt><dd>7, 11, 19, 21</dd></div></dl><div class="acc-suite-bar"><div class="acc-bar" role="img" aria-label="ROT: 8 cases: 0 passed under the standard, 0 running with team evidence, 8 not run, 0 deferred"><span class="seg g-notrun" style="flex-grow:8" title="8 NOT RUN"></span></div><span>8 cases: 0 passed under the standard, 0 running with team evidence, 8 not run, 0 deferred</span></div><div class="acc-cases"><div class="acc-cases-h" aria-hidden="true"><span>Case</span><span>Title</span><span>Priority</span><span>Profile</span><span>Status</span><span>Evidence</span><span>Last run</span><span></span></div><details class="acc-case" id="case-ROT-01" data-case="ROT-01" data-state="NOT RUN"><summary><span class="c-id">ROT-01</span><span class="c-title">Agree across every hourly boundary</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P01, P08</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><a href="https://git.igneum.network/igneum-network/igneum/src/branch/master/docs/analysis/review-2026-10-08-b/f10/emu-test.log" rel="noopener">record</a></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 21:07 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Use real nodes, CPU/GPU miners and independent clocks around successive program boundaries.</p><h4>Steps</h4><ol><li>Submit valid work immediately before, at and after the activation boundary under clock skew and delayed delivery.</li><li>Restart nodes from both sides and replay the same headers.</li><li>Compare selected seed, program, validity, rewards and local wall-clock dependence.</li></ol><h4>Accept</h4><p>All honest nodes derive identical consensus outcomes from the frozen rule. Late work is handled exactly as specified; no wall-clock ambiguity or cross-backend split occurs.</p><h4>Evidence the case requires</h4><p>Boundary vectors; node/miner traces; acceptance and reward matrix.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>fast-time lane (a8be71a0db962911c)</dd></div><div><dt>Run</dt><dd>f10-worker-20261008</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>30</dd></div><div><dt>Plan pages</dt><dd>7, 11, 19, 21</dd></div></dl></div></details><details class="acc-case" id="case-ROT-02" data-case="ROT-02" data-state="NOT RUN"><summary><span class="c-id">ROT-02</span><span class="c-title">Cross weekly and family boundaries together</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P01, P03, P08</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>2026-10-08 18:3x UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Use the retained schedule in F0, including coincident program, parameter and family changes.</p><h4>Steps</h4><ol><li>Run every known family transition and all coincident-boundary combinations on production code.</li><li>Interrupt downloads, compilation and restart during activation; include mixed old/new clients.</li><li>Repeat selected cases under real elapsed time and the remainder under disclosed accelerated time.</li></ol><h4>Accept</h4><p>Deterministic activation, documented old-client behaviour and no unsafe fallback. Compilation/setup costs satisfy P03; accelerated runs are not reported as years of operating history.</p><h4>Evidence the case requires</h4><p>Transition matrix; code-path evidence; compile timing; old-client logs.</p></blockquote><h4>Evidence record of the run</h4><dl class="acc-meta acc-rec"><div><dt>What was run</dt><dd>the class v6 object crossing at its floor on 617cb441</dd></div><div><dt>Run by</dt><dd>fast-time lane (a8be71a0db962911c)</dd></div><div><dt>Under the standard</dt><dd>no: team-run before the standard's procedure; the status is RUNNING until the case is re-run under its steps with the profile's numbers and an independent run where the profile asks one</dd></div><div><dt>Pass or fail today</dt><dd>not judged under the standard yet</dd></div></dl><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>fast-time lane (a8be71a0db962911c)</dd></div><div><dt>Run</dt><dd>team-2026-10-08</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>30</dd></div><div><dt>Plan pages</dt><dd>7, 11, 19, 21</dd></div></dl></div></details><details class="acc-case" id="case-ROT-03" data-case="ROT-03" data-state="NOT RUN"><summary><span class="c-id">ROT-03</span><span class="c-title">Test miner-voted bring-forward governance</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P00, P01, P08</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 21:10 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Freeze eligibility, threshold, windows and activation semantics before testing; do not invent a no-veto rule.</p><h4>Steps</h4><ol><li>Attempt threshold-minus-one, threshold, conflicting proposals, duplicate votes and coalition withholding.</li><li>Partition voters, restore them and test vote-key substitution through pools.</li><li>Verify adoption and refusal behaviour of already running nodes.</li></ol><h4>Accept</h4><p>The actual mechanism enforces F0, with authenticated voting and no conflicting activation. Any coalition capable of blocking or manipulating changes is disclosed; labels such as no veto do not override arithmetic.</p><h4>Evidence the case requires</h4><p>Executable governance model; signed-vote corpus; coalition/partition results.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>node lane (a283f5f0d364ceef0)</dd></div><div><dt>Run</dt><dd>team-2026-10-08</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>30</dd></div><div><dt>Plan pages</dt><dd>7, 11, 19, 21</dd></div></dl></div></details><details class="acc-case" id="case-ROT-04" data-case="ROT-04" data-state="NOT RUN"><summary><span class="c-id">ROT-04</span><span class="c-title">Resist seed selection and faster evaluators</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P00, P01, P08</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:22 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Provide the specified seed pipeline and delay proof implementation plus independently parameterised fast-adversary models.</p><h4>Steps</h4><ol><li>Try withholding candidate seeds, grinding alternatives, replaying delay proofs and biased checkpoint selection.</li><li>Vary adversarial speed advantage and outage duration; trace influence on program choice.</li><li>Validate inputs, parameters and proofs against independent vectors.</li></ol><h4>Accept</h4><p>No invalid seed or proof is accepted; selection advantage stays within the approved threat-model bound. Missing bounds block this gate. A delay mechanism is not credited as generic ASIC resistance.</p><h4>Evidence the case requires</h4><p>Seed/grinding simulations; speed sensitivity; proof vectors; threat-model signoff.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>node lane (a283f5f0d364ceef0)</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>31</dd></div><div><dt>Plan pages</dt><dd>7, 11, 19, 21</dd></div></dl></div></details><details class="acc-case" id="case-ROT-05" data-case="ROT-05" data-state="NOT RUN"><summary><span class="c-id">ROT-05</span><span class="c-title">Continue or pause correctly when finality stops</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P01, P08</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:32 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Stop checkpoint signing while mining continues, then cross seed and family boundaries.</p><h4>Steps</h4><ol><li>Remove the required signing weight and observe the documented fallback or safe pause.</li><li>Prevent access to any founder seed service; restart from persisted state.</li><li>Restore the stated fault assumptions and verify deterministic recovery.</li></ol><h4>Accept</h4><p>Mining/seed behaviour matches F0 without manufacturing certificates or reinterpreting finality. Safety holds during the outage; liveness is required only after its stated assumptions return.</p><h4>Evidence the case requires</h4><p>Fault timeline; seed/certificate history; node-state comparison; recovery log.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>finality lane (aca0f5ed924a2a99b)</dd></div><div><dt>Run</dt><dd>201-7cfa422a-aa0e0f45</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>31</dd></div><div><dt>Plan pages</dt><dd>7, 11, 19, 21</dd></div></dl></div></details><details class="acc-case" id="case-ROT-06" data-case="ROT-06" data-state="NOT RUN"><summary><span class="c-id">ROT-06</span><span class="c-title">Activate datasets without hidden exclusions</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P01, P06</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:32 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Freeze memory sizes, support horizon and sync/update procedure; test all advertised roles.</p><h4>Steps</h4><ol><li>Construct the next dataset while current work remains active; test slow disks, low free memory and interruption.</li><li>Try stale-state/dataset submissions and maliciously expensive state growth where coupling exists.</li><li>Measure data transfer, restart and excluded-card costs before approving progression.</li></ol><h4>Accept</h4><p>No invalid stale work is accepted, no supported card silently fails, and P06 is met. Hardware retirement and sync burden are included in the economic decision, not treated as automatic chip protection.</p><h4>Evidence the case requires</h4><p>Dataset hashes; memory/update traces; stale-work tests; exclusion decision.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>hash lane (a690540514aa453d7)</dd></div><div><dt>Run</dt><dd>201-7cfa422a-aa0e0f45</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>31</dd></div><div><dt>Plan pages</dt><dd>7, 11, 19, 21</dd></div></dl></div></details><details class="acc-case" id="case-ROT-07" data-case="ROT-07" data-state="NOT RUN"><summary><span class="c-id">ROT-07</span><span class="c-title">Ablate redundant rotation layers</span><span class="c-pri"><span class="lbl">Priority </span>GATE</span><span class="c-prof"><span class="lbl">Profile </span>P03, P04</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><a href="https://git.igneum.network/igneum-network/igneum/src/branch/master/docs/analysis/class-v6/family-gate.md" rel="noopener">record</a></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 21:38 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Use matched baseline and ablated variants in the lab; do not change a running public network.</p><h4>Steps</h4><ol><li>Remove each weekly/family component independently and measure adversarial cost, GPU setup and verifier complexity.</li><li>Include favourable-period specialists and all retained known families.</li><li>Keep a layer only with a distinct, independently supported benefit or a documented non-resistance purpose.</li></ol><h4>Accept</h4><p>Every retained layer has explicit justification and full boundary coverage. Redundant complexity is removed or its rationale recorded; the security model does not double-count the same versatility cost.</p><h4>Evidence the case requires</h4><p>Ablation report; decision log; complexity/cost comparison.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>lane D family gate (a07a99a3788566af2)</dd></div><div><dt>Run</dt><dd>family-gate-20261008b</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>32</dd></div><div><dt>Plan pages</dt><dd>7, 11, 19, 21</dd></div></dl></div></details><details class="acc-case" id="case-ROT-08" data-case="ROT-08" data-state="NOT RUN"><summary><span class="c-id">ROT-08</span><span class="c-title">Pass the no-new-rules counterfactual</span><span class="c-pri"><span class="lbl">Priority </span>GATE</span><span class="c-prof"><span class="lbl">Profile </span>P04, P12</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><a href="https://git.igneum.network/igneum-network/igneum/src/branch/master/docs/analysis/class-v6/family-gate.md" rel="noopener">record</a></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 21:38 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Freeze the complete published rule bank and known schedule for the five-year evaluation.</p><h4>Steps</h4><ol><li>Allow a programmable adversary to know and survive all planned changes.</li><li>Remove assumed future emergency instructions and manual retirement actions from the model.</li><li>Run the required ECO scenarios and link them to independent network-transition tests.</li></ol><h4>Accept</h4><p>Competitiveness survives the approved envelope without future rescue assumptions. Any result that needs unannounced changes fails this claim; ordinary bug maintenance is distinguished from anti-chip intervention.</p><h4>Evidence the case requires</h4><p>Frozen-rule model; scenario results; excluded-rescue audit; G5 evidence.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>node lane (a283f5f0d364ceef0)</dd></div><div><dt>Run</dt><dd>family-gate-20261008b</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>32</dd></div><div><dt>Plan pages</dt><dd>7, 11, 19, 21</dd></div></dl></div></details></div></div></section><section class="section acc-suite" id="suite-ECO"><div class="container"><div class="acc-suite-head"><div class="acc-suite-code"><span class="n">06</span>ECO</div><div class="acc-suite-t"><h2>Five-year coexistence economics</h2><p class="acc-sub">Test the world after specialised hardware exists, including new entrants and an already-funded competitor.</p></div><div class="acc-suite-st"><span class="acc-chip s-fail" data-state="FAIL">FAIL</span></div></div><dl class="acc-facts"><div><dt>Owner</dt><dd>Economics lead + independent reviewer</dd></div><div><dt>Gate</dt><dd>G4 <span class="acc-gl"><a href="#gate-G4">G4</a></span></dd></div><div><dt>Fixtures</dt><dd>F6 adversarial costs; F7 scenario model; F2 operator costs</dd></div><div><dt>Plan pages</dt><dd>8, 13, 18, 24, 26</dd></div></dl><div class="acc-suite-bar"><div class="acc-bar" role="img" aria-label="ECO: 8 cases: 0 passed under the standard, 0 running with team evidence, 1 failed, 7 not run, 0 deferred"><span class="seg g-fail" style="flex-grow:1" title="1 FAIL"></span><span class="seg g-notrun" style="flex-grow:7" title="7 NOT RUN"></span></div><span>8 cases: 0 passed under the standard, 0 running with team evidence, 1 failed, 7 not run, 0 deferred</span></div><div class="acc-cases"><div class="acc-cases-h" aria-hidden="true"><span>Case</span><span>Title</span><span>Priority</span><span>Profile</span><span>Status</span><span>Evidence</span><span>Last run</span><span></span></div><details class="acc-case" id="case-ECO-01" data-case="ECO-01" data-state="NOT RUN"><summary><span class="c-id">ECO-01</span><span class="c-title">Reconcile complete cost per accepted work</span><span class="c-pri"><span class="lbl">Priority </span>GATE</span><span class="c-prof"><span class="lbl">Profile </span>P12</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><a href="https://git.igneum.network/igneum-network/igneum/src/branch/master/sim/economy/coexist/README.md" rel="noopener">record</a></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 21:07 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Use benchmark outputs, current-source cost inputs recorded at execution time and separate reference scenarios.</p><h4>Steps</h4><ol><li>Calculate hardware annualisation, electricity, host, cooling/hosting, failures, fees, downtime and residual value.</li><li>Use actual accepted work and independently verify units and period conversions.</li><li>Cross-check formulas using hand-worked fixtures, edge cases and a second implementation.</li></ol><h4>Accept</h4><p>All material costs and rejected-work effects appear once; model totals reconcile to raw inputs. No GPU upgrade is free, development cost is not double-counted, and burn is not mislabelled operator income.</p><h4>Evidence the case requires</h4><p>Versioned model; unit fixtures; independent reconciliation; input sources.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>research lane (ad6a2bd47d4a46105)</dd></div><div><dt>Run</dt><dd>eco05-20261008-02</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>33</dd></div><div><dt>Plan pages</dt><dd>8, 13, 18, 24, 26</dd></div></dl></div></details><details class="acc-case" id="case-ECO-02" data-case="ECO-02" data-state="NOT RUN"><summary><span class="c-id">ECO-02</span><span class="c-title">Separate existing-owner and new-entrant viability</span><span class="c-pri"><span class="lbl">Priority </span>GATE</span><span class="c-prof"><span class="lbl">Profile </span>P12</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><a href="https://git.igneum.network/igneum-network/igneum/src/branch/master/docs/analysis/class-v6/coexistence-model.md" rel="noopener">record</a></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:55 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Use both installed hardware and purchasable replacement hardware in every mandatory cohort.</p><h4>Steps</h4><ol><li>Evaluate marginal operation separately from recovery of a new purchase.</li><li>Stress resale at zero, hardware failures, financing and replacement cycles.</li><li>Report break-even power price and total cost relative to the strongest feasible specialist.</li></ol><h4>Accept</h4><p>P12 competitiveness conditions hold for the predeclared cohorts in required sustainable worlds. Existing-owner profitability cannot substitute for viable new entry; cards outside the envelope remain visible.</p><h4>Evidence the case requires</h4><p>Owner/entrant curves; price-date records; break-even tables; cohort outcomes.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>research lane (ad6a2bd47d4a46105)</dd></div><div><dt>Run</dt><dd>eco-d4-20261008-01</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>33</dd></div><div><dt>Plan pages</dt><dd>8, 13, 18, 24, 26</dd></div></dl></div></details><details class="acc-case" id="case-ECO-03" data-case="ECO-03" data-state="NOT RUN"><summary><span class="c-id">ECO-03</span><span class="c-title">Let the specialist keep its sunk development</span><span class="c-pri"><span class="lbl">Priority </span>GATE</span><span class="c-prof"><span class="lbl">Profile </span>P12</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><a href="https://git.igneum.network/igneum-network/igneum/src/branch/master/docs/analysis/class-v6/coexistence-model.md" rel="noopener">record</a></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:55 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Use three development cases: fully funded elsewhere, source-range low and source-range high.</p><h4>Steps</h4><ol><li>Evaluate private mining, public hardware sales and a hybrid business model.</li><li>Allow shared IP, incremental revisions, multi-year survival and resale where justified.</li><li>Re-evaluate GPU entry after the specialist fleet is already installed.</li></ol><h4>Accept</h4><p>The coexistence claim does not depend on recovering the original chip research bill. Required P12 cases meet the approved envelope even at zero incremental development cost; failures cannot be hidden by the $23M/$340M source thresholds.</p><h4>Evidence the case requires</h4><p>Business-model variants; sunk-cost case; full cash-flow and adaptation records.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>research lane (ad6a2bd47d4a46105)</dd></div><div><dt>Run</dt><dd>eco-d4-20261008-01</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>33</dd></div><div><dt>Plan pages</dt><dd>8, 13, 18, 24, 26</dd></div></dl></div></details><details class="acc-case" id="case-ECO-04" data-case="ECO-04" data-state="NOT RUN"><summary><span class="c-id">ECO-04</span><span class="c-title">Model entry, exit and difficulty response</span><span class="c-pri"><span class="lbl">Priority </span>GATE</span><span class="c-prof"><span class="lbl">Profile </span>P12</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><a href="https://git.igneum.network/igneum-network/igneum/src/branch/master/docs/analysis/class-v6/coexistence-model.md" rel="noopener">record</a></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:55 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Use independently reviewed dynamic operator policies, not fixed market shares.</p><h4>Steps</h4><ol><li>Let agents buy, sell, switch off, re-enter and choose tasks based on declared costs and expected income.</li><li>Apply the actual difficulty/reward rules and test optimistic and adversarial liquidity/capital availability.</li><li>Compare equilibrium and transient outcomes across independent starting conditions.</li></ol><h4>Accept</h4><p>Mandatory worlds satisfy P12 without an imposed GPU share or artificial specialist capacity limit. Concentration, oscillations and excluded regions are reported; model behaviour matches unit and conservation checks.</p><h4>Evidence the case requires</h4><p>Agent policies; sensitivity seeds; market-share paths; independent model review.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>research lane (ad6a2bd47d4a46105)</dd></div><div><dt>Run</dt><dd>eco-d4-20261008-01</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>34</dd></div><div><dt>Plan pages</dt><dd>8, 13, 18, 24, 26</dd></div></dl></div></details><details class="acc-case" id="case-ECO-05" data-case="ECO-05" data-state="FAIL"><summary><span class="c-id">ECO-05</span><span class="c-title">Stress success, contraction and cheap electricity</span><span class="c-pri"><span class="lbl">Priority </span>GATE</span><span class="c-prof"><span class="lbl">Profile </span>P12</span><span class="c-st"><span class="acc-chip s-fail" data-state="FAIL">FAIL</span></span><span class="c-ev"><span class="lbl">Evidence </span><a href="https://git.igneum.network/igneum-network/igneum/src/branch/master/docs/analysis/class-v6/eco-05-results.md" rel="noopener">record</a></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 21:07 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Freeze mandatory scenarios before results: revenue bands, tariff range, lifetimes and demand states.</p><h4>Steps</h4><ol><li>Run the P12 factorial grid plus adversarial combinations selected by the independent reviewer.</li><li>Test a large successful network as well as weak-revenue and heterogeneous-tariff cases.</li><li>Distinguish feasible sustained-entry worlds from collapse scenarios with no rational profitable operator.</li></ol><h4>Accept</h4><p>No small-network or token-appreciation assumption props up the primary claim. Required viable worlds pass the envelope; collapse worlds show honest contraction and safety, not fabricated profits. Failure regions are explicit.</p><h4>Evidence the case requires</h4><p>Scenario register; full result cube; boundary plots; failed-world explanations.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>research lane (ad6a2bd47d4a46105)</dd></div><div><dt>Run</dt><dd>eco05-20261008-02</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>34</dd></div><div><dt>Plan pages</dt><dd>8, 13, 18, 24, 26</dd></div></dl></div></details><details class="acc-case" id="case-ECO-06" data-case="ECO-06" data-state="NOT RUN"><summary><span class="c-id">ECO-06</span><span class="c-title">Fund security and proving as issuance falls</span><span class="c-pri"><span class="lbl">Priority </span>GATE</span><span class="c-prof"><span class="lbl">Profile </span>P12</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><a href="https://git.igneum.network/igneum-network/igneum/src/branch/master/docs/analysis/class-v6/coexistence-model.md" rel="noopener">record</a></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:55 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Use the frozen supply, halving, fee, burn and reward rules rather than source prose assumptions.</p><h4>Steps</h4><ol><li>Reconcile revenue reaching miners, internal provers, developers and burns over the full horizon.</li><li>Test flat/declining fees and no external proving income; separately introduce external demand.</li><li>Calculate capacity and security-provider coverage after each reward transition.</li></ol><h4>Accept</h4><p>Recurring compensation is explicit and internally consistent; mandatory sustainable scenarios meet P12. Burned amounts are never counted as payments, and external operator income is not assumed to fund internal work automatically.</p><h4>Evidence the case requires</h4><p>Issuance/fee ledger; scenario cash flows; funding-shortfall report.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>research lane (ad6a2bd47d4a46105)</dd></div><div><dt>Run</dt><dd>eco-d4-20261008-01</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>34</dd></div><div><dt>Plan pages</dt><dd>8, 13, 18, 24, 26</dd></div></dl></div></details><details class="acc-case" id="case-ECO-07" data-case="ECO-07" data-state="NOT RUN"><summary><span class="c-id">ECO-07</span><span class="c-title">Price memory growth and honest-card displacement</span><span class="c-pri"><span class="lbl">Priority </span>GATE</span><span class="c-prof"><span class="lbl">Profile </span>P06, P12</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><a href="https://git.igneum.network/igneum-network/igneum/src/branch/master/docs/analysis/class-v6/coexistence-model.md" rel="noopener">record</a></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:55 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Use GPU-05 and ROT-06 costs with the cheapest specialist adaptation.</p><h4>Steps</h4><ol><li>For each dataset increment, compare specialist cost increases with excluded cards and lost proving capacity.</li><li>Include ordinary-owner replacement, resale and reloading expenses.</li><li>Run alternate bounded schedules without assigning automatic chip death.</li></ol><h4>Accept</h4><p>The retained schedule meets P06/P12 and has an evidence-backed net competitiveness benefit. A schedule that mainly harms accessible GPUs fails; excluded tiers and mitigations are documented before activation.</p><h4>Evidence the case requires</h4><p>Per-step cost/retention table; alternative schedules; approval record.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>research lane (ad6a2bd47d4a46105)</dd></div><div><dt>Run</dt><dd>eco-d4-20261008-01</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>35</dd></div><div><dt>Plan pages</dt><dd>8, 13, 18, 24, 26</dd></div></dl></div></details><details class="acc-case" id="case-ECO-08" data-case="ECO-08" data-state="NOT RUN"><summary><span class="c-id">ECO-08</span><span class="c-title">Reproduce and adversarially audit the model</span><span class="c-pri"><span class="lbl">Priority </span>GATE</span><span class="c-prof"><span class="lbl">Profile </span>P12</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><a href="https://git.igneum.network/igneum-network/igneum/src/branch/master/sim/economy/coexist/README.md" rel="noopener">record</a></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 21:07 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Give an independent economist or qualified analyst the code, inputs and frozen success criteria.</p><h4>Steps</h4><ol><li>Recalculate required worlds and perturb favourable assumptions against the team.</li><li>Check dependence on discounts, utilisation, capital limits, artificial prices and future upgrades.</li><li>Publish the sensitivity range and state which conclusions are conditional.</li></ol><h4>Accept</h4><p>Material results reproduce, required scenarios pass and no unacknowledged assumption dominates the claim. The model supports a bounded coexistence conclusion, not a percentage probability that no chip will appear.</p><h4>Evidence the case requires</h4><p>Independent report; rerun outputs; model limitations; approved claim envelope.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Independent economic review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>research lane (ad6a2bd47d4a46105)</dd></div><div><dt>Run</dt><dd>eco05-20261008-02</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>35</dd></div><div><dt>Plan pages</dt><dd>8, 13, 18, 24, 26</dd></div></dl></div></details></div></div></section><section class="section acc-suite" id="suite-EVM"><div class="container"><div class="acc-suite-head"><div class="acc-suite-code"><span class="n">07</span>EVM</div><div class="acc-suite-t"><h2>Execution and developer compatibility</h2><p class="acc-sub">Keep familiar applications while making every difference and metering rule explicit and reproducible.</p></div><div class="acc-suite-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></div></div><dl class="acc-facts"><div><dt>Owner</dt><dd>Execution lead + independent implementer</dd></div><div><dt>Gate</dt><dd>Technical readiness</dd></div><div><dt>Fixtures</dt><dd>F0 execution-fork semantics; F5 transactions/contracts; F4 multi-node network</dd></div><div><dt>Plan pages</dt><dd>15, 25, 34, 35, 36, 37</dd></div></dl><div class="acc-suite-bar"><div class="acc-bar" role="img" aria-label="EVM: 8 cases: 0 passed under the standard, 0 running with team evidence, 8 not run, 0 deferred"><span class="seg g-notrun" style="flex-grow:8" title="8 NOT RUN"></span></div><span>8 cases: 0 passed under the standard, 0 running with team evidence, 8 not run, 0 deferred</span></div><div class="acc-cases"><div class="acc-cases-h" aria-hidden="true"><span>Case</span><span>Title</span><span>Priority</span><span>Profile</span><span>Status</span><span>Evidence</span><span>Last run</span><span></span></div><details class="acc-case" id="case-EVM-01" data-case="EVM-01" data-state="NOT RUN"><summary><span class="c-id">EVM-01</span><span class="c-title">Match the selected EVM semantics</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P01, P09</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><a href="https://git.igneum.network/igneum-network/igneum/src/branch/master/docs/build/compatibility.md" rel="noopener">record</a></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 21:10 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Pin the intended execution fork, revm version and all Igneum deviations in F0.</p><h4>Steps</h4><ol><li>Run the applicable upstream execution/state fixtures plus independently written deviation tests.</li><li>Execute identical blocks on multiple nodes and compare roots, receipts, logs, gas and failure outcomes.</li><li>Minimise mismatches and distinguish intended differences from implementation defects.</li></ol><h4>Accept</h4><p>All applicable vectors match; every deviation has a documented test and developer consequence. No claim of universal Ethereum equivalence or Ethereum settlement security is inferred.</p><h4>Evidence the case requires</h4><p>Fixture/version inventory; root/receipt diffs; deviation matrix.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>reference-apps lane (a2060899d2a27d31c)</dd></div><div><dt>Run</dt><dd>team-2026-10-08</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>36</dd></div><div><dt>Plan pages</dt><dd>15, 25, 34, 35, 36, 37</dd></div></dl></div></details><details class="acc-case" id="case-EVM-02" data-case="EVM-02" data-state="NOT RUN"><summary><span class="c-id">EVM-02</span><span class="c-title">Preserve transaction binding and replay protection</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P01</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:32 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Use signed transfers, contract calls and deployment transactions with boundary field values.</p><h4>Steps</h4><ol><li>Alter chain identity, nonce, signature, fee caps and recipient after signing.</li><li>Replay across nodes, forks and distinct test networks; resubmit around reorganisation.</li><li>Check mempool admission and final consensus execution independently.</li></ol><h4>Accept</h4><p>Unauthorised, wrong-network or duplicate spends are rejected according to F0. Valid replacements follow the declared rule; mempool filtering alone is not evidence of consensus enforcement.</p><h4>Evidence the case requires</h4><p>Signed corpus; admission/execution outcomes; account-state reconciliation.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>reference-apps lane (a2060899d2a27d31c)</dd></div><div><dt>Run</dt><dd>201-7cfa422a-aa0e0f45</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>36</dd></div><div><dt>Plan pages</dt><dd>15, 25, 34, 35, 36, 37</dd></div></dl></div></details><details class="acc-case" id="case-EVM-03" data-case="EVM-03" data-state="NOT RUN"><summary><span class="c-id">EVM-03</span><span class="c-title">Test two-dimensional fees and proving limits</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P01, P09</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><a href="https://git.igneum.network/igneum-network/igneum/src/branch/master/tools/reference-apps/compat/results.json" rel="noopener">record</a></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:13 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Freeze fee dimensions, estimator rules, abort behaviour and refund policy.</p><h4>Steps</h4><ol><li>Run workloads near and beyond execution and proving budgets, including state-heavy pathological cases.</li><li>Compare estimated fees with charged fees and validate rollback/receipt status on abort.</li><li>Mutate a block producer to omit or undercharge expensive work.</li></ol><h4>Accept</h4><p>Deterministic metering, charged amounts and aborted state agree across nodes and proofs. Resource bounds hold; fee estimates meet P09 for accepted supported cases. Undercharged invalid blocks cannot bypass consensus.</p><h4>Evidence the case requires</h4><p>Metering traces; fee fixtures; estimator errors; invalid-block rejection.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>reference-apps lane (a2060899d2a27d31c)</dd></div><div><dt>Run</dt><dd>ra-20261008T1744-evm</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>36</dd></div><div><dt>Plan pages</dt><dd>15, 25, 34, 35, 36, 37</dd></div></dl></div></details><details class="acc-case" id="case-EVM-04" data-case="EVM-04" data-state="NOT RUN"><summary><span class="c-id">EVM-04</span><span class="c-title">Exercise block context and randomness assumptions</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P01, P09</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><a href="https://git.igneum.network/igneum-network/igneum/src/branch/master/tools/reference-apps/compat/results.json" rel="noopener">record</a></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:13 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Use contracts sensitive to timestamp, height/context, randomness and ordering.</p><h4>Steps</h4><ol><li>Compare the declared Igneum semantics with developers' documented expectations.</li><li>Test boundary transitions, miner-influenced inputs and adversarial ordering in the isolated network.</li><li>Run dependency reviews for applications using these values for economic decisions.</li></ol><h4>Accept</h4><p>Semantics match F0 and differences are surfaced in compatibility documentation. No source of miner influence is marketed as unbiased randomness; incompatible applications are not included in the compatibility claim.</p><h4>Evidence the case requires</h4><p>Context-contract results; threat notes; compatibility exclusions.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>reference-apps lane (a2060899d2a27d31c)</dd></div><div><dt>Run</dt><dd>ra-20261008T1744-evm</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>37</dd></div><div><dt>Plan pages</dt><dd>15, 25, 34, 35, 36, 37</dd></div></dl></div></details><details class="acc-case" id="case-EVM-05" data-case="EVM-05" data-state="NOT RUN"><summary><span class="c-id">EVM-05</span><span class="c-title">Run representative contract integration journeys</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P01, P09</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><a href="https://git.igneum.network/igneum-network/igneum/src/branch/master/tools/reference-apps/compat/results.json" rel="noopener">record</a></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:13 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Use versioned transfer/token, NFT, multisignature, exchange and upgrade-pattern fixtures where supported.</p><h4>Steps</h4><ol><li>Deploy, initialise, transact, revert and upgrade each contract using ordinary tooling.</li><li>Exercise events, logs, balances, storage and call traces across node restart/reorganisation.</li><li>Compare expected application invariants with native execution and proved results.</li></ol><h4>Accept</h4><p>Supported journeys preserve their stated invariants; all deviations are documented. Example deployment success alone cannot stand in for application-level correctness or financial audit.</p><h4>Evidence the case requires</h4><p>Contract fixture hashes; transaction journeys; invariant and state comparisons.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>reference-apps lane (a2060899d2a27d31c)</dd></div><div><dt>Run</dt><dd>ra-20261008T1744-evm</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>37</dd></div><div><dt>Plan pages</dt><dd>15, 25, 34, 35, 36, 37</dd></div></dl></div></details><details class="acc-case" id="case-EVM-06" data-case="EVM-06" data-state="NOT RUN"><summary><span class="c-id">EVM-06</span><span class="c-title">Validate wallets, RPC and indexers</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P01, P09</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><a href="https://git.igneum.network/igneum-network/igneum/src/branch/master/tools/reference-apps/compat/results.json" rel="noopener">record</a></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:13 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Pin supported RPC methods and response semantics; use normal developer clients and an independent indexer.</p><h4>Steps</h4><ol><li>Test fee estimation, pending/final states, subscriptions, pagination and reconnects.</li><li>Reindex from genesis or the documented trust anchor after pruning and restart.</li><li>Compare logs, receipts and balances with independently validated chain state.</li></ol><h4>Accept</h4><p>No missing/duplicate canonical records; unsupported methods are explicit. UI states distinguish included, executed, proven and finalised. Malformed RPC input cannot crash validators or leak secrets.</p><h4>Evidence the case requires</h4><p>RPC conformance report; reindex comparison; reconnect/edge-case logs.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>reference-apps lane (a2060899d2a27d31c)</dd></div><div><dt>Run</dt><dd>ra-20261008T1744-evm</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>37</dd></div><div><dt>Plan pages</dt><dd>15, 25, 34, 35, 36, 37</dd></div></dl></div></details><details class="acc-case" id="case-EVM-07" data-case="EVM-07" data-state="NOT RUN"><summary><span class="c-id">EVM-07</span><span class="c-title">Handle execution denial-of-service workloads</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P01, P09</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:22 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Create bounded pathological bytecode, calls, state growth, storage and precompile inputs.</p><h4>Steps</h4><ol><li>Measure CPU, memory, disk and proving cost against charged budgets.</li><li>Saturate admission with invalid/expensive requests while valid workloads continue.</li><li>Restart mid-execution and verify atomic state recovery.</li></ol><h4>Accept</h4><p>P09 limits hold with no unbounded free work or divergent rollback. State remains consistent after crash; availability under overload follows the declared admission policy, not silent dropping of accepted transactions.</p><h4>Evidence the case requires</h4><p>Resource profiles; adversarial corpus; state recovery comparisons.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>reference-apps lane (a2060899d2a27d31c)</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>38</dd></div><div><dt>Plan pages</dt><dd>15, 25, 34, 35, 36, 37</dd></div></dl></div></details><details class="acc-case" id="case-EVM-08" data-case="EVM-08" data-state="NOT RUN"><summary><span class="c-id">EVM-08</span><span class="c-title">Verify controlled execution and verifier upgrades</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P01, P08, P09</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:03 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Prepare two authorised versions and malicious, stale or unknown versions.</p><h4>Steps</h4><ol><li>Cross activation with mixed clients, queued transactions and proofs from both versions.</li><li>Bind each accepted proof to the correct execution semantics and program identity.</li><li>Exercise a failed software distribution without altering consensus activation.</li></ol><h4>Accept</h4><p>No unknown or wrong-version execution is accepted. Pre/post-boundary handling is deterministic and documented; software delivery cannot silently redefine transaction semantics or proof acceptance.</p><h4>Evidence the case requires</h4><p>Upgrade vectors; mixed-version traces; manifest/version bindings.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>enforced-proving lane (a6e8f84588b809d62)</dd></div><div><dt>Run</dt><dd>enforced-proving-20261008-01</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>38</dd></div><div><dt>Plan pages</dt><dd>15, 25, 34, 35, 36, 37</dd></div></dl></div></details></div></div></section><section class="section acc-suite" id="suite-ZKP"><div class="container"><div class="acc-suite-head"><div class="acc-suite-code"><span class="n">08</span>ZKP</div><div class="acc-suite-t"><h2>Consensus-enforced proof validity</h2><p class="acc-sub">The validator, not merely the official producer, must reject unauthorised or invalid proof records and rewards.</p></div><div class="acc-suite-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></div></div><dl class="acc-facts"><div><dt>Owner</dt><dd>Proving + protocol leads; independent cryptography review</dd></div><div><dt>Gate</dt><dd>Technical readiness / G5 <span class="acc-gl"><a href="#gate-G5">G5</a></span></dd></div><div><dt>Fixtures</dt><dd>F0 pinned programs/verifiers; F5 valid and hostile proof corpus; unmodified validators</dd></div><div><dt>Plan pages</dt><dd>16, 20, 24, 25, 36, 37</dd></div></dl><div class="acc-suite-bar"><div class="acc-bar" role="img" aria-label="ZKP: 8 cases: 0 passed under the standard, 0 running with team evidence, 8 not run, 0 deferred"><span class="seg g-notrun" style="flex-grow:8" title="8 NOT RUN"></span></div><span>8 cases: 0 passed under the standard, 0 running with team evidence, 8 not run, 0 deferred</span></div><div class="acc-cases"><div class="acc-cases-h" aria-hidden="true"><span>Case</span><span>Title</span><span>Priority</span><span>Profile</span><span>Status</span><span>Evidence</span><span>Last run</span><span></span></div><details class="acc-case" id="case-ZKP-01" data-case="ZKP-01" data-state="NOT RUN"><summary><span class="c-id">ZKP-01</span><span class="c-title">Reject missing and invalid proofs</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P01, P09</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:32 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Start from a native-correct statement and an independently verified valid proof.</p><h4>Steps</h4><ol><li>Submit the statement with no proof, truncated bytes, random bytes and targeted proof mutations using a modified producer.</li><li>Submit the genuine proof as a positive control through ordinary network paths.</li><li>Inspect block acceptance and resulting reward/state on unmodified validators.</li></ol><h4>Accept</h4><p>Every invalid proof record is rejected and earns no reward; valid controls succeed. A producer-side filter is not sufficient. Record rejection semantics exactly as defined by F0.</p><h4>Evidence the case requires</h4><p>Hostile record corpus; validator decisions; before/after balances; positive controls.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>enforced-proving lane (a6e8f84588b809d62)</dd></div><div><dt>Run</dt><dd>201-7cfa422a-aa0e0f45</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>39</dd></div><div><dt>Plan pages</dt><dd>16, 20, 24, 25, 36, 37</dd></div></dl></div></details><details class="acc-case" id="case-ZKP-02" data-case="ZKP-02" data-state="NOT RUN"><summary><span class="c-id">ZKP-02</span><span class="c-title">Bind program, verifier and security parameters</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P01, P09</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:03 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Use valid proofs from authorised and unauthorised programs and parameter sets.</p><h4>Steps</h4><ol><li>Swap program digest, verifier version, security settings and verification key where applicable.</li><li>Attempt downgrade through configuration, serialized metadata or an old node path.</li><li>Test authorised boundary transitions and unsupported future identities.</li></ol><h4>Accept</h4><p>Only explicitly authorised combinations are accepted in the correct epoch. No implicit trust in producer-supplied metadata or lower-security fallback; all accepted settings have scoped soundness review.</p><h4>Evidence the case requires</h4><p>Identity/parameter matrix; rejection traces; cryptographic review.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>enforced-proving lane (a6e8f84588b809d62)</dd></div><div><dt>Run</dt><dd>enforced-proving-20261008-01</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>39</dd></div><div><dt>Plan pages</dt><dd>16, 20, 24, 25, 36, 37</dd></div></dl></div></details><details class="acc-case" id="case-ZKP-03" data-case="ZKP-03" data-state="NOT RUN"><summary><span class="c-id">ZKP-03</span><span class="c-title">Bind network, epoch, job and state roots</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P01</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:32 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Prepare valid proofs for distinct chains, epochs, jobs and initial/final states.</p><h4>Steps</h4><ol><li>Replay each proof under another network, job, epoch, shard range or state commitment.</li><li>Alter public inputs while retaining the proof and test valid-but-wrong-context statements.</li><li>Check duplicated and reordered records across forks and replayed sync data.</li></ol><h4>Accept</h4><p>Every misbound proof is rejected; valid authorised replays follow only explicitly allowed semantics and never create extra rewards. Native reexecution cannot conceal missing proof-context binding.</p><h4>Evidence the case requires</h4><p>Binding matrix; public-input hashes; replay traces; reward reconciliation.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>enforced-proving lane (a6e8f84588b809d62)</dd></div><div><dt>Run</dt><dd>201-7cfa422a-aa0e0f45</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>39</dd></div><div><dt>Plan pages</dt><dd>16, 20, 24, 25, 36, 37</dd></div></dl></div></details><details class="acc-case" id="case-ZKP-04" data-case="ZKP-04" data-state="NOT RUN"><summary><span class="c-id">ZKP-04</span><span class="c-title">Prevent reward and payout substitution</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P01</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:03 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Use proofs that commit to authorisation and all reward-relevant fields required by F0.</p><h4>Steps</h4><ol><li>Alter payout key, amount, beneficiary, source work or fee allocation independently.</li><li>Supply correct execution over malicious producer-provided consensus/reward inputs.</li><li>Compare consensus-derived rewards with the proved/publicly authenticated derivation.</li></ol><h4>Accept</h4><p>Unauthorised payout changes and incorrect consensus inputs are rejected; no statement accepted merely because execution over supplied inputs is internally correct. Legitimate authorisations are preserved.</p><h4>Evidence the case requires</h4><p>Mutation cases; reward derivation trace; signature/proof binding review.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>enforced-proving lane (a6e8f84588b809d62)</dd></div><div><dt>Run</dt><dd>enforced-proving-20261008-01</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>40</dd></div><div><dt>Plan pages</dt><dd>16, 20, 24, 25, 36, 37</dd></div></dl></div></details><details class="acc-case" id="case-ZKP-05" data-case="ZKP-05" data-state="NOT RUN"><summary><span class="c-id">ZKP-05</span><span class="c-title">Make proof payment idempotent across races</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P01</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:03 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Use competing provers submitting valid results for the same work and simulate retries/reorganisations.</p><h4>Steps</h4><ol><li>Submit simultaneous duplicates, reordered receipts and repeated messages after disconnects.</li><li>Crash validators between validation and reward application, then recover.</li><li>Reconcile canonical payouts against the exact F0 duplicate policy.</li></ol><h4>Accept</h4><p>Only the authorised total payment is made; no double payout, lost accepted entitlement or fork-retained balance. Transactions and payout records recover atomically.</p><h4>Evidence the case requires</h4><p>Concurrency schedule; canonical payment ledger; crash/recovery evidence.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>enforced-proving lane (a6e8f84588b809d62)</dd></div><div><dt>Run</dt><dd>enforced-proving-20261008-01</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>40</dd></div><div><dt>Plan pages</dt><dd>16, 20, 24, 25, 36, 37</dd></div></dl></div></details><details class="acc-case" id="case-ZKP-06" data-case="ZKP-06" data-state="NOT RUN"><summary><span class="c-id">ZKP-06</span><span class="c-title">Verify aggregation coverage and completeness</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P01, P09</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:32 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Build valid multi-shard workloads plus omitted, duplicated, overlapping and misordered shard sets.</p><h4>Steps</h4><ol><li>Attempt an aggregate with a correct outer proof but wrong coverage/public-input construction.</li><li>Alter shard ranges, roots and aggregation-program identity.</li><li>Verify native execution, aggregate validity and coverage commitments independently.</li></ol><h4>Accept</h4><p>Only complete, correctly ordered authorised coverage is accepted. No valid proof of the wrong computation becomes an accepted chain result; aggregation failures do not fabricate successful delivery.</p><h4>Evidence the case requires</h4><p>Coverage corpus; aggregate/public-input verification; rejection ledger.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>enforced-proving lane (a6e8f84588b809d62)</dd></div><div><dt>Run</dt><dd>201-7cfa422a-aa0e0f45</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>40</dd></div><div><dt>Plan pages</dt><dd>16, 20, 24, 25, 36, 37</dd></div></dl></div></details><details class="acc-case" id="case-ZKP-07" data-case="ZKP-07" data-state="NOT RUN"><summary><span class="c-id">ZKP-07</span><span class="c-title">Review soundness and verifier resource limits</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P01, P09</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>2026-10-08 18:3x UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Provide proof-system code, parameters, patches and the pinned verification path to an independent specialist.</p><h4>Steps</h4><ol><li>Review soundness assumptions, parameter margins and consequences of performance patches.</li><li>Fuzz deserialization and adversarial proofs; measure verification CPU and memory under load.</li><li>Cross-check an independent verifier or reference path and test crash containment.</li></ol><h4>Accept</h4><p>P09 review and resource requirements pass with no unresolved critical/high finding. Random proof rejection counts are not described as evidence of a particular cryptographic security level.</p><h4>Evidence the case requires</h4><p>Scoped soundness review; parameter sheet; fuzzer corpus; verifier profiles.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Independent cryptographic review + testing</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>enforced-proving lane (a6e8f84588b809d62)</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>41</dd></div><div><dt>Plan pages</dt><dd>16, 20, 24, 25, 36, 37</dd></div></dl></div></details><details class="acc-case" id="case-ZKP-08" data-case="ZKP-08" data-state="NOT RUN"><summary><span class="c-id">ZKP-08</span><span class="c-title">Preserve authority and audit all acceptance paths</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P01, P07, P08</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:03 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Inspect block import, sync, RPC, light verification, database restoration and fast paths.</p><h4>Steps</h4><ol><li>Try bypassing validation via each path with a proof rejected by the normal path.</li><li>Remove the dominant prover/aggregator and have independent replacements process available inputs.</li><li>Attempt to use proof-production status as ordering, voting or finality authority.</li></ol><h4>Accept</h4><p>No bypass accepts invalid work; proofs alone confer no unauthorised consensus control. Replacement and pause behaviour meet F0/P07/P08 without privileged keys or a trusted aggregator shortcut.</p><h4>Evidence the case requires</h4><p>Path coverage report; bypass corpus; replacement run; authority checks.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>enforced-proving lane (a6e8f84588b809d62)</dd></div><div><dt>Run</dt><dd>enforced-proving-20261008-01</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>41</dd></div><div><dt>Plan pages</dt><dd>16, 20, 24, 25, 36, 37</dd></div></dl></div></details></div></div></section><section class="section acc-suite" id="suite-CAP"><div class="container"><div class="acc-suite-head"><div class="acc-suite-code"><span class="n">09</span>CAP</div><div class="acc-suite-t"><h2>Sustained proving and delivery</h2><p class="acc-sub">A correct fast shard is only one stage; capacity, latency, payment and retries must work together.</p></div><div class="acc-suite-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></div></div><dl class="acc-facts"><div><dt>Owner</dt><dd>Proving lead + independent operators</dd></div><div><dt>Gate</dt><dd>Technical readiness / commercial track</dd></div><div><dt>Fixtures</dt><dd>F3 meaningful workload catalogue; F4 network; F8 external job harness</dd></div><div><dt>Plan pages</dt><dd>17, 18, 24, 25</dd></div></dl><div class="acc-suite-bar"><div class="acc-bar" role="img" aria-label="CAP: 8 cases: 0 passed under the standard, 0 running with team evidence, 8 not run, 0 deferred"><span class="seg g-notrun" style="flex-grow:8" title="8 NOT RUN"></span></div><span>8 cases: 0 passed under the standard, 0 running with team evidence, 8 not run, 0 deferred</span></div><div class="acc-cases"><div class="acc-cases-h" aria-hidden="true"><span>Case</span><span>Title</span><span>Priority</span><span>Profile</span><span>Status</span><span>Evidence</span><span>Last run</span><span></span></div><details class="acc-case" id="case-CAP-01" data-case="CAP-01" data-state="NOT RUN"><summary><span class="c-id">CAP-01</span><span class="c-title">Reproduce the historical consumer-shard result</span><span class="c-pri"><span class="lbl">Priority </span>GATE</span><span class="c-prof"><span class="lbl">Profile </span>P02, P07</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:22 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Recover the exact source-era workload/build if available; keep it separate from the release-candidate workload.</p><h4>Steps</h4><ol><li>Attempt independent reproduction of the 4,717,439-cycle workload and reported 3060/4060/4070 results.</li><li>Record proof format, memory, energy, host and whether aggregation/compression are included.</li><li>Repeat on the final release and label all configuration changes.</li></ol><h4>Accept</h4><p>Historical figures are either reproduced within P02 tolerance or corrected/labelled non-reproduced. Release acceptance uses the current complete workload, never an unmatched historical time or a smaller substituted shard.</p><h4>Evidence the case requires</h4><p>Historical/current manifests; proof verification; timing and memory records.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>fleet lane (ac055d60427caab99)</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>42</dd></div><div><dt>Plan pages</dt><dd>17, 18, 24, 25</dd></div></dl></div></details><details class="acc-case" id="case-CAP-02" data-case="CAP-02" data-state="NOT RUN"><summary><span class="c-id">CAP-02</span><span class="c-title">Prove on the actual mining configuration</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P01, P06, P07</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:22 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Use final dataset sizes, registers, clocks, drivers and proof pipeline on every advertised proving tier.</p><h4>Steps</h4><ol><li>Run mining alone, proving alone, concurrent execution and supported time-sharing.</li><li>Measure wall energy, memory headroom, reloads, proof latency and forgone accepted mining work.</li><li>Induce memory pressure and GPU task failure without losing wallet control.</li></ol><h4>Accept</h4><p>Every advertised mode completes correctly and meets P06/P07. Net output includes opportunity cost; unsupported concurrency is not claimed. Mining-only vendor support remains separately labelled.</p><h4>Evidence the case requires</h4><p>Four-mode results; OOM/failure logs; memory and opportunity-cost ledger.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>fleet lane (ac055d60427caab99)</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>42</dd></div><div><dt>Plan pages</dt><dd>17, 18, 24, 25</dd></div></dl></div></details><details class="acc-case" id="case-CAP-03" data-case="CAP-03" data-state="NOT RUN"><summary><span class="c-id">CAP-03</span><span class="c-title">Measure the entire request-to-payment path</span><span class="c-pri"><span class="lbl">Priority </span>GATE</span><span class="c-prof"><span class="lbl">Profile </span>P07</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:22 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Assign a unique job ID and immutable timestamps to every stage of F3/F8 jobs.</p><h4>Steps</h4><ol><li>Record request, input availability, assignment, execution, shard proof, aggregation, verification, delivery and payment.</li><li>Compare monotonic elapsed time with any protocol/DAA clock and document their relationship.</li><li>Reconcile failed, censored, retried and abandoned jobs with the original request denominator.</li></ol><h4>Accept</h4><p>No hidden stage or missing job; latency distributions and cost cover the complete path. Delivery, finality and payment are reported separately; protocol seconds are not silently relabelled wall-clock seconds.</p><h4>Evidence the case requires</h4><p>Stage event ledger; clock calibration; end-to-end latency/cost report.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>fleet lane (ac055d60427caab99)</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>42</dd></div><div><dt>Plan pages</dt><dd>17, 18, 24, 25</dd></div></dl></div></details><details class="acc-case" id="case-CAP-04" data-case="CAP-04" data-state="NOT RUN"><summary><span class="c-id">CAP-04</span><span class="c-title">Sustain meaningful load without queue growth</span><span class="c-pri"><span class="lbl">Priority </span>GATE</span><span class="c-prof"><span class="lbl">Profile </span>P07</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:22 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Freeze W: payload mix, input sizes, execution work and per-hour demand; prohibit tiny-workload substitution.</p><h4>Steps</h4><ol><li>Run 72 hours at W and a separate 24 hours at 1.2W on the declared fleet.</li><li>Measure arrival/completion counts, backlog trend, oldest-job age, deadlines and all retries.</li><li>Use held-out workloads and an independent observer to detect discarded or delayed requests.</li></ol><h4>Accept</h4><p>P07 completion, tail-latency and bounded-backlog criteria hold. Capacity is stated for the tested W/fleet, not as universal TPS. A queue that grows indefinitely or shrinks through silent loss fails.</p><h4>Evidence the case requires</h4><p>Request/completion reconciliation; backlog series; held-out results; observer report.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>fleet lane (ac055d60427caab99)</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>43</dd></div><div><dt>Plan pages</dt><dd>17, 18, 24, 25</dd></div></dl></div></details><details class="acc-case" id="case-CAP-05" data-case="CAP-05" data-state="NOT RUN"><summary><span class="c-id">CAP-05</span><span class="c-title">Overload and recover without false acceptance</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P01, P07</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:22 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Start at W and inject 2W for 15 minutes with valid and invalid jobs, then return to W.</p><h4>Steps</h4><ol><li>Observe admission, explicit backpressure, reservations and deadline estimates.</li><li>Track accepted jobs to valid completion or the pre-agreed failure/refund outcome.</li><li>Measure recovery time and ensure ordinary users are not silently starved.</li></ol><h4>Accept</h4><p>P07 overload policy and recovery limits hold; no accepted job vanishes or earns an invalid reward. Rejected demand is reported separately from delivery success, preventing denominator manipulation.</p><h4>Evidence the case requires</h4><p>Overload timeline; admission/refund logs; backlog-drain proof.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>fleet lane (ac055d60427caab99)</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>43</dd></div><div><dt>Plan pages</dt><dd>17, 18, 24, 25</dd></div></dl></div></details><details class="acc-case" id="case-CAP-06" data-case="CAP-06" data-state="NOT RUN"><summary><span class="c-id">CAP-06</span><span class="c-title">Calibrate assignment windows to paid completion</span><span class="c-pri"><span class="lbl">Priority </span>GATE</span><span class="c-prof"><span class="lbl">Profile </span>P07, P12</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:22 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Use a heterogeneous proving fleet, including the slowest advertised consumer tier.</p><h4>Steps</h4><ol><li>Measure actual completion distributions with network delay, competing load and failed attempts.</li><li>Test the chosen exclusive window, open claiming and faster challengers after expiry.</li><li>Compare assignment frequency, paid completions and wasted work by tier.</li></ol><h4>Accept</h4><p>P07 fairness and wasted-work limits hold for advertised tiers. A provisional 10-DAA-second window is not treated as approved. Fair assignment counts alone cannot pass; payment outcomes and operator margins matter.</p><h4>Evidence the case requires</h4><p>Window sweep; paid-completion distribution; wasted-work and margin report.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>fleet lane (ac055d60427caab99)</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>43</dd></div><div><dt>Plan pages</dt><dd>17, 18, 24, 25</dd></div></dl></div></details><details class="acc-case" id="case-CAP-07" data-case="CAP-07" data-state="NOT RUN"><summary><span class="c-id">CAP-07</span><span class="c-title">Reassign work when inputs or providers disappear</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P01, P07, P08</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:22 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Remove input providers, assigned provers and the dominant aggregator independently and together.</p><h4>Steps</h4><ol><li>Have replacement operators retrieve authenticated inputs without founder files.</li><li>Retry expired assignments while preserving idempotent reward and customer outcomes.</li><li>Restore providers and test late submissions racing with replacements.</li></ol><h4>Accept</h4><p>P07/P08 replacement deadlines hold when availability assumptions permit. Otherwise a truthful bounded pause/refund occurs; no fake proof, double payment or hidden privileged input source is used.</p><h4>Evidence the case requires</h4><p>Failure schedule; input hashes; reassignment and payout ledger; recovery trace.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>fleet lane (ac055d60427caab99)</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>44</dd></div><div><dt>Plan pages</dt><dd>17, 18, 24, 25</dd></div></dl></div></details><details class="acc-case" id="case-CAP-08" data-case="CAP-08" data-state="NOT RUN"><summary><span class="c-id">CAP-08</span><span class="c-title">Deliver customer-verifiable output at scale</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P01, P07, P14</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:22 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Run the external workload using a customer-controlled verifier and independently operated workers.</p><h4>Steps</h4><ol><li>Verify every delivered proof against the contracted program and input commitment.</li><li>Reject wrong-format, stale and partial deliveries; test customer retry and delivery failure.</li><li>Reconcile delivery, acceptance, payment and refund records without exposing private inputs publicly.</li></ol><h4>Accept</h4><p>P07 delivery performance and exact validity hold. Payment depends on the contracted correct result; a valid proof for the wrong job is not a successful delivery.</p><h4>Evidence the case requires</h4><p>Customer verification log; proof-format contract; settlement reconciliation.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>fleet lane (ac055d60427caab99)</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>44</dd></div><div><dt>Plan pages</dt><dd>17, 18, 24, 25</dd></div></dl></div></details></div></div></section><section class="section acc-suite" id="suite-INC"><div class="container"><div class="acc-suite-head"><div class="acc-suite-code"><span class="n">10</span>INC</div><div class="acc-suite-t"><h2>Rewards, incentives and selfish operators</h2><p class="acc-sub">Assume operators optimise their own returns. Do not depend on the official client choosing a less profitable task.</p></div><div class="acc-suite-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></div></div><dl class="acc-facts"><div><dt>Owner</dt><dd>Protocol economics + proving leads</dd></div><div><dt>Gate</dt><dd>G4 / G5 <span class="acc-gl"><a href="#gate-G4">G4</a> <a href="#gate-G5">G5</a></span></dd></div><div><dt>Fixtures</dt><dd>F0 fee/reward rules; F4 adversarial operators; F7 incentive models</dd></div><div><dt>Plan pages</dt><dd>13, 16, 17, 18, 24, 26</dd></div></dl><div class="acc-suite-bar"><div class="acc-bar" role="img" aria-label="INC: 8 cases: 0 passed under the standard, 0 running with team evidence, 8 not run, 0 deferred"><span class="seg g-notrun" style="flex-grow:8" title="8 NOT RUN"></span></div><span>8 cases: 0 passed under the standard, 0 running with team evidence, 8 not run, 0 deferred</span></div><div class="acc-cases"><div class="acc-cases-h" aria-hidden="true"><span>Case</span><span>Title</span><span>Priority</span><span>Profile</span><span>Status</span><span>Evidence</span><span>Last run</span><span></span></div><details class="acc-case" id="case-INC-01" data-case="INC-01" data-state="NOT RUN"><summary><span class="c-id">INC-01</span><span class="c-title">Reconcile issuance, fees, burns and recipients</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P01, P12</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:32 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Use a deterministic short chain containing all reward types, fee paths and rounding cases.</p><h4>Steps</h4><ol><li>Calculate balances, total supply changes, burns and distributions independently.</li><li>Execute identical blocks natively and through the proving path.</li><li>Test zero, minimum, maximum and transition-boundary values plus malformed producer accounting.</li></ol><h4>Accept</h4><p>Conservation and recipient rules match F0 exactly; no inflation, rounding leakage or duplicate reward. Fee-table and prose discrepancies are resolved before the run, not guessed by the tester.</p><h4>Evidence the case requires</h4><p>Independent accounting ledger; balance/supply diffs; boundary vectors.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>enforced-proving lane (a6e8f84588b809d62)</dd></div><div><dt>Run</dt><dd>201-7cfa422a-aa0e0f45</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>45</dd></div><div><dt>Plan pages</dt><dd>13, 16, 17, 18, 24, 26</dd></div></dl></div></details><details class="acc-case" id="case-INC-02" data-case="INC-02" data-state="NOT RUN"><summary><span class="c-id">INC-02</span><span class="c-title">Keep revenue streams and claims separate</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P01, P12, P14</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><a href="https://git.igneum.network/igneum-network/igneum/src/branch/master/docs/analysis/class-v6/coexistence-model.md" rel="noopener">record</a></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:55 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Prepare jobs and blocks producing mining income, internal proof rewards and external payments.</p><h4>Steps</h4><ol><li>Trace money from source to operator, protocol, developer and any burn.</li><li>Compare node records, settlement records and Ember displays.</li><li>Attempt to classify testnet rewards, reimbursed purchases or token appreciation as external customer revenue.</li></ol><h4>Accept</h4><p>Every stream reconciles and is labelled correctly. No double-counted revenue or fabricated protocol demand; mining subsidy and external service income remain distinct in dashboards and ECO.</p><h4>Evidence the case requires</h4><p>Money-flow register; UI reconciliation; rejected classifications.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>research lane (ad6a2bd47d4a46105)</dd></div><div><dt>Run</dt><dd>eco-d4-20261008-01</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>45</dd></div><div><dt>Plan pages</dt><dd>13, 16, 17, 18, 24, 26</dd></div></dl></div></details><details class="acc-case" id="case-INC-03" data-case="INC-03" data-state="NOT RUN"><summary><span class="c-id">INC-03</span><span class="c-title">Let a modified client choose the most profitable task</span><span class="c-pri"><span class="lbl">Priority </span>GATE</span><span class="c-prof"><span class="lbl">Profile </span>P07, P12</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><a href="https://git.igneum.network/igneum-network/igneum/src/branch/master/docs/analysis/class-v6/coexistence-model.md" rel="noopener">record</a></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:55 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Permit independent schedulers to mine, prove internally, prove externally or switch off.</p><h4>Steps</h4><ol><li>Publish common costs and vary relative task rewards, memory pressure and switching costs.</li><li>Run clients that ignore the official scheduling recommendation.</li><li>Measure realised operator margin, internal capacity and network progress.</li></ol><h4>Accept</h4><p>Required P12 sustainable worlds maintain paid essential capacity without compelled altruism. Profitability and availability are based on realised outcomes, including switching and wasted work.</p><h4>Evidence the case requires</h4><p>Scheduler source/policies; switching traces; capacity and margin series.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>research lane (ad6a2bd47d4a46105)</dd></div><div><dt>Run</dt><dd>eco-d4-20261008-01</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>45</dd></div><div><dt>Plan pages</dt><dd>13, 16, 17, 18, 24, 26</dd></div></dl></div></details><details class="acc-case" id="case-INC-04" data-case="INC-04" data-state="NOT RUN"><summary><span class="c-id">INC-04</span><span class="c-title">Survive external-demand spikes and token declines</span><span class="c-pri"><span class="lbl">Priority </span>GATE</span><span class="c-prof"><span class="lbl">Profile </span>P07, P08, P12</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><a href="https://git.igneum.network/igneum-network/igneum/src/branch/master/docs/analysis/class-v6/coexistence-model.md" rel="noopener">record</a></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:55 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Use F7 scenarios with 10x external job offers and token-denominated mining-income shocks.</p><h4>Steps</h4><ol><li>Allow miners/provers to switch freely under the declared reward and difficulty rules.</li><li>Observe hash participation, proof backlog, fees and recovery without an administrator.</li><li>Repeat with external demand dropping to zero and with a dominant operator withdrawn.</li></ol><h4>Accept</h4><p>Mandatory viable worlds meet P07/P12; stressed nonviable worlds fail or pause safely with truthful status. No emergency rule, fabricated demand or unofficial subsidy is inserted to force a pass.</p><h4>Evidence the case requires</h4><p>Shock timeline; fee/hash/capacity paths; failure-region report.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>research lane (ad6a2bd47d4a46105)</dd></div><div><dt>Run</dt><dd>eco-d4-20261008-01</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>46</dd></div><div><dt>Plan pages</dt><dd>13, 16, 17, 18, 24, 26</dd></div></dl></div></details><details class="acc-case" id="case-INC-05" data-case="INC-05" data-state="NOT RUN"><summary><span class="c-id">INC-05</span><span class="c-title">Contain job reservation and identity-splitting abuse</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P01, P07, P09</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:22 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Freeze the actual assignment/payment mechanism; do not assume unimplemented collateral or identity controls.</p><h4>Steps</h4><ol><li>Create many worker identities, reserve jobs, withhold proofs and submit late results.</li><li>Attempt free option-taking, duplicate work rewards and displacement of honest assignments.</li><li>Price attacker costs and observe honest completion under the approved abuse load.</li></ol><h4>Accept</h4><p>F0 rules and P07 service limits hold under the declared adversary. Identity splitting does not create unauthorised rewards or control; any unmitigated starvation path blocks the permissionless-service claim.</p><h4>Evidence the case requires</h4><p>Attack clients; assignment trace; cost-to-disrupt analysis; honest-user outcomes.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>enforced-proving lane (a6e8f84588b809d62)</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>46</dd></div><div><dt>Plan pages</dt><dd>13, 16, 17, 18, 24, 26</dd></div></dl></div></details><details class="acc-case" id="case-INC-06" data-case="INC-06" data-state="NOT RUN"><summary><span class="c-id">INC-06</span><span class="c-title">Test difficulty and timestamp manipulation</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P01, P08, P12</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:22 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Use the actual adjustment algorithm and consensus timestamp rule with independent miners.</p><h4>Steps</h4><ol><li>Inject large hashrate arrivals/departures, periodic selective mining and boundary-timed bursts.</li><li>Try allowed and invalid timestamp skew, withheld blocks and replayed work.</li><li>Observe block intervals, reward allocation and recovery after hashrate stabilises.</li></ol><h4>Accept</h4><p>Invalid inputs are rejected; valid adversarial strategies remain within F0/P08 bounds and are priced in ECO. No unexplained reward amplification, permanent stall or conflicting accepted work.</p><h4>Evidence the case requires</h4><p>Difficulty trace; timestamp corpus; revenue analysis; independent rule review.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>research lane (ad6a2bd47d4a46105)</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>46</dd></div><div><dt>Plan pages</dt><dd>13, 16, 17, 18, 24, 26</dd></div></dl></div></details><details class="acc-case" id="case-INC-07" data-case="INC-07" data-state="NOT RUN"><summary><span class="c-id">INC-07</span><span class="c-title">Resist self-dealing fees and fake proving demand</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P01, P12, P14</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:22 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Use self-funded operators and related customer identities in the isolated economic model/network.</p><h4>Steps</h4><ol><li>Cycle funds through jobs, tips, developer shares and rebates to seek net reward extraction.</li><li>Attempt to inflate external-demand metrics without genuine unrelated customer expenditure.</li><li>Reconcile all counterparties and net cash contribution rather than gross transaction volume.</li></ol><h4>Accept</h4><p>No unauthorised subsidy extraction or metric inflation passes. Related-party volume is disclosed/excluded from P14; net external cash and legitimate protocol incentives are reported separately.</p><h4>Evidence the case requires</h4><p>Circular-flow tests; ownership/conflict review; net-cash reconciliation.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>enforced-proving lane (a6e8f84588b809d62)</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>47</dd></div><div><dt>Plan pages</dt><dd>13, 16, 17, 18, 24, 26</dd></div></dl></div></details><details class="acc-case" id="case-INC-08" data-case="INC-08" data-state="NOT RUN"><summary><span class="c-id">INC-08</span><span class="c-title">Quantify provider and supplier failure concentration</span><span class="c-pri"><span class="lbl">Priority </span>GATE</span><span class="c-prof"><span class="lbl">Profile </span>P08, P11, P12</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><a href="https://git.igneum.network/igneum-network/igneum/src/branch/master/docs/analysis/class-v6/coexistence-model.md" rel="noopener">record</a></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:55 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Model control of hashing, signing, proving, aggregation and hardware supply separately.</p><h4>Steps</h4><ol><li>Remove each largest operational dependency and combine correlated failures.</li><li>Measure replacement cost/time and whether essential roles share hidden ownership.</li><li>Compare results with the approved fault model and no-rescue exercise.</li></ol><h4>Accept</h4><p>No hidden single dependency defeats the claimed independence; within-tolerance withdrawals recover under P08/P11. Hardware supply concentration is disclosed without equating vendor sales to operator voting control.</p><h4>Evidence the case requires</h4><p>Role/ownership map; dependency removals; recovery and concentration report.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>research lane (ad6a2bd47d4a46105)</dd></div><div><dt>Run</dt><dd>eco-d4-20261008-01</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>47</dd></div><div><dt>Plan pages</dt><dd>13, 16, 17, 18, 24, 26</dd></div></dl></div></details></div></div></section><section class="section acc-suite" id="suite-FIN"><div class="container"><div class="acc-suite-head"><div class="acc-suite-code"><span class="n">11</span>FIN</div><div class="acc-suite-t"><h2>Consensus safety and recovery</h2><p class="acc-sub">Test safety under the stated fault bounds. Demand liveness only when synchrony and participation assumptions actually hold.</p></div><div class="acc-suite-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></div></div><dl class="acc-facts"><div><dt>Owner</dt><dd>Consensus lead + independent formal/security review</dd></div><div><dt>Gate</dt><dd>G5 / technical readiness <span class="acc-gl"><a href="#gate-G5">G5</a></span></dd></div><div><dt>Fixtures</dt><dd>F0 exact fault model; F4 real-node partitions; F5 certificates and historical failures</dd></div><div><dt>Plan pages</dt><dd>19, 21, 24, 25</dd></div></dl><div class="acc-suite-bar"><div class="acc-bar" role="img" aria-label="FIN: 8 cases: 2 passed under the standard, 0 running with team evidence, 6 not run, 0 deferred"><span class="seg g-pass" style="flex-grow:2" title="2 PASS"></span><span class="seg g-notrun" style="flex-grow:6" title="6 NOT RUN"></span></div><span>8 cases: 2 passed under the standard, 0 running with team evidence, 6 not run, 0 deferred</span></div><div class="acc-cases"><div class="acc-cases-h" aria-hidden="true"><span>Case</span><span>Title</span><span>Priority</span><span>Profile</span><span>Status</span><span>Evidence</span><span>Last run</span><span></span></div><details class="acc-case" id="case-FIN-01" data-case="FIN-01" data-state="NOT RUN"><summary><span class="c-id">FIN-01</span><span class="c-title">Agree on ordering, work and executed state</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P01, P08</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:32 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Use real fork-choice/DAG handling and independent miners, not only a simplified simulator.</p><h4>Steps</h4><ol><li>Generate concurrent branches, delayed blocks, duplicates and invalid work with deterministic seeds.</li><li>Compare selected ordering, accumulated work, transaction execution and state roots after delivery converges.</li><li>Replay from independent checkpoints and from genesis where practical.</li></ol><h4>Accept</h4><p>Honest nodes converge under F0 assumptions with exact roots and rewards. No duplicated work accounting or undocumented ordering dependence; simulator-only success cannot substitute.</p><h4>Evidence the case requires</h4><p>Block/ordering corpus; root/work diffs; real-node replay logs.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>fast-time lane (a8be71a0db962911c)</dd></div><div><dt>Run</dt><dd>201-7cfa422a-aa0e0f45</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>48</dd></div><div><dt>Plan pages</dt><dd>19, 21, 24, 25</dd></div></dl></div></details><details class="acc-case" id="case-FIN-02" data-case="FIN-02" data-state="PASS"><summary><span class="c-id">FIN-02</span><span class="c-title">Attack finality with split honest populations</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P01, P08</span><span class="c-st"><span class="acc-chip s-pass" data-state="PASS">PASS</span></span><span class="c-ev"><span class="lbl">Evidence </span><a href="https://git.igneum.network/igneum-network/igneum/src/branch/master/sim/finality-attacks-results/v4-pause-fix.md" rel="noopener">record</a></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:43 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Use the source-discussed 40/40/20 weight split, plus threshold-boundary splits under F0.</p><h4>Steps</h4><ol><li>Let the 20% adversarial group sign conflicting histories while honest groups are partitioned.</li><li>Delay messages and eligibility updates independently; keep total historical weights auditable.</li><li>Try to form two certificates and reconnect nodes to observe accepted final history.</li></ol><h4>Accept</h4><p>No conflicting final certificates are accepted within the declared fault bound. A safe pause is valid when quorum is unavailable; making progress on both sides is not required.</p><h4>Evidence the case requires</h4><p>Signed votes; certificate attempts; voter-table snapshots; safety checker output.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>finality lane (aca0f5ed924a2a99b)</dd></div><div><dt>Run</dt><dd>fin-v4-realnode-20261008T2025Z</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>48</dd></div><div><dt>Plan pages</dt><dd>19, 21, 24, 25</dd></div></dl></div></details><details class="acc-case" id="case-FIN-03" data-case="FIN-03" data-state="NOT RUN"><summary><span class="c-id">FIN-03</span><span class="c-title">Cross authority expiry in a long partition</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P01, P08</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:32 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Recover historical expiry failures where available; use the actual current authority-transition rules.</p><h4>Steps</h4><ol><li>Partition for 31, 35, 60 and 90 logical days and around every retention/expiry boundary.</li><li>Attempt independently renewed authority sets and conflicting checkpoint locks.</li><li>Repeat selected boundary cases on real nodes with accelerated timers explicitly labelled.</li></ol><h4>Accept</h4><p>Authority continuity remains authenticated and no conflicting final history appears within F0 assumptions. A timeout is not accepted as proof absent voters ceased to exist. Compressed time is not multi-month field evidence.</p><h4>Evidence the case requires</h4><p>Expiry timeline; table/certificate history; historical regression tests.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>finality lane (aca0f5ed924a2a99b)</dd></div><div><dt>Run</dt><dd>201-7cfa422a-aa0e0f45</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>48</dd></div><div><dt>Plan pages</dt><dd>19, 21, 24, 25</dd></div></dl></div></details><details class="acc-case" id="case-FIN-04" data-case="FIN-04" data-state="NOT RUN"><summary><span class="c-id">FIN-04</span><span class="c-title">Stop signing while mining continues</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P01, P08</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:32 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Remove enough signing participation to invalidate the liveness assumption without forging votes.</p><h4>Steps</h4><ol><li>Continue mining and execution, cross seed boundaries and monitor proof queues.</li><li>Check which user-visible states advance and which remain unfinalised.</li><li>Restore eligible weight and bounded message delay, then verify recovery.</li></ol><h4>Accept</h4><p>No false finality or fabricated authority. Behaviour matches F0 during the pause and P08 after assumptions return; unfinished transactions are not displayed as irreversible.</p><h4>Evidence the case requires</h4><p>Signing/mining trace; UI/RPC states; recovery roots and timing.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>finality lane (aca0f5ed924a2a99b)</dd></div><div><dt>Run</dt><dd>201-7cfa422a-aa0e0f45</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>49</dd></div><div><dt>Plan pages</dt><dd>19, 21, 24, 25</dd></div></dl></div></details><details class="acc-case" id="case-FIN-05" data-case="FIN-05" data-state="NOT RUN"><summary><span class="c-id">FIN-05</span><span class="c-title">Authenticate voter-set changes and pooled keys</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P01, P08</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:32 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Use normal transitions, pool members retaining keys and malicious substitution attempts.</p><h4>Steps</h4><ol><li>Alter voter weights, membership proofs, miner/pool identity bindings and prior-certificate links.</li><li>Race updates across boundaries and replay old signed changes.</li><li>Have a new node verify the authority chain from its declared trust anchor.</li></ol><h4>Accept</h4><p>Only correctly authenticated changes are accepted; weights cannot be double-counted or redirected by a pool. All honest nodes agree on the active authority set for each certified point.</p><h4>Evidence the case requires</h4><p>Authority-chain fixtures; substitution attacks; new-node verification log.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>finality lane (aca0f5ed924a2a99b)</dd></div><div><dt>Run</dt><dd>201-7cfa422a-aa0e0f45</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>49</dd></div><div><dt>Plan pages</dt><dd>19, 21, 24, 25</dd></div></dl></div></details><details class="acc-case" id="case-FIN-06" data-case="FIN-06" data-state="NOT RUN"><summary><span class="c-id">FIN-06</span><span class="c-title">Analyse old-key compromise and long-range histories</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P01, P08</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 21:10 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Freeze assumptions about key erasure, retained weights, trust anchors and offline recovery.</p><h4>Steps</h4><ol><li>Use previously eligible keys to build alternative histories after their operators disappear.</li><li>Present these histories to recently offline and newly joining clients.</li><li>Test replayed certificates, stale anchors and compromised signer subsets.</li></ol><h4>Accept</h4><p>Acceptance matches the explicit security model with no hidden trusted recovery step. Any reliance on a recent trusted anchor is disclosed and tested; hashpower assumptions cannot replace old-key analysis.</p><h4>Evidence the case requires</h4><p>Long-range corpus; trust-anchor policy; key-compromise review; client results.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>finality lane (aca0f5ed924a2a99b)</dd></div><div><dt>Run</dt><dd>team-2026-10-08</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>49</dd></div><div><dt>Plan pages</dt><dd>19, 21, 24, 25</dd></div></dl></div></details><details class="acc-case" id="case-FIN-07" data-case="FIN-07" data-state="PASS"><summary><span class="c-id">FIN-07</span><span class="c-title">Recover deterministically after reconnection and crash</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P01, P08</span><span class="c-st"><span class="acc-chip s-pass" data-state="PASS">PASS</span></span><span class="c-ev"><span class="lbl">Evidence </span><a href="https://git.igneum.network/igneum-network/igneum/src/branch/master/sim/finality-attacks-results/v4-pause-fix.md" rel="noopener">record</a></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:43 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Combine partitions with node crash, partial writes, restarts and proof backlog.</p><h4>Steps</h4><ol><li>Reconnect networks under bounded latency and restore required honest participation.</li><li>Verify fork choice, unfinalised reorganisation, finality, reward rollback and proof reassignments.</li><li>Compare all honest nodes and customer-visible receipts after recovery.</li></ol><h4>Accept</h4><p>P08 recovery holds without reversing a previously valid final guarantee. Only permitted unfinalised state is reorganised; no duplicate rewards or inconsistent receipt statuses survive.</p><h4>Evidence the case requires</h4><p>Recovery timelines; roots/certificates; payout rollback; customer-state reconciliation.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>finality lane (aca0f5ed924a2a99b)</dd></div><div><dt>Run</dt><dd>fin-v4-realnode-20261008T2025Z</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>50</dd></div><div><dt>Plan pages</dt><dd>19, 21, 24, 25</dd></div></dl></div></details><details class="acc-case" id="case-FIN-08" data-case="FIN-08" data-state="NOT RUN"><summary><span class="c-id">FIN-08</span><span class="c-title">Combine boundaries, faults and adversarial scheduling</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P01, P08</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><a href="https://git.igneum.network/igneum-network/igneum/src/branch/master/sim/results_v2.md" rel="noopener">record</a></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:43 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Use an independent model checker/scheduler and production-node scenarios from F4.</p><h4>Steps</h4><ol><li>Combine epoch changes, authority transitions, mining churn, data delays and prover/aggregator loss.</li><li>Explore bounded adversarial message schedules and minimise any counterexample.</li><li>Replay model findings on real code and have an independent reviewer assess uncovered states.</li></ol><h4>Accept</h4><p>No unresolved safety failure; liveness claims hold only within declared assumptions and P08. Model bounds and untested schedules are published, not described as proof over every possible execution.</p><h4>Evidence the case requires</h4><p>Model/spec artifacts; schedule corpus; replay evidence; independent assessment.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Model checking + real-node testing</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>fast-time lane (a8be71a0db962911c)</dd></div><div><dt>Run</dt><dd>fin-v4-realnode-20261008T2025Z</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>50</dd></div><div><dt>Plan pages</dt><dd>19, 21, 24, 25</dd></div></dl></div></details></div></div></section><section class="section acc-suite" id="suite-VER"><div class="container"><div class="acc-suite-head"><div class="acc-suite-code"><span class="n">12</span>VER</div><div class="acc-suite-t"><h2>Wallets, receipts and data availability</h2><p class="acc-sub">Verify the exact property shown to the user. An inclusion proof, execution proof and finality certificate are not interchangeable.</p></div><div class="acc-suite-st"><span class="acc-chip s-fail" data-state="FAIL">FAIL</span></div></div><dl class="acc-facts"><div><dt>Owner</dt><dd>Wallet + light-client lead; independent security review</dd></div><div><dt>Gate</dt><dd>Technical readiness / claimed options</dd></div><div><dt>Fixtures</dt><dd>F0 trust/availability model; F5 malformed roots, receipts and authority chains</dd></div><div><dt>Plan pages</dt><dd>20, 25, 35, 37</dd></div></dl><div class="acc-suite-bar"><div class="acc-bar" role="img" aria-label="VER: 8 cases: 0 passed under the standard, 0 running with team evidence, 3 failed, 5 not run, 0 deferred"><span class="seg g-fail" style="flex-grow:3" title="3 FAIL"></span><span class="seg g-notrun" style="flex-grow:5" title="5 NOT RUN"></span></div><span>8 cases: 0 passed under the standard, 0 running with team evidence, 3 failed, 5 not run, 0 deferred</span></div><div class="acc-cases"><div class="acc-cases-h" aria-hidden="true"><span>Case</span><span>Title</span><span>Priority</span><span>Profile</span><span>Status</span><span>Evidence</span><span>Last run</span><span></span></div><details class="acc-case" id="case-VER-01" data-case="VER-01" data-state="FAIL"><summary><span class="c-id">VER-01</span><span class="c-title">Authenticate light-client bootstrap</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P01, P09</span><span class="c-st"><span class="acc-chip s-fail" data-state="FAIL">FAIL</span></span><span class="c-ev"><span class="lbl">Evidence </span><a href="https://git.igneum.network/igneum-network/igneum/src/branch/master/tools/reference-apps/ver/evidence/VER-01.json" rel="noopener">record</a></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:46 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Give a clean client malicious RPC responses, fabricated voter tables and valid-looking signatures.</p><h4>Steps</h4><ol><li>Start from the approved trust anchor and verify every required link to the advertised state.</li><li>Substitute otherwise well-formed but unauthorised keys, weights and checkpoints.</li><li>Remove the bootstrap service and use another independently operated source.</li></ol><h4>Accept</h4><p>The client rejects unauthorised authority and discloses any trust anchor. Signatures over a node-supplied table do not by themselves pass; missing authentication never silently degrades to trusted RPC.</p><h4>Evidence the case requires</h4><p>Bootstrap corpus; trust-chain trace; fail-closed tests.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>reference-apps lane (a2060899d2a27d31c)</dd></div><div><dt>Run</dt><dd>ra-20261008T1915-ver</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>51</dd></div><div><dt>Plan pages</dt><dd>20, 25, 35, 37</dd></div></dl></div></details><details class="acc-case" id="case-VER-02" data-case="VER-02" data-state="FAIL"><summary><span class="c-id">VER-02</span><span class="c-title">Verify evolving authority and execution statements</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P01, P09</span><span class="c-st"><span class="acc-chip s-fail" data-state="FAIL">FAIL</span></span><span class="c-ev"><span class="lbl">Evidence </span><a href="https://git.igneum.network/igneum-network/igneum/src/branch/master/tools/reference-apps/ver/evidence/VER-01.json" rel="noopener">record</a></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:46 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Use valid state proofs paired with wrong execution statements or stale authority histories.</p><h4>Steps</h4><ol><li>Cross voter and verifier changes with offline clients returning after long intervals.</li><li>Alter roots, aggregate identity and proof/public-input bindings independently.</li><li>Check local verification rather than merely a server-reported verified flag.</li></ol><h4>Accept</h4><p>All advertised proof checks occur locally or the remaining trust is explicitly disclosed. Wrong roots and unauthenticated authority are rejected; unsupported verification paths are not claimed.</p><h4>Evidence the case requires</h4><p>Client verification trace; corrupted inputs; offline/upgrade results.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>reference-apps lane (a2060899d2a27d31c)</dd></div><div><dt>Run</dt><dd>ra-20261008T1915-ver</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>51</dd></div><div><dt>Plan pages</dt><dd>20, 25, 35, 37</dd></div></dl></div></details><details class="acc-case" id="case-VER-03" data-case="VER-03" data-state="NOT RUN"><summary><span class="c-id">VER-03</span><span class="c-title">Prove successful payment rather than inclusion</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P01, P09</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><a href="https://git.igneum.network/igneum-network/igneum/src/branch/master/tools/reference-apps/ver/evidence/summary.json" rel="noopener">record</a></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:46 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Create successful, reverted, wrong-asset, wrong-recipient and wrong-amount transfers.</p><h4>Steps</h4><ol><li>Generate receipts for included transactions, including failures and replaced/unfinalised transactions.</li><li>Verify execution status plus asset, recipient, amount and canonical-state/receipt commitment.</li><li>Replay the receipt on another chain and after an allowed unfinalised reorganisation.</li></ol><h4>Accept</h4><p>Only the actual successful, correctly bound transfer is labelled payment proof. Inclusion-only receipts are labelled as such; no node-reported success flag substitutes for authenticated outcome.</p><h4>Evidence the case requires</h4><p>Payment fixture corpus; receipt verification; merchant-facing status checks.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>reference-apps lane (a2060899d2a27d31c)</dd></div><div><dt>Run</dt><dd>ra-20261008T1915-ver</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>51</dd></div><div><dt>Plan pages</dt><dd>20, 25, 35, 37</dd></div></dl></div></details><details class="acc-case" id="case-VER-04" data-case="VER-04" data-state="NOT RUN"><summary><span class="c-id">VER-04</span><span class="c-title">Bound cross-chain oracle trust and replay</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P00, P01, P09</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><a href="https://git.igneum.network/igneum-network/igneum/src/branch/master/tools/reference-apps/ver/evidence/summary.json" rel="noopener">record</a></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:46 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>For a claimed oracle, freeze destination verifier, authority updates, accepted proof types and replay policy.</p><h4>Steps</h4><ol><li>Try deployer-substituted keys, stale certificates, unchecked signatures and wrong source/destination identities.</li><li>Exercise legitimate authority updates and source reorganisations under the approved model.</li><li>Measure gas/cost with realistic header sets and test disabled/unavailable verification.</li></ol><h4>Accept</h4><p>The oracle enforces its declared trust model and fails closed. Deployer privileges and unavailable guarantees are explicit; no trustless-bridge claim exceeds the checks performed. Excluded oracle scope earns no pass credit.</p><h4>Evidence the case requires</h4><p>Oracle code/parameters; attack cases; cost report; privilege disclosure.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Claimed-option verification</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>reference-apps lane (a2060899d2a27d31c)</dd></div><div><dt>Run</dt><dd>ra-20261008T1915-ver</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>52</dd></div><div><dt>Plan pages</dt><dd>20, 25, 35, 37</dd></div></dl></div></details><details class="acc-case" id="case-VER-05" data-case="VER-05" data-state="FAIL"><summary><span class="c-id">VER-05</span><span class="c-title">Reconstruct required state without founder storage</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P01, P08, P09</span><span class="c-st"><span class="acc-chip s-fail" data-state="FAIL">FAIL</span></span><span class="c-ev"><span class="lbl">Evidence </span><a href="https://git.igneum.network/igneum-network/igneum/src/branch/master/tools/reference-apps/ver/evidence/VER-05.json" rel="noopener">record</a></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:46 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Remove founder archival/input services and start an independent operator from the documented entry point.</p><h4>Steps</h4><ol><li>Fetch authenticated blocks, state/proof inputs and any required witnesses from permitted peers.</li><li>Rebuild the expected state and continue validation/proving.</li><li>Measure bandwidth, disk, time and retention requirements against advertised operator budgets.</li></ol><h4>Accept</h4><p>Required data can be obtained and verified within the declared availability model. Hidden archives or unpublished files block independence. A valid execution proof alone does not satisfy this test.</p><h4>Evidence the case requires</h4><p>Download/reconstruction logs; data hashes; resource costs; dependency inventory.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>reference-apps lane (a2060899d2a27d31c)</dd></div><div><dt>Run</dt><dd>ra-20261008T1915-ver</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>52</dd></div><div><dt>Plan pages</dt><dd>20, 25, 35, 37</dd></div></dl></div></details><details class="acc-case" id="case-VER-06" data-case="VER-06" data-state="NOT RUN"><summary><span class="c-id">VER-06</span><span class="c-title">Detect withholding, corruption and stale data</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P01, P08, P09</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><a href="https://git.igneum.network/igneum-network/igneum/src/branch/master/tools/reference-apps/ver/evidence/summary.json" rel="noopener">record</a></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:46 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Serve valid commitments with missing data, corrupted chunks, stale witnesses and conflicting peer replies.</p><h4>Steps</h4><ol><li>Attempt to make a validator or light client accept an unavailable or incorrect state under F0.</li><li>Test retrieval from independent peers and expiry/retry policy.</li><li>Restore data and check that recovery cannot alter an already verified commitment.</li></ol><h4>Accept</h4><p>No unjustified available/verified status; safety and admission rules match F0. Recovery is bounded where assumptions permit, and unavailable-data states remain visible instead of hidden behind proofs.</p><h4>Evidence the case requires</h4><p>Withholding corpus; peer retrieval traces; availability/status checks.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>reference-apps lane (a2060899d2a27d31c)</dd></div><div><dt>Run</dt><dd>ra-20261008T1915-ver</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>52</dd></div><div><dt>Plan pages</dt><dd>20, 25, 35, 37</dd></div></dl></div></details><details class="acc-case" id="case-VER-07" data-case="VER-07" data-state="NOT RUN"><summary><span class="c-id">VER-07</span><span class="c-title">Protect wallet keys, signing and recovery</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P01, P09</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:22 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Use test-only keys, encrypted backups and clean replacement devices; no real user funds.</p><h4>Steps</h4><ol><li>Attempt secret access from proving jobs, logs, crash dumps, clipboard and telemetry paths.</li><li>Verify transaction destination/amount before signing; test backup/restore and wrong-password handling.</li><li>Upgrade and recover without silently changing signing authority or exposing seed material.</li></ol><h4>Accept</h4><p>No unintended secret disclosure or unauthorised signature. Supported recovery restores the correct keys and accounts; users receive explicit risk/backup information. Logs are sanitised without hiding security evidence.</p><h4>Evidence the case requires</h4><p>Security review; canary-secret tests; signing fixtures; restore journey.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>shipper (ae892a8b0f78fe31c)</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>53</dd></div><div><dt>Plan pages</dt><dd>20, 25, 35, 37</dd></div></dl></div></details><details class="acc-case" id="case-VER-08" data-case="VER-08" data-state="NOT RUN"><summary><span class="c-id">VER-08</span><span class="c-title">Keep every user-facing state truthful</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P01, P09</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><a href="https://git.igneum.network/igneum-network/igneum/src/branch/master/tools/reference-apps/ver/evidence/summary.json" rel="noopener">record</a></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:46 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Create included-only, executed, proven, finalised, reverted, stale and paused examples.</p><h4>Steps</h4><ol><li>Compare explorer, wallet, receipt, RPC and customer API labels against authenticated evidence.</li><li>Interrupt finality and proof services and observe refresh/reconnect behaviour.</li><li>Check statements about privacy, Ethereum security and device support.</li></ol><h4>Accept</h4><p>No stronger state is implied than verified; stale data is marked and failures are actionable. EVM compatibility is not labelled Ethereum security, and ZK technology is not automatically labelled transaction privacy.</p><h4>Evidence the case requires</h4><p>Cross-surface screenshots/logs; state mapping; claim review.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>reference-apps lane (a2060899d2a27d31c)</dd></div><div><dt>Run</dt><dd>ra-20261008T1915-ver</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>53</dd></div><div><dt>Plan pages</dt><dd>20, 25, 35, 37</dd></div></dl></div></details></div></div></section><section class="section acc-suite" id="suite-OPS"><div class="container"><div class="acc-suite-head"><div class="acc-suite-code"><span class="n">13</span>OPS</div><div class="acc-suite-t"><h2>Independent operation and release security</h2><p class="acc-sub">A permissionless specification must remain operational without privileged infrastructure or unsafe automatic updates.</p></div><div class="acc-suite-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></div></div><dl class="acc-facts"><div><dt>Owner</dt><dd>Operations + release leads; independent operators</dd></div><div><dt>Gate</dt><dd>G5 <span class="acc-gl"><a href="#gate-G5">G5</a></span></dd></div><div><dt>Fixtures</dt><dd>F4 isolated multi-operator network; F0 signed releases; F9 telemetry</dd></div><div><dt>Plan pages</dt><dd>21, 24, 25, 26</dd></div></dl><div class="acc-suite-bar"><div class="acc-bar" role="img" aria-label="OPS: 8 cases: 0 passed under the standard, 0 running with team evidence, 8 not run, 0 deferred"><span class="seg g-notrun" style="flex-grow:8" title="8 NOT RUN"></span></div><span>8 cases: 0 passed under the standard, 0 running with team evidence, 8 not run, 0 deferred</span></div><div class="acc-cases"><div class="acc-cases-h" aria-hidden="true"><span>Case</span><span>Title</span><span>Priority</span><span>Profile</span><span>Status</span><span>Evidence</span><span>Last run</span><span></span></div><details class="acc-case" id="case-OPS-01" data-case="OPS-01" data-state="NOT RUN"><summary><span class="c-id">OPS-01</span><span class="c-title">Run the complete no-founder exercise</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P07, P08, P11</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:22 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Use the P11 independent network, adequate honest participation and enough non-founder capacity for W.</p><h4>Steps</h4><ol><li>Remove founder miners, provers, aggregators, RPC, DNS/bootstrap dependencies and private support access.</li><li>Run the full P11 period while crossing real and separately labelled accelerated boundaries.</li><li>Introduce scheduled faults and have independent operators recover using published instructions.</li></ol><h4>Accept</h4><p>No founder action, secret file, privileged key or emergency anti-chip rule is needed. P07/P08 outcomes hold within assumptions; any intervention is recorded as a failed no-rescue run, not erased.</p><h4>Evidence the case requires</h4><p>Operator roster/conflict checks; dependency removals; full activity/intervention log.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>node lane (a283f5f0d364ceef0)</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>54</dd></div><div><dt>Plan pages</dt><dd>21, 24, 25, 26</dd></div></dl></div></details><details class="acc-case" id="case-OPS-02" data-case="OPS-02" data-state="NOT RUN"><summary><span class="c-id">OPS-02</span><span class="c-title">Diversify bootstrap and resist peer isolation</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P01, P08, P09</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:22 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Start nodes without the default bootstrap host and give others adversarial peer lists.</p><h4>Steps</h4><ol><li>Attempt eclipse through peer concentration, stale discovery, poisoned DNS and repeated identities in an isolated lab.</li><li>Use independent documented discovery paths and validate returned chain data.</li><li>Measure synchronisation, peer diversity and recovery after benign connectivity returns.</li></ol><h4>Accept</h4><p>No unauthenticated history is trusted; bootstrap has no hidden single-provider requirement. Isolation is detected/contained according to F0 and recovery meets P08 when assumptions return.</p><h4>Evidence the case requires</h4><p>Peer/discovery traces; eclipse scenarios; startup and recovery evidence.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>build-server lane (a352e49ff4613df86)</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>54</dd></div><div><dt>Plan pages</dt><dd>21, 24, 25, 26</dd></div></dl></div></details><details class="acc-case" id="case-OPS-03" data-case="OPS-03" data-state="NOT RUN"><summary><span class="c-id">OPS-03</span><span class="c-title">Separate update distribution from consensus authority</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P01, P09</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 21:50 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Use test signing keys and clean desktop/node installations with valid, stale and malicious packages.</p><h4>Steps</h4><ol><li>Offer signed updates with unexpected consensus rules, downgraded binaries and corrupted payloads.</li><li>Test explicit operator acceptance and the published signing-key incident procedure.</li><li>Confirm that distribution-key possession cannot independently activate new consensus rules.</li></ol><h4>Accept</h4><p>Tampering/unauthorised rollback is rejected; updates do not silently transfer authority. Approved acceptance and activation are separate. No test touches production signing material.</p><h4>Evidence the case requires</h4><p>Package corpus; approval/activation traces; compromised-key rehearsal.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>shipper (ae892a8b0f78fe31c)</dd></div><div><dt>Run</dt><dd>site-manifest-20261008-01</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>54</dd></div><div><dt>Plan pages</dt><dd>21, 24, 25, 26</dd></div></dl></div></details><details class="acc-case" id="case-OPS-04" data-case="OPS-04" data-state="NOT RUN"><summary><span class="c-id">OPS-04</span><span class="c-title">Recover nodes from crash and storage damage</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P01, P08</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:32 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Use production database/snapshot paths with controlled interrupted writes and corrupted test storage.</p><h4>Steps</h4><ol><li>Crash during import, proof acceptance, reward application and snapshot generation.</li><li>Restore from independently verified snapshots or re-sync through documented procedures.</li><li>Compare roots, certificates, balances and processed-job IDs with an unaffected node.</li></ol><h4>Accept</h4><p>No corrupt snapshot is trusted, no duplicate payout and no loss of authenticated final state. Recovery meets P08 where data is available; ambiguous corruption fails closed and is actionable.</p><h4>Evidence the case requires</h4><p>Crash schedule; snapshot hashes; root/balance diffs; recovery timing.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>node lane (a283f5f0d364ceef0)</dd></div><div><dt>Run</dt><dd>201-7cfa422a-aa0e0f45</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>55</dd></div><div><dt>Plan pages</dt><dd>21, 24, 25, 26</dd></div></dl></div></details><details class="acc-case" id="case-OPS-05" data-case="OPS-05" data-state="NOT RUN"><summary><span class="c-id">OPS-05</span><span class="c-title">Isolate untrusted proving workloads</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P01, P09</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:22 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Run hostile test jobs with secret canaries and restrictive worker permissions.</p><h4>Steps</h4><ol><li>Attempt filesystem escape, process spawning, resource exhaustion, network access and key-store reads.</li><li>Crash workers and inspect host, wallet and node availability plus dump/log contents.</li><li>Retry on every supported isolation backend and check dependency vulnerability handling.</li></ol><h4>Accept</h4><p>No secret leakage or unauthorised host action; P09 resource containment holds. Worker failure does not compromise validator/wallet authority; unsupported isolation is not marketed as safe execution.</p><h4>Evidence the case requires</h4><p>Sandbox penetration report; canary logs; resource limits; host-integrity checks.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>build-server lane (a352e49ff4613df86)</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>55</dd></div><div><dt>Plan pages</dt><dd>21, 24, 25, 26</dd></div></dl></div></details><details class="acc-case" id="case-OPS-06" data-case="OPS-06" data-state="NOT RUN"><summary><span class="c-id">OPS-06</span><span class="c-title">Contain malicious network and API traffic</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P01, P09</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:32 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Use an authorised isolated load environment with declared resource and request-rate budgets.</p><h4>Steps</h4><ol><li>Send malformed headers, proofs, oversized messages, floods and invalid peer sequences.</li><li>Measure legitimate traffic, memory/disk growth and validator CPU use.</li><li>Test limit resets, peer reconnect and graceful degradation without disabling validation.</li></ol><h4>Accept</h4><p>P09 abuse budgets hold; no unbounded allocation, persistent crash or invalid acceptance. Backpressure is visible and honest users retain the specified service at admitted load.</p><h4>Evidence the case requires</h4><p>Load/corpus manifests; resource series; valid-traffic metrics; incident traces.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>build-server lane (a352e49ff4613df86)</dd></div><div><dt>Run</dt><dd>201-7cfa422a-aa0e0f45</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>55</dd></div><div><dt>Plan pages</dt><dd>21, 24, 25, 26</dd></div></dl></div></details><details class="acc-case" id="case-OPS-07" data-case="OPS-07" data-state="NOT RUN"><summary><span class="c-id">OPS-07</span><span class="c-title">Detect failures with usable evidence and runbooks</span><span class="c-pri"><span class="lbl">Priority </span>GATE</span><span class="c-prof"><span class="lbl">Profile </span>P09, P10</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:22 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Define alerts for invalid acceptance, conflicting finality, backlog, data loss, payout mismatch and stale status.</p><h4>Steps</h4><ol><li>Inject one instance of each monitored failure in the lab.</li><li>Have an unaffiliated operator diagnose it using only emitted evidence and published instructions.</li><li>Test redaction, metric freshness and duplicate-alert suppression without suppressing serious failures.</li></ol><h4>Accept</h4><p>P10 alert/detection limits hold; every blocker produces actionable evidence. Monitoring does not leak secrets or mislabel intentional safe pauses as successful finality.</p><h4>Evidence the case requires</h4><p>Alert matrix; detection timelines; independent runbook exercise.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>build-server lane (a352e49ff4613df86)</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>56</dd></div><div><dt>Plan pages</dt><dd>21, 24, 25, 26</dd></div></dl></div></details><details class="acc-case" id="case-OPS-08" data-case="OPS-08" data-state="NOT RUN"><summary><span class="c-id">OPS-08</span><span class="c-title">Repeat independent operation across releases</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P00, P08, P11</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:22 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Use a clean previous supported version and the final candidate with independent operators.</p><h4>Steps</h4><ol><li>Perform documented rolling upgrade, rollback of non-consensus software where allowed and resynchronisation.</li><li>Cross activation with mixed versions and unavailable founder distribution hosts.</li><li>Re-run affected gates after changes and preserve prior failures and incident lessons.</li></ol><h4>Accept</h4><p>No undocumented privileged migration or automatic consensus rewrite. All affected evidence is refreshed; P11 no-rescue results remain tied to the final release, not an earlier build.</p><h4>Evidence the case requires</h4><p>Upgrade/replay logs; invalidation map; repeated gate signatures.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>build-server lane (a352e49ff4613df86)</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>56</dd></div><div><dt>Plan pages</dt><dd>21, 24, 25, 26</dd></div></dl></div></details></div></div></section><section class="section acc-suite" id="suite-UX"><div class="container"><div class="acc-suite-head"><div class="acc-suite-code"><span class="n">14</span>UX</div><div class="acc-suite-t"><h2>Ember, payouts and operator control</h2><p class="acc-sub">Successful participation must be practical for ordinary owners without hidden custody or loss of consensus authority.</p></div><div class="acc-suite-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></div></div><dl class="acc-facts"><div><dt>Owner</dt><dd>Desktop product + pool leads; independent usability study</dd></div><div><dt>Gate</dt><dd>Operator readiness / G5 <span class="acc-gl"><a href="#gate-G5">G5</a></span></dd></div><div><dt>Fixtures</dt><dd>F2 supported desktops; F8 user study; F4 honest/malicious pools</dd></div><div><dt>Plan pages</dt><dd>14, 21, 25, 26</dd></div></dl><div class="acc-suite-bar"><div class="acc-bar" role="img" aria-label="UX: 8 cases: 0 passed under the standard, 0 running with team evidence, 8 not run, 0 deferred"><span class="seg g-notrun" style="flex-grow:8" title="8 NOT RUN"></span></div><span>8 cases: 0 passed under the standard, 0 running with team evidence, 8 not run, 0 deferred</span></div><div class="acc-cases"><div class="acc-cases-h" aria-hidden="true"><span>Case</span><span>Title</span><span>Priority</span><span>Profile</span><span>Status</span><span>Evidence</span><span>Last run</span><span></span></div><details class="acc-case" id="case-UX-01" data-case="UX-01" data-state="NOT RUN"><summary><span class="c-id">UX-01</span><span class="c-title">Onboard ordinary owners on native desktop apps</span><span class="c-pri"><span class="lbl">Priority </span>GATE</span><span class="c-prof"><span class="lbl">Profile </span>P10</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><a href="https://git.igneum.network/igneum-network/igneum/src/branch/master/docs/plans/evidence/UX-01-20261008.md" rel="noopener">record</a></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 21:42 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Recruit the P10 first-time user cohort across Windows and macOS using supported physical hardware.</p><h4>Steps</h4><ol><li>Observe install, hardware detection, safety explanation and first accepted work without staff intervention.</li><li>Record download/data preparation separately as well as complete end-to-end time.</li><li>Test unsupported hardware and insufficient memory messaging rather than forcing a failed start.</li></ol><h4>Accept</h4><p>P10 completion/time targets hold with no unsafe default or concealed prerequisite. The product is tested as the actual desktop app, not only a browser preview.</p><h4>Evidence the case requires</h4><p>Consent-based study records; task timings; failure reasons; compatibility outcomes.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Independent observed user study</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>update-return lane (a22d765a2e0355a9f)</dd></div><div><dt>Run</dt><dd>ux-01-20261008-win-2.0.0</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>57</dd></div><div><dt>Plan pages</dt><dd>14, 21, 25, 26</dd></div></dl></div></details><details class="acc-case" id="case-UX-02" data-case="UX-02" data-state="NOT RUN"><summary><span class="c-id">UX-02</span><span class="c-title">Make pause, stop and safe tuning reliable</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P01, P10</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:32 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Run mining/proving on active desktops under contention and safe thermal stress.</p><h4>Steps</h4><ol><li>Use pause, stop, power limit, task selection and emergency local shutdown controls.</li><li>Crash or restart the UI while workers run and verify ownership of background processes.</li><li>Restore the original hardware settings and test power-saving/low-battery behaviour where supported.</li></ol><h4>Accept</h4><p>P10 control latency and safe-state requirements hold. Stopping does not strand an uncontrolled process; tuning never depends on unsafe settings or silent privilege escalation.</p><h4>Evidence the case requires</h4><p>Control timings; process/settings audit; restart and safety traces.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>shipper (ae892a8b0f78fe31c)</dd></div><div><dt>Run</dt><dd>201-7cfa422a-aa0e0f45</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>57</dd></div><div><dt>Plan pages</dt><dd>14, 21, 25, 26</dd></div></dl></div></details><details class="acc-case" id="case-UX-03" data-case="UX-03" data-state="NOT RUN"><summary><span class="c-id">UX-03</span><span class="c-title">Show net earnings and compatibility honestly</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P01, P10, P12</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:32 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Use known rewards, fees, energy readings, retries and operator-entered tariffs.</p><h4>Steps</h4><ol><li>Compare mining, internal proof and external proof income with authoritative ledgers.</li><li>Show gross/net estimates, measurement boundaries, tariff assumptions and payout status.</li><li>Test stale data, losses, negative margins and mining-only versus proving-compatible devices.</li></ol><h4>Accept</h4><p>P10 reconciliation limits hold and uncertainty is visible. No guaranteed profits, fabricated fiat price or inferred proving support; provisional earnings are not shown as settled payments.</p><h4>Evidence the case requires</h4><p>UI/ledger comparisons; tariff fixtures; stale/negative examples.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>shipper (ae892a8b0f78fe31c)</dd></div><div><dt>Run</dt><dd>201-7cfa422a-aa0e0f45</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>57</dd></div><div><dt>Plan pages</dt><dd>14, 21, 25, 26</dd></div></dl></div></details><details class="acc-case" id="case-UX-04" data-case="UX-04" data-state="NOT RUN"><summary><span class="c-id">UX-04</span><span class="c-title">Pay small operators without hidden custody</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P01, P10</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><a href="https://git.igneum.network/igneum-network/igneum/src/branch/master/docs/analysis/pool/pool-pair-2026-10-08.md" rel="noopener">record</a></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 21:48 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Use ordinary single-card balances and the actual pooling/payment path.</p><h4>Steps</h4><ol><li>Earn, request/receive payment, disconnect and reconnect; include low balances, fees and a pool outage.</li><li>Attempt redirection, delayed accounting and withdrawal of another user's entitlement.</li><li>Reconcile displayed balances with canonical entitlement and actual settlement.</li></ol><h4>Accept</h4><p>P10 payout limits hold for the declared small-operator case. No unauthorised custody, redirection or unexplained loss; thresholds and fees are disclosed rather than masked by larger test balances.</p><h4>Evidence the case requires</h4><p>Single-card payout ledger; pool failure record; custody/authorisation review.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>pool design seat (a3832b1c3b274b310)</dd></div><div><dt>Run</dt><dd>pool-2.0-20261008-03</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>58</dd></div><div><dt>Plan pages</dt><dd>14, 21, 25, 26</dd></div></dl></div></details><details class="acc-case" id="case-UX-05" data-case="UX-05" data-state="NOT RUN"><summary><span class="c-id">UX-05</span><span class="c-title">Keep voting keys with the miner through pooling</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P01, P09</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><a href="https://git.igneum.network/igneum-network/igneum/src/branch/master/docs/analysis/pool/pool-pair-2026-10-08.md" rel="noopener">record</a></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 21:48 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Use an honest pool and a modified pool that replaces worker identity or voting credentials.</p><h4>Steps</h4><ol><li>Verify the consensus binding from performed work to the miner's retained key.</li><li>Attempt substitution, replay and reassignment without the miner's authorisation.</li><li>Leave the pool and verify retained voting/finality rights under F0.</li></ol><h4>Accept</h4><p>No silent transfer of governance/finality authority. If the protocol cannot establish retained keys, this requirement fails; a pool-protocol name or user-interface promise does not pass.</p><h4>Evidence the case requires</h4><p>Work/key binding vectors; malicious-pool attempts; leave-pool authority check.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>pool design seat (a3832b1c3b274b310)</dd></div><div><dt>Run</dt><dd>pool-2.0-20261008-03</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>58</dd></div><div><dt>Plan pages</dt><dd>14, 21, 25, 26</dd></div></dl></div></details><details class="acc-case" id="case-UX-06" data-case="UX-06" data-state="NOT RUN"><summary><span class="c-id">UX-06</span><span class="c-title">Verify actual miner-selected work templates</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P01, P10</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:32 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Provide a pool interface with declared job-declaration support and independent miner templates.</p><h4>Steps</h4><ol><li>Submit miner-selected valid transaction templates and verify what is actually hashed and accepted.</li><li>Have a pool substitute or censor templates and test local verification/fallback.</li><li>Measure payout and acceptance consequences without moving authority to the pool.</li></ol><h4>Accept</h4><p>The advertised selection control exists in accepted work, not only configuration. Undisclosed substitution is detected; supported independent operation remains practical under P10.</p><h4>Evidence the case requires</h4><p>Template commitments; accepted-block evidence; malicious-pool/fallback report.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>shipper (ae892a8b0f78fe31c)</dd></div><div><dt>Run</dt><dd>201-7cfa422a-aa0e0f45</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>58</dd></div><div><dt>Plan pages</dt><dd>14, 21, 25, 26</dd></div></dl></div></details><details class="acc-case" id="case-UX-07" data-case="UX-07" data-state="NOT RUN"><summary><span class="c-id">UX-07</span><span class="c-title">Expose actionable failures and safe updates</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P09, P10</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 21:42 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Create failed proofs, memory pressure, expired jobs, missing payouts and available software updates.</p><h4>Steps</h4><ol><li>Ask independent users to identify the issue, stop safely and follow the recommended action.</li><li>Test explicit update approval, version visibility and a failed/corrupt update.</li><li>Confirm diagnostic exports remove keys and private inputs while retaining useful evidence.</li></ol><h4>Accept</h4><p>P10 task-success requirements hold; no silent update or false success state. Recovery instructions work on supported desktops and secret canaries never enter exported logs.</p><h4>Evidence the case requires</h4><p>Observed tasks; update traces; sanitised export tests.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>shipper (ae892a8b0f78fe31c)</dd></div><div><dt>Run</dt><dd>ux-01-20261008-win-2.0.0</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>59</dd></div><div><dt>Plan pages</dt><dd>14, 21, 25, 26</dd></div></dl></div></details><details class="acc-case" id="case-UX-08" data-case="UX-08" data-state="NOT RUN"><summary><span class="c-id">UX-08</span><span class="c-title">Publish competitive accessible software</span><span class="c-pri"><span class="lbl">Priority </span>GATE</span><span class="c-prof"><span class="lbl">Profile </span>P02, P10</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 19:28 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Provide open documented builds, tuning parameters and known fee conditions for all supported platforms.</p><h4>Steps</h4><ol><li>Compare Ember against independently optimised permissible implementations on identical work.</li><li>Measure efficiency, fees, false rejection, installation and update transparency.</li><li>Scan for hidden developer fees, hardware whitelists, per-address privilege or undisclosed remote controls.</li></ol><h4>Accept</h4><p>P10 relative-efficiency limits hold and all fees/privileges are explicit. No self-reported device tier earns consensus advantage. A superior external implementation triggers investigation, not selective exclusion.</p><h4>Evidence the case requires</h4><p>Matched software comparison; code/config review; fee/privilege inventory.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>hash lane (a690540514aa453d7)</dd></div><div><dt>Run</dt><dd>200-417c4a57-b2</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>59</dd></div><div><dt>Plan pages</dt><dd>14, 21, 25, 26</dd></div></dl></div></details></div></div></section><section class="section acc-suite" id="suite-COM"><div class="container"><div class="acc-suite-head"><div class="acc-suite-code"><span class="n">15</span>COM</div><div class="acc-suite-t"><h2>Paid demand and sustainable delivery</h2><p class="acc-sub">Devnet payouts and subsidised pilots demonstrate mechanics, not independent willingness to pay.</p></div><div class="acc-suite-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></div></div><dl class="acc-facts"><div><dt>Owner</dt><dd>Commercial lead + independent financial/customer reviewer</dd></div><div><dt>Gate</dt><dd>Commercial evidence</dd></div><div><dt>Fixtures</dt><dd>F8 real consenting customers; F7 full service costs; private identity proofs</dd></div><div><dt>Plan pages</dt><dd>4, 17, 18, 24, 26, 27, 31, 32, 33</dd></div></dl><div class="acc-suite-bar"><div class="acc-bar" role="img" aria-label="COM: 8 cases: 0 passed under the standard, 0 running with team evidence, 8 not run, 0 deferred"><span class="seg g-notrun" style="flex-grow:8" title="8 NOT RUN"></span></div><span>8 cases: 0 passed under the standard, 0 running with team evidence, 8 not run, 0 deferred</span></div><div class="acc-cases"><div class="acc-cases-h" aria-hidden="true"><span>Case</span><span>Title</span><span>Priority</span><span>Profile</span><span>Status</span><span>Evidence</span><span>Last run</span><span></span></div><details class="acc-case" id="case-COM-01" data-case="COM-01" data-state="NOT RUN"><summary><span class="c-id">COM-01</span><span class="c-title">Deliver a genuine contracted proof pilot</span><span class="c-pri"><span class="lbl">Priority </span>GATE</span><span class="c-prof"><span class="lbl">Profile </span>P07, P14</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:22 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Select one real external customer with a meaningful fixed workload and no required migration to Igneum.</p><h4>Steps</h4><ol><li>Agree program, inputs, proof format, deadline, price, failure/refund policy and verification method.</li><li>Run paid jobs through ordinary independently operated infrastructure.</li><li>Have the customer verify usefulness, correctness and its reason for choosing the service.</li></ol><h4>Accept</h4><p>The pilot satisfies its actual contract and settles genuine external payment. Trial subsidies are disclosed and cannot satisfy the repeat-demand gate; no invented customer or testimonial.</p><h4>Evidence the case requires</h4><p>Redacted contract; verified jobs; settlement proof; consented customer confirmation.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>main / the founder</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>60</dd></div><div><dt>Plan pages</dt><dd>4, 17, 18, 24, 26, 27, 31, 32, 33</dd></div></dl></div></details><details class="acc-case" id="case-COM-02" data-case="COM-02" data-state="NOT RUN"><summary><span class="c-id">COM-02</span><span class="c-title">Establish independent repeat purchasing</span><span class="c-pri"><span class="lbl">Priority </span>GATE</span><span class="c-prof"><span class="lbl">Profile </span>P14</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:22 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Use the P14 multi-customer observation period and ownership/conflict checks.</p><h4>Steps</h4><ol><li>Track paid purchases on distinct occasions, including refunds and stopped customers.</li><li>Audit related parties, project reimbursements, token grants and circular funding.</li><li>Reconcile external cash received with correctly delivered meaningful work.</li></ol><h4>Accept</h4><p>P14 buyer, duration and volume minima are met without reimbursement or related-party substitution. Repeat orders are separate buying decisions, not a single payment split into many jobs.</p><h4>Evidence the case requires</h4><p>Anonymised buyer ledger; repeat-order dates; conflict review; net receipts.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>main / the founder</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>60</dd></div><div><dt>Plan pages</dt><dd>4, 17, 18, 24, 26, 27, 31, 32, 33</dd></div></dl></div></details><details class="acc-case" id="case-COM-03" data-case="COM-03" data-state="NOT RUN"><summary><span class="c-id">COM-03</span><span class="c-title">Demonstrate service and operator margins</span><span class="c-pri"><span class="lbl">Priority </span>GATE</span><span class="c-prof"><span class="lbl">Profile </span>P12, P14</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:22 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Allocate all delivery costs, including aggregation, retries, hardware, power, host, network and support.</p><h4>Steps</h4><ol><li>Calculate gross contribution and fully loaded unit costs for each contracted workload.</li><li>Reconcile a representative operator's realised earnings against metered costs and opportunity cost.</li><li>Repeat under the declared demand and price sensitivities.</li></ol><h4>Accept</h4><p>P14 contribution targets hold and at least the required operator cohort has positive realised contribution. Excluded overhead is visible; token appreciation or unpriced founder labour cannot silently create profitability.</p><h4>Evidence the case requires</h4><p>Unit-economics ledger; metered operator sample; allocation rules; sensitivity report.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>main / the founder</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>60</dd></div><div><dt>Plan pages</dt><dd>4, 17, 18, 24, 26, 27, 31, 32, 33</dd></div></dl></div></details><details class="acc-case" id="case-COM-04" data-case="COM-04" data-state="NOT RUN"><summary><span class="c-id">COM-04</span><span class="c-title">Meet the customer service guarantee</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P01, P07, P14</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:22 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Observe actual delivery deadlines, validity, failure handling and support over the contracted period.</p><h4>Steps</h4><ol><li>Count all accepted jobs, including failed, retried and abandoned cases.</li><li>Have the customer independently verify results and invoke one authorised refund/failure exercise.</li><li>Compare offered capacity and quoted price with what was actually delivered.</li></ol><h4>Accept</h4><p>P07 and contracted obligations hold; validity has zero accepted exceptions. Failure terms are honoured, and demand beyond capacity is explicitly refused rather than quietly omitted from metrics.</p><h4>Evidence the case requires</h4><p>Customer-verifier records; SLO report; refunds; promised-versus-delivered comparison.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>main / the founder</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>61</dd></div><div><dt>Plan pages</dt><dd>4, 17, 18, 24, 26, 27, 31, 32, 33</dd></div></dl></div></details><details class="acc-case" id="case-COM-05" data-case="COM-05" data-state="NOT RUN"><summary><span class="c-id">COM-05</span><span class="c-title">Compare against the buyer's real alternative</span><span class="c-pri"><span class="lbl">Priority </span>GATE</span><span class="c-prof"><span class="lbl">Profile </span>P14, P15</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:22 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Identify a credible alternative supplier or in-house option for the same workload, proof format and security.</p><h4>Steps</h4><ol><li>Obtain comparable quotes or consented measured trials at the evaluation date.</li><li>Include integration, verification, deadlines and all operational costs, not only proof-generation time.</li><li>Document the customer's actual trade-off without inventing unavailable comparator evidence.</li></ol><h4>Accept</h4><p>P15 commercial comparison is satisfied with like-for-like scope and a evidenced purchase reason. Missing alternative data remains MISSING; it is not scored as an Igneum win.</p><h4>Evidence the case requires</h4><p>Dated comparison; workload/security match; customer decision record.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>main / the founder</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>61</dd></div><div><dt>Plan pages</dt><dd>4, 17, 18, 24, 26, 27, 31, 32, 33</dd></div></dl></div></details><details class="acc-case" id="case-COM-06" data-case="COM-06" data-state="NOT RUN"><summary><span class="c-id">COM-06</span><span class="c-title">Retain buyers after the pilot and subsidy period</span><span class="c-pri"><span class="lbl">Priority </span>GATE</span><span class="c-prof"><span class="lbl">Profile </span>P14</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:22 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Follow all recruited customers through the P14 observation period, including churn.</p><h4>Steps</h4><ol><li>Remove disclosed trial incentives before measuring repeat demand.</li><li>Track renewal, expansion, cancellation reasons, unresolved incidents and buyer concentration.</li><li>Review whether one affiliated or subsidised buyer dominates the apparent market.</li></ol><h4>Accept</h4><p>P14 repeat/concentration conditions hold with honest denominator and churn reporting. Paying demand survives beyond a demonstration; unsatisfied or departed buyers are not removed retrospectively.</p><h4>Evidence the case requires</h4><p>Cohort/renewal ledger; churn notes; concentration and incentive report.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>main / the founder</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>61</dd></div><div><dt>Plan pages</dt><dd>4, 17, 18, 24, 26, 27, 31, 32, 33</dd></div></dl></div></details><details class="acc-case" id="case-COM-07" data-case="COM-07" data-state="NOT RUN"><summary><span class="c-id">COM-07</span><span class="c-title">Fund maintenance without assumed appreciation</span><span class="c-pri"><span class="lbl">Priority </span>GATE</span><span class="c-prof"><span class="lbl">Profile </span>P13</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 21:10 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Prepare a costed plan for development, review, infrastructure, support and incident response.</p><h4>Steps</h4><ol><li>Separate committed resources from revenue dependent on adoption or token price.</li><li>Stress lower income and an unexpected security/operations expense.</li><li>Verify responsible owners and continuity arrangements without changing fair-launch promises.</li></ol><h4>Accept</h4><p>P13 committed-runway requirement holds and downside responses are documented. No uncommitted financing, rising token price or burn accounting is presented as available maintenance funding.</p><h4>Evidence the case requires</h4><p>Budget and commitment evidence; downside plan; owner/continuity roster.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>main / the founder</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>62</dd></div><div><dt>Plan pages</dt><dd>4, 17, 18, 24, 26, 27, 31, 32, 33</dd></div></dl></div></details><details class="acc-case" id="case-COM-08" data-case="COM-08" data-state="NOT RUN"><summary><span class="c-id">COM-08</span><span class="c-title">Let independent developers build useful integrations</span><span class="c-pri"><span class="lbl">Priority </span>GATE</span><span class="c-prof"><span class="lbl">Profile </span>P09, P14</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>2026-10-08 18:3x UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Recruit unaffiliated developers unfamiliar with unpublished implementation details.</p><h4>Steps</h4><ol><li>Use public docs to deploy a supported application or integrate an external proof request and verification flow.</li><li>Record time, undocumented dependencies, workarounds and correctness issues.</li><li>Retest after documentation fixes without founder-written hidden integration code.</li></ol><h4>Accept</h4><p>P14 developer-task minimum passes on the final release; all required public instructions exist. Successful bytecode deployment alone does not count as a working application or service integration.</p><h4>Evidence the case requires</h4><p>Consented developer logs; public examples; issue closure; verified end-to-end journeys.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Independent integration study</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>main / the founder</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>62</dd></div><div><dt>Plan pages</dt><dd>4, 17, 18, 24, 26, 27, 31, 32, 33</dd></div></dl></div></details></div></div></section><section class="section acc-suite" id="suite-LEAD"><div class="container"><div class="acc-suite-head"><div class="acc-suite-code"><span class="n">16</span>LEAD</div><div class="acc-suite-t"><h2>Comparative leadership evidence</h2><p class="acc-sub">A serious contention claim requires comparative outcomes and real adoption evidence, not just an internally green test dashboard.</p></div><div class="acc-suite-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></div></div><dl class="acc-facts"><div><dt>Owner</dt><dd>Independent assessment panel + product/economics reviewers</dd></div><div><dt>Gate</dt><dd>Leadership-contender decision</dd></div><div><dt>Fixtures</dt><dd>F8 peer/customer studies; full signed technical evidence; 90-day observation</dd></div><div><dt>Plan pages</dt><dd>4, 22, 25, 27, 31, 32, 33</dd></div></dl><div class="acc-suite-bar"><div class="acc-bar" role="img" aria-label="LEAD: 8 cases: 0 passed under the standard, 0 running with team evidence, 8 not run, 0 deferred"><span class="seg g-notrun" style="flex-grow:8" title="8 NOT RUN"></span></div><span>8 cases: 0 passed under the standard, 0 running with team evidence, 8 not run, 0 deferred</span></div><div class="acc-cases"><div class="acc-cases-h" aria-hidden="true"><span>Case</span><span>Title</span><span>Priority</span><span>Profile</span><span>Status</span><span>Evidence</span><span>Last run</span><span></span></div><details class="acc-case" id="case-LEAD-01" data-case="LEAD-01" data-state="NOT RUN"><summary><span class="c-id">LEAD-01</span><span class="c-title">Register a fair contemporary comparison</span><span class="c-pri"><span class="lbl">Priority </span>GATE</span><span class="c-prof"><span class="lbl">Profile </span>P15</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>2026-10-08 18:3x UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Choose at least the P15 peer coverage and an evaluation date before collecting confirmatory results.</p><h4>Steps</h4><ol><li>Include the plan's Ravencoin, Ergo and Firo reference set where comparable, then check for other relevant current options.</li><li>Freeze versions, supported hardware, methods, noninferiority margins and commercial alternatives.</li><li>Publish exclusions and prohibit cross-algorithm raw-hashrate comparisons.</li></ol><h4>Accept</h4><p>The protocol covers material alternatives fairly and is signed independently. A missing or non-comparable feature is not scored zero; no arbitrary universal rank is inferred from selected metrics.</p><h4>Evidence the case requires</h4><p>Timestamped peer protocol; source/version records; comparison/exclusion rationale.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Pre-registered comparative study</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>main / the founder</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>63</dd></div><div><dt>Plan pages</dt><dd>4, 22, 25, 27, 31, 32, 33</dd></div></dl></div></details><details class="acc-case" id="case-LEAD-02" data-case="LEAD-02" data-state="NOT RUN"><summary><span class="c-id">LEAD-02</span><span class="c-title">Demonstrate comparable operator advantages</span><span class="c-pri"><span class="lbl">Priority </span>GATE</span><span class="c-prof"><span class="lbl">Profile </span>P02, P10, P15</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:22 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Use matched user tasks and operating conditions on the selected GPU-first networks.</p><h4>Steps</h4><ol><li>Measure install-to-first-accepted-work, software overhead versus each network's tuned baseline, payout friction and retained control.</li><li>Measure rejection/availability under the same network conditions; report fees separately.</li><li>Use blinded analysis where possible and independent runs for decisive differences.</li></ol><h4>Accept</h4><p>P15 noninferiority and superiority requirements hold on meaningful comparable dimensions. No raw hashes from different algorithms are compared, and transient token price is not labelled engineering superiority.</p><h4>Evidence the case requires</h4><p>Matched task data; uncertainty/effect sizes; independent comparison report.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>site lane (a846fd66b5403e35a)</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>63</dd></div><div><dt>Plan pages</dt><dd>4, 22, 25, 27, 31, 32, 33</dd></div></dl></div></details><details class="acc-case" id="case-LEAD-03" data-case="LEAD-03" data-state="NOT RUN"><summary><span class="c-id">LEAD-03</span><span class="c-title">Substantiate the specialist-coexistence claim</span><span class="c-pri"><span class="lbl">Priority </span>GATE</span><span class="c-prof"><span class="lbl">Profile </span>P04, P12, P15</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:22 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Assemble G1-G4 plus frozen rules and all surviving-adversary assumptions.</p><h4>Steps</h4><ol><li>Have independent reviewers trace each public competitiveness statement to its narrowest evidence.</li><li>Separate measured GPUs, modelled silicon and economic scenarios in all summaries.</li><li>Evaluate residual uncertainty, excluded technologies and the no-new-rules counterfactual.</li></ol><h4>Accept</h4><p>All claimed envelopes meet P04/P12 without unsupported universal bounds. Reviewers agree the evidence supports scoped commodity competitiveness even when chips remain compatible; an exact chip-arrival probability is not inferred.</p><h4>Evidence the case requires</h4><p>Claim-to-evidence map; signed envelope review; limitations statement.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>main / the founder</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>63</dd></div><div><dt>Plan pages</dt><dd>4, 22, 25, 27, 31, 32, 33</dd></div></dl></div></details><details class="acc-case" id="case-LEAD-04" data-case="LEAD-04" data-state="NOT RUN"><summary><span class="c-id">LEAD-04</span><span class="c-title">Observe ordinary-operator retention and margins</span><span class="c-pri"><span class="lbl">Priority </span>GATE</span><span class="c-prof"><span class="lbl">Profile </span>P12, P16</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:22 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Recruit the P16 independent cohort before observing results; use privacy-preserving evidence.</p><h4>Steps</h4><ol><li>Follow participation, realised margin, hardware changes, failures and reasons for leaving for 90 days.</li><li>Report trial incentives separately and include every initial participant in retention denominators.</li><li>Compare behaviour with matched alternatives where feasible; disclose absence of an actual downturn.</li></ol><h4>Accept</h4><p>P16 retention/margin minima hold with verified independence and no removal of churned users. Simulated downturns cannot be called observed bear-market retention; historical claims stay limited to the period measured.</p><h4>Evidence the case requires</h4><p>Pseudonymous cohort ledger; margin/retention calculations; departure reasons.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>main / the founder</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>64</dd></div><div><dt>Plan pages</dt><dd>4, 22, 25, 27, 31, 32, 33</dd></div></dl></div></details><details class="acc-case" id="case-LEAD-05" data-case="LEAD-05" data-state="NOT RUN"><summary><span class="c-id">LEAD-05</span><span class="c-title">Measure control and dependency concentration</span><span class="c-pri"><span class="lbl">Priority </span>GATE</span><span class="c-prof"><span class="lbl">Profile </span>P11, P16</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:22 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Audit operational control of mining, voting, proving, aggregation, hosting and software distribution separately.</p><h4>Steps</h4><ol><li>Use opt-in attestations, observed dependencies and independent corroboration; disclose uncertain common ownership.</li><li>Compare concentration and provider-removal outcomes to the approved security and availability assumptions.</li><li>Check that pooled payments do not hide authority concentration and hardware vendors are not equated with operators.</li></ol><h4>Accept</h4><p>P11/P16 concentration requirements hold within disclosed uncertainty; unidentified control cannot be counted as independent. No single removable dependency is falsely marketed as decentralised operation.</p><h4>Evidence the case requires</h4><p>Control/failure-domain map; uncertainty notes; concentration/removal results.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>main / the founder</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>64</dd></div><div><dt>Plan pages</dt><dd>4, 22, 25, 27, 31, 32, 33</dd></div></dl></div></details><details class="acc-case" id="case-LEAD-06" data-case="LEAD-06" data-state="NOT RUN"><summary><span class="c-id">LEAD-06</span><span class="c-title">Complete the reliability observation window</span><span class="c-pri"><span class="lbl">Priority </span>BLOCKER</span><span class="c-prof"><span class="lbl">Profile </span>P01, P16</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:22 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Observe the final candidate and approved compatible updates for the full P16 real-time period.</p><h4>Steps</h4><ol><li>Measure promised service availability, invalid acceptance, finality safety, payouts and incident impact.</li><li>Reconcile external probes, customer records and operator logs, including maintenance and exclusions.</li><li>Repeat affected critical tests after every material change; reset observation where comparability breaks.</li></ol><h4>Accept</h4><p>P16 availability and safety criteria hold on live observation; no hidden downtime or compressed-time substitution. This supports the recorded window only, not multi-year operational maturity.</p><h4>Evidence the case requires</h4><p>90-day SLO ledger; independent probes; incident reports; change/retest history.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>main / the founder</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>64</dd></div><div><dt>Plan pages</dt><dd>4, 22, 25, 27, 31, 32, 33</dd></div></dl></div></details><details class="acc-case" id="case-LEAD-07" data-case="LEAD-07" data-state="NOT RUN"><summary><span class="c-id">LEAD-07</span><span class="c-title">Issue an independent contender assessment</span><span class="c-pri"><span class="lbl">Priority </span>GATE</span><span class="c-prof"><span class="lbl">Profile </span>P00, P15, P16</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>2026-10-08 18:3x UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Provide the full evidence packet, commercial results, comparative study and unresolved-limit register to the panel.</p><h4>Steps</h4><ol><li>Check every mandatory and claimed-option test, source requirement and approved threshold.</li><li>Require separate signoffs for hardware/economics, security/operations and customer/operator evidence.</li><li>Document dissent and challenge any inference that passing an internal checklist proves number-one rank.</li></ol><h4>Accept</h4><p>Every required gate is PASS with no unresolved material challenge, critical/high defect or missing comparator/customer evidence. The panel supports a credible leadership-contender conclusion within scope, not a guaranteed rank.</p><h4>Evidence the case requires</h4><p>Signed assessment; full status index; dissent/limitations; approved claim wording.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Independent final assessment</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>main / the founder</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>65</dd></div><div><dt>Plan pages</dt><dd>4, 22, 25, 27, 31, 32, 33</dd></div></dl></div></details><details class="acc-case" id="case-LEAD-08" data-case="LEAD-08" data-state="NOT RUN"><summary><span class="c-id">LEAD-08</span><span class="c-title">Keep leadership claims valid after release</span><span class="c-pri"><span class="lbl">Priority </span>GATE</span><span class="c-prof"><span class="lbl">Profile </span>P00, P16</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 20:22 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Define material-change triggers and scheduled reviews before publishing the assessment.</p><h4>Steps</h4><ol><li>Refresh competitor, hardware-cost, demand and security evidence at the P16 cadence.</li><li>Test a newly credible specialist, lost customer, major outage and verifier change against invalidation rules.</li><li>Withdraw or narrow stale claims promptly while publishing the new evidence status.</li></ol><h4>Accept</h4><p>Claims remain dated, scoped and revisable; material contrary evidence reopens the appropriate gate. The network may remain usable while a leadership claim is suspended. No permanent self-awarded certification.</p><h4>Evidence the case requires</h4><p>Review calendar; invalidation drills; versioned public claim register.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Release candidate; repeat after relevant changes</dd></div><div><dt>Owner</dt><dd>main / the founder</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Standard page</dt><dd>65</dd></div><div><dt>Plan pages</dt><dd>4, 22, 25, 27, 31, 32, 33</dd></div></dl></div></details></div></div></section><section class="section acc-suite" id="suite-REV"><div class="container"><div class="acc-suite-head"><div class="acc-suite-code"><span class="n">17</span>REV</div><div class="acc-suite-t"><h2>REV: the external review's required regressions</h2><p class="acc-sub">44 regressions from 14 findings; each reads NOT RUN until its owner lane records a run</p></div><div class="acc-suite-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></div></div><dl class="acc-facts"><div><dt>Owner</dt><dd>the owner lanes per the dispatch table</dd></div><div><dt>Gate</dt><dd>Review findings closed</dd></div><div><dt>Fixtures</dt><dd>F0,F5</dd></div><div><dt>Plan pages</dt><dd>docs/analysis/review-2026-10-08-b/findings.json and docs/analysis/review-2026-10-08-b/dispatch.md; ids from the master traceability register</dd></div></dl><div class="acc-suite-bar"><div class="acc-bar" role="img" aria-label="REV: 44 cases: 0 passed under the standard, 0 running with team evidence, 44 not run, 0 deferred"><span class="seg g-notrun" style="flex-grow:44" title="44 NOT RUN"></span></div><span>44 cases: 0 passed under the standard, 0 running with team evidence, 44 not run, 0 deferred</span></div><div class="acc-cases"><div class="acc-cases-h" aria-hidden="true"><span>Case</span><span>Title</span><span>Priority</span><span>Profile</span><span>Status</span><span>Evidence</span><span>Last run</span><span></span></div><details class="acc-case" id="case-R2-F01-R01" data-case="R2-F01-R01" data-state="NOT RUN"><summary><span class="c-id">R2-F01-R01</span><span class="c-title">Valid proof A, warm cache, carried statement B: refuse exactly as a cold node does.</span><span class="c-pri"><span class="lbl">Priority </span>P0</span><span class="c-prof"><span class="lbl">Profile </span>P00</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 21:10 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>The regression R2-F01 requires (review R2 finding F01: Proof-verdict cache omits the statement being verified).</p><h4>Steps</h4><ol><li>Valid proof A, warm cache, carried statement B: refuse exactly as a cold node does.</li></ol><h4>Accept</h4><p>Valid proof A, warm cache, carried statement B: refuse exactly as a cold node does.</p><h4>Evidence the case requires</h4><p>The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Every release candidate</dd></div><div><dt>Owner</dt><dd>proving lane, node lane</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Plan pages</dt><dd>R2-F01</dd></div></dl></div></details><details class="acc-case" id="case-R2-F01-R02" data-case="R2-F01-R02" data-state="NOT RUN"><summary><span class="c-id">R2-F01-R02</span><span class="c-title">Run valid/invalid contexts in both orders, concurrently and across cache eviction/restart.</span><span class="c-pri"><span class="lbl">Priority </span>P0</span><span class="c-prof"><span class="lbl">Profile </span>P00</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 21:10 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>The regression R2-F01 requires (review R2 finding F01: Proof-verdict cache omits the statement being verified).</p><h4>Steps</h4><ol><li>Run valid/invalid contexts in both orders, concurrently and across cache eviction/restart.</li></ol><h4>Accept</h4><p>Run valid/invalid contexts in both orders, concurrently and across cache eviction/restart.</p><h4>Evidence the case requires</h4><p>The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Every release candidate</dd></div><div><dt>Owner</dt><dd>proving lane, node lane</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Plan pages</dt><dd>R2-F01</dd></div></dl></div></details><details class="acc-case" id="case-R2-F01-R03" data-case="R2-F01-R03" data-state="NOT RUN"><summary><span class="c-id">R2-F01-R03</span><span class="c-title">Change payout, network, kind, program ID and activation context; no accepted misbinding.</span><span class="c-pri"><span class="lbl">Priority </span>P0</span><span class="c-prof"><span class="lbl">Profile </span>P00</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 21:10 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>The regression R2-F01 requires (review R2 finding F01: Proof-verdict cache omits the statement being verified).</p><h4>Steps</h4><ol><li>Change payout, network, kind, program ID and activation context; no accepted misbinding.</li></ol><h4>Accept</h4><p>Change payout, network, kind, program ID and activation context; no accepted misbinding.</p><h4>Evidence the case requires</h4><p>The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Every release candidate</dd></div><div><dt>Owner</dt><dd>proving lane, node lane</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Plan pages</dt><dd>R2-F01</dd></div></dl></div></details><details class="acc-case" id="case-R2-F01-R04" data-case="R2-F01-R04" data-state="NOT RUN"><summary><span class="c-id">R2-F01-R04</span><span class="c-title">A native two-node test must agree on block validity and payouts despite different cache histories.</span><span class="c-pri"><span class="lbl">Priority </span>P0</span><span class="c-prof"><span class="lbl">Profile </span>P00</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 21:10 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>The regression R2-F01 requires (review R2 finding F01: Proof-verdict cache omits the statement being verified).</p><h4>Steps</h4><ol><li>A native two-node test must agree on block validity and payouts despite different cache histories.</li></ol><h4>Accept</h4><p>A native two-node test must agree on block validity and payouts despite different cache histories.</p><h4>Evidence the case requires</h4><p>The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Every release candidate</dd></div><div><dt>Owner</dt><dd>proving lane, node lane</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Plan pages</dt><dd>R2-F01</dd></div></dl></div></details><details class="acc-case" id="case-R2-F02-R01" data-case="R2-F02-R01" data-state="NOT RUN"><summary><span class="c-id">R2-F02-R01</span><span class="c-title">Release build cannot activate test bypass.</span><span class="c-pri"><span class="lbl">Priority </span>P0</span><span class="c-prof"><span class="lbl">Profile </span>P00</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 21:10 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>The regression R2-F02 requires (review R2 finding F02: Proof-rule infrastructure can fail open).</p><h4>Steps</h4><ol><li>Release build cannot activate test bypass.</li></ol><h4>Accept</h4><p>Release build cannot activate test bypass.</p><h4>Evidence the case requires</h4><p>The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Every release candidate</dd></div><div><dt>Owner</dt><dd>proving lane, CI steward</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Plan pages</dt><dd>R2-F02</dd></div></dl></div></details><details class="acc-case" id="case-R2-F02-R02" data-case="R2-F02-R02" data-state="NOT RUN"><summary><span class="c-id">R2-F02-R02</span><span class="c-title">Missing oracle or pinned keys prevents service readiness after enforcement activation.</span><span class="c-pri"><span class="lbl">Priority </span>P0</span><span class="c-prof"><span class="lbl">Profile </span>P00</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 21:10 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>The regression R2-F02 requires (review R2 finding F02: Proof-rule infrastructure can fail open).</p><h4>Steps</h4><ol><li>Missing oracle or pinned keys prevents service readiness after enforcement activation.</li></ol><h4>Accept</h4><p>Missing oracle or pinned keys prevents service readiness after enforcement activation.</p><h4>Evidence the case requires</h4><p>The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Every release candidate</dd></div><div><dt>Owner</dt><dd>proving lane, CI steward</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Plan pages</dt><dd>R2-F02</dd></div></dl></div></details><details class="acc-case" id="case-R2-F02-R03" data-case="R2-F02-R03" data-state="NOT RUN"><summary><span class="c-id">R2-F02-R03</span><span class="c-title">Missing proof bytes retry without incorrectly marking a valid block permanently invalid.</span><span class="c-pri"><span class="lbl">Priority </span>P0</span><span class="c-prof"><span class="lbl">Profile </span>P00</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 21:10 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>The regression R2-F02 requires (review R2 finding F02: Proof-rule infrastructure can fail open).</p><h4>Steps</h4><ol><li>Missing proof bytes retry without incorrectly marking a valid block permanently invalid.</li></ol><h4>Accept</h4><p>Missing proof bytes retry without incorrectly marking a valid block permanently invalid.</p><h4>Evidence the case requires</h4><p>The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Every release candidate</dd></div><div><dt>Owner</dt><dd>proving lane, CI steward</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Plan pages</dt><dd>R2-F02</dd></div></dl></div></details><details class="acc-case" id="case-R2-F03-R01" data-case="R2-F03-R01" data-state="NOT RUN"><summary><span class="c-id">R2-F03-R01</span><span class="c-title">Clean build from one manifest, including the pool and workers, with no unpublished vendor tree.</span><span class="c-pri"><span class="lbl">Priority </span>P0</span><span class="c-prof"><span class="lbl">Profile </span>P00</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 21:10 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>The regression R2-F03 requires (review R2 finding F03: The bundle contains a v6 candidate, not a demonstrated integrated v6 release).</p><h4>Steps</h4><ol><li>Clean build from one manifest, including the pool and workers, with no unpublished vendor tree.</li></ol><h4>Accept</h4><p>Clean build from one manifest, including the pool and workers, with no unpublished vendor tree.</p><h4>Evidence the case requires</h4><p>The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Every release candidate</dd></div><div><dt>Owner</dt><dd>CI steward, hash lane (ProgramClass::V6 on freeze), pool lane</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Plan pages</dt><dd>R2-F03</dd></div></dl></div></details><details class="acc-case" id="case-R2-F03-R02" data-case="R2-F03-R02" data-state="NOT RUN"><summary><span class="c-id">R2-F03-R02</span><span class="c-title">Same job context produces identical accepted work in node, CPU reference, CUDA, Metal, OpenCL and pool.</span><span class="c-pri"><span class="lbl">Priority </span>P0</span><span class="c-prof"><span class="lbl">Profile </span>P00</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 21:10 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>The regression R2-F03 requires (review R2 finding F03: The bundle contains a v6 candidate, not a demonstrated integrated v6 release).</p><h4>Steps</h4><ol><li>Same job context produces identical accepted work in node, CPU reference, CUDA, Metal, OpenCL and pool.</li></ol><h4>Accept</h4><p>Same job context produces identical accepted work in node, CPU reference, CUDA, Metal, OpenCL and pool.</p><h4>Evidence the case requires</h4><p>The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Every release candidate</dd></div><div><dt>Owner</dt><dd>CI steward, hash lane (ProgramClass::V6 on freeze), pool lane</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Plan pages</dt><dd>R2-F03</dd></div></dl></div></details><details class="acc-case" id="case-R2-F03-R03" data-case="R2-F03-R03" data-state="NOT RUN"><summary><span class="c-id">R2-F03-R03</span><span class="c-title">Cross every scheduled transition with old/new client behavior documented and identical rule identities.</span><span class="c-pri"><span class="lbl">Priority </span>P0</span><span class="c-prof"><span class="lbl">Profile </span>P00</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 21:10 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>The regression R2-F03 requires (review R2 finding F03: The bundle contains a v6 candidate, not a demonstrated integrated v6 release).</p><h4>Steps</h4><ol><li>Cross every scheduled transition with old/new client behavior documented and identical rule identities.</li></ol><h4>Accept</h4><p>Cross every scheduled transition with old/new client behavior documented and identical rule identities.</p><h4>Evidence the case requires</h4><p>The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Every release candidate</dd></div><div><dt>Owner</dt><dd>CI steward, hash lane (ProgramClass::V6 on freeze), pool lane</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Plan pages</dt><dd>R2-F03</dd></div></dl></div></details><details class="acc-case" id="case-R2-F04-R01" data-case="R2-F04-R01" data-state="NOT RUN"><summary><span class="c-id">R2-F04-R01</span><span class="c-title">Native multi-node 40/40/20 partition, equivocation and dust-valid mining on both sides past the window.</span><span class="c-pri"><span class="lbl">Priority </span>P0</span><span class="c-prof"><span class="lbl">Profile </span>P00</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 21:10 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>The regression R2-F04 requires (review R2 finding F04: Finality v4 recovery deliberately has a weaker safety boundary).</p><h4>Steps</h4><ol><li>Native multi-node 40/40/20 partition, equivocation and dust-valid mining on both sides past the window.</li></ol><h4>Accept</h4><p>Native multi-node 40/40/20 partition, equivocation and dust-valid mining on both sides past the window.</p><h4>Evidence the case requires</h4><p>The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Every release candidate</dd></div><div><dt>Owner</dt><dd>node lane, reference apps, site (explorer)</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Plan pages</dt><dd>R2-F04</dd></div></dl></div></details><details class="acc-case" id="case-R2-F04-R02" data-case="R2-F04-R02" data-state="NOT RUN"><summary><span class="c-id">R2-F04-R02</span><span class="c-title">Proof that the chosen recovery guarantee matches the public finality claim; two valid contradictory certificates are a hard failure for strong finality.</span><span class="c-pri"><span class="lbl">Priority </span>P0</span><span class="c-prof"><span class="lbl">Profile </span>P00</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 21:10 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>The regression R2-F04 requires (review R2 finding F04: Finality v4 recovery deliberately has a weaker safety boundary).</p><h4>Steps</h4><ol><li>Proof that the chosen recovery guarantee matches the public finality claim; two valid contradictory certificates are a hard failure for strong finality.</li></ol><h4>Accept</h4><p>Proof that the chosen recovery guarantee matches the public finality claim; two valid contradictory certificates are a hard failure for strong finality.</p><h4>Evidence the case requires</h4><p>The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Every release candidate</dd></div><div><dt>Owner</dt><dd>node lane, reference apps, site (explorer)</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Plan pages</dt><dd>R2-F04</dd></div></dl></div></details><details class="acc-case" id="case-R2-F04-R03" data-case="R2-F04-R03" data-state="NOT RUN"><summary><span class="c-id">R2-F04-R03</span><span class="c-title">Pause-only resume with historical backfill, missing historical data and all old keys returning.</span><span class="c-pri"><span class="lbl">Priority </span>P0</span><span class="c-prof"><span class="lbl">Profile </span>P00</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 21:10 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>The regression R2-F04 requires (review R2 finding F04: Finality v4 recovery deliberately has a weaker safety boundary).</p><h4>Steps</h4><ol><li>Pause-only resume with historical backfill, missing historical data and all old keys returning.</li></ol><h4>Accept</h4><p>Pause-only resume with historical backfill, missing historical data and all old keys returning.</p><h4>Evidence the case requires</h4><p>The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Every release candidate</dd></div><div><dt>Owner</dt><dd>node lane, reference apps, site (explorer)</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Plan pages</dt><dd>R2-F04</dd></div></dl></div></details><details class="acc-case" id="case-R2-F04-R04" data-case="R2-F04-R04" data-state="NOT RUN"><summary><span class="c-id">R2-F04-R04</span><span class="c-title">Wallet, receipt and oracle consumers distinguish any weaker recovery state.</span><span class="c-pri"><span class="lbl">Priority </span>P0</span><span class="c-prof"><span class="lbl">Profile </span>P00</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 21:10 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>The regression R2-F04 requires (review R2 finding F04: Finality v4 recovery deliberately has a weaker safety boundary).</p><h4>Steps</h4><ol><li>Wallet, receipt and oracle consumers distinguish any weaker recovery state.</li></ol><h4>Accept</h4><p>Wallet, receipt and oracle consumers distinguish any weaker recovery state.</p><h4>Evidence the case requires</h4><p>The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Every release candidate</dd></div><div><dt>Owner</dt><dd>node lane, reference apps, site (explorer)</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Plan pages</dt><dd>R2-F04</dd></div></dl></div></details><details class="acc-case" id="case-R2-F05-R01" data-case="R2-F05-R01" data-state="NOT RUN"><summary><span class="c-id">R2-F05-R01</span><span class="c-title">Native reference-vs-incremental expression equivalence across all source registers and real instruction updates.</span><span class="c-pri"><span class="lbl">Priority </span>P1</span><span class="c-prof"><span class="lbl">Profile </span>P00</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 21:10 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>The regression R2-F05 requires (review R2 finding F05: reg64 address coupling has an exact incremental alternative).</p><h4>Steps</h4><ol><li>Native reference-vs-incremental expression equivalence across all source registers and real instruction updates.</li></ol><h4>Accept</h4><p>Native reference-vs-incremental expression equivalence across all source registers and real instruction updates.</p><h4>Evidence the case requires</h4><p>The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Every release candidate</dd></div><div><dt>Owner</dt><dd>hash lane, adversary lane, floor lane 3</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Plan pages</dt><dd>R2-F05</dd></div></dl></div></details><details class="acc-case" id="case-R2-F05-R02" data-case="R2-F05-R02" data-state="NOT RUN"><summary><span class="c-id">R2-F05-R02</span><span class="c-title">Full-kernel output equivalence, registers, spills, wall power and accepted throughput across target GPUs.</span><span class="c-pri"><span class="lbl">Priority </span>P1</span><span class="c-prof"><span class="lbl">Profile </span>P00</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 21:10 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>The regression R2-F05 requires (review R2 finding F05: reg64 address coupling has an exact incremental alternative).</p><h4>Steps</h4><ol><li>Full-kernel output equivalence, registers, spills, wall power and accepted throughput across target GPUs.</li></ol><h4>Accept</h4><p>Full-kernel output equivalence, registers, spills, wall power and accepted throughput across target GPUs.</p><h4>Evidence the case requires</h4><p>The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Every release candidate</dd></div><div><dt>Owner</dt><dd>hash lane, adversary lane, floor lane 3</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Plan pages</dt><dd>R2-F05</dd></div></dl></div></details><details class="acc-case" id="case-R2-F05-R03" data-case="R2-F05-R03" data-state="NOT RUN"><summary><span class="c-id">R2-F05-R03</span><span class="c-title">Adversary physical design includes prefix caching/recomputation cost; no assumed full 63-read cost on every load.</span><span class="c-pri"><span class="lbl">Priority </span>P1</span><span class="c-prof"><span class="lbl">Profile </span>P00</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 21:10 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>The regression R2-F05 requires (review R2 finding F05: reg64 address coupling has an exact incremental alternative).</p><h4>Steps</h4><ol><li>Adversary physical design includes prefix caching/recomputation cost; no assumed full 63-read cost on every load.</li></ol><h4>Accept</h4><p>Adversary physical design includes prefix caching/recomputation cost; no assumed full 63-read cost on every load.</p><h4>Evidence the case requires</h4><p>The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Every release candidate</dd></div><div><dt>Owner</dt><dd>hash lane, adversary lane, floor lane 3</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Plan pages</dt><dd>R2-F05</dd></div></dl></div></details><details class="acc-case" id="case-R2-F06-R01" data-case="R2-F06-R01" data-state="NOT RUN"><summary><span class="c-id">R2-F06-R01</span><span class="c-title">Acceptance/reference/emitter evaluate the same activated schedule.</span><span class="c-pri"><span class="lbl">Priority </span>P1</span><span class="c-prof"><span class="lbl">Profile </span>P00</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 21:10 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>The regression R2-F06 requires (review R2 finding F06: The v6 acceptance and census gates are not complete for the final execution).</p><h4>Steps</h4><ol><li>Acceptance/reference/emitter evaluate the same activated schedule.</li></ol><h4>Accept</h4><p>Acceptance/reference/emitter evaluate the same activated schedule.</p><h4>Evidence the case requires</h4><p>The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Every release candidate</dd></div><div><dt>Owner</dt><dd>hash lane, research lane D</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Plan pages</dt><dd>R2-F06</dd></div></dl></div></details><details class="acc-case" id="case-R2-F06-R02" data-case="R2-F06-R02" data-state="NOT RUN"><summary><span class="c-id">R2-F06-R02</span><span class="c-title">Full live-dataset census on unseen seeds and the complete v6 pack.</span><span class="c-pri"><span class="lbl">Priority </span>P1</span><span class="c-prof"><span class="lbl">Profile </span>P00</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 21:10 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>The regression R2-F06 requires (review R2 finding F06: The v6 acceptance and census gates are not complete for the final execution).</p><h4>Steps</h4><ol><li>Full live-dataset census on unseen seeds and the complete v6 pack.</li></ol><h4>Accept</h4><p>Full live-dataset census on unseen seeds and the complete v6 pack.</p><h4>Evidence the case requires</h4><p>The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Every release candidate</dd></div><div><dt>Owner</dt><dd>hash lane, research lane D</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Plan pages</dt><dd>R2-F06</dd></div></dl></div></details><details class="acc-case" id="case-R2-F06-R03" data-case="R2-F06-R03" data-state="NOT RUN"><summary><span class="c-id">R2-F06-R03</span><span class="c-title">A failed experimental rule does not silently exhaust generation or bypass the intended resource requirement.</span><span class="c-pri"><span class="lbl">Priority </span>P1</span><span class="c-prof"><span class="lbl">Profile </span>P00</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 21:10 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>The regression R2-F06 requires (review R2 finding F06: The v6 acceptance and census gates are not complete for the final execution).</p><h4>Steps</h4><ol><li>A failed experimental rule does not silently exhaust generation or bypass the intended resource requirement.</li></ol><h4>Accept</h4><p>A failed experimental rule does not silently exhaust generation or bypass the intended resource requirement.</p><h4>Evidence the case requires</h4><p>The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Every release candidate</dd></div><div><dt>Owner</dt><dd>hash lane, research lane D</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Plan pages</dt><dd>R2-F06</dd></div></dl></div></details><details class="acc-case" id="case-R2-F07-R01" data-case="R2-F07-R01" data-state="NOT RUN"><summary><span class="c-id">R2-F07-R01</span><span class="c-title">Same final v6 configuration: mine -&gt; evict -&gt; prove -&gt; aggregate -&gt; submit -&gt; rebuild -&gt; resume; no leaked reservations.</span><span class="c-pri"><span class="lbl">Priority </span>P1</span><span class="c-prof"><span class="lbl">Profile </span>P00</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 21:10 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>The regression R2-F07 requires (review R2 finding F07: VRAM admission and proving deadlines need one operator-level scheduler).</p><h4>Steps</h4><ol><li>Same final v6 configuration: mine -&gt; evict -&gt; prove -&gt; aggregate -&gt; submit -&gt; rebuild -&gt; resume; no leaked reservations.</li></ol><h4>Accept</h4><p>Same final v6 configuration: mine -&gt; evict -&gt; prove -&gt; aggregate -&gt; submit -&gt; rebuild -&gt; resume; no leaked reservations.</p><h4>Evidence the case requires</h4><p>The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Every release candidate</dd></div><div><dt>Owner</dt><dd>app lane, fleet lane</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Plan pages</dt><dd>R2-F07</dd></div></dl></div></details><details class="acc-case" id="case-R2-F07-R02" data-case="R2-F07-R02" data-state="NOT RUN"><summary><span class="c-id">R2-F07-R02</span><span class="c-title">OOM, process crash and stale work recover without losing wallet state or silently consuming power.</span><span class="c-pri"><span class="lbl">Priority </span>P1</span><span class="c-prof"><span class="lbl">Profile </span>P00</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 21:10 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>The regression R2-F07 requires (review R2 finding F07: VRAM admission and proving deadlines need one operator-level scheduler).</p><h4>Steps</h4><ol><li>OOM, process crash and stale work recover without losing wallet state or silently consuming power.</li></ol><h4>Accept</h4><p>OOM, process crash and stale work recover without losing wallet state or silently consuming power.</p><h4>Evidence the case requires</h4><p>The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Every release candidate</dd></div><div><dt>Owner</dt><dd>app lane, fleet lane</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Plan pages</dt><dd>R2-F07</dd></div></dl></div></details><details class="acc-case" id="case-R2-F07-R03" data-case="R2-F07-R03" data-state="NOT RUN"><summary><span class="c-id">R2-F07-R03</span><span class="c-title">16 GB+ simultaneous mode only after measured peak plus next-epoch headroom; smaller-card modes labelled separately.</span><span class="c-pri"><span class="lbl">Priority </span>P1</span><span class="c-prof"><span class="lbl">Profile </span>P00</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 21:10 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>The regression R2-F07 requires (review R2 finding F07: VRAM admission and proving deadlines need one operator-level scheduler).</p><h4>Steps</h4><ol><li>16 GB+ simultaneous mode only after measured peak plus next-epoch headroom; smaller-card modes labelled separately.</li></ol><h4>Accept</h4><p>16 GB+ simultaneous mode only after measured peak plus next-epoch headroom; smaller-card modes labelled separately.</p><h4>Evidence the case requires</h4><p>The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Every release candidate</dd></div><div><dt>Owner</dt><dd>app lane, fleet lane</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Plan pages</dt><dd>R2-F07</dd></div></dl></div></details><details class="acc-case" id="case-R2-F08-R01" data-case="R2-F08-R01" data-state="NOT RUN"><summary><span class="c-id">R2-F08-R01</span><span class="c-title">Report every eligible job outcome, including expired work; a bounded list cannot hide losses.</span><span class="c-pri"><span class="lbl">Priority </span>P1</span><span class="c-prof"><span class="lbl">Profile </span>P00</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 21:10 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>The regression R2-F08 requires (review R2 finding F08: The proving pipeline reports waste and deadline censoring, not sustained capacity).</p><h4>Steps</h4><ol><li>Report every eligible job outcome, including expired work; a bounded list cannot hide losses.</li></ol><h4>Accept</h4><p>Report every eligible job outcome, including expired work; a bounded list cannot hide losses.</p><h4>Evidence the case requires</h4><p>The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Every release candidate</dd></div><div><dt>Owner</dt><dd>proving lane, fleet lane, site (ops page)</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Plan pages</dt><dd>R2-F08</dd></div></dl></div></details><details class="acc-case" id="case-R2-F08-R02" data-case="R2-F08-R02" data-state="NOT RUN"><summary><span class="c-id">R2-F08-R02</span><span class="c-title">Consumer tiers complete and receive payment for declared jobs before claims about income.</span><span class="c-pri"><span class="lbl">Priority </span>P1</span><span class="c-prof"><span class="lbl">Profile </span>P00</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 21:10 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>The regression R2-F08 requires (review R2 finding F08: The proving pipeline reports waste and deadline censoring, not sustained capacity).</p><h4>Steps</h4><ol><li>Consumer tiers complete and receive payment for declared jobs before claims about income.</li></ol><h4>Accept</h4><p>Consumer tiers complete and receive payment for declared jobs before claims about income.</p><h4>Evidence the case requires</h4><p>The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Every release candidate</dd></div><div><dt>Owner</dt><dd>proving lane, fleet lane, site (ops page)</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Plan pages</dt><dd>R2-F08</dd></div></dl></div></details><details class="acc-case" id="case-R2-F08-R03" data-case="R2-F08-R03" data-state="NOT RUN"><summary><span class="c-id">R2-F08-R03</span><span class="c-title">Sustained real workload across class transitions, with restart/retry and no publisher intervention.</span><span class="c-pri"><span class="lbl">Priority </span>P1</span><span class="c-prof"><span class="lbl">Profile </span>P00</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 21:10 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>The regression R2-F08 requires (review R2 finding F08: The proving pipeline reports waste and deadline censoring, not sustained capacity).</p><h4>Steps</h4><ol><li>Sustained real workload across class transitions, with restart/retry and no publisher intervention.</li></ol><h4>Accept</h4><p>Sustained real workload across class transitions, with restart/retry and no publisher intervention.</p><h4>Evidence the case requires</h4><p>The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Every release candidate</dd></div><div><dt>Owner</dt><dd>proving lane, fleet lane, site (ops page)</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Plan pages</dt><dd>R2-F08</dd></div></dl></div></details><details class="acc-case" id="case-R2-F09-R01" data-case="R2-F09-R01" data-state="NOT RUN"><summary><span class="c-id">R2-F09-R01</span><span class="c-title">Generate all pass/fail cells directly from the declared inequalities and inputs.</span><span class="c-pri"><span class="lbl">Priority </span>P1</span><span class="c-prof"><span class="lbl">Profile </span>P00</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 21:10 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>The regression R2-F09 requires (review R2 finding F09: The economic model explicitly retains a failed specialist case).</p><h4>Steps</h4><ol><li>Generate all pass/fail cells directly from the declared inequalities and inputs.</li></ol><h4>Accept</h4><p>Generate all pass/fail cells directly from the declared inequalities and inputs.</p><h4>Evidence the case requires</h4><p>The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Every release candidate</dd></div><div><dt>Owner</dt><dd>research lane, floor lane 3, coordinator</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Plan pages</dt><dd>R2-F09</dd></div></dl></div></details><details class="acc-case" id="case-R2-F09-R02" data-case="R2-F09-R02" data-state="NOT RUN"><summary><span class="c-id">R2-F09-R02</span><span class="c-title">Independent feasibility and cost evaluation of the strongest modeled SRAM/hybrid opponent.</span><span class="c-pri"><span class="lbl">Priority </span>P1</span><span class="c-prof"><span class="lbl">Profile </span>P00</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 21:10 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>The regression R2-F09 requires (review R2 finding F09: The economic model explicitly retains a failed specialist case).</p><h4>Steps</h4><ol><li>Independent feasibility and cost evaluation of the strongest modeled SRAM/hybrid opponent.</li></ol><h4>Accept</h4><p>Independent feasibility and cost evaluation of the strongest modeled SRAM/hybrid opponent.</p><h4>Evidence the case requires</h4><p>The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Every release candidate</dd></div><div><dt>Owner</dt><dd>research lane, floor lane 3, coordinator</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Plan pages</dt><dd>R2-F09</dd></div></dl></div></details><details class="acc-case" id="case-R2-F09-R03" data-case="R2-F09-R03" data-state="NOT RUN"><summary><span class="c-id">R2-F09-R03</span><span class="c-title">GPU owners and entrants remain viable under the approved scenario envelope without assuming chip absence or death.</span><span class="c-pri"><span class="lbl">Priority </span>P1</span><span class="c-prof"><span class="lbl">Profile </span>P00</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 21:10 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>The regression R2-F09 requires (review R2 finding F09: The economic model explicitly retains a failed specialist case).</p><h4>Steps</h4><ol><li>GPU owners and entrants remain viable under the approved scenario envelope without assuming chip absence or death.</li></ol><h4>Accept</h4><p>GPU owners and entrants remain viable under the approved scenario envelope without assuming chip absence or death.</p><h4>Evidence the case requires</h4><p>The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Every release candidate</dd></div><div><dt>Owner</dt><dd>research lane, floor lane 3, coordinator</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Plan pages</dt><dd>R2-F09</dd></div></dl></div></details><details class="acc-case" id="case-R2-F10-R01" data-case="R2-F10-R01" data-state="NOT RUN"><summary><span class="c-id">R2-F10-R01</span><span class="c-title">Compare exact found nonce/hash sets with full-read mode, including all-hit overflow and zero-hit cases.</span><span class="c-pri"><span class="lbl">Priority </span>P2</span><span class="c-prof"><span class="lbl">Profile </span>P00</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 21:10 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>The regression R2-F10 requires (review R2 finding F10: CUDA production readback has an existing OpenCL optimization to borrow).</p><h4>Steps</h4><ol><li>Compare exact found nonce/hash sets with full-read mode, including all-hit overflow and zero-hit cases.</li></ol><h4>Accept</h4><p>Compare exact found nonce/hash sets with full-read mode, including all-hit overflow and zero-hit cases.</p><h4>Evidence the case requires</h4><p>The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Every release candidate</dd></div><div><dt>Owner</dt><dd>worker lane (new)</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Plan pages</dt><dd>R2-F10</dd></div></dl></div></details><details class="acc-case" id="case-R2-F10-R02" data-case="R2-F10-R02" data-state="NOT RUN"><summary><span class="c-id">R2-F10-R02</span><span class="c-title">Test stale jobs, high-32 rollover, tail batches and asynchronous buffer reuse.</span><span class="c-pri"><span class="lbl">Priority </span>P2</span><span class="c-prof"><span class="lbl">Profile </span>P00</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 21:10 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>The regression R2-F10 requires (review R2 finding F10: CUDA production readback has an existing OpenCL optimization to borrow).</p><h4>Steps</h4><ol><li>Test stale jobs, high-32 rollover, tail batches and asynchronous buffer reuse.</li></ol><h4>Accept</h4><p>Test stale jobs, high-32 rollover, tail batches and asynchronous buffer reuse.</p><h4>Evidence the case requires</h4><p>The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Every release candidate</dd></div><div><dt>Owner</dt><dd>worker lane (new)</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Plan pages</dt><dd>R2-F10</dd></div></dl></div></details><details class="acc-case" id="case-R2-F10-R03" data-case="R2-F10-R03" data-state="NOT RUN"><summary><span class="c-id">R2-F10-R03</span><span class="c-title">Compare production throughput and wall energy, not only the isolated kernel timer.</span><span class="c-pri"><span class="lbl">Priority </span>P2</span><span class="c-prof"><span class="lbl">Profile </span>P00</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 21:10 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>The regression R2-F10 requires (review R2 finding F10: CUDA production readback has an existing OpenCL optimization to borrow).</p><h4>Steps</h4><ol><li>Compare production throughput and wall energy, not only the isolated kernel timer.</li></ol><h4>Accept</h4><p>Compare production throughput and wall energy, not only the isolated kernel timer.</p><h4>Evidence the case requires</h4><p>The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Every release candidate</dd></div><div><dt>Owner</dt><dd>worker lane (new)</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Plan pages</dt><dd>R2-F10</dd></div></dl></div></details><details class="acc-case" id="case-R2-F11-R01" data-case="R2-F11-R01" data-state="NOT RUN"><summary><span class="c-id">R2-F11-R01</span><span class="c-title">Goal switch from an efficiency prior can explore higher core/power when policy allows.</span><span class="c-pri"><span class="lbl">Priority </span>P2</span><span class="c-prof"><span class="lbl">Profile </span>P00</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 21:10 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>The regression R2-F11 requires (review R2 finding F11: Ember needs workload-aware identity and objective-aware search).</p><h4>Steps</h4><ol><li>Goal switch from an efficiency prior can explore higher core/power when policy allows.</li></ol><h4>Accept</h4><p>Goal switch from an efficiency prior can explore higher core/power when policy allows.</p><h4>Evidence the case requires</h4><p>The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Every release candidate</dd></div><div><dt>Owner</dt><dd>Ember lane (new)</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Plan pages</dt><dd>R2-F11</dd></div></dl></div></details><details class="acc-case" id="case-R2-F11-R02" data-case="R2-F11-R02" data-state="NOT RUN"><summary><span class="c-id">R2-F11-R02</span><span class="c-title">Driver, workload, dataset, compiler and device changes invalidate certification while retaining optional hints.</span><span class="c-pri"><span class="lbl">Priority </span>P2</span><span class="c-prof"><span class="lbl">Profile </span>P00</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 21:10 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>The regression R2-F11 requires (review R2 finding F11: Ember needs workload-aware identity and objective-aware search).</p><h4>Steps</h4><ol><li>Driver, workload, dataset, compiler and device changes invalidate certification while retaining optional hints.</li></ol><h4>Accept</h4><p>Driver, workload, dataset, compiler and device changes invalidate certification while retaining optional hints.</p><h4>Evidence the case requires</h4><p>The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Every release candidate</dd></div><div><dt>Owner</dt><dd>Ember lane (new)</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Plan pages</dt><dd>R2-F11</dd></div></dl></div></details><details class="acc-case" id="case-R2-F11-R03" data-case="R2-F11-R03" data-state="NOT RUN"><summary><span class="c-id">R2-F11-R03</span><span class="c-title">Thermal/error/late-share events revert safely, including process or machine crash.</span><span class="c-pri"><span class="lbl">Priority </span>P2</span><span class="c-prof"><span class="lbl">Profile </span>P00</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 21:10 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>The regression R2-F11 requires (review R2 finding F11: Ember needs workload-aware identity and objective-aware search).</p><h4>Steps</h4><ol><li>Thermal/error/late-share events revert safely, including process or machine crash.</li></ol><h4>Accept</h4><p>Thermal/error/late-share events revert safely, including process or machine crash.</p><h4>Evidence the case requires</h4><p>The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Every release candidate</dd></div><div><dt>Owner</dt><dd>Ember lane (new)</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Plan pages</dt><dd>R2-F11</dd></div></dl></div></details><details class="acc-case" id="case-R2-F12-R01" data-case="R2-F12-R01" data-state="NOT RUN"><summary><span class="c-id">R2-F12-R01</span><span class="c-title">Crash before/after broadcast, response timeout, restart before snapshot: no duplicate payment or silent debt loss.</span><span class="c-pri"><span class="lbl">Priority </span>P1</span><span class="c-prof"><span class="lbl">Profile </span>P00</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 21:10 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>The regression R2-F12 requires (review R2 finding F12: Pool payouts have a broadcast-before-durable-intent window).</p><h4>Steps</h4><ol><li>Crash before/after broadcast, response timeout, restart before snapshot: no duplicate payment or silent debt loss.</li></ol><h4>Accept</h4><p>Crash before/after broadcast, response timeout, restart before snapshot: no duplicate payment or silent debt loss.</p><h4>Evidence the case requires</h4><p>The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Every release candidate</dd></div><div><dt>Owner</dt><dd>pool lane (new)</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Plan pages</dt><dd>R2-F12</dd></div></dl></div></details><details class="acc-case" id="case-R2-F12-R02" data-case="R2-F12-R02" data-state="NOT RUN"><summary><span class="c-id">R2-F12-R02</span><span class="c-title">Same signed transaction retried, fee replacement reconciled by intent, not a new payment.</span><span class="c-pri"><span class="lbl">Priority </span>P1</span><span class="c-prof"><span class="lbl">Profile </span>P00</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 21:10 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>The regression R2-F12 requires (review R2 finding F12: Pool payouts have a broadcast-before-durable-intent window).</p><h4>Steps</h4><ol><li>Same signed transaction retried, fee replacement reconciled by intent, not a new payment.</li></ol><h4>Accept</h4><p>Same signed transaction retried, fee replacement reconciled by intent, not a new payment.</p><h4>Evidence the case requires</h4><p>The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Every release candidate</dd></div><div><dt>Owner</dt><dd>pool lane (new)</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Plan pages</dt><dd>R2-F12</dd></div></dl></div></details><details class="acc-case" id="case-R2-F12-R03" data-case="R2-F12-R03" data-state="NOT RUN"><summary><span class="c-id">R2-F12-R03</span><span class="c-title">Receipt reorg and finality pause leave correct pending obligations.</span><span class="c-pri"><span class="lbl">Priority </span>P1</span><span class="c-prof"><span class="lbl">Profile </span>P00</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 21:10 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>The regression R2-F12 requires (review R2 finding F12: Pool payouts have a broadcast-before-durable-intent window).</p><h4>Steps</h4><ol><li>Receipt reorg and finality pause leave correct pending obligations.</li></ol><h4>Accept</h4><p>Receipt reorg and finality pause leave correct pending obligations.</p><h4>Evidence the case requires</h4><p>The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Every release candidate</dd></div><div><dt>Owner</dt><dd>pool lane (new)</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Plan pages</dt><dd>R2-F12</dd></div></dl></div></details><details class="acc-case" id="case-R2-F13-R01" data-case="R2-F13-R01" data-state="NOT RUN"><summary><span class="c-id">R2-F13-R01</span><span class="c-title">Repeated authorization rejected or atomically replaces and cleans prior state.</span><span class="c-pri"><span class="lbl">Priority </span>P1</span><span class="c-prof"><span class="lbl">Profile </span>P00</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 21:10 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>The regression R2-F13 requires (review R2 finding F13: Pool admission and membership need bounded resources).</p><h4>Steps</h4><ol><li>Repeated authorization rejected or atomically replaces and cleans prior state.</li></ol><h4>Accept</h4><p>Repeated authorization rejected or atomically replaces and cleans prior state.</p><h4>Evidence the case requires</h4><p>The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Every release candidate</dd></div><div><dt>Owner</dt><dd>pool lane (new)</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Plan pages</dt><dd>R2-F13</dd></div></dl></div></details><details class="acc-case" id="case-R2-F13-R02" data-case="R2-F13-R02" data-state="NOT RUN"><summary><span class="c-id">R2-F13-R02</span><span class="c-title">Oversized unterminated frame rejected within fixed memory/time budget.</span><span class="c-pri"><span class="lbl">Priority </span>P1</span><span class="c-prof"><span class="lbl">Profile </span>P00</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 21:10 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>The regression R2-F13 requires (review R2 finding F13: Pool admission and membership need bounded resources).</p><h4>Steps</h4><ol><li>Oversized unterminated frame rejected within fixed memory/time budget.</li></ol><h4>Accept</h4><p>Oversized unterminated frame rejected within fixed memory/time budget.</p><h4>Evidence the case requires</h4><p>The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Every release candidate</dd></div><div><dt>Owner</dt><dd>pool lane (new)</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Plan pages</dt><dd>R2-F13</dd></div></dl></div></details><details class="acc-case" id="case-R2-F13-R03" data-case="R2-F13-R03" data-state="NOT RUN"><summary><span class="c-id">R2-F13-R03</span><span class="c-title">Slow clients and invalid share floods cannot grow unbounded member, nonce or outgoing state.</span><span class="c-pri"><span class="lbl">Priority </span>P1</span><span class="c-prof"><span class="lbl">Profile </span>P00</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 21:10 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>The regression R2-F13 requires (review R2 finding F13: Pool admission and membership need bounded resources).</p><h4>Steps</h4><ol><li>Slow clients and invalid share floods cannot grow unbounded member, nonce or outgoing state.</li></ol><h4>Accept</h4><p>Slow clients and invalid share floods cannot grow unbounded member, nonce or outgoing state.</p><h4>Evidence the case requires</h4><p>The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Every release candidate</dd></div><div><dt>Owner</dt><dd>pool lane (new)</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Plan pages</dt><dd>R2-F13</dd></div></dl></div></details><details class="acc-case" id="case-R2-F14-R01" data-case="R2-F14-R01" data-state="NOT RUN"><summary><span class="c-id">R2-F14-R01</span><span class="c-title">Public build has no default arbitrary remote execution and a documented least-privilege boundary.</span><span class="c-pri"><span class="lbl">Priority </span>P1</span><span class="c-prof"><span class="lbl">Profile </span>P00</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 21:10 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>The regression R2-F14 requires (review R2 finding F14: Developer fleet control must not silently become the public client trust model).</p><h4>Steps</h4><ol><li>Public build has no default arbitrary remote execution and a documented least-privilege boundary.</li></ol><h4>Accept</h4><p>Public build has no default arbitrary remote execution and a documented least-privilege boundary.</p><h4>Evidence the case requires</h4><p>The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Every release candidate</dd></div><div><dt>Owner</dt><dd>app lane, relay lane</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Plan pages</dt><dd>R2-F14</dd></div></dl></div></details><details class="acc-case" id="case-R2-F14-R02" data-case="R2-F14-R02" data-state="NOT RUN"><summary><span class="c-id">R2-F14-R02</span><span class="c-title">Automatic updates off remains off for urgent manifests until explicit action.</span><span class="c-pri"><span class="lbl">Priority </span>P1</span><span class="c-prof"><span class="lbl">Profile </span>P00</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 21:10 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>The regression R2-F14 requires (review R2 finding F14: Developer fleet control must not silently become the public client trust model).</p><h4>Steps</h4><ol><li>Automatic updates off remains off for urgent manifests until explicit action.</li></ol><h4>Accept</h4><p>Automatic updates off remains off for urgent manifests until explicit action.</p><h4>Evidence the case requires</h4><p>The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Every release candidate</dd></div><div><dt>Owner</dt><dd>app lane, relay lane</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Plan pages</dt><dd>R2-F14</dd></div></dl></div></details><details class="acc-case" id="case-R2-F14-R03" data-case="R2-F14-R03" data-state="NOT RUN"><summary><span class="c-id">R2-F14-R03</span><span class="c-title">A compromised fleet/update signing key cannot silently acquire wallet access or activate a consensus change.</span><span class="c-pri"><span class="lbl">Priority </span>P1</span><span class="c-prof"><span class="lbl">Profile </span>P00</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 21:10 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>The regression R2-F14 requires (review R2 finding F14: Developer fleet control must not silently become the public client trust model).</p><h4>Steps</h4><ol><li>A compromised fleet/update signing key cannot silently acquire wallet access or activate a consensus change.</li></ol><h4>Accept</h4><p>A compromised fleet/update signing key cannot silently acquire wallet access or activate a consensus change.</p><h4>Evidence the case requires</h4><p>The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Every release candidate</dd></div><div><dt>Owner</dt><dd>app lane, relay lane</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Plan pages</dt><dd>R2-F14</dd></div></dl></div></details></div></div></section><section class="section acc-suite" id="suite-INT"><div class="container"><div class="acc-suite-head"><div class="acc-suite-code"><span class="n">18</span>INT</div><div class="acc-suite-t"><h2>INT: the master edition's integration gates (R1, the full-system review)</h2><p class="acc-sub">18 integration gates; each reads NOT RUN until its owner lane records a run</p></div><div class="acc-suite-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></div></div><dl class="acc-facts"><div><dt>Owner</dt><dd>the owner lanes per the coordinator's crosswalk</dd></div><div><dt>Gate</dt><dd>Integration gates closed</dd></div><div><dt>Fixtures</dt><dd>F0,F5</dd></div><div><dt>Plan pages</dt><dd>docs/plans/igneum-2.0-master/traceability.json integration_gates</dd></div></dl><div class="acc-suite-bar"><div class="acc-bar" role="img" aria-label="INT: 18 cases: 0 passed under the standard, 0 running with team evidence, 18 not run, 0 deferred"><span class="seg g-notrun" style="flex-grow:18" title="18 NOT RUN"></span></div><span>18 cases: 0 passed under the standard, 0 running with team evidence, 18 not run, 0 deferred</span></div><div class="acc-cases"><div class="acc-cases-h" aria-hidden="true"><span>Case</span><span>Title</span><span>Priority</span><span>Profile</span><span>Status</span><span>Evidence</span><span>Last run</span><span></span></div><details class="acc-case" id="case-INT-01" data-case="INT-01" data-state="NOT RUN"><summary><span class="c-id">INT-01</span><span class="c-title">Real proof H cannot authenticate a different statement under a warm cache.</span><span class="c-pri"><span class="lbl">Priority </span>P0</span><span class="c-prof"><span class="lbl">Profile </span>P00</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 21:10 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Integration gate INT-01 of the master edition (R1 / Additional regression gates).</p><h4>Steps</h4><ol><li>Real proof H cannot authenticate a different statement under a warm cache.</li></ol><h4>Accept</h4><p>Real proof H cannot authenticate a different statement under a warm cache.</p><h4>Evidence the case requires</h4><p>The run record of the gate as its owner lane records it through tools/ci/test-record.mjs.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Every release candidate</dd></div><div><dt>Owner</dt><dd>proving lane (a6e8f84588b809d62)</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Plan pages</dt><dd>R1</dd></div></dl></div></details><details class="acc-case" id="case-INT-02" data-case="INT-02" data-state="NOT RUN"><summary><span class="c-id">INT-02</span><span class="c-title">Warm/cold/relay/restart/concurrent cache order does not change block or payout decisions; negative cache isolated.</span><span class="c-pri"><span class="lbl">Priority </span>P0</span><span class="c-prof"><span class="lbl">Profile </span>P00</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 21:10 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Integration gate INT-02 of the master edition (R1 / Additional regression gates).</p><h4>Steps</h4><ol><li>Warm/cold/relay/restart/concurrent cache order does not change block or payout decisions; negative cache isolated.</li></ol><h4>Accept</h4><p>Warm/cold/relay/restart/concurrent cache order does not change block or payout decisions; negative cache isolated.</p><h4>Evidence the case requires</h4><p>The run record of the gate as its owner lane records it through tools/ci/test-record.mjs.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Every release candidate</dd></div><div><dt>Owner</dt><dd>proving lane (a6e8f84588b809d62)</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Plan pages</dt><dd>R1</dd></div></dl></div></details><details class="acc-case" id="case-INT-03" data-case="INT-03" data-state="NOT RUN"><summary><span class="c-id">INT-03</span><span class="c-title">Durable payout outbox survives every crash/RPC boundary without duplicate or lost liabilities.</span><span class="c-pri"><span class="lbl">Priority </span>P0</span><span class="c-prof"><span class="lbl">Profile </span>P00</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 21:10 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Integration gate INT-03 of the master edition (R1 / Additional regression gates).</p><h4>Steps</h4><ol><li>Durable payout outbox survives every crash/RPC boundary without duplicate or lost liabilities.</li></ol><h4>Accept</h4><p>Durable payout outbox survives every crash/RPC boundary without duplicate or lost liabilities.</p><h4>Evidence the case requires</h4><p>The run record of the gate as its owner lane records it through tools/ci/test-record.mjs.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Every release candidate</dd></div><div><dt>Owner</dt><dd>pool lane (a1c484c48a62948c2)</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Plan pages</dt><dd>R1</dd></div></dl></div></details><details class="acc-case" id="case-INT-04" data-case="INT-04" data-state="NOT RUN"><summary><span class="c-id">INT-04</span><span class="c-title">Corrupt existing pool state, disk-full and reorg cause safe recovery, not silent empty balances.</span><span class="c-pri"><span class="lbl">Priority </span>P0</span><span class="c-prof"><span class="lbl">Profile </span>P00</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 21:10 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Integration gate INT-04 of the master edition (R1 / Additional regression gates).</p><h4>Steps</h4><ol><li>Corrupt existing pool state, disk-full and reorg cause safe recovery, not silent empty balances.</li></ol><h4>Accept</h4><p>Corrupt existing pool state, disk-full and reorg cause safe recovery, not silent empty balances.</p><h4>Evidence the case requires</h4><p>The run record of the gate as its owner lane records it through tools/ci/test-record.mjs.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Every release candidate</dd></div><div><dt>Owner</dt><dd>pool lane (a1c484c48a62948c2)</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Plan pages</dt><dd>R1</dd></div></dl></div></details><details class="acc-case" id="case-INT-05" data-case="INT-05" data-state="NOT RUN"><summary><span class="c-id">INT-05</span><span class="c-title">The supplied finality implementation matches the approved anchor rule after &gt;window healing.</span><span class="c-pri"><span class="lbl">Priority </span>P0</span><span class="c-prof"><span class="lbl">Profile </span>P00</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 21:10 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Integration gate INT-05 of the master edition (R1 / Additional regression gates).</p><h4>Steps</h4><ol><li>The supplied finality implementation matches the approved anchor rule after &gt;window healing.</li></ol><h4>Accept</h4><p>The supplied finality implementation matches the approved anchor rule after &gt;window healing.</p><h4>Evidence the case requires</h4><p>The run record of the gate as its owner lane records it through tools/ci/test-record.mjs.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Every release candidate</dd></div><div><dt>Owner</dt><dd>node lane (a283f5f0d364ceef0)</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Plan pages</dt><dd>R1</dd></div></dl></div></details><details class="acc-case" id="case-INT-06" data-case="INT-06" data-state="NOT RUN"><summary><span class="c-id">INT-06</span><span class="c-title">Recovery tests state and preserve their weaker fault bound; interfaces never label it as a stronger guarantee.</span><span class="c-pri"><span class="lbl">Priority </span>P0</span><span class="c-prof"><span class="lbl">Profile </span>P00</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 21:10 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Integration gate INT-06 of the master edition (R1 / Additional regression gates).</p><h4>Steps</h4><ol><li>Recovery tests state and preserve their weaker fault bound; interfaces never label it as a stronger guarantee.</li></ol><h4>Accept</h4><p>Recovery tests state and preserve their weaker fault bound; interfaces never label it as a stronger guarantee.</p><h4>Evidence the case requires</h4><p>The run record of the gate as its owner lane records it through tools/ci/test-record.mjs.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Every release candidate</dd></div><div><dt>Owner</dt><dd>node lane (a283f5f0d364ceef0)</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Plan pages</dt><dd>R1</dd></div></dl></div></details><details class="acc-case" id="case-INT-07" data-case="INT-07" data-state="NOT RUN"><summary><span class="c-id">INT-07</span><span class="c-title">One v6 object agrees in node, pool, CPU verifier and each supported GPU host across activation.</span><span class="c-pri"><span class="lbl">Priority </span>P0</span><span class="c-prof"><span class="lbl">Profile </span>P00</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 21:10 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Integration gate INT-07 of the master edition (R1 / Additional regression gates).</p><h4>Steps</h4><ol><li>One v6 object agrees in node, pool, CPU verifier and each supported GPU host across activation.</li></ol><h4>Accept</h4><p>One v6 object agrees in node, pool, CPU verifier and each supported GPU host across activation.</p><h4>Evidence the case requires</h4><p>The run record of the gate as its owner lane records it through tools/ci/test-record.mjs.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Every release candidate</dd></div><div><dt>Owner</dt><dd>CI steward with the hash lane (a690540514aa453d7) and the worker lane (a9e87343f008e0edd)</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Plan pages</dt><dd>R1</dd></div></dl></div></details><details class="acc-case" id="case-INT-08" data-case="INT-08" data-state="NOT RUN"><summary><span class="c-id">INT-08</span><span class="c-title">Census, production acceptance, schedule counters and live-dataset tests use the identical frozen contract.</span><span class="c-pri"><span class="lbl">Priority </span>P0</span><span class="c-prof"><span class="lbl">Profile </span>P00</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 21:10 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Integration gate INT-08 of the master edition (R1 / Additional regression gates).</p><h4>Steps</h4><ol><li>Census, production acceptance, schedule counters and live-dataset tests use the identical frozen contract.</li></ol><h4>Accept</h4><p>Census, production acceptance, schedule counters and live-dataset tests use the identical frozen contract.</p><h4>Evidence the case requires</h4><p>The run record of the gate as its owner lane records it through tools/ci/test-record.mjs.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Every release candidate</dd></div><div><dt>Owner</dt><dd>CI steward with the hash lane (a690540514aa453d7) and the worker lane (a9e87343f008e0edd)</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Plan pages</dt><dd>R1</dd></div></dl></div></details><details class="acc-case" id="case-INT-09" data-case="INT-09" data-state="NOT RUN"><summary><span class="c-id">INT-09</span><span class="c-title">Eight- and twelve-GiB epoch transitions recover deliberately without relying on repeated OOM/watchdog cycles.</span><span class="c-pri"><span class="lbl">Priority </span>P0</span><span class="c-prof"><span class="lbl">Profile </span>P00</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 21:10 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Integration gate INT-09 of the master edition (R1 / Additional regression gates).</p><h4>Steps</h4><ol><li>Eight- and twelve-GiB epoch transitions recover deliberately without relying on repeated OOM/watchdog cycles.</li></ol><h4>Accept</h4><p>Eight- and twelve-GiB epoch transitions recover deliberately without relying on repeated OOM/watchdog cycles.</p><h4>Evidence the case requires</h4><p>The run record of the gate as its owner lane records it through tools/ci/test-record.mjs.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Every release candidate</dd></div><div><dt>Owner</dt><dd>app lane</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Plan pages</dt><dd>R1</dd></div></dl></div></details><details class="acc-case" id="case-INT-10" data-case="INT-10" data-state="NOT RUN"><summary><span class="c-id">INT-10</span><span class="c-title">Metal/CUDA/OpenCL exact dataset geometry agrees; unsupported packs reject before launch.</span><span class="c-pri"><span class="lbl">Priority </span>P0</span><span class="c-prof"><span class="lbl">Profile </span>P00</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 21:10 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Integration gate INT-10 of the master edition (R1 / Additional regression gates).</p><h4>Steps</h4><ol><li>Metal/CUDA/OpenCL exact dataset geometry agrees; unsupported packs reject before launch.</li></ol><h4>Accept</h4><p>Metal/CUDA/OpenCL exact dataset geometry agrees; unsupported packs reject before launch.</p><h4>Evidence the case requires</h4><p>The run record of the gate as its owner lane records it through tools/ci/test-record.mjs.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Every release candidate</dd></div><div><dt>Owner</dt><dd>CI steward with the hash lane (a690540514aa453d7) and the worker lane (a9e87343f008e0edd)</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Plan pages</dt><dd>R1</dd></div></dl></div></details><details class="acc-case" id="case-INT-11" data-case="INT-11" data-state="NOT RUN"><summary><span class="c-id">INT-11</span><span class="c-title">Only a memory-reserved proving job launches; mining buffers really release when required.</span><span class="c-pri"><span class="lbl">Priority </span>P0</span><span class="c-prof"><span class="lbl">Profile </span>P00</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 21:10 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Integration gate INT-11 of the master edition (R1 / Additional regression gates).</p><h4>Steps</h4><ol><li>Only a memory-reserved proving job launches; mining buffers really release when required.</li></ol><h4>Accept</h4><p>Only a memory-reserved proving job launches; mining buffers really release when required.</p><h4>Evidence the case requires</h4><p>The run record of the gate as its owner lane records it through tools/ci/test-record.mjs.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Every release candidate</dd></div><div><dt>Owner</dt><dd>app lane</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Plan pages</dt><dd>R1</dd></div></dl></div></details><details class="acc-case" id="case-INT-12" data-case="INT-12" data-state="NOT RUN"><summary><span class="c-id">INT-12</span><span class="c-title">Transient shard errors can retry safely; expiration, loss and paid work remain distinct durable outcomes.</span><span class="c-pri"><span class="lbl">Priority </span>P0</span><span class="c-prof"><span class="lbl">Profile </span>P00</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 21:10 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Integration gate INT-12 of the master edition (R1 / Additional regression gates).</p><h4>Steps</h4><ol><li>Transient shard errors can retry safely; expiration, loss and paid work remain distinct durable outcomes.</li></ol><h4>Accept</h4><p>Transient shard errors can retry safely; expiration, loss and paid work remain distinct durable outcomes.</p><h4>Evidence the case requires</h4><p>The run record of the gate as its owner lane records it through tools/ci/test-record.mjs.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Every release candidate</dd></div><div><dt>Owner</dt><dd>proving lane (a6e8f84588b809d62) and fleet lane (ac055d60427caab99)</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Plan pages</dt><dd>R1</dd></div></dl></div></details><details class="acc-case" id="case-INT-13" data-case="INT-13" data-state="NOT RUN"><summary><span class="c-id">INT-13</span><span class="c-title">Ember cannot retain a rate-ineligible prior; material workload changes invalidate incompatible profiles.</span><span class="c-pri"><span class="lbl">Priority </span>P0</span><span class="c-prof"><span class="lbl">Profile </span>P00</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 21:10 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Integration gate INT-13 of the master edition (R1 / Additional regression gates).</p><h4>Steps</h4><ol><li>Ember cannot retain a rate-ineligible prior; material workload changes invalidate incompatible profiles.</li></ol><h4>Accept</h4><p>Ember cannot retain a rate-ineligible prior; material workload changes invalidate incompatible profiles.</p><h4>Evidence the case requires</h4><p>The run record of the gate as its owner lane records it through tools/ci/test-record.mjs.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Every release candidate</dd></div><div><dt>Owner</dt><dd>Ember lane (a04fe3451877e2ff0) with the app lane</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Plan pages</dt><dd>R1</dd></div></dl></div></details><details class="acc-case" id="case-INT-14" data-case="INT-14" data-state="NOT RUN"><summary><span class="c-id">INT-14</span><span class="c-title">Protected helper and per-device leases restore owned settings on normal/abnormal exit; real ACL/security tests.</span><span class="c-pri"><span class="lbl">Priority </span>P0</span><span class="c-prof"><span class="lbl">Profile </span>P00</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 21:10 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Integration gate INT-14 of the master edition (R1 / Additional regression gates).</p><h4>Steps</h4><ol><li>Protected helper and per-device leases restore owned settings on normal/abnormal exit; real ACL/security tests.</li></ol><h4>Accept</h4><p>Protected helper and per-device leases restore owned settings on normal/abnormal exit; real ACL/security tests.</p><h4>Evidence the case requires</h4><p>The run record of the gate as its owner lane records it through tools/ci/test-record.mjs.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Every release candidate</dd></div><div><dt>Owner</dt><dd>Ember lane (a04fe3451877e2ff0) with the app lane</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Plan pages</dt><dd>R1</dd></div></dl></div></details><details class="acc-case" id="case-INT-15" data-case="INT-15" data-state="NOT RUN"><summary><span class="c-id">INT-15</span><span class="c-title">Public PoP replay is not session authorization; payout/server/network binding enforced.</span><span class="c-pri"><span class="lbl">Priority </span>P0</span><span class="c-prof"><span class="lbl">Profile </span>P00</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 21:10 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Integration gate INT-15 of the master edition (R1 / Additional regression gates).</p><h4>Steps</h4><ol><li>Public PoP replay is not session authorization; payout/server/network binding enforced.</li></ol><h4>Accept</h4><p>Public PoP replay is not session authorization; payout/server/network binding enforced.</p><h4>Evidence the case requires</h4><p>The run record of the gate as its owner lane records it through tools/ci/test-record.mjs.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Every release candidate</dd></div><div><dt>Owner</dt><dd>pool lane (a1c484c48a62948c2)</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Plan pages</dt><dd>R1</dd></div></dl></div></details><details class="acc-case" id="case-INT-16" data-case="INT-16" data-state="NOT RUN"><summary><span class="c-id">INT-16</span><span class="c-title">Pool parsing/queues/connection and crypto budgets remain bounded under controlled adversarial traffic.</span><span class="c-pri"><span class="lbl">Priority </span>P0</span><span class="c-prof"><span class="lbl">Profile </span>P00</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 21:10 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Integration gate INT-16 of the master edition (R1 / Additional regression gates).</p><h4>Steps</h4><ol><li>Pool parsing/queues/connection and crypto budgets remain bounded under controlled adversarial traffic.</li></ol><h4>Accept</h4><p>Pool parsing/queues/connection and crypto budgets remain bounded under controlled adversarial traffic.</p><h4>Evidence the case requires</h4><p>The run record of the gate as its owner lane records it through tools/ci/test-record.mjs.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Every release candidate</dd></div><div><dt>Owner</dt><dd>pool lane (a1c484c48a62948c2)</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Plan pages</dt><dd>R1</dd></div></dl></div></details><details class="acc-case" id="case-INT-17" data-case="INT-17" data-state="NOT RUN"><summary><span class="c-id">INT-17</span><span class="c-title">Missing oracle/keys/mandatory real-proof fixture blocks the applicable production acceptance gate.</span><span class="c-pri"><span class="lbl">Priority </span>P0</span><span class="c-prof"><span class="lbl">Profile </span>P00</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 21:10 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Integration gate INT-17 of the master edition (R1 / Additional regression gates).</p><h4>Steps</h4><ol><li>Missing oracle/keys/mandatory real-proof fixture blocks the applicable production acceptance gate.</li></ol><h4>Accept</h4><p>Missing oracle/keys/mandatory real-proof fixture blocks the applicable production acceptance gate.</p><h4>Evidence the case requires</h4><p>The run record of the gate as its owner lane records it through tools/ci/test-record.mjs.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Every release candidate</dd></div><div><dt>Owner</dt><dd>proving lane (a6e8f84588b809d62)</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Plan pages</dt><dd>R1</dd></div></dl></div></details><details class="acc-case" id="case-INT-18" data-case="INT-18" data-state="NOT RUN"><summary><span class="c-id">INT-18</span><span class="c-title">Whole-system economics pass the strongest feasible adversary, including sunk development and multi-epoch survival.</span><span class="c-pri"><span class="lbl">Priority </span>P0</span><span class="c-prof"><span class="lbl">Profile </span>P00</span><span class="c-st"><span class="acc-chip s-notrun" data-state="NOT RUN">NOT RUN</span></span><span class="c-ev"><span class="lbl">Evidence </span><span class="none">none yet</span></span><span class="c-run"><span class="lbl">Last run </span>8 Oct 2026, 21:10 UK</span><span class="c-caret" aria-hidden="true"></span></summary><div class="acc-panel"><blockquote><h4>Setup</h4><p>Integration gate INT-18 of the master edition (R1 / Additional regression gates).</p><h4>Steps</h4><ol><li>Whole-system economics pass the strongest feasible adversary, including sunk development and multi-epoch survival.</li></ol><h4>Accept</h4><p>Whole-system economics pass the strongest feasible adversary, including sunk development and multi-epoch survival.</p><h4>Evidence the case requires</h4><p>The run record of the gate as its owner lane records it through tools/ci/test-record.mjs.</p></blockquote><dl class="acc-meta"><div><dt>Method</dt><dd>Automated + independent review</dd></div><div><dt>Cadence</dt><dd>Every release candidate</dd></div><div><dt>Owner</dt><dd>research lane (ad6a2bd47d4a46105)</dd></div><div><dt>Design status</dt><dd>NOT RUN</dd></div><div><dt>Plan pages</dt><dd>R1</dd></div></dl></div></details></div></div></section><section class="section acc-profiles" id="profiles"><div class="container"><div class="eyebrow"><span class="line"></span>Profiles</div><h2>The numbers each case is held to.</h2><p class="acc-sub">17 profiles, P00 to P16. A profile is frozen before the confirmatory run; weakening a target after a failure creates a different claim.</p><div class="acc-prof-grid"><article class="acc-prof approved" id="profile-P00"><div class="acc-prof-top"><span class="acc-prof-id">P00</span><span class="acc-pstate approved">Approved as proposed</span></div><h3>Frozen scope and approval</h3><ol class="acc-req"><li>Approve the release manifest, supported roles, numerical profiles, mandatory scenarios, trust/fault model, workload W, adapters and claims before confirmatory tests. Unknown values are BLOCKED, not defaults.</li><li>Core safety and authentication invariants admit no waiver. Proposed performance or commercial targets may be replaced only before the confirmatory run, with an independent rationale and a versioned public scope.</li><li>After a failure, weakening a target creates a different claim and requires a new assessment. Preserve all failed runs; do not average a blocker away.</li></ol><p class="acc-prof-n">Cited by 76 cases. The profile’s own line in the registry: PROPOSED, REQUIRES APPROVAL.</p></article><article class="acc-prof approved" id="profile-P01"><div class="acc-prof-top"><span class="acc-prof-id">P01</span><span class="acc-pstate approved">Approved as proposed</span></div><h3>Correctness and negative-test depth</h3><ol class="acc-req"><li>Zero observed invalid acceptance, unauthorised signature, conflicting finality within assumptions, duplicated reward or unexplained cross-backend state/hash disagreement.</li><li>Minimum proposed campaign: 1,000,000 full-hash vectors per supported backend across all families, plus at least 10,000 malformed/boundary cases per relevant parser or binding class. Include exhaustive small-domain cases and historical regressions.</li><li>All prescribed critical mutants must be detected. This sampling target is not a bound on cryptographic failure probability and does not replace independent reasoning about soundness or safety.</li></ol><p class="acc-prof-n">Cited by 69 cases. The profile’s own line in the registry: PROPOSED, REQUIRES APPROVAL.</p></article><article class="acc-prof approved" id="profile-P02"><div class="acc-prof-top"><span class="acc-prof-id">P02</span><span class="acc-pstate approved">Approved as proposed</span></div><h3>Hardware coverage and reproducibility</h3><ol class="acc-req"><li>At least 12 physical retail configurations: at least 3 NVIDIA, 3 AMD and 2 Apple configurations, at least two discrete-GPU generations, an advertised 8 GB mining tier and 12 GB proving tiers where claimed. Record usable, not nominal, memory.</li><li>Declare a competitive core of at least 6 configurations spanning every advertised vendor and at least two discrete generations before optimisation. The wider cohort remains mandatory for access and economic tests; it cannot be silently dropped.</li><li>Use 5 paired 30-minute steady-state runs per primary cell after at least 15 minutes of warm-up and a stable temperature trend. Calibrated wall meter uncertainty must be at most 2%. Run a 7-day soak on representative low/mid/high tiers.</li><li>Three unaffiliated operators participate; every competitive-core cell is reproduced by at least two. Identical-SKU energy/accepted-work results must agree within 5% after declared environment corrections; unexplained variance blocks the headline.</li></ol><p class="acc-prof-n">Cited by 12 cases. The profile’s own line in the registry: PROPOSED, REQUIRES APPROVAL.</p></article><article class="acc-prof approved" id="profile-P03"><div class="acc-prof-top"><span class="acc-prof-id">P03</span><span class="acc-pstate approved">Approved as proposed</span></div><h3>Candidate improvement and honest-card budget</h3><ol class="acc-req"><li>For production candidate changes, per mandatory GPU cell: no more than 5% increase in joules per accepted work and no more than 2% decrease in accepted throughput versus the paired tuned baseline. Absolute safety limits always apply.</li><li>G2 requires at least a 10% reduction in the strongest evaluated specialist advantage after redesign, outside the declared measurement/model uncertainty, while meeting those budgets. A failed experiment is not a successful upgrade.</li><li>Existing clock-lock savings belong in the baseline. Long programs cannot pass by adding enough equally costly work to both devices to improve a ratio while materially worsening honest operation.</li></ol><p class="acc-prof-n">Cited by 8 cases. The profile’s own line in the registry: PROPOSED, REQUIRES APPROVAL.</p></article><article class="acc-prof approved" id="profile-P04"><div class="acc-prof-top"><span class="acc-prof-id">P04</span><span class="acc-pstate approved">Approved as proposed</span></div><h3>Scoped specialist-competition target</h3><ol class="acc-req"><li>Define R_E as GPU wall joules per accepted work divided by the lowest credible complete-system specialist joules for that same work. The proposed target is R_E at most 1.5 for every competitive-core cell at the same node and one node ahead.</li><li>Evaluate at least three materially distinct specialist architectures, with one programmable multi-family design, and a second independent reviewer. Include shared/reduced memory, hybrid execution, selective participation and realistic power/host costs.</li><li>Publish two-node-ahead and modular/reused-IP stress cases; they must satisfy the predeclared P12 economic envelope. No universal ceiling for unknown future hardware is claimed. Report model bounds separately from statistical confidence.</li><li>A lower-bound specialist estimate, not a convenient average or a deliberately constrained reference architecture, drives the conservative comparison. Undefined or unbounded decision-critical assumptions make the result BLOCKED.</li></ol><p class="acc-note"><span class="acc-chip s-fail" data-state="FAIL">FAIL</span> <span>R_E target at most 1.5 at the same node and one node ahead; today's placed bracket 1.5x to 2.1x: FAIL</span></p><p class="acc-prof-n">Cited by 14 cases. The profile’s own line in the registry: PROPOSED, REQUIRES APPROVAL.</p></article><article class="acc-prof approved" id="profile-P05"><div class="acc-prof-top"><span class="acc-prof-id">P05</span><span class="acc-pstate approved">Approved as proposed</span></div><h3>Measurement and inference protocol</h3><ol class="acc-req"><li>Pre-register primary metrics, cohorts, holdout seeds, run order, exclusions and analysis before confirmation. Keep tuning/training runs separate from holdout runs.</li><li>Use independent runs/operators as measurement units. Report point estimates, two-sided 95% measurement intervals and absolute sample counts; handle time-series dependence with a declared block or run-level method.</li><li>Apply conservative uncertainty to pass decisions. A confidence interval around measured GPU energy does not capture unknown ASIC architectures; model parameter ranges and expert judgement must be reported as such.</li><li>Never compare raw hashes per second across different algorithms. Do not transform a five-year scenario sweep into a probability of chip arrival or a guarantee of future profitability.</li></ol><p class="acc-prof-n">Cited by 0 cases. The profile’s own line in the registry: PROPOSED, REQUIRES APPROVAL.</p></article><article class="acc-prof approved" id="profile-P06"><div class="acc-prof-top"><span class="acc-prof-id">P06</span><span class="acc-pstate approved">Approved as proposed</span></div><h3>Memory and support policy</h3><ol class="acc-req"><li>All advertised role/configuration combinations must finish without OOM, corruption or unsafe fallback. Publish a component memory budget, including display/OS, driver, miner, prover, aggregation and epoch construction.</li><li>Proposed support horizon: at least 24 months of known schedule compatibility for the advertised entry tier, unless a narrower horizon is prominently approved before sale or launch. Removal changes the claim and must pass ECO-07.</li><li>Treat 5.5 / 8.5 / 11.5 GiB as source candidates, not imposed final rules. Simultaneous operation, eviction and time-sharing are distinct advertised modes with separately measured cost.</li></ol><p class="acc-prof-n">Cited by 4 cases. The profile’s own line in the registry: PROPOSED, REQUIRES APPROVAL.</p></article><article class="acc-prof approved" id="profile-P07"><div class="acc-prof-top"><span class="acc-prof-id">P07</span><span class="acc-pstate approved">Approved as proposed</span></div><h3>Proof service capacity and fairness</h3><ol class="acc-req"><li>Freeze W as a meaningful workload mix, input sizes, proof format, fleet and requests/hour. Primary proposed target: 72 hours at W, plus 24 hours at 1.2W; at least 99.5% accepted jobs delivered valid within the contracted deadline.</li><li>Default delivery targets for the declared internal reference workload: p95 at most 60 seconds and p99 at most 120 seconds from input-ready assignment through verified delivery. Also publish request-to-delivery including input wait; no claim may omit that delay.</li><li>Request-to-delivery p99 must meet the separately approved customer deadline. Payment p99 must be at most 10 minutes after verified payable eligibility, with chain finality time reported separately. These defaults do not override a stricter contract.</li><li>No statistically supported positive backlog drift at steady load, no silent drops; after 2W for 15 minutes, drain excess backlog within 30 minutes of return to W. Report rejected demand and accepted-job success separately.</li><li>Proposed advertised-tier fairness: at least 90% timely valid assigned completions are paid under the approved rules; avoidable duplicate/retry work is at most 10% of total work. Reassignment policy must bound abandonment without promising every assignment a reward.</li></ol><p class="acc-prof-n">Cited by 15 cases. The profile’s own line in the registry: PROPOSED, REQUIRES APPROVAL.</p></article><article class="acc-prof approved" id="profile-P08"><div class="acc-prof-top"><span class="acc-prof-id">P08</span><span class="acc-pstate approved">Approved as proposed</span></div><h3>Fault assumptions and recovery</h3><ol class="acc-req"><li>F0 must state the exact safety threshold, quorum and authority-transition rule; the synchrony/participation assumptions for liveness; trusted inputs; and clock/expiry semantics. This manual supplies no substitute consensus rule.</li><li>Exercise threshold-minus/at/plus cases, the 40/40/20 partition fixture, signing outages and 31/35/60/90 logical-day expiry cases. Preserve safety when liveness assumptions fail; do not demand finality from an unavailable quorum.</li><li>After assumptions and input availability are restored: service replacement within 10 minutes and deterministic network convergence within 30 minutes on the reference topology. Different certified bounds must be approved beforehand.</li><li>Accelerated-time simulation and real elapsed operation are separate evidence classes. Recovery may not reverse a guarantee previously represented as final.</li></ol><p class="acc-prof-n">Cited by 25 cases. The profile’s own line in the registry: PROPOSED, REQUIRES APPROVAL.</p></article><article class="acc-prof approved" id="profile-P09"><div class="acc-prof-top"><span class="acc-prof-id">P09</span><span class="acc-pstate approved">Approved as proposed</span></div><h3>Security and bounded resource requirements</h3><ol class="acc-req"><li>Zero unresolved critical or high-severity security findings on the claimed release. Independent scopes must cover consensus, proof soundness/parameters, implementation bypasses, wallet/isolation and relevant operational controls.</li><li>Review the intended proof-system security level and assumptions explicitly; do not infer a security-bit claim from random rejection tests. Version every verifier, program and parameter set.</li><li>Freeze maximum valid/invalid verification time, memory, disk and admission rates for ordinary validator hardware. At rated valid load plus the approved hostile load, no unbounded growth, invalid acceptance or unrecoverable process failure.</li><li>For supported wallet fee-estimation cases, proposed absolute error at most 5% versus the specified charge when inputs are unchanged; deterministic fee-cap handling and explicit uncertainty otherwise. Customer contracts remain separately binding.</li></ol><p class="acc-prof-n">Cited by 30 cases. The profile’s own line in the registry: PROPOSED, REQUIRES APPROVAL.</p></article><article class="acc-prof approved" id="profile-P10"><div class="acc-prof-top"><span class="acc-prof-id">P10</span><span class="acc-pstate approved">Approved as proposed</span></div><h3>Ordinary-operator product targets</h3><ol class="acc-req"><li>At least 30 unaffiliated first-time study participants across supported Windows/macOS combinations. At least 90% install, configure safely and submit accepted work without staff help; p90 active setup at most 15 minutes. Publish complete download/dataset time separately.</li><li>Pause/stop acknowledgement within 2 seconds, safe worker stop within 5 seconds where no documented atomic operation prevents it, and reliable restoration of original tuning settings. No hidden custody or silent update.</li><li>Net-energy/fee displays reconcile within 5% under the declared measurement boundary. Incremental rejected-work loss on the normal home-link profile is at most 2 percentage points over the matched datacentre profile.</li><li>Open miner efficiency is within 5% of the best independently tuned permitted implementation on identical work. For the declared single-card payout case, p95 payable-to-payment at most 24 hours and total payout friction at most 2% of earned value.</li><li>Critical alerts are emitted within 60 seconds of detectable evidence. At least 90% of study users can identify the injected failure and follow the published safe action. No control target excuses a security failure.</li></ol><p class="acc-prof-n">Cited by 11 cases. The profile’s own line in the registry: PROPOSED, REQUIRES APPROVAL.</p></article><article class="acc-prof approved" id="profile-P11"><div class="acc-prof-top"><span class="acc-prof-id">P11</span><span class="acc-pstate approved">Approved as proposed</span></div><h3>No-founder exercise and independence</h3><ol class="acc-req"><li>At least 10 verified unaffiliated operators, three independently administered network/hosting domains and sufficient honest weight/capacity to satisfy F0 and W after founders are removed.</li><li>Run at least 30 real elapsed days without founder mining, proving, aggregation, bootstrap, required RPC, private files or privileged interventions. Cross all known logical transitions separately without calling accelerated time real history.</li><li>Document control by role and common dependencies; uncertain identities are not counted as independent. Within-assumption withdrawals must satisfy P08; losing more than the assumed quorum may cause a visible safe pause.</li></ol><p class="acc-prof-n">Cited by 4 cases. The profile’s own line in the registry: PROPOSED, REQUIRES APPROVAL.</p></article><article class="acc-prof approved" id="profile-P12"><div class="acc-prof-top"><span class="acc-prof-id">P12</span><span class="acc-pstate approved">Approved as proposed</span></div><h3>Five-year coexistence envelope</h3><ol class="acc-req"><li>Freeze a sourced revenue reference R and mandatory worlds before results. Sweep 0.25R, R, 4R and 10R; electricity at $0.03/$0.10/$0.25/$0.40 per kWh; 1/3/5-year productive life; zero/$20M/$75M development; private mining and hardware sales; no/normal/spiking external demand.</li><li>Those values are proposed stress inputs, not current prices or forecasts. Declare which worlds have enough funded demand for rational ongoing service before running; retain collapse worlds as explicit safety/exit tests, not profitable successes.</li><li>Proposed matched-tariff new-entry target in every mandatory sustainable world: median GPU/specialist total cost per accepted work at most 1.5, 90th percentile at most 1.75, and no advertised competitive-core cell above 2.0. Publish every cell, including heterogeneous tariffs.</li><li>At least three purchasable GPU configurations across at least two advertised vendors must have positive modelled new-entry economics; at least 75% of the entry cohort must have positive marginal operating economics in those worlds. Report model uncertainty and failure regions.</li><li>Do not impose GPU market share, specialist production limits, token appreciation, full research-cost recovery or automatic chip death to force the result. Any such condition must become an explicit limitation rather than a hidden assumption.</li></ol><p class="acc-prof-n">Cited by 24 cases. The profile’s own line in the registry: PROPOSED, REQUIRES APPROVAL.</p></article><article class="acc-prof deferred" id="profile-P13"><div class="acc-prof-top"><span class="acc-prof-id">P13</span><span class="acc-pstate deferred">Deferred by the founder</span></div><h3>Maintenance continuity</h3><ol class="acc-req"><li>Before a readiness claim, document at least 12 months of committed maintenance resources at the approved operating scope. Include engineering, security review, infrastructure, support and incident response.</li><li>Use independently reviewable commitments and downside budgets. Uncommitted future sales, rising token prices, burned fees or assumed fundraising are not available resources.</li><li>This is a proposed governance test, not a directive to change the supply cap, issuance allocation or fair-launch design.</li></ol><p class="acc-prof-n">Cited by 1 case. The profile’s own line in the registry: PROPOSED, REQUIRES APPROVAL.</p></article><article class="acc-prof approved" id="profile-P14"><div class="acc-prof-top"><span class="acc-prof-id">P14</span><span class="acc-pstate approved">Approved as proposed</span></div><h3>Genuine commercial and developer proof</h3><ol class="acc-req"><li>At least three unrelated paying buyer organisations, each making at least three separate purchase decisions across at least 30 days; at least 1,000 meaningful verified external jobs in aggregate. Split invoices do not create independent demand.</li><li>No project reimbursement, circular funding or undisclosed related party counts. Report customer concentration and churn; proposed maximum largest-buyer share is 70% of qualifying revenue.</li><li>At least 20% aggregate contribution margin after directly attributable delivery costs, retries, refunds and support; publish fully loaded economics separately. At least 75% of sampled eligible operators have positive realised contribution on the declared workload.</li><li>At least five unaffiliated developers complete a useful supported application or proof-service integration using public documentation. Customer confirmation and raw commercial evidence may remain confidential to the reviewer.</li></ol><p class="acc-prof-n">Cited by 10 cases. The profile’s own line in the registry: PROPOSED, REQUIRES APPROVAL.</p></article><article class="acc-prof approved" id="profile-P15"><div class="acc-prof-top"><span class="acc-prof-id">P15</span><span class="acc-pstate approved">Approved as proposed</span></div><h3>Comparative contention threshold</h3><ol class="acc-req"><li>Pre-register at least three relevant operating GPU-first peers, plus a real proving alternative for customer comparisons. Verify current versions at execution time. The source reference set is a starting point, not a claim about current rankings.</li><li>Require at least three meaningful comparable dimensions with no material inferiority beyond a pre-agreed 10% margin against the best valid comparator, and at least two independently evidenced advantages against at least two peers.</li><li>Advantages must be either a greater-than-10% measured improvement outside uncertainty or a directly tested control/capability difference with demonstrated user value. Non-comparable or missing data is not a win.</li><li>A panel with hardware/economics, security/operations and customer/operator expertise must support the scoped contender conclusion. Passing these judgement-based thresholds does not certify a universal number-one ranking.</li></ol><p class="acc-prof-n">Cited by 5 cases. The profile’s own line in the registry: PROPOSED, REQUIRES APPROVAL.</p></article><article class="acc-prof approved" id="profile-P16"><div class="acc-prof-top"><span class="acc-prof-id">P16</span><span class="acc-pstate approved">Approved as proposed</span></div><h3>Observed durability and claim freshness</h3><ol class="acc-req"><li>At least 90 real elapsed days on the final compatible release family, at least 30 independently verified operators, and transparent eligibility/churn denominators. Material uncomparable changes reset affected observations.</li><li>Proposed outcomes: at least 60% day-90 operator retention and at least 75% of eligible observed operators with positive measured marginal operation over the period. Report incentives and electricity assumptions; do not claim a downturn was observed if it was not.</li><li>At least 99.9% availability for the declared customer service during eligible operating conditions, with all-in availability also reported; zero accepted invalid proofs or conflicting finality within F0 assumptions. Do not remove real incidents as maintenance to force a pass.</li><li>Run fault injection on isolated infrastructure, not unsuspecting customers. Publish planned test windows separately. Reassess claims at least quarterly and immediately after material hardware, protocol, economics or security changes.</li></ol><p class="acc-prof-n">Cited by 5 cases. The profile’s own line in the registry: PROPOSED, REQUIRES APPROVAL.</p></article></div></div></section><section class="section acc-fixtures" id="fixtures"><div class="container"><div class="eyebrow"><span class="line"></span>Fixtures</div><h2>What every run is built on.</h2><div class="acc-fix-grid"><article class="acc-fix" id="fixture-F0"><span class="acc-fix-id">F0</span><h3>Release and assurance manifest</h3><p>Exact commits, binaries, genesis/network ID, mining class, dataset schedule, EVM fork/deviations, program/verifier IDs, fees, supply, quorum/fault rules, trust anchors, activation and supported roles.</p></article><article class="acc-fix" id="fixture-F1"><span class="acc-fix-id">F1</span><h3>Clean build environments</h3><p>Pinned toolchains, dependency locks, clean OS images and documented signing/notarisation boundaries. No production secrets or private founder files.</p></article><article class="acc-fix" id="fixture-F2"><span class="acc-fix-id">F2</span><h3>Hardware and measurement lab</h3><p>Approved physical GPU cohort, calibrated wall meters, stable thermal conditions, driver/OS images and realistic home/datacentre link conditions.</p></article><article class="acc-fix" id="fixture-F3"><span class="acc-fix-id">F3</span><h3>Workload and oracle catalogue</h3><p>Fixed full-hash and EVM/proving jobs, independent reference implementations, real customer-sized payloads, held-out seeds and complete expected results.</p></article><article class="acc-fix" id="fixture-F4"><span class="acc-fix-id">F4</span><h3>Authorised fault network</h3><p>Independent nodes/operators; controllable latency, loss, clocks, partitions, storage faults and role withdrawals. Actual consensus paths plus separately labelled simulators.</p></article><article class="acc-fix" id="fixture-F5"><span class="acc-fix-id">F5</span><h3>Negative and regression corpus</h3><p>Malformed transactions/proofs, wrong roots/IDs, duplicate payments, bad authority tables, historical failures and deliberately faulty code mutants.</p></article><article class="acc-fix" id="fixture-F6"><span class="acc-fix-id">F6</span><h3>Specialist implementation pack</h3><p>Functionally checked architectures, RTL/physical estimates where feasible, memory and board assumptions, cost inputs, adaptation paths and uncertainty ranges.</p></article><article class="acc-fix" id="fixture-F7"><span class="acc-fix-id">F7</span><h3>Economic and incentive models</h3><p>Independently reproducible costs, entry/exit/difficulty policies, scenario grid, operator opportunity costs and money-flow conservation fixtures.</p></article><article class="acc-fix" id="fixture-F8"><span class="acc-fix-id">F8</span><h3>User/customer/peer studies</h3><p>Consenting unaffiliated users, contracted meaningful workloads, private ownership checks, dated competitor methods and independent analysis.</p></article><article class="acc-fix" id="fixture-F9"><span class="acc-fix-id">F9</span><h3>Evidence and status vault</h3><p>Immutable run IDs, raw logs, hashes, analysis code, exclusions, defects, reviewers, signatures, privacy controls and public redacted summaries.</p></article></div></div></section><section class="section acc-foot" id="notes"><div class="container"><div class="acc-foot-card"><div class="eyebrow"><span class="line"></span>What a full pass means</div><p class="acc-allpass">Independent passage of all mandatory and claimed-option gates, including commercial and comparative observation, can support a scoped leadership-contender assessment. It does not prove a universal rank or eliminate unknown future hardware risks.</p><p>Test design, not executed evidence. All numeric additions are proposed, not source-approved protocol rules. Optional claimed features require their tests; excluded features earn no pass credit.</p><h3>Rules in force</h3><ul class="acc-rules"><li>P03: a candidate change pays at most 5 percent of joules per accepted work and loses at most 2 percent of accepted throughput against the paired tuned baseline (replaces the 10 percent budget from 18:2x UK)</li><li>P04: R_E at most 1.5 for every competitive-core cell at the same node and one node ahead against the lowest credible complete-system specialist; today's placed bracket (1.5x to 2.1x same-node) is a FAIL to work against and is served as such</li><li>P12: the matched-tariff median at most 1.5, p90 at most 1.75, no core cell above 2.0</li><li>P02: twelve retail configurations, three unaffiliated operators, the seven-day soak define D1's reproduction</li></ul><p class="acc-never" data-never-served>Never served: guaranteed chip death, a universal ASIC-efficiency ceiling, chip-arrival probabilities, guaranteed profits, Ethereum security by compatibility, privacy from ZK, a numerical rank.</p><p class="acc-src"><b>Source:</b> <code>docs/plans/igneum-2.0-test-registry.json</code>, version 1.0, dated 8 October 2026, plan sha256 <code>418b3b9f68f96a41</code>. <span id="acc-live">This copy was written when the page was built; the page checks the registry on the public git host every 60 seconds.</span></p></div></div></section></div>
+<script type="application/json" id="acceptance-data">{"title":"IGNEUM 2.0 - Test and Acceptance Standard","version":"1.0","date":"2026-10-08","status":"APPROVED 8 October 2026 (the founder, 18:2x UK): \"approve as proposed in the tests, forget P13 for now\"; the test design stands as PROPOSED, NOT EXECUTED until a case runs under it","basis":"IGNEUM_2.0_Plan.pdf, 37 pages, 8 October 2026","suites":[{"code":"GOV","title":"Release identity and evidence","source":[5,21,23,25,26,27],"gate":"G0 / all gates","owner":"Release lead + independent assurance","fixtures":"F0 manifest; F1 source/build archives; F9 evidence vault","summary":"Prevent a favourable result from being attached to the wrong code, assumptions or public claim.","tests":[{"id":"GOV-01","title":"Freeze the release and its claims","setup":"Candidate source, binaries, public documentation and the 2.0 plan are available; no run is yet accepted.","steps":["Record exact commits, binary hashes, dependencies, genesis/network identity, mining class, datasets, execution fork, verifier IDs and fee rules in F0.","Map every promised capability and plan requirement to a test ID; distinguish supported mining, proving and wallet combinations.","Sign the manifest with protocol, product and independent review owners before confirmatory runs."],"accept":"Every material rule and claim has an unambiguous version and test. Conflicts or unknown activation rules produce BLOCKED, not an inferred default. Changes create a new manifest and invalidate affected results.","evidence":"Signed F0; source-to-test map; claim inventory; unresolved-field register.","priority":"BLOCKER","profile":"P00","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[5,21,23,25,26,27],"gate":"G0 / all gates","owner":"Release lead + independent assurance","manual_page":18,"owner_lane":"node lane (a283f5f0d364ceef0)","run_status":"NOT RUN","evidence_path":"docs/plans/igneum-2.0-f0-manifest.md; packaging/pow-freeze.txt; build-1:/srv/artefacts/tas/201-7cfa422a-aa0e0f45/node-7cfa422a/box4-kaspad-check.log","run_id":"201-7cfa422a-aa0e0f45","updated":"2026-10-08T19:32:50.856Z","evidence_record":{"cell":"check:freeze","manifest_sha":"7cfa422a","coverage":{"GOV-01":"partial: the linked igneum-pow tree's fingerprint must match a listed freeze or the build fails, the binary prints which; the manifest (igneum_getManifest) names the object digest; the signed F0 manifest is the node lane's row tonight"},"at":"2026-10-08T19:32:50.856Z","method":"native","requirement_id":"GOV-01","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"7cfa422a","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"in_progress_since":"2026-10-08T19:32:50.856Z","approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null},"evidence_records":{"check:freeze":{"cell":"check:freeze","manifest_sha":"7cfa422a","coverage":{"GOV-01":"partial: the linked igneum-pow tree's fingerprint must match a listed freeze or the build fails, the binary prints which; the manifest (igneum_getManifest) names the object digest; the signed F0 manifest is the node lane's row tonight"},"at":"2026-10-08T19:32:50.856Z","method":"native","requirement_id":"GOV-01","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"7cfa422a","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"run_id":"201-7cfa422a-aa0e0f45","evidence":"docs/plans/igneum-2.0-f0-manifest.md; packaging/pow-freeze.txt; build-1:/srv/artefacts/tas/201-7cfa422a-aa0e0f45/node-7cfa422a/box4-kaspad-check.log","in_progress":true}}},{"id":"GOV-02","title":"Approve thresholds before results","setup":"This manual supplies proposed test thresholds, not source-approved protocol parameters.","steps":["Approve or replace every P-profile before confirmatory testing; give each change a rationale and independent approver.","Register hardware cohorts, mandatory economic worlds, customer workloads, peer dimensions and exclusion rules.","Lock the profile hash and hold out seeds/workloads from the developers doing optimisation."],"accept":"No decision-critical field is TBD. Numeric limits are frozen, commercially meaningful and not chosen from observed results. A weakened limit after failure requires a new protocol, full affected rerun and explicit claim downgrade review.","evidence":"Approved profile register; timestamped holdout commitments; change log.","priority":"BLOCKER","profile":"P00","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[5,21,23,25,26,27],"gate":"G0 / all gates","owner":"Release lead + independent assurance","manual_page":18,"owner_lane":"CI steward (a2ecfa95d3206016c)","run_status":"NOT RUN","evidence_path":"docs/plans/igneum-2.0-test-registry.json","run_id":"team-2026-10-08","updated":"2026-10-08T20:10:24.556Z","evidence_record":{"reason":"the approval is recorded in the registry's approval field; the automated half (thresholds frozen before any run_status) is the gate rule landing by 21:00","at":"2026-10-08T20:10:24.556Z","method":"static","requirement_id":"GOV-02","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"in_progress_since":"2026-10-08 18:3x UK","approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null},"evidence_records":{"record":{"what_was_run":"the profiles approved as proposed by the founder at 18:2x UK before any confirmatory run; P13 deferred","run_by":"CI steward (a2ecfa95d3206016c)","under_the_standard":"no: team-run before the standard's procedure; the status is RUNNING until the case is re-run under its steps with the profile's numbers and an independent run where the profile asks one","pass_or_fail_today":"not judged under the standard yet","method":"static","requirement_id":"GOV-02","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"run_id":"team-2026-10-08","evidence":"docs/plans/igneum-2.0-test-registry.json","in_progress":true}}},{"id":"GOV-03","title":"Reproduce builds outside the founding team","setup":"Provide public source and documented build instructions to three unaffiliated operators.","steps":["Build on clean declared environments without private files, tokens or founder assistance.","Compare reproducible payload hashes; isolate signatures, notarisation and permitted non-deterministic wrappers.","Run reference vectors and restart a node using only documented artifacts."],"accept":"All independent builds reproduce the same consensus payload or an independently explained, pre-approved wrapper difference; reference outputs match exactly. Missing private prerequisites block release.","evidence":"Build logs; dependency lockfiles; binary comparison; operator attestations.","priority":"BLOCKER","profile":"P00; P02","cadence":"Release candidate; repeat after relevant changes","method":"Independent reproduction","status":"NOT RUN","source":[5,21,23,25,26,27],"gate":"G0 / all gates","owner":"Release lead + independent assurance","manual_page":18,"owner_lane":"build-server lane (a352e49ff4613df86)","run_status":"NOT RUN","evidence_path":"","run_id":"","updated":"2026-10-08 18:3x UK","approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null}},{"id":"GOV-04","title":"Preserve raw and negative evidence","setup":"Enable append-only storage for run outputs and a separate analysis workspace.","steps":["Capture failed, aborted and successful runs with timestamps, seeds and environment hashes.","Recompute one published figure from raw records on a clean machine.","Modify a retained artifact deliberately and test integrity verification."],"accept":"Every headline can be regenerated; tampering is detected; exclusions have pre-registered reasons. Failed or missing runs remain visible and are never replaced silently by a successful retry.","evidence":"Artifact manifest; hashes; reproduction script; exclusion ledger; negative-run archive.","priority":"BLOCKER","profile":"P00","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[5,21,23,25,26,27],"gate":"G0 / all gates","owner":"Release lead + independent assurance","manual_page":19,"owner_lane":"CI steward (a2ecfa95d3206016c)","run_status":"NOT RUN","evidence_path":"","run_id":"","updated":"2026-10-08T19:22:31.798Z","evidence_record":{"reason":"the evidence vault F9 (raw and negative evidence preserved) is the gate rule landing by 21:00: a PASS must carry its evidence file","at":"2026-10-08T19:22:31.798Z","method":"static","requirement_id":"GOV-04","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null},"evidence_records":{"record":{"reason":"the evidence vault F9 (raw and negative evidence preserved) is the gate rule landing by 21:00: a PASS must carry its evidence file","at":"2026-10-08T19:22:31.798Z","method":"static","requirement_id":"GOV-04","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"run_id":"","evidence":"","in_progress":false}}},{"id":"GOV-05","title":"Prove the test oracle detects broken behaviour","setup":"Create controlled defective variants on an isolated network only.","steps":["Disable proof verification, change one reward, accept an expired authority set and alter one hash output in separate mutants.","Run the corresponding ZKP, INC, FIN and POW tests without telling the runner which mutant is active.","Confirm the baseline still accepts authorised valid cases."],"accept":"Every deliberately introduced fault is caught by its mapped test; valid controls pass. Any undetected critical mutant blocks acceptance of that test family until the oracle is repaired.","evidence":"Mutation catalogue; blinded run results; baseline controls; oracle review.","priority":"BLOCKER","profile":"P01","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[5,21,23,25,26,27],"gate":"G0 / all gates","owner":"Release lead + independent assurance","manual_page":19,"owner_lane":"fast-time lane (a8be71a0db962911c)","run_status":"NOT RUN","evidence_path":"build-1:/srv/artefacts/tas/200-417c4a57-b2/gate/gate-rule26.log","run_id":"200-417c4a57-b2","updated":"2026-10-08T18:28:32.408Z","evidence_record":{"cell":"gate:pre-push","manifest_sha":"417c4a57","coverage":{"GOV-05":"partial: every gate check carries a self-test that fires on a known failure and passes a known success (77 checks); the suites' own oracles are their mutation rows","GOV-06":"partial: the launch-gates, forbidden-strings and scope checks on the served site","UX-08":"partial: the site gate on every served page, plus docs/build/tuning.md (the published tuning and build-settings half, the hash lane's); the open builds and the fee conditions are the shipper's and the site lane's"},"at":"2026-10-08T18:28:32.408Z","method":"native","requirement_id":"GOV-05","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"417c4a57","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"in_progress_since":"2026-10-08T18:28:32.408Z","approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null},"evidence_records":{"gate:pre-push":{"cell":"gate:pre-push","manifest_sha":"417c4a57","coverage":{"GOV-05":"partial: every gate check carries a self-test that fires on a known failure and passes a known success (77 checks); the suites' own oracles are their mutation rows","GOV-06":"partial: the launch-gates, forbidden-strings and scope checks on the served site","UX-08":"partial: the site gate on every served page, plus docs/build/tuning.md (the published tuning and build-settings half, the hash lane's); the open builds and the fee conditions are the shipper's and the site lane's"},"at":"2026-10-08T18:28:32.408Z","method":"native","requirement_id":"GOV-05","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"417c4a57","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"run_id":"200-417c4a57-b2","evidence":"build-1:/srv/artefacts/tas/200-417c4a57-b2/gate/gate-rule26.log","in_progress":true}}},{"id":"GOV-06","title":"Enforce scope and optional-feature discipline","setup":"Inventory FP32 experiments, receipts/oracles and all retained or excluded mining levers.","steps":["Mark each capability CORE, CLAIMED-OPTIONAL or EXCLUDED before release testing.","For excluded code, check binaries, protocol activation and product copy for accidental enablement or implied availability.","For each claimed option, require the complete associated test set rather than a demonstration."],"accept":"Every core and claimed-option obligation passes. Excluded items are shown as EXCLUDED, never PASS and never counted as achievements. Removing a failed core requirement prevents an all-2.0-pass claim.","evidence":"Scope manifest; activation scan; product-copy comparison; exclusions register.","priority":"BLOCKER","profile":"P00","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[5,21,23,25,26,27],"gate":"G0 / all gates","owner":"Release lead + independent assurance","manual_page":19,"owner_lane":"CI steward (a2ecfa95d3206016c)","run_status":"NOT RUN","evidence_path":"build-1:/srv/artefacts/tas/200-417c4a57-b2/gate/gate-rule26.log","run_id":"200-417c4a57-b2","updated":"2026-10-08T18:28:32.408Z","evidence_record":{"cell":"gate:pre-push","manifest_sha":"417c4a57","coverage":{"GOV-05":"partial: every gate check carries a self-test that fires on a known failure and passes a known success (77 checks); the suites' own oracles are their mutation rows","GOV-06":"partial: the launch-gates, forbidden-strings and scope checks on the served site","UX-08":"partial: the site gate on every served page, plus docs/build/tuning.md (the published tuning and build-settings half, the hash lane's); the open builds and the fee conditions are the shipper's and the site lane's"},"at":"2026-10-08T18:28:32.408Z","method":"native","requirement_id":"GOV-06","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"417c4a57","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"in_progress_since":"2026-10-08T18:28:32.408Z","approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null},"evidence_records":{"gate:pre-push":{"cell":"gate:pre-push","manifest_sha":"417c4a57","coverage":{"GOV-05":"partial: every gate check carries a self-test that fires on a known failure and passes a known success (77 checks); the suites' own oracles are their mutation rows","GOV-06":"partial: the launch-gates, forbidden-strings and scope checks on the served site","UX-08":"partial: the site gate on every served page, plus docs/build/tuning.md (the published tuning and build-settings half, the hash lane's); the open builds and the fee conditions are the shipper's and the site lane's"},"at":"2026-10-08T18:28:32.408Z","method":"native","requirement_id":"GOV-06","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"417c4a57","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"run_id":"200-417c4a57-b2","evidence":"build-1:/srv/artefacts/tas/200-417c4a57-b2/gate/gate-rule26.log","in_progress":true}}},{"id":"GOV-07","title":"Independent review and finding closure","setup":"Nominate reviewers with declared conflicts and scopes covering cryptography, consensus and hardware.","steps":["Provide pinned code, raw data, adversarial models and prior failures, including negative results.","Track each finding to remediation and an independent retest; do not use the author as sole approver.","Have reviewers state unreviewed surfaces and model limitations in their signed conclusions."],"accept":"No unresolved critical or high-severity finding affects the claimed release. A finite review is described by scope, not as proof of universal security. Independent reproduction and review are both evidenced.","evidence":"Signed scoped reports; conflict declarations; finding/retest ledger.","priority":"BLOCKER","profile":"P09","cadence":"Release candidate; repeat after relevant changes","method":"Independent specialist review","status":"NOT RUN","source":[5,21,23,25,26,27],"gate":"G0 / all gates","owner":"Release lead + independent assurance","manual_page":20,"owner_lane":"main / the founder","run_status":"NOT RUN","evidence_path":"","run_id":"","updated":"2026-10-08 18:3x UK","approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null}},{"id":"GOV-08","title":"Invalidate stale evidence and control public status","setup":"Create a simulated post-test change to a verifier, mining class, dataset and fee rule.","steps":["Calculate affected test dependencies and invalidate their former PASS statuses.","Regenerate public status pages from F0 and the evidence register.","Attempt to publish a rank-one, guaranteed-profit or automatic-chip-death claim without the required evidence."],"accept":"Affected gates return to NOT RUN or BLOCKED. Public claims retain version, limits and date; unsupported claims are withheld. No stale result remains attached to a different release.","evidence":"Dependency impact report; regenerated status page; rejected claim examples.","priority":"BLOCKER","profile":"P00","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[5,21,23,25,26,27],"gate":"G0 / all gates","owner":"Release lead + independent assurance","manual_page":20,"owner_lane":"CI steward (a2ecfa95d3206016c)","run_status":"NOT RUN","evidence_path":"","run_id":"","updated":"2026-10-08T19:22:31.798Z","evidence_record":{"reason":"the stale-evidence rule (evidence older than the manifest sha reads NOT RUN) is the gate rule landing by 21:00","at":"2026-10-08T19:22:31.798Z","method":"static","requirement_id":"GOV-08","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null},"evidence_records":{"record":{"reason":"the stale-evidence rule (evidence older than the manifest sha reads NOT RUN) is the gate rule landing by 21:00","at":"2026-10-08T19:22:31.798Z","method":"static","requirement_id":"GOV-08","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"run_id":"","evidence":"","in_progress":false}}}]},{"code":"GPU","title":"Whole-system GPU measurements","source":[6,7,8,14,18,23],"gate":"G1 / G2","owner":"GPU lead + three independent operators","fixtures":"F2 retail-hardware cohort; F3 paired benchmark workloads; F9 calibrated evidence","summary":"Close the pending measurements and evaluate the actual configuration, including costs hidden by kernel-only results.","tests":[{"id":"GPU-01","title":"Cover the declared commodity population","setup":"Freeze the P02 cohort, supported role matrix and the final v6 configuration.","steps":["Inventory physical SKU, usable memory, driver, operating system, firmware, cooling and acquisition channel.","Run mining on every supported cohort cell and proving on every separately advertised prover cell.","Include lower-memory, used-generation and all advertised vendor cases; retain unsupported results separately."],"accept":"All declared cells are tested, with no after-the-fact removal of weak cards. At least the P02 minimum coverage is met. Mining-only support is never reported as proof-generation support.","evidence":"Cohort manifest; compatibility matrix; raw results by SKU and role.","priority":"GATE","profile":"P02","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[6,7,8,14,18,23],"gate":"G1 / G2","owner":"GPU lead + three independent operators","manual_page":21,"owner_lane":"research lane (ad6a2bd47d4a46105)","run_status":"NOT RUN","evidence_path":"docs/analysis/class-v6/rows/fleet-f05-20261008.md","run_id":"hash-lane-20261008-batch2","updated":"2026-10-08T19:59:34.316Z","evidence_record":{"cell":"bench:fleet-pods","manifest_sha":"b24dfc162","coverage":{"GPU-01":"partial: the NVIDIA cells of P02 that RunPod carries","GPU-03":"partial: the 4090 cell","POW-08":"partial: W = 16 on four cards"},"at":"2026-10-08T19:59:34.316Z","method":"GPU","requirement_id":"GPU-01","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"b24dfc162","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"in_progress_since":"2026-10-08T19:59:34.316Z","approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null},"evidence_records":{"bench:fleet-pods":{"cell":"bench:fleet-pods","manifest_sha":"b24dfc162","coverage":{"GPU-01":"partial: the NVIDIA cells of P02 that RunPod carries","GPU-03":"partial: the 4090 cell","POW-08":"partial: W = 16 on four cards"},"at":"2026-10-08T19:59:34.316Z","method":"GPU","requirement_id":"GPU-01","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"b24dfc162","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"run_id":"hash-lane-20261008-batch2","evidence":"docs/analysis/class-v6/rows/fleet-f05-20261008.md","in_progress":true}}},{"id":"GPU-02","title":"Reproduce Ember clock-lock savings","setup":"Use paired stock and tuned runs on the same board, host, workload and ambient conditions.","steps":["Warm to stability; randomise stock/tuned order and run P02 repeated sessions.","Measure accepted work, calibrated wall energy, device telemetry and rejected work.","Calculate paired energy and rate changes with run-level uncertainty, retaining failed tuning attempts."],"accept":"Tuning preserves correctness and meets approved P03 operating limits. The historical 34-41% saving and under-2% rate-loss statement is reproduced only for qualifying configurations; otherwise that claim is corrected. Existing savings are not counted twice.","evidence":"Raw power/time series; paired analysis; tuning settings; claim-by-SKU table.","priority":"GATE","profile":"P02; P03","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[6,7,8,14,18,23],"gate":"G1 / G2","owner":"GPU lead + three independent operators","manual_page":21,"owner_lane":"hash lane (a690540514aa453d7)","run_status":"NOT RUN","evidence_path":"docs/analysis/class-v6/rows/run-ca3-pc1-readwidth-5090-20261008-b.md","run_id":"hash-lane-20261008-batch1","updated":"2026-10-08T18:41:01.185Z","evidence_record":{"cell":"bench:pc1-packs","manifest_sha":"c245d50b9","coverage":{"GPU-02":"partial: the paired stock and locked rows on the same board, host and workload (the rate held, 2.37 against 3.26 microjoules per hash on the class v5 pack); the historical 34 to 41 percent claim's full configuration set is owed","GPU-03":"partial: hl-v6-all against hl-v6-foldrw on the 5090, the window's cost per unit of work, registers and blocks per SM, no spill; the mandatory-SKU set is owed","GPU-05":"partial: v3-1g, v3-ds29, v3-ds30, ds55, ds4g-ms complete with their fingerprints, energy per step at stock and at the knee on the 5090 and the 7600; the 8.5 and 11.5 GiB candidates are owed","POW-08":"partial: rw-w4, rw-w32, rw-w64 and the 1p5x long-program packs as regression controls for the excluded levers"},"at":"2026-10-08T18:41:01.185Z","method":"GPU","requirement_id":"GPU-02","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"c245d50b9","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"in_progress_since":"2026-10-08T18:41:01.185Z","approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null},"evidence_records":{"bench:pc1-packs":{"cell":"bench:pc1-packs","manifest_sha":"c245d50b9","coverage":{"GPU-02":"partial: the paired stock and locked rows on the same board, host and workload (the rate held, 2.37 against 3.26 microjoules per hash on the class v5 pack); the historical 34 to 41 percent claim's full configuration set is owed","GPU-03":"partial: hl-v6-all against hl-v6-foldrw on the 5090, the window's cost per unit of work, registers and blocks per SM, no spill; the mandatory-SKU set is owed","GPU-05":"partial: v3-1g, v3-ds29, v3-ds30, ds55, ds4g-ms complete with their fingerprints, energy per step at stock and at the knee on the 5090 and the 7600; the 8.5 and 11.5 GiB candidates are owed","POW-08":"partial: rw-w4, rw-w32, rw-w64 and the 1p5x long-program packs as regression controls for the excluded levers"},"at":"2026-10-08T18:41:01.185Z","method":"GPU","requirement_id":"GPU-02","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"c245d50b9","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"run_id":"hash-lane-20261008-batch1","evidence":"docs/analysis/class-v6/rows/run-ca3-pc1-readwidth-5090-20261008-b.md","in_progress":true}}},{"id":"GPU-03","title":"Measure the real 64-register GPU cost","setup":"Build the baseline and window variant with identical dataset, reads and semantic workload.","steps":["Inspect compiled register allocation, spills, occupancy and memory traffic on each supported backend.","Measure paired complete-system energy and accepted throughput, including host work.","Repeat during proving coexistence and expose any memory or scheduling cliff."],"accept":"Any production window meets P03 budgets for every mandatory SKU; no hidden spills or correctness changes. Zero GPU cost is claimed only where measurement supports it within uncertainty. Results feed the redesigned adversary, not an old core estimate.","evidence":"Compiler reports; allocation traces; paired energy/rate data; coexistence runs.","priority":"GATE","profile":"P02; P03","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[6,7,8,14,18,23],"gate":"G1 / G2","owner":"GPU lead + three independent operators","manual_page":21,"owner_lane":"hash lane (a690540514aa453d7)","run_status":"NOT RUN","evidence_path":"docs/analysis/class-v6/rows/fleet-f05-20261008.md; docs/analysis/class-v6/amd-intel-energy.md","run_id":"amd-intel-energy-20261008-01","updated":"2026-10-08T20:18:52.686Z","evidence_record":{"requirement_id":"GPU-03","decision":"NOT RUN","method":"GPU","cell":"bench:amd-intel-energy","manifest_sha":"c245d50b9","run_id":"amd-intel-energy-20261008-01","evidence":"docs/analysis/class-v6/amd-intel-energy.md","in_progress":false,"coverage":"partial: the 64-register window on AMD and Intel, rate per unit of work (RX 7600 0 percent, Arc B580 -0.3 percent, kernel throughput, quiet) with the B580 fingerprints equal on both packs and the offline RDNA allocation (160 VGPRs, no spill); energy owed (the 7600 job queued, the B580 counter unsupported unelevated); team-run, not under the standard's paired protocol or a wall meter","release_identity":{"commit":"c245d50b9","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"claim_impact":"","reviewer":"","at":"2026-10-08T20:18:52.686Z"},"in_progress_since":"2026-10-08T19:59:34.316Z","approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null},"evidence_records":{"bench:fleet-pods":{"cell":"bench:fleet-pods","manifest_sha":"b24dfc162","coverage":{"GPU-01":"partial: the NVIDIA cells of P02 that RunPod carries","GPU-03":"partial: the 4090 cell","POW-08":"partial: W = 16 on four cards"},"at":"2026-10-08T19:59:34.316Z","method":"GPU","requirement_id":"GPU-03","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"b24dfc162","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"run_id":"hash-lane-20261008-batch2","evidence":"docs/analysis/class-v6/rows/fleet-f05-20261008.md","in_progress":true},"bench:amd-intel-energy":{"requirement_id":"GPU-03","decision":"NOT RUN","method":"GPU","cell":"bench:amd-intel-energy","manifest_sha":"c245d50b9","run_id":"amd-intel-energy-20261008-01","evidence":"docs/analysis/class-v6/amd-intel-energy.md","in_progress":false,"coverage":"partial: the 64-register window on AMD and Intel, rate per unit of work (RX 7600 0 percent, Arc B580 -0.3 percent, kernel throughput, quiet) with the B580 fingerprints equal on both packs and the offline RDNA allocation (160 VGPRs, no spill); energy owed (the 7600 job queued, the B580 counter unsupported unelevated); team-run, not under the standard's paired protocol or a wall meter","release_identity":{"commit":"c245d50b9","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"claim_impact":"","reviewer":"","at":"2026-10-08T20:18:52.686Z"}}},{"id":"GPU-04","title":"Find the memory-clock operating ladder","setup":"Use safe vendor-supported settings only; record operator permission and original settings.","steps":["Sweep approved core and memory operating points while holding workload constant.","Measure error rate, accepted throughput, wall energy and thermal equilibrium.","Repeat the selected knee after reboot and restore defaults after a failed or interrupted tuning session."],"accept":"Selected profiles are stable, reproducible and not dependent on unsafe clocks. Every accepted hash remains correct; saved settings restore predictably. Tuning failure leaves a working safe configuration.","evidence":"Clock ladder; safe bounds; thermal/error logs; reboot and rollback record.","priority":"BLOCKER","profile":"P01; P02","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[6,7,8,14,18,23],"gate":"G1 / G2","owner":"GPU lead + three independent operators","manual_page":22,"owner_lane":"hash lane (a690540514aa453d7)","run_status":"NOT RUN","evidence_path":"docs/analysis/class-v6/floor/sm-sparse.md","run_id":"team-2026-10-08","updated":"2026-10-08T20:10:24.556Z","evidence_record":{"reason":"the memory-clock ladder has no harness tonight: the project’s own rig mines nothing under the the earlier devnet off order","at":"2026-10-08T20:10:24.556Z","method":"static","requirement_id":"GPU-04","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"in_progress_since":"2026-10-08 18:3x UK","approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null},"evidence_records":{"record":{"what_was_run":"the memory-clock ladder at the lock (floor lane 1, b1b8d833)","run_by":"hash lane (a690540514aa453d7)","under_the_standard":"no: team-run before the standard's procedure; the status is RUNNING until the case is re-run under its steps with the profile's numbers and an independent run where the profile asks one","pass_or_fail_today":"not judged under the standard yet","method":"static","requirement_id":"GPU-04","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"run_id":"team-2026-10-08","evidence":"docs/analysis/class-v6/floor/sm-sparse.md","in_progress":true}}},{"id":"GPU-05","title":"Test dataset fit and support-horizon costs","setup":"Test 5.5, 8.5 and 11.5 GiB only as source-proposed candidates; F0 determines activated sizes.","steps":["Measure allocation plus driver, display, prover and OS headroom on the 8 GB and other cohort tiers.","Run near-full-memory, fragmentation, restart and next-epoch construction scenarios.","Compare time-sharing/eviction with concurrent mining/proving, including reload cost."],"accept":"Every advertised combination completes without OOM or silent corruption. Unsupported future sizes are identified before activation. GPU exclusions and lost proving capacity appear in ECO evaluation; retirement of a tier is not a success metric.","evidence":"Memory budget per SKU; OOM traces; support horizon; concurrency cost table.","priority":"BLOCKER","profile":"P01; P02; P06","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[6,7,8,14,18,23],"gate":"G1 / G2","owner":"GPU lead + three independent operators","manual_page":22,"owner_lane":"hash lane (a690540514aa453d7)","run_status":"NOT RUN","evidence_path":"docs/analysis/class-v6/rows/run-ca3-pc1-amd-cardin-20261008T1703.md","run_id":"hash-lane-20261008-batch1","updated":"2026-10-08T18:41:01.185Z","evidence_record":{"cell":"bench:pc1-amd","manifest_sha":"c245d50b9","coverage":{"GPU-01":"partial: the 8 GB AMD cell, fingerprints and rates at 1, 2, 4 and 5.5 GiB; one cell of P02's twelve","GPU-05":"partial: the 8 GB tier's fit rows"},"at":"2026-10-08T18:41:01.185Z","method":"GPU","requirement_id":"GPU-05","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"c245d50b9","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"in_progress_since":"2026-10-08T18:41:01.185Z","approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null},"evidence_records":{"bench:pc1-amd":{"cell":"bench:pc1-amd","manifest_sha":"c245d50b9","coverage":{"GPU-01":"partial: the 8 GB AMD cell, fingerprints and rates at 1, 2, 4 and 5.5 GiB; one cell of P02's twelve","GPU-05":"partial: the 8 GB tier's fit rows"},"at":"2026-10-08T18:41:01.185Z","method":"GPU","requirement_id":"GPU-05","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"c245d50b9","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"run_id":"hash-lane-20261008-batch1","evidence":"docs/analysis/class-v6/rows/run-ca3-pc1-amd-cardin-20261008T1703.md","in_progress":true}}},{"id":"GPU-06","title":"Measure accepted work under ordinary connectivity","setup":"Use the same hardware against clean, delayed, lossy and intermittent links in F4.","steps":["Measure kernel rate and accepted work separately under home and datacentre link profiles.","Include reconnects, template changes, expired submissions and pool failover.","Attribute loss to network, local software, validation and protocol causes."],"accept":"Results use accepted work, never kernel rate alone. Ordinary-link incremental rejection stays within P10; all losses remain priced in ECO. Unreachable links may pause but must not claim paid work.","evidence":"Per-submission ledger; network trace; rejection reasons; accepted-work comparison.","priority":"GATE","profile":"P02; P10","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[6,7,8,14,18,23],"gate":"G1 / G2","owner":"GPU lead + three independent operators","manual_page":22,"owner_lane":"fleet lane (ac055d60427caab99)","run_status":"NOT RUN","evidence_path":"","run_id":"","updated":"2026-10-08T19:22:31.798Z","evidence_record":{"reason":"accepted work under ordinary connectivity needs the fault network F4","at":"2026-10-08T19:22:31.798Z","method":"static","requirement_id":"GPU-06","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null},"evidence_records":{"record":{"reason":"accepted work under ordinary connectivity needs the fault network F4","at":"2026-10-08T19:22:31.798Z","method":"static","requirement_id":"GPU-06","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"run_id":"","evidence":"","in_progress":false}}},{"id":"GPU-07","title":"Survive sustained thermal and power operation","setup":"Run the selected profile on actual reference machines for the P02 soak period.","steps":["Track wall power, temperatures, clocks, memory and accepted work continuously.","Inject safe power interruptions, process restarts and normal competing desktop load.","Check restored settings and compare late-run efficiency with the first stable period."],"accept":"No invalid work or unsafe persistent settings; P02/P10 stability limits hold. Thermal throttling, crashes and recovery time remain in throughput and energy denominators. A crash-free short benchmark cannot substitute for the soak.","evidence":"Seven-day time series; crash reports; settings-restoration checks; drift analysis.","priority":"BLOCKER","profile":"P01; P02; P10","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[6,7,8,14,18,23],"gate":"G1 / G2","owner":"GPU lead + three independent operators","manual_page":23,"owner_lane":"hash lane (a690540514aa453d7)","run_status":"NOT RUN","evidence_path":"docs/analysis/class-v6/floor/sm-sparse.md","run_id":"team-2026-10-08","updated":"2026-10-08T20:10:24.556Z","evidence_record":{"reason":"the sustained thermal and power soak has no harness tonight: the project’s own rig mines nothing under the the earlier devnet off order","at":"2026-10-08T20:10:24.556Z","method":"static","requirement_id":"GPU-07","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"in_progress_since":"2026-10-08 18:3x UK","approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null},"evidence_records":{"record":{"what_was_run":"the 5090 lock pass, 66 minutes at 1,300 MHz with the four-minute reserve (floor lane 1)","run_by":"hash lane (a690540514aa453d7)","under_the_standard":"no: team-run before the standard's procedure; the status is RUNNING until the case is re-run under its steps with the profile's numbers and an independent run where the profile asks one","pass_or_fail_today":"not judged under the standard yet","method":"static","requirement_id":"GPU-07","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"run_id":"team-2026-10-08","evidence":"docs/analysis/class-v6/floor/sm-sparse.md","in_progress":true}}},{"id":"GPU-08","title":"Reproduce the full baseline independently","setup":"Three unaffiliated operators receive F0, F2 and F3, including the final miner/prover build.","steps":["Repeat identical-SKU paired runs with documented meter calibration and environment differences.","Recompute joules and total cost per accepted work from the shared raw schema.","Investigate divergence before accepting a pooled headline or uncertainty band."],"accept":"Reproductions meet P02 tolerance and exact correctness. No unexplained divergence or selectively missing low-end cell remains. Report manufactured GPU measurements separately from modelled specialist estimates.","evidence":"Three signed reproduction packs; reconciliation report; final baseline table.","priority":"GATE","profile":"P02","cadence":"Release candidate; repeat after relevant changes","method":"Independent reproduction","status":"NOT RUN","source":[6,7,8,14,18,23],"gate":"G1 / G2","owner":"GPU lead + three independent operators","manual_page":23,"owner_lane":"fleet lane (ac055d60427caab99)","run_status":"NOT RUN","evidence_path":"","run_id":"","updated":"2026-10-08 18:3x UK","approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null}}]},{"code":"POW","title":"Proof-of-work correctness and coupling","source":[7,9,10,23],"gate":"G2 / technical readiness","owner":"Cryptography + GPU lead","fixtures":"F0 rule set; F3 independent CPU/GPU oracles; F5 mutation corpus","summary":"Find semantic disagreements and structural shortcuts before treating a harder-looking program as a stronger defence.","tests":[{"id":"POW-01","title":"Match independent execution across every backend","setup":"Implement an independently written reference evaluator, not a wrapper around the production GPU path.","steps":["Execute the P01 corpus across every family, boundary seed and supported backend.","Exercise zero, maximum, sign, shift, rotate, overflow and unaligned-address cases allowed by the spec.","Minimise every mismatch and rerun it on clean builds."],"accept":"Bit-for-bit agreement for all valid cases and identical rejection for invalid cases. One unexplained mismatch is a blocker. Large sample counts are evidence of testing, not proof that unseen disagreements cannot exist.","evidence":"Reference implementation review; seeds/vectors; backend matrix; mismatch archive.","priority":"BLOCKER","profile":"P01","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[7,9,10,23],"gate":"G2 / technical readiness","owner":"Cryptography + GPU lead","manual_page":24,"owner_lane":"hash lane (a690540514aa453d7)","run_status":"NOT RUN","evidence_path":"docs/analysis/review-2026-10-08-b/f10/emu-test.log; build-1:/srv/artefacts/p01/p01-20261008-01/cuda-5090-hl-v5-win.json; build-1:/srv/artefacts/p01/p01-20261008-01/cuda-4090-hl-v5-win.json; build-1:/srv/artefacts/p01/p01-20261008-01/cuda-3090-hl-v5-win.json; build-1:/srv/artefacts/p01/p01-20261008-01/cuda-5090-hl-v6-all.json; build-1:/srv/artefacts/p01/p01-20261008-01/cuda-4090-hl-v6-all.json; build-1:/srv/artefacts/p01/p01-20261008-01/cuda-3090-hl-v6-all.json; build-1:/srv/artefacts/p01/p01-20261008-01/cuda-5090-hl-v6-foldrw.json; build-1:/srv/artefacts/p01/p01-20261008-01/cuda-4090-hl-v6-foldrw.json; build-1:/srv/artefacts/p01/p01-20261008-01/cuda-3090-hl-v6-foldrw.json; build-1:/srv/artefacts/p01/p01-20261008-01/cuda-5090-hl-v6-all-nowin.json; build-1:/srv/artefacts/p01/p01-20261008-01/cuda-4090-hl-v6-all-nowin.json; build-1:/srv/artefacts/p01/p01-20261008-01/cuda-3090-hl-v6-all-nowin.json","run_id":"p01-20261008-01","updated":"2026-10-08T20:10:24.686Z","evidence_record":{"requirement_id":"POW-01","decision":"NOT RUN","method":"GPU","cell":"harness:p01-vectors","manifest_sha":"417c4a57","run_id":"p01-20261008-01","evidence":"build-1:/srv/artefacts/p01/p01-20261008-01/cuda-5090-hl-v5-win.json; build-1:/srv/artefacts/p01/p01-20261008-01/cuda-4090-hl-v5-win.json; build-1:/srv/artefacts/p01/p01-20261008-01/cuda-3090-hl-v5-win.json; build-1:/srv/artefacts/p01/p01-20261008-01/cuda-5090-hl-v6-all.json; build-1:/srv/artefacts/p01/p01-20261008-01/cuda-4090-hl-v6-all.json; build-1:/srv/artefacts/p01/p01-20261008-01/cuda-3090-hl-v6-all.json; build-1:/srv/artefacts/p01/p01-20261008-01/cuda-5090-hl-v6-foldrw.json; build-1:/srv/artefacts/p01/p01-20261008-01/cuda-4090-hl-v6-foldrw.json; build-1:/srv/artefacts/p01/p01-20261008-01/cuda-3090-hl-v6-foldrw.json; build-1:/srv/artefacts/p01/p01-20261008-01/cuda-5090-hl-v6-all-nowin.json; build-1:/srv/artefacts/p01/p01-20261008-01/cuda-4090-hl-v6-all-nowin.json; build-1:/srv/artefacts/p01/p01-20261008-01/cuda-3090-hl-v6-all-nowin.json","in_progress":false,"coverage":"the million-vector campaign per backend per pack, bit-for-bit; PASS only when every supported backend reads a million vectors with zero disagreement; the malformed-input half is harness:parser-malformed","release_identity":{"commit":"417c4a57 (the node pin at the kit's cut); the kit packs-class-v6-20261008T162324Z.zip 098e64c3…; the worker igneum-worker-cuda 9bfcf728","lockfile":"","binary":"bin/linux/igneum-worker-cuda (the kit's)","network_object":"the class v5 freeze 1c420786, pack hl-v5-win e3da3669 id 0x6554474f410f36f3","activation":"igneum-devnet-4 object be5f4068","profile_hashes":""},"claim_impact":"POW-01's CUDA half on the class v5 object and all three class v6 D1 candidates: a million nonces agree bit-for-bit with the CPU reference on three CUDA generations each; OpenCL and Metal remain","reviewer":"","at":"2026-10-08T20:10:24.686Z"},"in_progress_since":"2026-10-08T20:07:26.255Z","approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null},"evidence_records":{"harness:cuda-select-check":{"cell":"harness:cuda-select-check","manifest_sha":"964cdf6c1","coverage":{"ROT-01":"partial: the worker's high-32 nonce rollover inside a job (a job from 2^32 - 32) finds the same set on both read-back paths and the boundary nonces hash as igneum-pow; the hourly program boundary itself is the fast-time harness","POW-01":"partial: the CUDA select pass equals the full read line for line (zero hits, partial, the all-hit overflow fallback, a 96-nonce tail with a 32-lane launch, queued jobs, hits then zero, the epoch tag) and 17 sampled hashes equal igneum-pow; the million-vector campaign is harness:p01-vectors"},"at":"2026-10-08T20:07:26.255Z","method":"static","requirement_id":"POW-01","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"964cdf6c1","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"run_id":"f10-worker-20261008","evidence":"docs/analysis/review-2026-10-08-b/f10/emu-test.log","in_progress":true},"harness:p01-vectors":{"requirement_id":"POW-01","decision":"NOT RUN","method":"GPU","cell":"harness:p01-vectors","manifest_sha":"417c4a57","run_id":"p01-20261008-01","evidence":"build-1:/srv/artefacts/p01/p01-20261008-01/cuda-5090-hl-v5-win.json; build-1:/srv/artefacts/p01/p01-20261008-01/cuda-4090-hl-v5-win.json; build-1:/srv/artefacts/p01/p01-20261008-01/cuda-3090-hl-v5-win.json; build-1:/srv/artefacts/p01/p01-20261008-01/cuda-5090-hl-v6-all.json; build-1:/srv/artefacts/p01/p01-20261008-01/cuda-4090-hl-v6-all.json; build-1:/srv/artefacts/p01/p01-20261008-01/cuda-3090-hl-v6-all.json; build-1:/srv/artefacts/p01/p01-20261008-01/cuda-5090-hl-v6-foldrw.json; build-1:/srv/artefacts/p01/p01-20261008-01/cuda-4090-hl-v6-foldrw.json; build-1:/srv/artefacts/p01/p01-20261008-01/cuda-3090-hl-v6-foldrw.json; build-1:/srv/artefacts/p01/p01-20261008-01/cuda-5090-hl-v6-all-nowin.json; build-1:/srv/artefacts/p01/p01-20261008-01/cuda-4090-hl-v6-all-nowin.json; build-1:/srv/artefacts/p01/p01-20261008-01/cuda-3090-hl-v6-all-nowin.json","in_progress":false,"coverage":"the million-vector campaign per backend per pack, bit-for-bit; PASS only when every supported backend reads a million vectors with zero disagreement; the malformed-input half is harness:parser-malformed","release_identity":{"commit":"417c4a57 (the node pin at the kit's cut); the kit packs-class-v6-20261008T162324Z.zip 098e64c3…; the worker igneum-worker-cuda 9bfcf728","lockfile":"","binary":"bin/linux/igneum-worker-cuda (the kit's)","network_object":"the class v5 freeze 1c420786, pack hl-v5-win e3da3669 id 0x6554474f410f36f3","activation":"igneum-devnet-4 object be5f4068","profile_hashes":""},"claim_impact":"POW-01's CUDA half on the class v5 object and all three class v6 D1 candidates: a million nonces agree bit-for-bit with the CPU reference on three CUDA generations each; OpenCL and Metal remain","reviewer":"","at":"2026-10-08T20:10:24.686Z"}}},{"id":"POW-02","title":"Validate generated programs and index folding","setup":"Use the frozen grammar, opcode semantics and index-fold rule; include boundary and malformed programs.","steps":["Enumerate small constrained programs and fuzz the full generator at P01 depth.","Check bounds, valid dependencies, address distribution and forbidden encodings.","Compare source-level operations with optimised compiled code for removed or altered work."],"accept":"No accepted program violates semantics, termination or memory bounds. Distribution claims have predeclared tests and effect-size limits; passing randomness checks is not treated as a cryptographic proof.","evidence":"Generator/fuzzer logs; reduced counterexamples; disassembly comparison; index tests.","priority":"BLOCKER","profile":"P01","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[7,9,10,23],"gate":"G2 / technical readiness","owner":"Cryptography + GPU lead","manual_page":24,"owner_lane":"hash lane (a690540514aa453d7)","run_status":"NOT RUN","evidence_path":"docs/analysis/review-2026-10-08-b/f10/packfile-test.log;docs/analysis/review-2026-10-08-b/f10/geometry-check-mini.log; docs/analysis/class-v6/family-gate.md","run_id":"family-gate-20261008b","updated":"2026-10-08T20:38:55.360Z","evidence_record":{"requirement_id":"POW-02","decision":"NOT RUN","method":"native","cell":"harness:family-gate","manifest_sha":"ac86d7910","run_id":"family-gate-20261008b","evidence":"docs/analysis/class-v6/family-gate.md","in_progress":false,"coverage":"partial: the acceptance rule's measured rates on drawn classes (the per-candidate rejection, the attempt histogram, the exhaustion count against the independent-attempt arithmetic, the (c'') and (c''') floors' refuse rates and the pre-floor ratio spread per width), the per-site largest-bucket and index-bit statistics at the rule's own 2^20 sample with the seven known-failed seeds (p4, p8, p10, p34, p212, p225, p15), and the F8-form census at 2^20 on the F8 seed set where the attack-f8 mirror validates (0 of 96 warps mismatching); the semantics, termination and memory-bound half and the independent re-implementation are the suite's and the hash lane's; the effect-size limits are the family-gate.md thresholds, predeclared in its section 3","release_identity":{"commit":"ac86d7910","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"claim_impact":"","reviewer":"","at":"2026-10-08T20:38:55.360Z"},"in_progress_since":"2026-10-08T20:07:26.255Z","approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null},"evidence_records":{"harness:pack-geometry":{"cell":"harness:pack-geometry","manifest_sha":"964cdf6c1","coverage":{"POW-02":"partial: the dataset geometry rule (exact word count, items, multiply-shift, 64-bit bytes, the floor-log2 and 2^32 refusals, missing leaves) agrees across the CUDA and OpenCL loader and the Metal host on 19 conformance vectors and the two checked-in packs (master review I06, gate INT-10); the rest of POW-02 is suite:pow"},"at":"2026-10-08T20:07:26.255Z","method":"static","requirement_id":"POW-02","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"964cdf6c1","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"run_id":"f10-worker-20261008","evidence":"docs/analysis/review-2026-10-08-b/f10/packfile-test.log;docs/analysis/review-2026-10-08-b/f10/geometry-check-mini.log","in_progress":true},"harness:family-gate":{"requirement_id":"POW-02","decision":"NOT RUN","method":"native","cell":"harness:family-gate","manifest_sha":"ac86d7910","run_id":"family-gate-20261008b","evidence":"docs/analysis/class-v6/family-gate.md","in_progress":false,"coverage":"partial: the acceptance rule's measured rates on drawn classes (the per-candidate rejection, the attempt histogram, the exhaustion count against the independent-attempt arithmetic, the (c'') and (c''') floors' refuse rates and the pre-floor ratio spread per width), the per-site largest-bucket and index-bit statistics at the rule's own 2^20 sample with the seven known-failed seeds (p4, p8, p10, p34, p212, p225, p15), and the F8-form census at 2^20 on the F8 seed set where the attack-f8 mirror validates (0 of 96 warps mismatching); the semantics, termination and memory-bound half and the independent re-implementation are the suite's and the hash lane's; the effect-size limits are the family-gate.md thresholds, predeclared in its section 3","release_identity":{"commit":"ac86d7910","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"claim_impact":"","reviewer":"","at":"2026-10-08T20:38:55.360Z"}}},{"id":"POW-03","title":"Test whether live state is unavoidable","setup":"Take the 64-register candidate and the cheapest independently proposed storage organisations.","steps":["Trace value liveness across dependent reads and final output, distinguishing distinct information from duplicated values.","Try banking, compression, recomputation, fewer ports and time-multiplexed contexts.","Quantify the best complete-system cost/throughput trade-off rather than the reference register count."],"accept":"Production selection is supported by measured or physically modelled penalties after these alternatives. G2 requires the P03 improvement; an attractive source-level register count alone does not pass.","evidence":"Liveness traces; alternative implementations; Pareto table; reviewer analysis.","priority":"GATE","profile":"P03; P04","cadence":"Release candidate; repeat after relevant changes","method":"Experiment + independent hardware review","status":"NOT RUN","source":[7,9,10,23],"gate":"G2 / technical readiness","owner":"Cryptography + GPU lead","manual_page":24,"owner_lane":"adversary lane (a1a9876a88f5a72fc)","run_status":"FAIL","evidence_path":"docs/analysis/class-v6/connected-state.md; docs/analysis/class-v6; docs/analysis/class-v6/multi-family-adversary.md","run_id":"adversary-20261008-placed-8lane","updated":"2026-10-08T20:41:20.327Z","evidence_record":{"requirement_id":"POW-03","decision":"NOT RUN","method":"model","cell":"adversary:mf-placed","manifest_sha":"3a8874fef","run_id":"adversary-20261008-placed-8lane","evidence":"docs/analysis/class-v6/multi-family-adversary.md","in_progress":true,"coverage":"partial: the live state held in an SRAM macro per 8 lanes with a time-multiplexed single port and operand isolation, the complete-system cost in section 6; the liveness trace itself is the connected-state lane's tool","release_identity":{"commit":"3a8874fef","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"claim_impact":"","reviewer":"","at":"2026-10-08T20:41:20.327Z"},"approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null},"evidence_records":{"record":{"what_was_run":"the connected-state class KILLED (1.10x against the 1.25x gate; live state costs a clock-gated file nothing)","run_by":"adversary lane (a1a9876a88f5a72fc)","under_the_standard":"no: team-run before the standard's procedure; the status is RUNNING until the case is re-run under its steps with the profile's numbers and an independent run where the profile asks one","pass_or_fail_today":"not judged under the standard yet","method":"static","requirement_id":"POW-03","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"run_id":"team-2026-10-08","evidence":"docs/analysis/class-v6/connected-state.md","in_progress":true},"experiment:connected-state":{"requirement_id":"POW-03","decision":"FAIL","method":"GPU","cell":"experiment:connected-state","manifest_sha":"7cfa422a","run_id":"kills-20261008","evidence":"docs/analysis/class-v6","in_progress":false,"coverage":"the experiment ran and its claim failed: live state does not make the work unavoidable for a chip; the master's register row 18 reads FAIL, published, never PASSED","release_identity":{"commit":"7cfa422a","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"claim_impact":"the claims the two experiments carried are withdrawn: live state as an ASIC barrier (connected state), a cheaper mixed-FP32 lane","reviewer":"","at":"2026-10-08T20:10:24.624Z"},"adversary:mf-placed":{"requirement_id":"POW-03","decision":"NOT RUN","method":"model","cell":"adversary:mf-placed","manifest_sha":"3a8874fef","run_id":"adversary-20261008-placed-8lane","evidence":"docs/analysis/class-v6/multi-family-adversary.md","in_progress":true,"coverage":"partial: the live state held in an SRAM macro per 8 lanes with a time-multiplexed single port and operand isolation, the complete-system cost in section 6; the liveness trace itself is the connected-state lane's tool","release_identity":{"commit":"3a8874fef","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"claim_impact":"","reviewer":"","at":"2026-10-08T20:41:20.327Z"}}},{"id":"POW-04","title":"Evaluate connected-resource restructuring","setup":"Use a candidate initially matched to baseline instruction count, read count and dataset size.","steps":["Connect state, addresses, arithmetic and lane communication according to the written hypothesis.","Measure GPU cost and allow the specialist reviewer to redesign the entire core.","Repeat on held-out program seeds and compare the worst supported adversary, not only the original design."],"accept":"The selected upgrade meets P03 and improves the adversarial result outside declared uncertainty. A negative experiment remains a negative outcome; adopting a different design requires a new frozen comparison.","evidence":"Matched workloads; GPU runs; redesigned core estimates; held-out results.","priority":"GATE","profile":"P03; P04","cadence":"Release candidate; repeat after relevant changes","method":"Controlled experiment","status":"NOT RUN","source":[7,9,10,23],"gate":"G2 / technical readiness","owner":"Cryptography + GPU lead","manual_page":25,"owner_lane":"adversary lane (a1a9876a88f5a72fc)","run_status":"NOT RUN","evidence_path":"docs/analysis/class-v6/connected-state.md; docs/analysis/class-v6/multi-family-adversary.md","run_id":"adversary-20261008-placed-8lane","updated":"2026-10-08T20:41:20.327Z","evidence_record":{"requirement_id":"POW-04","decision":"NOT RUN","method":"model","cell":"adversary:mf-placed","manifest_sha":"3a8874fef","run_id":"adversary-20261008-placed-8lane","evidence":"docs/analysis/class-v6/multi-family-adversary.md","in_progress":true,"coverage":"partial: the 64-register window's cost on the macro core (sections 4 and 5, agreeing with the k lane's gated-flop row within 5 percent); the restructured candidate's GPU cost is the invention lane's","release_identity":{"commit":"3a8874fef","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"claim_impact":"","reviewer":"","at":"2026-10-08T20:41:20.327Z"},"in_progress_since":"2026-10-08 18:3x UK","approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null},"evidence_records":{"record":{"what_was_run":"the same experiment, D2(a) closed","run_by":"adversary lane (a1a9876a88f5a72fc)","under_the_standard":"no: team-run before the standard's procedure; the status is RUNNING until the case is re-run under its steps with the profile's numbers and an independent run where the profile asks one","pass_or_fail_today":"not judged under the standard yet","method":"static","requirement_id":"POW-04","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"run_id":"team-2026-10-08","evidence":"docs/analysis/class-v6/connected-state.md","in_progress":true},"adversary:mf-placed":{"requirement_id":"POW-04","decision":"NOT RUN","method":"model","cell":"adversary:mf-placed","manifest_sha":"3a8874fef","run_id":"adversary-20261008-placed-8lane","evidence":"docs/analysis/class-v6/multi-family-adversary.md","in_progress":true,"coverage":"partial: the 64-register window's cost on the macro core (sections 4 and 5, agreeing with the k lane's gated-flop row within 5 percent); the restructured candidate's GPU cost is the invention lane's","release_identity":{"commit":"3a8874fef","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"claim_impact":"","reviewer":"","at":"2026-10-08T20:41:20.327Z"}}},{"id":"POW-05","title":"Prevent amortised cheap winning attempts","setup":"Prepare valid templates, nonces, intermediate-state captures and independent acceptance checks.","steps":["Vary nonce, payout identity, transactions, roots and other committed fields after expensive work.","Try replay, precomputation, shared prefixes, partial evaluation and many cheap suffix candidates.","Price any valid strategy against fresh evaluation; independently review all bindings."],"accept":"Invalid modifications are rejected. Any valid cost-saving strategy is incorporated into ADV and must still meet P04/ECO gates. No unresolved shortcut is hidden behind passing reference vectors.","evidence":"Attack implementations; valid/invalid controls; work-cost analysis; binding review.","priority":"BLOCKER","profile":"P01; P04","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[7,9,10,23],"gate":"G2 / technical readiness","owner":"Cryptography + GPU lead","manual_page":25,"owner_lane":"pool design seat (a3832b1c3b274b310)","run_status":"NOT RUN","evidence_path":"docs/analysis/binding-review-2026-10.md (sections 1 to 5a; master ad5a54c5)","run_id":"binding-review-2026-10-08-a05","updated":"2026-10-08T20:10:24.556Z","evidence_record":{"reason":"amortised cheap winning attempts are the attack lanes' grind and era harnesses (tools/attack/f7-era, f9-grind), not in the release matrix; their rows come from those lanes","at":"2026-10-08T20:10:24.556Z","method":"static","requirement_id":"POW-05","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"status_note":"REVIEWED: fixed by construction (binding), not applicable (final digest); native tests ok on build-2; no change for 2.0","approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null},"evidence_records":{"record":{"what_was_run":"the binding review: twelve reuse paths, none below the honest cost; five open questions B1 to B5","run_by":"pool design seat (a3832b1c3b274b310)","under_the_standard":"no: team-run before the standard's procedure; the status is RUNNING until the case is re-run under its steps with the profile's numbers and an independent run where the profile asks one","pass_or_fail_today":"not judged under the standard yet","method":"static","requirement_id":"POW-05","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"run_id":"binding-review-2026-10-08-a05","evidence":"docs/analysis/binding-review-2026-10.md (sections 1 to 5a; master ad5a54c5)","in_progress":false}}},{"id":"POW-06","title":"Bound verifier work and malformed-input cost","setup":"Use ordinary CPU validators with a manifest-defined resource budget and untrusted submissions.","steps":["Submit shortest/longest programs, malformed encodings and adversarial memory references.","Measure verification time, peak memory and work amplification across valid and invalid inputs.","Sustain the approved hostile request rate while ordinary valid traffic continues."],"accept":"All semantics remain correct and P09 resource budgets hold. Invalid traffic cannot cause unbounded allocation, crashes or disproportionate free work. Rate limits must not replace consensus validation.","evidence":"CPU profiles; adversarial corpus; allocation traces; valid-traffic latency.","priority":"BLOCKER","profile":"P01; P09","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[7,9,10,23],"gate":"G2 / technical readiness","owner":"Cryptography + GPU lead","manual_page":25,"owner_lane":"hash lane (a690540514aa453d7)","run_status":"NOT RUN","evidence_path":"build-1:/srv/artefacts/tas/p01-partb-20261008-01/summary.jsonl","run_id":"p01-partb-20261008-01","updated":"2026-10-08T18:28:32.463Z","evidence_record":{"cell":"harness:parser-malformed","manifest_sha":"417c4a57","coverage":{"POW-06":"partial: three parsers of external bytes (the state stream, the igneum_ RPC params, the pool job line), ten thousand seeded malformed cases each, zero panics, every case under 500 ms (the slowest 152 microseconds); 'accepted' counts mutations that left a valid input, not a parser fault; the verifier work bound (the other half of the accept text) is the proving lane's measurement"},"at":"2026-10-08T18:28:32.463Z","method":"static","requirement_id":"POW-06","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"417c4a57","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"in_progress_since":"2026-10-08T18:28:32.463Z","approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null},"evidence_records":{"harness:parser-malformed":{"cell":"harness:parser-malformed","manifest_sha":"417c4a57","coverage":{"POW-06":"partial: three parsers of external bytes (the state stream, the igneum_ RPC params, the pool job line), ten thousand seeded malformed cases each, zero panics, every case under 500 ms (the slowest 152 microseconds); 'accepted' counts mutations that left a valid input, not a parser fault; the verifier work bound (the other half of the accept text) is the proving lane's measurement"},"at":"2026-10-08T18:28:32.463Z","method":"static","requirement_id":"POW-06","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"417c4a57","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"run_id":"p01-partb-20261008-01","evidence":"build-1:/srv/artefacts/tas/p01-partb-20261008-01/summary.jsonl","in_progress":true}}},{"id":"POW-07","title":"Constrain any mixed-resource or FP32 branch","setup":"If this branch is excluded, verify that it is unreachable and not claimed; if included, use a separate frozen candidate.","steps":["Specify exact rounding, fusion, special values and backend behaviour before compiling.","Differentially test all supported architectures and allow numerical-domain simplification in the specialist model.","Include verifier cost and candidate energy in P03/P04, not just arithmetic-unit area."],"accept":"Included branches achieve exact agreed semantics and all hardware budgets. An excluded branch earns no performance credit. No approximate operation or unspecified compiler choice enters consensus.","evidence":"Scope decision; semantic specification; vectors; simplified datapath model.","priority":"BLOCKER","profile":"P00; P01; P03","cadence":"Release candidate; repeat after relevant changes","method":"Conditional implementation test","status":"NOT RUN","source":[7,9,10,23],"gate":"G2 / technical readiness","owner":"Cryptography + GPU lead","manual_page":26,"owner_lane":"hash lane (a690540514aa453d7)","run_status":"FAIL","evidence_path":"docs/analysis/class-v6/rows/pow-07-fp32-unreachable.md; docs/analysis/class-v6","run_id":"kills-20261008","updated":"2026-10-08T20:10:24.624Z","evidence_record":{"requirement_id":"POW-07","decision":"FAIL","method":"GPU","cell":"experiment:mixed-fp32","manifest_sha":"7cfa422a","run_id":"kills-20261008","evidence":"docs/analysis/class-v6","in_progress":false,"coverage":"the branch ran and its claim failed: the FP32 branch costs the card more energy and widens the chip edge; the master's register row 12 reads FAIL, published; the branch is excluded and unreachable on master (the grep evidence stays)","release_identity":{"commit":"7cfa422a","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"claim_impact":"the claims the two experiments carried are withdrawn: live state as an ASIC barrier (connected state), a cheaper mixed-FP32 lane","reviewer":"","at":"2026-10-08T20:10:24.624Z"},"approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null},"evidence_records":{"suite:pow":{"cell":"suite:pow","manifest_sha":"b24dfc162","coverage":{"POW-02":"partial: program derivation, ds55 geometry, the v6 fold, the packs and the spec read-back tests; the independent re-implementation and the index-fold census are the hash lane's harnesses","POW-08":"partial: the freeze list and the generator version pin; the public-claim scrub is the site gate's","POW-07":"the mixed FP32 branch is excluded and unreachable: no class flag reaches an FP op in igneum-pow on master (the mixedfp lane's branch is not on master); evidence the grep of the emitters on master, recorded by the hash lane"},"at":"2026-10-08T19:59:34.316Z","method":"native","requirement_id":"POW-07","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"b24dfc162","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"run_id":"hash-lane-20261008-batch2","evidence":"docs/analysis/class-v6/rows/pow-07-fp32-unreachable.md","in_progress":true},"experiment:mixed-fp32":{"requirement_id":"POW-07","decision":"FAIL","method":"GPU","cell":"experiment:mixed-fp32","manifest_sha":"7cfa422a","run_id":"kills-20261008","evidence":"docs/analysis/class-v6","in_progress":false,"coverage":"the branch ran and its claim failed: the FP32 branch costs the card more energy and widens the chip edge; the master's register row 12 reads FAIL, published; the branch is excluded and unreachable on master (the grep evidence stays)","release_identity":{"commit":"7cfa422a","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"claim_impact":"the claims the two experiments carried are withdrawn: live state as an ASIC barrier (connected state), a cheaper mixed-FP32 lane","reviewer":"","at":"2026-10-08T20:10:24.624Z"}}},{"id":"POW-08","title":"Keep rejected mechanisms out of the shipped claim","setup":"Inventory long programs, select trees, SM gating, wider reads, sealed classes, random epoch lengths, per-tier scoring and VRF draws.","steps":["Retain their historic negative tests and realistic SRAM instruction-memory control.","Inspect the release for reintroduction through renamed settings or hidden paths.","Require a new written hypothesis and complete adversarial retest for any proposed return."],"accept":"Excluded levers remain excluded unless separately approved and retested. Flip-flop instruction-memory area is never presented as the cost of a realistic SRAM implementation.","evidence":"Decision register; binary/config scan; negative-control results.","priority":"GATE","profile":"P00; P03","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[7,9,10,23],"gate":"G2 / technical readiness","owner":"Cryptography + GPU lead","manual_page":26,"owner_lane":"hash lane (a690540514aa453d7)","run_status":"NOT RUN","evidence_path":"docs/analysis/class-v6/rows/pow-07-fp32-unreachable.md","run_id":"hash-lane-20261008-batch2","updated":"2026-10-08T19:59:34.316Z","evidence_record":{"cell":"suite:pow","manifest_sha":"b24dfc162","coverage":{"POW-02":"partial: program derivation, ds55 geometry, the v6 fold, the packs and the spec read-back tests; the independent re-implementation and the index-fold census are the hash lane's harnesses","POW-08":"partial: the freeze list and the generator version pin; the public-claim scrub is the site gate's","POW-07":"the mixed FP32 branch is excluded and unreachable: no class flag reaches an FP op in igneum-pow on master (the mixedfp lane's branch is not on master); evidence the grep of the emitters on master, recorded by the hash lane"},"at":"2026-10-08T19:59:34.316Z","method":"native","requirement_id":"POW-08","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"b24dfc162","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"in_progress_since":"2026-10-08T19:59:34.316Z","approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null},"evidence_records":{"suite:pow":{"cell":"suite:pow","manifest_sha":"b24dfc162","coverage":{"POW-02":"partial: program derivation, ds55 geometry, the v6 fold, the packs and the spec read-back tests; the independent re-implementation and the index-fold census are the hash lane's harnesses","POW-08":"partial: the freeze list and the generator version pin; the public-claim scrub is the site gate's","POW-07":"the mixed FP32 branch is excluded and unreachable: no class flag reaches an FP op in igneum-pow on master (the mixedfp lane's branch is not on master); evidence the grep of the emitters on master, recorded by the hash lane"},"at":"2026-10-08T19:59:34.316Z","method":"native","requirement_id":"POW-08","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"b24dfc162","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"run_id":"hash-lane-20261008-batch2","evidence":"docs/analysis/class-v6/rows/pow-07-fp32-unreachable.md","in_progress":true}}}]},{"code":"ADV","title":"Programmable specialist adversaries","source":[8,10,12,22,23],"gate":"G3","owner":"Independent hardware team","fixtures":"F2 reference GPUs; F6 RTL/physical models; all published families","summary":"Give the opponent permission to adapt, share resources and remain operational; test cost rather than imagined chip death.","tests":[{"id":"ADV-01","title":"Build a multi-family programmable opponent","setup":"Provide the complete published family bank and future known parameter schedule to the reviewer.","steps":["Design one programmable architecture that supports all retained families, including firmware and emulation paths.","Optimise clocks, lanes, ports and pipelines without requiring a graphics-card layout.","Verify its outputs against POW vectors before measuring any advantage."],"accept":"At least the P04 design diversity is evaluated; every estimated competitive design is functionally validated. Inability of one narrow design to adapt is not evidence that all chips expire.","evidence":"Architecture reports; functional simulations; adaptation matrix; reviewer signature.","priority":"GATE","profile":"P01; P04","cadence":"Release candidate; repeat after relevant changes","method":"Independent hardware study","status":"NOT RUN","source":[8,10,12,22,23],"gate":"G3","owner":"Independent hardware team","manual_page":27,"owner_lane":"adversary lane (a1a9876a88f5a72fc)","run_status":"NOT RUN","evidence_path":"docs/analysis/class-v6/multi-family-adversary.md","run_id":"adversary-20261008-placed-8lane","updated":"2026-10-08T20:41:20.327Z","evidence_record":{"requirement_id":"ADV-01","decision":"NOT RUN","method":"model","cell":"adversary:mf-placed","manifest_sha":"3a8874fef","run_id":"adversary-20261008-placed-8lane","evidence":"docs/analysis/class-v6/multi-family-adversary.md","in_progress":true,"coverage":"the mf core (18 families, SRAM window and imem macros, operand isolation, 5-phase port) placed and routed on ASAP7 with SPEF and a gate-level VCD; k per family and per draw; outputs checked against the RTL simulation's checksums per tag, not yet against the POW vectors (owed)","release_identity":{"commit":"3a8874fef","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"claim_impact":"","reviewer":"","at":"2026-10-08T20:41:20.327Z"},"in_progress_since":"2026-10-08 18:3x UK","approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null},"evidence_records":{"record":{"what_was_run":"the 18-family programmable core placed and routed (9.36 pJ per lane-op, k 0.64 same-node)","run_by":"adversary lane (a1a9876a88f5a72fc)","under_the_standard":"no: team-run before the standard's procedure; the status is RUNNING until the case is re-run under its steps with the profile's numbers and an independent run where the profile asks one","pass_or_fail_today":"not judged under the standard yet","method":"static","requirement_id":"ADV-01","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"run_id":"team-2026-10-08","evidence":"docs/analysis/class-v6/multi-family-adversary.md","in_progress":true},"adversary:mf-placed":{"requirement_id":"ADV-01","decision":"NOT RUN","method":"model","cell":"adversary:mf-placed","manifest_sha":"3a8874fef","run_id":"adversary-20261008-placed-8lane","evidence":"docs/analysis/class-v6/multi-family-adversary.md","in_progress":true,"coverage":"the mf core (18 families, SRAM window and imem macros, operand isolation, 5-phase port) placed and routed on ASAP7 with SPEF and a gate-level VCD; k per family and per draw; outputs checked against the RTL simulation's checksums per tag, not yet against the POW vectors (owed)","release_identity":{"commit":"3a8874fef","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"claim_impact":"","reviewer":"","at":"2026-10-08T20:41:20.327Z"}}},{"id":"ADV-02","title":"Price shared, reduced and reconstructed memory","setup":"Allow multiple engines to share a dataset and to store selected fractions rather than a complete per-engine copy.","steps":["Sweep sharing factors, memory fractions, caches and recomputation depth across many simultaneous hashes.","Include construction/update amortisation, bandwidth contention and retained state.","Take the most favourable feasible point for the specialist into the complete-board model."],"accept":"No omitted feasible trade-off materially lowers the accepted cost estimate. Any winning alternative is included in P04 and ECO; capacity alone is not accepted as an energy bound.","evidence":"Sweep definitions; energy/bandwidth data; best-feasible envelope; excluded-design reasons.","priority":"GATE","profile":"P04","cadence":"Release candidate; repeat after relevant changes","method":"Model + adversarial implementation","status":"NOT RUN","source":[8,10,12,22,23],"gate":"G3","owner":"Independent hardware team","manual_page":27,"owner_lane":"adversary lane (a1a9876a88f5a72fc)","run_status":"NOT RUN","evidence_path":"docs/analysis/class-v6/multi-family-adversary.md","run_id":"adversary-20261008-placed-8lane","updated":"2026-10-08T20:41:20.327Z","evidence_record":{"requirement_id":"ADV-02","decision":"NOT RUN","method":"model","cell":"adversary:d2b","manifest_sha":"3a8874fef","run_id":"adversary-20261008-placed-8lane","evidence":"docs/analysis/class-v6/multi-family-adversary.md","in_progress":true,"coverage":"memory sharing, partial stores at the measured window-layer hit rates (and hit 0.50 with layer 8 off), recomputation and the set-up amortisation on the complete board (section 13); the formal memory model's terms (section 16)","release_identity":{"commit":"3a8874fef","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"claim_impact":"","reviewer":"","at":"2026-10-08T20:41:20.327Z"},"in_progress_since":"2026-10-08 18:3x UK","approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null},"evidence_records":{"record":{"what_was_run":"D2(b): the stored-half hybrid, memory sharing, recomputation priced (the placed hybrid 1.93x same-node at the mean hit)","run_by":"adversary lane (a1a9876a88f5a72fc)","under_the_standard":"no: team-run before the standard's procedure; the status is RUNNING until the case is re-run under its steps with the profile's numbers and an independent run where the profile asks one","pass_or_fail_today":"not judged under the standard yet","method":"static","requirement_id":"ADV-02","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"run_id":"team-2026-10-08","evidence":"docs/analysis/class-v6/multi-family-adversary.md","in_progress":true},"adversary:d2b":{"requirement_id":"ADV-02","decision":"NOT RUN","method":"model","cell":"adversary:d2b","manifest_sha":"3a8874fef","run_id":"adversary-20261008-placed-8lane","evidence":"docs/analysis/class-v6/multi-family-adversary.md","in_progress":true,"coverage":"memory sharing, partial stores at the measured window-layer hit rates (and hit 0.50 with layer 8 off), recomputation and the set-up amortisation on the complete board (section 13); the formal memory model's terms (section 16)","release_identity":{"commit":"3a8874fef","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"claim_impact":"","reviewer":"","at":"2026-10-08T20:41:20.327Z"}}},{"id":"ADV-03","title":"Attack with data-local and hybrid execution","setup":"Permit distributed memories, state migration and companion CPU/GPU/FPGA components.","steps":["Compare moving computation, intermediate state or fetched data to each read location.","Test specialised mining alongside outsourced proof generation rather than assuming one physical GPU does both.","Include interconnect, host, synchronisation, idle and conversion costs."],"accept":"The cheapest feasible combined system is included in the adversarial envelope and economic model. A worker identity or account is never treated as proof of a single physical device.","evidence":"Hybrid architecture diagrams; traffic traces; system cost and energy ledger.","priority":"GATE","profile":"P04","cadence":"Release candidate; repeat after relevant changes","method":"Independent system modelling","status":"NOT RUN","source":[8,10,12,22,23],"gate":"G3","owner":"Independent hardware team","manual_page":27,"owner_lane":"adversary lane (a1a9876a88f5a72fc)","run_status":"NOT RUN","evidence_path":"docs/analysis/class-v6/multi-family-adversary.md","run_id":"adversary-20261008-placed-8lane","updated":"2026-10-08T20:41:20.327Z","evidence_record":{"requirement_id":"ADV-03","decision":"NOT RUN","method":"model","cell":"adversary:mf-placed","manifest_sha":"3a8874fef","run_id":"adversary-20261008-placed-8lane","evidence":"docs/analysis/class-v6/multi-family-adversary.md","in_progress":true,"coverage":"the data-local, hybrid and companion-host rows of multi-family-adversary.md sections 11, 13 and 14 (bit counts closed-form; the hop and wire energies claimed)","release_identity":{"commit":"3a8874fef","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"claim_impact":"","reviewer":"","at":"2026-10-08T20:41:20.327Z"},"in_progress_since":"2026-10-08 18:3x UK","approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null},"evidence_records":{"record":{"what_was_run":"data-local execution moves nothing (2,112 bits of live state against an 80-bit read)","run_by":"adversary lane (a1a9876a88f5a72fc)","under_the_standard":"no: team-run before the standard's procedure; the status is RUNNING until the case is re-run under its steps with the profile's numbers and an independent run where the profile asks one","pass_or_fail_today":"not judged under the standard yet","method":"static","requirement_id":"ADV-03","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"run_id":"team-2026-10-08","evidence":"docs/analysis/class-v6/multi-family-adversary.md","in_progress":true},"adversary:mf-placed":{"requirement_id":"ADV-03","decision":"NOT RUN","method":"model","cell":"adversary:mf-placed","manifest_sha":"3a8874fef","run_id":"adversary-20261008-placed-8lane","evidence":"docs/analysis/class-v6/multi-family-adversary.md","in_progress":true,"coverage":"the data-local, hybrid and companion-host rows of multi-family-adversary.md sections 11, 13 and 14 (bit counts closed-form; the hop and wire energies claimed)","release_identity":{"commit":"3a8874fef","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"claim_impact":"","reviewer":"","at":"2026-10-08T20:41:20.327Z"}}},{"id":"ADV-04","title":"Measure profitable selective participation","setup":"Use all declared families plus held-out generated programs and the protocol difficulty rule.","steps":["Identify favourable execution paths and add cheap fallbacks for other periods.","Simulate entry/exit around profitable periods, including idle time, compilation and re-entry costs.","Evaluate revenue and costs across the full schedule, not just average program energy."],"accept":"Intermittent specialists meet P04/ECO limits when evaluated on full-period economics. A weak tail cannot be concealed by a favourable mean; known valid shortcuts must be priced.","evidence":"Per-program advantage distribution; policy simulator; full-period returns.","priority":"GATE","profile":"P04; P12","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[8,10,12,22,23],"gate":"G3","owner":"Independent hardware team","manual_page":28,"owner_lane":"adversary lane (a1a9876a88f5a72fc)","run_status":"NOT RUN","evidence_path":"docs/analysis/class-v6/multi-family-adversary.md","run_id":"adversary-20261008-placed-8lane","updated":"2026-10-08T20:41:20.327Z","evidence_record":{"requirement_id":"ADV-04","decision":"NOT RUN","method":"model","cell":"adversary:d2b","manifest_sha":"3a8874fef","run_id":"adversary-20261008-placed-8lane","evidence":"docs/analysis/class-v6/multi-family-adversary.md","in_progress":true,"coverage":"selective participation over 2,000 era draws under the layer 1 band with two reserve families live per epoch, the specialist's revenue against its ratio gain (section 13); downtime and re-entry priced as the DAA window's lag, not simulated against the difficulty rule itself (owed)","release_identity":{"commit":"3a8874fef","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"claim_impact":"","reviewer":"","at":"2026-10-08T20:41:20.327Z"},"in_progress_since":"2026-10-08 18:3x UK","approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null},"evidence_records":{"record":{"what_was_run":"selective participation 9 percent spread across 2,000 era draws","run_by":"adversary lane (a1a9876a88f5a72fc)","under_the_standard":"no: team-run before the standard's procedure; the status is RUNNING until the case is re-run under its steps with the profile's numbers and an independent run where the profile asks one","pass_or_fail_today":"not judged under the standard yet","method":"static","requirement_id":"ADV-04","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"run_id":"team-2026-10-08","evidence":"docs/analysis/class-v6/multi-family-adversary.md","in_progress":true},"adversary:d2b":{"requirement_id":"ADV-04","decision":"NOT RUN","method":"model","cell":"adversary:d2b","manifest_sha":"3a8874fef","run_id":"adversary-20261008-placed-8lane","evidence":"docs/analysis/class-v6/multi-family-adversary.md","in_progress":true,"coverage":"selective participation over 2,000 era draws under the layer 1 band with two reserve families live per epoch, the specialist's revenue against its ratio gain (section 13); downtime and re-entry priced as the DAA window's lag, not simulated against the difficulty rule itself (owed)","release_identity":{"commit":"3a8874fef","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"claim_impact":"","reviewer":"","at":"2026-10-08T20:41:20.327Z"}}},{"id":"ADV-05","title":"Validate physical and complete-board costs","setup":"Use feasible process/library assumptions and documented component boundaries; no fabricated foundry access.","steps":["Model SRAM macros, ports, wiring, clocking, memory PHYs, external memory, host and power conversion.","Run place-and-route where available; mark unmodelled items as uncertainty rather than zero.","Compare against a calibrated existing hardware block or equivalent validation case."],"accept":"No decision-critical cost is omitted. Physically unvalidated or proprietary estimates are labelled and independently bounded; synthesis alone cannot earn a manufactured-chip claim.","evidence":"Netlist/physical reports; macro assumptions; bill of materials; model calibration.","priority":"GATE","profile":"P04","cadence":"Release candidate; repeat after relevant changes","method":"Independent physical-design review","status":"NOT RUN","source":[8,10,12,22,23],"gate":"G3","owner":"Independent hardware team","manual_page":28,"owner_lane":"k lane (a3c9601a6d4686fe1)","run_status":"NOT RUN","evidence_path":"docs/analysis/class-v6/multi-family-adversary.md; docs/analysis/class-v6/floor/shadow-k.md; docs/analysis/class-v6/multi-family-adversary.md","run_id":"adversary-20261008-placed-8lane","updated":"2026-10-08T20:41:20.327Z","evidence_record":{"requirement_id":"ADV-05","decision":"NOT RUN","method":"model","cell":"adversary:mf-placed","manifest_sha":"3a8874fef","run_id":"adversary-20261008-placed-8lane","evidence":"docs/analysis/class-v6/multi-family-adversary.md","in_progress":true,"coverage":"partial: the SRAM macros, ports, wiring, clocking and the complete-board terms are modelled in sections 2.3, 5 and 6 with the unmodelled items carried as uncertainty; the calibration against an existing hardware block is the k lane's bare-lane row beside it, owed as a named comparison","release_identity":{"commit":"3a8874fef","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"claim_impact":"","reviewer":"","at":"2026-10-08T20:41:20.327Z"},"in_progress_since":"2026-10-08 18:3x UK","approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null},"evidence_records":{"record":{"what_was_run":"the complete GDDR7 machine 1.5x same-node, 1.8x a node ahead at the placed energy; the honest same-node bracket 1.5x to 2.1x: FAIL against P04 at R_E 1.5, served as such","run_by":"k lane (a3c9601a6d4686fe1)","under_the_standard":"no: team-run before the standard's procedure; the status is RUNNING until the case is re-run under its steps with the profile's numbers and an independent run where the profile asks one","pass_or_fail_today":"FAIL against P04 at R_E 1.5","method":"static","requirement_id":"ADV-05","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"run_id":"team-2026-10-08","evidence":"docs/analysis/class-v6/multi-family-adversary.md; docs/analysis/class-v6/floor/shadow-k.md","in_progress":true},"adversary:mf-placed":{"requirement_id":"ADV-05","decision":"NOT RUN","method":"model","cell":"adversary:mf-placed","manifest_sha":"3a8874fef","run_id":"adversary-20261008-placed-8lane","evidence":"docs/analysis/class-v6/multi-family-adversary.md","in_progress":true,"coverage":"partial: the SRAM macros, ports, wiring, clocking and the complete-board terms are modelled in sections 2.3, 5 and 6 with the unmodelled items carried as uncertainty; the calibration against an existing hardware block is the k lane's bare-lane row beside it, owed as a named comparison","release_identity":{"commit":"3a8874fef","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"claim_impact":"","reviewer":"","at":"2026-10-08T20:41:20.327Z"}}},{"id":"ADV-06","title":"Separate process advantage from specialisation","setup":"Evaluate same-node, one-node-ahead and two-node-ahead scenarios with explicit technology definitions.","steps":["Use independently justified process factors, voltages, memory and packaging assumptions for each design.","Allow reusable IP and modular revisions; credit GPU improvement consistently.","Evaluate measurement confidence and model-parameter sensitivity separately."],"accept":"P04 primary limits hold for all competitive-reference cells; two-node futures are reported and pass the predeclared economic stress envelope. A model range is never labelled a statistical confidence interval without justification.","evidence":"Node-specific reports; factor provenance; uncertainty and sensitivity tables.","priority":"GATE","profile":"P04; P12","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[8,10,12,22,23],"gate":"G3","owner":"Independent hardware team","manual_page":28,"owner_lane":"k lane (a3c9601a6d4686fe1)","run_status":"NOT RUN","evidence_path":"docs/analysis/class-v6/floor/shadow-k.md","run_id":"team-2026-10-08","updated":"2026-10-08T20:10:24.556Z","evidence_record":{"reason":"process-advantage separation is the adversary lanes' chip study","at":"2026-10-08T20:10:24.556Z","method":"static","requirement_id":"ADV-06","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"in_progress_since":"2026-10-08 18:3x UK","approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null},"evidence_records":{"record":{"what_was_run":"the node column: same-node and a node ahead kept separate (k 0.78 / 0.56 / 0.40 at N5 / N3 / N2)","run_by":"k lane (a3c9601a6d4686fe1)","under_the_standard":"no: team-run before the standard's procedure; the status is RUNNING until the case is re-run under its steps with the profile's numbers and an independent run where the profile asks one","pass_or_fail_today":"not judged under the standard yet","method":"static","requirement_id":"ADV-06","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"run_id":"team-2026-10-08","evidence":"docs/analysis/class-v6/floor/shadow-k.md","in_progress":true}}},{"id":"ADV-07","title":"Evaluate lifetime without forced obsolescence","setup":"Assume multi-year productive survival and known schedule support before testing optional retirement penalties.","steps":["Price firmware, emulation, memory expansion, companion hardware and incremental redesign.","Include 1-, 3- and 5-year productive lifetimes plus idle/resale possibilities.","Grant a retirement credit only if all feasible cheaper adaptations lose competitiveness."],"accept":"The primary case does not require chip death or a fresh full development bill per family. Every retirement credit has a documented adaptation comparison; incompatible and unprofitable are reported separately.","evidence":"Lifetime/adaptation ledger; revision costs; feasible-alternative analysis.","priority":"GATE","profile":"P04; P12","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[8,10,12,22,23],"gate":"G3","owner":"Independent hardware team","manual_page":29,"owner_lane":"adversary lane (a1a9876a88f5a72fc)","run_status":"NOT RUN","evidence_path":"docs/analysis/class-v6/multi-family-adversary.md section 14; docs/analysis/class-v6/multi-family-adversary.md","run_id":"adversary-20261008-placed-8lane","updated":"2026-10-08T20:41:20.327Z","evidence_record":{"requirement_id":"ADV-07","decision":"NOT RUN","method":"model","cell":"adversary:mf-placed","manifest_sha":"3a8874fef","run_id":"adversary-20261008-placed-8lane","evidence":"docs/analysis/class-v6/multi-family-adversary.md","in_progress":true,"coverage":"the lifetime table and the six-row transition matrix (sections 7 and 14) on the placed rows; the 32-lane genesis comparator placed on adv-g","release_identity":{"commit":"3a8874fef","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"claim_impact":"","reviewer":"","at":"2026-10-08T20:41:20.327Z"},"in_progress_since":"2026-10-08 18:3x UK","approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null},"evidence_records":{"record":{"what_was_run":"the transition matrix: no row loses competitiveness, the three-year life holds, zero obsolescence credit","run_by":"adversary lane (a1a9876a88f5a72fc)","under_the_standard":"no: team-run before the standard's procedure; the status is RUNNING until the case is re-run under its steps with the profile's numbers and an independent run where the profile asks one","pass_or_fail_today":"not judged under the standard yet","method":"static","requirement_id":"ADV-07","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"run_id":"team-2026-10-08","evidence":"docs/analysis/class-v6/multi-family-adversary.md section 14","in_progress":true},"adversary:mf-placed":{"requirement_id":"ADV-07","decision":"NOT RUN","method":"model","cell":"adversary:mf-placed","manifest_sha":"3a8874fef","run_id":"adversary-20261008-placed-8lane","evidence":"docs/analysis/class-v6/multi-family-adversary.md","in_progress":true,"coverage":"the lifetime table and the six-row transition matrix (sections 7 and 14) on the placed rows; the 32-lane genesis comparator placed on adv-g","release_identity":{"commit":"3a8874fef","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"claim_impact":"","reviewer":"","at":"2026-10-08T20:41:20.327Z"}}},{"id":"ADV-08","title":"Independently challenge the best-cost envelope","setup":"Publish the non-sensitive model and negative results; commission an unaffiliated second hardware reviewer.","steps":["Reward cheaper valid designs and reproduced shortcuts, not confirmation of the preferred number.","Re-run P04 with the strongest submitted feasible design, including a low-cost funded-development case.","Record unresolved modelling disagreements and future technology exclusions."],"accept":"Both reviews accept the scoped envelope or all material disagreements are resolved transparently. Passing supports only evaluated designs and conditions, never a universal bound on all future silicon.","evidence":"Two review reports; challenge log; final envelope; unresolved-limit statement.","priority":"GATE","profile":"P04","cadence":"Release candidate; repeat after relevant changes","method":"Independent challenge/review","status":"NOT RUN","source":[8,10,12,22,23],"gate":"G3","owner":"Independent hardware team","manual_page":29,"owner_lane":"adversary lane (a1a9876a88f5a72fc)","run_status":"NOT RUN","evidence_path":"docs/analysis/class-v6/multi-family-adversary.md","run_id":"adversary-20261008-placed-8lane","updated":"2026-10-08T20:41:20.327Z","approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null},"evidence_records":{"adversary:mf-placed":{"requirement_id":"ADV-08","decision":"NOT RUN","method":"model","cell":"adversary:mf-placed","manifest_sha":"3a8874fef","run_id":"adversary-20261008-placed-8lane","evidence":"docs/analysis/class-v6/multi-family-adversary.md","in_progress":true,"coverage":"the best-cost envelope on the complete machine (section 6) and the SRAM-die ticket reconciliation with lane B (section 15); the unaffiliated second reviewer is not this lane's","release_identity":{"commit":"3a8874fef","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"claim_impact":"","reviewer":"","at":"2026-10-08T20:41:20.327Z"}},"evidence_record":{"requirement_id":"ADV-08","decision":"NOT RUN","method":"model","cell":"adversary:mf-placed","manifest_sha":"3a8874fef","run_id":"adversary-20261008-placed-8lane","evidence":"docs/analysis/class-v6/multi-family-adversary.md","in_progress":true,"coverage":"the best-cost envelope on the complete machine (section 6) and the SRAM-die ticket reconciliation with lane B (section 15); the unaffiliated second reviewer is not this lane's","release_identity":{"commit":"3a8874fef","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"claim_impact":"","reviewer":"","at":"2026-10-08T20:41:20.327Z"},"in_progress_since":"2026-10-08T20:41:20.327Z"}]},{"code":"ROT","title":"Epochs, seeds and memory transitions","source":[7,11,19,21],"gate":"G5 / G2","owner":"Consensus + GPU leads","fixtures":"F0 activation rules; F4 fault network; F5 historical and boundary vectors","summary":"Transitions must agree across nodes and remain usable during failures; crossing a boundary is not a chip-retirement test.","tests":[{"id":"ROT-01","title":"Agree across every hourly boundary","setup":"Use real nodes, CPU/GPU miners and independent clocks around successive program boundaries.","steps":["Submit valid work immediately before, at and after the activation boundary under clock skew and delayed delivery.","Restart nodes from both sides and replay the same headers.","Compare selected seed, program, validity, rewards and local wall-clock dependence."],"accept":"All honest nodes derive identical consensus outcomes from the frozen rule. Late work is handled exactly as specified; no wall-clock ambiguity or cross-backend split occurs.","evidence":"Boundary vectors; node/miner traces; acceptance and reward matrix.","priority":"BLOCKER","profile":"P01; P08","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[7,11,19,21],"gate":"G5 / G2","owner":"Consensus + GPU leads","manual_page":30,"owner_lane":"fast-time lane (a8be71a0db962911c)","run_status":"NOT RUN","evidence_path":"docs/analysis/review-2026-10-08-b/f10/emu-test.log","run_id":"f10-worker-20261008","updated":"2026-10-08T20:07:26.255Z","evidence_record":{"cell":"harness:cuda-select-check","manifest_sha":"964cdf6c1","coverage":{"ROT-01":"partial: the worker's high-32 nonce rollover inside a job (a job from 2^32 - 32) finds the same set on both read-back paths and the boundary nonces hash as igneum-pow; the hourly program boundary itself is the fast-time harness","POW-01":"partial: the CUDA select pass equals the full read line for line (zero hits, partial, the all-hit overflow fallback, a 96-nonce tail with a 32-lane launch, queued jobs, hits then zero, the epoch tag) and 17 sampled hashes equal igneum-pow; the million-vector campaign is harness:p01-vectors"},"at":"2026-10-08T20:07:26.255Z","method":"static","requirement_id":"ROT-01","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"964cdf6c1","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"in_progress_since":"2026-10-08T20:07:26.255Z","approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null},"evidence_records":{"harness:cuda-select-check":{"cell":"harness:cuda-select-check","manifest_sha":"964cdf6c1","coverage":{"ROT-01":"partial: the worker's high-32 nonce rollover inside a job (a job from 2^32 - 32) finds the same set on both read-back paths and the boundary nonces hash as igneum-pow; the hourly program boundary itself is the fast-time harness","POW-01":"partial: the CUDA select pass equals the full read line for line (zero hits, partial, the all-hit overflow fallback, a 96-nonce tail with a 32-lane launch, queued jobs, hits then zero, the epoch tag) and 17 sampled hashes equal igneum-pow; the million-vector campaign is harness:p01-vectors"},"at":"2026-10-08T20:07:26.255Z","method":"static","requirement_id":"ROT-01","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"964cdf6c1","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"run_id":"f10-worker-20261008","evidence":"docs/analysis/review-2026-10-08-b/f10/emu-test.log","in_progress":true}}},{"id":"ROT-02","title":"Cross weekly and family boundaries together","setup":"Use the retained schedule in F0, including coincident program, parameter and family changes.","steps":["Run every known family transition and all coincident-boundary combinations on production code.","Interrupt downloads, compilation and restart during activation; include mixed old/new clients.","Repeat selected cases under real elapsed time and the remainder under disclosed accelerated time."],"accept":"Deterministic activation, documented old-client behaviour and no unsafe fallback. Compilation/setup costs satisfy P03; accelerated runs are not reported as years of operating history.","evidence":"Transition matrix; code-path evidence; compile timing; old-client logs.","priority":"BLOCKER","profile":"P01; P03; P08","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[7,11,19,21],"gate":"G5 / G2","owner":"Consensus + GPU leads","manual_page":30,"owner_lane":"fast-time lane (a8be71a0db962911c)","run_status":"NOT RUN","evidence_path":"v5-fasttime 92bf6a7f","run_id":"team-2026-10-08","updated":"2026-10-08 18:3x UK","evidence_record":{"what_was_run":"the class v6 object crossing at its floor on 617cb441","run_by":"fast-time lane (a8be71a0db962911c)","under_the_standard":"no: team-run before the standard's procedure; the status is RUNNING until the case is re-run under its steps with the profile's numbers and an independent run where the profile asks one","pass_or_fail_today":"not judged under the standard yet","method":"static","requirement_id":"ROT-02","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"in_progress_since":"2026-10-08 18:3x UK","approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null},"evidence_records":{"record":{"what_was_run":"the class v6 object crossing at its floor on 617cb441","run_by":"fast-time lane (a8be71a0db962911c)","under_the_standard":"no: team-run before the standard's procedure; the status is RUNNING until the case is re-run under its steps with the profile's numbers and an independent run where the profile asks one","pass_or_fail_today":"not judged under the standard yet","method":"static","requirement_id":"ROT-02","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"run_id":"team-2026-10-08","evidence":"v5-fasttime 92bf6a7f","in_progress":true}}},{"id":"ROT-03","title":"Test miner-voted bring-forward governance","setup":"Freeze eligibility, threshold, windows and activation semantics before testing; do not invent a no-veto rule.","steps":["Attempt threshold-minus-one, threshold, conflicting proposals, duplicate votes and coalition withholding.","Partition voters, restore them and test vote-key substitution through pools.","Verify adoption and refusal behaviour of already running nodes."],"accept":"The actual mechanism enforces F0, with authenticated voting and no conflicting activation. Any coalition capable of blocking or manipulating changes is disclosed; labels such as no veto do not override arithmetic.","evidence":"Executable governance model; signed-vote corpus; coalition/partition results.","priority":"BLOCKER","profile":"P00; P01; P08","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[7,11,19,21],"gate":"G5 / G2","owner":"Consensus + GPU leads","manual_page":30,"owner_lane":"node lane (a283f5f0d364ceef0)","run_status":"NOT RUN","evidence_path":"docs/plans/igneum-2.0.md D5","run_id":"team-2026-10-08","updated":"2026-10-08T20:10:24.556Z","evidence_record":{"reason":"miner-voted bring-forward needs a vote harness on the fault network F4","at":"2026-10-08T20:10:24.556Z","method":"static","requirement_id":"ROT-03","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"in_progress_since":"2026-10-08 18:3x UK","approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null},"evidence_records":{"record":{"what_was_run":"the bring-forward mechanism specified in the D5 block","run_by":"node lane (a283f5f0d364ceef0)","under_the_standard":"no: team-run before the standard's procedure; the status is RUNNING until the case is re-run under its steps with the profile's numbers and an independent run where the profile asks one","pass_or_fail_today":"not judged under the standard yet","method":"static","requirement_id":"ROT-03","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"run_id":"team-2026-10-08","evidence":"docs/plans/igneum-2.0.md D5","in_progress":true}}},{"id":"ROT-04","title":"Resist seed selection and faster evaluators","setup":"Provide the specified seed pipeline and delay proof implementation plus independently parameterised fast-adversary models.","steps":["Try withholding candidate seeds, grinding alternatives, replaying delay proofs and biased checkpoint selection.","Vary adversarial speed advantage and outage duration; trace influence on program choice.","Validate inputs, parameters and proofs against independent vectors."],"accept":"No invalid seed or proof is accepted; selection advantage stays within the approved threat-model bound. Missing bounds block this gate. A delay mechanism is not credited as generic ASIC resistance.","evidence":"Seed/grinding simulations; speed sensitivity; proof vectors; threat-model signoff.","priority":"BLOCKER","profile":"P00; P01; P08","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[7,11,19,21],"gate":"G5 / G2","owner":"Consensus + GPU leads","manual_page":31,"owner_lane":"node lane (a283f5f0d364ceef0)","run_status":"NOT RUN","evidence_path":"","run_id":"","updated":"2026-10-08T19:22:31.798Z","evidence_record":{"reason":"seed-selection resistance is the census harness (the class v6 invention lane), not yet in the matrix","at":"2026-10-08T19:22:31.798Z","method":"static","requirement_id":"ROT-04","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null},"evidence_records":{"record":{"reason":"seed-selection resistance is the census harness (the class v6 invention lane), not yet in the matrix","at":"2026-10-08T19:22:31.798Z","method":"static","requirement_id":"ROT-04","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"run_id":"","evidence":"","in_progress":false}}},{"id":"ROT-05","title":"Continue or pause correctly when finality stops","setup":"Stop checkpoint signing while mining continues, then cross seed and family boundaries.","steps":["Remove the required signing weight and observe the documented fallback or safe pause.","Prevent access to any founder seed service; restart from persisted state.","Restore the stated fault assumptions and verify deterministic recovery."],"accept":"Mining/seed behaviour matches F0 without manufacturing certificates or reinterpreting finality. Safety holds during the outage; liveness is required only after its stated assumptions return.","evidence":"Fault timeline; seed/certificate history; node-state comparison; recovery log.","priority":"BLOCKER","profile":"P01; P08","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[7,11,19,21],"gate":"G5 / G2","owner":"Consensus + GPU leads","manual_page":31,"owner_lane":"finality lane (aca0f5ed924a2a99b)","run_status":"NOT RUN","evidence_path":"build-1:/srv/artefacts/tas/201-7cfa422a-aa0e0f45/node-7cfa422a/box4-consensus.log","run_id":"201-7cfa422a-aa0e0f45","updated":"2026-10-08T19:32:50.856Z","evidence_record":{"cell":"suite:consensus","manifest_sha":"7cfa422a","coverage":{"FIN-01":"partial: the finality processes' agreement tests","FIN-03":"partial: rule v4's anchored table and authority expiry tests (bee41b5e)","FIN-04":"partial: the frozen table without its time expiry (rule v4)","FIN-05":"partial: key succession and another scheme's vote refused","FIN-07":"partial: majority-continuity recovery (rule v4)","ROT-05":"partial: the finality-stopped pause tests","ZKP-01":"partial: a proof-less or wrong-statement block refused by consensus"},"at":"2026-10-08T19:32:50.856Z","method":"native","requirement_id":"ROT-05","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"7cfa422a","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"in_progress_since":"2026-10-08T19:32:50.856Z","approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null},"evidence_records":{"suite:consensus":{"cell":"suite:consensus","manifest_sha":"7cfa422a","coverage":{"FIN-01":"partial: the finality processes' agreement tests","FIN-03":"partial: rule v4's anchored table and authority expiry tests (bee41b5e)","FIN-04":"partial: the frozen table without its time expiry (rule v4)","FIN-05":"partial: key succession and another scheme's vote refused","FIN-07":"partial: majority-continuity recovery (rule v4)","ROT-05":"partial: the finality-stopped pause tests","ZKP-01":"partial: a proof-less or wrong-statement block refused by consensus"},"at":"2026-10-08T19:32:50.856Z","method":"native","requirement_id":"ROT-05","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"7cfa422a","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"run_id":"201-7cfa422a-aa0e0f45","evidence":"build-1:/srv/artefacts/tas/201-7cfa422a-aa0e0f45/node-7cfa422a/box4-consensus.log","in_progress":true}}},{"id":"ROT-06","title":"Activate datasets without hidden exclusions","setup":"Freeze memory sizes, support horizon and sync/update procedure; test all advertised roles.","steps":["Construct the next dataset while current work remains active; test slow disks, low free memory and interruption.","Try stale-state/dataset submissions and maliciously expensive state growth where coupling exists.","Measure data transfer, restart and excluded-card costs before approving progression."],"accept":"No invalid stale work is accepted, no supported card silently fails, and P06 is met. Hardware retirement and sync burden are included in the economic decision, not treated as automatic chip protection.","evidence":"Dataset hashes; memory/update traces; stale-work tests; exclusion decision.","priority":"BLOCKER","profile":"P01; P06","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[7,11,19,21],"gate":"G5 / G2","owner":"Consensus + GPU leads","manual_page":31,"owner_lane":"hash lane (a690540514aa453d7)","run_status":"NOT RUN","evidence_path":"build-1:/srv/artefacts/tas/201-7cfa422a-aa0e0f45/node-7cfa422a/box4-core.log","run_id":"201-7cfa422a-aa0e0f45","updated":"2026-10-08T19:32:50.856Z","evidence_record":{"cell":"suite:core","manifest_sha":"7cfa422a","coverage":{"FIN-01":"partial: the finality field and checkpoint tests on the object; ordering under load is the consensus suite and the sim","INC-01":"partial: emission, fee and payout arithmetic tests; the reconciliation over a live chain is the economics lane's","ROT-06":"partial: the dataset activation and digest tests; a live activation is the fast-time harness"},"at":"2026-10-08T19:32:50.856Z","method":"native","requirement_id":"ROT-06","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"7cfa422a","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"in_progress_since":"2026-10-08T19:32:50.856Z","approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null},"evidence_records":{"suite:core":{"cell":"suite:core","manifest_sha":"7cfa422a","coverage":{"FIN-01":"partial: the finality field and checkpoint tests on the object; ordering under load is the consensus suite and the sim","INC-01":"partial: emission, fee and payout arithmetic tests; the reconciliation over a live chain is the economics lane's","ROT-06":"partial: the dataset activation and digest tests; a live activation is the fast-time harness"},"at":"2026-10-08T19:32:50.856Z","method":"native","requirement_id":"ROT-06","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"7cfa422a","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"run_id":"201-7cfa422a-aa0e0f45","evidence":"build-1:/srv/artefacts/tas/201-7cfa422a-aa0e0f45/node-7cfa422a/box4-core.log","in_progress":true}}},{"id":"ROT-07","title":"Ablate redundant rotation layers","setup":"Use matched baseline and ablated variants in the lab; do not change a running public network.","steps":["Remove each weekly/family component independently and measure adversarial cost, GPU setup and verifier complexity.","Include favourable-period specialists and all retained known families.","Keep a layer only with a distinct, independently supported benefit or a documented non-resistance purpose."],"accept":"Every retained layer has explicit justification and full boundary coverage. Redundant complexity is removed or its rationale recorded; the security model does not double-count the same versatility cost.","evidence":"Ablation report; decision log; complexity/cost comparison.","priority":"GATE","profile":"P03; P04","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[7,11,19,21],"gate":"G5 / G2","owner":"Consensus + GPU leads","manual_page":32,"owner_lane":"lane D family gate (a07a99a3788566af2)","run_status":"NOT RUN","evidence_path":"docs/analysis/class-v6/family-gate.md","run_id":"family-gate-20261008b","updated":"2026-10-08T20:38:55.360Z","evidence_record":{"requirement_id":"ROT-07","decision":"NOT RUN","method":"native","cell":"harness:family-gate","manifest_sha":"ac86d7910","run_id":"family-gate-20261008b","evidence":"docs/analysis/class-v6/family-gate.md","in_progress":false,"coverage":"partial: the acceptance-side ablation rows (layer 8 off against the same-crate windowed control: the draw cost, the floors' costs, the hot-set and 1.2x ceiling, the bit-R read; the mixer and shape axes' per-era invisibility and verifier rows), docs/analysis/class-v6/family-gate.md sections 6.4 to 6.12; the adversarial cost and the GPU setup rows per layer are the hash lane's and the adversary lane's","release_identity":{"commit":"ac86d7910","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"claim_impact":"","reviewer":"","at":"2026-10-08T20:38:55.360Z"},"in_progress_since":"2026-10-08 18:3x UK","approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null},"evidence_records":{"record":{"what_was_run":"the family gate's coverage (38,000 eras) and the rotation prototype paused as the no-rescue control","run_by":"lane D family gate (a07a99a3788566af2)","under_the_standard":"no: team-run before the standard's procedure; the status is RUNNING until the case is re-run under its steps with the profile's numbers and an independent run where the profile asks one","pass_or_fail_today":"not judged under the standard yet","method":"static","requirement_id":"ROT-07","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"run_id":"team-2026-10-08","evidence":"docs/analysis/class-v6/family-gate.md","in_progress":true},"harness:family-gate":{"requirement_id":"ROT-07","decision":"NOT RUN","method":"native","cell":"harness:family-gate","manifest_sha":"ac86d7910","run_id":"family-gate-20261008b","evidence":"docs/analysis/class-v6/family-gate.md","in_progress":false,"coverage":"partial: the acceptance-side ablation rows (layer 8 off against the same-crate windowed control: the draw cost, the floors' costs, the hot-set and 1.2x ceiling, the bit-R read; the mixer and shape axes' per-era invisibility and verifier rows), docs/analysis/class-v6/family-gate.md sections 6.4 to 6.12; the adversarial cost and the GPU setup rows per layer are the hash lane's and the adversary lane's","release_identity":{"commit":"ac86d7910","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"claim_impact":"","reviewer":"","at":"2026-10-08T20:38:55.360Z"}}},{"id":"ROT-08","title":"Pass the no-new-rules counterfactual","setup":"Freeze the complete published rule bank and known schedule for the five-year evaluation.","steps":["Allow a programmable adversary to know and survive all planned changes.","Remove assumed future emergency instructions and manual retirement actions from the model.","Run the required ECO scenarios and link them to independent network-transition tests."],"accept":"Competitiveness survives the approved envelope without future rescue assumptions. Any result that needs unannounced changes fails this claim; ordinary bug maintenance is distinguished from anti-chip intervention.","evidence":"Frozen-rule model; scenario results; excluded-rescue audit; G5 evidence.","priority":"GATE","profile":"P04; P12","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[7,11,19,21],"gate":"G5 / G2","owner":"Consensus + GPU leads","manual_page":32,"owner_lane":"node lane (a283f5f0d364ceef0)","run_status":"NOT RUN","evidence_path":"docs/analysis/class-v6/family-gate.md","run_id":"family-gate-20261008b","updated":"2026-10-08T20:38:55.360Z","evidence_record":{"requirement_id":"ROT-08","decision":"NOT RUN","method":"native","cell":"harness:family-gate","manifest_sha":"ac86d7910","run_id":"family-gate-20261008b","evidence":"docs/analysis/class-v6/family-gate.md","in_progress":false,"coverage":"partial: the no-rescue control document (38,000 drawn eras of the parameter family through the acceptance, the bound arithmetic on the counts, the honest line of what the gate cannot see), family-gate.md sections 1 to 6; the competitiveness envelope and the economic half are ECO's","release_identity":{"commit":"ac86d7910","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"claim_impact":"","reviewer":"","at":"2026-10-08T20:38:55.360Z"},"approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null},"evidence_records":{"record":{"reason":"the no-new-rules counterfactual is a research harness","at":"2026-10-08T19:22:31.798Z","method":"static","requirement_id":"ROT-08","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"run_id":"","evidence":"","in_progress":false},"harness:family-gate":{"requirement_id":"ROT-08","decision":"NOT RUN","method":"native","cell":"harness:family-gate","manifest_sha":"ac86d7910","run_id":"family-gate-20261008b","evidence":"docs/analysis/class-v6/family-gate.md","in_progress":false,"coverage":"partial: the no-rescue control document (38,000 drawn eras of the parameter family through the acceptance, the bound arithmetic on the counts, the honest line of what the gate cannot see), family-gate.md sections 1 to 6; the competitiveness envelope and the economic half are ECO's","release_identity":{"commit":"ac86d7910","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"claim_impact":"","reviewer":"","at":"2026-10-08T20:38:55.360Z"}}}]},{"code":"ECO","title":"Five-year coexistence economics","source":[8,13,18,24,26],"gate":"G4","owner":"Economics lead + independent reviewer","fixtures":"F6 adversarial costs; F7 scenario model; F2 operator costs","summary":"Test the world after specialised hardware exists, including new entrants and an already-funded competitor.","tests":[{"id":"ECO-01","title":"Reconcile complete cost per accepted work","setup":"Use benchmark outputs, current-source cost inputs recorded at execution time and separate reference scenarios.","steps":["Calculate hardware annualisation, electricity, host, cooling/hosting, failures, fees, downtime and residual value.","Use actual accepted work and independently verify units and period conversions.","Cross-check formulas using hand-worked fixtures, edge cases and a second implementation."],"accept":"All material costs and rejected-work effects appear once; model totals reconcile to raw inputs. No GPU upgrade is free, development cost is not double-counted, and burn is not mislabelled operator income.","evidence":"Versioned model; unit fixtures; independent reconciliation; input sources.","priority":"GATE","profile":"P12","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[8,13,18,24,26],"gate":"G4","owner":"Economics lead + independent reviewer","manual_page":33,"owner_lane":"research lane (ad6a2bd47d4a46105)","run_status":"NOT RUN","evidence_path":"sim/economy/coexist/README.md","run_id":"eco05-20261008-02","updated":"2026-10-08T20:07:38.167Z","evidence_record":{"cell":"model:coexist-fixtures","manifest_sha":"3f2050ab","coverage":{"ECO-01":"partial: the hand-worked fixtures and the second implementation; the independent reconciliation of inputs and units remains","ECO-08":"partial: the package runs from the served files (README, inputs with sources and labels, fixtures); the independent report, the rerun and the perturbations remain"},"at":"2026-10-08T20:07:38.167Z","method":"model","requirement_id":"ECO-01","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"3f2050ab","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"in_progress_since":"2026-10-08T20:07:38.167Z","approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null},"evidence_records":{"model:coexist-fixtures":{"cell":"model:coexist-fixtures","manifest_sha":"3f2050ab","coverage":{"ECO-01":"partial: the hand-worked fixtures and the second implementation; the independent reconciliation of inputs and units remains","ECO-08":"partial: the package runs from the served files (README, inputs with sources and labels, fixtures); the independent report, the rerun and the perturbations remain"},"at":"2026-10-08T20:07:38.167Z","method":"model","requirement_id":"ECO-01","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"3f2050ab","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"run_id":"eco05-20261008-02","evidence":"sim/economy/coexist/README.md","in_progress":true}}},{"id":"ECO-02","title":"Separate existing-owner and new-entrant viability","setup":"Use both installed hardware and purchasable replacement hardware in every mandatory cohort.","steps":["Evaluate marginal operation separately from recovery of a new purchase.","Stress resale at zero, hardware failures, financing and replacement cycles.","Report break-even power price and total cost relative to the strongest feasible specialist."],"accept":"P12 competitiveness conditions hold for the predeclared cohorts in required sustainable worlds. Existing-owner profitability cannot substitute for viable new entry; cards outside the envelope remain visible.","evidence":"Owner/entrant curves; price-date records; break-even tables; cohort outcomes.","priority":"GATE","profile":"P12","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[8,13,18,24,26],"gate":"G4","owner":"Economics lead + independent reviewer","manual_page":33,"owner_lane":"research lane (ad6a2bd47d4a46105)","run_status":"NOT RUN","evidence_path":"docs/analysis/class-v6/coexistence-model.md","run_id":"eco-d4-20261008-01","updated":"2026-10-08T19:55:03.336Z","evidence_record":{"cell":"harness:economics-model","manifest_sha":"db424d20","coverage":{"ECO-02":"partial: the existing-owner and new-entrant tests per class at three tariffs, MSRP and street, with resale (reference-population.md); resale at zero, failures and financing not yet stressed","ECO-03":"partial: the sunk-development case first with low and high ranges, private mining, hardware sales and the hybrid, GPU re-entry after the fleet (coexistence-model.md sections 2, 8a, 12 to 12c; the surface in floor/sram-and-floor.md 4.4); the source thresholds retired to coexistence-workbook.md","ECO-04":"partial: a per-class supply curve with the installed base as a cap and re-entry (coexistence-model.md), the market-structure axis (8a), the operator simulation (operator-simulation.md); dynamic agent policies beyond the single-rule reaction are the simulation second cut","ECO-06":"partial: the recipients and burns reconciled on the chain block-one split (docs/design/proving-payment.md), proving demand as an income axis at none, launch and spike (coexistence-model.md); the full-horizon issuance ledger owed","ECO-07":"partial: each dataset size scored by adversary burden against commodity burden on measured card rows and modelled chip tickets (docs/design/class-v6-rotating-family.md 10.0u); the 8.5 and 11.5 GiB knee costs expected, not measured","INC-02":"partial: the income streams kept separate in the model (mining subsidy, internal proving, external jobs; burns never counted as payment); the node-record and Ember reconciliation are the node and app lanes","INC-03":"partial: the profit-maximising operator simulation first run (mine, internal prove, external prove, off); per-card agents and switching costs are the second cut","INC-04":"partial: the four shocks in the operator simulation (the demand spike, the price fall, the largest provers leaving, the entrants), restored or not and in how many periods","INC-08":"partial: the supplier and operator dependence table (coexistence-model.md 8a); the signing, proving and aggregation roles are the node lane"},"at":"2026-10-08T19:55:03.336Z","method":"model","requirement_id":"ECO-02","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"db424d20","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"in_progress_since":"2026-10-08T19:55:03.336Z","approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null},"evidence_records":{"harness:economics-model":{"cell":"harness:economics-model","manifest_sha":"db424d20","coverage":{"ECO-02":"partial: the existing-owner and new-entrant tests per class at three tariffs, MSRP and street, with resale (reference-population.md); resale at zero, failures and financing not yet stressed","ECO-03":"partial: the sunk-development case first with low and high ranges, private mining, hardware sales and the hybrid, GPU re-entry after the fleet (coexistence-model.md sections 2, 8a, 12 to 12c; the surface in floor/sram-and-floor.md 4.4); the source thresholds retired to coexistence-workbook.md","ECO-04":"partial: a per-class supply curve with the installed base as a cap and re-entry (coexistence-model.md), the market-structure axis (8a), the operator simulation (operator-simulation.md); dynamic agent policies beyond the single-rule reaction are the simulation second cut","ECO-06":"partial: the recipients and burns reconciled on the chain block-one split (docs/design/proving-payment.md), proving demand as an income axis at none, launch and spike (coexistence-model.md); the full-horizon issuance ledger owed","ECO-07":"partial: each dataset size scored by adversary burden against commodity burden on measured card rows and modelled chip tickets (docs/design/class-v6-rotating-family.md 10.0u); the 8.5 and 11.5 GiB knee costs expected, not measured","INC-02":"partial: the income streams kept separate in the model (mining subsidy, internal proving, external jobs; burns never counted as payment); the node-record and Ember reconciliation are the node and app lanes","INC-03":"partial: the profit-maximising operator simulation first run (mine, internal prove, external prove, off); per-card agents and switching costs are the second cut","INC-04":"partial: the four shocks in the operator simulation (the demand spike, the price fall, the largest provers leaving, the entrants), restored or not and in how many periods","INC-08":"partial: the supplier and operator dependence table (coexistence-model.md 8a); the signing, proving and aggregation roles are the node lane"},"at":"2026-10-08T19:55:03.336Z","method":"model","requirement_id":"ECO-02","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"db424d20","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"run_id":"eco-d4-20261008-01","evidence":"docs/analysis/class-v6/coexistence-model.md","in_progress":true}}},{"id":"ECO-03","title":"Let the specialist keep its sunk development","setup":"Use three development cases: fully funded elsewhere, source-range low and source-range high.","steps":["Evaluate private mining, public hardware sales and a hybrid business model.","Allow shared IP, incremental revisions, multi-year survival and resale where justified.","Re-evaluate GPU entry after the specialist fleet is already installed."],"accept":"The coexistence claim does not depend on recovering the original chip research bill. Required P12 cases meet the approved envelope even at zero incremental development cost; failures cannot be hidden by the $23M/$340M source thresholds.","evidence":"Business-model variants; sunk-cost case; full cash-flow and adaptation records.","priority":"GATE","profile":"P12","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[8,13,18,24,26],"gate":"G4","owner":"Economics lead + independent reviewer","manual_page":33,"owner_lane":"research lane (ad6a2bd47d4a46105)","run_status":"NOT RUN","evidence_path":"docs/analysis/class-v6/coexistence-model.md","run_id":"eco-d4-20261008-01","updated":"2026-10-08T19:55:03.336Z","evidence_record":{"cell":"harness:economics-model","manifest_sha":"db424d20","coverage":{"ECO-02":"partial: the existing-owner and new-entrant tests per class at three tariffs, MSRP and street, with resale (reference-population.md); resale at zero, failures and financing not yet stressed","ECO-03":"partial: the sunk-development case first with low and high ranges, private mining, hardware sales and the hybrid, GPU re-entry after the fleet (coexistence-model.md sections 2, 8a, 12 to 12c; the surface in floor/sram-and-floor.md 4.4); the source thresholds retired to coexistence-workbook.md","ECO-04":"partial: a per-class supply curve with the installed base as a cap and re-entry (coexistence-model.md), the market-structure axis (8a), the operator simulation (operator-simulation.md); dynamic agent policies beyond the single-rule reaction are the simulation second cut","ECO-06":"partial: the recipients and burns reconciled on the chain block-one split (docs/design/proving-payment.md), proving demand as an income axis at none, launch and spike (coexistence-model.md); the full-horizon issuance ledger owed","ECO-07":"partial: each dataset size scored by adversary burden against commodity burden on measured card rows and modelled chip tickets (docs/design/class-v6-rotating-family.md 10.0u); the 8.5 and 11.5 GiB knee costs expected, not measured","INC-02":"partial: the income streams kept separate in the model (mining subsidy, internal proving, external jobs; burns never counted as payment); the node-record and Ember reconciliation are the node and app lanes","INC-03":"partial: the profit-maximising operator simulation first run (mine, internal prove, external prove, off); per-card agents and switching costs are the second cut","INC-04":"partial: the four shocks in the operator simulation (the demand spike, the price fall, the largest provers leaving, the entrants), restored or not and in how many periods","INC-08":"partial: the supplier and operator dependence table (coexistence-model.md 8a); the signing, proving and aggregation roles are the node lane"},"at":"2026-10-08T19:55:03.336Z","method":"model","requirement_id":"ECO-03","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"db424d20","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"in_progress_since":"2026-10-08T19:55:03.336Z","approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null},"evidence_records":{"harness:economics-model":{"cell":"harness:economics-model","manifest_sha":"db424d20","coverage":{"ECO-02":"partial: the existing-owner and new-entrant tests per class at three tariffs, MSRP and street, with resale (reference-population.md); resale at zero, failures and financing not yet stressed","ECO-03":"partial: the sunk-development case first with low and high ranges, private mining, hardware sales and the hybrid, GPU re-entry after the fleet (coexistence-model.md sections 2, 8a, 12 to 12c; the surface in floor/sram-and-floor.md 4.4); the source thresholds retired to coexistence-workbook.md","ECO-04":"partial: a per-class supply curve with the installed base as a cap and re-entry (coexistence-model.md), the market-structure axis (8a), the operator simulation (operator-simulation.md); dynamic agent policies beyond the single-rule reaction are the simulation second cut","ECO-06":"partial: the recipients and burns reconciled on the chain block-one split (docs/design/proving-payment.md), proving demand as an income axis at none, launch and spike (coexistence-model.md); the full-horizon issuance ledger owed","ECO-07":"partial: each dataset size scored by adversary burden against commodity burden on measured card rows and modelled chip tickets (docs/design/class-v6-rotating-family.md 10.0u); the 8.5 and 11.5 GiB knee costs expected, not measured","INC-02":"partial: the income streams kept separate in the model (mining subsidy, internal proving, external jobs; burns never counted as payment); the node-record and Ember reconciliation are the node and app lanes","INC-03":"partial: the profit-maximising operator simulation first run (mine, internal prove, external prove, off); per-card agents and switching costs are the second cut","INC-04":"partial: the four shocks in the operator simulation (the demand spike, the price fall, the largest provers leaving, the entrants), restored or not and in how many periods","INC-08":"partial: the supplier and operator dependence table (coexistence-model.md 8a); the signing, proving and aggregation roles are the node lane"},"at":"2026-10-08T19:55:03.336Z","method":"model","requirement_id":"ECO-03","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"db424d20","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"run_id":"eco-d4-20261008-01","evidence":"docs/analysis/class-v6/coexistence-model.md","in_progress":true}}},{"id":"ECO-04","title":"Model entry, exit and difficulty response","setup":"Use independently reviewed dynamic operator policies, not fixed market shares.","steps":["Let agents buy, sell, switch off, re-enter and choose tasks based on declared costs and expected income.","Apply the actual difficulty/reward rules and test optimistic and adversarial liquidity/capital availability.","Compare equilibrium and transient outcomes across independent starting conditions."],"accept":"Mandatory worlds satisfy P12 without an imposed GPU share or artificial specialist capacity limit. Concentration, oscillations and excluded regions are reported; model behaviour matches unit and conservation checks.","evidence":"Agent policies; sensitivity seeds; market-share paths; independent model review.","priority":"GATE","profile":"P12","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[8,13,18,24,26],"gate":"G4","owner":"Economics lead + independent reviewer","manual_page":34,"owner_lane":"research lane (ad6a2bd47d4a46105)","run_status":"NOT RUN","evidence_path":"docs/analysis/class-v6/coexistence-model.md","run_id":"eco-d4-20261008-01","updated":"2026-10-08T19:55:03.336Z","evidence_record":{"cell":"harness:economics-model","manifest_sha":"db424d20","coverage":{"ECO-02":"partial: the existing-owner and new-entrant tests per class at three tariffs, MSRP and street, with resale (reference-population.md); resale at zero, failures and financing not yet stressed","ECO-03":"partial: the sunk-development case first with low and high ranges, private mining, hardware sales and the hybrid, GPU re-entry after the fleet (coexistence-model.md sections 2, 8a, 12 to 12c; the surface in floor/sram-and-floor.md 4.4); the source thresholds retired to coexistence-workbook.md","ECO-04":"partial: a per-class supply curve with the installed base as a cap and re-entry (coexistence-model.md), the market-structure axis (8a), the operator simulation (operator-simulation.md); dynamic agent policies beyond the single-rule reaction are the simulation second cut","ECO-06":"partial: the recipients and burns reconciled on the chain block-one split (docs/design/proving-payment.md), proving demand as an income axis at none, launch and spike (coexistence-model.md); the full-horizon issuance ledger owed","ECO-07":"partial: each dataset size scored by adversary burden against commodity burden on measured card rows and modelled chip tickets (docs/design/class-v6-rotating-family.md 10.0u); the 8.5 and 11.5 GiB knee costs expected, not measured","INC-02":"partial: the income streams kept separate in the model (mining subsidy, internal proving, external jobs; burns never counted as payment); the node-record and Ember reconciliation are the node and app lanes","INC-03":"partial: the profit-maximising operator simulation first run (mine, internal prove, external prove, off); per-card agents and switching costs are the second cut","INC-04":"partial: the four shocks in the operator simulation (the demand spike, the price fall, the largest provers leaving, the entrants), restored or not and in how many periods","INC-08":"partial: the supplier and operator dependence table (coexistence-model.md 8a); the signing, proving and aggregation roles are the node lane"},"at":"2026-10-08T19:55:03.336Z","method":"model","requirement_id":"ECO-04","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"db424d20","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"in_progress_since":"2026-10-08T19:55:03.336Z","approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null},"evidence_records":{"harness:economics-model":{"cell":"harness:economics-model","manifest_sha":"db424d20","coverage":{"ECO-02":"partial: the existing-owner and new-entrant tests per class at three tariffs, MSRP and street, with resale (reference-population.md); resale at zero, failures and financing not yet stressed","ECO-03":"partial: the sunk-development case first with low and high ranges, private mining, hardware sales and the hybrid, GPU re-entry after the fleet (coexistence-model.md sections 2, 8a, 12 to 12c; the surface in floor/sram-and-floor.md 4.4); the source thresholds retired to coexistence-workbook.md","ECO-04":"partial: a per-class supply curve with the installed base as a cap and re-entry (coexistence-model.md), the market-structure axis (8a), the operator simulation (operator-simulation.md); dynamic agent policies beyond the single-rule reaction are the simulation second cut","ECO-06":"partial: the recipients and burns reconciled on the chain block-one split (docs/design/proving-payment.md), proving demand as an income axis at none, launch and spike (coexistence-model.md); the full-horizon issuance ledger owed","ECO-07":"partial: each dataset size scored by adversary burden against commodity burden on measured card rows and modelled chip tickets (docs/design/class-v6-rotating-family.md 10.0u); the 8.5 and 11.5 GiB knee costs expected, not measured","INC-02":"partial: the income streams kept separate in the model (mining subsidy, internal proving, external jobs; burns never counted as payment); the node-record and Ember reconciliation are the node and app lanes","INC-03":"partial: the profit-maximising operator simulation first run (mine, internal prove, external prove, off); per-card agents and switching costs are the second cut","INC-04":"partial: the four shocks in the operator simulation (the demand spike, the price fall, the largest provers leaving, the entrants), restored or not and in how many periods","INC-08":"partial: the supplier and operator dependence table (coexistence-model.md 8a); the signing, proving and aggregation roles are the node lane"},"at":"2026-10-08T19:55:03.336Z","method":"model","requirement_id":"ECO-04","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"db424d20","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"run_id":"eco-d4-20261008-01","evidence":"docs/analysis/class-v6/coexistence-model.md","in_progress":true}}},{"id":"ECO-05","title":"Stress success, contraction and cheap electricity","setup":"Freeze mandatory scenarios before results: revenue bands, tariff range, lifetimes and demand states.","steps":["Run the P12 factorial grid plus adversarial combinations selected by the independent reviewer.","Test a large successful network as well as weak-revenue and heterogeneous-tariff cases.","Distinguish feasible sustained-entry worlds from collapse scenarios with no rational profitable operator."],"accept":"No small-network or token-appreciation assumption props up the primary claim. Required viable worlds pass the envelope; collapse worlds show honest contraction and safety, not fabricated profits. Failure regions are explicit.","evidence":"Scenario register; full result cube; boundary plots; failed-world explanations.","priority":"GATE","profile":"P12","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[8,13,18,24,26],"gate":"G4","owner":"Economics lead + independent reviewer","manual_page":34,"owner_lane":"research lane (ad6a2bd47d4a46105)","run_status":"FAIL","evidence_path":"docs/analysis/class-v6/eco-05-results.md","run_id":"eco05-20261008-02","updated":"2026-10-08T20:07:38.167Z","evidence_record":{"cell":"model:eco05","manifest_sha":"3f2050ab","coverage":{"ECO-05":"full on the frozen register's grid and the eight adversarial rows at the team's reconciled specialist rows; the independent reviewer's own adversarial rows (ECO-08) remain"},"at":"2026-10-08T20:07:38.167Z","method":"model","requirement_id":"ECO-05","decision":"FAIL","reviewer":"","claim_impact":"","release_identity":{"commit":"3f2050ab","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null},"evidence_records":{"model:eco05":{"cell":"model:eco05","manifest_sha":"3f2050ab","coverage":{"ECO-05":"full on the frozen register's grid and the eight adversarial rows at the team's reconciled specialist rows; the independent reviewer's own adversarial rows (ECO-08) remain"},"at":"2026-10-08T20:07:38.167Z","method":"model","requirement_id":"ECO-05","decision":"FAIL","reviewer":"","claim_impact":"","release_identity":{"commit":"3f2050ab","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"run_id":"eco05-20261008-02","evidence":"docs/analysis/class-v6/eco-05-results.md","in_progress":false}}},{"id":"ECO-06","title":"Fund security and proving as issuance falls","setup":"Use the frozen supply, halving, fee, burn and reward rules rather than source prose assumptions.","steps":["Reconcile revenue reaching miners, internal provers, developers and burns over the full horizon.","Test flat/declining fees and no external proving income; separately introduce external demand.","Calculate capacity and security-provider coverage after each reward transition."],"accept":"Recurring compensation is explicit and internally consistent; mandatory sustainable scenarios meet P12. Burned amounts are never counted as payments, and external operator income is not assumed to fund internal work automatically.","evidence":"Issuance/fee ledger; scenario cash flows; funding-shortfall report.","priority":"GATE","profile":"P12","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[8,13,18,24,26],"gate":"G4","owner":"Economics lead + independent reviewer","manual_page":34,"owner_lane":"research lane (ad6a2bd47d4a46105)","run_status":"NOT RUN","evidence_path":"docs/analysis/class-v6/coexistence-model.md","run_id":"eco-d4-20261008-01","updated":"2026-10-08T19:55:03.336Z","evidence_record":{"cell":"harness:economics-model","manifest_sha":"db424d20","coverage":{"ECO-02":"partial: the existing-owner and new-entrant tests per class at three tariffs, MSRP and street, with resale (reference-population.md); resale at zero, failures and financing not yet stressed","ECO-03":"partial: the sunk-development case first with low and high ranges, private mining, hardware sales and the hybrid, GPU re-entry after the fleet (coexistence-model.md sections 2, 8a, 12 to 12c; the surface in floor/sram-and-floor.md 4.4); the source thresholds retired to coexistence-workbook.md","ECO-04":"partial: a per-class supply curve with the installed base as a cap and re-entry (coexistence-model.md), the market-structure axis (8a), the operator simulation (operator-simulation.md); dynamic agent policies beyond the single-rule reaction are the simulation second cut","ECO-06":"partial: the recipients and burns reconciled on the chain block-one split (docs/design/proving-payment.md), proving demand as an income axis at none, launch and spike (coexistence-model.md); the full-horizon issuance ledger owed","ECO-07":"partial: each dataset size scored by adversary burden against commodity burden on measured card rows and modelled chip tickets (docs/design/class-v6-rotating-family.md 10.0u); the 8.5 and 11.5 GiB knee costs expected, not measured","INC-02":"partial: the income streams kept separate in the model (mining subsidy, internal proving, external jobs; burns never counted as payment); the node-record and Ember reconciliation are the node and app lanes","INC-03":"partial: the profit-maximising operator simulation first run (mine, internal prove, external prove, off); per-card agents and switching costs are the second cut","INC-04":"partial: the four shocks in the operator simulation (the demand spike, the price fall, the largest provers leaving, the entrants), restored or not and in how many periods","INC-08":"partial: the supplier and operator dependence table (coexistence-model.md 8a); the signing, proving and aggregation roles are the node lane"},"at":"2026-10-08T19:55:03.336Z","method":"model","requirement_id":"ECO-06","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"db424d20","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"in_progress_since":"2026-10-08T19:55:03.336Z","approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null},"evidence_records":{"harness:economics-model":{"cell":"harness:economics-model","manifest_sha":"db424d20","coverage":{"ECO-02":"partial: the existing-owner and new-entrant tests per class at three tariffs, MSRP and street, with resale (reference-population.md); resale at zero, failures and financing not yet stressed","ECO-03":"partial: the sunk-development case first with low and high ranges, private mining, hardware sales and the hybrid, GPU re-entry after the fleet (coexistence-model.md sections 2, 8a, 12 to 12c; the surface in floor/sram-and-floor.md 4.4); the source thresholds retired to coexistence-workbook.md","ECO-04":"partial: a per-class supply curve with the installed base as a cap and re-entry (coexistence-model.md), the market-structure axis (8a), the operator simulation (operator-simulation.md); dynamic agent policies beyond the single-rule reaction are the simulation second cut","ECO-06":"partial: the recipients and burns reconciled on the chain block-one split (docs/design/proving-payment.md), proving demand as an income axis at none, launch and spike (coexistence-model.md); the full-horizon issuance ledger owed","ECO-07":"partial: each dataset size scored by adversary burden against commodity burden on measured card rows and modelled chip tickets (docs/design/class-v6-rotating-family.md 10.0u); the 8.5 and 11.5 GiB knee costs expected, not measured","INC-02":"partial: the income streams kept separate in the model (mining subsidy, internal proving, external jobs; burns never counted as payment); the node-record and Ember reconciliation are the node and app lanes","INC-03":"partial: the profit-maximising operator simulation first run (mine, internal prove, external prove, off); per-card agents and switching costs are the second cut","INC-04":"partial: the four shocks in the operator simulation (the demand spike, the price fall, the largest provers leaving, the entrants), restored or not and in how many periods","INC-08":"partial: the supplier and operator dependence table (coexistence-model.md 8a); the signing, proving and aggregation roles are the node lane"},"at":"2026-10-08T19:55:03.336Z","method":"model","requirement_id":"ECO-06","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"db424d20","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"run_id":"eco-d4-20261008-01","evidence":"docs/analysis/class-v6/coexistence-model.md","in_progress":true}}},{"id":"ECO-07","title":"Price memory growth and honest-card displacement","setup":"Use GPU-05 and ROT-06 costs with the cheapest specialist adaptation.","steps":["For each dataset increment, compare specialist cost increases with excluded cards and lost proving capacity.","Include ordinary-owner replacement, resale and reloading expenses.","Run alternate bounded schedules without assigning automatic chip death."],"accept":"The retained schedule meets P06/P12 and has an evidence-backed net competitiveness benefit. A schedule that mainly harms accessible GPUs fails; excluded tiers and mitigations are documented before activation.","evidence":"Per-step cost/retention table; alternative schedules; approval record.","priority":"GATE","profile":"P06; P12","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[8,13,18,24,26],"gate":"G4","owner":"Economics lead + independent reviewer","manual_page":35,"owner_lane":"research lane (ad6a2bd47d4a46105)","run_status":"NOT RUN","evidence_path":"docs/analysis/class-v6/coexistence-model.md","run_id":"eco-d4-20261008-01","updated":"2026-10-08T19:55:03.336Z","evidence_record":{"cell":"harness:economics-model","manifest_sha":"db424d20","coverage":{"ECO-02":"partial: the existing-owner and new-entrant tests per class at three tariffs, MSRP and street, with resale (reference-population.md); resale at zero, failures and financing not yet stressed","ECO-03":"partial: the sunk-development case first with low and high ranges, private mining, hardware sales and the hybrid, GPU re-entry after the fleet (coexistence-model.md sections 2, 8a, 12 to 12c; the surface in floor/sram-and-floor.md 4.4); the source thresholds retired to coexistence-workbook.md","ECO-04":"partial: a per-class supply curve with the installed base as a cap and re-entry (coexistence-model.md), the market-structure axis (8a), the operator simulation (operator-simulation.md); dynamic agent policies beyond the single-rule reaction are the simulation second cut","ECO-06":"partial: the recipients and burns reconciled on the chain block-one split (docs/design/proving-payment.md), proving demand as an income axis at none, launch and spike (coexistence-model.md); the full-horizon issuance ledger owed","ECO-07":"partial: each dataset size scored by adversary burden against commodity burden on measured card rows and modelled chip tickets (docs/design/class-v6-rotating-family.md 10.0u); the 8.5 and 11.5 GiB knee costs expected, not measured","INC-02":"partial: the income streams kept separate in the model (mining subsidy, internal proving, external jobs; burns never counted as payment); the node-record and Ember reconciliation are the node and app lanes","INC-03":"partial: the profit-maximising operator simulation first run (mine, internal prove, external prove, off); per-card agents and switching costs are the second cut","INC-04":"partial: the four shocks in the operator simulation (the demand spike, the price fall, the largest provers leaving, the entrants), restored or not and in how many periods","INC-08":"partial: the supplier and operator dependence table (coexistence-model.md 8a); the signing, proving and aggregation roles are the node lane"},"at":"2026-10-08T19:55:03.336Z","method":"model","requirement_id":"ECO-07","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"db424d20","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"in_progress_since":"2026-10-08T19:55:03.336Z","approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null},"evidence_records":{"harness:economics-model":{"cell":"harness:economics-model","manifest_sha":"db424d20","coverage":{"ECO-02":"partial: the existing-owner and new-entrant tests per class at three tariffs, MSRP and street, with resale (reference-population.md); resale at zero, failures and financing not yet stressed","ECO-03":"partial: the sunk-development case first with low and high ranges, private mining, hardware sales and the hybrid, GPU re-entry after the fleet (coexistence-model.md sections 2, 8a, 12 to 12c; the surface in floor/sram-and-floor.md 4.4); the source thresholds retired to coexistence-workbook.md","ECO-04":"partial: a per-class supply curve with the installed base as a cap and re-entry (coexistence-model.md), the market-structure axis (8a), the operator simulation (operator-simulation.md); dynamic agent policies beyond the single-rule reaction are the simulation second cut","ECO-06":"partial: the recipients and burns reconciled on the chain block-one split (docs/design/proving-payment.md), proving demand as an income axis at none, launch and spike (coexistence-model.md); the full-horizon issuance ledger owed","ECO-07":"partial: each dataset size scored by adversary burden against commodity burden on measured card rows and modelled chip tickets (docs/design/class-v6-rotating-family.md 10.0u); the 8.5 and 11.5 GiB knee costs expected, not measured","INC-02":"partial: the income streams kept separate in the model (mining subsidy, internal proving, external jobs; burns never counted as payment); the node-record and Ember reconciliation are the node and app lanes","INC-03":"partial: the profit-maximising operator simulation first run (mine, internal prove, external prove, off); per-card agents and switching costs are the second cut","INC-04":"partial: the four shocks in the operator simulation (the demand spike, the price fall, the largest provers leaving, the entrants), restored or not and in how many periods","INC-08":"partial: the supplier and operator dependence table (coexistence-model.md 8a); the signing, proving and aggregation roles are the node lane"},"at":"2026-10-08T19:55:03.336Z","method":"model","requirement_id":"ECO-07","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"db424d20","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"run_id":"eco-d4-20261008-01","evidence":"docs/analysis/class-v6/coexistence-model.md","in_progress":true}}},{"id":"ECO-08","title":"Reproduce and adversarially audit the model","setup":"Give an independent economist or qualified analyst the code, inputs and frozen success criteria.","steps":["Recalculate required worlds and perturb favourable assumptions against the team.","Check dependence on discounts, utilisation, capital limits, artificial prices and future upgrades.","Publish the sensitivity range and state which conclusions are conditional."],"accept":"Material results reproduce, required scenarios pass and no unacknowledged assumption dominates the claim. The model supports a bounded coexistence conclusion, not a percentage probability that no chip will appear.","evidence":"Independent report; rerun outputs; model limitations; approved claim envelope.","priority":"GATE","profile":"P12","cadence":"Release candidate; repeat after relevant changes","method":"Independent economic review","status":"NOT RUN","source":[8,13,18,24,26],"gate":"G4","owner":"Economics lead + independent reviewer","manual_page":35,"owner_lane":"research lane (ad6a2bd47d4a46105)","run_status":"NOT RUN","evidence_path":"sim/economy/coexist/README.md","run_id":"eco05-20261008-02","updated":"2026-10-08T20:07:38.167Z","evidence_record":{"cell":"model:coexist-fixtures","manifest_sha":"3f2050ab","coverage":{"ECO-01":"partial: the hand-worked fixtures and the second implementation; the independent reconciliation of inputs and units remains","ECO-08":"partial: the package runs from the served files (README, inputs with sources and labels, fixtures); the independent report, the rerun and the perturbations remain"},"at":"2026-10-08T20:07:38.167Z","method":"model","requirement_id":"ECO-08","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"3f2050ab","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"in_progress_since":"2026-10-08T20:07:38.167Z","approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null},"evidence_records":{"model:coexist-fixtures":{"cell":"model:coexist-fixtures","manifest_sha":"3f2050ab","coverage":{"ECO-01":"partial: the hand-worked fixtures and the second implementation; the independent reconciliation of inputs and units remains","ECO-08":"partial: the package runs from the served files (README, inputs with sources and labels, fixtures); the independent report, the rerun and the perturbations remain"},"at":"2026-10-08T20:07:38.167Z","method":"model","requirement_id":"ECO-08","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"3f2050ab","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"run_id":"eco05-20261008-02","evidence":"sim/economy/coexist/README.md","in_progress":true}}}]},{"code":"EVM","title":"Execution and developer compatibility","source":[15,25,34,35,36,37],"gate":"Technical readiness","owner":"Execution lead + independent implementer","fixtures":"F0 execution-fork semantics; F5 transactions/contracts; F4 multi-node network","summary":"Keep familiar applications while making every difference and metering rule explicit and reproducible.","tests":[{"id":"EVM-01","title":"Match the selected EVM semantics","setup":"Pin the intended execution fork, revm version and all Igneum deviations in F0.","steps":["Run the applicable upstream execution/state fixtures plus independently written deviation tests.","Execute identical blocks on multiple nodes and compare roots, receipts, logs, gas and failure outcomes.","Minimise mismatches and distinguish intended differences from implementation defects."],"accept":"All applicable vectors match; every deviation has a documented test and developer consequence. No claim of universal Ethereum equivalence or Ethereum settlement security is inferred.","evidence":"Fixture/version inventory; root/receipt diffs; deviation matrix.","priority":"BLOCKER","profile":"P01; P09","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[15,25,34,35,36,37],"gate":"Technical readiness","owner":"Execution lead + independent implementer","manual_page":36,"owner_lane":"reference-apps lane (a2060899d2a27d31c)","run_status":"NOT RUN","evidence_path":"docs/build/compatibility.md","run_id":"team-2026-10-08","updated":"2026-10-08T20:10:24.556Z","evidence_record":{"reason":"no EVM conformance-vector harness is mapped tonight; the exec suite does not run the reference test vectors","at":"2026-10-08T20:10:24.556Z","method":"static","requirement_id":"EVM-01","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"in_progress_since":"2026-10-08 18:3x UK","approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null},"evidence_records":{"record":{"what_was_run":"/compatibility 20 of 20 rows PASSED on igneum-devnet-4","run_by":"reference-apps lane (a2060899d2a27d31c)","under_the_standard":"no: team-run before the standard's procedure; the status is RUNNING until the case is re-run under its steps with the profile's numbers and an independent run where the profile asks one","pass_or_fail_today":"not judged under the standard yet","method":"static","requirement_id":"EVM-01","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"run_id":"team-2026-10-08","evidence":"docs/build/compatibility.md","in_progress":true}}},{"id":"EVM-02","title":"Preserve transaction binding and replay protection","setup":"Use signed transfers, contract calls and deployment transactions with boundary field values.","steps":["Alter chain identity, nonce, signature, fee caps and recipient after signing.","Replay across nodes, forks and distinct test networks; resubmit around reorganisation.","Check mempool admission and final consensus execution independently."],"accept":"Unauthorised, wrong-network or duplicate spends are rejected according to F0. Valid replacements follow the declared rule; mempool filtering alone is not evidence of consensus enforcement.","evidence":"Signed corpus; admission/execution outcomes; account-state reconciliation.","priority":"BLOCKER","profile":"P01","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[15,25,34,35,36,37],"gate":"Technical readiness","owner":"Execution lead + independent implementer","manual_page":36,"owner_lane":"reference-apps lane (a2060899d2a27d31c)","run_status":"NOT RUN","evidence_path":"build-1:/srv/artefacts/tas/201-7cfa422a-aa0e0f45/node-7cfa422a/box4-exec.log","run_id":"201-7cfa422a-aa0e0f45","updated":"2026-10-08T19:32:50.856Z","evidence_record":{"cell":"suite:exec","manifest_sha":"7cfa422a","coverage":{"ZKP-01":"partial: a real proof verifies, a wrong statement and garbage are refused (nativeverify)","ZKP-03":"partial: a snapshot under another digest refused, the epoch streams bound to the digest","OPS-04":"partial: snapshot install, replay and genesis recapture after a crash","EVM-02":"partial: the replay tests on the day stream; the signature and chain-id binding vectors are an EVM harness still to map"},"at":"2026-10-08T19:32:50.856Z","method":"native","requirement_id":"EVM-02","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"7cfa422a","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"in_progress_since":"2026-10-08T19:32:50.856Z","approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null},"evidence_records":{"suite:exec":{"cell":"suite:exec","manifest_sha":"7cfa422a","coverage":{"ZKP-01":"partial: a real proof verifies, a wrong statement and garbage are refused (nativeverify)","ZKP-03":"partial: a snapshot under another digest refused, the epoch streams bound to the digest","OPS-04":"partial: snapshot install, replay and genesis recapture after a crash","EVM-02":"partial: the replay tests on the day stream; the signature and chain-id binding vectors are an EVM harness still to map"},"at":"2026-10-08T19:32:50.856Z","method":"native","requirement_id":"EVM-02","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"7cfa422a","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"run_id":"201-7cfa422a-aa0e0f45","evidence":"build-1:/srv/artefacts/tas/201-7cfa422a-aa0e0f45/node-7cfa422a/box4-exec.log","in_progress":true}}},{"id":"EVM-03","title":"Test two-dimensional fees and proving limits","setup":"Freeze fee dimensions, estimator rules, abort behaviour and refund policy.","steps":["Run workloads near and beyond execution and proving budgets, including state-heavy pathological cases.","Compare estimated fees with charged fees and validate rollback/receipt status on abort.","Mutate a block producer to omit or undercharge expensive work."],"accept":"Deterministic metering, charged amounts and aborted state agree across nodes and proofs. Resource bounds hold; fee estimates meet P09 for accepted supported cases. Undercharged invalid blocks cannot bypass consensus.","evidence":"Metering traces; fee fixtures; estimator errors; invalid-block rejection.","priority":"BLOCKER","profile":"P01; P09","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[15,25,34,35,36,37],"gate":"Technical readiness","owner":"Execution lead + independent implementer","manual_page":36,"owner_lane":"reference-apps lane (a2060899d2a27d31c)","run_status":"NOT RUN","evidence_path":"tools/reference-apps/compat/results.json","run_id":"ra-20261008T1744-evm","updated":"2026-10-08T19:13:20.781Z","evidence_record":{"cell":"harness:reference-apps-compat","manifest_sha":"4cdcc488","coverage":{"EVM-02":"partial: a transaction signed for the previous devnet's chain id is refused and a signed transaction sent twice is refused on the live devnet; the F0 replacement rule and the mempool-independent evidence are the exec suite's","EVM-03":"partial: fee quotes, eth_estimateGas against gasUsed for a transfer and a call, the documented 21,000 local-limit difference and the pgas receipt fields on the live devnet; determinism across nodes and proofs and the P09 bounds are the proving-limit harness (not run)","EVM-04":"partial: block.number, timestamp, chainid, basefee, blockhash(number-1), CREATE2 address, block.coinbase and block.prevrandao read against the chain and the documented differences; conformance vectors for F0 are EVM-01's","EVM-05":"partial: ERC-20 deploy, transfer, approve/transferFrom, a probe contract, a persisting counter, a revert with reason and an out-of-gas call on the live devnet; application-level invariants of the DEX integration set are the DEX lane's","EVM-06":"partial: receipt fields and logsBloom recompute, the block's receipts trie root rebuilds, eth_getLogs by address/topic/range, eth_getBlockByNumber with full transactions and eth_getBlockReceipts; wallet UI states (included, executed, proven, finalised) and the indexer's canonical-record check are the wallet and explorer lanes' rows"},"at":"2026-10-08T19:13:20.781Z","method":"static","requirement_id":"EVM-03","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"4cdcc488","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"in_progress_since":"2026-10-08T19:13:20.781Z","approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null},"evidence_records":{"harness:reference-apps-compat":{"cell":"harness:reference-apps-compat","manifest_sha":"4cdcc488","coverage":{"EVM-02":"partial: a transaction signed for the previous devnet's chain id is refused and a signed transaction sent twice is refused on the live devnet; the F0 replacement rule and the mempool-independent evidence are the exec suite's","EVM-03":"partial: fee quotes, eth_estimateGas against gasUsed for a transfer and a call, the documented 21,000 local-limit difference and the pgas receipt fields on the live devnet; determinism across nodes and proofs and the P09 bounds are the proving-limit harness (not run)","EVM-04":"partial: block.number, timestamp, chainid, basefee, blockhash(number-1), CREATE2 address, block.coinbase and block.prevrandao read against the chain and the documented differences; conformance vectors for F0 are EVM-01's","EVM-05":"partial: ERC-20 deploy, transfer, approve/transferFrom, a probe contract, a persisting counter, a revert with reason and an out-of-gas call on the live devnet; application-level invariants of the DEX integration set are the DEX lane's","EVM-06":"partial: receipt fields and logsBloom recompute, the block's receipts trie root rebuilds, eth_getLogs by address/topic/range, eth_getBlockByNumber with full transactions and eth_getBlockReceipts; wallet UI states (included, executed, proven, finalised) and the indexer's canonical-record check are the wallet and explorer lanes' rows"},"at":"2026-10-08T19:13:20.781Z","method":"static","requirement_id":"EVM-03","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"4cdcc488","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"run_id":"ra-20261008T1744-evm","evidence":"tools/reference-apps/compat/results.json","in_progress":true}}},{"id":"EVM-04","title":"Exercise block context and randomness assumptions","setup":"Use contracts sensitive to timestamp, height/context, randomness and ordering.","steps":["Compare the declared Igneum semantics with developers' documented expectations.","Test boundary transitions, miner-influenced inputs and adversarial ordering in the isolated network.","Run dependency reviews for applications using these values for economic decisions."],"accept":"Semantics match F0 and differences are surfaced in compatibility documentation. No source of miner influence is marketed as unbiased randomness; incompatible applications are not included in the compatibility claim.","evidence":"Context-contract results; threat notes; compatibility exclusions.","priority":"BLOCKER","profile":"P01; P09","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[15,25,34,35,36,37],"gate":"Technical readiness","owner":"Execution lead + independent implementer","manual_page":37,"owner_lane":"reference-apps lane (a2060899d2a27d31c)","run_status":"NOT RUN","evidence_path":"tools/reference-apps/compat/results.json","run_id":"ra-20261008T1744-evm","updated":"2026-10-08T19:13:20.781Z","evidence_record":{"cell":"harness:reference-apps-compat","manifest_sha":"4cdcc488","coverage":{"EVM-02":"partial: a transaction signed for the previous devnet's chain id is refused and a signed transaction sent twice is refused on the live devnet; the F0 replacement rule and the mempool-independent evidence are the exec suite's","EVM-03":"partial: fee quotes, eth_estimateGas against gasUsed for a transfer and a call, the documented 21,000 local-limit difference and the pgas receipt fields on the live devnet; determinism across nodes and proofs and the P09 bounds are the proving-limit harness (not run)","EVM-04":"partial: block.number, timestamp, chainid, basefee, blockhash(number-1), CREATE2 address, block.coinbase and block.prevrandao read against the chain and the documented differences; conformance vectors for F0 are EVM-01's","EVM-05":"partial: ERC-20 deploy, transfer, approve/transferFrom, a probe contract, a persisting counter, a revert with reason and an out-of-gas call on the live devnet; application-level invariants of the DEX integration set are the DEX lane's","EVM-06":"partial: receipt fields and logsBloom recompute, the block's receipts trie root rebuilds, eth_getLogs by address/topic/range, eth_getBlockByNumber with full transactions and eth_getBlockReceipts; wallet UI states (included, executed, proven, finalised) and the indexer's canonical-record check are the wallet and explorer lanes' rows"},"at":"2026-10-08T19:13:20.781Z","method":"static","requirement_id":"EVM-04","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"4cdcc488","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"in_progress_since":"2026-10-08T19:13:20.781Z","approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null},"evidence_records":{"harness:reference-apps-compat":{"cell":"harness:reference-apps-compat","manifest_sha":"4cdcc488","coverage":{"EVM-02":"partial: a transaction signed for the previous devnet's chain id is refused and a signed transaction sent twice is refused on the live devnet; the F0 replacement rule and the mempool-independent evidence are the exec suite's","EVM-03":"partial: fee quotes, eth_estimateGas against gasUsed for a transfer and a call, the documented 21,000 local-limit difference and the pgas receipt fields on the live devnet; determinism across nodes and proofs and the P09 bounds are the proving-limit harness (not run)","EVM-04":"partial: block.number, timestamp, chainid, basefee, blockhash(number-1), CREATE2 address, block.coinbase and block.prevrandao read against the chain and the documented differences; conformance vectors for F0 are EVM-01's","EVM-05":"partial: ERC-20 deploy, transfer, approve/transferFrom, a probe contract, a persisting counter, a revert with reason and an out-of-gas call on the live devnet; application-level invariants of the DEX integration set are the DEX lane's","EVM-06":"partial: receipt fields and logsBloom recompute, the block's receipts trie root rebuilds, eth_getLogs by address/topic/range, eth_getBlockByNumber with full transactions and eth_getBlockReceipts; wallet UI states (included, executed, proven, finalised) and the indexer's canonical-record check are the wallet and explorer lanes' rows"},"at":"2026-10-08T19:13:20.781Z","method":"static","requirement_id":"EVM-04","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"4cdcc488","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"run_id":"ra-20261008T1744-evm","evidence":"tools/reference-apps/compat/results.json","in_progress":true}}},{"id":"EVM-05","title":"Run representative contract integration journeys","setup":"Use versioned transfer/token, NFT, multisignature, exchange and upgrade-pattern fixtures where supported.","steps":["Deploy, initialise, transact, revert and upgrade each contract using ordinary tooling.","Exercise events, logs, balances, storage and call traces across node restart/reorganisation.","Compare expected application invariants with native execution and proved results."],"accept":"Supported journeys preserve their stated invariants; all deviations are documented. Example deployment success alone cannot stand in for application-level correctness or financial audit.","evidence":"Contract fixture hashes; transaction journeys; invariant and state comparisons.","priority":"BLOCKER","profile":"P01; P09","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[15,25,34,35,36,37],"gate":"Technical readiness","owner":"Execution lead + independent implementer","manual_page":37,"owner_lane":"reference-apps lane (a2060899d2a27d31c)","run_status":"NOT RUN","evidence_path":"tools/reference-apps/compat/results.json","run_id":"ra-20261008T1744-evm","updated":"2026-10-08T19:13:20.781Z","evidence_record":{"cell":"harness:reference-apps-compat","manifest_sha":"4cdcc488","coverage":{"EVM-02":"partial: a transaction signed for the previous devnet's chain id is refused and a signed transaction sent twice is refused on the live devnet; the F0 replacement rule and the mempool-independent evidence are the exec suite's","EVM-03":"partial: fee quotes, eth_estimateGas against gasUsed for a transfer and a call, the documented 21,000 local-limit difference and the pgas receipt fields on the live devnet; determinism across nodes and proofs and the P09 bounds are the proving-limit harness (not run)","EVM-04":"partial: block.number, timestamp, chainid, basefee, blockhash(number-1), CREATE2 address, block.coinbase and block.prevrandao read against the chain and the documented differences; conformance vectors for F0 are EVM-01's","EVM-05":"partial: ERC-20 deploy, transfer, approve/transferFrom, a probe contract, a persisting counter, a revert with reason and an out-of-gas call on the live devnet; application-level invariants of the DEX integration set are the DEX lane's","EVM-06":"partial: receipt fields and logsBloom recompute, the block's receipts trie root rebuilds, eth_getLogs by address/topic/range, eth_getBlockByNumber with full transactions and eth_getBlockReceipts; wallet UI states (included, executed, proven, finalised) and the indexer's canonical-record check are the wallet and explorer lanes' rows"},"at":"2026-10-08T19:13:20.781Z","method":"static","requirement_id":"EVM-05","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"4cdcc488","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"in_progress_since":"2026-10-08T19:13:20.781Z","approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null},"evidence_records":{"harness:reference-apps-compat":{"cell":"harness:reference-apps-compat","manifest_sha":"4cdcc488","coverage":{"EVM-02":"partial: a transaction signed for the previous devnet's chain id is refused and a signed transaction sent twice is refused on the live devnet; the F0 replacement rule and the mempool-independent evidence are the exec suite's","EVM-03":"partial: fee quotes, eth_estimateGas against gasUsed for a transfer and a call, the documented 21,000 local-limit difference and the pgas receipt fields on the live devnet; determinism across nodes and proofs and the P09 bounds are the proving-limit harness (not run)","EVM-04":"partial: block.number, timestamp, chainid, basefee, blockhash(number-1), CREATE2 address, block.coinbase and block.prevrandao read against the chain and the documented differences; conformance vectors for F0 are EVM-01's","EVM-05":"partial: ERC-20 deploy, transfer, approve/transferFrom, a probe contract, a persisting counter, a revert with reason and an out-of-gas call on the live devnet; application-level invariants of the DEX integration set are the DEX lane's","EVM-06":"partial: receipt fields and logsBloom recompute, the block's receipts trie root rebuilds, eth_getLogs by address/topic/range, eth_getBlockByNumber with full transactions and eth_getBlockReceipts; wallet UI states (included, executed, proven, finalised) and the indexer's canonical-record check are the wallet and explorer lanes' rows"},"at":"2026-10-08T19:13:20.781Z","method":"static","requirement_id":"EVM-05","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"4cdcc488","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"run_id":"ra-20261008T1744-evm","evidence":"tools/reference-apps/compat/results.json","in_progress":true}}},{"id":"EVM-06","title":"Validate wallets, RPC and indexers","setup":"Pin supported RPC methods and response semantics; use normal developer clients and an independent indexer.","steps":["Test fee estimation, pending/final states, subscriptions, pagination and reconnects.","Reindex from genesis or the documented trust anchor after pruning and restart.","Compare logs, receipts and balances with independently validated chain state."],"accept":"No missing/duplicate canonical records; unsupported methods are explicit. UI states distinguish included, executed, proven and finalised. Malformed RPC input cannot crash validators or leak secrets.","evidence":"RPC conformance report; reindex comparison; reconnect/edge-case logs.","priority":"BLOCKER","profile":"P01; P09","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[15,25,34,35,36,37],"gate":"Technical readiness","owner":"Execution lead + independent implementer","manual_page":37,"owner_lane":"reference-apps lane (a2060899d2a27d31c)","run_status":"NOT RUN","evidence_path":"tools/reference-apps/compat/results.json","run_id":"ra-20261008T1744-evm","updated":"2026-10-08T19:13:20.781Z","evidence_record":{"cell":"harness:reference-apps-compat","manifest_sha":"4cdcc488","coverage":{"EVM-02":"partial: a transaction signed for the previous devnet's chain id is refused and a signed transaction sent twice is refused on the live devnet; the F0 replacement rule and the mempool-independent evidence are the exec suite's","EVM-03":"partial: fee quotes, eth_estimateGas against gasUsed for a transfer and a call, the documented 21,000 local-limit difference and the pgas receipt fields on the live devnet; determinism across nodes and proofs and the P09 bounds are the proving-limit harness (not run)","EVM-04":"partial: block.number, timestamp, chainid, basefee, blockhash(number-1), CREATE2 address, block.coinbase and block.prevrandao read against the chain and the documented differences; conformance vectors for F0 are EVM-01's","EVM-05":"partial: ERC-20 deploy, transfer, approve/transferFrom, a probe contract, a persisting counter, a revert with reason and an out-of-gas call on the live devnet; application-level invariants of the DEX integration set are the DEX lane's","EVM-06":"partial: receipt fields and logsBloom recompute, the block's receipts trie root rebuilds, eth_getLogs by address/topic/range, eth_getBlockByNumber with full transactions and eth_getBlockReceipts; wallet UI states (included, executed, proven, finalised) and the indexer's canonical-record check are the wallet and explorer lanes' rows"},"at":"2026-10-08T19:13:20.781Z","method":"static","requirement_id":"EVM-06","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"4cdcc488","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"in_progress_since":"2026-10-08T19:13:20.781Z","approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null},"evidence_records":{"harness:reference-apps-compat":{"cell":"harness:reference-apps-compat","manifest_sha":"4cdcc488","coverage":{"EVM-02":"partial: a transaction signed for the previous devnet's chain id is refused and a signed transaction sent twice is refused on the live devnet; the F0 replacement rule and the mempool-independent evidence are the exec suite's","EVM-03":"partial: fee quotes, eth_estimateGas against gasUsed for a transfer and a call, the documented 21,000 local-limit difference and the pgas receipt fields on the live devnet; determinism across nodes and proofs and the P09 bounds are the proving-limit harness (not run)","EVM-04":"partial: block.number, timestamp, chainid, basefee, blockhash(number-1), CREATE2 address, block.coinbase and block.prevrandao read against the chain and the documented differences; conformance vectors for F0 are EVM-01's","EVM-05":"partial: ERC-20 deploy, transfer, approve/transferFrom, a probe contract, a persisting counter, a revert with reason and an out-of-gas call on the live devnet; application-level invariants of the DEX integration set are the DEX lane's","EVM-06":"partial: receipt fields and logsBloom recompute, the block's receipts trie root rebuilds, eth_getLogs by address/topic/range, eth_getBlockByNumber with full transactions and eth_getBlockReceipts; wallet UI states (included, executed, proven, finalised) and the indexer's canonical-record check are the wallet and explorer lanes' rows"},"at":"2026-10-08T19:13:20.781Z","method":"static","requirement_id":"EVM-06","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"4cdcc488","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"run_id":"ra-20261008T1744-evm","evidence":"tools/reference-apps/compat/results.json","in_progress":true}}},{"id":"EVM-07","title":"Handle execution denial-of-service workloads","setup":"Create bounded pathological bytecode, calls, state growth, storage and precompile inputs.","steps":["Measure CPU, memory, disk and proving cost against charged budgets.","Saturate admission with invalid/expensive requests while valid workloads continue.","Restart mid-execution and verify atomic state recovery."],"accept":"P09 limits hold with no unbounded free work or divergent rollback. State remains consistent after crash; availability under overload follows the declared admission policy, not silent dropping of accepted transactions.","evidence":"Resource profiles; adversarial corpus; state recovery comparisons.","priority":"BLOCKER","profile":"P01; P09","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[15,25,34,35,36,37],"gate":"Technical readiness","owner":"Execution lead + independent implementer","manual_page":38,"owner_lane":"reference-apps lane (a2060899d2a27d31c)","run_status":"NOT RUN","evidence_path":"","run_id":"","updated":"2026-10-08T19:22:31.798Z","evidence_record":{"reason":"execution DoS workloads need the workload catalogue F3","at":"2026-10-08T19:22:31.798Z","method":"static","requirement_id":"EVM-07","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null},"evidence_records":{"record":{"reason":"execution DoS workloads need the workload catalogue F3","at":"2026-10-08T19:22:31.798Z","method":"static","requirement_id":"EVM-07","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"run_id":"","evidence":"","in_progress":false}}},{"id":"EVM-08","title":"Verify controlled execution and verifier upgrades","setup":"Prepare two authorised versions and malicious, stale or unknown versions.","steps":["Cross activation with mixed clients, queued transactions and proofs from both versions.","Bind each accepted proof to the correct execution semantics and program identity.","Exercise a failed software distribution without altering consensus activation."],"accept":"No unknown or wrong-version execution is accepted. Pre/post-boundary handling is deterministic and documented; software delivery cannot silently redefine transaction semantics or proof acceptance.","evidence":"Upgrade vectors; mixed-version traces; manifest/version bindings.","priority":"BLOCKER","profile":"P01; P08; P09","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[15,25,34,35,36,37],"gate":"Technical readiness","owner":"Execution lead + independent implementer","manual_page":38,"owner_lane":"enforced-proving lane (a6e8f84588b809d62)","run_status":"NOT RUN","evidence_path":"build-2:/home/build/enforced-fixtures/floor-240-expect-refuse.json","run_id":"enforced-proving-20261008-01","updated":"2026-10-08T19:03:30.171Z","evidence_record":{"cell":"harness:proving-enforcement","manifest_sha":"417c4a57","coverage":{"ZKP-01":"partial: the seven refusals as named tests (no proof never inserted; a wrong proof and another program id invalidate the block; the honest record paid once) and the fast-time crossing with a modified producer; the genuine-proof positive control through ordinary network paths is the testnet's live read, not run here","ZKP-02":"partial: the pinned-id refusal on a real proof, the daemon's start refusal, key succession (the epochs, the accepted ids, a verdict counting only where its pair is accepted, the seven refusals on both sides of the height, the start refusal under a succession, the real-proof refusal of a pair the epoch does not accept) and the fast-time crossing of a scheduled succession with a real proof under each pair; the downgrade through an old node path is not run","ZKP-03":"partial: the chain binding (a record signed for another network), the replay, a wrong block, a wrong shard, a stale record outside the window; the fork and replayed-sync steps are not run","ZKP-04":"partial: an altered payout address (after signing and re-signed), a statement over altered rewards or payouts vetoed natively, the inputs commitment of P22 stage 1 (shard 0 and the aggregator carry the commitment the node recomputes) and the derivation commitment of stage 2 (the payouts derived in the guest from the carried records); the rewards' proved derivation is P22 stage 3, PENDING","ZKP-05":"partial: a duplicate of a paid record pays nothing and the honest record pays once; the race, reorder and crash-recover steps are not run","ZKP-08":"partial: the body rule and the payment rule read one floor, a producer with its body rule off still pays nothing on honest nodes (the fast-time crossing); the replacement-prover and authority steps are not run; the proof side of the derivation is P22 stage 3, PENDING","EVM-08":"partial: the controlled verifier upgrade as a key succession (both pairs embedded, the window, the start refusal) and its fast-time crossing; the mixed-client crossing on the live network and the failed-distribution step are not run"},"at":"2026-10-08T19:03:30.171Z","method":"SP1","requirement_id":"EVM-08","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"417c4a57","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"dependency":"the first pin into elf/prior/ (the node lane, key-succession-pin, tonight by 21:00) and the devnet-4 succession height (main, by 22:00 under the floor rule)","in_progress_since":"2026-10-08T19:03:30.171Z","approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null},"evidence_records":{"harness:proving-enforcement":{"cell":"harness:proving-enforcement","manifest_sha":"417c4a57","coverage":{"ZKP-01":"partial: the seven refusals as named tests (no proof never inserted; a wrong proof and another program id invalidate the block; the honest record paid once) and the fast-time crossing with a modified producer; the genuine-proof positive control through ordinary network paths is the testnet's live read, not run here","ZKP-02":"partial: the pinned-id refusal on a real proof, the daemon's start refusal, key succession (the epochs, the accepted ids, a verdict counting only where its pair is accepted, the seven refusals on both sides of the height, the start refusal under a succession, the real-proof refusal of a pair the epoch does not accept) and the fast-time crossing of a scheduled succession with a real proof under each pair; the downgrade through an old node path is not run","ZKP-03":"partial: the chain binding (a record signed for another network), the replay, a wrong block, a wrong shard, a stale record outside the window; the fork and replayed-sync steps are not run","ZKP-04":"partial: an altered payout address (after signing and re-signed), a statement over altered rewards or payouts vetoed natively, the inputs commitment of P22 stage 1 (shard 0 and the aggregator carry the commitment the node recomputes) and the derivation commitment of stage 2 (the payouts derived in the guest from the carried records); the rewards' proved derivation is P22 stage 3, PENDING","ZKP-05":"partial: a duplicate of a paid record pays nothing and the honest record pays once; the race, reorder and crash-recover steps are not run","ZKP-08":"partial: the body rule and the payment rule read one floor, a producer with its body rule off still pays nothing on honest nodes (the fast-time crossing); the replacement-prover and authority steps are not run; the proof side of the derivation is P22 stage 3, PENDING","EVM-08":"partial: the controlled verifier upgrade as a key succession (both pairs embedded, the window, the start refusal) and its fast-time crossing; the mixed-client crossing on the live network and the failed-distribution step are not run"},"at":"2026-10-08T19:03:30.171Z","method":"SP1","requirement_id":"EVM-08","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"417c4a57","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"run_id":"enforced-proving-20261008-01","evidence":"build-2:/home/build/enforced-fixtures/floor-240-expect-refuse.json","in_progress":true}}}]},{"code":"ZKP","title":"Consensus-enforced proof validity","source":[16,20,24,25,36,37],"gate":"Technical readiness / G5","owner":"Proving + protocol leads; independent cryptography review","fixtures":"F0 pinned programs/verifiers; F5 valid and hostile proof corpus; unmodified validators","summary":"The validator, not merely the official producer, must reject unauthorised or invalid proof records and rewards.","tests":[{"id":"ZKP-01","title":"Reject missing and invalid proofs","setup":"Start from a native-correct statement and an independently verified valid proof.","steps":["Submit the statement with no proof, truncated bytes, random bytes and targeted proof mutations using a modified producer.","Submit the genuine proof as a positive control through ordinary network paths.","Inspect block acceptance and resulting reward/state on unmodified validators."],"accept":"Every invalid proof record is rejected and earns no reward; valid controls succeed. A producer-side filter is not sufficient. Record rejection semantics exactly as defined by F0.","evidence":"Hostile record corpus; validator decisions; before/after balances; positive controls.","priority":"BLOCKER","profile":"P01; P09","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[16,20,24,25,36,37],"gate":"Technical readiness / G5","owner":"Proving + protocol leads; independent cryptography review","manual_page":39,"owner_lane":"enforced-proving lane (a6e8f84588b809d62)","run_status":"NOT RUN","evidence_path":"build-1:/srv/artefacts/tas/201-7cfa422a-aa0e0f45/node-7cfa422a/box4-exec.log","run_id":"201-7cfa422a-aa0e0f45","updated":"2026-10-08T19:32:50.856Z","evidence_record":{"cell":"suite:exec","manifest_sha":"7cfa422a","coverage":{"ZKP-01":"partial: a real proof verifies, a wrong statement and garbage are refused (nativeverify)","ZKP-03":"partial: a snapshot under another digest refused, the epoch streams bound to the digest","OPS-04":"partial: snapshot install, replay and genesis recapture after a crash","EVM-02":"partial: the replay tests on the day stream; the signature and chain-id binding vectors are an EVM harness still to map"},"at":"2026-10-08T19:32:50.856Z","method":"native","requirement_id":"ZKP-01","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"7cfa422a","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"in_progress_since":"2026-10-08T19:32:50.856Z","approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null},"evidence_records":{"suite:exec":{"cell":"suite:exec","manifest_sha":"7cfa422a","coverage":{"ZKP-01":"partial: a real proof verifies, a wrong statement and garbage are refused (nativeverify)","ZKP-03":"partial: a snapshot under another digest refused, the epoch streams bound to the digest","OPS-04":"partial: snapshot install, replay and genesis recapture after a crash","EVM-02":"partial: the replay tests on the day stream; the signature and chain-id binding vectors are an EVM harness still to map"},"at":"2026-10-08T19:32:50.856Z","method":"native","requirement_id":"ZKP-01","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"7cfa422a","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"run_id":"201-7cfa422a-aa0e0f45","evidence":"build-1:/srv/artefacts/tas/201-7cfa422a-aa0e0f45/node-7cfa422a/box4-exec.log","in_progress":true}}},{"id":"ZKP-02","title":"Bind program, verifier and security parameters","setup":"Use valid proofs from authorised and unauthorised programs and parameter sets.","steps":["Swap program digest, verifier version, security settings and verification key where applicable.","Attempt downgrade through configuration, serialized metadata or an old node path.","Test authorised boundary transitions and unsupported future identities."],"accept":"Only explicitly authorised combinations are accepted in the correct epoch. No implicit trust in producer-supplied metadata or lower-security fallback; all accepted settings have scoped soundness review.","evidence":"Identity/parameter matrix; rejection traces; cryptographic review.","priority":"BLOCKER","profile":"P01; P09","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[16,20,24,25,36,37],"gate":"Technical readiness / G5","owner":"Proving + protocol leads; independent cryptography review","manual_page":39,"owner_lane":"enforced-proving lane (a6e8f84588b809d62)","run_status":"NOT RUN","evidence_path":"build-2:/home/build/enforced-fixtures/floor-240-expect-refuse.json","run_id":"enforced-proving-20261008-01","updated":"2026-10-08T19:03:30.171Z","evidence_record":{"cell":"harness:proving-enforcement","manifest_sha":"417c4a57","coverage":{"ZKP-01":"partial: the seven refusals as named tests (no proof never inserted; a wrong proof and another program id invalidate the block; the honest record paid once) and the fast-time crossing with a modified producer; the genuine-proof positive control through ordinary network paths is the testnet's live read, not run here","ZKP-02":"partial: the pinned-id refusal on a real proof, the daemon's start refusal, key succession (the epochs, the accepted ids, a verdict counting only where its pair is accepted, the seven refusals on both sides of the height, the start refusal under a succession, the real-proof refusal of a pair the epoch does not accept) and the fast-time crossing of a scheduled succession with a real proof under each pair; the downgrade through an old node path is not run","ZKP-03":"partial: the chain binding (a record signed for another network), the replay, a wrong block, a wrong shard, a stale record outside the window; the fork and replayed-sync steps are not run","ZKP-04":"partial: an altered payout address (after signing and re-signed), a statement over altered rewards or payouts vetoed natively, the inputs commitment of P22 stage 1 (shard 0 and the aggregator carry the commitment the node recomputes) and the derivation commitment of stage 2 (the payouts derived in the guest from the carried records); the rewards' proved derivation is P22 stage 3, PENDING","ZKP-05":"partial: a duplicate of a paid record pays nothing and the honest record pays once; the race, reorder and crash-recover steps are not run","ZKP-08":"partial: the body rule and the payment rule read one floor, a producer with its body rule off still pays nothing on honest nodes (the fast-time crossing); the replacement-prover and authority steps are not run; the proof side of the derivation is P22 stage 3, PENDING","EVM-08":"partial: the controlled verifier upgrade as a key succession (both pairs embedded, the window, the start refusal) and its fast-time crossing; the mixed-client crossing on the live network and the failed-distribution step are not run"},"at":"2026-10-08T19:03:30.171Z","method":"SP1","requirement_id":"ZKP-02","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"417c4a57","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"dependency":"the mixed-pair crossing needs the node lane's first pin into elf/prior/ (key-succession-pin, tonight by 21:00) and the next-pair proof (build-2:/home/build/enforced-fixtures/next-pair-block-56-shard-0-compressed.bin)","in_progress_since":"2026-10-08T19:03:30.171Z","approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null},"evidence_records":{"harness:proving-enforcement":{"cell":"harness:proving-enforcement","manifest_sha":"417c4a57","coverage":{"ZKP-01":"partial: the seven refusals as named tests (no proof never inserted; a wrong proof and another program id invalidate the block; the honest record paid once) and the fast-time crossing with a modified producer; the genuine-proof positive control through ordinary network paths is the testnet's live read, not run here","ZKP-02":"partial: the pinned-id refusal on a real proof, the daemon's start refusal, key succession (the epochs, the accepted ids, a verdict counting only where its pair is accepted, the seven refusals on both sides of the height, the start refusal under a succession, the real-proof refusal of a pair the epoch does not accept) and the fast-time crossing of a scheduled succession with a real proof under each pair; the downgrade through an old node path is not run","ZKP-03":"partial: the chain binding (a record signed for another network), the replay, a wrong block, a wrong shard, a stale record outside the window; the fork and replayed-sync steps are not run","ZKP-04":"partial: an altered payout address (after signing and re-signed), a statement over altered rewards or payouts vetoed natively, the inputs commitment of P22 stage 1 (shard 0 and the aggregator carry the commitment the node recomputes) and the derivation commitment of stage 2 (the payouts derived in the guest from the carried records); the rewards' proved derivation is P22 stage 3, PENDING","ZKP-05":"partial: a duplicate of a paid record pays nothing and the honest record pays once; the race, reorder and crash-recover steps are not run","ZKP-08":"partial: the body rule and the payment rule read one floor, a producer with its body rule off still pays nothing on honest nodes (the fast-time crossing); the replacement-prover and authority steps are not run; the proof side of the derivation is P22 stage 3, PENDING","EVM-08":"partial: the controlled verifier upgrade as a key succession (both pairs embedded, the window, the start refusal) and its fast-time crossing; the mixed-client crossing on the live network and the failed-distribution step are not run"},"at":"2026-10-08T19:03:30.171Z","method":"SP1","requirement_id":"ZKP-02","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"417c4a57","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"run_id":"enforced-proving-20261008-01","evidence":"build-2:/home/build/enforced-fixtures/floor-240-expect-refuse.json","in_progress":true}}},{"id":"ZKP-03","title":"Bind network, epoch, job and state roots","setup":"Prepare valid proofs for distinct chains, epochs, jobs and initial/final states.","steps":["Replay each proof under another network, job, epoch, shard range or state commitment.","Alter public inputs while retaining the proof and test valid-but-wrong-context statements.","Check duplicated and reordered records across forks and replayed sync data."],"accept":"Every misbound proof is rejected; valid authorised replays follow only explicitly allowed semantics and never create extra rewards. Native reexecution cannot conceal missing proof-context binding.","evidence":"Binding matrix; public-input hashes; replay traces; reward reconciliation.","priority":"BLOCKER","profile":"P01","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[16,20,24,25,36,37],"gate":"Technical readiness / G5","owner":"Proving + protocol leads; independent cryptography review","manual_page":39,"owner_lane":"enforced-proving lane (a6e8f84588b809d62)","run_status":"NOT RUN","evidence_path":"build-1:/srv/artefacts/tas/201-7cfa422a-aa0e0f45/node-7cfa422a/box4-exec.log","run_id":"201-7cfa422a-aa0e0f45","updated":"2026-10-08T19:32:50.856Z","evidence_record":{"cell":"suite:exec","manifest_sha":"7cfa422a","coverage":{"ZKP-01":"partial: a real proof verifies, a wrong statement and garbage are refused (nativeverify)","ZKP-03":"partial: a snapshot under another digest refused, the epoch streams bound to the digest","OPS-04":"partial: snapshot install, replay and genesis recapture after a crash","EVM-02":"partial: the replay tests on the day stream; the signature and chain-id binding vectors are an EVM harness still to map"},"at":"2026-10-08T19:32:50.856Z","method":"native","requirement_id":"ZKP-03","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"7cfa422a","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"in_progress_since":"2026-10-08T19:32:50.856Z","approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null},"evidence_records":{"suite:exec":{"cell":"suite:exec","manifest_sha":"7cfa422a","coverage":{"ZKP-01":"partial: a real proof verifies, a wrong statement and garbage are refused (nativeverify)","ZKP-03":"partial: a snapshot under another digest refused, the epoch streams bound to the digest","OPS-04":"partial: snapshot install, replay and genesis recapture after a crash","EVM-02":"partial: the replay tests on the day stream; the signature and chain-id binding vectors are an EVM harness still to map"},"at":"2026-10-08T19:32:50.856Z","method":"native","requirement_id":"ZKP-03","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"7cfa422a","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"run_id":"201-7cfa422a-aa0e0f45","evidence":"build-1:/srv/artefacts/tas/201-7cfa422a-aa0e0f45/node-7cfa422a/box4-exec.log","in_progress":true}}},{"id":"ZKP-04","title":"Prevent reward and payout substitution","setup":"Use proofs that commit to authorisation and all reward-relevant fields required by F0.","steps":["Alter payout key, amount, beneficiary, source work or fee allocation independently.","Supply correct execution over malicious producer-provided consensus/reward inputs.","Compare consensus-derived rewards with the proved/publicly authenticated derivation."],"accept":"Unauthorised payout changes and incorrect consensus inputs are rejected; no statement accepted merely because execution over supplied inputs is internally correct. Legitimate authorisations are preserved.","evidence":"Mutation cases; reward derivation trace; signature/proof binding review.","priority":"BLOCKER","profile":"P01","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[16,20,24,25,36,37],"gate":"Technical readiness / G5","owner":"Proving + protocol leads; independent cryptography review","manual_page":40,"owner_lane":"enforced-proving lane (a6e8f84588b809d62)","run_status":"NOT RUN","evidence_path":"build-2:/home/build/enforced-fixtures/floor-240-expect-refuse.json","run_id":"enforced-proving-20261008-01","updated":"2026-10-08T19:03:30.171Z","evidence_record":{"cell":"harness:proving-enforcement","manifest_sha":"417c4a57","coverage":{"ZKP-01":"partial: the seven refusals as named tests (no proof never inserted; a wrong proof and another program id invalidate the block; the honest record paid once) and the fast-time crossing with a modified producer; the genuine-proof positive control through ordinary network paths is the testnet's live read, not run here","ZKP-02":"partial: the pinned-id refusal on a real proof, the daemon's start refusal, key succession (the epochs, the accepted ids, a verdict counting only where its pair is accepted, the seven refusals on both sides of the height, the start refusal under a succession, the real-proof refusal of a pair the epoch does not accept) and the fast-time crossing of a scheduled succession with a real proof under each pair; the downgrade through an old node path is not run","ZKP-03":"partial: the chain binding (a record signed for another network), the replay, a wrong block, a wrong shard, a stale record outside the window; the fork and replayed-sync steps are not run","ZKP-04":"partial: an altered payout address (after signing and re-signed), a statement over altered rewards or payouts vetoed natively, the inputs commitment of P22 stage 1 (shard 0 and the aggregator carry the commitment the node recomputes) and the derivation commitment of stage 2 (the payouts derived in the guest from the carried records); the rewards' proved derivation is P22 stage 3, PENDING","ZKP-05":"partial: a duplicate of a paid record pays nothing and the honest record pays once; the race, reorder and crash-recover steps are not run","ZKP-08":"partial: the body rule and the payment rule read one floor, a producer with its body rule off still pays nothing on honest nodes (the fast-time crossing); the replacement-prover and authority steps are not run; the proof side of the derivation is P22 stage 3, PENDING","EVM-08":"partial: the controlled verifier upgrade as a key succession (both pairs embedded, the window, the start refusal) and its fast-time crossing; the mixed-client crossing on the live network and the failed-distribution step are not run"},"at":"2026-10-08T19:03:30.171Z","method":"SP1","requirement_id":"ZKP-04","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"417c4a57","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"dependency":"the proof side of the derivation (P22 stages 1 to 3) changes both guests' public values and so both program ids, so it ships only through a key succession (docs/design/key-succession.md, key-succession-node 291ee6ae); stage 1 (the inputs commitment carried by shard 0 and the aggregator, vetoed natively) is on branch p22-stage-1 under test since 18:46 UK; the clocks (stage 1 09:00, stage 2 14:00, stage 3's design 18:00 UK on 9 October 2026) stand because the succession's first height is asked of main by 22:00 under the floor rule; without a named height the stages are built and tested on their branch and wait for the succession that carries them","in_progress_since":"2026-10-08T19:03:30.171Z","approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null},"evidence_records":{"harness:proving-enforcement":{"cell":"harness:proving-enforcement","manifest_sha":"417c4a57","coverage":{"ZKP-01":"partial: the seven refusals as named tests (no proof never inserted; a wrong proof and another program id invalidate the block; the honest record paid once) and the fast-time crossing with a modified producer; the genuine-proof positive control through ordinary network paths is the testnet's live read, not run here","ZKP-02":"partial: the pinned-id refusal on a real proof, the daemon's start refusal, key succession (the epochs, the accepted ids, a verdict counting only where its pair is accepted, the seven refusals on both sides of the height, the start refusal under a succession, the real-proof refusal of a pair the epoch does not accept) and the fast-time crossing of a scheduled succession with a real proof under each pair; the downgrade through an old node path is not run","ZKP-03":"partial: the chain binding (a record signed for another network), the replay, a wrong block, a wrong shard, a stale record outside the window; the fork and replayed-sync steps are not run","ZKP-04":"partial: an altered payout address (after signing and re-signed), a statement over altered rewards or payouts vetoed natively, the inputs commitment of P22 stage 1 (shard 0 and the aggregator carry the commitment the node recomputes) and the derivation commitment of stage 2 (the payouts derived in the guest from the carried records); the rewards' proved derivation is P22 stage 3, PENDING","ZKP-05":"partial: a duplicate of a paid record pays nothing and the honest record pays once; the race, reorder and crash-recover steps are not run","ZKP-08":"partial: the body rule and the payment rule read one floor, a producer with its body rule off still pays nothing on honest nodes (the fast-time crossing); the replacement-prover and authority steps are not run; the proof side of the derivation is P22 stage 3, PENDING","EVM-08":"partial: the controlled verifier upgrade as a key succession (both pairs embedded, the window, the start refusal) and its fast-time crossing; the mixed-client crossing on the live network and the failed-distribution step are not run"},"at":"2026-10-08T19:03:30.171Z","method":"SP1","requirement_id":"ZKP-04","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"417c4a57","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"run_id":"enforced-proving-20261008-01","evidence":"build-2:/home/build/enforced-fixtures/floor-240-expect-refuse.json","in_progress":true}}},{"id":"ZKP-05","title":"Make proof payment idempotent across races","setup":"Use competing provers submitting valid results for the same work and simulate retries/reorganisations.","steps":["Submit simultaneous duplicates, reordered receipts and repeated messages after disconnects.","Crash validators between validation and reward application, then recover.","Reconcile canonical payouts against the exact F0 duplicate policy."],"accept":"Only the authorised total payment is made; no double payout, lost accepted entitlement or fork-retained balance. Transactions and payout records recover atomically.","evidence":"Concurrency schedule; canonical payment ledger; crash/recovery evidence.","priority":"BLOCKER","profile":"P01","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[16,20,24,25,36,37],"gate":"Technical readiness / G5","owner":"Proving + protocol leads; independent cryptography review","manual_page":40,"owner_lane":"enforced-proving lane (a6e8f84588b809d62)","run_status":"NOT RUN","evidence_path":"build-2:/home/build/enforced-fixtures/floor-240-expect-refuse.json","run_id":"enforced-proving-20261008-01","updated":"2026-10-08T19:03:30.171Z","evidence_record":{"cell":"harness:proving-enforcement","manifest_sha":"417c4a57","coverage":{"ZKP-01":"partial: the seven refusals as named tests (no proof never inserted; a wrong proof and another program id invalidate the block; the honest record paid once) and the fast-time crossing with a modified producer; the genuine-proof positive control through ordinary network paths is the testnet's live read, not run here","ZKP-02":"partial: the pinned-id refusal on a real proof, the daemon's start refusal, key succession (the epochs, the accepted ids, a verdict counting only where its pair is accepted, the seven refusals on both sides of the height, the start refusal under a succession, the real-proof refusal of a pair the epoch does not accept) and the fast-time crossing of a scheduled succession with a real proof under each pair; the downgrade through an old node path is not run","ZKP-03":"partial: the chain binding (a record signed for another network), the replay, a wrong block, a wrong shard, a stale record outside the window; the fork and replayed-sync steps are not run","ZKP-04":"partial: an altered payout address (after signing and re-signed), a statement over altered rewards or payouts vetoed natively, the inputs commitment of P22 stage 1 (shard 0 and the aggregator carry the commitment the node recomputes) and the derivation commitment of stage 2 (the payouts derived in the guest from the carried records); the rewards' proved derivation is P22 stage 3, PENDING","ZKP-05":"partial: a duplicate of a paid record pays nothing and the honest record pays once; the race, reorder and crash-recover steps are not run","ZKP-08":"partial: the body rule and the payment rule read one floor, a producer with its body rule off still pays nothing on honest nodes (the fast-time crossing); the replacement-prover and authority steps are not run; the proof side of the derivation is P22 stage 3, PENDING","EVM-08":"partial: the controlled verifier upgrade as a key succession (both pairs embedded, the window, the start refusal) and its fast-time crossing; the mixed-client crossing on the live network and the failed-distribution step are not run"},"at":"2026-10-08T19:03:30.171Z","method":"SP1","requirement_id":"ZKP-05","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"417c4a57","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"in_progress_since":"2026-10-08T19:03:30.171Z","approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null},"evidence_records":{"harness:proving-enforcement":{"cell":"harness:proving-enforcement","manifest_sha":"417c4a57","coverage":{"ZKP-01":"partial: the seven refusals as named tests (no proof never inserted; a wrong proof and another program id invalidate the block; the honest record paid once) and the fast-time crossing with a modified producer; the genuine-proof positive control through ordinary network paths is the testnet's live read, not run here","ZKP-02":"partial: the pinned-id refusal on a real proof, the daemon's start refusal, key succession (the epochs, the accepted ids, a verdict counting only where its pair is accepted, the seven refusals on both sides of the height, the start refusal under a succession, the real-proof refusal of a pair the epoch does not accept) and the fast-time crossing of a scheduled succession with a real proof under each pair; the downgrade through an old node path is not run","ZKP-03":"partial: the chain binding (a record signed for another network), the replay, a wrong block, a wrong shard, a stale record outside the window; the fork and replayed-sync steps are not run","ZKP-04":"partial: an altered payout address (after signing and re-signed), a statement over altered rewards or payouts vetoed natively, the inputs commitment of P22 stage 1 (shard 0 and the aggregator carry the commitment the node recomputes) and the derivation commitment of stage 2 (the payouts derived in the guest from the carried records); the rewards' proved derivation is P22 stage 3, PENDING","ZKP-05":"partial: a duplicate of a paid record pays nothing and the honest record pays once; the race, reorder and crash-recover steps are not run","ZKP-08":"partial: the body rule and the payment rule read one floor, a producer with its body rule off still pays nothing on honest nodes (the fast-time crossing); the replacement-prover and authority steps are not run; the proof side of the derivation is P22 stage 3, PENDING","EVM-08":"partial: the controlled verifier upgrade as a key succession (both pairs embedded, the window, the start refusal) and its fast-time crossing; the mixed-client crossing on the live network and the failed-distribution step are not run"},"at":"2026-10-08T19:03:30.171Z","method":"SP1","requirement_id":"ZKP-05","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"417c4a57","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"run_id":"enforced-proving-20261008-01","evidence":"build-2:/home/build/enforced-fixtures/floor-240-expect-refuse.json","in_progress":true}}},{"id":"ZKP-06","title":"Verify aggregation coverage and completeness","setup":"Build valid multi-shard workloads plus omitted, duplicated, overlapping and misordered shard sets.","steps":["Attempt an aggregate with a correct outer proof but wrong coverage/public-input construction.","Alter shard ranges, roots and aggregation-program identity.","Verify native execution, aggregate validity and coverage commitments independently."],"accept":"Only complete, correctly ordered authorised coverage is accepted. No valid proof of the wrong computation becomes an accepted chain result; aggregation failures do not fabricate successful delivery.","evidence":"Coverage corpus; aggregate/public-input verification; rejection ledger.","priority":"BLOCKER","profile":"P01; P09","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[16,20,24,25,36,37],"gate":"Technical readiness / G5","owner":"Proving + protocol leads; independent cryptography review","manual_page":40,"owner_lane":"enforced-proving lane (a6e8f84588b809d62)","run_status":"NOT RUN","evidence_path":"build-1:/srv/artefacts/tas/201-7cfa422a-aa0e0f45/node-7cfa422a/box4-p2p-flows.log","run_id":"201-7cfa422a-aa0e0f45","updated":"2026-10-08T19:32:50.856Z","evidence_record":{"cell":"suite:p2p-flows","manifest_sha":"7cfa422a","coverage":{"OPS-06":"partial: malformed relay messages refused; traffic containment under load is an OPS harness","ZKP-06":"partial: proof relay coverage tests; aggregation completeness is the proving lane's test set"},"at":"2026-10-08T19:32:50.856Z","method":"native","requirement_id":"ZKP-06","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"7cfa422a","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"in_progress_since":"2026-10-08T19:32:50.856Z","approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null},"evidence_records":{"suite:p2p-flows":{"cell":"suite:p2p-flows","manifest_sha":"7cfa422a","coverage":{"OPS-06":"partial: malformed relay messages refused; traffic containment under load is an OPS harness","ZKP-06":"partial: proof relay coverage tests; aggregation completeness is the proving lane's test set"},"at":"2026-10-08T19:32:50.856Z","method":"native","requirement_id":"ZKP-06","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"7cfa422a","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"run_id":"201-7cfa422a-aa0e0f45","evidence":"build-1:/srv/artefacts/tas/201-7cfa422a-aa0e0f45/node-7cfa422a/box4-p2p-flows.log","in_progress":true}}},{"id":"ZKP-07","title":"Review soundness and verifier resource limits","setup":"Provide proof-system code, parameters, patches and the pinned verification path to an independent specialist.","steps":["Review soundness assumptions, parameter margins and consequences of performance patches.","Fuzz deserialization and adversarial proofs; measure verification CPU and memory under load.","Cross-check an independent verifier or reference path and test crash containment."],"accept":"P09 review and resource requirements pass with no unresolved critical/high finding. Random proof rejection counts are not described as evidence of a particular cryptographic security level.","evidence":"Scoped soundness review; parameter sheet; fuzzer corpus; verifier profiles.","priority":"BLOCKER","profile":"P01; P09","cadence":"Release candidate; repeat after relevant changes","method":"Independent cryptographic review + testing","status":"NOT RUN","source":[16,20,24,25,36,37],"gate":"Technical readiness / G5","owner":"Proving + protocol leads; independent cryptography review","manual_page":41,"owner_lane":"enforced-proving lane (a6e8f84588b809d62)","run_status":"NOT RUN","evidence_path":"","run_id":"","updated":"2026-10-08 18:3x UK","approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null}},{"id":"ZKP-08","title":"Preserve authority and audit all acceptance paths","setup":"Inspect block import, sync, RPC, light verification, database restoration and fast paths.","steps":["Try bypassing validation via each path with a proof rejected by the normal path.","Remove the dominant prover/aggregator and have independent replacements process available inputs.","Attempt to use proof-production status as ordering, voting or finality authority."],"accept":"No bypass accepts invalid work; proofs alone confer no unauthorised consensus control. Replacement and pause behaviour meet F0/P07/P08 without privileged keys or a trusted aggregator shortcut.","evidence":"Path coverage report; bypass corpus; replacement run; authority checks.","priority":"BLOCKER","profile":"P01; P07; P08","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[16,20,24,25,36,37],"gate":"Technical readiness / G5","owner":"Proving + protocol leads; independent cryptography review","manual_page":41,"owner_lane":"enforced-proving lane (a6e8f84588b809d62)","run_status":"NOT RUN","evidence_path":"build-2:/home/build/enforced-fixtures/floor-240-expect-refuse.json","run_id":"enforced-proving-20261008-01","updated":"2026-10-08T19:03:30.171Z","evidence_record":{"cell":"harness:proving-enforcement","manifest_sha":"417c4a57","coverage":{"ZKP-01":"partial: the seven refusals as named tests (no proof never inserted; a wrong proof and another program id invalidate the block; the honest record paid once) and the fast-time crossing with a modified producer; the genuine-proof positive control through ordinary network paths is the testnet's live read, not run here","ZKP-02":"partial: the pinned-id refusal on a real proof, the daemon's start refusal, key succession (the epochs, the accepted ids, a verdict counting only where its pair is accepted, the seven refusals on both sides of the height, the start refusal under a succession, the real-proof refusal of a pair the epoch does not accept) and the fast-time crossing of a scheduled succession with a real proof under each pair; the downgrade through an old node path is not run","ZKP-03":"partial: the chain binding (a record signed for another network), the replay, a wrong block, a wrong shard, a stale record outside the window; the fork and replayed-sync steps are not run","ZKP-04":"partial: an altered payout address (after signing and re-signed), a statement over altered rewards or payouts vetoed natively, the inputs commitment of P22 stage 1 (shard 0 and the aggregator carry the commitment the node recomputes) and the derivation commitment of stage 2 (the payouts derived in the guest from the carried records); the rewards' proved derivation is P22 stage 3, PENDING","ZKP-05":"partial: a duplicate of a paid record pays nothing and the honest record pays once; the race, reorder and crash-recover steps are not run","ZKP-08":"partial: the body rule and the payment rule read one floor, a producer with its body rule off still pays nothing on honest nodes (the fast-time crossing); the replacement-prover and authority steps are not run; the proof side of the derivation is P22 stage 3, PENDING","EVM-08":"partial: the controlled verifier upgrade as a key succession (both pairs embedded, the window, the start refusal) and its fast-time crossing; the mixed-client crossing on the live network and the failed-distribution step are not run"},"at":"2026-10-08T19:03:30.171Z","method":"SP1","requirement_id":"ZKP-08","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"417c4a57","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"dependency":"the proof side of the derivation (P22 stages 1 to 3) changes both guests' public values and so both program ids, so it ships only through a key succession (docs/design/key-succession.md, key-succession-node 291ee6ae); stage 1 (the inputs commitment carried by shard 0 and the aggregator, vetoed natively) is on branch p22-stage-1 under test since 18:46 UK; the clocks (stage 1 09:00, stage 2 14:00, stage 3's design 18:00 UK on 9 October 2026) stand because the succession's first height is asked of main by 22:00 under the floor rule; without a named height the stages are built and tested on their branch and wait for the succession that carries them","in_progress_since":"2026-10-08T19:03:30.171Z","approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null},"evidence_records":{"harness:proving-enforcement":{"cell":"harness:proving-enforcement","manifest_sha":"417c4a57","coverage":{"ZKP-01":"partial: the seven refusals as named tests (no proof never inserted; a wrong proof and another program id invalidate the block; the honest record paid once) and the fast-time crossing with a modified producer; the genuine-proof positive control through ordinary network paths is the testnet's live read, not run here","ZKP-02":"partial: the pinned-id refusal on a real proof, the daemon's start refusal, key succession (the epochs, the accepted ids, a verdict counting only where its pair is accepted, the seven refusals on both sides of the height, the start refusal under a succession, the real-proof refusal of a pair the epoch does not accept) and the fast-time crossing of a scheduled succession with a real proof under each pair; the downgrade through an old node path is not run","ZKP-03":"partial: the chain binding (a record signed for another network), the replay, a wrong block, a wrong shard, a stale record outside the window; the fork and replayed-sync steps are not run","ZKP-04":"partial: an altered payout address (after signing and re-signed), a statement over altered rewards or payouts vetoed natively, the inputs commitment of P22 stage 1 (shard 0 and the aggregator carry the commitment the node recomputes) and the derivation commitment of stage 2 (the payouts derived in the guest from the carried records); the rewards' proved derivation is P22 stage 3, PENDING","ZKP-05":"partial: a duplicate of a paid record pays nothing and the honest record pays once; the race, reorder and crash-recover steps are not run","ZKP-08":"partial: the body rule and the payment rule read one floor, a producer with its body rule off still pays nothing on honest nodes (the fast-time crossing); the replacement-prover and authority steps are not run; the proof side of the derivation is P22 stage 3, PENDING","EVM-08":"partial: the controlled verifier upgrade as a key succession (both pairs embedded, the window, the start refusal) and its fast-time crossing; the mixed-client crossing on the live network and the failed-distribution step are not run"},"at":"2026-10-08T19:03:30.171Z","method":"SP1","requirement_id":"ZKP-08","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"417c4a57","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"run_id":"enforced-proving-20261008-01","evidence":"build-2:/home/build/enforced-fixtures/floor-240-expect-refuse.json","in_progress":true}}}]},{"code":"CAP","title":"Sustained proving and delivery","source":[17,18,24,25],"gate":"Technical readiness / commercial track","owner":"Proving lead + independent operators","fixtures":"F3 meaningful workload catalogue; F4 network; F8 external job harness","summary":"A correct fast shard is only one stage; capacity, latency, payment and retries must work together.","tests":[{"id":"CAP-01","title":"Reproduce the historical consumer-shard result","setup":"Recover the exact source-era workload/build if available; keep it separate from the release-candidate workload.","steps":["Attempt independent reproduction of the 4,717,439-cycle workload and reported 3060/4060/4070 results.","Record proof format, memory, energy, host and whether aggregation/compression are included.","Repeat on the final release and label all configuration changes."],"accept":"Historical figures are either reproduced within P02 tolerance or corrected/labelled non-reproduced. Release acceptance uses the current complete workload, never an unmatched historical time or a smaller substituted shard.","evidence":"Historical/current manifests; proof verification; timing and memory records.","priority":"GATE","profile":"P02; P07","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[17,18,24,25],"gate":"Technical readiness / commercial track","owner":"Proving lead + independent operators","manual_page":42,"owner_lane":"fleet lane (ac055d60427caab99)","run_status":"NOT RUN","evidence_path":"","run_id":"","updated":"2026-10-08T19:22:31.798Z","evidence_record":{"reason":"the consumer-shard reproduction is the fleet lane's pods","at":"2026-10-08T19:22:31.798Z","method":"static","requirement_id":"CAP-01","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null},"evidence_records":{"record":{"reason":"the consumer-shard reproduction is the fleet lane's pods","at":"2026-10-08T19:22:31.798Z","method":"static","requirement_id":"CAP-01","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"run_id":"","evidence":"","in_progress":false}}},{"id":"CAP-02","title":"Prove on the actual mining configuration","setup":"Use final dataset sizes, registers, clocks, drivers and proof pipeline on every advertised proving tier.","steps":["Run mining alone, proving alone, concurrent execution and supported time-sharing.","Measure wall energy, memory headroom, reloads, proof latency and forgone accepted mining work.","Induce memory pressure and GPU task failure without losing wallet control."],"accept":"Every advertised mode completes correctly and meets P06/P07. Net output includes opportunity cost; unsupported concurrency is not claimed. Mining-only vendor support remains separately labelled.","evidence":"Four-mode results; OOM/failure logs; memory and opportunity-cost ledger.","priority":"BLOCKER","profile":"P01; P06; P07","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[17,18,24,25],"gate":"Technical readiness / commercial track","owner":"Proving lead + independent operators","manual_page":42,"owner_lane":"fleet lane (ac055d60427caab99)","run_status":"NOT RUN","evidence_path":"","run_id":"","updated":"2026-10-08T19:22:31.798Z","evidence_record":{"reason":"proving on the mining configuration is the fleet lane's","at":"2026-10-08T19:22:31.798Z","method":"static","requirement_id":"CAP-02","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null},"evidence_records":{"record":{"reason":"proving on the mining configuration is the fleet lane's","at":"2026-10-08T19:22:31.798Z","method":"static","requirement_id":"CAP-02","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"run_id":"","evidence":"","in_progress":false}}},{"id":"CAP-03","title":"Measure the entire request-to-payment path","setup":"Assign a unique job ID and immutable timestamps to every stage of F3/F8 jobs.","steps":["Record request, input availability, assignment, execution, shard proof, aggregation, verification, delivery and payment.","Compare monotonic elapsed time with any protocol/DAA clock and document their relationship.","Reconcile failed, censored, retried and abandoned jobs with the original request denominator."],"accept":"No hidden stage or missing job; latency distributions and cost cover the complete path. Delivery, finality and payment are reported separately; protocol seconds are not silently relabelled wall-clock seconds.","evidence":"Stage event ledger; clock calibration; end-to-end latency/cost report.","priority":"GATE","profile":"P07","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[17,18,24,25],"gate":"Technical readiness / commercial track","owner":"Proving lead + independent operators","manual_page":42,"owner_lane":"fleet lane (ac055d60427caab99)","run_status":"NOT RUN","evidence_path":"","run_id":"","updated":"2026-10-08T19:22:31.798Z","evidence_record":{"reason":"the request-to-payment path is the proving fleet's measurement","at":"2026-10-08T19:22:31.798Z","method":"static","requirement_id":"CAP-03","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null},"evidence_records":{"record":{"reason":"the request-to-payment path is the proving fleet's measurement","at":"2026-10-08T19:22:31.798Z","method":"static","requirement_id":"CAP-03","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"run_id":"","evidence":"","in_progress":false}}},{"id":"CAP-04","title":"Sustain meaningful load without queue growth","setup":"Freeze W: payload mix, input sizes, execution work and per-hour demand; prohibit tiny-workload substitution.","steps":["Run 72 hours at W and a separate 24 hours at 1.2W on the declared fleet.","Measure arrival/completion counts, backlog trend, oldest-job age, deadlines and all retries.","Use held-out workloads and an independent observer to detect discarded or delayed requests."],"accept":"P07 completion, tail-latency and bounded-backlog criteria hold. Capacity is stated for the tested W/fleet, not as universal TPS. A queue that grows indefinitely or shrinks through silent loss fails.","evidence":"Request/completion reconciliation; backlog series; held-out results; observer report.","priority":"GATE","profile":"P07","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[17,18,24,25],"gate":"Technical readiness / commercial track","owner":"Proving lead + independent operators","manual_page":43,"owner_lane":"fleet lane (ac055d60427caab99)","run_status":"NOT RUN","evidence_path":"","run_id":"","updated":"2026-10-08T19:22:31.798Z","evidence_record":{"reason":"sustained load is the proving fleet's","at":"2026-10-08T19:22:31.798Z","method":"static","requirement_id":"CAP-04","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null},"evidence_records":{"record":{"reason":"sustained load is the proving fleet's","at":"2026-10-08T19:22:31.798Z","method":"static","requirement_id":"CAP-04","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"run_id":"","evidence":"","in_progress":false}}},{"id":"CAP-05","title":"Overload and recover without false acceptance","setup":"Start at W and inject 2W for 15 minutes with valid and invalid jobs, then return to W.","steps":["Observe admission, explicit backpressure, reservations and deadline estimates.","Track accepted jobs to valid completion or the pre-agreed failure/refund outcome.","Measure recovery time and ensure ordinary users are not silently starved."],"accept":"P07 overload policy and recovery limits hold; no accepted job vanishes or earns an invalid reward. Rejected demand is reported separately from delivery success, preventing denominator manipulation.","evidence":"Overload timeline; admission/refund logs; backlog-drain proof.","priority":"BLOCKER","profile":"P01; P07","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[17,18,24,25],"gate":"Technical readiness / commercial track","owner":"Proving lead + independent operators","manual_page":43,"owner_lane":"fleet lane (ac055d60427caab99)","run_status":"NOT RUN","evidence_path":"","run_id":"","updated":"2026-10-08T19:22:31.798Z","evidence_record":{"reason":"overload and recovery is the proving fleet's","at":"2026-10-08T19:22:31.798Z","method":"static","requirement_id":"CAP-05","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null},"evidence_records":{"record":{"reason":"overload and recovery is the proving fleet's","at":"2026-10-08T19:22:31.798Z","method":"static","requirement_id":"CAP-05","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"run_id":"","evidence":"","in_progress":false}}},{"id":"CAP-06","title":"Calibrate assignment windows to paid completion","setup":"Use a heterogeneous proving fleet, including the slowest advertised consumer tier.","steps":["Measure actual completion distributions with network delay, competing load and failed attempts.","Test the chosen exclusive window, open claiming and faster challengers after expiry.","Compare assignment frequency, paid completions and wasted work by tier."],"accept":"P07 fairness and wasted-work limits hold for advertised tiers. A provisional 10-DAA-second window is not treated as approved. Fair assignment counts alone cannot pass; payment outcomes and operator margins matter.","evidence":"Window sweep; paid-completion distribution; wasted-work and margin report.","priority":"GATE","profile":"P07; P12","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[17,18,24,25],"gate":"Technical readiness / commercial track","owner":"Proving lead + independent operators","manual_page":43,"owner_lane":"fleet lane (ac055d60427caab99)","run_status":"NOT RUN","evidence_path":"","run_id":"","updated":"2026-10-08T19:22:31.798Z","evidence_record":{"reason":"assignment windows are the proving fleet's","at":"2026-10-08T19:22:31.798Z","method":"static","requirement_id":"CAP-06","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null},"evidence_records":{"record":{"reason":"assignment windows are the proving fleet's","at":"2026-10-08T19:22:31.798Z","method":"static","requirement_id":"CAP-06","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"run_id":"","evidence":"","in_progress":false}}},{"id":"CAP-07","title":"Reassign work when inputs or providers disappear","setup":"Remove input providers, assigned provers and the dominant aggregator independently and together.","steps":["Have replacement operators retrieve authenticated inputs without founder files.","Retry expired assignments while preserving idempotent reward and customer outcomes.","Restore providers and test late submissions racing with replacements."],"accept":"P07/P08 replacement deadlines hold when availability assumptions permit. Otherwise a truthful bounded pause/refund occurs; no fake proof, double payment or hidden privileged input source is used.","evidence":"Failure schedule; input hashes; reassignment and payout ledger; recovery trace.","priority":"BLOCKER","profile":"P01; P07; P08","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[17,18,24,25],"gate":"Technical readiness / commercial track","owner":"Proving lead + independent operators","manual_page":44,"owner_lane":"fleet lane (ac055d60427caab99)","run_status":"NOT RUN","evidence_path":"","run_id":"","updated":"2026-10-08T19:22:31.798Z","evidence_record":{"reason":"reassignment is the proving fleet's","at":"2026-10-08T19:22:31.798Z","method":"static","requirement_id":"CAP-07","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null},"evidence_records":{"record":{"reason":"reassignment is the proving fleet's","at":"2026-10-08T19:22:31.798Z","method":"static","requirement_id":"CAP-07","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"run_id":"","evidence":"","in_progress":false}}},{"id":"CAP-08","title":"Deliver customer-verifiable output at scale","setup":"Run the external workload using a customer-controlled verifier and independently operated workers.","steps":["Verify every delivered proof against the contracted program and input commitment.","Reject wrong-format, stale and partial deliveries; test customer retry and delivery failure.","Reconcile delivery, acceptance, payment and refund records without exposing private inputs publicly."],"accept":"P07 delivery performance and exact validity hold. Payment depends on the contracted correct result; a valid proof for the wrong job is not a successful delivery.","evidence":"Customer verification log; proof-format contract; settlement reconciliation.","priority":"BLOCKER","profile":"P01; P07; P14","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[17,18,24,25],"gate":"Technical readiness / commercial track","owner":"Proving lead + independent operators","manual_page":44,"owner_lane":"fleet lane (ac055d60427caab99)","run_status":"NOT RUN","evidence_path":"","run_id":"","updated":"2026-10-08T19:22:31.798Z","evidence_record":{"reason":"customer-verifiable output is the reference apps plus the fleet","at":"2026-10-08T19:22:31.798Z","method":"static","requirement_id":"CAP-08","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null},"evidence_records":{"record":{"reason":"customer-verifiable output is the reference apps plus the fleet","at":"2026-10-08T19:22:31.798Z","method":"static","requirement_id":"CAP-08","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"run_id":"","evidence":"","in_progress":false}}}]},{"code":"INC","title":"Rewards, incentives and selfish operators","source":[13,16,17,18,24,26],"gate":"G4 / G5","owner":"Protocol economics + proving leads","fixtures":"F0 fee/reward rules; F4 adversarial operators; F7 incentive models","summary":"Assume operators optimise their own returns. Do not depend on the official client choosing a less profitable task.","tests":[{"id":"INC-01","title":"Reconcile issuance, fees, burns and recipients","setup":"Use a deterministic short chain containing all reward types, fee paths and rounding cases.","steps":["Calculate balances, total supply changes, burns and distributions independently.","Execute identical blocks natively and through the proving path.","Test zero, minimum, maximum and transition-boundary values plus malformed producer accounting."],"accept":"Conservation and recipient rules match F0 exactly; no inflation, rounding leakage or duplicate reward. Fee-table and prose discrepancies are resolved before the run, not guessed by the tester.","evidence":"Independent accounting ledger; balance/supply diffs; boundary vectors.","priority":"BLOCKER","profile":"P01; P12","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[13,16,17,18,24,26],"gate":"G4 / G5","owner":"Protocol economics + proving leads","manual_page":45,"owner_lane":"enforced-proving lane (a6e8f84588b809d62)","run_status":"NOT RUN","evidence_path":"build-1:/srv/artefacts/tas/201-7cfa422a-aa0e0f45/node-7cfa422a/box4-core.log","run_id":"201-7cfa422a-aa0e0f45","updated":"2026-10-08T19:32:50.856Z","evidence_record":{"cell":"suite:core","manifest_sha":"7cfa422a","coverage":{"FIN-01":"partial: the finality field and checkpoint tests on the object; ordering under load is the consensus suite and the sim","INC-01":"partial: emission, fee and payout arithmetic tests; the reconciliation over a live chain is the economics lane's","ROT-06":"partial: the dataset activation and digest tests; a live activation is the fast-time harness"},"at":"2026-10-08T19:32:50.856Z","method":"native","requirement_id":"INC-01","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"7cfa422a","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"in_progress_since":"2026-10-08T19:32:50.856Z","approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null},"evidence_records":{"suite:core":{"cell":"suite:core","manifest_sha":"7cfa422a","coverage":{"FIN-01":"partial: the finality field and checkpoint tests on the object; ordering under load is the consensus suite and the sim","INC-01":"partial: emission, fee and payout arithmetic tests; the reconciliation over a live chain is the economics lane's","ROT-06":"partial: the dataset activation and digest tests; a live activation is the fast-time harness"},"at":"2026-10-08T19:32:50.856Z","method":"native","requirement_id":"INC-01","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"7cfa422a","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"run_id":"201-7cfa422a-aa0e0f45","evidence":"build-1:/srv/artefacts/tas/201-7cfa422a-aa0e0f45/node-7cfa422a/box4-core.log","in_progress":true}}},{"id":"INC-02","title":"Keep revenue streams and claims separate","setup":"Prepare jobs and blocks producing mining income, internal proof rewards and external payments.","steps":["Trace money from source to operator, protocol, developer and any burn.","Compare node records, settlement records and Ember displays.","Attempt to classify testnet rewards, reimbursed purchases or token appreciation as external customer revenue."],"accept":"Every stream reconciles and is labelled correctly. No double-counted revenue or fabricated protocol demand; mining subsidy and external service income remain distinct in dashboards and ECO.","evidence":"Money-flow register; UI reconciliation; rejected classifications.","priority":"BLOCKER","profile":"P01; P12; P14","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[13,16,17,18,24,26],"gate":"G4 / G5","owner":"Protocol economics + proving leads","manual_page":45,"owner_lane":"research lane (ad6a2bd47d4a46105)","run_status":"NOT RUN","evidence_path":"docs/analysis/class-v6/coexistence-model.md","run_id":"eco-d4-20261008-01","updated":"2026-10-08T19:55:03.336Z","evidence_record":{"cell":"harness:economics-model","manifest_sha":"db424d20","coverage":{"ECO-02":"partial: the existing-owner and new-entrant tests per class at three tariffs, MSRP and street, with resale (reference-population.md); resale at zero, failures and financing not yet stressed","ECO-03":"partial: the sunk-development case first with low and high ranges, private mining, hardware sales and the hybrid, GPU re-entry after the fleet (coexistence-model.md sections 2, 8a, 12 to 12c; the surface in floor/sram-and-floor.md 4.4); the source thresholds retired to coexistence-workbook.md","ECO-04":"partial: a per-class supply curve with the installed base as a cap and re-entry (coexistence-model.md), the market-structure axis (8a), the operator simulation (operator-simulation.md); dynamic agent policies beyond the single-rule reaction are the simulation second cut","ECO-06":"partial: the recipients and burns reconciled on the chain block-one split (docs/design/proving-payment.md), proving demand as an income axis at none, launch and spike (coexistence-model.md); the full-horizon issuance ledger owed","ECO-07":"partial: each dataset size scored by adversary burden against commodity burden on measured card rows and modelled chip tickets (docs/design/class-v6-rotating-family.md 10.0u); the 8.5 and 11.5 GiB knee costs expected, not measured","INC-02":"partial: the income streams kept separate in the model (mining subsidy, internal proving, external jobs; burns never counted as payment); the node-record and Ember reconciliation are the node and app lanes","INC-03":"partial: the profit-maximising operator simulation first run (mine, internal prove, external prove, off); per-card agents and switching costs are the second cut","INC-04":"partial: the four shocks in the operator simulation (the demand spike, the price fall, the largest provers leaving, the entrants), restored or not and in how many periods","INC-08":"partial: the supplier and operator dependence table (coexistence-model.md 8a); the signing, proving and aggregation roles are the node lane"},"at":"2026-10-08T19:55:03.336Z","method":"model","requirement_id":"INC-02","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"db424d20","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"in_progress_since":"2026-10-08T19:55:03.336Z","approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null},"evidence_records":{"harness:economics-model":{"cell":"harness:economics-model","manifest_sha":"db424d20","coverage":{"ECO-02":"partial: the existing-owner and new-entrant tests per class at three tariffs, MSRP and street, with resale (reference-population.md); resale at zero, failures and financing not yet stressed","ECO-03":"partial: the sunk-development case first with low and high ranges, private mining, hardware sales and the hybrid, GPU re-entry after the fleet (coexistence-model.md sections 2, 8a, 12 to 12c; the surface in floor/sram-and-floor.md 4.4); the source thresholds retired to coexistence-workbook.md","ECO-04":"partial: a per-class supply curve with the installed base as a cap and re-entry (coexistence-model.md), the market-structure axis (8a), the operator simulation (operator-simulation.md); dynamic agent policies beyond the single-rule reaction are the simulation second cut","ECO-06":"partial: the recipients and burns reconciled on the chain block-one split (docs/design/proving-payment.md), proving demand as an income axis at none, launch and spike (coexistence-model.md); the full-horizon issuance ledger owed","ECO-07":"partial: each dataset size scored by adversary burden against commodity burden on measured card rows and modelled chip tickets (docs/design/class-v6-rotating-family.md 10.0u); the 8.5 and 11.5 GiB knee costs expected, not measured","INC-02":"partial: the income streams kept separate in the model (mining subsidy, internal proving, external jobs; burns never counted as payment); the node-record and Ember reconciliation are the node and app lanes","INC-03":"partial: the profit-maximising operator simulation first run (mine, internal prove, external prove, off); per-card agents and switching costs are the second cut","INC-04":"partial: the four shocks in the operator simulation (the demand spike, the price fall, the largest provers leaving, the entrants), restored or not and in how many periods","INC-08":"partial: the supplier and operator dependence table (coexistence-model.md 8a); the signing, proving and aggregation roles are the node lane"},"at":"2026-10-08T19:55:03.336Z","method":"model","requirement_id":"INC-02","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"db424d20","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"run_id":"eco-d4-20261008-01","evidence":"docs/analysis/class-v6/coexistence-model.md","in_progress":true}}},{"id":"INC-03","title":"Let a modified client choose the most profitable task","setup":"Permit independent schedulers to mine, prove internally, prove externally or switch off.","steps":["Publish common costs and vary relative task rewards, memory pressure and switching costs.","Run clients that ignore the official scheduling recommendation.","Measure realised operator margin, internal capacity and network progress."],"accept":"Required P12 sustainable worlds maintain paid essential capacity without compelled altruism. Profitability and availability are based on realised outcomes, including switching and wasted work.","evidence":"Scheduler source/policies; switching traces; capacity and margin series.","priority":"GATE","profile":"P07; P12","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[13,16,17,18,24,26],"gate":"G4 / G5","owner":"Protocol economics + proving leads","manual_page":45,"owner_lane":"research lane (ad6a2bd47d4a46105)","run_status":"NOT RUN","evidence_path":"docs/analysis/class-v6/coexistence-model.md","run_id":"eco-d4-20261008-01","updated":"2026-10-08T19:55:03.336Z","evidence_record":{"cell":"harness:economics-model","manifest_sha":"db424d20","coverage":{"ECO-02":"partial: the existing-owner and new-entrant tests per class at three tariffs, MSRP and street, with resale (reference-population.md); resale at zero, failures and financing not yet stressed","ECO-03":"partial: the sunk-development case first with low and high ranges, private mining, hardware sales and the hybrid, GPU re-entry after the fleet (coexistence-model.md sections 2, 8a, 12 to 12c; the surface in floor/sram-and-floor.md 4.4); the source thresholds retired to coexistence-workbook.md","ECO-04":"partial: a per-class supply curve with the installed base as a cap and re-entry (coexistence-model.md), the market-structure axis (8a), the operator simulation (operator-simulation.md); dynamic agent policies beyond the single-rule reaction are the simulation second cut","ECO-06":"partial: the recipients and burns reconciled on the chain block-one split (docs/design/proving-payment.md), proving demand as an income axis at none, launch and spike (coexistence-model.md); the full-horizon issuance ledger owed","ECO-07":"partial: each dataset size scored by adversary burden against commodity burden on measured card rows and modelled chip tickets (docs/design/class-v6-rotating-family.md 10.0u); the 8.5 and 11.5 GiB knee costs expected, not measured","INC-02":"partial: the income streams kept separate in the model (mining subsidy, internal proving, external jobs; burns never counted as payment); the node-record and Ember reconciliation are the node and app lanes","INC-03":"partial: the profit-maximising operator simulation first run (mine, internal prove, external prove, off); per-card agents and switching costs are the second cut","INC-04":"partial: the four shocks in the operator simulation (the demand spike, the price fall, the largest provers leaving, the entrants), restored or not and in how many periods","INC-08":"partial: the supplier and operator dependence table (coexistence-model.md 8a); the signing, proving and aggregation roles are the node lane"},"at":"2026-10-08T19:55:03.336Z","method":"model","requirement_id":"INC-03","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"db424d20","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"in_progress_since":"2026-10-08T19:55:03.336Z","approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null},"evidence_records":{"harness:economics-model":{"cell":"harness:economics-model","manifest_sha":"db424d20","coverage":{"ECO-02":"partial: the existing-owner and new-entrant tests per class at three tariffs, MSRP and street, with resale (reference-population.md); resale at zero, failures and financing not yet stressed","ECO-03":"partial: the sunk-development case first with low and high ranges, private mining, hardware sales and the hybrid, GPU re-entry after the fleet (coexistence-model.md sections 2, 8a, 12 to 12c; the surface in floor/sram-and-floor.md 4.4); the source thresholds retired to coexistence-workbook.md","ECO-04":"partial: a per-class supply curve with the installed base as a cap and re-entry (coexistence-model.md), the market-structure axis (8a), the operator simulation (operator-simulation.md); dynamic agent policies beyond the single-rule reaction are the simulation second cut","ECO-06":"partial: the recipients and burns reconciled on the chain block-one split (docs/design/proving-payment.md), proving demand as an income axis at none, launch and spike (coexistence-model.md); the full-horizon issuance ledger owed","ECO-07":"partial: each dataset size scored by adversary burden against commodity burden on measured card rows and modelled chip tickets (docs/design/class-v6-rotating-family.md 10.0u); the 8.5 and 11.5 GiB knee costs expected, not measured","INC-02":"partial: the income streams kept separate in the model (mining subsidy, internal proving, external jobs; burns never counted as payment); the node-record and Ember reconciliation are the node and app lanes","INC-03":"partial: the profit-maximising operator simulation first run (mine, internal prove, external prove, off); per-card agents and switching costs are the second cut","INC-04":"partial: the four shocks in the operator simulation (the demand spike, the price fall, the largest provers leaving, the entrants), restored or not and in how many periods","INC-08":"partial: the supplier and operator dependence table (coexistence-model.md 8a); the signing, proving and aggregation roles are the node lane"},"at":"2026-10-08T19:55:03.336Z","method":"model","requirement_id":"INC-03","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"db424d20","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"run_id":"eco-d4-20261008-01","evidence":"docs/analysis/class-v6/coexistence-model.md","in_progress":true}}},{"id":"INC-04","title":"Survive external-demand spikes and token declines","setup":"Use F7 scenarios with 10x external job offers and token-denominated mining-income shocks.","steps":["Allow miners/provers to switch freely under the declared reward and difficulty rules.","Observe hash participation, proof backlog, fees and recovery without an administrator.","Repeat with external demand dropping to zero and with a dominant operator withdrawn."],"accept":"Mandatory viable worlds meet P07/P12; stressed nonviable worlds fail or pause safely with truthful status. No emergency rule, fabricated demand or unofficial subsidy is inserted to force a pass.","evidence":"Shock timeline; fee/hash/capacity paths; failure-region report.","priority":"GATE","profile":"P07; P08; P12","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[13,16,17,18,24,26],"gate":"G4 / G5","owner":"Protocol economics + proving leads","manual_page":46,"owner_lane":"research lane (ad6a2bd47d4a46105)","run_status":"NOT RUN","evidence_path":"docs/analysis/class-v6/coexistence-model.md","run_id":"eco-d4-20261008-01","updated":"2026-10-08T19:55:03.336Z","evidence_record":{"cell":"harness:economics-model","manifest_sha":"db424d20","coverage":{"ECO-02":"partial: the existing-owner and new-entrant tests per class at three tariffs, MSRP and street, with resale (reference-population.md); resale at zero, failures and financing not yet stressed","ECO-03":"partial: the sunk-development case first with low and high ranges, private mining, hardware sales and the hybrid, GPU re-entry after the fleet (coexistence-model.md sections 2, 8a, 12 to 12c; the surface in floor/sram-and-floor.md 4.4); the source thresholds retired to coexistence-workbook.md","ECO-04":"partial: a per-class supply curve with the installed base as a cap and re-entry (coexistence-model.md), the market-structure axis (8a), the operator simulation (operator-simulation.md); dynamic agent policies beyond the single-rule reaction are the simulation second cut","ECO-06":"partial: the recipients and burns reconciled on the chain block-one split (docs/design/proving-payment.md), proving demand as an income axis at none, launch and spike (coexistence-model.md); the full-horizon issuance ledger owed","ECO-07":"partial: each dataset size scored by adversary burden against commodity burden on measured card rows and modelled chip tickets (docs/design/class-v6-rotating-family.md 10.0u); the 8.5 and 11.5 GiB knee costs expected, not measured","INC-02":"partial: the income streams kept separate in the model (mining subsidy, internal proving, external jobs; burns never counted as payment); the node-record and Ember reconciliation are the node and app lanes","INC-03":"partial: the profit-maximising operator simulation first run (mine, internal prove, external prove, off); per-card agents and switching costs are the second cut","INC-04":"partial: the four shocks in the operator simulation (the demand spike, the price fall, the largest provers leaving, the entrants), restored or not and in how many periods","INC-08":"partial: the supplier and operator dependence table (coexistence-model.md 8a); the signing, proving and aggregation roles are the node lane"},"at":"2026-10-08T19:55:03.336Z","method":"model","requirement_id":"INC-04","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"db424d20","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"in_progress_since":"2026-10-08T19:55:03.336Z","approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null},"evidence_records":{"harness:economics-model":{"cell":"harness:economics-model","manifest_sha":"db424d20","coverage":{"ECO-02":"partial: the existing-owner and new-entrant tests per class at three tariffs, MSRP and street, with resale (reference-population.md); resale at zero, failures and financing not yet stressed","ECO-03":"partial: the sunk-development case first with low and high ranges, private mining, hardware sales and the hybrid, GPU re-entry after the fleet (coexistence-model.md sections 2, 8a, 12 to 12c; the surface in floor/sram-and-floor.md 4.4); the source thresholds retired to coexistence-workbook.md","ECO-04":"partial: a per-class supply curve with the installed base as a cap and re-entry (coexistence-model.md), the market-structure axis (8a), the operator simulation (operator-simulation.md); dynamic agent policies beyond the single-rule reaction are the simulation second cut","ECO-06":"partial: the recipients and burns reconciled on the chain block-one split (docs/design/proving-payment.md), proving demand as an income axis at none, launch and spike (coexistence-model.md); the full-horizon issuance ledger owed","ECO-07":"partial: each dataset size scored by adversary burden against commodity burden on measured card rows and modelled chip tickets (docs/design/class-v6-rotating-family.md 10.0u); the 8.5 and 11.5 GiB knee costs expected, not measured","INC-02":"partial: the income streams kept separate in the model (mining subsidy, internal proving, external jobs; burns never counted as payment); the node-record and Ember reconciliation are the node and app lanes","INC-03":"partial: the profit-maximising operator simulation first run (mine, internal prove, external prove, off); per-card agents and switching costs are the second cut","INC-04":"partial: the four shocks in the operator simulation (the demand spike, the price fall, the largest provers leaving, the entrants), restored or not and in how many periods","INC-08":"partial: the supplier and operator dependence table (coexistence-model.md 8a); the signing, proving and aggregation roles are the node lane"},"at":"2026-10-08T19:55:03.336Z","method":"model","requirement_id":"INC-04","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"db424d20","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"run_id":"eco-d4-20261008-01","evidence":"docs/analysis/class-v6/coexistence-model.md","in_progress":true}}},{"id":"INC-05","title":"Contain job reservation and identity-splitting abuse","setup":"Freeze the actual assignment/payment mechanism; do not assume unimplemented collateral or identity controls.","steps":["Create many worker identities, reserve jobs, withhold proofs and submit late results.","Attempt free option-taking, duplicate work rewards and displacement of honest assignments.","Price attacker costs and observe honest completion under the approved abuse load."],"accept":"F0 rules and P07 service limits hold under the declared adversary. Identity splitting does not create unauthorised rewards or control; any unmitigated starvation path blocks the permissionless-service claim.","evidence":"Attack clients; assignment trace; cost-to-disrupt analysis; honest-user outcomes.","priority":"BLOCKER","profile":"P01; P07; P09","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[13,16,17,18,24,26],"gate":"G4 / G5","owner":"Protocol economics + proving leads","manual_page":46,"owner_lane":"enforced-proving lane (a6e8f84588b809d62)","run_status":"NOT RUN","evidence_path":"","run_id":"","updated":"2026-10-08T19:22:31.798Z","evidence_record":{"reason":"reservation abuse needs the capacity harness","at":"2026-10-08T19:22:31.798Z","method":"static","requirement_id":"INC-05","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null},"evidence_records":{"record":{"reason":"reservation abuse needs the capacity harness","at":"2026-10-08T19:22:31.798Z","method":"static","requirement_id":"INC-05","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"run_id":"","evidence":"","in_progress":false}}},{"id":"INC-06","title":"Test difficulty and timestamp manipulation","setup":"Use the actual adjustment algorithm and consensus timestamp rule with independent miners.","steps":["Inject large hashrate arrivals/departures, periodic selective mining and boundary-timed bursts.","Try allowed and invalid timestamp skew, withheld blocks and replayed work.","Observe block intervals, reward allocation and recovery after hashrate stabilises."],"accept":"Invalid inputs are rejected; valid adversarial strategies remain within F0/P08 bounds and are priced in ECO. No unexplained reward amplification, permanent stall or conflicting accepted work.","evidence":"Difficulty trace; timestamp corpus; revenue analysis; independent rule review.","priority":"BLOCKER","profile":"P01; P08; P12","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[13,16,17,18,24,26],"gate":"G4 / G5","owner":"Protocol economics + proving leads","manual_page":46,"owner_lane":"research lane (ad6a2bd47d4a46105)","run_status":"NOT RUN","evidence_path":"","run_id":"","updated":"2026-10-08T19:22:31.798Z","evidence_record":{"reason":"difficulty and timestamp manipulation needs the fault network F4","at":"2026-10-08T19:22:31.798Z","method":"static","requirement_id":"INC-06","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null},"evidence_records":{"record":{"reason":"difficulty and timestamp manipulation needs the fault network F4","at":"2026-10-08T19:22:31.798Z","method":"static","requirement_id":"INC-06","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"run_id":"","evidence":"","in_progress":false}}},{"id":"INC-07","title":"Resist self-dealing fees and fake proving demand","setup":"Use self-funded operators and related customer identities in the isolated economic model/network.","steps":["Cycle funds through jobs, tips, developer shares and rebates to seek net reward extraction.","Attempt to inflate external-demand metrics without genuine unrelated customer expenditure.","Reconcile all counterparties and net cash contribution rather than gross transaction volume."],"accept":"No unauthorised subsidy extraction or metric inflation passes. Related-party volume is disclosed/excluded from P14; net external cash and legitimate protocol incentives are reported separately.","evidence":"Circular-flow tests; ownership/conflict review; net-cash reconciliation.","priority":"BLOCKER","profile":"P01; P12; P14","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[13,16,17,18,24,26],"gate":"G4 / G5","owner":"Protocol economics + proving leads","manual_page":47,"owner_lane":"enforced-proving lane (a6e8f84588b809d62)","run_status":"NOT RUN","evidence_path":"","run_id":"","updated":"2026-10-08T19:22:31.798Z","evidence_record":{"reason":"self-dealing fees need the economic model and a live window","at":"2026-10-08T19:22:31.798Z","method":"static","requirement_id":"INC-07","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null},"evidence_records":{"record":{"reason":"self-dealing fees need the economic model and a live window","at":"2026-10-08T19:22:31.798Z","method":"static","requirement_id":"INC-07","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"run_id":"","evidence":"","in_progress":false}}},{"id":"INC-08","title":"Quantify provider and supplier failure concentration","setup":"Model control of hashing, signing, proving, aggregation and hardware supply separately.","steps":["Remove each largest operational dependency and combine correlated failures.","Measure replacement cost/time and whether essential roles share hidden ownership.","Compare results with the approved fault model and no-rescue exercise."],"accept":"No hidden single dependency defeats the claimed independence; within-tolerance withdrawals recover under P08/P11. Hardware supply concentration is disclosed without equating vendor sales to operator voting control.","evidence":"Role/ownership map; dependency removals; recovery and concentration report.","priority":"GATE","profile":"P08; P11; P12","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[13,16,17,18,24,26],"gate":"G4 / G5","owner":"Protocol economics + proving leads","manual_page":47,"owner_lane":"research lane (ad6a2bd47d4a46105)","run_status":"NOT RUN","evidence_path":"docs/analysis/class-v6/coexistence-model.md","run_id":"eco-d4-20261008-01","updated":"2026-10-08T19:55:03.336Z","evidence_record":{"cell":"harness:economics-model","manifest_sha":"db424d20","coverage":{"ECO-02":"partial: the existing-owner and new-entrant tests per class at three tariffs, MSRP and street, with resale (reference-population.md); resale at zero, failures and financing not yet stressed","ECO-03":"partial: the sunk-development case first with low and high ranges, private mining, hardware sales and the hybrid, GPU re-entry after the fleet (coexistence-model.md sections 2, 8a, 12 to 12c; the surface in floor/sram-and-floor.md 4.4); the source thresholds retired to coexistence-workbook.md","ECO-04":"partial: a per-class supply curve with the installed base as a cap and re-entry (coexistence-model.md), the market-structure axis (8a), the operator simulation (operator-simulation.md); dynamic agent policies beyond the single-rule reaction are the simulation second cut","ECO-06":"partial: the recipients and burns reconciled on the chain block-one split (docs/design/proving-payment.md), proving demand as an income axis at none, launch and spike (coexistence-model.md); the full-horizon issuance ledger owed","ECO-07":"partial: each dataset size scored by adversary burden against commodity burden on measured card rows and modelled chip tickets (docs/design/class-v6-rotating-family.md 10.0u); the 8.5 and 11.5 GiB knee costs expected, not measured","INC-02":"partial: the income streams kept separate in the model (mining subsidy, internal proving, external jobs; burns never counted as payment); the node-record and Ember reconciliation are the node and app lanes","INC-03":"partial: the profit-maximising operator simulation first run (mine, internal prove, external prove, off); per-card agents and switching costs are the second cut","INC-04":"partial: the four shocks in the operator simulation (the demand spike, the price fall, the largest provers leaving, the entrants), restored or not and in how many periods","INC-08":"partial: the supplier and operator dependence table (coexistence-model.md 8a); the signing, proving and aggregation roles are the node lane"},"at":"2026-10-08T19:55:03.336Z","method":"model","requirement_id":"INC-08","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"db424d20","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"in_progress_since":"2026-10-08T19:55:03.336Z","approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null},"evidence_records":{"harness:economics-model":{"cell":"harness:economics-model","manifest_sha":"db424d20","coverage":{"ECO-02":"partial: the existing-owner and new-entrant tests per class at three tariffs, MSRP and street, with resale (reference-population.md); resale at zero, failures and financing not yet stressed","ECO-03":"partial: the sunk-development case first with low and high ranges, private mining, hardware sales and the hybrid, GPU re-entry after the fleet (coexistence-model.md sections 2, 8a, 12 to 12c; the surface in floor/sram-and-floor.md 4.4); the source thresholds retired to coexistence-workbook.md","ECO-04":"partial: a per-class supply curve with the installed base as a cap and re-entry (coexistence-model.md), the market-structure axis (8a), the operator simulation (operator-simulation.md); dynamic agent policies beyond the single-rule reaction are the simulation second cut","ECO-06":"partial: the recipients and burns reconciled on the chain block-one split (docs/design/proving-payment.md), proving demand as an income axis at none, launch and spike (coexistence-model.md); the full-horizon issuance ledger owed","ECO-07":"partial: each dataset size scored by adversary burden against commodity burden on measured card rows and modelled chip tickets (docs/design/class-v6-rotating-family.md 10.0u); the 8.5 and 11.5 GiB knee costs expected, not measured","INC-02":"partial: the income streams kept separate in the model (mining subsidy, internal proving, external jobs; burns never counted as payment); the node-record and Ember reconciliation are the node and app lanes","INC-03":"partial: the profit-maximising operator simulation first run (mine, internal prove, external prove, off); per-card agents and switching costs are the second cut","INC-04":"partial: the four shocks in the operator simulation (the demand spike, the price fall, the largest provers leaving, the entrants), restored or not and in how many periods","INC-08":"partial: the supplier and operator dependence table (coexistence-model.md 8a); the signing, proving and aggregation roles are the node lane"},"at":"2026-10-08T19:55:03.336Z","method":"model","requirement_id":"INC-08","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"db424d20","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"run_id":"eco-d4-20261008-01","evidence":"docs/analysis/class-v6/coexistence-model.md","in_progress":true}}}]},{"code":"FIN","title":"Consensus safety and recovery","source":[19,21,24,25],"gate":"G5 / technical readiness","owner":"Consensus lead + independent formal/security review","fixtures":"F0 exact fault model; F4 real-node partitions; F5 certificates and historical failures","summary":"Test safety under the stated fault bounds. Demand liveness only when synchrony and participation assumptions actually hold.","tests":[{"id":"FIN-01","title":"Agree on ordering, work and executed state","setup":"Use real fork-choice/DAG handling and independent miners, not only a simplified simulator.","steps":["Generate concurrent branches, delayed blocks, duplicates and invalid work with deterministic seeds.","Compare selected ordering, accumulated work, transaction execution and state roots after delivery converges.","Replay from independent checkpoints and from genesis where practical."],"accept":"Honest nodes converge under F0 assumptions with exact roots and rewards. No duplicated work accounting or undocumented ordering dependence; simulator-only success cannot substitute.","evidence":"Block/ordering corpus; root/work diffs; real-node replay logs.","priority":"BLOCKER","profile":"P01; P08","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[19,21,24,25],"gate":"G5 / technical readiness","owner":"Consensus lead + independent formal/security review","manual_page":48,"owner_lane":"fast-time lane (a8be71a0db962911c)","run_status":"NOT RUN","evidence_path":"build-1:/srv/artefacts/tas/201-7cfa422a-aa0e0f45/node-7cfa422a/box4-consensus.log","run_id":"201-7cfa422a-aa0e0f45","updated":"2026-10-08T19:32:50.856Z","evidence_record":{"cell":"suite:consensus","manifest_sha":"7cfa422a","coverage":{"FIN-01":"partial: the finality processes' agreement tests","FIN-03":"partial: rule v4's anchored table and authority expiry tests (bee41b5e)","FIN-04":"partial: the frozen table without its time expiry (rule v4)","FIN-05":"partial: key succession and another scheme's vote refused","FIN-07":"partial: majority-continuity recovery (rule v4)","ROT-05":"partial: the finality-stopped pause tests","ZKP-01":"partial: a proof-less or wrong-statement block refused by consensus"},"at":"2026-10-08T19:32:50.856Z","method":"native","requirement_id":"FIN-01","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"7cfa422a","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"in_progress_since":"2026-10-08T19:32:50.856Z","approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null},"evidence_records":{"suite:consensus":{"cell":"suite:consensus","manifest_sha":"7cfa422a","coverage":{"FIN-01":"partial: the finality processes' agreement tests","FIN-03":"partial: rule v4's anchored table and authority expiry tests (bee41b5e)","FIN-04":"partial: the frozen table without its time expiry (rule v4)","FIN-05":"partial: key succession and another scheme's vote refused","FIN-07":"partial: majority-continuity recovery (rule v4)","ROT-05":"partial: the finality-stopped pause tests","ZKP-01":"partial: a proof-less or wrong-statement block refused by consensus"},"at":"2026-10-08T19:32:50.856Z","method":"native","requirement_id":"FIN-01","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"7cfa422a","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"run_id":"201-7cfa422a-aa0e0f45","evidence":"build-1:/srv/artefacts/tas/201-7cfa422a-aa0e0f45/node-7cfa422a/box4-consensus.log","in_progress":true}}},{"id":"FIN-02","title":"Attack finality with split honest populations","setup":"Use the source-discussed 40/40/20 weight split, plus threshold-boundary splits under F0.","steps":["Let the 20% adversarial group sign conflicting histories while honest groups are partitioned.","Delay messages and eligibility updates independently; keep total historical weights auditable.","Try to form two certificates and reconnect nodes to observe accepted final history."],"accept":"No conflicting final certificates are accepted within the declared fault bound. A safe pause is valid when quorum is unavailable; making progress on both sides is not required.","evidence":"Signed votes; certificate attempts; voter-table snapshots; safety checker output.","priority":"BLOCKER","profile":"P01; P08","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[19,21,24,25],"gate":"G5 / technical readiness","owner":"Consensus lead + independent formal/security review","manual_page":48,"owner_lane":"finality lane (aca0f5ed924a2a99b)","run_status":"PASS","evidence_path":"sim/finality-attacks-results/v4-pause-fix.md","run_id":"fin-v4-realnode-20261008T2025Z","updated":"2026-10-08T19:43:19.697Z","evidence_record":{"cell":"node:finality-realnode","manifest_sha":"12424341","coverage":{"FIN-02":"partial: the real-node half; independent operators and the review remain","FIN-07":"partial: deterministic recovery after reconnection and crash on real nodes (the HEAL reruns)"},"at":"2026-10-08T19:43:19.697Z","method":"static","requirement_id":"FIN-02","decision":"PASS","reviewer":"","claim_impact":"","release_identity":{"commit":"12424341","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null},"evidence_records":{"node:finality-realnode":{"cell":"node:finality-realnode","manifest_sha":"12424341","coverage":{"FIN-02":"partial: the real-node half; independent operators and the review remain","FIN-07":"partial: deterministic recovery after reconnection and crash on real nodes (the HEAL reruns)"},"at":"2026-10-08T19:43:19.697Z","method":"static","requirement_id":"FIN-02","decision":"PASS","reviewer":"","claim_impact":"","release_identity":{"commit":"12424341","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"run_id":"fin-v4-realnode-20261008T2025Z","evidence":"sim/finality-attacks-results/v4-pause-fix.md","in_progress":false}}},{"id":"FIN-03","title":"Cross authority expiry in a long partition","setup":"Recover historical expiry failures where available; use the actual current authority-transition rules.","steps":["Partition for 31, 35, 60 and 90 logical days and around every retention/expiry boundary.","Attempt independently renewed authority sets and conflicting checkpoint locks.","Repeat selected boundary cases on real nodes with accelerated timers explicitly labelled."],"accept":"Authority continuity remains authenticated and no conflicting final history appears within F0 assumptions. A timeout is not accepted as proof absent voters ceased to exist. Compressed time is not multi-month field evidence.","evidence":"Expiry timeline; table/certificate history; historical regression tests.","priority":"BLOCKER","profile":"P01; P08","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[19,21,24,25],"gate":"G5 / technical readiness","owner":"Consensus lead + independent formal/security review","manual_page":48,"owner_lane":"finality lane (aca0f5ed924a2a99b)","run_status":"NOT RUN","evidence_path":"build-1:/srv/artefacts/tas/201-7cfa422a-aa0e0f45/node-7cfa422a/box4-consensus.log","run_id":"201-7cfa422a-aa0e0f45","updated":"2026-10-08T19:32:50.856Z","evidence_record":{"cell":"suite:consensus","manifest_sha":"7cfa422a","coverage":{"FIN-01":"partial: the finality processes' agreement tests","FIN-03":"partial: rule v4's anchored table and authority expiry tests (bee41b5e)","FIN-04":"partial: the frozen table without its time expiry (rule v4)","FIN-05":"partial: key succession and another scheme's vote refused","FIN-07":"partial: majority-continuity recovery (rule v4)","ROT-05":"partial: the finality-stopped pause tests","ZKP-01":"partial: a proof-less or wrong-statement block refused by consensus"},"at":"2026-10-08T19:32:50.856Z","method":"native","requirement_id":"FIN-03","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"7cfa422a","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"in_progress_since":"2026-10-08T19:32:50.856Z","approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null},"evidence_records":{"suite:consensus":{"cell":"suite:consensus","manifest_sha":"7cfa422a","coverage":{"FIN-01":"partial: the finality processes' agreement tests","FIN-03":"partial: rule v4's anchored table and authority expiry tests (bee41b5e)","FIN-04":"partial: the frozen table without its time expiry (rule v4)","FIN-05":"partial: key succession and another scheme's vote refused","FIN-07":"partial: majority-continuity recovery (rule v4)","ROT-05":"partial: the finality-stopped pause tests","ZKP-01":"partial: a proof-less or wrong-statement block refused by consensus"},"at":"2026-10-08T19:32:50.856Z","method":"native","requirement_id":"FIN-03","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"7cfa422a","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"run_id":"201-7cfa422a-aa0e0f45","evidence":"build-1:/srv/artefacts/tas/201-7cfa422a-aa0e0f45/node-7cfa422a/box4-consensus.log","in_progress":true}}},{"id":"FIN-04","title":"Stop signing while mining continues","setup":"Remove enough signing participation to invalidate the liveness assumption without forging votes.","steps":["Continue mining and execution, cross seed boundaries and monitor proof queues.","Check which user-visible states advance and which remain unfinalised.","Restore eligible weight and bounded message delay, then verify recovery."],"accept":"No false finality or fabricated authority. Behaviour matches F0 during the pause and P08 after assumptions return; unfinished transactions are not displayed as irreversible.","evidence":"Signing/mining trace; UI/RPC states; recovery roots and timing.","priority":"BLOCKER","profile":"P01; P08","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[19,21,24,25],"gate":"G5 / technical readiness","owner":"Consensus lead + independent formal/security review","manual_page":49,"owner_lane":"finality lane (aca0f5ed924a2a99b)","run_status":"NOT RUN","evidence_path":"build-1:/srv/artefacts/tas/201-7cfa422a-aa0e0f45/node-7cfa422a/box4-consensus.log","run_id":"201-7cfa422a-aa0e0f45","updated":"2026-10-08T19:32:50.856Z","evidence_record":{"cell":"suite:consensus","manifest_sha":"7cfa422a","coverage":{"FIN-01":"partial: the finality processes' agreement tests","FIN-03":"partial: rule v4's anchored table and authority expiry tests (bee41b5e)","FIN-04":"partial: the frozen table without its time expiry (rule v4)","FIN-05":"partial: key succession and another scheme's vote refused","FIN-07":"partial: majority-continuity recovery (rule v4)","ROT-05":"partial: the finality-stopped pause tests","ZKP-01":"partial: a proof-less or wrong-statement block refused by consensus"},"at":"2026-10-08T19:32:50.856Z","method":"native","requirement_id":"FIN-04","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"7cfa422a","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"in_progress_since":"2026-10-08T19:32:50.856Z","approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null},"evidence_records":{"suite:consensus":{"cell":"suite:consensus","manifest_sha":"7cfa422a","coverage":{"FIN-01":"partial: the finality processes' agreement tests","FIN-03":"partial: rule v4's anchored table and authority expiry tests (bee41b5e)","FIN-04":"partial: the frozen table without its time expiry (rule v4)","FIN-05":"partial: key succession and another scheme's vote refused","FIN-07":"partial: majority-continuity recovery (rule v4)","ROT-05":"partial: the finality-stopped pause tests","ZKP-01":"partial: a proof-less or wrong-statement block refused by consensus"},"at":"2026-10-08T19:32:50.856Z","method":"native","requirement_id":"FIN-04","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"7cfa422a","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"run_id":"201-7cfa422a-aa0e0f45","evidence":"build-1:/srv/artefacts/tas/201-7cfa422a-aa0e0f45/node-7cfa422a/box4-consensus.log","in_progress":true}}},{"id":"FIN-05","title":"Authenticate voter-set changes and pooled keys","setup":"Use normal transitions, pool members retaining keys and malicious substitution attempts.","steps":["Alter voter weights, membership proofs, miner/pool identity bindings and prior-certificate links.","Race updates across boundaries and replay old signed changes.","Have a new node verify the authority chain from its declared trust anchor."],"accept":"Only correctly authenticated changes are accepted; weights cannot be double-counted or redirected by a pool. All honest nodes agree on the active authority set for each certified point.","evidence":"Authority-chain fixtures; substitution attacks; new-node verification log.","priority":"BLOCKER","profile":"P01; P08","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[19,21,24,25],"gate":"G5 / technical readiness","owner":"Consensus lead + independent formal/security review","manual_page":49,"owner_lane":"finality lane (aca0f5ed924a2a99b)","run_status":"NOT RUN","evidence_path":"build-1:/srv/artefacts/tas/201-7cfa422a-aa0e0f45/node-7cfa422a/box4-consensus.log","run_id":"201-7cfa422a-aa0e0f45","updated":"2026-10-08T19:32:50.856Z","evidence_record":{"cell":"suite:consensus","manifest_sha":"7cfa422a","coverage":{"FIN-01":"partial: the finality processes' agreement tests","FIN-03":"partial: rule v4's anchored table and authority expiry tests (bee41b5e)","FIN-04":"partial: the frozen table without its time expiry (rule v4)","FIN-05":"partial: key succession and another scheme's vote refused","FIN-07":"partial: majority-continuity recovery (rule v4)","ROT-05":"partial: the finality-stopped pause tests","ZKP-01":"partial: a proof-less or wrong-statement block refused by consensus"},"at":"2026-10-08T19:32:50.856Z","method":"native","requirement_id":"FIN-05","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"7cfa422a","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"in_progress_since":"2026-10-08T19:32:50.856Z","approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null},"evidence_records":{"suite:consensus":{"cell":"suite:consensus","manifest_sha":"7cfa422a","coverage":{"FIN-01":"partial: the finality processes' agreement tests","FIN-03":"partial: rule v4's anchored table and authority expiry tests (bee41b5e)","FIN-04":"partial: the frozen table without its time expiry (rule v4)","FIN-05":"partial: key succession and another scheme's vote refused","FIN-07":"partial: majority-continuity recovery (rule v4)","ROT-05":"partial: the finality-stopped pause tests","ZKP-01":"partial: a proof-less or wrong-statement block refused by consensus"},"at":"2026-10-08T19:32:50.856Z","method":"native","requirement_id":"FIN-05","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"7cfa422a","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"run_id":"201-7cfa422a-aa0e0f45","evidence":"build-1:/srv/artefacts/tas/201-7cfa422a-aa0e0f45/node-7cfa422a/box4-consensus.log","in_progress":true}}},{"id":"FIN-06","title":"Analyse old-key compromise and long-range histories","setup":"Freeze assumptions about key erasure, retained weights, trust anchors and offline recovery.","steps":["Use previously eligible keys to build alternative histories after their operators disappear.","Present these histories to recently offline and newly joining clients.","Test replayed certificates, stale anchors and compromised signer subsets."],"accept":"Acceptance matches the explicit security model with no hidden trusted recovery step. Any reliance on a recent trusted anchor is disclosed and tested; hashpower assumptions cannot replace old-key analysis.","evidence":"Long-range corpus; trust-anchor policy; key-compromise review; client results.","priority":"BLOCKER","profile":"P01; P08","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[19,21,24,25],"gate":"G5 / technical readiness","owner":"Consensus lead + independent formal/security review","manual_page":49,"owner_lane":"finality lane (aca0f5ed924a2a99b)","run_status":"NOT RUN","evidence_path":"sim/results_v2.md Rule v4","run_id":"team-2026-10-08","updated":"2026-10-08T20:10:24.556Z","evidence_record":{"reason":"old-key compromise analysis is the finality lane's long-range scenario, not yet in the sim","at":"2026-10-08T20:10:24.556Z","method":"static","requirement_id":"FIN-06","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"in_progress_since":"2026-10-08 18:3x UK","approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null},"evidence_records":{"record":{"what_was_run":"bought and stolen keys in the simulator rows","run_by":"finality lane (aca0f5ed924a2a99b)","under_the_standard":"no: team-run before the standard's procedure; the status is RUNNING until the case is re-run under its steps with the profile's numbers and an independent run where the profile asks one","pass_or_fail_today":"not judged under the standard yet","method":"static","requirement_id":"FIN-06","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"run_id":"team-2026-10-08","evidence":"sim/results_v2.md Rule v4","in_progress":true}}},{"id":"FIN-07","title":"Recover deterministically after reconnection and crash","setup":"Combine partitions with node crash, partial writes, restarts and proof backlog.","steps":["Reconnect networks under bounded latency and restore required honest participation.","Verify fork choice, unfinalised reorganisation, finality, reward rollback and proof reassignments.","Compare all honest nodes and customer-visible receipts after recovery."],"accept":"P08 recovery holds without reversing a previously valid final guarantee. Only permitted unfinalised state is reorganised; no duplicate rewards or inconsistent receipt statuses survive.","evidence":"Recovery timelines; roots/certificates; payout rollback; customer-state reconciliation.","priority":"BLOCKER","profile":"P01; P08","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[19,21,24,25],"gate":"G5 / technical readiness","owner":"Consensus lead + independent formal/security review","manual_page":50,"owner_lane":"finality lane (aca0f5ed924a2a99b)","run_status":"PASS","evidence_path":"sim/finality-attacks-results/v4-pause-fix.md","run_id":"fin-v4-realnode-20261008T2025Z","updated":"2026-10-08T19:43:19.697Z","evidence_record":{"cell":"node:finality-realnode","manifest_sha":"12424341","coverage":{"FIN-02":"partial: the real-node half; independent operators and the review remain","FIN-07":"partial: deterministic recovery after reconnection and crash on real nodes (the HEAL reruns)"},"at":"2026-10-08T19:43:19.697Z","method":"static","requirement_id":"FIN-07","decision":"PASS","reviewer":"","claim_impact":"","release_identity":{"commit":"12424341","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null},"evidence_records":{"node:finality-realnode":{"cell":"node:finality-realnode","manifest_sha":"12424341","coverage":{"FIN-02":"partial: the real-node half; independent operators and the review remain","FIN-07":"partial: deterministic recovery after reconnection and crash on real nodes (the HEAL reruns)"},"at":"2026-10-08T19:43:19.697Z","method":"static","requirement_id":"FIN-07","decision":"PASS","reviewer":"","claim_impact":"","release_identity":{"commit":"12424341","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"run_id":"fin-v4-realnode-20261008T2025Z","evidence":"sim/finality-attacks-results/v4-pause-fix.md","in_progress":false}}},{"id":"FIN-08","title":"Combine boundaries, faults and adversarial scheduling","setup":"Use an independent model checker/scheduler and production-node scenarios from F4.","steps":["Combine epoch changes, authority transitions, mining churn, data delays and prover/aggregator loss.","Explore bounded adversarial message schedules and minimise any counterexample.","Replay model findings on real code and have an independent reviewer assess uncovered states."],"accept":"No unresolved safety failure; liveness claims hold only within declared assumptions and P08. Model bounds and untested schedules are published, not described as proof over every possible execution.","evidence":"Model/spec artifacts; schedule corpus; replay evidence; independent assessment.","priority":"BLOCKER","profile":"P01; P08","cadence":"Release candidate; repeat after relevant changes","method":"Model checking + real-node testing","status":"NOT RUN","source":[19,21,24,25],"gate":"G5 / technical readiness","owner":"Consensus lead + independent formal/security review","manual_page":50,"owner_lane":"fast-time lane (a8be71a0db962911c)","run_status":"NOT RUN","evidence_path":"sim/results_v2.md","run_id":"fin-v4-realnode-20261008T2025Z","updated":"2026-10-08T19:43:19.697Z","evidence_record":{"cell":"harness:finality-sim","manifest_sha":"12424341","coverage":{"FIN-08":"partial: the combined boundary and fault scenarios in the simulator with adversarial schedules; model checking is the formal review"},"at":"2026-10-08T19:43:19.697Z","method":"model","requirement_id":"FIN-08","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"12424341","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"in_progress_since":"2026-10-08T19:43:19.697Z","approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null},"evidence_records":{"harness:finality-sim":{"cell":"harness:finality-sim","manifest_sha":"12424341","coverage":{"FIN-08":"partial: the combined boundary and fault scenarios in the simulator with adversarial schedules; model checking is the formal review"},"at":"2026-10-08T19:43:19.697Z","method":"model","requirement_id":"FIN-08","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"12424341","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"run_id":"fin-v4-realnode-20261008T2025Z","evidence":"sim/results_v2.md","in_progress":true}}}],"notes":[{"at":"2026-10-08T19:32:50.918Z","text":"F04 (Review B), the founder's ruling 8 October 19:57 UK: the recovery lock is kept and is always labelled 'recovery', never 'final', on every surface (the checkpoint field, the explorer, receipts, the light client, the oracle, the site)"},{"at":"2026-10-08T20:10:24.812Z","text":"REC-01 (the master edition's one unresolved interpretation, finality pause-only healing: R1's I03 stale predicate against R2's F04 backfill caveat): closure evidence as the finality and node lanes recorded it on 8 October 2026: rule v4 at release-2.0.0-node 12424341's line, mode recovery by the founder's 19:57 ruling (the lock labelled recovery, never final), both real-node lines PASS tonight by the 6.7 pause criterion, FIN-02 PASS at 0218d6bf1 on the simulator half; status RUNNING until the beyond-window healing case with and without historical data is run natively (the node lane's case tomorrow)."}]},{"code":"VER","title":"Wallets, receipts and data availability","source":[20,25,35,37],"gate":"Technical readiness / claimed options","owner":"Wallet + light-client lead; independent security review","fixtures":"F0 trust/availability model; F5 malformed roots, receipts and authority chains","summary":"Verify the exact property shown to the user. An inclusion proof, execution proof and finality certificate are not interchangeable.","tests":[{"id":"VER-01","title":"Authenticate light-client bootstrap","setup":"Give a clean client malicious RPC responses, fabricated voter tables and valid-looking signatures.","steps":["Start from the approved trust anchor and verify every required link to the advertised state.","Substitute otherwise well-formed but unauthorised keys, weights and checkpoints.","Remove the bootstrap service and use another independently operated source."],"accept":"The client rejects unauthorised authority and discloses any trust anchor. Signatures over a node-supplied table do not by themselves pass; missing authentication never silently degrades to trusted RPC.","evidence":"Bootstrap corpus; trust-chain trace; fail-closed tests.","priority":"BLOCKER","profile":"P01; P09","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[20,25,35,37],"gate":"Technical readiness / claimed options","owner":"Wallet + light-client lead; independent security review","manual_page":51,"owner_lane":"reference-apps lane (a2060899d2a27d31c)","run_status":"FAIL","evidence_path":"tools/reference-apps/ver/evidence/VER-01.json","run_id":"ra-20261008T1915-ver","updated":"2026-10-08T19:46:20.696Z","evidence_record":{"cell":"harness:reference-apps-ver-trust-anchor","manifest_sha":"4cdcc488","coverage":{"VER-01":"fails today, disclosed: the light client authenticates the certificate's signatures and the header path but the voter table is a node-supplied trust anchor named on /light; a forged table signature and a wrong-network certificate are refused","VER-02":"fails today, disclosed: the execution statement's proof is verified by the nodes and the browser verifies the aggregator signature and the post root under it; an in-browser verifier for the permitted proof and a table commitment close it"},"at":"2026-10-08T19:46:20.696Z","method":"static","requirement_id":"VER-01","decision":"FAIL","reviewer":"","claim_impact":"","release_identity":{"commit":"4cdcc488","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null},"evidence_records":{"harness:reference-apps-ver-trust-anchor":{"cell":"harness:reference-apps-ver-trust-anchor","manifest_sha":"4cdcc488","coverage":{"VER-01":"fails today, disclosed: the light client authenticates the certificate's signatures and the header path but the voter table is a node-supplied trust anchor named on /light; a forged table signature and a wrong-network certificate are refused","VER-02":"fails today, disclosed: the execution statement's proof is verified by the nodes and the browser verifies the aggregator signature and the post root under it; an in-browser verifier for the permitted proof and a table commitment close it"},"at":"2026-10-08T19:46:20.696Z","method":"static","requirement_id":"VER-01","decision":"FAIL","reviewer":"","claim_impact":"","release_identity":{"commit":"4cdcc488","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"run_id":"ra-20261008T1915-ver","evidence":"tools/reference-apps/ver/evidence/VER-01.json","in_progress":false}}},{"id":"VER-02","title":"Verify evolving authority and execution statements","setup":"Use valid state proofs paired with wrong execution statements or stale authority histories.","steps":["Cross voter and verifier changes with offline clients returning after long intervals.","Alter roots, aggregate identity and proof/public-input bindings independently.","Check local verification rather than merely a server-reported verified flag."],"accept":"All advertised proof checks occur locally or the remaining trust is explicitly disclosed. Wrong roots and unauthenticated authority are rejected; unsupported verification paths are not claimed.","evidence":"Client verification trace; corrupted inputs; offline/upgrade results.","priority":"BLOCKER","profile":"P01; P09","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[20,25,35,37],"gate":"Technical readiness / claimed options","owner":"Wallet + light-client lead; independent security review","manual_page":51,"owner_lane":"reference-apps lane (a2060899d2a27d31c)","run_status":"FAIL","evidence_path":"tools/reference-apps/ver/evidence/VER-01.json","run_id":"ra-20261008T1915-ver","updated":"2026-10-08T19:46:20.696Z","evidence_record":{"cell":"harness:reference-apps-ver-trust-anchor","manifest_sha":"4cdcc488","coverage":{"VER-01":"fails today, disclosed: the light client authenticates the certificate's signatures and the header path but the voter table is a node-supplied trust anchor named on /light; a forged table signature and a wrong-network certificate are refused","VER-02":"fails today, disclosed: the execution statement's proof is verified by the nodes and the browser verifies the aggregator signature and the post root under it; an in-browser verifier for the permitted proof and a table commitment close it"},"at":"2026-10-08T19:46:20.696Z","method":"static","requirement_id":"VER-02","decision":"FAIL","reviewer":"","claim_impact":"","release_identity":{"commit":"4cdcc488","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null},"evidence_records":{"harness:reference-apps-ver-trust-anchor":{"cell":"harness:reference-apps-ver-trust-anchor","manifest_sha":"4cdcc488","coverage":{"VER-01":"fails today, disclosed: the light client authenticates the certificate's signatures and the header path but the voter table is a node-supplied trust anchor named on /light; a forged table signature and a wrong-network certificate are refused","VER-02":"fails today, disclosed: the execution statement's proof is verified by the nodes and the browser verifies the aggregator signature and the post root under it; an in-browser verifier for the permitted proof and a table commitment close it"},"at":"2026-10-08T19:46:20.696Z","method":"static","requirement_id":"VER-02","decision":"FAIL","reviewer":"","claim_impact":"","release_identity":{"commit":"4cdcc488","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"run_id":"ra-20261008T1915-ver","evidence":"tools/reference-apps/ver/evidence/VER-01.json","in_progress":false}}},{"id":"VER-03","title":"Prove successful payment rather than inclusion","setup":"Create successful, reverted, wrong-asset, wrong-recipient and wrong-amount transfers.","steps":["Generate receipts for included transactions, including failures and replaced/unfinalised transactions.","Verify execution status plus asset, recipient, amount and canonical-state/receipt commitment.","Replay the receipt on another chain and after an allowed unfinalised reorganisation."],"accept":"Only the actual successful, correctly bound transfer is labelled payment proof. Inclusion-only receipts are labelled as such; no node-reported success flag substitutes for authenticated outcome.","evidence":"Payment fixture corpus; receipt verification; merchant-facing status checks.","priority":"BLOCKER","profile":"P01; P09","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[20,25,35,37],"gate":"Technical readiness / claimed options","owner":"Wallet + light-client lead; independent security review","manual_page":51,"owner_lane":"reference-apps lane (a2060899d2a27d31c)","run_status":"NOT RUN","evidence_path":"tools/reference-apps/ver/evidence/summary.json","run_id":"ra-20261008T1915-ver","updated":"2026-10-08T19:46:20.696Z","evidence_record":{"cell":"harness:reference-apps-ver","manifest_sha":"4cdcc488","coverage":{"VER-03":"partial: a payment receipt is labelled payment only when the receipt is proven against the segment statement's receipts commitment under the finality certificate, inclusion-only receipts read inclusion, a tampered receipt and a flipped status fail; run on the the earlier devnet fixtures, the 2.0 devnet re-run waits for its first paid segment whose last block carries a transaction; Review B F04: a receipt claiming lock_state final under a certificate the node reports as a recovery lock is refused, a recovery lock prints as recovery lock, not final (Node and browser negative cases on the fixtures; the field is not live on devnet-4 tonight, so no live recovery lock was seen)","VER-04":"partial: the oracle's trust() names the deployer-installed table and the unchecked aggregator signature, a second hash at a stored certificate index is refused, a root claim at an unknown index is refused, another chain id is refused (tools/reference-apps/oracle/test.mjs on Sepolia); Review B F04: the Sepolia verifiers apply the two-thirds rule only, carry no lock-kind field, and an under-threshold (recovery-rule) certificate fails closed in submitCertificate, so no stored root is a recovery lock (the DEX lane's docs/bridge/light-client-bridge.md paragraph); the claimed-option review of the trust model is the reviewer's","VER-06":"partial: the read service never serves a certificate from another network, a withheld header in the path and a corrupted proof node are detected, stale data prints its lock age beside every balance, and a client told no certificate never falls back to a trusted RPC balance; detection on the fault network F4 is not run","VER-08":"partial: every served state on /light, /receipt and /oracle uses one of included, executed, proven, finalised from the shared definition block, the lock line serves the live DAA before the first certificate, and the trust assumptions are listed on each page; the wallet and explorer surfaces are their lanes' rows; Review B F04: /light, /receipt, the receipt file and the one-file verifier show a node-reported recovery lock as recovery lock, not final, /oracle says recovery locks are not accepted by its verifier, the terms block defines the recovery lock"},"at":"2026-10-08T19:46:20.696Z","method":"static","requirement_id":"VER-03","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"4cdcc488","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"in_progress_since":"2026-10-08T19:46:20.696Z","approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null},"evidence_records":{"harness:reference-apps-ver":{"cell":"harness:reference-apps-ver","manifest_sha":"4cdcc488","coverage":{"VER-03":"partial: a payment receipt is labelled payment only when the receipt is proven against the segment statement's receipts commitment under the finality certificate, inclusion-only receipts read inclusion, a tampered receipt and a flipped status fail; run on the the earlier devnet fixtures, the 2.0 devnet re-run waits for its first paid segment whose last block carries a transaction; Review B F04: a receipt claiming lock_state final under a certificate the node reports as a recovery lock is refused, a recovery lock prints as recovery lock, not final (Node and browser negative cases on the fixtures; the field is not live on devnet-4 tonight, so no live recovery lock was seen)","VER-04":"partial: the oracle's trust() names the deployer-installed table and the unchecked aggregator signature, a second hash at a stored certificate index is refused, a root claim at an unknown index is refused, another chain id is refused (tools/reference-apps/oracle/test.mjs on Sepolia); Review B F04: the Sepolia verifiers apply the two-thirds rule only, carry no lock-kind field, and an under-threshold (recovery-rule) certificate fails closed in submitCertificate, so no stored root is a recovery lock (the DEX lane's docs/bridge/light-client-bridge.md paragraph); the claimed-option review of the trust model is the reviewer's","VER-06":"partial: the read service never serves a certificate from another network, a withheld header in the path and a corrupted proof node are detected, stale data prints its lock age beside every balance, and a client told no certificate never falls back to a trusted RPC balance; detection on the fault network F4 is not run","VER-08":"partial: every served state on /light, /receipt and /oracle uses one of included, executed, proven, finalised from the shared definition block, the lock line serves the live DAA before the first certificate, and the trust assumptions are listed on each page; the wallet and explorer surfaces are their lanes' rows; Review B F04: /light, /receipt, the receipt file and the one-file verifier show a node-reported recovery lock as recovery lock, not final, /oracle says recovery locks are not accepted by its verifier, the terms block defines the recovery lock"},"at":"2026-10-08T19:46:20.696Z","method":"static","requirement_id":"VER-03","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"4cdcc488","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"run_id":"ra-20261008T1915-ver","evidence":"tools/reference-apps/ver/evidence/summary.json","in_progress":true}}},{"id":"VER-04","title":"Bound cross-chain oracle trust and replay","setup":"For a claimed oracle, freeze destination verifier, authority updates, accepted proof types and replay policy.","steps":["Try deployer-substituted keys, stale certificates, unchecked signatures and wrong source/destination identities.","Exercise legitimate authority updates and source reorganisations under the approved model.","Measure gas/cost with realistic header sets and test disabled/unavailable verification."],"accept":"The oracle enforces its declared trust model and fails closed. Deployer privileges and unavailable guarantees are explicit; no trustless-bridge claim exceeds the checks performed. Excluded oracle scope earns no pass credit.","evidence":"Oracle code/parameters; attack cases; cost report; privilege disclosure.","priority":"BLOCKER","profile":"P00; P01; P09","cadence":"Release candidate; repeat after relevant changes","method":"Claimed-option verification","status":"NOT RUN","source":[20,25,35,37],"gate":"Technical readiness / claimed options","owner":"Wallet + light-client lead; independent security review","manual_page":52,"owner_lane":"reference-apps lane (a2060899d2a27d31c)","run_status":"NOT RUN","evidence_path":"tools/reference-apps/ver/evidence/summary.json","run_id":"ra-20261008T1915-ver","updated":"2026-10-08T19:46:20.696Z","evidence_record":{"cell":"harness:reference-apps-ver","manifest_sha":"4cdcc488","coverage":{"VER-03":"partial: a payment receipt is labelled payment only when the receipt is proven against the segment statement's receipts commitment under the finality certificate, inclusion-only receipts read inclusion, a tampered receipt and a flipped status fail; run on the the earlier devnet fixtures, the 2.0 devnet re-run waits for its first paid segment whose last block carries a transaction; Review B F04: a receipt claiming lock_state final under a certificate the node reports as a recovery lock is refused, a recovery lock prints as recovery lock, not final (Node and browser negative cases on the fixtures; the field is not live on devnet-4 tonight, so no live recovery lock was seen)","VER-04":"partial: the oracle's trust() names the deployer-installed table and the unchecked aggregator signature, a second hash at a stored certificate index is refused, a root claim at an unknown index is refused, another chain id is refused (tools/reference-apps/oracle/test.mjs on Sepolia); Review B F04: the Sepolia verifiers apply the two-thirds rule only, carry no lock-kind field, and an under-threshold (recovery-rule) certificate fails closed in submitCertificate, so no stored root is a recovery lock (the DEX lane's docs/bridge/light-client-bridge.md paragraph); the claimed-option review of the trust model is the reviewer's","VER-06":"partial: the read service never serves a certificate from another network, a withheld header in the path and a corrupted proof node are detected, stale data prints its lock age beside every balance, and a client told no certificate never falls back to a trusted RPC balance; detection on the fault network F4 is not run","VER-08":"partial: every served state on /light, /receipt and /oracle uses one of included, executed, proven, finalised from the shared definition block, the lock line serves the live DAA before the first certificate, and the trust assumptions are listed on each page; the wallet and explorer surfaces are their lanes' rows; Review B F04: /light, /receipt, the receipt file and the one-file verifier show a node-reported recovery lock as recovery lock, not final, /oracle says recovery locks are not accepted by its verifier, the terms block defines the recovery lock"},"at":"2026-10-08T19:46:20.696Z","method":"static","requirement_id":"VER-04","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"4cdcc488","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"in_progress_since":"2026-10-08T19:46:20.696Z","approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null},"evidence_records":{"harness:reference-apps-ver":{"cell":"harness:reference-apps-ver","manifest_sha":"4cdcc488","coverage":{"VER-03":"partial: a payment receipt is labelled payment only when the receipt is proven against the segment statement's receipts commitment under the finality certificate, inclusion-only receipts read inclusion, a tampered receipt and a flipped status fail; run on the the earlier devnet fixtures, the 2.0 devnet re-run waits for its first paid segment whose last block carries a transaction; Review B F04: a receipt claiming lock_state final under a certificate the node reports as a recovery lock is refused, a recovery lock prints as recovery lock, not final (Node and browser negative cases on the fixtures; the field is not live on devnet-4 tonight, so no live recovery lock was seen)","VER-04":"partial: the oracle's trust() names the deployer-installed table and the unchecked aggregator signature, a second hash at a stored certificate index is refused, a root claim at an unknown index is refused, another chain id is refused (tools/reference-apps/oracle/test.mjs on Sepolia); Review B F04: the Sepolia verifiers apply the two-thirds rule only, carry no lock-kind field, and an under-threshold (recovery-rule) certificate fails closed in submitCertificate, so no stored root is a recovery lock (the DEX lane's docs/bridge/light-client-bridge.md paragraph); the claimed-option review of the trust model is the reviewer's","VER-06":"partial: the read service never serves a certificate from another network, a withheld header in the path and a corrupted proof node are detected, stale data prints its lock age beside every balance, and a client told no certificate never falls back to a trusted RPC balance; detection on the fault network F4 is not run","VER-08":"partial: every served state on /light, /receipt and /oracle uses one of included, executed, proven, finalised from the shared definition block, the lock line serves the live DAA before the first certificate, and the trust assumptions are listed on each page; the wallet and explorer surfaces are their lanes' rows; Review B F04: /light, /receipt, the receipt file and the one-file verifier show a node-reported recovery lock as recovery lock, not final, /oracle says recovery locks are not accepted by its verifier, the terms block defines the recovery lock"},"at":"2026-10-08T19:46:20.696Z","method":"static","requirement_id":"VER-04","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"4cdcc488","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"run_id":"ra-20261008T1915-ver","evidence":"tools/reference-apps/ver/evidence/summary.json","in_progress":true}}},{"id":"VER-05","title":"Reconstruct required state without founder storage","setup":"Remove founder archival/input services and start an independent operator from the documented entry point.","steps":["Fetch authenticated blocks, state/proof inputs and any required witnesses from permitted peers.","Rebuild the expected state and continue validation/proving.","Measure bandwidth, disk, time and retention requirements against advertised operator budgets."],"accept":"Required data can be obtained and verified within the declared availability model. Hidden archives or unpublished files block independence. A valid execution proof alone does not satisfy this test.","evidence":"Download/reconstruction logs; data hashes; resource costs; dependency inventory.","priority":"BLOCKER","profile":"P01; P08; P09","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[20,25,35,37],"gate":"Technical readiness / claimed options","owner":"Wallet + light-client lead; independent security review","manual_page":52,"owner_lane":"reference-apps lane (a2060899d2a27d31c)","run_status":"FAIL","evidence_path":"tools/reference-apps/ver/evidence/VER-05.json","run_id":"ra-20261008T1915-ver","updated":"2026-10-08T19:46:20.696Z","evidence_record":{"cell":"harness:reference-apps-ver-availability","manifest_sha":"4cdcc488","coverage":{"VER-05":"partial: the public read node must report startedFrom genesis (no snapshot) and the reference reader on build-1 executed the 2.0 devnet from genesis with no snapshot; the pages fetch headers, certificates, coinbase bodies and account proofs from the public read RPC only; the archive and availability model beyond the 2,048-block state ring is the OPS no-founder exercise. Run ra-20261008T1915-ver: FAIL, the public node reports startedFrom snapshot (restarted from a snapshot after 17:46 UK); the reader on build-1 still from genesis"},"at":"2026-10-08T19:46:20.696Z","method":"static","requirement_id":"VER-05","decision":"FAIL","reviewer":"","claim_impact":"","release_identity":{"commit":"4cdcc488","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null},"evidence_records":{"harness:reference-apps-ver-availability":{"cell":"harness:reference-apps-ver-availability","manifest_sha":"4cdcc488","coverage":{"VER-05":"partial: the public read node must report startedFrom genesis (no snapshot) and the reference reader on build-1 executed the 2.0 devnet from genesis with no snapshot; the pages fetch headers, certificates, coinbase bodies and account proofs from the public read RPC only; the archive and availability model beyond the 2,048-block state ring is the OPS no-founder exercise. Run ra-20261008T1915-ver: FAIL, the public node reports startedFrom snapshot (restarted from a snapshot after 17:46 UK); the reader on build-1 still from genesis"},"at":"2026-10-08T19:46:20.696Z","method":"static","requirement_id":"VER-05","decision":"FAIL","reviewer":"","claim_impact":"","release_identity":{"commit":"4cdcc488","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"run_id":"ra-20261008T1915-ver","evidence":"tools/reference-apps/ver/evidence/VER-05.json","in_progress":false}}},{"id":"VER-06","title":"Detect withholding, corruption and stale data","setup":"Serve valid commitments with missing data, corrupted chunks, stale witnesses and conflicting peer replies.","steps":["Attempt to make a validator or light client accept an unavailable or incorrect state under F0.","Test retrieval from independent peers and expiry/retry policy.","Restore data and check that recovery cannot alter an already verified commitment."],"accept":"No unjustified available/verified status; safety and admission rules match F0. Recovery is bounded where assumptions permit, and unavailable-data states remain visible instead of hidden behind proofs.","evidence":"Withholding corpus; peer retrieval traces; availability/status checks.","priority":"BLOCKER","profile":"P01; P08; P09","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[20,25,35,37],"gate":"Technical readiness / claimed options","owner":"Wallet + light-client lead; independent security review","manual_page":52,"owner_lane":"reference-apps lane (a2060899d2a27d31c)","run_status":"NOT RUN","evidence_path":"tools/reference-apps/ver/evidence/summary.json","run_id":"ra-20261008T1915-ver","updated":"2026-10-08T19:46:20.696Z","evidence_record":{"cell":"harness:reference-apps-ver","manifest_sha":"4cdcc488","coverage":{"VER-03":"partial: a payment receipt is labelled payment only when the receipt is proven against the segment statement's receipts commitment under the finality certificate, inclusion-only receipts read inclusion, a tampered receipt and a flipped status fail; run on the the earlier devnet fixtures, the 2.0 devnet re-run waits for its first paid segment whose last block carries a transaction; Review B F04: a receipt claiming lock_state final under a certificate the node reports as a recovery lock is refused, a recovery lock prints as recovery lock, not final (Node and browser negative cases on the fixtures; the field is not live on devnet-4 tonight, so no live recovery lock was seen)","VER-04":"partial: the oracle's trust() names the deployer-installed table and the unchecked aggregator signature, a second hash at a stored certificate index is refused, a root claim at an unknown index is refused, another chain id is refused (tools/reference-apps/oracle/test.mjs on Sepolia); Review B F04: the Sepolia verifiers apply the two-thirds rule only, carry no lock-kind field, and an under-threshold (recovery-rule) certificate fails closed in submitCertificate, so no stored root is a recovery lock (the DEX lane's docs/bridge/light-client-bridge.md paragraph); the claimed-option review of the trust model is the reviewer's","VER-06":"partial: the read service never serves a certificate from another network, a withheld header in the path and a corrupted proof node are detected, stale data prints its lock age beside every balance, and a client told no certificate never falls back to a trusted RPC balance; detection on the fault network F4 is not run","VER-08":"partial: every served state on /light, /receipt and /oracle uses one of included, executed, proven, finalised from the shared definition block, the lock line serves the live DAA before the first certificate, and the trust assumptions are listed on each page; the wallet and explorer surfaces are their lanes' rows; Review B F04: /light, /receipt, the receipt file and the one-file verifier show a node-reported recovery lock as recovery lock, not final, /oracle says recovery locks are not accepted by its verifier, the terms block defines the recovery lock"},"at":"2026-10-08T19:46:20.696Z","method":"static","requirement_id":"VER-06","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"4cdcc488","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"in_progress_since":"2026-10-08T19:46:20.696Z","approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null},"evidence_records":{"harness:reference-apps-ver":{"cell":"harness:reference-apps-ver","manifest_sha":"4cdcc488","coverage":{"VER-03":"partial: a payment receipt is labelled payment only when the receipt is proven against the segment statement's receipts commitment under the finality certificate, inclusion-only receipts read inclusion, a tampered receipt and a flipped status fail; run on the the earlier devnet fixtures, the 2.0 devnet re-run waits for its first paid segment whose last block carries a transaction; Review B F04: a receipt claiming lock_state final under a certificate the node reports as a recovery lock is refused, a recovery lock prints as recovery lock, not final (Node and browser negative cases on the fixtures; the field is not live on devnet-4 tonight, so no live recovery lock was seen)","VER-04":"partial: the oracle's trust() names the deployer-installed table and the unchecked aggregator signature, a second hash at a stored certificate index is refused, a root claim at an unknown index is refused, another chain id is refused (tools/reference-apps/oracle/test.mjs on Sepolia); Review B F04: the Sepolia verifiers apply the two-thirds rule only, carry no lock-kind field, and an under-threshold (recovery-rule) certificate fails closed in submitCertificate, so no stored root is a recovery lock (the DEX lane's docs/bridge/light-client-bridge.md paragraph); the claimed-option review of the trust model is the reviewer's","VER-06":"partial: the read service never serves a certificate from another network, a withheld header in the path and a corrupted proof node are detected, stale data prints its lock age beside every balance, and a client told no certificate never falls back to a trusted RPC balance; detection on the fault network F4 is not run","VER-08":"partial: every served state on /light, /receipt and /oracle uses one of included, executed, proven, finalised from the shared definition block, the lock line serves the live DAA before the first certificate, and the trust assumptions are listed on each page; the wallet and explorer surfaces are their lanes' rows; Review B F04: /light, /receipt, the receipt file and the one-file verifier show a node-reported recovery lock as recovery lock, not final, /oracle says recovery locks are not accepted by its verifier, the terms block defines the recovery lock"},"at":"2026-10-08T19:46:20.696Z","method":"static","requirement_id":"VER-06","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"4cdcc488","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"run_id":"ra-20261008T1915-ver","evidence":"tools/reference-apps/ver/evidence/summary.json","in_progress":true}}},{"id":"VER-07","title":"Protect wallet keys, signing and recovery","setup":"Use test-only keys, encrypted backups and clean replacement devices; no real user funds.","steps":["Attempt secret access from proving jobs, logs, crash dumps, clipboard and telemetry paths.","Verify transaction destination/amount before signing; test backup/restore and wrong-password handling.","Upgrade and recover without silently changing signing authority or exposing seed material."],"accept":"No unintended secret disclosure or unauthorised signature. Supported recovery restores the correct keys and accounts; users receive explicit risk/backup information. Logs are sanitised without hiding security evidence.","evidence":"Security review; canary-secret tests; signing fixtures; restore journey.","priority":"BLOCKER","profile":"P01; P09","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[20,25,35,37],"gate":"Technical readiness / claimed options","owner":"Wallet + light-client lead; independent security review","manual_page":53,"owner_lane":"shipper (ae892a8b0f78fe31c)","run_status":"NOT RUN","evidence_path":"","run_id":"","updated":"2026-10-08T19:22:31.798Z","evidence_record":{"reason":"wallet key protection is the wallet lane's security row","at":"2026-10-08T19:22:31.798Z","method":"static","requirement_id":"VER-07","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null},"evidence_records":{"record":{"reason":"wallet key protection is the wallet lane's security row","at":"2026-10-08T19:22:31.798Z","method":"static","requirement_id":"VER-07","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"run_id":"","evidence":"","in_progress":false}}},{"id":"VER-08","title":"Keep every user-facing state truthful","setup":"Create included-only, executed, proven, finalised, reverted, stale and paused examples.","steps":["Compare explorer, wallet, receipt, RPC and customer API labels against authenticated evidence.","Interrupt finality and proof services and observe refresh/reconnect behaviour.","Check statements about privacy, Ethereum security and device support."],"accept":"No stronger state is implied than verified; stale data is marked and failures are actionable. EVM compatibility is not labelled Ethereum security, and ZK technology is not automatically labelled transaction privacy.","evidence":"Cross-surface screenshots/logs; state mapping; claim review.","priority":"BLOCKER","profile":"P01; P09","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[20,25,35,37],"gate":"Technical readiness / claimed options","owner":"Wallet + light-client lead; independent security review","manual_page":53,"owner_lane":"reference-apps lane (a2060899d2a27d31c)","run_status":"NOT RUN","evidence_path":"tools/reference-apps/ver/evidence/summary.json","run_id":"ra-20261008T1915-ver","updated":"2026-10-08T19:46:20.696Z","evidence_record":{"cell":"harness:reference-apps-ver","manifest_sha":"4cdcc488","coverage":{"VER-03":"partial: a payment receipt is labelled payment only when the receipt is proven against the segment statement's receipts commitment under the finality certificate, inclusion-only receipts read inclusion, a tampered receipt and a flipped status fail; run on the the earlier devnet fixtures, the 2.0 devnet re-run waits for its first paid segment whose last block carries a transaction; Review B F04: a receipt claiming lock_state final under a certificate the node reports as a recovery lock is refused, a recovery lock prints as recovery lock, not final (Node and browser negative cases on the fixtures; the field is not live on devnet-4 tonight, so no live recovery lock was seen)","VER-04":"partial: the oracle's trust() names the deployer-installed table and the unchecked aggregator signature, a second hash at a stored certificate index is refused, a root claim at an unknown index is refused, another chain id is refused (tools/reference-apps/oracle/test.mjs on Sepolia); Review B F04: the Sepolia verifiers apply the two-thirds rule only, carry no lock-kind field, and an under-threshold (recovery-rule) certificate fails closed in submitCertificate, so no stored root is a recovery lock (the DEX lane's docs/bridge/light-client-bridge.md paragraph); the claimed-option review of the trust model is the reviewer's","VER-06":"partial: the read service never serves a certificate from another network, a withheld header in the path and a corrupted proof node are detected, stale data prints its lock age beside every balance, and a client told no certificate never falls back to a trusted RPC balance; detection on the fault network F4 is not run","VER-08":"partial: every served state on /light, /receipt and /oracle uses one of included, executed, proven, finalised from the shared definition block, the lock line serves the live DAA before the first certificate, and the trust assumptions are listed on each page; the wallet and explorer surfaces are their lanes' rows; Review B F04: /light, /receipt, the receipt file and the one-file verifier show a node-reported recovery lock as recovery lock, not final, /oracle says recovery locks are not accepted by its verifier, the terms block defines the recovery lock"},"at":"2026-10-08T19:46:20.696Z","method":"static","requirement_id":"VER-08","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"4cdcc488","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"in_progress_since":"2026-10-08T19:46:20.696Z","approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null},"evidence_records":{"harness:reference-apps-ver":{"cell":"harness:reference-apps-ver","manifest_sha":"4cdcc488","coverage":{"VER-03":"partial: a payment receipt is labelled payment only when the receipt is proven against the segment statement's receipts commitment under the finality certificate, inclusion-only receipts read inclusion, a tampered receipt and a flipped status fail; run on the the earlier devnet fixtures, the 2.0 devnet re-run waits for its first paid segment whose last block carries a transaction; Review B F04: a receipt claiming lock_state final under a certificate the node reports as a recovery lock is refused, a recovery lock prints as recovery lock, not final (Node and browser negative cases on the fixtures; the field is not live on devnet-4 tonight, so no live recovery lock was seen)","VER-04":"partial: the oracle's trust() names the deployer-installed table and the unchecked aggregator signature, a second hash at a stored certificate index is refused, a root claim at an unknown index is refused, another chain id is refused (tools/reference-apps/oracle/test.mjs on Sepolia); Review B F04: the Sepolia verifiers apply the two-thirds rule only, carry no lock-kind field, and an under-threshold (recovery-rule) certificate fails closed in submitCertificate, so no stored root is a recovery lock (the DEX lane's docs/bridge/light-client-bridge.md paragraph); the claimed-option review of the trust model is the reviewer's","VER-06":"partial: the read service never serves a certificate from another network, a withheld header in the path and a corrupted proof node are detected, stale data prints its lock age beside every balance, and a client told no certificate never falls back to a trusted RPC balance; detection on the fault network F4 is not run","VER-08":"partial: every served state on /light, /receipt and /oracle uses one of included, executed, proven, finalised from the shared definition block, the lock line serves the live DAA before the first certificate, and the trust assumptions are listed on each page; the wallet and explorer surfaces are their lanes' rows; Review B F04: /light, /receipt, the receipt file and the one-file verifier show a node-reported recovery lock as recovery lock, not final, /oracle says recovery locks are not accepted by its verifier, the terms block defines the recovery lock"},"at":"2026-10-08T19:46:20.696Z","method":"static","requirement_id":"VER-08","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"4cdcc488","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"run_id":"ra-20261008T1915-ver","evidence":"tools/reference-apps/ver/evidence/summary.json","in_progress":true}}}]},{"code":"OPS","title":"Independent operation and release security","source":[21,24,25,26],"gate":"G5","owner":"Operations + release leads; independent operators","fixtures":"F4 isolated multi-operator network; F0 signed releases; F9 telemetry","summary":"A permissionless specification must remain operational without privileged infrastructure or unsafe automatic updates.","tests":[{"id":"OPS-01","title":"Run the complete no-founder exercise","setup":"Use the P11 independent network, adequate honest participation and enough non-founder capacity for W.","steps":["Remove founder miners, provers, aggregators, RPC, DNS/bootstrap dependencies and private support access.","Run the full P11 period while crossing real and separately labelled accelerated boundaries.","Introduce scheduled faults and have independent operators recover using published instructions."],"accept":"No founder action, secret file, privileged key or emergency anti-chip rule is needed. P07/P08 outcomes hold within assumptions; any intervention is recorded as a failed no-rescue run, not erased.","evidence":"Operator roster/conflict checks; dependency removals; full activity/intervention log.","priority":"BLOCKER","profile":"P07; P08; P11","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[21,24,25,26],"gate":"G5","owner":"Operations + release leads; independent operators","manual_page":54,"owner_lane":"node lane (a283f5f0d364ceef0)","run_status":"NOT RUN","evidence_path":"","run_id":"","updated":"2026-10-08T19:22:31.798Z","evidence_record":{"reason":"the no-founder exercise is an operations run, not a suite","at":"2026-10-08T19:22:31.798Z","method":"static","requirement_id":"OPS-01","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null},"evidence_records":{"record":{"reason":"the no-founder exercise is an operations run, not a suite","at":"2026-10-08T19:22:31.798Z","method":"static","requirement_id":"OPS-01","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"run_id":"","evidence":"","in_progress":false}}},{"id":"OPS-02","title":"Diversify bootstrap and resist peer isolation","setup":"Start nodes without the default bootstrap host and give others adversarial peer lists.","steps":["Attempt eclipse through peer concentration, stale discovery, poisoned DNS and repeated identities in an isolated lab.","Use independent documented discovery paths and validate returned chain data.","Measure synchronisation, peer diversity and recovery after benign connectivity returns."],"accept":"No unauthenticated history is trusted; bootstrap has no hidden single-provider requirement. Isolation is detected/contained according to F0 and recovery meets P08 when assumptions return.","evidence":"Peer/discovery traces; eclipse scenarios; startup and recovery evidence.","priority":"BLOCKER","profile":"P01; P08; P09","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[21,24,25,26],"gate":"G5","owner":"Operations + release leads; independent operators","manual_page":54,"owner_lane":"build-server lane (a352e49ff4613df86)","run_status":"NOT RUN","evidence_path":"","run_id":"","updated":"2026-10-08T19:22:31.798Z","evidence_record":{"reason":"bootstrap diversity needs the fault network F4","at":"2026-10-08T19:22:31.798Z","method":"static","requirement_id":"OPS-02","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null},"evidence_records":{"record":{"reason":"bootstrap diversity needs the fault network F4","at":"2026-10-08T19:22:31.798Z","method":"static","requirement_id":"OPS-02","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"run_id":"","evidence":"","in_progress":false}}},{"id":"OPS-03","title":"Separate update distribution from consensus authority","setup":"Use test signing keys and clean desktop/node installations with valid, stale and malicious packages.","steps":["Offer signed updates with unexpected consensus rules, downgraded binaries and corrupted payloads.","Test explicit operator acceptance and the published signing-key incident procedure.","Confirm that distribution-key possession cannot independently activate new consensus rules."],"accept":"Tampering/unauthorised rollback is rejected; updates do not silently transfer authority. Approved acceptance and activation are separate. No test touches production signing material.","evidence":"Package corpus; approval/activation traces; compromised-key rehearsal.","priority":"BLOCKER","profile":"P01; P09","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[21,24,25,26],"gate":"G5","owner":"Operations + release leads; independent operators","manual_page":54,"owner_lane":"shipper (ae892a8b0f78fe31c)","run_status":"NOT RUN","evidence_path":"site/release-manifest.json; docs/plans/evidence/UX-01-20261008.md","run_id":"site-manifest-20261008-01","updated":"2026-10-08T20:50:41.730Z","evidence_record":{"requirement_id":"OPS-03","decision":"NOT RUN","method":"static","cell":"site:manifest","manifest_sha":"3f1a3f332","run_id":"site-manifest-20261008-01","evidence":"site/release-manifest.json","in_progress":false,"coverage":"partial: the manifest's versions and network blocks regenerate from their sources; the separation itself is the node suites' (suite:exec, suite:p2p-flows)","release_identity":{"commit":"3f1a3f332","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"claim_impact":"the versions block on /release.json, /download and /miner; no claim moves","reviewer":"","at":"2026-10-08T20:50:41.730Z"},"approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null},"evidence_records":{"site:manifest":{"requirement_id":"OPS-03","decision":"NOT RUN","method":"static","cell":"site:manifest","manifest_sha":"3f1a3f332","run_id":"site-manifest-20261008-01","evidence":"site/release-manifest.json","in_progress":false,"coverage":"partial: the manifest's versions and network blocks regenerate from their sources; the separation itself is the node suites' (suite:exec, suite:p2p-flows)","release_identity":{"commit":"3f1a3f332","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"claim_impact":"the versions block on /release.json, /download and /miner; no claim moves","reviewer":"","at":"2026-10-08T20:50:41.730Z"},"pc:install-update":{"requirement_id":"OPS-03","decision":"NOT RUN","method":"team-reported","cell":"pc:install-update","manifest_sha":"aa354ed5","run_id":"ux-01-20261008-win-2.0.0","evidence":"docs/plans/evidence/UX-01-20261008.md","in_progress":true,"coverage":"partial: the update path's read-back and the signed manifest's verify on the PC (a tampered or rolled-back payload is refused by the engine's manifest check); authority separation is the shipper's review","release_identity":{"commit":"aa354ed5","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"claim_impact":"","reviewer":"","at":"2026-10-08T20:42:25.701Z"}},"in_progress_since":"2026-10-08T20:42:25.701Z"},{"id":"OPS-04","title":"Recover nodes from crash and storage damage","setup":"Use production database/snapshot paths with controlled interrupted writes and corrupted test storage.","steps":["Crash during import, proof acceptance, reward application and snapshot generation.","Restore from independently verified snapshots or re-sync through documented procedures.","Compare roots, certificates, balances and processed-job IDs with an unaffected node."],"accept":"No corrupt snapshot is trusted, no duplicate payout and no loss of authenticated final state. Recovery meets P08 where data is available; ambiguous corruption fails closed and is actionable.","evidence":"Crash schedule; snapshot hashes; root/balance diffs; recovery timing.","priority":"BLOCKER","profile":"P01; P08","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[21,24,25,26],"gate":"G5","owner":"Operations + release leads; independent operators","manual_page":55,"owner_lane":"node lane (a283f5f0d364ceef0)","run_status":"NOT RUN","evidence_path":"build-1:/srv/artefacts/tas/201-7cfa422a-aa0e0f45/node-7cfa422a/box4-exec.log","run_id":"201-7cfa422a-aa0e0f45","updated":"2026-10-08T19:32:50.856Z","evidence_record":{"cell":"suite:exec","manifest_sha":"7cfa422a","coverage":{"ZKP-01":"partial: a real proof verifies, a wrong statement and garbage are refused (nativeverify)","ZKP-03":"partial: a snapshot under another digest refused, the epoch streams bound to the digest","OPS-04":"partial: snapshot install, replay and genesis recapture after a crash","EVM-02":"partial: the replay tests on the day stream; the signature and chain-id binding vectors are an EVM harness still to map"},"at":"2026-10-08T19:32:50.856Z","method":"native","requirement_id":"OPS-04","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"7cfa422a","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"in_progress_since":"2026-10-08T19:32:50.856Z","approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null},"evidence_records":{"suite:exec":{"cell":"suite:exec","manifest_sha":"7cfa422a","coverage":{"ZKP-01":"partial: a real proof verifies, a wrong statement and garbage are refused (nativeverify)","ZKP-03":"partial: a snapshot under another digest refused, the epoch streams bound to the digest","OPS-04":"partial: snapshot install, replay and genesis recapture after a crash","EVM-02":"partial: the replay tests on the day stream; the signature and chain-id binding vectors are an EVM harness still to map"},"at":"2026-10-08T19:32:50.856Z","method":"native","requirement_id":"OPS-04","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"7cfa422a","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"run_id":"201-7cfa422a-aa0e0f45","evidence":"build-1:/srv/artefacts/tas/201-7cfa422a-aa0e0f45/node-7cfa422a/box4-exec.log","in_progress":true}}},{"id":"OPS-05","title":"Isolate untrusted proving workloads","setup":"Run hostile test jobs with secret canaries and restrictive worker permissions.","steps":["Attempt filesystem escape, process spawning, resource exhaustion, network access and key-store reads.","Crash workers and inspect host, wallet and node availability plus dump/log contents.","Retry on every supported isolation backend and check dependency vulnerability handling."],"accept":"No secret leakage or unauthorised host action; P09 resource containment holds. Worker failure does not compromise validator/wallet authority; unsupported isolation is not marketed as safe execution.","evidence":"Sandbox penetration report; canary logs; resource limits; host-integrity checks.","priority":"BLOCKER","profile":"P01; P09","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[21,24,25,26],"gate":"G5","owner":"Operations + release leads; independent operators","manual_page":55,"owner_lane":"build-server lane (a352e49ff4613df86)","run_status":"NOT RUN","evidence_path":"","run_id":"","updated":"2026-10-08T19:22:31.798Z","evidence_record":{"reason":"proving workload isolation is the fleet's pod row","at":"2026-10-08T19:22:31.798Z","method":"static","requirement_id":"OPS-05","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null},"evidence_records":{"record":{"reason":"proving workload isolation is the fleet's pod row","at":"2026-10-08T19:22:31.798Z","method":"static","requirement_id":"OPS-05","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"run_id":"","evidence":"","in_progress":false}}},{"id":"OPS-06","title":"Contain malicious network and API traffic","setup":"Use an authorised isolated load environment with declared resource and request-rate budgets.","steps":["Send malformed headers, proofs, oversized messages, floods and invalid peer sequences.","Measure legitimate traffic, memory/disk growth and validator CPU use.","Test limit resets, peer reconnect and graceful degradation without disabling validation."],"accept":"P09 abuse budgets hold; no unbounded allocation, persistent crash or invalid acceptance. Backpressure is visible and honest users retain the specified service at admitted load.","evidence":"Load/corpus manifests; resource series; valid-traffic metrics; incident traces.","priority":"BLOCKER","profile":"P01; P09","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[21,24,25,26],"gate":"G5","owner":"Operations + release leads; independent operators","manual_page":55,"owner_lane":"build-server lane (a352e49ff4613df86)","run_status":"NOT RUN","evidence_path":"build-1:/srv/artefacts/tas/201-7cfa422a-aa0e0f45/node-7cfa422a/box4-p2p-flows.log","run_id":"201-7cfa422a-aa0e0f45","updated":"2026-10-08T19:32:50.856Z","evidence_record":{"cell":"suite:p2p-flows","manifest_sha":"7cfa422a","coverage":{"OPS-06":"partial: malformed relay messages refused; traffic containment under load is an OPS harness","ZKP-06":"partial: proof relay coverage tests; aggregation completeness is the proving lane's test set"},"at":"2026-10-08T19:32:50.856Z","method":"native","requirement_id":"OPS-06","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"7cfa422a","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"in_progress_since":"2026-10-08T19:32:50.856Z","approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null},"evidence_records":{"suite:p2p-flows":{"cell":"suite:p2p-flows","manifest_sha":"7cfa422a","coverage":{"OPS-06":"partial: malformed relay messages refused; traffic containment under load is an OPS harness","ZKP-06":"partial: proof relay coverage tests; aggregation completeness is the proving lane's test set"},"at":"2026-10-08T19:32:50.856Z","method":"native","requirement_id":"OPS-06","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"7cfa422a","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"run_id":"201-7cfa422a-aa0e0f45","evidence":"build-1:/srv/artefacts/tas/201-7cfa422a-aa0e0f45/node-7cfa422a/box4-p2p-flows.log","in_progress":true}}},{"id":"OPS-07","title":"Detect failures with usable evidence and runbooks","setup":"Define alerts for invalid acceptance, conflicting finality, backlog, data loss, payout mismatch and stale status.","steps":["Inject one instance of each monitored failure in the lab.","Have an unaffiliated operator diagnose it using only emitted evidence and published instructions.","Test redaction, metric freshness and duplicate-alert suppression without suppressing serious failures."],"accept":"P10 alert/detection limits hold; every blocker produces actionable evidence. Monitoring does not leak secrets or mislabel intentional safe pauses as successful finality.","evidence":"Alert matrix; detection timelines; independent runbook exercise.","priority":"GATE","profile":"P09; P10","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[21,24,25,26],"gate":"G5","owner":"Operations + release leads; independent operators","manual_page":56,"owner_lane":"build-server lane (a352e49ff4613df86)","run_status":"NOT RUN","evidence_path":"","run_id":"","updated":"2026-10-08T19:22:31.798Z","evidence_record":{"reason":"runbook detection is an operations run","at":"2026-10-08T19:22:31.798Z","method":"static","requirement_id":"OPS-07","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null},"evidence_records":{"record":{"reason":"runbook detection is an operations run","at":"2026-10-08T19:22:31.798Z","method":"static","requirement_id":"OPS-07","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"run_id":"","evidence":"","in_progress":false}}},{"id":"OPS-08","title":"Repeat independent operation across releases","setup":"Use a clean previous supported version and the final candidate with independent operators.","steps":["Perform documented rolling upgrade, rollback of non-consensus software where allowed and resynchronisation.","Cross activation with mixed versions and unavailable founder distribution hosts.","Re-run affected gates after changes and preserve prior failures and incident lessons."],"accept":"No undocumented privileged migration or automatic consensus rewrite. All affected evidence is refreshed; P11 no-rescue results remain tied to the final release, not an earlier build.","evidence":"Upgrade/replay logs; invalidation map; repeated gate signatures.","priority":"BLOCKER","profile":"P00; P08; P11","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[21,24,25,26],"gate":"G5","owner":"Operations + release leads; independent operators","manual_page":56,"owner_lane":"build-server lane (a352e49ff4613df86)","run_status":"NOT RUN","evidence_path":"","run_id":"","updated":"2026-10-08T19:22:31.798Z","evidence_record":{"reason":"repeat independent operation is a cross-release observation","at":"2026-10-08T19:22:31.798Z","method":"static","requirement_id":"OPS-08","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null},"evidence_records":{"record":{"reason":"repeat independent operation is a cross-release observation","at":"2026-10-08T19:22:31.798Z","method":"static","requirement_id":"OPS-08","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"run_id":"","evidence":"","in_progress":false}}}],"notes":[{"at":"2026-10-08T19:32:50.976Z","text":"F14 (Review B), the founder's ruling 8 October 19:57 UK: the public miner ships from 2.0.2 without remote jobs; our own fleet runs the lab build with its own signing root"}]},{"code":"UX","title":"Ember, payouts and operator control","source":[14,21,25,26],"gate":"Operator readiness / G5","owner":"Desktop product + pool leads; independent usability study","fixtures":"F2 supported desktops; F8 user study; F4 honest/malicious pools","summary":"Successful participation must be practical for ordinary owners without hidden custody or loss of consensus authority.","tests":[{"id":"UX-01","title":"Onboard ordinary owners on native desktop apps","setup":"Recruit the P10 first-time user cohort across Windows and macOS using supported physical hardware.","steps":["Observe install, hardware detection, safety explanation and first accepted work without staff intervention.","Record download/data preparation separately as well as complete end-to-end time.","Test unsupported hardware and insufficient memory messaging rather than forcing a failed start."],"accept":"P10 completion/time targets hold with no unsafe default or concealed prerequisite. The product is tested as the actual desktop app, not only a browser preview.","evidence":"Consent-based study records; task timings; failure reasons; compatibility outcomes.","priority":"GATE","profile":"P10","cadence":"Release candidate; repeat after relevant changes","method":"Independent observed user study","status":"NOT RUN","source":[14,21,25,26],"gate":"Operator readiness / G5","owner":"Desktop product + pool leads; independent usability study","manual_page":57,"owner_lane":"update-return lane (a22d765a2e0355a9f)","run_status":"NOT RUN","evidence_path":"docs/plans/evidence/UX-01-20261008.md","run_id":"ux-01-20261008-win-2.0.0","updated":"2026-10-08T20:42:25.701Z","approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null},"evidence_records":{"pc:install-update":{"requirement_id":"UX-01","decision":"NOT RUN","method":"team-reported","cell":"pc:install-update","manifest_sha":"aa354ed5","run_id":"ux-01-20261008-win-2.0.0","evidence":"docs/plans/evidence/UX-01-20261008.md","in_progress":true,"coverage":"team-run evidence only (the two PCs taking the Windows entry through the app's own update path with no click and mining on every card); the P10 study is NOT RUN until unaffiliated participants are recruited","release_identity":{"commit":"aa354ed5","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"claim_impact":"","reviewer":"","at":"2026-10-08T20:42:25.701Z"}},"evidence_record":{"requirement_id":"UX-01","decision":"NOT RUN","method":"team-reported","cell":"pc:install-update","manifest_sha":"aa354ed5","run_id":"ux-01-20261008-win-2.0.0","evidence":"docs/plans/evidence/UX-01-20261008.md","in_progress":true,"coverage":"team-run evidence only (the two PCs taking the Windows entry through the app's own update path with no click and mining on every card); the P10 study is NOT RUN until unaffiliated participants are recruited","release_identity":{"commit":"aa354ed5","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"claim_impact":"","reviewer":"","at":"2026-10-08T20:42:25.701Z"},"in_progress_since":"2026-10-08T20:42:25.701Z"},{"id":"UX-02","title":"Make pause, stop and safe tuning reliable","setup":"Run mining/proving on active desktops under contention and safe thermal stress.","steps":["Use pause, stop, power limit, task selection and emergency local shutdown controls.","Crash or restart the UI while workers run and verify ownership of background processes.","Restore the original hardware settings and test power-saving/low-battery behaviour where supported."],"accept":"P10 control latency and safe-state requirements hold. Stopping does not strand an uncontrolled process; tuning never depends on unsafe settings or silent privilege escalation.","evidence":"Control timings; process/settings audit; restart and safety traces.","priority":"BLOCKER","profile":"P01; P10","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[14,21,25,26],"gate":"Operator readiness / G5","owner":"Desktop product + pool leads; independent usability study","manual_page":57,"owner_lane":"shipper (ae892a8b0f78fe31c)","run_status":"NOT RUN","evidence_path":"build-1:/srv/artefacts/tas/201-7cfa422a-aa0e0f45/miner-9c844503/box2-app.log","run_id":"201-7cfa422a-aa0e0f45","updated":"2026-10-08T19:32:50.856Z","evidence_record":{"cell":"suite:app","manifest_sha":"7cfa422a","coverage":{"UX-02":"partial: the engine state machine's pause, stop and knob tests; the operator study is UX-01's","UX-03":"partial: the card and earnings rendering tests; the net-earnings model against real bills is COM/ECO evidence","UX-07":"partial: the refused-update and manifest tests; the update-return lane's install classes are its own rows","VER-08":"partial: the app's own state-word tests; the wallet and light client rows are VER-01 to VER-03"},"at":"2026-10-08T19:32:50.856Z","method":"native","requirement_id":"UX-02","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"7cfa422a","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"in_progress_since":"2026-10-08T19:32:50.856Z","approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null},"evidence_records":{"suite:app":{"cell":"suite:app","manifest_sha":"7cfa422a","coverage":{"UX-02":"partial: the engine state machine's pause, stop and knob tests; the operator study is UX-01's","UX-03":"partial: the card and earnings rendering tests; the net-earnings model against real bills is COM/ECO evidence","UX-07":"partial: the refused-update and manifest tests; the update-return lane's install classes are its own rows","VER-08":"partial: the app's own state-word tests; the wallet and light client rows are VER-01 to VER-03"},"at":"2026-10-08T19:32:50.856Z","method":"native","requirement_id":"UX-02","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"7cfa422a","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"run_id":"201-7cfa422a-aa0e0f45","evidence":"build-1:/srv/artefacts/tas/201-7cfa422a-aa0e0f45/miner-9c844503/box2-app.log","in_progress":true}}},{"id":"UX-03","title":"Show net earnings and compatibility honestly","setup":"Use known rewards, fees, energy readings, retries and operator-entered tariffs.","steps":["Compare mining, internal proof and external proof income with authoritative ledgers.","Show gross/net estimates, measurement boundaries, tariff assumptions and payout status.","Test stale data, losses, negative margins and mining-only versus proving-compatible devices."],"accept":"P10 reconciliation limits hold and uncertainty is visible. No guaranteed profits, fabricated fiat price or inferred proving support; provisional earnings are not shown as settled payments.","evidence":"UI/ledger comparisons; tariff fixtures; stale/negative examples.","priority":"BLOCKER","profile":"P01; P10; P12","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[14,21,25,26],"gate":"Operator readiness / G5","owner":"Desktop product + pool leads; independent usability study","manual_page":57,"owner_lane":"shipper (ae892a8b0f78fe31c)","run_status":"NOT RUN","evidence_path":"build-1:/srv/artefacts/tas/201-7cfa422a-aa0e0f45/miner-9c844503/box2-app.log","run_id":"201-7cfa422a-aa0e0f45","updated":"2026-10-08T19:32:50.856Z","evidence_record":{"cell":"suite:app","manifest_sha":"7cfa422a","coverage":{"UX-02":"partial: the engine state machine's pause, stop and knob tests; the operator study is UX-01's","UX-03":"partial: the card and earnings rendering tests; the net-earnings model against real bills is COM/ECO evidence","UX-07":"partial: the refused-update and manifest tests; the update-return lane's install classes are its own rows","VER-08":"partial: the app's own state-word tests; the wallet and light client rows are VER-01 to VER-03"},"at":"2026-10-08T19:32:50.856Z","method":"native","requirement_id":"UX-03","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"7cfa422a","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"in_progress_since":"2026-10-08T19:32:50.856Z","approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null},"evidence_records":{"suite:app":{"cell":"suite:app","manifest_sha":"7cfa422a","coverage":{"UX-02":"partial: the engine state machine's pause, stop and knob tests; the operator study is UX-01's","UX-03":"partial: the card and earnings rendering tests; the net-earnings model against real bills is COM/ECO evidence","UX-07":"partial: the refused-update and manifest tests; the update-return lane's install classes are its own rows","VER-08":"partial: the app's own state-word tests; the wallet and light client rows are VER-01 to VER-03"},"at":"2026-10-08T19:32:50.856Z","method":"native","requirement_id":"UX-03","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"7cfa422a","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"run_id":"201-7cfa422a-aa0e0f45","evidence":"build-1:/srv/artefacts/tas/201-7cfa422a-aa0e0f45/miner-9c844503/box2-app.log","in_progress":true}}},{"id":"UX-04","title":"Pay small operators without hidden custody","setup":"Use ordinary single-card balances and the actual pooling/payment path.","steps":["Earn, request/receive payment, disconnect and reconnect; include low balances, fees and a pool outage.","Attempt redirection, delayed accounting and withdrawal of another user's entitlement.","Reconcile displayed balances with canonical entitlement and actual settlement."],"accept":"P10 payout limits hold for the declared small-operator case. No unauthorised custody, redirection or unexplained loss; thresholds and fees are disclosed rather than masked by larger test balances.","evidence":"Single-card payout ledger; pool failure record; custody/authorisation review.","priority":"BLOCKER","profile":"P01; P10","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[14,21,25,26],"gate":"Operator readiness / G5","owner":"Desktop product + pool leads; independent usability study","manual_page":58,"owner_lane":"pool design seat (a3832b1c3b274b310)","run_status":"NOT RUN","evidence_path":"docs/analysis/pool/pool-pair-2026-10-08.md","run_id":"pool-2.0-20261008-03","updated":"2026-10-08T20:48:42.741Z","evidence_record":{"requirement_id":"UX-04","decision":"NOT RUN","method":"native","cell":"suite:pool","manifest_sha":"986252e73","run_id":"pool-2.0-20261008-03","evidence":"docs/analysis/pool/pool-pair-2026-10-08.md","in_progress":true,"coverage":"partial: PPLNS distribution tests (fee first, never overpays, late joiner), the payout key file round trip, the signed transfer decode; the live payout path on the devnet-4 pair is the UX-04 batch's evidence; review B F12 and INT-03/INT-04 (8 October 2026): payout::intent_tests (a restart from the pre-broadcast snapshot, a lost send response, a crash on either side of the broadcast, a stuck transaction replaced under the same intent, a reorged receipt and a finality pause, a failed transaction, a ledger that cannot be written: never a duplicate or a lost obligation, finalised only under the chain's final lock) and state::ledger_tests (an unreadable ledger is refused or restored, never emptied); F13/INT-16: frame, admission and pool::share_tests (the frame bound while reading, the bounded outgoing queue, one membership per session, the nonce and in-flight bounds, the share and connection budgets); the devnet-4 pair's class (8 October 2026 21:24 UK): state_provider::tests::an_unsynced_node_hands_the_pool_no_state_and_no_job (no job on a node whose igneum_getExecStatus reads synced false, blocked or re-executing; known-failed first against the 8ff7a0f4 provider; pool-synced-guard-202 f3e99e9c on release-2.0.2, 986252e7 on pool-2.0, 52 of 52 on build-6)","release_identity":{"commit":"986252e73","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"claim_impact":"","reviewer":"","at":"2026-10-08T20:48:42.741Z"},"in_progress_since":"2026-10-08T19:58:33.370Z","approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null},"evidence_records":{"suite:pool":{"requirement_id":"UX-04","decision":"NOT RUN","method":"native","cell":"suite:pool","manifest_sha":"986252e73","run_id":"pool-2.0-20261008-03","evidence":"docs/analysis/pool/pool-pair-2026-10-08.md","in_progress":true,"coverage":"partial: PPLNS distribution tests (fee first, never overpays, late joiner), the payout key file round trip, the signed transfer decode; the live payout path on the devnet-4 pair is the UX-04 batch's evidence; review B F12 and INT-03/INT-04 (8 October 2026): payout::intent_tests (a restart from the pre-broadcast snapshot, a lost send response, a crash on either side of the broadcast, a stuck transaction replaced under the same intent, a reorged receipt and a finality pause, a failed transaction, a ledger that cannot be written: never a duplicate or a lost obligation, finalised only under the chain's final lock) and state::ledger_tests (an unreadable ledger is refused or restored, never emptied); F13/INT-16: frame, admission and pool::share_tests (the frame bound while reading, the bounded outgoing queue, one membership per session, the nonce and in-flight bounds, the share and connection budgets); the devnet-4 pair's class (8 October 2026 21:24 UK): state_provider::tests::an_unsynced_node_hands_the_pool_no_state_and_no_job (no job on a node whose igneum_getExecStatus reads synced false, blocked or re-executing; known-failed first against the 8ff7a0f4 provider; pool-synced-guard-202 f3e99e9c on release-2.0.2, 986252e7 on pool-2.0, 52 of 52 on build-6)","release_identity":{"commit":"986252e73","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"claim_impact":"","reviewer":"","at":"2026-10-08T20:48:42.741Z"}}},{"id":"UX-05","title":"Keep voting keys with the miner through pooling","setup":"Use an honest pool and a modified pool that replaces worker identity or voting credentials.","steps":["Verify the consensus binding from performed work to the miner's retained key.","Attempt substitution, replay and reassignment without the miner's authorisation.","Leave the pool and verify retained voting/finality rights under F0."],"accept":"No silent transfer of governance/finality authority. If the protocol cannot establish retained keys, this requirement fails; a pool-protocol name or user-interface promise does not pass.","evidence":"Work/key binding vectors; malicious-pool attempts; leave-pool authority check.","priority":"BLOCKER","profile":"P01; P09","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[14,21,25,26],"gate":"Operator readiness / G5","owner":"Desktop product + pool leads; independent usability study","manual_page":58,"owner_lane":"pool design seat (a3832b1c3b274b310)","run_status":"NOT RUN","evidence_path":"docs/analysis/pool/pool-pair-2026-10-08.md","run_id":"pool-2.0-20261008-03","updated":"2026-10-08T20:48:42.741Z","evidence_record":{"reason":"voting keys through pooling is the pool lane's row","at":"2026-10-08T20:48:42.741Z"},"in_progress_since":"2026-10-08T19:58:33.370Z","approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null},"evidence_records":{"suite:pool":{"requirement_id":"UX-05","decision":"NOT RUN","method":"native","cell":"suite:pool","manifest_sha":"986252e73","run_id":"pool-2.0-20261008-03","evidence":"docs/analysis/pool/pool-pair-2026-10-08.md","in_progress":true,"coverage":"partial: the vote-key commitment on the wire (verify::tests::a_share_under_another_key_is_refused_before_the_hash: known-pass the member's key, known-fail another key on the share and a job naming another key, refused with code vote_key before the hash), the open pool's sidechain::check_key (the claimed key, the header's key and the reveal are one key), the same-nonce-other-template wrong_hash test, the TLS binding test; the malicious-pool run and the leave-and-retain run on the devnet-4 pair are the UX-05 batch's other evidence; review B INT-15 (8 October 2026): server::authorise_tests::a_replayed_proof_of_possession_is_not_an_authorisation (a public PoP replayed into another session, payout, pool or chain, or under another key, refused; only the challenge-bound binding v2 admits on a public network) and the_binding_policy_follows_the_network","release_identity":{"commit":"986252e73","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"claim_impact":"","reviewer":"","at":"2026-10-08T20:48:42.741Z"}}},{"id":"UX-06","title":"Verify actual miner-selected work templates","setup":"Provide a pool interface with declared job-declaration support and independent miner templates.","steps":["Submit miner-selected valid transaction templates and verify what is actually hashed and accepted.","Have a pool substitute or censor templates and test local verification/fallback.","Measure payout and acceptance consequences without moving authority to the pool."],"accept":"The advertised selection control exists in accepted work, not only configuration. Undisclosed substitution is detected; supported independent operation remains practical under P10.","evidence":"Template commitments; accepted-block evidence; malicious-pool/fallback report.","priority":"BLOCKER","profile":"P01; P10","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[14,21,25,26],"gate":"Operator readiness / G5","owner":"Desktop product + pool leads; independent usability study","manual_page":58,"owner_lane":"shipper (ae892a8b0f78fe31c)","run_status":"NOT RUN","evidence_path":"build-1:/srv/artefacts/tas/201-7cfa422a-aa0e0f45/node-7cfa422a/box4-miner.log","run_id":"201-7cfa422a-aa0e0f45","updated":"2026-10-08T19:32:50.856Z","evidence_record":{"cell":"suite:miner","manifest_sha":"7cfa422a","coverage":{"UX-06":"partial: the miner's own template selection tests","UX-04":"partial: payout label and share accounting tests; custody is the pool lane's row","POW-01":"partial: the pack re-check seam against the pack's 96 vectors (recheck_pack); the million-vector campaign is harness:p01-vectors"},"at":"2026-10-08T19:32:50.856Z","method":"native","requirement_id":"UX-06","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"7cfa422a","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"in_progress_since":"2026-10-08T19:32:50.856Z","approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null},"evidence_records":{"suite:miner":{"cell":"suite:miner","manifest_sha":"7cfa422a","coverage":{"UX-06":"partial: the miner's own template selection tests","UX-04":"partial: payout label and share accounting tests; custody is the pool lane's row","POW-01":"partial: the pack re-check seam against the pack's 96 vectors (recheck_pack); the million-vector campaign is harness:p01-vectors"},"at":"2026-10-08T19:32:50.856Z","method":"native","requirement_id":"UX-06","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"7cfa422a","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"run_id":"201-7cfa422a-aa0e0f45","evidence":"build-1:/srv/artefacts/tas/201-7cfa422a-aa0e0f45/node-7cfa422a/box4-miner.log","in_progress":true}}},{"id":"UX-07","title":"Expose actionable failures and safe updates","setup":"Create failed proofs, memory pressure, expired jobs, missing payouts and available software updates.","steps":["Ask independent users to identify the issue, stop safely and follow the recommended action.","Test explicit update approval, version visibility and a failed/corrupt update.","Confirm diagnostic exports remove keys and private inputs while retaining useful evidence."],"accept":"P10 task-success requirements hold; no silent update or false success state. Recovery instructions work on supported desktops and secret canaries never enter exported logs.","evidence":"Observed tasks; update traces; sanitised export tests.","priority":"BLOCKER","profile":"P09; P10","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[14,21,25,26],"gate":"Operator readiness / G5","owner":"Desktop product + pool leads; independent usability study","manual_page":59,"owner_lane":"shipper (ae892a8b0f78fe31c)","run_status":"NOT RUN","evidence_path":"build-1:/srv/artefacts/tas/201-7cfa422a-aa0e0f45/miner-9c844503/box2-app.log; docs/plans/evidence/UX-01-20261008.md","run_id":"ux-01-20261008-win-2.0.0","updated":"2026-10-08T20:42:25.701Z","evidence_record":{"requirement_id":"UX-07","decision":"NOT RUN","method":"team-reported","cell":"pc:install-update","manifest_sha":"aa354ed5","run_id":"ux-01-20261008-win-2.0.0","evidence":"docs/plans/evidence/UX-01-20261008.md","in_progress":true,"coverage":"partial: the install classes (the payload's stop step, the detached installer under a job, the installer refusing a wrong-version name, a stale install flag) and the no-click resume; the recovery-instruction and canary rows are the shipper's","release_identity":{"commit":"aa354ed5","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"claim_impact":"","reviewer":"","at":"2026-10-08T20:42:25.701Z"},"in_progress_since":"2026-10-08T19:32:50.856Z","approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null},"evidence_records":{"suite:app":{"cell":"suite:app","manifest_sha":"7cfa422a","coverage":{"UX-02":"partial: the engine state machine's pause, stop and knob tests; the operator study is UX-01's","UX-03":"partial: the card and earnings rendering tests; the net-earnings model against real bills is COM/ECO evidence","UX-07":"partial: the refused-update and manifest tests; the update-return lane's install classes are its own rows","VER-08":"partial: the app's own state-word tests; the wallet and light client rows are VER-01 to VER-03"},"at":"2026-10-08T19:32:50.856Z","method":"native","requirement_id":"UX-07","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"7cfa422a","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"run_id":"201-7cfa422a-aa0e0f45","evidence":"build-1:/srv/artefacts/tas/201-7cfa422a-aa0e0f45/miner-9c844503/box2-app.log","in_progress":true},"pc:install-update":{"requirement_id":"UX-07","decision":"NOT RUN","method":"team-reported","cell":"pc:install-update","manifest_sha":"aa354ed5","run_id":"ux-01-20261008-win-2.0.0","evidence":"docs/plans/evidence/UX-01-20261008.md","in_progress":true,"coverage":"partial: the install classes (the payload's stop step, the detached installer under a job, the installer refusing a wrong-version name, a stale install flag) and the no-click resume; the recovery-instruction and canary rows are the shipper's","release_identity":{"commit":"aa354ed5","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"claim_impact":"","reviewer":"","at":"2026-10-08T20:42:25.701Z"}}},{"id":"UX-08","title":"Publish competitive accessible software","setup":"Provide open documented builds, tuning parameters and known fee conditions for all supported platforms.","steps":["Compare Ember against independently optimised permissible implementations on identical work.","Measure efficiency, fees, false rejection, installation and update transparency.","Scan for hidden developer fees, hardware whitelists, per-address privilege or undisclosed remote controls."],"accept":"P10 relative-efficiency limits hold and all fees/privileges are explicit. No self-reported device tier earns consensus advantage. A superior external implementation triggers investigation, not selective exclusion.","evidence":"Matched software comparison; code/config review; fee/privilege inventory.","priority":"GATE","profile":"P02; P10","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[14,21,25,26],"gate":"Operator readiness / G5","owner":"Desktop product + pool leads; independent usability study","manual_page":59,"owner_lane":"hash lane (a690540514aa453d7)","run_status":"NOT RUN","evidence_path":"build-1:/srv/artefacts/tas/200-417c4a57-b2/gate/gate-rule26.log","run_id":"200-417c4a57-b2","updated":"2026-10-08T18:28:32.408Z","evidence_record":{"cell":"gate:pre-push","manifest_sha":"417c4a57","coverage":{"GOV-05":"partial: every gate check carries a self-test that fires on a known failure and passes a known success (77 checks); the suites' own oracles are their mutation rows","GOV-06":"partial: the launch-gates, forbidden-strings and scope checks on the served site","UX-08":"partial: the site gate on every served page, plus docs/build/tuning.md (the published tuning and build-settings half, the hash lane's); the open builds and the fee conditions are the shipper's and the site lane's"},"at":"2026-10-08T18:28:32.408Z","method":"native","requirement_id":"UX-08","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"417c4a57","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"in_progress_since":"2026-10-08T18:28:32.408Z","approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null},"evidence_records":{"gate:pre-push":{"cell":"gate:pre-push","manifest_sha":"417c4a57","coverage":{"GOV-05":"partial: every gate check carries a self-test that fires on a known failure and passes a known success (77 checks); the suites' own oracles are their mutation rows","GOV-06":"partial: the launch-gates, forbidden-strings and scope checks on the served site","UX-08":"partial: the site gate on every served page, plus docs/build/tuning.md (the published tuning and build-settings half, the hash lane's); the open builds and the fee conditions are the shipper's and the site lane's"},"at":"2026-10-08T18:28:32.408Z","method":"native","requirement_id":"UX-08","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"417c4a57","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"run_id":"200-417c4a57-b2","evidence":"build-1:/srv/artefacts/tas/200-417c4a57-b2/gate/gate-rule26.log","in_progress":true}}}],"notes":[{"at":"2026-10-08T19:32:51.045Z","text":"F14 (Review B), the founder's ruling 8 October 19:57 UK: the public miner ships from 2.0.2 without remote jobs; our own fleet runs the lab build with its own signing root"}]},{"code":"COM","title":"Paid demand and sustainable delivery","source":[4,17,18,24,26,27,31,32,33],"gate":"Commercial evidence","owner":"Commercial lead + independent financial/customer reviewer","fixtures":"F8 real consenting customers; F7 full service costs; private identity proofs","summary":"Devnet payouts and subsidised pilots demonstrate mechanics, not independent willingness to pay.","tests":[{"id":"COM-01","title":"Deliver a genuine contracted proof pilot","setup":"Select one real external customer with a meaningful fixed workload and no required migration to Igneum.","steps":["Agree program, inputs, proof format, deadline, price, failure/refund policy and verification method.","Run paid jobs through ordinary independently operated infrastructure.","Have the customer verify usefulness, correctness and its reason for choosing the service."],"accept":"The pilot satisfies its actual contract and settles genuine external payment. Trial subsidies are disclosed and cannot satisfy the repeat-demand gate; no invented customer or testimonial.","evidence":"Redacted contract; verified jobs; settlement proof; consented customer confirmation.","priority":"GATE","profile":"P07; P14","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[4,17,18,24,26,27,31,32,33],"gate":"Commercial evidence","owner":"Commercial lead + independent financial/customer reviewer","manual_page":60,"owner_lane":"main / the founder","run_status":"NOT RUN","evidence_path":"","run_id":"","updated":"2026-10-08T19:22:31.798Z","evidence_record":{"reason":"commercial evidence, no automated harness","at":"2026-10-08T19:22:31.798Z","method":"static","requirement_id":"COM-01","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null},"evidence_records":{"record":{"reason":"commercial evidence, no automated harness","at":"2026-10-08T19:22:31.798Z","method":"static","requirement_id":"COM-01","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"run_id":"","evidence":"","in_progress":false}}},{"id":"COM-02","title":"Establish independent repeat purchasing","setup":"Use the P14 multi-customer observation period and ownership/conflict checks.","steps":["Track paid purchases on distinct occasions, including refunds and stopped customers.","Audit related parties, project reimbursements, token grants and circular funding.","Reconcile external cash received with correctly delivered meaningful work."],"accept":"P14 buyer, duration and volume minima are met without reimbursement or related-party substitution. Repeat orders are separate buying decisions, not a single payment split into many jobs.","evidence":"Anonymised buyer ledger; repeat-order dates; conflict review; net receipts.","priority":"GATE","profile":"P14","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[4,17,18,24,26,27,31,32,33],"gate":"Commercial evidence","owner":"Commercial lead + independent financial/customer reviewer","manual_page":60,"owner_lane":"main / the founder","run_status":"NOT RUN","evidence_path":"","run_id":"","updated":"2026-10-08T19:22:31.798Z","evidence_record":{"reason":"commercial evidence","at":"2026-10-08T19:22:31.798Z","method":"static","requirement_id":"COM-02","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null},"evidence_records":{"record":{"reason":"commercial evidence","at":"2026-10-08T19:22:31.798Z","method":"static","requirement_id":"COM-02","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"run_id":"","evidence":"","in_progress":false}}},{"id":"COM-03","title":"Demonstrate service and operator margins","setup":"Allocate all delivery costs, including aggregation, retries, hardware, power, host, network and support.","steps":["Calculate gross contribution and fully loaded unit costs for each contracted workload.","Reconcile a representative operator's realised earnings against metered costs and opportunity cost.","Repeat under the declared demand and price sensitivities."],"accept":"P14 contribution targets hold and at least the required operator cohort has positive realised contribution. Excluded overhead is visible; token appreciation or unpriced founder labour cannot silently create profitability.","evidence":"Unit-economics ledger; metered operator sample; allocation rules; sensitivity report.","priority":"GATE","profile":"P12; P14","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[4,17,18,24,26,27,31,32,33],"gate":"Commercial evidence","owner":"Commercial lead + independent financial/customer reviewer","manual_page":60,"owner_lane":"main / the founder","run_status":"NOT RUN","evidence_path":"","run_id":"","updated":"2026-10-08T19:22:31.798Z","evidence_record":{"reason":"commercial evidence","at":"2026-10-08T19:22:31.798Z","method":"static","requirement_id":"COM-03","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null},"evidence_records":{"record":{"reason":"commercial evidence","at":"2026-10-08T19:22:31.798Z","method":"static","requirement_id":"COM-03","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"run_id":"","evidence":"","in_progress":false}}},{"id":"COM-04","title":"Meet the customer service guarantee","setup":"Observe actual delivery deadlines, validity, failure handling and support over the contracted period.","steps":["Count all accepted jobs, including failed, retried and abandoned cases.","Have the customer independently verify results and invoke one authorised refund/failure exercise.","Compare offered capacity and quoted price with what was actually delivered."],"accept":"P07 and contracted obligations hold; validity has zero accepted exceptions. Failure terms are honoured, and demand beyond capacity is explicitly refused rather than quietly omitted from metrics.","evidence":"Customer-verifier records; SLO report; refunds; promised-versus-delivered comparison.","priority":"BLOCKER","profile":"P01; P07; P14","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[4,17,18,24,26,27,31,32,33],"gate":"Commercial evidence","owner":"Commercial lead + independent financial/customer reviewer","manual_page":61,"owner_lane":"main / the founder","run_status":"NOT RUN","evidence_path":"","run_id":"","updated":"2026-10-08T19:22:31.798Z","evidence_record":{"reason":"commercial evidence","at":"2026-10-08T19:22:31.798Z","method":"static","requirement_id":"COM-04","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null},"evidence_records":{"record":{"reason":"commercial evidence","at":"2026-10-08T19:22:31.798Z","method":"static","requirement_id":"COM-04","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"run_id":"","evidence":"","in_progress":false}}},{"id":"COM-05","title":"Compare against the buyer's real alternative","setup":"Identify a credible alternative supplier or in-house option for the same workload, proof format and security.","steps":["Obtain comparable quotes or consented measured trials at the evaluation date.","Include integration, verification, deadlines and all operational costs, not only proof-generation time.","Document the customer's actual trade-off without inventing unavailable comparator evidence."],"accept":"P15 commercial comparison is satisfied with like-for-like scope and a evidenced purchase reason. Missing alternative data remains MISSING; it is not scored as an Igneum win.","evidence":"Dated comparison; workload/security match; customer decision record.","priority":"GATE","profile":"P14; P15","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[4,17,18,24,26,27,31,32,33],"gate":"Commercial evidence","owner":"Commercial lead + independent financial/customer reviewer","manual_page":61,"owner_lane":"main / the founder","run_status":"NOT RUN","evidence_path":"","run_id":"","updated":"2026-10-08T19:22:31.798Z","evidence_record":{"reason":"commercial evidence","at":"2026-10-08T19:22:31.798Z","method":"static","requirement_id":"COM-05","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null},"evidence_records":{"record":{"reason":"commercial evidence","at":"2026-10-08T19:22:31.798Z","method":"static","requirement_id":"COM-05","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"run_id":"","evidence":"","in_progress":false}}},{"id":"COM-06","title":"Retain buyers after the pilot and subsidy period","setup":"Follow all recruited customers through the P14 observation period, including churn.","steps":["Remove disclosed trial incentives before measuring repeat demand.","Track renewal, expansion, cancellation reasons, unresolved incidents and buyer concentration.","Review whether one affiliated or subsidised buyer dominates the apparent market."],"accept":"P14 repeat/concentration conditions hold with honest denominator and churn reporting. Paying demand survives beyond a demonstration; unsatisfied or departed buyers are not removed retrospectively.","evidence":"Cohort/renewal ledger; churn notes; concentration and incentive report.","priority":"GATE","profile":"P14","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[4,17,18,24,26,27,31,32,33],"gate":"Commercial evidence","owner":"Commercial lead + independent financial/customer reviewer","manual_page":61,"owner_lane":"main / the founder","run_status":"NOT RUN","evidence_path":"","run_id":"","updated":"2026-10-08T19:22:31.798Z","evidence_record":{"reason":"commercial evidence","at":"2026-10-08T19:22:31.798Z","method":"static","requirement_id":"COM-06","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null},"evidence_records":{"record":{"reason":"commercial evidence","at":"2026-10-08T19:22:31.798Z","method":"static","requirement_id":"COM-06","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"run_id":"","evidence":"","in_progress":false}}},{"id":"COM-07","title":"Fund maintenance without assumed appreciation","setup":"Prepare a costed plan for development, review, infrastructure, support and incident response.","steps":["Separate committed resources from revenue dependent on adoption or token price.","Stress lower income and an unexpected security/operations expense.","Verify responsible owners and continuity arrangements without changing fair-launch promises."],"accept":"P13 committed-runway requirement holds and downside responses are documented. No uncommitted financing, rising token price or burn accounting is presented as available maintenance funding.","evidence":"Budget and commitment evidence; downside plan; owner/continuity roster.","priority":"GATE","profile":"P13","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[4,17,18,24,26,27,31,32,33],"gate":"Commercial evidence","owner":"Commercial lead + independent financial/customer reviewer","manual_page":62,"owner_lane":"main / the founder","run_status":"NOT RUN","evidence_path":"","run_id":"","updated":"2026-10-08T20:10:24.556Z","deferral_note":"P13 deferred by the founder (8 October 2026, 18:2x UK: \"forget P13 for now\")","approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null},"evidence_record":{"reason":"commercial evidence","at":"2026-10-08T20:10:24.556Z","method":"static","requirement_id":"COM-07","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"evidence_records":{"record":{"reason":"commercial evidence","at":"2026-10-08T20:10:24.556Z","method":"static","requirement_id":"COM-07","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"run_id":"","evidence":"","in_progress":false}}},{"id":"COM-08","title":"Let independent developers build useful integrations","setup":"Recruit unaffiliated developers unfamiliar with unpublished implementation details.","steps":["Use public docs to deploy a supported application or integrate an external proof request and verification flow.","Record time, undocumented dependencies, workarounds and correctness issues.","Retest after documentation fixes without founder-written hidden integration code."],"accept":"P14 developer-task minimum passes on the final release; all required public instructions exist. Successful bytecode deployment alone does not count as a working application or service integration.","evidence":"Consented developer logs; public examples; issue closure; verified end-to-end journeys.","priority":"GATE","profile":"P09; P14","cadence":"Release candidate; repeat after relevant changes","method":"Independent integration study","status":"NOT RUN","source":[4,17,18,24,26,27,31,32,33],"gate":"Commercial evidence","owner":"Commercial lead + independent financial/customer reviewer","manual_page":62,"owner_lane":"main / the founder","run_status":"NOT RUN","evidence_path":"","run_id":"","updated":"2026-10-08 18:3x UK","approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null}}]},{"code":"LEAD","title":"Comparative leadership evidence","source":[4,22,25,27,31,32,33],"gate":"Leadership-contender decision","owner":"Independent assessment panel + product/economics reviewers","fixtures":"F8 peer/customer studies; full signed technical evidence; 90-day observation","summary":"A serious contention claim requires comparative outcomes and real adoption evidence, not just an internally green test dashboard.","tests":[{"id":"LEAD-01","title":"Register a fair contemporary comparison","setup":"Choose at least the P15 peer coverage and an evaluation date before collecting confirmatory results.","steps":["Include the plan's Ravencoin, Ergo and Firo reference set where comparable, then check for other relevant current options.","Freeze versions, supported hardware, methods, noninferiority margins and commercial alternatives.","Publish exclusions and prohibit cross-algorithm raw-hashrate comparisons."],"accept":"The protocol covers material alternatives fairly and is signed independently. A missing or non-comparable feature is not scored zero; no arbitrary universal rank is inferred from selected metrics.","evidence":"Timestamped peer protocol; source/version records; comparison/exclusion rationale.","priority":"GATE","profile":"P15","cadence":"Release candidate; repeat after relevant changes","method":"Pre-registered comparative study","status":"NOT RUN","source":[4,22,25,27,31,32,33],"gate":"Leadership-contender decision","owner":"Independent assessment panel + product/economics reviewers","manual_page":63,"owner_lane":"main / the founder","run_status":"NOT RUN","evidence_path":"","run_id":"","updated":"2026-10-08 18:3x UK","approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null}},{"id":"LEAD-02","title":"Demonstrate comparable operator advantages","setup":"Use matched user tasks and operating conditions on the selected GPU-first networks.","steps":["Measure install-to-first-accepted-work, software overhead versus each network's tuned baseline, payout friction and retained control.","Measure rejection/availability under the same network conditions; report fees separately.","Use blinded analysis where possible and independent runs for decisive differences."],"accept":"P15 noninferiority and superiority requirements hold on meaningful comparable dimensions. No raw hashes from different algorithms are compared, and transient token price is not labelled engineering superiority.","evidence":"Matched task data; uncertainty/effect sizes; independent comparison report.","priority":"GATE","profile":"P02; P10; P15","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[4,22,25,27,31,32,33],"gate":"Leadership-contender decision","owner":"Independent assessment panel + product/economics reviewers","manual_page":63,"owner_lane":"site lane (a846fd66b5403e35a)","run_status":"NOT RUN","evidence_path":"","run_id":"","updated":"2026-10-08T19:22:31.798Z","evidence_record":{"reason":"leadership comparison, an observation window","at":"2026-10-08T19:22:31.798Z","method":"static","requirement_id":"LEAD-02","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null},"evidence_records":{"record":{"reason":"leadership comparison, an observation window","at":"2026-10-08T19:22:31.798Z","method":"static","requirement_id":"LEAD-02","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"run_id":"","evidence":"","in_progress":false}}},{"id":"LEAD-03","title":"Substantiate the specialist-coexistence claim","setup":"Assemble G1-G4 plus frozen rules and all surviving-adversary assumptions.","steps":["Have independent reviewers trace each public competitiveness statement to its narrowest evidence.","Separate measured GPUs, modelled silicon and economic scenarios in all summaries.","Evaluate residual uncertainty, excluded technologies and the no-new-rules counterfactual."],"accept":"All claimed envelopes meet P04/P12 without unsupported universal bounds. Reviewers agree the evidence supports scoped commodity competitiveness even when chips remain compatible; an exact chip-arrival probability is not inferred.","evidence":"Claim-to-evidence map; signed envelope review; limitations statement.","priority":"GATE","profile":"P04; P12; P15","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[4,22,25,27,31,32,33],"gate":"Leadership-contender decision","owner":"Independent assessment panel + product/economics reviewers","manual_page":63,"owner_lane":"main / the founder","run_status":"NOT RUN","evidence_path":"","run_id":"","updated":"2026-10-08T19:22:31.798Z","evidence_record":{"reason":"observation window","at":"2026-10-08T19:22:31.798Z","method":"static","requirement_id":"LEAD-03","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null},"evidence_records":{"record":{"reason":"observation window","at":"2026-10-08T19:22:31.798Z","method":"static","requirement_id":"LEAD-03","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"run_id":"","evidence":"","in_progress":false}}},{"id":"LEAD-04","title":"Observe ordinary-operator retention and margins","setup":"Recruit the P16 independent cohort before observing results; use privacy-preserving evidence.","steps":["Follow participation, realised margin, hardware changes, failures and reasons for leaving for 90 days.","Report trial incentives separately and include every initial participant in retention denominators.","Compare behaviour with matched alternatives where feasible; disclose absence of an actual downturn."],"accept":"P16 retention/margin minima hold with verified independence and no removal of churned users. Simulated downturns cannot be called observed bear-market retention; historical claims stay limited to the period measured.","evidence":"Pseudonymous cohort ledger; margin/retention calculations; departure reasons.","priority":"GATE","profile":"P12; P16","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[4,22,25,27,31,32,33],"gate":"Leadership-contender decision","owner":"Independent assessment panel + product/economics reviewers","manual_page":64,"owner_lane":"main / the founder","run_status":"NOT RUN","evidence_path":"","run_id":"","updated":"2026-10-08T19:22:31.798Z","evidence_record":{"reason":"observation window","at":"2026-10-08T19:22:31.798Z","method":"static","requirement_id":"LEAD-04","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null},"evidence_records":{"record":{"reason":"observation window","at":"2026-10-08T19:22:31.798Z","method":"static","requirement_id":"LEAD-04","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"run_id":"","evidence":"","in_progress":false}}},{"id":"LEAD-05","title":"Measure control and dependency concentration","setup":"Audit operational control of mining, voting, proving, aggregation, hosting and software distribution separately.","steps":["Use opt-in attestations, observed dependencies and independent corroboration; disclose uncertain common ownership.","Compare concentration and provider-removal outcomes to the approved security and availability assumptions.","Check that pooled payments do not hide authority concentration and hardware vendors are not equated with operators."],"accept":"P11/P16 concentration requirements hold within disclosed uncertainty; unidentified control cannot be counted as independent. No single removable dependency is falsely marketed as decentralised operation.","evidence":"Control/failure-domain map; uncertainty notes; concentration/removal results.","priority":"GATE","profile":"P11; P16","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[4,22,25,27,31,32,33],"gate":"Leadership-contender decision","owner":"Independent assessment panel + product/economics reviewers","manual_page":64,"owner_lane":"main / the founder","run_status":"NOT RUN","evidence_path":"","run_id":"","updated":"2026-10-08T19:22:31.798Z","evidence_record":{"reason":"observation window","at":"2026-10-08T19:22:31.798Z","method":"static","requirement_id":"LEAD-05","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null},"evidence_records":{"record":{"reason":"observation window","at":"2026-10-08T19:22:31.798Z","method":"static","requirement_id":"LEAD-05","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"run_id":"","evidence":"","in_progress":false}}},{"id":"LEAD-06","title":"Complete the reliability observation window","setup":"Observe the final candidate and approved compatible updates for the full P16 real-time period.","steps":["Measure promised service availability, invalid acceptance, finality safety, payouts and incident impact.","Reconcile external probes, customer records and operator logs, including maintenance and exclusions.","Repeat affected critical tests after every material change; reset observation where comparability breaks."],"accept":"P16 availability and safety criteria hold on live observation; no hidden downtime or compressed-time substitution. This supports the recorded window only, not multi-year operational maturity.","evidence":"90-day SLO ledger; independent probes; incident reports; change/retest history.","priority":"BLOCKER","profile":"P01; P16","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[4,22,25,27,31,32,33],"gate":"Leadership-contender decision","owner":"Independent assessment panel + product/economics reviewers","manual_page":64,"owner_lane":"main / the founder","run_status":"NOT RUN","evidence_path":"","run_id":"","updated":"2026-10-08T19:22:31.798Z","evidence_record":{"reason":"observation window","at":"2026-10-08T19:22:31.798Z","method":"static","requirement_id":"LEAD-06","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null},"evidence_records":{"record":{"reason":"observation window","at":"2026-10-08T19:22:31.798Z","method":"static","requirement_id":"LEAD-06","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"run_id":"","evidence":"","in_progress":false}}},{"id":"LEAD-07","title":"Issue an independent contender assessment","setup":"Provide the full evidence packet, commercial results, comparative study and unresolved-limit register to the panel.","steps":["Check every mandatory and claimed-option test, source requirement and approved threshold.","Require separate signoffs for hardware/economics, security/operations and customer/operator evidence.","Document dissent and challenge any inference that passing an internal checklist proves number-one rank."],"accept":"Every required gate is PASS with no unresolved material challenge, critical/high defect or missing comparator/customer evidence. The panel supports a credible leadership-contender conclusion within scope, not a guaranteed rank.","evidence":"Signed assessment; full status index; dissent/limitations; approved claim wording.","priority":"GATE","profile":"P00; P15; P16","cadence":"Release candidate; repeat after relevant changes","method":"Independent final assessment","status":"NOT RUN","source":[4,22,25,27,31,32,33],"gate":"Leadership-contender decision","owner":"Independent assessment panel + product/economics reviewers","manual_page":65,"owner_lane":"main / the founder","run_status":"NOT RUN","evidence_path":"","run_id":"","updated":"2026-10-08 18:3x UK","approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null}},{"id":"LEAD-08","title":"Keep leadership claims valid after release","setup":"Define material-change triggers and scheduled reviews before publishing the assessment.","steps":["Refresh competitor, hardware-cost, demand and security evidence at the P16 cadence.","Test a newly credible specialist, lost customer, major outage and verifier change against invalidation rules.","Withdraw or narrow stale claims promptly while publishing the new evidence status."],"accept":"Claims remain dated, scoped and revisable; material contrary evidence reopens the appropriate gate. The network may remain usable while a leadership claim is suspended. No permanent self-awarded certification.","evidence":"Review calendar; invalidation drills; versioned public claim register.","priority":"GATE","profile":"P00; P16","cadence":"Release candidate; repeat after relevant changes","method":"Automated + independent review","status":"NOT RUN","source":[4,22,25,27,31,32,33],"gate":"Leadership-contender decision","owner":"Independent assessment panel + product/economics reviewers","manual_page":65,"owner_lane":"main / the founder","run_status":"NOT RUN","evidence_path":"","run_id":"","updated":"2026-10-08T19:22:31.798Z","evidence_record":{"reason":"observation window","at":"2026-10-08T19:22:31.798Z","method":"static","requirement_id":"LEAD-08","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null},"evidence_records":{"record":{"reason":"observation window","at":"2026-10-08T19:22:31.798Z","method":"static","requirement_id":"LEAD-08","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""},"run_id":"","evidence":"","in_progress":false}}}]},{"code":"REV","title":"REV: the external review's required regressions","source":"docs/analysis/review-2026-10-08-b/findings.json and docs/analysis/review-2026-10-08-b/dispatch.md; ids from the master traceability register","gate":"Review findings closed","owner":"the owner lanes per the dispatch table","fixtures":["F0","F5"],"summary":"44 regressions from 14 findings; each reads NOT RUN until its owner lane records a run","tests":[{"id":"R2-F01-R01","title":"Valid proof A, warm cache, carried statement B: refuse exactly as a cold node does.","setup":"The regression R2-F01 requires (review R2 finding F01: Proof-verdict cache omits the statement being verified).","steps":["Valid proof A, warm cache, carried statement B: refuse exactly as a cold node does."],"accept":"Valid proof A, warm cache, carried statement B: refuse exactly as a cold node does.","evidence":"The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.","priority":"P0","profile":"P00","cadence":"Every release candidate","method":"Automated + independent review","status":"NOT RUN","source":["R2-F01"],"gate":"Review findings closed","owner":"proving lane, node lane","manual_page":null,"finding":"R2-F01","finding_title":"Proof-verdict cache omits the statement being verified","finding_priority":"P0 - public/value-bearing release blocker","owner_lane":"proving lane, node lane","run_status":"NOT RUN","base_test_ids":["ZKP-02","ZKP-03","ZKP-04","ZKP-08"],"updated":"2026-10-08T20:10:24.556Z","evidence_record":{"reason":"R2-F01 (P0, the external review): the regression's harness is the owner lane's (proving lane, node lane); not yet named in the map","at":"2026-10-08T20:10:24.556Z","method":"static","requirement_id":"R2-F01-R01","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null}},{"id":"R2-F01-R02","title":"Run valid/invalid contexts in both orders, concurrently and across cache eviction/restart.","setup":"The regression R2-F01 requires (review R2 finding F01: Proof-verdict cache omits the statement being verified).","steps":["Run valid/invalid contexts in both orders, concurrently and across cache eviction/restart."],"accept":"Run valid/invalid contexts in both orders, concurrently and across cache eviction/restart.","evidence":"The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.","priority":"P0","profile":"P00","cadence":"Every release candidate","method":"Automated + independent review","status":"NOT RUN","source":["R2-F01"],"gate":"Review findings closed","owner":"proving lane, node lane","manual_page":null,"finding":"R2-F01","finding_title":"Proof-verdict cache omits the statement being verified","finding_priority":"P0 - public/value-bearing release blocker","owner_lane":"proving lane, node lane","run_status":"NOT RUN","base_test_ids":["ZKP-02","ZKP-03","ZKP-04","ZKP-08"],"updated":"2026-10-08T20:10:24.556Z","evidence_record":{"reason":"R2-F01 (P0, the external review): the regression's harness is the owner lane's (proving lane, node lane); not yet named in the map","at":"2026-10-08T20:10:24.556Z","method":"static","requirement_id":"R2-F01-R02","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null}},{"id":"R2-F01-R03","title":"Change payout, network, kind, program ID and activation context; no accepted misbinding.","setup":"The regression R2-F01 requires (review R2 finding F01: Proof-verdict cache omits the statement being verified).","steps":["Change payout, network, kind, program ID and activation context; no accepted misbinding."],"accept":"Change payout, network, kind, program ID and activation context; no accepted misbinding.","evidence":"The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.","priority":"P0","profile":"P00","cadence":"Every release candidate","method":"Automated + independent review","status":"NOT RUN","source":["R2-F01"],"gate":"Review findings closed","owner":"proving lane, node lane","manual_page":null,"finding":"R2-F01","finding_title":"Proof-verdict cache omits the statement being verified","finding_priority":"P0 - public/value-bearing release blocker","owner_lane":"proving lane, node lane","run_status":"NOT RUN","base_test_ids":["ZKP-02","ZKP-03","ZKP-04","ZKP-08"],"updated":"2026-10-08T20:10:24.556Z","evidence_record":{"reason":"R2-F01 (P0, the external review): the regression's harness is the owner lane's (proving lane, node lane); not yet named in the map","at":"2026-10-08T20:10:24.556Z","method":"static","requirement_id":"R2-F01-R03","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null}},{"id":"R2-F01-R04","title":"A native two-node test must agree on block validity and payouts despite different cache histories.","setup":"The regression R2-F01 requires (review R2 finding F01: Proof-verdict cache omits the statement being verified).","steps":["A native two-node test must agree on block validity and payouts despite different cache histories."],"accept":"A native two-node test must agree on block validity and payouts despite different cache histories.","evidence":"The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.","priority":"P0","profile":"P00","cadence":"Every release candidate","method":"Automated + independent review","status":"NOT RUN","source":["R2-F01"],"gate":"Review findings closed","owner":"proving lane, node lane","manual_page":null,"finding":"R2-F01","finding_title":"Proof-verdict cache omits the statement being verified","finding_priority":"P0 - public/value-bearing release blocker","owner_lane":"proving lane, node lane","run_status":"NOT RUN","base_test_ids":["ZKP-02","ZKP-03","ZKP-04","ZKP-08"],"updated":"2026-10-08T20:10:24.556Z","evidence_record":{"reason":"R2-F01 (P0, the external review): the regression's harness is the owner lane's (proving lane, node lane); not yet named in the map","at":"2026-10-08T20:10:24.556Z","method":"static","requirement_id":"R2-F01-R04","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null}},{"id":"R2-F02-R01","title":"Release build cannot activate test bypass.","setup":"The regression R2-F02 requires (review R2 finding F02: Proof-rule infrastructure can fail open).","steps":["Release build cannot activate test bypass."],"accept":"Release build cannot activate test bypass.","evidence":"The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.","priority":"P0","profile":"P00","cadence":"Every release candidate","method":"Automated + independent review","status":"NOT RUN","source":["R2-F02"],"gate":"Review findings closed","owner":"proving lane, CI steward","manual_page":null,"finding":"R2-F02","finding_title":"Proof-rule infrastructure can fail open","finding_priority":"P0 - release configuration blocker","owner_lane":"proving lane, CI steward","run_status":"NOT RUN","base_test_ids":["GOV-05","ZKP-01","ZKP-07","ZKP-08"],"updated":"2026-10-08T20:10:24.556Z","evidence_record":{"reason":"R2-F02 (P0, the external review): the regression's harness is the owner lane's (proving lane, CI steward); not yet named in the map","at":"2026-10-08T20:10:24.556Z","method":"static","requirement_id":"R2-F02-R01","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null}},{"id":"R2-F02-R02","title":"Missing oracle or pinned keys prevents service readiness after enforcement activation.","setup":"The regression R2-F02 requires (review R2 finding F02: Proof-rule infrastructure can fail open).","steps":["Missing oracle or pinned keys prevents service readiness after enforcement activation."],"accept":"Missing oracle or pinned keys prevents service readiness after enforcement activation.","evidence":"The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.","priority":"P0","profile":"P00","cadence":"Every release candidate","method":"Automated + independent review","status":"NOT RUN","source":["R2-F02"],"gate":"Review findings closed","owner":"proving lane, CI steward","manual_page":null,"finding":"R2-F02","finding_title":"Proof-rule infrastructure can fail open","finding_priority":"P0 - release configuration blocker","owner_lane":"proving lane, CI steward","run_status":"NOT RUN","base_test_ids":["GOV-05","ZKP-01","ZKP-07","ZKP-08"],"updated":"2026-10-08T20:10:24.556Z","evidence_record":{"reason":"R2-F02 (P0, the external review): the regression's harness is the owner lane's (proving lane, CI steward); not yet named in the map","at":"2026-10-08T20:10:24.556Z","method":"static","requirement_id":"R2-F02-R02","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null}},{"id":"R2-F02-R03","title":"Missing proof bytes retry without incorrectly marking a valid block permanently invalid.","setup":"The regression R2-F02 requires (review R2 finding F02: Proof-rule infrastructure can fail open).","steps":["Missing proof bytes retry without incorrectly marking a valid block permanently invalid."],"accept":"Missing proof bytes retry without incorrectly marking a valid block permanently invalid.","evidence":"The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.","priority":"P0","profile":"P00","cadence":"Every release candidate","method":"Automated + independent review","status":"NOT RUN","source":["R2-F02"],"gate":"Review findings closed","owner":"proving lane, CI steward","manual_page":null,"finding":"R2-F02","finding_title":"Proof-rule infrastructure can fail open","finding_priority":"P0 - release configuration blocker","owner_lane":"proving lane, CI steward","run_status":"NOT RUN","base_test_ids":["GOV-05","ZKP-01","ZKP-07","ZKP-08"],"updated":"2026-10-08T20:10:24.556Z","evidence_record":{"reason":"R2-F02 (P0, the external review): the regression's harness is the owner lane's (proving lane, CI steward); not yet named in the map","at":"2026-10-08T20:10:24.556Z","method":"static","requirement_id":"R2-F02-R03","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null}},{"id":"R2-F03-R01","title":"Clean build from one manifest, including the pool and workers, with no unpublished vendor tree.","setup":"The regression R2-F03 requires (review R2 finding F03: The bundle contains a v6 candidate, not a demonstrated integrated v6 release).","steps":["Clean build from one manifest, including the pool and workers, with no unpublished vendor tree."],"accept":"Clean build from one manifest, including the pool and workers, with no unpublished vendor tree.","evidence":"The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.","priority":"P0","profile":"P00","cadence":"Every release candidate","method":"Automated + independent review","status":"NOT RUN","source":["R2-F03"],"gate":"Review findings closed","owner":"CI steward, hash lane (ProgramClass::V6 on freeze), pool lane","manual_page":null,"finding":"R2-F03","finding_title":"The bundle contains a v6 candidate, not a demonstrated integrated v6 release","finding_priority":"P0 - freeze/integration blocker","owner_lane":"CI steward, hash lane (ProgramClass::V6 on freeze), pool lane","run_status":"NOT RUN","base_test_ids":["GOV-01","GOV-03","POW-01","ROT-02"],"updated":"2026-10-08T20:10:24.556Z","evidence_record":{"reason":"R2-F03 (P0, the external review): the regression's harness is the owner lane's (CI steward, hash lane (ProgramClass::V6 on freeze), pool lane); not yet named in the map","at":"2026-10-08T20:10:24.556Z","method":"static","requirement_id":"R2-F03-R01","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null}},{"id":"R2-F03-R02","title":"Same job context produces identical accepted work in node, CPU reference, CUDA, Metal, OpenCL and pool.","setup":"The regression R2-F03 requires (review R2 finding F03: The bundle contains a v6 candidate, not a demonstrated integrated v6 release).","steps":["Same job context produces identical accepted work in node, CPU reference, CUDA, Metal, OpenCL and pool."],"accept":"Same job context produces identical accepted work in node, CPU reference, CUDA, Metal, OpenCL and pool.","evidence":"The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.","priority":"P0","profile":"P00","cadence":"Every release candidate","method":"Automated + independent review","status":"NOT RUN","source":["R2-F03"],"gate":"Review findings closed","owner":"CI steward, hash lane (ProgramClass::V6 on freeze), pool lane","manual_page":null,"finding":"R2-F03","finding_title":"The bundle contains a v6 candidate, not a demonstrated integrated v6 release","finding_priority":"P0 - freeze/integration blocker","owner_lane":"CI steward, hash lane (ProgramClass::V6 on freeze), pool lane","run_status":"NOT RUN","base_test_ids":["GOV-01","GOV-03","POW-01","ROT-02"],"updated":"2026-10-08T20:10:24.556Z","evidence_record":{"reason":"R2-F03 (P0, the external review): the regression's harness is the owner lane's (CI steward, hash lane (ProgramClass::V6 on freeze), pool lane); not yet named in the map","at":"2026-10-08T20:10:24.556Z","method":"static","requirement_id":"R2-F03-R02","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null}},{"id":"R2-F03-R03","title":"Cross every scheduled transition with old/new client behavior documented and identical rule identities.","setup":"The regression R2-F03 requires (review R2 finding F03: The bundle contains a v6 candidate, not a demonstrated integrated v6 release).","steps":["Cross every scheduled transition with old/new client behavior documented and identical rule identities."],"accept":"Cross every scheduled transition with old/new client behavior documented and identical rule identities.","evidence":"The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.","priority":"P0","profile":"P00","cadence":"Every release candidate","method":"Automated + independent review","status":"NOT RUN","source":["R2-F03"],"gate":"Review findings closed","owner":"CI steward, hash lane (ProgramClass::V6 on freeze), pool lane","manual_page":null,"finding":"R2-F03","finding_title":"The bundle contains a v6 candidate, not a demonstrated integrated v6 release","finding_priority":"P0 - freeze/integration blocker","owner_lane":"CI steward, hash lane (ProgramClass::V6 on freeze), pool lane","run_status":"NOT RUN","base_test_ids":["GOV-01","GOV-03","POW-01","ROT-02"],"updated":"2026-10-08T20:10:24.556Z","evidence_record":{"reason":"R2-F03 (P0, the external review): the regression's harness is the owner lane's (CI steward, hash lane (ProgramClass::V6 on freeze), pool lane); not yet named in the map","at":"2026-10-08T20:10:24.556Z","method":"static","requirement_id":"R2-F03-R03","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null}},{"id":"R2-F04-R01","title":"Native multi-node 40/40/20 partition, equivocation and dust-valid mining on both sides past the window.","setup":"The regression R2-F04 requires (review R2 finding F04: Finality v4 recovery deliberately has a weaker safety boundary).","steps":["Native multi-node 40/40/20 partition, equivocation and dust-valid mining on both sides past the window."],"accept":"Native multi-node 40/40/20 partition, equivocation and dust-valid mining on both sides past the window.","evidence":"The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.","priority":"P0","profile":"P00","cadence":"Every release candidate","method":"Automated + independent review","status":"NOT RUN","source":["R2-F04"],"gate":"Review findings closed","owner":"node lane, reference apps, site (explorer)","manual_page":null,"finding":"R2-F04","finding_title":"Finality v4 recovery deliberately has a weaker safety boundary","finding_priority":"P0 - finality guarantee decision","owner_lane":"node lane, reference apps, site (explorer)","run_status":"NOT RUN","base_test_ids":["FIN-02","FIN-03","FIN-07","FIN-08","VER-08"],"updated":"2026-10-08T20:10:24.556Z","evidence_record":{"reason":"R2-F04 (P0, the external review): the regression's harness is the owner lane's (node lane, reference apps, site (explorer)); not yet named in the map","at":"2026-10-08T20:10:24.556Z","method":"static","requirement_id":"R2-F04-R01","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null}},{"id":"R2-F04-R02","title":"Proof that the chosen recovery guarantee matches the public finality claim; two valid contradictory certificates are a hard failure for strong finality.","setup":"The regression R2-F04 requires (review R2 finding F04: Finality v4 recovery deliberately has a weaker safety boundary).","steps":["Proof that the chosen recovery guarantee matches the public finality claim; two valid contradictory certificates are a hard failure for strong finality."],"accept":"Proof that the chosen recovery guarantee matches the public finality claim; two valid contradictory certificates are a hard failure for strong finality.","evidence":"The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.","priority":"P0","profile":"P00","cadence":"Every release candidate","method":"Automated + independent review","status":"NOT RUN","source":["R2-F04"],"gate":"Review findings closed","owner":"node lane, reference apps, site (explorer)","manual_page":null,"finding":"R2-F04","finding_title":"Finality v4 recovery deliberately has a weaker safety boundary","finding_priority":"P0 - finality guarantee decision","owner_lane":"node lane, reference apps, site (explorer)","run_status":"NOT RUN","base_test_ids":["FIN-02","FIN-03","FIN-07","FIN-08","VER-08"],"updated":"2026-10-08T20:10:24.556Z","evidence_record":{"reason":"R2-F04 (P0, the external review): the regression's harness is the owner lane's (node lane, reference apps, site (explorer)); not yet named in the map","at":"2026-10-08T20:10:24.556Z","method":"static","requirement_id":"R2-F04-R02","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null}},{"id":"R2-F04-R03","title":"Pause-only resume with historical backfill, missing historical data and all old keys returning.","setup":"The regression R2-F04 requires (review R2 finding F04: Finality v4 recovery deliberately has a weaker safety boundary).","steps":["Pause-only resume with historical backfill, missing historical data and all old keys returning."],"accept":"Pause-only resume with historical backfill, missing historical data and all old keys returning.","evidence":"The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.","priority":"P0","profile":"P00","cadence":"Every release candidate","method":"Automated + independent review","status":"NOT RUN","source":["R2-F04"],"gate":"Review findings closed","owner":"node lane, reference apps, site (explorer)","manual_page":null,"finding":"R2-F04","finding_title":"Finality v4 recovery deliberately has a weaker safety boundary","finding_priority":"P0 - finality guarantee decision","owner_lane":"node lane, reference apps, site (explorer)","run_status":"NOT RUN","base_test_ids":["FIN-02","FIN-03","FIN-07","FIN-08","VER-08"],"updated":"2026-10-08T20:10:24.556Z","evidence_record":{"reason":"R2-F04 (P0, the external review): the regression's harness is the owner lane's (node lane, reference apps, site (explorer)); not yet named in the map","at":"2026-10-08T20:10:24.556Z","method":"static","requirement_id":"R2-F04-R03","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null}},{"id":"R2-F04-R04","title":"Wallet, receipt and oracle consumers distinguish any weaker recovery state.","setup":"The regression R2-F04 requires (review R2 finding F04: Finality v4 recovery deliberately has a weaker safety boundary).","steps":["Wallet, receipt and oracle consumers distinguish any weaker recovery state."],"accept":"Wallet, receipt and oracle consumers distinguish any weaker recovery state.","evidence":"The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.","priority":"P0","profile":"P00","cadence":"Every release candidate","method":"Automated + independent review","status":"NOT RUN","source":["R2-F04"],"gate":"Review findings closed","owner":"node lane, reference apps, site (explorer)","manual_page":null,"finding":"R2-F04","finding_title":"Finality v4 recovery deliberately has a weaker safety boundary","finding_priority":"P0 - finality guarantee decision","owner_lane":"node lane, reference apps, site (explorer)","run_status":"NOT RUN","base_test_ids":["FIN-02","FIN-03","FIN-07","FIN-08","VER-08"],"updated":"2026-10-08T20:10:24.556Z","evidence_record":{"reason":"R2-F04 (P0, the external review): the regression's harness is the owner lane's (node lane, reference apps, site (explorer)); not yet named in the map","at":"2026-10-08T20:10:24.556Z","method":"static","requirement_id":"R2-F04-R04","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null}},{"id":"R2-F05-R01","title":"Native reference-vs-incremental expression equivalence across all source registers and real instruction updates.","setup":"The regression R2-F05 requires (review R2 finding F05: reg64 address coupling has an exact incremental alternative).","steps":["Native reference-vs-incremental expression equivalence across all source registers and real instruction updates."],"accept":"Native reference-vs-incremental expression equivalence across all source registers and real instruction updates.","evidence":"The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.","priority":"P1","profile":"P00","cadence":"Every release candidate","method":"Automated + independent review","status":"NOT RUN","source":["R2-F05"],"gate":"Review findings closed","owner":"hash lane, adversary lane, floor lane 3","manual_page":null,"finding":"R2-F05","finding_title":"reg64 address coupling has an exact incremental alternative","finding_priority":"P1 - adversarial hardware evaluation","owner_lane":"hash lane, adversary lane, floor lane 3","run_status":"NOT RUN","base_test_ids":["POW-03","POW-04","ADV-03","ADV-05"],"updated":"2026-10-08T20:10:24.556Z","evidence_record":{"reason":"R2-F05 (P1, the external review): the regression's harness is the owner lane's (hash lane, adversary lane, floor lane 3); not yet named in the map","at":"2026-10-08T20:10:24.556Z","method":"static","requirement_id":"R2-F05-R01","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null}},{"id":"R2-F05-R02","title":"Full-kernel output equivalence, registers, spills, wall power and accepted throughput across target GPUs.","setup":"The regression R2-F05 requires (review R2 finding F05: reg64 address coupling has an exact incremental alternative).","steps":["Full-kernel output equivalence, registers, spills, wall power and accepted throughput across target GPUs."],"accept":"Full-kernel output equivalence, registers, spills, wall power and accepted throughput across target GPUs.","evidence":"The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.","priority":"P1","profile":"P00","cadence":"Every release candidate","method":"Automated + independent review","status":"NOT RUN","source":["R2-F05"],"gate":"Review findings closed","owner":"hash lane, adversary lane, floor lane 3","manual_page":null,"finding":"R2-F05","finding_title":"reg64 address coupling has an exact incremental alternative","finding_priority":"P1 - adversarial hardware evaluation","owner_lane":"hash lane, adversary lane, floor lane 3","run_status":"NOT RUN","base_test_ids":["POW-03","POW-04","ADV-03","ADV-05"],"updated":"2026-10-08T20:10:24.556Z","evidence_record":{"reason":"R2-F05 (P1, the external review): the regression's harness is the owner lane's (hash lane, adversary lane, floor lane 3); not yet named in the map","at":"2026-10-08T20:10:24.556Z","method":"static","requirement_id":"R2-F05-R02","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null}},{"id":"R2-F05-R03","title":"Adversary physical design includes prefix caching/recomputation cost; no assumed full 63-read cost on every load.","setup":"The regression R2-F05 requires (review R2 finding F05: reg64 address coupling has an exact incremental alternative).","steps":["Adversary physical design includes prefix caching/recomputation cost; no assumed full 63-read cost on every load."],"accept":"Adversary physical design includes prefix caching/recomputation cost; no assumed full 63-read cost on every load.","evidence":"The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.","priority":"P1","profile":"P00","cadence":"Every release candidate","method":"Automated + independent review","status":"NOT RUN","source":["R2-F05"],"gate":"Review findings closed","owner":"hash lane, adversary lane, floor lane 3","manual_page":null,"finding":"R2-F05","finding_title":"reg64 address coupling has an exact incremental alternative","finding_priority":"P1 - adversarial hardware evaluation","owner_lane":"hash lane, adversary lane, floor lane 3","run_status":"NOT RUN","base_test_ids":["POW-03","POW-04","ADV-03","ADV-05"],"updated":"2026-10-08T20:10:24.556Z","evidence_record":{"reason":"R2-F05 (P1, the external review): the regression's harness is the owner lane's (hash lane, adversary lane, floor lane 3); not yet named in the map","at":"2026-10-08T20:10:24.556Z","method":"static","requirement_id":"R2-F05-R03","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null}},{"id":"R2-F06-R01","title":"Acceptance/reference/emitter evaluate the same activated schedule.","setup":"The regression R2-F06 requires (review R2 finding F06: The v6 acceptance and census gates are not complete for the final execution).","steps":["Acceptance/reference/emitter evaluate the same activated schedule."],"accept":"Acceptance/reference/emitter evaluate the same activated schedule.","evidence":"The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.","priority":"P1","profile":"P00","cadence":"Every release candidate","method":"Automated + independent review","status":"NOT RUN","source":["R2-F06"],"gate":"Review findings closed","owner":"hash lane, research lane D","manual_page":null,"finding":"R2-F06","finding_title":"The v6 acceptance and census gates are not complete for the final execution","finding_priority":"P1 - freeze blocker","owner_lane":"hash lane, research lane D","run_status":"NOT RUN","base_test_ids":["GOV-05","POW-01","POW-02","POW-06"],"updated":"2026-10-08T20:10:24.556Z","evidence_record":{"reason":"R2-F06 (P1, the external review): the regression's harness is the owner lane's (hash lane, research lane D); not yet named in the map","at":"2026-10-08T20:10:24.556Z","method":"static","requirement_id":"R2-F06-R01","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null}},{"id":"R2-F06-R02","title":"Full live-dataset census on unseen seeds and the complete v6 pack.","setup":"The regression R2-F06 requires (review R2 finding F06: The v6 acceptance and census gates are not complete for the final execution).","steps":["Full live-dataset census on unseen seeds and the complete v6 pack."],"accept":"Full live-dataset census on unseen seeds and the complete v6 pack.","evidence":"The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.","priority":"P1","profile":"P00","cadence":"Every release candidate","method":"Automated + independent review","status":"NOT RUN","source":["R2-F06"],"gate":"Review findings closed","owner":"hash lane, research lane D","manual_page":null,"finding":"R2-F06","finding_title":"The v6 acceptance and census gates are not complete for the final execution","finding_priority":"P1 - freeze blocker","owner_lane":"hash lane, research lane D","run_status":"NOT RUN","base_test_ids":["GOV-05","POW-01","POW-02","POW-06"],"updated":"2026-10-08T20:10:24.556Z","evidence_record":{"reason":"R2-F06 (P1, the external review): the regression's harness is the owner lane's (hash lane, research lane D); not yet named in the map","at":"2026-10-08T20:10:24.556Z","method":"static","requirement_id":"R2-F06-R02","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null}},{"id":"R2-F06-R03","title":"A failed experimental rule does not silently exhaust generation or bypass the intended resource requirement.","setup":"The regression R2-F06 requires (review R2 finding F06: The v6 acceptance and census gates are not complete for the final execution).","steps":["A failed experimental rule does not silently exhaust generation or bypass the intended resource requirement."],"accept":"A failed experimental rule does not silently exhaust generation or bypass the intended resource requirement.","evidence":"The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.","priority":"P1","profile":"P00","cadence":"Every release candidate","method":"Automated + independent review","status":"NOT RUN","source":["R2-F06"],"gate":"Review findings closed","owner":"hash lane, research lane D","manual_page":null,"finding":"R2-F06","finding_title":"The v6 acceptance and census gates are not complete for the final execution","finding_priority":"P1 - freeze blocker","owner_lane":"hash lane, research lane D","run_status":"NOT RUN","base_test_ids":["GOV-05","POW-01","POW-02","POW-06"],"updated":"2026-10-08T20:10:24.556Z","evidence_record":{"reason":"R2-F06 (P1, the external review): the regression's harness is the owner lane's (hash lane, research lane D); not yet named in the map","at":"2026-10-08T20:10:24.556Z","method":"static","requirement_id":"R2-F06-R03","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null}},{"id":"R2-F07-R01","title":"Same final v6 configuration: mine -> evict -> prove -> aggregate -> submit -> rebuild -> resume; no leaked reservations.","setup":"The regression R2-F07 requires (review R2 finding F07: VRAM admission and proving deadlines need one operator-level scheduler).","steps":["Same final v6 configuration: mine -> evict -> prove -> aggregate -> submit -> rebuild -> resume; no leaked reservations."],"accept":"Same final v6 configuration: mine -> evict -> prove -> aggregate -> submit -> rebuild -> resume; no leaked reservations.","evidence":"The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.","priority":"P1","profile":"P00","cadence":"Every release candidate","method":"Automated + independent review","status":"NOT RUN","source":["R2-F07"],"gate":"Review findings closed","owner":"app lane, fleet lane","manual_page":null,"finding":"R2-F07","finding_title":"VRAM admission and proving deadlines need one operator-level scheduler","finding_priority":"P1 - miner economics and reliability","owner_lane":"app lane, fleet lane","run_status":"NOT RUN","base_test_ids":["GPU-05","CAP-02","CAP-05","UX-02"],"updated":"2026-10-08T20:10:24.556Z","evidence_record":{"reason":"R2-F07 (P1, the external review): the regression's harness is the owner lane's (app lane, fleet lane); not yet named in the map","at":"2026-10-08T20:10:24.556Z","method":"static","requirement_id":"R2-F07-R01","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null}},{"id":"R2-F07-R02","title":"OOM, process crash and stale work recover without losing wallet state or silently consuming power.","setup":"The regression R2-F07 requires (review R2 finding F07: VRAM admission and proving deadlines need one operator-level scheduler).","steps":["OOM, process crash and stale work recover without losing wallet state or silently consuming power."],"accept":"OOM, process crash and stale work recover without losing wallet state or silently consuming power.","evidence":"The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.","priority":"P1","profile":"P00","cadence":"Every release candidate","method":"Automated + independent review","status":"NOT RUN","source":["R2-F07"],"gate":"Review findings closed","owner":"app lane, fleet lane","manual_page":null,"finding":"R2-F07","finding_title":"VRAM admission and proving deadlines need one operator-level scheduler","finding_priority":"P1 - miner economics and reliability","owner_lane":"app lane, fleet lane","run_status":"NOT RUN","base_test_ids":["GPU-05","CAP-02","CAP-05","UX-02"],"updated":"2026-10-08T20:10:24.556Z","evidence_record":{"reason":"R2-F07 (P1, the external review): the regression's harness is the owner lane's (app lane, fleet lane); not yet named in the map","at":"2026-10-08T20:10:24.556Z","method":"static","requirement_id":"R2-F07-R02","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null}},{"id":"R2-F07-R03","title":"16 GB+ simultaneous mode only after measured peak plus next-epoch headroom; smaller-card modes labelled separately.","setup":"The regression R2-F07 requires (review R2 finding F07: VRAM admission and proving deadlines need one operator-level scheduler).","steps":["16 GB+ simultaneous mode only after measured peak plus next-epoch headroom; smaller-card modes labelled separately."],"accept":"16 GB+ simultaneous mode only after measured peak plus next-epoch headroom; smaller-card modes labelled separately.","evidence":"The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.","priority":"P1","profile":"P00","cadence":"Every release candidate","method":"Automated + independent review","status":"NOT RUN","source":["R2-F07"],"gate":"Review findings closed","owner":"app lane, fleet lane","manual_page":null,"finding":"R2-F07","finding_title":"VRAM admission and proving deadlines need one operator-level scheduler","finding_priority":"P1 - miner economics and reliability","owner_lane":"app lane, fleet lane","run_status":"NOT RUN","base_test_ids":["GPU-05","CAP-02","CAP-05","UX-02"],"updated":"2026-10-08T20:10:24.556Z","evidence_record":{"reason":"R2-F07 (P1, the external review): the regression's harness is the owner lane's (app lane, fleet lane); not yet named in the map","at":"2026-10-08T20:10:24.556Z","method":"static","requirement_id":"R2-F07-R03","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null}},{"id":"R2-F08-R01","title":"Report every eligible job outcome, including expired work; a bounded list cannot hide losses.","setup":"The regression R2-F08 requires (review R2 finding F08: The proving pipeline reports waste and deadline censoring, not sustained capacity).","steps":["Report every eligible job outcome, including expired work; a bounded list cannot hide losses."],"accept":"Report every eligible job outcome, including expired work; a bounded list cannot hide losses.","evidence":"The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.","priority":"P1","profile":"P00","cadence":"Every release candidate","method":"Automated + independent review","status":"NOT RUN","source":["R2-F08"],"gate":"Review findings closed","owner":"proving lane, fleet lane, site (ops page)","manual_page":null,"finding":"R2-F08","finding_title":"The proving pipeline reports waste and deadline censoring, not sustained capacity","finding_priority":"P1 - proving product gate","owner_lane":"proving lane, fleet lane, site (ops page)","run_status":"NOT RUN","base_test_ids":["CAP-03","CAP-04","CAP-06","CAP-07"],"updated":"2026-10-08T20:10:24.556Z","evidence_record":{"reason":"R2-F08 (P1, the external review): the regression's harness is the owner lane's (proving lane, fleet lane, site (ops page)); not yet named in the map","at":"2026-10-08T20:10:24.556Z","method":"static","requirement_id":"R2-F08-R01","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null}},{"id":"R2-F08-R02","title":"Consumer tiers complete and receive payment for declared jobs before claims about income.","setup":"The regression R2-F08 requires (review R2 finding F08: The proving pipeline reports waste and deadline censoring, not sustained capacity).","steps":["Consumer tiers complete and receive payment for declared jobs before claims about income."],"accept":"Consumer tiers complete and receive payment for declared jobs before claims about income.","evidence":"The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.","priority":"P1","profile":"P00","cadence":"Every release candidate","method":"Automated + independent review","status":"NOT RUN","source":["R2-F08"],"gate":"Review findings closed","owner":"proving lane, fleet lane, site (ops page)","manual_page":null,"finding":"R2-F08","finding_title":"The proving pipeline reports waste and deadline censoring, not sustained capacity","finding_priority":"P1 - proving product gate","owner_lane":"proving lane, fleet lane, site (ops page)","run_status":"NOT RUN","base_test_ids":["CAP-03","CAP-04","CAP-06","CAP-07"],"updated":"2026-10-08T20:10:24.556Z","evidence_record":{"reason":"R2-F08 (P1, the external review): the regression's harness is the owner lane's (proving lane, fleet lane, site (ops page)); not yet named in the map","at":"2026-10-08T20:10:24.556Z","method":"static","requirement_id":"R2-F08-R02","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null}},{"id":"R2-F08-R03","title":"Sustained real workload across class transitions, with restart/retry and no publisher intervention.","setup":"The regression R2-F08 requires (review R2 finding F08: The proving pipeline reports waste and deadline censoring, not sustained capacity).","steps":["Sustained real workload across class transitions, with restart/retry and no publisher intervention."],"accept":"Sustained real workload across class transitions, with restart/retry and no publisher intervention.","evidence":"The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.","priority":"P1","profile":"P00","cadence":"Every release candidate","method":"Automated + independent review","status":"NOT RUN","source":["R2-F08"],"gate":"Review findings closed","owner":"proving lane, fleet lane, site (ops page)","manual_page":null,"finding":"R2-F08","finding_title":"The proving pipeline reports waste and deadline censoring, not sustained capacity","finding_priority":"P1 - proving product gate","owner_lane":"proving lane, fleet lane, site (ops page)","run_status":"NOT RUN","base_test_ids":["CAP-03","CAP-04","CAP-06","CAP-07"],"updated":"2026-10-08T20:10:24.556Z","evidence_record":{"reason":"R2-F08 (P1, the external review): the regression's harness is the owner lane's (proving lane, fleet lane, site (ops page)); not yet named in the map","at":"2026-10-08T20:10:24.556Z","method":"static","requirement_id":"R2-F08-R03","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null}},{"id":"R2-F09-R01","title":"Generate all pass/fail cells directly from the declared inequalities and inputs.","setup":"The regression R2-F09 requires (review R2 finding F09: The economic model explicitly retains a failed specialist case).","steps":["Generate all pass/fail cells directly from the declared inequalities and inputs."],"accept":"Generate all pass/fail cells directly from the declared inequalities and inputs.","evidence":"The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.","priority":"P1","profile":"P00","cadence":"Every release candidate","method":"Automated + independent review","status":"NOT RUN","source":["R2-F09"],"gate":"Review findings closed","owner":"research lane, floor lane 3, coordinator","manual_page":null,"finding":"R2-F09","finding_title":"The economic model explicitly retains a failed specialist case","finding_priority":"P1 - founding claim not yet earned","owner_lane":"research lane, floor lane 3, coordinator","run_status":"NOT RUN","base_test_ids":["ADV-05","ADV-08","ECO-03","ECO-08","LEAD-03"],"updated":"2026-10-08T20:10:24.556Z","evidence_record":{"reason":"R2-F09 (P1, the external review): the regression's harness is the owner lane's (research lane, floor lane 3, coordinator); not yet named in the map","at":"2026-10-08T20:10:24.556Z","method":"static","requirement_id":"R2-F09-R01","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null}},{"id":"R2-F09-R02","title":"Independent feasibility and cost evaluation of the strongest modeled SRAM/hybrid opponent.","setup":"The regression R2-F09 requires (review R2 finding F09: The economic model explicitly retains a failed specialist case).","steps":["Independent feasibility and cost evaluation of the strongest modeled SRAM/hybrid opponent."],"accept":"Independent feasibility and cost evaluation of the strongest modeled SRAM/hybrid opponent.","evidence":"The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.","priority":"P1","profile":"P00","cadence":"Every release candidate","method":"Automated + independent review","status":"NOT RUN","source":["R2-F09"],"gate":"Review findings closed","owner":"research lane, floor lane 3, coordinator","manual_page":null,"finding":"R2-F09","finding_title":"The economic model explicitly retains a failed specialist case","finding_priority":"P1 - founding claim not yet earned","owner_lane":"research lane, floor lane 3, coordinator","run_status":"NOT RUN","base_test_ids":["ADV-05","ADV-08","ECO-03","ECO-08","LEAD-03"],"updated":"2026-10-08T20:10:24.556Z","evidence_record":{"reason":"R2-F09 (P1, the external review): the regression's harness is the owner lane's (research lane, floor lane 3, coordinator); not yet named in the map","at":"2026-10-08T20:10:24.556Z","method":"static","requirement_id":"R2-F09-R02","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null}},{"id":"R2-F09-R03","title":"GPU owners and entrants remain viable under the approved scenario envelope without assuming chip absence or death.","setup":"The regression R2-F09 requires (review R2 finding F09: The economic model explicitly retains a failed specialist case).","steps":["GPU owners and entrants remain viable under the approved scenario envelope without assuming chip absence or death."],"accept":"GPU owners and entrants remain viable under the approved scenario envelope without assuming chip absence or death.","evidence":"The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.","priority":"P1","profile":"P00","cadence":"Every release candidate","method":"Automated + independent review","status":"NOT RUN","source":["R2-F09"],"gate":"Review findings closed","owner":"research lane, floor lane 3, coordinator","manual_page":null,"finding":"R2-F09","finding_title":"The economic model explicitly retains a failed specialist case","finding_priority":"P1 - founding claim not yet earned","owner_lane":"research lane, floor lane 3, coordinator","run_status":"NOT RUN","base_test_ids":["ADV-05","ADV-08","ECO-03","ECO-08","LEAD-03"],"updated":"2026-10-08T20:10:24.556Z","evidence_record":{"reason":"R2-F09 (P1, the external review): the regression's harness is the owner lane's (research lane, floor lane 3, coordinator); not yet named in the map","at":"2026-10-08T20:10:24.556Z","method":"static","requirement_id":"R2-F09-R03","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null}},{"id":"R2-F10-R01","title":"Compare exact found nonce/hash sets with full-read mode, including all-hit overflow and zero-hit cases.","setup":"The regression R2-F10 requires (review R2 finding F10: CUDA production readback has an existing OpenCL optimization to borrow).","steps":["Compare exact found nonce/hash sets with full-read mode, including all-hit overflow and zero-hit cases."],"accept":"Compare exact found nonce/hash sets with full-read mode, including all-hit overflow and zero-hit cases.","evidence":"The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.","priority":"P2","profile":"P00","cadence":"Every release candidate","method":"Automated + independent review","status":"NOT RUN","source":["R2-F10"],"gate":"Review findings closed","owner":"worker lane (new)","manual_page":null,"finding":"R2-F10","finding_title":"CUDA production readback has an existing OpenCL optimization to borrow","finding_priority":"P2 - byte-preserving performance experiment","owner_lane":"worker lane (new)","run_status":"NOT RUN","base_test_ids":["GPU-06","GPU-08","POW-01","UX-08"],"updated":"2026-10-08T20:10:24.556Z","evidence_record":{"reason":"R2-F10 (P2, the external review): the regression's harness is the owner lane's (worker lane (new)); not yet named in the map","at":"2026-10-08T20:10:24.556Z","method":"static","requirement_id":"R2-F10-R01","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null}},{"id":"R2-F10-R02","title":"Test stale jobs, high-32 rollover, tail batches and asynchronous buffer reuse.","setup":"The regression R2-F10 requires (review R2 finding F10: CUDA production readback has an existing OpenCL optimization to borrow).","steps":["Test stale jobs, high-32 rollover, tail batches and asynchronous buffer reuse."],"accept":"Test stale jobs, high-32 rollover, tail batches and asynchronous buffer reuse.","evidence":"The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.","priority":"P2","profile":"P00","cadence":"Every release candidate","method":"Automated + independent review","status":"NOT RUN","source":["R2-F10"],"gate":"Review findings closed","owner":"worker lane (new)","manual_page":null,"finding":"R2-F10","finding_title":"CUDA production readback has an existing OpenCL optimization to borrow","finding_priority":"P2 - byte-preserving performance experiment","owner_lane":"worker lane (new)","run_status":"NOT RUN","base_test_ids":["GPU-06","GPU-08","POW-01","UX-08"],"updated":"2026-10-08T20:10:24.556Z","evidence_record":{"reason":"R2-F10 (P2, the external review): the regression's harness is the owner lane's (worker lane (new)); not yet named in the map","at":"2026-10-08T20:10:24.556Z","method":"static","requirement_id":"R2-F10-R02","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null}},{"id":"R2-F10-R03","title":"Compare production throughput and wall energy, not only the isolated kernel timer.","setup":"The regression R2-F10 requires (review R2 finding F10: CUDA production readback has an existing OpenCL optimization to borrow).","steps":["Compare production throughput and wall energy, not only the isolated kernel timer."],"accept":"Compare production throughput and wall energy, not only the isolated kernel timer.","evidence":"The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.","priority":"P2","profile":"P00","cadence":"Every release candidate","method":"Automated + independent review","status":"NOT RUN","source":["R2-F10"],"gate":"Review findings closed","owner":"worker lane (new)","manual_page":null,"finding":"R2-F10","finding_title":"CUDA production readback has an existing OpenCL optimization to borrow","finding_priority":"P2 - byte-preserving performance experiment","owner_lane":"worker lane (new)","run_status":"NOT RUN","base_test_ids":["GPU-06","GPU-08","POW-01","UX-08"],"updated":"2026-10-08T20:10:24.556Z","evidence_record":{"reason":"R2-F10 (P2, the external review): the regression's harness is the owner lane's (worker lane (new)); not yet named in the map","at":"2026-10-08T20:10:24.556Z","method":"static","requirement_id":"R2-F10-R03","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null}},{"id":"R2-F11-R01","title":"Goal switch from an efficiency prior can explore higher core/power when policy allows.","setup":"The regression R2-F11 requires (review R2 finding F11: Ember needs workload-aware identity and objective-aware search).","steps":["Goal switch from an efficiency prior can explore higher core/power when policy allows."],"accept":"Goal switch from an efficiency prior can explore higher core/power when policy allows.","evidence":"The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.","priority":"P2","profile":"P00","cadence":"Every release candidate","method":"Automated + independent review","status":"NOT RUN","source":["R2-F11"],"gate":"Review findings closed","owner":"Ember lane (new)","manual_page":null,"finding":"R2-F11","finding_title":"Ember needs workload-aware identity and objective-aware search","finding_priority":"P2 - product performance","owner_lane":"Ember lane (new)","run_status":"NOT RUN","base_test_ids":["GPU-02","GPU-04","UX-02","UX-03"],"updated":"2026-10-08T20:10:24.556Z","evidence_record":{"reason":"R2-F11 (P2, the external review): the regression's harness is the owner lane's (Ember lane (new)); not yet named in the map","at":"2026-10-08T20:10:24.556Z","method":"static","requirement_id":"R2-F11-R01","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null}},{"id":"R2-F11-R02","title":"Driver, workload, dataset, compiler and device changes invalidate certification while retaining optional hints.","setup":"The regression R2-F11 requires (review R2 finding F11: Ember needs workload-aware identity and objective-aware search).","steps":["Driver, workload, dataset, compiler and device changes invalidate certification while retaining optional hints."],"accept":"Driver, workload, dataset, compiler and device changes invalidate certification while retaining optional hints.","evidence":"The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.","priority":"P2","profile":"P00","cadence":"Every release candidate","method":"Automated + independent review","status":"NOT RUN","source":["R2-F11"],"gate":"Review findings closed","owner":"Ember lane (new)","manual_page":null,"finding":"R2-F11","finding_title":"Ember needs workload-aware identity and objective-aware search","finding_priority":"P2 - product performance","owner_lane":"Ember lane (new)","run_status":"NOT RUN","base_test_ids":["GPU-02","GPU-04","UX-02","UX-03"],"updated":"2026-10-08T20:10:24.556Z","evidence_record":{"reason":"R2-F11 (P2, the external review): the regression's harness is the owner lane's (Ember lane (new)); not yet named in the map","at":"2026-10-08T20:10:24.556Z","method":"static","requirement_id":"R2-F11-R02","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null}},{"id":"R2-F11-R03","title":"Thermal/error/late-share events revert safely, including process or machine crash.","setup":"The regression R2-F11 requires (review R2 finding F11: Ember needs workload-aware identity and objective-aware search).","steps":["Thermal/error/late-share events revert safely, including process or machine crash."],"accept":"Thermal/error/late-share events revert safely, including process or machine crash.","evidence":"The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.","priority":"P2","profile":"P00","cadence":"Every release candidate","method":"Automated + independent review","status":"NOT RUN","source":["R2-F11"],"gate":"Review findings closed","owner":"Ember lane (new)","manual_page":null,"finding":"R2-F11","finding_title":"Ember needs workload-aware identity and objective-aware search","finding_priority":"P2 - product performance","owner_lane":"Ember lane (new)","run_status":"NOT RUN","base_test_ids":["GPU-02","GPU-04","UX-02","UX-03"],"updated":"2026-10-08T20:10:24.556Z","evidence_record":{"reason":"R2-F11 (P2, the external review): the regression's harness is the owner lane's (Ember lane (new)); not yet named in the map","at":"2026-10-08T20:10:24.556Z","method":"static","requirement_id":"R2-F11-R03","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null}},{"id":"R2-F12-R01","title":"Crash before/after broadcast, response timeout, restart before snapshot: no duplicate payment or silent debt loss.","setup":"The regression R2-F12 requires (review R2 finding F12: Pool payouts have a broadcast-before-durable-intent window).","steps":["Crash before/after broadcast, response timeout, restart before snapshot: no duplicate payment or silent debt loss."],"accept":"Crash before/after broadcast, response timeout, restart before snapshot: no duplicate payment or silent debt loss.","evidence":"The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.","priority":"P1","profile":"P00","cadence":"Every release candidate","method":"Automated + independent review","status":"NOT RUN","source":["R2-F12"],"gate":"Review findings closed","owner":"pool lane (new)","manual_page":null,"finding":"R2-F12","finding_title":"Pool payouts have a broadcast-before-durable-intent window","finding_priority":"P1 - payment integrity","owner_lane":"pool lane (new)","run_status":"NOT RUN","base_test_ids":["ZKP-05","UX-04","OPS-04"],"updated":"2026-10-08T20:10:24.556Z","evidence_record":{"reason":"R2-F12 (P1, the external review): the regression's harness is the owner lane's (pool lane (new)); not yet named in the map","at":"2026-10-08T20:10:24.556Z","method":"static","requirement_id":"R2-F12-R01","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null}},{"id":"R2-F12-R02","title":"Same signed transaction retried, fee replacement reconciled by intent, not a new payment.","setup":"The regression R2-F12 requires (review R2 finding F12: Pool payouts have a broadcast-before-durable-intent window).","steps":["Same signed transaction retried, fee replacement reconciled by intent, not a new payment."],"accept":"Same signed transaction retried, fee replacement reconciled by intent, not a new payment.","evidence":"The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.","priority":"P1","profile":"P00","cadence":"Every release candidate","method":"Automated + independent review","status":"NOT RUN","source":["R2-F12"],"gate":"Review findings closed","owner":"pool lane (new)","manual_page":null,"finding":"R2-F12","finding_title":"Pool payouts have a broadcast-before-durable-intent window","finding_priority":"P1 - payment integrity","owner_lane":"pool lane (new)","run_status":"NOT RUN","base_test_ids":["ZKP-05","UX-04","OPS-04"],"updated":"2026-10-08T20:10:24.556Z","evidence_record":{"reason":"R2-F12 (P1, the external review): the regression's harness is the owner lane's (pool lane (new)); not yet named in the map","at":"2026-10-08T20:10:24.556Z","method":"static","requirement_id":"R2-F12-R02","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null}},{"id":"R2-F12-R03","title":"Receipt reorg and finality pause leave correct pending obligations.","setup":"The regression R2-F12 requires (review R2 finding F12: Pool payouts have a broadcast-before-durable-intent window).","steps":["Receipt reorg and finality pause leave correct pending obligations."],"accept":"Receipt reorg and finality pause leave correct pending obligations.","evidence":"The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.","priority":"P1","profile":"P00","cadence":"Every release candidate","method":"Automated + independent review","status":"NOT RUN","source":["R2-F12"],"gate":"Review findings closed","owner":"pool lane (new)","manual_page":null,"finding":"R2-F12","finding_title":"Pool payouts have a broadcast-before-durable-intent window","finding_priority":"P1 - payment integrity","owner_lane":"pool lane (new)","run_status":"NOT RUN","base_test_ids":["ZKP-05","UX-04","OPS-04"],"updated":"2026-10-08T20:10:24.556Z","evidence_record":{"reason":"R2-F12 (P1, the external review): the regression's harness is the owner lane's (pool lane (new)); not yet named in the map","at":"2026-10-08T20:10:24.556Z","method":"static","requirement_id":"R2-F12-R03","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null}},{"id":"R2-F13-R01","title":"Repeated authorization rejected or atomically replaces and cleans prior state.","setup":"The regression R2-F13 requires (review R2 finding F13: Pool admission and membership need bounded resources).","steps":["Repeated authorization rejected or atomically replaces and cleans prior state."],"accept":"Repeated authorization rejected or atomically replaces and cleans prior state.","evidence":"The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.","priority":"P1","profile":"P00","cadence":"Every release candidate","method":"Automated + independent review","status":"NOT RUN","source":["R2-F13"],"gate":"Review findings closed","owner":"pool lane (new)","manual_page":null,"finding":"R2-F13","finding_title":"Pool admission and membership need bounded resources","finding_priority":"P1 - service resilience","owner_lane":"pool lane (new)","run_status":"NOT RUN","base_test_ids":["OPS-06","UX-04","UX-05","UX-06"],"updated":"2026-10-08T20:10:24.556Z","evidence_record":{"reason":"R2-F13 (P1, the external review): the regression's harness is the owner lane's (pool lane (new)); not yet named in the map","at":"2026-10-08T20:10:24.556Z","method":"static","requirement_id":"R2-F13-R01","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null}},{"id":"R2-F13-R02","title":"Oversized unterminated frame rejected within fixed memory/time budget.","setup":"The regression R2-F13 requires (review R2 finding F13: Pool admission and membership need bounded resources).","steps":["Oversized unterminated frame rejected within fixed memory/time budget."],"accept":"Oversized unterminated frame rejected within fixed memory/time budget.","evidence":"The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.","priority":"P1","profile":"P00","cadence":"Every release candidate","method":"Automated + independent review","status":"NOT RUN","source":["R2-F13"],"gate":"Review findings closed","owner":"pool lane (new)","manual_page":null,"finding":"R2-F13","finding_title":"Pool admission and membership need bounded resources","finding_priority":"P1 - service resilience","owner_lane":"pool lane (new)","run_status":"NOT RUN","base_test_ids":["OPS-06","UX-04","UX-05","UX-06"],"updated":"2026-10-08T20:10:24.556Z","evidence_record":{"reason":"R2-F13 (P1, the external review): the regression's harness is the owner lane's (pool lane (new)); not yet named in the map","at":"2026-10-08T20:10:24.556Z","method":"static","requirement_id":"R2-F13-R02","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null}},{"id":"R2-F13-R03","title":"Slow clients and invalid share floods cannot grow unbounded member, nonce or outgoing state.","setup":"The regression R2-F13 requires (review R2 finding F13: Pool admission and membership need bounded resources).","steps":["Slow clients and invalid share floods cannot grow unbounded member, nonce or outgoing state."],"accept":"Slow clients and invalid share floods cannot grow unbounded member, nonce or outgoing state.","evidence":"The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.","priority":"P1","profile":"P00","cadence":"Every release candidate","method":"Automated + independent review","status":"NOT RUN","source":["R2-F13"],"gate":"Review findings closed","owner":"pool lane (new)","manual_page":null,"finding":"R2-F13","finding_title":"Pool admission and membership need bounded resources","finding_priority":"P1 - service resilience","owner_lane":"pool lane (new)","run_status":"NOT RUN","base_test_ids":["OPS-06","UX-04","UX-05","UX-06"],"updated":"2026-10-08T20:10:24.556Z","evidence_record":{"reason":"R2-F13 (P1, the external review): the regression's harness is the owner lane's (pool lane (new)); not yet named in the map","at":"2026-10-08T20:10:24.556Z","method":"static","requirement_id":"R2-F13-R03","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null}},{"id":"R2-F14-R01","title":"Public build has no default arbitrary remote execution and a documented least-privilege boundary.","setup":"The regression R2-F14 requires (review R2 finding F14: Developer fleet control must not silently become the public client trust model).","steps":["Public build has no default arbitrary remote execution and a documented least-privilege boundary."],"accept":"Public build has no default arbitrary remote execution and a documented least-privilege boundary.","evidence":"The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.","priority":"P1","profile":"P00","cadence":"Every release candidate","method":"Automated + independent review","status":"NOT RUN","source":["R2-F14"],"gate":"Review findings closed","owner":"app lane, relay lane","manual_page":null,"finding":"R2-F14","finding_title":"Developer fleet control must not silently become the public client trust model","finding_priority":"P1 - public client/independence gate","owner_lane":"app lane, relay lane","run_status":"NOT RUN","base_test_ids":["OPS-03","OPS-05","UX-02","UX-07"],"updated":"2026-10-08T20:10:24.556Z","evidence_record":{"reason":"R2-F14 (P1, the external review): the regression's harness is the owner lane's (app lane, relay lane); not yet named in the map","at":"2026-10-08T20:10:24.556Z","method":"static","requirement_id":"R2-F14-R01","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null}},{"id":"R2-F14-R02","title":"Automatic updates off remains off for urgent manifests until explicit action.","setup":"The regression R2-F14 requires (review R2 finding F14: Developer fleet control must not silently become the public client trust model).","steps":["Automatic updates off remains off for urgent manifests until explicit action."],"accept":"Automatic updates off remains off for urgent manifests until explicit action.","evidence":"The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.","priority":"P1","profile":"P00","cadence":"Every release candidate","method":"Automated + independent review","status":"NOT RUN","source":["R2-F14"],"gate":"Review findings closed","owner":"app lane, relay lane","manual_page":null,"finding":"R2-F14","finding_title":"Developer fleet control must not silently become the public client trust model","finding_priority":"P1 - public client/independence gate","owner_lane":"app lane, relay lane","run_status":"NOT RUN","base_test_ids":["OPS-03","OPS-05","UX-02","UX-07"],"updated":"2026-10-08T20:10:24.556Z","evidence_record":{"reason":"R2-F14 (P1, the external review): the regression's harness is the owner lane's (app lane, relay lane); not yet named in the map","at":"2026-10-08T20:10:24.556Z","method":"static","requirement_id":"R2-F14-R02","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null}},{"id":"R2-F14-R03","title":"A compromised fleet/update signing key cannot silently acquire wallet access or activate a consensus change.","setup":"The regression R2-F14 requires (review R2 finding F14: Developer fleet control must not silently become the public client trust model).","steps":["A compromised fleet/update signing key cannot silently acquire wallet access or activate a consensus change."],"accept":"A compromised fleet/update signing key cannot silently acquire wallet access or activate a consensus change.","evidence":"The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.","priority":"P1","profile":"P00","cadence":"Every release candidate","method":"Automated + independent review","status":"NOT RUN","source":["R2-F14"],"gate":"Review findings closed","owner":"app lane, relay lane","manual_page":null,"finding":"R2-F14","finding_title":"Developer fleet control must not silently become the public client trust model","finding_priority":"P1 - public client/independence gate","owner_lane":"app lane, relay lane","run_status":"NOT RUN","base_test_ids":["OPS-03","OPS-05","UX-02","UX-07"],"updated":"2026-10-08T20:10:24.556Z","evidence_record":{"reason":"R2-F14 (P1, the external review): the regression's harness is the owner lane's (app lane, relay lane); not yet named in the map","at":"2026-10-08T20:10:24.556Z","method":"static","requirement_id":"R2-F14-R03","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null}}]},{"code":"INT","title":"INT: the master edition's integration gates (R1, the full-system review)","source":"docs/plans/igneum-2.0-master/traceability.json integration_gates","gate":"Integration gates closed","owner":"the owner lanes per the coordinator's crosswalk","fixtures":["F0","F5"],"summary":"18 integration gates; each reads NOT RUN until its owner lane records a run","tests":[{"id":"INT-01","title":"Real proof H cannot authenticate a different statement under a warm cache.","setup":"Integration gate INT-01 of the master edition (R1 / Additional regression gates).","steps":["Real proof H cannot authenticate a different statement under a warm cache."],"accept":"Real proof H cannot authenticate a different statement under a warm cache.","evidence":"The run record of the gate as its owner lane records it through tools/ci/test-record.mjs.","priority":"P0","profile":"P00","cadence":"Every release candidate","method":"Automated + independent review","status":"NOT RUN","source":["R1"],"gate":"Integration gates closed","owner":"proving lane (a6e8f84588b809d62)","manual_page":null,"owner_lane":"proving lane (a6e8f84588b809d62)","run_status":"NOT RUN","master_status":"PROPOSED / NOT RUN","updated":"2026-10-08T20:10:24.556Z","evidence_record":{"reason":"INT-01 (R1 integration gate): the gate's harness is the owner lane's (proving lane (a6e8f84588b809d62)); not yet named in the map","at":"2026-10-08T20:10:24.556Z","method":"static","requirement_id":"INT-01","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null}},{"id":"INT-02","title":"Warm/cold/relay/restart/concurrent cache order does not change block or payout decisions; negative cache isolated.","setup":"Integration gate INT-02 of the master edition (R1 / Additional regression gates).","steps":["Warm/cold/relay/restart/concurrent cache order does not change block or payout decisions; negative cache isolated."],"accept":"Warm/cold/relay/restart/concurrent cache order does not change block or payout decisions; negative cache isolated.","evidence":"The run record of the gate as its owner lane records it through tools/ci/test-record.mjs.","priority":"P0","profile":"P00","cadence":"Every release candidate","method":"Automated + independent review","status":"NOT RUN","source":["R1"],"gate":"Integration gates closed","owner":"proving lane (a6e8f84588b809d62)","manual_page":null,"owner_lane":"proving lane (a6e8f84588b809d62)","run_status":"NOT RUN","master_status":"PROPOSED / NOT RUN","updated":"2026-10-08T20:10:24.556Z","evidence_record":{"reason":"INT-02 (R1 integration gate): the gate's harness is the owner lane's (proving lane (a6e8f84588b809d62)); not yet named in the map","at":"2026-10-08T20:10:24.556Z","method":"static","requirement_id":"INT-02","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null}},{"id":"INT-03","title":"Durable payout outbox survives every crash/RPC boundary without duplicate or lost liabilities.","setup":"Integration gate INT-03 of the master edition (R1 / Additional regression gates).","steps":["Durable payout outbox survives every crash/RPC boundary without duplicate or lost liabilities."],"accept":"Durable payout outbox survives every crash/RPC boundary without duplicate or lost liabilities.","evidence":"The run record of the gate as its owner lane records it through tools/ci/test-record.mjs.","priority":"P0","profile":"P00","cadence":"Every release candidate","method":"Automated + independent review","status":"NOT RUN","source":["R1"],"gate":"Integration gates closed","owner":"pool lane (a1c484c48a62948c2)","manual_page":null,"owner_lane":"pool lane (a1c484c48a62948c2)","run_status":"NOT RUN","master_status":"PROPOSED / NOT RUN","updated":"2026-10-08T20:10:24.556Z","evidence_record":{"reason":"INT-03 (R1 integration gate): the gate's harness is the owner lane's (pool lane (a1c484c48a62948c2)); not yet named in the map","at":"2026-10-08T20:10:24.556Z","method":"static","requirement_id":"INT-03","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null}},{"id":"INT-04","title":"Corrupt existing pool state, disk-full and reorg cause safe recovery, not silent empty balances.","setup":"Integration gate INT-04 of the master edition (R1 / Additional regression gates).","steps":["Corrupt existing pool state, disk-full and reorg cause safe recovery, not silent empty balances."],"accept":"Corrupt existing pool state, disk-full and reorg cause safe recovery, not silent empty balances.","evidence":"The run record of the gate as its owner lane records it through tools/ci/test-record.mjs.","priority":"P0","profile":"P00","cadence":"Every release candidate","method":"Automated + independent review","status":"NOT RUN","source":["R1"],"gate":"Integration gates closed","owner":"pool lane (a1c484c48a62948c2)","manual_page":null,"owner_lane":"pool lane (a1c484c48a62948c2)","run_status":"NOT RUN","master_status":"PROPOSED / NOT RUN","updated":"2026-10-08T20:10:24.556Z","evidence_record":{"reason":"INT-04 (R1 integration gate): the gate's harness is the owner lane's (pool lane (a1c484c48a62948c2)); not yet named in the map","at":"2026-10-08T20:10:24.556Z","method":"static","requirement_id":"INT-04","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null}},{"id":"INT-05","title":"The supplied finality implementation matches the approved anchor rule after >window healing.","setup":"Integration gate INT-05 of the master edition (R1 / Additional regression gates).","steps":["The supplied finality implementation matches the approved anchor rule after >window healing."],"accept":"The supplied finality implementation matches the approved anchor rule after >window healing.","evidence":"The run record of the gate as its owner lane records it through tools/ci/test-record.mjs.","priority":"P0","profile":"P00","cadence":"Every release candidate","method":"Automated + independent review","status":"NOT RUN","source":["R1"],"gate":"Integration gates closed","owner":"node lane (a283f5f0d364ceef0)","manual_page":null,"owner_lane":"node lane (a283f5f0d364ceef0)","run_status":"NOT RUN","master_status":"PROPOSED / NOT RUN","updated":"2026-10-08T20:10:24.556Z","evidence_record":{"reason":"INT-05 (R1 integration gate): the gate's harness is the owner lane's (node lane (a283f5f0d364ceef0)); not yet named in the map","at":"2026-10-08T20:10:24.556Z","method":"static","requirement_id":"INT-05","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null}},{"id":"INT-06","title":"Recovery tests state and preserve their weaker fault bound; interfaces never label it as a stronger guarantee.","setup":"Integration gate INT-06 of the master edition (R1 / Additional regression gates).","steps":["Recovery tests state and preserve their weaker fault bound; interfaces never label it as a stronger guarantee."],"accept":"Recovery tests state and preserve their weaker fault bound; interfaces never label it as a stronger guarantee.","evidence":"The run record of the gate as its owner lane records it through tools/ci/test-record.mjs.","priority":"P0","profile":"P00","cadence":"Every release candidate","method":"Automated + independent review","status":"NOT RUN","source":["R1"],"gate":"Integration gates closed","owner":"node lane (a283f5f0d364ceef0)","manual_page":null,"owner_lane":"node lane (a283f5f0d364ceef0)","run_status":"NOT RUN","master_status":"PROPOSED / NOT RUN","updated":"2026-10-08T20:10:24.556Z","evidence_record":{"reason":"INT-06 (R1 integration gate): the gate's harness is the owner lane's (node lane (a283f5f0d364ceef0)); not yet named in the map","at":"2026-10-08T20:10:24.556Z","method":"static","requirement_id":"INT-06","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null}},{"id":"INT-07","title":"One v6 object agrees in node, pool, CPU verifier and each supported GPU host across activation.","definition":"V6-12 (R1 p. 213): the release manifest is signed and binds lockfile hashes, kernel and host binaries, supported devices and drivers, the prover server patch, memory thresholds and tuner identity, with end-to-end artifact authentication and a clean-install accepted-and-paid test on an independent machine with no unpublished files, symlinks or shell overrides.","setup":"Integration gate INT-07 of the master edition (R1 / Additional regression gates).","steps":["One v6 object agrees in node, pool, CPU verifier and each supported GPU host across activation."],"accept":"One v6 object agrees in node, pool, CPU verifier and each supported GPU host across activation.","evidence":"The run record of the gate as its owner lane records it through tools/ci/test-record.mjs.","priority":"P0","profile":"P00","cadence":"Every release candidate","method":"Automated + independent review","status":"NOT RUN","source":["R1"],"gate":"Integration gates closed","owner":"CI steward with the hash lane (a690540514aa453d7) and the worker lane (a9e87343f008e0edd)","manual_page":null,"owner_lane":"CI steward with the hash lane (a690540514aa453d7) and the worker lane (a9e87343f008e0edd)","run_status":"NOT RUN","master_status":"PROPOSED / NOT RUN","updated":"2026-10-08T20:10:24.556Z","evidence_record":{"reason":"INT-07 (R1 integration gate): the gate's harness is the owner lane's (CI steward with the hash lane (a690540514aa453d7) and the worker lane (a9e87343f008e0edd)); not yet named in the map","at":"2026-10-08T20:10:24.556Z","method":"static","requirement_id":"INT-07","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null}},{"id":"INT-08","title":"Census, production acceptance, schedule counters and live-dataset tests use the identical frozen contract.","setup":"Integration gate INT-08 of the master edition (R1 / Additional regression gates).","steps":["Census, production acceptance, schedule counters and live-dataset tests use the identical frozen contract."],"accept":"Census, production acceptance, schedule counters and live-dataset tests use the identical frozen contract.","evidence":"The run record of the gate as its owner lane records it through tools/ci/test-record.mjs.","priority":"P0","profile":"P00","cadence":"Every release candidate","method":"Automated + independent review","status":"NOT RUN","source":["R1"],"gate":"Integration gates closed","owner":"CI steward with the hash lane (a690540514aa453d7) and the worker lane (a9e87343f008e0edd)","manual_page":null,"owner_lane":"CI steward with the hash lane (a690540514aa453d7) and the worker lane (a9e87343f008e0edd)","run_status":"NOT RUN","master_status":"PROPOSED / NOT RUN","updated":"2026-10-08T20:10:24.556Z","evidence_record":{"reason":"INT-08 (R1 integration gate): the gate's harness is the owner lane's (CI steward with the hash lane (a690540514aa453d7) and the worker lane (a9e87343f008e0edd)); not yet named in the map","at":"2026-10-08T20:10:24.556Z","method":"static","requirement_id":"INT-08","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null}},{"id":"INT-09","title":"Eight- and twelve-GiB epoch transitions recover deliberately without relying on repeated OOM/watchdog cycles.","setup":"Integration gate INT-09 of the master edition (R1 / Additional regression gates).","steps":["Eight- and twelve-GiB epoch transitions recover deliberately without relying on repeated OOM/watchdog cycles."],"accept":"Eight- and twelve-GiB epoch transitions recover deliberately without relying on repeated OOM/watchdog cycles.","evidence":"The run record of the gate as its owner lane records it through tools/ci/test-record.mjs.","priority":"P0","profile":"P00","cadence":"Every release candidate","method":"Automated + independent review","status":"NOT RUN","source":["R1"],"gate":"Integration gates closed","owner":"app lane","manual_page":null,"owner_lane":"app lane","run_status":"NOT RUN","master_status":"PROPOSED / NOT RUN","updated":"2026-10-08T20:10:24.556Z","evidence_record":{"reason":"INT-09 (R1 integration gate): the gate's harness is the owner lane's (app lane); not yet named in the map","at":"2026-10-08T20:10:24.556Z","method":"static","requirement_id":"INT-09","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null}},{"id":"INT-10","title":"Metal/CUDA/OpenCL exact dataset geometry agrees; unsupported packs reject before launch.","setup":"Integration gate INT-10 of the master edition (R1 / Additional regression gates).","steps":["Metal/CUDA/OpenCL exact dataset geometry agrees; unsupported packs reject before launch."],"accept":"Metal/CUDA/OpenCL exact dataset geometry agrees; unsupported packs reject before launch.","evidence":"The run record of the gate as its owner lane records it through tools/ci/test-record.mjs.","priority":"P0","profile":"P00","cadence":"Every release candidate","method":"Automated + independent review","status":"NOT RUN","source":["R1"],"gate":"Integration gates closed","owner":"CI steward with the hash lane (a690540514aa453d7) and the worker lane (a9e87343f008e0edd)","manual_page":null,"owner_lane":"CI steward with the hash lane (a690540514aa453d7) and the worker lane (a9e87343f008e0edd)","run_status":"NOT RUN","master_status":"PROPOSED / NOT RUN","updated":"2026-10-08T20:10:24.556Z","evidence_record":{"reason":"INT-10 (R1 integration gate): the gate's harness is the owner lane's (CI steward with the hash lane (a690540514aa453d7) and the worker lane (a9e87343f008e0edd)); not yet named in the map","at":"2026-10-08T20:10:24.556Z","method":"static","requirement_id":"INT-10","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null}},{"id":"INT-11","title":"Only a memory-reserved proving job launches; mining buffers really release when required.","setup":"Integration gate INT-11 of the master edition (R1 / Additional regression gates).","steps":["Only a memory-reserved proving job launches; mining buffers really release when required."],"accept":"Only a memory-reserved proving job launches; mining buffers really release when required.","evidence":"The run record of the gate as its owner lane records it through tools/ci/test-record.mjs.","priority":"P0","profile":"P00","cadence":"Every release candidate","method":"Automated + independent review","status":"NOT RUN","source":["R1"],"gate":"Integration gates closed","owner":"app lane","manual_page":null,"owner_lane":"app lane","run_status":"NOT RUN","master_status":"PROPOSED / NOT RUN","updated":"2026-10-08T20:10:24.556Z","evidence_record":{"reason":"INT-11 (R1 integration gate): the gate's harness is the owner lane's (app lane); not yet named in the map","at":"2026-10-08T20:10:24.556Z","method":"static","requirement_id":"INT-11","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null}},{"id":"INT-12","title":"Transient shard errors can retry safely; expiration, loss and paid work remain distinct durable outcomes.","setup":"Integration gate INT-12 of the master edition (R1 / Additional regression gates).","steps":["Transient shard errors can retry safely; expiration, loss and paid work remain distinct durable outcomes."],"accept":"Transient shard errors can retry safely; expiration, loss and paid work remain distinct durable outcomes.","evidence":"The run record of the gate as its owner lane records it through tools/ci/test-record.mjs.","priority":"P0","profile":"P00","cadence":"Every release candidate","method":"Automated + independent review","status":"NOT RUN","source":["R1"],"gate":"Integration gates closed","owner":"proving lane (a6e8f84588b809d62) and fleet lane (ac055d60427caab99)","manual_page":null,"owner_lane":"proving lane (a6e8f84588b809d62) and fleet lane (ac055d60427caab99)","run_status":"NOT RUN","master_status":"PROPOSED / NOT RUN","updated":"2026-10-08T20:10:24.556Z","evidence_record":{"reason":"INT-12 (R1 integration gate): the gate's harness is the owner lane's (proving lane (a6e8f84588b809d62) and fleet lane (ac055d60427caab99)); not yet named in the map","at":"2026-10-08T20:10:24.556Z","method":"static","requirement_id":"INT-12","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null}},{"id":"INT-13","title":"Ember cannot retain a rate-ineligible prior; material workload changes invalidate incompatible profiles.","setup":"Integration gate INT-13 of the master edition (R1 / Additional regression gates).","steps":["Ember cannot retain a rate-ineligible prior; material workload changes invalidate incompatible profiles."],"accept":"Ember cannot retain a rate-ineligible prior; material workload changes invalidate incompatible profiles.","evidence":"The run record of the gate as its owner lane records it through tools/ci/test-record.mjs.","priority":"P0","profile":"P00","cadence":"Every release candidate","method":"Automated + independent review","status":"NOT RUN","source":["R1"],"gate":"Integration gates closed","owner":"Ember lane (a04fe3451877e2ff0) with the app lane","manual_page":null,"owner_lane":"Ember lane (a04fe3451877e2ff0) with the app lane","run_status":"NOT RUN","master_status":"PROPOSED / NOT RUN","updated":"2026-10-08T20:10:24.556Z","evidence_record":{"reason":"INT-13 (R1 integration gate): the gate's harness is the owner lane's (Ember lane (a04fe3451877e2ff0) with the app lane); not yet named in the map","at":"2026-10-08T20:10:24.556Z","method":"static","requirement_id":"INT-13","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null}},{"id":"INT-14","title":"Protected helper and per-device leases restore owned settings on normal/abnormal exit; real ACL/security tests.","setup":"Integration gate INT-14 of the master edition (R1 / Additional regression gates).","steps":["Protected helper and per-device leases restore owned settings on normal/abnormal exit; real ACL/security tests."],"accept":"Protected helper and per-device leases restore owned settings on normal/abnormal exit; real ACL/security tests.","evidence":"The run record of the gate as its owner lane records it through tools/ci/test-record.mjs.","priority":"P0","profile":"P00","cadence":"Every release candidate","method":"Automated + independent review","status":"NOT RUN","source":["R1"],"gate":"Integration gates closed","owner":"Ember lane (a04fe3451877e2ff0) with the app lane","manual_page":null,"owner_lane":"Ember lane (a04fe3451877e2ff0) with the app lane","run_status":"NOT RUN","master_status":"PROPOSED / NOT RUN","updated":"2026-10-08T20:10:24.556Z","evidence_record":{"reason":"INT-14 (R1 integration gate): the gate's harness is the owner lane's (Ember lane (a04fe3451877e2ff0) with the app lane); not yet named in the map","at":"2026-10-08T20:10:24.556Z","method":"static","requirement_id":"INT-14","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null}},{"id":"INT-15","title":"Public PoP replay is not session authorization; payout/server/network binding enforced.","setup":"Integration gate INT-15 of the master edition (R1 / Additional regression gates).","steps":["Public PoP replay is not session authorization; payout/server/network binding enforced."],"accept":"Public PoP replay is not session authorization; payout/server/network binding enforced.","evidence":"The run record of the gate as its owner lane records it through tools/ci/test-record.mjs.","priority":"P0","profile":"P00","cadence":"Every release candidate","method":"Automated + independent review","status":"NOT RUN","source":["R1"],"gate":"Integration gates closed","owner":"pool lane (a1c484c48a62948c2)","manual_page":null,"owner_lane":"pool lane (a1c484c48a62948c2)","run_status":"NOT RUN","master_status":"PROPOSED / NOT RUN","updated":"2026-10-08T20:10:24.556Z","evidence_record":{"reason":"INT-15 (R1 integration gate): the gate's harness is the owner lane's (pool lane (a1c484c48a62948c2)); not yet named in the map","at":"2026-10-08T20:10:24.556Z","method":"static","requirement_id":"INT-15","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null}},{"id":"INT-16","title":"Pool parsing/queues/connection and crypto budgets remain bounded under controlled adversarial traffic.","setup":"Integration gate INT-16 of the master edition (R1 / Additional regression gates).","steps":["Pool parsing/queues/connection and crypto budgets remain bounded under controlled adversarial traffic."],"accept":"Pool parsing/queues/connection and crypto budgets remain bounded under controlled adversarial traffic.","evidence":"The run record of the gate as its owner lane records it through tools/ci/test-record.mjs.","priority":"P0","profile":"P00","cadence":"Every release candidate","method":"Automated + independent review","status":"NOT RUN","source":["R1"],"gate":"Integration gates closed","owner":"pool lane (a1c484c48a62948c2)","manual_page":null,"owner_lane":"pool lane (a1c484c48a62948c2)","run_status":"NOT RUN","master_status":"PROPOSED / NOT RUN","updated":"2026-10-08T20:10:24.556Z","evidence_record":{"reason":"INT-16 (R1 integration gate): the gate's harness is the owner lane's (pool lane (a1c484c48a62948c2)); not yet named in the map","at":"2026-10-08T20:10:24.556Z","method":"static","requirement_id":"INT-16","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null}},{"id":"INT-17","title":"Missing oracle/keys/mandatory real-proof fixture blocks the applicable production acceptance gate.","setup":"Integration gate INT-17 of the master edition (R1 / Additional regression gates).","steps":["Missing oracle/keys/mandatory real-proof fixture blocks the applicable production acceptance gate."],"accept":"Missing oracle/keys/mandatory real-proof fixture blocks the applicable production acceptance gate.","evidence":"The run record of the gate as its owner lane records it through tools/ci/test-record.mjs.","priority":"P0","profile":"P00","cadence":"Every release candidate","method":"Automated + independent review","status":"NOT RUN","source":["R1"],"gate":"Integration gates closed","owner":"proving lane (a6e8f84588b809d62)","manual_page":null,"owner_lane":"proving lane (a6e8f84588b809d62)","run_status":"NOT RUN","master_status":"PROPOSED / NOT RUN","updated":"2026-10-08T20:10:24.556Z","evidence_record":{"reason":"INT-17 (R1 integration gate): the gate's harness is the owner lane's (proving lane (a6e8f84588b809d62)); not yet named in the map","at":"2026-10-08T20:10:24.556Z","method":"static","requirement_id":"INT-17","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null}},{"id":"INT-18","title":"Whole-system economics pass the strongest feasible adversary, including sunk development and multi-epoch survival.","setup":"Integration gate INT-18 of the master edition (R1 / Additional regression gates).","steps":["Whole-system economics pass the strongest feasible adversary, including sunk development and multi-epoch survival."],"accept":"Whole-system economics pass the strongest feasible adversary, including sunk development and multi-epoch survival.","evidence":"The run record of the gate as its owner lane records it through tools/ci/test-record.mjs.","priority":"P0","profile":"P00","cadence":"Every release candidate","method":"Automated + independent review","status":"NOT RUN","source":["R1"],"gate":"Integration gates closed","owner":"research lane (ad6a2bd47d4a46105)","manual_page":null,"owner_lane":"research lane (ad6a2bd47d4a46105)","run_status":"NOT RUN","master_status":"PROPOSED / NOT RUN","updated":"2026-10-08T20:10:24.556Z","evidence_record":{"reason":"INT-18 (R1 integration gate): the gate's harness is the owner lane's (research lane (ad6a2bd47d4a46105)); not yet named in the map","at":"2026-10-08T20:10:24.556Z","method":"static","requirement_id":"INT-18","decision":"NOT RUN","reviewer":"","claim_impact":"","release_identity":{"commit":"","lockfile":"","binary":"","network_object":"","activation":"","profile_hashes":""}},"approvals":{"scope_approved":null,"implementation_complete":null,"evidence_reproduced":null,"claim_authorised":null}}],"notes":[{"at":"2026-10-08T20:10:24.874Z","text":"REC-01 (the master edition's one unresolved interpretation, finality pause-only healing: R1's I03 stale predicate against R2's F04 backfill caveat): closure evidence as the finality and node lanes recorded it on 8 October 2026: rule v4 at release-2.0.0-node 12424341's line, mode recovery by the founder's 19:57 ruling (the lock labelled recovery, never final), both real-node lines PASS tonight by the 6.7 pause criterion, FIN-02 PASS at 0218d6bf1 on the simulator half; status RUNNING until the beyond-window healing case with and without historical data is run natively (the node lane's case tomorrow). Applies to INT-05 and INT-06."}]}],"profiles":{"P00":{"title":"Frozen scope and approval","requirements":["Approve the release manifest, supported roles, numerical profiles, mandatory scenarios, trust/fault model, workload W, adapters and claims before confirmatory tests. Unknown values are BLOCKED, not defaults.","Core safety and authentication invariants admit no waiver. Proposed performance or commercial targets may be replaced only before the confirmatory run, with an independent rationale and a versioned public scope.","After a failure, weakening a target creates a different claim and requires a new assessment. Preserve all failed runs; do not average a blocker away."],"status":"PROPOSED - REQUIRES APPROVAL"},"P01":{"title":"Correctness and negative-test depth","requirements":["Zero observed invalid acceptance, unauthorised signature, conflicting finality within assumptions, duplicated reward or unexplained cross-backend state/hash disagreement.","Minimum proposed campaign: 1,000,000 full-hash vectors per supported backend across all families, plus at least 10,000 malformed/boundary cases per relevant parser or binding class. Include exhaustive small-domain cases and historical regressions.","All prescribed critical mutants must be detected. This sampling target is not a bound on cryptographic failure probability and does not replace independent reasoning about soundness or safety."],"status":"PROPOSED - REQUIRES APPROVAL"},"P02":{"title":"Hardware coverage and reproducibility","requirements":["At least 12 physical retail configurations: at least 3 NVIDIA, 3 AMD and 2 Apple configurations, at least two discrete-GPU generations, an advertised 8 GB mining tier and 12 GB proving tiers where claimed. Record usable, not nominal, memory.","Declare a competitive core of at least 6 configurations spanning every advertised vendor and at least two discrete generations before optimisation. The wider cohort remains mandatory for access and economic tests; it cannot be silently dropped.","Use 5 paired 30-minute steady-state runs per primary cell after at least 15 minutes of warm-up and a stable temperature trend. Calibrated wall meter uncertainty must be at most 2%. Run a 7-day soak on representative low/mid/high tiers.","Three unaffiliated operators participate; every competitive-core cell is reproduced by at least two. Identical-SKU energy/accepted-work results must agree within 5% after declared environment corrections; unexplained variance blocks the headline."],"status":"PROPOSED - REQUIRES APPROVAL"},"P03":{"title":"Candidate improvement and honest-card budget","requirements":["For production candidate changes, per mandatory GPU cell: no more than 5% increase in joules per accepted work and no more than 2% decrease in accepted throughput versus the paired tuned baseline. Absolute safety limits always apply.","G2 requires at least a 10% reduction in the strongest evaluated specialist advantage after redesign, outside the declared measurement/model uncertainty, while meeting those budgets. A failed experiment is not a successful upgrade.","Existing clock-lock savings belong in the baseline. Long programs cannot pass by adding enough equally costly work to both devices to improve a ratio while materially worsening honest operation."],"status":"PROPOSED - REQUIRES APPROVAL"},"P04":{"title":"Scoped specialist-competition target","requirements":["Define R_E as GPU wall joules per accepted work divided by the lowest credible complete-system specialist joules for that same work. The proposed target is R_E at most 1.5 for every competitive-core cell at the same node and one node ahead.","Evaluate at least three materially distinct specialist architectures, with one programmable multi-family design, and a second independent reviewer. Include shared/reduced memory, hybrid execution, selective participation and realistic power/host costs.","Publish two-node-ahead and modular/reused-IP stress cases; they must satisfy the predeclared P12 economic envelope. No universal ceiling for unknown future hardware is claimed. Report model bounds separately from statistical confidence.","A lower-bound specialist estimate, not a convenient average or a deliberately constrained reference architecture, drives the conservative comparison. Undefined or unbounded decision-critical assumptions make the result BLOCKED."],"status":"PROPOSED - REQUIRES APPROVAL"},"P05":{"title":"Measurement and inference protocol","requirements":["Pre-register primary metrics, cohorts, holdout seeds, run order, exclusions and analysis before confirmation. Keep tuning/training runs separate from holdout runs.","Use independent runs/operators as measurement units. Report point estimates, two-sided 95% measurement intervals and absolute sample counts; handle time-series dependence with a declared block or run-level method.","Apply conservative uncertainty to pass decisions. A confidence interval around measured GPU energy does not capture unknown ASIC architectures; model parameter ranges and expert judgement must be reported as such.","Never compare raw hashes per second across different algorithms. Do not transform a five-year scenario sweep into a probability of chip arrival or a guarantee of future profitability."],"status":"PROPOSED - REQUIRES APPROVAL"},"P06":{"title":"Memory and support policy","requirements":["All advertised role/configuration combinations must finish without OOM, corruption or unsafe fallback. Publish a component memory budget, including display/OS, driver, miner, prover, aggregation and epoch construction.","Proposed support horizon: at least 24 months of known schedule compatibility for the advertised entry tier, unless a narrower horizon is prominently approved before sale or launch. Removal changes the claim and must pass ECO-07.","Treat 5.5 / 8.5 / 11.5 GiB as source candidates, not imposed final rules. Simultaneous operation, eviction and time-sharing are distinct advertised modes with separately measured cost."],"status":"PROPOSED - REQUIRES APPROVAL"},"P07":{"title":"Proof service capacity and fairness","requirements":["Freeze W as a meaningful workload mix, input sizes, proof format, fleet and requests/hour. Primary proposed target: 72 hours at W, plus 24 hours at 1.2W; at least 99.5% accepted jobs delivered valid within the contracted deadline.","Default delivery targets for the declared internal reference workload: p95 at most 60 seconds and p99 at most 120 seconds from input-ready assignment through verified delivery. Also publish request-to-delivery including input wait; no claim may omit that delay.","Request-to-delivery p99 must meet the separately approved customer deadline. Payment p99 must be at most 10 minutes after verified payable eligibility, with chain finality time reported separately. These defaults do not override a stricter contract.","No statistically supported positive backlog drift at steady load, no silent drops; after 2W for 15 minutes, drain excess backlog within 30 minutes of return to W. Report rejected demand and accepted-job success separately.","Proposed advertised-tier fairness: at least 90% timely valid assigned completions are paid under the approved rules; avoidable duplicate/retry work is at most 10% of total work. Reassignment policy must bound abandonment without promising every assignment a reward."],"status":"PROPOSED - REQUIRES APPROVAL"},"P08":{"title":"Fault assumptions and recovery","requirements":["F0 must state the exact safety threshold, quorum and authority-transition rule; the synchrony/participation assumptions for liveness; trusted inputs; and clock/expiry semantics. This manual supplies no substitute consensus rule.","Exercise threshold-minus/at/plus cases, the 40/40/20 partition fixture, signing outages and 31/35/60/90 logical-day expiry cases. Preserve safety when liveness assumptions fail; do not demand finality from an unavailable quorum.","After assumptions and input availability are restored: service replacement within 10 minutes and deterministic network convergence within 30 minutes on the reference topology. Different certified bounds must be approved beforehand.","Accelerated-time simulation and real elapsed operation are separate evidence classes. Recovery may not reverse a guarantee previously represented as final."],"status":"PROPOSED - REQUIRES APPROVAL"},"P09":{"title":"Security and bounded resource requirements","requirements":["Zero unresolved critical or high-severity security findings on the claimed release. Independent scopes must cover consensus, proof soundness/parameters, implementation bypasses, wallet/isolation and relevant operational controls.","Review the intended proof-system security level and assumptions explicitly; do not infer a security-bit claim from random rejection tests. Version every verifier, program and parameter set.","Freeze maximum valid/invalid verification time, memory, disk and admission rates for ordinary validator hardware. At rated valid load plus the approved hostile load, no unbounded growth, invalid acceptance or unrecoverable process failure.","For supported wallet fee-estimation cases, proposed absolute error at most 5% versus the specified charge when inputs are unchanged; deterministic fee-cap handling and explicit uncertainty otherwise. Customer contracts remain separately binding."],"status":"PROPOSED - REQUIRES APPROVAL"},"P10":{"title":"Ordinary-operator product targets","requirements":["At least 30 unaffiliated first-time study participants across supported Windows/macOS combinations. At least 90% install, configure safely and submit accepted work without staff help; p90 active setup at most 15 minutes. Publish complete download/dataset time separately.","Pause/stop acknowledgement within 2 seconds, safe worker stop within 5 seconds where no documented atomic operation prevents it, and reliable restoration of original tuning settings. No hidden custody or silent update.","Net-energy/fee displays reconcile within 5% under the declared measurement boundary. Incremental rejected-work loss on the normal home-link profile is at most 2 percentage points over the matched datacentre profile.","Open miner efficiency is within 5% of the best independently tuned permitted implementation on identical work. For the declared single-card payout case, p95 payable-to-payment at most 24 hours and total payout friction at most 2% of earned value.","Critical alerts are emitted within 60 seconds of detectable evidence. At least 90% of study users can identify the injected failure and follow the published safe action. No control target excuses a security failure."],"status":"PROPOSED - REQUIRES APPROVAL"},"P11":{"title":"No-founder exercise and independence","requirements":["At least 10 verified unaffiliated operators, three independently administered network/hosting domains and sufficient honest weight/capacity to satisfy F0 and W after founders are removed.","Run at least 30 real elapsed days without founder mining, proving, aggregation, bootstrap, required RPC, private files or privileged interventions. Cross all known logical transitions separately without calling accelerated time real history.","Document control by role and common dependencies; uncertain identities are not counted as independent. Within-assumption withdrawals must satisfy P08; losing more than the assumed quorum may cause a visible safe pause."],"status":"PROPOSED - REQUIRES APPROVAL"},"P12":{"title":"Five-year coexistence envelope","requirements":["Freeze a sourced revenue reference R and mandatory worlds before results. Sweep 0.25R, R, 4R and 10R; electricity at $0.03/$0.10/$0.25/$0.40 per kWh; 1/3/5-year productive life; zero/$20M/$75M development; private mining and hardware sales; no/normal/spiking external demand.","Those values are proposed stress inputs, not current prices or forecasts. Declare which worlds have enough funded demand for rational ongoing service before running; retain collapse worlds as explicit safety/exit tests, not profitable successes.","Proposed matched-tariff new-entry target in every mandatory sustainable world: median GPU/specialist total cost per accepted work at most 1.5, 90th percentile at most 1.75, and no advertised competitive-core cell above 2.0. Publish every cell, including heterogeneous tariffs.","At least three purchasable GPU configurations across at least two advertised vendors must have positive modelled new-entry economics; at least 75% of the entry cohort must have positive marginal operating economics in those worlds. Report model uncertainty and failure regions.","Do not impose GPU market share, specialist production limits, token appreciation, full research-cost recovery or automatic chip death to force the result. Any such condition must become an explicit limitation rather than a hidden assumption."],"status":"PROPOSED - REQUIRES APPROVAL"},"P13":{"title":"Maintenance continuity","requirements":["Before a readiness claim, document at least 12 months of committed maintenance resources at the approved operating scope. Include engineering, security review, infrastructure, support and incident response.","Use independently reviewable commitments and downside budgets. Uncommitted future sales, rising token prices, burned fees or assumed fundraising are not available resources.","This is a proposed governance test, not a directive to change the supply cap, issuance allocation or fair-launch design."],"status":"PROPOSED - REQUIRES APPROVAL"},"P14":{"title":"Genuine commercial and developer proof","requirements":["At least three unrelated paying buyer organisations, each making at least three separate purchase decisions across at least 30 days; at least 1,000 meaningful verified external jobs in aggregate. Split invoices do not create independent demand.","No project reimbursement, circular funding or undisclosed related party counts. Report customer concentration and churn; proposed maximum largest-buyer share is 70% of qualifying revenue.","At least 20% aggregate contribution margin after directly attributable delivery costs, retries, refunds and support; publish fully loaded economics separately. At least 75% of sampled eligible operators have positive realised contribution on the declared workload.","At least five unaffiliated developers complete a useful supported application or proof-service integration using public documentation. Customer confirmation and raw commercial evidence may remain confidential to the reviewer."],"status":"PROPOSED - REQUIRES APPROVAL"},"P15":{"title":"Comparative contention threshold","requirements":["Pre-register at least three relevant operating GPU-first peers, plus a real proving alternative for customer comparisons. Verify current versions at execution time. The source reference set is a starting point, not a claim about current rankings.","Require at least three meaningful comparable dimensions with no material inferiority beyond a pre-agreed 10% margin against the best valid comparator, and at least two independently evidenced advantages against at least two peers.","Advantages must be either a greater-than-10% measured improvement outside uncertainty or a directly tested control/capability difference with demonstrated user value. Non-comparable or missing data is not a win.","A panel with hardware/economics, security/operations and customer/operator expertise must support the scoped contender conclusion. Passing these judgement-based thresholds does not certify a universal number-one ranking."],"status":"PROPOSED - REQUIRES APPROVAL"},"P16":{"title":"Observed durability and claim freshness","requirements":["At least 90 real elapsed days on the final compatible release family, at least 30 independently verified operators, and transparent eligibility/churn denominators. Material uncomparable changes reset affected observations.","Proposed outcomes: at least 60% day-90 operator retention and at least 75% of eligible observed operators with positive measured marginal operation over the period. Report incentives and electricity assumptions; do not claim a downturn was observed if it was not.","At least 99.9% availability for the declared customer service during eligible operating conditions, with all-in availability also reported; zero accepted invalid proofs or conflicting finality within F0 assumptions. Do not remove real incidents as maintenance to force a pass.","Run fault injection on isolated infrastructure, not unsuspecting customers. Publish planned test windows separately. Reassess claims at least quarterly and immediately after material hardware, protocol, economics or security changes."],"status":"PROPOSED - REQUIRES APPROVAL"}},"fixtures":[{"id":"F0","title":"Release and assurance manifest","contents":"Exact commits, binaries, genesis/network ID, mining class, dataset schedule, EVM fork/deviations, program/verifier IDs, fees, supply, quorum/fault rules, trust anchors, activation and supported roles."},{"id":"F1","title":"Clean build environments","contents":"Pinned toolchains, dependency locks, clean OS images and documented signing/notarisation boundaries. No production secrets or private founder files."},{"id":"F2","title":"Hardware and measurement lab","contents":"Approved physical GPU cohort, calibrated wall meters, stable thermal conditions, driver/OS images and realistic home/datacentre link conditions."},{"id":"F3","title":"Workload and oracle catalogue","contents":"Fixed full-hash and EVM/proving jobs, independent reference implementations, real customer-sized payloads, held-out seeds and complete expected results."},{"id":"F4","title":"Authorised fault network","contents":"Independent nodes/operators; controllable latency, loss, clocks, partitions, storage faults and role withdrawals. Actual consensus paths plus separately labelled simulators."},{"id":"F5","title":"Negative and regression corpus","contents":"Malformed transactions/proofs, wrong roots/IDs, duplicate payments, bad authority tables, historical failures and deliberately faulty code mutants."},{"id":"F6","title":"Specialist implementation pack","contents":"Functionally checked architectures, RTL/physical estimates where feasible, memory and board assumptions, cost inputs, adaptation paths and uncertainty ranges."},{"id":"F7","title":"Economic and incentive models","contents":"Independently reproducible costs, entry/exit/difficulty policies, scenario grid, operator opportunity costs and money-flow conservation fixtures."},{"id":"F8","title":"User/customer/peer studies","contents":"Consenting unaffiliated users, contracted meaningful workloads, private ownership checks, dated competitor methods and independent analysis."},{"id":"F9","title":"Evidence and status vault","contents":"Immutable run IDs, raw logs, hashes, analysis code, exclusions, defects, reviewers, signatures, privacy controls and public redacted summaries."}],"source_sha256":"418b3b9f68f96a413872fecb16f8508a40063891c70054c65e92e6e5f5fb70b6","scope_note":"Test design, not executed evidence. All numeric additions are proposed, not source-approved protocol rules. Optional claimed features require their tests; excluded features earn no pass credit.","all_pass_note":"Independent passage of all mandatory and claimed-option gates, including commercial and comparative observation, can support a scoped leadership-contender assessment. It does not prove a universal rank or eliminate unknown future hardware risks.","manual_page_count":73,"approval":{"by":"the founder","at":"2026-10-08 18:2x UK","word":"approve as proposed in the tests, forget P13 for now","profiles":{"P00":"APPROVED AS PROPOSED","P01":"APPROVED AS PROPOSED","P02":"APPROVED AS PROPOSED","P03":"APPROVED AS PROPOSED","P04":"APPROVED AS PROPOSED","P05":"APPROVED AS PROPOSED","P06":"APPROVED AS PROPOSED","P07":"APPROVED AS PROPOSED","P08":"APPROVED AS PROPOSED","P09":"APPROVED AS PROPOSED","P10":"APPROVED AS PROPOSED","P11":"APPROVED AS PROPOSED","P12":"APPROVED AS PROPOSED","P13":"DEFERRED by the founder","P14":"APPROVED AS PROPOSED","P15":"APPROVED AS PROPOSED","P16":"APPROVED AS PROPOSED"},"rules_in_force":["P03: a candidate change pays at most 5 percent of joules per accepted work and loses at most 2 percent of accepted throughput against the paired tuned baseline (replaces the 10 percent budget from 18:2x UK)","P04: R_E at most 1.5 for every competitive-core cell at the same node and one node ahead against the lowest credible complete-system specialist; today's placed bracket (1.5x to 2.1x same-node) is a FAIL to work against and is served as such","P12: the matched-tariff median at most 1.5, p90 at most 1.75, no core cell above 2.0","P02: twelve retail configurations, three unaffiliated operators, the seven-day soak define D1's reproduction"]},"live_fields":{"run_status":"NOT RUN | BLOCKED | FAIL | PASS (the master, p. 139; in_progress_since marks work under way; deferral_note a founder deferral)","owner_lane":"the lane that runs the case, with its id","evidence_path":"the file on the box mirror master that holds the evidence record in the standard's template","run_id":"the run that produced the latest status","updated":"the minute the lane last wrote the case"},"notes":[{"at":"2026-10-08T20:10:24.748Z","text":"128 original test cases, 18 additional integration gates, 44 updated-stack closure requirements. These sets overlap and are not 190 independent tests."}]}</script>
 <script>
 /* /acceptance runtime: printed at build from site/lib/acceptance-render.mjs (one source for both renders) */
 (function(){
diff --git a/site/address.html b/site/address.html
index 1379dda6e..d28ab2206 100644
--- a/site/address.html
+++ b/site/address.html
@@ -157,7 +157,7 @@ main{padding-bottom:100px}.card{background:var(--row);border:1px solid var(--lin
         <div class="panel-list">
           <a href="/litepaper" data-nav="litepaper"><b>Litepaper</b><span>The design, as published.</span></a>
           <a href="/income" data-nav="income"><b>Income</b><span>What your card would mine, from the live network.</span></a>
-          <a href="/economics" data-nav="economics"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/acceptance" data-nav="acceptance"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
+          <a href="/economics" data-nav="economics"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/prize" data-nav="prize"><b>Prize</b><span>A better adversary or a reproduced shortcut, never a confirmation: the terms.</span></a><a href="/acceptance" data-nav="acceptance"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
           <a href="/ledger" data-nav="ledger"><b>Ledger</b><span>Every criticism, answered or conceded.</span></a>
           <a href="/claims" data-nav="claims"><b>What Igneum does not claim</b><span>The limits, stated first.</span></a>
           <a href="/randomx" data-nav="randomx"><b>Igneum vs RandomX</b><span>What was kept and what was rebuilt for GPUs.</span></a>
@@ -197,7 +197,7 @@ main{padding-bottom:100px}.card{background:var(--row);border:1px solid var(--lin
       <div class="sheet-group"><div class="sheet-head">Learn</div>
         <a href="/litepaper" data-nav="litepaper"><b>Litepaper</b><span>The design, as published.</span></a>
         <a href="/income" data-nav="income"><b>Income</b><span>What your card would mine, from the live network.</span></a>
-        <a href="/economics" data-nav="economics"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/acceptance" data-nav="acceptance"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
+        <a href="/economics" data-nav="economics"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/prize" data-nav="prize"><b>Prize</b><span>A better adversary or a reproduced shortcut, never a confirmation: the terms.</span></a><a href="/acceptance" data-nav="acceptance"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
         <a href="/ledger" data-nav="ledger"><b>Ledger</b><span>Every criticism, answered or conceded.</span></a>
         <a href="/claims" data-nav="claims"><b>What Igneum does not claim</b><span>The limits, stated first.</span></a>
         <a href="/randomx" data-nav="randomx"><b>Igneum vs RandomX</b><span>What was kept and what was rebuilt for GPUs.</span></a>
diff --git a/site/api/acceptance.mjs b/site/api/acceptance.mjs
index 06c07d853..4d406550b 100644
--- a/site/api/acceptance.mjs
+++ b/site/api/acceptance.mjs
@@ -12,7 +12,7 @@ export function decode(reply) {
   if (!reply || typeof reply.content !== 'string') throw new Error('the git host reply has no content field');
   const b64 = reply.encoding === 'base64' || !reply.encoding;
   const text = b64 ? Buffer.from(reply.content.replace(/\s+/g, ''), 'base64').toString('utf8') : reply.content;
-  const registry = JSON.parse(text.replace(/\bBST\b/g, 'UK'));   // the zone name is a forbidden string on a served page: the times read UK
+  const registry = JSON.parse(text.replace(/\bBST\b/g, 'UK').replace(/\bPC [12]\b/g, 'the project’s own rig').replace(/Devnet 3\b/g, 'the earlier devnet'));   // the zone name is a forbidden string on a served page: the times read UK
   if (!registry || !Array.isArray(registry.suites)) throw new Error('the registry has no suites');
   return registry;
 }
diff --git a/site/app.html b/site/app.html
index faf2a82b9..413e2e025 100644
--- a/site/app.html
+++ b/site/app.html
@@ -125,7 +125,7 @@
         <div class="panel-list">
           <a href="/litepaper" data-nav="litepaper"><b>Litepaper</b><span>The design, as published.</span></a>
           <a href="/income" data-nav="income"><b>Income</b><span>What your card would mine, from the live network.</span></a>
-          <a href="/economics" data-nav="economics"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/acceptance" data-nav="acceptance"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
+          <a href="/economics" data-nav="economics"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/prize" data-nav="prize"><b>Prize</b><span>A better adversary or a reproduced shortcut, never a confirmation: the terms.</span></a><a href="/acceptance" data-nav="acceptance"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
           <a href="/ledger" data-nav="ledger"><b>Ledger</b><span>Every criticism, answered or conceded.</span></a>
           <a href="/claims" data-nav="claims"><b>What Igneum does not claim</b><span>The limits, stated first.</span></a>
           <a href="/randomx" data-nav="randomx"><b>Igneum vs RandomX</b><span>What was kept and what was rebuilt for GPUs.</span></a>
@@ -165,7 +165,7 @@
       <div class="sheet-group"><div class="sheet-head">Learn</div>
         <a href="/litepaper" data-nav="litepaper"><b>Litepaper</b><span>The design, as published.</span></a>
         <a href="/income" data-nav="income"><b>Income</b><span>What your card would mine, from the live network.</span></a>
-        <a href="/economics" data-nav="economics"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/acceptance" data-nav="acceptance"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
+        <a href="/economics" data-nav="economics"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/prize" data-nav="prize"><b>Prize</b><span>A better adversary or a reproduced shortcut, never a confirmation: the terms.</span></a><a href="/acceptance" data-nav="acceptance"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
         <a href="/ledger" data-nav="ledger"><b>Ledger</b><span>Every criticism, answered or conceded.</span></a>
         <a href="/claims" data-nav="claims"><b>What Igneum does not claim</b><span>The limits, stated first.</span></a>
         <a href="/randomx" data-nav="randomx"><b>Igneum vs RandomX</b><span>What was kept and what was rebuilt for GPUs.</span></a>
@@ -449,7 +449,7 @@
     </div>
     <div class="grid c2">
       <div class="dl-list" style="margin:0">
-        <a data-dl="miner-windows" href="https://dl.igneum.network/public/igneum-miner-windows.exe" class="primary">Windows <span data-dl-meta="miner-windows">v2.0.0 · 63.8 MB</span></a>
+        <a data-dl="miner-windows" href="https://dl.igneum.network/public/igneum-miner-windows.exe" class="primary">Windows <span data-dl-meta="miner-windows">v2.0.1 · 63.8 MB</span></a>
         <a data-dl="miner-mac" href="https://dl.igneum.network/public/igneum-miner-mac.dmg">macOS <span data-dl-meta="miner-mac">v2.0.1 · 45.9 MB</span></a>
         <a href="/miner#hive">Linux · HiveOS <span>the tarball and the flight sheet, on the miner page</span></a>
       </div>
@@ -472,7 +472,7 @@
   </div>
 </div>
 
-<a class="dl-bar" href="/miner#get"><b>Download the miner</b><span data-dl-meta="miner-windows">v2.0.0 · 63.8 MB</span></a>
+<a class="dl-bar" href="/miner#get"><b>Download the miner</b><span data-dl-meta="miner-windows">v2.0.1 · 63.8 MB</span></a>
 
 <!-- footer:start -->
 <footer class="site-footer">
diff --git a/site/audit.html b/site/audit.html
index e9240f520..2a38fafdb 100644
--- a/site/audit.html
+++ b/site/audit.html
@@ -130,7 +130,7 @@ table{min-width:560px}
         <div class="panel-list">
           <a href="/litepaper" data-nav="litepaper"><b>Litepaper</b><span>The design, as published.</span></a>
           <a href="/income" data-nav="income"><b>Income</b><span>What your card would mine, from the live network.</span></a>
-          <a href="/economics" data-nav="economics"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/acceptance" data-nav="acceptance"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit" aria-current="page"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
+          <a href="/economics" data-nav="economics"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/prize" data-nav="prize"><b>Prize</b><span>A better adversary or a reproduced shortcut, never a confirmation: the terms.</span></a><a href="/acceptance" data-nav="acceptance"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit" aria-current="page"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
           <a href="/ledger" data-nav="ledger"><b>Ledger</b><span>Every criticism, answered or conceded.</span></a>
           <a href="/claims" data-nav="claims"><b>What Igneum does not claim</b><span>The limits, stated first.</span></a>
           <a href="/randomx" data-nav="randomx"><b>Igneum vs RandomX</b><span>What was kept and what was rebuilt for GPUs.</span></a>
@@ -170,7 +170,7 @@ table{min-width:560px}
       <div class="sheet-group"><div class="sheet-head">Learn</div>
         <a href="/litepaper" data-nav="litepaper"><b>Litepaper</b><span>The design, as published.</span></a>
         <a href="/income" data-nav="income"><b>Income</b><span>What your card would mine, from the live network.</span></a>
-        <a href="/economics" data-nav="economics"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/acceptance" data-nav="acceptance"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit" aria-current="page"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
+        <a href="/economics" data-nav="economics"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/prize" data-nav="prize"><b>Prize</b><span>A better adversary or a reproduced shortcut, never a confirmation: the terms.</span></a><a href="/acceptance" data-nav="acceptance"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit" aria-current="page"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
         <a href="/ledger" data-nav="ledger"><b>Ledger</b><span>Every criticism, answered or conceded.</span></a>
         <a href="/claims" data-nav="claims"><b>What Igneum does not claim</b><span>The limits, stated first.</span></a>
         <a href="/randomx" data-nav="randomx"><b>Igneum vs RandomX</b><span>What was kept and what was rebuilt for GPUs.</span></a>
@@ -259,10 +259,10 @@ table{min-width:560px}
 <p>Labels: the five served labels are TEAM-REPORTED, MODELLED, PROPOSED, PENDING and EXCLUDED. A page that uses the older words (measured, modelled, designed, claimed, Implemented, approximate, owed) is listed with those words. "No label" means the page states a fact with neither.</p>
 </section>
 <section class="doc-section"><h2 id="the-pages">The pages</h2>
-<div class="tbl"><table><thead><tr><th>Page</th><th>What the sweep changed</th><th>What was rewritten</th><th>What still carries pre-2.0 copy</th><th>The evidence label of each claim</th><th>Open items</th></tr></thead><tbody><tr><td>404.html</td><td>+12 -16. Chrome; the description and the link list drop the engineering log</td><td>Nothing</td><td>None found</td><td>No claims</td><td>Shares the home card, whose PNG still prints the pre-reset line "No premine. No stake. No fee to any team."</td></tr><tr><td>address.html</td><td>+24 -27. Title and crumb "The devnet explorer"; network row "The devnet"; amounts at 18 decimals (67c404efa)</td><td>The four words with definitions and the section 9 link, as on /explorer (site-2.0-audit)</td><td>None found</td><td>No label: balance, nonce, earned 24 h are live reads</td><td>The explorer og card PNG still prints "Devnet 3"</td></tr><tr><td>app.html</td><td>+41 -45. Screenshot captions "0.3.22" become "The current build"; "The log." points at <code>docs/bench-log.md</code>; Windows v0.3.26, macOS v2.0.0; the testnet notice gone</td><td>The card and proving-memory lines: NVIDIA proves, AMD and Apple mine; 16 GB to mine and prove at the proposed 5.5 GiB dataset; the 4 GiB step pending decision (389baf565, d8c976e19, 9d18ce980); TEAM-REPORTED beside the measured rows and PENDING on the Arc expectation (site-2.0-audit)</td><td>Screenshots from recorded states of 7 October 2026; the Ember run 6 pounds line; the Windows build numbered 0.3.26</td><td>measured (8), proposed, pending decision; no five-label word. No label: the Arc 15.2 MH/s expectation, the pounds a day</td><td>The 4 GiB dataset step is PROPOSED pending the founder's word; screenshots are an older build</td></tr><tr><td>audit.html</td><td>New with this commit: rendered from <code>docs/site/audit-2.0.md</code></td><td>The whole page</td><td>None</td><td>Each cell is read from the repository and the git log</td><td>Re-read at every site commit; it is a snapshot of c7cfef9d0</td></tr><tr><td>docs.html</td><td>New with this commit: in the Learn panel after /audit, the sitemap, the capture routes and <code>site/og/pages.mjs</code> (card <code>docs</code>, no PNG yet)</td><td>The whole page: every 2.0 document by its master path on the public git host (the plan, the standard and its registry, the pins, the reference, the specifications, the finality guarantees, the evidence files the facts page cites, the tuning record, this audit, the ledger) (site-2.0-audit)</td><td>None</td><td>No claims; the descriptions carry the files' own labels</td><td><code>docs/analysis/class-v6/eco-05-results.md</code> is not on master yet, so its link answers 404 until it lands; the docs card PNG is not rendered</td></tr><tr><td>block.html</td><td>+24 -26. Title and crumb; network row "The devnet"; chips "finalised under lock" and "not yet finalised"; coinbase and subsidy at 18 decimals (6a81aa709, 67c404efa)</td><td>The four words with their definitions and the finality specification's section 9 link (5c8fdfa29, b45bf6d45); the source line names one node on the build box, not node1-dn3; the checkpoint note reads two thirds of active and of total 30-day weight (site-2.0-audit)</td><td>None found</td><td>The four words are states; no evidence label: every field is a live read</td><td>The explorer og card PNG still prints "Devnet 3"</td></tr><tr><td>build.html</td><td>+20 -22. Rendered from <code>docs/build/build.md</code>. The chain table holds the 2.0 devnet only (4465, igneum-devnet-4, 18 decimals); testnet column and devnet-number rows gone; mainnet 4461 reserved; Hardhat line 4465</td><td>The chain table and the paragraph under it (bf34d4927); the proof-share claim labelled TEAM-REPORTED, 8 October 2026, and the launch target labelled designed (in <code>docs/build/build.md</code>) (site-2.0-audit)</td><td>"web3_clientVersion answers igneumd/2.1.0/execution-layer-v3" is unchanged from site-pre-2.0; "Tested end to end on the devnet on a build box" was run before the 2.0 devnet</td><td>No label: the client string, the five-minute walkthrough, "a share of blocks carries a proof today", the under-a-minute target</td><td>Re-run the walkthrough and the client-version probe on igneum-devnet-4, or date them</td></tr><tr><td>claims.html</td><td>+17 -16. Generated from the litepaper's limits section, rebuilt from it in 50f517120</td><td>Same as litepaper#limits: the chip item, the debug item, four new items; rebuilt from litepaper#limits: the M32 citation now points at ledger D3 (site-2.0-audit)</td><td>Same as litepaper#limits: "ledger M32", "before gate 3", "100 to 200 consumer GPUs"</td><td>measured, modelled, designed, claimed, Open; no five-label word</td><td>Fixed by editing litepaper#limits and rebuilding; nothing is edited here</td></tr><tr><td>compatibility.html</td><td>+362, new (6b8f02eab). Rendered from <code>docs/build/compatibility.md</code>; rows from <code>tools/reference-apps/compat/results.json</code></td><td>The whole page: 20 of 20 rows on igneum-devnet-4 (0378ee0ef, 4c852c645); TEAM-REPORTED beside the run summary, in <code>docs/build/compatibility.md</code> and its generator <code>tools/reference-apps/compat/render.mjs</code> (site-2.0-audit)</td><td>None</td><td>Per-row verdicts passed, failed, untested, each with its evidence; no five-label word</td><td>/compatibility has no row in <code>site/og/pages.mjs</code> and shares the home card</td></tr><tr><td>dev-fee.html</td><td>+13 -16. Generated from the miner page's fee section. "a test network" becomes "a private test network"; "The log." points at <code>docs/bench-log.md</code>; the engineering log link becomes "Every claim and its status"</td><td>The 4 October 2026 row labelled TEAM-REPORTED on the miner page and regenerated (site-2.0-audit)</td><td>None: the 4 October 2026 row is a measurement</td><td>measured</td><td>None</td></tr><tr><td>download.html</td><td>+22 -25. Windows and HiveOS v0.3.26, macOS v2.0.0, wallet v0.1.6, new sha256 lines, Hive URL 0.3.26; the testnet notice gone</td><td>The macOS first-open notice (6a81aa709, 5c8fdfa29)</td><td>"Any 4 GB card mines at launch. A 24 GB NVIDIA card proves the full shard as well." (the miner page has the 2.0 line); Windows and HiveOS still numbered 0.3.x</td><td>No label: the card line</td><td>Card line to the miner page's 2.0 wording; drop the Mac notice the day the signed build ships</td></tr><tr><td>economics.html</td><td>+34 -37. TESTNET_1 column gone; "Devnet 3" becomes "the devnet"; the decimals row 18 one to one; manifest read node 4cdcc488</td><td>The proving section and fee rows: base fee on execution gas; the proving payment 90 percent to the pool and 10 percent burned, designed behind its constant; no part of the tip to provers; launch rate at 18 decimals; the first block's 3.168808781 IGN at 80/20 and the ramp read-back (cc3520cc4, c4adb2367, 389baf565)</td><td>"Source: the node fork at commit e0644958 (the devnet cut of 8 October 2026)", which site-pre-2.0 named the Devnet 3 cut; "On the devnet in the 24 hours to 12:16 UK on 8 October 2026: 8,209 shards paid", read before the 2.0 devnet's first block at 17:14 UK; "read 8 October 2026, 17:2x UK"</td><td>TEAM-REPORTED (1); modelled, designed, measured, "in the code"</td><td>Serve the 24-hour reading as the earlier devnet's (the scorecard already calls it history); re-read the line numbers at 4cdcc488 or say which commit; replace "17:2x" with the minute</td></tr><tr><td>evidence.html</td><td>+35 -61. Restarted (cf4542105, df465d478)</td><td>The facts page from <code>docs/evidence.md</code>: seven 2.0 rows, the six status words, the release evidence packet on every row (1281d01fb), the five served labels and the wording ladder</td><td>Row 5's result "the home page and the litepaper carry it as their 2.0 text lands" is stale: both carry it now</td><td>Status words designed, activated, tested by the team (implemented, reproduced externally, reviewed independently at 0); TEAM-REPORTED rows 1 to 4 and 7, MODELLED row 6, PROPOSED row 5</td><td>Row 5's result text; row 7's 4 GiB step PROPOSED pending the founder's word; the reference-population sentences land at 21:00</td></tr><tr><td>explorer.html</td><td>+32 -34. Title "Igneum 2.0 devnet explorer"; headings "The devnet explorer"; chain id line 4465</td><td>The four words and definitions (5c8fdfa29, b45bf6d45); finality "not yet active" until the weight window fills at DAA 7,200, with the live DAA (ace497b55, fcda08aed); the node1-dn3 source paragraph removed (it described only the earlier devnet's observer incident) (site-2.0-audit)</td><td>"Source since 12:25 UTC on 8 October 2026: node1-dn3 ... drifted from the chain at DAA 67,787", the earlier devnet's observer history</td><td>The four words; no evidence label: live reads</td><td>The explorer og card PNG still prints "Devnet 3"</td></tr><tr><td>faucet.html</td><td>+24 -28. "Devnet 3" becomes "the devnet"; chain id 4465; the testnet faucet row gone</td><td>Nothing</td><td>None found</td><td>No label: 10 IGN a day, once per address and per connection</td><td>The faucet og card PNG was not re-rendered after its kicker changed and still prints "Devnet 3 faucet"</td></tr><tr><td>grants.html</td><td>+16 -19. Rendered from <code>docs/build/grants.md</code>. "public testnet" becomes "the Igneum 2.0 devnet" and "the devnet"</td><td>Nothing</td><td>None found</td><td>No label: "the fund is zero today"</td><td>None beyond the chrome</td></tr><tr><td>income.html</td><td>+15 -58. The testnet-era tier tables, the TESTNET_1 schedule and the Owed list gone; "devnet and testnet IGN" becomes "devnet IGN"</td><td>Nothing: the calculator kept; the card rows labelled TEAM-REPORTED (class v4, 6 to 8 October 2026, no outside reproduction) (site-2.0-audit)</td><td>The card rows are the bench table's class v4 rows of 6 to 8 October 2026</td><td>Rows marked measured by the team (7), measured by the fleet (28), reported by the fleet (3); no five-label word</td><td>None</td></tr><tr><td>index.html</td><td>+38 -24. The positioning line as the sub-line; "The Igneum 2.0 devnet is the network today"; the engineering log link gone</td><td>The mission table (four deliverables, why each matters, evidence today with its label and file), the three boundaries in one line, the status line in the ladder's words, the miner row as paid work (c7cfef9d0); the chip line (36a83c39b, cff4be488, 98b1f664e); the Locked checkpoint tile reads two thirds of active and of total 30-day weight (site-2.0-audit)</td><td>The Windows button numbered v0.3.26</td><td>TEAM-REPORTED, MODELLED, PENDING. No label: "One click installs the node, the miner and the prover"; the fair-start row</td><td>The home og card PNG still prints the pre-reset line</td></tr><tr><td>ledger.html</td><td>+203 -1201. Rewritten</td><td>Generated from <code>docs/fud-ledger-2.0.md</code>: 26 entries R0 to C3, each with its pin; 12 Open, 5 Conceded, 1 Fixed or built, 8 Closed by rule or decided (cf4542105); D5 restated (bf34d4927); the pre-2.0 ids on other pages pointed at 2.0 entries or dropped: M32 to D3, E19 to A7, M4 to C1, P1 and P3 to D5; E20, F7 and M12 dropped (site-2.0-audit)</td><td>None: the pre-2.0 ledger stays as history in <code>docs/fud-ledger.md</code></td><td>Status words Open, Conceded, Fixed or built, Closed by rule or decided</td><td>None</td></tr><tr><td>light.html</td><td>+32 -32. "Devnet 3" becomes "the devnet"; the vote domain reads {network id}; the testnet chain entry gone</td><td>What the page authenticates and what it does not, the proof boundary, the data-availability paragraph, the three boundaries, the positioning line (5e5ba9b8a); padding (99461391f, b9d4aa80f); TEAM-REPORTED named on the page, 8 October 2026 (site-2.0-audit)</td><td>None found</td><td>"Authenticated here" and "Not authenticated here"; no five-label word (the scorecard calls it TEAM-REPORTED)</td><td>Independent review owed</td></tr><tr><td>litepaper.html</td><td>+125 -112. The rewrite to the 2.0 reference (50f517120) and the chip, dataset and roadmap commits; one sub-row per section below</td><td>Abstract, the proof architecture decisions, the three boundaries, the chip section, the roadmap's five deliverables, the limits</td><td>See the sections</td><td>TEAM-REPORTED 2, MODELLED 6, PROPOSED 2, PENDING 3, EXCLUDED 1, beside the older words</td><td>See the sections</td></tr><tr><td>litepaper.html#abstract</td><td>4 of 11 lines</td><td>Positioning line first; AMD, Apple and NVIDIA roles; revm with documented differences; "(designed)" on the 10 s and proof-at-launch targets</td><td>None found</td><td>designed (3), modelled, measured, claimed</td><td>Older words only, no five-label word</td></tr><tr><td>litepaper.html#firsts</td><td>6 of 32 lines. "State, 8 Oct 2026"; devnet-number and first-devnet history cut</td><td>The verifier-in-consensus line; the sources name the measurement record in the repository (docs/bench-log.md) (site-2.0-audit)</td><td>"External review is owed at gate 3"; "Sources: the engineering log" (the page left the site; the record is <code>docs/bench-log.md</code>)</td><td>Measured, Implemented, Designed, approximate</td><td>The gate numbering predates the 2.0 roadmap</td></tr><tr><td>litepaper.html#problem</td><td>Unchanged</td><td>Nothing</td><td>None found</td><td>designed, approximate</td><td>None</td></tr><tr><td>litepaper.html#glance</td><td>20 of 50 lines. Dates, the devnet number and the miner and wallet versions cut; "Live on the devnet"</td><td>Proving rows name NVIDIA; "Designed: rollups and bridges buy proofs"; the verifier caveat</td><td>"5 Oct 2026, first shipped" on the wallet row</td><td>Designed, owed; the other rows carry no label</td><td>Label the at-a-glance rows</td></tr><tr><td>litepaper.html#mining</td><td>17 of 45 lines</td><td>The chip section: "Mining: commodity GPUs, scored against a chip", the scoring rule's result, the per-machine figures, the coexistence model, the dataset policy; the M32 citation points at ledger D3; the RTX 5090 citation names docs/bench-log.md (site-2.0-audit)</td><td>"engineering log, the RTX 5090 entries"; "ledger M32"; "analysis of 6 October 2026, section 5.4"</td><td>MODELLED (3), PROPOSED (1); measured, modelled, claimed, proposed</td><td>The 4 GiB dataset step PROPOSED pending the founder's word</td></tr><tr><td>litepaper.html#randomx</td><td>3 of 30 lines. "fixed at the testnet genesis" becomes "fixed at genesis"</td><td>The useful-work row to the coexist rows; the dataset row reads the dataset policy (PROPOSED, 8 October 2026); the cache line and the 96 MB sentence drop the calendar; carried to /randomx (site-2.0-audit)</td><td>The dataset row still reads "2 GB, growing ... doubling at years 4, 12 and 28" beside the 5.5 GiB and 4 GiB proposal; "Every number above is measured and logged"</td><td>measured, proposed, approximate</td><td>None</td></tr><tr><td>litepaper.html#proving</td><td>25 of 29 lines</td><td>The proof architecture table (four decisions with their state), the three boundaries, NVIDIA proves and AMD and Apple mine, the coexist memory line, the job market Designed</td><td>None: the 5 and 6 October 2026 rows are measurements</td><td>Implemented, Designed, measured, owed</td><td>The decision table uses the older words</td></tr><tr><td>litepaper.html#finality</td><td>1 of 10 lines</td><td>Nothing</td><td>None: the 4 and 5 October 2026 test-network rows are measurements</td><td>Implemented, measured, approximate</td><td>None</td></tr><tr><td>litepaper.html#building</td><td>3 of 15 lines</td><td>Positioning line; contracts deploy with the same tools, the differences documented; the E20 citation dropped (no 2.0 entry answers it) (site-2.0-audit)</td><td>"ledger E20"; "the economy analysis of 6 October 2026"</td><td>measured, approximate</td><td>None</td></tr><tr><td>litepaper.html#economics</td><td>2 of 89 lines</td><td>The sources name docs/bench-log.md for the earlier devnet's receipts (site-2.0-audit)</td><td>"the engineering log for the devnet receipts and the dev-fee count"; "an earlier devnet"</td><td>measured, modelled, designed, owed, Implemented</td><td>None</td></tr><tr><td>litepaper.html#miners</td><td>11 of 32 lines. Testnet terms become Devnet terms; resets without notice; "Pools live before launch"</td><td>The job market "(Designed, not built)"; proving switch on NVIDIA cards; the dataset sentence reads the dataset policy; the E19 citation points at ledger A7 (site-2.0-audit)</td><td>"The dataset starts at 2 GB and grows ... doubling at years 4, 12 and 28"</td><td>measured, proposed, approximate, Designed</td><td>None</td></tr><tr><td>litepaper.html#ember</td><td>2 of 63 lines. "In 0.3.6" cut; "live devnet" becomes "mining live"</td><td>Three citations name the measurement record in the repository (docs/bench-log.md) (site-2.0-audit)</td><td>Three "engineering log" citations; "It has run the devnet's cards since 4 October 2026"</td><td>measured, "Measured:" lines</td><td>Date the 4 October line as the earlier devnet</td></tr><tr><td>litepaper.html#wallet</td><td>1 of 25 lines. Versions 0.1.1 and 0.1.5 cut</td><td>Nothing</td><td>"first shipped 5 October 2026"</td><td>No label</td><td>None</td></tr><tr><td>litepaper.html#governance</td><td>3 of 7 lines. "Today, as built" on pools</td><td>Both readings (4 and 6 October 2026) name the earlier devnet (site-2.0-audit)</td><td>"on the devnet the top three vote keys held 34.5% of 8,090 blocks on 4 October 2026" and the restart of 6 October 2026, both the earlier devnet's</td><td>measured, Designed, open item O-5.4</td><td>None</td></tr><tr><td>litepaper.html#roadmap</td><td>40 of 61 lines</td><td>Phase 5 is the no-rescue network exercise (was the public testnet); the five deliverables D1 to D5 with owner, pass condition, Today label and evidence file (558882efb); the 0.3.6 release table cut</td><td>None found</td><td>TEAM-REPORTED 2, MODELLED 3, PROPOSED 1, PENDING 3, EXCLUDED 1</td><td>D1's reference-population sentences land at 21:00</td></tr><tr><td>litepaper.html#miners-ask</td><td>4 of 34 lines</td><td>The Kaspa answer: Igneum does not claim a chip cannot be built; the F7 and M12 citations dropped (no 2.0 entry answers them); the engineering log citations name the measurement record in the repository (docs/bench-log.md) (site-2.0-audit)</td><td>Three "engineering log" citations; "reviewers will be named and paid before gate 3"; the rented-fleet rows of 6 October 2026 with the bench entry "not yet written"</td><td>measured, owed, approximate</td><td>Gate numbering; the owed bench entry</td></tr><tr><td>litepaper.html#builders-ask</td><td>1 of 11 lines. USDC "during the public testnet" becomes "before launch"</td><td>Nothing</td><td>None found</td><td>No label</td><td>None</td></tr><tr><td>litepaper.html#shoulders</td><td>Unchanged</td><td>Nothing</td><td>None: "decided on 3 October 2026" is a decision date</td><td>approximate</td><td>None</td></tr><tr><td>litepaper.html#limits</td><td>6 of 20 lines</td><td>The chip item ("Igneum assumes a chip exists"), the debug item, four new items: proof verification in consensus, proving on every card, what proofs do not give, a ranking; the M32 citation points at ledger D3 (site-2.0-audit)</td><td>"ledger M32"; "external reviewers are named and paid before gate 3"; "100 to 200 consumer GPUs"</td><td>measured, modelled, designed, claimed, owed, Open</td><td>Gate numbering; carried to /claims</td></tr><tr><td>live.html</td><td>+14 -16. Lock label "Finalised (reported)" and "Not yet finalised"</td><td>The four words and definitions (5c8fdfa29, b45bf6d45); "finality not yet active" until the weight window fills at DAA 7,200, with the live DAA (ace497b55, fcda08aed); the Locked checkpoint tile reads two thirds of active and of total 30-day weight (site-2.0-audit)</td><td>None found</td><td>The four words; no evidence label: live reads</td><td>None</td></tr><tr><td>metamask.html</td><td>+28 -47. The testnet card and button gone; one entry, Igneum 2.0 devnet, 4465 (0x1171), the explorer URL; the chain-id history sentences gone</td><td>The add-network card (bf34d4927)</td><td>None found</td><td>No label: configuration</td><td>None</td></tr><tr><td>miner.html</td><td>+39 -41. Windows 0.3.26, macOS 2.0.0, HiveOS 0.3.26, wallet 0.1.6; the testnet notice replaced by the fee line; "the engineering log" becomes <code>docs/bench-log.md</code>; the pools answer</td><td>Card line 01 and the card FAQ: NVIDIA proves, AMD and Apple mine, the 6.1 GiB miner and 7.5 GiB shard peak, 16 GB at the proposed 5.5 GiB, the 4 GiB step pending; the Mac first-open notice; the chip lines (389baf565, 9d18ce980, 6a81aa709); the dataset sentence reads the dataset policy; the 4 October fee row and the figure's measured rates labelled TEAM-REPORTED (site-2.0-audit)</td><td>"read 8 October 2026, 17:2x UK"; "The dataset starts at 2 GB and grows ... doubling at years 4, 12 and 28"; "Any 4 GB card mines at launch"</td><td>MODELLED (1); measured, proposed, pending decision</td><td>The hero screenshot (<code>/img/miner-dashboard.webp</code>) is an older build; "17:2x"; the 4 GiB step PROPOSED pending the founder's word</td></tr><tr><td>miners.html</td><td>+24 -34. Generated from <code>site/miner-bench.json</code>: the earlier-classes table, the rates note and the miner-version column gone</td><td>The note names the measurement record in the repository (docs/bench-log.md) (site-2.0-audit)</td><td>Rows are class v4 while the 2.0 devnet runs class v5; "Every row names the engineering log entry" and "our own log"</td><td>measured, measured by the team, measured or reported by the fleet, not measured; no five-label word</td><td>Class v5 rows</td></tr><tr><td>oracle.html</td><td>+36 -35. "Devnet 3" becomes "the devnet" and "the Igneum 2.0 devnet (igneum-devnet-4)"; the testnet chain entry gone</td><td>The trust anchors and unchecked signatures named, the deployer-installed anchor disclosed, the proof boundary, data availability, the three boundaries, the positioning line (5e5ba9b8a)</td><td>The deployed contract "accepts statements with chain id 4463 or 4464"; proven roots from certificate 2232 and chain block 28439, the earlier devnet's; "reads a the devnet balance"</td><td>measured (Sepolia gas, 8 October 2026); the trust list</td><td>Chain ids 4463 and 4464 stand until the contract is redeployed; the certificate rows; the typo; the oracle og card PNG still prints the devnet number</td></tr><tr><td>provenance.html</td><td>+13 -16. Generated from <code>docs/provenance.md</code>. "bench-log" citations become <code>docs/bench-log.md</code> in two cells; the chain id line names 4465 with 4463 and 4464 on earlier devnets</td><td>The SP1 sentence reads shards proven and paid on the Igneum 2.0 devnet from block zero, verifier on in consensus (TEAM-REPORTED); M4 points at ledger C1, P1 and P3 at ledger D5; the dataset row reads the dataset policy (site-2.0-audit)</td><td>"No SP1 shard has been proven on any card in this repository (FUD ledger P1, P3). Phase 2 gate"; "FUD ledger M4"; bench-log entry names; "the gate 2 simpa run"</td><td>measured, verified (licences), approximate</td><td>None</td></tr><tr><td>proving.html</td><td>+21 -24. Title "Igneum 2.0 devnet proving"; "Proving on the devnet"; the DAA target line</td><td>The four words with definitions and the section 9 link, as on /explorer (site-2.0-audit)</td><td>None found</td><td>Shard states planned, proving, verified, paid; "Measured on the shards paid in the window"</td><td>None</td></tr><tr><td>randomx.html</td><td>+14 -17. Generated from the litepaper's randomx section (50f517120)</td><td>Same as litepaper#randomx; rebuilt from litepaper#randomx: the dataset row reads the dataset policy (site-2.0-audit)</td><td>Same as litepaper#randomx: the 2 GB dataset row</td><td>measured, proposed, approximate</td><td>None</td></tr><tr><td>receipt.html</td><td>+27 -46. "Devnet 3" becomes "the devnet"; the testnet chain entry gone</td><td>The two receipt kinds (transaction-inclusion and payment), the proof boundary, data availability, the three boundaries, the positioning line (5e5ba9b8a); both sentences start in capitals; the unlabelled 30 to 90 s finality figure dropped (site-2.0-audit)</td><td>Two sentences start in lower case, "the devnet, no value"</td><td>The receipt kind on every result; no five-label word. No label: "about 30 to 90 s after it executes"</td><td>None</td></tr><tr><td>scenes.html</td><td>+11 -14. Chrome only; the body is unchanged</td><td>The legend reads finalised checkpoint and the Forge note finalised; the four words paragraph added (site-2.0-audit)</td><td>The legend reads pending, included, excluded, proven, locked checkpoint, and "everything under it is final"</td><td>No label</td><td>None</td></tr><tr><td>scorecard.html</td><td>+314, new (9bdee3727); in the sitemap (1281d01fb)</td><td>The whole page: twelve gates from the plan's section 23, evidence required, do not substitute, the Today label; the release evidence packet; the wording ladder</td><td>None</td><td>TEAM-REPORTED 4, MODELLED 3, PROPOSED 2, PENDING 5, EXCLUDED 3</td><td>The reference-population sentences land at 21:00; the Sustained proving cell needs economics to serve the 24-hour reading as history; no square og PNG</td></tr><tr><td>swap.html</td><td>+37 -40. "Devnet 3" becomes "the devnet"; chain igneum-devnet-4; the addresses pointer becomes "docs/contracts"; the wallet version requirement gone</td><td>The intro: "on Igneum, with proven execution"</td><td>None found</td><td>No label: "Every swap is a devnet block"</td><td><code>docs/contracts/</code> holds devnet-3.json and sepolia.json, no igneum-devnet-4 file; the swap og card PNG still prints "Devnet 3"</td></tr><tr><td>tx.html</td><td>+24 -26. Title and crumb; network "The devnet"; chips and lock state "finalised" and "not yet finalised"</td><td>The four words and definitions (5c8fdfa29, b45bf6d45); the source line names one node on the build box; the fee sentence reads 80 percent to the miner and 20 percent to the developer registrations, none to the provers, as on economics (site-2.0-audit)</td><td>"Read from node1-dn3 on the build box since 12:25 UTC on 8 October 2026"; "The priority fee splits 80/20 between the including miner and the proving pool", which economics no longer states</td><td>No label</td><td>The explorer og card PNG still prints "Devnet 3"</td></tr><tr><td>wallet.html</td><td>+15 -19. "0.1.5" becomes "the current build"; download v0.1.6; the testnet notice gone</td><td>Nothing</td><td>Screenshots from mock state of 7 October 2026</td><td>One "Measured" heading; otherwise no label</td><td>None beyond the label</td></tr></tbody></table></div>
+<div class="tbl"><table><thead><tr><th>Page</th><th>What the sweep changed</th><th>What was rewritten</th><th>What still carries pre-2.0 copy</th><th>The evidence label of each claim</th><th>Open items</th></tr></thead><tbody><tr><td>404.html</td><td>+12 -16. Chrome; the description and the link list drop the engineering log</td><td>Nothing</td><td>None found</td><td>No claims</td><td>Shares the home card, whose PNG still prints the pre-reset line "No premine. No stake. No fee to any team."</td></tr><tr><td>address.html</td><td>+24 -27. Title and crumb "The devnet explorer"; network row "The devnet"; amounts at 18 decimals (67c404efa)</td><td>The four words with definitions and the section 9 link, as on /explorer (site-2.0-audit)</td><td>None found</td><td>No label: balance, nonce, earned 24 h are live reads</td><td>The explorer og card PNG still prints "Devnet 3"</td></tr><tr><td>app.html</td><td>+41 -45. Screenshot captions "0.3.22" become "The current build"; "The log." points at <code>docs/bench-log.md</code>; Windows v0.3.26, macOS v2.0.0; the testnet notice gone</td><td>The card and proving-memory lines: NVIDIA proves, AMD and Apple mine; 16 GB to mine and prove at the proposed 5.5 GiB dataset; the 4 GiB step pending decision (389baf565, d8c976e19, 9d18ce980); TEAM-REPORTED beside the measured rows and PENDING on the Arc expectation (site-2.0-audit)</td><td>Screenshots from recorded states of 7 October 2026; the Ember run 6 pounds line; the Windows build numbered 0.3.26</td><td>measured (8), proposed, pending decision; no five-label word. No label: the Arc 15.2 MH/s expectation, the pounds a day</td><td>The 4 GiB dataset step is PROPOSED pending the founder's word; screenshots are an older build</td></tr><tr><td>audit.html</td><td>New with this commit: rendered from <code>docs/site/audit-2.0.md</code></td><td>The whole page</td><td>None</td><td>Each cell is read from the repository and the git log</td><td>Re-read at every site commit; it is a snapshot of c7cfef9d0</td></tr><tr><td>docs.html</td><td>New with this commit: in the Learn panel after /audit, the sitemap, the capture routes and <code>site/og/pages.mjs</code> (card <code>docs</code>, no PNG yet)</td><td>The whole page: every 2.0 document by its master path on the public git host (the plan, the standard and its registry, the pins, the reference, the specifications, the finality guarantees, the evidence files the facts page cites, the tuning record, this audit, the ledger) (site-2.0-audit)</td><td>None</td><td>No claims; the descriptions carry the files' own labels</td><td><code>docs/analysis/class-v6/eco-05-results.md</code> is not on master yet, so its link answers 404 until it lands; the docs card PNG is not rendered</td></tr><tr><td>block.html</td><td>+24 -26. Title and crumb; network row "The devnet"; chips "finalised under lock" and "not yet finalised"; coinbase and subsidy at 18 decimals (6a81aa709, 67c404efa)</td><td>The four words with their definitions and the finality specification's section 9 link (5c8fdfa29, b45bf6d45); the source line names one node on the build box, not node1-dn3; the checkpoint note reads two thirds of active and of total 30-day weight (site-2.0-audit)</td><td>None found</td><td>The four words are states; no evidence label: every field is a live read</td><td>The explorer og card PNG still prints "Devnet 3"</td></tr><tr><td>build.html</td><td>+20 -22. Rendered from <code>docs/build/build.md</code>. The chain table holds the 2.0 devnet only (4465, igneum-devnet-4, 18 decimals); testnet column and devnet-number rows gone; mainnet 4461 reserved; Hardhat line 4465</td><td>The chain table and the paragraph under it (bf34d4927); the proof-share claim labelled TEAM-REPORTED, 8 October 2026, and the launch target labelled designed (in <code>docs/build/build.md</code>) (site-2.0-audit)</td><td>"web3_clientVersion answers igneumd/2.1.0/execution-layer-v3" is unchanged from site-pre-2.0; "Tested end to end on the devnet on a build box" was run before the 2.0 devnet</td><td>No label: the client string, the five-minute walkthrough, "a share of blocks carries a proof today", the under-a-minute target</td><td>Re-run the walkthrough and the client-version probe on igneum-devnet-4, or date them</td></tr><tr><td>claims.html</td><td>+17 -16. Generated from the litepaper's limits section, rebuilt from it in 50f517120</td><td>Same as litepaper#limits: the chip item, the debug item, four new items; rebuilt from litepaper#limits: the M32 citation now points at ledger D3 (site-2.0-audit)</td><td>Same as litepaper#limits: "ledger M32", "before gate 3", "100 to 200 consumer GPUs"</td><td>measured, modelled, designed, claimed, Open; no five-label word</td><td>Fixed by editing litepaper#limits and rebuilding; nothing is edited here</td></tr><tr><td>compatibility.html</td><td>+362, new (6b8f02eab). Rendered from <code>docs/build/compatibility.md</code>; rows from <code>tools/reference-apps/compat/results.json</code></td><td>The whole page: 20 of 20 rows on igneum-devnet-4 (0378ee0ef, 4c852c645); TEAM-REPORTED beside the run summary, in <code>docs/build/compatibility.md</code> and its generator <code>tools/reference-apps/compat/render.mjs</code> (site-2.0-audit)</td><td>None</td><td>Per-row verdicts passed, failed, untested, each with its evidence; no five-label word</td><td>/compatibility has no row in <code>site/og/pages.mjs</code> and shares the home card</td></tr><tr><td>dev-fee.html</td><td>+13 -16. Generated from the miner page's fee section. "a test network" becomes "a private test network"; "The log." points at <code>docs/bench-log.md</code>; the engineering log link becomes "Every claim and its status"</td><td>The 4 October 2026 row labelled TEAM-REPORTED on the miner page and regenerated (site-2.0-audit)</td><td>None: the 4 October 2026 row is a measurement</td><td>measured</td><td>None</td></tr><tr><td>download.html</td><td>+22 -25. Windows and HiveOS v0.3.26, macOS v2.0.0, wallet v0.1.6, new sha256 lines, Hive URL 0.3.26; the testnet notice gone</td><td>The macOS first-open notice (6a81aa709, 5c8fdfa29)</td><td>"Any 4 GB card mines at launch. A 24 GB NVIDIA card proves the full shard as well." (the miner page has the 2.0 line); Windows and HiveOS still numbered 0.3.x</td><td>No label: the card line</td><td>Card line to the miner page's 2.0 wording; drop the Mac notice the day the signed build ships</td></tr><tr><td>economics.html</td><td>+34 -37. TESTNET_1 column gone; "Devnet 3" becomes "the devnet"; the decimals row 18 one to one; manifest read node 4cdcc488</td><td>The proving section and fee rows: base fee on execution gas; the proving payment 90 percent to the pool and 10 percent burned, designed behind its constant; no part of the tip to provers; launch rate at 18 decimals; the first block's 3.168808781 IGN at 80/20 and the ramp read-back (cc3520cc4, c4adb2367, 389baf565)</td><td>"Source: the node fork at commit e0644958 (the devnet cut of 8 October 2026)", which site-pre-2.0 named the Devnet 3 cut; "On the devnet in the 24 hours to 12:16 UK on 8 October 2026: 8,209 shards paid", read before the 2.0 devnet's first block at 17:14 UK; "read 8 October 2026, 17:2x UK"</td><td>TEAM-REPORTED (1); modelled, designed, measured, "in the code"</td><td>Serve the 24-hour reading as the earlier devnet's (the scorecard already calls it history); re-read the line numbers at 4cdcc488 or say which commit; replace "17:2x" with the minute</td></tr><tr><td>evidence.html</td><td>+35 -61. Restarted (cf4542105, df465d478)</td><td>The facts page from <code>docs/evidence.md</code>: seven 2.0 rows, the six status words, the release evidence packet on every row (1281d01fb), the five served labels and the wording ladder</td><td>Row 5's result "the home page and the litepaper carry it as their 2.0 text lands" is stale: both carry it now</td><td>Status words designed, activated, tested by the team (implemented, reproduced externally, reviewed independently at 0); TEAM-REPORTED rows 1 to 4 and 7, MODELLED row 6, PROPOSED row 5</td><td>Row 5's result text; row 7's 4 GiB step PROPOSED pending the founder's word; the reference-population sentences land at 21:00</td></tr><tr><td>explorer.html</td><td>+32 -34. Title "Igneum 2.0 devnet explorer"; headings "The devnet explorer"; chain id line 4465</td><td>The four words and definitions (5c8fdfa29, b45bf6d45); finality "not yet active" until the weight window fills at DAA 7,200, with the live DAA (ace497b55, fcda08aed); the node1-dn3 source paragraph removed (it described only the earlier devnet's observer incident) (site-2.0-audit)</td><td>"Source since 12:25 UTC on 8 October 2026: node1-dn3 ... drifted from the chain at DAA 67,787", the earlier devnet's observer history</td><td>The four words; no evidence label: live reads</td><td>The explorer og card PNG still prints "Devnet 3"</td></tr><tr><td>faucet.html</td><td>+24 -28. "Devnet 3" becomes "the devnet"; chain id 4465; the testnet faucet row gone</td><td>Nothing</td><td>None found</td><td>No label: 10 IGN a day, once per address and per connection</td><td>The faucet og card PNG was not re-rendered after its kicker changed and still prints "Devnet 3 faucet"</td></tr><tr><td>grants.html</td><td>+16 -19. Rendered from <code>docs/build/grants.md</code>. "public testnet" becomes "the Igneum 2.0 devnet" and "the devnet"</td><td>Nothing</td><td>None found</td><td>No label: "the fund is zero today"</td><td>None beyond the chrome</td></tr><tr><td>income.html</td><td>+15 -58. The testnet-era tier tables, the TESTNET_1 schedule and the Owed list gone; "devnet and testnet IGN" becomes "devnet IGN"</td><td>Nothing: the calculator kept; the card rows labelled TEAM-REPORTED (class v4, 6 to 8 October 2026, no outside reproduction) (site-2.0-audit)</td><td>The card rows are the bench table's class v4 rows of 6 to 8 October 2026</td><td>Rows marked measured by the team (7), measured by the fleet (28), reported by the fleet (3); no five-label word</td><td>None</td></tr><tr><td>index.html</td><td>+38 -24. The positioning line as the sub-line; "The Igneum 2.0 devnet is the network today"; the engineering log link gone</td><td>The mission table (four deliverables, why each matters, evidence today with its label and file), the three boundaries in one line, the status line in the ladder's words, the miner row as paid work (c7cfef9d0); the chip line (36a83c39b, cff4be488, 98b1f664e); the Locked checkpoint tile reads two thirds of active and of total 30-day weight (site-2.0-audit)</td><td>The Windows button numbered v0.3.26</td><td>TEAM-REPORTED, MODELLED, PENDING. No label: "One click installs the node, the miner and the prover"; the fair-start row</td><td>The home og card PNG still prints the pre-reset line</td></tr><tr><td>ledger.html</td><td>+203 -1201. Rewritten</td><td>Generated from <code>docs/fud-ledger-2.0.md</code>: 26 entries R0 to C3, each with its pin; 12 Open, 5 Conceded, 1 Fixed or built, 8 Closed by rule or decided (cf4542105); D5 restated (bf34d4927); the pre-2.0 ids on other pages pointed at 2.0 entries or dropped: M32 to D3, E19 to A7, M4 to C1, P1 and P3 to D5; E20, F7 and M12 dropped (site-2.0-audit)</td><td>None: the pre-2.0 ledger stays as history in <code>docs/fud-ledger.md</code></td><td>Status words Open, Conceded, Fixed or built, Closed by rule or decided</td><td>None</td></tr><tr><td>light.html</td><td>+32 -32. "Devnet 3" becomes "the devnet"; the vote domain reads {network id}; the testnet chain entry gone</td><td>What the page authenticates and what it does not, the proof boundary, the data-availability paragraph, the three boundaries, the positioning line (5e5ba9b8a); padding (99461391f, b9d4aa80f); TEAM-REPORTED named on the page, 8 October 2026 (site-2.0-audit)</td><td>None found</td><td>"Authenticated here" and "Not authenticated here"; no five-label word (the scorecard calls it TEAM-REPORTED)</td><td>Independent review owed</td></tr><tr><td>litepaper.html</td><td>+125 -112. The rewrite to the 2.0 reference (50f517120) and the chip, dataset and roadmap commits; one sub-row per section below</td><td>Abstract, the proof architecture decisions, the three boundaries, the chip section, the roadmap's five deliverables, the limits</td><td>See the sections</td><td>TEAM-REPORTED 2, MODELLED 6, PROPOSED 2, PENDING 3, EXCLUDED 1, beside the older words</td><td>See the sections</td></tr><tr><td>litepaper.html#abstract</td><td>4 of 11 lines</td><td>Positioning line first; AMD, Apple and NVIDIA roles; revm with documented differences; "(designed)" on the 10 s and proof-at-launch targets</td><td>None found</td><td>designed (3), modelled, measured, claimed</td><td>Older words only, no five-label word</td></tr><tr><td>litepaper.html#firsts</td><td>6 of 32 lines. "State, 8 Oct 2026"; devnet-number and first-devnet history cut</td><td>The verifier-in-consensus line; the sources name the measurement record in the repository (docs/bench-log.md) (site-2.0-audit)</td><td>"External review is owed at gate 3"; "Sources: the engineering log" (the page left the site; the record is <code>docs/bench-log.md</code>)</td><td>Measured, Implemented, Designed, approximate</td><td>The gate numbering predates the 2.0 roadmap</td></tr><tr><td>litepaper.html#problem</td><td>Unchanged</td><td>Nothing</td><td>None found</td><td>designed, approximate</td><td>None</td></tr><tr><td>litepaper.html#glance</td><td>20 of 50 lines. Dates, the devnet number and the miner and wallet versions cut; "Live on the devnet"</td><td>Proving rows name NVIDIA; "Designed: rollups and bridges buy proofs"; the verifier caveat</td><td>"5 Oct 2026, first shipped" on the wallet row</td><td>Designed, owed; the other rows carry no label</td><td>Label the at-a-glance rows</td></tr><tr><td>litepaper.html#mining</td><td>17 of 45 lines</td><td>The chip section: "Mining: commodity GPUs, scored against a chip", the scoring rule's result, the per-machine figures, the coexistence model, the dataset policy; the M32 citation points at ledger D3; the RTX 5090 citation names docs/bench-log.md (site-2.0-audit)</td><td>"engineering log, the RTX 5090 entries"; "ledger M32"; "analysis of 6 October 2026, section 5.4"</td><td>MODELLED (3), PROPOSED (1); measured, modelled, claimed, proposed</td><td>The 4 GiB dataset step PROPOSED pending the founder's word</td></tr><tr><td>litepaper.html#randomx</td><td>3 of 30 lines. "fixed at the testnet genesis" becomes "fixed at genesis"</td><td>The useful-work row to the coexist rows; the dataset row reads the dataset policy (PROPOSED, 8 October 2026); the cache line and the 96 MB sentence drop the calendar; carried to /randomx (site-2.0-audit)</td><td>The dataset row still reads "2 GB, growing ... doubling at years 4, 12 and 28" beside the 5.5 GiB and 4 GiB proposal; "Every number above is measured and logged"</td><td>measured, proposed, approximate</td><td>None</td></tr><tr><td>litepaper.html#proving</td><td>25 of 29 lines</td><td>The proof architecture table (four decisions with their state), the three boundaries, NVIDIA proves and AMD and Apple mine, the coexist memory line, the job market Designed</td><td>None: the 5 and 6 October 2026 rows are measurements</td><td>Implemented, Designed, measured, owed</td><td>The decision table uses the older words</td></tr><tr><td>litepaper.html#finality</td><td>1 of 10 lines</td><td>Nothing</td><td>None: the 4 and 5 October 2026 test-network rows are measurements</td><td>Implemented, measured, approximate</td><td>None</td></tr><tr><td>litepaper.html#building</td><td>3 of 15 lines</td><td>Positioning line; contracts deploy with the same tools, the differences documented; the E20 citation dropped (no 2.0 entry answers it) (site-2.0-audit)</td><td>"ledger E20"; "the economy analysis of 6 October 2026"</td><td>measured, approximate</td><td>None</td></tr><tr><td>litepaper.html#economics</td><td>2 of 89 lines</td><td>The sources name docs/bench-log.md for the earlier devnet's receipts (site-2.0-audit)</td><td>"the engineering log for the devnet receipts and the dev-fee count"; "an earlier devnet"</td><td>measured, modelled, designed, owed, Implemented</td><td>None</td></tr><tr><td>litepaper.html#miners</td><td>11 of 32 lines. Testnet terms become Devnet terms; resets without notice; "Pools live before launch"</td><td>The job market "(Designed, not built)"; proving switch on NVIDIA cards; the dataset sentence reads the dataset policy; the E19 citation points at ledger A7 (site-2.0-audit)</td><td>"The dataset starts at 2 GB and grows ... doubling at years 4, 12 and 28"</td><td>measured, proposed, approximate, Designed</td><td>None</td></tr><tr><td>litepaper.html#ember</td><td>2 of 63 lines. "In 0.3.6" cut; "live devnet" becomes "mining live"</td><td>Three citations name the measurement record in the repository (docs/bench-log.md) (site-2.0-audit)</td><td>Three "engineering log" citations; "It has run the devnet's cards since 4 October 2026"</td><td>measured, "Measured:" lines</td><td>Date the 4 October line as the earlier devnet</td></tr><tr><td>litepaper.html#wallet</td><td>1 of 25 lines. Versions 0.1.1 and 0.1.5 cut</td><td>Nothing</td><td>"first shipped 5 October 2026"</td><td>No label</td><td>None</td></tr><tr><td>litepaper.html#governance</td><td>3 of 7 lines. "Today, as built" on pools</td><td>Both readings (4 and 6 October 2026) name the earlier devnet (site-2.0-audit)</td><td>"on the devnet the top three vote keys held 34.5% of 8,090 blocks on 4 October 2026" and the restart of 6 October 2026, both the earlier devnet's</td><td>measured, Designed, open item O-5.4</td><td>None</td></tr><tr><td>litepaper.html#roadmap</td><td>40 of 61 lines</td><td>Phase 5 is the no-rescue network exercise (was the public testnet); the five deliverables D1 to D5 with owner, pass condition, Today label and evidence file (558882efb); the 0.3.6 release table cut</td><td>None found</td><td>TEAM-REPORTED 2, MODELLED 3, PROPOSED 1, PENDING 3, EXCLUDED 1</td><td>D1's reference-population sentences land at 21:00</td></tr><tr><td>litepaper.html#miners-ask</td><td>4 of 34 lines</td><td>The Kaspa answer: Igneum does not claim a chip cannot be built; the F7 and M12 citations dropped (no 2.0 entry answers them); the engineering log citations name the measurement record in the repository (docs/bench-log.md) (site-2.0-audit)</td><td>Three "engineering log" citations; "reviewers will be named and paid before gate 3"; the rented-fleet rows of 6 October 2026 with the bench entry "not yet written"</td><td>measured, owed, approximate</td><td>Gate numbering; the owed bench entry</td></tr><tr><td>litepaper.html#builders-ask</td><td>1 of 11 lines. USDC "during the public testnet" becomes "before launch"</td><td>Nothing</td><td>None found</td><td>No label</td><td>None</td></tr><tr><td>litepaper.html#shoulders</td><td>Unchanged</td><td>Nothing</td><td>None: "decided on 3 October 2026" is a decision date</td><td>approximate</td><td>None</td></tr><tr><td>litepaper.html#limits</td><td>6 of 20 lines</td><td>The chip item ("Igneum assumes a chip exists"), the debug item, four new items: proof verification in consensus, proving on every card, what proofs do not give, a ranking; the M32 citation points at ledger D3 (site-2.0-audit)</td><td>"ledger M32"; "external reviewers are named and paid before gate 3"; "100 to 200 consumer GPUs"</td><td>measured, modelled, designed, claimed, owed, Open</td><td>Gate numbering; carried to /claims</td></tr><tr><td>live.html</td><td>+14 -16. Lock label "Finalised (reported)" and "Not yet finalised"</td><td>The four words and definitions (5c8fdfa29, b45bf6d45); "finality not yet active" until the weight window fills at DAA 7,200, with the live DAA (ace497b55, fcda08aed); the Locked checkpoint tile reads two thirds of active and of total 30-day weight (site-2.0-audit)</td><td>None found</td><td>The four words; no evidence label: live reads</td><td>None</td></tr><tr><td>metamask.html</td><td>+28 -47. The testnet card and button gone; one entry, Igneum 2.0 devnet, 4465 (0x1171), the explorer URL; the chain-id history sentences gone</td><td>The add-network card (bf34d4927)</td><td>None found</td><td>No label: configuration</td><td>None</td></tr><tr><td>miner.html</td><td>+39 -41. Windows 0.3.26, macOS 2.0.0, HiveOS 0.3.26, wallet 0.1.6; the testnet notice replaced by the fee line; "the engineering log" becomes <code>docs/bench-log.md</code>; the pools answer</td><td>Card line 01 and the card FAQ: NVIDIA proves, AMD and Apple mine, the 6.1 GiB miner and 7.5 GiB shard peak, 16 GB at the proposed 5.5 GiB, the 4 GiB step pending; the Mac first-open notice; the chip lines (389baf565, 9d18ce980, 6a81aa709); the dataset sentence reads the dataset policy; the 4 October fee row and the figure's measured rates labelled TEAM-REPORTED (site-2.0-audit)</td><td>"read 8 October 2026, 17:2x UK"; "The dataset starts at 2 GB and grows ... doubling at years 4, 12 and 28"; "Any 4 GB card mines at launch"</td><td>MODELLED (1); measured, proposed, pending decision</td><td>The hero screenshot (<code>/img/miner-dashboard.webp</code>) is an older build; "17:2x"; the 4 GiB step PROPOSED pending the founder's word</td></tr><tr><td>miners.html</td><td>+24 -34. Generated from <code>site/miner-bench.json</code>: the earlier-classes table, the rates note and the miner-version column gone</td><td>The note names the measurement record in the repository (docs/bench-log.md) (site-2.0-audit)</td><td>Rows are class v4 while the 2.0 devnet runs class v5; "Every row names the engineering log entry" and "our own log"</td><td>measured, measured by the team, measured or reported by the fleet, not measured; no five-label word</td><td>Class v5 rows</td></tr><tr><td>oracle.html</td><td>+36 -35. "Devnet 3" becomes "the devnet" and "the Igneum 2.0 devnet (igneum-devnet-4)"; the testnet chain entry gone</td><td>The trust anchors and unchecked signatures named, the deployer-installed anchor disclosed, the proof boundary, data availability, the three boundaries, the positioning line (5e5ba9b8a)</td><td>The deployed contract "accepts statements with chain id 4463 or 4464"; proven roots from certificate 2232 and chain block 28439, the earlier devnet's; "reads a the devnet balance"</td><td>measured (Sepolia gas, 8 October 2026); the trust list</td><td>Chain ids 4463 and 4464 stand until the contract is redeployed; the certificate rows; the typo; the oracle og card PNG still prints the devnet number</td></tr><tr><td>provenance.html</td><td>+13 -16. Generated from <code>docs/provenance.md</code>. "bench-log" citations become <code>docs/bench-log.md</code> in two cells; the chain id line names 4465 with 4463 and 4464 on earlier devnets</td><td>The SP1 sentence reads shards proven and paid on the Igneum 2.0 devnet from block zero, verifier on in consensus (TEAM-REPORTED); M4 points at ledger C1, P1 and P3 at ledger D5; the dataset row reads the dataset policy (site-2.0-audit)</td><td>"No SP1 shard has been proven on any card in this repository (FUD ledger P1, P3). Phase 2 gate"; "FUD ledger M4"; bench-log entry names; "the gate 2 simpa run"</td><td>measured, verified (licences), approximate</td><td>None</td></tr><tr><td>proving.html</td><td>+21 -24. Title "Igneum 2.0 devnet proving"; "Proving on the devnet"; the DAA target line</td><td>The four words with definitions and the section 9 link, as on /explorer (site-2.0-audit)</td><td>None found</td><td>Shard states planned, proving, verified, paid; "Measured on the shards paid in the window"</td><td>None</td></tr><tr><td>randomx.html</td><td>+14 -17. Generated from the litepaper's randomx section (50f517120)</td><td>Same as litepaper#randomx; rebuilt from litepaper#randomx: the dataset row reads the dataset policy (site-2.0-audit)</td><td>Same as litepaper#randomx: the 2 GB dataset row</td><td>measured, proposed, approximate</td><td>None</td></tr><tr><td>receipt.html</td><td>+27 -46. "Devnet 3" becomes "the devnet"; the testnet chain entry gone</td><td>The two receipt kinds (transaction-inclusion and payment), the proof boundary, data availability, the three boundaries, the positioning line (5e5ba9b8a); both sentences start in capitals; the unlabelled 30 to 90 s finality figure dropped (site-2.0-audit)</td><td>Two sentences start in lower case, "the devnet, no value"</td><td>The receipt kind on every result; no five-label word. No label: "about 30 to 90 s after it executes"</td><td>None</td></tr><tr><td>scenes.html</td><td>+11 -14. Chrome only; the body is unchanged</td><td>The legend reads finalised checkpoint and the Forge note finalised; the four words paragraph added (site-2.0-audit)</td><td>The legend reads pending, included, excluded, proven, locked checkpoint, and "everything under it is final"</td><td>No label</td><td>None</td></tr><tr><td>prize.html</td><td>New: the disclosure prize terms page, from the scorecard shell; in the nav Learn panel, the sitemap, the share cards and the capture list</td><td>The terms: what it pays for (a placed or measured adversarial implementation that beats the served bracket under the one acceptance rule, or a reproduced shortcut in the served kit), what it does not pay for (confirmations, synthesis-only results, work outside the budget, excluded classes), judged in-house, the finding served either way, reports to hello@igneum.network</td><td>None</td><td>No label: the amount line reads "set by the founder and served here when set"</td><td>The amount</td></tr><tr><td>scorecard.html</td><td>+314, new (9bdee3727); in the sitemap (1281d01fb)</td><td>The whole page: twelve gates from the plan's section 23, evidence required, do not substitute, the Today label; the release evidence packet; the wording ladder</td><td>None</td><td>TEAM-REPORTED 4, MODELLED 3, PROPOSED 2, PENDING 5, EXCLUDED 3</td><td>the Sustained proving cell needs economics to serve the 24-hour reading as history; no square og PNG</td></tr><tr><td>swap.html</td><td>+37 -40. "Devnet 3" becomes "the devnet"; chain igneum-devnet-4; the addresses pointer becomes "docs/contracts"; the wallet version requirement gone</td><td>The intro: "on Igneum, with proven execution"</td><td>None found</td><td>No label: "Every swap is a devnet block"</td><td><code>docs/contracts/</code> holds devnet-3.json and sepolia.json, no igneum-devnet-4 file; the swap og card PNG still prints "Devnet 3"</td></tr><tr><td>tx.html</td><td>+24 -26. Title and crumb; network "The devnet"; chips and lock state "finalised" and "not yet finalised"</td><td>The four words and definitions (5c8fdfa29, b45bf6d45); the source line names one node on the build box; the fee sentence reads 80 percent to the miner and 20 percent to the developer registrations, none to the provers, as on economics (site-2.0-audit)</td><td>"Read from node1-dn3 on the build box since 12:25 UTC on 8 October 2026"; "The priority fee splits 80/20 between the including miner and the proving pool", which economics no longer states</td><td>No label</td><td>The explorer og card PNG still prints "Devnet 3"</td></tr><tr><td>wallet.html</td><td>+15 -19. "0.1.5" becomes "the current build"; download v0.1.6; the testnet notice gone</td><td>Nothing</td><td>Screenshots from mock state of 7 October 2026</td><td>One "Measured" heading; otherwise no label</td><td>None beyond the label</td></tr></tbody></table></div>
 </section>
 <section class="doc-section"><h2 id="open-items-across-pages">Open items across pages</h2>
-<ul><li>The share cards: explorer, swap, faucet and oracle PNGs were not re-rendered after their text changed in <code>site/og/pages.mjs</code> and still print the devnet number (the explorer card serves /explorer, /block, /address, /tx and /proving); the home card still prints the pre-reset line; scorecard has no square card. Rendering runs on a build box, never on the Mac.</li><li>/oracle states the deployed Sepolia contract's chain ids 4463 and 4464 until it is redeployed.</li><li>The miner page's hero screenshot is an older build.</li><li>/prize does not exist yet (due by 12:00 tomorrow); it gets a line here when it lands.</li><li>The reference-population sentences land at 21:00 (scorecard, facts page, litepaper#roadmap).</li><li>The 4 GiB dataset step is PROPOSED pending the founder's word (litepaper#mining, the facts page row 7, miner, app, randomx).</li></ul></section></article>
+<ul><li>The share cards: explorer, swap, faucet and oracle PNGs were not re-rendered after their text changed in <code>site/og/pages.mjs</code> and still print the devnet number (the explorer card serves /explorer, /block, /address, /tx and /proving); the home card still prints the pre-reset line; scorecard has no square card. Rendering runs on a build box, never on the Mac.</li><li>/oracle states the deployed Sepolia contract's chain ids 4463 and 4464 until it is redeployed.</li><li>The miner page's hero screenshot is an older build.</li><li>/prize serves its terms without an amount; the amount line fills when the founder sets it.</li></ul></section></article>
 </div>
 <p class="gen">Generated from docs/site/audit-2.0.md in the repository at build time. Times are UTC.</p>
 </div></section>
diff --git a/site/block.html b/site/block.html
index 246622905..95da508b9 100644
--- a/site/block.html
+++ b/site/block.html
@@ -157,7 +157,7 @@ main{padding-bottom:100px}.card{background:var(--row);border:1px solid var(--lin
         <div class="panel-list">
           <a href="/litepaper" data-nav="litepaper"><b>Litepaper</b><span>The design, as published.</span></a>
           <a href="/income" data-nav="income"><b>Income</b><span>What your card would mine, from the live network.</span></a>
-          <a href="/economics" data-nav="economics"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/acceptance" data-nav="acceptance"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
+          <a href="/economics" data-nav="economics"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/prize" data-nav="prize"><b>Prize</b><span>A better adversary or a reproduced shortcut, never a confirmation: the terms.</span></a><a href="/acceptance" data-nav="acceptance"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
           <a href="/ledger" data-nav="ledger"><b>Ledger</b><span>Every criticism, answered or conceded.</span></a>
           <a href="/claims" data-nav="claims"><b>What Igneum does not claim</b><span>The limits, stated first.</span></a>
           <a href="/randomx" data-nav="randomx"><b>Igneum vs RandomX</b><span>What was kept and what was rebuilt for GPUs.</span></a>
@@ -197,7 +197,7 @@ main{padding-bottom:100px}.card{background:var(--row);border:1px solid var(--lin
       <div class="sheet-group"><div class="sheet-head">Learn</div>
         <a href="/litepaper" data-nav="litepaper"><b>Litepaper</b><span>The design, as published.</span></a>
         <a href="/income" data-nav="income"><b>Income</b><span>What your card would mine, from the live network.</span></a>
-        <a href="/economics" data-nav="economics"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/acceptance" data-nav="acceptance"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
+        <a href="/economics" data-nav="economics"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/prize" data-nav="prize"><b>Prize</b><span>A better adversary or a reproduced shortcut, never a confirmation: the terms.</span></a><a href="/acceptance" data-nav="acceptance"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
         <a href="/ledger" data-nav="ledger"><b>Ledger</b><span>Every criticism, answered or conceded.</span></a>
         <a href="/claims" data-nav="claims"><b>What Igneum does not claim</b><span>The limits, stated first.</span></a>
         <a href="/randomx" data-nav="randomx"><b>Igneum vs RandomX</b><span>What was kept and what was rebuilt for GPUs.</span></a>
diff --git a/site/build.html b/site/build.html
index aebb25029..8c5fcfbcd 100644
--- a/site/build.html
+++ b/site/build.html
@@ -130,7 +130,7 @@ table{min-width:560px}
         <div class="panel-list">
           <a href="/litepaper" data-nav="litepaper"><b>Litepaper</b><span>The design, as published.</span></a>
           <a href="/income" data-nav="income"><b>Income</b><span>What your card would mine, from the live network.</span></a>
-          <a href="/economics" data-nav="economics"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/acceptance" data-nav="acceptance"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
+          <a href="/economics" data-nav="economics"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/prize" data-nav="prize"><b>Prize</b><span>A better adversary or a reproduced shortcut, never a confirmation: the terms.</span></a><a href="/acceptance" data-nav="acceptance"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
           <a href="/ledger" data-nav="ledger"><b>Ledger</b><span>Every criticism, answered or conceded.</span></a>
           <a href="/claims" data-nav="claims"><b>What Igneum does not claim</b><span>The limits, stated first.</span></a>
           <a href="/randomx" data-nav="randomx"><b>Igneum vs RandomX</b><span>What was kept and what was rebuilt for GPUs.</span></a>
@@ -170,7 +170,7 @@ table{min-width:560px}
       <div class="sheet-group"><div class="sheet-head">Learn</div>
         <a href="/litepaper" data-nav="litepaper"><b>Litepaper</b><span>The design, as published.</span></a>
         <a href="/income" data-nav="income"><b>Income</b><span>What your card would mine, from the live network.</span></a>
-        <a href="/economics" data-nav="economics"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/acceptance" data-nav="acceptance"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
+        <a href="/economics" data-nav="economics"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/prize" data-nav="prize"><b>Prize</b><span>A better adversary or a reproduced shortcut, never a confirmation: the terms.</span></a><a href="/acceptance" data-nav="acceptance"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
         <a href="/ledger" data-nav="ledger"><b>Ledger</b><span>Every criticism, answered or conceded.</span></a>
         <a href="/claims" data-nav="claims"><b>What Igneum does not claim</b><span>The limits, stated first.</span></a>
         <a href="/randomx" data-nav="randomx"><b>Igneum vs RandomX</b><span>What was kept and what was rebuilt for GPUs.</span></a>
diff --git a/site/build.mjs b/site/build.mjs
index 47735dc41..6bedf8b09 100644
--- a/site/build.mjs
+++ b/site/build.mjs
@@ -365,7 +365,7 @@ function injectShare(html, file) {
   return html.replace('<!-- head:start -->', () => block + '\n<!-- head:start -->');
 }
 
-const PAGES = [['index.html', ''], ['download.html', 'download'], ['income.html', 'income'], ['economics.html', 'economics'], ['scorecard.html', 'scorecard'], ['docs.html', 'docs'], ['acceptance.html', 'acceptance'], ['litepaper.html', 'litepaper'], ['live.html', 'live'], ['evidence.html', 'evidence'], ['miner.html', 'miner'], ['app.html', 'app'], ['wallet.html', 'wallet'], ['ledger.html', 'ledger'], ['metamask.html', 'metamask'], ['faucet.html', 'faucet'], ['swap.html', 'swap'], ['404.html', ''],
+const PAGES = [['index.html', ''], ['download.html', 'download'], ['income.html', 'income'], ['economics.html', 'economics'], ['scorecard.html', 'scorecard'], ['prize.html', 'prize'], ['docs.html', 'docs'], ['acceptance.html', 'acceptance'], ['litepaper.html', 'litepaper'], ['live.html', 'live'], ['evidence.html', 'evidence'], ['miner.html', 'miner'], ['app.html', 'app'], ['wallet.html', 'wallet'], ['ledger.html', 'ledger'], ['metamask.html', 'metamask'], ['faucet.html', 'faucet'], ['swap.html', 'swap'], ['404.html', ''],
   // the Devnet 3 explorer (5 Oct 2026, extended 8 Oct 2026): /explorer, /block/<hash>, /address/<addr>, /tx/<hash> (vercel.json rewrites
   // the three) and /proving; the Explorer entry of the Network panel is the current one on all five
   ['explorer.html', 'explorer'], ['block.html', 'explorer'], ['address.html', 'explorer'], ['tx.html', 'explorer'], ['proving.html', 'explorer'],
@@ -427,7 +427,7 @@ for (const [file, active] of PAGES) {
   if (file === 'acceptance.html' && html.includes('<!-- acceptance:start -->')) {
     const rp = join(docs, 'plans', 'igneum-2.0-test-registry.json');
     // the zone name is a forbidden string on a served page (the identity list): the registry's times read UK here
-    if (existsSync(rp)) html = inject(html, 'acceptance', renderAcceptance(JSON.parse(readFileSync(rp, 'utf8').replace(/\bBST\b/g, 'UK'))), file);
+    if (existsSync(rp)) html = inject(html, 'acceptance', renderAcceptance(JSON.parse(readFileSync(rp, 'utf8').replace(/\bBST\b/g, 'UK').replace(/\bPC [12]\b/g, 'the project’s own rig').replace(/Devnet 3\b/g, 'the earlier devnet'))), file);   // the identity list: no zone name, no numbered rig, no numbered devnet on a served page
   }
   writeFileSync(p, html);
   built.push(file);
diff --git a/site/claims.html b/site/claims.html
index b64349da0..95f248f72 100644
--- a/site/claims.html
+++ b/site/claims.html
@@ -129,7 +129,7 @@
         <div class="panel-list">
           <a href="/litepaper" data-nav="litepaper"><b>Litepaper</b><span>The design, as published.</span></a>
           <a href="/income" data-nav="income"><b>Income</b><span>What your card would mine, from the live network.</span></a>
-          <a href="/economics" data-nav="economics"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/acceptance" data-nav="acceptance"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
+          <a href="/economics" data-nav="economics"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/prize" data-nav="prize"><b>Prize</b><span>A better adversary or a reproduced shortcut, never a confirmation: the terms.</span></a><a href="/acceptance" data-nav="acceptance"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
           <a href="/ledger" data-nav="ledger"><b>Ledger</b><span>Every criticism, answered or conceded.</span></a>
           <a href="/claims" data-nav="claims" aria-current="page"><b>What Igneum does not claim</b><span>The limits, stated first.</span></a>
           <a href="/randomx" data-nav="randomx"><b>Igneum vs RandomX</b><span>What was kept and what was rebuilt for GPUs.</span></a>
@@ -169,7 +169,7 @@
       <div class="sheet-group"><div class="sheet-head">Learn</div>
         <a href="/litepaper" data-nav="litepaper"><b>Litepaper</b><span>The design, as published.</span></a>
         <a href="/income" data-nav="income"><b>Income</b><span>What your card would mine, from the live network.</span></a>
-        <a href="/economics" data-nav="economics"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/acceptance" data-nav="acceptance"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
+        <a href="/economics" data-nav="economics"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/prize" data-nav="prize"><b>Prize</b><span>A better adversary or a reproduced shortcut, never a confirmation: the terms.</span></a><a href="/acceptance" data-nav="acceptance"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
         <a href="/ledger" data-nav="ledger"><b>Ledger</b><span>Every criticism, answered or conceded.</span></a>
         <a href="/claims" data-nav="claims" aria-current="page"><b>What Igneum does not claim</b><span>The limits, stated first.</span></a>
         <a href="/randomx" data-nav="randomx"><b>Igneum vs RandomX</b><span>What was kept and what was rebuilt for GPUs.</span></a>
diff --git a/site/compatibility.html b/site/compatibility.html
index e156f638e..b98665109 100644
--- a/site/compatibility.html
+++ b/site/compatibility.html
@@ -130,7 +130,7 @@ table{min-width:560px}
         <div class="panel-list">
           <a href="/litepaper" data-nav="litepaper"><b>Litepaper</b><span>The design, as published.</span></a>
           <a href="/income" data-nav="income"><b>Income</b><span>What your card would mine, from the live network.</span></a>
-          <a href="/economics" data-nav="economics"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/acceptance" data-nav="acceptance"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
+          <a href="/economics" data-nav="economics"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/prize" data-nav="prize"><b>Prize</b><span>A better adversary or a reproduced shortcut, never a confirmation: the terms.</span></a><a href="/acceptance" data-nav="acceptance"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
           <a href="/ledger" data-nav="ledger"><b>Ledger</b><span>Every criticism, answered or conceded.</span></a>
           <a href="/claims" data-nav="claims"><b>What Igneum does not claim</b><span>The limits, stated first.</span></a>
           <a href="/randomx" data-nav="randomx"><b>Igneum vs RandomX</b><span>What was kept and what was rebuilt for GPUs.</span></a>
@@ -170,7 +170,7 @@ table{min-width:560px}
       <div class="sheet-group"><div class="sheet-head">Learn</div>
         <a href="/litepaper" data-nav="litepaper"><b>Litepaper</b><span>The design, as published.</span></a>
         <a href="/income" data-nav="income"><b>Income</b><span>What your card would mine, from the live network.</span></a>
-        <a href="/economics" data-nav="economics"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/acceptance" data-nav="acceptance"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
+        <a href="/economics" data-nav="economics"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/prize" data-nav="prize"><b>Prize</b><span>A better adversary or a reproduced shortcut, never a confirmation: the terms.</span></a><a href="/acceptance" data-nav="acceptance"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
         <a href="/ledger" data-nav="ledger"><b>Ledger</b><span>Every criticism, answered or conceded.</span></a>
         <a href="/claims" data-nav="claims"><b>What Igneum does not claim</b><span>The limits, stated first.</span></a>
         <a href="/randomx" data-nav="randomx"><b>Igneum vs RandomX</b><span>What was kept and what was rebuilt for GPUs.</span></a>
diff --git a/site/dev-fee.html b/site/dev-fee.html
index 5124e2a82..9d0ef75e6 100644
--- a/site/dev-fee.html
+++ b/site/dev-fee.html
@@ -129,7 +129,7 @@
         <div class="panel-list">
           <a href="/litepaper" data-nav="litepaper"><b>Litepaper</b><span>The design, as published.</span></a>
           <a href="/income" data-nav="income"><b>Income</b><span>What your card would mine, from the live network.</span></a>
-          <a href="/economics" data-nav="economics"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/acceptance" data-nav="acceptance"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
+          <a href="/economics" data-nav="economics"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/prize" data-nav="prize"><b>Prize</b><span>A better adversary or a reproduced shortcut, never a confirmation: the terms.</span></a><a href="/acceptance" data-nav="acceptance"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
           <a href="/ledger" data-nav="ledger"><b>Ledger</b><span>Every criticism, answered or conceded.</span></a>
           <a href="/claims" data-nav="claims"><b>What Igneum does not claim</b><span>The limits, stated first.</span></a>
           <a href="/randomx" data-nav="randomx"><b>Igneum vs RandomX</b><span>What was kept and what was rebuilt for GPUs.</span></a>
@@ -169,7 +169,7 @@
       <div class="sheet-group"><div class="sheet-head">Learn</div>
         <a href="/litepaper" data-nav="litepaper"><b>Litepaper</b><span>The design, as published.</span></a>
         <a href="/income" data-nav="income"><b>Income</b><span>What your card would mine, from the live network.</span></a>
-        <a href="/economics" data-nav="economics"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/acceptance" data-nav="acceptance"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
+        <a href="/economics" data-nav="economics"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/prize" data-nav="prize"><b>Prize</b><span>A better adversary or a reproduced shortcut, never a confirmation: the terms.</span></a><a href="/acceptance" data-nav="acceptance"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
         <a href="/ledger" data-nav="ledger"><b>Ledger</b><span>Every criticism, answered or conceded.</span></a>
         <a href="/claims" data-nav="claims"><b>What Igneum does not claim</b><span>The limits, stated first.</span></a>
         <a href="/randomx" data-nav="randomx"><b>Igneum vs RandomX</b><span>What was kept and what was rebuilt for GPUs.</span></a>
diff --git a/site/docs.html b/site/docs.html
index 031aaa4c3..b472ceecf 100644
--- a/site/docs.html
+++ b/site/docs.html
@@ -103,7 +103,7 @@
         <div class="panel-list">
           <a href="/litepaper" data-nav="litepaper"><b>Litepaper</b><span>The design, as published.</span></a>
           <a href="/income" data-nav="income"><b>Income</b><span>What your card would mine, from the live network.</span></a>
-          <a href="/economics" data-nav="economics"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/acceptance" data-nav="acceptance"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs" aria-current="page"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
+          <a href="/economics" data-nav="economics"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/prize" data-nav="prize"><b>Prize</b><span>A better adversary or a reproduced shortcut, never a confirmation: the terms.</span></a><a href="/acceptance" data-nav="acceptance"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs" aria-current="page"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
           <a href="/ledger" data-nav="ledger"><b>Ledger</b><span>Every criticism, answered or conceded.</span></a>
           <a href="/claims" data-nav="claims"><b>What Igneum does not claim</b><span>The limits, stated first.</span></a>
           <a href="/randomx" data-nav="randomx"><b>Igneum vs RandomX</b><span>What was kept and what was rebuilt for GPUs.</span></a>
@@ -143,7 +143,7 @@
       <div class="sheet-group"><div class="sheet-head">Learn</div>
         <a href="/litepaper" data-nav="litepaper"><b>Litepaper</b><span>The design, as published.</span></a>
         <a href="/income" data-nav="income"><b>Income</b><span>What your card would mine, from the live network.</span></a>
-        <a href="/economics" data-nav="economics"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/acceptance" data-nav="acceptance"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs" aria-current="page"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
+        <a href="/economics" data-nav="economics"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/prize" data-nav="prize"><b>Prize</b><span>A better adversary or a reproduced shortcut, never a confirmation: the terms.</span></a><a href="/acceptance" data-nav="acceptance"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs" aria-current="page"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
         <a href="/ledger" data-nav="ledger"><b>Ledger</b><span>Every criticism, answered or conceded.</span></a>
         <a href="/claims" data-nav="claims"><b>What Igneum does not claim</b><span>The limits, stated first.</span></a>
         <a href="/randomx" data-nav="randomx"><b>Igneum vs RandomX</b><span>What was kept and what was rebuilt for GPUs.</span></a>
diff --git a/site/download.html b/site/download.html
index c47d531b5..0623fd8b3 100644
--- a/site/download.html
+++ b/site/download.html
@@ -119,7 +119,7 @@
         <div class="panel-list">
           <a href="/litepaper" data-nav="litepaper"><b>Litepaper</b><span>The design, as published.</span></a>
           <a href="/income" data-nav="income"><b>Income</b><span>What your card would mine, from the live network.</span></a>
-          <a href="/economics" data-nav="economics"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/acceptance" data-nav="acceptance"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
+          <a href="/economics" data-nav="economics"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/prize" data-nav="prize"><b>Prize</b><span>A better adversary or a reproduced shortcut, never a confirmation: the terms.</span></a><a href="/acceptance" data-nav="acceptance"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
           <a href="/ledger" data-nav="ledger"><b>Ledger</b><span>Every criticism, answered or conceded.</span></a>
           <a href="/claims" data-nav="claims"><b>What Igneum does not claim</b><span>The limits, stated first.</span></a>
           <a href="/randomx" data-nav="randomx"><b>Igneum vs RandomX</b><span>What was kept and what was rebuilt for GPUs.</span></a>
@@ -159,7 +159,7 @@
       <div class="sheet-group"><div class="sheet-head">Learn</div>
         <a href="/litepaper" data-nav="litepaper"><b>Litepaper</b><span>The design, as published.</span></a>
         <a href="/income" data-nav="income"><b>Income</b><span>What your card would mine, from the live network.</span></a>
-        <a href="/economics" data-nav="economics"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/acceptance" data-nav="acceptance"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
+        <a href="/economics" data-nav="economics"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/prize" data-nav="prize"><b>Prize</b><span>A better adversary or a reproduced shortcut, never a confirmation: the terms.</span></a><a href="/acceptance" data-nav="acceptance"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
         <a href="/ledger" data-nav="ledger"><b>Ledger</b><span>Every criticism, answered or conceded.</span></a>
         <a href="/claims" data-nav="claims"><b>What Igneum does not claim</b><span>The limits, stated first.</span></a>
         <a href="/randomx" data-nav="randomx"><b>Igneum vs RandomX</b><span>What was kept and what was rebuilt for GPUs.</span></a>
@@ -244,8 +244,8 @@
         <div><h3>Ember for Windows</h3><div class="sub">the installer, from the signed manifest</div></div>
         <div class="body">
           <p>Run the installer, press Start. NVIDIA and AMD cards both mine. Setting an NVIDIA power cap asks for administrator rights once.</p>
-          <a data-dl="miner-windows" href="https://dl.igneum.network/public/igneum-miner-windows.exe" class="btn primary"><span class="osmark bare" data-os="windows" title="Windows"><svg viewBox="0 0 24 24" width="22" height="22" aria-hidden="true" focusable="false" fill="currentColor"><path d="M3 5.6l7.3-1v7.1H3zM11.4 4.4L21 3v8.7h-9.6zM3 12.3h7.3v7.1L3 18.4zM11.4 12.3H21V21l-9.6-1.4z"/></svg></span>Download for Windows <span class="meta" data-dl-meta="miner-windows">v2.0.0 · 63.8 MB</span></a>
-          <div class="sha"><b>sha256</b> <span data-dl-sha="miner-windows">793a631dc2084e6d6f778f13602d674a0c134af746b6355c25d3998c2be18b79</span></div>
+          <a data-dl="miner-windows" href="https://dl.igneum.network/public/igneum-miner-windows.exe" class="btn primary"><span class="osmark bare" data-os="windows" title="Windows"><svg viewBox="0 0 24 24" width="22" height="22" aria-hidden="true" focusable="false" fill="currentColor"><path d="M3 5.6l7.3-1v7.1H3zM11.4 4.4L21 3v8.7h-9.6zM3 12.3h7.3v7.1L3 18.4zM11.4 12.3H21V21l-9.6-1.4z"/></svg></span>Download for Windows <span class="meta" data-dl-meta="miner-windows">v2.0.1 · 63.8 MB</span></a>
+          <div class="sha"><b>sha256</b> <span data-dl-sha="miner-windows">ce6bb00cd738fa08348fd8121781479109a5b2c2059a04fe7c22ad7aa3f12bf9</span></div>
         </div>
       </article>
       <article class="dl-card" id="mac">
@@ -283,6 +283,7 @@
     </div>
     <p class="yourcard" data-yourcard style="margin-top:16px">Your card: pending</p>
     <p class="home-quiet" data-release-note><b>What changed in 2.0.1.</b> An update never leaves mining off. The Cards tab is back as its own page. The first-block card shows once per address. The window names included, executed, proven and finalised. The node serves its manifest and the genesis state stream to every miner. The Mac build is unsigned tonight.</p>
+    <p class="home-quiet" data-release-note-2>2.0.0 is withdrawn: its miner could not read this network’s block templates; every 2.0.0 install updates itself to 2.0.1.</p>
     <p class="home-quiet" data-devnet-notice><b>Devnet.</b> Coins have no value and the chain may be reset.</p>
     <p class="home-quiet">The protocol carries no fee. The one payment to the project is the Ember software’s optional 1% dev fee, like other GPU miners, off with one flag. <a href="/dev-fee">The fee, in full view.</a></p>
   </div>
diff --git a/site/downloads.json b/site/downloads.json
index 107405ddd..5cd856abe 100644
--- a/site/downloads.json
+++ b/site/downloads.json
@@ -19,11 +19,11 @@
     },
     "miner-windows": {
       "alias": "/public/igneum-miner-windows.exe",
-      "file": "Igneum-Miner-Setup-2.0.0.exe",
-      "path": "/dl/public/Igneum-Miner-Setup-2.0.0.exe",
-      "sha256": "793a631dc2084e6d6f778f13602d674a0c134af746b6355c25d3998c2be18b79",
-      "size": 63803668,
-      "version": "2.0.0"
+      "file": "Igneum-Miner-Setup-2.0.1.exe",
+      "path": "/dl/public/Igneum-Miner-Setup-2.0.1.exe",
+      "sha256": "ce6bb00cd738fa08348fd8121781479109a5b2c2059a04fe7c22ad7aa3f12bf9",
+      "size": 63831654,
+      "version": "2.0.1"
     },
     "wallet-mac": {
       "alias": "/public/igneum-wallet-mac.dmg",
@@ -34,5 +34,5 @@
       "version": "0.1.6"
     }
   },
-  "updated": "2026-10-08T19:44:46Z"
+  "updated": "2026-10-08T19:51:38Z"
 }
diff --git a/site/economics.html b/site/economics.html
index 7256c7509..621c66a25 100644
--- a/site/economics.html
+++ b/site/economics.html
@@ -103,7 +103,7 @@
         <div class="panel-list">
           <a href="/litepaper" data-nav="litepaper"><b>Litepaper</b><span>The design, as published.</span></a>
           <a href="/income" data-nav="income"><b>Income</b><span>What your card would mine, from the live network.</span></a>
-          <a href="/economics" data-nav="economics" aria-current="page"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/acceptance" data-nav="acceptance"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
+          <a href="/economics" data-nav="economics" aria-current="page"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/prize" data-nav="prize"><b>Prize</b><span>A better adversary or a reproduced shortcut, never a confirmation: the terms.</span></a><a href="/acceptance" data-nav="acceptance"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
           <a href="/ledger" data-nav="ledger"><b>Ledger</b><span>Every criticism, answered or conceded.</span></a>
           <a href="/claims" data-nav="claims"><b>What Igneum does not claim</b><span>The limits, stated first.</span></a>
           <a href="/randomx" data-nav="randomx"><b>Igneum vs RandomX</b><span>What was kept and what was rebuilt for GPUs.</span></a>
@@ -143,7 +143,7 @@
       <div class="sheet-group"><div class="sheet-head">Learn</div>
         <a href="/litepaper" data-nav="litepaper"><b>Litepaper</b><span>The design, as published.</span></a>
         <a href="/income" data-nav="income"><b>Income</b><span>What your card would mine, from the live network.</span></a>
-        <a href="/economics" data-nav="economics" aria-current="page"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/acceptance" data-nav="acceptance"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
+        <a href="/economics" data-nav="economics" aria-current="page"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/prize" data-nav="prize"><b>Prize</b><span>A better adversary or a reproduced shortcut, never a confirmation: the terms.</span></a><a href="/acceptance" data-nav="acceptance"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
         <a href="/ledger" data-nav="ledger"><b>Ledger</b><span>Every criticism, answered or conceded.</span></a>
         <a href="/claims" data-nav="claims"><b>What Igneum does not claim</b><span>The limits, stated first.</span></a>
         <a href="/randomx" data-nav="randomx"><b>Igneum vs RandomX</b><span>What was kept and what was rebuilt for GPUs.</span></a>
@@ -292,7 +292,7 @@
   <tr><td>External settlement in IGN</td><td>other chains pay for proofs in IGN; <span data-rm="fees.external_jobs.provers_percent">90</span> percent to the provers, <span data-rm="fees.external_jobs.burn_percent">10</span> percent burned</td><td>the price a prover must charge is the subsidy it forgoes while it proves: per shard, (card hash ÷ network hash) × 0.8 × the block subsidy × shard seconds. For an RTX 5090 at 136 MH/s on a 1 GH/s network and a 37 s shard that is about 16 IGN a shard inside the ramp today and about 128 IGN at the full rate, against the pool’s 1.2 IGN a shard measured; the quote falls as one over network hash and is competitive near 100 GH/s (the litepaper, Building on Igneum)</td><td>designed; the settlement contract is not built</td></tr>
   </tbody></table></div>
   <h3>The standard’s new-entry test, as found</h3>
-  <p><b>ECO-05: FAIL.</b> ECO-05, the standard’s coexistence sweep, was run on a register frozen before any result against a sourced revenue reference of USD 31.65 million a year of miner revenue (Ethereum Classic’s trailing year at its current era 6 reward) and FAILS the envelope as the chain stands. Of sixteen revenue and tariff worlds (a quarter, one, four and ten times the reference; electricity at 3, 10, 25 and 40 cents per kilowatt-hour) only one sustains new entry across two vendors, ten times the reference at 3 cents (about USD 316 million a year), because on this hash the measured AMD and Intel cards cost four to six times a Blackwell card per joule and never earn a new entrant’s purchase back at list price below that world; in that one world no specialised design sits inside the envelope against the whole cohort (the board on commodity DRAM is within the envelope only against the best Blackwell card, the die and the hybrid against no card of today’s), and the quarter-reference worlds at 25 and 40 cents are collapse worlds with no rational profitable operator. What moves the result is the specialist’s hardware cost per unit of work, the honest cards’ own efficiency on this hash, above all the AMD and Intel cards’ energy, and the dataset’s size floor; not a smaller network, a higher token price or any chip’s death. Reported as found; the register, the full result cube and the model are published for independent reproduction. (Labels: the register frozen at 18:37 UK on 8 October 2026, the reference corrected by a second public read and the run repeated with the verdict unchanged, the cube MODELLED on measured card rows, two cohort rows BLOCKED, the RX 7600’s knee and the Arc’s watts, their measurement running tonight; the registry row ECO-05 on <a href="/acceptance">/acceptance</a>; the results file docs/analysis/class-v6/eco-05-results.md.)</p>
+  <p><b>ECO-05: FAIL.</b> ECO-05, the standard’s coexistence sweep, was run on a register frozen before any result against a sourced revenue reference of USD 31.65 million a year of miner revenue (Ethereum Classic’s trailing year at its current era 6 reward) and FAILS the envelope as the chain stands. Of sixteen revenue and tariff worlds (a quarter, one, four and ten times the reference; electricity at 3, 10, 25 and 40 cents per kilowatt-hour) one sustains new entry across two vendors on the measured cards, ten times the reference at 3 cents (about USD 316 million a year), and a second, ten times the reference at 10 cents, on the RX 7600’s modelled efficiency point, which the metered row due in the morning keeps at or below 5.4 microjoules per hash and takes away above about 5.6; the cause is that on this hash the measured AMD and Intel cards cost four to six times a Blackwell card per joule and never earn a new entrant’s purchase back at list price below those worlds; the verdict is FAIL either way; in those worlds no specialised design sits inside the envelope against the whole cohort (the board on commodity DRAM is within the envelope only against the best Blackwell card, the die and the hybrid against no card of today’s), and the quarter-reference worlds at 25 and 40 cents are collapse worlds with no rational profitable operator. What moves the result is the specialist’s hardware cost per unit of work, the honest cards’ own efficiency on this hash, above all the AMD and Intel cards’ energy, and the dataset’s size floor; not a smaller network, a higher token price or any chip’s death. Reported as found; the register, the full result cube and the model are published for independent reproduction. (Labels: the register frozen at 18:37 UK on 8 October 2026, the reference corrected by a second public read and the run repeated with the verdict unchanged, the cube MODELLED on measured card rows, two cohort rows BLOCKED, the RX 7600’s knee and the Arc’s watts, their measurement running tonight; the registry row ECO-05 on <a href="/acceptance">/acceptance</a>; the results file docs/analysis/class-v6/eco-05-results.md.)</p>
   <p>The chip question (whether a chip gets built against the hash, and what it would earn) is a conditional argument of its own on the litepaper’s <a href="/litepaper#chip-model">chip model</a>, not part of this page.</p>
   <h2>Units and decimals</h2>
   <div class="tbl"><table>
diff --git a/site/evidence.html b/site/evidence.html
index 592f2c744..6386084c7 100644
--- a/site/evidence.html
+++ b/site/evidence.html
@@ -140,7 +140,7 @@ td.mono{font-family:var(--f-mono);font-size:12.5px;min-width:180px}td.iv{color:v
         <div class="panel-list">
           <a href="/litepaper" data-nav="litepaper"><b>Litepaper</b><span>The design, as published.</span></a>
           <a href="/income" data-nav="income"><b>Income</b><span>What your card would mine, from the live network.</span></a>
-          <a href="/economics" data-nav="economics"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/acceptance" data-nav="acceptance"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
+          <a href="/economics" data-nav="economics"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/prize" data-nav="prize"><b>Prize</b><span>A better adversary or a reproduced shortcut, never a confirmation: the terms.</span></a><a href="/acceptance" data-nav="acceptance"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
           <a href="/ledger" data-nav="ledger"><b>Ledger</b><span>Every criticism, answered or conceded.</span></a>
           <a href="/claims" data-nav="claims"><b>What Igneum does not claim</b><span>The limits, stated first.</span></a>
           <a href="/randomx" data-nav="randomx"><b>Igneum vs RandomX</b><span>What was kept and what was rebuilt for GPUs.</span></a>
@@ -180,7 +180,7 @@ td.mono{font-family:var(--f-mono);font-size:12.5px;min-width:180px}td.iv{color:v
       <div class="sheet-group"><div class="sheet-head">Learn</div>
         <a href="/litepaper" data-nav="litepaper"><b>Litepaper</b><span>The design, as published.</span></a>
         <a href="/income" data-nav="income"><b>Income</b><span>What your card would mine, from the live network.</span></a>
-        <a href="/economics" data-nav="economics"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/acceptance" data-nav="acceptance"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
+        <a href="/economics" data-nav="economics"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/prize" data-nav="prize"><b>Prize</b><span>A better adversary or a reproduced shortcut, never a confirmation: the terms.</span></a><a href="/acceptance" data-nav="acceptance"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
         <a href="/ledger" data-nav="ledger"><b>Ledger</b><span>Every criticism, answered or conceded.</span></a>
         <a href="/claims" data-nav="claims"><b>What Igneum does not claim</b><span>The limits, stated first.</span></a>
         <a href="/randomx" data-nav="randomx"><b>Igneum vs RandomX</b><span>What was kept and what was rebuilt for GPUs.</span></a>
@@ -272,7 +272,7 @@ td.mono{font-family:var(--f-mono);font-size:12.5px;min-width:180px}td.iv{color:v
 <tr data-status="tested by the team"><td class="n">3</td><td class="claim">The 64-register window per lane costs a GPU under 1 percent of rate at stock, and at most 5 percent per load with the liveness chain<div class="where">The litepaper (class v6); <code>docs/plans/igneum-2.0.md</code> D1 (the placed 64-register rows)</div></td><td><span class="st st-3">TEAM-REPORTED; tested by the team</span></td><td class="mono"><code>docs/analysis/class-v6/connected-state.md</code> section 4; <code>docs/design/class-v6-rotating-family.md</code> section 10.0e</td><td>The class v5 nvcc harness and the kit worker, both packs on the same card minutes apart, 250 batches of 2^24, nvidia-smi at 1 Hz, vectors PASS on every row (<code>connected-state.md</code> section 4); the per-load rows of the full chain against the base (<code>class-v6-rotating-family.md</code> 10.0e)</td><td>8 October 2026, rented RTX 5090 (575 W cap) and RTX 4090 (450 W cap) at stock: energy per hash +0.6 percent on the RTX 5090 and -0.9 percent on the RTX 4090, inside the run-to-run noise; under 1 percent of rate; 80 to 87 registers per thread, no spill (all measured). Per load: RTX 5090 16.7 nJ base, 17.6 nJ full chain; RTX 4090 26.0 nJ, 27.0 nJ (measured). The lock row on the project's own rigs is owed Case: GPU-03</td><td class="iv">none yet. Packet: parameters a rented RTX 5090 and RTX 4090 at stock, the liveness chain, class v4; procedure the hash lane's harness rows in connected-state.md section 4; raw result energy per hash +0.6 percent and -0.9 percent, at most 5 percent per load; reproduction none yet; review scope none; unresolved two cards, one day, no AMD or Apple row</td></tr>
 <tr data-status="tested by the team"><td class="n">4</td><td class="claim">Reorganising the same work around live state (the connected-state variant, experiment D2(a)) does not reduce a specialised chip's edge: KILL as a class<div class="where"><code>docs/plans/igneum-2.0.md</code> D2(a); this page</div></td><td><span class="st st-3">TEAM-REPORTED; tested by the team (a published failure)</span></td><td class="mono"><code>docs/analysis/class-v6/connected-state.md</code> (the verdict, section 6)</td><td>The census, liveness and GPU rows in <code>connected-state.md</code> sections 2 to 4; the chip side priced on the drawn program by synthesis (a model, never a lower bound)</td><td>8 October 2026, verdict 17:25 UK: the window is necessary (63 of 64 registers live at every address, measured) but only its width reaches the chip, +1.2 pJ per lane-op at N5 (synthesised); the window moves the chip's edge 1.10x node for node against a 1.25x gate (modelled); the GPU side +0.6 percent energy per hash on the RTX 5090, -0.9 percent on the RTX 4090 at stock (measured). Rearranging the dependency graph of the same operations moves neither side Case: POW-04</td><td class="iv">none yet. Packet: parameters the connected-state generator variant behind a flag, the census TSVs; procedure connected-state.md; raw result +1.2 pJ per lane-op at N5 on the chip side, the GPU side unmoved; reproduction none yet; review scope none; unresolved the chip side is modelled, not measured</td></tr>
 <tr data-status="designed"><td class="n">5</td><td class="claim">"A GPU-secured network for Ethereum-compatible applications and verifiable computation." served on every page<div class="where">Every page</div></td><td><span class="st st-0">PROPOSED; designed (served)</span></td><td class="mono"><code>docs/plans/igneum-2.0.md</code> (the objective: the positioning line)</td><td><code>node tools/ci/ledger-text-check.mjs</code>: the sentence pinned (R0) on the home page, the litepaper and this page</td><td>8 October 2026: on this page; the home page and the litepaper carry it as their 2.0 text lands (designed) Case: GOV-08</td><td class="iv">none yet. Packet: parameters none (a served sentence); procedure the ledger-text check pins it on every page; raw result the check's count; reproduction not applicable; review scope the three external reviews the founder accepted; unresolved none</td></tr>
-<tr data-status="designed"><td class="n">6</td><td class="claim">The chip claim as served: "Igneum remains competitive on accessible commodity GPUs even when specialised mining hardware is assumed to exist, remain compatible and seek profit; its security does not rely on identifying that hardware or retiring it through emergency changes." Under it the three statements, separate: energy ("Current modelling estimates a 1.5x to 3.1x energy-efficiency advantage for the specialised designs assessed as complete machines against the GPU tier, from a board on commodity DRAM at 1.5x to an SRAM-store die at 3.1x (1.5x to 2.3x on the GPU's own node). For the board on commodity DRAM the two independent chip models agree after placement: 1.5x to 2.1x as a complete machine and 2.0x to 2.9x for the board alone on the GPU's own node; a node ahead 1.8x to 2.4x and 2.45x to 3.3x (placed and routed on ASAP7, both lanes, the node scaling claimed, the machine terms modelled; the 2.9x end is the resizer-downsized floor of the placed 32-lane comparator, not a point, until the placed core32 lands). The standard's P04 target reads FAIL at both ends, served as such. The standard's P04 target as approved: R_E at most 1.5 on the same node and one node ahead; today's placed bracket reads against it as a FAIL to work against." Per machine on the same node and a node ahead: the DRAM board 1.5x to 1.6x and 1.8x, the hybrid 1.9x to 2.1x and 2.4x to 2.6x, the die 2.3x and 3.1x; across the adversary's lane-count choice the same-node bracket is 1.5x to 2.1x and a node ahead 1.8x to 2.6x; 3x to 6x per dollar of hardware at list price. MODELLED: the GPU side measured, the chip's core placed and routed, the rest of the machine modelled, no chip measured, hardware cost approximate within 2x), economic and response capability, rotation an optional improvement. Class v5 derives the dataset from chain state; whether that excludes a specialised design is under evaluation (Deliverable 3), since a design that tracks state is not excluded by staleness. The dataset policy (decided 8 October 2026, 20:05 UK: the genesis size is 4 GiB, the lane's recommendation taken; 2 GiB and 5.5 GiB the costed alternatives beside it; later steps at 5 percent): "The dataset’s size is a one-off hardware ticket on specialised designs and a running energy tax on commodity cards: at 4 to 5.5 GiB a locked Blackwell card pays 12 to 14 percent more energy per hash than at 1 GiB (an 8 GB AMD card under 3 percent of rate), while the board on commodity DRAM pays nothing and the SRAM designs pay a hardware cost that does not change their outcome. So the dataset starts at 4 GiB, the largest size that keeps every entry card and a 12 GB card’s mining and proving together, decided at genesis, and every later step is scored at 5 percent against it and taken only when the chain’s own state outgrows the dataset, not on a calendar." (decided; the energy-against-size curve on the litepaper: 1, 2, 4 and 5.5 GiB at stock and at the lock measured on an RTX 5090 against its own 1 GiB control, +0.7 and +4.3 percent at stock, +11.7 and +13.4 at the lock for 4 and 5.5 GiB, the 2 GiB knee cell a paired read in flight; the exclusions by memory; the SRAM tickets modelled). A failure, reported as found: "ECO-05, the standard's coexistence sweep, was run on a register frozen before any result against a sourced revenue reference of USD 31.65 million a year of miner revenue (Ethereum Classic's trailing year at its current era 6 reward) and FAILS the envelope as the chain stands. Of sixteen revenue and tariff worlds (a quarter, one, four and ten times the reference; electricity at 3, 10, 25 and 40 cents per kilowatt-hour) only one sustains new entry across two vendors, ten times the reference at 3 cents (about USD 316 million a year), because on this hash the measured AMD and Intel cards cost four to six times a Blackwell card per joule and never earn a new entrant's purchase back at list price below that world; in that one world no specialised design sits inside the envelope against the whole cohort (the board on commodity DRAM is within the envelope only against the best Blackwell card, the die and the hybrid against no card of today's), and the quarter-reference worlds at 25 and 40 cents are collapse worlds with no rational profitable operator. What moves the result is the specialist's hardware cost per unit of work, the honest cards' own efficiency on this hash, above all the AMD and Intel cards' energy, and the dataset's size floor; not a smaller network, a higher token price or any chip's death. Reported as found; the register, the full result cube and the model are published for independent reproduction." (Labels: the register frozen at 18:37 UK on 8 October 2026, the reference corrected by a second public read and the run repeated with the verdict unchanged, the cube MODELLED on measured card rows, two cohort rows BLOCKED, the RX 7600's knee and the Arc's watts, their measurement running tonight; the registry row ECO-05 on /acceptance; the results file docs/analysis/class-v6/eco-05-results.md.) The energy ratio is not the pass criterion: the coexistence model ([docs/analysis/class-v6/coexistence-model.md](https://git.igneum.network/igneum-network/igneum/src/branch/master/docs/analysis/class-v6/coexistence-model.md)) is, and its first run's result is served with its conditions: A specialised supplier may earn a normal return; ordinary GPUs remain sufficiently close in total cost, widely obtainable and useful outside mining that new operators can still compete. On today's modelled rows that holds for the chip anyone can build, a stored-dataset board on commodity DRAM, at a productive life of one to three years: its cost per accepted unit of work sits within the range of the best GPU owner and entrant, it passes six of the seven conditions (a third of the network in boards now costs less than a year's revenue at the final hardware price), and a fleet of it holds a minority of the network with GPU entrants still setting the price. For the SRAM-store die the outcome turns on its hardware cost per unit of work, not its energy advantage: at the reconciled machine cost, set by the power train and the shadow core rather than the die, it fails the cost, hardware, fleet and margin conditions at every point of the band, a modest fleet holds about two fifths of a growing network and three fifths of a flat one on arrival and takes every flat or shrinking network within five years, and the only coexistence-shaped outcome is private supply in a growing network; what holds it is the investment decision, since its economics are project economics. A third design, a DRAM board with the hottest half of the dataset in on-board SRAM, sits between the two: it coexists only in a growing network at cheap GPU electricity and fails the cost conditions in a flat or shrinking one, and the dataset's size floor is a real lever on it where it was none on the SRAM die. What holds the die is the investment decision, not the hash; every chip figure here is modelled, not measured, and the chip's hardware cost per unit of work is approximate within 2x.<div class="where">The litepaper (the chip model)</div></td><td><span class="st st-0">MODELLED; designed (the bracket modelled; the GPU side tested by the team)</span></td><td class="mono"><code>docs/design/class-v6-rotating-family.md</code> section 10 (10.0h to 10.0n, 8 October 2026); <code>docs/plans/igneum-2.0.md</code> D3 and D4</td><td>the scoring rule in the close (the minimum over workloads of the maximum over free adversarial designs of the GPU's joules per hash over the adversary's, under the 10 percent GPU-cost budget at the lock, the verifier limit, cross-vendor correctness and hardware accessibility); the placed rows are D3's</td><td>the GPU side measured: the RTX 5080 at its 1,100 MHz lock 2.06 microjoules per hash and the RTX 5090 at its 1,300 MHz lock 2.33 (8 October 2026, the project's own rigs and rented pods); the chip side synthesised and claimed, its placed gated row pending Case: ADV-01</td><td class="iv">none yet. Packet: parameters the placed full 18-family core on ASAP7, claimed node scaling, the GDDR7 board, the RTX 5090 at its 1,300 MHz lock on class v4; procedure class-v6-rotating-family.md section 10 and coexistence-model.md; raw result the energies and verdicts as served; reproduction none yet; review scope three external reviews of the close, findings taken; unresolved no chip measured, hardware cost approximate within 2x, the k lane's 32-lane placed row pending</td></tr>
+<tr data-status="designed"><td class="n">6</td><td class="claim">The chip claim as served: "Igneum remains competitive on accessible commodity GPUs even when specialised mining hardware is assumed to exist, remain compatible and seek profit; its security does not rely on identifying that hardware or retiring it through emergency changes." Under it the three statements, separate: energy ("Current modelling estimates a 1.5x to 3.1x energy-efficiency advantage for the specialised designs assessed as complete machines against the GPU tier, from a board on commodity DRAM at 1.5x to an SRAM-store die at 3.1x (1.5x to 2.3x on the GPU's own node). For the board on commodity DRAM the two independent chip models agree after placement: 1.5x to 2.1x as a complete machine and 2.0x to 2.9x for the board alone on the GPU's own node; a node ahead 1.8x to 2.4x and 2.45x to 3.3x (placed and routed on ASAP7, both lanes, the node scaling claimed, the machine terms modelled; the 2.9x end is the resizer-downsized floor of the placed 32-lane comparator, not a point, until the placed core32 lands). The standard's P04 target reads FAIL at both ends, served as such. The standard's P04 target as approved: R_E at most 1.5 on the same node and one node ahead; today's placed bracket reads against it as a FAIL to work against." Per machine on the same node and a node ahead: the DRAM board 1.5x to 1.6x and 1.8x, the hybrid 1.9x to 2.1x and 2.4x to 2.6x, the die 2.3x and 3.1x; across the adversary's lane-count choice the same-node bracket is 1.5x to 2.1x and a node ahead 1.8x to 2.6x; 3x to 6x per dollar of hardware at list price. MODELLED: the GPU side measured, the chip's core placed and routed, the rest of the machine modelled, no chip measured, hardware cost approximate within 2x), economic and response capability, rotation an optional improvement. Class v5 derives the dataset from chain state; whether that excludes a specialised design is under evaluation (Deliverable 3), since a design that tracks state is not excluded by staleness. The dataset policy (decided 8 October 2026, 20:05 UK: the genesis size is 4 GiB, the lane's recommendation taken; 2 GiB and 5.5 GiB the costed alternatives beside it; later steps at 5 percent): "The dataset’s size is a one-off hardware ticket on specialised designs and a running energy tax on commodity cards: at 4 to 5.5 GiB a locked Blackwell card pays 12 to 14 percent more energy per hash than at 1 GiB (an 8 GB AMD card under 3 percent of rate), while the board on commodity DRAM pays nothing and the SRAM designs pay a hardware cost that does not change their outcome. So the dataset starts at 4 GiB, the largest size that keeps every entry card and a 12 GB card’s mining and proving together, decided at genesis, and every later step is scored at 5 percent against it and taken only when the chain’s own state outgrows the dataset, not on a calendar." (decided; the energy-against-size curve on the litepaper: 1, 2, 4 and 5.5 GiB at stock and at the lock measured on an RTX 5090 against its own 1 GiB control, +0.7 and +4.3 percent at stock, +11.7 and +13.4 at the lock for 4 and 5.5 GiB, the 2 GiB knee cell a paired read in flight; the exclusions by memory; the SRAM tickets modelled). A failure, reported as found: "ECO-05, the standard's coexistence sweep, was run on a register frozen before any result against a sourced revenue reference of USD 31.65 million a year of miner revenue (Ethereum Classic's trailing year at its current era 6 reward) and FAILS the envelope as the chain stands. Of sixteen revenue and tariff worlds (a quarter, one, four and ten times the reference; electricity at 3, 10, 25 and 40 cents per kilowatt-hour) one sustains new entry across two vendors on the measured cards, ten times the reference at 3 cents (about USD 316 million a year), and a second, ten times the reference at 10 cents, on the RX 7600's modelled efficiency point, which the metered row due in the morning keeps at or below 5.4 microjoules per hash and takes away above about 5.6; the cause is that on this hash the measured AMD and Intel cards cost four to six times a Blackwell card per joule and never earn a new entrant's purchase back at list price below those worlds; the verdict is FAIL either way; in those worlds no specialised design sits inside the envelope against the whole cohort (the board on commodity DRAM is within the envelope only against the best Blackwell card, the die and the hybrid against no card of today's), and the quarter-reference worlds at 25 and 40 cents are collapse worlds with no rational profitable operator. What moves the result is the specialist's hardware cost per unit of work, the honest cards' own efficiency on this hash, above all the AMD and Intel cards' energy, and the dataset's size floor; not a smaller network, a higher token price or any chip's death. Reported as found; the register, the full result cube and the model are published for independent reproduction." (Labels: the register frozen at 18:37 UK on 8 October 2026, the reference corrected by a second public read and the run repeated with the verdict unchanged, the cube MODELLED on measured card rows, two cohort rows BLOCKED, the RX 7600's knee and the Arc's watts, their measurement running tonight; the registry row ECO-05 on /acceptance; the results file docs/analysis/class-v6/eco-05-results.md.) The energy ratio is not the pass criterion: the coexistence model ([docs/analysis/class-v6/coexistence-model.md](https://git.igneum.network/igneum-network/igneum/src/branch/master/docs/analysis/class-v6/coexistence-model.md)) is, and its first run's result is served with its conditions: A specialised supplier may earn a normal return; ordinary GPUs remain sufficiently close in total cost, widely obtainable and useful outside mining that new operators can still compete. On today's modelled rows that holds for the chip anyone can build, a stored-dataset board on commodity DRAM, at a productive life of one to three years: its cost per accepted unit of work sits within the range of the best GPU owner and entrant, it passes six of the seven conditions (a third of the network in boards now costs less than a year's revenue at the final hardware price), and a fleet of it holds a minority of the network with GPU entrants still setting the price. For the SRAM-store die the outcome turns on its hardware cost per unit of work, not its energy advantage: at the reconciled machine cost, set by the power train and the shadow core rather than the die, it fails the cost, hardware, fleet and margin conditions at every point of the band, a modest fleet holds about two fifths of a growing network and three fifths of a flat one on arrival and takes every flat or shrinking network within five years, and the only coexistence-shaped outcome is private supply in a growing network; what holds it is the investment decision, since its economics are project economics. A third design, a DRAM board with the hottest half of the dataset in on-board SRAM, sits between the two: it coexists only in a growing network at cheap GPU electricity and fails the cost conditions in a flat or shrinking one, and the dataset's size floor is a real lever on it where it was none on the SRAM die. What holds the die is the investment decision, not the hash; every chip figure here is modelled, not measured, and the chip's hardware cost per unit of work is approximate within 2x.<div class="where">The litepaper (the chip model)</div></td><td><span class="st st-0">MODELLED; designed (the bracket modelled; the GPU side tested by the team)</span></td><td class="mono"><code>docs/design/class-v6-rotating-family.md</code> section 10 (10.0h to 10.0n, 8 October 2026); <code>docs/plans/igneum-2.0.md</code> D3 and D4</td><td>the scoring rule in the close (the minimum over workloads of the maximum over free adversarial designs of the GPU's joules per hash over the adversary's, under the 10 percent GPU-cost budget at the lock, the verifier limit, cross-vendor correctness and hardware accessibility); the placed rows are D3's</td><td>the GPU side measured: the RTX 5080 at its 1,100 MHz lock 2.06 microjoules per hash and the RTX 5090 at its 1,300 MHz lock 2.33 (8 October 2026, the project's own rigs and rented pods); the chip side synthesised and claimed, its placed gated row pending Case: ADV-01</td><td class="iv">none yet. Packet: parameters the placed full 18-family core on ASAP7, claimed node scaling, the GDDR7 board, the RTX 5090 at its 1,300 MHz lock on class v4; procedure class-v6-rotating-family.md section 10 and coexistence-model.md; raw result the energies and verdicts as served; reproduction none yet; review scope three external reviews of the close, findings taken; unresolved no chip measured, hardware cost approximate within 2x, the k lane's 32-lane placed row pending</td></tr>
 <tr data-status="tested by the team"><td class="n">7</td><td class="claim">Mining and proving together on one card needs a 16 GB card at the proposed 5.5 GiB dataset (the genesis size is 4 GiB, decided 8 October 2026; at 4 GiB the miner holds less and the rule is not yet measured there): the miner holds about 6.1 GiB and a compressed shard proof peaks at about 7.5 GiB, so 8 GB and 12 GB cards time-share (the app pauses the miner for the proof). NVIDIA proves; AMD and Apple mine<div class="where">The litepaper (Proving, vs RandomX); the miner page</div></td><td><span class="st st-3">TEAM-REPORTED; tested by the team</span></td><td class="mono"><code>docs/analysis/class-v6/coexist-rows.md</code> (the 5.5 GiB ds55 miner beside igneum-prove-host-0317, compressed at threshold 2^26, the served sm_86 and sm_89 floors)</td><td>the RESULT rows in that file, verbatim from the runs</td><td>rented RTX 3060 12 GB: 26.82 MH/s at 117.4 W with 6,129 MiB resident; the compressed shard 13.2 s, peak 7,525 MiB (6,129 + 7,525 = 13,654 MiB against 12,288); rented RTX 4060 8 GB: 18.84 MH/s, 6,116 MiB resident; the shard 8.2 s, peak 7,532 MiB; 8 October 2026 Case: GPU-05</td><td class="iv">none yet. Packet: parameters the 5.5 GiB ds55 miner, igneum-prove-host-0317 compressed at threshold 2^26, sm_86 and sm_89; procedure coexist-rows.md; raw result the RESULT rows verbatim; reproduction none yet; review scope none; unresolved two cards on one day, the 6 October rows stand as 1 GiB-dataset rows</td></tr>
 <tr data-status="activated"><td class="n">8</td><td class="claim">Finality is active on the Igneum 2.0 devnet from checkpoint 241, 115 minutes after block one, with 78 percent of active weight signing<div class="where">The live page's strip; the explorer; this page</div></td><td><span class="st st-2">TEAM-REPORTED; activated: the first lock at 19:08:25 UK on 8 October 2026 (checkpoint 241, DAA 7,247, 77.8 percent of active weight; checkpoint 242 at 19:08:48)</span></td><td class="mono">the node's checkpoint state through the observer (/api/live finality.active, latest_locked_index); node 4cdcc488 on release-2.0.0-node</td><td>the observer's finality fields read at the edge (supported true, active true, latest_locked_index 244 at 19:10 UK). Case: FIN-01</td><td>8 October 2026, 19:08 UK: the first lock 115 minutes after the first block at 17:14; the weight window filled at DAA 7,200. Packet: parameters rule v3 from checkpoint DAA 0, the 7,200 DAA presence window, two thirds of active and of total weight; procedure the observer's checkpoint table; raw result checkpoint 241 locked at DAA 7,247 with 77.8 percent of active weight; reproduction none yet; review scope none; unresolved a pause has not yet been observed on this chain</td><td class="iv">none yet</td></tr>
 <tr data-status="designed"><td class="n">9</td><td class="claim">The reference population and the cost per accepted unit of work: The reference population is the discrete-GPU classes the network protects, from the RTX 5090 to the RX 7600 8 GB and the Arc B580, with Apple reported beside them; for each the table gives the cost per accepted unit of work for an existing owner (power, wear, fees, over accepted work) and for a new entrant (purchase at list and street price, two years of operation, resale), at three electricity prices, with every figure labelled measured or modelled. On today's rows the cheapest honest owner is a 16 GB Blackwell card at its efficiency point and the cheapest entrant the same card at list price; the specialised board on commodity DRAM costs more per accepted unit than any owner and sits between the entrant's list and street figures.<div class="where">The litepaper (the chip model); /scorecard</div></td><td><span class="st st-0">MODELLED; designed (the card rows measured, the chip rows modelled with hardware cost approximate within 2x)</span></td><td class="mono"><code>docs/analysis/class-v6/reference-population.md</code> (floor lane 3 for the research lane, on master at 10aa76d7, 8 October 2026)</td><td>the table's own cells, each labelled measured or modelled; the two tests per class as the plan's D1 names them. Case: GPU-02</td><td>8 October 2026: the cheapest honest owner a 16 GB Blackwell card at its efficiency point, the cheapest entrant the same card at list price, the DRAM board above every owner and between the entrant's list and street figures. Packet: parameters the reference cohort (RTX 5090 to RX 7600 8 GB and Arc B580, Apple beside), three electricity prices, two years of operation; procedure the table's method section; raw result the table; reproduction none yet; review scope none; unresolved the Arc's watts and the RX 7600's knee rows are BLOCKED</td><td class="iv">none yet</td></tr>
diff --git a/site/explorer.html b/site/explorer.html
index a74a853d2..975dade60 100644
--- a/site/explorer.html
+++ b/site/explorer.html
@@ -156,7 +156,7 @@ main{padding-bottom:100px}.card{background:var(--row);border:1px solid var(--lin
         <div class="panel-list">
           <a href="/litepaper" data-nav="litepaper"><b>Litepaper</b><span>The design, as published.</span></a>
           <a href="/income" data-nav="income"><b>Income</b><span>What your card would mine, from the live network.</span></a>
-          <a href="/economics" data-nav="economics"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/acceptance" data-nav="acceptance"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
+          <a href="/economics" data-nav="economics"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/prize" data-nav="prize"><b>Prize</b><span>A better adversary or a reproduced shortcut, never a confirmation: the terms.</span></a><a href="/acceptance" data-nav="acceptance"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
           <a href="/ledger" data-nav="ledger"><b>Ledger</b><span>Every criticism, answered or conceded.</span></a>
           <a href="/claims" data-nav="claims"><b>What Igneum does not claim</b><span>The limits, stated first.</span></a>
           <a href="/randomx" data-nav="randomx"><b>Igneum vs RandomX</b><span>What was kept and what was rebuilt for GPUs.</span></a>
@@ -196,7 +196,7 @@ main{padding-bottom:100px}.card{background:var(--row);border:1px solid var(--lin
       <div class="sheet-group"><div class="sheet-head">Learn</div>
         <a href="/litepaper" data-nav="litepaper"><b>Litepaper</b><span>The design, as published.</span></a>
         <a href="/income" data-nav="income"><b>Income</b><span>What your card would mine, from the live network.</span></a>
-        <a href="/economics" data-nav="economics"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/acceptance" data-nav="acceptance"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
+        <a href="/economics" data-nav="economics"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/prize" data-nav="prize"><b>Prize</b><span>A better adversary or a reproduced shortcut, never a confirmation: the terms.</span></a><a href="/acceptance" data-nav="acceptance"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
         <a href="/ledger" data-nav="ledger"><b>Ledger</b><span>Every criticism, answered or conceded.</span></a>
         <a href="/claims" data-nav="claims"><b>What Igneum does not claim</b><span>The limits, stated first.</span></a>
         <a href="/randomx" data-nav="randomx"><b>Igneum vs RandomX</b><span>What was kept and what was rebuilt for GPUs.</span></a>
diff --git a/site/faucet.html b/site/faucet.html
index 4575842bf..d8d004d81 100644
--- a/site/faucet.html
+++ b/site/faucet.html
@@ -133,7 +133,7 @@ dt{color:var(--ash)}dd{margin:0;font-family:var(--f-mono);font-size:14px;overflo
         <div class="panel-list">
           <a href="/litepaper" data-nav="litepaper"><b>Litepaper</b><span>The design, as published.</span></a>
           <a href="/income" data-nav="income"><b>Income</b><span>What your card would mine, from the live network.</span></a>
-          <a href="/economics" data-nav="economics"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/acceptance" data-nav="acceptance"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
+          <a href="/economics" data-nav="economics"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/prize" data-nav="prize"><b>Prize</b><span>A better adversary or a reproduced shortcut, never a confirmation: the terms.</span></a><a href="/acceptance" data-nav="acceptance"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
           <a href="/ledger" data-nav="ledger"><b>Ledger</b><span>Every criticism, answered or conceded.</span></a>
           <a href="/claims" data-nav="claims"><b>What Igneum does not claim</b><span>The limits, stated first.</span></a>
           <a href="/randomx" data-nav="randomx"><b>Igneum vs RandomX</b><span>What was kept and what was rebuilt for GPUs.</span></a>
@@ -173,7 +173,7 @@ dt{color:var(--ash)}dd{margin:0;font-family:var(--f-mono);font-size:14px;overflo
       <div class="sheet-group"><div class="sheet-head">Learn</div>
         <a href="/litepaper" data-nav="litepaper"><b>Litepaper</b><span>The design, as published.</span></a>
         <a href="/income" data-nav="income"><b>Income</b><span>What your card would mine, from the live network.</span></a>
-        <a href="/economics" data-nav="economics"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/acceptance" data-nav="acceptance"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
+        <a href="/economics" data-nav="economics"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/prize" data-nav="prize"><b>Prize</b><span>A better adversary or a reproduced shortcut, never a confirmation: the terms.</span></a><a href="/acceptance" data-nav="acceptance"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
         <a href="/ledger" data-nav="ledger"><b>Ledger</b><span>Every criticism, answered or conceded.</span></a>
         <a href="/claims" data-nav="claims"><b>What Igneum does not claim</b><span>The limits, stated first.</span></a>
         <a href="/randomx" data-nav="randomx"><b>Igneum vs RandomX</b><span>What was kept and what was rebuilt for GPUs.</span></a>
diff --git a/site/forbidden-strings.txt b/site/forbidden-strings.txt
index eec90bffd..1b5aea9dd 100644
--- a/site/forbidden-strings.txt
+++ b/site/forbidden-strings.txt
@@ -33,8 +33,8 @@ DESKTOP-KMCV
 \bpid [0-9]+\b
 0\.0\.0\.0:[0-9]+
 --rpclisten=
-# the disclosure prize is approved but its announcement is staged until the entity address exists and the owner gives the publish word (cryptanalysis plan 3.3, 7 October 2026)
-disclosure prize
+# the disclosure prize was staged (cryptanalysis plan 3.3, 7 October 2026) until the entity existed and the owner gave the publish word; both
+# came on 8 October 2026 (the entity formed that day; the word: /prize live tonight), so the phrase is served at /prize and where it is linked
 # the rig names never reach a served page (verification lane, 7 October 2026: a substring grep read "PC 2" inside gRPC port numbers; this is the word-bounded check)
 \bPC [12]\b
 counsel is engaged
diff --git a/site/grants.html b/site/grants.html
index 668e2d3a0..58f60574a 100644
--- a/site/grants.html
+++ b/site/grants.html
@@ -130,7 +130,7 @@ table{min-width:560px}
         <div class="panel-list">
           <a href="/litepaper" data-nav="litepaper"><b>Litepaper</b><span>The design, as published.</span></a>
           <a href="/income" data-nav="income"><b>Income</b><span>What your card would mine, from the live network.</span></a>
-          <a href="/economics" data-nav="economics"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/acceptance" data-nav="acceptance"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
+          <a href="/economics" data-nav="economics"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/prize" data-nav="prize"><b>Prize</b><span>A better adversary or a reproduced shortcut, never a confirmation: the terms.</span></a><a href="/acceptance" data-nav="acceptance"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
           <a href="/ledger" data-nav="ledger"><b>Ledger</b><span>Every criticism, answered or conceded.</span></a>
           <a href="/claims" data-nav="claims"><b>What Igneum does not claim</b><span>The limits, stated first.</span></a>
           <a href="/randomx" data-nav="randomx"><b>Igneum vs RandomX</b><span>What was kept and what was rebuilt for GPUs.</span></a>
@@ -170,7 +170,7 @@ table{min-width:560px}
       <div class="sheet-group"><div class="sheet-head">Learn</div>
         <a href="/litepaper" data-nav="litepaper"><b>Litepaper</b><span>The design, as published.</span></a>
         <a href="/income" data-nav="income"><b>Income</b><span>What your card would mine, from the live network.</span></a>
-        <a href="/economics" data-nav="economics"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/acceptance" data-nav="acceptance"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
+        <a href="/economics" data-nav="economics"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/prize" data-nav="prize"><b>Prize</b><span>A better adversary or a reproduced shortcut, never a confirmation: the terms.</span></a><a href="/acceptance" data-nav="acceptance"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
         <a href="/ledger" data-nav="ledger"><b>Ledger</b><span>Every criticism, answered or conceded.</span></a>
         <a href="/claims" data-nav="claims"><b>What Igneum does not claim</b><span>The limits, stated first.</span></a>
         <a href="/randomx" data-nav="randomx"><b>Igneum vs RandomX</b><span>What was kept and what was rebuilt for GPUs.</span></a>
diff --git a/site/income.html b/site/income.html
index d2be1bfa9..4d000e0a3 100644
--- a/site/income.html
+++ b/site/income.html
@@ -103,7 +103,7 @@
         <div class="panel-list">
           <a href="/litepaper" data-nav="litepaper"><b>Litepaper</b><span>The design, as published.</span></a>
           <a href="/income" data-nav="income" aria-current="page"><b>Income</b><span>What your card would mine, from the live network.</span></a>
-          <a href="/economics" data-nav="economics"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/acceptance" data-nav="acceptance"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
+          <a href="/economics" data-nav="economics"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/prize" data-nav="prize"><b>Prize</b><span>A better adversary or a reproduced shortcut, never a confirmation: the terms.</span></a><a href="/acceptance" data-nav="acceptance"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
           <a href="/ledger" data-nav="ledger"><b>Ledger</b><span>Every criticism, answered or conceded.</span></a>
           <a href="/claims" data-nav="claims"><b>What Igneum does not claim</b><span>The limits, stated first.</span></a>
           <a href="/randomx" data-nav="randomx"><b>Igneum vs RandomX</b><span>What was kept and what was rebuilt for GPUs.</span></a>
@@ -143,7 +143,7 @@
       <div class="sheet-group"><div class="sheet-head">Learn</div>
         <a href="/litepaper" data-nav="litepaper"><b>Litepaper</b><span>The design, as published.</span></a>
         <a href="/income" data-nav="income" aria-current="page"><b>Income</b><span>What your card would mine, from the live network.</span></a>
-        <a href="/economics" data-nav="economics"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/acceptance" data-nav="acceptance"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
+        <a href="/economics" data-nav="economics"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/prize" data-nav="prize"><b>Prize</b><span>A better adversary or a reproduced shortcut, never a confirmation: the terms.</span></a><a href="/acceptance" data-nav="acceptance"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
         <a href="/ledger" data-nav="ledger"><b>Ledger</b><span>Every criticism, answered or conceded.</span></a>
         <a href="/claims" data-nav="claims"><b>What Igneum does not claim</b><span>The limits, stated first.</span></a>
         <a href="/randomx" data-nav="randomx"><b>Igneum vs RandomX</b><span>What was kept and what was rebuilt for GPUs.</span></a>
diff --git a/site/index.html b/site/index.html
index f9902bdce..71d429a46 100644
--- a/site/index.html
+++ b/site/index.html
@@ -121,7 +121,7 @@
         <div class="panel-list">
           <a href="/litepaper" data-nav="litepaper"><b>Litepaper</b><span>The design, as published.</span></a>
           <a href="/income" data-nav="income"><b>Income</b><span>What your card would mine, from the live network.</span></a>
-          <a href="/economics" data-nav="economics"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/acceptance" data-nav="acceptance"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
+          <a href="/economics" data-nav="economics"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/prize" data-nav="prize"><b>Prize</b><span>A better adversary or a reproduced shortcut, never a confirmation: the terms.</span></a><a href="/acceptance" data-nav="acceptance"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
           <a href="/ledger" data-nav="ledger"><b>Ledger</b><span>Every criticism, answered or conceded.</span></a>
           <a href="/claims" data-nav="claims"><b>What Igneum does not claim</b><span>The limits, stated first.</span></a>
           <a href="/randomx" data-nav="randomx"><b>Igneum vs RandomX</b><span>What was kept and what was rebuilt for GPUs.</span></a>
@@ -161,7 +161,7 @@
       <div class="sheet-group"><div class="sheet-head">Learn</div>
         <a href="/litepaper" data-nav="litepaper"><b>Litepaper</b><span>The design, as published.</span></a>
         <a href="/income" data-nav="income"><b>Income</b><span>What your card would mine, from the live network.</span></a>
-        <a href="/economics" data-nav="economics"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/acceptance" data-nav="acceptance"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
+        <a href="/economics" data-nav="economics"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/prize" data-nav="prize"><b>Prize</b><span>A better adversary or a reproduced shortcut, never a confirmation: the terms.</span></a><a href="/acceptance" data-nav="acceptance"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
         <a href="/ledger" data-nav="ledger"><b>Ledger</b><span>Every criticism, answered or conceded.</span></a>
         <a href="/claims" data-nav="claims"><b>What Igneum does not claim</b><span>The limits, stated first.</span></a>
         <a href="/randomx" data-nav="randomx"><b>Igneum vs RandomX</b><span>What was kept and what was rebuilt for GPUs.</span></a>
@@ -236,7 +236,7 @@
     <h1>The card you own has <span class="accent">a new chain</span> to&nbsp;mine.</h1>
     <p class="lead">A GPU-secured network for Ethereum-compatible applications and verifiable computation.</p>
     <div class="fold-actions" id="fold-actions">
-      <a data-dl="miner-windows" href="https://dl.igneum.network/public/igneum-miner-windows.exe" data-os-button="windows" class="btn primary"><span class="osmark bare" data-os="windows" title="Windows"><svg viewBox="0 0 24 24" width="22" height="22" aria-hidden="true" focusable="false" fill="currentColor"><path d="M3 5.6l7.3-1v7.1H3zM11.4 4.4L21 3v8.7h-9.6zM3 12.3h7.3v7.1L3 18.4zM11.4 12.3H21V21l-9.6-1.4z"/></svg></span>Download for Windows<span class="meta" data-dl-meta="miner-windows">v2.0.0 · 63.8 MB</span></a>
+      <a data-dl="miner-windows" href="https://dl.igneum.network/public/igneum-miner-windows.exe" data-os-button="windows" class="btn primary"><span class="osmark bare" data-os="windows" title="Windows"><svg viewBox="0 0 24 24" width="22" height="22" aria-hidden="true" focusable="false" fill="currentColor"><path d="M3 5.6l7.3-1v7.1H3zM11.4 4.4L21 3v8.7h-9.6zM3 12.3h7.3v7.1L3 18.4zM11.4 12.3H21V21l-9.6-1.4z"/></svg></span>Download for Windows<span class="meta" data-dl-meta="miner-windows">v2.0.1 · 63.8 MB</span></a>
       <a data-dl="miner-mac" href="https://dl.igneum.network/public/igneum-miner-mac.dmg" data-os-button="mac" class="btn"><span class="osmark bare" data-os="mac" title="macOS"><svg viewBox="0 0 24 24" width="22" height="22" aria-hidden="true" focusable="false" fill="currentColor"><path d="M16.4 12.6c0-2.5 2-3.6 2.1-3.7-1.2-1.7-3-1.9-3.6-2-1.5-.2-3 .9-3.8.9-.8 0-2-.9-3.3-.8-1.7 0-3.2 1-4.1 2.5-1.8 3-.5 7.6 1.3 10.1.9 1.2 1.9 2.6 3.2 2.5 1.3 0 1.8-.8 3.3-.8 1.6 0 2 .8 3.3.8 1.4 0 2.3-1.2 3.1-2.5 1-1.4 1.4-2.8 1.4-2.9 0 0-2.7-1-2.9-4.1zM13.9 5.3c.7-.8 1.2-2 1-3.2-1 0-2.2.7-2.9 1.5-.6.7-1.2 1.9-1 3 1.1.1 2.2-.5 2.9-1.3z"/></svg></span>Download for macOS<span class="meta" data-dl-meta="miner-mac">v2.0.1 · 45.9 MB</span></a>
     </div>
     <p class="fold-more fold-one">One click: node, miner, prover. The card starts.</p>
diff --git a/site/ledger.html b/site/ledger.html
index d70c37df2..3642b29a1 100644
--- a/site/ledger.html
+++ b/site/ledger.html
@@ -134,7 +134,7 @@ blockquote{margin:10px 0;padding:10px 14px;border-left:3px solid var(--line-2);c
         <div class="panel-list">
           <a href="/litepaper" data-nav="litepaper"><b>Litepaper</b><span>The design, as published.</span></a>
           <a href="/income" data-nav="income"><b>Income</b><span>What your card would mine, from the live network.</span></a>
-          <a href="/economics" data-nav="economics"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/acceptance" data-nav="acceptance"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
+          <a href="/economics" data-nav="economics"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/prize" data-nav="prize"><b>Prize</b><span>A better adversary or a reproduced shortcut, never a confirmation: the terms.</span></a><a href="/acceptance" data-nav="acceptance"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
           <a href="/ledger" data-nav="ledger" aria-current="page"><b>Ledger</b><span>Every criticism, answered or conceded.</span></a>
           <a href="/claims" data-nav="claims"><b>What Igneum does not claim</b><span>The limits, stated first.</span></a>
           <a href="/randomx" data-nav="randomx"><b>Igneum vs RandomX</b><span>What was kept and what was rebuilt for GPUs.</span></a>
@@ -174,7 +174,7 @@ blockquote{margin:10px 0;padding:10px 14px;border-left:3px solid var(--line-2);c
       <div class="sheet-group"><div class="sheet-head">Learn</div>
         <a href="/litepaper" data-nav="litepaper"><b>Litepaper</b><span>The design, as published.</span></a>
         <a href="/income" data-nav="income"><b>Income</b><span>What your card would mine, from the live network.</span></a>
-        <a href="/economics" data-nav="economics"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/acceptance" data-nav="acceptance"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
+        <a href="/economics" data-nav="economics"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/prize" data-nav="prize"><b>Prize</b><span>A better adversary or a reproduced shortcut, never a confirmation: the terms.</span></a><a href="/acceptance" data-nav="acceptance"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
         <a href="/ledger" data-nav="ledger" aria-current="page"><b>Ledger</b><span>Every criticism, answered or conceded.</span></a>
         <a href="/claims" data-nav="claims"><b>What Igneum does not claim</b><span>The limits, stated first.</span></a>
         <a href="/randomx" data-nav="randomx"><b>Igneum vs RandomX</b><span>What was kept and what was rebuilt for GPUs.</span></a>
diff --git a/site/lib/acceptance-render.mjs b/site/lib/acceptance-render.mjs
index 52fe6e9f8..123fac59f 100644
--- a/site/lib/acceptance-render.mjs
+++ b/site/lib/acceptance-render.mjs
@@ -1,5 +1,5 @@
 // The /acceptance page (8 October 2026): the Test and Acceptance Standard 1.0, case by case, rendered from ONE file,
-// docs/plans/igneum-2.0-test-registry.json (128 cases in 16 suites, the profiles P00 onward, the fixtures F0 onward).
+// docs/plans/igneum-2.0-test-registry.json (190 cases in 18 suites, the profiles P00 onward, the fixtures F0 onward).
 //
 // One source of truth for both renders. Every function below is a plain, self-contained function declaration: site/build.mjs
 // imports them to write the page at build time, and runtimeSource() prints the same functions (Function.prototype.toString)
diff --git a/site/light.html b/site/light.html
index 57db00eb3..62c6b78b1 100644
--- a/site/light.html
+++ b/site/light.html
@@ -137,7 +137,7 @@
         <div class="panel-list">
           <a href="/litepaper" data-nav="litepaper"><b>Litepaper</b><span>The design, as published.</span></a>
           <a href="/income" data-nav="income"><b>Income</b><span>What your card would mine, from the live network.</span></a>
-          <a href="/economics" data-nav="economics"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/acceptance" data-nav="acceptance"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
+          <a href="/economics" data-nav="economics"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/prize" data-nav="prize"><b>Prize</b><span>A better adversary or a reproduced shortcut, never a confirmation: the terms.</span></a><a href="/acceptance" data-nav="acceptance"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
           <a href="/ledger" data-nav="ledger"><b>Ledger</b><span>Every criticism, answered or conceded.</span></a>
           <a href="/claims" data-nav="claims"><b>What Igneum does not claim</b><span>The limits, stated first.</span></a>
           <a href="/randomx" data-nav="randomx"><b>Igneum vs RandomX</b><span>What was kept and what was rebuilt for GPUs.</span></a>
@@ -177,7 +177,7 @@
       <div class="sheet-group"><div class="sheet-head">Learn</div>
         <a href="/litepaper" data-nav="litepaper"><b>Litepaper</b><span>The design, as published.</span></a>
         <a href="/income" data-nav="income"><b>Income</b><span>What your card would mine, from the live network.</span></a>
-        <a href="/economics" data-nav="economics"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/acceptance" data-nav="acceptance"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
+        <a href="/economics" data-nav="economics"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/prize" data-nav="prize"><b>Prize</b><span>A better adversary or a reproduced shortcut, never a confirmation: the terms.</span></a><a href="/acceptance" data-nav="acceptance"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
         <a href="/ledger" data-nav="ledger"><b>Ledger</b><span>Every criticism, answered or conceded.</span></a>
         <a href="/claims" data-nav="claims"><b>What Igneum does not claim</b><span>The limits, stated first.</span></a>
         <a href="/randomx" data-nav="randomx"><b>Igneum vs RandomX</b><span>What was kept and what was rebuilt for GPUs.</span></a>
diff --git a/site/litepaper.html b/site/litepaper.html
index 7abf39aac..8fa5c9342 100644
--- a/site/litepaper.html
+++ b/site/litepaper.html
@@ -186,7 +186,7 @@ body.all .pager{display:none}
         <div class="panel-list">
           <a href="/litepaper" data-nav="litepaper" aria-current="page"><b>Litepaper</b><span>The design, as published.</span></a>
           <a href="/income" data-nav="income"><b>Income</b><span>What your card would mine, from the live network.</span></a>
-          <a href="/economics" data-nav="economics"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/acceptance" data-nav="acceptance"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
+          <a href="/economics" data-nav="economics"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/prize" data-nav="prize"><b>Prize</b><span>A better adversary or a reproduced shortcut, never a confirmation: the terms.</span></a><a href="/acceptance" data-nav="acceptance"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
           <a href="/ledger" data-nav="ledger"><b>Ledger</b><span>Every criticism, answered or conceded.</span></a>
           <a href="/claims" data-nav="claims"><b>What Igneum does not claim</b><span>The limits, stated first.</span></a>
           <a href="/randomx" data-nav="randomx"><b>Igneum vs RandomX</b><span>What was kept and what was rebuilt for GPUs.</span></a>
@@ -226,7 +226,7 @@ body.all .pager{display:none}
       <div class="sheet-group"><div class="sheet-head">Learn</div>
         <a href="/litepaper" data-nav="litepaper" aria-current="page"><b>Litepaper</b><span>The design, as published.</span></a>
         <a href="/income" data-nav="income"><b>Income</b><span>What your card would mine, from the live network.</span></a>
-        <a href="/economics" data-nav="economics"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/acceptance" data-nav="acceptance"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
+        <a href="/economics" data-nav="economics"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/prize" data-nav="prize"><b>Prize</b><span>A better adversary or a reproduced shortcut, never a confirmation: the terms.</span></a><a href="/acceptance" data-nav="acceptance"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
         <a href="/ledger" data-nav="ledger"><b>Ledger</b><span>Every criticism, answered or conceded.</span></a>
         <a href="/claims" data-nav="claims"><b>What Igneum does not claim</b><span>The limits, stated first.</span></a>
         <a href="/randomx" data-nav="randomx"><b>Igneum vs RandomX</b><span>What was kept and what was rebuilt for GPUs.</span></a>
@@ -480,12 +480,13 @@ body.all .pager{display:none}
         <p>Three statements, kept separate. The baseline is the hash as it stands under the scoring rule; rotation is an optional improvement to that baseline, not the mechanism the claim rests on.</p>
         <div class="tbl"><table><thead><tr><th>Statement</th><th>What it says</th><th>Label and date</th></tr></thead><tbody>
           <tr><td>Energy resistance</td><td>Per machine against a locked RTX 5090, node for node and a node ahead: the DRAM board 1.5x (1.3x to 1.7x) and 1.8x; the board with SRAM holding the hottest half of the dataset 1.9x to 2.1x and 2.4x to 2.6x; the SRAM-store die 2.3x and 3.1x; across the adversary’s lane-count choice the same-node bracket is 1.5x to 2.1x and a node ahead 1.8x to 2.6x, so about 2x on the same node stands at the bracket’s top; per dollar of hardware at list price 3x to 6x (modelled on the placed full 18-family core, routed 8 October 2026, and the 32-lane core’s synthesis). The honest tier moves to the next node with every GPU generation; a chip must tape out again. Whole machine per tier (synthesis with the SRAM band and node factors, claimed; placed rows to follow): the complete GDDR7 machine about 1.8x the RTX 5090 at its lock per joule node for node and 2.1x a node ahead; 1.6x and 1.9x the RTX 5080; 2.8x and 3.3x the Ada, Ampere and RX 9070 XT cohort; about 1.5x the Apple tier, reported, never headlined.</td><td>MODELLED: placed and routed core energies against the measured RTX 5090 lock row, 8 October 2026, no chip measured</td></tr>
-          <tr><td>Economic resistance</td><td>Whether a chip gets built depends on development cost, deployment economics and productive hardware lifetime. The first cut of the profitability surface: the price at which a project pays scales as the project cost over its share of the chain times its discounted life, and moves by under 5 percent with the per-joule edge; a fixed-lane chip under rotation needs 4x the price a programmable one needs. No threshold is the headline: the five-year coexistence model (Deliverable 4; its first run is <code>docs/analysis/class-v6/coexistence-model.md</code>, every row modelled) replaces any capex wall: the DRAM board passes six of its seven success conditions at a one to three year life; the SRAM die fails four conditions at its reconciled machine cost; the larger half of a chip's edge is capital cost per accepted hash, not joules. The result, as the model words it: A specialised supplier may earn a normal return; ordinary GPUs remain sufficiently close in total cost, widely obtainable and useful outside mining that new operators can still compete. On today's modelled rows that holds for the chip anyone can build, a stored-dataset board on commodity DRAM, at a productive life of one to three years: its cost per accepted unit of work sits within the range of the best GPU owner and entrant, it passes six of the seven conditions (a third of the network in boards now costs less than a year's revenue at the final hardware price), and a fleet of it holds a minority of the network with GPU entrants still setting the price. For the SRAM-store die the outcome turns on its hardware cost per unit of work, not its energy advantage: at the reconciled machine cost, set by the power train and the shadow core rather than the die, it fails the cost, hardware, fleet and margin conditions at every point of the band, a modest fleet holds about two fifths of a growing network and three fifths of a flat one on arrival and takes every flat or shrinking network within five years, and the only coexistence-shaped outcome is private supply in a growing network; what holds it is the investment decision, since its economics are project economics. A third design, a DRAM board with the hottest half of the dataset in on-board SRAM, sits between the two: it coexists only in a growing network at cheap GPU electricity and fails the cost conditions in a flat or shrinking one, and the dataset's size floor is a real lever on it where it was none on the SRAM die. What holds the die is the investment decision, not the hash; every chip figure here is modelled, not measured, and the chip's hardware cost per unit of work is approximate within 2x. The model holds under every market structure for the DRAM board (private supply, hardware sales, multiple suppliers, with no single supplier above a quarter of the network), and the SRAM die under none but private supply in a growing network; the thresholds live in the model's sensitivity workbook (<code>docs/analysis/class-v6/coexistence-workbook.md</code>), never on a page. A failure, reported as found: ECO-05, the standard’s coexistence sweep, was run on a register frozen before any result against a sourced revenue reference of USD 31.65 million a year of miner revenue (Ethereum Classic’s trailing year at its current era 6 reward) and FAILS the envelope as the chain stands. Of sixteen revenue and tariff worlds (a quarter, one, four and ten times the reference; electricity at 3, 10, 25 and 40 cents per kilowatt-hour) only one sustains new entry across two vendors, ten times the reference at 3 cents (about USD 316 million a year), because on this hash the measured AMD and Intel cards cost four to six times a Blackwell card per joule and never earn a new entrant’s purchase back at list price below that world; in that one world no specialised design sits inside the envelope against the whole cohort (the board on commodity DRAM is within the envelope only against the best Blackwell card, the die and the hybrid against no card of today’s), and the quarter-reference worlds at 25 and 40 cents are collapse worlds with no rational profitable operator. What moves the result is the specialist’s hardware cost per unit of work, the honest cards’ own efficiency on this hash, above all the AMD and Intel cards’ energy, and the dataset’s size floor; not a smaller network, a higher token price or any chip’s death. Reported as found; the register, the full result cube and the model are published for independent reproduction. (Labels: the register frozen at 18:37 UK on 8 October 2026, the reference corrected by a second public read and the run repeated with the verdict unchanged, the cube MODELLED on measured card rows, two cohort rows BLOCKED, the RX 7600’s knee and the Arc’s watts, their measurement running tonight; the registry row ECO-05 on /acceptance; the results file docs/analysis/class-v6/eco-05-results.md.)</td><td>MODELLED, the coexistence model's first run, 8 October 2026</td></tr>
+          <tr><td>Economic resistance</td><td>Whether a chip gets built depends on development cost, deployment economics and productive hardware lifetime. The first cut of the profitability surface: the price at which a project pays scales as the project cost over its share of the chain times its discounted life, and moves by under 5 percent with the per-joule edge; a fixed-lane chip under rotation needs 4x the price a programmable one needs. No threshold is the headline: the five-year coexistence model (Deliverable 4; its first run is <code>docs/analysis/class-v6/coexistence-model.md</code>, every row modelled) replaces any capex wall: the DRAM board passes six of its seven success conditions at a one to three year life; the SRAM die fails four conditions at its reconciled machine cost; the larger half of a chip's edge is capital cost per accepted hash, not joules. The result, as the model words it: A specialised supplier may earn a normal return; ordinary GPUs remain sufficiently close in total cost, widely obtainable and useful outside mining that new operators can still compete. On today's modelled rows that holds for the chip anyone can build, a stored-dataset board on commodity DRAM, at a productive life of one to three years: its cost per accepted unit of work sits within the range of the best GPU owner and entrant, it passes six of the seven conditions (a third of the network in boards now costs less than a year's revenue at the final hardware price), and a fleet of it holds a minority of the network with GPU entrants still setting the price. For the SRAM-store die the outcome turns on its hardware cost per unit of work, not its energy advantage: at the reconciled machine cost, set by the power train and the shadow core rather than the die, it fails the cost, hardware, fleet and margin conditions at every point of the band, a modest fleet holds about two fifths of a growing network and three fifths of a flat one on arrival and takes every flat or shrinking network within five years, and the only coexistence-shaped outcome is private supply in a growing network; what holds it is the investment decision, since its economics are project economics. A third design, a DRAM board with the hottest half of the dataset in on-board SRAM, sits between the two: it coexists only in a growing network at cheap GPU electricity and fails the cost conditions in a flat or shrinking one, and the dataset's size floor is a real lever on it where it was none on the SRAM die. What holds the die is the investment decision, not the hash; every chip figure here is modelled, not measured, and the chip's hardware cost per unit of work is approximate within 2x. The model holds under every market structure for the DRAM board (private supply, hardware sales, multiple suppliers, with no single supplier above a quarter of the network), and the SRAM die under none but private supply in a growing network; the thresholds live in the model's sensitivity workbook (<code>docs/analysis/class-v6/coexistence-workbook.md</code>), never on a page. A failure, reported as found: ECO-05, the standard’s coexistence sweep, was run on a register frozen before any result against a sourced revenue reference of USD 31.65 million a year of miner revenue (Ethereum Classic’s trailing year at its current era 6 reward) and FAILS the envelope as the chain stands. Of sixteen revenue and tariff worlds (a quarter, one, four and ten times the reference; electricity at 3, 10, 25 and 40 cents per kilowatt-hour) one sustains new entry across two vendors on the measured cards, ten times the reference at 3 cents (about USD 316 million a year), and a second, ten times the reference at 10 cents, on the RX 7600’s modelled efficiency point, which the metered row due in the morning keeps at or below 5.4 microjoules per hash and takes away above about 5.6; the cause is that on this hash the measured AMD and Intel cards cost four to six times a Blackwell card per joule and never earn a new entrant’s purchase back at list price below those worlds; the verdict is FAIL either way; in those worlds no specialised design sits inside the envelope against the whole cohort (the board on commodity DRAM is within the envelope only against the best Blackwell card, the die and the hybrid against no card of today’s), and the quarter-reference worlds at 25 and 40 cents are collapse worlds with no rational profitable operator. What moves the result is the specialist’s hardware cost per unit of work, the honest cards’ own efficiency on this hash, above all the AMD and Intel cards’ energy, and the dataset’s size floor; not a smaller network, a higher token price or any chip’s death. Reported as found; the register, the full result cube and the model are published for independent reproduction. (Labels: the register frozen at 18:37 UK on 8 October 2026, the reference corrected by a second public read and the run repeated with the verdict unchanged, the cube MODELLED on measured card rows, two cohort rows BLOCKED, the RX 7600’s knee and the Arc’s watts, their measurement running tonight; the registry row ECO-05 on /acceptance; the results file docs/analysis/class-v6/eco-05-results.md.)</td><td>MODELLED, the coexistence model's first run, 8 October 2026</td></tr>
           <tr><td>Response capability</td><td>Rotation is an optional improvement, not the mechanism. A passed rotation boundary proves the rotation works, not that hardware dies. The schedule: a new program every hour, a parameter era every week, a family epoch every 180 days, an emergency vote when miners call one. Rotation costs a chip versatility, not life: the family bank is firmware plus about 43 percent of core cells, and no transition carries an obsolescence credit (modelled).</td><td>measured per boundary, 8 October 2026; the family-bank cost modelled, 8 October 2026</td></tr>
         </tbody></table></div>
         <p>What a miner sees from this. Class v4 costs a 5090 145 W more unlocked, 88 W more at a 1,400 MHz core lock and 82 W at the best operating points (class v4 at 1,200 MHz, class v3 at 1,300; the knee is 1,300 MHz on both), for 0.2 percent more rate (measured, 7 October 2026; the 80 W read on 6 October was at the app's tuned cap); an M5 Max 16 W more for 1.5 percent, an RX 9070 XT and an RTX 4070 nothing (measured, 6 October 2026). The ladder that sets how much work rides in the shadow starts at rung 0 at genesis and climbs by miner signal; its third rung is inadmissible today because a server core verifies it in 10.85 ms, over the gate (measured, 7 October 2026). The devnet runs class v4 from its first block. Classes rotate on findings and at least yearly; a class change is a release activated by block height. Class v5 is built to cross by height; its dataset keyed by the chain's own state is under evaluation (Deliverable 3) and is not counted as a defence until justified. Class v6 is the design in progress (opened 8 October 2026), with four layers as its spine: per-era draws of the parameters a release now fixes, a dataset whose size tracks the chain state (under evaluation, Deliverable 3), scheduled family epochs by height, and the acceptance floor generalised to every era’s draw. The next test of the model is an internal adversarial pass, not an independent review: three lanes that have never worked on the hash code attack the mixer, the chained cache and the acceptance rule with only what an outsider has (the public kit, the frozen object, the spec, the harnesses) and publish the break or the bound they reach. No outside review has run yet.</p>
         <p>No hash has stayed free of chips forever. Igneum does not claim to. It states the gain its own model finds, the economics and the response capability, each separately, and each carries its label. The precedents, as sourced (nameplate and community tables, about 20 percent either way; every figure with its URL and date in the close): Monero has run on RandomX since November 2019, its rules stable since then and its programs varying per hash; one chip shipped against it, Bitmain’s Antminer X5 (September 2023), 46 months after the fork, at 6.37 J per kH at the wall against a stated CPU measurement, an observed comparison, not a ceiling. Bitmain opened Antminer X9 pre-orders on 26 December 2025 for July 2026 delivery, then withdrew the product in mid-May 2026 and refunded buyers before any unit shipped; none has been independently benchmarked. RandomX v2 was released on 25 March 2026 with its mainnet activation pending. Ethash ran 36 months to a first chip worse than a GPU; the iPollo V2H reads about 14x today. Kaspa ran 21 months to its first chip, at 167x to 725x. The commodity cohort Igneum protects is the discrete-GPU population; the Apple row is reported beside it, never as the headline.</p>
         <p><b>The reference population and the cost per accepted unit of work.</b> The reference population is the discrete-GPU classes the network protects, from the RTX 5090 to the RX 7600 8 GB and the Arc B580, with Apple reported beside them; for each the table gives the cost per accepted unit of work for an existing owner (power, wear, fees, over accepted work) and for a new entrant (purchase at list and street price, two years of operation, resale), at three electricity prices, with every figure labelled measured or modelled. On today’s rows the cheapest honest owner is a 16 GB Blackwell card at its efficiency point and the cheapest entrant the same card at list price; the specialised board on commodity DRAM costs more per accepted unit than any owner and sits between the entrant’s list and street figures. The chip rows carry “modelled, hardware cost approximate within 2x”; no thresholds, no chip percentages (<a href="https://git.igneum.network/igneum-network/igneum/src/branch/master/docs/analysis/class-v6/reference-population.md">the table</a>, floor lane 3 for the research lane, 8 October 2026).</p>
+        <p><b>The disclosure prize.</b> A placed or measured adversarial implementation that beats the served bracket under the one acceptance rule, or a reproduced shortcut in the served kit, earns <a href="/prize">the disclosure prize</a>; a confirmation does not. The terms are on that page; the amount is the founder’s and is served when set.</p>
         <p><b>The scoring rule and the harness.</b> The edge is the minimum over workloads of the maximum over free adversarial designs of the GPU’s joules per hash over the adversary’s, under four conditions: the 10 percent GPU-cost budget at the lock, the verifier limit, cross-vendor correctness and hardware accessibility. The rejected designs stand as negative controls with their measured rows: the long program, the select tree, the wide read, the scratchpad. The two architectural experiments are closed as failures and stay as regression controls: the mixed integer and FP32 branch (measured, 8 October 2026: 15 to 26 percent more card energy per hash against the 10 percent budget) and the connected-state reorganisation (8 October 2026: only the window width reaches the chip). The multi-family programmable adversary (Deliverable 3) is open; rotation is not expected to deliver the missing joule. <a href="https://git.igneum.network/igneum-network/igneum/src/branch/master/docs/design/class-v6-rotating-family.md">The scoring rules and every row, section 10</a>. <a href="https://git.igneum.network/igneum-network/igneum/src/branch/class-v5/docs/design/class-v5-harness/">The harness</a> and <a href="https://git.igneum.network/igneum-network/igneum/src/branch/class-v5/docs/design/class-v5-stored-state.md">its readings</a> (measured, 8 October 2026): the acceptance floor at 0.995 refuses nine of nine hot sets (0.9809 to 0.9919) and 2.435 percent of 4,600 drawn programs, 0 of 61 in the era reading (section 14); the attack families F8, F4, F9 and F1 pass, F8 with a residue of 61 of 64 (section 13); the attempts census and the attempt-3 read (section 0).</p>
         <p>One thing takes a person, here and on every chain that exists: writing new code. A chain cannot safely write its own generator, and it cannot safely tell a chip from a wave of honest new cards by hashrate alone. If the design above ever failed, anyone could publish a new generator and miners would switch it on by signalling, as Monero's community can fork. Igneum is built to make that day unlikely, and does not depend on avoiding it.</p>
       </section>
diff --git a/site/live.html b/site/live.html
index 60937af2c..60a955178 100644
--- a/site/live.html
+++ b/site/live.html
@@ -270,7 +270,7 @@ details.tablebar summary{display:flex;align-items:center}
         <div class="panel-list">
           <a href="/litepaper" data-nav="litepaper"><b>Litepaper</b><span>The design, as published.</span></a>
           <a href="/income" data-nav="income"><b>Income</b><span>What your card would mine, from the live network.</span></a>
-          <a href="/economics" data-nav="economics"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/acceptance" data-nav="acceptance"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
+          <a href="/economics" data-nav="economics"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/prize" data-nav="prize"><b>Prize</b><span>A better adversary or a reproduced shortcut, never a confirmation: the terms.</span></a><a href="/acceptance" data-nav="acceptance"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
           <a href="/ledger" data-nav="ledger"><b>Ledger</b><span>Every criticism, answered or conceded.</span></a>
           <a href="/claims" data-nav="claims"><b>What Igneum does not claim</b><span>The limits, stated first.</span></a>
           <a href="/randomx" data-nav="randomx"><b>Igneum vs RandomX</b><span>What was kept and what was rebuilt for GPUs.</span></a>
@@ -310,7 +310,7 @@ details.tablebar summary{display:flex;align-items:center}
       <div class="sheet-group"><div class="sheet-head">Learn</div>
         <a href="/litepaper" data-nav="litepaper"><b>Litepaper</b><span>The design, as published.</span></a>
         <a href="/income" data-nav="income"><b>Income</b><span>What your card would mine, from the live network.</span></a>
-        <a href="/economics" data-nav="economics"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/acceptance" data-nav="acceptance"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
+        <a href="/economics" data-nav="economics"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/prize" data-nav="prize"><b>Prize</b><span>A better adversary or a reproduced shortcut, never a confirmation: the terms.</span></a><a href="/acceptance" data-nav="acceptance"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
         <a href="/ledger" data-nav="ledger"><b>Ledger</b><span>Every criticism, answered or conceded.</span></a>
         <a href="/claims" data-nav="claims"><b>What Igneum does not claim</b><span>The limits, stated first.</span></a>
         <a href="/randomx" data-nav="randomx"><b>Igneum vs RandomX</b><span>What was kept and what was rebuilt for GPUs.</span></a>
diff --git a/site/metamask.html b/site/metamask.html
index 716dc2727..a0e40840c 100644
--- a/site/metamask.html
+++ b/site/metamask.html
@@ -131,7 +131,7 @@ ol{margin:0 0 14px;padding-left:22px}li{margin-bottom:6px}
         <div class="panel-list">
           <a href="/litepaper" data-nav="litepaper"><b>Litepaper</b><span>The design, as published.</span></a>
           <a href="/income" data-nav="income"><b>Income</b><span>What your card would mine, from the live network.</span></a>
-          <a href="/economics" data-nav="economics"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/acceptance" data-nav="acceptance"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
+          <a href="/economics" data-nav="economics"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/prize" data-nav="prize"><b>Prize</b><span>A better adversary or a reproduced shortcut, never a confirmation: the terms.</span></a><a href="/acceptance" data-nav="acceptance"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
           <a href="/ledger" data-nav="ledger"><b>Ledger</b><span>Every criticism, answered or conceded.</span></a>
           <a href="/claims" data-nav="claims"><b>What Igneum does not claim</b><span>The limits, stated first.</span></a>
           <a href="/randomx" data-nav="randomx"><b>Igneum vs RandomX</b><span>What was kept and what was rebuilt for GPUs.</span></a>
@@ -171,7 +171,7 @@ ol{margin:0 0 14px;padding-left:22px}li{margin-bottom:6px}
       <div class="sheet-group"><div class="sheet-head">Learn</div>
         <a href="/litepaper" data-nav="litepaper"><b>Litepaper</b><span>The design, as published.</span></a>
         <a href="/income" data-nav="income"><b>Income</b><span>What your card would mine, from the live network.</span></a>
-        <a href="/economics" data-nav="economics"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/acceptance" data-nav="acceptance"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
+        <a href="/economics" data-nav="economics"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/prize" data-nav="prize"><b>Prize</b><span>A better adversary or a reproduced shortcut, never a confirmation: the terms.</span></a><a href="/acceptance" data-nav="acceptance"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
         <a href="/ledger" data-nav="ledger"><b>Ledger</b><span>Every criticism, answered or conceded.</span></a>
         <a href="/claims" data-nav="claims"><b>What Igneum does not claim</b><span>The limits, stated first.</span></a>
         <a href="/randomx" data-nav="randomx"><b>Igneum vs RandomX</b><span>What was kept and what was rebuilt for GPUs.</span></a>
diff --git a/site/miner.html b/site/miner.html
index 880f46335..b45fe4ce3 100644
--- a/site/miner.html
+++ b/site/miner.html
@@ -126,7 +126,7 @@ pre b{color:var(--molten-text);font-weight:500}
         <div class="panel-list">
           <a href="/litepaper" data-nav="litepaper"><b>Litepaper</b><span>The design, as published.</span></a>
           <a href="/income" data-nav="income"><b>Income</b><span>What your card would mine, from the live network.</span></a>
-          <a href="/economics" data-nav="economics"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/acceptance" data-nav="acceptance"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
+          <a href="/economics" data-nav="economics"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/prize" data-nav="prize"><b>Prize</b><span>A better adversary or a reproduced shortcut, never a confirmation: the terms.</span></a><a href="/acceptance" data-nav="acceptance"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
           <a href="/ledger" data-nav="ledger"><b>Ledger</b><span>Every criticism, answered or conceded.</span></a>
           <a href="/claims" data-nav="claims"><b>What Igneum does not claim</b><span>The limits, stated first.</span></a>
           <a href="/randomx" data-nav="randomx"><b>Igneum vs RandomX</b><span>What was kept and what was rebuilt for GPUs.</span></a>
@@ -166,7 +166,7 @@ pre b{color:var(--molten-text);font-weight:500}
       <div class="sheet-group"><div class="sheet-head">Learn</div>
         <a href="/litepaper" data-nav="litepaper"><b>Litepaper</b><span>The design, as published.</span></a>
         <a href="/income" data-nav="income"><b>Income</b><span>What your card would mine, from the live network.</span></a>
-        <a href="/economics" data-nav="economics"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/acceptance" data-nav="acceptance"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
+        <a href="/economics" data-nav="economics"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/prize" data-nav="prize"><b>Prize</b><span>A better adversary or a reproduced shortcut, never a confirmation: the terms.</span></a><a href="/acceptance" data-nav="acceptance"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
         <a href="/ledger" data-nav="ledger"><b>Ledger</b><span>Every criticism, answered or conceded.</span></a>
         <a href="/claims" data-nav="claims"><b>What Igneum does not claim</b><span>The limits, stated first.</span></a>
         <a href="/randomx" data-nav="randomx"><b>Igneum vs RandomX</b><span>What was kept and what was rebuilt for GPUs.</span></a>
@@ -283,8 +283,8 @@ pre b{color:var(--molten-text);font-weight:500}
         <div class="platform-body" id="panel-windows" role="tabpanel" aria-labelledby="tab-windows" data-platform-panel="windows">
           <div class="download-platform"><span class="osmark" data-os="windows" title="Windows"><svg viewBox="0 0 24 24" width="22" height="22" aria-hidden="true" focusable="false" fill="currentColor"><path d="M3 5.6l7.3-1v7.1H3zM11.4 4.4L21 3v8.7h-9.6zM3 12.3h7.3v7.1L3 18.4zM11.4 12.3H21V21l-9.6-1.4z"/></svg></span><div><h3>Ember for Windows</h3><p>the installer, from the signed manifest</p></div></div>
           <p class="download-note">Run the installer, press Start. NVIDIA and AMD cards both mine. Setting an NVIDIA power cap asks for administrator rights once.</p>
-          <a data-dl="miner-windows" href="https://dl.igneum.network/public/igneum-miner-windows.exe" class="btn primary"><svg class="icon" viewBox="0 0 24 24" aria-hidden="true"><path d="M12 3v12m-5-5 5 5 5-5M5 16v4h14v-4"/></svg>Download for Windows <span data-dl-meta="miner-windows" style="font-weight:400;opacity:.85">v2.0.0 · 63.8 MB</span></a>
-          <div class="download-detail"><span>from dl.igneum.network</span><span>sha256 <span data-dl-sha="miner-windows">793a631dc2084e6d6f778f13602d674a0c134af746b6355c25d3998c2be18b79</span></span></div>
+          <a data-dl="miner-windows" href="https://dl.igneum.network/public/igneum-miner-windows.exe" class="btn primary"><svg class="icon" viewBox="0 0 24 24" aria-hidden="true"><path d="M12 3v12m-5-5 5 5 5-5M5 16v4h14v-4"/></svg>Download for Windows <span data-dl-meta="miner-windows" style="font-weight:400;opacity:.85">v2.0.1 · 63.8 MB</span></a>
+          <div class="download-detail"><span>from dl.igneum.network</span><span>sha256 <span data-dl-sha="miner-windows">ce6bb00cd738fa08348fd8121781479109a5b2c2059a04fe7c22ad7aa3f12bf9</span></span></div>
         </div>
         <div class="platform-body" id="panel-mac" role="tabpanel" aria-labelledby="tab-mac" data-platform-panel="mac" hidden>
           <div class="download-platform"><span class="osmark" data-os="mac" title="macOS"><svg viewBox="0 0 24 24" width="22" height="22" aria-hidden="true" focusable="false" fill="currentColor"><path d="M16.4 12.6c0-2.5 2-3.6 2.1-3.7-1.2-1.7-3-1.9-3.6-2-1.5-.2-3 .9-3.8.9-.8 0-2-.9-3.3-.8-1.7 0-3.2 1-4.1 2.5-1.8 3-.5 7.6 1.3 10.1.9 1.2 1.9 2.6 3.2 2.5 1.3 0 1.8-.8 3.3-.8 1.6 0 2 .8 3.3.8 1.4 0 2.3-1.2 3.1-2.5 1-1.4 1.4-2.8 1.4-2.9 0 0-2.7-1-2.9-4.1zM13.9 5.3c.7-.8 1.2-2 1-3.2-1 0-2.2.7-2.9 1.5-.6.7-1.2 1.9-1 3 1.1.1 2.2-.5 2.9-1.3z"/></svg></span><div><h3>Ember for macOS</h3><p>a disk image, Apple silicon, Metal</p></div></div>
@@ -297,7 +297,7 @@ pre b{color:var(--molten-text);font-weight:500}
           <div class="download-platform"><span class="osmark" data-os="hive" title="HiveOS"><svg viewBox="0 0 24 24" width="22" height="22" aria-hidden="true" focusable="false" fill="none" stroke="currentColor" stroke-width="1.7" stroke-linejoin="round" stroke-linecap="round"><path d="M12 2.6 20.2 7.3v9.4L12 21.4 3.8 16.7V7.3z"/><path d="M12 7.4 16 9.7v4.6L12 16.6 8 14.3V9.7z"/><path d="M12 7.4V2.6M16 9.7l4.2-2.4M16 14.3l4.2 2.4M12 16.6v4.8M8 14.3l-4.2 2.4M8 9.7 3.8 7.3"/></svg></span><div><h3>Ember for Linux and HiveOS</h3><p>a tarball for rigs and Hive flight sheets</p></div></div>
           <p class="download-note">For the rig people. One tarball, the miner and the node inside, the same signed manifest as the desktop apps.</p>
           <a data-dl="miner-hive" href="https://dl.igneum.network/public/igneum-miner-hive.tar.gz" class="btn primary"><svg class="icon" viewBox="0 0 24 24" aria-hidden="true"><path d="M12 3v12m-5-5 5 5 5-5M5 16v4h14v-4"/></svg>Download the tarball <span data-dl-meta="miner-hive" style="font-weight:400;opacity:.85">v2.0.1 · 52.7 MB</span></a>
-          <p class="fair" id="versions">Current build: Windows <span data-rm="versions.miner-windows.version">2.0.0</span>, macOS <span data-rm="versions.miner-mac.version">2.0.1</span>, HiveOS <span data-rm="versions.miner-hive.version">2.0.1</span>, the wallet <span data-rm="versions.wallet-mac.version">0.1.6</span>, <span data-rm="read_at_short">read 8 October 2026, 17:2x UK</span>. The machine-readable list, with every file’s SHA-256, is <a href="/release.json">/release.json</a>.</p>
+          <p class="fair" id="versions">Current build: Windows <span data-rm="versions.miner-windows.version">2.0.1</span>, macOS <span data-rm="versions.miner-mac.version">2.0.1</span>, HiveOS <span data-rm="versions.miner-hive.version">2.0.1</span>, the wallet <span data-rm="versions.wallet-mac.version">0.1.6</span>, <span data-rm="read_at_short">read 8 October 2026, 17:2x UK</span>. The machine-readable list, with every file’s SHA-256, is <a href="/release.json">/release.json</a>.</p>
           <div class="hive-sheet" id="hive"><b>HiveOS Flight Sheet.</b> Miner: <b>Custom</b>. Installation URL: <code data-dl-url="miner-hive">https://dl.igneum.network/dl/public/igneum-hive-2.0.1.tar.gz</code>. Miner name <code>igneum</code>, wallet and worker <code>0x&lt;your 40-hex payout address&gt;.%WORKER_NAME%</code>. Hive itself is untested on our side: tell us what breaks.</div>
           <p class="sha">sha256 <span data-dl-sha="miner-hive">a16add6a9082747bc11d9bb9a69d193530f723dd2671fe1352ad59b1ae0a46ab</span></p>
         </div>
@@ -459,7 +459,7 @@ pre b{color:var(--molten-text);font-weight:500}
   </div>
 </div>
 
-<a class="dl-bar" href="#get"><b>Download the miner</b><span data-dl-meta="miner-windows">v2.0.0 · 63.8 MB</span></a>
+<a class="dl-bar" href="#get"><b>Download the miner</b><span data-dl-meta="miner-windows">v2.0.1 · 63.8 MB</span></a>
 
 <!-- footer:start -->
 <footer class="site-footer">
diff --git a/site/miners.html b/site/miners.html
index 7b8620c97..836c80084 100644
--- a/site/miners.html
+++ b/site/miners.html
@@ -130,7 +130,7 @@ table{min-width:560px}
         <div class="panel-list">
           <a href="/litepaper" data-nav="litepaper"><b>Litepaper</b><span>The design, as published.</span></a>
           <a href="/income" data-nav="income"><b>Income</b><span>What your card would mine, from the live network.</span></a>
-          <a href="/economics" data-nav="economics"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/acceptance" data-nav="acceptance"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
+          <a href="/economics" data-nav="economics"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/prize" data-nav="prize"><b>Prize</b><span>A better adversary or a reproduced shortcut, never a confirmation: the terms.</span></a><a href="/acceptance" data-nav="acceptance"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
           <a href="/ledger" data-nav="ledger"><b>Ledger</b><span>Every criticism, answered or conceded.</span></a>
           <a href="/claims" data-nav="claims"><b>What Igneum does not claim</b><span>The limits, stated first.</span></a>
           <a href="/randomx" data-nav="randomx"><b>Igneum vs RandomX</b><span>What was kept and what was rebuilt for GPUs.</span></a>
@@ -170,7 +170,7 @@ table{min-width:560px}
       <div class="sheet-group"><div class="sheet-head">Learn</div>
         <a href="/litepaper" data-nav="litepaper"><b>Litepaper</b><span>The design, as published.</span></a>
         <a href="/income" data-nav="income"><b>Income</b><span>What your card would mine, from the live network.</span></a>
-        <a href="/economics" data-nav="economics"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/acceptance" data-nav="acceptance"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
+        <a href="/economics" data-nav="economics"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/prize" data-nav="prize"><b>Prize</b><span>A better adversary or a reproduced shortcut, never a confirmation: the terms.</span></a><a href="/acceptance" data-nav="acceptance"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
         <a href="/ledger" data-nav="ledger"><b>Ledger</b><span>Every criticism, answered or conceded.</span></a>
         <a href="/claims" data-nav="claims"><b>What Igneum does not claim</b><span>The limits, stated first.</span></a>
         <a href="/randomx" data-nav="randomx"><b>Igneum vs RandomX</b><span>What was kept and what was rebuilt for GPUs.</span></a>
diff --git a/site/og/pages.mjs b/site/og/pages.mjs
index 02609ed92..f49b8313c 100644
--- a/site/og/pages.mjs
+++ b/site/og/pages.mjs
@@ -30,10 +30,11 @@ export const CARDS = {
   faucet:    { kicker: 'Devnet faucet', title: 'Test IGN, for building.', sub: 'Paste an address. Get a transaction hash.', route: 'igneum.network/faucet' },
   economics: { kicker: 'Economics', title: 'The economics, as the node encodes them.', sub: 'The emission, the split, the fees, each with its file and line.', route: 'igneum.network/economics' },
   scorecard: { kicker: 'Scorecard', title: 'Evidence for every gate.', sub: 'Twelve acceptance gates, the evidence each needs, what never stands in for it.', route: 'igneum.network/scorecard' },
+  prize: { kicker: 'Prize', title: 'A better adversary, or a reproduced shortcut.', sub: 'A finding that moves the bracket earns it. A confirmation does not.', route: 'igneum.network/prize' },
   tuning: { kicker: 'Tuning', title: 'The knee rule, measured.', sub: 'How Ember reaches a good operating point, every figure a dated row.', route: 'igneum.network/tuning' },
   audit:     { kicker: 'Site audit', title: 'Every page, audited.', sub: 'What the reset changed, what was rewritten, what is open.', route: 'igneum.network/audit' },
   docs:      { kicker: 'Documents', title: 'The plan, the standard, the evidence.', sub: 'Every document by its path on the public repository.', route: 'igneum.network/docs' },
-  acceptance: { kicker: 'Acceptance', title: 'Shown as they pass.', sub: 'The Test and Acceptance Standard, 128 cases in 16 suites, case by case.', route: 'igneum.network/acceptance' },
+  acceptance: { kicker: 'Acceptance', title: 'Shown as they pass.', sub: 'The Test and Acceptance Standard, 190 cases in 18 suites, case by case.', route: 'igneum.network/acceptance' },
   litepaper: { kicker: 'Litepaper', title: 'Mined by GPUs. Proven by fire.', sub: 'The hourly GPU lottery, blocks proven by miners, miner-only finality.', route: 'igneum.network/litepaper' },
   light:     { kicker: 'Light wallet', title: 'A balance your browser proves.', sub: 'Certificate, headers and account proof, recomputed in the tab.', route: 'igneum.network/light' },
   receipt:   { kicker: 'Inclusion receipt', title: 'A receipt any third party re-verifies.', sub: 'Proven against the finality certificate. Checked offline with one file.', route: 'igneum.network/receipt' },
diff --git a/site/oracle.html b/site/oracle.html
index 4ce73a4d8..5ad098836 100644
--- a/site/oracle.html
+++ b/site/oracle.html
@@ -137,7 +137,7 @@
         <div class="panel-list">
           <a href="/litepaper" data-nav="litepaper"><b>Litepaper</b><span>The design, as published.</span></a>
           <a href="/income" data-nav="income"><b>Income</b><span>What your card would mine, from the live network.</span></a>
-          <a href="/economics" data-nav="economics"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/acceptance" data-nav="acceptance"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
+          <a href="/economics" data-nav="economics"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/prize" data-nav="prize"><b>Prize</b><span>A better adversary or a reproduced shortcut, never a confirmation: the terms.</span></a><a href="/acceptance" data-nav="acceptance"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
           <a href="/ledger" data-nav="ledger"><b>Ledger</b><span>Every criticism, answered or conceded.</span></a>
           <a href="/claims" data-nav="claims"><b>What Igneum does not claim</b><span>The limits, stated first.</span></a>
           <a href="/randomx" data-nav="randomx"><b>Igneum vs RandomX</b><span>What was kept and what was rebuilt for GPUs.</span></a>
@@ -177,7 +177,7 @@
       <div class="sheet-group"><div class="sheet-head">Learn</div>
         <a href="/litepaper" data-nav="litepaper"><b>Litepaper</b><span>The design, as published.</span></a>
         <a href="/income" data-nav="income"><b>Income</b><span>What your card would mine, from the live network.</span></a>
-        <a href="/economics" data-nav="economics"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/acceptance" data-nav="acceptance"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
+        <a href="/economics" data-nav="economics"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/prize" data-nav="prize"><b>Prize</b><span>A better adversary or a reproduced shortcut, never a confirmation: the terms.</span></a><a href="/acceptance" data-nav="acceptance"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
         <a href="/ledger" data-nav="ledger"><b>Ledger</b><span>Every criticism, answered or conceded.</span></a>
         <a href="/claims" data-nav="claims"><b>What Igneum does not claim</b><span>The limits, stated first.</span></a>
         <a href="/randomx" data-nav="randomx"><b>Igneum vs RandomX</b><span>What was kept and what was rebuilt for GPUs.</span></a>
diff --git a/site/partials/nav.html b/site/partials/nav.html
index 33728f17c..afbe2ad07 100644
--- a/site/partials/nav.html
+++ b/site/partials/nav.html
@@ -45,7 +45,7 @@
         <div class="panel-list">
           <a href="/litepaper" data-nav="litepaper"><b>Litepaper</b><span>The design, as published.</span></a>
           <a href="/income" data-nav="income"><b>Income</b><span>What your card would mine, from the live network.</span></a>
-          <a href="/economics" data-nav="economics"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/acceptance" data-nav="acceptance"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
+          <a href="/economics" data-nav="economics"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/prize" data-nav="prize"><b>Prize</b><span>A better adversary or a reproduced shortcut, never a confirmation: the terms.</span></a><a href="/acceptance" data-nav="acceptance"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
           <a href="/ledger" data-nav="ledger"><b>Ledger</b><span>Every criticism, answered or conceded.</span></a>
           <a href="/claims" data-nav="claims"><b>What Igneum does not claim</b><span>The limits, stated first.</span></a>
           <a href="/randomx" data-nav="randomx"><b>Igneum vs RandomX</b><span>What was kept and what was rebuilt for GPUs.</span></a>
@@ -85,7 +85,7 @@
       <div class="sheet-group"><div class="sheet-head">Learn</div>
         <a href="/litepaper" data-nav="litepaper"><b>Litepaper</b><span>The design, as published.</span></a>
         <a href="/income" data-nav="income"><b>Income</b><span>What your card would mine, from the live network.</span></a>
-        <a href="/economics" data-nav="economics"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/acceptance" data-nav="acceptance"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
+        <a href="/economics" data-nav="economics"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/prize" data-nav="prize"><b>Prize</b><span>A better adversary or a reproduced shortcut, never a confirmation: the terms.</span></a><a href="/acceptance" data-nav="acceptance"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
         <a href="/ledger" data-nav="ledger"><b>Ledger</b><span>Every criticism, answered or conceded.</span></a>
         <a href="/claims" data-nav="claims"><b>What Igneum does not claim</b><span>The limits, stated first.</span></a>
         <a href="/randomx" data-nav="randomx"><b>Igneum vs RandomX</b><span>What was kept and what was rebuilt for GPUs.</span></a>
diff --git a/site/prize.html b/site/prize.html
new file mode 100644
index 000000000..3bdd60635
--- /dev/null
+++ b/site/prize.html
@@ -0,0 +1,307 @@
+<!doctype html>
+<html lang="en">
+<head>
+<meta charset="utf-8">
+<meta name="viewport" content="width=device-width, initial-scale=1, viewport-fit=cover">
+<title>Igneum disclosure prize: terms</title>
+<meta name="description" content="The disclosure prize: what it pays for (a placed or measured adversarial implementation that beats the served bracket, or a reproduced shortcut in the served kit), what it does not, how a claim is made and judged, and the amount, set by the founder.">
+<link rel="canonical" href="https://igneum.network/prize">
+<!-- share:start -->
+<meta property="og:type" content="website">
+<meta property="og:site_name" content="Igneum">
+<meta property="og:title" content="Igneum disclosure prize: terms">
+<meta property="og:description" content="The disclosure prize: what it pays for (a placed or measured adversarial implementation that beats the served bracket, or a reproduced shortcut in the served kit), what it does not, how a claim is made and judged, and the amount, set by the founder.">
+<meta property="og:url" content="https://igneum.network/prize">
+<meta property="og:image" content="https://igneum.network/og/home.png?v=4">
+<meta property="og:image:type" content="image/png">
+<meta property="og:image:width" content="1200">
+<meta property="og:image:height" content="630">
+<meta property="og:image:alt" content="The GPU-mined chain that proves every block. igneum.network">
+<meta property="og:image" content="https://igneum.network/og/home-square.png?v=4">
+<meta property="og:image:type" content="image/png">
+<meta property="og:image:width" content="1200">
+<meta property="og:image:height" content="1200">
+<meta property="og:image:alt" content="The GPU-mined chain that proves every block. igneum.network">
+<meta name="twitter:card" content="summary_large_image">
+<meta name="twitter:title" content="Igneum disclosure prize: terms">
+<meta name="twitter:description" content="The disclosure prize: what it pays for (a placed or measured adversarial implementation that beats the served bracket, or a reproduced shortcut in the served kit), what it does not, how a claim is made and judged, and the amount, set by the founder.">
+<meta name="twitter:image" content="https://igneum.network/og/home.png?v=4">
+<meta name="twitter:image:alt" content="The GPU-mined chain that proves every block. igneum.network">
+<!-- share:end -->
+<!-- head:start -->
+<link rel="preload" href="/fonts/unbounded-900.woff2" as="font" type="font/woff2" crossorigin>
+<link rel="preload" href="/fonts/plex-sans-400.woff2" as="font" type="font/woff2" crossorigin>
+<meta name="color-scheme" content="dark light">
+<link rel="stylesheet" href="/site.css">
+<style>
+/* Shared by every page: the head partial, injected by the build between the head markers. Edit the partial, not the page. */
+/* Fonts, self-hosted (latin subsets, OFL): Unbounded 500/700/900, IBM Plex Sans 400/500/600, IBM Plex Mono 400/500. Fallbacks carry size and ascent overrides so the swap does not move the layout. The tokens, type and components are in /site.css (docs/plans/site-ui-3.md). */
+@font-face{font-family:'Unbounded';font-style:normal;font-weight:500;font-display:swap;src:url(/fonts/unbounded-500.woff2) format('woff2');unicode-range:U+0000-00FF,U+0131,U+0152-0153,U+02BB-02BC,U+02C6,U+02DA,U+02DC,U+0304,U+0308,U+0329,U+2000-206F,U+20AC,U+2122,U+2191,U+2193,U+2212,U+2215,U+FEFF,U+FFFD}
+@font-face{font-family:'Unbounded';font-style:normal;font-weight:700;font-display:swap;src:url(/fonts/unbounded-700.woff2) format('woff2');unicode-range:U+0000-00FF,U+0131,U+0152-0153,U+02BB-02BC,U+02C6,U+02DA,U+02DC,U+0304,U+0308,U+0329,U+2000-206F,U+20AC,U+2122,U+2191,U+2193,U+2212,U+2215,U+FEFF,U+FFFD}
+@font-face{font-family:'Unbounded';font-style:normal;font-weight:900;font-display:swap;src:url(/fonts/unbounded-900.woff2) format('woff2');unicode-range:U+0000-00FF,U+0131,U+0152-0153,U+02BB-02BC,U+02C6,U+02DA,U+02DC,U+0304,U+0308,U+0329,U+2000-206F,U+20AC,U+2122,U+2191,U+2193,U+2212,U+2215,U+FEFF,U+FFFD}
+@font-face{font-family:'IBM Plex Sans';font-style:normal;font-weight:400;font-display:swap;src:url(/fonts/plex-sans-400.woff2) format('woff2');unicode-range:U+0000-00FF,U+0131,U+0152-0153,U+02BB-02BC,U+02C6,U+02DA,U+02DC,U+0304,U+0308,U+0329,U+2000-206F,U+20AC,U+2122,U+2191,U+2193,U+2212,U+2215,U+FEFF,U+FFFD}
+@font-face{font-family:'IBM Plex Sans';font-style:normal;font-weight:500;font-display:swap;src:url(/fonts/plex-sans-500.woff2) format('woff2');unicode-range:U+0000-00FF,U+0131,U+0152-0153,U+02BB-02BC,U+02C6,U+02DA,U+02DC,U+0304,U+0308,U+0329,U+2000-206F,U+20AC,U+2122,U+2191,U+2193,U+2212,U+2215,U+FEFF,U+FFFD}
+@font-face{font-family:'IBM Plex Sans';font-style:normal;font-weight:600;font-display:swap;src:url(/fonts/plex-sans-600.woff2) format('woff2');unicode-range:U+0000-00FF,U+0131,U+0152-0153,U+02BB-02BC,U+02C6,U+02DA,U+02DC,U+0304,U+0308,U+0329,U+2000-206F,U+20AC,U+2122,U+2191,U+2193,U+2212,U+2215,U+FEFF,U+FFFD}
+@font-face{font-family:'IBM Plex Mono';font-style:normal;font-weight:400;font-display:swap;src:url(/fonts/plex-mono-400.woff2) format('woff2');unicode-range:U+0000-00FF,U+0131,U+0152-0153,U+02BB-02BC,U+02C6,U+02DA,U+02DC,U+0304,U+0308,U+0329,U+2000-206F,U+20AC,U+2122,U+2191,U+2193,U+2212,U+2215,U+FEFF,U+FFFD}
+@font-face{font-family:'IBM Plex Mono';font-style:normal;font-weight:500;font-display:swap;src:url(/fonts/plex-mono-500.woff2) format('woff2');unicode-range:U+0000-00FF,U+0131,U+0152-0153,U+02BB-02BC,U+02C6,U+02DA,U+02DC,U+0304,U+0308,U+0329,U+2000-206F,U+20AC,U+2122,U+2191,U+2193,U+2212,U+2215,U+FEFF,U+FFFD}
+@font-face{font-family:'Unbounded Fallback';src:local('Arial Black'),local('Arial-Black'),local('Impact');size-adjust:114%;ascent-override:87.5%;descent-override:21.5%;line-gap-override:0%}
+@font-face{font-family:'Plex Sans Fallback';src:local('Arial'),local('Helvetica Neue'),local('Helvetica');size-adjust:100.5%;ascent-override:102%;descent-override:27.4%;line-gap-override:0%}
+@font-face{font-family:'Plex Mono Fallback';src:local('Courier New'),local('Menlo');size-adjust:100%;ascent-override:102.5%;descent-override:27.5%;line-gap-override:0%}
+</style>
+<script>
+/* theme before first paint: ?theme=light|dark for one view (the capture tool), else the stored choice under igneum-theme, else the system setting; ?motion=off marks the page data-motion=off so every .reveal is drawn at once (a headless render never scrolls) */
+(function(){var t=null;try{t=new URLSearchParams(location.search).get("theme");}catch(e){}if(t!=="light"&&t!=="dark"){try{t=localStorage.getItem("igneum-theme");}catch(e){t=null;}}if(t!=="light"&&t!=="dark")t=window.matchMedia&&window.matchMedia("(prefers-color-scheme: light)").matches?"light":"dark";document.documentElement.setAttribute("data-theme",t);try{if(new URLSearchParams(location.search).get("motion")==="off")document.documentElement.setAttribute("data-motion","off");}catch(e){}})();
+</script>
+<!-- head:end -->
+</head>
+<body>
+<!-- nav:start -->
+<a class="skip" href="#main">Skip to content</a>
+<nav class="nav" aria-label="Main" data-nav-version="5">
+  <div class="container nav-row">
+    <a href="/" class="logo" aria-label="Igneum home">
+      <svg class="brand-mark" viewBox="0 0 1024 1024" aria-hidden="true"><rect width="1024" height="1024" rx="160" fill="#0C0C0E"></rect><g transform="translate(166.95 166.95) scale(6.901)"><polygon points="50,4 74,34 67,58 80,54 61,96 39,96 20,54 33,58 26,34" fill="#F2541B"></polygon><polygon points="50,42 59,58 50,82 41,58" fill="#0C0C0E"></polygon></g></svg>
+      <span class="word">IGNEUM</span>
+    </a>
+    <span class="devnet" id="nav-devnet" title="igneum-devnet-4, the Igneum 2.0 devnet, chain id 4465. Coins have no value. The chain may reset."><span class="dot off" id="foot-dot"></span><span id="foot-state" data-devnet-state="live">Devnet live</span></span>
+    <div class="nav-groups" id="nav-groups" role="list">
+      <div class="nav-group" role="listitem"><button type="button" class="group-btn" id="nav-btn-mine" data-group="mine" aria-expanded="false" aria-controls="nav-panel-mine" aria-haspopup="true">Mine<svg class="icon" viewBox="0 0 24 24" aria-hidden="true"><path d="m7 10 5 5 5-5"/></svg></button></div>
+      <div class="nav-group" role="listitem"><button type="button" class="group-btn" id="nav-btn-network" data-group="network" aria-expanded="false" aria-controls="nav-panel-network" aria-haspopup="true">Network<svg class="icon" viewBox="0 0 24 24" aria-hidden="true"><path d="m7 10 5 5 5-5"/></svg></button></div>
+      <div class="nav-group" role="listitem"><button type="button" class="group-btn" id="nav-btn-learn" data-group="learn" data-active aria-expanded="false" aria-controls="nav-panel-learn" aria-haspopup="true">Learn<svg class="icon" viewBox="0 0 24 24" aria-hidden="true"><path d="m7 10 5 5 5-5"/></svg></button></div>
+      <div class="nav-group" role="listitem"><button type="button" class="group-btn" id="nav-btn-build" data-group="build" aria-expanded="false" aria-controls="nav-panel-build" aria-haspopup="true">Build<svg class="icon" viewBox="0 0 24 24" aria-hidden="true"><path d="m7 10 5 5 5-5"/></svg></button></div>
+    </div>
+    <div class="nav-controls">
+      <button class="btn icon-btn" type="button" data-theme-toggle aria-label="Switch to light theme"><svg class="icon" viewBox="0 0 24 24" aria-hidden="true"><circle cx="12" cy="12" r="4"/><path d="M12 2v2m0 16v2M2 12h2m16 0h2M5 5l1 1m12 12 1 1M5 19l1-1M18 6l1-1"/></svg></button>
+      <a href="/download" class="btn primary small cta" data-nav="download">Download</a>
+      <button class="burger" id="nav-burger" type="button" aria-expanded="false" aria-controls="nav-sheet" aria-label="Open the menu" aria-haspopup="true"><svg class="icon" viewBox="0 0 24 24" aria-hidden="true"><path class="bars" d="M4 6h16M4 12h16M4 18h16"/><path class="cross" d="m6 6 12 12M6 18 18 6"/></svg></button>
+    </div>
+  </div>
+  <div class="panels" id="nav-panels">
+    <div class="panel-wrap container">
+      <div class="nav-panel" id="nav-panel-mine" data-group="mine" role="region" aria-labelledby="nav-btn-mine" hidden>
+        <div class="panel-list">
+          <a href="/miner" data-nav="miner"><b>Ember, the miner</b><span>One click installs the node, the miner and the prover.</span></a>
+          <a href="/download" data-nav="download"><b>Download</b><span>Windows, macOS, Linux and HiveOS.</span></a>
+          <a href="/app" data-nav="app"><b>The app</b><span>What you see while the card mines.</span></a>
+          <a href="/wallet" data-nav="wallet"><b>The wallet</b><span>Your coins. Final means final.</span></a>
+          <a href="/miners" data-nav="miners"><b>GPU bench table</b><span>Measured rates, card by card.</span></a>
+          <a href="/tuning" data-nav="tuning"><b>Tuning</b><span>The knee rule, the priors, the flags and the compiler settings, every figure measured.</span></a><a href="/dev-fee" data-nav="dev-fee"><b>The dev fee</b><span>The optional one, in full view, off with one flag.</span></a>
+          <a href="/metamask" data-nav="metamask"><b>Add to MetaMask</b><span>Igneum as a network in your wallet.</span></a>
+        </div>
+      </div>
+      <div class="nav-panel" id="nav-panel-network" data-group="network" role="region" aria-labelledby="nav-btn-network" hidden>
+        <div class="panel-list">
+          <a href="/live" data-nav="live"><b>Live devnet</b><span>The chain as it grows, one lane per miner.</span></a>
+          <a href="/explorer" data-nav="explorer"><b>Explorer</b><span>Look a block or an address up.</span></a>
+          <a href="/evidence" data-nav="evidence"><b>Evidence</b><span>Every claim and how far it is tested.</span></a>
+          <a href="/light" data-nav="light"><b>Light wallet</b><span>A balance your browser proves, trusting no node.</span></a>
+          <a href="/receipt" data-nav="receipt"><b>Payment receipt</b><span>A receipt any third party re-verifies offline.</span></a>
+          <a href="/oracle" data-nav="oracle"><b>State oracle on Sepolia</b><span>Balances on the devnet, read from another chain.</span></a>
+        </div>
+      </div>
+      <div class="nav-panel" id="nav-panel-learn" data-group="learn" role="region" aria-labelledby="nav-btn-learn" hidden>
+        <div class="panel-list">
+          <a href="/litepaper" data-nav="litepaper"><b>Litepaper</b><span>The design, as published.</span></a>
+          <a href="/income" data-nav="income"><b>Income</b><span>What your card would mine, from the live network.</span></a>
+          <a href="/economics" data-nav="economics"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/prize" data-nav="prize" aria-current="page"><b>Prize</b><span>A better adversary or a reproduced shortcut, never a confirmation: the terms.</span></a><a href="/acceptance" data-nav="acceptance"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
+          <a href="/ledger" data-nav="ledger"><b>Ledger</b><span>Every criticism, answered or conceded.</span></a>
+          <a href="/claims" data-nav="claims"><b>What Igneum does not claim</b><span>The limits, stated first.</span></a>
+          <a href="/randomx" data-nav="randomx"><b>Igneum vs RandomX</b><span>What was kept and what was rebuilt for GPUs.</span></a>
+          <a href="/provenance" data-nav="provenance"><b>Built on the shoulders</b><span>Every borrowed part, credited.</span></a>
+        </div>
+      </div>
+      <div class="nav-panel" id="nav-panel-build" data-group="build" role="region" aria-labelledby="nav-btn-build" hidden>
+        <div class="panel-list">
+          <a href="/build" data-nav="build"><b>Build on Igneum</b><span>Chain ids, RPC, a contract in five minutes.</span></a>
+          <a href="/faucet" data-nav="faucet"><b>Devnet faucet</b><span>10 IGN of devnet coin, once a day.</span></a>
+          <a href="/swap" data-nav="swap"><b>Swap</b><span>Test tokens on the devnet; every swap is a proven block.</span></a>
+          <a href="/grants" data-nav="grants"><b>Grants</b><span>Tooling, apps, infrastructure, research.</span></a>
+        <a href="/compatibility" data-nav="compatibility"><b>Compatibility</b><span>Every row a test run against the devnet.</span></a>
+        </div>
+      </div>
+    </div>
+  </div>
+  <div class="nav-sheet" id="nav-sheet" role="dialog" aria-modal="true" aria-label="Menu" hidden>
+    <div class="sheet-scroll">
+      <div class="sheet-group"><div class="sheet-head">Mine</div>
+        <a href="/miner" data-nav="miner"><b>Ember, the miner</b><span>One click installs the node, the miner and the prover.</span></a>
+        <a href="/download" data-nav="download"><b>Download</b><span>Windows, macOS, Linux and HiveOS.</span></a>
+        <a href="/app" data-nav="app"><b>The app</b><span>What you see while the card mines.</span></a>
+        <a href="/wallet" data-nav="wallet"><b>The wallet</b><span>Your coins. Final means final.</span></a>
+        <a href="/miners" data-nav="miners"><b>GPU bench table</b><span>Measured rates, card by card.</span></a>
+        <a href="/tuning" data-nav="tuning"><b>Tuning</b><span>The knee rule, the priors, the flags and the compiler settings, every figure measured.</span></a><a href="/dev-fee" data-nav="dev-fee"><b>The dev fee</b><span>The optional one, in full view, off with one flag.</span></a>
+        <a href="/metamask" data-nav="metamask"><b>Add to MetaMask</b><span>Igneum as a network in your wallet.</span></a>
+      </div>
+      <div class="sheet-group"><div class="sheet-head">Network</div>
+        <a href="/live" data-nav="live"><b>Live devnet</b><span>The chain as it grows, one lane per miner.</span></a>
+        <a href="/explorer" data-nav="explorer"><b>Explorer</b><span>Look a block or an address up.</span></a>
+        <a href="/evidence" data-nav="evidence"><b>Evidence</b><span>Every claim and how far it is tested.</span></a>
+        <a href="/light" data-nav="light"><b>Light wallet</b><span>A balance your browser proves, trusting no node.</span></a>
+        <a href="/receipt" data-nav="receipt"><b>Payment receipt</b><span>A receipt any third party re-verifies offline.</span></a>
+        <a href="/oracle" data-nav="oracle"><b>State oracle on Sepolia</b><span>Balances on the devnet, read from another chain.</span></a>
+      </div>
+      <div class="sheet-group"><div class="sheet-head">Learn</div>
+        <a href="/litepaper" data-nav="litepaper"><b>Litepaper</b><span>The design, as published.</span></a>
+        <a href="/income" data-nav="income"><b>Income</b><span>What your card would mine, from the live network.</span></a>
+        <a href="/economics" data-nav="economics"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/prize" data-nav="prize" aria-current="page"><b>Prize</b><span>A better adversary or a reproduced shortcut, never a confirmation: the terms.</span></a><a href="/acceptance" data-nav="acceptance"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
+        <a href="/ledger" data-nav="ledger"><b>Ledger</b><span>Every criticism, answered or conceded.</span></a>
+        <a href="/claims" data-nav="claims"><b>What Igneum does not claim</b><span>The limits, stated first.</span></a>
+        <a href="/randomx" data-nav="randomx"><b>Igneum vs RandomX</b><span>What was kept and what was rebuilt for GPUs.</span></a>
+        <a href="/provenance" data-nav="provenance"><b>Built on the shoulders</b><span>Every borrowed part, credited.</span></a>
+      </div>
+      <div class="sheet-group"><div class="sheet-head">Build</div>
+        <a href="/build" data-nav="build"><b>Build on Igneum</b><span>Chain ids, RPC, a contract in five minutes.</span></a>
+        <a href="/faucet" data-nav="faucet"><b>Devnet faucet</b><span>10 IGN of devnet coin, once a day.</span></a>
+        <a href="/swap" data-nav="swap"><b>Swap</b><span>Test tokens on the devnet; every swap is a proven block.</span></a>
+        <a href="/grants" data-nav="grants"><b>Grants</b><span>Tooling, apps, infrastructure, research.</span></a>
+        <a href="/compatibility" data-nav="compatibility"><b>Compatibility</b><span>Every row a test run against the devnet.</span></a>
+      </div>
+      <div class="sheet-foot">
+        <a href="/download" class="btn primary big" data-nav="download">Download</a>
+        <div class="sheet-social"><a href="https://discord.gg/igneum" target="_blank" rel="noopener">Discord</a><a href="https://git.igneum.network/igneum-network/spec" target="_blank" rel="noopener">Source</a><a href="https://www.reddit.com/user/Igneum_network/" target="_blank" rel="noopener">Reddit</a></div>
+      </div>
+    </div>
+  </div>
+</nav>
+<script>
+(function(){
+  // the slim bar (site-ui-5, 7 Oct 2026): three group buttons open one panel each; the burger opens the sheet on phones.
+  // Keyboard: Enter or Space opens a group, Escape closes it and returns focus to its button, arrows move between the
+  // group buttons, Tab walks the open panel's links, a click outside closes. The theme toggle flips data-theme and stores it.
+  var n=document.querySelector('.nav');if(!n)return;
+  var btns=[].slice.call(n.querySelectorAll('.group-btn')),panels=[].slice.call(n.querySelectorAll('.nav-panel')),wrap=n.querySelector('.panels');
+  var burger=document.getElementById('nav-burger'),sheet=document.getElementById('nav-sheet');
+  function panelOf(g){return panels.filter(function(p){return p.getAttribute('data-group')===g;})[0];}
+  function closeAll(focusBack){var was=null;btns.forEach(function(b){if(b.getAttribute('aria-expanded')==='true')was=b;b.setAttribute('aria-expanded','false');});panels.forEach(function(p){p.hidden=true;});n.classList.remove('panel-open');if(focusBack&&was)was.focus();}
+  function open(g){closeAll(false);var b=btns.filter(function(x){return x.getAttribute('data-group')===g;})[0],p=panelOf(g);if(!b||!p)return;b.setAttribute('aria-expanded','true');p.hidden=false;n.classList.add('panel-open');anchor(b,p);}
+  // the panel sits under its button; a panel that would run past the container's right edge aligns its right edge to the button's right edge instead (never past the viewport)
+  function anchor(b,p){var pw=n.querySelector('.panel-wrap');if(!pw)return;var cr=pw.getBoundingClientRect(),br=b.getBoundingClientRect(),w=p.offsetWidth,left=br.left-cr.left;if(left+w>cr.width)left=(br.right-cr.left)-w;if(left<0)left=0;p.style.setProperty('--panel-left',Math.round(left)+'px');}
+  window.addEventListener('resize',function(){var o=btns.filter(function(x){return x.getAttribute('aria-expanded')==='true';})[0];if(o)anchor(o,panelOf(o.getAttribute('data-group')));});  btns.forEach(function(b,i){
+    b.addEventListener('click',function(){var on=b.getAttribute('aria-expanded')==='true';if(on)closeAll(false);else open(b.getAttribute('data-group'));});
+    b.addEventListener('keydown',function(e){
+      var k=e.key;
+      if(k==='ArrowRight'||k==='ArrowLeft'){e.preventDefault();var j=(i+(k==='ArrowRight'?1:btns.length-1))%btns.length;btns[j].focus();if(n.classList.contains('panel-open'))open(btns[j].getAttribute('data-group'));}
+      else if(k==='ArrowDown'){e.preventDefault();open(b.getAttribute('data-group'));var f=panelOf(b.getAttribute('data-group')).querySelector('a');if(f)f.focus();}
+      else if(k==='Escape'){closeAll(true);}
+    });
+  });
+  if(wrap)wrap.addEventListener('keydown',function(e){if(e.key==='Escape'){e.stopPropagation();closeAll(true);}});
+  document.addEventListener('click',function(e){if(!n.classList.contains('panel-open'))return;if(e.target.closest('.group-btn')||e.target.closest('.nav-panel'))return;closeAll(false);});
+  document.addEventListener('focusin',function(e){if(!n.classList.contains('panel-open'))return;if(n.contains(e.target))return;closeAll(false);});
+  document.addEventListener('keydown',function(e){if(e.key==='Escape'&&n.classList.contains('panel-open'))closeAll(true);});
+  // the sheet on phones
+  function setSheet(o){if(!burger||!sheet)return;n.classList.toggle('open',o);sheet.hidden=!o;burger.setAttribute('aria-expanded',o?'true':'false');burger.setAttribute('aria-label',o?'Close the menu':'Open the menu');document.documentElement.classList.toggle('nav-locked',o);if(o){var f=sheet.querySelector('a');if(f)f.focus();}}
+  if(burger&&sheet){
+    burger.addEventListener('click',function(){setSheet(!n.classList.contains('open'));});
+    sheet.addEventListener('click',function(e){if(e.target.closest('a'))setSheet(false);});
+    sheet.addEventListener('keydown',function(e){
+      if(e.key==='Escape'){setSheet(false);burger.focus();return;}
+      if(e.key!=='Tab')return;var f=sheet.querySelectorAll('a,button');if(!f.length)return;var first=f[0],last=f[f.length-1];
+      if(e.shiftKey&&document.activeElement===first){e.preventDefault();burger.focus();}else if(!e.shiftKey&&document.activeElement===last){e.preventDefault();burger.focus();}
+    });
+    burger.addEventListener('keydown',function(e){if(e.key==='Tab'&&!e.shiftKey&&n.classList.contains('open')){e.preventDefault();var f=sheet.querySelector('a');if(f)f.focus();}});
+    var mq=window.matchMedia('(min-width:861px)');if(mq.addEventListener)mq.addEventListener('change',function(){setSheet(false);});
+  }
+  // the theme toggle
+  var t=n.querySelector('[data-theme-toggle]');
+  function paintToggle(){var dark=document.documentElement.getAttribute('data-theme')!=='light';t.setAttribute('aria-label',dark?'Switch to light theme':'Switch to dark theme');t.innerHTML=dark?'<svg class="icon" viewBox="0 0 24 24" aria-hidden="true"><circle cx="12" cy="12" r="4"/><path d="M12 2v2m0 16v2M2 12h2m16 0h2M5 5l1 1m12 12 1 1M5 19l1-1M18 6l1-1"/></svg>':'<svg class="icon" viewBox="0 0 24 24" aria-hidden="true"><path d="M20.7 13.3A8.5 8.5 0 0 1 10.7 3.3 8.5 8.5 0 1 0 20.7 13.3Z"/></svg>';}
+  if(t){t.addEventListener('click',function(){var v=document.documentElement.getAttribute('data-theme')==='light'?'dark':'light';document.documentElement.setAttribute('data-theme',v);try{localStorage.setItem('igneum-theme',v);}catch(e){}document.dispatchEvent(new CustomEvent('igneum-theme'));});paintToggle();document.addEventListener('igneum-theme',paintToggle);}
+})();
+</script>
+<!-- nav:end -->
+<main id="main">
+<section class="page-hero"><div class="container">
+  <div class="eyebrow">Disclosure prize</div>
+  <h1>A better adversary, or a reproduced shortcut.</h1>
+  <p class="lead">A GPU-secured network for Ethereum-compatible applications and verifiable computation. The prize rewards a finding that moves the served chip bracket or breaks the served kit, never a confirmation of what the project already states. These are the terms; the amount is set by the founder and served here when set.</p>
+</div></section>
+<section class="section"><div class="container">
+  <h2>What the prize pays for</h2>
+  <div class="tbl"><table>
+    <thead><tr><th>Finding</th><th>What qualifies</th><th>Against what</th></tr></thead>
+    <tbody>
+      <tr><td>(a) An adversarial implementation</td><td>A placed-and-routed or measured implementation (synthesis alone does not qualify) that beats the served energy or cost bracket against the best practical GPU implementation, under the one acceptance rule and the published budget</td><td>The served sentence on <a href="/litepaper#chip-model">the chip model</a>, its per-tier line and the <a href="/acceptance">acceptance standard</a>’s P04 target</td></tr>
+      <tr><td>(b) A reproduced shortcut</td><td>A hash computed with fewer dataset reads or less work than the generator’s, reproduced on the served harness</td><td>The served kit: the generator, the verifier, the dataset policy and the measurement harness pinned by digest in <a href="/release.json">the release manifest</a></td></tr>
+    </tbody>
+  </table></div>
+  <h2>What it does not pay for</h2>
+  <p>Confirmations of the served figures. Synthesis-only rows. Results outside the published budget (the 10 percent GPU-cost budget at the lock, the verifier limit, cross-vendor correctness, hardware accessibility). Findings on classes already on the excluded list (the long program, the select tree, the wide read, the scratchpad, the mixed FP32 candidate, the connected-state variant: <a href="/litepaper#chip-model">the negative controls</a>).</p>
+  <h2>How a claim is made and judged</h2>
+  <p>A claim is a written report with the harness run that reproduces it. It is judged in-house, under the plan’s in-house rule, against the one acceptance rule, and the finding is served whatever the verdict: a finding that beats the bracket replaces the served sentence with its label, and a finding that does not is published with the reason. Send the report to <a href="mailto:hello@igneum.network">hello@igneum.network</a>.</p>
+  <h2>The amount</h2>
+  <p><b>The amount is set by the founder and served here when set.</b> No figure is served before his word.</p>
+  <p class="src">Terms as the Counter ASIC coordinator set them on 8 October 2026 under the plan’s in-house rule (<a href="https://git.igneum.network/igneum-network/igneum/src/branch/master/docs/plans/igneum-2.0.md">the pins</a>, p. 12 of the plan). No chip percentages, no rank. Not legal advice.</p>
+</div></section>
+</main>
+<!-- footer:start -->
+<footer class="site-footer">
+  <div class="container">
+    <p class="positioning">A GPU-secured network for Ethereum-compatible applications and verifiable computation.</p>
+    <div class="footer-grid">
+      <div class="footer-brand">
+        <a href="/" class="logo" aria-label="Igneum home"><svg class="brand-mark" viewBox="0 0 1024 1024" aria-hidden="true"><rect width="1024" height="1024" rx="160" fill="#0C0C0E"></rect><g transform="translate(166.95 166.95) scale(6.901)"><polygon points="50,4 74,34 67,58 80,54 61,96 39,96 20,54 33,58 26,34" fill="#F2541B"></polygon><polygon points="50,42 59,58 50,82 41,58" fill="#0C0C0E"></polygon></g></svg><span class="word">IGNEUM</span><span class="stop">.</span></a>
+        <p>Mined by GPUs. Proven by fire.</p>
+        <div class="social" aria-label="Igneum elsewhere">
+          <a href="https://discord.gg/igneum" target="_blank" rel="noopener" aria-label="The Igneum Discord"><svg viewBox="0 0 24 24" width="22" height="22" fill="currentColor" aria-hidden="true"><path d="M19.6 5.3A17 17 0 0 0 15.4 4l-.2.4a15.6 15.6 0 0 1 3.9 1.9 13.6 13.6 0 0 0-14.2 0A15.6 15.6 0 0 1 8.8 4.4L8.6 4a17 17 0 0 0-4.2 1.3C1.8 9.2 1.1 13 1.4 16.7a17.1 17.1 0 0 0 5.2 2.6l1.1-1.8a10.8 10.8 0 0 1-1.7-.8l.4-.3a12.2 12.2 0 0 0 11.2 0l.4.3-1.7.8 1.1 1.8a17 17 0 0 0 5.2-2.6c.4-4.3-.7-8-3-11.4zM8.7 14.4c-1 0-1.8-.9-1.8-2.1s.8-2.1 1.8-2.1 1.9 1 1.8 2.1c0 1.2-.8 2.1-1.8 2.1zm6.6 0c-1 0-1.8-.9-1.8-2.1s.8-2.1 1.8-2.1 1.9 1 1.8 2.1c0 1.2-.8 2.1-1.8 2.1z"></path></svg></a>
+          <a href="https://git.igneum.network/igneum-network/spec" target="_blank" rel="noopener" aria-label="Igneum source: the spec, the vectors and the issues"><svg viewBox="0 0 24 24" width="22" height="22" fill="currentColor" aria-hidden="true"><path d="M8.6 17.6 3 12l5.6-5.6 1.4 1.4L5.8 12l4.2 4.2zm6.8 0-1.4-1.4L18.2 12 14 7.8l1.4-1.4L21 12z"></path></svg></a>
+          <a data-social="reddit" href="https://www.reddit.com/user/Igneum_network/" target="_blank" rel="noopener" aria-label="Igneum on Reddit"><svg viewBox="0 0 24 24" width="22" height="22" fill="currentColor" aria-hidden="true"><path d="M22 12.1a2.2 2.2 0 0 0-3.7-1.6 10.8 10.8 0 0 0-5.8-1.8l1-4.6 3.2.7a1.5 1.5 0 1 0 .2-.9l-3.6-.8a.5.5 0 0 0-.5.4l-1.1 5.2a10.8 10.8 0 0 0-5.9 1.8A2.2 2.2 0 1 0 3.4 14a4.3 4.3 0 0 0 0 .7c0 3.4 3.9 6.1 8.6 6.1s8.6-2.7 8.6-6.1a4.3 4.3 0 0 0 0-.7 2.2 2.2 0 0 0 1.4-1.9zM7 13.6a1.5 1.5 0 1 1 1.5 1.5A1.5 1.5 0 0 1 7 13.6zm8.6 4.1a5.7 5.7 0 0 1-3.6 1.1 5.7 5.7 0 0 1-3.6-1.1.4.4 0 0 1 .6-.6 4.9 4.9 0 0 0 3 .9 4.9 4.9 0 0 0 3-.9.4.4 0 0 1 .6.6zm-.3-2.6a1.5 1.5 0 1 1 1.5-1.5 1.5 1.5 0 0 1-1.5 1.5z"></path></svg></a>
+          <a href="mailto:hello@igneum.network" aria-label="Email hello@igneum.network"><svg viewBox="0 0 24 24" width="22" height="22" fill="none" stroke="currentColor" stroke-width="1.8" stroke-linecap="round" stroke-linejoin="round" aria-hidden="true"><rect x="3" y="5" width="18" height="14" rx="2"></rect><path d="m3.5 6.5 8.5 6.5 8.5-6.5"></path></svg></a>
+        </div>
+        <div class="footer-dl" aria-label="Download Ember"><a href="/download#windows"><span class="osmark mini" data-os="windows" title="Windows"><svg viewBox="0 0 24 24" width="22" height="22" aria-hidden="true" focusable="false" fill="currentColor"><path d="M3 5.6l7.3-1v7.1H3zM11.4 4.4L21 3v8.7h-9.6zM3 12.3h7.3v7.1L3 18.4zM11.4 12.3H21V21l-9.6-1.4z"/></svg></span>Windows</a><a href="/download#mac"><span class="osmark mini" data-os="mac" title="macOS"><svg viewBox="0 0 24 24" width="22" height="22" aria-hidden="true" focusable="false" fill="currentColor"><path d="M16.4 12.6c0-2.5 2-3.6 2.1-3.7-1.2-1.7-3-1.9-3.6-2-1.5-.2-3 .9-3.8.9-.8 0-2-.9-3.3-.8-1.7 0-3.2 1-4.1 2.5-1.8 3-.5 7.6 1.3 10.1.9 1.2 1.9 2.6 3.2 2.5 1.3 0 1.8-.8 3.3-.8 1.6 0 2 .8 3.3.8 1.4 0 2.3-1.2 3.1-2.5 1-1.4 1.4-2.8 1.4-2.9 0 0-2.7-1-2.9-4.1zM13.9 5.3c.7-.8 1.2-2 1-3.2-1 0-2.2.7-2.9 1.5-.6.7-1.2 1.9-1 3 1.1.1 2.2-.5 2.9-1.3z"/></svg></span>macOS</a><a href="/download#linux"><span class="osmark mini" data-os="linux" title="Linux"><svg viewBox="0 0 24 24" width="22" height="22" aria-hidden="true" focusable="false" fill="currentColor"><path d="M12 2c-2.4 0-4 1.9-4 4.6 0 1.2.2 2 0 2.8-.6 1.4-2.1 2.9-2.6 4.9-.3 1.1-.1 2 .3 2.6-.6.4-1.3 1-1.1 1.7.3 1 2.1 1.2 3.2 1.8.7.4 1.5.6 2.1.1.6.2 1.3.3 2.1.3s1.5-.1 2.1-.3c.6.5 1.4.3 2.1-.1 1.1-.6 2.9-.8 3.2-1.8.2-.7-.5-1.3-1.1-1.7.4-.6.6-1.5.3-2.6-.5-2-2-3.5-2.6-4.9-.2-.8 0-1.6 0-2.8C16 3.9 14.4 2 12 2zm-1.4 4.2c.5 0 .8.5.8 1.2s-.3 1.2-.8 1.2-.8-.5-.8-1.2.3-1.2.8-1.2zm2.8 0c.5 0 .8.5.8 1.2s-.3 1.2-.8 1.2-.8-.5-.8-1.2.3-1.2.8-1.2zM12 9.3c.9 0 1.9.5 1.9 1s-1 1.2-1.9 1.2-1.9-.7-1.9-1.2 1-1 1.9-1zm0 3.4c2.2 0 3.6 2.6 3.6 4.4 0 1.5-1.6 2.3-3.6 2.3s-3.6-.8-3.6-2.3c0-1.8 1.4-4.4 3.6-4.4z"/></svg></span>Linux</a><a href="/download#hive"><span class="osmark mini" data-os="hive" title="HiveOS"><svg viewBox="0 0 24 24" width="22" height="22" aria-hidden="true" focusable="false" fill="none" stroke="currentColor" stroke-width="1.7" stroke-linejoin="round" stroke-linecap="round"><path d="M12 2.6 20.2 7.3v9.4L12 21.4 3.8 16.7V7.3z"/><path d="M12 7.4 16 9.7v4.6L12 16.6 8 14.3V9.7z"/><path d="M12 7.4V2.6M16 9.7l4.2-2.4M16 14.3l4.2 2.4M12 16.6v4.8M8 14.3l-4.2 2.4M8 9.7 3.8 7.3"/></svg></span>HiveOS</a></div>
+        <a href="https://git.igneum.network/igneum-network/spec" target="_blank" rel="noopener" class="text-link">Specification and test vectors<svg class="icon" viewBox="0 0 24 24" aria-hidden="true"><path d="M6 18 18 6M6 6h12v12"/></svg></a>
+      </div>
+      <div class="footer-column"><h4>Run</h4><div>
+        <a href="/download">Download Ember</a>
+        <a href="/miner">The miner</a>
+        <a href="/app">The app</a>
+        <a href="/wallet">The wallet</a>
+        <a href="/miners">GPU bench table</a>
+        <a href="/dev-fee">The dev fee</a>
+        <a href="/faucet">Devnet faucet</a>
+        <a href="/metamask">Add Igneum to MetaMask</a>
+      </div></div>
+      <div class="footer-column"><h4>Read</h4><div>
+        <a href="/litepaper">Litepaper</a>
+        <a href="/evidence">Evidence</a>
+        <a href="/ledger">Ledger: every criticism</a>
+        <a href="/claims">What Igneum does not claim</a>
+        <a href="/randomx">Igneum vs RandomX</a>
+        <a href="/provenance">Built on the shoulders</a>
+      </div></div>
+      <div class="footer-column"><h4>Explore</h4><div>
+        <a href="/live">Live devnet</a>
+        <a href="/explorer">Explorer</a>
+        <a href="/build">Build on Igneum</a>
+        <a href="/swap">Swap</a>
+        <a href="/grants">Grants</a>
+        <a href="/download">Downloads: devnet build</a>
+        <a href="https://discord.gg/igneum" target="_blank" rel="noopener">Community Discord</a>
+        <a href="mailto:hello@igneum.network">hello@igneum.network</a>
+        <a href="https://git.igneum.network/igneum-network/spec/issues" rel="noopener">An issue on the spec</a>
+      </div></div>
+    </div>
+    <div class="footer-bottom">
+      <p>Igneum Labs LTD · Unit IH-00-01-01-OF-01, Level 01, Innovation One, Dubai International Financial Centre. Experimental software. Nothing on this site is an offer to sell anything.<br>Report a flaw by email or by an issue on the spec. Nobody from Igneum will ask for your seed. © 2026 Igneum · not an offer to sell anything</p>
+      <div class="theme-group" role="group" aria-label="Theme"><button type="button" data-theme-set="system" aria-pressed="true">System</button><button type="button" data-theme-set="light" aria-pressed="false">Light</button><button type="button" data-theme-set="dark" aria-pressed="false">Dark</button></div>
+    </div>
+  </div>
+</footer>
+
+<script>
+(function(){
+  // theme control: stores light or dark under igneum-theme; system clears it and follows the OS. The head applied the value before paint.
+  var bs=document.querySelectorAll('[data-theme-set]');if(!bs.length)return;
+  var media=window.matchMedia('(prefers-color-scheme: light)');
+  function stored(){try{var t=localStorage.getItem('igneum-theme');return t==='light'||t==='dark'?t:'system';}catch(e){return 'system';}}
+  function apply(){var c=stored();document.documentElement.setAttribute('data-theme',c==='system'?(media.matches?'light':'dark'):c);bs.forEach(function(b){b.setAttribute('aria-pressed',b.getAttribute('data-theme-set')===c?'true':'false');});document.dispatchEvent(new CustomEvent('igneum-theme'));}
+  bs.forEach(function(b){b.addEventListener('click',function(){var v=b.getAttribute('data-theme-set');try{if(v==='system')localStorage.removeItem('igneum-theme');else localStorage.setItem('igneum-theme',v);}catch(e){}apply();});});
+  if(media.addEventListener)media.addEventListener('change',function(){if(stored()==='system')apply();});
+  document.addEventListener('igneum-theme',function(){var c=stored();bs.forEach(function(b){b.setAttribute('aria-pressed',b.getAttribute('data-theme-set')===c?'true':'false');});});
+  bs.forEach(function(b){b.setAttribute('aria-pressed',b.getAttribute('data-theme-set')===stored()?'true':'false');});
+  // the network state word in the status bar: one read of the observer per page view
+  var fs=document.getElementById('foot-state'),fd=document.getElementById('foot-dot');if(fs&&fd&&fs.getAttribute('data-devnet-state')==='live'){fetch('/api/live?window=30',{cache:'no-store'}).then(function(r){return r.json();}).then(function(d){var on=d&&d.ok&&d.state&&!d.state.stale;fs.textContent=on?'devnet live':'devnet, observer stale';fd.className='dot '+(on?'live':'off');}).catch(function(){fs.textContent='devnet';});}
+})();
+</script>
+<!-- footer:end -->
+</body>
+</html>
diff --git a/site/provenance.html b/site/provenance.html
index 1c47d338c..030bb5b9b 100644
--- a/site/provenance.html
+++ b/site/provenance.html
@@ -130,7 +130,7 @@ table{min-width:560px}
         <div class="panel-list">
           <a href="/litepaper" data-nav="litepaper"><b>Litepaper</b><span>The design, as published.</span></a>
           <a href="/income" data-nav="income"><b>Income</b><span>What your card would mine, from the live network.</span></a>
-          <a href="/economics" data-nav="economics"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/acceptance" data-nav="acceptance"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
+          <a href="/economics" data-nav="economics"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/prize" data-nav="prize"><b>Prize</b><span>A better adversary or a reproduced shortcut, never a confirmation: the terms.</span></a><a href="/acceptance" data-nav="acceptance"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
           <a href="/ledger" data-nav="ledger"><b>Ledger</b><span>Every criticism, answered or conceded.</span></a>
           <a href="/claims" data-nav="claims"><b>What Igneum does not claim</b><span>The limits, stated first.</span></a>
           <a href="/randomx" data-nav="randomx"><b>Igneum vs RandomX</b><span>What was kept and what was rebuilt for GPUs.</span></a>
@@ -170,7 +170,7 @@ table{min-width:560px}
       <div class="sheet-group"><div class="sheet-head">Learn</div>
         <a href="/litepaper" data-nav="litepaper"><b>Litepaper</b><span>The design, as published.</span></a>
         <a href="/income" data-nav="income"><b>Income</b><span>What your card would mine, from the live network.</span></a>
-        <a href="/economics" data-nav="economics"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/acceptance" data-nav="acceptance"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
+        <a href="/economics" data-nav="economics"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/prize" data-nav="prize"><b>Prize</b><span>A better adversary or a reproduced shortcut, never a confirmation: the terms.</span></a><a href="/acceptance" data-nav="acceptance"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
         <a href="/ledger" data-nav="ledger"><b>Ledger</b><span>Every criticism, answered or conceded.</span></a>
         <a href="/claims" data-nav="claims"><b>What Igneum does not claim</b><span>The limits, stated first.</span></a>
         <a href="/randomx" data-nav="randomx"><b>Igneum vs RandomX</b><span>What was kept and what was rebuilt for GPUs.</span></a>
diff --git a/site/proving.html b/site/proving.html
index 9f460128a..b5d00bc28 100644
--- a/site/proving.html
+++ b/site/proving.html
@@ -156,7 +156,7 @@ main{padding-bottom:100px}.card{background:var(--row);border:1px solid var(--lin
         <div class="panel-list">
           <a href="/litepaper" data-nav="litepaper"><b>Litepaper</b><span>The design, as published.</span></a>
           <a href="/income" data-nav="income"><b>Income</b><span>What your card would mine, from the live network.</span></a>
-          <a href="/economics" data-nav="economics"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/acceptance" data-nav="acceptance"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
+          <a href="/economics" data-nav="economics"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/prize" data-nav="prize"><b>Prize</b><span>A better adversary or a reproduced shortcut, never a confirmation: the terms.</span></a><a href="/acceptance" data-nav="acceptance"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
           <a href="/ledger" data-nav="ledger"><b>Ledger</b><span>Every criticism, answered or conceded.</span></a>
           <a href="/claims" data-nav="claims"><b>What Igneum does not claim</b><span>The limits, stated first.</span></a>
           <a href="/randomx" data-nav="randomx"><b>Igneum vs RandomX</b><span>What was kept and what was rebuilt for GPUs.</span></a>
@@ -196,7 +196,7 @@ main{padding-bottom:100px}.card{background:var(--row);border:1px solid var(--lin
       <div class="sheet-group"><div class="sheet-head">Learn</div>
         <a href="/litepaper" data-nav="litepaper"><b>Litepaper</b><span>The design, as published.</span></a>
         <a href="/income" data-nav="income"><b>Income</b><span>What your card would mine, from the live network.</span></a>
-        <a href="/economics" data-nav="economics"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/acceptance" data-nav="acceptance"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
+        <a href="/economics" data-nav="economics"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/prize" data-nav="prize"><b>Prize</b><span>A better adversary or a reproduced shortcut, never a confirmation: the terms.</span></a><a href="/acceptance" data-nav="acceptance"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
         <a href="/ledger" data-nav="ledger"><b>Ledger</b><span>Every criticism, answered or conceded.</span></a>
         <a href="/claims" data-nav="claims"><b>What Igneum does not claim</b><span>The limits, stated first.</span></a>
         <a href="/randomx" data-nav="randomx"><b>Igneum vs RandomX</b><span>What was kept and what was rebuilt for GPUs.</span></a>
diff --git a/site/randomx.html b/site/randomx.html
index 6fcdd68e0..4f6d3b667 100644
--- a/site/randomx.html
+++ b/site/randomx.html
@@ -129,7 +129,7 @@
         <div class="panel-list">
           <a href="/litepaper" data-nav="litepaper"><b>Litepaper</b><span>The design, as published.</span></a>
           <a href="/income" data-nav="income"><b>Income</b><span>What your card would mine, from the live network.</span></a>
-          <a href="/economics" data-nav="economics"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/acceptance" data-nav="acceptance"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
+          <a href="/economics" data-nav="economics"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/prize" data-nav="prize"><b>Prize</b><span>A better adversary or a reproduced shortcut, never a confirmation: the terms.</span></a><a href="/acceptance" data-nav="acceptance"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
           <a href="/ledger" data-nav="ledger"><b>Ledger</b><span>Every criticism, answered or conceded.</span></a>
           <a href="/claims" data-nav="claims"><b>What Igneum does not claim</b><span>The limits, stated first.</span></a>
           <a href="/randomx" data-nav="randomx" aria-current="page"><b>Igneum vs RandomX</b><span>What was kept and what was rebuilt for GPUs.</span></a>
@@ -169,7 +169,7 @@
       <div class="sheet-group"><div class="sheet-head">Learn</div>
         <a href="/litepaper" data-nav="litepaper"><b>Litepaper</b><span>The design, as published.</span></a>
         <a href="/income" data-nav="income"><b>Income</b><span>What your card would mine, from the live network.</span></a>
-        <a href="/economics" data-nav="economics"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/acceptance" data-nav="acceptance"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
+        <a href="/economics" data-nav="economics"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/prize" data-nav="prize"><b>Prize</b><span>A better adversary or a reproduced shortcut, never a confirmation: the terms.</span></a><a href="/acceptance" data-nav="acceptance"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
         <a href="/ledger" data-nav="ledger"><b>Ledger</b><span>Every criticism, answered or conceded.</span></a>
         <a href="/claims" data-nav="claims"><b>What Igneum does not claim</b><span>The limits, stated first.</span></a>
         <a href="/randomx" data-nav="randomx" aria-current="page"><b>Igneum vs RandomX</b><span>What was kept and what was rebuilt for GPUs.</span></a>
diff --git a/site/receipt.html b/site/receipt.html
index 32c9adda1..b55919e64 100644
--- a/site/receipt.html
+++ b/site/receipt.html
@@ -135,7 +135,7 @@
         <div class="panel-list">
           <a href="/litepaper" data-nav="litepaper"><b>Litepaper</b><span>The design, as published.</span></a>
           <a href="/income" data-nav="income"><b>Income</b><span>What your card would mine, from the live network.</span></a>
-          <a href="/economics" data-nav="economics"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/acceptance" data-nav="acceptance"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
+          <a href="/economics" data-nav="economics"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/prize" data-nav="prize"><b>Prize</b><span>A better adversary or a reproduced shortcut, never a confirmation: the terms.</span></a><a href="/acceptance" data-nav="acceptance"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
           <a href="/ledger" data-nav="ledger"><b>Ledger</b><span>Every criticism, answered or conceded.</span></a>
           <a href="/claims" data-nav="claims"><b>What Igneum does not claim</b><span>The limits, stated first.</span></a>
           <a href="/randomx" data-nav="randomx"><b>Igneum vs RandomX</b><span>What was kept and what was rebuilt for GPUs.</span></a>
@@ -175,7 +175,7 @@
       <div class="sheet-group"><div class="sheet-head">Learn</div>
         <a href="/litepaper" data-nav="litepaper"><b>Litepaper</b><span>The design, as published.</span></a>
         <a href="/income" data-nav="income"><b>Income</b><span>What your card would mine, from the live network.</span></a>
-        <a href="/economics" data-nav="economics"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/acceptance" data-nav="acceptance"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
+        <a href="/economics" data-nav="economics"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/prize" data-nav="prize"><b>Prize</b><span>A better adversary or a reproduced shortcut, never a confirmation: the terms.</span></a><a href="/acceptance" data-nav="acceptance"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
         <a href="/ledger" data-nav="ledger"><b>Ledger</b><span>Every criticism, answered or conceded.</span></a>
         <a href="/claims" data-nav="claims"><b>What Igneum does not claim</b><span>The limits, stated first.</span></a>
         <a href="/randomx" data-nav="randomx"><b>Igneum vs RandomX</b><span>What was kept and what was rebuilt for GPUs.</span></a>
diff --git a/site/release-manifest.json b/site/release-manifest.json
index 0c83933ef..8ee49e974 100644
--- a/site/release-manifest.json
+++ b/site/release-manifest.json
@@ -1,6 +1,6 @@
 {
  "format": "igneum-release-manifest-v1",
- "generated": "2026-10-08T19:57:00Z",
+ "generated": "2026-10-08T19:59:00Z",
  "read_at": "read 8 October 2026, 17:2x UK, from the node lane's line on build-1's seed (the re-cut node 4cdcc488) at the first block",
  "labels": {
   "measured": "read from a running node, a binary or a record",
@@ -66,7 +66,8 @@
   "app": {
    "name": "Ember",
    "channel": "devnet-4",
-   "note": "the macOS build is 2.0.0 (unsigned tonight; a signed and notarized build follows); the Windows and HiveOS builds are the 0.3.26 line until the 2.0.0 cut ships for them; the versions block carries each file's SHA-256"
+   "version": "2.0.1",
+   "note": "2.0.1 on every platform (Mac 20:16, HiveOS 20:25, Windows 20:56 UK, 8 October 2026); 2.0.0 is withdrawn (its miner could not read this network's block templates) and every 2.0.0 install updates itself to 2.0.1; the Mac build is unsigned tonight; min_supported_version 2.0.1"
   }
  },
  "mining": {
@@ -207,11 +208,11 @@
    "url": "https://dl.igneum.network/dl/public/Igneum-Miner-2.0.1-7cfa422a-aa0e0f45.dmg"
   },
   "miner-windows": {
-   "version": "2.0.0",
-   "file": "Igneum-Miner-Setup-2.0.0.exe",
-   "sha256": "793a631dc2084e6d6f778f13602d674a0c134af746b6355c25d3998c2be18b79",
-   "size": 63803668,
-   "url": "https://dl.igneum.network/dl/public/Igneum-Miner-Setup-2.0.0.exe"
+   "version": "2.0.1",
+   "file": "Igneum-Miner-Setup-2.0.1.exe",
+   "sha256": "ce6bb00cd738fa08348fd8121781479109a5b2c2059a04fe7c22ad7aa3f12bf9",
+   "size": 63831654,
+   "url": "https://dl.igneum.network/dl/public/Igneum-Miner-Setup-2.0.1.exe"
   },
   "wallet-mac": {
    "version": "0.1.6",
@@ -221,7 +222,7 @@
    "url": "https://dl.igneum.network/dl/public/Igneum-Wallet-0.1.6.dmg"
   }
  },
- "versions_updated": "2026-10-08T19:44:46Z",
+ "versions_updated": "2026-10-08T19:51:38Z",
  "sources": {
   "network": "the node lane's read of build-1's seed (igneum-devnet-4) at the first block, 8 October 2026, 17:14 UK",
   "node": "the node lane's line: release-2.0.0-node 4cdcc488, igneumd/2.0.0-4cdcc488",
diff --git a/site/scenes.html b/site/scenes.html
index 371c56187..57ab8a928 100644
--- a/site/scenes.html
+++ b/site/scenes.html
@@ -121,7 +121,7 @@
         <div class="panel-list">
           <a href="/litepaper" data-nav="litepaper"><b>Litepaper</b><span>The design, as published.</span></a>
           <a href="/income" data-nav="income"><b>Income</b><span>What your card would mine, from the live network.</span></a>
-          <a href="/economics" data-nav="economics"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/acceptance" data-nav="acceptance"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
+          <a href="/economics" data-nav="economics"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/prize" data-nav="prize"><b>Prize</b><span>A better adversary or a reproduced shortcut, never a confirmation: the terms.</span></a><a href="/acceptance" data-nav="acceptance"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
           <a href="/ledger" data-nav="ledger"><b>Ledger</b><span>Every criticism, answered or conceded.</span></a>
           <a href="/claims" data-nav="claims"><b>What Igneum does not claim</b><span>The limits, stated first.</span></a>
           <a href="/randomx" data-nav="randomx"><b>Igneum vs RandomX</b><span>What was kept and what was rebuilt for GPUs.</span></a>
@@ -161,7 +161,7 @@
       <div class="sheet-group"><div class="sheet-head">Learn</div>
         <a href="/litepaper" data-nav="litepaper"><b>Litepaper</b><span>The design, as published.</span></a>
         <a href="/income" data-nav="income"><b>Income</b><span>What your card would mine, from the live network.</span></a>
-        <a href="/economics" data-nav="economics"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/acceptance" data-nav="acceptance"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
+        <a href="/economics" data-nav="economics"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/prize" data-nav="prize"><b>Prize</b><span>A better adversary or a reproduced shortcut, never a confirmation: the terms.</span></a><a href="/acceptance" data-nav="acceptance"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
         <a href="/ledger" data-nav="ledger"><b>Ledger</b><span>Every criticism, answered or conceded.</span></a>
         <a href="/claims" data-nav="claims"><b>What Igneum does not claim</b><span>The limits, stated first.</span></a>
         <a href="/randomx" data-nav="randomx"><b>Igneum vs RandomX</b><span>What was kept and what was rebuilt for GPUs.</span></a>
diff --git a/site/scorecard.html b/site/scorecard.html
index fbe2b0190..7f06db72a 100644
--- a/site/scorecard.html
+++ b/site/scorecard.html
@@ -103,7 +103,7 @@
         <div class="panel-list">
           <a href="/litepaper" data-nav="litepaper"><b>Litepaper</b><span>The design, as published.</span></a>
           <a href="/income" data-nav="income"><b>Income</b><span>What your card would mine, from the live network.</span></a>
-          <a href="/economics" data-nav="economics"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard" aria-current="page"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/acceptance" data-nav="acceptance"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
+          <a href="/economics" data-nav="economics"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard" aria-current="page"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/prize" data-nav="prize"><b>Prize</b><span>A better adversary or a reproduced shortcut, never a confirmation: the terms.</span></a><a href="/acceptance" data-nav="acceptance"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
           <a href="/ledger" data-nav="ledger"><b>Ledger</b><span>Every criticism, answered or conceded.</span></a>
           <a href="/claims" data-nav="claims"><b>What Igneum does not claim</b><span>The limits, stated first.</span></a>
           <a href="/randomx" data-nav="randomx"><b>Igneum vs RandomX</b><span>What was kept and what was rebuilt for GPUs.</span></a>
@@ -143,7 +143,7 @@
       <div class="sheet-group"><div class="sheet-head">Learn</div>
         <a href="/litepaper" data-nav="litepaper"><b>Litepaper</b><span>The design, as published.</span></a>
         <a href="/income" data-nav="income"><b>Income</b><span>What your card would mine, from the live network.</span></a>
-        <a href="/economics" data-nav="economics"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard" aria-current="page"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/acceptance" data-nav="acceptance"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
+        <a href="/economics" data-nav="economics"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard" aria-current="page"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/prize" data-nav="prize"><b>Prize</b><span>A better adversary or a reproduced shortcut, never a confirmation: the terms.</span></a><a href="/acceptance" data-nav="acceptance"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
         <a href="/ledger" data-nav="ledger"><b>Ledger</b><span>Every criticism, answered or conceded.</span></a>
         <a href="/claims" data-nav="claims"><b>What Igneum does not claim</b><span>The limits, stated first.</span></a>
         <a href="/randomx" data-nav="randomx"><b>Igneum vs RandomX</b><span>What was kept and what was rebuilt for GPUs.</span></a>
@@ -234,6 +234,7 @@
     </tbody>
   </table></div>
   <p class="src"><b>Source:</b> <code>docs/plans/igneum-2.0-plan.txt</code>, section 23 (the acceptance scorecard) and the pins in <code>docs/plans/igneum-2.0.md</code>; the Today column is the facts page’s label for the rows each gate cites, and moves only with those rows. The five labels: TEAM-REPORTED, MODELLED, PROPOSED, PENDING, EXCLUDED. The public mirror follows master; a link that answers 404 is a file not yet synced.</p>
+  <p>A finding that moves a gate the other way, a placed or measured adversary that beats the served bracket or a reproduced shortcut in the served kit, earns <a href="/prize">the disclosure prize</a>; the terms are on that page.</p>
   <h2>The release evidence packet</h2>
   <p>A source commit, exact parameters, the test procedure, the raw result, the independent-reproduction status, the review scope and the unresolved limitations accompany every material claim. On this site that packet is the facts page’s row: its Version or commit, Reproducible test, Result and Independent verification cells, with the limitations stated in the row. A claim without a packet is not served.</p>
   <h2>The wording ladder</h2>
diff --git a/site/sitemap.xml b/site/sitemap.xml
index 65c737d9d..d136c7bb9 100644
--- a/site/sitemap.xml
+++ b/site/sitemap.xml
@@ -1,7 +1,7 @@
 <?xml version="1.0" encoding="UTF-8"?>
 <urlset xmlns="http://www.sitemaps.org/schemas/sitemap/0.9">
   <url><loc>https://igneum.network/</loc><lastmod>2026-10-07</lastmod><changefreq>weekly</changefreq><priority>1.0</priority></url>
-  <url><loc>https://igneum.network/litepaper</loc></url><url><loc>https://igneum.network/economics</loc><lastmod>2026-10-07</lastmod><changefreq>monthly</changefreq><priority>0.9</priority></url><url><loc>https://igneum.network/scorecard</loc><lastmod>2026-10-08</lastmod><changefreq>monthly</changefreq><priority>0.9</priority></url><url><loc>https://igneum.network/audit</loc><lastmod>2026-10-08</lastmod><changefreq>monthly</changefreq><priority>0.9</priority></url><url><loc>https://igneum.network/docs</loc><lastmod>2026-10-08</lastmod><changefreq>monthly</changefreq><priority>0.9</priority></url><url><loc>https://igneum.network/tuning</loc><lastmod>2026-10-08</lastmod><changefreq>monthly</changefreq><priority>0.9</priority></url>
+  <url><loc>https://igneum.network/litepaper</loc></url><url><loc>https://igneum.network/economics</loc><lastmod>2026-10-07</lastmod><changefreq>monthly</changefreq><priority>0.9</priority></url><url><loc>https://igneum.network/scorecard</loc><lastmod>2026-10-08</lastmod><changefreq>monthly</changefreq><priority>0.9</priority></url><url><loc>https://igneum.network/prize</loc><lastmod>2026-10-08</lastmod><changefreq>monthly</changefreq><priority>0.9</priority></url><url><loc>https://igneum.network/audit</loc><lastmod>2026-10-08</lastmod><changefreq>monthly</changefreq><priority>0.9</priority></url><url><loc>https://igneum.network/docs</loc><lastmod>2026-10-08</lastmod><changefreq>monthly</changefreq><priority>0.9</priority></url><url><loc>https://igneum.network/tuning</loc><lastmod>2026-10-08</lastmod><changefreq>monthly</changefreq><priority>0.9</priority></url>
   <url><loc>https://igneum.network/litepaper</loc></url><url><loc>https://igneum.network/economics</loc><lastmod>2026-10-07</lastmod><changefreq>monthly</changefreq><priority>0.9</priority></url><url><loc>https://igneum.network/scorecard</loc><lastmod>2026-10-08</lastmod><changefreq>monthly</changefreq><priority>0.9</priority></url><url><loc>https://igneum.network/acceptance</loc><lastmod>2026-10-08</lastmod><changefreq>monthly</changefreq><priority>0.9</priority></url>
   <url><loc>https://igneum.network/miner</loc><lastmod>2026-10-07</lastmod><changefreq>weekly</changefreq><priority>0.8</priority></url>
   <url><loc>https://igneum.network/app</loc><lastmod>2026-10-07</lastmod><changefreq>weekly</changefreq><priority>0.8</priority></url>
diff --git a/site/swap.html b/site/swap.html
index 81a4230a0..aa6ca2ce7 100644
--- a/site/swap.html
+++ b/site/swap.html
@@ -140,7 +140,7 @@ dt{color:var(--ash)}dd{margin:0;font-family:var(--f-mono);font-size:13px;overflo
         <div class="panel-list">
           <a href="/litepaper" data-nav="litepaper"><b>Litepaper</b><span>The design, as published.</span></a>
           <a href="/income" data-nav="income"><b>Income</b><span>What your card would mine, from the live network.</span></a>
-          <a href="/economics" data-nav="economics"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/acceptance" data-nav="acceptance"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
+          <a href="/economics" data-nav="economics"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/prize" data-nav="prize"><b>Prize</b><span>A better adversary or a reproduced shortcut, never a confirmation: the terms.</span></a><a href="/acceptance" data-nav="acceptance"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
           <a href="/ledger" data-nav="ledger"><b>Ledger</b><span>Every criticism, answered or conceded.</span></a>
           <a href="/claims" data-nav="claims"><b>What Igneum does not claim</b><span>The limits, stated first.</span></a>
           <a href="/randomx" data-nav="randomx"><b>Igneum vs RandomX</b><span>What was kept and what was rebuilt for GPUs.</span></a>
@@ -180,7 +180,7 @@ dt{color:var(--ash)}dd{margin:0;font-family:var(--f-mono);font-size:13px;overflo
       <div class="sheet-group"><div class="sheet-head">Learn</div>
         <a href="/litepaper" data-nav="litepaper"><b>Litepaper</b><span>The design, as published.</span></a>
         <a href="/income" data-nav="income"><b>Income</b><span>What your card would mine, from the live network.</span></a>
-        <a href="/economics" data-nav="economics"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/acceptance" data-nav="acceptance"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
+        <a href="/economics" data-nav="economics"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/prize" data-nav="prize"><b>Prize</b><span>A better adversary or a reproduced shortcut, never a confirmation: the terms.</span></a><a href="/acceptance" data-nav="acceptance"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
         <a href="/ledger" data-nav="ledger"><b>Ledger</b><span>Every criticism, answered or conceded.</span></a>
         <a href="/claims" data-nav="claims"><b>What Igneum does not claim</b><span>The limits, stated first.</span></a>
         <a href="/randomx" data-nav="randomx"><b>Igneum vs RandomX</b><span>What was kept and what was rebuilt for GPUs.</span></a>
diff --git a/site/tuning.html b/site/tuning.html
index 3b802c80b..61b50b19d 100644
--- a/site/tuning.html
+++ b/site/tuning.html
@@ -130,7 +130,7 @@ table{min-width:560px}
         <div class="panel-list">
           <a href="/litepaper" data-nav="litepaper"><b>Litepaper</b><span>The design, as published.</span></a>
           <a href="/income" data-nav="income"><b>Income</b><span>What your card would mine, from the live network.</span></a>
-          <a href="/economics" data-nav="economics"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/acceptance" data-nav="acceptance"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
+          <a href="/economics" data-nav="economics"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/prize" data-nav="prize"><b>Prize</b><span>A better adversary or a reproduced shortcut, never a confirmation: the terms.</span></a><a href="/acceptance" data-nav="acceptance"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
           <a href="/ledger" data-nav="ledger"><b>Ledger</b><span>Every criticism, answered or conceded.</span></a>
           <a href="/claims" data-nav="claims"><b>What Igneum does not claim</b><span>The limits, stated first.</span></a>
           <a href="/randomx" data-nav="randomx"><b>Igneum vs RandomX</b><span>What was kept and what was rebuilt for GPUs.</span></a>
@@ -170,7 +170,7 @@ table{min-width:560px}
       <div class="sheet-group"><div class="sheet-head">Learn</div>
         <a href="/litepaper" data-nav="litepaper"><b>Litepaper</b><span>The design, as published.</span></a>
         <a href="/income" data-nav="income"><b>Income</b><span>What your card would mine, from the live network.</span></a>
-        <a href="/economics" data-nav="economics"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/acceptance" data-nav="acceptance"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
+        <a href="/economics" data-nav="economics"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/prize" data-nav="prize"><b>Prize</b><span>A better adversary or a reproduced shortcut, never a confirmation: the terms.</span></a><a href="/acceptance" data-nav="acceptance"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
         <a href="/ledger" data-nav="ledger"><b>Ledger</b><span>Every criticism, answered or conceded.</span></a>
         <a href="/claims" data-nav="claims"><b>What Igneum does not claim</b><span>The limits, stated first.</span></a>
         <a href="/randomx" data-nav="randomx"><b>Igneum vs RandomX</b><span>What was kept and what was rebuilt for GPUs.</span></a>
diff --git a/site/tx.html b/site/tx.html
index e4450e055..10bd7c285 100644
--- a/site/tx.html
+++ b/site/tx.html
@@ -157,7 +157,7 @@ main{padding-bottom:100px}.card{background:var(--row);border:1px solid var(--lin
         <div class="panel-list">
           <a href="/litepaper" data-nav="litepaper"><b>Litepaper</b><span>The design, as published.</span></a>
           <a href="/income" data-nav="income"><b>Income</b><span>What your card would mine, from the live network.</span></a>
-          <a href="/economics" data-nav="economics"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/acceptance" data-nav="acceptance"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
+          <a href="/economics" data-nav="economics"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/prize" data-nav="prize"><b>Prize</b><span>A better adversary or a reproduced shortcut, never a confirmation: the terms.</span></a><a href="/acceptance" data-nav="acceptance"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
           <a href="/ledger" data-nav="ledger"><b>Ledger</b><span>Every criticism, answered or conceded.</span></a>
           <a href="/claims" data-nav="claims"><b>What Igneum does not claim</b><span>The limits, stated first.</span></a>
           <a href="/randomx" data-nav="randomx"><b>Igneum vs RandomX</b><span>What was kept and what was rebuilt for GPUs.</span></a>
@@ -197,7 +197,7 @@ main{padding-bottom:100px}.card{background:var(--row);border:1px solid var(--lin
       <div class="sheet-group"><div class="sheet-head">Learn</div>
         <a href="/litepaper" data-nav="litepaper"><b>Litepaper</b><span>The design, as published.</span></a>
         <a href="/income" data-nav="income"><b>Income</b><span>What your card would mine, from the live network.</span></a>
-        <a href="/economics" data-nav="economics"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/acceptance" data-nav="acceptance"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
+        <a href="/economics" data-nav="economics"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/prize" data-nav="prize"><b>Prize</b><span>A better adversary or a reproduced shortcut, never a confirmation: the terms.</span></a><a href="/acceptance" data-nav="acceptance"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
         <a href="/ledger" data-nav="ledger"><b>Ledger</b><span>Every criticism, answered or conceded.</span></a>
         <a href="/claims" data-nav="claims"><b>What Igneum does not claim</b><span>The limits, stated first.</span></a>
         <a href="/randomx" data-nav="randomx"><b>Igneum vs RandomX</b><span>What was kept and what was rebuilt for GPUs.</span></a>
diff --git a/site/wallet.html b/site/wallet.html
index 0e0c5ae2c..b308d1e5c 100644
--- a/site/wallet.html
+++ b/site/wallet.html
@@ -139,7 +139,7 @@
         <div class="panel-list">
           <a href="/litepaper" data-nav="litepaper"><b>Litepaper</b><span>The design, as published.</span></a>
           <a href="/income" data-nav="income"><b>Income</b><span>What your card would mine, from the live network.</span></a>
-          <a href="/economics" data-nav="economics"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/acceptance" data-nav="acceptance"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
+          <a href="/economics" data-nav="economics"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/prize" data-nav="prize"><b>Prize</b><span>A better adversary or a reproduced shortcut, never a confirmation: the terms.</span></a><a href="/acceptance" data-nav="acceptance"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
           <a href="/ledger" data-nav="ledger"><b>Ledger</b><span>Every criticism, answered or conceded.</span></a>
           <a href="/claims" data-nav="claims"><b>What Igneum does not claim</b><span>The limits, stated first.</span></a>
           <a href="/randomx" data-nav="randomx"><b>Igneum vs RandomX</b><span>What was kept and what was rebuilt for GPUs.</span></a>
@@ -179,7 +179,7 @@
       <div class="sheet-group"><div class="sheet-head">Learn</div>
         <a href="/litepaper" data-nav="litepaper"><b>Litepaper</b><span>The design, as published.</span></a>
         <a href="/income" data-nav="income"><b>Income</b><span>What your card would mine, from the live network.</span></a>
-        <a href="/economics" data-nav="economics"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/acceptance" data-nav="acceptance"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
+        <a href="/economics" data-nav="economics"><b>Economics</b><span>The emission, the split and the fees, each with its line in the node.</span></a><a href="/scorecard" data-nav="scorecard"><b>Scorecard</b><span>The twelve acceptance gates, their evidence and where each stands.</span></a><a href="/prize" data-nav="prize"><b>Prize</b><span>A better adversary or a reproduced shortcut, never a confirmation: the terms.</span></a><a href="/acceptance" data-nav="acceptance"><b>Acceptance</b><span>The Test and Acceptance Standard, case by case, as each one passes.</span></a><a href="/audit" data-nav="audit"><b>Site audit</b><span>Every page, what the reset changed and what is open.</span></a><a href="/docs" data-nav="docs"><b>Documents</b><span>The plan, the standard, the specifications and the evidence files, by path.</span></a>
         <a href="/ledger" data-nav="ledger"><b>Ledger</b><span>Every criticism, answered or conceded.</span></a>
         <a href="/claims" data-nav="claims"><b>What Igneum does not claim</b><span>The limits, stated first.</span></a>
         <a href="/randomx" data-nav="randomx"><b>Igneum vs RandomX</b><span>What was kept and what was rebuilt for GPUs.</span></a>
diff --git a/tools/chip-model/rtl/Makefile b/tools/chip-model/rtl/Makefile
index dea28cc08..cf77c1d4e 100644
--- a/tools/chip-model/rtl/Makefile
+++ b/tools/chip-model/rtl/Makefile
@@ -23,8 +23,14 @@ CPUSET    = $(if $(LEASE_ON),--cpuset-cpus {cpuset},)
 DOCKER   := $(LEASEPFX) docker run --rm -u $(UID_GID) -e HOME=/tmp -e NUM_CORES=$(THREADS) $(CPUSET) -v $(WORK):/work
 ORFS     := $(DOCKER) -w /OpenROAD-flow-scripts/flow $(ORFS_IMG)
 SIM      := $(DOCKER) -w /work $(SIM_IMG)
+# NO_DOCKER=1: the box IS the ORFS image (a rented pod started from openroad/orfs:latest with iverilog installed
+# and /work a symlink to this directory); the same targets run natively.
+ifeq ($(NO_DOCKER),1)
+ORFS     := env NUM_CORES=$(THREADS) bash -c 'cd /OpenROAD-flow-scripts/flow && exec "$$@"' --
+SIM      := env
+endif
 
-DESIGNS  := arx mul prmt lop3 fold shfl xbar scratch tile core8 core32 core32r16 core8r64 core8i1k core8sel core32all
+DESIGNS  := arx mul prmt lop3 fold shfl xbar scratch tile core8 core32 core32r16 core8r64 core8i1k core8sel core32all core8g core8r64g coretm cs64 fp32
 top       = $(shell sed -n 's/^$(1) \([^ ]*\) .*/\1/p' flow/designs.txt)
 
 # per-family simulation tags (the op field fixed per row where the family has several ops)
@@ -37,13 +43,18 @@ SIMS_shfl    := mix
 SIMS_xbar    := mix
 SIMS_scratch := mix
 SIMS_tile    := mix
-SIMS_core8   := mix mixld:+loads=1
-SIMS_core32  := mix mixld:+loads=1
-SIMS_core32r16 := mix mixld:+loads=1
-SIMS_core8r64 := mix
+SIMS_core8 := s150:+cycles=150 s600:+cycles=600
+SIMS_core32 := s150:+cycles=150 s600:+cycles=600
+SIMS_core32r16 := s150:+cycles=150 s600:+cycles=600
+SIMS_core8r64 := s150:+cycles=150 s600:+cycles=600
 SIMS_core8i1k := mix
 SIMS_core8sel := mix
 SIMS_core32all := mix
+SIMS_core8g := s150:+cycles=150 s600:+cycles=600
+SIMS_core8r64g := s150:+cycles=150 s600:+cycles=600
+SIMS_coretm := mix
+SIMS_cs64 := s150:+cycles=150 s600:+cycles=600
+SIMS_fp32 := mix fadd:+op=0 fmul:+op=1 ffma:+op=2 fcvt:+op=3
 
 .PHONY: rows table clean
 
@@ -65,6 +76,7 @@ sim-%: flow-%
 
 power-%: sim-%
 	$(ORFS) make DESIGN_CONFIG=/work/flow/$*.mk RUN_SCRIPT=/work/flow/power.tcl RUN_LOG_NAME_STEM=power run 2>&1 | tee logs/power-$*.log
+	rm -f sim/$*/*.vcd   # the traces run to gigabytes each; the power log keeps every number (a full disk killed four runs on 8 October 2026)
 
 # synthesis-only row (no placement, no parasitics): the 14:45 fallback
 synth-%:
diff --git a/tools/chip-model/rtl/flow/asap7_icg_model.v b/tools/chip-model/rtl/flow/asap7_icg_model.v
new file mode 100644
index 000000000..bd9c405a8
--- /dev/null
+++ b/tools/chip-model/rtl/flow/asap7_icg_model.v
@@ -0,0 +1,12 @@
+// Behavioural model of the ASAP7 integrated clock gate (latch_posedge_precontrol: the enable is latched while the
+// clock is low, the gated clock is CLK AND the latched enable OR test). The liberty carries no function for it.
+module ICGx1_ASAP7_75t_R(input CLK, input ENA, input SE, output GCLK);
+  reg en = 0;
+  always @(CLK or ENA or SE) if (!CLK) en = ENA | SE;
+  assign GCLK = CLK & en;
+endmodule
+module ICGx2_ASAP7_75t_R(input CLK, input ENA, input SE, output GCLK);
+  reg en = 0;
+  always @(CLK or ENA or SE) if (!CLK) en = ENA | SE;
+  assign GCLK = CLK & en;
+endmodule
diff --git a/tools/chip-model/rtl/flow/collect.py b/tools/chip-model/rtl/flow/collect.py
index 842842019..79e01aff7 100644
--- a/tools/chip-model/rtl/flow/collect.py
+++ b/tools/chip-model/rtl/flow/collect.py
@@ -6,7 +6,7 @@ import re, sys, os, csv
 
 work = sys.argv[1] if len(sys.argv) > 1 else '.'
 # ops per cycle per design (the per-op divisor) and the GPU row each family is read against
-OPS = {'arx': 1, 'mul': 1, 'prmt': 1, 'lop3': 1, 'fold': 1, 'shfl': 32, 'xbar': 32, 'scratch': 1, 'tile': 512, 'core8': 8, 'core32': 32, 'core32r16': 32, 'core8r64': 8, 'core8i1k': 8, 'core8sel': 8, 'core32all': 32}
+OPS = {'arx': 1, 'mul': 1, 'prmt': 1, 'lop3': 1, 'fold': 1, 'shfl': 32, 'xbar': 32, 'scratch': 1, 'tile': 512, 'core8': 8, 'core32': 32, 'core32r16': 32, 'core8r64': 8, 'core8i1k': 8, 'core8sel': 8, 'core32all': 32, 'core8g': 8, 'core8r64g': 8, 'coretm': 1, 'cs64': 8, 'fp32': 1}
 # 5090 measured pJ per counted op: (unlocked, at the 1,300 MHz lock); 15.1a
 GPU = {
   'arx:mix': (11.3, 6.2), 'arx:add': (11.3, 6.2), 'arx:sub': (11.3, 6.2), 'arx:xor': (11.3, 6.2), 'arx:or': (11.3, 6.2),
@@ -17,7 +17,7 @@ GPU = {
   'shfl:mix': (55.8, 29.4), 'xbar:mix': (55.8, 29.4),
   'scratch:mix': (2400.0, 1400.0),   # the card's L2 hit (no shared-memory probe measured: owed)
   'tile:mix': (4.1, 2.2),
-  'core8:mix': (11.3, 6.2), 'core8:mixld': (11.3, 6.2), 'core32:mix': (11.3, 6.2), 'core32:mixld': (11.3, 6.2), 'core32r16:mix': (11.3, 6.2), 'core8r64:mix': (11.3, 6.2), 'core8i1k:mix': (11.3, 6.2), 'core8sel:mix': (11.3, 6.2), 'core32all:mix': (11.3, 6.2),  # the class v4 draw: read against int_arx (the packs job read the whole mix at 10.8 / 6.4)            # dependent u8 m8n8k16 per MAC; the wide s8 tile reads 1.36 / 0.83
+  'core8:mix': (11.3, 6.2), 'core8:mixld': (11.3, 6.2), 'core32:mix': (11.3, 6.2), 'core32:mixld': (11.3, 6.2), 'core32r16:mix': (11.3, 6.2), 'core8r64:mix': (11.3, 6.2), 'core8i1k:mix': (11.3, 6.2), 'core8sel:mix': (11.3, 6.2), 'core32all:mix': (11.3, 6.2), 'core8g:mix': (11.3, 6.2), 'core8r64g:mix': (11.3, 6.2), 'coretm:mix': (11.3, 6.2), 'cs64:mix': (11.3, 6.2), 'fp32:mix': (9.2, 5.2), 'fp32:fadd': (9.2, 5.2), 'fp32:fmul': (9.2, 5.2), 'fp32:ffma': (9.2, 5.2), 'fp32:fcvt': (9.2, 5.2),  # the class v4 draw: read against int_arx (the packs job read the whole mix at 10.8 / 6.4)            # dependent u8 m8n8k16 per MAC; the wide s8 tile reads 1.36 / 0.83
 }
 # per-node energy scaling from ASAP7 (a 7 nm-class predictive PDK at 0.70 V), approximate and claimed:
 # N7 -> N5 x0.70 (TSMC: "30 percent lower power at the same speed"), N5 -> N3E x0.72 (TSMC: 25 to 30 percent),
@@ -67,10 +67,10 @@ for d in OPS:
     pairs = [('vcd:s150', 'vcd:s600', 150, 600), ('vcd:short', 'vcd:synth', 150, 800), ('vcd:s150', 'vcd:s400', 150, 400)]
     for sh, lg, cs, cl in pairs:
         if sh in rows and lg in rows:
-            rows['vcd:steady'] = steady(rows, period, sh, lg, cs, cl, 1028 if d in ('core8i1k', 'core32all') else LOAD_CYCLES)
+            rows['vcd:steady'] = steady(rows, period, sh, lg, cs, cl, 1028 if d in ('core8i1k', 'core32all') else (452 if d == 'cs64' else LOAD_CYCLES))
     for tag, r in rows.items():
         sub = tag.split(':')[1] if ':' in tag else 'prop'
-        key = f'{d}:{sub}' if sub in ('add','sub','xor','or','rotl','rotr','mul','mulhi','mad','mixld') else f'{d}:mix'
+        key = f'{d}:{sub}' if sub in ('add','sub','xor','or','rotl','rotr','mul','mulhi','mad','mixld','fadd','fmul','ffma','fcvt') else f'{d}:mix'
         gpu = GPU.get(key, (None, None))
         pj = r['total'] * period * 1e-12 / OPS[d] * 1e12  # W * s / ops -> pJ
         pj_dyn = (r['internal'] + r['switching']) * period / OPS[d]
diff --git a/tools/chip-model/rtl/flow/core8g.mk b/tools/chip-model/rtl/flow/core8g.mk
new file mode 100644
index 000000000..c2601b8b8
--- /dev/null
+++ b/tools/chip-model/rtl/flow/core8g.mk
@@ -0,0 +1,18 @@
+# ORFS design config for the programmable shadow core (core8: core_v6_8), ASAP7.
+export PLATFORM               = asap7
+export DESIGN_NAME            = core_v6_8
+export DESIGN_NICKNAME        = core8g
+export VERILOG_FILES          = /work/rtl/core_v6_8.v
+export VERILOG_INCLUDE_DIRS   = /work/rtl
+export SDC_FILE               = /work/flow/core8g.sdc
+export CORE_UTILIZATION       = 40
+export CORE_ASPECT_RATIO      = 1
+export CORE_MARGIN            = 0.5
+export PLACE_DENSITY          = 0.55
+export CORNER                 = TC
+export SKIP_LAST_GASP         = 1
+export WORK_HOME              = /work/out/core8g
+export SYNTH_MEMORY_MAX_BITS  = 2000000
+# the adversary's register file: clock gating inferred (the ICG cells allowed back in)
+export INFER_CLKGATES         = 1
+export DONT_USE_CELLS         = *x1p*_ASAP7* *xp*_ASAP7* SDF*
diff --git a/tools/chip-model/rtl/flow/core8g.sdc b/tools/chip-model/rtl/flow/core8g.sdc
new file mode 100644
index 000000000..10f3be2bd
--- /dev/null
+++ b/tools/chip-model/rtl/flow/core8g.sdc
@@ -0,0 +1,10 @@
+current_design core_v6_8
+set clk_name core_clock
+set clk_port_name clk
+set clk_period 1500
+set clk_io_pct 0.2
+set clk_port [get_ports $clk_port_name]
+create_clock -name $clk_name -period $clk_period $clk_port
+set non_clock_inputs [all_inputs -no_clocks]
+set_input_delay [expr $clk_period * $clk_io_pct] -clock $clk_name $non_clock_inputs
+set_output_delay [expr $clk_period * $clk_io_pct] -clock $clk_name [all_outputs]
diff --git a/tools/chip-model/rtl/flow/core8r64g.mk b/tools/chip-model/rtl/flow/core8r64g.mk
new file mode 100644
index 000000000..e43857538
--- /dev/null
+++ b/tools/chip-model/rtl/flow/core8r64g.mk
@@ -0,0 +1,18 @@
+# ORFS design config for the programmable shadow core (core8: core_v6_8r64), ASAP7.
+export PLATFORM               = asap7
+export DESIGN_NAME            = core_v6_8r64
+export DESIGN_NICKNAME        = core8r64g
+export VERILOG_FILES          = /work/rtl/core_v6_8r64.v
+export VERILOG_INCLUDE_DIRS   = /work/rtl
+export SDC_FILE               = /work/flow/core8r64g.sdc
+export CORE_UTILIZATION       = 40
+export CORE_ASPECT_RATIO      = 1
+export CORE_MARGIN            = 0.5
+export PLACE_DENSITY          = 0.55
+export CORNER                 = TC
+export SKIP_LAST_GASP         = 1
+export WORK_HOME              = /work/out/core8r64g
+export SYNTH_MEMORY_MAX_BITS  = 2000000
+# the adversary's register file: clock gating inferred (the ICG cells allowed back in)
+export INFER_CLKGATES         = 1
+export DONT_USE_CELLS         = *x1p*_ASAP7* *xp*_ASAP7* SDF*
diff --git a/tools/chip-model/rtl/flow/core8r64g.sdc b/tools/chip-model/rtl/flow/core8r64g.sdc
new file mode 100644
index 000000000..ffb92a9cd
--- /dev/null
+++ b/tools/chip-model/rtl/flow/core8r64g.sdc
@@ -0,0 +1,10 @@
+current_design core_v6_8r64
+set clk_name core_clock
+set clk_port_name clk
+set clk_period 1500
+set clk_io_pct 0.2
+set clk_port [get_ports $clk_port_name]
+create_clock -name $clk_name -period $clk_period $clk_port
+set non_clock_inputs [all_inputs -no_clocks]
+set_input_delay [expr $clk_period * $clk_io_pct] -clock $clk_name $non_clock_inputs
+set_output_delay [expr $clk_period * $clk_io_pct] -clock $clk_name [all_outputs]
diff --git a/tools/chip-model/rtl/flow/coretm.mk b/tools/chip-model/rtl/flow/coretm.mk
new file mode 100644
index 000000000..ee4daff66
--- /dev/null
+++ b/tools/chip-model/rtl/flow/coretm.mk
@@ -0,0 +1,18 @@
+# ORFS design config for the programmable shadow core (core8: core_tm_8r64), ASAP7.
+export PLATFORM               = asap7
+export DESIGN_NAME            = core_tm_8r64
+export DESIGN_NICKNAME        = coretm
+export VERILOG_FILES          = /work/rtl/core_tm_8r64.v
+export VERILOG_INCLUDE_DIRS   = /work/rtl
+export SDC_FILE               = /work/flow/coretm.sdc
+export CORE_UTILIZATION       = 40
+export CORE_ASPECT_RATIO      = 1
+export CORE_MARGIN            = 0.5
+export PLACE_DENSITY          = 0.55
+export CORNER                 = TC
+export SKIP_LAST_GASP         = 1
+export WORK_HOME              = /work/out/coretm
+export SYNTH_MEMORY_MAX_BITS  = 2000000
+# the adversary's register file: clock gating inferred (the ICG cells allowed back in)
+export INFER_CLKGATES         = 1
+export DONT_USE_CELLS         = *x1p*_ASAP7* *xp*_ASAP7* SDF*
diff --git a/tools/chip-model/rtl/flow/coretm.sdc b/tools/chip-model/rtl/flow/coretm.sdc
new file mode 100644
index 000000000..904853df5
--- /dev/null
+++ b/tools/chip-model/rtl/flow/coretm.sdc
@@ -0,0 +1,10 @@
+current_design core_tm_8r64
+set clk_name core_clock
+set clk_port_name clk
+set clk_period 1500
+set clk_io_pct 0.2
+set clk_port [get_ports $clk_port_name]
+create_clock -name $clk_name -period $clk_period $clk_port
+set non_clock_inputs [all_inputs -no_clocks]
+set_input_delay [expr $clk_period * $clk_io_pct] -clock $clk_name $non_clock_inputs
+set_output_delay [expr $clk_period * $clk_io_pct] -clock $clk_name [all_outputs]
diff --git a/tools/chip-model/rtl/flow/cs64.mk b/tools/chip-model/rtl/flow/cs64.mk
new file mode 100644
index 000000000..66f9c9f51
--- /dev/null
+++ b/tools/chip-model/rtl/flow/cs64.mk
@@ -0,0 +1,18 @@
+# ORFS design config for the programmable shadow core (core8: core_v6_8cs64), ASAP7.
+export PLATFORM               = asap7
+export DESIGN_NAME            = core_v6_8cs64
+export DESIGN_NICKNAME        = cs64
+export VERILOG_FILES          = /work/rtl/core_v6_8cs64.v
+export VERILOG_INCLUDE_DIRS   = /work/rtl
+export SDC_FILE               = /work/flow/cs64.sdc
+export CORE_UTILIZATION       = 40
+export CORE_ASPECT_RATIO      = 1
+export CORE_MARGIN            = 0.5
+export PLACE_DENSITY          = 0.55
+export CORNER                 = TC
+export SKIP_LAST_GASP         = 1
+export WORK_HOME              = /work/out/cs64
+export SYNTH_MEMORY_MAX_BITS  = 2000000
+# the adversary's register file: clock gating inferred (the ICG cells allowed back in)
+export INFER_CLKGATES         = 1
+export DONT_USE_CELLS         = *x1p*_ASAP7* *xp*_ASAP7* SDF*
diff --git a/tools/chip-model/rtl/flow/cs64.sdc b/tools/chip-model/rtl/flow/cs64.sdc
new file mode 100644
index 000000000..8ab79b15b
--- /dev/null
+++ b/tools/chip-model/rtl/flow/cs64.sdc
@@ -0,0 +1,10 @@
+current_design core_v6_8cs64
+set clk_name core_clock
+set clk_port_name clk
+set clk_period 1500
+set clk_io_pct 0.2
+set clk_port [get_ports $clk_port_name]
+create_clock -name $clk_name -period $clk_period $clk_port
+set non_clock_inputs [all_inputs -no_clocks]
+set_input_delay [expr $clk_period * $clk_io_pct] -clock $clk_name $non_clock_inputs
+set_output_delay [expr $clk_period * $clk_io_pct] -clock $clk_name [all_outputs]
diff --git a/tools/chip-model/rtl/flow/designs.txt b/tools/chip-model/rtl/flow/designs.txt
index af4f9566e..292d1983d 100644
--- a/tools/chip-model/rtl/flow/designs.txt
+++ b/tools/chip-model/rtl/flow/designs.txt
@@ -14,3 +14,8 @@ core8r64 core_v6_8r64 1500
 core8i1k core_v6_8i1k 1500
 core8sel core_v6_8sel 1500
 core32all core_v6_32all 1500
+core8g core_v6_8 1500
+core8r64g core_v6_8r64 1500
+coretm core_tm_8r64 1500
+cs64 core_v6_8cs64 1500
+fp32 lane_fp32 2000
diff --git a/tools/chip-model/rtl/flow/fp32.mk b/tools/chip-model/rtl/flow/fp32.mk
new file mode 100644
index 000000000..cb508f48a
--- /dev/null
+++ b/tools/chip-model/rtl/flow/fp32.mk
@@ -0,0 +1,15 @@
+# ORFS design config for the mul shadow-core family (top lane_fp32), ASAP7.
+export PLATFORM               = asap7
+export DESIGN_NAME            = lane_fp32
+export DESIGN_NICKNAME        = fp32
+export VERILOG_FILES          = /work/rtl/fp32_units.v
+export VERILOG_INCLUDE_DIRS   = /work/rtl
+export SDC_FILE               = /work/flow/fp32.sdc
+export CORE_UTILIZATION       = 40
+export CORE_ASPECT_RATIO      = 1
+export CORE_MARGIN            = 0.5
+export PLACE_DENSITY          = 0.55
+export CORNER                 = TC
+export SKIP_LAST_GASP         = 1
+export WORK_HOME              = /work/out/fp32
+
diff --git a/tools/chip-model/rtl/flow/fp32.sdc b/tools/chip-model/rtl/flow/fp32.sdc
new file mode 100644
index 000000000..b729bbae1
--- /dev/null
+++ b/tools/chip-model/rtl/flow/fp32.sdc
@@ -0,0 +1,10 @@
+current_design lane_fp32
+set clk_name core_clock
+set clk_port_name clk
+set clk_period 2000
+set clk_io_pct 0.2
+set clk_port [get_ports $clk_port_name]
+create_clock -name $clk_name -period $clk_period $clk_port
+set non_clock_inputs [all_inputs -no_clocks]
+set_input_delay [expr $clk_period * $clk_io_pct] -clock $clk_name $non_clock_inputs
+set_output_delay [expr $clk_period * $clk_io_pct] -clock $clk_name [all_outputs]
diff --git a/tools/chip-model/rtl/flow/livestate.py b/tools/chip-model/rtl/flow/livestate.py
new file mode 100644
index 000000000..f729ddd05
--- /dev/null
+++ b/tools/chip-model/rtl/flow/livestate.py
@@ -0,0 +1,79 @@
+#!/usr/bin/env python3
+"""Live-state analysis of a drawn shadow program on an R-register window (the coordinator's order, 15:3x UK).
+The program is drawn as the core testbench draws it: NPROG instructions with the class v4 op weights, a load on
+one instruction in 16 (the dependent memory wait), dst/src/src2 uniform over the R registers, and the result
+fold reading every register at the end of the block. For every load (wait) the script reports the live set:
+registers whose current value is read later (by an instruction, a later address, or the fold) before being
+overwritten, split into those that feed a later ADDRESS or the RESULT and those that die inside an arithmetic
+block. Dead writes (overwritten before any read) are counted too. Usage: livestate.py R [NPROG] [seeds]"""
+import random, sys
+R = int(sys.argv[1]) if len(sys.argv) > 1 else 64
+N = int(sys.argv[2]) if len(sys.argv) > 2 else 256
+SEEDS = int(sys.argv[3]) if len(sys.argv) > 3 else 64
+W = [('add',12),('xor',10),('mul',8),('mad',8),('shfl',8),('rotl',7),('sub',6),('mulhi',6),('rotr',6),('or',4)]
+ops = [o for o,w in W for _ in range(w)]
+def draw(rng):
+    prog = []
+    for k in range(N):
+        op = 'load' if k % 16 == 15 else rng.choice(ops)
+        d, s, s2 = rng.randrange(R), rng.randrange(R), rng.randrange(R)
+        reads = [s] if op not in ('load',) else [s]            # the load's address comes from src
+        if op in ('add','xor','mul','mad','sub','or','rotr','shfl','mulhi','rotl'): reads.append(d)   # dst is read too (r[d] op= ...)
+        if op == 'mad': reads.append(s2)
+        if op == 'rotl': reads = [d]
+        prog.append((op, d, reads))
+    return prog
+tot_live = tot_addr = tot_dead = tot_waits = 0
+live_min, live_max = R, 0
+for seed in range(SEEDS):
+    rng = random.Random(seed)
+    prog = draw(rng)
+    # a value's "version" = (reg, write index); the fold at the end reads every register
+    # forward pass: for each instruction i and register r, next read of r's current value before its next write
+    n = len(prog)
+    # necessity: a version is NECESSARY if it reaches an address (a load's src) or the fold, transitively
+    # compute transitively by backward dataflow over versions
+    writes_at = {}   # (i) -> reg written
+    # build version ids: version of reg r valid after instruction i
+    cur = {r: ('init', r) for r in range(R)}
+    uses = {}        # version -> list of (consumer index, consumer version or 'addr'/'fold')
+    versions = set(cur.values())
+    deps = {}        # version -> set of versions it reads
+    for i, (op, d, reads) in enumerate(prog):
+        srcs = [cur[r] for r in reads]
+        if op == 'load':
+            v = ('load', i); deps[v] = set()   # the returned word: its ADDRESS depends on srcs
+            for s in srcs: uses.setdefault(s, []).append(('addr', i))
+        else:
+            v = (op, i); deps[v] = set(srcs)
+            for s in srcs: uses.setdefault(s, []).append(('op', i))
+        cur[d] = v; versions.add(v)
+    fold = set(cur.values())
+    # necessary = reaches an address or the fold
+    necessary = set(fold)
+    for v, us in uses.items():
+        if any(k == 'addr' for k, _ in us): necessary.add(v)
+    changed = True
+    while changed:
+        changed = False
+        for v in list(versions):
+            if v in necessary:
+                for s in deps.get(v, ()):
+                    if s not in necessary: necessary.add(s); changed = True
+    # per wait: the versions live at the load (written before it, read after it)
+    last_read = {}
+    for v, us in uses.items():
+        last_read[v] = max(i for _, i in us)
+    for v in fold: last_read[v] = n
+    written_at = {v: (v[1] if v[0] != 'init' else -1) for v in versions}
+    for i, (op, d, reads) in enumerate(prog):
+        if op != 'load': continue
+        live = [v for v in versions if written_at[v] < i and last_read.get(v, -1) > i]
+        nec = [v for v in live if v in necessary]
+        tot_live += len(live); tot_addr += len(nec); tot_waits += 1
+        live_min = min(live_min, len(live)); live_max = max(live_max, len(live))
+    dead = sum(1 for v in versions if v[0] not in ('init',) and v not in uses and v not in fold)
+    tot_dead += dead
+print(f'R = {R}, NPROG = {N}, {SEEDS} drawn programs, {tot_waits} waits')
+print(f'live values at a wait: mean {tot_live/tot_waits:.1f} of {R} (min {live_min}, max {live_max}); of which necessary (reach a later address or the result): {tot_addr/tot_waits:.1f}')
+print(f'dead writes (overwritten before any read): {tot_dead/SEEDS:.1f} per {N}-instruction block ({100*tot_dead/SEEDS/N:.1f} percent)')
diff --git a/tools/chip-model/rtl/flow/pod.sh b/tools/chip-model/rtl/flow/pod.sh
new file mode 100755
index 000000000..8344fc4ab
--- /dev/null
+++ b/tools/chip-model/rtl/flow/pod.sh
@@ -0,0 +1,9 @@
+#!/usr/bin/env bash
+# pod.sh: bootstrap a rented pod started from openroad/orfs:latest (RunPod, root): iverilog, /work -> this dir.
+set -euo pipefail
+cd "$(dirname "$0")/.."
+export DEBIAN_FRONTEND=noninteractive
+command -v iverilog >/dev/null || { apt-get update -qq >/dev/null 2>&1; apt-get install -y -qq iverilog rsync python3 >/dev/null 2>&1; }
+[ -e /work ] || ln -s "$(pwd)" /work
+export PATH=/OpenROAD-flow-scripts/tools/install/OpenROAD/bin:/OpenROAD-flow-scripts/tools/install/yosys/bin:$PATH
+echo "pod ready: $(nproc) cores, $(free -g | awk '/Mem/{print $2}') GB, yosys $(yosys -V | cut -d' ' -f2), $(which iverilog)"
diff --git a/tools/chip-model/rtl/flow/sim.sh b/tools/chip-model/rtl/flow/sim.sh
index 88b05666d..f288d1c23 100755
--- a/tools/chip-model/rtl/flow/sim.sh
+++ b/tools/chip-model/rtl/flow/sim.sh
@@ -4,6 +4,7 @@ set -euo pipefail
 name=$1; tag=$2; shift 2
 out=/work/sim/$name
 simcells=$(yosys-config --datdir)/simcells.v
-iverilog -g2005 -I /work/tb -o $out/sim_$tag $out/sim_net.v /work/tb/tb_$(sed -n "s/^$name \([^ ]*\) .*/\1/p" /work/flow/designs.txt).v $simcells
+tbfile=${TB:-/work/tb/tb_$(sed -n "s/^$name \([^ ]*\) .*/\1/p" /work/flow/designs.txt).v}
+iverilog -g2005 -I /work/tb -o $out/sim_$tag $out/sim_net.v /work/flow/asap7_icg_model.v $tbfile $simcells
 ( cd $out && vvp -n sim_$tag "$@" | tee sim_$tag.log && mv dump.vcd $tag.vcd )
 ls -la $out/$tag.vcd
diff --git a/tools/chip-model/rtl/rtl/core_tm.v b/tools/chip-model/rtl/rtl/core_tm.v
new file mode 100644
index 000000000..3e702511b
--- /dev/null
+++ b/tools/chip-model/rtl/rtl/core_tm.v
@@ -0,0 +1,82 @@
+// The adversary's time-multiplexed core: ONE execution port (every class unit, once) serving LANES lanes' instruction
+// streams round-robin, each lane's state (REGS x 32-bit) kept in its own bank; the imem and sequencer shared.
+// One lane-op per cycle. Compared with core_v6 at the same LANES x REGS this removes LANES-1 copies of the units and
+// keeps the register state and the imem: the energy per lane-op is the state's cost plus one unit set's.
+// The butterfly shuffle across lanes needs every lane's source register in the same cycle, so the shuffle reads the
+// bank-wide source column (as the SIMD core does) and the lane in turn takes its word. Loads return on ld_val.
+`include "lane_common.vh"
+module core_tm #(parameter LANES = 8, parameter LOG_LANES = 3, parameter REGS = 64, parameter LOG_REGS = 6,
+                 parameter IW = 40, parameter IMEM_LOG = 8) (
+  input clk, input rst, input run,
+  input prog_we, input [9:0] prog_addr, input [IW-1:0] prog_data,
+  input cfg_en, input [9:0] cfg_n, input [31:0] cfg_m, input [4:0] cfg_r, input [31:0] cfg_wm, input [31:0] cfg_off, input [31:0] cfg_mask, input [63:0] cfg_sel,
+  input [31:0] ld_val,
+  output [31:0] addr, output [31:0] out);
+  localparam IMEM = 1 << IMEM_LOG;
+  reg [IW-1:0] imem [0:IMEM-1];
+  reg [IMEM_LOG-1:0] pc; reg [IMEM_LOG-1:0] n_q; reg [IW-1:0] ir; reg [LOG_LANES-1:0] lane;
+  reg [31:0] m_q, wm_q, off_q, mask_q; reg [4:0] r_q;
+  integer i;
+  // the sequencer: the same instruction is issued to each lane in turn (LANES cycles per instruction)
+  always @(posedge clk) begin
+    if (prog_we) imem[prog_addr[IMEM_LOG-1:0]] <= prog_data;
+    if (rst) begin pc <= 0; ir <= 0; lane <= 0; n_q <= {IMEM_LOG{1'b1}}; m_q <= 32'h9e3779b1; r_q <= 5'd13; wm_q <= 32'h0fffffc0; off_q <= 3; mask_q <= 32'h0fffffff; end
+    else begin
+      if (cfg_en) begin n_q <= cfg_n[IMEM_LOG-1:0]; m_q <= cfg_m | 1; r_q <= cfg_r; wm_q <= cfg_wm; off_q <= cfg_off; mask_q <= cfg_mask; end
+      if (run) begin
+        if (lane == {LOG_LANES{1'b1}}) begin ir <= imem[pc]; pc <= (pc == n_q) ? {IMEM_LOG{1'b0}} : pc + 1'b1; end
+        lane <= lane + 1'b1;
+      end
+    end
+  end
+  wire [3:0] op = ir[3:0];
+  wire [LOG_REGS-1:0] dst = ir[4 +: LOG_REGS]; wire [LOG_REGS-1:0] src = ir[4+LOG_REGS +: LOG_REGS]; wire [LOG_REGS-1:0] src2 = ir[4+2*LOG_REGS +: LOG_REGS];
+  wire [4:0] imm = ir[4+3*LOG_REGS +: 5]; wire [7:0] aux = ir[9+3*LOG_REGS +: 8];
+  wire is_load = (op == 4'd12);
+  wire [4:0] rn = (imm == 0) ? 5'd1 : imm;
+  wire [LOG_LANES-1:0] smask = imm[LOG_LANES-1:0];
+  // the banked state: one bank per lane, read through the lane select (a chip's SRAM bank select)
+  reg [31:0] rf [0:LANES*REGS-1];
+  wire [31:0] d = rf[lane*REGS + dst];
+  wire [31:0] s = rf[lane*REGS + src];
+  wire [31:0] s2 = rf[lane*REGS + src2];
+  wire [31:0] sx = rf[(lane ^ smask)*REGS + src];      // the shuffle partner's source word
+  // the one execution port
+  function [7:0] pick; input [63:0] b; input [3:0] k; reg [7:0] v;
+    begin v = b[8*k[2:0] +: 8]; pick = k[3] ? {8{v[7]}} : v; end
+  endfunction
+  wire [4:0] sn = (s[4:0] == 0) ? 5'd1 : s[4:0];
+  wire mad = (op == 4'd8);
+  wire [63:0] p = (mad ? s : d) * (mad ? s2 : s);
+  wire [63:0] bytes = {s, d}; wire [15:0] sel = {aux, aux};
+  wire [31:0] prm = {pick(bytes, sel[15:12]), pick(bytes, sel[11:8]), pick(bytes, sel[7:4]), pick(bytes, sel[3:0])};
+  reg [31:0] lp; integer b;
+  always @* for (b = 0; b < 32; b = b + 1) lp[b] = aux[{d[b], s[b], s2[b]}];
+  reg [31:0] r;
+  always @* begin
+    case (op)
+      4'd0, 4'd13: r = d + s;
+      4'd1, 4'd15: r = d - s;
+      4'd2, 4'd14: r = d ^ s;
+      4'd3: r = d | s;
+      4'd4: r = `ROTL32(d, rn);
+      4'd5: r = `ROTR32(d, sn);
+      4'd6: r = p[31:0];
+      4'd7: r = p[63:32];
+      4'd8: r = p[31:0] + d;
+      4'd9: r = d ^ sx;
+      4'd10: r = prm;
+      4'd11: r = lp;
+      default: r = ld_val ^ (32'h9e3779b9 * (lane + 1));
+    endcase
+  end
+  wire [31:0] fx = s * m_q;
+  wire [4:0] frn = (r_q == 0) ? 5'd1 : r_q;
+  wire [31:0] fy = `ROTL32(fx, frn);
+  assign addr = is_load ? (((fy & wm_q) | off_q) & mask_q) : 32'd0;
+  always @(posedge clk) begin
+    if (rst) begin for (i = 0; i < LANES*REGS; i = i + 1) rf[i] <= 32'h9e3779b9 * (i + 1); end
+    else if (run) rf[lane*REGS + dst] <= r;
+  end
+  assign out = r;
+endmodule
diff --git a/tools/chip-model/rtl/rtl/core_tm_8r64.v b/tools/chip-model/rtl/rtl/core_tm_8r64.v
new file mode 100644
index 000000000..5db91edc4
--- /dev/null
+++ b/tools/chip-model/rtl/rtl/core_tm_8r64.v
@@ -0,0 +1,7 @@
+`include "core_tm.v"
+module core_tm_8r64(input clk, input rst, input run, input prog_we, input [9:0] prog_addr, input [39:0] prog_data,
+  input cfg_en, input [9:0] cfg_n, input [31:0] cfg_m, input [4:0] cfg_r, input [31:0] cfg_wm, input [31:0] cfg_off, input [31:0] cfg_mask, input [63:0] cfg_sel,
+  input [31:0] ld_val, output [31:0] addr, output [31:0] out);
+  core_tm #(.LANES(8), .LOG_LANES(3), .REGS(64), .LOG_REGS(6), .IW(40)) c(.clk(clk), .rst(rst), .run(run), .prog_we(prog_we), .prog_addr(prog_addr), .prog_data(prog_data),
+    .cfg_en(cfg_en), .cfg_n(cfg_n), .cfg_m(cfg_m), .cfg_r(cfg_r), .cfg_wm(cfg_wm), .cfg_off(cfg_off), .cfg_mask(cfg_mask), .cfg_sel(cfg_sel), .ld_val(ld_val), .addr(addr), .out(out));
+endmodule
diff --git a/tools/chip-model/rtl/rtl/core_v6_8cs64.v b/tools/chip-model/rtl/rtl/core_v6_8cs64.v
new file mode 100644
index 000000000..4d482e2c8
--- /dev/null
+++ b/tools/chip-model/rtl/rtl/core_v6_8cs64.v
@@ -0,0 +1,7 @@
+`include "core_v6.v"
+module core_v6_8cs64(input clk, input rst, input run, input prog_we, input [9:0] prog_addr, input [40-1:0] prog_data,
+  input cfg_en, input [9:0] cfg_n, input [63:0] cfg_sel, input [31:0] cfg_m, input [4:0] cfg_r, input [31:0] cfg_wm, input [31:0] cfg_off, input [31:0] cfg_mask,
+  input [31:0] ld_val, output [31:0] addr, output [31:0] out);
+  core_v6 #(.LANES(8), .LOG_LANES(3), .REGS(64), .LOG_REGS(6), .IW(40), .IMEM_LOG(9)) c(.clk(clk), .rst(rst), .run(run), .prog_we(prog_we), .prog_addr(prog_addr), .prog_data(prog_data),
+    .cfg_en(cfg_en), .cfg_n(cfg_n), .cfg_sel(cfg_sel), .cfg_m(cfg_m), .cfg_r(cfg_r), .cfg_wm(cfg_wm), .cfg_off(cfg_off), .cfg_mask(cfg_mask), .ld_val(ld_val), .addr(addr), .out(out));
+endmodule
diff --git a/tools/chip-model/rtl/rtl/fp32_units.v b/tools/chip-model/rtl/rtl/fp32_units.v
new file mode 100644
index 000000000..73a76c0a4
--- /dev/null
+++ b/tools/chip-model/rtl/rtl/fp32_units.v
@@ -0,0 +1,123 @@
+// The adversary's simplified FP32 units for the mixed-resource lane's candidate (class-v6-mixedfp): inputs are
+// f(x) = as_float((x & 0x807FFFFF) | ((96 + ((x >> 23) & 63)) << 23)): never zero, denormal, NaN or Inf; exponents
+// in [96, 159]; results normal or +0 (exact cancellation). The units drop NaN/Inf/denormal handling and the flags,
+// keep the full 24-bit mantissa path, a full alignment and a full normaliser (the mantissas are uniform), RNE.
+// Each lane reads two or three registers of an 8 x 32-bit window, applies f(), computes, xors the bits into dst.
+`include "lane_common.vh"
+// ---- the shared pieces ----
+module fp_unpack(input [31:0] x, output s, output [8:0] e, output [23:0] m);
+  assign s = x[31];
+  assign e = 9'd96 + {3'b0, x[28:23]};    // the masked exponent, 96..159
+  assign m = {1'b1, x[22:0]};
+endmodule
+module lzc48(input [47:0] v, output reg [5:0] n);   // leading-zero count (v != 0)
+  integer i; always @* begin n = 6'd47; for (i = 47; i >= 0; i = i - 1) if (v[i]) begin n = 6'd47 - i; i = -1; end end
+endmodule
+module lzc32(input [31:0] v, output reg [5:0] n);
+  integer i; always @* begin n = 6'd31; for (i = 31; i >= 0; i = i - 1) if (v[i]) begin n = 6'd31 - i; i = -1; end end
+endmodule
+// ---- the FMA: fma(a, b, c) = a*b + c, one rounding (RNE), exponents in the lane's ranges ----
+module fp_fma(input [31:0] a, input [31:0] b, input [31:0] c, output [31:0] y);
+  wire sa, sb, sc; wire [8:0] ea, eb, ec; wire [23:0] ma, mb, mc;
+  fp_unpack ua(a, sa, ea, ma); fp_unpack ub(b, sb, eb, mb); fp_unpack uc(c, sc, ec, mc);
+  wire [47:0] prod = ma * mb;                       // 48-bit product, binary point after bit 46
+  wire sp = sa ^ sb;
+  wire [9:0] ep = {1'b0, ea} + {1'b0, eb} - 10'd127; // product exponent (bias kept), 65..192
+  // align the addend to the product: a 100-bit window keeps full precision for exponent gaps up to about 96 (the lane's bound)
+  wire [9:0] diff = (ep >= {1'b0, ec}) ? ep - {1'b0, ec} : {1'b0, ec} - ep;
+  wire prod_big = (ep >= {1'b0, ec});
+  wire [99:0] pw = {2'b0, prod, 50'b0};
+  wire [99:0] cw = {2'b0, mc, 24'b0, 50'b0};        // the addend at the product's scale when exponents equal
+  wire [6:0] sh = (diff > 10'd99) ? 7'd99 : diff[6:0];
+  wire [99:0] smw = prod_big ? (cw >> sh) : (pw >> sh);
+  wire [99:0] bgw = prod_big ? pw : cw;
+  wire sbig = prod_big ? sp : sc; wire ssmall = prod_big ? sc : sp;
+  wire [9:0] ebig = prod_big ? ep : {1'b0, ec};
+  wire [100:0] sum = (sbig == ssmall) ? ({1'b0, bgw} + {1'b0, smw}) : ({1'b0, bgw} - {1'b0, smw});
+  wire [100:0] mag = sum[100] ? (~sum + 1'b1) : sum;   // two's complement when the subtraction went negative
+  wire ssum = sum[100] ? ssmall : sbig;
+  // normalise: find the leading one in the 101-bit magnitude
+  reg [6:0] lz; integer i;
+  always @* begin lz = 7'd100; for (i = 100; i >= 0; i = i - 1) if (mag[i]) begin lz = 7'd100 - i; i = -1; end end
+  wire [100:0] norm = mag << lz;                      // leading one at bit 100
+  wire [23:0] mant = norm[100:77];
+  wire guard = norm[76]; wire sticky = |norm[75:0];
+  wire round_up = guard & (sticky | mant[0]);
+  wire [24:0] mr = {1'b0, mant} + round_up;
+  wire carry = mr[24];
+  wire [9:0] eres = ebig + 10'd2 - lz + carry;       // the leading one of bgw sat at bit 98 (two headroom bits)
+  wire zero = (mag == 0);
+  wire [7:0] eout = eres[7:0];
+  assign y = zero ? 32'h0 : {ssum, eout, carry ? mr[23:1] : mr[22:0]};
+endmodule
+// ---- the adder and the multiplier as their own units ----
+module fp_add(input [31:0] a, input [31:0] b, output [31:0] y);
+  wire sa, sb; wire [8:0] ea, eb; wire [23:0] ma, mb;
+  fp_unpack ua(a, sa, ea, ma); fp_unpack ub(b, sb, eb, mb);
+  wire abig = (ea > eb) || (ea == eb && ma >= mb);
+  wire [8:0] ebig = abig ? ea : eb; wire [8:0] esm = abig ? eb : ea;
+  wire [23:0] mbig = abig ? ma : mb; wire [23:0] msm = abig ? mb : ma;
+  wire sbig = abig ? sa : sb; wire ssm = abig ? sb : sa;
+  wire [8:0] diff = ebig - esm; wire [6:0] sh = (diff > 9'd70) ? 7'd70 : diff[6:0];
+  wire [73:0] bw = {1'b0, mbig, 49'b0}; wire [73:0] sw = {1'b0, msm, 49'b0} >> sh;
+  wire [74:0] sum = (sbig == ssm) ? ({1'b0, bw} + {1'b0, sw}) : ({1'b0, bw} - {1'b0, sw});
+  reg [6:0] lz; integer i;
+  always @* begin lz = 7'd74; for (i = 74; i >= 0; i = i - 1) if (sum[i]) begin lz = 7'd74 - i; i = -1; end end
+  wire [74:0] norm = sum << lz;
+  wire [23:0] mant = norm[74:51]; wire guard = norm[50]; wire sticky = |norm[49:0];
+  wire round_up = guard & (sticky | mant[0]);
+  wire [24:0] mr = {1'b0, mant} + round_up; wire carry = mr[24];
+  wire [9:0] eres = {1'b0, ebig} + 10'd1 - lz + carry;
+  wire zero = (sum == 0);
+  assign y = zero ? 32'h0 : {sbig, eres[7:0], carry ? mr[23:1] : mr[22:0]};
+endmodule
+module fp_mul(input [31:0] a, input [31:0] b, output [31:0] y);
+  wire sa, sb; wire [8:0] ea, eb; wire [23:0] ma, mb;
+  fp_unpack ua(a, sa, ea, ma); fp_unpack ub(b, sb, eb, mb);
+  wire [47:0] prod = ma * mb;
+  wire top = prod[47];
+  wire [23:0] mant = top ? prod[47:24] : prod[46:23];
+  wire guard = top ? prod[23] : prod[22]; wire sticky = top ? |prod[22:0] : |prod[21:0];
+  wire round_up = guard & (sticky | mant[0]);
+  wire [24:0] mr = {1'b0, mant} + round_up; wire carry = mr[24];
+  wire [9:0] eres = {1'b0, ea} + {1'b0, eb} - 10'd127 + top + carry;
+  assign y = {sa ^ sb, eres[7:0], carry ? mr[23:1] : mr[22:0]};
+endmodule
+// ---- int32 to float, RNE ----
+module fp_cvt(input [31:0] a, output [31:0] y);
+  wire s = a[31]; wire [31:0] mag = s ? (~a + 1'b1) : a;
+  wire [5:0] lz; lzc32 l(mag, lz);
+  wire [31:0] norm = mag << lz;                        // leading one at bit 31
+  wire [23:0] mant = norm[31:8]; wire guard = norm[7]; wire sticky = |norm[6:0];
+  wire round_up = guard & (sticky | mant[0]);
+  wire [24:0] mr = {1'b0, mant} + round_up; wire carry = mr[24];
+  wire [7:0] e = 8'd127 + 8'd31 - lz + carry;
+  assign y = (mag == 0) ? 32'h0 : {s, e, carry ? mr[23:1] : mr[22:0]};
+endmodule
+// ---- the lane: op 0 fadd, 1 fmul, 2 ffma, 3 fcvt; d ^= bits(result) ----
+module lane_fp32(
+  input clk, input rst,
+  input [1:0] op, input [2:0] dst, input [2:0] src, input [2:0] src2,
+  input ld_en, input [31:0] ld_val,
+  output [31:0] out);
+  reg [31:0] rf [0:7];
+  reg [1:0] op_q; reg [2:0] dst_q, src_q, src2_q; reg ld_q; reg [31:0] ld_val_q;
+  integer i;
+  always @(posedge clk) begin
+    if (rst) begin op_q <= 0; dst_q <= 0; src_q <= 0; src2_q <= 0; ld_q <= 0; ld_val_q <= 0; end
+    else begin op_q <= op; dst_q <= dst; src_q <= src; src2_q <= src2; ld_q <= ld_en; ld_val_q <= ld_val; end
+  end
+  wire [31:0] d = rf[dst_q]; wire [31:0] s = rf[src_q]; wire [31:0] s2 = rf[src2_q];
+  wire [31:0] ya, ym, yf, yc;
+  fp_add  A(d, s, ya);
+  fp_mul  M(d, s, ym);
+  fp_fma  F(s, s2, d, yf);
+  fp_cvt  C(s, yc);
+  reg [31:0] res;
+  always @* case (op_q) 2'd0: res = d ^ ya; 2'd1: res = d ^ ym; 2'd2: res = d ^ yf; default: res = d ^ yc; endcase
+  always @(posedge clk) begin
+    if (rst) begin for (i = 0; i < 8; i = i + 1) rf[i] <= 32'h9e3779b9 * (i + 1) + 9; end
+    else rf[dst_q] <= ld_q ? ld_val_q : res;
+  end
+  assign out = res;
+endmodule
diff --git a/tools/chip-model/rtl/tb/tb_core_common.vh b/tools/chip-model/rtl/tb/tb_core_common.vh
index 38e969897..5a6f88d70 100644
--- a/tools/chip-model/rtl/tb/tb_core_common.vh
+++ b/tools/chip-model/rtl/tb/tb_core_common.vh
@@ -21,10 +21,32 @@ module tb;
     @(negedge clk); cfg_en = 1; cfg_n = `NPROG - 1; cfg_sel = `SEL; cfg_m = 32'h9e3779b1; cfg_r = 5'd13; cfg_wm = 32'h0fffffc0; cfg_off = 3; cfg_mask = 32'h0fffffff;
     @(negedge clk); cfg_en = 0;
     // the program: `NPROG instructions drawn with the class v4 weights
+`ifdef CS
+    // the connected-state draw: step = load + 27-instruction spine block; `NPROG = 16 x 28 = 448
+    begin : cs
+      integer st, q, last0, last1, last2, last3, mreg, areg, dreg, sreg, s2reg;
+      areg = 0; mreg = 1;
+      for (st = 0; st < `NPROG / 28; st = st + 1) begin
+        @(negedge clk); w = {$random, $random}; mreg = $random & 63;
+        prog_we = 1; prog_addr = st*28; prog_data = {w[`IW-1:4], 4'd12}; prog_data[4 +: 6] = mreg; prog_data[10 +: 6] = areg;   // load: dst m_j, src a_j
+        last0 = mreg; last1 = mreg; last2 = mreg; last3 = mreg;
+        for (q = 0; q < 27; q = q + 1) begin
+          @(negedge clk); w = {$random, $random}; opc = draw_op($random); dreg = $random & 63;
+          case ($random & 3) 0: sreg = last0; 1: sreg = last1; 2: sreg = last2; default: sreg = last3; endcase
+          s2reg = last0;
+          if (q == 26 && !(opc == 4'd0 || opc == 4'd1 || opc == 4'd2 || opc == 4'd8 || opc == 4'd9)) opc = 4'd0;   // the last instruction injects
+          prog_we = 1; prog_addr = st*28 + 1 + q; prog_data = {w[`IW-1:4], opc}; prog_data[4 +: 6] = dreg; prog_data[10 +: 6] = sreg; prog_data[16 +: 6] = s2reg;
+          last3 = last2; last2 = last1; last1 = last0; last0 = dreg;
+        end
+        areg = last0;
+      end
+    end
+`else
     for (k = 0; k < `NPROG; k = k + 1) begin
       @(negedge clk); w = {$random, $random}; opc = (loads && (k % 16 == 15)) ? 4'd12 : draw_op($random);
       prog_we = 1; prog_addr = k; prog_data = {w[`IW-1:4], opc};
     end
+`endif
     @(negedge clk); prog_we = 0; run = 1;
     for (n = 0; n < cycles; n = n + 1) begin
       @(negedge clk); ld_val = $random; acc = acc ^ out ^ addr;
diff --git a/tools/chip-model/rtl/tb/tb_core_tm_8r64.v b/tools/chip-model/rtl/tb/tb_core_tm_8r64.v
new file mode 100644
index 000000000..954ae207f
--- /dev/null
+++ b/tools/chip-model/rtl/tb/tb_core_tm_8r64.v
@@ -0,0 +1,6 @@
+`define TOP core_tm_8r64
+`define HALF 750
+`define IW 40
+`define NPROG 256
+`define SEL 64'hfedcba9876543210
+`include "tb_core_common.vh"
diff --git a/tools/chip-model/rtl/tb/tb_core_v6_8_legacy.v b/tools/chip-model/rtl/tb/tb_core_v6_8_legacy.v
new file mode 100644
index 000000000..9607238cf
--- /dev/null
+++ b/tools/chip-model/rtl/tb/tb_core_v6_8_legacy.v
@@ -0,0 +1,3 @@
+`define TOP core_v6_8
+`define HALF 750
+`include "tb_core_legacy.vh"
diff --git a/tools/chip-model/rtl/tb/tb_core_v6_8cs64.v b/tools/chip-model/rtl/tb/tb_core_v6_8cs64.v
new file mode 100644
index 000000000..83d71eb03
--- /dev/null
+++ b/tools/chip-model/rtl/tb/tb_core_v6_8cs64.v
@@ -0,0 +1,7 @@
+`define TOP core_v6_8cs64
+`define HALF 750
+`define IW 40
+`define NPROG 448
+`define CS 1
+`define SEL 64'hfedcba9876543210
+`include "tb_core_common.vh"
diff --git a/tools/chip-model/rtl/tb/tb_lane_fp32.v b/tools/chip-model/rtl/tb/tb_lane_fp32.v
new file mode 100644
index 000000000..721a54e69
--- /dev/null
+++ b/tools/chip-model/rtl/tb/tb_lane_fp32.v
@@ -0,0 +1,22 @@
+`timescale 1ps/1ps
+module tb;
+  reg clk = 0, rst = 1; reg [1:0] op = 0; reg [2:0] dst = 0, src = 0, src2 = 0; reg ld_en = 0; reg [31:0] ld_val = 0;
+  wire [31:0] out;
+  lane_fp32 dut(.clk(clk), .rst(rst), .op(op), .dst(dst), .src(src), .src2(src2), .ld_en(ld_en), .ld_val(ld_val), .out(out));
+  integer n, fixed_op, cycles; reg [31:0] acc = 0;
+  always #1000 clk = ~clk;
+  // a reference check of the units against the host's float arithmetic is the mixed lane's own (the ranges are its);
+  // this bench drives random registers and reports the checksum
+  initial begin
+    if (!$value$plusargs("op=%d", fixed_op)) fixed_op = -1;
+    if (!$value$plusargs("cycles=%d", cycles)) cycles = 3000;
+    $dumpfile("dump.vcd"); $dumpvars(0, tb.dut);
+    repeat (4) @(negedge clk); rst = 0;
+    for (n = 0; n < cycles; n = n + 1) begin
+      @(negedge clk);
+      op = (fixed_op < 0) ? $random : fixed_op; dst = $random; src = $random; src2 = $random;
+      ld_en = (($random & 7) == 0); ld_val = $random; acc = acc ^ out;
+    end
+    $display("CHECKSUM %08x", acc); $finish;
+  end
+endmodule
diff --git a/tools/ci/README.md b/tools/ci/README.md
index 5b658bd91..9c7f37798 100644
--- a/tools/ci/README.md
+++ b/tools/ci/README.md
@@ -11,6 +11,7 @@
 
 | gh's active account is the stored Igneum entry (`gh-account-check.sh`, in Igneum's own gh directory `~/.config/gh-igneum` through `gh-env.sh`, never the founder's) | A push or a landing from this Mac while Igneum's gh directory names any other account as active, or none (the refusal names the one step: the founder or main stores the Igneum token there with `GH_CONFIG_DIR=~/.config/gh-igneum gh auth login --with-token`; no lane does); skipped with a line while `github-suspended` stands. RULE: no lane switches gh accounts on this Mac, ever; the second owner's login belongs to other projects and must never touch Igneum; the stored entry's name is in ~/.config/igneum/gh-user, never in the repository. | 7 October 2026, 21:41 UK: a lane switched gh to the other login during the suspension; nobody could say which |
 | F02 (Review B): the proof-rule test bypass cannot reach a release build (`proof-rule-bypass-check.sh`; a cell of the node matrix) | An env read of IGNEUM_TEST_SKIP_PROOF_RULE with no cfg(test) or cfg(feature) guard in the 12 lines above, or under a feature in the crate's default features; a release igneumd carrying the bypass string. Red on every node sha until the proving lane's change (the read under a non-default feature or cfg(test)) lands | 8 Oct 2026 |
+| the guest input format moves with the pinned guests (`guest-format-check.sh`; the diff rule in `merge-to-master.sh`, the tree rule in the gate) | A proving host whose GUEST_INPUT_FORMAT moved while the pinned guests stayed (8 October 2026, the V6-07 sub-lane: a master-built host failed every proof against the 5 October pair) |
 | the test map merges structurally at a landing (`test-map-merge.py`) and the harness page regenerates from the merged map (`merge-to-master.sh`) | Nothing by itself: two lanes adding cells collided as text and the regenerated page lost rule 26's race; the merge now keeps master's cells plus the branch's, minus what the branch removed and master left, and regenerates the page | 8 Oct 2026 |
 | a push that lost the ref race retries without re-running the hook (`merge-to-master.sh` `push_race`, 12 tries) | Nothing by itself: under one landing a minute a 70-second hook per try never won master's compare-and-swap (Review B's landing lost three in a row); once the hook has passed on the first try and the rejection is a ref race, later tries push --no-verify (both parents gated) | 8 Oct 2026 |
 | the kit ISA check (`kit-isa-check.sh`; in the gate as a self-test, in `merge-to-master.sh` over any executable a landing adds under packaging/kits or bin, and in the shipper's cut gate over the kit) | Any binary whose disassembly carries a zmm register, an EVEX opmask or an EVEX-only mnemonic (AVX-512): a fleet binary comes only from the cross-build kit at the x86-64-v3 baseline, never from a box's native gate build (79 fleet hosts died on one, 8 Oct 2026) | 8 Oct 2026 |
diff --git a/tools/ci/batches/census-v6-live-20261008-2210.json b/tools/ci/batches/census-v6-live-20261008-2210.json
new file mode 100644
index 000000000..e82061b42
--- /dev/null
+++ b/tools/ci/batches/census-v6-live-20261008-2210.json
@@ -0,0 +1,13 @@
+{
+  "run_id": "census-v6-live-20261008-2210",
+  "manifest_sha": "1a938abe4",
+  "evidence_dir": "docs/analysis/class-v6/rows/live-dataset-census-1a938abe4",
+  "cells": [
+    {
+      "cell": "census:class-v6",
+      "status": "PASS",
+      "evidence": "docs/analysis/class-v6/rows/live-dataset-census-1a938abe4.md",
+      "method": "native"
+    }
+  ]
+}
\ No newline at end of file
diff --git a/tools/ci/batches/f03-manifest-20261008-01.json b/tools/ci/batches/f03-manifest-20261008-01.json
index 8c3e8570d..d8910cdcc 100644
--- a/tools/ci/batches/f03-manifest-20261008-01.json
+++ b/tools/ci/batches/f03-manifest-20261008-01.json
@@ -15,7 +15,7 @@
     "profile_hashes": "release-manifest-check: every component's own pin equals packaging/release-manifest.json"
   },
   "claim_impact": "F03's first rung: one manifest, one build, no unpublished vendor tree; the same-work rung (R02) and the transition rung (R03) stay NOT RUN until the readers run on the job context",
-  "note": "R2-F03-R01, the clean build from one manifest: every component builds from packaging/release-manifest.json on release-2.0.1's final tip c30ab32c with the node vendored at the manifest's sha 7cfa422a as a real checkout (vendor/igneum-node and vendor/igneum-node-exec; a link ships as nothing); the pool builds only from the release tree (its igneum-pow is the class v5 freeze cbc5bd0a, rule 19; master's a65e4c5a refuses it). Earlier runs on aa0e0f45 were red on the pool (KeyReveal.sig_scheme, the pool-review-b shape not yet in the tree) and on prove-host (the exec vendor missing); both closed by the tree, not by the script. The workers are the kit's cross-build (the shipper's kit-isa line), not this build. The build: tools/ci/build-from-manifest.sh --box 4 on release-2.0.1 c30ab32c, 21:11 to 21:14 UK, kaspad with igneum-pow, igneum-miner, igneum-pool, igneum-app and igneum-prove-host all check green from packaging/release-manifest.json, and release-manifest-check reads every component's own pin equal to the manifest; the log on build-1 (sha256 6040ded8e99f0871...).",
+  "note": "R2-F03-R01, the clean build from one manifest: every component builds from packaging/release-manifest.json on release-2.0.1's final tip c30ab32c with the node vendored at the manifest's sha 7cfa422a as a real checkout (vendor/igneum-node and vendor/igneum-node-exec; a link ships as nothing); the pool builds only from the release tree (its igneum-pow is the class v5 freeze cbc5bd0a, rule 19; master's a65e4c5a refuses it). Earlier runs on aa0e0f45 were red on the pool (KeyReveal.sig_scheme, the pool-review-b shape not yet in the tree) and on prove-host (the exec vendor missing); both closed by the tree, not by the script. The workers are the kit's cross-build (the shipper's kit-isa line), not this build. The build: tools/ci/build-from-manifest.sh --box 4 on release-2.0.1 c30ab32c, 21:11 to 21:14 UK, kaspad with igneum-pow, igneum-miner, igneum-pool, igneum-app and igneum-prove-host all check green from packaging/release-manifest.json, and release-manifest-check reads every component's own pin equal to the manifest; the log on build-1 (sha256 6040ded8e99f0871...). Re-recorded at the guest-format landing (21:5x UK): on master the row read NOT RUN beside its PASS cell through the lifted reason-only record; the recorder now drops that placeholder when a real cell lands.",
   "cells": [
     {
       "cell": "harness:release-manifest",
diff --git a/tools/ci/batches/floor-k-20261008-rows-repeat.json b/tools/ci/batches/floor-k-20261008-rows-repeat.json
new file mode 100644
index 000000000..f525f5993
--- /dev/null
+++ b/tools/ci/batches/floor-k-20261008-rows-repeat.json
@@ -0,0 +1,26 @@
+{
+ "run_id": "floor-k-20261008-rows-repeat",
+ "manifest_sha": "86e5b0fb",
+ "cut_tip": "class-v6-floor-k 86e5b0fb (the amendment carries shadow-k.md; floor lane 2's rows ADV-05 and ADV-06 move with it on its word, method model, no decision changed; the steward's rows no longer cite the directory since d2e1c192)",
+ "evidence_dir": "docs/analysis/class-v6/floor/shadow-k.md",
+ "boxes": [],
+ "cells": [
+  {
+   "cell": "adversary:mf-placed",
+   "cases": [
+    "ADV-05"
+   ],
+   "status": "RUNNING",
+   "method": "model",
+   "evidence": "docs/analysis/class-v6/floor/shadow-k.md",
+   "note": "repeat for ADV-05 at this manifest on floor lane 2's word (placed and routed RTL on ASAP7, a model); the rtl directory tools/chip-model/rtl/ is the flow, cited by its document since the recorder takes files only"
+  },
+  {
+   "cell": "review:k-lane-shadow-k",
+   "status": "NOT RUN",
+   "method": "model",
+   "evidence": "docs/analysis/class-v6/floor/shadow-k.md",
+   "note": "repeat of team-2026-10-08 for ADV-06 at this manifest on floor lane 2's word; no decision changed"
+  }
+ ]
+}
diff --git a/tools/ci/batches/kit-class-v6-20261008-01.json b/tools/ci/batches/kit-class-v6-20261008-01.json
new file mode 100644
index 000000000..716817aa9
--- /dev/null
+++ b/tools/ci/batches/kit-class-v6-20261008-01.json
@@ -0,0 +1,17 @@
+{
+  "run_id": "kit-class-v6-20261008-01",
+  "manifest_sha": "ef0f2ed8",
+  "evidence_dir": "docs/design/class-v5-stored-state.md",
+  "boxes": [
+    "build-1"
+  ],
+  "cells": [
+    {
+      "cell": "kit:class-v6-fingerprints",
+      "status": "RUNNING",
+      "evidence": "docs/design/class-v5-stored-state.md; build-1:/srv/artefacts/packs/packs-class-v6-20261008T202808Z.zip; build-1:/srv/builds/_log/v5-class/kits-20261008T202808Z/emu-check.log",
+      "note": "docs/design/class-v5-stored-state.md section 0, the class v6 kit row: the generator 6 packs hl-v6-all 4de7b836cc40a4ea and hl-v6-foldrw d7eba30115d26dd4 read e8f4f3289c6ee1fc and 6ce3dc344a613500 on the CPU emulation check, the CUDA 4090, Metal and Apple OpenCL (20:41 to 20:52 UK); the RTX 5090, RX 7600 and Arc rows the morning's; the kit zip 4 bb66a546 (kernel texts byte-identical to zip 3)"
+    }
+  ],
+  "method": "GPU"
+}
diff --git a/tools/ci/batches/site-manifest-20261008-01.json b/tools/ci/batches/site-manifest-20261008-01.json
index 8c55d248e..d26b41804 100644
--- a/tools/ci/batches/site-manifest-20261008-01.json
+++ b/tools/ci/batches/site-manifest-20261008-01.json
@@ -3,6 +3,17 @@
  "manifest_sha": "3f1a3f332",
  "evidence_dir": "site",
  "cells": [
-  {"cell": "site:manifest", "cases": ["OPS-03"], "status": "NOT RUN", "in_progress": true, "method": "static", "evidence": "site/release-manifest.json at the landing sha", "note": "the manifest regenerated from the dl index (the 2.0.1 Mac and HiveOS entries, 8 October 2026 20:16 and 20:25 UK) and the node's start line; read back at /release.json after the deploy", "claim_impact": "the versions block on /release.json, /download and /miner; no claim moves"}
+  {
+   "cell": "site:manifest",
+   "cases": [
+    "OPS-03"
+   ],
+   "status": "NOT RUN",
+   "in_progress": true,
+   "method": "static",
+   "evidence": "site/release-manifest.json",
+   "note": "the manifest regenerated from the dl index (the 2.0.1 entries on every platform: Mac 20:16, HiveOS 20:25, Windows 20:56 UK, 8 October 2026; 2.0.0 withdrawn) and the node's start line; read back at /release.json after the deploy",
+   "claim_impact": "the versions block on /release.json, /download and /miner; no claim moves"
+  }
  ]
 }
diff --git a/tools/ci/checks.txt b/tools/ci/checks.txt
index 0b3835a40..24693bf53 100644
--- a/tools/ci/checks.txt
+++ b/tools/ci/checks.txt
@@ -81,6 +81,7 @@ the kit ISA check: a distribution kit's binaries carry no AVX-512 encoding (the
 F02 (Review B): the proof-rule test bypass cannot reach a release build: an env read with no cfg guard or under a default feature is red; a release binary carrying the bypass string is red (self-test)
 the test map merges structurally at a landing: master's cells plus the branch's, minus what the branch removed and master left (self-test)
 rule 33: a release entry publishes only with a PASS fresh-install canary record for its sha (the record check and the publish guard, self-tests)
+the guest input format moves with the pinned guests: the elf manifest's guest_input_format equals the source constant where the field exists, a format bump without a guest change is refused at the merge (self-test, then the tree)
 the REV suite is generated from Review B's findings and dispatch and matches them (self-test, then the tree)
 F03 (Review B): every component's own pin equals packaging/release-manifest.json where a release branch carries one (self-test, then the tree)
 the public ledger (docs/ledger-public.md) is what docs/fud-ledger.md generates: one row per item, no commit ids, times or team names (self-test first)
diff --git a/tools/ci/guest-format-check.sh b/tools/ci/guest-format-check.sh
new file mode 100755
index 000000000..fcc5a6df4
--- /dev/null
+++ b/tools/ci/guest-format-check.sh
@@ -0,0 +1,67 @@
+#!/usr/bin/env bash
+# The guest input format moves with the pinned guests (the V6-07 sub-lane's fault, 8 October 2026, 22:0x UK: master's proving host
+# wrote GUEST_INPUT_FORMAT 3 while the pinned guests were the 5 October pair, so a master-built host failed every proof).
+#
+#   tools/ci/guest-format-check.sh <base> <head>     the landing rule: a diff that changes the GUEST_INPUT_FORMAT constant in
+#                                                    proving/igneum-prove/core/src/shard.rs without changing a file under
+#                                                    proving/igneum-prove/elf/ is red (the guests must be repinned with the format)
+#   tools/ci/guest-format-check.sh --tree [<root>]   the tree rule: proving/igneum-prove/elf/manifest.json's guest_input_format, when
+#                                                    the field exists, equals the source constant; a manifest without the field is a
+#                                                    named line (a pre-provenance pin; igneum-prove-pin writes the field since 7d38077d); a
+#                                                    mismatch with a source_commit names the commit the kit's prover builds from (not red)
+#   tools/ci/guest-format-check.sh --self-test
+set -euo pipefail
+HERE="$(cd "$(dirname "$0")" && pwd -P)"; ME="$HERE/$(basename "$0")"
+SRC="proving/igneum-prove/core/src/shard.rs"; ELF_DIR="proving/igneum-prove/elf"; MANIFEST="$ELF_DIR/manifest.json"
+
+src_format() {   # <file> -> the constant's value, or empty
+  sed -n 's/^pub const GUEST_INPUT_FORMAT: u32 = \([0-9][0-9]*\);.*/\1/p' "$1" | head -1
+}
+diff_rule() {   # <base> <head>
+  local base="$1" head="$2" b h touched
+  b=$(git show "$base:$SRC" 2>/dev/null | src_format /dev/stdin || true)
+  h=$(git show "$head:$SRC" 2>/dev/null | src_format /dev/stdin || true)
+  [ -n "$h" ] || { echo "guest-format: no GUEST_INPUT_FORMAT constant at $head (nothing to check)"; return 0; }
+  if [ "$b" = "$h" ]; then echo "guest-format: the guest input format is unchanged ($h)"; return 0; fi
+  touched=$(git diff --name-only "$base" "$head" -- "$ELF_DIR/" | grep -c . || true)
+  if [ "${touched:-0}" -gt 0 ]; then echo "guest-format: the format moves ${b:-none} to $h with $touched file(s) under $ELF_DIR/ (the guests repinned with it)"; return 0; fi
+  echo "guest-format: REFUSED: GUEST_INPUT_FORMAT moves ${b:-none} to $h in $SRC with no change under $ELF_DIR/ (the pinned guests would refuse every input; repin the guests with the format and land both together)"
+  return 1
+}
+tree_rule() {   # [<root>]
+  local root="${1:-.}" s m
+  [ -f "$root/$SRC" ] || { echo "guest-format: no $SRC in this tree (nothing to check)"; return 0; }
+  s=$(src_format "$root/$SRC"); [ -n "$s" ] || { echo "guest-format: no GUEST_INPUT_FORMAT constant in $SRC (nothing to check)"; return 0; }
+  [ -f "$root/$MANIFEST" ] || { echo "guest-format: REFUSED: no $MANIFEST beside a source format $s"; return 1; }
+  m=$(python3 -c 'import json,sys; d=json.load(open(sys.argv[1])); v=d.get("guest_input_format"); print("" if v is None else v)' "$root/$MANIFEST" 2>/dev/null || true)
+  sc=$(python3 -c 'import json,sys; d=json.load(open(sys.argv[1])); print(d.get("source_commit") or "")' "$root/$MANIFEST" 2>/dev/null || true)
+  if [ -z "$m" ]; then echo "guest-format: the pinned guests' manifest names no guest_input_format (a pre-provenance pin); the source format is $s; unverified until the guests are repinned with the field"; return 0; fi
+  if [ "$m" = "$s" ]; then echo "guest-format: the pinned guests and the source agree on guest input format $s"; return 0; fi
+  # a mismatch with provenance: the kit's prover is built from the manifest's source_commit (its format is the guests'), never this
+  # tree's tip, until the pin moves (the coordinator's shape, 8 October 2026 22:1x UK); without provenance nothing says which host
+  # the guests take and the tree is red
+  if [ -n "$sc" ]; then echo "guest-format: the pinned guests read guest input format $m from source_commit ${sc:0:12}; this tree's constant is $s, so the kit's prover builds from ${sc:0:12}, never this tip, until the guests are repinned"; return 0; fi
+  echo "guest-format: REFUSED: the pinned guests read guest input format $m, the source constant is $s, and the manifest names no source_commit (a host built from this tree fails every proof; repin the guests with provenance or move the constant back)"
+  return 1
+}
+if [ "${1:-}" = --self-test ]; then
+  d=$(mktemp -d); trap 'rm -rf "$d"' EXIT; fails=0
+  ( cd "$d" && git init -q -b master . && mkdir -p "$(dirname "$SRC")" "$ELF_DIR" && printf 'pub const GUEST_INPUT_FORMAT: u32 = 2;\n' > "$SRC" && printf 'elf' > "$ELF_DIR/a.elf" && printf '{"format":"v1"}\n' > "$MANIFEST" && git add -A && git -c user.name=t -c user.email=t@t commit -q -m base && git tag base
+    git checkout -q -b bump && printf 'pub const GUEST_INPUT_FORMAT: u32 = 3;\n' > "$SRC" && git -c user.name=t -c user.email=t@t commit -qam bump && git tag bump-alone
+    git checkout -q -b both base && printf 'pub const GUEST_INPUT_FORMAT: u32 = 3;\n' > "$SRC" && printf 'elf3' > "$ELF_DIR/a.elf" && printf '{"format":"v1","guest_input_format":3}\n' > "$MANIFEST" && git -c user.name=t -c user.email=t@t commit -qam both && git tag bump-with-guests
+    git checkout -q -b other base && printf 'x' > other.txt && git add -A && git -c user.name=t -c user.email=t@t commit -q -m other && git tag no-bump
+    git checkout -q -b off base && printf 'pub const GUEST_INPUT_FORMAT: u32 = 3;\n' > "$SRC" && printf '{"format":"v1","guest_input_format":2}\n' > "$MANIFEST" && git -c user.name=t -c user.email=t@t commit -qam off && git tag off
+    git checkout -q -b prov base && printf 'pub const GUEST_INPUT_FORMAT: u32 = 3;\n' > "$SRC" && printf '{"format":"v1","guest_input_format":1,"source_commit":"15bb6cdd4aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa"}\n' > "$MANIFEST" && git -c user.name=t -c user.email=t@t commit -qam prov && git tag prov ) >/dev/null 2>&1 || { echo "self-test failed: the fixture did not build"; exit 1; }
+  out=$( cd "$d" && bash "$ME" base bump-alone 2>&1 ) && { echo "self-test failed: a format bump with no guest change passed"; fails=1; }; case "$out" in *"no change under"*) ;; *) echo "self-test failed: the bump was not named: $out"; fails=1 ;; esac
+  ( cd "$d" && bash "$ME" base bump-with-guests >/dev/null 2>&1 ) || { echo "self-test failed: a format bump with repinned guests was refused: $( cd "$d" && bash "$ME" base bump-with-guests 2>&1 )"; fails=1; }
+  ( cd "$d" && bash "$ME" base no-bump >/dev/null 2>&1 ) || { echo "self-test failed: a diff without a format change was refused"; fails=1; }
+  ( cd "$d" && git checkout -q both && bash "$ME" --tree . >/dev/null 2>&1 ) || { echo "self-test failed: an agreeing manifest was refused: $( cd "$d" && bash "$ME" --tree . 2>&1 )"; fails=1; }
+  out=$( cd "$d" && git checkout -q off && bash "$ME" --tree . 2>&1 ) && { echo "self-test failed: a manifest format off the source passed"; fails=1; }; case "$out" in *"read guest input format 2, the source constant is 3"*) ;; *) echo "self-test failed: the mismatch was not named: $out"; fails=1 ;; esac
+  out=$( cd "$d" && git checkout -q prov && bash "$ME" --tree . 2>&1 ) || { echo "self-test failed: a mismatch with provenance (the kit's prover from source_commit) was refused: $out"; fails=1; }; case "$out" in *"builds from 15bb6cdd4aaa"*) ;; *) echo "self-test failed: the provenance line was not named: $out"; fails=1 ;; esac
+  out=$( cd "$d" && git checkout -q base && bash "$ME" --tree . 2>&1 ) || { echo "self-test failed: a pre-provenance manifest (no field) was refused: $out"; fails=1; }; case "$out" in *"names no guest_input_format"*) ;; *) echo "self-test failed: the unverified pin was not named: $out"; fails=1 ;; esac
+  [ "$fails" = 0 ] && echo "self-test passed: a GUEST_INPUT_FORMAT bump without a change under the elf directory is refused and named, with repinned guests it passes, a diff without the bump passes; in the tree an agreeing manifest passes, a manifest whose guest_input_format is off the source with no provenance is refused and named, one with a source_commit names the host's commit, a pin without the field is a named line"
+  exit $fails
+fi
+if [ "${1:-}" = --tree ]; then tree_rule "${2:-.}"; exit $?; fi
+[ $# -eq 2 ] || { echo "usage: $0 <base> <head> | --tree [<root>] | --self-test" >&2; exit 2; }
+diff_rule "$1" "$2"
diff --git a/tools/ci/merge-to-master.sh b/tools/ci/merge-to-master.sh
index 06ef08aed..a342687fd 100755
--- a/tools/ci/merge-to-master.sh
+++ b/tools/ci/merge-to-master.sh
@@ -393,6 +393,9 @@ if [ -n "$KITBINS" ]; then bash tools/ci/kit-isa-check.sh $KITBINS || { echo "me
 RULE26_SKIP_PATHS="$RULE26_SKIP_PATHS" bash tools/ci/rule26-no-revert.sh "$BASE" "$SHA" "$REMOTE/master" || { echo "merge-to-master: REFUSED by rule 26 (above)" >&2; exit 1; }
 # the registry's evidence rules (8 October 2026, 18:4x UK): a PASS carries existing evidence, a touched evidence file moves with its
 # row, stale evidence never reads PASS, a run_status needs the approval (GOV-02, GOV-04, GOV-08)
+# the guest input format moves with the pinned guests (the V6-07 sub-lane's fault, 8 October 2026 22:0x UK): a landing that changes
+# GUEST_INPUT_FORMAT without a change under proving/igneum-prove/elf/ is refused
+bash tools/ci/guest-format-check.sh "$BASE" "$SHA" || { echo "merge-to-master: REFUSED: the guest input format moved without the guests (above)" >&2; exit 1; }
 [ -n "$BATCHES" ] || bash tools/ci/registry-evidence-check.sh "$BASE" "$SHA" || { echo "merge-to-master: REFUSED by the registry's evidence rules (above)" >&2; exit 1; }   # with batches the rules run on the merged result below
 for i in $(seq 1 "$TRIES"); do
   git fetch -q "$REMOTE" master; TIP=$(git rev-parse "$REMOTE/master")
diff --git a/tools/ci/pre-push.sh b/tools/ci/pre-push.sh
index 1837e6e13..d90ab8119 100755
--- a/tools/ci/pre-push.sh
+++ b/tools/ci/pre-push.sh
@@ -180,6 +180,7 @@ tree_checks() {
   run "F02 (Review B): the proof-rule test bypass cannot reach a release build: an env read with no cfg guard or under a default feature is red; a release binary carrying the bypass string is red (self-test)" bash tools/ci/proof-rule-bypass-check.sh --self-test
   run "the test map merges structurally at a landing: master's cells plus the branch's, minus what the branch removed and master left (self-test)" python3 tools/ci/test-map-merge.py --self-test
   run "rule 33: a release entry publishes only with a PASS fresh-install canary record for its sha (the record check and the publish guard, self-tests)" bash -c 'bash tools/ci/canary-check.sh --self-test >/dev/null && bash packaging/ota/publish-manifest.sh --self-test-canary-guard >/dev/null'
+  run "the guest input format moves with the pinned guests: the elf manifest's guest_input_format equals the source constant where the field exists, a format bump without a guest change is refused at the merge (self-test, then the tree)" bash -c 'bash tools/ci/guest-format-check.sh --self-test >/dev/null && bash tools/ci/guest-format-check.sh --tree .'
   run "the REV suite is generated from Review B's findings and dispatch and matches them (self-test, then the tree)" bash tools/ci/review-suite-check.sh
   run "F03 (Review B): every component's own pin equals packaging/release-manifest.json where a release branch carries one (self-test, then the tree)" bash -c 'bash tools/ci/release-manifest-check.sh --self-test >/dev/null && bash tools/ci/release-manifest-check.sh'
   run "the public ledger (docs/ledger-public.md) is what docs/fud-ledger.md generates: one row per item, no commit ids, times or team names (self-test first)" bash -c 'node tools/ledger/export-public.mjs --self-test && node tools/ledger/export-public.mjs --check'
diff --git a/tools/ci/route-spill-check.sh b/tools/ci/route-spill-check.sh
index fedfd5854..0675f5937 100755
--- a/tools/ci/route-spill-check.sh
+++ b/tools/ci/route-spill-check.sh
@@ -36,8 +36,9 @@ BS_ROUTE_STATE_1="free=1 slots=2 load1=80" BS_ROUTE_STATE_2="free=3 slots=3 load
 BS_ROUTE_STATE_1="free=2 slots=2 load1=70" BS_ROUTE_STATE_2="free=3 slots=3 load1=5"  expect "load 70 stays on build-1 (the line is 80)"   build 1 0
 # the ssh path itself under the hook's shell (/bin/bash is 3.2 on the Mac; the pool lane found `BS_SSH_OPTS[@]: unbound variable`
 # at the first unpinned route, 7 Oct 2026): a host file pointing at a port nothing answers on must read "down" in a few seconds,
-# not die on an unset array
-printf 'build@127.0.0.1\n' > "$t/hosts"
+# not die on an unset array. Port 1 in the ssh URI form (8 Oct 2026, the workers-page lane): on a build box sshd answers on
+# 127.0.0.1:22 and a forwarded agent logs in, so the bare address read "free=..." there and the gate was red only off the Mac
+printf 'ssh://build@127.0.0.1:1\n' > "$t/hosts"
 out=$(IGNEUM_BUILD_KEY="$t/no-such-key" /bin/bash -c '. infra/build-server/lib.sh; bs_box_state 1' 2>&1 || true)
 if [ "$out" = down ]; then echo "route-spill: the ssh probe under /bin/bash $(/bin/bash -c 'echo $BASH_VERSION') reads an unreachable box as down"
 else echo "route-spill: the ssh probe under /bin/bash failed: '$out' (expected 'down')" >&2; fail=1; fi
diff --git a/tools/ci/site-nav-check.mjs b/tools/ci/site-nav-check.mjs
index b6481ef38..77d17ea98 100644
--- a/tools/ci/site-nav-check.mjs
+++ b/tools/ci/site-nav-check.mjs
@@ -15,7 +15,7 @@ const here = dirname(fileURLToPath(import.meta.url));
 const GROUPS = {
   mine: ['/miner', '/download', '/app', '/wallet', '/miners', '/tuning', '/dev-fee', '/metamask'],
   network: ['/live', '/explorer', '/evidence', '/light', '/receipt', '/oracle'],
-  learn: ['/litepaper', '/income', '/economics', '/scorecard', '/audit', '/docs', '/ledger', '/claims', '/randomx', '/provenance', '/acceptance'],
+  learn: ['/litepaper', '/income', '/economics', '/scorecard', '/prize', '/audit', '/docs', '/ledger', '/claims', '/randomx', '/provenance', '/acceptance'],
   build: ['/build', '/faucet', '/swap', '/grants', '/compatibility'],   // the builder programme (8 October 2026): the developer entry page, the Devnet 3 faucet, the swap, the grants
 };
 const ROUTES = Object.values(GROUPS).flat();
diff --git a/tools/ci/test-map.json b/tools/ci/test-map.json
index b1b508883..7789806b7 100644
--- a/tools/ci/test-map.json
+++ b/tools/ci/test-map.json
@@ -687,6 +687,31 @@
       "coverage": {
         "INT-07": "partial: V6-12's clean-install half (one published object installed fresh, synced, mined, proved and paid on one host per artefact); the cross-host agreement half (node, pool, CPU verifier, each GPU host across activation) is harness:same-work's"
       }
+    },
+    "review:k-lane-shadow-k": {
+      "command": "floor lane 2's placed and routed cores on ASAP7 in tools/chip-model/rtl (the rows in docs/analysis/class-v6/floor/shadow-k.md); the register landing 50ff1611f recorded ADV-06 against it before the recorder existed",
+      "box_class": "none",
+      "fixtures": [],
+      "cases": [
+        "ADV-06"
+      ],
+      "coverage": {
+        "ADV-06": "partial: the placed gated cores and the adversary's forms are modelled in shadow-k.md; the independent review remains"
+      }
+    },
+    "kit:class-v6-fingerprints": {
+      "command": "KITS_BOX_SCRIPT=kits-v6-on-box.sh tools/class-v5/kits-remote.sh --box 1 (the kit zip with its emulation check), then the kit's workers on every platform: the box's CPU emulation (--check, 96 of 96 vector lanes), the fleet's CUDA 4090 (--check and --bench at 2^24, base nonce 0), the Mac's Metal (proto-metal/packbench.swift --pack) and Apple OpenCL (proto-opencl/host.c --pack --bench-pack), PC 1's RTX 5090 and RX 7600 (tools/class-v5/pc1-v6-bench.ps1), PC 2's Arc B580 (tools/class-v5/arc-v6-bench.ps1); the fingerprint of the 2^24 outputs at base nonce 0 equal on every platform for the all pack and for its known-failed partner, the two distinct",
+      "box_class": "build box + pods + Mac + PC 1 + PC 2",
+      "fixtures": [
+        "F0",
+        "F2"
+      ],
+      "cases": [
+        "R2-F03-R02"
+      ],
+      "coverage": {
+        "R2-F03-R02": "partial: the worker half (CPU reference, CUDA, Metal, OpenCL) on the same program packs; the node's and the pool's accepted work on the same job context are the CI steward's and the pool lane's cells; PASS only when every listed platform reads one fingerprint and the node and pool halves are green"
+      }
     }
   },
   "not_run": {
@@ -697,7 +722,6 @@
     "GPU-06": "accepted work under ordinary connectivity needs the fault network F4",
     "GPU-07": "the sustained thermal and power soak has no harness tonight: the project's own rig mines nothing under the the earlier devnet off order",
     "POW-05": "amortised cheap winning attempts are the attack lanes' grind and era harnesses (tools/attack/f7-era, f9-grind), not in the release matrix; their rows come from those lanes",
-    "ADV-06": "process-advantage separation is the adversary lanes' chip study",
     "ROT-03": "miner-voted bring-forward needs a vote harness on the fault network F4",
     "ROT-04": "seed-selection resistance is the census harness (the class v6 invention lane), not yet in the matrix",
     "EVM-01": "no EVM conformance-vector harness is mapped tonight; the exec suite does not run the reference test vectors",
diff --git a/tools/ci/test-record.mjs b/tools/ci/test-record.mjs
index 8c16570c9..d292cae29 100644
--- a/tools/ci/test-record.mjs
+++ b/tools/ci/test-record.mjs
@@ -106,7 +106,10 @@ function record(reg, map, batch) {
         claim_impact: cell.claim_impact || batch.claim_impact || '', reviewer: cell.reviewer || batch.reviewer || '', at: now,
         ...(missing.length ? { blocked_on: missing, reason: `INT-17: missing ${missing.join(', ')}; never PASS without them` } : {}) };
       c.evidence_records[cell.cell] = c.evidence_record;
-      const decs = Object.values(c.evidence_records).map((r) => r.decision);
+      // a lifted legacy 'record' entry that carries only a no-harness reason (no run) is not a run: it never counts in the combined
+      // decision and is dropped once a real cell lands (8 October 2026, 21:5x UK: R2-F03-R01 read NOT RUN on master beside its PASS cell)
+      for (const [k, r] of Object.entries(c.evidence_records)) if (k !== cell.cell && !r.run_id && !r.evidence && r.reason) delete c.evidence_records[k];
+      const decs = Object.values(c.evidence_records).filter((r) => r.run_id || r.evidence || r.decision === 'BLOCKED').map((r) => r.decision);
       const combined = decs.includes('FAIL') ? 'FAIL' : decs.includes('BLOCKED') ? 'BLOCKED' : decs.every((d) => d === 'PASS') ? 'PASS' : 'NOT RUN';
       c.run_status = combined; c.run_id = batch.run_id; c.updated = now;
       c.evidence_path = [...new Set(Object.values(c.evidence_records).map((r) => r.evidence).filter(Boolean))].join('; ');
@@ -151,6 +154,10 @@ if (args.includes('--self-test')) {
   if (!badMethod) { console.log('self-test failed: a batch with no method was accepted (methods are never conflated)'); fails = 1; }
   const regO = { cases: [{ id: 'O1', method: 'Automated', accept: 'a', run_status: 'RUNNING', updated: 't', evidence_record: { cell: 'suite:x' } }, { id: 'O2', method: 'Automated', accept: 'b', run_status: 'DEFERRED' }] }; normalize(regO);
   if (!(regO.cases[0].run_status === 'NOT RUN' && regO.cases[0].in_progress_since === 't' && regO.cases[0].evidence_record.method === 'native' && regO.cases[1].run_status === 'NOT RUN' && /deferred/.test(regO.cases[1].deferral_note))) { console.log(`self-test failed: normalize: ${JSON.stringify(regO)}`); fails = 1; }
+  // a lifted reason-only record beside a real cell: the row reads the cell's decision and the placeholder is gone
+  const regL = { cases: [{ id: 'L1', method: 'Automated', accept: 'a', run_status: 'NOT RUN', evidence_records: { record: { decision: 'NOT RUN', reason: 'no harness yet', at: 't' } } }] };
+  record(regL, { cells: { lc: { command: 'x', box_class: 'b', fixtures: [], cases: ['L1'] } }, not_run: {} }, { run_id: 'rl', manifest_sha: 'abc', method: 'native', cells: [{ cell: 'lc', status: 'PASS', evidence: '/e/l.log' }] });
+  if (!(regL.cases[0].run_status === 'PASS' && !('record' in regL.cases[0].evidence_records))) { console.log(`self-test failed: a lifted reason-only record kept a PASS cell at NOT RUN or survived beside it: ${JSON.stringify(regL.cases[0].evidence_records)}`); fails = 1; }
   record(reg, map, { run_id: 'r1p', manifest_sha: 'abc', method: 'native', cells: [{ cell: 'pow', status: 'PASS', evidence: '/e/pow.log' }] });
   if (acceptSnapshot(reg) !== before) { console.log('self-test failed: a record changed an accept text'); fails = 1; }
   if (!(touched.length === 1 && reg.cases[0].run_status === 'PASS' && reg.cases[0].run_id === 'r1p' && reg.cases[0].evidence_record.manifest_sha === 'abc' && reg.cases[0].evidence_path === '/e/pow.log' && reg.cases[0].updated)) { console.log(`self-test failed: the run was not written to the mapped case's live fields: ${JSON.stringify(reg.cases[0])}`); fails = 1; }
diff --git a/tools/class-v5/arc-v6-bench.ps1 b/tools/class-v5/arc-v6-bench.ps1
new file mode 100644
index 000000000..a7d67b375
--- /dev/null
+++ b/tools/class-v5/arc-v6-bench.ps1
@@ -0,0 +1,103 @@
+# Class v6 kit (8 October 2026, the coordinator's order): the arc job of the v5 script with the class v6 packs: hl-v6-foldrw (the
+# known-failed partner; expected fingerprint 6ce3dc344a613500, the Mac's Metal and Apple OpenCL reading) and hl-v6-all (the
+# all-together pack, id 9d40978601a7df2a; with the second zip its OpenCL text is the window's real text and the expected
+# fingerprint is the CUDA reference e8f4f3289c6ee1fc; the first zip's stub refused it, that refusal line being that run's record).
+# Kit fetch job fetch-class-v6-kit-20261008-g6 = the third zip packs-class-v6-20261008T194045Z.zip (735e1411...), generator 6 packs; the
+# earlier dir fetch-class-v6-kit-20261008 holds zip 2 (generator 5) and stays as the generator 5 record's kit.
+# Class v5 kit bench on the Intel Arc B580 (7 October 2026, 23:5x UK, main's word: the B580 is the eGPU of the second PC,
+# so the Intel fingerprint runs there through the hash lane's job queue as a lock-free, non-elevated, quiet job, never beside
+# an install or a build; the page names no PC): tools/class-v5/pc1-amd-v5-bench.ps1 with the device
+# match on the Intel OpenCL platform (Arc / B580) instead of gfx1201; everything else identical (the v5-dn3-epoch0 pack,
+# the v4-genesis control, RESULT lines, SUMMARY {json}). Expected fingerprint 6ce3dc344a613500.
+# Class v5 kit bench on PC 1's RX 9070 XT (7 October 2026, docs/design/class-v5-stored-state.md section 13, "the kit:
+# OpenCL (AMD)"): the kit's igneum-worker-opencl.exe (THIS tree's proto-opencl/host.c with the class v5 leaf upload:
+# igneum_build(ds, cache, leaves, nLeaves, nItems), the leaves of leaves.bin checked against the pack's FNV-1a 64 first)
+# runs --bench-pack on the first class v5 pack, proto-cuda/packs-ca3-v5/v5-dn3-epoch0 (program id e5a4ac5978462156, 11
+# leaves under state root 7e37a9fb..., cache FNV 7334fa46e5d972eb), on the gfx1201 device. Expected: the self-test
+# PASS line (cache head, last line and FNV; dataset head, word [268435455] and 64 samples; 96 of 96 vector lanes) and the
+# fingerprint of the 2^24 outputs at base nonce 0 equal to the Metal reading, 6ce3dc344a613500 (the M5 Max, 7 October
+# 2026, 18:07:09Z). The v4-genesis control pack runs after it so the run has a known class v4 row beside the v5 row.
+# Beside the miners (a correctness and fingerprint gate; the rate row is labelled loaded when the card mines): no card is
+# switched, nothing is posted to the installed app, nothing is built on the PC. Published by the Counter ASIC coordinator
+# only (the PC 1 queue is its); the kit is fetch job $kitId. Every result line starts with RESULT; SUMMARY {json} ends it.
+# Post-review packs (8 October 2026, 20:4x UK, the third kit zip packs-class-v6-20261008T194045Z.zip, sha256 735e1411...): the packs are
+# generator 6 (class v6; ids hl-v6-all 4de7b836cc40a4ea, hl-v6-foldrw d7eba30115d26dd4) and the expected fingerprints are the
+# Mac's Metal and Apple OpenCL reading of them (all pack e8f4f3289c6ee1fc, partner 6ce3dc344a613500); the generator 5 zips' values
+# (59e6708e46f1e87c and 5a6ad122a71a888f) belong to the superseded packs and no longer match by construction.
+$ErrorActionPreference = 'Continue'
+$jobName = 'arc-v6-bench'
+$kitId = $env:IGNEUM_V5_KIT_ID; if (-not $kitId) { $kitId = 'fetch-class-v6-kit-20261008-g6' }   # a fresh dir for the generator 6 zip: a fetch into the old dir left zip 2's files in place (PC 2, 20:17 UK)
+$expected = '6ce3dc344a613500'
+$started = Get-Date
+function Stamp { (Get-Date).ToUniversalTime().ToString('yyyy-MM-ddTHH:mm:ssZ') }
+function Summary([string] $status, [hashtable] $extra) {
+  $o = [ordered]@{ job = $jobName; status = $status; duration_s = [int]((Get-Date) - $started).TotalSeconds; finished_at = (Stamp) }
+  foreach ($k in $extra.Keys) { $o[$k] = $extra[$k] }
+  'SUMMARY ' + ($o | ConvertTo-Json -Compress -Depth 4)
+}
+"RESULT start $(Stamp) job=$jobName machine=$env:COMPUTERNAME app_version=$env:IGNEUM_APP_VERSION expected_fingerprint=$expected"
+$jobs = Split-Path $env:IGNEUM_JOB_DIR
+$kit = Join-Path $jobs $kitId
+if (-not (Test-Path $kit)) { "RESULT error kit missing at $kit (the fetch job $kitId runs first; republish it after any app update)"; Summary 'failed' @{ error = 'kit missing' }; exit 2 }
+$exe = Join-Path $kit 'bin\windows\igneum-worker-opencl.exe'
+$packs = Join-Path $kit 'packs'
+if (-not (Test-Path $exe)) { "RESULT error worker missing at $exe"; Summary 'failed' @{ error = 'worker missing' }; exit 2 }
+"RESULT worker kit $exe sha256 $((Get-FileHash -Algorithm SHA256 $exe).Hash.ToLower()) bytes $((Get-Item $exe).Length)"
+foreach ($pk in @('hl-v6-foldrw', 'hl-v6-all')) {
+  $d = Join-Path $packs $pk
+  if (-not (Test-Path (Join-Path $d 'kernel_bound.cl'))) { "RESULT error pack $pk missing at $d"; Summary 'failed' @{ error = "pack $pk missing" }; exit 2 }
+  "RESULT pack $pk kernel_bound.cl sha256 $((Get-FileHash -Algorithm SHA256 (Join-Path $d 'kernel_bound.cl')).Hash.ToLower()) program.h sha256 $((Get-FileHash -Algorithm SHA256 (Join-Path $d 'program.h')).Hash.ToLower())"
+}
+# the class v6 kit's packs each carry their own leaves.bin (the class v5 script checked one pack by name; the 18:01 UK run on
+# PC 1 stopped on that name before the device list)
+foreach ($lp in @('hl-v6-foldrw', 'hl-v6-all')) {
+  $leaves = Join-Path $packs ($lp + '\leaves.bin')
+  if (-not (Test-Path $leaves)) { "RESULT error leaves.bin missing at $leaves (a class v5 pack without its leaves builds nothing)"; Summary 'failed' @{ error = 'leaves missing'; pack = $lp }; exit 2 }
+  "RESULT leaves $lp $((Get-Item $leaves).Length) bytes sha256 $((Get-FileHash -Algorithm SHA256 $leaves).Hash.ToLower())"
+}
+# the OpenCL device index of the 9070 XT (the installed worker's list when present: the app's own indices)
+$inst = @("$env:LOCALAPPDATA\Programs\Igneum Miner", "$env:ProgramFiles\Igneum Miner") | Where-Object { Test-Path (Join-Path $_ 'igneum-app.exe') } | Select-Object -First 1
+$listExe = $exe
+if ($inst -and (Test-Path (Join-Path $inst 'igneum-worker-opencl.exe'))) { $listExe = Join-Path $inst 'igneum-worker-opencl.exe' }
+$list = @(& $listExe --list 2>&1 | ForEach-Object { "$_" })
+$list | ForEach-Object { "RESULT list $_" }
+$dev = $null
+foreach ($l in $list) { if ($l -match '^\s*\[(\d+)\].*(Intel|Arc|B580)' -and $l -notmatch 'dup') { $dev = [int]$Matches[1]; break } }
+if ($null -eq $dev) { "RESULT error no Intel Arc device in --list (the B580 is off the bus or has no OpenCL runtime: the Intel v5 row stays OWED)"; Summary 'failed' @{ error = 'no intel arc' }; exit 2 }
+"RESULT device $dev Intel Arc (list from $listExe)"
+function Workers { @(Get-CimInstance Win32_Process -Filter "Name = 'igneum-worker-opencl.exe' OR Name = 'igneum-worker-cuda.exe'" -ErrorAction SilentlyContinue | ForEach-Object { "$($_.Name):$($_.ProcessId):[$($_.CommandLine -replace '\s+', ' ')]" }) }
+$w = @(Workers)
+$loaded = ($w | Where-Object { $_ -match "igneum-worker-opencl.*--device\s+$dev(\s|$)" }).Count -gt 0
+"RESULT workers_before $(Stamp) $($w -join ' ')"
+$state = if ($loaded) { 'loaded' } else { 'quiet' }
+"RESULT context card_state=$state (a fingerprint gate: the load changes the rate row, never the bytes)"
+$rows = @{}
+$fpOk = $false
+foreach ($pk in @('hl-v6-foldrw', 'hl-v6-all')) {
+  $d = Join-Path $packs $pk
+  $t0 = Get-Date
+  "RESULT bench $pk start $(Stamp) cmd=igneum-worker-opencl.exe --bench-pack --pack $d --device $dev --batch-log2 24 --batches 5"
+  $out = @(& $exe --bench-pack --pack $d --device $dev --batch-log2 24 --batches 5 2>&1 | ForEach-Object { "$_" })
+  $code = $LASTEXITCODE
+  $secs = [int]((Get-Date) - $t0).TotalSeconds
+  # the whole stdout, line by line (the 09:36 UK run kept one line per pack and lost the host's exchange, kernel,
+  # rotate-fold and build-log lines, which the diagnosis needed)
+  foreach ($l in $out) { "RESULT bench $pk out $l" }
+  $res = $out | Where-Object { $_ -match '^RESULT ' } | Select-Object -Last 1
+  $fp = ''; $mhs = ''; $check = ''
+  if ($res -match 'fingerprint=([0-9a-f]{16})') { $fp = $Matches[1] }
+  if ($res -match 'mhs=([0-9.]+)') { $mhs = $Matches[1] }
+  if ($res -match 'check=(\w+)') { $check = $Matches[1] }
+  $rows[$pk] = [ordered]@{ exit = $code; seconds = $secs; fingerprint = $fp; mhs = $mhs; check = $check; card_state = $state }
+  if ($pk -eq 'hl-v6-foldrw') {
+    $fpOk = ($fp -eq $expected -and $check -eq 'PASS')
+    "RESULT partner fingerprint=$fp expected=$expected match=$fpOk check=$check mhs=$mhs card_state=$state exit=$code seconds=$secs $(Stamp)"
+  } else {
+    # the all pack: with the window's OpenCL text (the second zip) a fingerprint, expected the CUDA reference e8f4f3289c6ee1fc
+    $allOk = ($fp -eq 'e8f4f3289c6ee1fc' -and $check -eq 'PASS')
+    "RESULT all-pack fingerprint=$fp expected=e8f4f3289c6ee1fc match=$allOk check=$check mhs=$mhs card_state=$state exit=$code seconds=$secs $(Stamp)"
+  }
+}
+"RESULT workers_after $(Stamp) $((@(Workers)) -join ' ')"
+Summary $(if ($fpOk) { 'done' } else { 'failed' }) @{ expected = $expected; partner = $rows['hl-v6-foldrw']; all_pack = $rows['hl-v6-all']; device = $dev; kit = $kitId }
+exit $(if ($fpOk) { 0 } else { 1 })
diff --git a/tools/class-v5/kits-remote.sh b/tools/class-v5/kits-remote.sh
index 15c43d55c..e355bd5ab 100755
--- a/tools/class-v5/kits-remote.sh
+++ b/tools/class-v5/kits-remote.sh
@@ -13,9 +13,9 @@
 #
 # Takes one of the box's build slots through infra/build-server/remote-run.sh (bs_remote_run), box 1 by default (the
 # build-server lane's word of 7 October 2026, 19:4x BST: the kit builds on build-1 explicitly). The work itself is
-# tools/class-v5/kits-on-box.sh, a script file run by path on the box (the inline-rm rule of 21:33 BST); when the
+# tools/class-v5/kits-on-box.sh (or KITS_BOX_SCRIPT=kits-v6-on-box.sh for the class v6 kit), a script file run by path on the box (the inline-rm rule of 21:33 BST); when the
 # build-server lane's lease tool is in place, the same file goes through `/srv/builds/_bin/lease pool <threads> -- bash
-# tools/class-v5/kits-on-box.sh ...` with the label "v5 kit".
+# tools/class-v5/${KITS_BOX_SCRIPT:-kits-on-box.sh} ...` with the label "v5 kit".
 set -euo pipefail
 HERE="$(cd "$(dirname "${BASH_SOURCE[0]}")" && pwd)"
 BS_TOOL=class-v5-kits
@@ -34,9 +34,9 @@ ZIP="/srv/artefacts/packs/packs-ca3-v5-$STAMP.zip"
 bs_toolchain_check
 bs_sync_sources
 bs_log "sources at $WT (commit $BS_SHA on $BS_BRANCH); building the class v5 kits on box $BOX"
-# the body runs from a script FILE at the worktree's mirror checkout (tools/class-v5/kits-on-box.sh, carried by the commit), never
+# the body runs from a script FILE at the worktree's mirror checkout (tools/class-v5/${KITS_BOX_SCRIPT:-kits-on-box.sh}, carried by the commit), never
 # an inline string: main's rule of 7 October 2026, 21:33 BST (no rm, find -delete or truncation inside a bash -c string)
-CMD="cd '$WT' && bash tools/class-v5/kits-on-box.sh '$STAMP' '$SKIP_EMU'"
+CMD="cd '$WT' && bash tools/class-v5/${KITS_BOX_SCRIPT:-kits-on-box.sh} '$STAMP' '$SKIP_EMU'"
 set +e
 BR_KIND=build BR_COMMAND="class v5 kits (packfile-test, emu --check v5, Linux and Windows workers, kit zip)" BR_TARGET="x86_64-linux+windows" BR_ARTEFACTS="" \
   bs_remote_run "$WT" "$BS_WT class-v5 kits" "$CMD" 2>&1 | tee "/tmp/v5-kits-$STAMP.log" | grep -E '^(STEP|FAIL|KIT|BIN|LOGS|check PASS|self-test|packfile-test|emu:|     v5|build-remote: RESULT)'
diff --git a/tools/class-v5/kits-v6-on-box.sh b/tools/class-v5/kits-v6-on-box.sh
new file mode 100755
index 000000000..845cdbd5c
--- /dev/null
+++ b/tools/class-v5/kits-v6-on-box.sh
@@ -0,0 +1,98 @@
+#!/usr/bin/env bash
+# The class v5 kit build as it runs ON igneum-build-1 (called by tools/class-v5/kits-remote.sh through the build-server
+# library's remote runner, from the worktree's mirror checkout, so this file travels with the commit). A script file by
+# path, never an inline string: main's rule of 7 October 2026, 21:33 BST (no rm, find -delete or truncation inside a
+# `bash -c` string; tools/ci/inline-rm-check.sh). What it does, in order: the pack loader test with the class v5 cases,
+# the Linux and Windows builds of the two one-click workers, the CPU emulation's --check on the class v5 pack, then the
+# kit zip at /srv/artefacts/packs/packs-ca3-v5-<stamp>.zip with SHA256SUMS. Logs land in /srv/builds/_log/v5-class/kits-<stamp>.
+#   bash tools/class-v5/kits-on-box.sh <stamp> <skip-emu 0|1>      (cwd = the worktree root on the box)
+set -u
+STAMP="${1:?stamp}"; SKIP_EMU="${2:-0}"
+ZIP="/srv/artefacts/packs/packs-class-v6-$STAMP.zip"
+LOGDIR="/srv/builds/_log/v5-class/kits-$STAMP"
+T=$(mktemp -d /tmp/v5-kits.XXXXXX); S=$T/stage; mkdir -p "$S/bin/linux" "$S/bin/windows" "$S/src" "$S/packs" "$S/tools" "$LOGDIR"
+rc=0
+step() { echo "STEP $1 $(date -u +%H:%M:%SZ)"; }
+fail() { echo "FAIL $1"; rc=1; }
+finish() { cp "$T"/*.log "$LOGDIR"/ 2>/dev/null; echo "LOGS $LOGDIR"; rm -rf "$T"; }
+# class v6 (8 October 2026, the coordinator's order): the all-together pack and its known-failed partner come from the hash
+# lane's tgz files on build-1 (V6_ALL and V6_PARTNER, default hl-v6-all and hl-v6-foldrw), extracted beside the stage;
+# the emulation check runs pack A = the all pack against pack B = the partner, and the two ids must differ
+V6_ALL="${V6_ALL:-hl-v6-all}"; V6_PARTNER="${V6_PARTNER:-hl-v6-foldrw}"
+PK=$T/v6packs; mkdir -p "$PK"
+for p in "$V6_ALL" "$V6_PARTNER"; do tar -xzf "/srv/artefacts/packs/$p.tgz" -C "$PK" 2>/dev/null || { echo "FAIL no pack tgz /srv/artefacts/packs/$p.tgz"; exit 1; }; done
+rm -rf "$PK"/._* "$PK"/*/._* 2>/dev/null
+V5="$PK/$V6_ALL"; V6P="$PK/$V6_PARTNER"
+echo "PACKS $V6_ALL id $(grep -oE 'IGNEUM_PROGRAM_ID 0x[0-9a-f]+' "$V5/program.h" | awk '{print $2}') | $V6_PARTNER id $(grep -oE 'IGNEUM_PROGRAM_ID 0x[0-9a-f]+' "$V6P/program.h" | awk '{print $2}')"
+[ "$(grep -oE 'IGNEUM_PROGRAM_ID 0x[0-9a-f]+' "$V5/program.h")" != "$(grep -oE 'IGNEUM_PROGRAM_ID 0x[0-9a-f]+' "$V6P/program.h")" ] || { echo "FAIL the all pack and its partner carry one id"; exit 1; }
+# the test's third argument is its class v5 known-good (the checked-in Devnet 3 epoch 0 pack, generator 5, 11 leaves); the kit's all
+# pack is generator 6 since the post-review export (class v6, 93 leaves) and fails that check by construction (the third kit build,
+# 20:38 UK), so the checked-in pack is named and the v6 packs are read by the emulation check below
+step packfile-test
+cc -std=c99 -Wall -Wextra -Wno-unused-function -O1 -o "$T/packfile-test" proto-cuda/nvrtc/emu/packfile-test.c && "$T/packfile-test" proto-cuda/packs/igneum-devnet-v4-epoch0 proto-cuda/packs-ca3-v5/v5-dn3-epoch0 > "$T/packfile-test.log" 2>&1 || fail "packfile-test ($(tail -1 "$T/packfile-test.log"))"
+grep -E '^(FAIL|     v5 pack)' "$T/packfile-test.log"; grep -c '^ok' "$T/packfile-test.log" | sed 's/^/packfile-test ok lines /'
+step linux-opencl-worker
+gcc -std=c99 -O2 -Wall -Wextra -Wno-stringop-truncation -Wno-format-truncation -DIGNEUM_CL_DYNAMIC -DCL_TARGET_OPENCL_VERSION=120 -I proto-cuda/packs/igneum-devnet-v4-epoch0 -DIGNEUM_KERNEL_PATH='"kernel_bound.cl"' -o "$S/bin/linux/igneum-worker-opencl" proto-opencl/host.c -ldl -lpthread 2> "$T/cl-linux.log" || { fail "linux opencl worker"; head -20 "$T/cl-linux.log"; }
+step linux-cuda-worker
+g++ -std=c++17 -O2 -Wall -Wextra -I proto-cuda/nvrtc -I /usr/local/cuda/include -o "$S/bin/linux/igneum-worker-cuda" proto-cuda/nvrtc/worker.cpp -ldl -lpthread 2> "$T/cuda-linux.log" || { fail "linux cuda worker"; head -20 "$T/cuda-linux.log"; }
+step windows-cuda-worker
+x86_64-w64-mingw32-g++ -std=c++17 -O2 -Wall -Wextra -static -I proto-cuda/nvrtc -I /usr/local/cuda/include -o "$S/bin/windows/igneum-worker-cuda.exe" proto-cuda/nvrtc/worker.cpp 2> "$T/cuda-win.log" && x86_64-w64-mingw32-strip "$S/bin/windows/igneum-worker-cuda.exe" || { fail "windows cuda worker"; head -20 "$T/cuda-win.log"; }
+step windows-opencl-worker
+# the Khronos CL headers alone (never -I /usr/include: that puts glibc's stdint.h ahead of mingw's)
+mkdir -p "$T/inc" && cp -r /usr/include/CL "$T/inc/"
+x86_64-w64-mingw32-gcc -std=c99 -O2 -Wall -Wextra -Wno-stringop-truncation -Wno-format-truncation -static -DIGNEUM_CL_DYNAMIC -DCL_TARGET_OPENCL_VERSION=120 -I "$T/inc" -I proto-cuda/packs/igneum-devnet-v4-epoch0 -DIGNEUM_KERNEL_PATH='"kernel_bound.cl"' -o "$S/bin/windows/igneum-worker-opencl.exe" proto-opencl/host.c 2> "$T/cl-win.log" && x86_64-w64-mingw32-strip "$S/bin/windows/igneum-worker-opencl.exe" || { fail "windows opencl worker"; head -20 "$T/cl-win.log"; }
+if [ "$SKIP_EMU" = 0 ]; then
+  step emu-check-v5
+  # the CPU emulation (proto-cuda/nvrtc/emu/test.sh's build) with pack A = the class v5 pack and pack B = the v4 control
+  E=$T/emu; mkdir -p "$E"
+  emu_kernel() { { echo '#include <cuda_runtime.h>'; echo '#include <cstdint>'; echo "namespace $2 {"; sed -E 's/([A-Za-z_0-9]+)<<<([^,]+), ([^>]+)>>>\(/emu_launch(\1, \2, \3, /' "$1/$3.cu"; echo "}"; } > "$E/$3_$2.cpp"; g++ -std=c++17 -O2 -w -I proto-cuda/emu -I "$1" -c "$E/$3_$2.cpp" -o "$E/$3_$2.o"; }
+  emu_kernel "$V5" emu_pack_a kernel && emu_kernel "$V5" emu_pack_a kernel_bound && emu_kernel "$V6P" emu_pack_b kernel && emu_kernel "$V6P" emu_pack_b kernel_bound \
+   && g++ -std=c++17 -O2 -Wall -Wextra -DIGNEUM_EMU -I proto-cuda/nvrtc -I /usr/local/cuda/include -c proto-cuda/nvrtc/worker.cpp -o "$E/worker.o" \
+   && g++ -std=c++17 -O2 -Wall -Wextra -DIGNEUM_EMU -DIGNEUM_EMU_TWO_PACKS -I proto-cuda/nvrtc -I proto-cuda/emu -I /usr/local/cuda/include -c proto-cuda/nvrtc/emu/emu_backend.cpp -o "$E/emu_backend.o" \
+   && g++ -std=c++17 -O2 -w -I proto-cuda/emu -c proto-cuda/emu/shim.cpp -o "$E/shim.o" \
+   && g++ -o "$E/igneum-worker-cuda-emu" "$E"/*.o -pthread 2> "$T/emu-build.log" || { fail "emu build"; head -30 "$T/emu-build.log"; }
+  if [ -x "$E/igneum-worker-cuda-emu" ]; then
+    ( IGNEUM_EMU_PACK="$V5" IGNEUM_EMU_PACK2="$V6P" timeout 1500 nice -n 10 "$E/igneum-worker-cuda-emu" --check --pack "$V5" > "$T/emu-check.log" 2>&1 ) || fail "emu --check on the class v5 pack (rc $?)"
+    grep -E '^check PASS|self-test|FAIL|error' "$T/emu-check.log" | cut -c1-400
+  fi
+fi
+if [ "$rc" != 0 ]; then echo "KIT not written: a step failed (rc $rc)"; finish; exit 1; fi
+step stage
+for p in "$V6_ALL" "$V6_PARTNER"; do mkdir -p "$S/packs/$p"; cp "$PK/$p"/* "$S/packs/$p/"; done
+cp proto-cuda/nvrtc/worker.cpp proto-cuda/nvrtc/packfile.h proto-cuda/nvrtc/cuda_api.h proto-opencl/host.c proto-opencl/cl_dynamic.h proto-newpow/class-v5/bench.cu proto-newpow/class-v5/run.sh proto-metal/packbench.swift "$S/src/"
+cp tools/class-v5/fleet-cuda-v5-bench.sh tools/class-v5/pc1-amd-v5-bench.ps1 "$S/tools/"
+cat > "$S/README.txt" <<'R'
+packs-class-v6: the class v6 kit (Igneum, 8 October 2026; docs/design/class-v5-stored-state.md section 0, the class v6 row): the all-together pack and its known-failed partner
+packs/v5-dn3-epoch0   the first class v5 pack: Devnet 3 epoch 0, program id e5a4ac5978462156, 11 state leaves (leaves.bin, 704 B) under
+                      state root 7e37a9fb19b154d32daf5bf30a50d339a75029fbc9eec9ea20e95439dba5a311, cache FNV-1a 64 7334fa46e5d972eb
+                      expected fingerprint of the 2^24 outputs at base nonce 0: 82b19cbde8557ea5 (Metal, M5 Max, 18:07:09Z) on every platform
+packs/v5-genesis      the string-seed class v5 pack over the devnet's 93 leaves; packs/v4-genesis the class v4 control (sub-version 3)
+bin/linux             igneum-worker-cuda (NVRTC, libcuda + libnvrtc.so.12 at run time), igneum-worker-opencl (libOpenCL.so.1 at run time)
+bin/windows           igneum-worker-cuda.exe (nvcuda.dll + nvrtc64 at run time), igneum-worker-opencl.exe (OpenCL.dll at run time)
+Every worker reads a class v5 pack's leaves.bin, checks it against the pack's IGNEUM_STATE_LEAVES_FNV64, uploads it for igneum_build and
+frees it after the build; a pack without its leaves builds nothing. Self-test: cache head, last line and FNV; dataset head, last word and
+64 samples; 96 vector lanes. Bench: igneum-worker-cuda --bench --pack packs/v5-dn3-epoch0 --batch-log2 24 (fleet-cuda-v5-bench.sh);
+igneum-worker-opencl --bench-pack --pack packs/v5-dn3-epoch0 --batch-log2 24 --device <n> (pc1-amd-v5-bench.ps1); src/bench.cu with nvcc.
+Intel: not measured tonight (7 October 2026); no Arc B580 sits on PC 1 or PC 2 and the only Arc path needs a driver click, which no PC job
+may raise; the card's holder and a click-free driver path are owed. The OpenCL worker takes the Intel device by index the same way.
+R
+( cd "$S" && find . -type f ! -name SHA256SUMS | sort | xargs sha256sum > SHA256SUMS )
+mkdir -p /srv/artefacts/packs
+python3 - "$S" "$ZIP" <<'PY'
+import os, sys, zipfile
+stage, out = sys.argv[1], sys.argv[2]
+with zipfile.ZipFile(out, 'w', zipfile.ZIP_DEFLATED) as z:
+    for dp, dn, fn in os.walk(stage):
+        dn.sort()
+        for f in sorted(fn):
+            p = os.path.join(dp, f); rel = os.path.relpath(p, stage)
+            zi = zipfile.ZipInfo(rel, date_time=(2026, 10, 7, 0, 0, 0)); zi.compress_type = zipfile.ZIP_DEFLATED
+            zi.external_attr = (0o755 if rel.startswith('bin/') or rel.endswith('.sh') else 0o644) << 16
+            with open(p, 'rb') as fh: z.writestr(zi, fh.read())
+PY
+sha256sum "$ZIP" | cut -c1-64 > "$ZIP.sha256"
+echo "KIT $ZIP bytes $(stat -c %s "$ZIP") files $(python3 -c "import zipfile,sys; print(len(zipfile.ZipFile(sys.argv[1]).namelist()))" "$ZIP")"
+echo "KIT sha256 $(cat "$ZIP.sha256")"
+for b in "$S"/bin/linux/* "$S"/bin/windows/*; do echo "BIN $(basename "$(dirname "$b")")/$(basename "$b") $(stat -c %s "$b") bytes sha256 $(sha256sum "$b" | cut -c1-64)"; done
+finish
+exit 0
diff --git a/tools/class-v5/pc1-v6-bench.ps1 b/tools/class-v5/pc1-v6-bench.ps1
new file mode 100644
index 000000000..84f8349cd
--- /dev/null
+++ b/tools/class-v5/pc1-v6-bench.ps1
@@ -0,0 +1,95 @@
+# Class v6 kit (8 October 2026, the coordinator's order): the amd job of the v5 script with the class v6 packs: hl-v6-foldrw (the
+# known-failed partner; expected fingerprint 6ce3dc344a613500, the Mac's Metal and Apple OpenCL reading) and hl-v6-all (the
+# all-together pack, id 9d40978601a7df2a; with the second zip its OpenCL text is the window's real text and the expected
+# fingerprint is the CUDA reference e8f4f3289c6ee1fc; the first zip's stub refused it, that refusal line being that run's record).
+# Kit fetch job fetch-class-v6-kit-20261008 = the second zip (packs-class-v6-<stamp>.zip named in the job's publish line).
+# Class v5 kit bench on PC 1's RX 9070 XT (7 October 2026, docs/design/class-v5-stored-state.md section 13, "the kit:
+# OpenCL (AMD)"): the kit's igneum-worker-opencl.exe (THIS tree's proto-opencl/host.c with the class v5 leaf upload:
+# igneum_build(ds, cache, leaves, nLeaves, nItems), the leaves of leaves.bin checked against the pack's FNV-1a 64 first)
+# runs --bench-pack on the first class v5 pack, proto-cuda/packs-ca3-v5/v5-dn3-epoch0 (program id e5a4ac5978462156, 11
+# leaves under state root 7e37a9fb..., cache FNV 7334fa46e5d972eb), on the gfx1201 device. Expected: the self-test
+# PASS line (cache head, last line and FNV; dataset head, word [268435455] and 64 samples; 96 of 96 vector lanes) and the
+# fingerprint of the 2^24 outputs at base nonce 0 equal to the Metal reading, 6ce3dc344a613500 (the M5 Max, 7 October
+# 2026, 18:07:09Z). The v4-genesis control pack runs after it so the run has a known class v4 row beside the v5 row.
+# Beside the miners (a correctness and fingerprint gate; the rate row is labelled loaded when the card mines): no card is
+# switched, nothing is posted to the installed app, nothing is built on the PC. Published by the Counter ASIC coordinator
+# only (the PC 1 queue is its); the kit is fetch job $kitId. Every result line starts with RESULT; SUMMARY {json} ends it.
+# Post-review packs (8 October 2026, 20:4x UK, the third kit zip packs-class-v6-20261008T194045Z.zip, sha256 735e1411...): the packs are
+# generator 6 (class v6; ids hl-v6-all 4de7b836cc40a4ea, hl-v6-foldrw d7eba30115d26dd4) and the expected fingerprints are the
+# Mac's Metal and Apple OpenCL reading of them (all pack e8f4f3289c6ee1fc, partner 6ce3dc344a613500); the generator 5 zips' values
+# (59e6708e46f1e87c and 5a6ad122a71a888f) belong to the superseded packs and no longer match by construction.
+$ErrorActionPreference = 'Continue'
+$jobName = 'pc1-v6-bench'
+$kitId = $env:IGNEUM_V5_KIT_ID; if (-not $kitId) { $kitId = 'fetch-class-v6-kit-20261008' }
+$expected = '6ce3dc344a613500'
+$started = Get-Date
+function Stamp { (Get-Date).ToUniversalTime().ToString('yyyy-MM-ddTHH:mm:ssZ') }
+function Summary([string] $status, [hashtable] $extra) {
+  $o = [ordered]@{ job = $jobName; status = $status; duration_s = [int]((Get-Date) - $started).TotalSeconds; finished_at = (Stamp) }
+  foreach ($k in $extra.Keys) { $o[$k] = $extra[$k] }
+  'SUMMARY ' + ($o | ConvertTo-Json -Compress -Depth 4)
+}
+"RESULT start $(Stamp) job=$jobName machine=$env:COMPUTERNAME app_version=$env:IGNEUM_APP_VERSION expected_fingerprint=$expected"
+$jobs = Split-Path $env:IGNEUM_JOB_DIR
+$kit = Join-Path $jobs $kitId
+if (-not (Test-Path $kit)) { "RESULT error kit missing at $kit (the fetch job $kitId runs first; republish it after any app update)"; Summary 'failed' @{ error = 'kit missing' }; exit 2 }
+$exe = Join-Path $kit 'bin\windows\igneum-worker-opencl.exe'
+$packs = Join-Path $kit 'packs'
+if (-not (Test-Path $exe)) { "RESULT error worker missing at $exe"; Summary 'failed' @{ error = 'worker missing' }; exit 2 }
+"RESULT worker kit $exe sha256 $((Get-FileHash -Algorithm SHA256 $exe).Hash.ToLower()) bytes $((Get-Item $exe).Length)"
+foreach ($pk in @('hl-v6-foldrw', 'hl-v6-all')) {
+  $d = Join-Path $packs $pk
+  if (-not (Test-Path (Join-Path $d 'kernel_bound.cl'))) { "RESULT error pack $pk missing at $d"; Summary 'failed' @{ error = "pack $pk missing" }; exit 2 }
+  "RESULT pack $pk kernel_bound.cl sha256 $((Get-FileHash -Algorithm SHA256 (Join-Path $d 'kernel_bound.cl')).Hash.ToLower()) program.h sha256 $((Get-FileHash -Algorithm SHA256 (Join-Path $d 'program.h')).Hash.ToLower())"
+}
+# the class v6 kit's packs each carry their own leaves.bin (the class v5 script checked one pack by name; the 18:01 UK run on
+# PC 1 stopped on that name before the device list)
+foreach ($lp in @('hl-v6-foldrw', 'hl-v6-all')) {
+  $leaves = Join-Path $packs ($lp + '\leaves.bin')
+  if (-not (Test-Path $leaves)) { "RESULT error leaves.bin missing at $leaves (a class v5 pack without its leaves builds nothing)"; Summary 'failed' @{ error = 'leaves missing'; pack = $lp }; exit 2 }
+  "RESULT leaves $lp $((Get-Item $leaves).Length) bytes sha256 $((Get-FileHash -Algorithm SHA256 $leaves).Hash.ToLower())"
+}
+# the OpenCL device index of the 9070 XT (the installed worker's list when present: the app's own indices)
+$inst = @("$env:LOCALAPPDATA\Programs\Igneum Miner", "$env:ProgramFiles\Igneum Miner") | Where-Object { Test-Path (Join-Path $_ 'igneum-app.exe') } | Select-Object -First 1
+$listExe = $exe
+if ($inst -and (Test-Path (Join-Path $inst 'igneum-worker-opencl.exe'))) { $listExe = Join-Path $inst 'igneum-worker-opencl.exe' }
+$list = @(& $listExe --list 2>&1 | ForEach-Object { "$_" })
+$list | ForEach-Object { "RESULT list $_" }
+$dev = $null
+foreach ($l in $list) { if ($l -match '^\s*\[(\d+)\].*gfx1102' -and $l -notmatch 'dup') { $dev = [int]$Matches[1]; break } }
+if ($null -eq $dev) { "RESULT error no gfx1102 device in --list (the RX 7600 is off the bus: the AMD class v6 row stays OWED)"; Summary 'failed' @{ error = 'no gfx1102' }; exit 2 }
+"RESULT device $dev gfx1102 (list from $listExe)"
+function Workers { @(Get-CimInstance Win32_Process -Filter "Name = 'igneum-worker-opencl.exe' OR Name = 'igneum-worker-cuda.exe'" -ErrorAction SilentlyContinue | ForEach-Object { "$($_.Name):$($_.ProcessId):[$($_.CommandLine -replace '\s+', ' ')]" }) }
+$w = @(Workers)
+$loaded = ($w | Where-Object { $_ -match "igneum-worker-opencl.*--device\s+$dev(\s|$)" }).Count -gt 0
+"RESULT workers_before $(Stamp) $($w -join ' ')"
+$state = if ($loaded) { 'loaded' } else { 'quiet' }
+"RESULT context card_state=$state (a fingerprint gate: the load changes the rate row, never the bytes)"
+$rows = @{}
+$fpOk = $false
+foreach ($pk in @('hl-v6-foldrw', 'hl-v6-all')) {
+  $d = Join-Path $packs $pk
+  $t0 = Get-Date
+  "RESULT bench $pk start $(Stamp) cmd=igneum-worker-opencl.exe --bench-pack --pack $d --device $dev --batch-log2 24 --batches 5"
+  $out = @(& $exe --bench-pack --pack $d --device $dev --batch-log2 24 --batches 5 2>&1 | ForEach-Object { "$_" })
+  $code = $LASTEXITCODE
+  $secs = [int]((Get-Date) - $t0).TotalSeconds
+  foreach ($l in $out) { if ($l -match '^(pack |class v5|RESULT |FAIL|error|warm-up)') { "RESULT bench $pk out $l" } }
+  $res = $out | Where-Object { $_ -match '^RESULT ' } | Select-Object -Last 1
+  $fp = ''; $mhs = ''; $check = ''
+  if ($res -match 'fingerprint=([0-9a-f]{16})') { $fp = $Matches[1] }
+  if ($res -match 'mhs=([0-9.]+)') { $mhs = $Matches[1] }
+  if ($res -match 'check=(\w+)') { $check = $Matches[1] }
+  $rows[$pk] = [ordered]@{ exit = $code; seconds = $secs; fingerprint = $fp; mhs = $mhs; check = $check; card_state = $state }
+  if ($pk -eq 'hl-v6-foldrw') {
+    $fpOk = ($fp -eq $expected -and $check -eq 'PASS')
+    "RESULT partner fingerprint=$fp expected=$expected match=$fpOk check=$check mhs=$mhs card_state=$state exit=$code seconds=$secs $(Stamp)"
+  } else {
+    # the all pack: with the window's OpenCL text (the second zip) a fingerprint, expected the CUDA reference e8f4f3289c6ee1fc
+    $allOk = ($fp -eq 'e8f4f3289c6ee1fc' -and $check -eq 'PASS')
+    "RESULT all-pack fingerprint=$fp expected=e8f4f3289c6ee1fc match=$allOk check=$check mhs=$mhs card_state=$state exit=$code seconds=$secs $(Stamp)"
+  }
+}
+"RESULT workers_after $(Stamp) $((@(Workers)) -join ' ')"
+Summary $(if ($fpOk) { 'done' } else { 'failed' }) @{ expected = $expected; partner = $rows['hl-v6-foldrw']; all_pack = $rows['hl-v6-all']; device = $dev; kit = $kitId }
+exit $(if ($fpOk) { 0 } else { 1 })
diff --git a/tools/site/capture.sh b/tools/site/capture.sh
index 2668463d8..0864dfd66 100755
--- a/tools/site/capture.sh
+++ b/tools/site/capture.sh
@@ -20,7 +20,7 @@ SRV=$!
 trap 'kill "$SRV" 2>/dev/null || true' EXIT
 for i in $(seq 1 40); do curl -fsS "http://127.0.0.1:$PORT/" > /dev/null 2>&1 && break; sleep 0.25; done
 curl -fsS "http://127.0.0.1:$PORT/" > /dev/null || { echo "the site did not answer on $PORT" >&2; cat "$OUT/serve.log" >&2; exit 3; }
-ROUTES="${ROUTES:-/ /download /miner /app /wallet /live /explorer /evidence /litepaper /income /economics /scorecard /audit /docs /tuning /ledger /claims /randomx /provenance /miners /dev-fee /faucet /metamask /404 /acceptance}"
+ROUTES="${ROUTES:-/ /download /miner /app /wallet /live /explorer /evidence /litepaper /income /economics /scorecard /prize /audit /docs /tuning /ledger /claims /randomx /provenance /miners /dev-fee /faucet /metamask /404 /acceptance}"
 WIDTHS="${WIDTHS:-390 1440}"; THEMES="${THEMES:-dark light}"
 shot() { # <route> <width> <theme>
   local route="$1" width="$2" theme="$3" name height
diff --git a/tools/workers/page/workers.html b/tools/workers/page/workers.html
index e113aba38..abb2c5465 100644
--- a/tools/workers/page/workers.html
+++ b/tools/workers/page/workers.html
@@ -1,6 +1,13 @@
 <!doctype html>
 <html lang="en"><head><meta charset="utf-8"><meta name="viewport" content="width=device-width, initial-scale=1, viewport-fit=cover"><meta name="robots" content="noindex">
 <title>Igneum Workers</title>
+<!-- the main site's icon set (site/index.html's head, the ember mark); the files sit next to this page in /srv/workers -->
+<link rel="icon" href="data:image/svg+xml,%3Csvg xmlns='http://www.w3.org/2000/svg' viewBox='0 0 1024 1024'%3E%3Crect width='1024' height='1024' fill='%230C0C0E'/%3E%3Cg transform='translate(166.95 166.95) scale(6.901)'%3E%3Cpolygon points='50,4 74,34 67,58 80,54 61,96 39,96 20,54 33,58 26,34' fill='%23F2541B'/%3E%3Cpolygon points='50,42 59,58 50,82 41,58' fill='%230C0C0E'/%3E%3C/g%3E%3C/svg%3E" type="image/svg+xml">
+<link rel="icon" href="/favicon.ico" sizes="48x48">
+<link rel="icon" href="/favicon-32.png" type="image/png" sizes="32x32">
+<link rel="icon" href="/icon-192.png" type="image/png" sizes="192x192">
+<link rel="icon" href="/icon-512.png" type="image/png" sizes="512x512">
+<link rel="apple-touch-icon" href="/apple-touch-icon.png" sizes="180x180">
 <link rel="stylesheet" href="https://fonts.googleapis.com/css2?family=Unbounded:wght@500;700&family=IBM+Plex+Mono:wght@400;500;600&family=IBM+Plex+Sans:wght@400;500;600&display=swap">
 <style>
   :root {
@@ -195,17 +202,31 @@ function arc(pct, cls) {
 }
 const tone = (pct, warn = 70, bad = 90) => pct >= bad ? 'bad' : pct >= warn ? 'warn' : '';
 
-const FEEDS = { 'igneum-build-1': 'https://build.igneum.network/workers.json', 'igneum-build-2': 'https://build-2.igneum.network/workers.json', 'igneum-build-3': 'https://build-3.igneum.network/workers.json' };
+// one card per entry of boxes[] in the merged workers.json (merge-workers.mjs on build-1, every 20 s); no per-box feed map (8 October 2026:
+// the old three-entry map drew build-1 to build-3 only while the merge carried nine boxes)
+const STALE_S = 120;
+const BOX_NOTES = { 'igneum-build-3': 'down since 16:40 UK, Hetzner switch fault' };
+const PROVISIONING = 'provisioning, first build logged when the sources land';
+function boxState(b) {   // live | down | provisioning, with the line the cards print
+  const age = b && b.collected_at ? (Date.now() - Date.parse(b.collected_at)) / 1000 : null;
+  const stale = !b || b.down || !b.cores || (b.source && b.source.ok === false) || age === null || age > STALE_S;
+  if (b && stale && BOX_NOTES[b.name]) return { kind: 'down', note: BOX_NOTES[b.name] };
+  if (b && b.down) return { kind: 'down', note: String(b.reason || 'no answer from this box') };
+  if (!b || !b.cores) return { kind: 'provisioning', note: PROVISIONING };
+  if (!b.log || !b.log.present) return { kind: 'provisioning', note: PROVISIONING, live: true };
+  return { kind: 'live', stale: age !== null && age > STALE_S };
+}
 const buildHeld = b => (b.slots && b.slots.held || []).filter(h => /^build-\d+$/.test(h.slot)).length;
 const boxesOf = d => (Array.isArray(d.boxes) && d.boxes.length ? d.boxes : d.box ? [{ ...d.box, source: d.sources && d.sources.box, headline: d.headline }] : []);
 function serverSection(b, i) {
   const id = `srv${i}`;
-  if (!b || !b.cores) return `<section class="server" aria-label="${esc(b && b.name || 'build server')}"><div class="head"><div><div class="name">${esc(b && b.name || 'build server')}<small>build server</small></div><div class="facts"><span>${esc(b && b.source && b.source.error || 'provisioning, first build logged when the sources land')}</span></div></div></div><div class="cores">${Array.from({ length: 96 }, () => '<i style="--h:2%"></i>').join('')}</div><div class="corelabel"><span>no sample</span><span></span></div></section>`;
+  const st = boxState(b);
+  if (st.kind === 'down' || !b || !b.cores) return `<section class="server" aria-label="${esc(b && b.name || 'build server')}"><div class="head"><div><div class="name">${esc(b && b.name || 'build server')}<small>build server</small></div><div class="facts"><span>${esc(st.note || PROVISIONING)}</span></div></div></div><div class="cores">${Array.from({ length: 96 }, () => '<i style="--h:2%"></i>').join('')}</div><div class="corelabel"><span>no sample</span><span></span></div></section>`;
   const per = (b.cpu && b.cpu.per_core) || []; const n = Math.max(per.length, b.cores || 96);
   const temps = (b.temps || []).map(x => `${esc(x.name)} <b>${x.c.toFixed(0)}°</b>`);
   const m = b.mem || {}, d = b.disk || {}, sc = b.sccache;
   const hit = sc && sc.hit_rate_pct !== null && sc.hit_rate_pct !== undefined ? sc.hit_rate_pct : null;
-  const stale = b.source && !b.source.ok;
+  const stale = (b.source && !b.source.ok) || st.stale;
   return `<section class="server ${b.running && b.running.length ? 'hot' : ''}" aria-label="${esc(b.name)}">
     <div class="head"><div><div class="name">${esc(b.name)}<small>${esc(b.os || 'build server')}</small></div><div class="facts">${[`<b>${b.cores}</b> threads`, `<b>${esc(fmtUptime(b.uptime_s))}</b> up`, `load <b>${(b.load || []).map(x => Number(x).toFixed(1)).join(' / ')}</b>`, b.kernel ? `kernel <b>${esc(b.kernel)}</b>` : ''].filter(Boolean).map(x => `<span>${x}</span>`).join('')}</div></div>
     <div class="facts">${[...temps, b.net ? `net ↓<b>${esc(fmtBps(b.net.rx_bps))}</b> ↑<b>${esc(fmtBps(b.net.tx_bps))}</b>` : '', `<span title="${esc(b.collected_at)}" ${stale ? 'style="color:var(--warn)"' : ''}>${stale ? 'STALE, ' : ''}read ${esc(ago(b.collected_at))}</span>`].filter(Boolean).map(x => `<span>${x}</span>`).join('')}</div></div>
@@ -219,25 +240,39 @@ function serverSection(b, i) {
       <div class="g">${arc(b.slots ? (buildHeld(b) / Math.max(1, b.slots.count)) * 100 : 0, 'good')}<div><div class="l">Build slots</div><div class="v">${b.slots ? `${buildHeld(b)}/${b.slots.count}` : '–'}</div><div class="s">${b.queue && b.queue.length ? `${b.queue.length} waiting${b.queue.some(q => q.priority === 'gate') ? ', a gate first' : ''}` : 'nobody waiting'}</div></div></div>
     </div></section>`;
 }
-function renderServers() { const bx = boxesOf(D); $('servers').innerHTML = bx.length ? bx.map(serverSection).join('') : serverSection(null, 0); }
+// the Mac mini (igneum-mini, the Mac build box, M6): its own collector pushes mini.json to build-1; until then its card reads no report yet
+const MINI = { name: 'igneum-mini', label: 'the Mac build box, M6' };
+const miniLive = () => { const m = D && D.mini; return m && m.source && m.source.ok && m.cores ? m : null; };
+function miniSection() {
+  const m = miniLive();
+  if (!m) return `<section class="server" aria-label="${MINI.name}"><div class="head"><div><div class="name">${MINI.name}<small>${MINI.label}</small></div><div class="facts"><span>no report yet</span></div></div></div></section>`;
+  return serverSection({ ...m, name: MINI.name, os: MINI.label, log: m.log || { present: true } }, 99);
+}
+function renderServers() { const bx = boxesOf(D); $('servers').innerHTML = (bx.length ? bx.map(serverSection).join('') : serverSection(null, 0)) + miniSection(); }
 
 function slotBar(slots, count) {
   const held = new Map((slots && slots.held || []).map(h => [h.slot, h]));
   const names = Array.from({ length: count }, (_, i) => `build-${i}`);
   return `<div class="slots">${names.map(nm => `<i class="${held.has(nm) ? 'held' : ''}" title="${esc(nm)}${held.has(nm) ? ': ' + esc(held.get(nm).label) : ': free'}"></i>`).join('')}</div>`;
 }
+const MAC_COPY = 'nothing builds here except the one DMG; the mini carries macOS binaries from tonight';
 function renderCrew() {
   const mac = D.mac, pcs = (D.pcs && D.pcs.machines) || [];
   const cards = [];
   for (const bx of boxesOf(D)) {
-    if (bx && bx.cores) cards.push(`<div class="w"><div class="top"><div><div class="card">${esc(bx.name)}</div><div class="meta">Hetzner, ${bx.cores} threads, ${esc(fmtBytes((bx.mem && bx.mem.total_kb || 0) * 1024))}, RAID 1 NVMe</div></div>${pill(bx.running && bx.running.length ? 'building' : 'idle', bx.running && bx.running.length ? 'running' : '')}</div><div class="doing">${bx.running && bx.running.length ? bx.running.map(r => esc(`${r.worktree || '?'}: ${kindLabel(r.kind)}`)).join('<br>') : 'Slot free. The next build-remote.sh or cross-remote.sh routed here takes it.'}</div>${slotBar(bx.slots, bx.slots ? bx.slots.count : 1)}<div class="foot"><span>${bx.recent ? bx.recent.length : 0} builds logged</span><span>${esc(ago(bx.collected_at))}</span></div></div>`);
+    const st = boxState(bx);
+    if (st.kind === 'down') { cards.push(`<div class="w"><div class="top"><div><div class="card">${esc(bx.name)}</div><div class="meta">build server</div></div>${pill('down', 'error')}</div><div class="doing">${esc(st.note)}</div></div>`); continue; }
+    if (st.kind === 'provisioning' && !st.live) { cards.push(`<div class="w"><div class="top"><div><div class="card">${esc(bx && bx.name || 'build server')}</div><div class="meta">build server</div></div>${pill('provisioning', 'queued')}</div><div class="doing">${esc(st.note)}</div></div>`); continue; }
+    if (bx && bx.cores) cards.push(`<div class="w"><div class="top"><div><div class="card">${esc(bx.name)}</div><div class="meta">Hetzner, ${bx.cores} threads, ${esc(fmtBytes((bx.mem && bx.mem.total_kb || 0) * 1024))}, RAID 1 NVMe</div></div>${pill(bx.running && bx.running.length ? 'building' : 'idle', bx.running && bx.running.length ? 'running' : '')}</div><div class="doing">${bx.running && bx.running.length ? bx.running.map(r => esc(`${r.worktree || '?'}: ${kindLabel(r.kind)}`)).join('<br>') : (st.kind === 'provisioning' ? esc(st.note) : 'Slot free. The next build-remote.sh or cross-remote.sh routed here takes it.')}</div>${slotBar(bx.slots, bx.slots ? bx.slots.count : 1)}<div class="foot"><span>${bx.recent ? bx.recent.length : 0} builds logged</span><span>${esc(ago(bx.collected_at))}</span></div></div>`);
     else cards.push(`<div class="w"><div class="top"><div><div class="card">${esc(bx && bx.name || 'build server')}</div><div class="meta">build server</div></div>${pill('unreachable', 'error')}</div><div class="doing">${esc(bx && bx.source && bx.source.error || 'no facts from this box')}</div></div>`);
   }
   if (mac) {
     const held = mac.slots.held || [], runs = held.filter(h => /^run-/.test(h.slot)), builds = held.filter(h => /^build-/.test(h.slot)), meas = held.filter(h => h.slot === 'measure');
-    const doing = held.length ? held.map(h => `${esc(h.slot)}: ${esc((h.worktree ? h.worktree + ' ' : '') + (h.command || h.label || ''))}`.slice(0, 140)).join('<br>') : 'Nothing under with-lock.sh. macOS binaries and the DMG build here; everything else goes to the box or the PCs.';
-    cards.push(`<div class="w"><div class="top"><div><div class="card">${esc(mac.name)}</div><div class="meta">this MacBook: the one DMG only, nothing else builds here (the rule since 7 October 2026); ${mac.build_slots} build slot${mac.build_slots === 1 ? '' : 's'}, 3 run slots</div></div>${pill(meas.length ? 'measuring' : builds.length ? 'building' : runs.length ? 'running' : 'idle', held.length ? 'running' : '')}</div><div class="doing">${doing}</div><div class="slots">${['build-0', 'build-1', 'build-2', 'run-0', 'run-1', 'run-2', 'measure'].map(nm => { const h = held.find(x => x.slot === nm); return `<i class="${h ? (nm === 'measure' ? 'measure' : nm.startsWith('run') ? 'run' : 'held') : ''}" title="${esc(nm)}${h ? ': ' + esc(h.label) : ': free'}"></i>`; }).join('')}</div><div class="foot"><span>${mac.queue.length ? mac.queue.length + ' waiting for a slot' : 'nobody waiting'}</span><span>${esc(ago(mac.collected_at))}</span></div></div>`);
-  } else cards.push(`<div class="w"><div class="top"><div><div class="card">MacBook-Pro</div><div class="meta">this Mac</div></div>${pill('no push', 'error')}</div><div class="doing">${esc(D.sources && D.sources.mac && D.sources.mac.error || 'the Mac pusher has not written yet (launchd com.igneum.workers-push, every 60 s)')}</div></div>`);
+    const doing = held.length ? held.map(h => `${esc(h.slot)}: ${esc((h.worktree ? h.worktree + ' ' : '') + (h.command || h.label || ''))}`.slice(0, 140)).join('<br>') : MAC_COPY;
+    cards.push(`<div class="w"><div class="top"><div><div class="card">${esc(mac.name)}</div><div class="meta">this MacBook, ${mac.build_slots} build slot${mac.build_slots === 1 ? '' : 's'}, 3 run slots</div></div>${pill(meas.length ? 'measuring' : builds.length ? 'building' : runs.length ? 'running' : 'idle', held.length ? 'running' : '')}</div><div class="doing">${doing}</div><div class="slots">${['build-0', 'build-1', 'build-2', 'run-0', 'run-1', 'run-2', 'measure'].map(nm => { const h = held.find(x => x.slot === nm); return `<i class="${h ? (nm === 'measure' ? 'measure' : nm.startsWith('run') ? 'run' : 'held') : ''}" title="${esc(nm)}${h ? ': ' + esc(h.label) : ': free'}"></i>`; }).join('')}</div><div class="foot"><span>${mac.queue.length ? mac.queue.length + ' waiting for a slot' : 'nobody waiting'}</span><span>${esc(ago(mac.collected_at))}</span></div></div>`);
+  } else cards.push(`<div class="w"><div class="top"><div><div class="card">MacBook-Pro</div><div class="meta">this MacBook</div></div>${pill('no push', 'error')}</div><div class="doing">${MAC_COPY}</div></div>`);
+  { const m = miniLive(); const held = m && m.slots && m.slots.held || [];
+    cards.push(`<div class="w"><div class="top"><div><div class="card">${MINI.name}</div><div class="meta">${MINI.label}</div></div>${pill(!m ? 'no report' : held.length ? 'building' : 'idle', !m ? 'queued' : held.length ? 'running' : '')}</div><div class="doing">${!m ? 'no report yet' : held.length ? held.map(h => esc(`${h.slot}: ${h.worktree || h.label || ''}`)).join('<br>') : 'macOS binaries build here from tonight; slot free.'}</div>${m && m.slots ? slotBar(m.slots, m.slots.count || 1) : ''}<div class="foot"><span>${m ? `${(m.recent || []).length} builds logged` : 'its collector pushes to build-1'}</span><span>${m ? esc(ago(m.collected_at)) : ''}</span></div></div>`); }
   for (const pc of pcs) {
     const r = pc.running;
     cards.push(`<div class="w"><div class="top"><div><div class="card">${esc(pc.name)}</div><div class="meta">${esc(pc.machine || pc.id)} · ${esc(pc.role)}</div></div>${pill(r ? 'running' : pc.queue.length ? 'queued' : 'idle', r ? 'running' : pc.queue.length ? 'queued' : '')}</div><div class="doing">${r ? `${esc(r.kind)} ${esc(r.job)}${r.title ? '<br>' + esc(r.title) : ''}${r.stage ? `<br><span class="pill">stage ${esc(r.stage)}</span>` : ''}` : pc.queue.length ? `Next: ${esc(pc.queue[0].kind)} ${esc(pc.queue[0].job)}${pc.queue[0].title ? ', ' + esc(pc.queue[0].title) : ''}` : esc(pc.note || 'idle on jobs; the relay polls every 10 min')}</div><div class="foot"><span>${pc.recent.length} reports kept</span><span>${pc.last_report_at ? 'last report ' + esc(ago(pc.last_report_at)) : 'no report in 7 days'}</span></div></div>`);
@@ -363,7 +398,7 @@ function renderAnalytics() {
 function renderSources() {
   const s = D.sources || {};
   const one = (name, v, what) => `<span>${esc(name)} <b class="${v && v.ok ? '' : v && v.at ? 'warn' : 'no'}">${v && v.ok ? 'live' : v && v.at ? 'stale' : 'missing'}</b>${v && v.at ? ' ' + esc(ago(v.at)) : ''}${v && v.error ? ': ' + esc(v.error) : ''}${!v || v.ok ? '' : ' · ' + esc(what)}</span>`;
-  $('sources').innerHTML = [...boxesOf(D).map(b => one(b.name || 'box', b.source || s.box, 'collect.mjs on the box, systemd timer every 30 s')), one('mac', s.mac, 'push.mjs on the Mac, launchd every 60 s'), one('pcs', s.pcs, 'relay intake read by push.mjs'), `<span>${esc(D._feed || '')}: fetched ${esc(ago(D._fetched))}, written ${t(D.generated_at)} by ${esc(D.generated_by || '?')}</span>`, ...boxesOf(D).filter(b => b.log).map(b => `<span>${esc(b.name)} log ${b.log.present ? `${b.log.total} lines${b.log.bad_lines ? `, ${b.log.bad_lines} unreadable` : ''}` : 'not written yet'}</span>`)].join('');
+  $('sources').innerHTML = [...boxesOf(D).map(b => one(b.name || 'box', b.source || s.box, 'collect.mjs on the box, systemd timer every 30 s')), one('mac', s.mac, 'push.mjs on the Mac, launchd every 60 s'), one('mini', D.mini && D.mini.source, 'its collector on the mini, pushed to build-1'), one('pcs', s.pcs, 'relay intake read by push.mjs'), `<span>${esc(D._feed || '')}: fetched ${esc(ago(D._fetched))}, written ${t(D.generated_at)} by ${esc(D.generated_by || '?')}</span>`, ...boxesOf(D).filter(b => b.log).map(b => `<span>${esc(b.name)} log ${b.log.present ? `${b.log.total} lines${b.log.bad_lines ? `, ${b.log.bad_lines} unreadable` : ''}` : 'not written yet'}</span>`)].join('');
 }
 
 function apply(d) {
@@ -375,25 +410,14 @@ function apply(d) {
   const el = $('servers'); if (el && !el.innerHTML) el.innerHTML = '';
   renderServers(); renderCrew(); renderNow(); renderQueue(); renderBackground(); renderDone(); renderHeadline(); renderAnalytics(); renderSources();
 }
-let skipLive = 0, feed = '';
+let feed = '';
 async function fetchJson(url, ms) { const r = await fetch(`${url}?t=${Date.now()}`, { cache: 'no-store', signal: AbortSignal.timeout(ms) }); if (!r.ok) throw new Error(`http ${r.status}`); return r.json(); }
 async function load() {
   let edge = null, d = null;
   try { const file = demo ? 'workers.demo.json' : 'workers.json'; edge = await fetchJson(`${base}/${file}`, 8000); }
-  catch (e) { if (!D && (demo || skipLive > 0)) { $('live').className = 'live down'; $('stamp').textContent = `workers.json not reachable (${e && e.message || e})`; } }
+  catch (e) { if (!D) { $('live').className = 'live down'; $('stamp').textContent = `workers.json not reachable (${e && e.message || e})`; } }
   if (demo) { d = edge; feed = 'demo document'; }
-  else if (skipLive <= 0) {
-    // the boxes the edge copy knows (or build-1 alone before the first push), each from its own Caddy feed, 4 s each, in parallel
-    const names = edge ? boxesOf(edge).map(b => b.name).filter(Boolean) : ['igneum-build-1'];
-    const results = await Promise.all(names.map(n => FEEDS[n] ? fetchJson(FEEDS[n], 4000).then(j => ({ n, j })).catch(() => ({ n, j: null })) : Promise.resolve({ n, j: null })));
-    const liveOnes = results.filter(r => r.j);
-    if (liveOnes.length) {
-      const first = liveOnes[0].j;
-      const boxes = results.map(r => r.j ? { ...r.j.box, headline: r.j.headline, source: { ok: true, at: r.j.generated_at } } : (edge && boxesOf(edge).find(b => b.name === r.n)) || { name: r.n, source: { ok: false, error: 'no live feed and no edge copy for this box' } });
-      d = { ...first, boxes, mac: first.mac || (edge && edge.mac), pcs: first.pcs || (edge && edge.pcs), baselines: first.baselines || (edge && edge.baselines), sources: { ...(first.sources || {}), box: boxes[0].source } };
-      feed = liveOnes.length === results.length ? `live from ${liveOnes.length === 1 ? 'the box' : liveOnes.length + ' boxes'}` : `live from ${liveOnes.map(r => r.n).join(', ')}, edge copy for the rest`;
-    } else skipLive = 4;   // nothing answered: use the edge copy for the next minute before trying again
-  } else skipLive--;
+  else { d = edge; feed = edge ? 'the merged copy from build-1' : feed; }
   if (!d) { d = edge; feed = 'edge copy, up to 5 min behind the box'; }
   if (!d) { if (!D) { $('now').innerHTML = $('queue').innerHTML = `<div class="empty">No workers.json next to this page yet and no box answers. The Mac pusher writes the copy every 60 s and the fleet deploy carries it within 5 min.</div>`; } return; }
   d._feed = feed; apply(d);