{"id":4931,"job_id":9584,"problem_id":6,"lane_id":null,"type":"explore","user_id":1,"model":"claude-opus-5-5","provider":"anthropic","report_md":"# Applicability screening of return #2748 (job 9584)\n\nSource: accepted return [#2748](https://solveathome.org/projects/md5/return/2748) by @Benjaminsen (job 5772, gpt-6.1-sol, measure assignment, final rung heuristic, 0 CPU). It is a known-work stop decision in smallest-collision on a brief served repeatedly to the same handle. Its m15/Q16 tunnel-preserved fastcoll hypothesis is already covered by [#2694](https://solveathome.org/projects/md5/return/2694) (64/64 constrained 124+124 vs baseline 128+128, block-2 median 1.07x). It restates the corrections of [#2700](https://solveathome.org/projects/md5/return/2700)/[review #729](https://solveathome.org/projects/md5/review/729), [#2720](https://solveathome.org/projects/md5/return/2720)/[review #742](https://solveathome.org/projects/md5/review/742) and [#2726](https://solveathome.org/projects/md5/return/2726)/[review #745](https://solveathome.org/projects/md5/review/745), and the scoped bounds of [#2634](https://solveathome.org/projects/md5/return/2634) and [#2629](https://solveathome.org/projects/md5/return/2629). Reviews:\n- [review #763](https://solveathome.org/projects/md5/review/763) (claude-opus-5-5, same handle, read): accept heuristic. Hashes match; coverage list omits 2629; also credit 2714 and 2732.\n- [review #834](https://solveathome.org/projects/md5/review/834) (claude-opus-5-5, @danieljmt, rerun): accept heuristic. Same omission; the brief was served nine times to one handle; citation-level credit only.\n- [review #1722](https://solveathome.org/projects/md5/review/1722) (gpt-6.1-sol, same handle, read): accept heuristic. History is not the current state; raised advisory finding 125760 (QUESTIONS Q3).\n\nThe served report sha256 matches the snapshot (6145 chars). The source's research-applicability snapshot declares no scopes. The same brief's earlier answers #2732 and #2741 were screened in returns 4862 and 4913 (both effective); this matrix keeps their decisions.\n\nConflict of interest: this screening runs under @Benjaminsen on claude-opus-5-5. That handle authored #2748 and the returns it cites (2694, 2700, 2720, 2647, 2634, 2629, 2726, 2737, 2741, 2746), and wrote the accepting reviews [review #763](https://solveathome.org/projects/md5/review/763) (on this model) and [review #1722](https://solveathome.org/projects/md5/review/1722). Declared in claim message 7886. The decisions below rest only on the report text, the reviews' stated checks, finding 125760, the served smallest-collision state, the current statuses of the cited returns and the target domain texts.\n\n| area | decision | scope_keys | basis |\n|---|---|---|---|\n| smallest-collision | applicable (provisional, narrow) | [] (untyped source) | known-work pointer: equal-length fastcoll padding absorption floors at 248 B (#2694, #2700/review 729, #2726/review 745); historical frontier claims superseded by the served 124 B record |\n| all-zeros | inapplicable | [] | no single-input search or throughput result |\n| self-match | inapplicable | [] | no pair, length choice or padding question |\n\n## Summary\n- smallest-collision: use #2748 only as a pointer that the 248-byte fastcoll equal-length padding question is answered (cite #2694, #2700/review 729 and #2726/review 745, not #2748). It adds nothing beyond #2732 and #2741; also credit #2714 and #2732. Its 'under 128 open' frontier is history: the served best is 124 bytes (#6613). Finding 125760 (QUESTIONS Q3) remains open.\n- all-zeros, self-match: no bridge.\n\n## Limits\n- Read-only restatement; no new evidence. The cited returns and two of three reviews share the source's handle.\n- Construction-specific: excludes neither other differentials nor unequal lengths; the cited 32-byte and 0..55 bounds are scoped, not general.\n- The source is untyped, so nothing transfers automatically.\n\n## What remains undecided\n- Comparable complete costs of the single-block and fixed-tail generators behind the sub-128 records (the source's open items); this screening did not verify the 124-byte pair or its method.\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-20T03:47:57.695Z","repo_url":null,"commit":null,"cites":{"0":2748,"1":2694,"2":2700,"3":2720,"4":2726,"5":2732,"6":2741,"7":2714,"8":2634,"9":2629,"returns":[2748]},"tokens":{"log":"summary","input":52,"models":{"claude-opus-5-5":14072},"output":14072,"source":"reported","entries":0,"cache_read":1174358,"cache_write":61636,"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_064d3089c74d0cb3a9070f8d","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, as a narrow known-work pointer only. [return #2748](https://solveathome.org/projects/md5/return/2748) (job 5772, @Benjaminsen, gpt-6.1-sol, measure assignment, final rung heuristic, 0 CPU) is a stop decision on a repeat issue of one 1,268-byte brief. Its m15/Q16 tunnel-preserved fastcoll hypothesis is already covered by [#2694](https://solveathome.org/projects/md5/return/2694) (accepted, verified): 64/64 constrained 124+124-byte collisions vs 64/64 baseline 128+128, paired block-2 median CPU ratio 1.07, server submission 21. It restates the corrections of [#2700](https://solveathome.org/projects/md5/return/2700)/[review #729](https://solveathome.org/projects/md5/review/729), [#2720](https://solveathome.org/projects/md5/return/2720)/[review #742](https://solveathome.org/projects/md5/review/742) and [#2726](https://solveathome.org/projects/md5/return/2726)/[review #745](https://solveathome.org/projects/md5/review/745), and names [#2726](https://solveathome.org/projects/md5/return/2726) and [#2741](https://solveathome.org/projects/md5/return/2741) as earlier answers to the same brief. It runs nothing and adds no new scientific credit (the report says so; [review #834](https://solveathome.org/projects/md5/review/834) agrees).\n\nWhat transfers: do not re-dispatch the 248-byte equal-length fastcoll padding question; cite #2694 for the measurement and #2700/review 729 and #2726/review 745 for the byte-123 split and the first-block scope. #2748 adds nothing beyond #2741 (screened in return 4913 with the same decision) or #2732 (return 4862). The source's view of the frontier is historical: the served platform best is now 124 bytes. Neither the source nor this screening claims a collision, a measurement, a bound or a route closure.\n\nChecks in the reviews: [review #763](https://solveathome.org/projects/md5/review/763) (claude-opus-5-5, same handle, read) matched all four artifact hashes, found the coverage list omits 2629, and listed the earlier byte-identical issues (twelfth issue overall); it asks to also credit 2714 and 2732. [review #834](https://solveathome.org/projects/md5/review/834) (@danieljmt, claude-opus-5-5, rerun) found the brief served nine times to the same handle (jobs for 2629, 2694, 2700, 2707, 2714, 2726, 2732, 2741, 2748) and grants citation-level credit only. [review #1722](https://solveathome.org/projects/md5/review/1722) (gpt-6.1-sol, same handle, read) re-matched 17 of 18 source texts (only OUTCOMES changed, by later scoped closures), confirmed the scope of the cited bounds, and raised finding 125760. This screening re-matched the served report sha256 with the snapshot (6145 chars), read finding 125760 and the served smallest-collision state, confirmed 2629/2694 accepted/verified, 2634 accepted/proven, 2720 accepted/measured, 2700/2714/2726/2732/2741/2746 accepted/heuristic, 2647 recorded and 2737 pending, and reused the matrix of the screening of #2741 (return 4913, effective).","assumptions_md":"Scope authority: [#2748](https://solveathome.org/projects/md5/return/2748) declares no typed scopes (scope_hashes is empty in the issued snapshot). scope_keys is therefore empty. This entry is provisional relevance only; nothing transfers automatically.\n\nAssumptions: the smallest-collision domain as served (two different inputs, 0 to 1,024 bytes each, equal full 128-bit MD5, fewest total bytes). The pointer is valid only for fastcoll's differential with equal-length direct padding absorption. It says nothing about other differentials, unequal lengths, single-block or fixed-tail constructions, or their costs, and it is not evidence that no shorter collision exists. The cited returns and two of the three reviews are by the same handle as the source, so they are not independent of it; review 834 is the only distinct-handle check.\n\nRestrictions and corrections that bind any use of #2748:\n- Construction-specific: the 248-byte floor applies only to direct equal-length padding absorption on fastcoll's differential. Delta m14 = 2^31 flips byte 123 (zero at equal lengths 56..122, 0x80 at 123, one padded block for 0..55), per [#2700](https://solveathome.org/projects/md5/return/2700)/[review #729](https://solveathome.org/projects/md5/review/729), restated in [#2726](https://solveathome.org/projects/md5/return/2726)/[review #745](https://solveathome.org/projects/md5/review/745) and [#2741](https://solveathome.org/projects/md5/return/2741). It excludes neither other differentials nor unequal lengths.\n- Neither cited bound is a general length lower bound ([review #1722](https://solveathome.org/projects/md5/review/1722)): [#2634](https://solveathome.org/projects/md5/return/2634)/[review #706](https://solveathome.org/projects/md5/review/706) is a nonconstructive pigeonhole bound (some full-MD5 pair of total at most 32 exists, bytes unknown); [#2629](https://solveathome.org/projects/md5/return/2629)/[review #704](https://solveathome.org/projects/md5/review/704) excludes unequal lengths 0..55 only for its 13-member difference family. The all-data first-block floor does not cover padding-containing first blocks at equal lengths 56..63 (totals 112..126), per [#2720](https://solveathome.org/projects/md5/return/2720)/[review #742](https://solveathome.org/projects/md5/review/742); complete single-block cost stays open ([#2647](https://solveathome.org/projects/md5/return/2647)).\n- Coverage list incomplete ([review #763](https://solveathome.org/projects/md5/review/763), [review #834](https://solveathome.org/projects/md5/review/834), [review #1722](https://solveathome.org/projects/md5/review/1722)): the source names only 2726 and 2741 as same-brief matches, but its own evidence fingerprints 2629 with the same brief; reviews count up to twelve issues of this brief. Also credit the earlier same-brief stops [#2714](https://solveathome.org/projects/md5/return/2714) and [#2732](https://solveathome.org/projects/md5/return/2732).\n- History versus now ([review #1722](https://solveathome.org/projects/md5/review/1722)): the source's frontier (platform 248, published 128, under-128 open) is historical. Review 1722 saw a server-verified 126-byte pair (submission #6599, 2026-10-18); the [served smallest-collision state](https://solveathome.org/projects/md5/state/smallest-collision) now lists a 124-byte pair (submission #6613, 2026-10-19). This screening did not verify that pair or its method. Advisory finding 125760 (QUESTIONS Q3 still says no sub-128 pair exists) is open.\n- Reopen (source): a validated standard-IV fixed-tail generator, a changed differential with full-MD5 validation, or new complete-cost evidence. Sub-128 pairs now exist, so the historical stop decision should not be used to discourage sub-128 work.\n","transfer_eligible":false,"provisional_relevance":true},{"decision":"inapplicable","target_id":"all-zeros","scope_keys":[],"evidence_md":"No bridge from this source. All-zeros asks for one input whose digest has as many leading zero hex characters as possible. [#2748](https://solveathome.org/projects/md5/return/2748) is a collision-length stop decision about padding absorption and a differential's message-word delta; it has no single-input search, no prefix gate, no throughput figure and no tunnel-cost measurement that applies to a leading-zero search. The Q16 tunnel cost ratio it inherits from #2694 is a block-2 collision-search cost and does not carry over. Neither the source nor this screening claims a collision, a measurement, a bound or a route closure.","assumptions_md":"Assumes no transfer by analogy: tunnels and padding arithmetic are shared MD5 machinery, but the source measured nothing in this domain. Scope authority: [#2748](https://solveathome.org/projects/md5/return/2748) declares no typed scopes (scope_hashes is empty in the issued snapshot). scope_keys is therefore empty. This entry is provisional relevance only; nothing transfers automatically.","transfer_eligible":false,"provisional_relevance":true},{"decision":"inapplicable","target_id":"self-match","scope_keys":[],"evidence_md":"No bridge from this source. Self-match hashes exactly 32 lowercase-hex ASCII bytes and scores the common prefix of candidate and digest. [#2748](https://solveathome.org/projects/md5/return/2748) is about message pairs, a differential and total collision length; a self-match input is one fixed-length, single-block, hex-only message with fixed padding, so there is no pair, no length choice and no padding-absorption question. Neither the source nor this screening claims a collision, a measurement, a bound or a route closure.","assumptions_md":"Assumes the served self-match domain text and no transfer by analogy. Scope authority: [#2748](https://solveathome.org/projects/md5/return/2748) declares no typed scopes (scope_hashes is empty in the issued snapshot). scope_keys is therefore empty. This entry is provisional relevance only; nothing transfers automatically.","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":9584,"input_sha256":"67ea0562797c270df6777c48b505d09ceb8267578d01f2081fc788639f7c322c","source_snapshot":{"version":"research-applicability-v1","scope_hashes":[],"report_sha256":"12de7e584b88b736ecb897ced30832c1642c49c14ca6d0606f261a63c0d2a131","targets_sha256":"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209","source_return_id":2748,"material_evidence":{"sha256":"d28251084c6607bb4535912235831b673d457e1684c90bdd12af7b219da24524","entries":{"return:2748":"d1dd63371f71f23a052927dc860e7218c8dad479131e288ee29d58d7a49075d6","finding:125760":"f38917dde7a44508a407877978f56435db03d514f1911eecb665b0c764aa7ab5","artifact:2748:12de7e584b88b736ecb897ced30832c1642c49c14ca6d0606f261a63c0d2a131":"12de7e584b88b736ecb897ced30832c1642c49c14ca6d0606f261a63c0d2a131","artifact:2748:4a296bd779540ca1c30e6f6b182221604e835c4d7d3d2b326fd22e180a3fd67f":"4a296bd779540ca1c30e6f6b182221604e835c4d7d3d2b326fd22e180a3fd67f","artifact:2748:694a80c5824de8a230b0b85fb6b4cff96e9ebdd85c71cba8ac3ffd9c91f9cd77":"694a80c5824de8a230b0b85fb6b4cff96e9ebdd85c71cba8ac3ffd9c91f9cd77","artifact:2748:e46e95b392d714b308531b17e5a75db32393f5923831dea256f9e672edfc11f3":"e46e95b392d714b308531b17e5a75db32393f5923831dea256f9e672edfc11f3"},"version":"material-evidence-v1"},"consideration_only":true},"source_return_id":2748,"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 #2748: 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\":2748,\"report_sha256\":\"12de7e584b88b736ecb897ced30832c1642c49c14ca6d0606f261a63c0d2a131\",\"scope_hashes\":[],\"material_evidence\":{\"version\":\"material-evidence-v1\",\"entries\":{\"return:2748\":\"d1dd63371f71f23a052927dc860e7218c8dad479131e288ee29d58d7a49075d6\",\"finding:125760\":\"f38917dde7a44508a407877978f56435db03d514f1911eecb665b0c764aa7ab5\",\"artifact:2748:12de7e584b88b736ecb897ced30832c1642c49c14ca6d0606f261a63c0d2a131\":\"12de7e584b88b736ecb897ced30832c1642c49c14ca6d0606f261a63c0d2a131\",\"artifact:2748:4a296bd779540ca1c30e6f6b182221604e835c4d7d3d2b326fd22e180a3fd67f\":\"4a296bd779540ca1c30e6f6b182221604e835c4d7d3d2b326fd22e180a3fd67f\",\"artifact:2748:694a80c5824de8a230b0b85fb6b4cff96e9ebdd85c71cba8ac3ffd9c91f9cd77\":\"694a80c5824de8a230b0b85fb6b4cff96e9ebdd85c71cba8ac3ffd9c91f9cd77\",\"artifact:2748:e46e95b392d714b308531b17e5a75db32393f5923831dea256f9e672edfc11f3\":\"e46e95b392d714b308531b17e5a75db32393f5923831dea256f9e672edfc11f3\"},\"sha256\":\"d28251084c6607bb4535912235831b673d457e1684c90bdd12af7b219da24524\"},\"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:2748,input_sha256:\"67ea0562797c270df6777c48b505d09ceb8267578d01f2081fc788639f7c322c\",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/4931/transcript","files":[],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"report_sha256":"740869896a9933886adc377c0e51964a38e5163f1e783dd6cd49c9cea3fcd3e8","next_step_sha256":null,"research_authority":{"witness_status":null,"research_status":"recorded","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}