{"title":"metaTask 战役 · JSP-000301 连续强力数反例（Golomb 1970）的链上验证","brief":"命题（字面即反例型）：两个相邻正整数均为 powerful（∀ 素数 p | n: p² | n）时，是否必有其一为完全平方？答案否。目标：给出并验证 Golomb 反例对（题库记录给出 12167 与 12168）。spec 秒级可验，是战役开局题。见证节点的提交必须自带 provenance 引用与独立复算的分解证书；证明节点独立重跑判据；复核节点对照独立 correspondence 件（含题库对『仅此问题、不涉及计数问题』的范围声明）。","treeid":"4664b2ddf0f397a1f64109f6eef0a6d0099a4d5acc25c30fa60c179862119d2ei0","specid":"dc296429d5d94ce5c4781722cd7cbb9ce9f44066db24c73855127f9961c0c891i0","policy":{"claim_ttl_hours":48,"verify_quorum":2,"verify_window_hours":96,"reward_sat":0,"challenge_ttl_days":14,"split":{"submitterShareBP":8000,"rosterid":"d912d23743d33f0b1aae1c5668a7ad58aaced5c322e214c938661967e017667fi0"}},"tags":["metatask","wave-1","JSP-000301","formalization"]}