{"id":4240,"job_id":7384,"problem_id":6,"lane_id":null,"type":"explore","user_id":1,"model":"gpt-6.1-sol","provider":"openai","report_md":"# Applicability screening of accepted return #2619\n\nAdministrative relevance judgment only; no new scientific claim, experiment, proof rerun, record, route change or scientific-review request. The source remains accepted at **measured**, non-provisional, with no typed scopes. My relevance judgments are heuristic; source measurements remain attributed to their authors and reviewers.\n\n## Exact assignment and baseline\n\nAssess source #2619 separately for the three issued domains. This is the first issued screening, with no changed scientific premise. Source report SHA-256: `e7c485af58b136c248e215acf5aba1a47a701c0580f7eca18040805193dd487e`. Applicability input SHA-256: `9d0eb8cdd5a7f197ec3ba0d92d9be8477d176b4ff89b291c184066cd4cc925e1`. Material-evidence baseline: `20d16709083792a37da80f779db4f14e99c6ce7bd216a1c204248cce198b7b91`; target configuration: `b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209`.\n\nThe live return agrees with the issued report hash and six-file inventory, remains accepted and non-superseded, and declares no scopes. Live applicability-index target domains equal all three issued target domains. Reviews #702/#821/#1234 and advisory finding #66755 were read with the source. The bounded live index returned ten other sources; neither source_return_id nor limit query arguments expanded that list, so it supplies no independent source-specific consideration-currentness record for #2619. No index absence is interpreted as source withdrawal; direct source authority and report identity were checked. Publication must retain the issued input binding and server-computed effectiveness rather than any caller-invented currentness.\n\n## Applicability matrix\n\n| Issued target | Decision | Bridge or mismatch | Scope authority |\n|---|---|---|---|\n| self-match | inapplicable | Pairwise differential equality supplies neither the literal ASCII32 legal family nor the candidate-dependent fixed-point/prefix predicate. | `scope_keys: []`; no automatic transfer. |\n| all-zeros | inapplicable | Legal binary lengths overlap, but a common unspecified digest supplies no prescribed-zero output or target-prefix advantage. | `scope_keys: []`; no automatic transfer. |\n| smallest-collision | applicable, provisional relevance | The 64+64-byte full-MD5 collision subdomain matches; stage-cost/model evidence informs planning within the source restrictions. | `scope_keys: []`; typed scope authority is missing, so validated automatic transfer is unavailable. |\n\nThe machine-readable entries carry the complete domain assumptions and reviewer corrections. Inapplicability concerns only this exact source as supplied; it is not a global no-method theorem. Missing typed authority remains an unresolved validation condition, not a reason to invent scopes, demand another full review or generate an experiment.\n\n## Reused observations and limits\n\nReturn #2619 recorded 12,884,901,888 stage-1 samples, 6,893 Q38–Q48 survivors and two full-tail survivors. Its staged uniform-state model totals about 32.844 bits, compared with Stevens' cited attack-population figure of 33.85 bits. Two direct survivors have substantial uncertainty. Review #1234 reports an exact byte match for seed 101 (2,321 Q38–Q48 survivors, one full survivor) and the p=56 control (970/4,000,000), and the recorded p=51 count 31,482/4,000,000. These are reviewer-recorded executions, not checks run here.\n\nPreserve review #1234's narrowings: the round-4 positional law is a measured model rule; the 20.834-bit entry share covers 29→38; the zero-loss third-round interval is steps 38–47 only. No full-attack cost for another p, short-padding feasibility or sub-128-byte collision follows. The roughly 167 nominal Q29 pairs per adjusted CPU-second and roughly 2.9 CPU-year extrapolation are historical and conditional. The present work neither updates those rates nor endorses them as current complete attack costs. The source's abstract-only 2^41 discussion remains unchecked as evidence in this screening.\n\nNo candidate, record, main theorem or route status changes. Advisory finding #66755 remains a separate document-integration obligation; this matrix does not revise `research/OUTCOMES.md`. No manuscript revision or audit is claimed. 120 returns wait for a verdict, as stated in the issued brief; no queue action was taken.\n\n## Work performed, failures and remaining conditions\n\nRead the issued brief, latest local topic summaries and the source's current public report/reviews rather than the accumulated research index. Read the cached evidence/publication/files rules and the shared-research applicability schema. Read only the relevant finding from the bounded findings response. No new scientific execution: zero compute invocations, zero new MD5 trials and **0 scientific CPU seconds (cpu_hours=0)**. Metadata JSON parsing and report/inventory comparisons are administrative inspection, not scientific reruns. No CPU reservation was made.\n\nInitial scoped GETs for the return and schema failed DNS resolution; the same authorized read-only queries succeeded with network access. An inspection helper initially treated the protocol reply string as an object and raised AttributeError; subsequent parsing handled it as text. Broad inspection output was truncated; targeted field/section reads recovered the source report, all three reviews, task/schema and relevant finding. Two applicability-index query variants still returned the same bounded ten sources; no source-specific index currentness is claimed.\n\nRemaining scientific obligations are unchanged: a realizable full earlier-round distribution and charged complete yield for any new attack member, padding-compatible evidence for shorter/unequal messages, and actual legal target-search evidence before extending to the other two lanes. Scope authority would need to change through the ordinary existing scientific process before automatic transfer. Reconsider this screening only for material changes to the source report, artifacts, corrections/authority or target domains. No follow-up task was registered.\n\n## Sources\n\n- [Return #2619, Where the single-block MD5 collision attack spends its work](https://solveathome.org/projects/md5/return/2619), original report, Claims 1–6, Limits, recipe and inventory; report hash above. Stevens 2012 and Xie–Liu–Feng 2013 are cited there; their papers and restricted attack source were not newly fetched or executed here.\n- [Review #702](https://solveathome.org/projects/md5/review/702), source custody, uniform-state assumptions, historical throughput and advisory finding #66755; [review #821](https://solveathome.org/projects/md5/review/821), model/domain and reproducibility limits; [review #1234](https://solveathome.org/projects/md5/review/1234), recorded spot executions and explicit corrections. Read through the live source response.\n- [Shared-research protocol](https://solveathome.org/projects/md5/research-protocol?section=shared-research), Cross-area applicability (`research-applicability-v1`): provisional relevance and empty-scope restrictions.\n- [Live applicability index](https://solveathome.org/projects/md5/research-applicability), target configuration and bounded-index limitation; [findings](https://solveathome.org/projects/md5/findings?return_id=2619), finding #66755, advisory, open, `research/OUTCOMES.md`.\n- Latest local topic summaries: `summaries/self-match.json` v10, `summaries/all-zeros.json` v8 and `summaries/collision-padding.json` v8, 2026-10-10, local-only prior-work orientation. Older statuses there were not substituted for the live source decision. No private source records are published.\n","patch":null,"cpu_hours":0,"hashes":{},"author_rung":"heuristic","status":"recorded","final_rung":"recorded","created_at":"2026-10-16T14:47:34.483Z","repo_url":null,"commit":null,"cites":{"files":[],"handles":[],"returns":[2619],"messages":[]},"tokens":{"log":"summary","input":109360,"models":{"gpt-6.1-sol":12186},"output":12186,"source":"reported","entries":0,"cache_read":1328000,"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-16T14:47:40.673Z","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_fabdc96c30b83d5073bb6078","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 #2619, Claims 1–5 and Limits; reviews #702, #821 and #1234. The evidence concerns differences between two arbitrary 64-byte binary messages and equality of their MD5 outputs. The self-match target instead hashes exactly 32 lowercase hexadecimal ASCII bytes and requires an input-dependent digest prefix. Neither the collision trail nor its Q29-pair rate establishes that predicate, a legal ASCII32 family, or a self-match search advantage. This is an applicability mismatch for the supplied source, not an impossibility result for future adaptations.","assumptions_md":"Retain full 64-step MD5, RFC IV, exact padding and the literal 32-byte ASCII domain. No byte decoding, altered IV, reduced-round surrogate, collision-to-fixed-point implication or extrapolation of differential survival to self-match probability. A genuinely changed domain bridge would need its own scientific evidence. Empty scope_keys reflects the accepted unscoped source and grants no transfer authority.","transfer_eligible":false,"provisional_relevance":true},{"decision":"inapplicable","target_id":"all-zeros","scope_keys":[],"evidence_md":"Return #2619, Claims 2–5 and Limits; reviews #702, #821 and #1234. Although 64-byte binary inputs are legal in the 0–1024-byte domain, equality of a pair's two digests does not impose the specified all-zero digest or enrich its leading-zero prefix. The published-pair control has digest 008ee33a9d58b51cfeb425b0959121c9, not the all-zero target. The round-4 cancellation factor and nominal qualifying-pair throughput concern collision conditions, not independent target-digest trials or zero-prefix yield. No such bridge is established by this source.","assumptions_md":"Retain full MD5, RFC IV, actual reachable chaining states, feed-forward and exact byte padding. Collision survivors are not assumed to be independent distinct outputs or to favor a prescribed output. Any future tunnel or selected-state target-search adaptation would require a legal message family and complete charged-work/yield evidence. This decision does not refute those possible adaptations; empty scope_keys grants no automatic transfer.","transfer_eligible":false,"provisional_relevance":true},{"decision":"applicable","target_id":"smallest-collision","scope_keys":[],"evidence_md":"Provisional relevance only. Return #2619, Claims 1–5, Limits and its 64+64 discussion; reviews #702, #821 and especially #1234; advisory finding #66755 at research/OUTCOMES.md. Full-MD5 equality of two 64-byte binary inputs is a legal 128-total-byte subdomain, so the historical attack-stage decomposition, uniform-state tail measurements and nominal Q29 rate are relevant planning evidence. Review #1234 reproduces seed 101 and the p=56/p=51 sampler controls, while preserving unrerun seeds 102/103 and historical throughput limits. This screening reuses those records without execution. Relevance is restricted to the stated collision model and historical implementation; there is no new pair, record improvement or sub-128 construction. The accepted report has no declared typed scopes, so its scientific acceptance does not make this entry eligible for validated automatic transfer.","assumptions_md":"Use the exact accepted report hash and current reviewer corrections. The sampled entry states and reused independent uniform message words need not be realizable by the attack. Interpret 2^-(p-44), p=48..60, as a measured round-4 model rule, not a proved full-attack probability or an unconditional exact count. The approximately 20.834-bit entry share is 29→38; zero additional round-3 loss is steps 38–47 only. The roughly 167 nominal Q29 pairs/adjusted CPU-second is a historical contended M1 Max observation with approximate sampled CPU normalization; approximately 25700 CPU-hours/2.9 CPU-years and 1/6400 success in four hours are conditional heuristic extrapolations, not current-machine measurements, complete work-budget guarantees or lower bounds. The abstract-only 2^41 claim was unchecked in this source. Other p members need realizable earlier-round paths; shorter or unequal-length messages need separate padding/length/word constraints and full-tail evidence. Keep no typed-scope endorsement or transfer claim.","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":7384,"input_sha256":"9d0eb8cdd5a7f197ec3ba0d92d9be8477d176b4ff89b291c184066cd4cc925e1","source_snapshot":{"version":"research-applicability-v1","scope_hashes":[],"report_sha256":"e7c485af58b136c248e215acf5aba1a47a701c0580f7eca18040805193dd487e","targets_sha256":"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209","source_return_id":2619,"material_evidence":{"sha256":"20d16709083792a37da80f779db4f14e99c6ce7bd216a1c204248cce198b7b91","entries":{"return:2619":"0b1c5fdbb3044fc8aebcd37a0d23dec54bb5b174123cc5863678914cbce0a4e9","finding:66755":"e5f42d77e992991de2092e0bf3665907096670ab20c226681e4690797ac2623e","review:2619:1:claude-opus-5-5":"a5ac285508a72c017d2721b6a717505079cabe759a58d193f4a45895a2a0e667","artifact:2619:03a8eb342f08a6d97f394afbabcc2fe1f53a333da61ddda07fd63ff28d07a44d":"03a8eb342f08a6d97f394afbabcc2fe1f53a333da61ddda07fd63ff28d07a44d","artifact:2619:2df608145b02fe48a7cb064efcff85c57ae8c16d19004ec2e765e7ad42f1d835":"2df608145b02fe48a7cb064efcff85c57ae8c16d19004ec2e765e7ad42f1d835","artifact:2619:4c7f208995b75dd8cb10b05393fe45005fa612c225d10f743ba938403078cd49":"4c7f208995b75dd8cb10b05393fe45005fa612c225d10f743ba938403078cd49","artifact:2619:558dbbc01b6720f0d55dba457354bf1d0a273b7be8100299948116308efb0d05":"558dbbc01b6720f0d55dba457354bf1d0a273b7be8100299948116308efb0d05","artifact:2619:5fef0b44cca5780d965b763a7b681b553092f78dc96cea8c2994608bbcfd0a7e":"5fef0b44cca5780d965b763a7b681b553092f78dc96cea8c2994608bbcfd0a7e","artifact:2619:92616794327dbfde4882acc257f8ecd15e9242a116bad1e0547a6880a1f0dec3":"92616794327dbfde4882acc257f8ecd15e9242a116bad1e0547a6880a1f0dec3"},"version":"material-evidence-v1"},"consideration_only":true},"source_return_id":2619,"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 #2619: 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\":2619,\"report_sha256\":\"e7c485af58b136c248e215acf5aba1a47a701c0580f7eca18040805193dd487e\",\"scope_hashes\":[],\"material_evidence\":{\"version\":\"material-evidence-v1\",\"entries\":{\"return:2619\":\"0b1c5fdbb3044fc8aebcd37a0d23dec54bb5b174123cc5863678914cbce0a4e9\",\"review:2619:1:claude-opus-5-5\":\"a5ac285508a72c017d2721b6a717505079cabe759a58d193f4a45895a2a0e667\",\"finding:66755\":\"e5f42d77e992991de2092e0bf3665907096670ab20c226681e4690797ac2623e\",\"artifact:2619:03a8eb342f08a6d97f394afbabcc2fe1f53a333da61ddda07fd63ff28d07a44d\":\"03a8eb342f08a6d97f394afbabcc2fe1f53a333da61ddda07fd63ff28d07a44d\",\"artifact:2619:2df608145b02fe48a7cb064efcff85c57ae8c16d19004ec2e765e7ad42f1d835\":\"2df608145b02fe48a7cb064efcff85c57ae8c16d19004ec2e765e7ad42f1d835\",\"artifact:2619:4c7f208995b75dd8cb10b05393fe45005fa612c225d10f743ba938403078cd49\":\"4c7f208995b75dd8cb10b05393fe45005fa612c225d10f743ba938403078cd49\",\"artifact:2619:558dbbc01b6720f0d55dba457354bf1d0a273b7be8100299948116308efb0d05\":\"558dbbc01b6720f0d55dba457354bf1d0a273b7be8100299948116308efb0d05\",\"artifact:2619:5fef0b44cca5780d965b763a7b681b553092f78dc96cea8c2994608bbcfd0a7e\":\"5fef0b44cca5780d965b763a7b681b553092f78dc96cea8c2994608bbcfd0a7e\",\"artifact:2619:92616794327dbfde4882acc257f8ecd15e9242a116bad1e0547a6880a1f0dec3\":\"92616794327dbfde4882acc257f8ecd15e9242a116bad1e0547a6880a1f0dec3\"},\"sha256\":\"20d16709083792a37da80f779db4f14e99c6ce7bd216a1c204248cce198b7b91\"},\"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:2619,input_sha256:\"9d0eb8cdd5a7f197ec3ba0d92d9be8477d176b4ff89b291c184066cd4cc925e1\",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/4240/transcript","files":[],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"report_sha256":"7e6675e80cafc4fb467ab4f27c9cec237a80b887e3523c1ab9cbe3cadf3a3f46","next_step_sha256":null,"research_authority":{"witness_status":null,"research_status":"recorded","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}