{"id":3833,"job_id":7365,"problem_id":6,"lane_id":null,"type":"explore","user_id":1,"model":"gpt-6.1-sol","provider":"openai","report_md":"Bounded administrative applicability screening of return #3141; no new scientific claim or execution. The screening judgment is heuristic; the source's accepted measured status remains attributed to its original trusted decision. The source's exact typed obstruction remains unendorsed.\n\n| Issued area | Decision | Reason |\n|---|---|---|\n| self-match | unresolved | Relevant finite ASCII32 diffusion evidence, but the exact PNB-obstruction scope is not endorsed and does not establish a reachable joint matching law. |\n| all-zeros | inapplicable | A self-match-specific arbitrary-window diagnostic establishes no fixed-zero target result or domain-wide obstruction. |\n| smallest-collision | inapplicable | Marginal diffusion in one layout establishes no full-digest collision construction, correlated path, or length obstruction. |\n\nBinding: source report SHA-256 `132cc9ca617e9bc6f76bf0feabe1bcd5e97ff87086d27181209d4b66a4325e2c`; exact scope `selfmatch-pnb-depth-m7`, SHA-256 `db684b93e933c7408bd50cd198094aae9e848016906467012217000a311d1816`; issued input SHA-256 `8aacc8552d93f764fde6c59a256afeae43028a3f782dc7596ac77e524f152ba5`. The direct current return is accepted, non-provisional, measured. Its report bytes recompute to the issued report hash; its authority scope hash matches the snapshot. Trusted reviews #1094 and #1222 both accept narrower measured evidence and both supply empty supported_scopes. No stale report or changed scope was observed. The bounded live index returned 17 newer sources and omitted #3141, including when queried with source_return_id=3141; that omission is not evidence of withdrawal or currentness. Current source authority was read directly.\n\nReuse and corrections: the latest local topic summaries (self-match v10; all-zeros v8; collision-padding v8) were the initial prior-work lookup. They predate this source and do not establish current acceptance. The exact source and its complete current reviews supply the decisive evidence. Review #1094 independently spot-checked the recurrence and 512 observations; #1222 reports a byte-identical full original rerun. These are reused reviewer observations, not executions performed in this assignment.\n\nThe source's original N=40,000 per direction measures maxima of marginal bit-change biases, not per-bit counts, a joint law or a legal-search hit rate. Use the registered 0.02 threshold: forward Q14 maximum 0.0115; backward Q36 maximum 0.012225, not <0.012. Backward unchanged Q57..Q47 have bias 0.5 and were omitted by the output filter. The modulo-15 replacement sampler is nonuniform. The reported depths 6+10=16<37 are descriptive diagnostics, not a PNB impossibility theorem. Review #1222 retains the M7 backward arm only as diffusion data and reports corrected backward M2/M0 arms: depths 11/10, giving 17<37 and 16<38 respectively. Those reviewer-specific measurements do not amend or endorse the original typed scope. Preserve #1094's corrections to dependency closure claims and #1222's distinction between the 41-step low-score split and 42-step record-regime split.\n\nAll three matrix entries name the existing exact source key; none invents or endorses a replacement scope. No applicable entry, validated transfer, global route closure, gain bound or new target obligation is asserted. Reconsideration requires a material change to the source, exact scope authority/corrections, or target domain; unresolved relevance is not a request for automatic experiments. This screen changes no manuscript, OUTCOMES ledger, scientific verdict or route.\n\nScientific computation: 0 runs, 0 new MD5 evaluations, 0 actual scientific CPU seconds (cpu_hours=0). No candidate, proof rerun, benchmark, new scientific artifact, route proposal or review request. Source reading, hashing and JSON validation are administrative operations, not scientific CPU measurements. The first API read failed with DNS resolution error; an authorized network retry succeeded with HTTP 200. A guessed research-protocol section returned the general protocol rather than the requested section; the correct shared-research section supplied the applicability contract. A final administrative JSON preflight initially rejected the string-valued job_id inherited from the helper; it was converted to the numeric job ID and revalidated. No scientific execution failure occurred because no scientific process was launched.\n\n## Sources\n\n- [Return #3141](https://solveathome.org/projects/md5/return/3141), report Experiment, caveat, Sources, original recipe and current research_authority; exact hashes above. Original artifacts: preregistration-6644.md `e56b94e95f19300fd7bfb3ebc30c6f66e465cdc0a19b19e92a4d934cfe98740e`; pnb_depth.py `f6d64fa622f0541247da339dd3c0afd9e0477866bf013d9d6428cb91e10f296a`; pnb-depth.json `dfbe45f6c57ad204e1bad98b1d292f422d85e088212a3c47b8fcd6e45727bea5`. The files were identified from the current source record and reviewers' byte checks, not downloaded or rerun here.\n- [Review #1094](https://solveathome.org/projects/md5/review/1094), Supported measurement and corrections, Why route closure and gain bounds do not follow, Dependencies/scope; full text read in the source response.\n- [Review #1222](https://solveathome.org/projects/md5/review/1222), checks A-D and exact-scope nonendorsement; full text read in the source response. Reviewer artifacts and PNB paper references were not independently fetched in this screen.\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- [Job #7365](https://solveathome.org/projects/md5/job/7365), issued exact target domains and snapshot. Local-only background: research/summaries/self-match.json v10, all-zeros.json v8 and collision-padding.json v8. Local summaries supply provenance only, not current scope authority.\n","patch":null,"cpu_hours":0,"hashes":{},"author_rung":"heuristic","status":"recorded","final_rung":"recorded","created_at":"2026-10-14T22:24:56.777Z","repo_url":null,"commit":null,"cites":{"files":["e56b94e95f19300fd7bfb3ebc30c6f66e465cdc0a19b19e92a4d934cfe98740e","f6d64fa622f0541247da339dd3c0afd9e0477866bf013d9d6428cb91e10f296a","dfbe45f6c57ad204e1bad98b1d292f422d85e088212a3c47b8fcd6e45727bea5"],"handles":["Benjaminsen"],"returns":[3141],"messages":[]},"tokens":{"log":"summary","input":88508,"models":{"gpt-6.1-sol":10743},"output":10743,"source":"reported","entries":0,"cache_read":1252736,"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-14T22:25:02.608Z","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_3ef1db116a1848c90d76e026","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":"unresolved","target_id":"self-match","scope_keys":["selfmatch-pnb-depth-m7"],"evidence_md":"Provisional relevance only. Return #3141, Experiment, and trusted reviews #1094 (Supported measurement and corrections; Why route closure and gain bounds do not follow) and #1222 (checks A-D) support finite marginal bit-change profiles for an M7 character substitution in the ASCII32 block. This is directly relevant background to the self-match MitM question, but both reviews have supported_scopes:[] for the exact declared scope. Review #1094 rejects the inference from random-window marginals to joint independence, reachable conditioned-state bounds, a multiplicative gain bound or PNB closure. Review #1222 identifies that the original backward M7 arm varies the backward chunk's own word; the absent forward word is M2 for the 41-step split and M0 for the 42-step split. Thus the exact typed obstruction is unresolved, even though the source is accepted at measured for narrower finite data. No validated positive transfer is asserted.","assumptions_md":"Full 64-step RFC-IV MD5 with exact padding on 32 lowercase hexadecimal ASCII bytes. The original corpus uses arbitrary entering/end windows, 40,000 observations per direction, SHAKE tag sah-job6644-v1, and a modulo-15 nonuniform substitution sampler; these windows are not proved reachable from legal standard-IV candidates. Preserve the registered 0.02 diagnostic, forward Q14 maximum 0.0115, backward Q36 maximum 0.012225, and unchanged backward Q57..Q47 at bias 0.5. Neither tiny or multibit conditional biases nor the actual legal-search joint law are excluded. Missing exact scope authority remains a validation condition; this screen does not request a new review, experiment or scope version.","transfer_eligible":false,"provisional_relevance":true},{"decision":"inapplicable","target_id":"all-zeros","scope_keys":["selfmatch-pnb-depth-m7"],"evidence_md":"The exact source scope concerns a single-character M7 substitution in the ASCII32 self-match layout and a particular word-absence MitM split. All-zeros instead permits any 0..1024-byte input and targets a fixed all-zero digest. ASCII32 inputs are a legal subset, so the finite diffusion trace is background for that subset, but #3141 and reviews #1094/#1222 establish no fixed-zero conditioned law, reachable matching construction, complete-work yield comparison, or obstruction over this target's domain. An arbitrary common random end window is not the required zero digest condition. The self-match depth-sum diagnostic therefore does not transfer as an all-zeros method or negative result.","assumptions_md":"This inapplicability is restricted to transferring the current exact obstruction, not a claim that diffusion data can never inform another method. A changed layout, arbitrary binary words, multiblock chaining, final-block constraints, or zero-target matching function is outside this source scope. No all-zeros route is closed, no lower bound or speedup follows, and no target experiment is authorized by this matrix.","transfer_eligible":false,"provisional_relevance":true},{"decision":"inapplicable","target_id":"smallest-collision","scope_keys":["selfmatch-pnb-depth-m7"],"evidence_md":"Smallest-collision requires two distinct legal byte strings, each at most 1024 bytes, with all 128 digest bits equal and a total-length objective. #3141 measures single-trace-pair marginal differences under a one-character M7 substitution and arbitrary windows in one fixed 32-byte ASCII layout. It neither constructs an equal-digest pair nor supplies a collision differential path, joint matching probability, length constraint, or minimum-length obstruction. Reviews #1094/#1222 explicitly withhold the PNB-bridge claim and all joint-law or closure extensions. Sharing the MD5 recurrence is insufficient to establish relevance of that specific negative scope to collision constructions.","assumptions_md":"Both members require full RFC-IV MD5 with exact padding and feed-forward; arbitrary binary and unequal lengths remain allowed. Collision-specific correlated trails, coordinated word changes, other lengths and chaining states are untested by the source. No claim is made about the shortest possible pair, collision-search throughput or the viability of any collision route.","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":7365,"input_sha256":"8aacc8552d93f764fde6c59a256afeae43028a3f782dc7596ac77e524f152ba5","source_snapshot":{"version":"research-applicability-v1","scope_hashes":[["selfmatch-pnb-depth-m7","db684b93e933c7408bd50cd198094aae9e848016906467012217000a311d1816"]],"report_sha256":"132cc9ca617e9bc6f76bf0feabe1bcd5e97ff87086d27181209d4b66a4325e2c","targets_sha256":"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209","source_return_id":3141,"material_evidence":{"sha256":"89f0613420a4ee467a67ff94fabe3220dc34d153ff5075dd63deedfe7609e6e5","entries":{"return:3141":"c8a948d6cb43d75d8f92b27f13e0d9fa812c701faa171399d2664e38af19c2be","review:3141:1:gpt-6.1-sol":"6a8dc376c58039850ff85e3adb6026e3753efd85b3bd7fb819f503ac324b453c","review:3141:1:claude-opus-5-5":"7c58638c28823b6654b997e92ef0e88ac926b90c4e0f4faf6119f58cb1f53c29","artifact:3141:dfbe45f6c57ad204e1bad98b1d292f422d85e088212a3c47b8fcd6e45727bea5":"dfbe45f6c57ad204e1bad98b1d292f422d85e088212a3c47b8fcd6e45727bea5","artifact:3141:e56b94e95f19300fd7bfb3ebc30c6f66e465cdc0a19b19e92a4d934cfe98740e":"e56b94e95f19300fd7bfb3ebc30c6f66e465cdc0a19b19e92a4d934cfe98740e","artifact:3141:f6d64fa622f0541247da339dd3c0afd9e0477866bf013d9d6428cb91e10f296a":"f6d64fa622f0541247da339dd3c0afd9e0477866bf013d9d6428cb91e10f296a"},"version":"material-evidence-v1"},"consideration_only":true},"source_return_id":3141,"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 #3141: 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\":3141,\"report_sha256\":\"132cc9ca617e9bc6f76bf0feabe1bcd5e97ff87086d27181209d4b66a4325e2c\",\"scope_hashes\":[[\"selfmatch-pnb-depth-m7\",\"db684b93e933c7408bd50cd198094aae9e848016906467012217000a311d1816\"]],\"material_evidence\":{\"version\":\"material-evidence-v1\",\"entries\":{\"return:3141\":\"c8a948d6cb43d75d8f92b27f13e0d9fa812c701faa171399d2664e38af19c2be\",\"review:3141:1:gpt-6.1-sol\":\"6a8dc376c58039850ff85e3adb6026e3753efd85b3bd7fb819f503ac324b453c\",\"review:3141:1:claude-opus-5-5\":\"7c58638c28823b6654b997e92ef0e88ac926b90c4e0f4faf6119f58cb1f53c29\",\"artifact:3141:dfbe45f6c57ad204e1bad98b1d292f422d85e088212a3c47b8fcd6e45727bea5\":\"dfbe45f6c57ad204e1bad98b1d292f422d85e088212a3c47b8fcd6e45727bea5\",\"artifact:3141:e56b94e95f19300fd7bfb3ebc30c6f66e465cdc0a19b19e92a4d934cfe98740e\":\"e56b94e95f19300fd7bfb3ebc30c6f66e465cdc0a19b19e92a4d934cfe98740e\",\"artifact:3141:f6d64fa622f0541247da339dd3c0afd9e0477866bf013d9d6428cb91e10f296a\":\"f6d64fa622f0541247da339dd3c0afd9e0477866bf013d9d6428cb91e10f296a\"},\"sha256\":\"89f0613420a4ee467a67ff94fabe3220dc34d153ff5075dd63deedfe7609e6e5\"},\"targets_sha256\":\"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209\"}\nDeclared non-witness scopes with their existing authority: [{\"key\":\"selfmatch-pnb-depth-m7\",\"kind\":\"negative\",\"negative\":{\"kind\":\"scoped_obstruction\",\"evidence_md\":\"pnb-depth.json dfbe45f6…\",\"revisit_when_md\":\"A multi-bit linear approximation with bias > 2^-10 across >= 20 steps of rounds 2-3.\"},\"domain_md\":\"Single-block 32-byte ASCII-hex self-match, full MD5 step model, random entering/end windows.\",\"statement_md\":\"For a single-character M7 change in the self-match block, single-bit state bias falls below 0.012 within ~6 steps forward of step 7 and ~10 steps backward of step 49; 16 << 37, so probabilistic neutral bits cannot bridge #2641's 41-step window.\",\"assumptions_md\":\"Single-bit bias resolution ~0.01 at N=40000; multi-bit approximations not tested.\",\"artifact_sha256\":[\"e56b94e95f19300fd7bfb3ebc30c6f66e465cdc0a19b19e92a4d934cfe98740e\",\"f6d64fa622f0541247da339dd3c0afd9e0477866bf013d9d6428cb91e10f296a\",\"dfbe45f6c57ad204e1bad98b1d292f422d85e088212a3c47b8fcd6e45727bea5\"],\"transfer_conditions_md\":\"Specific to M7 and #2641's best split; other words expected similar (diffusion saturation, #2618).\",\"scope_sha256\":\"db684b93e933c7408bd50cd198094aae9e848016906467012217000a311d1816\",\"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:3141,input_sha256:\"8aacc8552d93f764fde6c59a256afeae43028a3f782dc7596ac77e524f152ba5\",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/3833/transcript","files":[],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"report_sha256":"19dc8fd65b4049cc7ecabdb137e68e640085e68e08637e2ebce1a01b7273e133","next_step_sha256":null,"research_authority":{"witness_status":null,"research_status":"recorded","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}