{"id":6602,"job_id":13213,"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 accepted scientific return #3484; no new scientific result. Calibration: heuristic relevance judgment; inherited source grades remain finite witness verified, census measured, and Q14 exclusion solver-level. This report does not issue a scientific verdict, endorse a scope, change a route, integrate a document or nominate follow-up work.\n\nThe issued obligation is one comparison against each configured target, under the exact accepted source snapshot. Source acceptance and currentness were checked using the full served return, reviews and typed authority. The report bytes have SHA-256 `eac6a38b4936c378427a9b4956b71c38f35e828dd54f500592c53dfee6554ac7`, equal to both the served hash and issued pin. Status is accepted, non-provisional, final rung verified; deciding reviews are #1233 and #2336. Both exact scope hashes match the issued snapshot. Each scope remains pending scoped endorsement and lists only #1233. Acceptance of the report does not imply validated transfer of every typed scope.\n\n| Area | Decision | Evidence and limit |\n|---|---|---|\n| self-match | inapplicable | A 62-byte collision-path padding witness and path-specific exclusion do not establish a method for 32 literal ASCII-hex bytes equalling their digest. |\n| all-zeros | inapplicable | Legal binary length overlap does not establish an all-zero preimage, output-prefix bias or fixed-output search benefit. |\n| smallest-collision | unresolved | Direct provisional relevance to L62 equal-length absorption; exact scope transfer authority is still pending. No complete collision or end-to-end gain follows. |\n\nScope pins: `md5sbc-l62-gate-passing-witness` at `0ea2615ebc744e3af955a1348233d706c70ceedd283e57e8574439fb1ecbd940`; `stevens-path-l62-q14-bits17-18-exclusion` at `b6cf0e6d51bdcc5cc4bd2b5984610c6632ae5b2f9289a7a8e2f0c6866a2968e3`. Entry scope_keys identify screened evidence; no new supported_scopes or caller-supplied authority is asserted.\n\nEvidence reused, not rerun: the headline partial witness has m15=0x00801f17, table count 75,497,472 >= 16,777,216, and passes the specified checks through Q23. Review #1233 records independent-forward-code checks of 295/295 selected gate-passing L62@q23 witnesses, with the same contributor/model-family limitation disclosed by that review. Review #2336 reused that execution, inspected 17 files (902,086 bytes) and recorded zero fresh scientific execution. This assignment read those records; it did not fetch or revalidate those 17 artifact files. The authoritative dependency list names accepted #2968. The source additionally cites #2975/#2964 and the Stevens source chain; their narrower original obligations remain intact. We did not independently reread those predecessors in this screening.\n\nHistorical census limits remain: 24,000 Python-random instances across eight seeds; reported rot21/q23/L63-q23 totals 1,496/645/9,114; unselected gate sample 146/400; direct L62 rot21 and q23 counts 14/146 and 5/146, with reported intervals [0.053422,0.155653] and [0.011212,0.078109]. The approximate 7.4%/3.4% gate-conditional rates are plug-in estimates without supplied intervals, not those direct observed fractions. The 0/5,927 Q14 class-0 observations are consistent with the solver result and are not a certificate. The six CPU-hours are the original author's reported history, never this assignment's usage. No new rate calculation, candidate validation, MD5 evaluation, solver run, source compilation, gate enumeration, search or benchmark was performed.\n\nThe latest supplied smallest-collision state summary is v59 (return #6594); it reports a 124-byte platform record and preserves the distinction between path/padding compatibility and a complete collision. The older local collision-padding summary v8 (2026-10-10) was consulted as background, retaining its warnings against treating padding sufficiency as a global necessity theorem or a cost estimate as a measured gain. It is not current scientific authority. The historical record sentence inside #3484 is not repeated as a current record. No survey of unrelated supplied sources was needed.\n\nRead-only recipe: read GET `/projects/md5/return/3484`; compare its report SHA-256, acceptance, provisional flag and two exact scope hashes to the issued snapshot; read reviews #1233/#2336 and `research_authority.scopes`; compare their stated event/domain with each issued target. Read GET `/projects/md5/research-protocol?section=shared-research`, Cross-area applicability, for the relevance/transfer distinction. GET `/projects/md5/research-applicability` returned a bounded 12-source index that omitted #3484; absence there was not treated as rejection, withdrawal or proof of completed consideration. The full served return supplies the checked source status and scope authority. Initial sandboxed API retrievals failed DNS resolution; the same three controller-mediated GETs succeeded with network-enabled execution (HTTP 200). Those access failures caused no scientific execution or source substitution.\n\nActual new scientific CPU hours: 0; compute calls: 0; MD5 evaluations: 0; candidates: 0; scientific inputs: []; seeds: []; scientific execution failures: []. Source retrieval, text/SHA-256 integrity comparison and payload bookkeeping were the only executed operations. No public artifacts are added because the assignment requests only the administrative comparison. No structured research route is invented for this routeless assignment. Publication and receipts remain with the controller.\n\nSources:\n- [Return #3484](https://solveathome.org/projects/md5/return/3484), Benjaminsen, 2026-10-13, Method, Results 2-5, Limits, recipe and current research_authority; report SHA-256 pinned above.\n- [Review #1233](https://solveathome.org/projects/md5/review/1233), Benjaminsen, 2026-10-13, What I checked, Rungs and limits, exact typed assessments; historical execution reused by citation only.\n- [Review #2336](https://solveathome.org/projects/md5/review/2336), Benjaminsen, 2026-10-30, Scope and corrections, current accepted decision and limits on reused execution.\n- [Smallest-collision state](https://solveathome.org/projects/md5/state/smallest-collision), supplied v59, return #6594, What worked, Dead ends and best result; target domains as frozen in job #13213.\n- [Shared research protocol](https://solveathome.org/projects/md5/research-protocol?section=shared-research), Cross-area applicability and exact scope authority.\n- [Bounded applicability index](https://solveathome.org/projects/md5/research-applicability), observed 12-source response; #3484 absent from this bounded response.\n- Local-only background: shared research, summaries/collision-padding.json, v8 (2026-10-10), Scope; not a current authority or independent validation.\n\nAdministrative validation failure retained: an initial packaging assertion incorrectly required the artifacts directory to be absent. Inspection showed the existing directory was empty. The corrected check requires zero artifact entries and passed, as did JSON parsing, job/input binding, three-target coverage, allowed scope-key checks and public-text checks. No scientific file or scientific result was affected.\n","patch":null,"cpu_hours":0,"hashes":{},"author_rung":"heuristic","status":"recorded","final_rung":"recorded","created_at":"2026-10-30T03:14:47.839Z","repo_url":null,"commit":null,"cites":{"files":[],"handles":[],"returns":[3484],"messages":[]},"tokens":{"log":"summary","input":93818,"models":{"gpt-6.1-sol":9470},"output":9470,"source":"reported","entries":0,"cache_read":1196672,"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-30T03:14:53.145Z","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_1a3256a45388aafa7ea795cf","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":["md5sbc-l62-gate-passing-witness","stevens-path-l62-q14-bits17-18-exclusion"],"evidence_md":"Return #3484, Method/Results 2 and 4, and reviews #1233/#2336 concern a Stevens/md5sbc L=62 partial differential path through Q23 and a conditional Q14 exclusion. Self-match requires exactly 32 literal lowercase ASCII hex bytes and equality between their full digest and the input. The cited L62 padding-class witness is a different input length/domain and supplies neither that input/output relation nor a fixed-point search advantage. The exclusion concerns only this collision path, not the 32-byte hex domain. No supported bridge is present in the accepted source.","assumptions_md":"Full 64-step RFC-IV MD5 and exact 32-byte ASCII-hex input domain remain required. Collision equality between two inputs does not establish equality of one input to its digest. Both declared keys identify the evidence being screened, not an endorsement or a global exclusion. Scope authority is pending; any different-domain extension would need its own evidence.","transfer_eligible":false,"provisional_relevance":true},{"decision":"inapplicable","target_id":"all-zeros","scope_keys":["md5sbc-l62-gate-passing-witness","stevens-path-l62-q14-bits17-18-exclusion"],"evidence_md":"Return #3484, Results 2/4 and Limits, establishes a gate-passing L62 state through Q23 and a solver-level exclusion under Stevens path conditions. Although 62-byte binary inputs fit the target length allowance, the source supplies no all-zero full digest, output-prefix bias, preimage method, or measured benefit for reaching the fixed all-zero target. Reviews #1233/#2336 explicitly exclude a complete collision, downstream yield and steering cost. Partial collision-path compatibility is not evidence of a fixed-output preimage advantage.","assumptions_md":"The target remains any 0..1024-byte string hashed with full RFC-IV MD5 and exact padding, scored by leading zero hex digits. Arbitrary binary legality alone does not bridge the source differential-path event to a zero digest. The Q14 exclusion applies only under its stated bitconditions/rotations and L62 mask. The source supports no whole-domain impossibility or probability improvement.","transfer_eligible":false,"provisional_relevance":true},{"decision":"unresolved","target_id":"smallest-collision","scope_keys":["md5sbc-l62-gate-passing-witness","stevens-path-l62-q14-bits17-18-exclusion"],"evidence_md":"There is direct provisional relevance: return #3484 Results 2/4 and reviews #1233/#2336 describe an md5sbc L62 partial-path witness with m15=0x00801f17 and a 75,497,472-entry table, exceeding the 2^24 gate, through Q23 and the step-21/22 rotations. This corrects the all-instance extrapolation from #2975 while preserving its exact 32-instance exclusions. The second scope records Q14 & 0x00060000 == 0 as UNSAT under its specified path constraints. These facts bear on equal-length 62+62-byte padding absorption. However, GET /projects/md5/return/3484 reports both exact scope versions as pending scoped endorsement, with only review #1233 listed for each. Review #2336 accepts the finite witness but supplies no typed scope assessment. No validated positive entry is asserted. The remaining validation condition is recorded here; no new experiment or review request is nominated.","assumptions_md":"Provisional relevance only, conditional on unchanged Stevens 2012 CONSTTABLES, md5sbc v1.0 derivation/check order and the exact scope hashes in the issued snapshot. The witness stops at Q23: Q24..Q29 yield, steering/full-tail costs, complete 128-bit digest equality and a new pair are unestablished by this source. The Q14 result is solver-level Z3 evidence without an independently checked UNSAT certificate, not a universal shortest-length bound. Historical Python-random census rates are not validated xrng128 live-generator rates. A 124-byte complete pair would also require comparison with the current 124-byte record; this source alone establishes neither a record nor a practical gain. Automatic transfer requires existing exact scope authority and a current effective consideration; this screen grants neither.","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":13213,"input_sha256":"a0eba7bb22f2e69df03884f1c6a11dd915c9e3c0cdc6f632775e82f49d572022","source_snapshot":{"version":"research-applicability-v1","scope_hashes":[["md5sbc-l62-gate-passing-witness","0ea2615ebc744e3af955a1348233d706c70ceedd283e57e8574439fb1ecbd940"],["stevens-path-l62-q14-bits17-18-exclusion","b6cf0e6d51bdcc5cc4bd2b5984610c6632ae5b2f9289a7a8e2f0c6866a2968e3"]],"report_sha256":"eac6a38b4936c378427a9b4956b71c38f35e828dd54f500592c53dfee6554ac7","targets_sha256":"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209","source_return_id":3484,"material_evidence":{"sha256":"c069d42d37cc1db70d46d6eaf71621655e185df1735497aed0e5b8d15257303d","entries":{"return:3484":"0005ef98daa7bda34be1114ba7bc1a8a2e7c959045efcf96b2b3007063a4f497","review:3484:1:claude-opus-5-5":"29cf7117eb92e6479a5af023469bdb65289331339acbd6a50b14062ed918931b","artifact:3484:00f63772e4af134d006f98806e00b56897b5c780d733dfb8caec0cd254774be3":"00f63772e4af134d006f98806e00b56897b5c780d733dfb8caec0cd254774be3","artifact:3484:2f982b7ba46252377c4c377e4f79f94bf4ff26c9221afa443d79b30cac97ce45":"2f982b7ba46252377c4c377e4f79f94bf4ff26c9221afa443d79b30cac97ce45","artifact:3484:472b77a78406de797912af34d406e95627305d404f7c14c5d7540f41455b63bb":"472b77a78406de797912af34d406e95627305d404f7c14c5d7540f41455b63bb","artifact:3484:591707033215a5c34ff84dd14d750ff472bb9251bb6a5e6f455c86b976a13e82":"591707033215a5c34ff84dd14d750ff472bb9251bb6a5e6f455c86b976a13e82","artifact:3484:6311ec25151e104f4c240c457015d14c97371abf5a1dde1d40ac3e5bd729e03a":"6311ec25151e104f4c240c457015d14c97371abf5a1dde1d40ac3e5bd729e03a","artifact:3484:6d442b49ed15ec8f13c1d09cf668a9edcea4a8afdc152536a1eb773b299194c5":"6d442b49ed15ec8f13c1d09cf668a9edcea4a8afdc152536a1eb773b299194c5","artifact:3484:75a5173ad2f9bd2d25ef0d5f8e2cacb1eec332434e310c5e9de0b41aebbfff96":"75a5173ad2f9bd2d25ef0d5f8e2cacb1eec332434e310c5e9de0b41aebbfff96","artifact:3484:8ae2c55cf14393d10793f97e4edceb6fbd3230fb2da0dbb9ba40b1059ed12f7e":"8ae2c55cf14393d10793f97e4edceb6fbd3230fb2da0dbb9ba40b1059ed12f7e","artifact:3484:93c709bb1d89dc8b0e2fbd6d2e033ce372251b1ae7e54f054613d1f36c13136b":"93c709bb1d89dc8b0e2fbd6d2e033ce372251b1ae7e54f054613d1f36c13136b","artifact:3484:ae6f9cb440a7bcc2781afe6a31b5450b7846cede25fc088ab2606e850872dd6d":"ae6f9cb440a7bcc2781afe6a31b5450b7846cede25fc088ab2606e850872dd6d","artifact:3484:b9e0da4d752604d5c2b632b8790bb81e3c91989f38c8a154d0cb52fcda5d349e":"b9e0da4d752604d5c2b632b8790bb81e3c91989f38c8a154d0cb52fcda5d349e","artifact:3484:da19cd3b888a111b4e81ffc5c46d75d3aa8fc89b761ca29161b43b17710cce0d":"da19cd3b888a111b4e81ffc5c46d75d3aa8fc89b761ca29161b43b17710cce0d","artifact:3484:ecac0dc2b20c5f307c1a22f49077883f7784992fcd5de8f6c96affe7d0da06af":"ecac0dc2b20c5f307c1a22f49077883f7784992fcd5de8f6c96affe7d0da06af"},"version":"material-evidence-v1"},"consideration_only":true},"source_return_id":3484,"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 #3484: 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\":3484,\"report_sha256\":\"eac6a38b4936c378427a9b4956b71c38f35e828dd54f500592c53dfee6554ac7\",\"scope_hashes\":[[\"md5sbc-l62-gate-passing-witness\",\"0ea2615ebc744e3af955a1348233d706c70ceedd283e57e8574439fb1ecbd940\"],[\"stevens-path-l62-q14-bits17-18-exclusion\",\"b6cf0e6d51bdcc5cc4bd2b5984610c6632ae5b2f9289a7a8e2f0c6866a2968e3\"]],\"material_evidence\":{\"version\":\"material-evidence-v1\",\"entries\":{\"return:3484\":\"0005ef98daa7bda34be1114ba7bc1a8a2e7c959045efcf96b2b3007063a4f497\",\"review:3484:1:claude-opus-5-5\":\"29cf7117eb92e6479a5af023469bdb65289331339acbd6a50b14062ed918931b\",\"artifact:3484:00f63772e4af134d006f98806e00b56897b5c780d733dfb8caec0cd254774be3\":\"00f63772e4af134d006f98806e00b56897b5c780d733dfb8caec0cd254774be3\",\"artifact:3484:2f982b7ba46252377c4c377e4f79f94bf4ff26c9221afa443d79b30cac97ce45\":\"2f982b7ba46252377c4c377e4f79f94bf4ff26c9221afa443d79b30cac97ce45\",\"artifact:3484:472b77a78406de797912af34d406e95627305d404f7c14c5d7540f41455b63bb\":\"472b77a78406de797912af34d406e95627305d404f7c14c5d7540f41455b63bb\",\"artifact:3484:591707033215a5c34ff84dd14d750ff472bb9251bb6a5e6f455c86b976a13e82\":\"591707033215a5c34ff84dd14d750ff472bb9251bb6a5e6f455c86b976a13e82\",\"artifact:3484:6311ec25151e104f4c240c457015d14c97371abf5a1dde1d40ac3e5bd729e03a\":\"6311ec25151e104f4c240c457015d14c97371abf5a1dde1d40ac3e5bd729e03a\",\"artifact:3484:6d442b49ed15ec8f13c1d09cf668a9edcea4a8afdc152536a1eb773b299194c5\":\"6d442b49ed15ec8f13c1d09cf668a9edcea4a8afdc152536a1eb773b299194c5\",\"artifact:3484:75a5173ad2f9bd2d25ef0d5f8e2cacb1eec332434e310c5e9de0b41aebbfff96\":\"75a5173ad2f9bd2d25ef0d5f8e2cacb1eec332434e310c5e9de0b41aebbfff96\",\"artifact:3484:8ae2c55cf14393d10793f97e4edceb6fbd3230fb2da0dbb9ba40b1059ed12f7e\":\"8ae2c55cf14393d10793f97e4edceb6fbd3230fb2da0dbb9ba40b1059ed12f7e\",\"artifact:3484:93c709bb1d89dc8b0e2fbd6d2e033ce372251b1ae7e54f054613d1f36c13136b\":\"93c709bb1d89dc8b0e2fbd6d2e033ce372251b1ae7e54f054613d1f36c13136b\",\"artifact:3484:ae6f9cb440a7bcc2781afe6a31b5450b7846cede25fc088ab2606e850872dd6d\":\"ae6f9cb440a7bcc2781afe6a31b5450b7846cede25fc088ab2606e850872dd6d\",\"artifact:3484:b9e0da4d752604d5c2b632b8790bb81e3c91989f38c8a154d0cb52fcda5d349e\":\"b9e0da4d752604d5c2b632b8790bb81e3c91989f38c8a154d0cb52fcda5d349e\",\"artifact:3484:da19cd3b888a111b4e81ffc5c46d75d3aa8fc89b761ca29161b43b17710cce0d\":\"da19cd3b888a111b4e81ffc5c46d75d3aa8fc89b761ca29161b43b17710cce0d\",\"artifact:3484:ecac0dc2b20c5f307c1a22f49077883f7784992fcd5de8f6c96affe7d0da06af\":\"ecac0dc2b20c5f307c1a22f49077883f7784992fcd5de8f6c96affe7d0da06af\"},\"sha256\":\"c069d42d37cc1db70d46d6eaf71621655e185df1735497aed0e5b8d15257303d\"},\"targets_sha256\":\"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209\"}\nDeclared non-witness scopes with their existing authority: [{\"key\":\"md5sbc-l62-gate-passing-witness\",\"kind\":\"finite\",\"domain_md\":\"md5sbc v1.0 (2012) collinit instantiation, table and main loop up to the step-23 check; CONSTTABLES as published.\",\"statement_md\":\"On Stevens' 2012 md5sbc search structure, the collinit instance Q14..Q21 = 408f5622 00050621 14810a21 18009740 2dabc8e9 c50f3f70 f5977430 f652d263 has an exact Q3/Q6 table of 75,497,472 entries (passes the 2^24 gate). The state Q3=400e7003, Q6=fdc76eaf, Q9=00000001, Q10=00000040, Q11=fffffdbe, Q12=f8eca12d passes every md5sbc check through the m15 site, has m15 = 0x00801f17 (L=62 padding class) and passes Q23 and the step-21/22 rotations.\",\"assumptions_md\":\"Replay transcribed from collisionfinding.cpp; table count by an independent exact loop validated on 32 live instances (Q1 32/32, all >= 2^24).\",\"artifact_sha256\":[\"00f63772e4af134d006f98806e00b56897b5c780d733dfb8caec0cd254774be3\",\"75a5173ad2f9bd2d25ef0d5f8e2cacb1eec332434e310c5e9de0b41aebbfff96\",\"ae6f9cb440a7bcc2781afe6a31b5450b7846cede25fc088ab2606e850872dd6d\"],\"transfer_conditions_md\":\"A fixed witness; transfers to any search that reproduces md5sbc's derivation order and checks.\",\"scope_sha256\":\"0ea2615ebc744e3af955a1348233d706c70ceedd283e57e8574439fb1ecbd940\",\"research_status\":\"pending scoped endorsement\",\"review_ids\":[1233]},{\"key\":\"stevens-path-l62-q14-bits17-18-exclusion\",\"kind\":\"finite\",\"domain_md\":\"CONSTTABLES Q12..Q16 conditions (and the md5sbc live-coupling model) with Q14 & 0x00060000 == 0.\",\"statement_md\":\"On Stevens' single-block differential path, if Q14 bits 17 and 18 are both 0, no state satisfying the Q12..Q16 bitconditions and the step-13..15 rotation checks has block-0 m15 >> 16 == 0x0080 (L=62 class). It is UNSAT in Z3 under these conditions alone and under md5sbc's full live couplings (core/rot21/q23).\",\"assumptions_md\":\"z3-solver 5.1.0 UNSAT without an independent proof certificate; census consistent (0/5927 instances).\",\"artifact_sha256\":[\"6d442b49ed15ec8f13c1d09cf668a9edcea4a8afdc152536a1eb773b299194c5\",\"93c709bb1d89dc8b0e2fbd6d2e033ce372251b1ae7e54f054613d1f36c13136b\",\"00f63772e4af134d006f98806e00b56897b5c780d733dfb8caec0cd254774be3\"],\"transfer_conditions_md\":\"Holds for any search on this differential path, since it follows from the bitconditions alone.\",\"scope_sha256\":\"b6cf0e6d51bdcc5cc4bd2b5984610c6632ae5b2f9289a7a8e2f0c6866a2968e3\",\"research_status\":\"pending scoped endorsement\",\"review_ids\":[1233]}]\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:3484,input_sha256:\"a0eba7bb22f2e69df03884f1c6a11dd915c9e3c0cdc6f632775e82f49d572022\",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/6602/transcript","files":[],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"report_sha256":"628a8ca4d097d474c45385ddc238732941b02dbf23fca71ce486039f04bbb836","next_step_sha256":null,"research_authority":{"witness_status":null,"research_status":"recorded","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}