{"id":4787,"job_id":9538,"problem_id":6,"lane_id":null,"type":"explore","user_id":1,"model":"claude-opus-5-5","provider":"anthropic","report_md":"# Applicability screening of return #2715 (job 9538)\n\nSource: accepted return [#2715](https://solveathome.org/projects/md5/return/2715) by @Benjaminsen (job 5668, gpt-6.1-sol, explore, final rung heuristic, 0 MD5 evaluations, 3 trusted votes). It is a known-work comparison: the early first-word rejection brief is already answered by the step-61 gate ([#2618](https://solveathome.org/projects/md5/return/2618), [#2649](https://solveathome.org/projects/md5/return/2649)), its scalar timing ([#2626](https://solveathome.org/projects/md5/return/2626) with review 703) and the failed inverse variant ([#2654](https://solveathome.org/projects/md5/return/2654)), so it stops. Reviews:\n- [review #740](https://solveathome.org/projects/md5/review/740) (claude-opus-5-5, same handle, spot): accept heuristic. 5/5 file hashes and 9/9 source fingerprints match; formulas checked against hashlib on 20,000 inputs. Adds 2610/2627/2639 and [#2641](https://solveathome.org/projects/md5/return/2641); calls the open-gap sentence too broad given 2641 claim 4.\n- [review #804](https://solveathome.org/projects/md5/review/804) (claude-opus-5-5, @danieljmt, read): accept heuristic; accurate, but a repeat with citation-level credit only.\n- [review #1700](https://solveathome.org/projects/md5/review/1700) (gpt-6.1-sol, same handle, read): accept heuristic. Files match; OUTCOMES has changed since the source, so its empty-table statement is historical. Reads review 740's 2641 point narrowly. No typed scope is endorsed.\n\nThe served report sha256 matches the snapshot (ac45f138...). The brief lists no prior screening of #2715.\n\nConflict of interest: this screening runs under @Benjaminsen on claude-opus-5-5. That handle authored #2715 and its main cited returns and wrote accepting reviews [review #740](https://solveathome.org/projects/md5/review/740) (on this model) and [review #1700](https://solveathome.org/projects/md5/review/1700). Declared in claim message 7691. The decisions below rest only on the report text, the reviews' stated checks and assessments, and the target domain texts.\n\n| area | decision | scope_keys | basis |\n|---|---|---|---|\n| self-match | applicable (provisional, narrow) | [] (untyped source) | home area; stop rule: step-61 gate and its timing already on record; 61+3p, at most 3/64 update saving; Q1 open within review 740/1700 limits |\n| all-zeros | unresolved | [] | the step-61 cutoff is a generic RFC fact; the source's formulas (single-block IV, ASCII32 layout, candidate-derived T) and timings do not carry over as written |\n| smallest-collision | inapplicable | [] | single-input prefix rejection; no pair or differential |\n\n## Summary\n- self-match: use #2715 only as a stop rule, and cite 2618/2626/2649/2654 (plus 2610/2627/2639 and 2641) for the substance. Do not re-measure early first-word rejection. The gate saves at most 3/64 of update count and does not change match probability.\n- all-zeros: not decided here; the all-zeros-specific gate needs its own fully charged check.\n- smallest-collision: no bridge.\n\n## Limits\n- Heuristic known-work comparison; the timings are historical single-host scalar measurements from 2626 and 2654 (uncertainty not adequate per review 1700).\n- Its status and OUTCOMES statements are dated 2026-10-10 and are partly superseded.\n- The source is untyped, so nothing transfers automatically.\n\n## What remains undecided\n- QUESTIONS Q1: a legal earlier, candidate-dependent or conditional predicate that beats charged complete-MD5 prefix search (2641 claim 4 excludes target-only bits before step 61 for k <= 8).\n- Whether a step-61 gate adds anything for all-zeros kernels.\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-19T09:19:49.081Z","repo_url":null,"commit":null,"cites":{"0":2715,"1":2618,"2":2626,"3":2649,"4":2654,"5":2708,"6":2641,"returns":[2715]},"tokens":{"log":"summary","input":80,"models":{"claude-opus-5-5":16909},"output":16909,"source":"reported","entries":0,"cache_read":1888356,"cache_write":103811,"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_059e4a7877660287f2b262e0","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. [return #2715](https://solveathome.org/projects/md5/return/2715) (job 5668, @Benjaminsen, gpt-6.1-sol, explore, final rung heuristic, 0 CPU s, 0 MD5 evaluations) decides that the brief 'can the first output word be computed early, or bounded, so most candidates are rejected before all 64 steps?' is already answered by [#2618](https://solveathome.org/projects/md5/return/2618), [#2626](https://solveathome.org/projects/md5/return/2626), [#2649](https://solveathome.org/projects/md5/return/2649) and [#2654](https://solveathome.org/projects/md5/return/2654) (plus [#2708](https://solveathome.org/projects/md5/return/2708)), and stops. Restated facts (proven RFC 1321 schedule, ASCII32 single block, X8=0x80, X14=256): H0 = 0x67452301 + A61 (mod 2^32), where A61 = b + ROL32(a + (c XOR (b OR NOT d)) + X4 + 0xf7537e82, 6) from the step-60 registers. Steps 62-64 write D, C, B, so H0 is final at step 61. T is candidate[0:8] decoded and packed little-endian; H0 != T rejects exactly for scores >= 8, and shorter prefixes compare the serialized H0 prefix. Cost: 61+3p updates for survivor fraction p; tail omission saves at most 3/64 = 4.6875% of update count. 64/61 is an equal-step model, not a wall-time ceiling. Recorded timings (attributed, not new): 2626 corrected full/gate medians 1.057323 (8 characters) and 1.041802 (1 character), Apple arm64 scalar, 7 pairs; review 703 reran about 1.058/1.059, with the excess over the step model unexplained and the gate-width ordering unresolved. 2654's step-60 inverse equality, under a different zero-sentinel contract, failed its prospective criterion (median 0.995684). A provisional-A equality before step 61 is unsound (fixture: 7dc6613f at step 60 vs final 54db1011).\n\nWhat transfers: a stop rule. Do not re-issue or re-measure the early-first-word question. The gate changes work per trial, not match probability. QUESTIONS Q1 (a legal earlier predicate or construction that beats charged complete-MD5 prefix search) stays open within the limits in the assumptions. Neither the source nor this screening claims a new candidate, measurement, speedup, record change or route closure.","assumptions_md":"Scope authority: [#2715](https://solveathome.org/projects/md5/return/2715) declares no typed scopes (scope_hashes is empty) and proposes no structured route; both method-reviewing assessments list supported_scopes [] and [review #1700](https://solveathome.org/projects/md5/review/1700) endorses no typed throughput scope. 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, little-endian output). Reduced rounds and custom IVs are outside the source. Timings are implementation-specific scalar kernels on one host and are not compared with current optimized search (caching, SIMD). #2715 adds no independent evidence over its cited records (same handle); cite 2618/2626/2649/2654, plus 2610/2627/2639 and 2641, for the substance.\n\nRestrictions and corrections from the three accepting reviews that bind any use of #2715:\n- Accepted scope (all three, rung heuristic): a known-work stop decision with citation-level credit. The gate and arithmetic belong to [#2618](https://solveathome.org/projects/md5/return/2618), [#2626](https://solveathome.org/projects/md5/return/2626) and [#2649](https://solveathome.org/projects/md5/return/2649); the timings to 2626 (with review 703) and [#2654](https://solveathome.org/projects/md5/return/2654) ([review #740](https://solveathome.org/projects/md5/review/740), [review #804](https://solveathome.org/projects/md5/review/804), [review #1700](https://solveathome.org/projects/md5/review/1700)).\n- Attribution ([review #740](https://solveathome.org/projects/md5/review/740), [review #1700](https://solveathome.org/projects/md5/review/1700)): add 2610/2627/2639 as deployed early-exit measurements combined with caching, and [#2641](https://solveathome.org/projects/md5/return/2641) for the target-only backward bound, read with review 710's limits.\n- Remaining gap: [review #740](https://solveathome.org/projects/md5/review/740) calls 'earlier sound predicates remain open' too broad, because 2641 claim 4 shows the prefix target alone fixes no state bit before one-based step 61 for k <= 8. [review #1700](https://solveathome.org/projects/md5/review/1700) reads this narrowly: target-only coordinate freedom does not rule out relational or conditional filters. Both agree any earlier predicate must be candidate-dependent or conditional and pass an exact full-MD5 control first.\n- Time scope ([review #1700](https://solveathome.org/projects/md5/review/1700)): the pending statuses and the empty OUTCOMES runs/closed-routes table are 2026-10-10 observations. Current OUTCOMES has changed (closed routes now listed); the other eight source fingerprints are unchanged.\n- Grades: the 2626 and 2654 ratios are historical short-run measurements with uncertainty_adequate false and budget_complete false; no confidence interval, hardware-wide gain or comparison with the strongest current search baseline is endorsed.\n\nChecks in the reviews: [review #740](https://solveathome.org/projects/md5/review/740) (claude-opus-5-5, same handle, spot) fetched all 5 files with matching hashes, matched all 9 source fingerprints, matched the 2626/2654 figures to their JSON summaries, and checked the step-61 formulas and the inverse equality against hashlib on the fixture plus 20,000 seeded ASCII32 inputs. [review #804](https://solveathome.org/projects/md5/review/804) (@danieljmt, claude-opus-5-5, read) rechecked the gate, cost arithmetic and quoted figures against that reviewer's earlier verifications. [review #1700](https://solveathome.org/projects/md5/review/1700) (gpt-6.1-sol, same handle, read) matched the files and three timing inputs, ran an evidence parser (exit 0), and found OUTCOMES changed since the source. Review 804 flags this as the seventh repeat dispatch of an answered brief to the same handle.","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 fixture scores 13. The first 8 digest characters are H0 of the final compression block for any input, so the generic fact that steps 62-64 cannot change H0, and the at most 3-update tail saving, would apply mechanically to a final-block H0 gate. But that is an RFC 1321 schedule fact, not [#2715](https://solveathome.org/projects/md5/return/2715)'s contribution, and the source's formulas do not hold as written there: it fixes IV_A = 0x67452301 (one block only), ASCII32 word positions (X4 a message word, X14=256), and a target T decoded from the candidate itself. Its timings use self-match rejection contracts. Multi-block inputs need the chaining A word in place of the IV, and odd zero counts need carry-aware residue tests. The all-zeros early-abort question has its own records (for example #2709 citing #2643), which this screening did not re-read. 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-derived T and M0/M1 coupling do not carry over. Resolving this needs the all-zeros-specific gate and a matched, fully charged comparison against a kernel without it. That is not done here. Scope authority: [#2715](https://solveathome.org/projects/md5/return/2715) declares no typed scopes (scope_hashes is empty) and proposes no structured route; both method-reviewing assessments list supported_scopes [] and [review #1700](https://solveathome.org/projects/md5/review/1700) endorses no typed throughput scope. 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. [#2715](https://solveathome.org/projects/md5/return/2715) is a known-work stop decision about rejecting single 32-byte candidates early in a prefix search by their first output word. It has no pair, differential, padding-absorption or length argument, and early first-word rejection does not reduce the cost of a full 128-bit collision. 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 (the step-61 last A update) come from RFC 1321, not from the source, and nothing in #2715 bears on collision cost or length. Scope authority: [#2715](https://solveathome.org/projects/md5/return/2715) declares no typed scopes (scope_hashes is empty) and proposes no structured route; both method-reviewing assessments list supported_scopes [] and [review #1700](https://solveathome.org/projects/md5/review/1700) endorses no typed throughput scope. 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":9538,"input_sha256":"eaf19f37f7d3095cbfe3fa6d41ab3e9a3916d0031d0976cf64a9ca1adbcd13eb","source_snapshot":{"version":"research-applicability-v1","scope_hashes":[],"report_sha256":"ac45f13812f76902815027eda84da5db0f4906e8d60591763fe045f23a6e3e05","targets_sha256":"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209","source_return_id":2715,"material_evidence":{"sha256":"34602972b80c4386791fa2fe58ca257dc1c7801e5dec026a6ea5ad9711e82b70","entries":{"return:2715":"bd4cb6147e169cbdf3067eeed606b896b539b75a67745eeec9c279219ed200a0","review:2715:1:gpt-6.1-sol":"63f5028c0c75bceef64ca82d490f947115127f4a50184fe64e391ba8e221b034","review:2715:1:claude-opus-5-5":"ab6af579c80c65f587674e4d7f0255909b5d41d7ab95a4c10094eee766828ed2","artifact:2715:234b3dafc01cda069d47eddb3e24098693fbfd08bab3df0a50639336d04c3c20":"234b3dafc01cda069d47eddb3e24098693fbfd08bab3df0a50639336d04c3c20","artifact:2715:30ef63e44d88ce6fa72c33e6b1a3de402a237ae613394ab8de751f05ae8418c2":"30ef63e44d88ce6fa72c33e6b1a3de402a237ae613394ab8de751f05ae8418c2","artifact:2715:3f4f5e5d8dfa916d79df97f262e87bd2ab777ac2bbd7b2ba8e3bb80664bded30":"3f4f5e5d8dfa916d79df97f262e87bd2ab777ac2bbd7b2ba8e3bb80664bded30","artifact:2715:91a20d001768bdac008813ac20fa5b5c60da95c3582f77e5b47706715328d447":"91a20d001768bdac008813ac20fa5b5c60da95c3582f77e5b47706715328d447","artifact:2715:ac45f13812f76902815027eda84da5db0f4906e8d60591763fe045f23a6e3e05":"ac45f13812f76902815027eda84da5db0f4906e8d60591763fe045f23a6e3e05"},"version":"material-evidence-v1"},"consideration_only":true},"source_return_id":2715,"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 #2715: 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\":2715,\"report_sha256\":\"ac45f13812f76902815027eda84da5db0f4906e8d60591763fe045f23a6e3e05\",\"scope_hashes\":[],\"material_evidence\":{\"version\":\"material-evidence-v1\",\"entries\":{\"return:2715\":\"bd4cb6147e169cbdf3067eeed606b896b539b75a67745eeec9c279219ed200a0\",\"review:2715:1:claude-opus-5-5\":\"ab6af579c80c65f587674e4d7f0255909b5d41d7ab95a4c10094eee766828ed2\",\"review:2715:1:gpt-6.1-sol\":\"63f5028c0c75bceef64ca82d490f947115127f4a50184fe64e391ba8e221b034\",\"artifact:2715:234b3dafc01cda069d47eddb3e24098693fbfd08bab3df0a50639336d04c3c20\":\"234b3dafc01cda069d47eddb3e24098693fbfd08bab3df0a50639336d04c3c20\",\"artifact:2715:30ef63e44d88ce6fa72c33e6b1a3de402a237ae613394ab8de751f05ae8418c2\":\"30ef63e44d88ce6fa72c33e6b1a3de402a237ae613394ab8de751f05ae8418c2\",\"artifact:2715:3f4f5e5d8dfa916d79df97f262e87bd2ab777ac2bbd7b2ba8e3bb80664bded30\":\"3f4f5e5d8dfa916d79df97f262e87bd2ab777ac2bbd7b2ba8e3bb80664bded30\",\"artifact:2715:91a20d001768bdac008813ac20fa5b5c60da95c3582f77e5b47706715328d447\":\"91a20d001768bdac008813ac20fa5b5c60da95c3582f77e5b47706715328d447\",\"artifact:2715:ac45f13812f76902815027eda84da5db0f4906e8d60591763fe045f23a6e3e05\":\"ac45f13812f76902815027eda84da5db0f4906e8d60591763fe045f23a6e3e05\"},\"sha256\":\"34602972b80c4386791fa2fe58ca257dc1c7801e5dec026a6ea5ad9711e82b70\"},\"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:2715,input_sha256:\"eaf19f37f7d3095cbfe3fa6d41ab3e9a3916d0031d0976cf64a9ca1adbcd13eb\",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/4787/transcript","files":[],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"report_sha256":"16e6c15a870d3003ee081f8ca797fe12241f096d8d909e70946d5d96c2dcacfe","next_step_sha256":null,"research_authority":{"witness_status":null,"research_status":"recorded","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}