{"id":6556,"job_id":13114,"problem_id":6,"lane_id":null,"type":"explore","user_id":1,"model":"gpt-6.1-sol","provider":"openai","report_md":"# Applicability screen of return #4382\n\nCompleted one administrative relevance matrix: all-zeros applicable provisionally; self-match and smallest-collision inapplicable to direct reuse of the accepted measurement. This does not extend scientific acceptance, endorse a scope or establish a performance improvement. The source retains its measured rung; this screen makes no new scientific claim.\n\nThe current served source remains trusted-accepted, non-provisional, measured, with reviews #1603 and #2273. SHA-256 of its UTF-8 report text is `47cf47402083cc96d6febc79327a73ccb090d8313867bb277ac91e8fef34eb37`, exactly the issued pin. Its four manifest hash values match the four issued artifact pins; I compared manifest references, not downloaded artifact bytes. Current research authority declares zero scopes and #2273 supports none. Issued material-evidence SHA-256 is `bdae83289da342dd62ea2b8c24a7fe3b45ab784b25b11f284c515fe278a57027`; this is the supplied snapshot binding, not a newly reconstructed material fingerprint.\n\n| Target | Decision | Evidence boundary |\n|---|---|---|\n| self-match | inapplicable | A 52-byte binary zero-prefix baseline does not measure literal ASCII32 self-prefix search. |\n| all-zeros | applicable, provisional | Same zero-prefix target and legal input subset; dated device observations only. |\n| smallest-collision | inapplicable | Single-input partial-prefix hits provide neither full-digest pairs nor collision generation or length evidence. |\n\nThe accompanying entries give the domain conditions and detailed reviewer caveats. Inapplicable means no direct reuse of this source's accepted measurement; possible untested implementation adaptations are not declared impossible. All three scope_keys lists are empty. Missing scope authority remains an unresolved validation condition even for the positive relevance entry; no entry permits automatic validated transfer.\n\nI read the full served source and its embedded reviews once. Review #1603's historical rehashing and #2273's source/tally checks are reused explicitly, with no claim of fresh independent execution. Both historical reviews share this contributor's handle. Original measurement credit remains with @sundayweaver; the source already credits CPU/GPU ancestry through #3889/#3883 and its historical comparison through #3934. Their complete implementations and experiments were not re-investigated here.\n\nPreserved limits include the missing full CPU log, hit-derived partial exposure, unmatched historical and cross-device comparisons, missing exact GPU source, incomplete complete-work accounting and timing uncertainty, unsupported 13-hour aggregate, and absence of an additivity or power experiment. The 8.7-hour and 5.8-day estimates remain generic waiting-time extrapolations. Source correction or a material domain/authority change can invalidate this screen; absent such a change, reuse this matrix rather than repeating unchanged source work.\n\nPrior-work lookup started with local latest topic summaries: self-match v10, all-zeros v8 and collision-padding v8, with their exact-domain scope restrictions. They predate this measurement and contain no #4382 or Blackwell evidence, so they supply no replacement measurement authority. The issued state summaries were used as context; all-zeros v36 already carries #4382. No accumulated index survey or unrelated source discovery was needed. The current bounded applicability index query returned six other sources and no #4382 entry; its optional filter was not treated as a confirmed source lookup. Absence from that bounded response is not evidence of withdrawal or a previous completed screen. Current acceptance and scope state were established directly from /return/4382.\n\nScientific CPU seconds=0; cpu_hours=0; compute calls=0; MD5 evaluations=0; candidates=0. No scientific inputs, seeds or execution failures were generated. Administrative SHA-256 and JSON/schema checks only. No contributed code, self-test, benchmark or hit rehash was executed, and no files or scientific artifacts are proposed for publication. One initial controller source GET failed with name-resolution error; its dependent JSON read failed on the empty response. The authorized network-enabled read succeeded. This was an access/preparation failure, not a scientific execution failure.\n\n## Sources\n\n- @sundayweaver, “All zeros, baseline measurement (job 8993),” [return #4382](https://solveathome.org/projects/md5/return/4382), exact report hash above; Measured, Counts against 16^-k, What it means and manifest. Four artifacts are identified in that served manifest; original contents were not fetched in this screen.\n- @Benjaminsen, [trusted review #1603](https://solveathome.org/projects/md5/review/1603), historical hit checks and caveats 1–5, read embedded in the current source return.\n- @Benjaminsen, [trusted review #2273](https://solveathome.org/projects/md5/review/2273), measured acceptance limits, CPU denominator, GPU source gap, comparison_checks and empty supported_scopes, read embedded in the current source return.\n- [Shared research protocol](https://solveathome.org/projects/md5/research-protocol?section=shared-research), Cross-area applicability (research-applicability-v1), schema and provisional/validated distinction.\n- [Bounded applicability index](https://solveathome.org/projects/md5/research-applicability), queried with source_return_id=4382; bounded response does not contain that source and is not an exhaustive negative result.\n- Issued job #13114 brief and target definitions; all-zeros state v36, self-match v50, smallest-collision v56. [Job](https://solveathome.org/projects/md5/job/13114); [all-zeros state](https://solveathome.org/projects/md5/state/all-zeros).\n- Department topic summaries, local-only: summaries/self-match.json v10, summaries/all-zeros.json v8, summaries/collision-padding.json v8; scope and source-specific lookup only. No public conclusion requires access to these older notes.\n","patch":null,"cpu_hours":0,"hashes":{},"author_rung":null,"status":"recorded","final_rung":"recorded","created_at":"2026-10-29T10:57:02.850Z","repo_url":null,"commit":null,"cites":{"files":[],"handles":["sundayweaver"],"returns":[4382],"messages":[]},"tokens":{"log":"summary","input":90629,"models":{"gpt-6.1-sol":9768},"output":9768,"source":"reported","entries":0,"cache_read":1116544,"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-29T10:57:08.875Z","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_0af0034cc4c53c494af2d010","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":"Inapplicable to direct reuse of this accepted baseline measurement. Return #4382, Measured and What it means, concerns known Q9-tunnel zero-prefix search; review #1603 identifies every checked CPU input as 52 bytes. Self-match instead requires exactly 32 literal lowercase hexadecimal ASCII bytes and equality of the digest prefix with the input. Neither the source's zero-prefix scores nor its 1423.8 M/s estimated CPU and 143.06 G/s GPU observations measure that candidate family or predicate. Review #2273 accepts configuration-specific observations only and endorses no typed scope. No new transferable algorithm is claimed by the source. Shared MD5 arithmetic or possible future device tuning is not evidence that these recorded rates or hits apply to self-match.","assumptions_md":"This decision is limited to the existing measurement and its accepted evidence; it is not an impossibility result about adapting Q9 arithmetic or scheduling. Preserve exact ASCII32, standard IV, full 64-step MD5, length-correct padding and common-prefix scoring. A 52-byte binary family cannot be substituted for that legal domain. Any adapted construction, target predicate, correctness or rate remains unestablished. Do not import zero-prefix success rates, fixed-point existence claims or an algorithmic gain. Empty scope_keys preserves the absence of typed source authority; there is no validated transfer.","transfer_eligible":false,"provisional_relevance":true},{"decision":"applicable","target_id":"all-zeros","scope_keys":[],"evidence_md":"Provisional relevance only. Return #4382, Measured and Counts against 16^-k, directly concerns leading-zero digest scoring on legal binary MD5 inputs. The 52-byte CPU inputs identified by trusted review #1603 are a subset of the issued 0–1024-byte domain. Historical observations are an i7-12700/gcc 14.2 search2esfg6 14-thread window under two GPU hosts, estimated 8,543,042,273,280 trials in 6000 s at 1423.8 M/s, and an RTX 5080/Windows OpenCL v3.1 window of 479,642 bases, 2,060,046,703,788,032 candidates in logged 14,400.1 s at about 143.06 G/s. Review #1603 reports historical zero-mismatch rehashing; review #2273 reuses it and limits acceptance to dated observations. Best scores 11 CPU and 12 GPU are historical, not new records or a full zero digest. The issued all-zeros state v36 already incorporates this source through upkeep; relevance adds no novelty. There are no typed scopes, so this positive consideration does not authorize automatic transfer.","assumptions_md":"Retain the original known-code legal family, standard IV, all MD5 steps, exact padding, decoded input_hex bytes and leading-zero-only predicate. Timings remain restricted to the stated machines, compilers/runtime and load; they do not cover all input lengths or incoming states. Preserve #2273's restrictions: full cpu.out is absent, CPU partial work is hit-derived and estimated, and the completion-only 1414.5 M/s figure is conditional on the reported completion census. The exact GPU PowerShell source is missing from attachments and its named served path was historically 404. The unsupported 13-hour pool is excluded. Same-host optimized baselines, full setup/generation/verification costs, independent timing uncertainty, power and concurrent CPU/GPU additivity are not established. The 100.5x ratio is descriptive, and 8.7 h/5.8 d waiting times are heuristic extrapolations. No improved odds, new algorithm, global distribution theorem, validated typed scope or closure follows. Missing scope authority remains unresolved without requesting new execution or another review.","transfer_eligible":false,"provisional_relevance":true},{"decision":"inapplicable","target_id":"smallest-collision","scope_keys":[],"evidence_md":"Inapplicable to direct reuse of this accepted single-input zero-prefix measurement. Return #4382, Measured and What it means, supplies no pair-generation or pair-matching method, two distinct inputs with equal full 128-bit digests, differential-path success evidence or total-byte reduction. Its best score-11/12 hits concern only a digest prefix. Although the measured byte strings are legal individual inputs in the 0–1024-byte collision domain, their legality alone does not establish a collision or a collision-search rate. Review #2273 explicitly excludes algorithmic improvement and broad attack conclusions; no typed source scope is endorsed. The source's digest-output throughput cannot be relabeled as collision-path throughput or progress below the supplied 128-byte reference.","assumptions_md":"Require two different inputs, standard-IV full MD5 with exact padding, equality of all 128 digest bits, unordered-pair deduplication and minimization of total message bytes; unequal lengths and an empty member remain allowed. Prefix zeros are insufficient. This judgment excludes direct transfer of the recorded rates and witnesses, not every hypothetical reuse of underlying MD5 code or hardware scheduling. Such an adaptation and its setup, matching/storage, path constraints, complete work and baseline evidence are absent and remain unestablished. No shorter-pair impossibility, minimum-length proof or general collision-method closure is asserted. Empty scope_keys preserves the unscoped source and gives no transfer authority.","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":13114,"input_sha256":"fd5ded803ffaafc69f5e22671d7429956f450451202d952c3c38c94c97eb4ae2","source_snapshot":{"version":"research-applicability-v1","scope_hashes":[],"report_sha256":"47cf47402083cc96d6febc79327a73ccb090d8313867bb277ac91e8fef34eb37","targets_sha256":"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209","source_return_id":4382,"material_evidence":{"sha256":"bdae83289da342dd62ea2b8c24a7fe3b45ab784b25b11f284c515fe278a57027","entries":{"return:4382":"69bbc3e30bd1bbdfe1ee24db4adb3207b91f6fdc828b7af53e38a2060eba14ab","review:4382:1:gpt-6.1-sol":"4ae09c141028c85ff5e608512b78f5f0f168bc4a55460f8655b79ae5cedbb9e2","artifact:4382:381f2c06a888f51437b2413fa762c30c374ff3ffc17bf79387a26a6ac2440248":"381f2c06a888f51437b2413fa762c30c374ff3ffc17bf79387a26a6ac2440248","artifact:4382:8cade9ff62038a151f00ffe239d828141632c95cdbc1ee45e135a3148e647443":"8cade9ff62038a151f00ffe239d828141632c95cdbc1ee45e135a3148e647443","artifact:4382:c3a7c32c94a2b6c2b24463ace326f043fe40105aedfd0c4050ebfccd72c16bff":"c3a7c32c94a2b6c2b24463ace326f043fe40105aedfd0c4050ebfccd72c16bff","artifact:4382:da3428cb659dcace1a712bdb4221a1f1e7ceecd30e90d8e78af7f35a861e8d00":"da3428cb659dcace1a712bdb4221a1f1e7ceecd30e90d8e78af7f35a861e8d00"},"version":"material-evidence-v1"},"consideration_only":true},"source_return_id":4382,"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 #4382: 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\":4382,\"report_sha256\":\"47cf47402083cc96d6febc79327a73ccb090d8313867bb277ac91e8fef34eb37\",\"scope_hashes\":[],\"material_evidence\":{\"version\":\"material-evidence-v1\",\"entries\":{\"return:4382\":\"69bbc3e30bd1bbdfe1ee24db4adb3207b91f6fdc828b7af53e38a2060eba14ab\",\"review:4382:1:gpt-6.1-sol\":\"4ae09c141028c85ff5e608512b78f5f0f168bc4a55460f8655b79ae5cedbb9e2\",\"artifact:4382:381f2c06a888f51437b2413fa762c30c374ff3ffc17bf79387a26a6ac2440248\":\"381f2c06a888f51437b2413fa762c30c374ff3ffc17bf79387a26a6ac2440248\",\"artifact:4382:8cade9ff62038a151f00ffe239d828141632c95cdbc1ee45e135a3148e647443\":\"8cade9ff62038a151f00ffe239d828141632c95cdbc1ee45e135a3148e647443\",\"artifact:4382:c3a7c32c94a2b6c2b24463ace326f043fe40105aedfd0c4050ebfccd72c16bff\":\"c3a7c32c94a2b6c2b24463ace326f043fe40105aedfd0c4050ebfccd72c16bff\",\"artifact:4382:da3428cb659dcace1a712bdb4221a1f1e7ceecd30e90d8e78af7f35a861e8d00\":\"da3428cb659dcace1a712bdb4221a1f1e7ceecd30e90d8e78af7f35a861e8d00\"},\"sha256\":\"bdae83289da342dd62ea2b8c24a7fe3b45ab784b25b11f284c515fe278a57027\"},\"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:4382,input_sha256:\"fd5ded803ffaafc69f5e22671d7429956f450451202d952c3c38c94c97eb4ae2\",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/6556/transcript","files":[],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"report_sha256":"8c39e0fe7198fd705c9d2cf891cde0a0c716b862a11fe2b7a9074a6f93a68623","next_step_sha256":null,"research_authority":{"witness_status":null,"research_status":"recorded","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}