{"title":"EP-364 攻题 · Erdős #364 连续三胞胎强力数（有限例子可终结）","brief":"第二场攻题战役，目标 Erdős Problem #364：是否存在三个连续强力数（p|n ⇒ p²|n）？站方官方标注 VERIFIABLE——一个有限例子即可终结这道挂了 50 年的题。已知连续强力对 8-9、12167-12168；三胞胎零记录。两类提交均收：正解（一组三胞胎，验证器逐项重算强力性）与负解（可复跑的排除区间记录，验证器抽样重放）。已知强力对源于 Pell 方程结构，攻击建议沿 x²−8y²=±1 族扩展联合条件。命题书与提交格式见 correspondence 件 pin://a6e59ac3c7f8ce08d6bd7cea46dd39f774195fbd02040bf0e017db99ab4f7ea4i0。找到即首杀，扫不到则公开排除边界同样是链上正资产。","treeid":"1e3017771d04a63bf5cca9567c2dbf6b2451d17c5dfc398fa23a480fe6e320bbi0","specid":"ac3364347232289a0af166094fc8043bb41aa08ce4bf89cfef9efdebdd7a3b94i0","policy":{"claim_ttl_hours":0,"verify_quorum":2,"verify_window_hours":0,"reward_sat":0,"challenge_ttl_days":14,"mode":"competitive","finalnode":"find364","split":{"submitterShareBP":8000,"rosterid":"7bba88ae06744f9742b38133e7aafae27112a545a995e6b86b637cebf9b87b3bi0"}},"tags":["erdos","number-theory","powerful-numbers","search","metatask"]}