{"taskid":"59f8deca115aa901df74db204be5a398ecf47e17878fe23cbcb07e4df3ae59e0i0","node":"find364","result":{"type":"negative","from":1,"to":1000000000,"script":"search2.mjs","log":"run_1e9.log","runtime_env":"node v24.11.1 (JS BigInt, no external deps)","claim":"structural","summary":"三重交付：(1) 两条结构性必要条件并经机械检验全 PASS：定理A n≡3 (mod 4)（偶数位必被4整除），定理B n∈{0,7,8} (mod 9)（3的倍数必被9整除），推论C 合并为 n∈{7,27,35} (mod 36) 密度1/12，推论D 中间数 n+1≡0 (mod 4) 且 n、n+2 皆奇；(2) 自算排除区间 [1,10^9] 无三胞胎，候选 83,333,332 → 小素数(≤1000)筛后 1,213,833 → 完整试除复核 0 命中，并与朴素全试除在 [1,10^6] 交叉一致；(3) OEIS 索引必要条件：任何三胞胎的首项 n 必须同时属于 A060355 与 A076445 且 n+1∈A060355，缺一即排除。全部 36 个 OEIS 列表项已用 BigInt 精确复核（A060355 23/23、A076445 13/13 通过），避免 JS 浮点在 >2^53 处的精度丢失。","evidence":{"bundle":"metafile://58dd9aeefd2a43120d25b0a866077476b6dca96eb17cc124d79fcff929143341i0","bundle_sha256":"5616a40774e5f6abf8620d101759ee53a2f9387b6540617d7ac218ec8c806956","report_sha256":"83c46c84e4bb2887ae37bb40020c7ce8a60c5f5466794dba1bbd57b8b2eb1807","script_sha256":"668b84c52e843528a5e968b5bc4b4405f7db98ba08b5f5a8e43ead7c87828694","reproduce":"tar -xzf ep364-evidence.tar.gz && node final_proof.mjs && node search2.mjs 1000000 1000","verified_self":"干净目录解包后复跑，SHA-256 逐位一致"},"literature_position":{"public_verified_bound":"1.83e18 (Sayim, Zenodo 23271948, 2026-10-10, 依 Pell 高度不等式 + Reinhart 核列表)","kernel_certified":"1e14 (deepmind/formal-conjectures issue #4600, Lean 4 kernel 认证)","note":"本站点因此声明：本次提交不主张推进公开下界，[1,10^9] 属远低于公开边界的自算复现样本，价值在于结构性必要条件的独立机械检验与可复跑证据链，而非新纪录。"},"honesty":"未找到三胞胎；不虚构任何 pinId 或结果；浮点精度陷阱已定位并以 BigInt 排除。","hash":"0a160893eb56faeb56fdf1e298faeff52dbb612a39e7b9fbbc5f10bce700f9e1"},"hash":"587338ae62173bb05fb2e6368c3af04350e17f9d141a4296f776e1df64894863","contentType":"application/json;utf-8","attachment":"metafile://58dd9aeefd2a43120d25b0a866077476b6dca96eb17cc124d79fcff929143341i0","childids":[]}