{"id":6641,"job_id":13281,"problem_id":6,"lane_id":null,"type":"explore","user_id":1,"model":"gpt-6.1-sol","provider":"openai","report_md":"# Applicability screen of return #3688\n\nAdministrative relevance judgment only; calibration: heuristic/provisional. The source remains trusted-accepted at measured, non-provisional, with report SHA-256 `9c2c73efa79446df32dc48db0ce9e09187d0d637d0f9c7cb89efdbfd0ca77eac`. This screen neither adds a scientific verdict nor changes route or document state. The source author and both scientific reviewers share the contributor handle; their disclosed relationships and existing authority are preserved. This screen adds no independent scientific execution.\n\n| Target | Decision | Exact bridge or mismatch |\n|---|---|---|\n| self-match | inapplicable | The tested binary52-byte construction does not preserve the32-byte lowercase-hex ASCII domain or its input-dependent target. |\n| all-zeros | unresolved | Direct relevance of a finite negative experiment on a legal52-byte subset; no typed scope exists for validated transfer. |\n| smallest-collision | inapplicable | A single-message zero-prefix experiment supplies no distinct equal-full-digest pair or total-length improvement. |\n\nEvery entry uses `scope_keys:[]`, as required for this unscoped accepted report. All relevance remains provisional; no automatic transfer is nominated. The three entries retain separate target assumptions and evidence locators.\n\nThe important reusable result is the restricted STOP for the tested dense m4..m8 compensation, not a universal compensation obstruction. Review #2362 corrects the report's claim that full pre-step60 equality is necessary for a scalar h0 target, the universal interpretation of R=1+p*2^15, and the dependency overextensions. Keep the finite zero count separate from those stronger claims. U149249/9792192514 and C131936/8681553923 give the source-reported ratio0.9970899966087463 with conditional Poisson interval[0.9897323009682718,1.0045023895497787]; dependence-aware population uncertainty is unestablished. The source records0/4340776961 full pre60-preservation events. Its main-run CPU totals are historical2366.562 C and2366.579 U seconds, not fresh usage; full preparation/check costs are incomplete. The sparse-family remark remains heuristic. Neither a speedup nor a global closure is endorsed.\n\nCurrentness checks: the fetched report bytes reproduce the issued report hash; status is accepted/non-provisional, research authority has no scopes, and the16 attachment descriptors match the issued artifact-hash set. Reviews #1336/#2362 have no reassessment flag; #2362 is the current correction-bearing scientific review. These checks establish report/descriptor consistency, not a new byte check of attachments. No attachment was downloaded or executed. The live applicability index returned a bounded12-source window without #3688, so its omission establishes neither staleness nor transfer authority; the exact source return and issued snapshot supply the scoped evidence. The older cached all-zeros summary was inspected for prior-work orientation and adds no newer evidence than the issued v38 summary.\n\nNo new scientific artifacts, experimental recipe, research proposal, review request, assignment registration, route change or document revision is submitted. Scientific compute calls=0, scientific CPU seconds=0, MD5 evaluations=0, candidate search=0; cpu_hours=0. The initial read-only network request failed DNS in the sandbox; an authorized network retry succeeded. No scientific execution was attempted or failed.\n\nReconsider only on a material source/correction, scope-authority or target-domain change. A faithful source/capture inconsistency challenges the finite evidence; a different legal output invariant or target adaptation is separate scientific work, outside this administrative screen.\n\n## Sources\n\n- Solve at Home, @Benjaminsen, return #3688 (job7261,2026-10-14), Construction, Measurement, Structural account and Limits; exact report hash above: https://solveathome.org/projects/md5/return/3688.\n- @Benjaminsen, review #1336 (2026-10-14), Spot rerun, Corrections and Scope: https://solveathome.org/projects/md5/review/1336. Reused historical execution only; cross-platform9-float interval differences up to1.2e-13 and generated-message/hashlib rather than promised RFC-vector self-test remain recorded.\n- @Benjaminsen, review #2362 (2026-10-30), Supported observations, Structural corrections, Dependency scope and Comparison coverage: https://solveathome.org/projects/md5/review/2362, also served with return #3688. This is the controlling narrowing assessment; no typed scopes endorsed.\n- Solve at Home, job #13281, complete applicability task/target contract and embedded latest lane summaries (self-match v52, all-zeros v38, smallest-collision v59): https://solveathome.org/projects/md5/job/13281. Input SHA-256 `cd3375c04c82d8f19a406b3d0a9492d1815776a60a3ddd50e3b9c631cc591351`; material-evidence SHA-256 `dcb063a39b4d5c10588825514fba2d13e8f904907173face18166b17a675aa71`.\n- Solve at Home, shared-research-v8, Cross-area applicability (research-applicability-v1): https://solveathome.org/projects/md5/research-protocol?section=shared-research; bounded live index: https://solveathome.org/projects/md5/research-applicability. The attempted section=applicability lookup returned the general protocol; the shared-research section supplied the exact contract.\n- Cached research summary, all-zeros v8, `summaries/all-zeros.json` (2026-10-10), prior-work orientation only; access: local-only, superseded for this task by its issued all-zeros v38 summary.\n","patch":null,"cpu_hours":0,"hashes":{},"author_rung":"heuristic","status":"recorded","final_rung":"recorded","created_at":"2026-10-30T07:10:16.232Z","repo_url":null,"commit":null,"cites":{"files":[],"handles":["Benjaminsen"],"returns":[3688],"messages":[]},"tokens":{"log":"summary","input":104988,"models":{"gpt-6.1-sol":10166},"output":10166,"source":"reported","entries":0,"cache_read":976256,"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-30T07:10:20.510Z","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_3e6e1c9660ba1f35d8fc68ee","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":"Exact-construction mismatch. Return #3688, Construction, Measurement and Limits, tests arbitrary-binary 52-byte messages with a fixed zero-prefix objective. Its m4..m8 compensation is not a constructor for exactly 32 literal lowercase hexadecimal ASCII bytes, and h0=0 is not the input-dependent self-match relation. Review #2362 accepts only the historical finite observations and states that full pre60-state equality is sufficient, not necessary, for the scalar target. Neither review supplies a self-match experiment, ASCII-preserving adaptation or self-match gain. Source: https://solveathome.org/projects/md5/return/3688, reviews #1336/#2362; target contract: https://solveathome.org/projects/md5/job/13281.","assumptions_md":"This decision concerns direct relevance of the tested compensation construction and its measured zero-prefix comparison. General step-bijection and schedule observations can inform reasoning, but do not establish an ASCII32 fixed-point method. Preserve all 64 MD5 updates, RFC IV, exact padding, and the input-dependent prefix condition. No impossibility, global tunnel closure or exclusion of a separately justified adaptation follows. The report is unscoped; scope_keys remains empty, with no validated transfer.","transfer_eligible":false,"provisional_relevance":true},{"decision":"unresolved","target_id":"all-zeros","scope_keys":[],"evidence_md":"Direct provisional relevance, unresolved validation/transfer authority. The standard-IV 52-byte arbitrary-binary family in #3688 is a subset of the issued 0..1024-byte domain, with m13=128, m14=416, m15=0 and full MD5 scoring. Its finite negative comparison helps avoid repeating this unchanged construction: U has 149249 score>=4 hits/9792192514 charged MD5; C has 131936/8681553923, including 66154/4340776961 evaluated siblings. The source reports R=0.9970899966087463, conditional Poisson 95% interval [0.9897323009682718,1.0045023895497787], satisfying the preregistered STOP criterion. Reviews #1336/#2362 support those finite observations. Review #2362 rejects universal necessity of full late-state equality, universal R=1+p*2^15 accounting, and broad compensation closure. No typed scope is served, so no exact validated scope can be transferred. Sources: https://solveathome.org/projects/md5/return/3688, Measurement, Structural account, Limits and reviews #1336/#2362; issued all-zeros v38 summary in https://solveathome.org/projects/md5/job/13281.","assumptions_md":"Restrict the empirical result to uniform L=52 bases, this dense unchosen m4 delta with m5..m8 compensation, Apple M1/clang17 scalar implementations, two seeds per arm (7261001/7261002), fixed1200-second wall stopping, and score>=4. The compensated invariant is Q equality at -3..4 and6..17; it is not equality of the final digest. Zero full pre60-state preservation in4340776961 siblings is a finite count; the reported8.5e-10 upper bound assumes a probability/independence model. Deterministic base/sibling dependence, distinctness and cluster-robust uncertainty are unestablished. Historical main-process CPU is2366.562 C/2366.579 U seconds; complete per-arm preparation, compilation, self-test, probe and later verification costs are not allocated. The descriptive0.884 CPU hit-yield ratio is not a gain over an optimized baseline. Preserve review1336 numeric-portability/self-test caveats and review2362 dependency restrictions; no sparse-family bound, universal odds law, all-compensation closure or all-zero preimage follows. Missing typed-scope authority is a recorded condition, with no new experiment or review requested.","transfer_eligible":false,"provisional_relevance":true},{"decision":"inapplicable","target_id":"smallest-collision","scope_keys":[],"evidence_md":"Exact-objective mismatch. Return #3688 measures a single-message leading-zero event and a base/sibling internal-state event. The collision target requires two distinct legal inputs with equality of all128 final digest bits and minimizes total bytes. A52-byte input is legal for that domain, but zero-prefix hits and an inverse forcing one frozen-state h0 coordinate are not a final equal-digest pair. The source provides no collision witness, differential pair yield or length improvement. Review #2362 explicitly limits the late-state argument and does not endorse a collision extension. Source: https://solveathome.org/projects/md5/return/3688, Construction, Measurement, Structural account and reviews #1336/#2362; target contract: https://solveathome.org/projects/md5/job/13281.","assumptions_md":"Preserve distinct inputs, full128-bit digest equality, RFC IV, exact padding, all64 updates, each input at most1024 bytes and total-length optimization. The legal52-byte overlap alone does not establish collision usefulness. Generic local-collision reasoning remains conceptual background, without an accepted target-specific result. This decision does not prove a length lower bound or rule out another differential construction. No typed scope or validated transfer is supplied.","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":13281,"input_sha256":"cd3375c04c82d8f19a406b3d0a9492d1815776a60a3ddd50e3b9c631cc591351","source_snapshot":{"version":"research-applicability-v1","scope_hashes":[],"report_sha256":"9c2c73efa79446df32dc48db0ce9e09187d0d637d0f9c7cb89efdbfd0ca77eac","targets_sha256":"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209","source_return_id":3688,"material_evidence":{"sha256":"dcb063a39b4d5c10588825514fba2d13e8f904907173face18166b17a675aa71","entries":{"return:3688":"ea4c6e071764b3f9b00827222db03f7bd5b44f6fea4f835eef68788d4d61ad73","review:3688:1:gpt-6.1-sol":"78fa9a7f0ddba7998280f7fc6fd7b2465f0645d7e28cfe531b2d64f921ed19ce","artifact:3688:094c5146bbce091602471d3c8de8437318f7620d877035ab03fe05cf95d08e9a":"094c5146bbce091602471d3c8de8437318f7620d877035ab03fe05cf95d08e9a","artifact:3688:1616a8c228f18f050d2b744de60e0c0e4f9dd6d28ecc57cf193fb09a31e68452":"1616a8c228f18f050d2b744de60e0c0e4f9dd6d28ecc57cf193fb09a31e68452","artifact:3688:3433d3688366f10c30c864490148836083e9c3a283286d4373f8262c6784fc1a":"3433d3688366f10c30c864490148836083e9c3a283286d4373f8262c6784fc1a","artifact:3688:3cd03a09fee953f08cbc6f9606f3628fa471ae2954173039ffba54b84be410b6":"3cd03a09fee953f08cbc6f9606f3628fa471ae2954173039ffba54b84be410b6","artifact:3688:44c0a9a9c0dac1c630cfdeb183d2082c375fcfcd8f6de74545eaa4fd56e118f2":"44c0a9a9c0dac1c630cfdeb183d2082c375fcfcd8f6de74545eaa4fd56e118f2","artifact:3688:4f75ee8bb362581cdc16d2a8ba182124375f97907b7b307055a961abc47e1d41":"4f75ee8bb362581cdc16d2a8ba182124375f97907b7b307055a961abc47e1d41","artifact:3688:6a73e7d56c3212b7aa5e6bb2b2cbe9d3ab4d4b570825e82941e3e8c8b205f56f":"6a73e7d56c3212b7aa5e6bb2b2cbe9d3ab4d4b570825e82941e3e8c8b205f56f","artifact:3688:8f934b9eedf62bb916b2779438a237cbf6bcaa119a0aa7f752ccca38c2c68cd3":"8f934b9eedf62bb916b2779438a237cbf6bcaa119a0aa7f752ccca38c2c68cd3","artifact:3688:919ea999f8fc3431257cc3eb88c0834cafbacd7ec6f426f9a39cda5a888154c3":"919ea999f8fc3431257cc3eb88c0834cafbacd7ec6f426f9a39cda5a888154c3","artifact:3688:a45028c5942991723a1c060d74387a939f6401f9bd10960d9d421d620d568bd6":"a45028c5942991723a1c060d74387a939f6401f9bd10960d9d421d620d568bd6","artifact:3688:beccc2c5718e6066b4324e92453d108c9dfef4f4b7da9bc7a8b9ffed80535442":"beccc2c5718e6066b4324e92453d108c9dfef4f4b7da9bc7a8b9ffed80535442","artifact:3688:ede0df5e66736d1c30984e5afdd21b11c7e1069f040ffdbf5b28e5ba75b9b2f1":"ede0df5e66736d1c30984e5afdd21b11c7e1069f040ffdbf5b28e5ba75b9b2f1","artifact:3688:f1ad075c5f9989a3316dbeef0d61ffd15e0ec0d468317bdfbe66e7a54e68f9ac":"f1ad075c5f9989a3316dbeef0d61ffd15e0ec0d468317bdfbe66e7a54e68f9ac","artifact:3688:f2dedc8951e82f50da61517e557d63e538cfacce79ee1ed4d285c44150f31a13":"f2dedc8951e82f50da61517e557d63e538cfacce79ee1ed4d285c44150f31a13","artifact:3688:f45523bc38e047fd6858c48d7762b0e2d10328ac2c7b6e2bf277a3d727589343":"f45523bc38e047fd6858c48d7762b0e2d10328ac2c7b6e2bf277a3d727589343","artifact:3688:fe3188069c960a930902523e7305f03467920277d52d99d2e467716bc470adec":"fe3188069c960a930902523e7305f03467920277d52d99d2e467716bc470adec"},"version":"material-evidence-v1"},"consideration_only":true},"source_return_id":3688,"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 #3688: 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\":3688,\"report_sha256\":\"9c2c73efa79446df32dc48db0ce9e09187d0d637d0f9c7cb89efdbfd0ca77eac\",\"scope_hashes\":[],\"material_evidence\":{\"version\":\"material-evidence-v1\",\"entries\":{\"return:3688\":\"ea4c6e071764b3f9b00827222db03f7bd5b44f6fea4f835eef68788d4d61ad73\",\"review:3688:1:gpt-6.1-sol\":\"78fa9a7f0ddba7998280f7fc6fd7b2465f0645d7e28cfe531b2d64f921ed19ce\",\"artifact:3688:094c5146bbce091602471d3c8de8437318f7620d877035ab03fe05cf95d08e9a\":\"094c5146bbce091602471d3c8de8437318f7620d877035ab03fe05cf95d08e9a\",\"artifact:3688:1616a8c228f18f050d2b744de60e0c0e4f9dd6d28ecc57cf193fb09a31e68452\":\"1616a8c228f18f050d2b744de60e0c0e4f9dd6d28ecc57cf193fb09a31e68452\",\"artifact:3688:3433d3688366f10c30c864490148836083e9c3a283286d4373f8262c6784fc1a\":\"3433d3688366f10c30c864490148836083e9c3a283286d4373f8262c6784fc1a\",\"artifact:3688:3cd03a09fee953f08cbc6f9606f3628fa471ae2954173039ffba54b84be410b6\":\"3cd03a09fee953f08cbc6f9606f3628fa471ae2954173039ffba54b84be410b6\",\"artifact:3688:44c0a9a9c0dac1c630cfdeb183d2082c375fcfcd8f6de74545eaa4fd56e118f2\":\"44c0a9a9c0dac1c630cfdeb183d2082c375fcfcd8f6de74545eaa4fd56e118f2\",\"artifact:3688:4f75ee8bb362581cdc16d2a8ba182124375f97907b7b307055a961abc47e1d41\":\"4f75ee8bb362581cdc16d2a8ba182124375f97907b7b307055a961abc47e1d41\",\"artifact:3688:6a73e7d56c3212b7aa5e6bb2b2cbe9d3ab4d4b570825e82941e3e8c8b205f56f\":\"6a73e7d56c3212b7aa5e6bb2b2cbe9d3ab4d4b570825e82941e3e8c8b205f56f\",\"artifact:3688:8f934b9eedf62bb916b2779438a237cbf6bcaa119a0aa7f752ccca38c2c68cd3\":\"8f934b9eedf62bb916b2779438a237cbf6bcaa119a0aa7f752ccca38c2c68cd3\",\"artifact:3688:919ea999f8fc3431257cc3eb88c0834cafbacd7ec6f426f9a39cda5a888154c3\":\"919ea999f8fc3431257cc3eb88c0834cafbacd7ec6f426f9a39cda5a888154c3\",\"artifact:3688:a45028c5942991723a1c060d74387a939f6401f9bd10960d9d421d620d568bd6\":\"a45028c5942991723a1c060d74387a939f6401f9bd10960d9d421d620d568bd6\",\"artifact:3688:beccc2c5718e6066b4324e92453d108c9dfef4f4b7da9bc7a8b9ffed80535442\":\"beccc2c5718e6066b4324e92453d108c9dfef4f4b7da9bc7a8b9ffed80535442\",\"artifact:3688:ede0df5e66736d1c30984e5afdd21b11c7e1069f040ffdbf5b28e5ba75b9b2f1\":\"ede0df5e66736d1c30984e5afdd21b11c7e1069f040ffdbf5b28e5ba75b9b2f1\",\"artifact:3688:f1ad075c5f9989a3316dbeef0d61ffd15e0ec0d468317bdfbe66e7a54e68f9ac\":\"f1ad075c5f9989a3316dbeef0d61ffd15e0ec0d468317bdfbe66e7a54e68f9ac\",\"artifact:3688:f2dedc8951e82f50da61517e557d63e538cfacce79ee1ed4d285c44150f31a13\":\"f2dedc8951e82f50da61517e557d63e538cfacce79ee1ed4d285c44150f31a13\",\"artifact:3688:f45523bc38e047fd6858c48d7762b0e2d10328ac2c7b6e2bf277a3d727589343\":\"f45523bc38e047fd6858c48d7762b0e2d10328ac2c7b6e2bf277a3d727589343\",\"artifact:3688:fe3188069c960a930902523e7305f03467920277d52d99d2e467716bc470adec\":\"fe3188069c960a930902523e7305f03467920277d52d99d2e467716bc470adec\"},\"sha256\":\"dcb063a39b4d5c10588825514fba2d13e8f904907173face18166b17a675aa71\"},\"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:3688,input_sha256:\"cd3375c04c82d8f19a406b3d0a9492d1815776a60a3ddd50e3b9c631cc591351\",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/6641/transcript","files":[],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"report_sha256":"a4e37a2c6b7e309c36f9dc208d554063ae44fc57c9ba1b18fc6a32aa6ac43ab3","next_step_sha256":null,"research_authority":{"witness_status":null,"research_status":"recorded","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}