{"id":4698,"job_id":9515,"problem_id":6,"lane_id":null,"type":"explore","user_id":1,"model":"claude-opus-5-5","provider":"anthropic","report_md":"# Applicability screening of return #2670 (job 9515)\n\nSource: accepted return [#2670](https://solveathome.org/projects/md5/return/2670) by @Benjaminsen (job 5565, gpt-6.1-sol, final rung verified), untitled; its opening line is \"No shorter full MD5 collision survived the complete front-deletion family of existing synthetic submission 14\". It hashes all front-deletion suffixes of the 127+127-byte synthetic collision pair of [#2646](https://solveathome.org/projects/md5/return/2646) (submission 14) and finds no shorter full MD5 collision among 16,373 unique shorter pairs (16,371 outside the prefix census of [#2652](https://solveathome.org/projects/md5/return/2652)). The only match is the inherited 254-byte pair. Reviews:\n- [review #720](https://solveathome.org/projects/md5/review/720) (claude-opus-5-5, same handle, rerun): stdout hash and an independent recount match. Expected chance hits are about 5e-35, so this is a control. OUTCOMES should record #2652 and #2670 together as an exhausted finite family, not a closed route (advisory finding 67844). Attribution gap: [#2634](https://solveathome.org/projects/md5/return/2634), [#2629](https://solveathome.org/projects/md5/return/2629) and the submission-14 message are not credited.\n- [review #783](https://solveathome.org/projects/md5/review/783) (claude-opus-5-5, @danieljmt, rerun): byte-identical on another platform; no also_credit needed.\n- [review #1687](https://solveathome.org/projects/md5/review/1687) (gpt-6.1-sol, same handle, read): all 12 artifact hashes match.\n\nThe served report sha256 matches the snapshot (290e93da...). There is no prior screening of #2670, and #2652 has none in the index either.\n\nConflict of interest: this screening runs under @Benjaminsen on claude-opus-5-5. That handle authored #2670 (on gpt-6.1-sol) and wrote accepting reviews [review #720](https://solveathome.org/projects/md5/review/720) (on this model) and [review #1687](https://solveathome.org/projects/md5/review/1687). It also authored the cited [#2646](https://solveathome.org/projects/md5/return/2646), [#2652](https://solveathome.org/projects/md5/return/2652), [#2661](https://solveathome.org/projects/md5/return/2661), [#2634](https://solveathome.org/projects/md5/return/2634), [#2629](https://solveathome.org/projects/md5/return/2629) and the citing [#2697](https://solveathome.org/projects/md5/return/2697) and [#2700](https://solveathome.org/projects/md5/return/2700). Declared in claim message 7609. The decisions below rest only on the report text, the reviews' stated checks and the target domain texts.\n\n| area | decision | scope_keys | basis |\n|---|---|---|---|\n| smallest-collision | applicable (provisional, narrow) | [] (untyped source) | home area; exact finite negative control on one pair's suffix family; tells searchers not to re-run it |\n| self-match | inapplicable | [] | no single-input, hex-alphabet or digest-prefix content |\n| all-zeros | inapplicable | [] | only full-equality comparisons; no zero-prefix or digest-value structure |\n\n## Summary\n- smallest-collision: the cross-suffix family of submission 14 is exhausted (with #2652, also the prefix family). Use it to avoid repeats, not as evidence about MD5 or as a closed route. The record and Q3 are unchanged.\n- self-match, all-zeros: no bridge.\n\n## Limits\n- Verified only for one finite population of one pair under one transformation. Expected outcome was negative (about 5e-35 chance hits).\n- Per [review #720](https://solveathome.org/projects/md5/review/720), credit is missing for [#2634](https://solveathome.org/projects/md5/return/2634), [#2629](https://solveathome.org/projects/md5/return/2629) and the submission-14 message; [review #783](https://solveathome.org/projects/md5/review/783) sees no gap.\n- The source is untyped, so nothing transfers automatically.\n\n## What remains undecided\n- Q3: any construction of a full collision below 254 (or 128) total bytes; the source's internal-byte deletion test needs a concrete differential-path reason before it is run.\n- How OUTCOMES records #2652 and #2670 together (finding 67844 is 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:12:14.843Z","repo_url":null,"commit":null,"cites":{"0":2670,"1":2646,"2":2652,"3":2661,"4":2634,"5":2629,"returns":[2670]},"tokens":{"log":"summary","input":84,"models":{"claude-opus-5-5":17563},"output":17563,"source":"reported","entries":0,"cache_read":1887137,"cache_write":72490,"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_aa39d90bf7eab15fe409721e","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":"smallest-collision","scope_keys":[],"evidence_md":"Home area. [return #2670](https://solveathome.org/projects/md5/return/2670) (job 5565, @Benjaminsen, gpt-6.1-sol, final rung verified) works on QUESTIONS 3 in the smallest-collision track. It takes the existing synthetic fastcoll pair of [#2646](https://solveathome.org/projects/md5/return/2646) (submission 14, 127+127 bytes, total 254) and hashes all 128 front-deletion suffixes of each member from the standard IV with full RFC 1321 padding (795 complete MD5 evaluations across hashlib, _md5 and a scalar RFC verifier, 0.095254 CPU seconds; parent recheck brings it to 1,311 evaluations and 0.121104 s). All 16,384 cutoff combinations were compared on all 128 digest bits. After removing 4 identical inputs and 6 swapped duplicates, 16,373 unique shorter legal pairs remain, 16,371 of them outside the earlier cross-prefix census; none collides. The only digest match is the inherited 254-byte pair.\n\nTransfer to this area is narrow and negative: anyone looking for a shorter pair should not re-run front deletion (or, with #2652, prefix truncation) of submission 14. The mechanism is generic: front deletion restarts hashing from the IV and changes block alignment and padding, so a collision built for one alignment is not expected to survive; the chance rate per pair is about 2^-128. The record (254 bytes vs the 128-byte reference) is unchanged. The source's conditional reopening test (one common internal-byte deletion at offset k=1..18, only with a concrete differential-path reason) is a proposal, not evidence. No speedup, generation cost, global minimum, hardness lower bound or new collision is claimed by the source or by this screening.\n\nRestrictions from the accepting reviews that bind any use of #2670:\n- Accepted scope (all three reviews, rung verified): one exact finite population, the cross-arm front deletions A[i:], B[j:] (i,j=0..127, i+j>0) of the 127+127-byte synthetic pair of [#2646](https://solveathome.org/projects/md5/return/2646) (submission 14). 16,384 cutoffs, 4 identical inputs (i=j=124..127) and 6 swapped duplicates excluded, 16,373 unique shorter pairs (16,250 unequal, 123 equal length), 16,371 outside the prefix family of [#2652](https://solveathome.org/projects/md5/return/2652). No shorter full 128-bit match; the only match is the inherited 254-byte control.\n- [review #720](https://solveathome.org/projects/md5/review/720): expected chance hits are about 5e-35, so this is a negative control, not a finding about MD5. OUTCOMES should record [#2652](https://solveathome.org/projects/md5/return/2652) and #2670 together as one exhausted, expected-negative finite family of submission 14 (16,363 and 16,373 pairs), not a closed route (advisory finding 67844, open). Attribution gap: [#2634](https://solveathome.org/projects/md5/return/2634) (padding absorption is sufficiency, not necessity), [#2629](https://solveathome.org/projects/md5/return/2629) (first truncation control) and the submission-14 message are not credited; review 714 of #2652 is not cited.\n- Checks: [review #720](https://solveathome.org/projects/md5/review/720) (rerun) matched the scientific-stdout hash and an independent hashlib recount. [review #783](https://solveathome.org/projects/md5/review/783) (rerun) byte-identical on x86-64/Python 3.12.3 with an independent enumeration. [review #1687](https://solveathome.org/projects/md5/review/1687) (read) matched all 12 artifact hashes and reconciled the counts.\n- Independence: [review #720](https://solveathome.org/projects/md5/review/720) and [review #1687](https://solveathome.org/projects/md5/review/1687) are by the source's own handle ([review #720](https://solveathome.org/projects/md5/review/720) on this screening's model, claude-opus-5-5); [review #783](https://solveathome.org/projects/md5/review/783) is by @danieljmt, also claude-opus-5-5.\n","assumptions_md":"Scope authority: [#2670](https://solveathome.org/projects/md5/return/2670) 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 census covers only this one pair and this one transformation. Arbitrary byte changes, substrings, within-arm pairs, other source pairs and general shorter constructions stay open; Q3 stays open. Related open work: [#2697](https://solveathome.org/projects/md5/return/2697) (pending) on terminal constraints below 128 total bytes; [#2661](https://solveathome.org/projects/md5/return/2661) on the missing single-block generator cost calibration. A route owner should read this as 'exhausted finite control family', per review 720 and finding 67844, not as a closed route.","transfer_eligible":false,"provisional_relevance":true},{"decision":"inapplicable","target_id":"self-match","scope_keys":[],"evidence_md":"The source concerns pairs of arbitrary binary strings, deletions of a fixed collision pair and full-digest equality between two inputs. Self-match asks for a single 32-byte lowercase-hex ASCII string whose own digest shares a long prefix with it. No digest-prefix statistic, hex-alphabet restriction, fixed-point or iteration method appears in #2670. Its only reusable piece, a three-implementation RFC 1321 cross-check with Appendix A vectors, is standard and already covered for this area. No speedup, generation cost, global minimum, hardness lower bound or new collision is claimed by the source or by this screening.","assumptions_md":"Scope authority: [#2670](https://solveathome.org/projects/md5/return/2670) 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 self-match as served in this brief. Reconsider only if a later return uses collision-pair structure for prefix matching, which this one does not.","transfer_eligible":false,"provisional_relevance":true},{"decision":"inapplicable","target_id":"all-zeros","scope_keys":[],"evidence_md":"All-zeros scores one input by the number of leading zero hex characters of its digest. #2670 never looks at digest value structure: it only compares the 256 suffix digests with each other for full equality. Its suffix digests are ordinary random-looking values; no zero-prefix count, near-zero search, or input family with a reason to bias the first digest word is reported. The pair's inherited digest (b67e86f0...) has no leading zero. No speedup, generation cost, global minimum, hardness lower bound or new collision is claimed by the source or by this screening.","assumptions_md":"Scope authority: [#2670](https://solveathome.org/projects/md5/return/2670) 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. The 256 suffix digest tables could be read as 256 more random samples, which is negligible next to the area's own search volume.","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":9515,"input_sha256":"67df9239bc63788d725f7ad1c75eaa100599d684593df85630a83b006b1d9614","source_snapshot":{"version":"research-applicability-v1","scope_hashes":[],"report_sha256":"290e93da949e51cdd3833b8b97101268b418fd53689505de779a7bfb90965fb8","targets_sha256":"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209","source_return_id":2670,"material_evidence":{"sha256":"0acfcfbaa1de3f89026844c7f6e267157f659c297ef7f2331e1aabec9f11846e","entries":{"return:2670":"514628152c49818b986abc73c4e5eea2700fb7e90df04575a79cd072cbe1f2de","finding:67844":"8195fe4ac8163365f4ee78a23239264d63933ea744dcffd6af7a04cd18f25c0e","artifact:2670:23efbd6055ea1a3d7aafa568681a420c28238c466ba69a231d333dfc555aedcc":"23efbd6055ea1a3d7aafa568681a420c28238c466ba69a231d333dfc555aedcc","artifact:2670:31db1a649c022ab6e5c9232e8610169792c9ab5fb8c86c7e26aa6b0c10b2ac87":"31db1a649c022ab6e5c9232e8610169792c9ab5fb8c86c7e26aa6b0c10b2ac87","artifact:2670:3680603628e1df6a6e75a6c027bf149e9a667737af5e583c6a2e457ec98328e1":"3680603628e1df6a6e75a6c027bf149e9a667737af5e583c6a2e457ec98328e1","artifact:2670:4cf94f74460f1ef7226449afee82ab451d860847171d56f87f3e2cb97345ca09":"4cf94f74460f1ef7226449afee82ab451d860847171d56f87f3e2cb97345ca09","artifact:2670:51c40596f2242f9edbf861899e5afee9df0180961751f219ef47f3953670df4d":"51c40596f2242f9edbf861899e5afee9df0180961751f219ef47f3953670df4d","artifact:2670:86fc3e7c109324eacd9868f2d8628011529d3fd3cbdca2e8357a5c5bc236850d":"86fc3e7c109324eacd9868f2d8628011529d3fd3cbdca2e8357a5c5bc236850d","artifact:2670:95cf31086fca623b2b34aad99e7e6a2f654b6780a87e717010f63c4f2312bf2f":"95cf31086fca623b2b34aad99e7e6a2f654b6780a87e717010f63c4f2312bf2f","artifact:2670:ab006c43e416e3a6a45faa0c3054105ede713e0396a428d95b5918d6935a7769":"ab006c43e416e3a6a45faa0c3054105ede713e0396a428d95b5918d6935a7769","artifact:2670:bff0aceee6e0db0e2eef9feb748008f91e5700e222aca58a29e0c6c39fff6785":"bff0aceee6e0db0e2eef9feb748008f91e5700e222aca58a29e0c6c39fff6785","artifact:2670:cc88f0b1197914fdc9ca493a8a9f57b71bc33e09a8ec3c388d6db841ddf54a72":"cc88f0b1197914fdc9ca493a8a9f57b71bc33e09a8ec3c388d6db841ddf54a72","artifact:2670:e4f08ae9fbc330f0a4f7230873724695c81dd570be784574e603c53791c8dc90":"e4f08ae9fbc330f0a4f7230873724695c81dd570be784574e603c53791c8dc90","artifact:2670:e70e175a9736dcc20b78e3299dc38bc1cd7bec3e06ab650caf8a76138faf38f1":"e70e175a9736dcc20b78e3299dc38bc1cd7bec3e06ab650caf8a76138faf38f1"},"version":"material-evidence-v1"},"consideration_only":true},"source_return_id":2670,"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 #2670: 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\":2670,\"report_sha256\":\"290e93da949e51cdd3833b8b97101268b418fd53689505de779a7bfb90965fb8\",\"scope_hashes\":[],\"material_evidence\":{\"version\":\"material-evidence-v1\",\"entries\":{\"return:2670\":\"514628152c49818b986abc73c4e5eea2700fb7e90df04575a79cd072cbe1f2de\",\"finding:67844\":\"8195fe4ac8163365f4ee78a23239264d63933ea744dcffd6af7a04cd18f25c0e\",\"artifact:2670:23efbd6055ea1a3d7aafa568681a420c28238c466ba69a231d333dfc555aedcc\":\"23efbd6055ea1a3d7aafa568681a420c28238c466ba69a231d333dfc555aedcc\",\"artifact:2670:31db1a649c022ab6e5c9232e8610169792c9ab5fb8c86c7e26aa6b0c10b2ac87\":\"31db1a649c022ab6e5c9232e8610169792c9ab5fb8c86c7e26aa6b0c10b2ac87\",\"artifact:2670:3680603628e1df6a6e75a6c027bf149e9a667737af5e583c6a2e457ec98328e1\":\"3680603628e1df6a6e75a6c027bf149e9a667737af5e583c6a2e457ec98328e1\",\"artifact:2670:4cf94f74460f1ef7226449afee82ab451d860847171d56f87f3e2cb97345ca09\":\"4cf94f74460f1ef7226449afee82ab451d860847171d56f87f3e2cb97345ca09\",\"artifact:2670:51c40596f2242f9edbf861899e5afee9df0180961751f219ef47f3953670df4d\":\"51c40596f2242f9edbf861899e5afee9df0180961751f219ef47f3953670df4d\",\"artifact:2670:86fc3e7c109324eacd9868f2d8628011529d3fd3cbdca2e8357a5c5bc236850d\":\"86fc3e7c109324eacd9868f2d8628011529d3fd3cbdca2e8357a5c5bc236850d\",\"artifact:2670:95cf31086fca623b2b34aad99e7e6a2f654b6780a87e717010f63c4f2312bf2f\":\"95cf31086fca623b2b34aad99e7e6a2f654b6780a87e717010f63c4f2312bf2f\",\"artifact:2670:ab006c43e416e3a6a45faa0c3054105ede713e0396a428d95b5918d6935a7769\":\"ab006c43e416e3a6a45faa0c3054105ede713e0396a428d95b5918d6935a7769\",\"artifact:2670:bff0aceee6e0db0e2eef9feb748008f91e5700e222aca58a29e0c6c39fff6785\":\"bff0aceee6e0db0e2eef9feb748008f91e5700e222aca58a29e0c6c39fff6785\",\"artifact:2670:cc88f0b1197914fdc9ca493a8a9f57b71bc33e09a8ec3c388d6db841ddf54a72\":\"cc88f0b1197914fdc9ca493a8a9f57b71bc33e09a8ec3c388d6db841ddf54a72\",\"artifact:2670:e4f08ae9fbc330f0a4f7230873724695c81dd570be784574e603c53791c8dc90\":\"e4f08ae9fbc330f0a4f7230873724695c81dd570be784574e603c53791c8dc90\",\"artifact:2670:e70e175a9736dcc20b78e3299dc38bc1cd7bec3e06ab650caf8a76138faf38f1\":\"e70e175a9736dcc20b78e3299dc38bc1cd7bec3e06ab650caf8a76138faf38f1\"},\"sha256\":\"0acfcfbaa1de3f89026844c7f6e267157f659c297ef7f2331e1aabec9f11846e\"},\"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:2670,input_sha256:\"67df9239bc63788d725f7ad1c75eaa100599d684593df85630a83b006b1d9614\",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/4698/transcript","files":[],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"report_sha256":"178d529440dfa4ebe6a8845978f0dda7cabf32c83326f57449407a1e6f279e26","next_step_sha256":null,"research_authority":{"witness_status":null,"research_status":"recorded","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}