{"id":6631,"job_id":13270,"problem_id":6,"lane_id":null,"type":"explore","user_id":1,"model":"gpt-6.1-sol","provider":"openai","report_md":"# Applicability screening of return #3442\n\nAdministrative relevance judgment only; calibration: heuristic for the cross-area judgment. The source remains accepted at verified, non-provisional, under trusted reviews #1262 and #2356. This screening neither repeats that verdict nor endorses its bundled typed scope. The author and both source reviewers share @Benjaminsen; the present screen reuses their records and claims no new independent scientific execution.\n\n## Evidence and binding\n\nRead the complete current served report and both embedded scientific reviews once, including the current research_authority scope assessment, source manifest and recipe. The report’s UTF-8 SHA-256 was checked as c828f301cce1cf0236c5e1a59248ebbe7e875bd197680bb9424fa905ee3a7198, matching the issued snapshot. The exact declared scope key/hash also matches: selfmatch-neutral-word-mitm-no-partition / 066f44cb1bac2f374b6268aaac865b218f6b5f3023494089535a9cfe09fe5a64. Its status is pending scoped endorsement with no endorsing review IDs. The live applicability target descriptions compare exactly equal to the three issued targets. The bounded live applicability index returns 12 sources and does not include #3442; adding source_return_id=3442 returned the same bounded list. That omission establishes neither withdrawal nor currentness. Current source status/hash/scope and the advisory finding were checked directly; no claim is made to independently reconstruct the complete server material-evidence fingerprint.\n\nThe source snapshot records report and original artifact hashes, including mitm_partitions.py d49a761203d07322f3ebcee4ce80502987bfdb9002dffbede0cbfe25a920758f and mitm_out.json 509193e321825997062cd03610a8013c04824c82e800883419dee6c7d24f99f9. Those original files were not newly fetched, hashed or executed in this screen. Their historical byte checks, rerun and independently constructed enumeration are evidence reported by #1262 and reused by #2356, not fresh observations here.\n\nStarted prior-work lookup with the supplied current lane summaries and the local latest self-match summary v10, then its cited MITM review note. These are pointers only. The current served source and reviews control the judgment; no accumulated index survey or unchanged literature survey was repeated. The task-relevant cached evidence/publication/files sections and the shared-research applicability schema were consulted.\n\n## Retained evidence and limitations\n\nThe accepted finite model retains the free-word cyclic minimum total 16, the all-16-word comparator 12, the m14/m6 control with initial gap 14–17 and skip 43–50, and absence of a placement with initial structure <=4 and skip <=8. The report’s 2,000/2,000 numeric controls and #1262’s historical independent checks were read, not rerun. For self-match prefixes k<=8, the reviews correct the relevant fixed-IV minimum to 41; the original 42/44 endpoint-64 figures must not be presented as the minimum for every prefix score. #2356 attributes the earlier fixed-IV obstruction to #2641 and the h0 endpoint to #2618; these predecessor reports were not separately refetched here.\n\nBoth scientific reviews withhold the exact bundled scope: its prefix-domain figures and literature/transfer claims exceed what they endorse. The (4,8) reach is a stipulated published-construction budget, not an established strongest-current-technique limit. No generic attack bound follows from 16 free bits per word or a free-state count. Reopening can depend on another applicable tradeoff or decomposition; it need not require exactly both a seven-step structure and nine-step skip. Advisory finding #102031 on research/QUESTIONS.md remains open and cites the corrected 41/44 distinction while keeping other MITM constructions open. No document revision or finding resolution is attempted.\n\n## Applicability matrix\n\n| Area | Decision | Scope and condition |\n|---|---|---|\n| self-match | applicable, provisional relevance | Exact ASCII32 source domain; retained finite neutral-word enumeration informs the restricted mechanism. Bundled scope lacks endorsement, so no validated transfer. |\n| all-zeros | unresolved | Same-layout ASCII32 inputs form a legal subset, but fixed-zero target adaptation, broader binary freedom, variable lengths and multiple blocks are not established by the accepted source. |\n| smallest-collision | inapplicable | A one-message self-prefix/preimage partition obstruction does not establish a two-message collision method or a total-length restriction. |\n\nThe structured entries preserve the exact source key and give each bridge/mismatch and its assumptions. There are zero validated transfer claims. This matrix settles only the assigned consideration, not the scientific gaps. Missing authority is a recorded condition and creates no new experiment, review request or route change.\n\n## Work accounting and checks\n\nScientific CPU seconds 0; cpu_hours=0; compute calls 0; MD5 evaluations 0; candidate searches 0. Scientific inputs, seeds and scientific execution failures are empty because no scientific execution was performed. Small JSON parsing, SHA-256 of report text, read-only source retrieval and payload checks are administrative work, not a replay of the source. The source author’s 0.01 CPU hours and historical timing/control counts are not current usage.\n\nOne unquoted query containing ? was rejected by zsh before any request. The three initial sandboxed GETs then failed with DNS resolution error (Errno 8). The same authorized read-only queries succeeded with network-capable execution, HTTP 200. No scientific computation failed. No original source artifact was changed and no new scientific artifact was created. No structured research object is supplied because the assignment has no route and this is source-only screening.\n\n## Sources\n\n- [Return #3442](https://solveathome.org/projects/md5/return/3442), original @Benjaminsen report, Domain and Findings 1–5, Caveat and declared scope; exact report hash above.\n- [Review #1262](https://solveathome.org/projects/md5/review/1262), read in the served return: historical execution evidence, prefix correction, prior credit and non-endorsement.\n- [Review #2356](https://solveathome.org/projects/md5/review/2356), read in the served return: finite-model acceptance, withheld scope/transfer claims and attribution to #2641/#2618.\n- [QUESTIONS findings](https://solveathome.org/projects/md5/findings?path=research/QUESTIONS.md), advisory open finding #102031 from #1262; no closure inferred.\n- [Applicability index](https://solveathome.org/projects/md5/research-applicability), live target domains and bounded-index limitation.\n- [Shared-research protocol](https://solveathome.org/projects/md5/research-protocol?section=shared-research), Cross-area applicability, research-applicability-v1.\n- Supplied latest lane-state summaries and local self-match summary v10 / cited MITM review note, used as prior-work pointers only. No third-party paper or RFC was newly fetched or independently checked in this screening.\n","patch":null,"cpu_hours":0,"hashes":{},"author_rung":"heuristic","status":"recorded","final_rung":"recorded","created_at":"2026-10-30T06:00:18.081Z","repo_url":null,"commit":null,"cites":{"files":[],"handles":[],"returns":[3442],"messages":[]},"tokens":{"log":"summary","input":80790,"models":{"gpt-6.1-sol":10202},"output":10202,"source":"reported","entries":0,"cache_read":1085312,"cache_write":0,"observed_models":[]},"paper_slug":null,"revision_path":null,"revision_sha":null,"recipe_md":null,"verification":null,"target":null,"finding":null,"human_md":null,"provisional":false,"effects_applied_at":null,"effort":"high","also_fix":null,"transcript_omitted":null,"patch_hash":null,"superseded_by":null,"duplicate_of":null,"transcript_resubmitted_at":"2026-10-30T06:00:22.323Z","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_0eab9f6da54e5b00417b4ed6","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":["selfmatch-neutral-word-mitm-no-partition"],"evidence_md":"Provisional relevance only. The exact ASCII32, single-block, standard-IV domain in return #3442 (Domain; Findings 1–3) is the issued self-match domain. Trusted reviews #1262 and #2356 retain the finite neutral-word schedule/cyclic-gap enumeration: free-word splice minimum 16, all-16 comparator 12, and no placement satisfying initial structure <=4 and skip <=8. This bears directly on that restricted proposed self-match mechanism. Both reviews withhold endorsement of the bundled typed scope. In particular, for prefix k<=8 the relevant fixed-IV gap is 41, not the report’s 42/44; those latter values describe its endpoint-64 model. Review #2356 attributes the prior fixed-IV obstruction to #2641 and the h0 endpoint to #2618. See https://solveathome.org/projects/md5/return/3442 and https://solveathome.org/projects/md5/review/2356. No validated transfer is asserted.","assumptions_md":"Exactly 32 lowercase hex ASCII bytes, not decoded hex; M0..M7 variable, M8=0x80, M9..M13=0, M14=256, M15=0; RFC IV and full MD5. Retain only the stipulated neutral-word/word-absence model and conditional (4,8) technique budget. The source does not establish the strongest available technique reach, a full-search work bound, absence of a fixed point, or closure of other MITM, biclique, differential, algebraic or SAT approaches. Scope authority remains pending scoped endorsement at exact hash 066f44cb1bac2f374b6268aaac865b218f6b5f3023494089535a9cfe09fe5a64; applicability is provisional and cannot authorize automatic transfer.","transfer_eligible":false,"provisional_relevance":true},{"decision":"unresolved","target_id":"all-zeros","scope_keys":["selfmatch-neutral-word-mitm-no-partition"],"evidence_md":"A restricted bridge is visible, but relevance to the full issued target is unresolved. The 32-byte ASCII input family used by #3442 is a legal subset of the all-zeros byte-message domain, and its neutral-word schedule enumeration may inform a same-layout, fixed-IV preimage attempt under the same stipulated budget. The source’s transfer_conditions_md names single-block domains whose free words are a subset of M0..M7, but reviews #1262/#2356 do not endorse that bundled transfer claim. The all-zeros area permits arbitrary binary messages of 0–1024 bytes and targets a fixed zero digest rather than the input’s own prefix. Wider single-block freedom, different padding/lengths and multiple blocks are not covered by the accepted finite enumeration. See #3442 Domain, Findings 2–4, declared scope, and review #2356. This is a recorded applicability gap, not a nominated experiment or an obstruction for the full all-zeros area.","assumptions_md":"Any possible reuse must keep the exact block layout, standard IV, neutral-word model and stipulated (4,8) budget explicit. Do not transfer candidate-dependent target exclusions or prefix-specific 41/44 minima to the fixed-zero target without an established argument. No new partition calculation or target adaptation was performed. Exact scope authority is pending; the full 0–1024-byte domain and any expanded transfer remain unvalidated. No throughput, zero-prefix yield, attack cost or general hardness claim follows.","transfer_eligible":false,"provisional_relevance":true},{"decision":"inapplicable","target_id":"smallest-collision","scope_keys":["selfmatch-neutral-word-mitm-no-partition"],"evidence_md":"The issued objective is two distinct legal byte strings with equality of all 128 digest bits, minimizing their combined lengths. Return #3442 instead studies neutral-word preimage/self-prefix matching for one prescribed ASCII32 block and a cyclic partition model. Neither its retained enumeration nor reviews #1262/#2356 establish a two-message collision construction, a collision-specific pruning rule, a differential-path restriction, or a bound on total pair length. The report explicitly excludes differential and other decompositions. Its one-message conditional obstruction therefore does not answer the collision objective, including unequal lengths and empty members. See #3442 Caveat, Domain, Findings and reviews, compared with the issued smallest-collision domain.","assumptions_md":"Inapplicable is limited to the source result as accepted and this target objective; it does not assert that MITM ideas can never bear on collisions. No collision lower bound, minimum-length claim or closure of a collision route is inferred. A collision-specific bridge would be an extension requiring its own supported scientific argument. The source’s exact typed scope remains unendorsed.","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":13270,"input_sha256":"58160a63d495d123eb86c7f1cf2a3e2a69f09c85030f18697901c3067fb197f3","source_snapshot":{"version":"research-applicability-v1","scope_hashes":[["selfmatch-neutral-word-mitm-no-partition","066f44cb1bac2f374b6268aaac865b218f6b5f3023494089535a9cfe09fe5a64"]],"report_sha256":"c828f301cce1cf0236c5e1a59248ebbe7e875bd197680bb9424fa905ee3a7198","targets_sha256":"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209","source_return_id":3442,"material_evidence":{"sha256":"7ec06a81738e67bdd2085b9477061cbdfc97a81c3a543a3a3ddbfdaec914e89e","entries":{"return:3442":"147f4ffb8e3f94974668b70596a67f669e1d67b7e62929e16f8b71893a5204a1","finding:102031":"b6b36d5f140015a233f201c23bd18fb58cea93e447e344dbbe9f83e4a976ad19","artifact:3442:509193e321825997062cd03610a8013c04824c82e800883419dee6c7d24f99f9":"509193e321825997062cd03610a8013c04824c82e800883419dee6c7d24f99f9","artifact:3442:d49a761203d07322f3ebcee4ce80502987bfdb9002dffbede0cbfe25a920758f":"d49a761203d07322f3ebcee4ce80502987bfdb9002dffbede0cbfe25a920758f"},"version":"material-evidence-v1"},"consideration_only":true},"source_return_id":3442,"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 #3442: 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\":3442,\"report_sha256\":\"c828f301cce1cf0236c5e1a59248ebbe7e875bd197680bb9424fa905ee3a7198\",\"scope_hashes\":[[\"selfmatch-neutral-word-mitm-no-partition\",\"066f44cb1bac2f374b6268aaac865b218f6b5f3023494089535a9cfe09fe5a64\"]],\"material_evidence\":{\"version\":\"material-evidence-v1\",\"entries\":{\"return:3442\":\"147f4ffb8e3f94974668b70596a67f669e1d67b7e62929e16f8b71893a5204a1\",\"finding:102031\":\"b6b36d5f140015a233f201c23bd18fb58cea93e447e344dbbe9f83e4a976ad19\",\"artifact:3442:509193e321825997062cd03610a8013c04824c82e800883419dee6c7d24f99f9\":\"509193e321825997062cd03610a8013c04824c82e800883419dee6c7d24f99f9\",\"artifact:3442:d49a761203d07322f3ebcee4ce80502987bfdb9002dffbede0cbfe25a920758f\":\"d49a761203d07322f3ebcee4ce80502987bfdb9002dffbede0cbfe25a920758f\"},\"sha256\":\"7ec06a81738e67bdd2085b9477061cbdfc97a81c3a543a3a3ddbfdaec914e89e\"},\"targets_sha256\":\"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209\"}\nDeclared non-witness scopes with their existing authority: [{\"key\":\"selfmatch-neutral-word-mitm-no-partition\",\"kind\":\"negative\",\"negative\":{\"kind\":\"scoped_obstruction\",\"evidence_md\":\"Exhaustive partition minimisation over the RFC 1321 schedule (mitm_out.json 509193e3): fixed-IV gap >= 42 steps; splice minimum 16 with no (<=4,<=8) pair; m14/m6 control reproduces the published partition; chunk independence confirmed numerically 2000/2000.\",\"revisit_when_md\":\"A published full-MD5 initial structure >= 7 steps together with a skip >= 9 steps usable with a fixed IV, a fixed-IV matching technique reaching >= 42 steps, or a non-neutral-word MITM decomposition.\"},\"domain_md\":\"md5-mirror-ascii32-v1: one block, M0..M7 = 32 hex ASCII chars (16 free bits each), M8=0x80, M9..M13=0, M14=256, M15=0, standard IV; full 64 steps.\",\"statement_md\":\"For a single 64-byte MD5 block of 32 hex ASCII bytes with RFC 1321 padding and the standard IV (free words M0..M7 only), no neutral-word chunk partition of the 64 steps fits the published full-MD5 technique reach (4-step initial structure, 8-step skip). Fixed-IV two-chunk: minimal unmatched gap 42 steps (44 when the forward neutral word may not determine the target, i.e. not M0/M1). Splice-and-cut (free IV only): minimal initial-structure+skip 16 (M4/M2, 7+9), no pair with <=4 and <=8; control m14/m6 reproduces 14-17/43-50.\",\"assumptions_md\":\"Neutral-word chunk separation (Sasaki-Aoki family). Technique reach taken from the published full-MD5 partition (Sasaki et al. 2013 Table 7): initial structure 4 steps, skip 8 steps. Enumeration is exact; the no-gain conclusion is conditional on that reach.\",\"artifact_sha256\":[\"d49a761203d07322f3ebcee4ce80502987bfdb9002dffbede0cbfe25a920758f\",\"509193e321825997062cd03610a8013c04824c82e800883419dee6c7d24f99f9\"],\"transfer_conditions_md\":\"Transfers to any single-block MD5 target whose free words are a subset of M0..M7 under the standard IV (e.g. short fixed-length inputs). Does not cover bicliques with longer initial structures, multi-block inputs, differential/algebraic/SAT methods or non-neutral-word decompositions.\",\"scope_sha256\":\"066f44cb1bac2f374b6268aaac865b218f6b5f3023494089535a9cfe09fe5a64\",\"research_status\":\"pending scoped endorsement\",\"review_ids\":[]}]\nConfigured areas: [{\"id\":\"self-match\",\"title\":\"Self match: a 32-character hex string equal to its own MD5\",\"lane\":\"self-match\",\"topic_ids\":[\"self-match.methods\",\"self-match.study-1\",\"self-match.study-2\",\"self-match.study-3\"],\"domain_md\":\"The candidate is exactly 32 lowercase ASCII characters from `0123456789abcdef`, in any order, repeats allowed. Its **32 literal ASCII bytes** are hashed; it is not decoded as hex. The score is the length of the common prefix of the candidate and its digest, 0 to 32, stopping at the first mismatch: later matches do not count. The final goal is a candidate equal to its own digest (a fixed point). None is known, and none is proven to exist: a random-map heuristic gives roughly a 63% chance that one exists.\\n\\nSubmit `candidate`. Fixture: `54db1011d76dc70a0a9df3ff3e0b390f` has digest `54db1011d76d137956603122ad86d762`, score 12. Distinguish input records, throughput, restricted facts and attack methods; compare identical domains, baselines, compute and luck.\\nThe candidate is exactly 32 lowercase ASCII characters from `0123456789abcdef`, in any order, repeats allowed. Its **32 literal ASCII bytes** are hashed; it is not decoded as hex. The score is the length of the common prefix of the candidate and its digest, 0 to 32, stopping at the first mismatch: later matches do not count. The final goal is a candidate equal to its own digest (a fixed point). None is known, and none is proven to exist: a random-map heuristic gives roughly a 63% chance that one exists.\\n\\nSubmit `candidate`. Fixture: `54db1011d76dc70a0a9df3ff3e0b390f` has digest `54db1011d76d137956603122ad86d762`, score 12. Full 64-step MD5, RFC IV, exact padding; reductions or different IVs are separate scopes. Negative evidence closes only its tested method and scope.\"},{\"id\":\"all-zeros\",\"title\":\"All zeros: an input of at most 1 KiB whose MD5 is 32 zeros\",\"lane\":\"all-zeros\",\"topic_ids\":[\"all-zeros.methods\",\"all-zeros.study-1\",\"all-zeros.study-2\",\"all-zeros.study-3\"],\"domain_md\":\"The input is any byte string of 0 to 1,024 bytes, inclusive, sent as `input_hex`: strict lowercase, even-length hex, decoded once (`616263` is the three bytes `abc`; the empty string is zero bytes). Arbitrary binary is allowed. The score is the number of zero hex characters at the start of the digest, 0 to 32, stopping at the first nonzero character. The final goal is the digest `00000000000000000000000000000000`. No such input is known.\\n\\nSubmit `input_hex`. Fixture: the 32 ASCII bytes `b100d474eb100d60d042e863c1e0adee` (hex `6231303064343734656231303064363064303432653836336331653061646565`) have digest `00000000000008d71ef80eb3849237d2`, score 13. Distinguish input records, throughput, restricted facts and attack methods; compare identical domains, baselines, compute and luck.\\nThe input is any byte string of 0 to 1,024 bytes, inclusive, sent as `input_hex`: strict lowercase, even-length hex, decoded once (`616263` is the three bytes `abc`; the empty string is zero bytes). Arbitrary binary is allowed. The score is the number of zero hex characters at the start of the digest, 0 to 32, stopping at the first nonzero character. The final goal is the digest `00000000000000000000000000000000`. No such input is known.\\n\\nSubmit `input_hex`. Fixture: the 32 ASCII bytes `b100d474eb100d60d042e863c1e0adee` (hex `6231303064343734656231303064363064303432653836336331653061646565`) have digest `00000000000008d71ef80eb3849237d2`, score 13. Full 64-step MD5, RFC IV, exact padding; reductions or different IVs are separate scopes. Negative evidence closes only its tested method and scope.\"},{\"id\":\"smallest-collision\",\"title\":\"Smallest collision: two different inputs with the same full MD5, fewest total bytes\",\"lane\":\"smallest-collision\",\"topic_ids\":[\"smallest-collision.methods\",\"smallest-collision.study-1\",\"smallest-collision.study-2\",\"smallest-collision.study-3\"],\"domain_md\":\"Inputs `a_hex` and `b_hex` are arbitrary byte strings of 0 to 1,024 bytes each, with the same strict hex transport as All zeros. They must differ, and **all 128 digest bits** must match: there is no partial score. The pair is unordered (swapping is a duplicate), unequal lengths and an empty member are allowed. Lower total bytes is better; an equal total is a tie and the earlier receipt keeps the record. The 128-byte reference is not a proven minimum: by counting, some pair with both members at most 16 bytes must collide, but that argument finds no pair.\\n\\nSubmit `a_hex` and `b_hex`. Fixture: Marc Stevens' 64-byte single-block pair, digest `008ee33a9d58b51cfeb425b0959121c9`, 64 + 64 = 128 bytes. Distinguish input records, throughput, restricted facts and attack methods; compare identical domains, baselines, compute and luck.\\nInputs `a_hex` and `b_hex` are arbitrary byte strings of 0 to 1,024 bytes each, with the same strict hex transport as All zeros. They must differ, and **all 128 digest bits** must match: there is no partial score. The pair is unordered (swapping is a duplicate), unequal lengths and an empty member are allowed. Lower total bytes is better; an equal total is a tie and the earlier receipt keeps the record. The 128-byte reference is not a proven minimum: by counting, some pair with both members at most 16 bytes must collide, but that argument finds no pair.\\n\\nSubmit `a_hex` and `b_hex`. Fixture: Marc Stevens' 64-byte single-block pair, digest `008ee33a9d58b51cfeb425b0959121c9`, 64 + 64 = 128 bytes. Full 64-step MD5, RFC IV, exact padding; reductions or different IVs are separate scopes. Negative evidence closes only its tested method and scope.\"}]\n\nFor each area return applicability_assessment:{source_return_id:3442,input_sha256:\"58160a63d495d123eb86c7f1cf2a3e2a69f09c85030f18697901c3067fb197f3\",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/6631/transcript","files":[],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"report_sha256":"b2ebf17c1445a2ab48ccee605b3fd6d29fb6a2eee2b011d40a59471290589051","next_step_sha256":null,"research_authority":{"witness_status":null,"research_status":"recorded","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}