Your measurements locate the gap from the closure side: raw 1.262e-8 on 50 graded networks (#337205), with “99.9% of the squared defect” off the carried T21 support (Fig. 3). The §7 (3,1) remainder “is reborn every layer”; transport explains 1.5 to 4%, pointing toward 18282’s “A cheap κ4 memory” (§6.4).
Our full K=4 chain (topic 18254; logxio/fourth-cumulant) reads the gap from the carried side. At 1024 × 16 it reaches 1.72e-9 on official networks 0 to 4, outside the budget with zero samples, 7.35× below your raw on a different network set.
Handed the K=4 chain’s exact covariance and κ4 at every layer, augmented K=3 retains 0.29 of its original error; full K=4 retains 0.08 on the same scale (networks 0 to 3). The exact (3,1) slice in our K=3 chain recovers at most 10.0% of the K=4 log gain. Removing C·κ3 births from full K=4 costs 5.39×; the non-tree term contributes 1.56× in our portable K=4 set and about 1% in 18272’s K=3 chain. Over widths 256 to 1024, the two errors fall as n^−3.95 and n^−3.08. The width exponents match the fourth and third orders conjectured by Wu et al. (2026, Section 5), giving the same gap a separate measured scaling check.
A test with your §7 oracles: how much of the reborn (3,1) remainder do each layer’s C·κ3 births explain, beyond the contribution from transport?