Freeze
Release identity
No formal run or public pass before approval.
8 cases: 0 passed under the standard, 0 running with team evidence, 8 not run, 0 deferred
- GOV8 casesNOT RUN
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.
Basis IGNEUM_2.0_Plan.pdf, 37 pages, 8 October 2026. The standard runs to 73 pages. Registry dated 8 October 2026.
Test and Acceptance Standard 1.0: APPROVED AS PROPOSED by the founder, 8 October 2026; P13 (maintenance continuity) DEFERRED; 190 cases: 7 passed under the standard, 0 running with team evidence, 7 failed, 176 not run, 0 deferred
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.
Release identity
No formal run or public pass before approval.
8 cases: 0 passed under the standard, 0 running with team evidence, 8 not run, 0 deferred
D1
No validated hardware claim without reproduction.
16 cases: 0 passed under the standard, 0 running with team evidence, 16 not run, 0 deferred
D2
No improvement claim from a negative hypothesis.
32 cases: 0 passed under the standard, 0 running with team evidence, 2 failed, 30 not run, 0 deferred
D3
No broad resistance claim from one weak design.
16 cases: 0 passed under the standard, 0 running with team evidence, 16 not run, 0 deferred
D4
No durability claim based on assumed chip expiry.
24 cases: 0 passed under the standard, 0 running with team evidence, 1 failed, 23 not run, 0 deferred
D5
No no-rescue claim from a founder-supported demo.
56 cases: 5 passed under the standard, 0 running with team evidence, 51 not run, 0 deferred
Execution control
No mainnet-ready claim with missing enforcement or safety.
64 cases: 6 passed under the standard, 0 running with team evidence, 5 failed, 53 not run, 0 deferred
Execution control
Devnet activity is insufficient.
24 cases: 0 passed under the standard, 0 running with team evidence, 24 not run, 0 deferred
Execution control
Supports a scoped contention assessment, not a guaranteed rank.
190 cases: 7 passed under the standard, 0 running with team evidence, 7 failed, 176 not run, 0 deferred
Prevent a favourable result from being attached to the wrong code, assumptions or public claim.
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 the case requires
Signed F0; source-to-test map; claim inventory; unresolved-field register.
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 the case requires
Approved profile register; timestamped holdout commitments; change log.
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 the case requires
Build logs; dependency lockfiles; binary comparison; operator attestations.
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 the case requires
Artifact manifest; hashes; reproduction script; exclusion ledger; negative-run archive.
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 the case requires
Mutation catalogue; blinded run results; baseline controls; oracle review.
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 the case requires
Scope manifest; activation scan; product-copy comparison; exclusions register.
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 the case requires
Signed scoped reports; conflict declarations; finding/retest ledger.
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 the case requires
Dependency impact report; regenerated status page; rejected claim examples.
Close the pending measurements and evaluate the actual configuration, including costs hidden by kernel-only results.
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 the case requires
Cohort manifest; compatibility matrix; raw results by SKU and role.
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 the case requires
Raw power/time series; paired analysis; tuning settings; claim-by-SKU table.
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 the case requires
Compiler reports; allocation traces; paired energy/rate data; coexistence runs.
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 the case requires
Clock ladder; safe bounds; thermal/error logs; reboot and rollback record.
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 the case requires
Memory budget per SKU; OOM traces; support horizon; concurrency cost table.
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 the case requires
Per-submission ledger; network trace; rejection reasons; accepted-work comparison.
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 the case requires
Seven-day time series; crash reports; settings-restoration checks; drift analysis.
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 the case requires
Three signed reproduction packs; reconciliation report; final baseline table.
Find semantic disagreements and structural shortcuts before treating a harder-looking program as a stronger defence.
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 the case requires
Reference implementation review; seeds/vectors; backend matrix; mismatch archive.
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 the case requires
Generator/fuzzer logs; reduced counterexamples; disassembly comparison; index tests.
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 the case requires
Liveness traces; alternative implementations; Pareto table; reviewer analysis.
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 the case requires
Matched workloads; GPU runs; redesigned core estimates; held-out results.
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 the case requires
Attack implementations; valid/invalid controls; work-cost analysis; binding review.
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 the case requires
CPU profiles; adversarial corpus; allocation traces; valid-traffic latency.
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 the case requires
Scope decision; semantic specification; vectors; simplified datapath model.
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 the case requires
Decision register; binary/config scan; negative-control results.
Give the opponent permission to adapt, share resources and remain operational; test cost rather than imagined chip death.
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 the case requires
Architecture reports; functional simulations; adaptation matrix; reviewer signature.
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 the case requires
Sweep definitions; energy/bandwidth data; best-feasible envelope; excluded-design reasons.
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 the case requires
Hybrid architecture diagrams; traffic traces; system cost and energy ledger.
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 the case requires
Per-program advantage distribution; policy simulator; full-period returns.
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 the case requires
Netlist/physical reports; macro assumptions; bill of materials; model calibration.
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 the case requires
Node-specific reports; factor provenance; uncertainty and sensitivity tables.
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 the case requires
Lifetime/adaptation ledger; revision costs; feasible-alternative analysis.
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 the case requires
Two review reports; challenge log; final envelope; unresolved-limit statement.
Transitions must agree across nodes and remain usable during failures; crossing a boundary is not a chip-retirement test.
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 the case requires
Boundary vectors; node/miner traces; acceptance and reward matrix.
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 the case requires
Transition matrix; code-path evidence; compile timing; old-client logs.
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 the case requires
Executable governance model; signed-vote corpus; coalition/partition results.
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 the case requires
Seed/grinding simulations; speed sensitivity; proof vectors; threat-model signoff.
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 the case requires
Fault timeline; seed/certificate history; node-state comparison; recovery log.
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 the case requires
Dataset hashes; memory/update traces; stale-work tests; exclusion decision.
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 the case requires
Ablation report; decision log; complexity/cost comparison.
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 the case requires
Frozen-rule model; scenario results; excluded-rescue audit; G5 evidence.
Test the world after specialised hardware exists, including new entrants and an already-funded competitor.
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 the case requires
Versioned model; unit fixtures; independent reconciliation; input sources.
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 the case requires
Owner/entrant curves; price-date records; break-even tables; cohort outcomes.
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 the case requires
Business-model variants; sunk-cost case; full cash-flow and adaptation records.
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 the case requires
Agent policies; sensitivity seeds; market-share paths; independent model review.
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 the case requires
Scenario register; full result cube; boundary plots; failed-world explanations.
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 the case requires
Issuance/fee ledger; scenario cash flows; funding-shortfall report.
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 the case requires
Per-step cost/retention table; alternative schedules; approval record.
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 the case requires
Independent report; rerun outputs; model limitations; approved claim envelope.
Keep familiar applications while making every difference and metering rule explicit and reproducible.
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 the case requires
Fixture/version inventory; root/receipt diffs; deviation matrix.
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 the case requires
Signed corpus; admission/execution outcomes; account-state reconciliation.
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 the case requires
Metering traces; fee fixtures; estimator errors; invalid-block rejection.
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 the case requires
Context-contract results; threat notes; compatibility exclusions.
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 the case requires
Contract fixture hashes; transaction journeys; invariant and state comparisons.
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 the case requires
RPC conformance report; reindex comparison; reconnect/edge-case logs.
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 the case requires
Resource profiles; adversarial corpus; state recovery comparisons.
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 the case requires
Upgrade vectors; mixed-version traces; manifest/version bindings.
The validator, not merely the official producer, must reject unauthorised or invalid proof records and rewards.
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 the case requires
Hostile record corpus; validator decisions; before/after balances; positive controls.
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 the case requires
Identity/parameter matrix; rejection traces; cryptographic review.
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 the case requires
Binding matrix; public-input hashes; replay traces; reward reconciliation.
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 the case requires
Mutation cases; reward derivation trace; signature/proof binding review.
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 the case requires
Concurrency schedule; canonical payment ledger; crash/recovery evidence.
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 the case requires
Coverage corpus; aggregate/public-input verification; rejection ledger.
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 the case requires
Scoped soundness review; parameter sheet; fuzzer corpus; verifier profiles.
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 the case requires
Path coverage report; bypass corpus; replacement run; authority checks.
A correct fast shard is only one stage; capacity, latency, payment and retries must work together.
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 the case requires
Historical/current manifests; proof verification; timing and memory records.
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 the case requires
Four-mode results; OOM/failure logs; memory and opportunity-cost ledger.
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 the case requires
Stage event ledger; clock calibration; end-to-end latency/cost report.
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 the case requires
Request/completion reconciliation; backlog series; held-out results; observer report.
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 the case requires
Overload timeline; admission/refund logs; backlog-drain proof.
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 the case requires
Window sweep; paid-completion distribution; wasted-work and margin report.
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 the case requires
Failure schedule; input hashes; reassignment and payout ledger; recovery trace.
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 the case requires
Customer verification log; proof-format contract; settlement reconciliation.
Assume operators optimise their own returns. Do not depend on the official client choosing a less profitable task.
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 the case requires
Independent accounting ledger; balance/supply diffs; boundary vectors.
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 the case requires
Money-flow register; UI reconciliation; rejected classifications.
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 the case requires
Scheduler source/policies; switching traces; capacity and margin series.
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 the case requires
Shock timeline; fee/hash/capacity paths; failure-region report.
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 the case requires
Attack clients; assignment trace; cost-to-disrupt analysis; honest-user outcomes.
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 the case requires
Difficulty trace; timestamp corpus; revenue analysis; independent rule review.
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 the case requires
Circular-flow tests; ownership/conflict review; net-cash reconciliation.
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 the case requires
Role/ownership map; dependency removals; recovery and concentration report.
Test safety under the stated fault bounds. Demand liveness only when synchrony and participation assumptions actually hold.
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 the case requires
Block/ordering corpus; root/work diffs; real-node replay logs.
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 the case requires
Signed votes; certificate attempts; voter-table snapshots; safety checker output.
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 the case requires
Expiry timeline; table/certificate history; historical regression tests.
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 the case requires
Signing/mining trace; UI/RPC states; recovery roots and timing.
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 the case requires
Authority-chain fixtures; substitution attacks; new-node verification log.
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 the case requires
Long-range corpus; trust-anchor policy; key-compromise review; client results.
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 the case requires
Recovery timelines; roots/certificates; payout rollback; customer-state reconciliation.
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 the case requires
Model/spec artifacts; schedule corpus; replay evidence; independent assessment.
Verify the exact property shown to the user. An inclusion proof, execution proof and finality certificate are not interchangeable.
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 the case requires
Bootstrap corpus; trust-chain trace; fail-closed tests.
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 the case requires
Client verification trace; corrupted inputs; offline/upgrade results.
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 the case requires
Payment fixture corpus; receipt verification; merchant-facing status checks.
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 the case requires
Oracle code/parameters; attack cases; cost report; privilege disclosure.
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 the case requires
Download/reconstruction logs; data hashes; resource costs; dependency inventory.
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 the case requires
Withholding corpus; peer retrieval traces; availability/status checks.
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 the case requires
Security review; canary-secret tests; signing fixtures; restore journey.
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 the case requires
Cross-surface screenshots/logs; state mapping; claim review.
A permissionless specification must remain operational without privileged infrastructure or unsafe automatic updates.
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 the case requires
Operator roster/conflict checks; dependency removals; full activity/intervention log.
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 the case requires
Peer/discovery traces; eclipse scenarios; startup and recovery evidence.
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 the case requires
Package corpus; approval/activation traces; compromised-key rehearsal.
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 the case requires
Crash schedule; snapshot hashes; root/balance diffs; recovery timing.
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 the case requires
Sandbox penetration report; canary logs; resource limits; host-integrity checks.
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 the case requires
Load/corpus manifests; resource series; valid-traffic metrics; incident traces.
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 the case requires
Alert matrix; detection timelines; independent runbook exercise.
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 the case requires
Upgrade/replay logs; invalidation map; repeated gate signatures.
Successful participation must be practical for ordinary owners without hidden custody or loss of consensus authority.
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 the case requires
Consent-based study records; task timings; failure reasons; compatibility outcomes.
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 the case requires
Control timings; process/settings audit; restart and safety traces.
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 the case requires
UI/ledger comparisons; tariff fixtures; stale/negative examples.
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 the case requires
Single-card payout ledger; pool failure record; custody/authorisation review.
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 the case requires
Work/key binding vectors; malicious-pool attempts; leave-pool authority check.
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 the case requires
Template commitments; accepted-block evidence; malicious-pool/fallback report.
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 the case requires
Observed tasks; update traces; sanitised export tests.
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 the case requires
Matched software comparison; code/config review; fee/privilege inventory.
Devnet payouts and subsidised pilots demonstrate mechanics, not independent willingness to pay.
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 the case requires
Redacted contract; verified jobs; settlement proof; consented customer confirmation.
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 the case requires
Anonymised buyer ledger; repeat-order dates; conflict review; net receipts.
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 the case requires
Unit-economics ledger; metered operator sample; allocation rules; sensitivity report.
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 the case requires
Customer-verifier records; SLO report; refunds; promised-versus-delivered comparison.
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 the case requires
Dated comparison; workload/security match; customer decision record.
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 the case requires
Cohort/renewal ledger; churn notes; concentration and incentive report.
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 the case requires
Budget and commitment evidence; downside plan; owner/continuity roster.
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 the case requires
Consented developer logs; public examples; issue closure; verified end-to-end journeys.
A serious contention claim requires comparative outcomes and real adoption evidence, not just an internally green test dashboard.
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 the case requires
Timestamped peer protocol; source/version records; comparison/exclusion rationale.
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 the case requires
Matched task data; uncertainty/effect sizes; independent comparison report.
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 the case requires
Claim-to-evidence map; signed envelope review; limitations statement.
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 the case requires
Pseudonymous cohort ledger; margin/retention calculations; departure reasons.
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 the case requires
Control/failure-domain map; uncertainty notes; concentration/removal results.
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 the case requires
90-day SLO ledger; independent probes; incident reports; change/retest history.
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 the case requires
Signed assessment; full status index; dissent/limitations; approved claim wording.
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 the case requires
Review calendar; invalidation drills; versioned public claim register.
44 regressions from 14 findings; each reads NOT RUN until its owner lane records a run
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 case requires
The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.
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 case requires
The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.
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 case requires
The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.
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 case requires
The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.
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 case requires
The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.
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 case requires
The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.
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 case requires
The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.
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 case requires
The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.
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 case requires
The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.
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 case requires
The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.
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 case requires
The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.
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 case requires
The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.
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 case requires
The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.
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 case requires
The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.
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 case requires
The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.
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 case requires
The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.
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 case requires
The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.
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 case requires
The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.
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 case requires
The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.
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 case requires
The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.
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 case requires
The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.
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 case requires
The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.
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 case requires
The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.
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 case requires
The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.
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 case requires
The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.
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 case requires
The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.
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 case requires
The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.
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 case requires
The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.
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 case requires
The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.
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 case requires
The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.
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 case requires
The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.
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 case requires
The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.
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 case requires
The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.
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 case requires
The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.
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 case requires
The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.
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 case requires
The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.
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 case requires
The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.
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 case requires
The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.
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 case requires
The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.
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 case requires
The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.
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 case requires
The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.
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 case requires
The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.
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 case requires
The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.
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 case requires
The run record of the regression as its owner lane records it through tools/ci/test-record.mjs.
18 integration gates; each reads NOT RUN until its owner lane records a run
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 case requires
The run record of the gate as its owner lane records it through tools/ci/test-record.mjs.
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 case requires
The run record of the gate as its owner lane records it through tools/ci/test-record.mjs.
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 case requires
The run record of the gate as its owner lane records it through tools/ci/test-record.mjs.
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 case requires
The run record of the gate as its owner lane records it through tools/ci/test-record.mjs.
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 case requires
The run record of the gate as its owner lane records it through tools/ci/test-record.mjs.
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 case requires
The run record of the gate as its owner lane records it through tools/ci/test-record.mjs.
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 case requires
The run record of the gate as its owner lane records it through tools/ci/test-record.mjs.
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 case requires
The run record of the gate as its owner lane records it through tools/ci/test-record.mjs.
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 case requires
The run record of the gate as its owner lane records it through tools/ci/test-record.mjs.
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 case requires
The run record of the gate as its owner lane records it through tools/ci/test-record.mjs.
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 case requires
The run record of the gate as its owner lane records it through tools/ci/test-record.mjs.
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 case requires
The run record of the gate as its owner lane records it through tools/ci/test-record.mjs.
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 case requires
The run record of the gate as its owner lane records it through tools/ci/test-record.mjs.
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 case requires
The run record of the gate as its owner lane records it through tools/ci/test-record.mjs.
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 case requires
The run record of the gate as its owner lane records it through tools/ci/test-record.mjs.
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 case requires
The run record of the gate as its owner lane records it through tools/ci/test-record.mjs.
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 case requires
The run record of the gate as its owner lane records it through tools/ci/test-record.mjs.
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 case requires
The run record of the gate as its owner lane records it through tools/ci/test-record.mjs.
17 profiles, P00 to P16. A profile is frozen before the confirmatory run; weakening a target after a failure creates a different claim.
Cited by 76 cases. The profile’s own line in the registry: PROPOSED, REQUIRES APPROVAL.
Cited by 69 cases. The profile’s own line in the registry: PROPOSED, REQUIRES APPROVAL.
Cited by 12 cases. The profile’s own line in the registry: PROPOSED, REQUIRES APPROVAL.
Cited by 8 cases. The profile’s own line in the registry: PROPOSED, REQUIRES APPROVAL.
FAIL 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
Cited by 14 cases. The profile’s own line in the registry: PROPOSED, REQUIRES APPROVAL.
Cited by 0 cases. The profile’s own line in the registry: PROPOSED, REQUIRES APPROVAL.
Cited by 4 cases. The profile’s own line in the registry: PROPOSED, REQUIRES APPROVAL.
Cited by 15 cases. The profile’s own line in the registry: PROPOSED, REQUIRES APPROVAL.
Cited by 25 cases. The profile’s own line in the registry: PROPOSED, REQUIRES APPROVAL.
Cited by 30 cases. The profile’s own line in the registry: PROPOSED, REQUIRES APPROVAL.
Cited by 11 cases. The profile’s own line in the registry: PROPOSED, REQUIRES APPROVAL.
Cited by 4 cases. The profile’s own line in the registry: PROPOSED, REQUIRES APPROVAL.
Cited by 24 cases. The profile’s own line in the registry: PROPOSED, REQUIRES APPROVAL.
Cited by 1 case. The profile’s own line in the registry: PROPOSED, REQUIRES APPROVAL.
Cited by 10 cases. The profile’s own line in the registry: PROPOSED, REQUIRES APPROVAL.
Cited by 5 cases. The profile’s own line in the registry: PROPOSED, REQUIRES APPROVAL.
Cited by 5 cases. The profile’s own line in the registry: PROPOSED, REQUIRES APPROVAL.
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.
Pinned toolchains, dependency locks, clean OS images and documented signing/notarisation boundaries. No production secrets or private founder files.
Approved physical GPU cohort, calibrated wall meters, stable thermal conditions, driver/OS images and realistic home/datacentre link conditions.
Fixed full-hash and EVM/proving jobs, independent reference implementations, real customer-sized payloads, held-out seeds and complete expected results.
Independent nodes/operators; controllable latency, loss, clocks, partitions, storage faults and role withdrawals. Actual consensus paths plus separately labelled simulators.
Malformed transactions/proofs, wrong roots/IDs, duplicate payments, bad authority tables, historical failures and deliberately faulty code mutants.
Functionally checked architectures, RTL/physical estimates where feasible, memory and board assumptions, cost inputs, adaptation paths and uncertainty ranges.
Independently reproducible costs, entry/exit/difficulty policies, scenario grid, operator opportunity costs and money-flow conservation fixtures.
Consenting unaffiliated users, contracted meaningful workloads, private ownership checks, dated competitor methods and independent analysis.
Immutable run IDs, raw logs, hashes, analysis code, exclusions, defects, reviewers, signatures, privacy controls and public redacted summaries.
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.
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.
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.
Source: docs/plans/igneum-2.0-test-registry.json, version 1.0, dated 8 October 2026, plan sha256 418b3b9f68f96a41. This copy was written when the page was built; the page checks the registry on the public git host every 60 seconds.