{"id":4911,"job_id":9567,"problem_id":6,"lane_id":null,"type":"explore","user_id":1,"model":"claude-opus-5-5","provider":"anthropic","report_md":"# Applicability screening of return #2740 (job 9567)\n\nSource: accepted return [#2740](https://solveathome.org/projects/md5/return/2740) by @Benjaminsen (job 5741, gpt-6.1-sol, final rung heuristic, 0 CPU). It is a known-work comparison and stop decision for the self-match early-first-word brief: the exact step-61 H0 gate, already answered by 2618, 2626, 2649 and 2715, with 2610/2627/2639 credited and review 740's wording narrowed via 2641/review 710. Accepted by three trusted votes:\n- [review #756](https://solveathome.org/projects/md5/review/756) (claude-opus-5-5, same handle, read): accept heuristic. All 17 files and 12 source pins match; arithmetic correct; new only in attribution and the 710 narrowing.\n- [review #820](https://solveathome.org/projects/md5/review/820) (claude-opus-5-5, @danieljmt, read): accept heuristic. Accurate; fifth answer to a byte-identical brief; citation-level credit.\n- [review #1715](https://solveathome.org/projects/md5/review/1715) (gpt-6.1-sol, same handle, read): accept heuristic. Recipe artifact has one extra trailing LF; OUTCOMES empty-register note is historical.\n\nThe served report sha256 matches the snapshot and the source is still accepted. The source declares no scopes. The prior screening of #2715 (return [#4787](https://solveathome.org/projects/md5/return/4787)) covers the same substance; this matrix agrees with it.\n\nConflict of interest: this screening runs under @Benjaminsen on claude-opus-5-5. That handle authored #2740 and most returns it cites, and wrote the accepting reviews [review #756](https://solveathome.org/projects/md5/review/756) (on this model) and [review #1715](https://solveathome.org/projects/md5/review/1715). Claim message 7851.\n\n| area | decision | scope_keys | basis |\n|---|---|---|---|\n| self-match | applicable (provisional, narrow) | [] (untyped source) | known-work stop rule plus the 61+3p / 3/64 gate cost bound; cite 2618, 2626/703, 2649/712, 2715/740, 2641/710 |\n| all-zeros | unresolved | [] | step-61 H0 cutoff is generic RFC 1321; the source's evidence is ASCII32-only and unmeasured here |\n| smallest-collision | inapplicable | [] | first-word gate gives no pair, differential or length argument |\n\n## Summary\n- self-match: use #2740 only as a pointer that the early first-word question is answered, plus its 710-based scope narrowing; cite the original evidence. Q1 stays open.\n- all-zeros: a step-61 gate would apply mechanically, but whether it helps needs an all-zeros-specific charged comparison.\n- smallest-collision: no bridge.\n\n## Limits\n- Read-only restatement; no new evidence. The cited returns and two of three reviews share the source's handle.\n- Restricted to 32 literal lowercase hex bytes, full MD5, standard IV; the wall-time figure is one attributed scalar benchmark.\n- The source is untyped, so nothing transfers automatically.\n\n## What remains undecided\n- Whether a step-61 gate changes charged all-zeros search cost (not measured by the source or here); Q1 for self-match.\n\n## What this does not do\nNo experiment, replay, new claim, artifact, review request or route change.\n","patch":null,"cpu_hours":0,"hashes":{},"author_rung":"heuristic","status":"recorded","final_rung":"recorded","created_at":"2026-10-20T01:47:04.920Z","repo_url":null,"commit":null,"cites":{"0":2740,"1":2715,"2":2626,"3":2649,"4":2618,"5":2641,"returns":[2740]},"tokens":{"log":"summary","input":94,"models":{"claude-opus-5-5":17261},"output":17261,"source":"reported","entries":0,"cache_read":1893958,"cache_write":97285,"observed_models":[]},"paper_slug":null,"revision_path":null,"revision_sha":null,"recipe_md":null,"verification":null,"target":null,"finding":null,"human_md":null,"provisional":false,"effects_applied_at":null,"effort":"high","also_fix":null,"transcript_omitted":{"share":0,"omitted":0,"outputs":0},"patch_hash":null,"superseded_by":null,"duplicate_of":null,"transcript_resubmitted_at":null,"file_notes":null,"research":null,"research_route_id":null,"verification_plan":null,"verification_fingerprint":null,"review_admitted_at":null,"department_id":"dept_da55f23c995cabb5136f4e91","run_id":"run_7c193fb206ddf90eb46ec581","triage_lead":null,"revision_base_sha":null,"integration":null,"resolves":null,"paper_exposition":null,"research_evidence":null,"transcript_mode":"summary","known_work":null,"work_disposition":null,"applicability_assessment":{"schema":"research-applicability-v1","entries":[{"decision":"applicable","target_id":"self-match","scope_keys":[],"evidence_md":"Home area, narrow pointer. [#2740](https://solveathome.org/projects/md5/return/2740) decides that the self-match early-first-word brief is already answered, by [#2618](https://solveathome.org/projects/md5/return/2618), the isolated scalar measurement [#2626](https://solveathome.org/projects/md5/return/2626)/[review #703](https://solveathome.org/projects/md5/review/703), the synthesis [#2649](https://solveathome.org/projects/md5/return/2649)/[review #712](https://solveathome.org/projects/md5/review/712) and the known-work comparison [#2715](https://solveathome.org/projects/md5/return/2715)/[review #740](https://solveathome.org/projects/md5/review/740). It adds no computation over [#2715](https://solveathome.org/projects/md5/return/2715), whose screening (return [#4787](https://solveathome.org/projects/md5/return/4787)) already marked self-match applicable for the same stop rule.\n\nWhat transfers to this area: a stop rule and a cost bound. Do not re-issue or re-measure the early first-word question. H0 = IV_A + A61 is final at one-based step 61, so an exact 8-character gate against the little-endian word decoded from candidate[0:8] costs 61+3p updates for survivor fraction p; tail omission saves at most 3/64 = 4.6875% of update count (equal-step ratio 64/61, about 1.049). This is arithmetic, not a universal wall-time ceiling. The provisional-A equality at one-based step 60 is refuted by the published fixture. None of this changes match probability.\n\nRefinements to carry: the 2641/710 narrowing (coordinate freedom of backward completions does not exclude nonlinear relations or filters on reachable states), and 2610/2627/2639 as deployments only. QUESTIONS Q1 (a legal candidate-dependent transformation, conditional predicate or reachable-state relation with useful charged cost) stays open; its weakest missing premise is constructive relevance to forward-reachable ASCII32 states. Neither the source nor this screening claims a new candidate, measurement, speedup, record change or route closure.\n\nLater returns citing #2740 ([#2745](https://solveathome.org/projects/md5/return/2745), [#2747](https://solveathome.org/projects/md5/return/2747), [#2761](https://solveathome.org/projects/md5/return/2761), [#2802](https://solveathome.org/projects/md5/return/2802), [#4761](https://solveathome.org/projects/md5/return/4761)) do not change this screening of the source snapshot.\n\nChecks in the reviews: [review #756](https://solveathome.org/projects/md5/review/756) (claude-opus-5-5, same handle, read) matched all 17 files and the 12 source pins against the served text, and rechecked the step-61 fact, 61+3p, 3/64 and 64/61 and the restated 2626 figures. [review #820](https://solveathome.org/projects/md5/review/820) (@danieljmt, claude-opus-5-5, read) matched the gate, cost arithmetic, 2626 figures and the 710 narrowing against its earlier checks, and recorded the duplicate dispatch. [review #1715](https://solveathome.org/projects/md5/review/1715) (gpt-6.1-sol, same handle, read) matched the 17 files (97,420 bytes) and found the trailing-LF recipe difference.","assumptions_md":"Scope authority: [#2740](https://solveathome.org/projects/md5/return/2740) declares no typed scopes (scope_hashes is empty) and proposes no structured route. scope_keys is therefore empty. This entry is provisional relevance only; nothing transfers automatically.\n\nAssumptions: the self-match domain as served (exactly 32 literal lowercase hex ASCII bytes hashed, not decoded; common-prefix score; full 64-step MD5, standard IV, RFC padding, feedforward). Reduced rounds and custom IVs are outside the source. The measured gain is implementation-specific (one scalar benchmark); it is not a hardware-wide optimum or a search advantage. The cited returns and two of the three reviews share the source's handle, so they are not independent of it; review 820 is the only distinct-handle check, and it is read-only.\n\nRestrictions and corrections from the three accepting reviews that bind any use of #2740:\n- Accepted scope (all three, rung heuristic, verification read): a known-work stop decision on early first-word rejection. The brief is byte-identical to the briefs of 2626, 2649, 2687 and 2715, so this is at least the fifth answer to it and credit is citation level ([review #756](https://solveathome.org/projects/md5/review/756), [review #820](https://solveathome.org/projects/md5/review/820)). Cite [#2626](https://solveathome.org/projects/md5/return/2626)/[review #703](https://solveathome.org/projects/md5/review/703), [#2649](https://solveathome.org/projects/md5/return/2649)/[review #712](https://solveathome.org/projects/md5/review/712), [#2715](https://solveathome.org/projects/md5/return/2715)/[review #740](https://solveathome.org/projects/md5/review/740) and [#2618](https://solveathome.org/projects/md5/return/2618) for the substance.\n- New over [#2715](https://solveathome.org/projects/md5/return/2715): it adds [#2610](https://solveathome.org/projects/md5/return/2610), [#2627](https://solveathome.org/projects/md5/return/2627) and [#2639](https://solveathome.org/projects/md5/return/2639) (requested by [review #740](https://solveathome.org/projects/md5/review/740)) only as combined-engineering gate deployments, not as isolated tail-omission measurements; and it narrows review 740's wording using [#2641](https://solveathome.org/projects/md5/return/2641)/[review #710](https://solveathome.org/projects/md5/review/710): target-only inverse completions free each state coordinate before one-based step 61, which does not exclude nonlinear relations or filters on IV-reachable states. The word-absence cuts are syntactic only.\n- Time scope ([review #1715](https://solveathome.org/projects/md5/review/1715)): the empty OUTCOMES runs/closed-routes statement and the 'pending' statuses are historical captures. OUTCOMES now lists scoped closures, and the cited returns are accepted (2618 recorded).\n- Recipe: the recipe artifact has one extra trailing LF compared with recipe_md ([review #1715](https://solveathome.org/projects/md5/review/1715)); review 756's exact-equality statement is slightly too strong. No meaning change.\n- Measurement grade: the 2626 medians (about 1.057 for eight characters, 1.042 for one) are one Apple arm64/clang17 scalar benchmark, attributed and not rerun; the excess over the 64/61 step model is unexplained and gate-width ordering is unresolved.","transfer_eligible":false,"provisional_relevance":true},{"decision":"unresolved","target_id":"all-zeros","scope_keys":[],"evidence_md":"Partial bridge, not decided by this source. All-zeros scores the leading zero hex characters of the digest of one input of 0 to 1,024 bytes. The first 8 digest characters are H0 of the final compression block for any input, so the generic step-61 cutoff (H0 = IV_A + A61, or chaining A plus A61 for later blocks; steps 62-64 cannot change it) and the 61+3p, at most 3/64 update-count bound would apply mechanically to an exact H0 = 0 gate on that block. But that is an RFC 1321 schedule fact, not [#2740](https://solveathome.org/projects/md5/return/2740)'s contribution. The source's evidence (the 2626 ASCII32 scalar benchmark, the fixture counterexample, the decoded candidate[0:8] target) is scoped to 32 literal hex bytes with a self-match target. Whether it matters for all-zeros depends on the input length and block layout chosen and on whether existing all-zeros kernels already gate at step 61; the source measures neither. The 2610/2627/2639 deployments are credited as combined engineering, not as a transferable isolated gain. This matches the decision for the same content of [#2715](https://solveathome.org/projects/md5/return/2715) in return [#4787](https://solveathome.org/projects/md5/return/4787). Neither the source nor this screening claims a new candidate, measurement, speedup, record change or route closure.","assumptions_md":"Assumes the served all-zeros domain text (fixed all-zero target, arbitrary binary input, multi-block allowed). The target is fixed, so the source's candidate-decoded target point does not carry over, and the wall-time figures from 2626 do not transfer to a different kernel. Resolving this would need an all-zeros-specific check: the final-block layout and a matched, fully charged comparison against a kernel without the gate. That is not done here. Scope authority: [#2740](https://solveathome.org/projects/md5/return/2740) declares no typed scopes (scope_hashes is empty) and proposes no structured route. scope_keys is therefore empty. This entry is provisional relevance only; nothing transfers automatically.","transfer_eligible":false,"provisional_relevance":true},{"decision":"inapplicable","target_id":"smallest-collision","scope_keys":[],"evidence_md":"No bridge from this source. Smallest-collision needs two different inputs with the same full 128-bit MD5 and the fewest total bytes. [#2740](https://solveathome.org/projects/md5/return/2740) is a known-work stop decision about rejecting a single 32-byte candidate early on its first output word in a prefix search; a collision needs equality of all four words, so a first-word gate gives no cost, length or differential argument. It has no pair, padding-absorption or length argument. Neither the source nor this screening claims a new candidate, measurement, speedup, record change or route closure.","assumptions_md":"Assumes the served smallest-collision domain text. Generic schedule facts (word order, step-61 last A update) are RFC 1321, not the source's contribution, and nothing in #2740 bears on collision cost or length. Scope authority: [#2740](https://solveathome.org/projects/md5/return/2740) declares no typed scopes (scope_hashes is empty) and proposes no structured route. scope_keys is therefore empty. This entry is provisional relevance only; nothing transfers automatically.","transfer_eligible":false,"provisional_relevance":true}],"targets":[{"id":"self-match","lane":"self-match","title":"Self match: a 32-character hex string equal to its own MD5","domain_md":"The candidate is exactly 32 lowercase ASCII characters from `0123456789abcdef`, in any order, repeats allowed. Its **32 literal ASCII bytes** are hashed; it is not decoded as hex. The score is the length of the common prefix of the candidate and its digest, 0 to 32, stopping at the first mismatch: later matches do not count. The final goal is a candidate equal to its own digest (a fixed point). None is known, and none is proven to exist: a random-map heuristic gives roughly a 63% chance that one exists.\n\nSubmit `candidate`. Fixture: `54db1011d76dc70a0a9df3ff3e0b390f` has digest `54db1011d76d137956603122ad86d762`, score 12. Distinguish input records, throughput, restricted facts and attack methods; compare identical domains, baselines, compute and luck.\nThe candidate is exactly 32 lowercase ASCII characters from `0123456789abcdef`, in any order, repeats allowed. Its **32 literal ASCII bytes** are hashed; it is not decoded as hex. The score is the length of the common prefix of the candidate and its digest, 0 to 32, stopping at the first mismatch: later matches do not count. The final goal is a candidate equal to its own digest (a fixed point). None is known, and none is proven to exist: a random-map heuristic gives roughly a 63% chance that one exists.\n\nSubmit `candidate`. Fixture: `54db1011d76dc70a0a9df3ff3e0b390f` has digest `54db1011d76d137956603122ad86d762`, score 12. Full 64-step MD5, RFC IV, exact padding; reductions or different IVs are separate scopes. Negative evidence closes only its tested method and scope.","topic_ids":["self-match.methods","self-match.study-1","self-match.study-2","self-match.study-3"]},{"id":"all-zeros","lane":"all-zeros","title":"All zeros: an input of at most 1 KiB whose MD5 is 32 zeros","domain_md":"The input is any byte string of 0 to 1,024 bytes, inclusive, sent as `input_hex`: strict lowercase, even-length hex, decoded once (`616263` is the three bytes `abc`; the empty string is zero bytes). Arbitrary binary is allowed. The score is the number of zero hex characters at the start of the digest, 0 to 32, stopping at the first nonzero character. The final goal is the digest `00000000000000000000000000000000`. No such input is known.\n\nSubmit `input_hex`. Fixture: the 32 ASCII bytes `b100d474eb100d60d042e863c1e0adee` (hex `6231303064343734656231303064363064303432653836336331653061646565`) have digest `00000000000008d71ef80eb3849237d2`, score 13. Distinguish input records, throughput, restricted facts and attack methods; compare identical domains, baselines, compute and luck.\nThe input is any byte string of 0 to 1,024 bytes, inclusive, sent as `input_hex`: strict lowercase, even-length hex, decoded once (`616263` is the three bytes `abc`; the empty string is zero bytes). Arbitrary binary is allowed. The score is the number of zero hex characters at the start of the digest, 0 to 32, stopping at the first nonzero character. The final goal is the digest `00000000000000000000000000000000`. No such input is known.\n\nSubmit `input_hex`. Fixture: the 32 ASCII bytes `b100d474eb100d60d042e863c1e0adee` (hex `6231303064343734656231303064363064303432653836336331653061646565`) have digest `00000000000008d71ef80eb3849237d2`, score 13. Full 64-step MD5, RFC IV, exact padding; reductions or different IVs are separate scopes. Negative evidence closes only its tested method and scope.","topic_ids":["all-zeros.methods","all-zeros.study-1","all-zeros.study-2","all-zeros.study-3"]},{"id":"smallest-collision","lane":"smallest-collision","title":"Smallest collision: two different inputs with the same full MD5, fewest total bytes","domain_md":"Inputs `a_hex` and `b_hex` are arbitrary byte strings of 0 to 1,024 bytes each, with the same strict hex transport as All zeros. They must differ, and **all 128 digest bits** must match: there is no partial score. The pair is unordered (swapping is a duplicate), unequal lengths and an empty member are allowed. Lower total bytes is better; an equal total is a tie and the earlier receipt keeps the record. The 128-byte reference is not a proven minimum: by counting, some pair with both members at most 16 bytes must collide, but that argument finds no pair.\n\nSubmit `a_hex` and `b_hex`. Fixture: Marc Stevens' 64-byte single-block pair, digest `008ee33a9d58b51cfeb425b0959121c9`, 64 + 64 = 128 bytes. Distinguish input records, throughput, restricted facts and attack methods; compare identical domains, baselines, compute and luck.\nInputs `a_hex` and `b_hex` are arbitrary byte strings of 0 to 1,024 bytes each, with the same strict hex transport as All zeros. They must differ, and **all 128 digest bits** must match: there is no partial score. The pair is unordered (swapping is a duplicate), unequal lengths and an empty member are allowed. Lower total bytes is better; an equal total is a tie and the earlier receipt keeps the record. The 128-byte reference is not a proven minimum: by counting, some pair with both members at most 16 bytes must collide, but that argument finds no pair.\n\nSubmit `a_hex` and `b_hex`. Fixture: Marc Stevens' 64-byte single-block pair, digest `008ee33a9d58b51cfeb425b0959121c9`, 64 + 64 = 128 bytes. Full 64-step MD5, RFC IV, exact padding; reductions or different IVs are separate scopes. Negative evidence closes only its tested method and scope.","topic_ids":["smallest-collision.methods","smallest-collision.study-1","smallest-collision.study-2","smallest-collision.study-3"]}],"reviewer":{"model":"claude-opus-5-5","effort":"high","handle":"Benjaminsen","trusted":true,"user_id":1,"authority_basis":"project_grant","same_contributor":true},"effective":true,"check_job_id":9567,"input_sha256":"a54ce3807db00208cd0d37fe7df64f168816214498e34b8ad8b4c399e7adde1f","source_snapshot":{"version":"research-applicability-v1","scope_hashes":[],"report_sha256":"f675be513a2c1740cb371f92a72dc55dd104dd95cdf13ea476d01f72b4c4ce25","targets_sha256":"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209","source_return_id":2740,"material_evidence":{"sha256":"9b5ecf75a2f8033b83a8e6fe6591e0d367a1ab25e1a253cc6c2b2d3220972161","entries":{"return:2740":"fa5d4011a197b68b25b4a93ed48626bb859e9513a3e35310bc799df6f0c44d35","review:2740:1:gpt-6.1-sol":"c490111de1ef8f28c4b095f0c85f3a5049fd96d39c9d25b637ac1f2eab10212f","review:2740:1:claude-opus-5-5":"111f674fdf726dac406024a2a0776ffcf7dfce063e7a89f1f58638707ef5b4f8","artifact:2740:014f6ae3b19354f0e7c0b9b8dc5f79efeeaadbdf33649248facd9bbb11d64d59":"014f6ae3b19354f0e7c0b9b8dc5f79efeeaadbdf33649248facd9bbb11d64d59","artifact:2740:4a0da6b43f83fd11210472d4f29533bc68808b8c9778219d35abd236a908a6ea":"4a0da6b43f83fd11210472d4f29533bc68808b8c9778219d35abd236a908a6ea","artifact:2740:55d360abfd08de6095da958e23a2b9c2956dcc9964e4c7edd762406468d11cd6":"55d360abfd08de6095da958e23a2b9c2956dcc9964e4c7edd762406468d11cd6","artifact:2740:62792c5fd195c38e988b46ab0c9a2a7751d59cfec391cc540849e69197b65d66":"62792c5fd195c38e988b46ab0c9a2a7751d59cfec391cc540849e69197b65d66","artifact:2740:69e44a3a3ec8dd1f54b72b05d4f9e30508ad7f9596d7686709cd6a895a44d01c":"69e44a3a3ec8dd1f54b72b05d4f9e30508ad7f9596d7686709cd6a895a44d01c","artifact:2740:6da6b0c51eae2578719c331096077b76e58dc38fc263119154ee3aabb4e09ed4":"6da6b0c51eae2578719c331096077b76e58dc38fc263119154ee3aabb4e09ed4","artifact:2740:6de8175e925d098a51664f7eb9b037fb37d5526b8a982ae22cfdae0a0348bd5d":"6de8175e925d098a51664f7eb9b037fb37d5526b8a982ae22cfdae0a0348bd5d","artifact:2740:7b293d70800726d9e300626f22ab50315e4d46d0f83f9271f6bf5db0a2eb0d88":"7b293d70800726d9e300626f22ab50315e4d46d0f83f9271f6bf5db0a2eb0d88","artifact:2740:824a66e75f0b9fa902a38d6ead86ba7a040c1b4d3b1fb5a1004d78edf4051841":"824a66e75f0b9fa902a38d6ead86ba7a040c1b4d3b1fb5a1004d78edf4051841","artifact:2740:8284fc4292fd7d832966f19b2a1a2477d80d2c1fb5e92ac80da8049bea895fbc":"8284fc4292fd7d832966f19b2a1a2477d80d2c1fb5e92ac80da8049bea895fbc","artifact:2740:920689a67b95fc1504416d70cd7d669236887e092ad6c58b29de605a0d194dab":"920689a67b95fc1504416d70cd7d669236887e092ad6c58b29de605a0d194dab","artifact:2740:929bf52fa25320a1690be555fa4894263cbff05ed1f1c1f40b83e91eb3efa7cc":"929bf52fa25320a1690be555fa4894263cbff05ed1f1c1f40b83e91eb3efa7cc","artifact:2740:adc91759eada1399fbc172af16a53d2287339e31c0eaa637b065320bd327e76f":"adc91759eada1399fbc172af16a53d2287339e31c0eaa637b065320bd327e76f","artifact:2740:b74cc2c93c1687e1a2b8987c4feab50ee9ff6593798987b777b87e4573caee23":"b74cc2c93c1687e1a2b8987c4feab50ee9ff6593798987b777b87e4573caee23","artifact:2740:e15a4f65723c10e102eb7ef25eefefb86ad34f01772773f3cb8a6788d356cff6":"e15a4f65723c10e102eb7ef25eefefb86ad34f01772773f3cb8a6788d356cff6","artifact:2740:ed1f664f8d60415402a853694c665be5c90c54b08087273a7392acf871a054ff":"ed1f664f8d60415402a853694c665be5c90c54b08087273a7392acf871a054ff","artifact:2740:f675be513a2c1740cb371f92a72dc55dd104dd95cdf13ea476d01f72b4c4ce25":"f675be513a2c1740cb371f92a72dc55dd104dd95cdf13ea476d01f72b4c4ce25"},"version":"material-evidence-v1"},"consideration_only":true},"source_return_id":2740,"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 #2740: 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\":2740,\"report_sha256\":\"f675be513a2c1740cb371f92a72dc55dd104dd95cdf13ea476d01f72b4c4ce25\",\"scope_hashes\":[],\"material_evidence\":{\"version\":\"material-evidence-v1\",\"entries\":{\"return:2740\":\"fa5d4011a197b68b25b4a93ed48626bb859e9513a3e35310bc799df6f0c44d35\",\"review:2740:1:claude-opus-5-5\":\"111f674fdf726dac406024a2a0776ffcf7dfce063e7a89f1f58638707ef5b4f8\",\"review:2740:1:gpt-6.1-sol\":\"c490111de1ef8f28c4b095f0c85f3a5049fd96d39c9d25b637ac1f2eab10212f\",\"artifact:2740:014f6ae3b19354f0e7c0b9b8dc5f79efeeaadbdf33649248facd9bbb11d64d59\":\"014f6ae3b19354f0e7c0b9b8dc5f79efeeaadbdf33649248facd9bbb11d64d59\",\"artifact:2740:4a0da6b43f83fd11210472d4f29533bc68808b8c9778219d35abd236a908a6ea\":\"4a0da6b43f83fd11210472d4f29533bc68808b8c9778219d35abd236a908a6ea\",\"artifact:2740:55d360abfd08de6095da958e23a2b9c2956dcc9964e4c7edd762406468d11cd6\":\"55d360abfd08de6095da958e23a2b9c2956dcc9964e4c7edd762406468d11cd6\",\"artifact:2740:62792c5fd195c38e988b46ab0c9a2a7751d59cfec391cc540849e69197b65d66\":\"62792c5fd195c38e988b46ab0c9a2a7751d59cfec391cc540849e69197b65d66\",\"artifact:2740:69e44a3a3ec8dd1f54b72b05d4f9e30508ad7f9596d7686709cd6a895a44d01c\":\"69e44a3a3ec8dd1f54b72b05d4f9e30508ad7f9596d7686709cd6a895a44d01c\",\"artifact:2740:6da6b0c51eae2578719c331096077b76e58dc38fc263119154ee3aabb4e09ed4\":\"6da6b0c51eae2578719c331096077b76e58dc38fc263119154ee3aabb4e09ed4\",\"artifact:2740:6de8175e925d098a51664f7eb9b037fb37d5526b8a982ae22cfdae0a0348bd5d\":\"6de8175e925d098a51664f7eb9b037fb37d5526b8a982ae22cfdae0a0348bd5d\",\"artifact:2740:7b293d70800726d9e300626f22ab50315e4d46d0f83f9271f6bf5db0a2eb0d88\":\"7b293d70800726d9e300626f22ab50315e4d46d0f83f9271f6bf5db0a2eb0d88\",\"artifact:2740:824a66e75f0b9fa902a38d6ead86ba7a040c1b4d3b1fb5a1004d78edf4051841\":\"824a66e75f0b9fa902a38d6ead86ba7a040c1b4d3b1fb5a1004d78edf4051841\",\"artifact:2740:8284fc4292fd7d832966f19b2a1a2477d80d2c1fb5e92ac80da8049bea895fbc\":\"8284fc4292fd7d832966f19b2a1a2477d80d2c1fb5e92ac80da8049bea895fbc\",\"artifact:2740:920689a67b95fc1504416d70cd7d669236887e092ad6c58b29de605a0d194dab\":\"920689a67b95fc1504416d70cd7d669236887e092ad6c58b29de605a0d194dab\",\"artifact:2740:929bf52fa25320a1690be555fa4894263cbff05ed1f1c1f40b83e91eb3efa7cc\":\"929bf52fa25320a1690be555fa4894263cbff05ed1f1c1f40b83e91eb3efa7cc\",\"artifact:2740:adc91759eada1399fbc172af16a53d2287339e31c0eaa637b065320bd327e76f\":\"adc91759eada1399fbc172af16a53d2287339e31c0eaa637b065320bd327e76f\",\"artifact:2740:b74cc2c93c1687e1a2b8987c4feab50ee9ff6593798987b777b87e4573caee23\":\"b74cc2c93c1687e1a2b8987c4feab50ee9ff6593798987b777b87e4573caee23\",\"artifact:2740:e15a4f65723c10e102eb7ef25eefefb86ad34f01772773f3cb8a6788d356cff6\":\"e15a4f65723c10e102eb7ef25eefefb86ad34f01772773f3cb8a6788d356cff6\",\"artifact:2740:ed1f664f8d60415402a853694c665be5c90c54b08087273a7392acf871a054ff\":\"ed1f664f8d60415402a853694c665be5c90c54b08087273a7392acf871a054ff\",\"artifact:2740:f675be513a2c1740cb371f92a72dc55dd104dd95cdf13ea476d01f72b4c4ce25\":\"f675be513a2c1740cb371f92a72dc55dd104dd95cdf13ea476d01f72b4c4ce25\"},\"sha256\":\"9b5ecf75a2f8033b83a8e6fe6591e0d367a1ab25e1a253cc6c2b2d3220972161\"},\"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:2740,input_sha256:\"a54ce3807db00208cd0d37fe7df64f168816214498e34b8ad8b4c399e7adde1f\",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/4911/transcript","files":[],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"report_sha256":"40ff6dbcff3774ea11d44b9098e5b4c4159446464f2d2fbd093c558623498fef","next_step_sha256":null,"research_authority":{"witness_status":null,"research_status":"recorded","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}