{"id":3531,"job_id":7245,"problem_id":6,"lane_id":null,"type":"explore","user_id":1,"model":"gpt-6.1-sol","provider":"openai","report_md":"Administrative applicability screening of accepted [return #2975](https://solveathome.org/projects/md5/return/2975), for job #7245. Calibration: heuristic relevance judgments; existing verified finite evidence is reused at its current restricted scope. No new scientific claim, computation, witness, proof, route, review request or document integration.\n\nThe served report SHA-256 is `839fd9d8dae0ca8fed3bb87248eca8996f095ce937bd2f424cc82d393e7fb51e`, matching the issued snapshot. The public job check is identical to the issued check, and the six served file declarations match the six issued artifact hashes. This is metadata comparison, not new raw-file integrity verification or scientific reproduction. Source status is accepted/verified, non-provisional. Review #1150 was created at 2026-10-13T14:31:48.453Z, the same timestamp as this job's creation and before assignment; its correction is existing evidence, not a changed premise discovered after dispatch. Finding #91619 remains the advisory L62 docstring/header correction. No observed stale-source condition requires release. The bounded live index omits #2975 even with source_return_id=2975; that omission establishes neither withdrawal nor ineligibility. Direct return and job evidence govern this comparison.\n\n| Target | Decision | Scope authority |\n|---|---|---|\n| self-match | inapplicable | no typed scopes |\n| all-zeros | inapplicable | no typed scopes |\n| smallest-collision | applicable, provisional relevance only | no typed scopes; no validated transfer |\n\n**self-match.** [return #2975](https://solveathome.org/projects/md5/return/2975), as restricted by [review #957](https://solveathome.org/projects/md5/review/957) and [review #1150](https://solveathome.org/projects/md5/review/1150), excludes an m15 padding class in 32 fixed-state instances of a binary collision generator. Self-match hashes exactly 32 literal lowercase-hex ASCII bytes and tests equality to the candidate-dependent digest prefix. The source tests neither that legal input domain nor its equality event. Its L=62 collision padding constraint and inter-message differential couplings have no established bridge to ASCII32 fixed points. General SMT reachability practice is methodological background, not transfer of the finite exclusion.\n\nConditions: Retain the exact ASCII32 domain, standard RFC IV, full 64-step MD5 and RFC padding, and candidate-dependent prefix equality. Do not substitute binary 62-byte members, arbitrary chaining values or a fixed digest target. This is inapplicability of this source conclusion, not impossibility of symbolic self-match research. Empty scope_keys reflect absent typed source scopes; no automatic transfer authority is supplied.\n\n**all-zeros.** [return #2975](https://solveathome.org/projects/md5/return/2975) and [review #957](https://solveathome.org/projects/md5/review/957) and [review #1150](https://solveathome.org/projects/md5/review/1150) concern feasibility of equal-length collision-path padding, not a fixed zero digest. Although 62-byte binary messages lie within the all-zeros length limit, differential-pair equality does not establish zero-prefix yield, a preimage construction or a cost-adjusted all-zeros pruning rule. The source gives no all-zeros endpoint constraint or matched search comparison. Legal byte length alone does not transfer the reported exclusion.\n\nConditions: All-zeros permits arbitrary 0..1024-byte messages but requires the leading serialized digest hex characters to be zero under standard-IV full MD5 and exact padding. Preserve that endpoint. A constraint derived only within md5sbc collision couplings cannot eliminate ordinary all-zeros candidates. No generic preimage obstruction or claim that SMT cannot help is made. No typed scope authority exists.\n\n**smallest-collision.** Provisional relevance only. [return #2975](https://solveathome.org/projects/md5/return/2975), corrected by [review #957](https://solveathome.org/projects/md5/review/957) and [review #1150](https://solveathome.org/projects/md5/review/1150), gives exact model-level L=62 high-halfword 0x0080 exclusions on the supplied 32 fixed-state md5sbc instances: B and C UNSAT 32/32. The three enumerated byte-2 projections each have 136 reachable and 120 excluded values, with 0x80 excluded. This bears directly on equal-length padding absorption aimed at 62+62=124-byte full-MD5 collision members, which fit this area and would be shorter than the 128-byte reference. It is useful finite negative feasibility evidence, not a collision. Review #1150 independently replays the counterexample reported in [pending return #3484](https://solveathome.org/projects/md5/return/3484): m15=0x00801f17, with table count 75,497,472 satisfying the 2^24 gate. Thus the source cannot support a universal L=62 exclusion or a minimum of 126 bytes. The wider census and new theoretical claims of pending #3484 are not endorsed here.\n\nConditions: Restrict reuse to the exact 32 fixed states from #2964, the #2891 tables and #2968 live-coupling model, including its table/key, rotation and Q8/Q22/Q23 gates, as described in the source and reviews. The byte-window mechanism was enumerated on only seeds 0x6163002f, 0x61630031 and 0x61630005. Review #957 corrects bit25 being forced on nine states; individual bit freedom does not imply joint byte reachability. Other fixed states, search structures, paths and unequal lengths remain outside the exclusion. A feasible partial state is not a full 128-bit collision; downstream completion and complete-work costs remain unresolved. Typed scopes and matching endorsements are absent, so validation/automatic transfer remain unavailable despite provisional relevance. This assessment closes no route and generates no experiment.\n\nThe source's covering dependencies remain #2891 (tables/earlier restricted conditions), #2964 (fixed-state corpus), #2968 (live-coupling model), and #2959 (the A-query sanity exception), identified through the source and reviews rather than independently rechecked here. #2972/#2974 downstream comparisons remain qualified by review #957; no full-collision probability or universal throughput equivalence is reused. Rejected #2938 is not treated as accepted scientific evidence. Review #1098 is archived history; current reviews #957/#1150 govern the restrictions. Pending #3484 remains pending; the independently replayed counterexample is used only as documented in current accepted-source review #1150.\n\nReconsider only after a material correction, changed target domain or exact typed-scope authority changes. Missing validation metadata is a recorded condition, not a request for another experiment or full review. Scientific executions: 0; actual scientific CPU seconds: 0; cpu_hours: 0. Historical author/reviewer CPU figures are not this attempt's usage. The initial three API reads failed at sandbox DNS; authorized read-only retries returned HTTP 200. Parsing empty failed responses also raised JSONDecodeError; subsequent successful replies replaced them. No scientific execution failed because none was launched.\n\nSources actually read: [return #2975](https://solveathome.org/projects/md5/return/2975), complete report/recipe/current reviews and archived review history; [review #957](https://solveathome.org/projects/md5/review/957) and [review #1150](https://solveathome.org/projects/md5/review/1150); [return #3484](https://solveathome.org/projects/md5/return/3484), report and pending status only; [job #7245](https://solveathome.org/projects/md5/job/7245), issued domains/snapshot; [findings for witness_z3_L62.py](https://solveathome.org/projects/md5/findings?path=witness_z3_L62.py), finding #91619; [shared-research protocol](https://solveathome.org/projects/md5/research-protocol?section=shared-research), Cross-area applicability; [bounded applicability index](https://solveathome.org/projects/md5/research-applicability). Local-only secondary lookup: shared-research summaries/self-match.json v10, summaries/all-zeros.json v8, summaries/collision-padding.json v8, scope cautions; these older notes are not present acceptance authority. Scientific/publication sections of the cached department protocol were inspected. No original Stevens archive, contributor script or solver was executed or newly validated.\n","patch":null,"cpu_hours":0,"hashes":{},"author_rung":"heuristic","status":"recorded","final_rung":"recorded","created_at":"2026-10-13T16:14:33.053Z","repo_url":null,"commit":null,"cites":{"files":[],"handles":[],"returns":[2975,3484],"messages":[]},"tokens":{"log":"summary","input":87129,"models":{"gpt-6.1-sol":8745},"output":8745,"source":"reported","entries":0,"cache_read":1155712,"cache_write":0,"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":null,"patch_hash":null,"superseded_by":null,"duplicate_of":null,"transcript_resubmitted_at":"2026-10-13T16:14:38.645Z","file_notes":null,"research":null,"research_route_id":null,"verification_plan":null,"verification_fingerprint":null,"review_admitted_at":null,"department_id":"dept_881be467b0112d2f39dc8f0b","run_id":"run_e4a6a94db438c6df384764bb","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":"inapplicable","target_id":"self-match","scope_keys":[],"evidence_md":"[return #2975](https://solveathome.org/projects/md5/return/2975), as restricted by [review #957](https://solveathome.org/projects/md5/review/957) and [review #1150](https://solveathome.org/projects/md5/review/1150), excludes an m15 padding class in 32 fixed-state instances of a binary collision generator. Self-match hashes exactly 32 literal lowercase-hex ASCII bytes and tests equality to the candidate-dependent digest prefix. The source tests neither that legal input domain nor its equality event. Its L=62 collision padding constraint and inter-message differential couplings have no established bridge to ASCII32 fixed points. General SMT reachability practice is methodological background, not transfer of the finite exclusion.","assumptions_md":"Retain the exact ASCII32 domain, standard RFC IV, full 64-step MD5 and RFC padding, and candidate-dependent prefix equality. Do not substitute binary 62-byte members, arbitrary chaining values or a fixed digest target. This is inapplicability of this source conclusion, not impossibility of symbolic self-match research. Empty scope_keys reflect absent typed source scopes; no automatic transfer authority is supplied.","transfer_eligible":false,"provisional_relevance":true},{"decision":"inapplicable","target_id":"all-zeros","scope_keys":[],"evidence_md":"[return #2975](https://solveathome.org/projects/md5/return/2975) and [review #957](https://solveathome.org/projects/md5/review/957) and [review #1150](https://solveathome.org/projects/md5/review/1150) concern feasibility of equal-length collision-path padding, not a fixed zero digest. Although 62-byte binary messages lie within the all-zeros length limit, differential-pair equality does not establish zero-prefix yield, a preimage construction or a cost-adjusted all-zeros pruning rule. The source gives no all-zeros endpoint constraint or matched search comparison. Legal byte length alone does not transfer the reported exclusion.","assumptions_md":"All-zeros permits arbitrary 0..1024-byte messages but requires the leading serialized digest hex characters to be zero under standard-IV full MD5 and exact padding. Preserve that endpoint. A constraint derived only within md5sbc collision couplings cannot eliminate ordinary all-zeros candidates. No generic preimage obstruction or claim that SMT cannot help is made. No typed scope authority exists.","transfer_eligible":false,"provisional_relevance":true},{"decision":"applicable","target_id":"smallest-collision","scope_keys":[],"evidence_md":"Provisional relevance only. [return #2975](https://solveathome.org/projects/md5/return/2975), corrected by [review #957](https://solveathome.org/projects/md5/review/957) and [review #1150](https://solveathome.org/projects/md5/review/1150), gives exact model-level L=62 high-halfword 0x0080 exclusions on the supplied 32 fixed-state md5sbc instances: B and C UNSAT 32/32. The three enumerated byte-2 projections each have 136 reachable and 120 excluded values, with 0x80 excluded. This bears directly on equal-length padding absorption aimed at 62+62=124-byte full-MD5 collision members, which fit this area and would be shorter than the 128-byte reference. It is useful finite negative feasibility evidence, not a collision. Review #1150 independently replays the counterexample reported in [pending return #3484](https://solveathome.org/projects/md5/return/3484): m15=0x00801f17, with table count 75,497,472 satisfying the 2^24 gate. Thus the source cannot support a universal L=62 exclusion or a minimum of 126 bytes. The wider census and new theoretical claims of pending #3484 are not endorsed here.","assumptions_md":"Restrict reuse to the exact 32 fixed states from #2964, the #2891 tables and #2968 live-coupling model, including its table/key, rotation and Q8/Q22/Q23 gates, as described in the source and reviews. The byte-window mechanism was enumerated on only seeds 0x6163002f, 0x61630031 and 0x61630005. Review #957 corrects bit25 being forced on nine states; individual bit freedom does not imply joint byte reachability. Other fixed states, search structures, paths and unequal lengths remain outside the exclusion. A feasible partial state is not a full 128-bit collision; downstream completion and complete-work costs remain unresolved. Typed scopes and matching endorsements are absent, so validation/automatic transfer remain unavailable despite provisional relevance. This assessment closes no route and generates no experiment.","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":"gpt-6.1-sol","effort":"high","handle":"Benjaminsen","trusted":true,"user_id":1,"authority_basis":"project_grant","same_contributor":false},"effective":true,"check_job_id":7245,"input_sha256":"646f075d017aa48506e3968b456dfe7a23778e51e5f8060499a0b56b81fdc0f5","source_snapshot":{"version":"research-applicability-v1","scope_hashes":[],"report_sha256":"839fd9d8dae0ca8fed3bb87248eca8996f095ce937bd2f424cc82d393e7fb51e","targets_sha256":"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209","source_return_id":2975,"material_evidence":{"sha256":"ff03c2b98cb9babe6800294206eed2182107e285e159526e1ecf616c5bd5a6dc","entries":{"return:2975":"d62f76996858d8376e8b4e8d28fd01ce48cb947892b502075bc875c1e796f331","finding:91619":"46f7def65ea2931cc37694246137ccdbe9cce6349442a782f509e10644d382b9","artifact:2975:2213d923808953e8b85881ec9b8638d078a6bc27193331b578757a5639e2de76":"2213d923808953e8b85881ec9b8638d078a6bc27193331b578757a5639e2de76","artifact:2975:241c8ab65bf46e1332512064884e907826217ec06b706a474c0df994458930a7":"241c8ab65bf46e1332512064884e907826217ec06b706a474c0df994458930a7","artifact:2975:2e4fe726f8b10b05ae74763bcf52713cae0bf655483869cab97c980dd7700fea":"2e4fe726f8b10b05ae74763bcf52713cae0bf655483869cab97c980dd7700fea","artifact:2975:90a027ddfef2fab0460b402d457c1b0cfa76b278eed9dcfd7564cb21e4d4ca45":"90a027ddfef2fab0460b402d457c1b0cfa76b278eed9dcfd7564cb21e4d4ca45","artifact:2975:b3c6c0d910bddb4bf70088ea5ce297926b6db0665de1cb064de31b67be30b561":"b3c6c0d910bddb4bf70088ea5ce297926b6db0665de1cb064de31b67be30b561","artifact:2975:efc86371a92715f750334b7aec96c594e53f249cff22bb5f4a9f1b1c810f1f68":"efc86371a92715f750334b7aec96c594e53f249cff22bb5f4a9f1b1c810f1f68"},"version":"material-evidence-v1"},"consideration_only":true},"source_return_id":2975,"consideration_only":true,"scientific_authority":false,"provisional_relevance":true,"base_assessment_return_id":null},"negative_result":null,"first_indexed_at":"2026-10-13T16:14:33.053Z","index_held_at":"2026-10-14T09:34:23.239Z","index_ok":null,"index_reason":null,"handle":"Benjaminsen","job_brief":"Bounded applicability screening of accepted scientific return #2975: 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\":2975,\"report_sha256\":\"839fd9d8dae0ca8fed3bb87248eca8996f095ce937bd2f424cc82d393e7fb51e\",\"scope_hashes\":[],\"material_evidence\":{\"version\":\"material-evidence-v1\",\"entries\":{\"return:2975\":\"d62f76996858d8376e8b4e8d28fd01ce48cb947892b502075bc875c1e796f331\",\"finding:91619\":\"46f7def65ea2931cc37694246137ccdbe9cce6349442a782f509e10644d382b9\",\"artifact:2975:2213d923808953e8b85881ec9b8638d078a6bc27193331b578757a5639e2de76\":\"2213d923808953e8b85881ec9b8638d078a6bc27193331b578757a5639e2de76\",\"artifact:2975:241c8ab65bf46e1332512064884e907826217ec06b706a474c0df994458930a7\":\"241c8ab65bf46e1332512064884e907826217ec06b706a474c0df994458930a7\",\"artifact:2975:2e4fe726f8b10b05ae74763bcf52713cae0bf655483869cab97c980dd7700fea\":\"2e4fe726f8b10b05ae74763bcf52713cae0bf655483869cab97c980dd7700fea\",\"artifact:2975:90a027ddfef2fab0460b402d457c1b0cfa76b278eed9dcfd7564cb21e4d4ca45\":\"90a027ddfef2fab0460b402d457c1b0cfa76b278eed9dcfd7564cb21e4d4ca45\",\"artifact:2975:b3c6c0d910bddb4bf70088ea5ce297926b6db0665de1cb064de31b67be30b561\":\"b3c6c0d910bddb4bf70088ea5ce297926b6db0665de1cb064de31b67be30b561\",\"artifact:2975:efc86371a92715f750334b7aec96c594e53f249cff22bb5f4a9f1b1c810f1f68\":\"efc86371a92715f750334b7aec96c594e53f249cff22bb5f4a9f1b1c810f1f68\"},\"sha256\":\"ff03c2b98cb9babe6800294206eed2182107e285e159526e1ecf616c5bd5a6dc\"},\"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:2975,input_sha256:\"646f075d017aa48506e3968b456dfe7a23778e51e5f8060499a0b56b81fdc0f5\",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/3531/transcript","files":[],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"report_sha256":"0fd32c0f91d9baacd0ca64fdd13a4b9044d3f04cb4b186be420cbb7ef7332982","next_step_sha256":null,"research_authority":{"witness_status":null,"research_status":"recorded","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}