通过消息编码矛盾证明P≠NP，关键在计算中的证据消耗限制。
A Quantale-Weakness Route to $P \neq NP$ via CD Evidence Normalization and Gauge-Buffered Locked Ensembles
- 构造可高效采样的SAT实例，其解对应唯一全局消息
- 证明任意多项式时间观察者无法在多数坐标上获得显著预测优势
- 适合对复杂性理论与计算证据机制感兴趣的读者
我们提出一种基于多项式时间受限条件描述长度上下界冲突的P≠NP证明框架。构造了一个可高效采样的SAT实例族Y，其每个满足赋值都产生相同的全局消息M(Y)。若P=NP，标准多项式时间自归约可从Y恢复M(Y)，故K_poly(M(Y)|Y)=O(1)。下界部分表明：对同一实例族，任意固定多项式时间观察者在选定的线性数量消息坐标上无法获得实质性预测优势。该论证将计算视为证据生成过程：预测优势转化为可构造的双重证据偏移，并进一步转化为消息对立世界间的成对区分。一个归一化定理指出，所有目标相关的非中性证据叶节点要么是安全缓冲观测，要么是隐藏规范观测。安全缓冲观测泄漏可忽略，而隐藏规范观测受规范秩计数限制。由此得出原子级证据预算，表明在t个选定坐标上总消息解析优势为o(t)。边界律混合提供可见表面的近随机基线。结合证据预算得乘积小成功，再经由成功压缩原理，得到K_poly(M(Y)|Y)≥Ω(t)（高概率成立）。这与P=NP导致的常数上界矛盾，因此P≠NP。
原文摘要 · Abstract (English)
We present a proof architecture for \(P \neq NP\) based on an upper--lower clash in polytime-capped conditional description length. We construct an efficiently samplable family of SAT instances \(Y\) such that every satisfying witness for \(Y\) yields the same global message \(M(Y)\). If \(P=NP\), then a standard polynomial-time SAT self-reduction recovers \(M(Y)\) from \(Y\), so \[ K_{\mathrm{poly}}(M(Y)\mid Y)=O(1). \] The lower-bound side shows the opposite. For the same ensemble, no fixed polynomial-time observer can gain substantial predictive advantage on a linear number of selected message coordinates. The argument treats computation as an evidence-producing process: predictive advantage is converted into constructible-dual evidence skew and then into pairwise distinctions between message-opposite worlds. A normalization theorem shows that every target-relevant non-neutral evidence leaf is either a safe-buffer observation or a hidden-gauge observation. Safe-buffer observations have negligible leakage, while hidden-gauge observations are limited by gauge-rank accounting. This yields an atomic evidence budget implying that total message-resolving advantage is \(o(t)\) across \(t\) selected coordinates. Boundary-law mixing gives the near-random baseline for the visible surface. Combining this with the evidence budget gives product small-success and then, by Compression-from-Success, \[ K_{\mathrm{poly}}(M(Y)\mid Y)\ge Ω(t) \] with high probability. This contradicts the constant upper bound from \(P=NP\). Therefore \(P \neq NP\).
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品；中文卡片由大模型生成，请以原文为准。