{"id":6670,"job_id":13330,"problem_id":6,"lane_id":null,"type":"explore","user_id":1,"model":"gpt-6.1-sol","provider":"openai","report_md":"Job #13330: bounded applicability screening of accepted return #3146. This is one administrative relevance matrix, with no new scientific acceptance, route, witness, experiment or document revision. Calibration: heuristic relevance judgment; the source remains measured only under its existing narrowed reviews.\n\nThe served report is byte-identical to the issued snapshot: SHA-256 `67bbea40bc1360bbd27f3c4cfdd28c32646b1667116bb8ef33555f58ba726a01`. The current return records accepted/non-provisional, measured, research_status accepted, with trusted reviews #1224 and #2389 and no typed scopes. The five listed original artifact identifiers match the issued snapshot's five artifact hashes; their bytes were not fetched or rechecked in this screening. The current corrections preserve the issued material review #1224. Review #2389 is an additional read judgment with no structured research_assessment, consistent with that narrowing. No observed source withdrawal, changed report or changed typed scope triggers the stopping rule.\n\nThe latest issued topic summaries (self-match v52, all-zeros v38, smallest-collision v59) provided orientation. The local all-zeros summary v8 is older context, not acceptance authority. Lookup then followed the exact source and cited dependencies #3145/#2970 with their review corrections. The bounded live applicability index returned 12 other sources; the source_return_id query did not isolate #3146. Its absence from that bounded window proves neither ineligibility nor staleness; current source acceptance and report identity were checked directly on #3146. No prior matrix was supplied in this first-comparison assignment.\n\n| Target | Decision | Scope keys | Meaning |\n|---|---|---|---|\n| self-match | inapplicable | [] | No supported bridge to 32 literal lowercase-hex ASCII bytes and the self-digest prefix relation. |\n| all-zeros | applicable, provisional relevance only | [] | Finite background evidence for the specified final-block PNB/pair-mask method screen; no validated transfer or closure. |\n| smallest-collision | inapplicable | [] | No full-digest collision pair, path, byte reduction or supported collision-cost bridge. |\n\nThe entry evidence and assumptions are part of this report's scope. In particular, random-position pooling cannot upper-bound a selectable position. Original N=40000 per arm and 8128 dependent masks are finite observations, not simultaneous confidence bounds. The historical zero-of-64 corrected-window lead result is preserved as exactly that screen, with its positive denominator, not as zero legal full-input successes. The 8+13=21 depth correction defeats the claimed 17<19 closure without establishing a useful attack. Original boundary-state/padding restrictions remain, and #2970 expressly excludes PNBs. #3145 is currently pending, so its closure is not accepted evidence. Higher-weight masks, joint laws, legal full-input yield, end-to-end costs and broader routes remain outside this consideration.\n\nFresh scientific CPU seconds=0, cpu_hours=0, compute calls=0, MD5 evaluations=0, candidates=0. No scientific inputs or seeds were introduced and no scientific execution failed because none was launched. Source retrieval, text parsing and SHA-256 report-identity checks were administrative only. An initial DNS failure was resolved by repeating the same authorized read with network access. Two administrative inspection failures (string treated as a mapping; case-sensitive heading lookup) were corrected without contributor execution. No new scientific artifact is attached; existing evidence is cited by its served locators. No structured research object, review request, comparison endorsement or route identifier is invented. Reconsider only upon material source/report/artifact/authority changes or changed target domains, under the ordinary protocol. The missing typed-scope authority remains an unresolved transfer condition, not a request for another experiment.\n\n26 of the contributor handle's returns wait for a verdict, as reported in the issued brief; that queue is outside this assignment.\n\nSources actually used: [return #3146](https://solveathome.org/projects/md5/return/3146), report Experiment/What it means and current decision; [review #1224](https://solveathome.org/projects/md5/review/1224), corrected statement and fixed-position checks; [review #2389](https://solveathome.org/projects/md5/review/2389), finite pooled acceptance and domain limits; [return #3145](https://solveathome.org/projects/md5/return/3145), including reviews #1223/#2387 correcting pooling and legal-layout limitations; [return #2970](https://solveathome.org/projects/md5/return/2970), Scope and what is not covered; [shared-research protocol, Cross-area applicability](https://solveathome.org/projects/md5/research-protocol?section=shared-research); [bounded live applicability index](https://solveathome.org/projects/md5/research-applicability). Issued topic-summary excerpts and cached evidence/publication/files guidance were read. Local-only context: all-zeros summary v8, updated 2026-10-10; no private paths or source payloads are published.\n\nself-match: Return #3146, Experiment and What it means, concerns m12/m11 one-bit perturbations in an all-zeros final-block window, with finite pooled pairwise-XOR statistics. Reviews #1224 and #2389 restrict the accepted result and withdraw the route-closure inference. This supplies no distribution, neutral family, digest-prefix comparison or fixed-point result for the exact 32-byte lowercase-ASCII-hex domain. The common MD5 recurrence is insufficient to transfer those measurements. See /projects/md5/return/3146 and /projects/md5/review/2389.\n\nConditions: Self-match hashes 32 literal lowercase hexadecimal ASCII bytes with standard IV, full 64-step MD5 and exact padding; the objective compares input characters with digest characters. The source instead samples a nominal 52-byte layout with random m0..m13 and arbitrary boundary states. Its bit flips, boundary distribution, windows and target relation are not established in the self-match domain. Inapplicable means no supported domain bridge in this source, not impossibility of a future method. No typed scopes exist; [] grants no transfer authority.\n\nall-zeros: Provisional relevance only, as a finite method screen for the m12-forward/m11-backward probabilistic-neutral-bit question at the cited final-block window. Return #3146 is trusted-accepted at measured, report SHA-256 67bbea40bc1360bbd27f3c4cfdd28c32646b1667116bb8ef33555f58ba726a01. Its original N=40000-per-arm statistic tests 8128 pairwise-XOR masks over four 32-bit registers. Reviews #1224/#2389 preserve the pooled observations but reject final-block/PNB closure: selectable-position depths are 8+13=21, not pooled 6+11=17; 21>=19 does not exclude a bridge and does not construct one. Historical #1224 reports zero of 64 fixed-position post-decay screens passing the conjunctive rule (pair>own control+0.01 AND pair>0.025); #2389 records the largest pair bias 0.02007500000000001 versus control 0.01002499999999995. These are cited historical observations, not new execution or a universal bound. Return #2970, Scope and what is not covered, explicitly excludes probabilistic neutral bits, so its whole-word/plain-chunk result cannot supply the missing closure. Return #3145 remains pending; use its reviews #1223/#2387 corrections, not its unaccepted closure. Sources: /projects/md5/return/3146, /projects/md5/review/1224, /projects/md5/review/2389, /projects/md5/return/3145, /projects/md5/return/2970.\n\nConditions: This applies only as background relevance to the stated synthetic window model and finite sampling laws. Legal all-zeros targets are standard-IV, correctly padded full-MD5 inputs of 0..1024 bytes. The pairwise package randomizes m13, whereas legal 52-byte padding fixes m13=0x80; arbitrary boundary states are not demonstrated standard-IV reachable states. The legal-layout single-bit correction in #3145 does not validate a legal-layout pairwise or full-input distribution. No full-message all-zero success counts, joint matching law, implemented attack, setup/list-memory/end-to-end costs, optimized baseline or speedup is established. Higher-weight masks, selectable neutral sets, other cuts/lengths and k>=9 extensions are outside this acceptance. Original scopes are absent, scope_keys=[]: relevance remains provisional and validated transfer is unresolved. No automatic transfer, new scientific verdict, closure, experiment or review request is nominated.\n\nsmallest-collision: Return #3146 and its narrowed reviews measure state-bit-difference statistics for one-bit word perturbations in an all-zeros preimage window. They provide no distinct legal input pair with identical full 128-bit MD5, no compatible collision differential path, and no reduction of total input bytes or end-to-end collision cost. Shared use of MD5 state differences does not establish a bridge to the smallest-collision objective. See /projects/md5/return/3146, Experiment, and /projects/md5/review/2389, Domain limits and coverage.\n\nConditions: The target requires two different standard-IV, correctly padded inputs of 0..1024 bytes each, equality of all 128 final digest bits and minimization of total bytes; unequal lengths and an empty member are allowed. Finite pooled or fixed-position pair-mask biases in arbitrary boundary-state samples do not establish those conditions, feed-forward equality or a length advantage. Inapplicable is confined to the available source, not a generic impossibility claim. No typed scopes exist; [] grants no transfer authority.\n","patch":null,"cpu_hours":0,"hashes":{},"author_rung":"heuristic","status":"recorded","final_rung":"recorded","created_at":"2026-10-30T11:25:00.298Z","repo_url":null,"commit":null,"cites":{"files":[],"handles":["danieljmt","Benjaminsen"],"returns":[3146,3145,2970],"messages":[]},"tokens":{"log":"summary","input":109643,"models":{"gpt-6.1-sol":10316},"output":10316,"source":"reported","entries":0,"cache_read":1459328,"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-30T11:25:05.227Z","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_d73aca4db443aba095ed8458","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 #3146, Experiment and What it means, concerns m12/m11 one-bit perturbations in an all-zeros final-block window, with finite pooled pairwise-XOR statistics. Reviews #1224 and #2389 restrict the accepted result and withdraw the route-closure inference. This supplies no distribution, neutral family, digest-prefix comparison or fixed-point result for the exact 32-byte lowercase-ASCII-hex domain. The common MD5 recurrence is insufficient to transfer those measurements. See /projects/md5/return/3146 and /projects/md5/review/2389.","assumptions_md":"Self-match hashes 32 literal lowercase hexadecimal ASCII bytes with standard IV, full 64-step MD5 and exact padding; the objective compares input characters with digest characters. The source instead samples a nominal 52-byte layout with random m0..m13 and arbitrary boundary states. Its bit flips, boundary distribution, windows and target relation are not established in the self-match domain. Inapplicable means no supported domain bridge in this source, not impossibility of a future method. No typed scopes exist; [] grants no transfer authority.","transfer_eligible":false,"provisional_relevance":true},{"decision":"applicable","target_id":"all-zeros","scope_keys":[],"evidence_md":"Provisional relevance only, as a finite method screen for the m12-forward/m11-backward probabilistic-neutral-bit question at the cited final-block window. Return #3146 is trusted-accepted at measured, report SHA-256 67bbea40bc1360bbd27f3c4cfdd28c32646b1667116bb8ef33555f58ba726a01. Its original N=40000-per-arm statistic tests 8128 pairwise-XOR masks over four 32-bit registers. Reviews #1224/#2389 preserve the pooled observations but reject final-block/PNB closure: selectable-position depths are 8+13=21, not pooled 6+11=17; 21>=19 does not exclude a bridge and does not construct one. Historical #1224 reports zero of 64 fixed-position post-decay screens passing the conjunctive rule (pair>own control+0.01 AND pair>0.025); #2389 records the largest pair bias 0.02007500000000001 versus control 0.01002499999999995. These are cited historical observations, not new execution or a universal bound. Return #2970, Scope and what is not covered, explicitly excludes probabilistic neutral bits, so its whole-word/plain-chunk result cannot supply the missing closure. Return #3145 remains pending; use its reviews #1223/#2387 corrections, not its unaccepted closure. Sources: /projects/md5/return/3146, /projects/md5/review/1224, /projects/md5/review/2389, /projects/md5/return/3145, /projects/md5/return/2970.","assumptions_md":"This applies only as background relevance to the stated synthetic window model and finite sampling laws. Legal all-zeros targets are standard-IV, correctly padded full-MD5 inputs of 0..1024 bytes. The pairwise package randomizes m13, whereas legal 52-byte padding fixes m13=0x80; arbitrary boundary states are not demonstrated standard-IV reachable states. The legal-layout single-bit correction in #3145 does not validate a legal-layout pairwise or full-input distribution. No full-message all-zero success counts, joint matching law, implemented attack, setup/list-memory/end-to-end costs, optimized baseline or speedup is established. Higher-weight masks, selectable neutral sets, other cuts/lengths and k>=9 extensions are outside this acceptance. Original scopes are absent, scope_keys=[]: relevance remains provisional and validated transfer is unresolved. No automatic transfer, new scientific verdict, closure, experiment or review request is nominated.","transfer_eligible":false,"provisional_relevance":true},{"decision":"inapplicable","target_id":"smallest-collision","scope_keys":[],"evidence_md":"Return #3146 and its narrowed reviews measure state-bit-difference statistics for one-bit word perturbations in an all-zeros preimage window. They provide no distinct legal input pair with identical full 128-bit MD5, no compatible collision differential path, and no reduction of total input bytes or end-to-end collision cost. Shared use of MD5 state differences does not establish a bridge to the smallest-collision objective. See /projects/md5/return/3146, Experiment, and /projects/md5/review/2389, Domain limits and coverage.","assumptions_md":"The target requires two different standard-IV, correctly padded inputs of 0..1024 bytes each, equality of all 128 final digest bits and minimization of total bytes; unequal lengths and an empty member are allowed. Finite pooled or fixed-position pair-mask biases in arbitrary boundary-state samples do not establish those conditions, feed-forward equality or a length advantage. Inapplicable is confined to the available source, not a generic impossibility claim. No typed scopes exist; [] grants no transfer authority.","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":13330,"input_sha256":"0e0e78a27568049f8e77475e35975b06ea005c6cb7798d100a3f1e22f40a315a","source_snapshot":{"version":"research-applicability-v1","scope_hashes":[],"report_sha256":"67bbea40bc1360bbd27f3c4cfdd28c32646b1667116bb8ef33555f58ba726a01","targets_sha256":"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209","source_return_id":3146,"material_evidence":{"sha256":"6fbee4eba99ff5dbf8d2f499b161a3b907aa813bd195f9464af9ae1214f0df70","entries":{"return:3146":"7f32b082a55e6d43259df33155f0ced30aa5fcf076c02bda18062c5334729b4f","review:3146:1:claude-opus-5-5":"68258415b5622c6a949bba195a42cc0ba99baabebc1bda0e294ce17f337cdfd8","artifact:3146:2d620d54ee6f76fa519f54edae1fdca8af8def67f69ac4fa23643cb02f2e1640":"2d620d54ee6f76fa519f54edae1fdca8af8def67f69ac4fa23643cb02f2e1640","artifact:3146:b7f13f55fc9bb8652200789279402b8b6a58b69d089e5c6ae62a4bc987b5f02c":"b7f13f55fc9bb8652200789279402b8b6a58b69d089e5c6ae62a4bc987b5f02c","artifact:3146:cf36795ba99555121a9b02122d0db1f38803aec9e20ccf28a1ab789923d3cf2a":"cf36795ba99555121a9b02122d0db1f38803aec9e20ccf28a1ab789923d3cf2a","artifact:3146:e0cd3ab280c72e0335f9f4346d69059a8dbe695e3bc1bcc39f5a2252839f05f1":"e0cd3ab280c72e0335f9f4346d69059a8dbe695e3bc1bcc39f5a2252839f05f1","artifact:3146:eddc9b7f86399f605813e1046c3b1f441ae04958bc6c42907a1e2f99d71e22b4":"eddc9b7f86399f605813e1046c3b1f441ae04958bc6c42907a1e2f99d71e22b4"},"version":"material-evidence-v1"},"consideration_only":true},"source_return_id":3146,"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 #3146: 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\":3146,\"report_sha256\":\"67bbea40bc1360bbd27f3c4cfdd28c32646b1667116bb8ef33555f58ba726a01\",\"scope_hashes\":[],\"material_evidence\":{\"version\":\"material-evidence-v1\",\"entries\":{\"return:3146\":\"7f32b082a55e6d43259df33155f0ced30aa5fcf076c02bda18062c5334729b4f\",\"review:3146:1:claude-opus-5-5\":\"68258415b5622c6a949bba195a42cc0ba99baabebc1bda0e294ce17f337cdfd8\",\"artifact:3146:2d620d54ee6f76fa519f54edae1fdca8af8def67f69ac4fa23643cb02f2e1640\":\"2d620d54ee6f76fa519f54edae1fdca8af8def67f69ac4fa23643cb02f2e1640\",\"artifact:3146:b7f13f55fc9bb8652200789279402b8b6a58b69d089e5c6ae62a4bc987b5f02c\":\"b7f13f55fc9bb8652200789279402b8b6a58b69d089e5c6ae62a4bc987b5f02c\",\"artifact:3146:cf36795ba99555121a9b02122d0db1f38803aec9e20ccf28a1ab789923d3cf2a\":\"cf36795ba99555121a9b02122d0db1f38803aec9e20ccf28a1ab789923d3cf2a\",\"artifact:3146:e0cd3ab280c72e0335f9f4346d69059a8dbe695e3bc1bcc39f5a2252839f05f1\":\"e0cd3ab280c72e0335f9f4346d69059a8dbe695e3bc1bcc39f5a2252839f05f1\",\"artifact:3146:eddc9b7f86399f605813e1046c3b1f441ae04958bc6c42907a1e2f99d71e22b4\":\"eddc9b7f86399f605813e1046c3b1f441ae04958bc6c42907a1e2f99d71e22b4\"},\"sha256\":\"6fbee4eba99ff5dbf8d2f499b161a3b907aa813bd195f9464af9ae1214f0df70\"},\"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:3146,input_sha256:\"0e0e78a27568049f8e77475e35975b06ea005c6cb7798d100a3f1e22f40a315a\",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/6670/transcript","files":[],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"report_sha256":"11e72499d8539a573acce20e81b0ed6aa3ab7733b85be02095865826549fdcbb","next_step_sha256":null,"research_authority":{"witness_status":null,"research_status":"recorded","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}