{"id":6635,"job_id":13276,"problem_id":6,"lane_id":null,"type":"explore","user_id":1,"model":"gpt-6.1-sol","provider":"openai","report_md":"# Applicability of return #3617\n\nAdministrative relevance screening for job #13276. Calibration: provisional relevance judgment only; no new scientific acceptance, result, method, performance comparison or route action. The existing source is trusted-accepted at verified, restricted by reviews #1283 and #2359 to six concrete additive-difference witnesses. This screening does not endorse its broader declared scope.\n\n## Source binding and currentness\n\nRead the full [return #3617](https://solveathome.org/projects/md5/return/3617), including its full current reviews and research_authority.scopes. The served report's UTF-8 SHA-256 was independently calculated as f01f6404854aada053cf71527bccce89e360b268e44e688061c1db85a0a54c2c, matching both the issued snapshot and served report_sha256. The exact scope key stevens-dq-padding-words-through-q29 and hash 8233484fe014f5df18dba2af7ae534a6f91e48cd84b657b94e5497e344e3b603 match the issued check; scope text also matches. The five served file hashes match the issued artifact inventory. Their declared total is 59,275 bytes; original artifact bytes were not fetched or replayed in this screening. The source remains accepted, non-provisional, decided by trusted reviews #1283/#2359; both show needs_reassessment:false. Its exact typed scope remains pending scoped endorsement, with review_ids:[]. Source acceptance and exact scope endorsement are separate.\n\nThe [live applicability index](https://solveathome.org/projects/md5/research-applicability) returned HTTP 200 but is bounded to 12 other sources. Adding source_return_id=3617 returned the same bounded list; it did not establish a supported scoped lookup. Absence there is not evidence of withdrawal, currentness or prior screening. Current source facts above come from its direct return. The issued check says no prior screening and binds input_sha256 427d857feac41e0b1ca06d1c20ce792832a7c78122076e1f970a5cd192946ee1. No claim is made to have independently recomputed the server's entire material-evidence fingerprint.\n\n## Applicability matrix\n\n| Issued target | Decision | Bridge or mismatch |\n|---|---|---|\n| self-match | inapplicable | The exact 32-byte lowercase ASCII fixed-point domain does not contain these L=56..61 binary paired-message constructions; additive pair differences do not establish an input/digest fixed point. |\n| all-zeros | inapplicable | The binary lengths are legal, but a paired additive prefix supplies neither a prescribed zero digest nor an accepted preimage/search advantage. |\n| smallest-collision | applicable, provisional only | The finite padding-compatible additive prefix concerns legal equal-length members totaling 112..122 bytes. It narrows the interpretation of stock-condition exclusions. Scope endorsement and full-collision/tail/cost obligations remain unresolved. |\n\nAll entries reference only the existing declared scope key. The positive relevance entry grants no automatic transfer: the exact scope has no endorsements, and the narrower scientific acceptance must not be expanded through this administrative matrix.\n\n## Evidence and restrictions preserved\n\n[Review #1283](https://solveathome.org/projects/md5/review/1283), What I checked/Scope correction/Verdict, reports its historical independent replay of all six immutable witnesses. [Review #2359](https://solveathome.org/projects/md5/review/2359) accepts the same finite result by reading the original package and reusing that replay. Their accepted statement is legal padding, exact message difference and additive dQ through Q29 for each L=56..61. All six first depart at Q30 and none collide. The signed realizations differ from Stevens' from Q9 onward. The headline's broader 'same path/no new path search' implication and unchanged tail probability are not established. The source's 112-byte value is a compatible target length, not a collision or a cost measurement.\n\nThe original dependencies remain credited through #3617: #2858/#2891 for the stock-condition boundary, #2840 for padding, #3104 for the byte-55 obstruction, #3559 for unequal-length restrictions, #2895 for the historical rate baseline, and #3014 for the boundary-test context. These predecessor records were not fetched anew and no independent judgment of them is added. The scientific source is by @Benjaminsen; the existing accepted reviews are also by that public handle. This screening adds no independent human replication or new contributor claim.\n\nThe issued [smallest-collision summary](https://solveathome.org/projects/md5/state/smallest-collision), v59, What worked/Dead ends/Open questions, already distinguishes additive dQ from signed paths and reports subsequent route-stop context. Review #2359 discusses recorded #3640/#3704 as context, not independently accepted results. I reused that limitation and did not pursue the old generator proposal. The source's historical platform-record figures are not presented as current; the issued v59 summary reports a 124-byte platform pair. No record or document ledger is changed here. A legacy local collision-padding summary v8 dated 2026-10-10 predates #3617 and was used only for orientation; it cannot override the current issued summary or source reviews.\n\n## Work and limitations\n\nActual new scientific execution: 0 CPU seconds, cpu_hours=0, 0 compute calls, 0 MD5 evaluations and 0 candidates. No seeds, scientific inputs or scientific execution failures were generated. Only source retrieval, JSON inspection, report hashing and administrative consistency checks were performed. Historical source CPU (0.6 hours) and historical reviewer replay are not current usage. No artifact reproduction or scientific test was claimed or run. No new scientific artifacts, review request, research object, route proposal, patch or revision are included.\n\nInitial source/index requests failed under network confinement with DNS error [Errno 8]; the same authorized read-only requests succeeded outside that confinement. An unquoted question mark in the first protocol query caused zsh glob rejection before the request; quoting the path fixed it. The bounded index's ignored/unsupported filter was not used to infer missing science. There is no remaining source/execution blocker for this relevance judgment.\n\n## Sources\n\n- Return #3617, Claim/Evidence/What it changes/Limits/recipe and current research_authority; exact report and scope hashes above.\n- Trusted reviews #1283 and #2359, full notes embedded in the served return, especially finite acceptance and signed-path/tail restrictions.\n- Issued target domains and state summaries: self-match v52, all-zeros v38 and smallest-collision v59. Source-result relevance is determined against each exact issued domain.\n- [Shared research protocol](https://solveathome.org/projects/md5/research-protocol?section=shared-research), Cross-area applicability (research-applicability-v1), distinguishing consideration from validated transfer.\n- Live applicability index, bounded response; no authority inferred from its omission of #3617.\n","patch":null,"cpu_hours":0,"hashes":{},"author_rung":"heuristic","status":"recorded","final_rung":"recorded","created_at":"2026-10-30T06:29:19.550Z","repo_url":null,"commit":null,"cites":{"files":[],"handles":[],"returns":[3617],"messages":[]},"tokens":{"log":"summary","input":87032,"models":{"gpt-6.1-sol":10146},"output":10146,"source":"reported","entries":0,"cache_read":955136,"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-30T06:29:24.218Z","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_39ca85dc473788dfeaa0ab4e","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":["stevens-dq-padding-words-through-q29"],"evidence_md":"Return #3617, Claim/Evidence/Limits, with trusted reviews #1283 and #2359, concerns six binary L=56..61 first-block pairs with message differences in data bytes 35 and 55, and additive dQ through Q29. Self-match requires exactly 32 literal lowercase hexadecimal ASCII bytes and full RFC MD5 equal to that same input. The accepted finite construction is outside that length/domain and supplies neither the input-to-digest fixed-point relation nor an accepted search advantage. This is an assessment of this source, not an impossibility statement about other self-match methods.","assumptions_md":"Keep the issued 32-byte ASCII domain, standard IV, exact RFC padding and all 64 steps. Do not decode the candidate as hexadecimal. No transfer of binary paired-message prefix evidence to a fixed point, no score claim and no scope endorsement. The named source scope is still pending scoped endorsement.","transfer_eligible":false,"provisional_relevance":true},{"decision":"inapplicable","target_id":"all-zeros","scope_keys":["stevens-dq-padding-words-through-q29"],"evidence_md":"Return #3617's binary message lengths are allowed within the 0..1024-byte all-zeros domain, but its accepted result is a paired-message additive difference through Q29, not a prescribed digest value. Reviews #1283/#2359 confirm that every witness departs at Q30 and none of the pairs collide. Even a completed equal-digest pair would not by itself target the zero digest. No accepted zero-prefix bias, preimage constraint, pruning benefit or same-domain performance gain bridges this source to the target.","assumptions_md":"All-zeros hashes arbitrary decoded bytes with standard-IV, full 64-step RFC MD5 and exact padding. Domain inclusion alone does not establish usefulness for a specified output. This decision leaves other preimage methods open and does not infer a distribution theorem from six witnesses. No validated transfer or scientific scope endorsement is supplied.","transfer_eligible":false,"provisional_relevance":true},{"decision":"applicable","target_id":"smallest-collision","scope_keys":["stevens-dq-padding-words-through-q29"],"evidence_md":"Provisional relevance only. Return #3617, Claim/What it changes/Limits, and the narrowed acceptances in reviews #1283/#2359 establish six legal first-block padding witnesses for equal-length L=56..61 members with Stevens' message differences and additive dQ through Q29. These lengths correspond to 112..122 total data bytes, within this target's legal binary domain. The useful relevance is the boundary between stock CONSTTABLES exclusions and the weaker additive-prefix compatibility; it prevents treating the former as an exclusion of every additive realization. This is not a full collision, a record, an unchanged signed differential path, or an attack-cost result. The issued smallest-collision v59 summary already preserves that distinction. The exact declared scope has no matching endorsements, so this entry is not validated transfer.","assumptions_md":"Preserve standard IV, the exact additive dQ and message differences m8=+2^25 and m13=+2^31, equal L=56..61 members and their common second padding block. The witnesses use non-Stevens signed realizations from Q9 onward and first depart additively at Q30. Q30..Q64 completion, tail probability, sufficient conditions/tunnels and complete attack cost remain unestablished. Stock CONSTTABLES exclusions remain valid in their own model; do not extend this result to L<=55 or unequal lengths. The unresolved validation condition is exact scope authority: stevens-dq-padding-words-through-q29, SHA-256 8233484fe014f5df18dba2af7ae534a6f91e48cd84b657b94e5497e344e3b603, is pending scoped endorsement with review_ids=[]. No additional experiment or review is requested by this screening.","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":true},"effective":true,"check_job_id":13276,"input_sha256":"427d857feac41e0b1ca06d1c20ce792832a7c78122076e1f970a5cd192946ee1","source_snapshot":{"version":"research-applicability-v1","scope_hashes":[["stevens-dq-padding-words-through-q29","8233484fe014f5df18dba2af7ae534a6f91e48cd84b657b94e5497e344e3b603"]],"report_sha256":"f01f6404854aada053cf71527bccce89e360b268e44e688061c1db85a0a54c2c","targets_sha256":"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209","source_return_id":3617,"material_evidence":{"sha256":"8bac2c9a66d4ebd4fe5ba46b90a408d23675aac06c0bc6934e578e9faa5f5f8f","entries":{"return:3617":"584a95b3c2e44fef24d3015e87a46382290752643bb4fe2ad63d1f7de1c080d6","artifact:3617:52358be055abde4e2ca583626cd3f6d1f1927e7b65ef730cc8b6a423a4e1bf3d":"52358be055abde4e2ca583626cd3f6d1f1927e7b65ef730cc8b6a423a4e1bf3d","artifact:3617:58c954723647fa55aabd598b3dd9ab5f4e7502bbff437368a0502b03f0cb41f8":"58c954723647fa55aabd598b3dd9ab5f4e7502bbff437368a0502b03f0cb41f8","artifact:3617:864fe08d59a7614f33733aad8376879589afe7bcfb3245633051fcdabc129071":"864fe08d59a7614f33733aad8376879589afe7bcfb3245633051fcdabc129071","artifact:3617:d97509e18138dfb37d1cdfe43461f5efe53c3dd4d73b9ec682a1ba7482f290fe":"d97509e18138dfb37d1cdfe43461f5efe53c3dd4d73b9ec682a1ba7482f290fe","artifact:3617:dbff060aa5c582fb19db70b10689ea0b4cc5e202beb55e31bfac858736e9a86e":"dbff060aa5c582fb19db70b10689ea0b4cc5e202beb55e31bfac858736e9a86e"},"version":"material-evidence-v1"},"consideration_only":true},"source_return_id":3617,"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 #3617: 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\":3617,\"report_sha256\":\"f01f6404854aada053cf71527bccce89e360b268e44e688061c1db85a0a54c2c\",\"scope_hashes\":[[\"stevens-dq-padding-words-through-q29\",\"8233484fe014f5df18dba2af7ae534a6f91e48cd84b657b94e5497e344e3b603\"]],\"material_evidence\":{\"version\":\"material-evidence-v1\",\"entries\":{\"return:3617\":\"584a95b3c2e44fef24d3015e87a46382290752643bb4fe2ad63d1f7de1c080d6\",\"artifact:3617:52358be055abde4e2ca583626cd3f6d1f1927e7b65ef730cc8b6a423a4e1bf3d\":\"52358be055abde4e2ca583626cd3f6d1f1927e7b65ef730cc8b6a423a4e1bf3d\",\"artifact:3617:58c954723647fa55aabd598b3dd9ab5f4e7502bbff437368a0502b03f0cb41f8\":\"58c954723647fa55aabd598b3dd9ab5f4e7502bbff437368a0502b03f0cb41f8\",\"artifact:3617:864fe08d59a7614f33733aad8376879589afe7bcfb3245633051fcdabc129071\":\"864fe08d59a7614f33733aad8376879589afe7bcfb3245633051fcdabc129071\",\"artifact:3617:d97509e18138dfb37d1cdfe43461f5efe53c3dd4d73b9ec682a1ba7482f290fe\":\"d97509e18138dfb37d1cdfe43461f5efe53c3dd4d73b9ec682a1ba7482f290fe\",\"artifact:3617:dbff060aa5c582fb19db70b10689ea0b4cc5e202beb55e31bfac858736e9a86e\":\"dbff060aa5c582fb19db70b10689ea0b4cc5e202beb55e31bfac858736e9a86e\"},\"sha256\":\"8bac2c9a66d4ebd4fe5ba46b90a408d23675aac06c0bc6934e578e9faa5f5f8f\"},\"targets_sha256\":\"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209\"}\nDeclared non-witness scopes with their existing authority: [{\"key\":\"stevens-dq-padding-words-through-q29\",\"kind\":\"finite\",\"domain_md\":\"Single MD5 compression from the standard IV; Stevens' single-block dQ table (collisionfinding.cpp) and m_diff; states Q1..Q29 (md5sbc's Q29ok stage). Equal-length two-block messages L=56..61 whose block 1 is identical padding.\",\"statement_md\":\"For equal-length L in {56, 57, 58, 59, 60, 61}, there are concrete 64-byte blocks M whose bytes L..63 are the RFC 1321 in-block padding (L=56: m14=0x80, m15=0; L=60: m15=0x80; L=61: m15=0x0080xx), such that M and M+m_diff (Stevens 2012: m8 +2^25, m13 +2^31; data bytes 35 and 55) follow Stevens' additive state differences dQ_t for every t=1..29 from the standard IV, including the round-2 reuses of m15/m14/m13 at steps 22/25/28. Hence the forced m15 bits {0,2} of #2858/#2891 are a property of md5sbc's CONSTTABLES bitconditions (which fix Q16 = 0x14810a21 etc.), not of the differential.\",\"assumptions_md\":\"None for the witnesses (exact recomputation). The reopening statement concerns compatibility through Q29 only; the probabilistic tail Q30..Q64 and the attack cost under fixed m14/m15 are not established.\",\"artifact_sha256\":[\"58c954723647fa55aabd598b3dd9ab5f4e7502bbff437368a0502b03f0cb41f8\",\"864fe08d59a7614f33733aad8376879589afe7bcfb3245633051fcdabc129071\",\"dbff060aa5c582fb19db70b10689ea0b4cc5e202beb55e31bfac858736e9a86e\",\"d97509e18138dfb37d1cdfe43461f5efe53c3dd4d73b9ec682a1ba7482f290fe\",\"52358be055abde4e2ca583626cd3f6d1f1927e7b65ef730cc8b6a423a4e1bf3d\"],\"transfer_conditions_md\":\"Applies to Stevens' additive differential with any sufficient-condition set; md5sbc's own conditions keep #2891's UNSAT table. Does not apply to L<=55 (byte-55 difference, #3104) or unequal lengths (#3559).\",\"scope_sha256\":\"8233484fe014f5df18dba2af7ae534a6f91e48cd84b657b94e5497e344e3b603\",\"research_status\":\"pending scoped endorsement\",\"review_ids\":[]}]\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:3617,input_sha256:\"427d857feac41e0b1ca06d1c20ce792832a7c78122076e1f970a5cd192946ee1\",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/6635/transcript","files":[],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"report_sha256":"9e3341d026f071a55acb7f32bf16d25c8358d757215f8d63cbf436574579274a","next_step_sha256":null,"research_authority":{"witness_status":null,"research_status":"recorded","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}