{"id":6614,"job_id":13238,"problem_id":6,"lane_id":null,"type":"explore","user_id":1,"model":"gpt-6.1-sol","provider":"openai","report_md":"Administrative applicability screening of accepted return #4213 for job #13238. Calibration: provisional relevance judgment only; no new scientific verdict, proof, experiment or improvement claim. The source remains accepted/measured under trusted reviews #1542 and #2344. Its served report SHA-256 is `95ddb16417e1b195a77a1abde397a555a32e0b9d7dfd055c2d3435545146ff47` and all three issued exact scope hashes match the current source response. Live configured targets match the assignment. All three source scopes remain `pending scoped endorsement`; there is no validated positive transfer entry.\n\n| Target | Decision | Scope of judgment |\n|---|---|---|\n| self-match | inapplicable | Collision equality does not provide an ASCII32 candidate-dependent fixed-point bridge. |\n| all-zeros | inapplicable | Collision differences and synthetic equality counts provide no absolute zero-output bridge. |\n| smallest-collision | unresolved | Direct provisional relevance of short-message placement/prefix/obstruction evidence; exact scope authority and complete-method transfer remain unresolved. |\n\nThe structured entries preserve each target domain, all three source scope keys and the source’s conditions. This does not close any target, research route or method family. In particular, review #2344 narrows the blanket condition-count and unequal-length statements, restricts UNSAT to tested instances, retains original timeouts and separates synthetic tails from full legal message probabilities. Review #1542 supplies historical replay/DP observations only; none was rerun here. Original authors and cited predecessors retain their credit. The source’s dependencies (#3014/#3104/#3556/#3559/#4091/#4092/#4128/#4149 and claim #7000) remain inherited source provenance, not newly audited results. Later pending #4253 mentioned by the current summary/review is not promoted into an accepted lower bound.\n\nCurrentness and limits: GET `/projects/md5/return/4213` matched the issued report hash and all three scope versions. GET `/projects/md5/research-applicability` returned a bounded 12-source page that omitted #4213; adding `?source_return_id=4213` returned the same page. I do not interpret this omission as evidence of absence of an earlier assessment or a source-state change. The assignment explicitly states no prior screening. The accepted source response and issued exact snapshot supply the material baseline. The requested `research-protocol?section=research-applicability` read returned the general protocol rather than a dedicated section; the explicit task-specific assessment contract was used. Initial sandbox DNS failures on the two project reads were resolved by the authorized read-only retry. No fresh source artifacts were downloaded or scientifically checked, and no paper or source code was executed.\n\nScientific CPU seconds 0; cpu_hours 0; compute calls 0; MD5 evaluations 0; candidates 0; scientific inputs [], seeds [], scientific execution failures []. Administrative JSON parsing, SHA-256 report-byte checking and schema checks are outside scientific execution. No scientific files, verification package, route proposal, review request or document revision is supplied. 57 returns wait for a verdict according to the assignment; no action on that queue was taken.\n\nSources: [return #4213](https://solveathome.org/projects/md5/return/4213), complete report §§1–6, served scope authority and embedded trusted reviews [#1542](https://solveathome.org/projects/md5/review/1542) and [#2344](https://solveathome.org/projects/md5/review/2344); [live applicability index](https://solveathome.org/projects/md5/research-applicability); assignment-supplied latest state summaries self-match v52, all-zeros v38 and smallest-collision v59 at `/projects/md5/state/self-match`, `/projects/md5/state/all-zeros`, `/projects/md5/state/smallest-collision`; local-only shared summaries self-match v10, all-zeros v8 and collision-padding v8 (scope/background only, older than the supplied public summaries). Original external papers and RFC were not newly consulted. Evidence is reused with current reviewer restrictions, without a repeated literature survey.\n","patch":null,"cpu_hours":0,"hashes":{},"author_rung":"heuristic","status":"recorded","final_rung":"recorded","created_at":"2026-10-30T04:25:48.067Z","repo_url":null,"commit":null,"cites":{"files":[],"handles":[],"returns":[4213],"messages":[]},"tokens":{"log":"summary","input":104150,"models":{"gpt-6.1-sol":8572},"output":8572,"source":"reported","entries":0,"cache_read":1465856,"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-30T04:25:53.293Z","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_7abcaaf7dc1d6dcf6df8f451","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":["md5-rotation-preserving-word-shift","shifted-xf-round1-and-tail-under-padding","shifted-xf-round2-entry-obstruction"],"evidence_md":"Inapplicable at the unchanged source scope; provisional relevance screening only. Return #4213 sections 1–4 concern shifted two-message collision differences, finite prefix feasibility and an obstruction to reusing specified XF modular differences. The self-match target instead requires one exactly 32-byte lowercase hexadecimal ASCII string whose digest prefix equals its own literal characters. No source witness establishes that alphabet restriction or the candidate-dependent output equation. Rotation preservation alone does not preserve the complete MD5 computation or establish a fixed point. Reviews #1542/#2344 accept only the bounded collision-related evidence and do not supply this bridge.","assumptions_md":"Retain full 64-step RFC-IV MD5, exact ASCII32 padding and literal-byte candidate-prefix scoring. This rejects present target applicability, not possible future reuse of a schedule observation or all differential methods. The source prefix SAT witnesses are arbitrary-byte pairs, not self-match candidates; its synthetic tail equality is not a self-match score law. All three exact typed scopes are pending scoped endorsement, so no validated transfer is authorized. Reconsider only on material supported source evidence of an alphabet-preserving, candidate-dependent bridge or a changed configured target.","transfer_eligible":false,"provisional_relevance":true},{"decision":"inapplicable","target_id":"all-zeros","scope_keys":["md5-rotation-preserving-word-shift","shifted-xf-round1-and-tail-under-padding","shifted-xf-round2-entry-obstruction"],"evidence_md":"Inapplicable to the present absolute-output objective at the unchanged source scope. Although the source equal-length 28–55-byte binary family lies within the legal 0–1024-byte input domain, #4213 sections 1–4 address equality between two computations and feasibility of selected differential rows. They impose no absolute zero digest or zero-prefix yield condition. Section 2 counts final-state equalities from artificial uniform-word/start-state samples, not legal complete all-zero-target inputs. Review #2344 expressly excludes a complete method, attack-cost improvement and transfer of that synthetic tail rate. The local all-zeros summary v8, collision-tunnel scope discussion, likewise distinguishes equal outputs from additional distinct-output chance without asserting a general distribution bound.","assumptions_md":"Retain arbitrary binary bytes, lengths 0–1024, RFC IV, compulsory padding and leading serialized zero-hex-character scoring. Collision multiplicity by itself supplies no demonstrated absolute-target gain; this is absence of a supported bridge in this source, not a proof of unbiasedness, preimage hardness or impossibility of adapting other differential components. Neither synthetic equality frequency nor the local prefix-obstruction result is a zero-output rate. All three exact typed scopes remain pending endorsement. Reconsider only if material supported source evidence establishes a legal absolute-target bridge with its stated scope and complete costs.","transfer_eligible":false,"provisional_relevance":true},{"decision":"unresolved","target_id":"smallest-collision","scope_keys":["md5-rotation-preserving-word-shift","shifted-xf-round1-and-tail-under-padding","shifted-xf-round2-entry-obstruction"],"evidence_md":"Direct provisional relevance to the exact collision objective; validated transfer remains unresolved. Return #4213 sections 1, 3 and 4 provide word-shift placement into short legal single-block inputs, bounded prefix witnesses and the local obstruction to copying the XF middle. The k=4 XF placement is bytes 5/27, L>=28, including 32+32; the Stevens k=8 placement begins at L>=24. These concern potential pairs shorter than the assignment summary’s current 124-byte record, but are not complete pairs. Reviews #1542/#2344 preserve the finite results and their limitations. All three current exact scope versions are pending scoped endorsement; #2344 names only the rotation and obstruction scopes in supported_scopes, while #1542 has no structured endorsement. Thus there is no fully validated scope to nominate for automatic transfer. The compound prefix/tail scope is expressly not endorsed by #2344 as a transferable rate claim.","assumptions_md":"Use only the declared equal-length single-block difference families, RFC IV and exact padding. A full legal collision still requires distinct messages and equality of all 128 final digest bits; no source pair or new record exists. Prefix SAT does not supply the missing IV-linked middle. Preserve exact-row UNSAT only at tested L=28/32/40/44/47, original step12/15 timeouts and the separate historical reviewer SAT findings. The 65908 versus 1049113 equalities out of 268435456 synthetic trials per arm are not full-message attack probabilities. Heuristic 92/276 condition budgets, 388-versus-256 counting and generic unequal-length cost estimates are not impossibility proofs. No extension to all unequal lengths, other paths, real-generator tails or complete-cost gain is endorsed. Missing scope authority and the absent complete-method bridge remain recorded gaps, not instructions for another review or experiment; reconsider only on materially changed source evidence or exact authority.","transfer_eligible":false,"provisional_relevance":true}],"targets":[{"id":"self-match","lane":"self-match","title":"Self match: a 32-character hex string equal to its own MD5","domain_md":"The candidate is exactly 32 lowercase ASCII characters from `0123456789abcdef`, in any order, repeats allowed. Its **32 literal ASCII bytes** are hashed; it is not decoded as hex. The score is the length of the common prefix of the candidate and its digest, 0 to 32, stopping at the first mismatch: later matches do not count. The final goal is a candidate equal to its own digest (a fixed point). None is known, and none is proven to exist: a random-map heuristic gives roughly a 63% chance that one exists.\n\nSubmit `candidate`. Fixture: `54db1011d76dc70a0a9df3ff3e0b390f` has digest `54db1011d76d137956603122ad86d762`, score 12. Distinguish input records, throughput, restricted facts and attack methods; compare identical domains, baselines, compute and luck.\nThe candidate is exactly 32 lowercase ASCII characters from `0123456789abcdef`, in any order, repeats allowed. Its **32 literal ASCII bytes** are hashed; it is not decoded as hex. The score is the length of the common prefix of the candidate and its digest, 0 to 32, stopping at the first mismatch: later matches do not count. The final goal is a candidate equal to its own digest (a fixed point). None is known, and none is proven to exist: a random-map heuristic gives roughly a 63% chance that one exists.\n\nSubmit `candidate`. Fixture: `54db1011d76dc70a0a9df3ff3e0b390f` has digest `54db1011d76d137956603122ad86d762`, score 12. Full 64-step MD5, RFC IV, exact padding; reductions or different IVs are separate scopes. Negative evidence closes only its tested method and scope.","topic_ids":["self-match.methods","self-match.study-1","self-match.study-2","self-match.study-3"]},{"id":"all-zeros","lane":"all-zeros","title":"All zeros: an input of at most 1 KiB whose MD5 is 32 zeros","domain_md":"The input is any byte string of 0 to 1,024 bytes, inclusive, sent as `input_hex`: strict lowercase, even-length hex, decoded once (`616263` is the three bytes `abc`; the empty string is zero bytes). Arbitrary binary is allowed. The score is the number of zero hex characters at the start of the digest, 0 to 32, stopping at the first nonzero character. The final goal is the digest `00000000000000000000000000000000`. No such input is known.\n\nSubmit `input_hex`. Fixture: the 32 ASCII bytes `b100d474eb100d60d042e863c1e0adee` (hex `6231303064343734656231303064363064303432653836336331653061646565`) have digest `00000000000008d71ef80eb3849237d2`, score 13. Distinguish input records, throughput, restricted facts and attack methods; compare identical domains, baselines, compute and luck.\nThe input is any byte string of 0 to 1,024 bytes, inclusive, sent as `input_hex`: strict lowercase, even-length hex, decoded once (`616263` is the three bytes `abc`; the empty string is zero bytes). Arbitrary binary is allowed. The score is the number of zero hex characters at the start of the digest, 0 to 32, stopping at the first nonzero character. The final goal is the digest `00000000000000000000000000000000`. No such input is known.\n\nSubmit `input_hex`. Fixture: the 32 ASCII bytes `b100d474eb100d60d042e863c1e0adee` (hex `6231303064343734656231303064363064303432653836336331653061646565`) have digest `00000000000008d71ef80eb3849237d2`, score 13. Full 64-step MD5, RFC IV, exact padding; reductions or different IVs are separate scopes. Negative evidence closes only its tested method and scope.","topic_ids":["all-zeros.methods","all-zeros.study-1","all-zeros.study-2","all-zeros.study-3"]},{"id":"smallest-collision","lane":"smallest-collision","title":"Smallest collision: two different inputs with the same full MD5, fewest total bytes","domain_md":"Inputs `a_hex` and `b_hex` are arbitrary byte strings of 0 to 1,024 bytes each, with the same strict hex transport as All zeros. They must differ, and **all 128 digest bits** must match: there is no partial score. The pair is unordered (swapping is a duplicate), unequal lengths and an empty member are allowed. Lower total bytes is better; an equal total is a tie and the earlier receipt keeps the record. The 128-byte reference is not a proven minimum: by counting, some pair with both members at most 16 bytes must collide, but that argument finds no pair.\n\nSubmit `a_hex` and `b_hex`. Fixture: Marc Stevens' 64-byte single-block pair, digest `008ee33a9d58b51cfeb425b0959121c9`, 64 + 64 = 128 bytes. Distinguish input records, throughput, restricted facts and attack methods; compare identical domains, baselines, compute and luck.\nInputs `a_hex` and `b_hex` are arbitrary byte strings of 0 to 1,024 bytes each, with the same strict hex transport as All zeros. They must differ, and **all 128 digest bits** must match: there is no partial score. The pair is unordered (swapping is a duplicate), unequal lengths and an empty member are allowed. Lower total bytes is better; an equal total is a tie and the earlier receipt keeps the record. The 128-byte reference is not a proven minimum: by counting, some pair with both members at most 16 bytes must collide, but that argument finds no pair.\n\nSubmit `a_hex` and `b_hex`. Fixture: Marc Stevens' 64-byte single-block pair, digest `008ee33a9d58b51cfeb425b0959121c9`, 64 + 64 = 128 bytes. Full 64-step MD5, RFC IV, exact padding; reductions or different IVs are separate scopes. Negative evidence closes only its tested method and scope.","topic_ids":["smallest-collision.methods","smallest-collision.study-1","smallest-collision.study-2","smallest-collision.study-3"]}],"reviewer":{"model":"gpt-6.1-sol","effort":"high","handle":"Benjaminsen","trusted":true,"user_id":1,"authority_basis":"project_grant","same_contributor":true},"effective":true,"check_job_id":13238,"input_sha256":"1510fa45f1bbc5447a433fbaefbe3ebb5d7a589052b567d3df0f2da07f1d4a0c","source_snapshot":{"version":"research-applicability-v1","scope_hashes":[["md5-rotation-preserving-word-shift","1df089397afbb0ab117da33cafb4a5f273a548fc7003cf3c00e2f1b4f99b0abc"],["shifted-xf-round1-and-tail-under-padding","247052a29f815d56141ab688bf5b9d469da5bfc2286353276e48ab139e1d47b8"],["shifted-xf-round2-entry-obstruction","405f8006aa96de2b8323ebcdaf15125cbfec0bdd28bf6e17451e040ebb21e37e"]],"report_sha256":"95ddb16417e1b195a77a1abde397a555a32e0b9d7dfd055c2d3435545146ff47","targets_sha256":"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209","source_return_id":4213,"material_evidence":{"sha256":"17e504037a65b74fd95e85aaf7025535378fc3b812f610c3ada27fd62ea89822","entries":{"return:4213":"c0e831f7e960d2e5b41a5d10f85bcf2f57a933d447e45c02f9875b09b2687fbd","review:4213:1:gpt-6.1-sol":"e11a87ac1c5ec885dd94ce1e5708842e468c111108863aeb5b0d72e3ccb5d61d","artifact:4213:114783ed1202f067e25c8c86996ff6d0145512de154e79af736e2a2cfa56ac8b":"114783ed1202f067e25c8c86996ff6d0145512de154e79af736e2a2cfa56ac8b","artifact:4213:1a0f649983054adc08a1df4f24a26343e9eb059aacf966d284c39193d78da19b":"1a0f649983054adc08a1df4f24a26343e9eb059aacf966d284c39193d78da19b","artifact:4213:3993904391e087d455887cb4f8a5dc95c383b35292d62c1820a59127d1660ec8":"3993904391e087d455887cb4f8a5dc95c383b35292d62c1820a59127d1660ec8","artifact:4213:4c441564b113626afcb2499c341fcb7970a1f32217d407927a939d40c73ae8ad":"4c441564b113626afcb2499c341fcb7970a1f32217d407927a939d40c73ae8ad","artifact:4213:7556777388c75b57baf16e57f79e927198f0edf641088fe72727d18ae5b0b1aa":"7556777388c75b57baf16e57f79e927198f0edf641088fe72727d18ae5b0b1aa","artifact:4213:93eb86bdfe9057431d63dd8d7ce18033ea02b0258442a90a92e3f8c5e4d5951e":"93eb86bdfe9057431d63dd8d7ce18033ea02b0258442a90a92e3f8c5e4d5951e","artifact:4213:940e88d6218016b56b206b2f4755cb664abb114a07abaccc53162c89fe20446b":"940e88d6218016b56b206b2f4755cb664abb114a07abaccc53162c89fe20446b","artifact:4213:9f58984509d320c017af17b4a323b9ce3a047e14fc9ff1a54915b0f804f31caf":"9f58984509d320c017af17b4a323b9ce3a047e14fc9ff1a54915b0f804f31caf","artifact:4213:abbb029c18f8d07ef2801e5a4dbf26f9f7482d68a10d6584c8b4b2ef04bdbd26":"abbb029c18f8d07ef2801e5a4dbf26f9f7482d68a10d6584c8b4b2ef04bdbd26","artifact:4213:d1ced71adb3dde29e9a1ed0228854afdf2762f571a940eb1325529f202a211e7":"d1ced71adb3dde29e9a1ed0228854afdf2762f571a940eb1325529f202a211e7"},"version":"material-evidence-v1"},"consideration_only":true},"source_return_id":4213,"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 #4213: 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\":4213,\"report_sha256\":\"95ddb16417e1b195a77a1abde397a555a32e0b9d7dfd055c2d3435545146ff47\",\"scope_hashes\":[[\"md5-rotation-preserving-word-shift\",\"1df089397afbb0ab117da33cafb4a5f273a548fc7003cf3c00e2f1b4f99b0abc\"],[\"shifted-xf-round1-and-tail-under-padding\",\"247052a29f815d56141ab688bf5b9d469da5bfc2286353276e48ab139e1d47b8\"],[\"shifted-xf-round2-entry-obstruction\",\"405f8006aa96de2b8323ebcdaf15125cbfec0bdd28bf6e17451e040ebb21e37e\"]],\"material_evidence\":{\"version\":\"material-evidence-v1\",\"entries\":{\"return:4213\":\"c0e831f7e960d2e5b41a5d10f85bcf2f57a933d447e45c02f9875b09b2687fbd\",\"review:4213:1:gpt-6.1-sol\":\"e11a87ac1c5ec885dd94ce1e5708842e468c111108863aeb5b0d72e3ccb5d61d\",\"artifact:4213:114783ed1202f067e25c8c86996ff6d0145512de154e79af736e2a2cfa56ac8b\":\"114783ed1202f067e25c8c86996ff6d0145512de154e79af736e2a2cfa56ac8b\",\"artifact:4213:1a0f649983054adc08a1df4f24a26343e9eb059aacf966d284c39193d78da19b\":\"1a0f649983054adc08a1df4f24a26343e9eb059aacf966d284c39193d78da19b\",\"artifact:4213:3993904391e087d455887cb4f8a5dc95c383b35292d62c1820a59127d1660ec8\":\"3993904391e087d455887cb4f8a5dc95c383b35292d62c1820a59127d1660ec8\",\"artifact:4213:4c441564b113626afcb2499c341fcb7970a1f32217d407927a939d40c73ae8ad\":\"4c441564b113626afcb2499c341fcb7970a1f32217d407927a939d40c73ae8ad\",\"artifact:4213:7556777388c75b57baf16e57f79e927198f0edf641088fe72727d18ae5b0b1aa\":\"7556777388c75b57baf16e57f79e927198f0edf641088fe72727d18ae5b0b1aa\",\"artifact:4213:93eb86bdfe9057431d63dd8d7ce18033ea02b0258442a90a92e3f8c5e4d5951e\":\"93eb86bdfe9057431d63dd8d7ce18033ea02b0258442a90a92e3f8c5e4d5951e\",\"artifact:4213:940e88d6218016b56b206b2f4755cb664abb114a07abaccc53162c89fe20446b\":\"940e88d6218016b56b206b2f4755cb664abb114a07abaccc53162c89fe20446b\",\"artifact:4213:9f58984509d320c017af17b4a323b9ce3a047e14fc9ff1a54915b0f804f31caf\":\"9f58984509d320c017af17b4a323b9ce3a047e14fc9ff1a54915b0f804f31caf\",\"artifact:4213:abbb029c18f8d07ef2801e5a4dbf26f9f7482d68a10d6584c8b4b2ef04bdbd26\":\"abbb029c18f8d07ef2801e5a4dbf26f9f7482d68a10d6584c8b4b2ef04bdbd26\",\"artifact:4213:d1ced71adb3dde29e9a1ed0228854afdf2762f571a940eb1325529f202a211e7\":\"d1ced71adb3dde29e9a1ed0228854afdf2762f571a940eb1325529f202a211e7\"},\"sha256\":\"17e504037a65b74fd95e85aaf7025535378fc3b812f610c3ada27fd62ea89822\"},\"targets_sha256\":\"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209\"}\nDeclared non-witness scopes with their existing authority: [{\"key\":\"md5-rotation-preserving-word-shift\",\"kind\":\"finite\",\"domain_md\":\"MD5 (RFC 1321) step schedule and rotation table; known single-block dMs Xie-Feng 2010/XLF 2013 Tables 4-6, Stevens 2012.\",\"statement_md\":\"In MD5, renaming message words w -> (w - k) mod 16 keeps the rotation amount of every use of every word in all four rounds exactly when k is 0, 4, 8 or 12. The XF/XLF-T4 single-block dM (m5 +2^10, m10 +2^31) with k = 4 becomes (m1 +2^10, m6 +2^31) in bytes 5 and 27 (equal-length single block for L >= 28, incl. 32+32), its uses moving -4 steps in rounds 1-2 and +4 in rounds 3-4; Stevens' (m8 +2^25, m13 +2^31) with k = 8 becomes (m0, m5), L >= 24; 9 shifts of known single-block dMs fit some L <= 55.\",\"assumptions_md\":\"None (exhaustive enumeration over k and words). Rotation equality does not imply the same step functions or constants across round boundaries.\",\"artifact_sha256\":[\"93eb86bdfe9057431d63dd8d7ce18033ea02b0258442a90a92e3f8c5e4d5951e\",\"d1ced71adb3dde29e9a1ed0228854afdf2762f571a940eb1325529f202a211e7\"],\"transfer_conditions_md\":\"Any differential search over MD5 message differences: shifted dMs keep rotations at all difference steps; round boundaries, boolean functions and K differ and must be re-checked.\",\"scope_sha256\":\"1df089397afbb0ab117da33cafb4a5f273a548fc7003cf3c00e2f1b4f99b0abc\",\"research_status\":\"pending scoped endorsement\",\"review_ids\":[2344]},{\"key\":\"shifted-xf-round1-and-tail-under-padding\",\"kind\":\"finite\",\"domain_md\":\"Single MD5 compression; z3 5.1.0 QF_BV exact instances (steps 0..11); tail Monte Carlo with uniform other bits and words.\",\"statement_md\":\"For dM' = (m1 +2^10, m6 +2^31): XF rows 5..16 at shifted rows 1..12 (IV start) are UNSAT under equal-length padding for L = 28, 32, 40, 44, 47 and SAT at L = 48; with rows 8..12 kept only as XF's modular differences they are SAT for L = 28, 32, 36, 40, 44..47 (witnesses rechecked). XF rows 33..36 placed at shifted Q37..Q40 give a full-collision tail of 2^-11.992 vs 2^-7.999 for XF at Q33..Q36 (2^28 samples each).\",\"assumptions_md\":\"Served XF path from #4091 (pair-derived conditions, row 9 bit 30 violated by the real pair). Tail figures are the uniform-state model.\",\"artifact_sha256\":[\"3993904391e087d455887cb4f8a5dc95c383b35292d62c1820a59127d1660ec8\",\"abbb029c18f8d07ef2801e5a4dbf26f9f7482d68a10d6584c8b4b2ef04bdbd26\",\"940e88d6218016b56b206b2f4755cb664abb114a07abaccc53162c89fe20446b\",\"4c441564b113626afcb2499c341fcb7970a1f32217d407927a939d40c73ae8ad\",\"d1ced71adb3dde29e9a1ed0228854afdf2762f571a940eb1325529f202a211e7\",\"114783ed1202f067e25c8c86996ff6d0145512de154e79af736e2a2cfa56ac8b\"],\"transfer_conditions_md\":\"Any attack on dM' that reuses XF's round 1 (re-signed at L <= 47) and XF's round-3/4 path; the middle is not covered.\",\"scope_sha256\":\"247052a29f815d56141ab688bf5b9d469da5bfc2286353276e48ab139e1d47b8\",\"research_status\":\"pending scoped endorsement\",\"review_ids\":[]},{\"key\":\"shifted-xf-round2-entry-obstruction\",\"kind\":\"negative\",\"negative\":{\"kind\":\"attempt_failed\",\"evidence_md\":\"z3 UNSAT in under 1 s for every joined instance and for steps 13/14 alone; encoding controls (served rows 1..12 through 12/16/20 steps) SAT.\",\"revisit_when_md\":\"A different signed path for shifted rows 13..36 is found; or another shift (k = 8/12) whose round-2 mismatch avoids XF's dense rows.\"},\"domain_md\":\"Shifted coordinates (row t = XF row t+4), dM' = (m1 +2^10, m6 +2^31), z3 exact.\",\"statement_md\":\"XF's modular state differences of rows 12..20 cannot be followed through the shifted F-steps 12..15 (rotations 7/12/17/22, no message difference): UNSAT without padding and without bit conditions; steps 13 and 14 are each UNSAT alone. Joined instances (rows 1-7 exact, 8-16 modular, XF rows 21..24 exact through round-2 steps 16..19) are UNSAT at L = 32, 40, 48, 52, 55 and unpadded.\",\"assumptions_md\":\"Only XF's own modular differences are tested; other differences at rows 13..20 are untested.\",\"artifact_sha256\":[\"1a0f649983054adc08a1df4f24a26343e9eb059aacf966d284c39193d78da19b\",\"d1ced71adb3dde29e9a1ed0228854afdf2762f571a940eb1325529f202a211e7\",\"7556777388c75b57baf16e57f79e927198f0edf641088fe72727d18ae5b0b1aa\"],\"transfer_conditions_md\":\"Rules out reusing XF's round 2 under the 4-word shift at every L; a new middle path is required.\",\"scope_sha256\":\"405f8006aa96de2b8323ebcdaf15125cbfec0bdd28bf6e17451e040ebb21e37e\",\"research_status\":\"pending scoped endorsement\",\"review_ids\":[2344]}]\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:4213,input_sha256:\"1510fa45f1bbc5447a433fbaefbe3ebb5d7a589052b567d3df0f2da07f1d4a0c\",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/6614/transcript","files":[],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"report_sha256":"fc7df7279695e04a59c8ea163ca165fd55b5e787d130bc4c97f3c6ca9381c2ee","next_step_sha256":null,"research_authority":{"witness_status":null,"research_status":"recorded","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}