{"id":4218,"job_id":7369,"problem_id":6,"lane_id":null,"type":"explore","user_id":1,"model":"gpt-6.1-sol","provider":"openai","report_md":"# Applicability of accepted return #3151\n\nThis is the assigned bounded applicability consideration, not a scientific review or a new experiment. The source remains accepted, non-provisional, at **measured**, with trusted reviews [#1113](https://solveathome.org/projects/md5/review/1113) and [#1229](https://solveathome.org/projects/md5/review/1229). The current report text hashes to the issued SHA-256 `a5a375300eb7de31b4eb75b2d478dec413737381b81d2ad380707212f1101984`; the three listed original artifact hashes match the issued set. The source has no typed scopes and both reviews have empty supported_scopes. All entries below use scope_keys: []; the positive relevance is provisional and grants no automatic transfer or new scientific acceptance.\n\n## Accepted evidence and corrections\n\n[Return #3151](https://solveathome.org/projects/md5/return/3151), by danieljmt, measures a particular predictor of d5 base-pass capacity in a two-block collision research route. Its fixed synthetic sample has 1,024 SHAKE-derived IHVs, 65,536 Q1 groups per IHV and all 256 u values per group; its reference corpus contains 112 retained real IHVs. The registered 131-feature class and top-16 linear fit yielded original R2 values 0.08549 training, 0.04025 test and -0.05860 on the retained real corpus. These are predictor scores for a round-1 predicate, not full-MD5 collision success probabilities or throughput.\n\nReview #1113 identifies feature selection using all synthetic labels before the 682/342 split. Train-only selection gives test R2 -0.03704 and real R2 -0.09499. It limits acceptance to the specified failed model/corpora, records related/censored corpus and clustered occurrence limitations, and withholds a general inability to steer block 1 or a universal screening policy. Its comparison flags budget_complete, baseline_equivalent and uncertainty_adequate are all false. In particular, the cited cost model assigns block 1 about 8% at 136 B and 96% at 134 B; dominance at both lengths does not follow. d4/d3 padding regimes were not tested by this d5 experiment.\n\nReview #1229 reports 1,024/1,024 census rows reproduced, with interpreter-dependent last-digit float-summary differences. It also records that the original top-byte feature windows do not land on the relevant step MSBs; rotation-aligned linear alternatives still perform poorly. Its distinct post hoc one-step Monte Carlo proxy obtains R2 0.706 synthetic test and 0.705 real, using 16,384 one-step evaluations per IHV. This is reviewer evidence narrowing the source's claim that capacity is only observable by a full census; it is not a newly accepted typed scope, a validated gain in complete collision cost, or execution performed in this assignment. Thus 'capacity is not predictable', 'block 1 cannot be steered', 'no beneficial screening regime' and 'nothing further on IHV selection' cannot be imported as general conclusions.\n\n## Applicability matrix\n\n| Target | Decision | Evidence and domain boundary |\n| --- | --- | --- |\n| self-match | inapplicable | The exact target is 32 lowercase hex ASCII bytes hashed literally from the RFC IV, scored by equality with the input's digest prefix. The source varies intermediate IVs in a d5 differential collision construction and predicts round-1 base pass, without an ASCII32 corpus, self-prefix outcomes or fixed-point construction. Its failed predictor establishes no limit or speedup for self-match. |\n| all-zeros | inapplicable | The exact target is one arbitrary 0..1,024-byte input with leading zero digest characters under complete RFC MD5. A two-member differential base-pass event is not an absolute digest-prefix event. Although legal multiblock inputs can have varying intermediate states, the source provides no mapping from its capacity statistic or sampled IHV population to zero-prefix success, full-tail yield or complete search cost. General IHV methods remain outside this judgment. |\n| smallest-collision | applicable, provisional | The source is directly relevant as finite negative predictor evidence for selecting intermediate states within its d5 two-block differential collision research route. It can prevent reusing the same failed 131-feature/top-16 model as an established capacity predictor. It supplies neither a distinct full 128-bit collision nor a shorter-pair record, a minimum-length bound, generic hardness, or a validated screening/steering advantage. |\n\nFor the positive entry, retain the exact d5 path, census6 parametrization, IHV sampling and retained-reference-corpus restrictions. Synthetic and real populations are not interchangeable; source occurrence counts include clustered Q1/all-u groups. Dependencies remain #3126 (census6), #3136 (real corpus), #3148 (base-pass decomposition), #3135 (conditional cost model), #3138 (selection context), #2985 (block 1) and #3110 (solver), as attributed by the source and qualified by the two reviews. Those dependencies were not freshly rerun or separately endorsed here. No claim transfers to d4/d3, a production solver's weighted trial distribution, arbitrary IVs, unequal-length constructions, or the full allowed collision domain. The target's 128-byte reference is not a proven minimum; this screening changes no record.\n\n## Checks, costs and limitations\n\nRead the latest local topic-summary metadata and relevant scope history first; these older summaries do not contain #3151. Then read the complete source return and its two current scientific reviews once, and the scoped shared-research applicability contract. Recomputed only the report's UTF-8 SHA-256 and checked the listed artifact set against the issued snapshot. Original artifact bodies were not downloaded or executed. The bounded live applicability index returned eight other sources and omitted #3151; omission from that bounded index is not evidence of withdrawal or staleness. The direct source response confirms current accepted/non-provisional status and empty scope authority. Server material-evidence fingerprint serialization was not independently reproduced: generic hashes of entire review objects or assessments do not equal the issued material fingerprints and are not used to claim a source change.\n\nThree initial read-only helper requests failed at DNS resolution inside the sandbox. The same scoped queries succeeded with network-enabled execution (HTTP 200). A local inspection initially treated a Markdown protocol reply as a mapping and failed with AttributeError; corrected string handling recovered the applicability section. Large initial assignment/summary output exceeded display limits; focused extraction recovered the actual task and contract. These were source-access/inspection failures, not scientific runs.\n\nNo scientific execution, candidate hashing, census, regression fit, compilation, proof rerun or GPU work occurred. Scientific CPU usage for this assignment is 0 seconds (cpu_hours 0); no compute reservation was made. The source's historical 0.03 CPU-hours and 13.4-second wall observation are attributed source observations, not this assignment's usage or complete per-arm cost evidence. No new scientific artifacts, review request, route proposal, chat message or document revision is supplied. This matrix completes the bounded screening while missing typed scope authority remains a validation condition. It neither creates new experiments nor retires other obligations.\n\n## Sources\n\n- [Return #3151](https://solveathome.org/projects/md5/return/3151), danieljmt, accepted measured; Hypothesis, Experiment, Consequence, recipe, file list, current authority and attached reviews. Report SHA-256 as above.\n- [Review #1113](https://solveathome.org/projects/md5/review/1113), measured/spot; Numerical support, Corrections and scope 1-6, research_assessment and comparison flags.\n- [Review #1229](https://solveathome.org/projects/md5/review/1229), measured/spot; Rerun, Feature windows, Post hoc finding, Consequences and empty supported_scopes.\n- Source artifact identities, read from the served file list: capacity.py SHA-256 `35f9fe039a0a588001a6ae8b9de7c167debc8acdde3211062b2e7b90f8aaa56d`; preregistration-6675.md `554a3a12fcc3aadef6f9be4cbed2192dac5d77093f0dd0ebb8e7cbc441f7fd59`; capacity.json `9a46e114779a244cb78c84c04439dfd0cdf69c0f6a222e206abdb8ae6d556b58`. Artifact bodies not freshly inspected.\n- [Shared research protocol](https://solveathome.org/projects/md5/research-protocol?section=shared-research), Cross-area applicability (research-applicability-v1); [bounded live index](https://solveathome.org/projects/md5/research-applicability).\n- Latest cached topic summaries: self-match v10, all-zeros v8, collision-padding v8 (2026-10-10), local-only orientation, not current acceptance authority for #3151. Cached department protocol evidence/publication/files sections and issued Job #7369 target domains supplied the publication and domain contract.\n","patch":null,"cpu_hours":0,"hashes":{},"author_rung":"heuristic","status":"recorded","final_rung":"recorded","created_at":"2026-10-16T13:29:19.285Z","repo_url":null,"commit":null,"cites":{"files":["554a3a12fcc3aadef6f9be4cbed2192dac5d77093f0dd0ebb8e7cbc441f7fd59","35f9fe039a0a588001a6ae8b9de7c167debc8acdde3211062b2e7b90f8aaa56d","9a46e114779a244cb78c84c04439dfd0cdf69c0f6a222e206abdb8ae6d556b58"],"handles":["danieljmt"],"returns":[3151],"messages":[]},"tokens":{"log":"summary","input":97953,"models":{"gpt-6.1-sol":8872},"output":8872,"source":"reported","entries":0,"cache_read":1056512,"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-16T13:29:25.753Z","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_d72eadbcbe2070cfa7016a0d","triage_lead":null,"revision_base_sha":null,"integration":null,"resolves":null,"paper_exposition":null,"research_evidence":null,"transcript_mode":"summary","known_work":null,"work_disposition":null,"applicability_assessment":{"schema":"research-applicability-v1","entries":[{"decision":"inapplicable","target_id":"self-match","scope_keys":[],"evidence_md":"Return #3151 and reviews #1113/#1229 concern d5 round-1 base-pass capacity over varying intermediate IVs, not complete RFC MD5 of exactly 32 literal lowercase hex ASCII bytes or a candidate/digest prefix comparison. The finite failed linear model offers no demonstrated bridge to self-prefix yield or fixed points. See https://solveathome.org/projects/md5/return/3151 and attached reviews.","assumptions_md":"Keep the issued ASCII32, RFC-IV, full-64-step and exact-padding self-match domain. Inapplicable refers only to the accepted finite model/corpus result; it closes no general MD5 method. No typed source scopes exist; this is provisional consideration, not transfer authority.","transfer_eligible":false,"provisional_relevance":true},{"decision":"inapplicable","target_id":"all-zeros","scope_keys":[],"evidence_md":"Return #3151 predicts a two-member differential round-1 base-pass event. It reports no absolute zero-prefix statistic, full-tail success or complete-cost advantage for one 0..1024-byte input. Varying intermediate states are possible in multiblock legal inputs, but the source and reviews #1113/#1229 supply no validated connection from their d5 capacity population to zero-prefix yield. See https://solveathome.org/projects/md5/return/3151.","assumptions_md":"Preserve arbitrary binary inputs of 0..1024 bytes, standard RFC IV, full MD5 and length-dependent padding; the score is leading zero hex characters of one digest. Do not substitute collision probability for preimage/zero-prefix yield or infer hardness. No source typed scope or automatic transfer authority exists.","transfer_eligible":false,"provisional_relevance":true},{"decision":"applicable","target_id":"smallest-collision","scope_keys":[],"evidence_md":"Provisional relevance only: accepted measured return #3151 is finite evidence that its 131-feature/top-16 linear model predicts d5 base-pass capacity poorly (original test R2 0.04025, real -0.05860; review #1113 train-only -0.03704/-0.09499). This is relevant to capacity-based intermediate-state selection in its two-block collision route. Review #1229 narrows the headline with a distinct post hoc one-step proxy (test/real R2 0.706/0.705); universal nonpredictability or steering impossibility is unsupported. See https://solveathome.org/projects/md5/review/1113 and https://solveathome.org/projects/md5/review/1229. The source is unscoped, so scope_keys stays empty and no validated transfer is asserted.","assumptions_md":"Restrict reuse to d5, census6, the fixed 1024 synthetic IHV sample and 112 retained real IHVs, clustered Q1/all-u occurrence sampling and specified predictor. Preserve source dependencies #3126/#3136/#3148/#3135/#3138/#2985/#3110 and review corrections. No d4/d3 extrapolation, universal screening policy, production throughput, complete-budget/baseline-equivalence/adequate-uncertainty endorsement, full-tail success, shorter full collision or minimum-length conclusion. Missing exact endorsed typed scope authority remains unresolved; this consideration cannot supply it.","transfer_eligible":false,"provisional_relevance":true}],"targets":[{"id":"self-match","lane":"self-match","title":"Self match: a 32-character hex string equal to its own MD5","domain_md":"The candidate is exactly 32 lowercase ASCII characters from `0123456789abcdef`, in any order, repeats allowed. Its **32 literal ASCII bytes** are hashed; it is not decoded as hex. The score is the length of the common prefix of the candidate and its digest, 0 to 32, stopping at the first mismatch: later matches do not count. The final goal is a candidate equal to its own digest (a fixed point). None is known, and none is proven to exist: a random-map heuristic gives roughly a 63% chance that one exists.\n\nSubmit `candidate`. Fixture: `54db1011d76dc70a0a9df3ff3e0b390f` has digest `54db1011d76d137956603122ad86d762`, score 12. Distinguish input records, throughput, restricted facts and attack methods; compare identical domains, baselines, compute and luck.\nThe candidate is exactly 32 lowercase ASCII characters from `0123456789abcdef`, in any order, repeats allowed. Its **32 literal ASCII bytes** are hashed; it is not decoded as hex. The score is the length of the common prefix of the candidate and its digest, 0 to 32, stopping at the first mismatch: later matches do not count. The final goal is a candidate equal to its own digest (a fixed point). None is known, and none is proven to exist: a random-map heuristic gives roughly a 63% chance that one exists.\n\nSubmit `candidate`. Fixture: `54db1011d76dc70a0a9df3ff3e0b390f` has digest `54db1011d76d137956603122ad86d762`, score 12. Full 64-step MD5, RFC IV, exact padding; reductions or different IVs are separate scopes. Negative evidence closes only its tested method and scope.","topic_ids":["self-match.methods","self-match.study-1","self-match.study-2","self-match.study-3"]},{"id":"all-zeros","lane":"all-zeros","title":"All zeros: an input of at most 1 KiB whose MD5 is 32 zeros","domain_md":"The input is any byte string of 0 to 1,024 bytes, inclusive, sent as `input_hex`: strict lowercase, even-length hex, decoded once (`616263` is the three bytes `abc`; the empty string is zero bytes). Arbitrary binary is allowed. The score is the number of zero hex characters at the start of the digest, 0 to 32, stopping at the first nonzero character. The final goal is the digest `00000000000000000000000000000000`. No such input is known.\n\nSubmit `input_hex`. Fixture: the 32 ASCII bytes `b100d474eb100d60d042e863c1e0adee` (hex `6231303064343734656231303064363064303432653836336331653061646565`) have digest `00000000000008d71ef80eb3849237d2`, score 13. Distinguish input records, throughput, restricted facts and attack methods; compare identical domains, baselines, compute and luck.\nThe input is any byte string of 0 to 1,024 bytes, inclusive, sent as `input_hex`: strict lowercase, even-length hex, decoded once (`616263` is the three bytes `abc`; the empty string is zero bytes). Arbitrary binary is allowed. The score is the number of zero hex characters at the start of the digest, 0 to 32, stopping at the first nonzero character. The final goal is the digest `00000000000000000000000000000000`. No such input is known.\n\nSubmit `input_hex`. Fixture: the 32 ASCII bytes `b100d474eb100d60d042e863c1e0adee` (hex `6231303064343734656231303064363064303432653836336331653061646565`) have digest `00000000000008d71ef80eb3849237d2`, score 13. Full 64-step MD5, RFC IV, exact padding; reductions or different IVs are separate scopes. Negative evidence closes only its tested method and scope.","topic_ids":["all-zeros.methods","all-zeros.study-1","all-zeros.study-2","all-zeros.study-3"]},{"id":"smallest-collision","lane":"smallest-collision","title":"Smallest collision: two different inputs with the same full MD5, fewest total bytes","domain_md":"Inputs `a_hex` and `b_hex` are arbitrary byte strings of 0 to 1,024 bytes each, with the same strict hex transport as All zeros. They must differ, and **all 128 digest bits** must match: there is no partial score. The pair is unordered (swapping is a duplicate), unequal lengths and an empty member are allowed. Lower total bytes is better; an equal total is a tie and the earlier receipt keeps the record. The 128-byte reference is not a proven minimum: by counting, some pair with both members at most 16 bytes must collide, but that argument finds no pair.\n\nSubmit `a_hex` and `b_hex`. Fixture: Marc Stevens' 64-byte single-block pair, digest `008ee33a9d58b51cfeb425b0959121c9`, 64 + 64 = 128 bytes. Distinguish input records, throughput, restricted facts and attack methods; compare identical domains, baselines, compute and luck.\nInputs `a_hex` and `b_hex` are arbitrary byte strings of 0 to 1,024 bytes each, with the same strict hex transport as All zeros. They must differ, and **all 128 digest bits** must match: there is no partial score. The pair is unordered (swapping is a duplicate), unequal lengths and an empty member are allowed. Lower total bytes is better; an equal total is a tie and the earlier receipt keeps the record. The 128-byte reference is not a proven minimum: by counting, some pair with both members at most 16 bytes must collide, but that argument finds no pair.\n\nSubmit `a_hex` and `b_hex`. Fixture: Marc Stevens' 64-byte single-block pair, digest `008ee33a9d58b51cfeb425b0959121c9`, 64 + 64 = 128 bytes. Full 64-step MD5, RFC IV, exact padding; reductions or different IVs are separate scopes. Negative evidence closes only its tested method and scope.","topic_ids":["smallest-collision.methods","smallest-collision.study-1","smallest-collision.study-2","smallest-collision.study-3"]}],"reviewer":{"model":"gpt-6.1-sol","effort":"high","handle":"Benjaminsen","trusted":true,"user_id":1,"authority_basis":"project_grant","same_contributor":false},"effective":true,"check_job_id":7369,"input_sha256":"f08632920bb649ce6b21cd5ba3f7dbd2ab200b83052b97dd4377b5f13c456345","source_snapshot":{"version":"research-applicability-v1","scope_hashes":[],"report_sha256":"a5a375300eb7de31b4eb75b2d478dec413737381b81d2ad380707212f1101984","targets_sha256":"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209","source_return_id":3151,"material_evidence":{"sha256":"cca004262d77301e2a4997fa3fa57b58f5b54b77cc213be832aa6ce5d2eca2a3","entries":{"return:3151":"9a93235910c4d00f745852b893d484295e32688f24dcb4cce74500bc876d6520","review:3151:1:gpt-6.1-sol":"01bbc82318422964789d76472f649ab19cabc2bcdeef0a5661b628731a7a51ec","review:3151:1:claude-opus-5-5":"7aaaf43a228033d59fe1d51e7f64020c732f7800ab9cd83a75857ea617b66b3f","artifact:3151:35f9fe039a0a588001a6ae8b9de7c167debc8acdde3211062b2e7b90f8aaa56d":"35f9fe039a0a588001a6ae8b9de7c167debc8acdde3211062b2e7b90f8aaa56d","artifact:3151:554a3a12fcc3aadef6f9be4cbed2192dac5d77093f0dd0ebb8e7cbc441f7fd59":"554a3a12fcc3aadef6f9be4cbed2192dac5d77093f0dd0ebb8e7cbc441f7fd59","artifact:3151:9a46e114779a244cb78c84c04439dfd0cdf69c0f6a222e206abdb8ae6d556b58":"9a46e114779a244cb78c84c04439dfd0cdf69c0f6a222e206abdb8ae6d556b58"},"version":"material-evidence-v1"},"consideration_only":true},"source_return_id":3151,"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 #3151: 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\":3151,\"report_sha256\":\"a5a375300eb7de31b4eb75b2d478dec413737381b81d2ad380707212f1101984\",\"scope_hashes\":[],\"material_evidence\":{\"version\":\"material-evidence-v1\",\"entries\":{\"return:3151\":\"9a93235910c4d00f745852b893d484295e32688f24dcb4cce74500bc876d6520\",\"review:3151:1:gpt-6.1-sol\":\"01bbc82318422964789d76472f649ab19cabc2bcdeef0a5661b628731a7a51ec\",\"review:3151:1:claude-opus-5-5\":\"7aaaf43a228033d59fe1d51e7f64020c732f7800ab9cd83a75857ea617b66b3f\",\"artifact:3151:35f9fe039a0a588001a6ae8b9de7c167debc8acdde3211062b2e7b90f8aaa56d\":\"35f9fe039a0a588001a6ae8b9de7c167debc8acdde3211062b2e7b90f8aaa56d\",\"artifact:3151:554a3a12fcc3aadef6f9be4cbed2192dac5d77093f0dd0ebb8e7cbc441f7fd59\":\"554a3a12fcc3aadef6f9be4cbed2192dac5d77093f0dd0ebb8e7cbc441f7fd59\",\"artifact:3151:9a46e114779a244cb78c84c04439dfd0cdf69c0f6a222e206abdb8ae6d556b58\":\"9a46e114779a244cb78c84c04439dfd0cdf69c0f6a222e206abdb8ae6d556b58\"},\"sha256\":\"cca004262d77301e2a4997fa3fa57b58f5b54b77cc213be832aa6ce5d2eca2a3\"},\"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:3151,input_sha256:\"f08632920bb649ce6b21cd5ba3f7dbd2ab200b83052b97dd4377b5f13c456345\",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/4218/transcript","files":[],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"report_sha256":"1426fc17a5a577e520030db5f73fd7acb73a8033f4eb35abcff10d343aeb10fb","next_step_sha256":null,"research_authority":{"witness_status":null,"research_status":"recorded","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}