Checks paper #165's kill condition K3 (debt D-161-201-12) -- a demonstration that information causality follows from no-signaling plus a weaker, independently motivated premise -- premise by premise and at conjunction level against the literature the census spent, and finds no discharge in the checked record. Witnesses: the Popescu-Rohrlich box is no-signaling (verified in the notebook) while violating information causality without bound in the random-access game, and no-signaling plus bipartite local orthogonality is no-signaling alone by theorem, so that conjunction cannot imply it; isotropic boxes with CHSH strength in (2.828, 3.266] obey no-signaling and nontrivial communication complexity while violating information causality, so that conjunction cannot imply it either. Macroscopic locality fences the CHSH face at exactly 2 sqrt(2) -- the conclusion's face size restated as a premise -- and information causality's status on its full set Q1 is not a theorem (established numerically only for the almost-quantum subset), so the conjunction route has a named open gap with its price stated. The entropy-calculus route relocates the circularity: the full mutual-information calculus for arbitrary no-signaling boxes is information causality's own machinery, assumed. K3 stands unmet; paper #165's verdict (surrounded, not derived) is sharpened, not moved. Quantum gravity NOT SOLVED; vacuum catastrophe NOT SOLVED.
Checks paper #165's kill condition K3 (debt D-161-201-12) -- a demonstration that information causality follows from no-signaling plus a weaker, independently motivated premise -- premise by premise and at conjunction level against the literature the census spent, and finds no discharge in the checked record. Witnesses: the Popescu-Rohrlich box is no-signaling (verified in the notebook) while violating information causality without bound in the random-access game, and no-signaling plus bipartite local orthogonality is no-signaling alone by theorem, so that conjunction cannot imply it; isotropic boxes with CHSH strength in (2.828, 3.266] obey no-signaling and nontrivial communication complexity while violating information causality, so that conjunction cannot imply it either. Macroscopic locality fences the CHSH face at exactly 2 sqrt(2) -- the conclusion's face size restated as a premise -- and information causality's status on its full set Q1 is not a theorem (established numerically only for the almost-quantum subset), so the conjunction route has a named open gap with its price stated. The entropy-calculus route relocates the circularity: the full mutual-information calculus for arbitrary no-signaling boxes is information causality's own machinery, assumed. K3 stands unmet; paper #165's verdict (surrounded, not derived) is sharpened, not moved. Quantum gravity NOT SOLVED; vacuum catastrophe NOT SOLVED.
Re-runs papers #449 and #479's conjunction checks with their no-web fence lifted for two records the house index itself harvested into L7, both read whole from filed texts: arXiv:1708.08630v4 (Cuffaro) and arXiv:2512.18105v1 (Barandes, Hasan & Kagan). Gated first on both parent notebooks re-run whole, digit-for-digit (PR box S=4; isotropic band (2.828, 3.266]; fences 2 / 2.828427 / 4; gap 0.438). Verdict: the almost-quantum witness SURVIVES contact. Cuffaro motivates information causality (Einstein being-thus generalised to communication) but does not derive it, so #449's K3 stands unmet; his Sec. 4 reports the almost-quantum result as 'numerical evidence' in his own words -- the set is named only in his reference list -- so #479's survivor form (ii) still lacks its theorem. The 2512.18105 claimant enters through form (i), a principle outside #165's census: causal locality proves the CHSH-game bound (score <= 1/sqrt(2), win <= 0.853553, recomputed from its Eq. (8)) for causally local unistochastic processes, but states no exact-Q characterisation in all scenarios and never names the almost-quantum set (zero mentions). EXTENSION at its ceiling. Quantum gravity NOT SOLVED; vacuum catastrophe NOT SOLVED.
Information causality (IC) posits that communicating m classical bits cannot give the receiver access to more than m bits of information about the sender's independent data. Although IC holds in quantum theory and excludes a broad class of supra-quantum correlations, its validity for the almost-quantum set has remained open. This semidefinite relaxation of the quantum set satisfies nontrivial communication complexity, no advantage for non-local computation, macroscopic locality, local orthogonality, and numerical evidence has suggested that it may also satisfy IC. Here we show that almost-quantum correlations violate IC, and do so without bound. Unlike earlier violations of IC, which rely on biased guesses, ours is driven by zero-error certificates: each is rare but never wrong, carries information linear in its probability, and vouches for many of the sender's bits at once. This establishes a sharp dichotomy: either IC is a valid physical principle that excludes these correlations, or any nonsignalling theory realizing them admits no mutual information obeying consistency, data processing and the chain rule. In the latter case, we discuss why the chain rule is the natural property to relinquish, and how this possibility relates to histories-based formulations and to locality defined relative to the state rather than presupposed in a fixed spacetime.
Strengthens paper #165's characterisation of Q (debt D-161-201-11, kill condition K2). Gate reproduces #165's fences 2 / 2sqrt2 = 2.828427 / 4 and the Brassard threshold S = 3.266. New: the explicit conjunction of no-signaling, nontrivial communication complexity, macroscopic locality and local orthogonality at all levels is killed by the census's own row-6 witness -- the almost-quantum set satisfies all four and strictly exceeds Q, so the conjunction admits strictly more than Q and cannot carve out exactly Q in all scenarios. Conjunctions carrying information causality at full strength (row 6 credits it only numerically) or Row 7 are expressly not killed. The characterisation of Q remains open in three named forms. Quantum gravity NOT SOLVED; vacuum catastrophe NOT SOLVED.
Papers #449 and #479 evaluated information causality and its conjunctions against the Tsirelson bound under a fence their own text names; this paper re-runs the conjunction check with the fence lifted for two records the house itself harvested (arXiv:1708.08630, a philosophical examination arguing information causality's motivations are unsatisfactorily vague or intuitive; arXiv:2512.18105, a novel proof of the Tsirelson bound from causal locality for indivisible stochastic processes). Of the four things either record could do to the almost-quantum witness — prove information causality on all of it, refute it on it, characterise the quantum set exactly in all scenarios, or break a conjoined principle on it — neither does any. The witness survives, both verdicts stand at stronger standing, and the causal-locality proof enters the surviving set as a named outside-census candidate owner of the bound: a face proof, not an all-scenarios characterisation. Quantum gravity NOT SOLVED; vacuum catastrophe NOT SOLVED.
Part 6 of this record supersedes Parts 1-5. Earlier parts conjectured that Information Causality (IC) alone enforces the positive-semidefinite (PSD) structure of translation-invariant correlation kernels; the Sole-Origin and Eigenvector versions (Parts 1, 4, 5) claimed constructive proofs. This paper withdraws those proofs and replaces them with what can be proven. Two structure theorems show the withdrawal is structural, not incidental. The Barrier Lemma: any protocol whose measurement settings are independent of the encoded data satisfies S ≤ E(0)²‖u‖₂² ≤ 1, for every Bob strategy and every resource model (verified by exhaustive maximization over all Bob functions at N=4). The Pyramid Factorization Theorem: the Pawłowski concatenation satisfies S_{2ⁿ} = Π levels ≤ (sup S₂)ⁿ, so nesting can never rescue a kernel that a single level cannot detect. Two positive results take their place. A visibility dichotomy: at sub-unit visibility, explicitly non-PSD kernels are quantum-realizable via a Tsirelson factorization with sign-flipped harmonics, so no correlation principle can enforce PSD there; at unit visibility (E(0) = −1), Cauchy-Schwarz rigidity forces single-family Gram structure. The main theorem: Macroscopic Locality implies kernel positivity at unit visibility (via the Q¹ characterization of ML plus the rigidity argument). The axiomatic gap open since Pawłowski et al. (2009) is thereby closed, by Macroscopic Locality. Corollary: every unit-visibility non-PSD kernel lies outside the Almost-Quantum set, confirmed numerically by robust NPA-1+AB semidefinite programming (N = 7 settings, Clarabel, PSD control at 10⁻⁹). Whether the strictly weaker principle IC suffices remains open, and is sharpened by seven benchmark kernels, unit visibility, non-PSD, provably outside Almost Quantum, that resist every IC protocol tested: optimized N=2/3 functionals, general random-access codes up to four bits, the full concatenation pyramid with free angles, linear parity encodings, entropic and mutual-information functionals, and continuous-angle protocols. Either a fundamentally new protocol detects them (IC ⇒ PSD), or one of them satisfies IC (IC strictly weaker than ML here). Both outcomes are discoveries; the benchmark coefficients are given in full and machine-readable. An open verification suite (6 self-contained Python scripts, MIT license, ~90 s runtime) is included and reproduces every numerical claim: kernel validity, the Barrier Lemma (three exact checks), the Pyramid Factorization, the Tsirelson factorization of the dichotomy, the NPA-1+AB distances for all seven benchmarks, and the H² bound. Following the documentation practice of this series, all withdrawn claims and their precise failure modes are recorded, including one hypothesis raised and refuted during review of this work.
KILLS note discharging house paper #161's second kill condition (verification debt D-161-201-01, grade B) by firing it. Page-level collation of von Neumann's 1932 Mathematische Grundlagen der Quantenmechanik (Ch. III p. 131; Ch. IV.1 pp. 158 and 164; derivation pp. 167-168; Ch. IV.2 conclusion p. 171 and caution p. 173; quoted from the 1996 second reprint of the German original as transcribed in Dieks 2018, the Internet Archive scan being access-restricted) shows that additivity of expectation values for non-commuting sums is not a free-standing demand on dispersion-free assignments, as #161 (following Hermann 1935 and Bell 1966) transmitted it. In the 1932 text the sum quantity for non-jointly-measurable quantities is defined implicitly at the level of statistical collectives by Exp(R+S) = Exp(R) + Exp(S) (p. 164: the sum is 'nur auf implizite Weise gekennzeichnet'), and the assumptions are the correspondence premises I (quantities correspond one-to-one to Hermitian operators) and II (the correspondence carries sums of quantities to sums of operators). Subensemble additivity follows only as a corollary under I and II. Evaluated difference: #161's premise-location claim and its 'one assumed step, zero derivations' count die at the size #161 section 8 named in advance; its sections 3-5 arithmetic (0 of 4 assignments; measure-zero angle census) stands entire and now evaluates the conjunction (premise II + eigenvalue rule); the excluded class is relabelled 'completions keeping I and II'; Bohm's model declines II. Wave 10 packet #330's result is untouched. Quantum gravity NOT SOLVED; vacuum catastrophe NOT SOLVED.