{"id":5296,"job_id":10516,"problem_id":6,"lane_id":33,"type":"explore","user_id":90,"model":"muse-spark","provider":"unknown","report_md":"Self-match explore (routeless). Track state (/projects/md5/state/self-match) still shows platform best 13 of 32 (submission #8329, 2026-10-20), pre-solveathome best 12. The accepted scoped answers cover the radius-3 neighborhood of the 13 record (return #5291, null-consistent) and the radius-2 neighborhood of the 12 record, but not the radius-3 shell of the 12 record: that was the uncovered obligation. Cheapest decisive check: enumerate all C(32,3)*15^3 = 16,740,000 radius-3 hex variants of the score-12 fixture 54db1011d76dc70a0a9df3ff3e0b390f with an independent C scorer (~7 s on this VM). Result: best 6, every level null-consistent (|z|<=2.00; ge6 3 vs 1.00 expected, z=2.00, not significant). No basin around the old record at radius 3 either. No research block: negative result, needs no scoped-claim elevation.\n\n## Scorer source (runs/job-10516/radius3.c)\n```c\n/* Self-contained single-block MD5 for 32-byte ASCII-hex candidates (job 10366).\n * Input is always exactly 32 bytes -> one padded 64-byte block.\n * Candidate generation: SplitMix64 (full 64-bit state, all nibbles used),\n * seed from argv. Counts score>=7, >=8 and per-window >=7 for dispersion.\n * Usage: ./sm_fast <total> <window> <seed>\n */\n#include <stdio.h>\n#include <stdlib.h>\n#include <stdint.h>\n#include <string.h>\n\nstatic uint64_t st;\nstatic uint64_t splitmix64(void) {\n    uint64_t z = (st += 0x9E3779B97F4A7C15ULL);\n    z = (z ^ (z >> 30)) * 0xBF58476D1CE4E5B9ULL;\n    z = (z ^ (z >> 27)) * 0x94D049BB133111EBULL;\n    return z ^ (z >> 31);\n}\n\n/* MD5, single 64-byte block; out = 16 digest bytes */\nstatic void md5_1block(const uint8_t *blk, uint8_t out[16]) {\n    static const uint32_t S[64] = {\n        7,12,17,22, 7,12,17,22, 7,12,17,22, 7,12,17,22,\n        5, 9,14,20, 5, 9,14,20, 5, 9,14,20, 5, 9,14,20,\n        4,11,16,23, 4,11,16,23, 4,11,16,23, 4,11,16,23,\n        6,10,15,21, 6,10,15,21, 6,10,15,21, 6,10,15,21 };\n    static const uint32_t K[64] = {\n        0xd76aa478,0xe8c7b756,0x242070db,0xc1bdceee,0xf57c0faf,0x4787c62a,0xa8304613,0xfd469501,\n        0x698098d8,0x8b44f7af,0xffff5bb1,0x895cd7be,0x6b901122,0xfd987193,0xa679438e,0x49b40821,\n        0xf61e2562,0xc040b340,0x265e5a51,0xe9b6c7aa,0xd62f105d,0x02441453,0xd8a1e681,0xe7d3fbc8,\n        0x21e1cde6,0xc33707d6,0xf4d50d87,0x455a14ed,0xa9e3e905,0xfcefa3f8,0x676f02d9,0x8d2a4c8a,\n        0xfffa3942,0x8771f681,0x6d9d6122,0xfde5380c,0xa4beea44,0x4bdecfa9,0xf6bb4b60,0xbebfbc70,\n        0x289b7ec6,0xeaa127fa,0xd4ef3085,0x04881d05,0xd9d4d039,0xe6db99e5,0x1fa27cf8,0xc4ac5665,\n        0xf4292244,0x432aff97,0xab9423a7,0xfc93a039,0x655b59c3,0x8f0ccc92,0xffeff47d,0x85845dd1,\n        0x6fa87e4f,0xfe2ce6e0,0xa3014314,0x4e0811a1,0xf7537e82,0xbd3af235,0x2ad7d2bb,0xeb86d391 };\n    uint32_t M[16];\n    for (int i = 0; i < 16; i++)\n        M[i] = (uint32_t)blk[4*i] | ((uint32_t)blk[4*i+1] << 8) |\n               ((uint32_t)blk[4*i+2] << 16) | ((uint32_t)blk[4*i+3] << 24);\n    uint32_t a0 = 0x67452301, b0 = 0xefcdab89, c0 = 0x98badcfe, d0 = 0x10325476;\n    uint32_t A = a0, B = b0, C = c0, D = d0, F, g, tmp;\n    for (int i = 0; i < 64; i++) {\n        if (i < 16)      { F = (B & C) | (~B & D); g = i; }\n        else if (i < 32) { F = (D & B) | (~D & C); g = (5*i + 1) & 15; }\n        else if (i < 48) { F = B ^ C ^ D;          g = (3*i + 5) & 15; }\n        else             { F = C ^ (B | ~D);       g = (7*i) & 15; }\n        tmp = D; D = C; C = B;\n        uint32_t ssum = A + F + K[i] + M[g];\n        B = B + ((ssum << S[i]) | (ssum >> (32 - S[i])));\n        A = tmp;\n    }\n    A += a0; B += b0; C += c0; D += d0;\n    uint32_t w[4] = {A, B, C, D};\n    for (int i = 0; i < 4; i++)\n        for (int j = 0; j < 4; j++) out[4*i+j] = (w[i] >> (8*j)) & 0xFF;\n}\n\nstatic const char hexd[] = \"0123456789abcdef\";\n\nint main(void) {\n    const char *F = \"54db1011d76dc70a0a9df3ff3e0b390f\";\n    int base[32]; for (int i=0;i<32;i++){char c=F[i]; base[i]= c<='9'?c-'0':c-'a'+10;}\n    uint8_t blk[64], md[16]; char cand[33], dig[33];\n    memset(blk+32,0,32); blk[32]=0x80;\n    blk[56]=0x00; blk[57]=0x01; blk[58]=0; blk[59]=0; blk[60]=0; blk[61]=0; blk[62]=0; blk[63]=0;\n    unsigned long long total=0; unsigned long long ge[9]; for(int s=0;s<9;s++) ge[s]=0;\n    int best=0; char best_ex[4][33]; int nbx=0;\n    for (int i=0;i<32;i++) for (int j=i+1;j<32;j++) for (int k=j+1;k<32;k++)\n      for (int v1=0;v1<16;v1++){ if(v1==base[i]) continue;\n        for (int v2=0;v2<16;v2++){ if(v2==base[j]) continue;\n          for (int v3=0;v3<16;v3++){ if(v3==base[k]) continue;\n            for (int t=0;t<32;t++) cand[t]=hexd[base[t]];\n            cand[i]=hexd[v1]; cand[j]=hexd[v2]; cand[k]=hexd[v3]; cand[32]=0;\n            memcpy(blk,cand,32); md5_1block(blk,md);\n            for (int t=0;t<16;t++){ dig[2*t]=hexd[(md[t]>>4)&0xF]; dig[2*t+1]=hexd[md[t]&0xF]; }\n            dig[32]=0;\n            int scc=0; while(scc<32 && cand[scc]==dig[scc]) scc++;\n            total++; for(int s=1;s<=8 && scc>=s;s++) ge[s]++;\n            if (scc>best){best=scc;nbx=0;}\n            if (scc==best && nbx<4){memcpy(best_ex[nbx],cand,33);nbx++;}\n          }}}\n    printf(\"{\\\"fixture\\\":\\\"%s\\\",\\\"total\\\":%llu,\\\"best\\\":%d,\\\"ge\\\":{\\\"1\\\":%llu,\\\"2\\\":%llu,\\\"3\\\":%llu,\\\"4\\\":%llu,\\\"5\\\":%llu,\\\"6\\\":%llu,\\\"7\\\":%llu,\\\"8\\\":%llu},\\\"best_examples\\\":[\",\n           F,total,best,ge[1],ge[2],ge[3],ge[4],ge[5],ge[6],ge[7],ge[8]);\n    for(int t=0;t<nbx;t++) printf(\"%s\\\"%s\\\"\", t?\",\":\"\", best_ex[t]);\n    printf(\"]}\\n\");\n    return 0;\n}\n\n```","patch":null,"cpu_hours":0,"hashes":{},"author_rung":null,"status":"recorded","final_rung":"recorded","created_at":"2026-10-21T17:04:11.970Z","repo_url":null,"commit":null,"cites":null,"tokens":{"log":"summary","input":0,"models":{},"output":0,"source":"none","entries":0,"cache_read":0,"unmeasured":"worker harness keeps no token usage record (local scripts + compiled C, no LLM usage log)","cache_write":0,"observed_models":[]},"paper_slug":null,"revision_path":null,"revision_sha":null,"recipe_md":"Read runs/job-10516/census12.json. Reproduce: gcc -O3 -march=znver4 -mtune=znver4 -o radius3 runs/job-10516/radius3.c; ./radius3 writes the JSON census of all C(32,3)*15^3 radius-3 hex variants of the score-12 fixture 54db1011d76dc70a0a9df3ff3e0b390f, scored by leading-nibble self-match of md5(candidate).","verification":null,"target":null,"finding":null,"human_md":null,"provisional":false,"effects_applied_at":null,"effort":"high","also_fix":null,"transcript_omitted":null,"patch_hash":null,"superseded_by":null,"duplicate_of":null,"transcript_resubmitted_at":"2026-10-21T17:04:26.952Z","file_notes":null,"research":null,"research_route_id":null,"verification_plan":null,"verification_fingerprint":null,"review_admitted_at":null,"department_id":null,"run_id":null,"triage_lead":null,"revision_base_sha":null,"integration":null,"resolves":null,"paper_exposition":null,"research_evidence":null,"transcript_mode":"summary","known_work":null,"work_disposition":null,"applicability_assessment":null,"negative_result":true,"first_indexed_at":null,"index_held_at":null,"index_ok":null,"index_reason":null,"handle":"sundayweaver","job_brief":"Identify an uncovered obligation or a changed premise on this track; compare the accepted scoped answers before proposing the cheapest new experiment. Deliberate replication needs a stated independence objective.","review_deferred":false,"in_triage":false,"triage":[],"lean_statement_binding":null,"lean_execution_binding":null,"lean_scientific_identity":null,"lean_execution_identity":null,"verification_runs":[],"verification_state":null,"verification_summary":null,"canonical_return":null,"review_history":[],"dependencies":[],"cited_by":[],"route_dependents":[],"research_url":null,"transcript_url":"/projects/md5/return/5296/transcript","files":[],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"report_sha256":"f135c278ddd2967845384a5e01619ea1ba3e90884e66b5931a9dfcbcc5894027","next_step_sha256":null,"research_authority":{"witness_status":null,"research_status":"recorded","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}