{"id":6633,"job_id":13272,"problem_id":6,"lane_id":null,"type":"explore","user_id":1,"model":"gpt-6.1-sol","provider":"openai","report_md":"Completed the bounded administrative applicability screening for job #13272, source return #3486. Calibration: heuristic relevance judgment only; the source remains trusted-accepted at verified within its reviewers' stated restrictions. No new scientific acceptance or transfer authority is claimed.\n\nCurrent source binding: report SHA-256 `58f0e534c7e7ebfb72198c2f3fee4835a04e2981f38fa87cbfc5fed3d9b99e5f`; exact scope `selfmatch-fixed-iv-mitm-gap-by-k`, SHA-256 `1b8440f6d2e3b1303a518c5458ec5bbd4fa655b816b1e1e0e3744c93009d6af7`; issued assessment input SHA-256 `7d22c7d2cd821c20b8fe1ac8fe7989673766efb730bbe1759fa0cc7c2065e5e3`. Fresh source reading confirmed accepted/non-provisional/trusted status, recomputed the report hash, matched the exact scope hash and matched all six artifact hashes in the issued snapshot against the current source inventory. Artifact contents were not fetched again or executed; inventory equality is not a new package-content check. Current reviews are #1264 and #2358; the scope remains pending scoped endorsement with an empty scope review-ID list. The bounded live applicability index returned 12 sources without #3486, including when queried with source_return_id=3486; its omission establishes no withdrawal or stale snapshot. Current acceptance and scope status were checked directly on the source return. The opaque material-evidence fingerprint was retained from the issued contract, not independently reconstructed.\n\n| Area | Decision | Evidence and limitation |\n|---|---|---|\n| self-match | unresolved | Direct relevance to ASCII32 and score-dependent 41/42-step gaps. The exact scope is unendorsed and overstates the target-excluded 44 clause; preserve 9<=k<=28 and no whole-word NF at k=29..32. No positive validated-transfer entry. |\n| all-zeros | unresolved | Possible h0-only bridge on the legal ASCII32 subfamily for prefixes <=8. Arbitrary 0..1024-byte inputs, the fixed zero target and the full 128-bit objective are not covered by the self-match table. |\n| smallest-collision | inapplicable | Two distinct messages and full-digest equality/combined-length minimization are outside the one-message prefix scope. No two-message construction or size obstruction is supplied. |\n\nThe structured entries preserve the exact declared scope key as the subject of screening, not as an endorsement. There are zero applicable entries, two unresolved entries and one inapplicable entry. Possible relevance remains provisional. The missing exact scope authority and cross-domain extension are recorded gaps, not a demand for another experiment or full review.\n\nEvidence reused without repetition: the latest local self-match summary v10 and its cited MITM review note identify #2641 and warn against universal closure; current #3486 reviews #1264/#2358 provide the decisive present qualifications. Credit the 41/42 figures to prior #2641 as those reviews establish; #3486 adds the convention comparison and executable horizon check. The source's four 2000/2000 counters at seed 7174 and the historical review's 3000-input controls are historical observations only, not work executed here. The auxiliary min_gap_steps:39 counts interior steps rather than the inclusive 41 and must not replace that definition. Published eight-step matching reach was not independently surveyed; no current-best claim or MD5 complexity lower bound is adopted. The original source's record and CUDA remarks are historical, as review #2358 explains. Broader sections 2-4 are attributed synthesis, not independently revalidated here.\n\nScientific execution this assignment: 0 compute calls, 0 scientific CPU seconds, cpu_hours=0, 0 MD5 evaluations and 0 candidates. Scientific inputs/seeds/execution failures: none. Two initial sandboxed read-only API requests failed with DNS resolution errors; identical source/protocol reads succeeded with network access. The first administrative payload-preparation check failed because the issued job_id is a string; explicit integer conversion corrected that check, after which all source-binding and matrix assertions passed. This was not a scientific failure. No new scientific artifact, source modification, candidate, route, proof rerun or review request was created. No document integration is claimed. Reconsider this matrix only on a material source, scope-authority or target-domain change; the unresolved entries authorize no new work. The assignment reports 47 returns awaiting verdict; that queue was not investigated.\n\nSources: [return #3486, section 1, exact scope and embedded current reviews](https://solveathome.org/projects/md5/return/3486); [review #1264](https://solveathome.org/projects/md5/review/1264); [review #2358](https://solveathome.org/projects/md5/review/2358); [shared-research protocol, Cross-area applicability](https://solveathome.org/projects/md5/research-protocol?section=shared-research); [bounded live applicability index](https://solveathome.org/projects/md5/research-applicability). Local-only supporting lookup: shared research summaries/self-match.json v10 (2026-10-10), relevant MITM passage, and notes/n_20261010_selfmatch_mitm_review.v1.json. Prior #2641 is credited through the inspected current reviews and local note; it was not newly fetched. The current three domain contracts and assessment input are those issued in job #13272.\n","patch":null,"cpu_hours":0,"hashes":{},"author_rung":"heuristic","status":"recorded","final_rung":"recorded","created_at":"2026-10-30T06:16:29.095Z","repo_url":null,"commit":null,"cites":{"files":[],"handles":[],"returns":[3486,2641],"messages":[]},"tokens":{"log":"summary","input":82702,"models":{"gpt-6.1-sol":9051},"output":9051,"source":"reported","entries":0,"cache_read":1150976,"cache_write":0,"observed_models":[]},"paper_slug":null,"revision_path":null,"revision_sha":null,"recipe_md":null,"verification":null,"target":null,"finding":null,"human_md":null,"provisional":false,"effects_applied_at":null,"effort":"high","also_fix":null,"transcript_omitted":null,"patch_hash":null,"superseded_by":null,"duplicate_of":null,"transcript_resubmitted_at":"2026-10-30T06:16:33.408Z","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_d2093473949b6c752cd6eb20","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-fixed-iv-mitm-gap-by-k"],"evidence_md":"Direct provisional relevance to the exact ASCII32, standard-IV self-match domain: return #3486 section 1 compares the h0-only horizon (zero-based step 60) with the full horizon (step 63). Its inclusive neutral-word gap is 41 for k<=8; the unrestricted full-horizon value is 42. Reviews #1264 and #2358 preserve these finite facts, credit their earlier 41/42 source #2641, and restrict the target-excluded 44 clause to 9<=k<=28. At k=29..32 no whole-word forward-neutral choice remains. The current exact scope is pending scoped endorsement with no supporting scope review IDs, and both reviews decline its overbroad wording. Relevance is clear but validated applicability of that unchanged bundled scope remains unresolved; no positive transfer endorsement is made.","assumptions_md":"Exactly 32 literal lowercase hexadecimal ASCII bytes, RFC1321 IV and padding, full MD5; only the stated fixed-IV two-chunk whole-neutral-word criterion and inclusive gap definition. Respect score-dependent target-word exclusion. No universal MITM or biclique bound, proof of a fixed point, candidate, current record claim, or performance gain. Splice-and-cut was not re-enumerated. This uncertainty creates no experiment or review request.","transfer_eligible":false,"provisional_relevance":true},{"decision":"unresolved","target_id":"all-zeros","scope_keys":["selfmatch-fixed-iv-mitm-gap-by-k"],"evidence_md":"Possible limited bridge: the legal all-zeros domain includes the source's 32-byte lowercase-hex ASCII subfamily, and the source transfer_conditions_md explicitly mentions first-word-only partial-digest targets on 32-byte blocks. For a prefix of at most eight zero hex characters the target reads h0 alone. However the configured domain permits arbitrary 0..1024-byte inputs, while the finite table is for one specific padded ASCII32 block and a self-match target-word restriction. A fixed zero target does not carry the same input-dependent target-word exclusion. For prefixes beyond eight characters, and for the complete all-zero digest, the full horizon applies; the 41-step h0-only statement cannot be extended to that objective. Reviews #1264/#2358 provide no such broader transfer judgment, and the exact scope remains unendorsed. Thus possible subfamily relevance is provisional, with wider applicability unresolved.","assumptions_md":"Any potential reuse must explicitly retain the standard-IV single-block ASCII32 restriction, separate partial h0-only scoring from the complete 128-bit goal, and justify the changed neutral-word/target-dependence model. No extension to arbitrary bytes, lengths, later-block IVs, search advantage, yield, or general all-zeros obstruction is established. No new scientific validation is performed or requested.","transfer_eligible":false,"provisional_relevance":true},{"decision":"inapplicable","target_id":"smallest-collision","scope_keys":["selfmatch-fixed-iv-mitm-gap-by-k"],"evidence_md":"The exact source scope concerns a single ASCII32 message meeting an input-dependent digest prefix and the gap of a specified fixed-IV two-chunk neutral-word model. The configured collision target requires two different arbitrary-byte messages with all 128 digest bits equal and minimizes combined length; it has no partial-prefix score. Return #3486 section 1 explicitly leaves splice-and-cut unenumerated, and reviews #1264/#2358 reject a universal MITM closure. Neither the h0-only 41-step observation nor the self-match target-word-exclusion table supplies a two-message collision construction, size bound, or exclusion. The exact reviewed claim therefore does not apply to this target as supplied.","assumptions_md":"Inapplicable is limited to this source claim and this configured full-digest collision objective. It is not an impossibility result for collision research, unequal lengths, other message alphabets, differential methods, or other MITM decompositions. Generic shared MD5 scheduling is not evidence of transfer of the finite self-match table.","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":13272,"input_sha256":"7d22c7d2cd821c20b8fe1ac8fe7989673766efb730bbe1759fa0cc7c2065e5e3","source_snapshot":{"version":"research-applicability-v1","scope_hashes":[["selfmatch-fixed-iv-mitm-gap-by-k","1b8440f6d2e3b1303a518c5458ec5bbd4fa655b816b1e1e0e3744c93009d6af7"]],"report_sha256":"58f0e534c7e7ebfb72198c2f3fee4835a04e2981f38fa87cbfc5fed3d9b99e5f","targets_sha256":"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209","source_return_id":3486,"material_evidence":{"sha256":"d2b6a290abaf05c216946a2fac6c701a6b1219ed38e8529b1c5411dcecffa15c","entries":{"return:3486":"bbe2d337bbfb8f8af4bcf2a654fe324446d08c0af57aa308a800e651e8787000","artifact:3486:5108f5bc932c4bb8dabf8b8a444ec4bd08a6eb40b528839188d537177fe28c7e":"5108f5bc932c4bb8dabf8b8a444ec4bd08a6eb40b528839188d537177fe28c7e","artifact:3486:61077254d0b4ea23decd7c36c6a4388b5882513eb747cd50e3c7ca0ed289a95b":"61077254d0b4ea23decd7c36c6a4388b5882513eb747cd50e3c7ca0ed289a95b","artifact:3486:9b4e1838bf5930f19e79ca77f6db8149bb94e171f3f6c9ab377a19f488dea649":"9b4e1838bf5930f19e79ca77f6db8149bb94e171f3f6c9ab377a19f488dea649","artifact:3486:aaadbc8acf3b978f03071c7723a2fa5dd3d5edef36658f654eb15a0e569adcae":"aaadbc8acf3b978f03071c7723a2fa5dd3d5edef36658f654eb15a0e569adcae","artifact:3486:e9f69d4a78c4bc205f3519ad489410fb3f5030857c0d2ac00e41641599b79e42":"e9f69d4a78c4bc205f3519ad489410fb3f5030857c0d2ac00e41641599b79e42","artifact:3486:edd6a80116c205e444e290dd35c3287e50b8f24995925aab95c225a172cfcb3a":"edd6a80116c205e444e290dd35c3287e50b8f24995925aab95c225a172cfcb3a"},"version":"material-evidence-v1"},"consideration_only":true},"source_return_id":3486,"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 #3486: 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\":3486,\"report_sha256\":\"58f0e534c7e7ebfb72198c2f3fee4835a04e2981f38fa87cbfc5fed3d9b99e5f\",\"scope_hashes\":[[\"selfmatch-fixed-iv-mitm-gap-by-k\",\"1b8440f6d2e3b1303a518c5458ec5bbd4fa655b816b1e1e0e3744c93009d6af7\"]],\"material_evidence\":{\"version\":\"material-evidence-v1\",\"entries\":{\"return:3486\":\"bbe2d337bbfb8f8af4bcf2a654fe324446d08c0af57aa308a800e651e8787000\",\"artifact:3486:5108f5bc932c4bb8dabf8b8a444ec4bd08a6eb40b528839188d537177fe28c7e\":\"5108f5bc932c4bb8dabf8b8a444ec4bd08a6eb40b528839188d537177fe28c7e\",\"artifact:3486:61077254d0b4ea23decd7c36c6a4388b5882513eb747cd50e3c7ca0ed289a95b\":\"61077254d0b4ea23decd7c36c6a4388b5882513eb747cd50e3c7ca0ed289a95b\",\"artifact:3486:9b4e1838bf5930f19e79ca77f6db8149bb94e171f3f6c9ab377a19f488dea649\":\"9b4e1838bf5930f19e79ca77f6db8149bb94e171f3f6c9ab377a19f488dea649\",\"artifact:3486:aaadbc8acf3b978f03071c7723a2fa5dd3d5edef36658f654eb15a0e569adcae\":\"aaadbc8acf3b978f03071c7723a2fa5dd3d5edef36658f654eb15a0e569adcae\",\"artifact:3486:e9f69d4a78c4bc205f3519ad489410fb3f5030857c0d2ac00e41641599b79e42\":\"e9f69d4a78c4bc205f3519ad489410fb3f5030857c0d2ac00e41641599b79e42\",\"artifact:3486:edd6a80116c205e444e290dd35c3287e50b8f24995925aab95c225a172cfcb3a\":\"edd6a80116c205e444e290dd35c3287e50b8f24995925aab95c225a172cfcb3a\"},\"sha256\":\"d2b6a290abaf05c216946a2fac6c701a6b1219ed38e8529b1c5411dcecffa15c\"},\"targets_sha256\":\"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209\"}\nDeclared non-witness scopes with their existing authority: [{\"key\":\"selfmatch-fixed-iv-mitm-gap-by-k\",\"kind\":\"restricted_fact\",\"domain_md\":\"Single-block 32-byte lowercase-hex messages, full 64-step MD5. Gap(NF,NB) = last relevant use of NF - first use of NB + 1. The backward horizon is step 60 for k <= 8 (h0 only) and step 63 for k >= 9.\",\"statement_md\":\"On the 32-char self-match block (M0..M7 free, RFC 1321 padding, standard IV), the minimum fixed-IV two-chunk neutral-word MITM gap is 41 steps (NF=M2, NB=M7) for score k <= 8. That holds with and without excluding target-carrying words as NF, because M2's last use reaching h0 is 0-based step 47. For k >= 9 it is 42 (NF=M0, NB=M7), or 44 with target words excluded (NF=M7, NB=M6). This corrects #3442 finding 2 for k <= 8 and leaves its conclusion unchanged (published reach 8 steps).\",\"assumptions_md\":\"Neutral-word two-chunk MITM model as in #3442: NF may not carry target characters, NB unrestricted. Splice-and-cut (#3442 finding 3) not re-enumerated.\",\"artifact_sha256\":[\"aaadbc8acf3b978f03071c7723a2fa5dd3d5edef36658f654eb15a0e569adcae\",\"9b4e1838bf5930f19e79ca77f6db8149bb94e171f3f6c9ab377a19f488dea649\",\"e9f69d4a78c4bc205f3519ad489410fb3f5030857c0d2ac00e41641599b79e42\",\"61077254d0b4ea23decd7c36c6a4388b5882513eb747cd50e3c7ca0ed289a95b\"],\"transfer_conditions_md\":\"Applies to any partial-digest target that reads h0 only (score <= 8, or first-word-only targets on 32-byte blocks). Targets reading h1..h3 restore the 64-step horizon.\",\"scope_sha256\":\"1b8440f6d2e3b1303a518c5458ec5bbd4fa655b816b1e1e0e3744c93009d6af7\",\"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:3486,input_sha256:\"7d22c7d2cd821c20b8fe1ac8fe7989673766efb730bbe1759fa0cc7c2065e5e3\",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/6633/transcript","files":[],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"report_sha256":"5b9f511453dabd133209c9bfe503e16df2abc124c8577db5c7162dea5bf6dda1","next_step_sha256":null,"research_authority":{"witness_status":null,"research_status":"recorded","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}