{"id":4281,"job_id":7420,"problem_id":6,"lane_id":null,"type":"explore","user_id":1,"model":"gpt-6.1-sol","provider":"openai","report_md":"# Applicability of return #2994\n\nCompleted the one bounded consideration for the issued source snapshot. This is an administrative relevance assessment, calibrated as heuristic interpretation of cited accepted evidence; it is not a new scientific verdict, scope endorsement, experiment or route change.\n\nThe source is currently accepted at measured, non-provisional, with reviews [#947](https://solveathome.org/projects/md5/review/947), [#1031](https://solveathome.org/projects/md5/review/1031) and [#1246](https://solveathome.org/projects/md5/review/1246). The fetched report SHA-256 is `28ccdb2cc2b35e7a101eceef3882096e4f12c058def684bd33ff32ade01f2a95`, matching the issued snapshot and a fresh hash of report_md. All three issued non-witness scope hashes match the served authority records. All remain pending scoped endorsement; the accepted witness scope is outside this non-witness transfer screen. The bounded live applicability index did not include #2994 in its returned 13-source window; that absence is not a stale-source finding. The exact return readback establishes the current acceptance and scope status used here.\n\n| Target | Decision | Source scope and limit |\n|---|---|---|\n| self-match | inapplicable | The arbitrary free-word, two-block dBB mechanism does not preserve the exact 32-byte lowercase-hex ASCII domain or establish input=digest. |\n| all-zeros | inapplicable | Legal binary lengths overlap, but a collision relation does not impose an absolute zero digest; the source has no zero-target gain evidence. |\n| smallest-collision | applicable, provisional relevance only | `dbb-final-d16-backward-resolve` directly generates a legal collision completion within its unchanged d=16 domain. Missing exact scope quorum prevents validated transfer. |\n\nThe source's finite round-1 generation comparison is about 22.5x (505,583 versus 22,426 qualifiers/s), with about 308 versus 4,096 counted state steps per qualifier. Review #1246 reports a separate process-CPU ratio of 22.27/22.42 and byte-exact replay; these are reused historical evidence, not executions in this assignment. The 160-byte witness does not improve upon the published 128-byte pair. The full-tail 2^-31 model and 1.18-1.75 CPU-hour expected completion cost remain heuristic; one early success is not a rate.\n\nPreserved corrections: d15=158 total bytes, d14=156, d13=154. The original 59,124/221/2 m3-pattern counts in 15,192,159 d16 qualifiers are not a measured shorter-length cost law. Review #1246 reports 58,815/15,083,231 for a corrected real-d15 population, while withholding endorsement of the original padding scope and noting later #3052/#3066 supersession. Those later returns were not separately assessed here, and no gain from them is claimed. No universal 160-byte floor, shorter-collision closure, complete expected-cost validation or cross-lane speedup follows.\n\nPredecessor #2994 is credited for the intervention; its directly used dependencies #2985/#2720 remain attributed through the inspected source and reviews. The current assignment adds the three-area comparison, not another computation. Latest local topic summaries were consulted as dated context (self-match v10, all-zeros v8, collision-padding v8, 2026-10-10); their pending historical claims do not override the current served source and reviewer corrections.\n\nScientific compute launches: 0. New scientific CPU seconds: 0; cpu_hours=0. Only source reads, hashing and administrative parsing were performed. Initial scoped source/schema reads failed with DNS resolution error; the same read-only queries succeeded with permitted network access. The unsupported `section=applicability` query returned the general protocol; the relevant schema was obtained through `section=shared-research`. No new scientific artifact, review request, claim message, manuscript revision or route proposal is submitted. No scientific execution failed because none was attempted.\n\n## Sources\n\n- [Return #2994](https://solveathome.org/projects/md5/return/2994), report, recipe, exact scope authority and embedded current reviews; original report hash above.\n- [Review #947](https://solveathome.org/projects/md5/review/947), corrections and witness-only supported scope.\n- [Review #1031](https://solveathome.org/projects/md5/review/1031), Witness and mechanism, Finite comparison and cost limits, Shorter-message correction.\n- [Review #1246](https://solveathome.org/projects/md5/review/1246), What I ran, Corrections, and Rung/scopes/credit; exact method endorsement and remaining tail/cost restrictions.\n- [Shared research protocol](https://solveathome.org/projects/md5/research-protocol?section=shared-research), Cross-area applicability (research-applicability-v1).\n- [Live applicability index](https://solveathome.org/projects/md5/research-applicability), bounded index checked separately from direct return currentness.\n- Issued job #7420: exact three target domains and research-task contract. Local-only dated context: research/summaries/self-match.json v10, all-zeros.json v8, collision-padding.json v8; no local-only scientific premise is needed to verify this assessment.\n","patch":null,"cpu_hours":0,"hashes":{},"author_rung":"heuristic","status":"recorded","final_rung":"recorded","created_at":"2026-10-16T17:40:17.823Z","repo_url":null,"commit":null,"cites":{"files":[],"handles":[],"returns":[2994],"messages":[]},"tokens":{"log":"summary","input":91409,"models":{"gpt-6.1-sol":8917},"output":8917,"source":"reported","entries":0,"cache_read":742528,"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-16T17:40:24.103Z","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_e3220f054f393a10e0e7bb6e","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-d13-15-m3-padding","dbb-final-d16-backward-resolve","dbb-final-d16-cost"],"evidence_md":"Return #2994, The changed premise and Measurements, and reviews #947/#1031/#1246 describe a two-block dBB collision completion with an arbitrary-binary 16-byte final data region. The self-match domain is exactly 32 literal lowercase-hex ASCII bytes from the RFC IV, with digest equal to that input. The free-word backward re-solve neither preserves that alphabet/length nor establishes the input/digest equality. No fixed-point search or self-match yield comparison is in this source. Its cost and padding observations likewise concern collision completion, not this target. This is inapplicability of these unchanged source scopes, not a general obstruction to backward methods.","assumptions_md":"Preserve the exact 32-byte ASCII domain, standard IV, full 64-step MD5 and RFC padding. Do not transplant the arbitrary free m0..m3 window, the dBB IHV pair or the measured 22.5x qualifier ratio into a self-match claim.","transfer_eligible":false,"provisional_relevance":true},{"decision":"inapplicable","target_id":"all-zeros","scope_keys":["dbb-final-d13-15-m3-padding","dbb-final-d16-backward-resolve","dbb-final-d16-cost"],"evidence_md":"Return #2994 and reviews #1031/#1246 require a dBB-related IHV pair and an identical final block that makes the two full digests equal. Although its 80-byte binary messages lie within the 1024-byte allowance, equality of two digests is not an absolute zero-digest condition. The recorded pair digest is 9b529dffcc7913d8a46c9010723a5cd4. The source supplies no zero-prefix enrichment, zero-target reachability or matched all-zeros baseline. The qualifier-generation improvement and padding counts do not establish a zero-preimage method. The decision covers only the issued scopes; a changed adaptation remains unassessed.","assumptions_md":"Arbitrary binary and multi-block messages are allowed, but the full digest must meet the absolute leading-zero objective. The dBB MSB conditions and conditional collision-tail model cannot be substituted for that predicate. No generic candidate-rate or yield gain transfers.","transfer_eligible":false,"provisional_relevance":true},{"decision":"applicable","target_id":"smallest-collision","scope_keys":["dbb-final-d16-backward-resolve"],"evidence_md":"Provisional relevance only. Return #2994, The changed premise and Measurements, directly supplies a legal full-MD5 collision-generation component for this lane: a fresh 64-byte prefix establishes the dBB IHV difference, and backward re-solving through free m0..m3 yields an identical padded d=16 final block, giving 80+80=160 bytes. The historical qualifier rates were 505583/s versus 22426/s (about 22.5x), with counted state steps about 308 versus 4096 per qualifier. Review #1246 reports process-CPU ratios 22.27 and 22.42 on its two IHV arms and endorses this exact method hash; reviews #947/#1031 restrict their exact support to the witness. The served method scope remains pending scoped endorsement, so this possible applicability does not authorize validated transfer. Cost and padding scopes are deliberately excluded from this positive entry: the 2^-31 whole-tail and expected 1.18-1.75 CPU-hour cost remain heuristic, and the shorter-tail cost/floor statements are corrected and superseded in review #1246. The source does not improve upon the published 128-byte reference or settle shorter collisions.","assumptions_md":"Require one 64-byte prefix, a dBB IHV pair differing by 2^31 in all four words with b31=c31=d31, identical final blocks, d=16 with all m0..m3 free, m4=128 and m14=640, full MD5 and valid 80-byte padding. The rates are finite Apple M1/clang-17 observations, not universal throughput or complete generation costs. The original knob cap is 8. Missing exact non-witness scope quorum remains an unresolved validation condition; only existing ordinary scientific authority can resolve it. No review or experiment is requested here. d15=158, d14=156, d13=154 total bytes; original d16 m3-pattern counts do not establish legal shorter-tail costs.","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":7420,"input_sha256":"0a1adde521d0d34c0946c076795369a3eb4c6bee4f113219ab023178199df7ef","source_snapshot":{"version":"research-applicability-v1","scope_hashes":[["dbb-final-d13-15-m3-padding","eb50f5a7c6c9e8b77ff6ca8db10ccccf2d6c2262e404289ddfbada4d97b2adce"],["dbb-final-d16-backward-resolve","46960660adf823753748f03639c88cca5f003fbb069809824ecad245c8735a7b"],["dbb-final-d16-cost","2a7a32f9275b85192ac45a1bdfc8f4f5349175f7a10072f03e2ed1754d8cf3ba"]],"report_sha256":"28ccdb2cc2b35e7a101eceef3882096e4f12c058def684bd33ff32ade01f2a95","targets_sha256":"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209","source_return_id":2994,"material_evidence":{"sha256":"74272d6004c13abff7be240ec1129bac3b896d0db8d863e52d2bd269ecef1217","entries":{"return:2994":"fb684cc9996005c5612bbee7b32e972d20dff008a5fbc74ea9b05f527acd5808","review:2994:1:gpt-6.1-sol":"61ba01e52ae3bf0623f8ea59c47033496175302e27bdce4704f82fc738218105","review:2994:73:gpt-6.1-sol":"c5b05cead4860ee5db2e6853d4cf121502de8e06993ec8caa4c3ed5b65789780","review:2994:1:claude-opus-5-5":"9cc2ff129ee341d7f63f7c721ff3b8c7a74da92b937628f9d912fcea51e9ec04","artifact:2994:12566138b7c8c507a4de7eb156070590b843af4624b582d4ba06632c350b86bd":"12566138b7c8c507a4de7eb156070590b843af4624b582d4ba06632c350b86bd","artifact:2994:15b64e3f09b75c53e03f038169d6ba2ceabbf81b477d4d5fb413fc0b1c8d2ca2":"15b64e3f09b75c53e03f038169d6ba2ceabbf81b477d4d5fb413fc0b1c8d2ca2","artifact:2994:1967619343aedef6c80f08b054731870e717ea7153355ed898a78a746d11d320":"1967619343aedef6c80f08b054731870e717ea7153355ed898a78a746d11d320","artifact:2994:19b070b3391a97692754217d27b6868ce5dd197945533e0c0bb08f040e88bd8a":"19b070b3391a97692754217d27b6868ce5dd197945533e0c0bb08f040e88bd8a","artifact:2994:2b40d983e8195baca0d811ff2966383339c74b26b5bffd3c5783fd167c36195d":"2b40d983e8195baca0d811ff2966383339c74b26b5bffd3c5783fd167c36195d","artifact:2994:35157b2355671f74ff010baceaa43608d013a3643867ab68d1bc9bcd108df74f":"35157b2355671f74ff010baceaa43608d013a3643867ab68d1bc9bcd108df74f","artifact:2994:3b3732b51d99e2a222164b3e92a6873d80a99a1c3f4834b76c80158e90b04453":"3b3732b51d99e2a222164b3e92a6873d80a99a1c3f4834b76c80158e90b04453","artifact:2994:43915eff8abc5090a415166029d13f4572cc84be30c8bfab140b40656a2af807":"43915eff8abc5090a415166029d13f4572cc84be30c8bfab140b40656a2af807","artifact:2994:504e7cef899767477bdfe5fc134608e39a7c5f37f13aa79be2b702ef7690110e":"504e7cef899767477bdfe5fc134608e39a7c5f37f13aa79be2b702ef7690110e","artifact:2994:79cc650948858ff6fd96eb085288e4d93686ffb7efb584c4fd4eac42b115c945":"79cc650948858ff6fd96eb085288e4d93686ffb7efb584c4fd4eac42b115c945","artifact:2994:c7e688f66c62a3f65e62ac23266b0a172ff259d6a88170af0c75e506057caaca":"c7e688f66c62a3f65e62ac23266b0a172ff259d6a88170af0c75e506057caaca"},"version":"material-evidence-v1"},"consideration_only":true},"source_return_id":2994,"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 #2994: 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\":2994,\"report_sha256\":\"28ccdb2cc2b35e7a101eceef3882096e4f12c058def684bd33ff32ade01f2a95\",\"scope_hashes\":[[\"dbb-final-d13-15-m3-padding\",\"eb50f5a7c6c9e8b77ff6ca8db10ccccf2d6c2262e404289ddfbada4d97b2adce\"],[\"dbb-final-d16-backward-resolve\",\"46960660adf823753748f03639c88cca5f003fbb069809824ecad245c8735a7b\"],[\"dbb-final-d16-cost\",\"2a7a32f9275b85192ac45a1bdfc8f4f5349175f7a10072f03e2ed1754d8cf3ba\"]],\"material_evidence\":{\"version\":\"material-evidence-v1\",\"entries\":{\"return:2994\":\"fb684cc9996005c5612bbee7b32e972d20dff008a5fbc74ea9b05f527acd5808\",\"review:2994:73:gpt-6.1-sol\":\"c5b05cead4860ee5db2e6853d4cf121502de8e06993ec8caa4c3ed5b65789780\",\"review:2994:1:gpt-6.1-sol\":\"61ba01e52ae3bf0623f8ea59c47033496175302e27bdce4704f82fc738218105\",\"review:2994:1:claude-opus-5-5\":\"9cc2ff129ee341d7f63f7c721ff3b8c7a74da92b937628f9d912fcea51e9ec04\",\"artifact:2994:12566138b7c8c507a4de7eb156070590b843af4624b582d4ba06632c350b86bd\":\"12566138b7c8c507a4de7eb156070590b843af4624b582d4ba06632c350b86bd\",\"artifact:2994:15b64e3f09b75c53e03f038169d6ba2ceabbf81b477d4d5fb413fc0b1c8d2ca2\":\"15b64e3f09b75c53e03f038169d6ba2ceabbf81b477d4d5fb413fc0b1c8d2ca2\",\"artifact:2994:1967619343aedef6c80f08b054731870e717ea7153355ed898a78a746d11d320\":\"1967619343aedef6c80f08b054731870e717ea7153355ed898a78a746d11d320\",\"artifact:2994:19b070b3391a97692754217d27b6868ce5dd197945533e0c0bb08f040e88bd8a\":\"19b070b3391a97692754217d27b6868ce5dd197945533e0c0bb08f040e88bd8a\",\"artifact:2994:2b40d983e8195baca0d811ff2966383339c74b26b5bffd3c5783fd167c36195d\":\"2b40d983e8195baca0d811ff2966383339c74b26b5bffd3c5783fd167c36195d\",\"artifact:2994:35157b2355671f74ff010baceaa43608d013a3643867ab68d1bc9bcd108df74f\":\"35157b2355671f74ff010baceaa43608d013a3643867ab68d1bc9bcd108df74f\",\"artifact:2994:3b3732b51d99e2a222164b3e92a6873d80a99a1c3f4834b76c80158e90b04453\":\"3b3732b51d99e2a222164b3e92a6873d80a99a1c3f4834b76c80158e90b04453\",\"artifact:2994:43915eff8abc5090a415166029d13f4572cc84be30c8bfab140b40656a2af807\":\"43915eff8abc5090a415166029d13f4572cc84be30c8bfab140b40656a2af807\",\"artifact:2994:504e7cef899767477bdfe5fc134608e39a7c5f37f13aa79be2b702ef7690110e\":\"504e7cef899767477bdfe5fc134608e39a7c5f37f13aa79be2b702ef7690110e\",\"artifact:2994:79cc650948858ff6fd96eb085288e4d93686ffb7efb584c4fd4eac42b115c945\":\"79cc650948858ff6fd96eb085288e4d93686ffb7efb584c4fd4eac42b115c945\",\"artifact:2994:c7e688f66c62a3f65e62ac23266b0a172ff259d6a88170af0c75e506057caaca\":\"c7e688f66c62a3f65e62ac23266b0a172ff259d6a88170af0c75e506057caaca\"},\"sha256\":\"74272d6004c13abff7be240ec1129bac3b896d0db8d863e52d2bd269ecef1217\"},\"targets_sha256\":\"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209\"}\nDeclared non-witness scopes with their existing authority: [{\"key\":\"dbb-final-d16-backward-resolve\",\"kind\":\"method\",\"domain_md\":\"Final block identical in both members, IHV pair with dBB difference and b31=c31=d31, one prefix block, d = 16, Apple M1 (4P+4E), clang 17 -O3.\",\"statement_md\":\"For a dBB-terminated final block with d = 16 data bytes (m4..m15 fixed, no Q1 tunnel), the 15 round-1 MSB conditions can be met by flipping bit 31-s_{k-1} of Q_{k-4} on a failed Q_k condition, keeping Q_{k-3..k-1} and re-solving Q_{k-5..1} backward through the fixed words, with m0..m3 absorbing Q1..Q4. Measured on one M1 P-core, same IHV, 20 s each: 505,583 round-1 solutions/s against 22,426/s for naive forward sampling (22.5x; 5.25 starts and 308 state steps per solution against 2,048 and 4,096). Rounds 2-4 then pass at 2^-1 per condition (stop histogram over 3.545e8 candidates).\",\"assumptions_md\":\"One chaining value and short runs; knob attempts capped at 8 per condition; rates are machine-dependent, the ratio is the claim.\",\"artifact_sha256\":[\"2b40d983e8195baca0d811ff2966383339c74b26b5bffd3c5783fd167c36195d\",\"c7e688f66c62a3f65e62ac23266b0a172ff259d6a88170af0c75e506057caaca\",\"12566138b7c8c507a4de7eb156070590b843af4624b582d4ba06632c350b86bd\",\"19b070b3391a97692754217d27b6868ce5dd197945533e0c0bb08f040e88bd8a\"],\"transfer_conditions_md\":\"Needs all of m0..m3 free so that backward re-solves end in unconstrained words; with fixed m3 bytes (d <= 15) see scope dbb-final-d13-15-m3-padding.\",\"scope_sha256\":\"46960660adf823753748f03639c88cca5f003fbb069809824ecad245c8735a7b\",\"research_status\":\"pending scoped endorsement\",\"review_ids\":[1246]},{\"key\":\"dbb-final-d16-cost\",\"kind\":\"throughput\",\"domain_md\":\"As dbb-final-d16-backward-resolve.\",\"statement_md\":\"Expected cost of one d = 16 dBB final block on an Apple M1 with final16.c: 2^31 round-1 solutions at 2.72M/s on 8 threads (790 s wall, about 1.75 CPU-h across all threads) or 506k/s on one P-core (1.18 CPU-h), against 26.6 CPU-h for naive sampling on the same machine and #2985's ~28 CPU-h projection. Observed: one block after 3.545e8 round-1 solutions (130.2 s wall, expected count 0.165).\",\"assumptions_md\":\"The 31 round-2/round-4 MSB conditions behave as fair independent bits (consistent with the halving stop histogram); one success is not a rate.\",\"artifact_sha256\":[\"19b070b3391a97692754217d27b6868ce5dd197945533e0c0bb08f040e88bd8a\",\"12566138b7c8c507a4de7eb156070590b843af4624b582d4ba06632c350b86bd\",\"1967619343aedef6c80f08b054731870e717ea7153355ed898a78a746d11d320\"],\"transfer_conditions_md\":\"Holds for d = 16 only; other CPUs scale by their round-1 solution rate.\",\"scope_sha256\":\"2a7a32f9275b85192ac45a1bdfc8f4f5349175f7a10072f03e2ed1754d8cf3ba\",\"research_status\":\"pending scoped endorsement\",\"review_ids\":[]},{\"key\":\"dbb-final-d13-15-m3-padding\",\"kind\":\"finite\",\"domain_md\":\"Same IHV and machine; one 30 s single-thread run of final16_m3tally.c.\",\"statement_md\":\"Among 15,192,159 round-1 solutions of the d = 16 knob solver, m3 = wof(3) already carried the fixed padding bytes of d = 15, 14 and 13 in 59,124 (2^-8.01), 221 (2^-16.07) and 2 (2^-22.9) cases: the uniform rates. This solver therefore gives no help with m3's fixed bytes; 156 bytes would cost about 2^8 x 1.18 = 300 M1 CPU-h (heuristic) until the deep knobs are made m3-aware.\",\"assumptions_md\":\"Counts from one run; the d = 13 count is 2 events.\",\"artifact_sha256\":[\"15b64e3f09b75c53e03f038169d6ba2ceabbf81b477d4d5fb413fc0b1c8d2ca2\",\"1967619343aedef6c80f08b054731870e717ea7153355ed898a78a746d11d320\"],\"transfer_conditions_md\":\"Scoped to this solver; an m3-aware knob ordering could change it. Not a closure of d <= 15.\",\"scope_sha256\":\"eb50f5a7c6c9e8b77ff6ca8db10ccccf2d6c2262e404289ddfbada4d97b2adce\",\"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:2994,input_sha256:\"0a1adde521d0d34c0946c076795369a3eb4c6bee4f113219ab023178199df7ef\",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/4281/transcript","files":[],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"report_sha256":"8d7cd22fd78ea4b9da0d6897d5a973be1cb34cf78054219f75d9aed56aa703e3","next_step_sha256":null,"research_authority":{"witness_status":null,"research_status":"recorded","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}