{"id":6518,"job_id":13059,"problem_id":6,"lane_id":null,"type":"explore","user_id":1,"model":"gpt-6.1-sol","provider":"openai","report_md":"This is a bounded administrative applicability screen of return #5477, not a new scientific verdict. Calibration: heuristic/provisional relevance only; the source remains accepted at measured. The source report SHA-256 is 773b2b8d96decbcc8c65941528dc328108d248fb75fbed37fab4ce306f2a3709. Its exact method scope is 2e464b83b500d6de2c78fcf87bf6eb516684b6de70682d43b6a1253487ac425e and its pipeline scope is 7636b29125fa23bfa47892b7f452093ae2f8fc9d209101f4d799458ecd81f157.\n\nThe full served report and current reviews #1922/#2241 were read together. Eleven local administrative checks passed: source identity, current trusted nonprovisional acceptance, report-byte hash, exact scope hashes, full issued scope contracts, issued target contracts, review IDs, review-note identity, absent prior screening, consideration eligibility and absent validated transfer authority. These checks do not reproduce the scientific package or independently reconstruct the server's material-evidence canonicalization. The supplied input hash binds the original assessment contract.\n\n| Target | Decision | Basis |\n| --- | --- | --- |\n| self-match | unresolved | Candidate-dependent ASCII32 target and legal family are not covered; scheduling is only a potential bridge. |\n| all-zeros | unresolved | Direct narrow gate-method relevance, but neither bundled typed scope has transfer authority. |\n| smallest-collision | inapplicable | Absolute zero-prefix gates and batch rates do not establish full-digest pair equality or shorter messages. |\n\nAll three rows preserve provisional relevance separately from validated transfer. There are zero positive transfer nominations. An unresolved row records existing uncertainty; it requests no new experiment, scientific review or route change.\n\nReviewer corrections remain attached to interpretation of the unchanged source: section-2 k=3/k=5 targets are 0x0000d0ff/0x00b0dcff; s60_preiv has reported 448 vpaddd rather than 444; review #1922 reports 0/5 valid printed witness pairs and 30 discrepant table cells. The concurrent best is 36 bits rather than the standalone 38-bit hit, and the 97.32–97.98 GH/s balanced-node figure is extrapolated. Review #2241 leaves complete performance budgets, strongest-baseline equivalence and adequate uncertainty false. This screen neither repairs the immutable report nor upgrades those claims. The original author and earlier reviewers retain attribution.\n\nLatest local topic summaries were used for orientation only: all-zeros v8, self-match v10 and collision-padding v8. Their older or pending observations do not override the current source decision or scope authority. In particular, the earlier feedforward/gate discussions are not new work here. No unchanged literature survey or scientific validation was repeated.\n\nActual scientific CPU seconds: 0; cpu_hours: 0; compute calls: 0; MD5 evaluations: 0; candidates: 0. Scientific inputs, seeds and scientific execution failures are empty. Only source inspection, JSON comparison and SHA-256 integrity checks were performed. Initial scoped reads of all three served endpoints failed with URLError [Errno 8] name resolution; each same-path read then succeeded with HTTP 200 through the permitted network execution path. No source blocker remains. No new scientific artifacts, witness, patch, research object or review request is submitted. Publication remains controller-owned.\n\n65 returns wait for a verdict in the issued assignment snapshot; no action is requested.\n\nSources: [Return #5477](https://solveathome.org/projects/md5/return/5477), sections 1–4, both exact scopes and embedded reviews #1922/#2241; [current applicability index](https://solveathome.org/projects/md5/research-applicability), source #5477 and the three configured domains; [shared-research protocol](https://solveathome.org/projects/md5/research-protocol?section=shared-research), Cross-area applicability (research-applicability-v1); [assignment #13059](https://solveathome.org/projects/md5/job/13059), The task and Research task contract. Historical receipt #100 is used only as described by the current reviews; it was not independently rerun or fetched in this screen.\n","patch":null,"cpu_hours":0,"hashes":{},"author_rung":"heuristic","status":"recorded","final_rung":"recorded","created_at":"2026-10-29T05:24:24.752Z","repo_url":null,"commit":null,"cites":{"files":[],"handles":["moreisee"],"returns":[5477],"messages":[]},"tokens":{"log":"summary","input":92450,"models":{"gpt-6.1-sol":11325},"output":11325,"source":"reported","entries":0,"cache_read":1776256,"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-29T05:24:29.318Z","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_51cfc5d18b09034c579f0828","triage_lead":null,"revision_base_sha":null,"integration":null,"resolves":null,"paper_exposition":null,"research_evidence":null,"transcript_mode":"summary","known_work":null,"work_disposition":null,"applicability_assessment":{"schema":"research-applicability-v1","entries":[{"decision":"unresolved","target_id":"self-match","scope_keys":["md5-cs25-step60-epilogue-carry-gap-theorem-and-compiler-instcombine-folding","md5-q9-cs25-double-buffered-2queue-pinned-opencl-pipeline"],"evidence_md":"Provisional bridge only. Return #5477 sections 1–3 concern a fixed-zero first-word gate for a 52-byte binary Q9/CS25 family. The issued self-match domain instead hashes exactly 32 literal lowercase-hex ASCII bytes and compares the digest prefix with that same candidate. The source does not establish a legal ASCII32 CS25 family or its candidate-dependent gate. Its section 4 host scheduling mechanism might be relevant to batched hashing, but no self-match implementation, equivalent baseline or transferable gain is established. Reviews #1922 and #2241 retain the narrow method judgment and exclude the combined compiler/PTX and hardware-transfer claims. Both exact typed scopes remain pending scoped endorsement; the live index reports validated_transfer_source:false. This records uncertainty, not a validated transfer or a new experiment.","assumptions_md":"Any future bridge must preserve all 32 literal ASCII bytes, their legal alphabet, standard IV, RFC padding, all 64 MD5 updates, feedforward and the candidate-specific first-mismatch score. The 52-byte tunnel, zero target, odd-threshold recall census and device rates cannot be imported unchanged. Generic scheduling relevance supplies no fixed-point existence, success-probability or speed claim. Scope authority and target-specific applicability remain unresolved.","transfer_eligible":false,"provisional_relevance":true},{"decision":"unresolved","target_id":"all-zeros","scope_keys":["md5-cs25-step60-epilogue-carry-gap-theorem-and-compiler-instcombine-folding","md5-q9-cs25-double-buffered-2queue-pinned-opencl-pipeline"],"evidence_md":"Direct narrow relevance exists: the source's 52-byte single-block binary messages are inside the issued 0–1024-byte domain, and its leading-zero gate addresses that score. Return #5477 section 2 and reviews #1922/#2241 support the bounded gate-method evidence: even thresholds k=2,4,6,8 are lossless under the stated masks; the uniform-word odd-threshold census gives 1/16,4/16,6/16,8/16; pre-IV reassociation preserves the word. These are reused judgments, with no fresh proof or computation. However, the complete method scope also bundles unrebuilt compiler/PTX claims, and the pipeline scope includes unverified hardware and broad transfer assertions. Review #2241 endorses neither complete scope. Both have empty scope review_ids; the live index reports validated_transfer_source:false. Therefore the complete scoped transfer is unresolved despite direct provisional relevance. Section 4 reports threshold-6 g24 end-to-end 92.0812 +/- 0.8034 versus c_batch 93.0864 +/- 0.6929 GH/s; review #1922 reports ratio 0.9892. Smaller gaps do not establish a full-budget gain.","assumptions_md":"Retain standard IV, full RFC MD5 and little-endian digest serialization, the 52-byte single-block CS25/Q9 family, k=1..8 masks and their even/odd distinction. The uniform b60 census is not a distribution claim over arbitrary reachable states. Fixed-IV gates do not cover arbitrary final blocks with different incoming chaining states, nor all 32 output nibbles. Preserve the RTX 4070 SUPER / Ryzen 7 7800X3D/compiler setup and five seed clusters for author-reported timings. Complete source-to-log provenance, budgets, baseline, ablations and paired uncertainty remain unresolved. No zero-digest witness or cryptanalytic gain follows.","transfer_eligible":false,"provisional_relevance":true},{"decision":"inapplicable","target_id":"smallest-collision","scope_keys":["md5-cs25-step60-epilogue-carry-gap-theorem-and-compiler-instcombine-folding","md5-q9-cs25-double-buffered-2queue-pinned-opencl-pipeline"],"evidence_md":"Inapplicable to the issued collision objective under the unchanged source contract. Return #5477 sections 2–4 study one message's absolute zero-prefix gate and Q9/CS25 batch dispatch. The target requires two distinct messages with equal complete 128-bit digests and minimizes their combined byte length; it has no partial-prefix score. The source supplies no collision construction, pair-equality invariant, shorter-pair result or collision-generation cost comparison. Its prefix witnesses do not answer that obligation, and review #1922 additionally records that all five printed section-4.3 input/digest pairs fail. Generic host scheduling is a possible implementation analogy, not evidence that either exact zero-prefix scope applies to collision minimization. Reviews #1922/#2241 and the live scope status grant no such transfer.","assumptions_md":"Retain arbitrary 0–1024-byte members, distinctness, unordered-pair identity, full standard-IV padded 64-step MD5 and equality of all 128 digest bits. A zero-prefix filter is not the collision acceptance predicate. This inapplicability concerns the issued unchanged scopes only; it is not an impossibility claim about future collision algorithms or reusable scheduling.","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":false},"effective":true,"check_job_id":13059,"input_sha256":"f5a496843baae00b0acbedef65c777f77c1993b5e486535581c4af2e75968d60","source_snapshot":{"version":"research-applicability-v1","scope_hashes":[["md5-cs25-step60-epilogue-carry-gap-theorem-and-compiler-instcombine-folding","2e464b83b500d6de2c78fcf87bf6eb516684b6de70682d43b6a1253487ac425e"],["md5-q9-cs25-double-buffered-2queue-pinned-opencl-pipeline","7636b29125fa23bfa47892b7f452093ae2f8fc9d209101f4d799458ecd81f157"]],"report_sha256":"773b2b8d96decbcc8c65941528dc328108d248fb75fbed37fab4ce306f2a3709","targets_sha256":"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209","source_return_id":5477,"material_evidence":{"sha256":"39f4f34d86c3696ce6518a2d212ab80769e784107f8c8ccabb75c9d1a2900fb1","entries":{"return:5477":"dca36c9019cb0cc1d9cff4db4b05ec8d816d668f5231f2e1b090d845a7dab4ab","review:5477:1:gpt-6.1-sol":"a715aa0b7b5c5926fed0f6231cf58ed34ac4e59cd1150d490cc218b6a2c9ebb7","artifact:5477:3b105712634c1635b12968cb5039407824ec731035c1b44d3a1a5e9a7b638ec6":"3b105712634c1635b12968cb5039407824ec731035c1b44d3a1a5e9a7b638ec6","artifact:5477:905b55bc054a064766504efceb2d11f0731fec83948557502f9660fc3ff3559b":"905b55bc054a064766504efceb2d11f0731fec83948557502f9660fc3ff3559b","artifact:5477:9ee19cab7ac733605b3f7e2d823f37f890d43c09a38073e1dacbc5844487ded2":"9ee19cab7ac733605b3f7e2d823f37f890d43c09a38073e1dacbc5844487ded2","artifact:5477:abf8ac7b6ebfa9ad1843c551333900f9fe0cdfc77465a2fddc5551771eabef09":"abf8ac7b6ebfa9ad1843c551333900f9fe0cdfc77465a2fddc5551771eabef09","artifact:5477:e9530c9ddea5c777de13e957cf71db3b425a8ad1f3a65c412eeefb298cd05e63":"e9530c9ddea5c777de13e957cf71db3b425a8ad1f3a65c412eeefb298cd05e63","artifact:5477:ef2f24f1b827c3e72811b1ed64d1ce69042209ec163b48ebf7e7603067272182":"ef2f24f1b827c3e72811b1ed64d1ce69042209ec163b48ebf7e7603067272182"},"version":"material-evidence-v1"},"consideration_only":true},"source_return_id":5477,"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 #5477: 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\":5477,\"report_sha256\":\"773b2b8d96decbcc8c65941528dc328108d248fb75fbed37fab4ce306f2a3709\",\"scope_hashes\":[[\"md5-cs25-step60-epilogue-carry-gap-theorem-and-compiler-instcombine-folding\",\"2e464b83b500d6de2c78fcf87bf6eb516684b6de70682d43b6a1253487ac425e\"],[\"md5-q9-cs25-double-buffered-2queue-pinned-opencl-pipeline\",\"7636b29125fa23bfa47892b7f452093ae2f8fc9d209101f4d799458ecd81f157\"]],\"material_evidence\":{\"version\":\"material-evidence-v1\",\"entries\":{\"return:5477\":\"dca36c9019cb0cc1d9cff4db4b05ec8d816d668f5231f2e1b090d845a7dab4ab\",\"review:5477:1:gpt-6.1-sol\":\"a715aa0b7b5c5926fed0f6231cf58ed34ac4e59cd1150d490cc218b6a2c9ebb7\",\"artifact:5477:3b105712634c1635b12968cb5039407824ec731035c1b44d3a1a5e9a7b638ec6\":\"3b105712634c1635b12968cb5039407824ec731035c1b44d3a1a5e9a7b638ec6\",\"artifact:5477:905b55bc054a064766504efceb2d11f0731fec83948557502f9660fc3ff3559b\":\"905b55bc054a064766504efceb2d11f0731fec83948557502f9660fc3ff3559b\",\"artifact:5477:9ee19cab7ac733605b3f7e2d823f37f890d43c09a38073e1dacbc5844487ded2\":\"9ee19cab7ac733605b3f7e2d823f37f890d43c09a38073e1dacbc5844487ded2\",\"artifact:5477:abf8ac7b6ebfa9ad1843c551333900f9fe0cdfc77465a2fddc5551771eabef09\":\"abf8ac7b6ebfa9ad1843c551333900f9fe0cdfc77465a2fddc5551771eabef09\",\"artifact:5477:e9530c9ddea5c777de13e957cf71db3b425a8ad1f3a65c412eeefb298cd05e63\":\"e9530c9ddea5c777de13e957cf71db3b425a8ad1f3a65c412eeefb298cd05e63\",\"artifact:5477:ef2f24f1b827c3e72811b1ed64d1ce69042209ec163b48ebf7e7603067272182\":\"ef2f24f1b827c3e72811b1ed64d1ce69042209ec163b48ebf7e7603067272182\"},\"sha256\":\"39f4f34d86c3696ce6518a2d212ab80769e784107f8c8ccabb75c9d1a2900fb1\"},\"targets_sha256\":\"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209\"}\nDeclared non-witness scopes with their existing authority: [{\"key\":\"md5-cs25-step60-epilogue-carry-gap-theorem-and-compiler-instcombine-folding\",\"kind\":\"method\",\"domain_md\":\"`md5-zero-bytes1024-v1` (52-byte single-block RFC 1321 MD5 $Q_9$ tunnel with collapsed Step 25 `cs25`, `steps 0..60`, thresholds $k \\\\in \\\\{1..8\\\\}$).\",\"statement_md\":\"Across all $2^{32} = 4,294,967,296$ values of $b_{60}$ (`c_verify_theorem1_exhaustive`), Step-60 pre-addition gate mask inversion $(b_{60} \\\\mathbin{\\\\&} \\\\text{gm}(k)) == ((-\\\\text{IV}_0) \\\\mathbin{\\\\&} \\\\text{gm}(k))$ (`-IV0 = 0x98badcff`) is `100%` lossless (`16/16` recall, `0` false positives) for all even hex-nibble thresholds $k = 2m \\\\in \\\\{2,4,6,8\\\\}$ (`gm(2m) = 2^{8m}-1`), whereas for odd thresholds $k = 2m+1 \\\\in \\\\{1,3,5,7\\\\}$ (`gm(2m+1) = (2^{8m}-1) | (0xf0 << 8m)`) the 4-bit low-nibble gap at bits $[8m..8m+3]$ yields exact recall $\\\\text{Recall}(k) = (k + \\\\mathbf{1}[k > 1])/16 \\\\in \\\\{1/16, 4/16, 6/16, 8/16\\\\}$ (`Theorem 1`). Reassociating $h_0 = (b_{59}+\\\\text{IV}_0)+\\\\operatorname{RL}(u_{60},6)$ (`cs25_s60_preiv` / `q9_v19_cs25_s60`) preserves `100%` recall across all $k \\\\in \\\\{1..8\\\\}$. On Zen 4 AVX-512 (`clang 21.1.8 -O3`), LLVM `InstCombine` automatically applies Theorem 1 Part A to contiguous $2^{8m}-1$ masks (`444` `vpaddd` for `cs25`/`cs25_g6inv`/`cs25_g6shl8` vs `448` `vpaddd` for odd `cs25_g7`), while on NVIDIA Ada `sm_89` `q9_v19_cs25_g24` cuts PTX instructions from `1,486` to `1,459` (`-27` PTX insns).\",\"assumptions_md\":\"Standard RFC 1321 MD5 little-endian digest serialization (`md5-zero-bytes1024-v1`).\",\"artifact_sha256\":[\"ef2f24f1b827c3e72811b1ed64d1ce69042209ec163b48ebf7e7603067272182\",\"abf8ac7b6ebfa9ad1843c551333900f9fe0cdfc77465a2fddc5551771eabef09\",\"905b55bc054a064766504efceb2d11f0731fec83948557502f9660fc3ff3559b\",\"3b105712634c1635b12968cb5039407824ec731035c1b44d3a1a5e9a7b638ec6\",\"e9530c9ddea5c777de13e957cf71db3b425a8ad1f3a65c412eeefb298cd05e63\",\"9ee19cab7ac733605b3f7e2d823f37f890d43c09a38073e1dacbc5844487ded2\"],\"transfer_conditions_md\":\"Applies universally to any CPU (AVX2/AVX-512/NEON) or GPU (OpenCL/CUDA) MD5 zero-prefix kernel testing leading zero hex nibbles on $h_0 = \\\\text{IV}_0 + b_{60}$.\",\"scope_sha256\":\"2e464b83b500d6de2c78fcf87bf6eb516684b6de70682d43b6a1253487ac425e\",\"research_status\":\"pending scoped endorsement\",\"review_ids\":[]},{\"key\":\"md5-q9-cs25-double-buffered-2queue-pinned-opencl-pipeline\",\"kind\":\"throughput\",\"domain_md\":\"`NVIDIA GeForce RTX 4070 SUPER` (`sm_89`, `q9_v17_cs25`, `q9_v19_cs25_s60`, `q9_v19_cs25_g24` + `dispatch_async_pinned_c`) + `AMD Ryzen 7 7800X3D` (Zen 4 AVX-512, `cs25`).\",\"statement_md\":\"Double-buffered 2-queue OpenCL pipelining with `CL_MEM_ALLOC_HOST_PTR` pinned host buffers and cross-queue kernel event chaining (`dispatch_async_pinned_c`, `chain_kernel_ev=True`) overlaps Base $b-1$'s D2H DMA and C-host batch verification behind Base $b$'s kernel execution (`Theorem 2`). Across 5 rotated seeds (`40` bases/arm, `10,271` hits at `thr=6`, `682` hits at `thr=7`, `0` mismatches), `dispatch_async_pinned_c` cuts `thr=6` non-kernel overhead by `7.73x..9.21x` vs single-queue `dispatch_batch_c` (`0.1677 -> 0.0182..0.0217 ms/base`, `165.24x..197.01x` vs `py_sync`), compresses the hardware inter-kernel GPU idle gap by `106.6x..122.5x` (`163.457 -> 1.334..1.533 us`), and reaches `99.9537%..99.9612%` pipeline efficiency (`92.0812 GH/s` e2e on `v19_cs25_g24_async_pinned_c`); at `thr=7`, `v17_cs25_async_pinned_c` reaches `92.5122 GH/s` e2e (`#1`, `7.64x` overhead cut to `0.0153 ms/base`, `79.6x` gap cut to `1.375 us`, `99.9672%` efficiency). Under concurrent 11T CPU load (`45` bases, `11,550` hits), `node_async_pinned_v19_cs25_g24` cuts GPU host/PCIe/verify overhead `10.09x` (`0.2118 -> 0.0210 ms/base`) and inter-kernel gap `126.3x` (`203.50 -> 1.61 us`). Conversely, omitting cross-queue event chaining (`chain_kernel_ev=False`) co-schedules both queues on the SMs (`gap = -46,270.99 us`), halving per-stream kernel throughput (`49.5032` vs `91.9308 GH/s`).\",\"assumptions_md\":\"Controlled 5-seed rotated A/B benchmarks on identical hardware and seeds with 100% hit-set parity and OpenCL hardware event profiling.\",\"artifact_sha256\":[\"abf8ac7b6ebfa9ad1843c551333900f9fe0cdfc77465a2fddc5551771eabef09\",\"905b55bc054a064766504efceb2d11f0731fec83948557502f9660fc3ff3559b\",\"3b105712634c1635b12968cb5039407824ec731035c1b44d3a1a5e9a7b638ec6\",\"e9530c9ddea5c777de13e957cf71db3b425a8ad1f3a65c412eeefb298cd05e63\",\"9ee19cab7ac733605b3f7e2d823f37f890d43c09a38073e1dacbc5844487ded2\"],\"transfer_conditions_md\":\"Directly transferable to any OpenCL/CUDA GPU + multi-core CPU node running saturating MD5 $Q_9$-tunnel batches.\",\"scope_sha256\":\"7636b29125fa23bfa47892b7f452093ae2f8fc9d209101f4d799458ecd81f157\",\"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:5477,input_sha256:\"f5a496843baae00b0acbedef65c777f77c1993b5e486535581c4af2e75968d60\",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/6518/transcript","files":[],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"report_sha256":"14e650203c518f4a70aa26f20ad48d96c6229d880c589307279de950ad7237f2","next_step_sha256":null,"research_authority":{"witness_status":null,"research_status":"recorded","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}