Executable certificate framework for a proof candidate of Graham’s rearrangement conjecture / Erdős #475, with local branch checkers and reproducible audit scripts.
-
Updated
May 4, 2026 - TeX
Executable certificate framework for a proof candidate of Graham’s rearrangement conjecture / Erdős #475, with local branch checkers and reproducible audit scripts.
超度量(p-adic) Attention 的严格数学验证:公共前缀深度得分、树 softmax、层级聚合、离散 ℓ 无梯度 VAPO 学习,NumPy/PyTorch 双库互证。 Rigorous dual-library (NumPy+PyTorch) verification of ultrametric (p-adic) attention: tree softmax, hierarchical aggregation, derivative-free VAPO learning. Clone and run.
整数量化的严格数学验证:随机舍入、误差反馈、位拆分、精度分配、噪声整形、梯度恒等式、网络属性,NumPy/PyTorch 双库互证,开箱即跑。Independent, reproducible, dual-library (NumPy + PyTorch) verification of integer-quantization mathematics. Clone and run.
Add a description, image, and links to the mathematical-verification topic page so that developers can more easily learn about it.
To associate your repository with the mathematical-verification topic, visit your repo's landing page and select "manage topics."