EXP-003VALIDATED
Advantage Decomposition / Transport

Semantic transport across R52–R56

Only the demanded semantic interface needs to be transported between checkpoints to reproduce the exact progressive decision.

Claim statusNO MINING ADVANTAGE CLAIM

Diagnostic work, exact algebra and local capabilities are not treated as end-to-end mining advantage.

Date2026-08-14
HardwareClassical deterministic verifier
Run scopeSix registered variants
ReproducibilityEvery transported decision was audited against the full progressive oracle.
01 / Question & hypothesis

What was tested?

Only the demanded semantic interface needs to be transported between checkpoints to reproduce the exact progressive decision.

02 / Scientific basis

Why the test is meaningful

A progressive target evaluator does not necessarily need the full 256-bit internal state at each checkpoint; it needs the semantic variables that determine the registered decision. Transport is valid only if the reduced interface is a sufficient statistic for that decision under the frozen context.

Iᵣ = projection of state Sᵣ onto demanded semantic bitsIᵣ₊₁ = Fᵣ(Iᵣ, contextᵣ)exact transport ⇔ D(I₅₆)=D(full SHA suffix) for every registered record
Semantic transport across R52–R56Visual reading of the published metrics and gates for EXP-003; it summarizes the registered result, not a mining advantage.EXP-003 / SEMANTIC TRANSPORT ACROSS R52–R56ROUND SPANR52→R56INTERFACE MISMATCHES0FALSE REJECTS0
FIGURE / RESULT READINGVisual reading of the published metrics and gates for EXP-003; it summarizes the registered result, not a mining advantage.
03 / Method

How it was tested

Extract required state bits at each checkpoint, transport them across R52→R56 and compare transported interfaces and target decisions with the full evaluator.

04 / Observed result

What happened

Round spanR52→R56
Interface mismatches0
False rejects0

Transported-interface, target-bit and progressive-decision mismatches were all zero.

05 / Validation

Exactness and statistical controls

Interface values, requested target bits and final progressive actions were checked separately, preventing a compensating error from passing only at the final decision. The test is deterministic: zero mismatches validates the declared interface on the registered domain, but does not prove that it is globally minimal.

06 / Interpretation

What the result means

Exact semantic transport is possible for the registered interface. Whether it lowers end-to-end implementation cost remains open.

Limitations

  • Sufficiency is scoped to the registered decision and context.
  • Transport cost and interface-storage cost remain part of end-to-end work.
  • Exactness does not establish a smaller circuit than conventional SHA-256.
07 / Reproduction

Evidence trail

Every transported decision was audited against the full progressive oracle.

Canonical variants

SUBENGINE-V3ASUBENGINE-V3BSUBENGINE-V3CSUBENGINE-V3DSUBENGINE-V3ESUBENGINE-V3F

Source: internally audited canonical reports. Local filesystem structure, private headers and operational identifiers are excluded from publication.