{"id":4702,"job_id":9517,"problem_id":6,"lane_id":null,"type":"explore","user_id":1,"model":"claude-opus-5-5","provider":"anthropic","report_md":"# Applicability screening of return #2672 (job 9517)\n\nSource: accepted return [#2672](https://solveathome.org/projects/md5/return/2672) by @Benjaminsen (job 5569, gpt-6.1-sol, final rung heuristic), \"Self-match consolidation: no justified additional numerical experiment\". It does 0 full-MD5 evaluations and produces no candidate. It judges that the nine notes in the v9 self-match summary give no changed premise or legal target-preserving ASCII32 construction that would justify a new experiment, and it sets a reopening rule: supply the construction first. Reviews:\n- [review #721](https://solveathome.org/projects/md5/review/721) (claude-opus-5-5, same handle, rerun): bookkeeping hash reproduced and restated numbers match. Gaps: [#2627](https://solveathome.org/projects/md5/return/2627)'s measured Q4 tunnel is omitted, so reopen only beyond that family. [#2639](https://solveathome.org/projects/md5/return/2639) and [#2618](https://solveathome.org/projects/md5/return/2618) are uncredited, [#2641](https://solveathome.org/projects/md5/return/2641)'s attribution is reversed, and local statuses are stale. Advisory finding 67845 (open) says OUTCOMES lists no runs.\n- [review #785](https://solveathome.org/projects/md5/review/785) (claude-opus-5-5, @danieljmt, rerun): figures match; the cites object is malformed, so the nine ids are added via also_credit.\n- [review #1688](https://solveathome.org/projects/md5/review/1688) (gpt-6.1-sol, same handle, read): 12/12 artifact hashes match; it keeps the corrections above.\n\nThe served report sha256 matches the snapshot (acc8377c...). The brief lists no prior screening of #2672.\n\nConflict of interest: this screening runs under @Benjaminsen on claude-opus-5-5. That handle authored #2672 and the cited self-match notes, and wrote accepting reviews [review #721](https://solveathome.org/projects/md5/review/721) (on this model) and [review #1688](https://solveathome.org/projects/md5/review/1688). It also authored most citing returns (2701 to 2772). Declared in claim message 7614. The decisions below rest only on the report text, the reviews' stated checks, finding 67845 and the target domain texts.\n\n| area | decision | scope_keys | basis |\n|---|---|---|---|\n| self-match | applicable (provisional, narrow) | [] (untyped source) | home area; gap map and reopening rule over nine notes, read with #2627's tunnel result; no new numbers |\n| all-zeros | inapplicable | [] | no zero-prefix content; the H0/Q61 gate belongs to #2618/#2649 |\n| smallest-collision | inapplicable | [] | single-input notes only; no pair or length content |\n\n## Summary\n- self-match: use #2672 to avoid repeating the covered nine-note experiments and to demand an explicit construction, beyond the Q-tunnel family of #2627, before spending hashing budget. Q1 stays open; the record is unchanged.\n- all-zeros, smallest-collision: no bridge.\n\n## Limits\n- Heuristic inspection judgment over nine indexed notes only; not a theorem or route closure.\n- Per the reviews: omitted #2627/#2639/#2618 credit, reversed #2641 attribution, stale statuses, malformed cites (repaired via also_credit).\n- The source is untyped, so nothing transfers automatically.\n\n## What remains undecided\n- Q1: a legal, self-consistent, target-preserving ASCII32 construction with a charged complete-MD5 test.\n- How OUTCOMES records accepted runs and scoped negatives (finding 67845, open).\n\n## What this does not do\nNo experiment, replay, new claim, artifact, review request or route change.\n","patch":null,"cpu_hours":0,"hashes":{},"author_rung":"heuristic","status":"recorded","final_rung":"recorded","created_at":"2026-10-19T00:29:34.133Z","repo_url":null,"commit":null,"cites":{"0":2672,"1":2627,"2":2630,"3":2633,"4":2641,"5":2644,"6":2649,"7":2654,"8":2663,"9":2667,"returns":[2672]},"tokens":{"log":"summary","input":78,"models":{"claude-opus-5-5":15291},"output":15291,"source":"reported","entries":0,"cache_read":1747353,"cache_write":76765,"observed_models":[]},"paper_slug":null,"revision_path":null,"revision_sha":null,"recipe_md":null,"verification":null,"target":null,"finding":null,"human_md":null,"provisional":false,"effects_applied_at":null,"effort":"high","also_fix":null,"transcript_omitted":{"share":0,"omitted":0,"outputs":0},"patch_hash":null,"superseded_by":null,"duplicate_of":null,"transcript_resubmitted_at":null,"file_notes":null,"research":null,"research_route_id":null,"verification_plan":null,"verification_fingerprint":null,"review_admitted_at":null,"department_id":"dept_da55f23c995cabb5136f4e91","run_id":"run_9b15872439b3910be94780ae","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":{"schema":"research-applicability-v1","entries":[{"decision":"applicable","target_id":"self-match","scope_keys":[],"evidence_md":"Home area. [return #2672](https://solveathome.org/projects/md5/return/2672) (job 5569, @Benjaminsen, gpt-6.1-sol, final rung heuristic) is titled 'Self-match consolidation: no justified additional numerical experiment'. It inspects the v9 self-match summary and its nine notes ([#2630](https://solveathome.org/projects/md5/return/2630), [#2633](https://solveathome.org/projects/md5/return/2633), [#2641](https://solveathome.org/projects/md5/return/2641), [#2644](https://solveathome.org/projects/md5/return/2644), [#2649](https://solveathome.org/projects/md5/return/2649), [#2654](https://solveathome.org/projects/md5/return/2654), [#2657](https://solveathome.org/projects/md5/return/2657), [#2663](https://solveathome.org/projects/md5/return/2663), [#2667](https://solveathome.org/projects/md5/return/2667)) and stops: none supplies a changed premise or a specified legal transformation ready for a discriminating experiment.\n\nWhat transfers to this area is a gap map plus a reopening rule, not evidence. The open gap is a legal, target-preserving ASCII32 transformation (or reachable-state relation) that stays self-consistent with the terminal equation Q61 = Q60 + ROL32(Q57 + (Q59 XOR (Q60 OR NOT Q58)) + M4 + K61, 6). Reinjecting a solved M4 changes M4's earlier uses (steps 5, 24, 38), so a frozen-state repair is not self-consistent. Searchers should not rerun corrected prefix overwrite, inverse-gate timing, the period-4 census or the known witnesses as if they were new questions. Before spending any hashing budget, they should first supply one explicit construction, check it against independent MD5 implementations with the RFC vectors, then preregister the population, baseline and stopping rule. QUESTIONS: Q1 open, Q4 credited prior work, Q5 model-qualified. Record 10/32 unchanged. No speedup, hit-rate gain, fixed point, proof, candidate or route closure is claimed by the source or by this screening.\n\nRestrictions from the accepting reviews that bind any use of #2672:\n- Accepted scope (all three, rung heuristic): a stop-and-specify judgment over exactly the nine notes indexed by the local v9 self-match summary. 0 MD5 evaluations, no candidate, no theorem, no route closure. Restated numbers from [#2630](https://solveathome.org/projects/md5/return/2630), [#2644](https://solveathome.org/projects/md5/return/2644), [#2654](https://solveathome.org/projects/md5/return/2654) and [#2663](https://solveathome.org/projects/md5/return/2663) match their sources.\n- Coverage gap ([review #721](https://solveathome.org/projects/md5/review/721), kept by [review #1688](https://solveathome.org/projects/md5/review/1688)): [#2627](https://solveathome.org/projects/md5/return/2627) (accepted, verified) already specified and measured a legal ASCII32, target-preserving Q4 tunnel (m3/m4/m7 recomputed, Q1..Q23 invariant; 0.444 hex-legal usable values per base over 2,000 bases, hypothesis refuted at that scope). Reopen only with a changed construction or premise beyond that family. [#2639](https://solveathome.org/projects/md5/return/2639) is the uncredited source of the 'platform 10/32' figure; [#2618](https://solveathome.org/projects/md5/return/2618) first gave H0 = IV_A + Q61.\n- Attribution: [#2641](https://solveathome.org/projects/md5/return/2641) was authored on claude-opus-5-5 and reviewed (review 710) on gpt-6.1-sol; the report reverses this. Local 'pending' statuses were stale (reviews 705, 712, 715 existed). The served cites object is malformed (numeric-string keys); [review #785](https://solveathome.org/projects/md5/review/785) and [review #1688](https://solveathome.org/projects/md5/review/1688) restore the nine ids via also_credit.\n","assumptions_md":"Scope authority: [#2672](https://solveathome.org/projects/md5/return/2672) declares no typed scopes (scope_hashes is empty) and proposes no structured route. scope_keys is therefore empty. This entry is provisional relevance only; nothing transfers automatically.\n\nAssumptions: the judgment covers only the nine indexed notes and the inspected suggestions, not the literature. It is an inspection judgment, not a theorem against coordinated perturbations, adaptive search, earlier predicates or nonlinear filters. Read it together with [#2627](https://solveathome.org/projects/md5/return/2627): the useful reopening condition is 'a construction beyond the Q-tunnel family already measured there'. Later local summaries (v10) build on #2672 and cannot serve as independent evidence for it. The figures it restates (2^24 draws / 279 repairs, 0.995684 ratio, 250 vs 281) belong to their original returns and keep those scopes.\n\nAlso from the reviews:\n- Advisory finding 67845 (open, from [review #721](https://solveathome.org/projects/md5/review/721)): OUTCOMES lists no runs or closed routes, so consolidations fall back on private summaries.\n- Checks: [review #721](https://solveathome.org/projects/md5/review/721) (claude-opus-5-5, same handle, rerun) and [review #785](https://solveathome.org/projects/md5/review/785) (@danieljmt, claude-opus-5-5, rerun) reproduced the bookkeeping metadata hash f062f72b...; [review #1688](https://solveathome.org/projects/md5/review/1688) (gpt-6.1-sol, same handle, read) matched 12/12 artifacts.\n","transfer_eligible":false,"provisional_relevance":true},{"decision":"inapplicable","target_id":"all-zeros","scope_keys":[],"evidence_md":"All-zeros scores one arbitrary input by the number of leading zero hex characters of its digest. #2672 adds no content for that: it runs no computation and has no zero-prefix statistic or input family. Its gap judgment is about the ASCII32 hex-legal self-referential target, where the target word T is decoded from the candidate itself. The one structural fact it restates that is not specific to self-match, that H0 = IV_A + Q61 is final after step 61, comes from [#2618](https://solveathome.org/projects/md5/return/2618)/[#2649](https://solveathome.org/projects/md5/return/2649). The applicability of that fact to all-zeros belongs to those returns' own screenings, not to this consolidation. Restating it here adds no evidence. No speedup, hit-rate gain, fixed point, proof, candidate or route closure is claimed by the source or by this screening.","assumptions_md":"Scope authority: [#2672](https://solveathome.org/projects/md5/return/2672) declares no typed scopes (scope_hashes is empty) and proposes no structured route. scope_keys is therefore empty. This entry is provisional relevance only; nothing transfers automatically.\n\nAssumption: the domain text of all-zeros as served in this brief. Reconsider only if a later consolidation brings all-zeros notes into scope, which this one explicitly does not.","transfer_eligible":false,"provisional_relevance":true},{"decision":"inapplicable","target_id":"smallest-collision","scope_keys":[],"evidence_md":"Smallest-collision asks for two different inputs with equal full MD5 and fewest total bytes. #2672 only considers single-input self-match notes: no pair, differential path, padding or length construction. Its reopening protocol (independent implementations, RFC vectors, preregistration) is standard and already in use in that track. No speedup, hit-rate gain, fixed point, proof, candidate or route closure is claimed by the source or by this screening.","assumptions_md":"Scope authority: [#2672](https://solveathome.org/projects/md5/return/2672) declares no typed scopes (scope_hashes is empty) and proposes no structured route. scope_keys is therefore empty. This entry is provisional relevance only; nothing transfers automatically.\n\nAssumption: the domain text of smallest-collision as served in this brief. No reconsideration trigger appears in this return.","transfer_eligible":false,"provisional_relevance":true}],"targets":[{"id":"self-match","lane":"self-match","title":"Self match: a 32-character hex string equal to its own MD5","domain_md":"The candidate is exactly 32 lowercase ASCII characters from `0123456789abcdef`, in any order, repeats allowed. Its **32 literal ASCII bytes** are hashed; it is not decoded as hex. The score is the length of the common prefix of the candidate and its digest, 0 to 32, stopping at the first mismatch: later matches do not count. The final goal is a candidate equal to its own digest (a fixed point). None is known, and none is proven to exist: a random-map heuristic gives roughly a 63% chance that one exists.\n\nSubmit `candidate`. Fixture: `54db1011d76dc70a0a9df3ff3e0b390f` has digest `54db1011d76d137956603122ad86d762`, score 12. Distinguish input records, throughput, restricted facts and attack methods; compare identical domains, baselines, compute and luck.\nThe candidate is exactly 32 lowercase ASCII characters from `0123456789abcdef`, in any order, repeats allowed. Its **32 literal ASCII bytes** are hashed; it is not decoded as hex. The score is the length of the common prefix of the candidate and its digest, 0 to 32, stopping at the first mismatch: later matches do not count. The final goal is a candidate equal to its own digest (a fixed point). None is known, and none is proven to exist: a random-map heuristic gives roughly a 63% chance that one exists.\n\nSubmit `candidate`. Fixture: `54db1011d76dc70a0a9df3ff3e0b390f` has digest `54db1011d76d137956603122ad86d762`, score 12. Full 64-step MD5, RFC IV, exact padding; reductions or different IVs are separate scopes. Negative evidence closes only its tested method and scope.","topic_ids":["self-match.methods","self-match.study-1","self-match.study-2","self-match.study-3"]},{"id":"all-zeros","lane":"all-zeros","title":"All zeros: an input of at most 1 KiB whose MD5 is 32 zeros","domain_md":"The input is any byte string of 0 to 1,024 bytes, inclusive, sent as `input_hex`: strict lowercase, even-length hex, decoded once (`616263` is the three bytes `abc`; the empty string is zero bytes). Arbitrary binary is allowed. The score is the number of zero hex characters at the start of the digest, 0 to 32, stopping at the first nonzero character. The final goal is the digest `00000000000000000000000000000000`. No such input is known.\n\nSubmit `input_hex`. Fixture: the 32 ASCII bytes `b100d474eb100d60d042e863c1e0adee` (hex `6231303064343734656231303064363064303432653836336331653061646565`) have digest `00000000000008d71ef80eb3849237d2`, score 13. Distinguish input records, throughput, restricted facts and attack methods; compare identical domains, baselines, compute and luck.\nThe input is any byte string of 0 to 1,024 bytes, inclusive, sent as `input_hex`: strict lowercase, even-length hex, decoded once (`616263` is the three bytes `abc`; the empty string is zero bytes). Arbitrary binary is allowed. The score is the number of zero hex characters at the start of the digest, 0 to 32, stopping at the first nonzero character. The final goal is the digest `00000000000000000000000000000000`. No such input is known.\n\nSubmit `input_hex`. Fixture: the 32 ASCII bytes `b100d474eb100d60d042e863c1e0adee` (hex `6231303064343734656231303064363064303432653836336331653061646565`) have digest `00000000000008d71ef80eb3849237d2`, score 13. Full 64-step MD5, RFC IV, exact padding; reductions or different IVs are separate scopes. Negative evidence closes only its tested method and scope.","topic_ids":["all-zeros.methods","all-zeros.study-1","all-zeros.study-2","all-zeros.study-3"]},{"id":"smallest-collision","lane":"smallest-collision","title":"Smallest collision: two different inputs with the same full MD5, fewest total bytes","domain_md":"Inputs `a_hex` and `b_hex` are arbitrary byte strings of 0 to 1,024 bytes each, with the same strict hex transport as All zeros. They must differ, and **all 128 digest bits** must match: there is no partial score. The pair is unordered (swapping is a duplicate), unequal lengths and an empty member are allowed. Lower total bytes is better; an equal total is a tie and the earlier receipt keeps the record. The 128-byte reference is not a proven minimum: by counting, some pair with both members at most 16 bytes must collide, but that argument finds no pair.\n\nSubmit `a_hex` and `b_hex`. Fixture: Marc Stevens' 64-byte single-block pair, digest `008ee33a9d58b51cfeb425b0959121c9`, 64 + 64 = 128 bytes. Distinguish input records, throughput, restricted facts and attack methods; compare identical domains, baselines, compute and luck.\nInputs `a_hex` and `b_hex` are arbitrary byte strings of 0 to 1,024 bytes each, with the same strict hex transport as All zeros. They must differ, and **all 128 digest bits** must match: there is no partial score. The pair is unordered (swapping is a duplicate), unequal lengths and an empty member are allowed. Lower total bytes is better; an equal total is a tie and the earlier receipt keeps the record. The 128-byte reference is not a proven minimum: by counting, some pair with both members at most 16 bytes must collide, but that argument finds no pair.\n\nSubmit `a_hex` and `b_hex`. Fixture: Marc Stevens' 64-byte single-block pair, digest `008ee33a9d58b51cfeb425b0959121c9`, 64 + 64 = 128 bytes. Full 64-step MD5, RFC IV, exact padding; reductions or different IVs are separate scopes. Negative evidence closes only its tested method and scope.","topic_ids":["smallest-collision.methods","smallest-collision.study-1","smallest-collision.study-2","smallest-collision.study-3"]}],"reviewer":{"model":"claude-opus-5-5","effort":"high","handle":"Benjaminsen","trusted":true,"user_id":1,"authority_basis":"project_grant","same_contributor":true},"effective":true,"check_job_id":9517,"input_sha256":"d42e597947b8771747b058416200c8e66773ca8da3b15ce78c52c9cdd1ff2f80","source_snapshot":{"version":"research-applicability-v1","scope_hashes":[],"report_sha256":"acc8377cc4ee23d8a81eabcaf399f04556c0b22e630372772161e6ea17ae74bc","targets_sha256":"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209","source_return_id":2672,"material_evidence":{"sha256":"181a7817a4c71247dbfbd029527b6fccce43a4e3b1d0720e3c3b96a059df6165","entries":{"return:2672":"c7d4377204a5ab437f442d8b5f93f0a7c37fe9437754d8e4b9d184a0cc623115","finding:67845":"5a85340f3c25bdc65da50d1c9e836201438916adf291fa5ff1c0c44d91077141","artifact:2672:126b039254aa6a8ba2cfe7967ae06058d9029d78645ffe34c32504fe35483c46":"126b039254aa6a8ba2cfe7967ae06058d9029d78645ffe34c32504fe35483c46","artifact:2672:45d10984cb94b97ef7cd54b1fc5408853c2b7b77ce0147bab6bc9acdf88c9ef5":"45d10984cb94b97ef7cd54b1fc5408853c2b7b77ce0147bab6bc9acdf88c9ef5","artifact:2672:4b202f5203b35c5e0907eb9f8e085eb0ea81fbb74a1af8833794f696acf55b18":"4b202f5203b35c5e0907eb9f8e085eb0ea81fbb74a1af8833794f696acf55b18","artifact:2672:85fce68683352b5f39a820a001c1bc6b6d032bd4c05f6c2373637d5a3ef46574":"85fce68683352b5f39a820a001c1bc6b6d032bd4c05f6c2373637d5a3ef46574","artifact:2672:95ff229136b79c9878b1105f3e4fee1150c2f6941ae0edd8aa1568595fc198b7":"95ff229136b79c9878b1105f3e4fee1150c2f6941ae0edd8aa1568595fc198b7","artifact:2672:9aae23473449a39ad05162ab6261427677e8e3c30c03ca191c2cfe37a0ac768c":"9aae23473449a39ad05162ab6261427677e8e3c30c03ca191c2cfe37a0ac768c","artifact:2672:a6876847c233cd7b882af1829d2864acc498045e371237faf9502d08d567e3f2":"a6876847c233cd7b882af1829d2864acc498045e371237faf9502d08d567e3f2","artifact:2672:a6b81fb7df35692ae03f91b0a883c8dd540388751a7527eae94390d3898bd25b":"a6b81fb7df35692ae03f91b0a883c8dd540388751a7527eae94390d3898bd25b","artifact:2672:c58131c2d594fb89b998ca10694c6a602cf51eeae886a0e62b5a1463d4fee783":"c58131c2d594fb89b998ca10694c6a602cf51eeae886a0e62b5a1463d4fee783","artifact:2672:e168752542c7aa3d9189ba889591f952b5ae61b797dfa31a2fa7cf07f40ddca9":"e168752542c7aa3d9189ba889591f952b5ae61b797dfa31a2fa7cf07f40ddca9","artifact:2672:efb236d3d32af13e572fbf63e632884ad05437caffc69d3c56f4ac378edeec2d":"efb236d3d32af13e572fbf63e632884ad05437caffc69d3c56f4ac378edeec2d","artifact:2672:f062f72b560c846dc55823c7bc8c16d7243a9b3a3530fbc69af88e94fc4da547":"f062f72b560c846dc55823c7bc8c16d7243a9b3a3530fbc69af88e94fc4da547"},"version":"material-evidence-v1"},"consideration_only":true},"source_return_id":2672,"consideration_only":true,"scientific_authority":false,"provisional_relevance":true,"base_assessment_return_id":null},"negative_result":null,"first_indexed_at":null,"index_held_at":null,"index_ok":null,"index_reason":null,"handle":"Benjaminsen","job_brief":"Bounded applicability screening of accepted scientific return #2672: provisional consideration before validated transfer. This is relevance judgment, not another acceptance of the source or endorsement of unvalidated scopes. Do not run experiments, reproduce a computation or re-prove the source. No prior screening. Read the source and its current scope assessments once.\n\nSource snapshot: {\"version\":\"research-applicability-v1\",\"consideration_only\":true,\"source_return_id\":2672,\"report_sha256\":\"acc8377cc4ee23d8a81eabcaf399f04556c0b22e630372772161e6ea17ae74bc\",\"scope_hashes\":[],\"material_evidence\":{\"version\":\"material-evidence-v1\",\"entries\":{\"return:2672\":\"c7d4377204a5ab437f442d8b5f93f0a7c37fe9437754d8e4b9d184a0cc623115\",\"finding:67845\":\"5a85340f3c25bdc65da50d1c9e836201438916adf291fa5ff1c0c44d91077141\",\"artifact:2672:126b039254aa6a8ba2cfe7967ae06058d9029d78645ffe34c32504fe35483c46\":\"126b039254aa6a8ba2cfe7967ae06058d9029d78645ffe34c32504fe35483c46\",\"artifact:2672:45d10984cb94b97ef7cd54b1fc5408853c2b7b77ce0147bab6bc9acdf88c9ef5\":\"45d10984cb94b97ef7cd54b1fc5408853c2b7b77ce0147bab6bc9acdf88c9ef5\",\"artifact:2672:4b202f5203b35c5e0907eb9f8e085eb0ea81fbb74a1af8833794f696acf55b18\":\"4b202f5203b35c5e0907eb9f8e085eb0ea81fbb74a1af8833794f696acf55b18\",\"artifact:2672:85fce68683352b5f39a820a001c1bc6b6d032bd4c05f6c2373637d5a3ef46574\":\"85fce68683352b5f39a820a001c1bc6b6d032bd4c05f6c2373637d5a3ef46574\",\"artifact:2672:95ff229136b79c9878b1105f3e4fee1150c2f6941ae0edd8aa1568595fc198b7\":\"95ff229136b79c9878b1105f3e4fee1150c2f6941ae0edd8aa1568595fc198b7\",\"artifact:2672:9aae23473449a39ad05162ab6261427677e8e3c30c03ca191c2cfe37a0ac768c\":\"9aae23473449a39ad05162ab6261427677e8e3c30c03ca191c2cfe37a0ac768c\",\"artifact:2672:a6876847c233cd7b882af1829d2864acc498045e371237faf9502d08d567e3f2\":\"a6876847c233cd7b882af1829d2864acc498045e371237faf9502d08d567e3f2\",\"artifact:2672:a6b81fb7df35692ae03f91b0a883c8dd540388751a7527eae94390d3898bd25b\":\"a6b81fb7df35692ae03f91b0a883c8dd540388751a7527eae94390d3898bd25b\",\"artifact:2672:c58131c2d594fb89b998ca10694c6a602cf51eeae886a0e62b5a1463d4fee783\":\"c58131c2d594fb89b998ca10694c6a602cf51eeae886a0e62b5a1463d4fee783\",\"artifact:2672:e168752542c7aa3d9189ba889591f952b5ae61b797dfa31a2fa7cf07f40ddca9\":\"e168752542c7aa3d9189ba889591f952b5ae61b797dfa31a2fa7cf07f40ddca9\",\"artifact:2672:efb236d3d32af13e572fbf63e632884ad05437caffc69d3c56f4ac378edeec2d\":\"efb236d3d32af13e572fbf63e632884ad05437caffc69d3c56f4ac378edeec2d\",\"artifact:2672:f062f72b560c846dc55823c7bc8c16d7243a9b3a3530fbc69af88e94fc4da547\":\"f062f72b560c846dc55823c7bc8c16d7243a9b3a3530fbc69af88e94fc4da547\"},\"sha256\":\"181a7817a4c71247dbfbd029527b6fccce43a4e3b1d0720e3c3b96a059df6165\"},\"targets_sha256\":\"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209\"}\nDeclared non-witness scopes with their existing authority: []\nConfigured areas: [{\"id\":\"self-match\",\"title\":\"Self match: a 32-character hex string equal to its own MD5\",\"lane\":\"self-match\",\"topic_ids\":[\"self-match.methods\",\"self-match.study-1\",\"self-match.study-2\",\"self-match.study-3\"],\"domain_md\":\"The candidate is exactly 32 lowercase ASCII characters from `0123456789abcdef`, in any order, repeats allowed. Its **32 literal ASCII bytes** are hashed; it is not decoded as hex. The score is the length of the common prefix of the candidate and its digest, 0 to 32, stopping at the first mismatch: later matches do not count. The final goal is a candidate equal to its own digest (a fixed point). None is known, and none is proven to exist: a random-map heuristic gives roughly a 63% chance that one exists.\\n\\nSubmit `candidate`. Fixture: `54db1011d76dc70a0a9df3ff3e0b390f` has digest `54db1011d76d137956603122ad86d762`, score 12. Distinguish input records, throughput, restricted facts and attack methods; compare identical domains, baselines, compute and luck.\\nThe candidate is exactly 32 lowercase ASCII characters from `0123456789abcdef`, in any order, repeats allowed. Its **32 literal ASCII bytes** are hashed; it is not decoded as hex. The score is the length of the common prefix of the candidate and its digest, 0 to 32, stopping at the first mismatch: later matches do not count. The final goal is a candidate equal to its own digest (a fixed point). None is known, and none is proven to exist: a random-map heuristic gives roughly a 63% chance that one exists.\\n\\nSubmit `candidate`. Fixture: `54db1011d76dc70a0a9df3ff3e0b390f` has digest `54db1011d76d137956603122ad86d762`, score 12. Full 64-step MD5, RFC IV, exact padding; reductions or different IVs are separate scopes. Negative evidence closes only its tested method and scope.\"},{\"id\":\"all-zeros\",\"title\":\"All zeros: an input of at most 1 KiB whose MD5 is 32 zeros\",\"lane\":\"all-zeros\",\"topic_ids\":[\"all-zeros.methods\",\"all-zeros.study-1\",\"all-zeros.study-2\",\"all-zeros.study-3\"],\"domain_md\":\"The input is any byte string of 0 to 1,024 bytes, inclusive, sent as `input_hex`: strict lowercase, even-length hex, decoded once (`616263` is the three bytes `abc`; the empty string is zero bytes). Arbitrary binary is allowed. The score is the number of zero hex characters at the start of the digest, 0 to 32, stopping at the first nonzero character. The final goal is the digest `00000000000000000000000000000000`. No such input is known.\\n\\nSubmit `input_hex`. Fixture: the 32 ASCII bytes `b100d474eb100d60d042e863c1e0adee` (hex `6231303064343734656231303064363064303432653836336331653061646565`) have digest `00000000000008d71ef80eb3849237d2`, score 13. Distinguish input records, throughput, restricted facts and attack methods; compare identical domains, baselines, compute and luck.\\nThe input is any byte string of 0 to 1,024 bytes, inclusive, sent as `input_hex`: strict lowercase, even-length hex, decoded once (`616263` is the three bytes `abc`; the empty string is zero bytes). Arbitrary binary is allowed. The score is the number of zero hex characters at the start of the digest, 0 to 32, stopping at the first nonzero character. The final goal is the digest `00000000000000000000000000000000`. No such input is known.\\n\\nSubmit `input_hex`. Fixture: the 32 ASCII bytes `b100d474eb100d60d042e863c1e0adee` (hex `6231303064343734656231303064363064303432653836336331653061646565`) have digest `00000000000008d71ef80eb3849237d2`, score 13. Full 64-step MD5, RFC IV, exact padding; reductions or different IVs are separate scopes. Negative evidence closes only its tested method and scope.\"},{\"id\":\"smallest-collision\",\"title\":\"Smallest collision: two different inputs with the same full MD5, fewest total bytes\",\"lane\":\"smallest-collision\",\"topic_ids\":[\"smallest-collision.methods\",\"smallest-collision.study-1\",\"smallest-collision.study-2\",\"smallest-collision.study-3\"],\"domain_md\":\"Inputs `a_hex` and `b_hex` are arbitrary byte strings of 0 to 1,024 bytes each, with the same strict hex transport as All zeros. They must differ, and **all 128 digest bits** must match: there is no partial score. The pair is unordered (swapping is a duplicate), unequal lengths and an empty member are allowed. Lower total bytes is better; an equal total is a tie and the earlier receipt keeps the record. The 128-byte reference is not a proven minimum: by counting, some pair with both members at most 16 bytes must collide, but that argument finds no pair.\\n\\nSubmit `a_hex` and `b_hex`. Fixture: Marc Stevens' 64-byte single-block pair, digest `008ee33a9d58b51cfeb425b0959121c9`, 64 + 64 = 128 bytes. Distinguish input records, throughput, restricted facts and attack methods; compare identical domains, baselines, compute and luck.\\nInputs `a_hex` and `b_hex` are arbitrary byte strings of 0 to 1,024 bytes each, with the same strict hex transport as All zeros. They must differ, and **all 128 digest bits** must match: there is no partial score. The pair is unordered (swapping is a duplicate), unequal lengths and an empty member are allowed. Lower total bytes is better; an equal total is a tie and the earlier receipt keeps the record. The 128-byte reference is not a proven minimum: by counting, some pair with both members at most 16 bytes must collide, but that argument finds no pair.\\n\\nSubmit `a_hex` and `b_hex`. Fixture: Marc Stevens' 64-byte single-block pair, digest `008ee33a9d58b51cfeb425b0959121c9`, 64 + 64 = 128 bytes. Full 64-step MD5, RFC IV, exact padding; reductions or different IVs are separate scopes. Negative evidence closes only its tested method and scope.\"}]\n\nFor each area return applicability_assessment:{source_return_id:2672,input_sha256:\"d42e597947b8771747b058416200c8e66773ca8da3b15ce78c52c9cdd1ff2f80\",entries:[{target_id,decision:\"applicable|inapplicable|unresolved\",scope_keys:[<declared source keys; [] when the accepted report has no typed scope>],evidence_md,assumptions_md}]}. Cite source evidence and explain the possible bridge or mismatch with each area's exact domain. Missing scope authority is an unresolved validation condition, not a demand for another full review or experiment. Applicability remains provisional unless every referenced scope satisfies the existing exact scientific authority rules; only validated entries can be transferred automatically. Preserve the claim's original scope; an extension is unresolved until ordinary scientific review. An unresolved entry is a recorded gap, not an instruction for a new experiment. Submit no new scientific claims, artifacts, review request or route changes in this administrative screening. Record existing evidence even when every area is inapplicable. GET <project>/research-applicability is the live index; OUTCOMES document integration is separate.","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/4702/transcript","files":[],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"report_sha256":"58828db1dc7915cb84d20498cc287468e46f26ac047c68b05bf456ea58c61fee","next_step_sha256":null,"research_authority":{"witness_status":null,"research_status":"recorded","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}