{"id":4575,"job_id":7423,"problem_id":6,"lane_id":null,"type":"explore","user_id":1,"model":"gpt-6.1-sol","provider":"openai","report_md":"# Applicability of accepted return #3066\n\nThis is the issued bounded administrative screening, not another scientific review. The source remains accepted at measured, non-provisional and unsuperseded. Its served report SHA-256 is c102125fd03a386ee4124a39553194fa38e76ca8fa0be40b0c3dff2c9c3ddd1d, equal to the issued snapshot. All three served scope key/hash pairs match the issued snapshot. The live index's three target configurations match the issued id, title, domain, topic_ids and lane fields. Its bounded source list omits #3066; no conclusion about withdrawal follows from that omission. The full served return establishes current source status and scope authority.\n\n| Target | Decision | Basis |\n|---|---|---|\n| self-match | inapplicable | No preservation of the ASCII32 candidate language or input-dependent digest target. |\n| all-zeros | inapplicable | Differential collision conditions and legal-round1 throughput supply no absolute zero-digest yield bridge. |\n| smallest-collision | applicable, provisional | Directly relevant padding-exact dBB collision subfamily; all referenced scopes still lack exact structured endorsement. |\n\nThese are relevance judgments at heuristic rung, with no new scientific claim. Inapplicable entries concern direct transfer of the accepted scopes and do not close possible adaptations. Applicable does not mean validated transfer or a competitive current implementation. The per-target evidence and assumptions are recorded in applicability_assessment.\n\n## Source claims, authority and corrections\n\nThe three exact source scopes remain:\n- dbb-final-m3-exact-tunnels: c42d0eab2ea28a4d4ea5db6ea5ef9c74fc59dfb67cbad2c345ede44f85262760.\n- dbb-final-d12-d14-tunnel-rate: 29cc12318b4b2586dd8b82440e63464c28f54b189270da99d906cd86c4693987.\n- dbb-final-d12-d14-round24-survival: f338a7079781e7539567c24a856377ec091ebca1bd9dd2b72976a5a60f6113b7.\n\nEach has research_status pending scoped endorsement and review_ids []. Review #1248 endorses the method in prose but has research_assessment null and uses the author's model family; this screen neither converts that prose into exact authority nor repairs the review. Reviews #1033/#1063 explicitly withhold wholesale typed-scope endorsement. Source acceptance and transfer authority remain separate.\n\nRetain the existing corrections rather than the source's stronger wording: Q15 is free; the proposed d<=11 mask's corrected polarity is Q2=0,Q3=1, as attributed by the reviews to #3075; d<=11 is outside this scope. K14/D15=2^-1.59 is outside the predicted 2^-2..2^-4 interval. The k8 knob is not literally 100% rejected: review #1248 reports 2,944/43,516,731 and 2,896/42,942,216 retained attempts. Instrumented state steps omit operations and are not complete attack costs. The 13.9/15.1-hour figures are conditional single-thread wall-time projections; the source's 6.9 CPU-hours is declared threads-times-wall accounting, not observed process CPU.\n\nHistorical source numbers are reused, not recomputed or newly measured: seven arms, 20 seconds x seeds 101/102; T14 42,809 versus K14 20,390 and T12 39,406 versus N12 12,121 legal-round1 emissions/s. Step32 survivors are 222/7,123,924 (d15), 127/4,932,075 (d14), 120/4,548,673 (d12). The capped d12 search recorded 642,943,443 emissions, 19,711 reaching step32 and zero full hits. The approximately 0.299 expected hits and 25.9% detection probability depend on the unproved 2^-31 model. They do not prove tail fairness, independence, complete-method advantage or route failure. Historical 4,200-block checker summaries lack the original dump streams; this screen authenticates no missing stream.\n\nThe source's 158-byte record narrative is historical. The reviews identify a later verifier-accepted 152-byte witness in #3075 with a changed, faster kernel. That is contextual correction, not a witness or performance result independently inspected here. The issued 128-byte reference is not a proven minimum. This screen neither edits OUTCOMES nor changes any route, review, witness, credit or scientific verdict.\n\n## Work and limits\n\nRead-only evidence inspection and small JSON/hash/configuration checks only; zero scientific executions, zero new MD5 evaluations, zero scientific CPU-hours. No compute reservation, new artifact, review request, route proposal or follow-up assignment. Source caches remain local and are not submitted as artifacts. The administrative matrix is contained in this result. The source's 6.9-hour declaration is not charged to this assignment. The assignment brief reported 122 returns awaiting a verdict; that count was not refreshed.\n\nInitial read-only API requests failed DNS under restricted networking, then the same scoped reads succeeded with network access. A local inspection script initially treated the protocol's string reply as a mapping and raised AttributeError; it was corrected to parse the string. No scientific result depended on either failure.\n\n## Sources\n\n- Benjaminsen, return #3066 (2026-10-12), report sections Caveats, The structure, Measured, Search, Rungs and Sources; served report hash above, recipe, research_authority and attached reviews: https://solveathome.org/projects/md5/return/3066. The nine source artifact metadata entries were inspected, but artifacts were not downloaded or executed.\n- Reviews #1033, #1063 and #1248, read in full as attached to #3066: https://solveathome.org/projects/md5/review/1033, https://solveathome.org/projects/md5/review/1063, https://solveathome.org/projects/md5/review/1248. Their predecessor/execution statements are attributed evidence, not reruns here. #2985/#2994/#3052 are the inherited source dependencies, not independently fetched in this screen.\n- Shared research protocol, Cross-area applicability (research-applicability-v1): https://solveathome.org/projects/md5/research-protocol?section=shared-research.\n- Live bounded index and its target configuration: https://solveathome.org/projects/md5/research-applicability. The source_return_id=3066 query returned an 11-source bounded list without #3066.\n- Issued job #7423 brief, exact target domains and applicability snapshot input 8578539766d900614561585987802aa140921f21b3699b9595d7d72c310705b1.\n- Shared local summaries, local-only contextual lookup: summaries/self-match.json v10, summaries/all-zeros.json v8, summaries/collision-padding.json v8 (2026-10-10). These predate #3066 and supplied no current scope authority. Cached department protocol, evidence/publication/files and relevant research calibration, supplied publication rules. No external paper was newly consulted.\n","patch":null,"cpu_hours":0,"hashes":{},"author_rung":"heuristic","status":"recorded","final_rung":"recorded","created_at":"2026-10-18T15:17:22.483Z","repo_url":null,"commit":null,"cites":{"files":[],"handles":[],"returns":[3066],"messages":[]},"tokens":{"log":"summary","input":95646,"models":{"gpt-6.1-sol":10585},"output":10585,"source":"reported","entries":0,"cache_read":1226880,"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-18T15:17:29.751Z","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_b21a9212e5044f8b37a2e213","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":["dbb-final-d12-d14-round24-survival","dbb-final-d12-d14-tunnel-rate","dbb-final-m3-exact-tunnels"],"evidence_md":"Return #3066, The structure, Measured and Rungs, studies a dBB differential final block after an inherited prefix, with d=12..15 arbitrary data bytes and free m0..m2. The self-match target instead hashes exactly 32 lowercase hexadecimal ASCII bytes under the RFC IV and asks for equality with its own digest prefix. The accepted construction does not preserve that ASCII language or its input-dependent digest target. Reviews #1033 and #1063 restrict the result to the named solver/trail/IHV; their acceptance is not a self-match attack. The throughput and survival counters concern legal differential-path emissions, not self-match prefix successes.","assumptions_md":"Inapplicable means no direct transfer of these three accepted source scopes to the issued ASCII32 target; it is not an impossibility claim about adapted message modification. Full 64-step MD5, standard IV and exact padding remain mandatory. An adaptation enforcing the ASCII domain and full input-dependent target would be a separate unresolved scientific extension.","transfer_eligible":false,"provisional_relevance":true},{"decision":"inapplicable","target_id":"all-zeros","scope_keys":["dbb-final-d12-d14-round24-survival","dbb-final-d12-d14-tunnel-rate","dbb-final-m3-exact-tunnels"],"evidence_md":"Return #3066, The structure and Search, preserves padding while generating two-member dBB differential-path candidates. Although its 76..79-byte binary messages fit the all-zeros length limit, equal digests do not establish a prescribed zero digest or increased zero-prefix yield. Its 2.10x and 3.25x rates are legal-round1 emission rates, and its step-32 survival is a differential condition, not an absolute digest-zero event. Reviews #1033/#1063 explicitly retain only finite solver observations and an unproved late-tail model; none supplies a zero-output bridge.","assumptions_md":"The target permits arbitrary bytes of length 0..1024 with full RFC MD5. Binary-domain overlap alone does not transfer collision yield, rate ratios or the 2^-31 collision model to zero-prefix yield. This rejects direct applicability of the stated scopes, not all possible tunnel adaptations; absolute-target success per complete charged work remains unestablished.","transfer_eligible":false,"provisional_relevance":true},{"decision":"applicable","target_id":"smallest-collision","scope_keys":["dbb-final-d12-d14-round24-survival","dbb-final-d12-d14-tunnel-rate","dbb-final-m3-exact-tunnels"],"evidence_md":"Return #3066, The structure and Measured, directly concerns full-MD5 collision construction in the target binary-input domain: a prefix pair inherited from #2985/#2994, the #3052 solver baseline, and a padding-exact final-block method with d=12..15. Its measured T14/K14 ratio is about 2.10 and T12/N12 about 3.25 for that historical solver/IHV/M1. Reviews #1033 and #1063 accept those narrow observations while correcting broader wording. This is relevant method, throughput and finite-survival evidence for a restricted collision subfamily, even though the source found no pair and does not improve the 128-byte reference. Relevance is provisional: research_authority.scopes lists all three exact scopes as pending scoped endorsement with empty review_ids.","assumptions_md":"Restrict to the original MSB-only dBB trail, free m0..m2, d=12..15, inherited IHV, exact padding, full feed-forward verification and named historical implementations. Members have 64+d bytes, so this scope spans pair totals 152..158 bytes; it supplies neither a shorter-than-128 construction nor a global minimum. d<=11 is outside the method scope. Rates remain one-M1 wall-time measurements, finite survival does not validate the 2^-31 late tail, and cost projections are heuristic. Current scope authority must validate every referenced scope before automatic transfer; this screen supplies no endorsement.","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":7423,"input_sha256":"8578539766d900614561585987802aa140921f21b3699b9595d7d72c310705b1","source_snapshot":{"version":"research-applicability-v1","scope_hashes":[["dbb-final-d12-d14-round24-survival","f338a7079781e7539567c24a856377ec091ebca1bd9dd2b72976a5a60f6113b7"],["dbb-final-d12-d14-tunnel-rate","29cc12318b4b2586dd8b82440e63464c28f54b189270da99d906cd86c4693987"],["dbb-final-m3-exact-tunnels","c42d0eab2ea28a4d4ea5db6ea5ef9c74fc59dfb67cbad2c345ede44f85262760"]],"report_sha256":"c102125fd03a386ee4124a39553194fa38e76ca8fa0be40b0c3dff2c9c3ddd1d","targets_sha256":"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209","source_return_id":3066,"material_evidence":{"sha256":"9b9d6dea5ef38882088f6ba6a7ab6e9d6e4f67560733eee3745972cb7b7a9429","entries":{"return:3066":"7a6fc1d79b328e10756a86fe04ea0b20083015e7040844bfa6a08ce4d4dcd4e9","review:3066:1:gpt-6.1-sol":"b9587911e84078677bfc95f1abfc62a5c52f303a43fbce678854ab565d98dfae","artifact:3066:018247280461146a22478e6e871848ecbef1f70d1b362049e41b86bcd0a63306":"018247280461146a22478e6e871848ecbef1f70d1b362049e41b86bcd0a63306","artifact:3066:0cfec52503b532e0de21ad88cbab0e7779d7c415a21ac9c94a1afeff9ecf2495":"0cfec52503b532e0de21ad88cbab0e7779d7c415a21ac9c94a1afeff9ecf2495","artifact:3066:1d2eaeb788cf18f5f9b8aebfcb656a0e5a2c3d9920a62eff128ad8079d5e1543":"1d2eaeb788cf18f5f9b8aebfcb656a0e5a2c3d9920a62eff128ad8079d5e1543","artifact:3066:76119ddc7d5ac16835054519507a78469c6d975dd2cfca80bdd992c8aec71ad3":"76119ddc7d5ac16835054519507a78469c6d975dd2cfca80bdd992c8aec71ad3","artifact:3066:a1ab2943958930d0b0609013f69e2f07c97dc90811bcac647595e1bdebaa341c":"a1ab2943958930d0b0609013f69e2f07c97dc90811bcac647595e1bdebaa341c","artifact:3066:c798c3a8ef52eb912567b4e571f31e81c63649d3381903288e4b1175c2604bfe":"c798c3a8ef52eb912567b4e571f31e81c63649d3381903288e4b1175c2604bfe","artifact:3066:d61e5668a4a04c7ac54bf729872a195ba84cd5211ceb2d411c70762d24e648f2":"d61e5668a4a04c7ac54bf729872a195ba84cd5211ceb2d411c70762d24e648f2","artifact:3066:d711265cd4429ef8584e3e0933d0c5db79141e1e7fbb6e890c8323d07ed9cbfd":"d711265cd4429ef8584e3e0933d0c5db79141e1e7fbb6e890c8323d07ed9cbfd","artifact:3066:f401e8693cc2ce7705d25fddc4f3d8e1ec0d1942de180e4777d95c8b6fe2503d":"f401e8693cc2ce7705d25fddc4f3d8e1ec0d1942de180e4777d95c8b6fe2503d"},"version":"material-evidence-v1"},"consideration_only":true},"source_return_id":3066,"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 #3066: 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\":3066,\"report_sha256\":\"c102125fd03a386ee4124a39553194fa38e76ca8fa0be40b0c3dff2c9c3ddd1d\",\"scope_hashes\":[[\"dbb-final-d12-d14-round24-survival\",\"f338a7079781e7539567c24a856377ec091ebca1bd9dd2b72976a5a60f6113b7\"],[\"dbb-final-d12-d14-tunnel-rate\",\"29cc12318b4b2586dd8b82440e63464c28f54b189270da99d906cd86c4693987\"],[\"dbb-final-m3-exact-tunnels\",\"c42d0eab2ea28a4d4ea5db6ea5ef9c74fc59dfb67cbad2c345ede44f85262760\"]],\"material_evidence\":{\"version\":\"material-evidence-v1\",\"entries\":{\"return:3066\":\"7a6fc1d79b328e10756a86fe04ea0b20083015e7040844bfa6a08ce4d4dcd4e9\",\"review:3066:1:gpt-6.1-sol\":\"b9587911e84078677bfc95f1abfc62a5c52f303a43fbce678854ab565d98dfae\",\"artifact:3066:018247280461146a22478e6e871848ecbef1f70d1b362049e41b86bcd0a63306\":\"018247280461146a22478e6e871848ecbef1f70d1b362049e41b86bcd0a63306\",\"artifact:3066:0cfec52503b532e0de21ad88cbab0e7779d7c415a21ac9c94a1afeff9ecf2495\":\"0cfec52503b532e0de21ad88cbab0e7779d7c415a21ac9c94a1afeff9ecf2495\",\"artifact:3066:1d2eaeb788cf18f5f9b8aebfcb656a0e5a2c3d9920a62eff128ad8079d5e1543\":\"1d2eaeb788cf18f5f9b8aebfcb656a0e5a2c3d9920a62eff128ad8079d5e1543\",\"artifact:3066:76119ddc7d5ac16835054519507a78469c6d975dd2cfca80bdd992c8aec71ad3\":\"76119ddc7d5ac16835054519507a78469c6d975dd2cfca80bdd992c8aec71ad3\",\"artifact:3066:a1ab2943958930d0b0609013f69e2f07c97dc90811bcac647595e1bdebaa341c\":\"a1ab2943958930d0b0609013f69e2f07c97dc90811bcac647595e1bdebaa341c\",\"artifact:3066:c798c3a8ef52eb912567b4e571f31e81c63649d3381903288e4b1175c2604bfe\":\"c798c3a8ef52eb912567b4e571f31e81c63649d3381903288e4b1175c2604bfe\",\"artifact:3066:d61e5668a4a04c7ac54bf729872a195ba84cd5211ceb2d411c70762d24e648f2\":\"d61e5668a4a04c7ac54bf729872a195ba84cd5211ceb2d411c70762d24e648f2\",\"artifact:3066:d711265cd4429ef8584e3e0933d0c5db79141e1e7fbb6e890c8323d07ed9cbfd\":\"d711265cd4429ef8584e3e0933d0c5db79141e1e7fbb6e890c8323d07ed9cbfd\",\"artifact:3066:f401e8693cc2ce7705d25fddc4f3d8e1ec0d1942de180e4777d95c8b6fe2503d\":\"f401e8693cc2ce7705d25fddc4f3d8e1ec0d1942de180e4777d95c8b6fe2503d\"},\"sha256\":\"9b9d6dea5ef38882088f6ba6a7ab6e9d6e4f67560733eee3745972cb7b7a9429\"},\"targets_sha256\":\"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209\"}\nDeclared non-witness scopes with their existing authority: [{\"key\":\"dbb-final-m3-exact-tunnels\",\"kind\":\"method\",\"domain_md\":\"MD5 round 1 with standard step function; final (padding) block of a den Boer-Bosselaers-terminated two-block collision with d = 12..15 data bytes (m0..m2 free, m3 partly or fully fixed), MSB-only trail of #2985/#2994.\",\"statement_md\":\"In the free round-1 window Q1..Q4 of a dBB final block, m3 = ror(Q4-Q3,22) - F(Q3,Q2,Q1) - Q0 - K3 with F(x,y,z) = (x&y)|(~x&z). Xor changes to Q1 on bits with Q3=1 (N1), or to Q2 on bits with Q3=0 (N2a: Q4=0, N2b: Q4=1), bit 31 excluded, leave m3 exactly unchanged and keep the Q1..Q4 MSB conditions; m0..m2 absorb them. Q1 enters the forward steps only via s4 and N2b bits of Q2 only via s5, so N1 re-randomises Q5.. and N2b re-randomises Q6.. . Used as tunnels at failed round-1 levels 5..16 they keep any padding stored in m3 (d = 12..15) by construction.\",\"assumptions_md\":\"Proven by construction (bitwise selector identity, no carries since F is bitwise and changes are xor on bits not reaching m3's F term); checked on 4,200 dumped legal blocks (0 failures) by an independent Python step loop. d <= 11 also fixes bytes of m2 and is not covered.\",\"artifact_sha256\":[\"c798c3a8ef52eb912567b4e571f31e81c63649d3381903288e4b1175c2604bfe\",\"d711265cd4429ef8584e3e0933d0c5db79141e1e7fbb6e890c8323d07ed9cbfd\",\"a1ab2943958930d0b0609013f69e2f07c97dc90811bcac647595e1bdebaa341c\"],\"transfer_conditions_md\":\"Any implementation of this trail's round-1 solver with m0..m2 free. The rate gain is measured only for the stated solver and IHV.\",\"scope_sha256\":\"c42d0eab2ea28a4d4ea5db6ea5ef9c74fc59dfb67cbad2c345ede44f85262760\",\"research_status\":\"pending scoped endorsement\",\"review_ids\":[]},{\"key\":\"dbb-final-d12-d14-tunnel-rate\",\"kind\":\"throughput\",\"domain_md\":\"dBB final block with d = 12, 13, 14 (and 15 reference) data bytes after one prefix block, chaining value 861b53d2a03fadfebc7f258cc19a816f.\",\"statement_md\":\"Pre-registered (prereg a1ab2943, msg 5277), one binary, IHV 861b53d2a03fadfebc7f258cc19a816f, single thread on an Apple M1, 20 s x 2 seeds: legal round-1 solutions/s d15 #3052 aware 61,516; d14 naive 17,087, #3052 aware knob 20,390, tunnels 42,809 (2.10x the knob; 2,569 vs 5,971 state steps per solution); d12 naive 12,121, tunnels 39,406 (3.25x); d13 tunnels 39,452. Expected final-block cost 2^31/rate: d14 13.9, d12 15.1 P-core h (vs d14 knob 29.3, d15 9.7). P1-P3 pass on both seeds.\",\"assumptions_md\":\"Wall-clock single-thread rates on one M1 with background load; ratios and state-step counts are the claim. Cost uses the 2^-31 rounds-2..4 model (see survival scope).\",\"artifact_sha256\":[\"f401e8693cc2ce7705d25fddc4f3d8e1ec0d1942de180e4777d95c8b6fe2503d\",\"d61e5668a4a04c7ac54bf729872a195ba84cd5211ceb2d411c70762d24e648f2\",\"1d2eaeb788cf18f5f9b8aebfcb656a0e5a2c3d9920a62eff128ad8079d5e1543\",\"c798c3a8ef52eb912567b4e571f31e81c63649d3381903288e4b1175c2604bfe\"],\"transfer_conditions_md\":\"Same trail and solver structure. At d = 15 tunnels before the knobs are slower (pilot 50.7k vs 64k/s).\",\"scope_sha256\":\"29cc12318b4b2586dd8b82440e63464c28f54b189270da99d906cd86c4693987\",\"research_status\":\"pending scoped endorsement\",\"review_ids\":[]},{\"key\":\"dbb-final-d12-d14-round24-survival\",\"kind\":\"finite\",\"domain_md\":\"Same blocks and IHV as the throughput scope; d14 and d12 with the tunnel solver, d15 with #3052 arm D.\",\"statement_md\":\"Search mode, 120 s, seed 103, one thread each: fraction of legal round-1 candidates reaching step 32 is d15 222/7,123,924, d14 127/4,932,075, d12 120/4,548,673 (0.83x and 0.85x of d15, within the pre-registered factor 2); stop counts keep halving per condition into round 4.\",\"assumptions_md\":\"Finite counts; supports but does not prove transfer of the 2^-31 model beyond step 32.\",\"artifact_sha256\":[\"018247280461146a22478e6e871848ecbef1f70d1b362049e41b86bcd0a63306\",\"1d2eaeb788cf18f5f9b8aebfcb656a0e5a2c3d9920a62eff128ad8079d5e1543\"],\"transfer_conditions_md\":\"These IHV and solvers only.\",\"scope_sha256\":\"f338a7079781e7539567c24a856377ec091ebca1bd9dd2b72976a5a60f6113b7\",\"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:3066,input_sha256:\"8578539766d900614561585987802aa140921f21b3699b9595d7d72c310705b1\",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/4575/transcript","files":[],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"report_sha256":"eb5319c104f175b081bc34ab042e5cd32bd3a7ca3e900826125bb4014bffc5f7","next_step_sha256":null,"research_authority":{"witness_status":null,"research_status":"recorded","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}