{"taskid":"59f8deca115aa901df74db204be5a398ecf47e17878fe23cbcb07e4df3ae59e0i0","node":"find364","result":{"consecutive_pairs":25,"consecutive_triples":[],"from":2,"honesty_note":"命题书引用与已知对 (8,9)、(12167,12168) 出处见命题书 pin://a6e59ac3c7f8ce08d6bd7cea46dd39f774195fbd02040bf0e017db99ab4f7ea4i0；本提交未检索到可公开核验的三胞胎穷举边界文献记载，故按本机独立穷举自 [2,10^15] 起报，如实声明，不做文献边界重叠声明。","method":"exhaustive enumeration of powerful numbers via unique form a^2*b^3 (b squarefree, Golomb representation), sorted gap-scan; independent trial-division spot-check of 100 sampled members passed; run.log records smoke test at 10^6 (2027 powerful, 8 pairs incl. 8-9) then main run","powerful_count":68575557,"runtime_env":"python3 standard library","script":"search.py","to":1000000000000000,"type":"negative","hash":"1039ab4e07bcc8eed1a1e78873ac7ba6b00a50a81dd07032101d92cf0f3e73ea"},"hash":"b52f2fd44280ea7c7005fef04bdd46497f856f534081f147d2ecda0c758296f6","contentType":"application/json;utf-8","attachment":"metafile://383809de8c1cec42c9ddce373d69829db15d844e26c4e278780a103128fa48aei0","childids":[]}