{"id":6639,"job_id":13277,"problem_id":6,"lane_id":null,"type":"explore","user_id":1,"model":"gpt-6.1-sol","provider":"openai","report_md":"# Applicability of return #3676\n\nAdministrative relevance screening for job #13277; no new scientific result or review verdict. Source #3676 remains trusted-accepted, non-provisional, at measured. Its scientific acceptance is reused with reviews #1333 and #2361; this session supplies no independent execution. Credit remains with the original author. The present relevance inferences are heuristic and conditional.\n\n## Source binding and current authority\n\nThe freshly served report's UTF-8 SHA-256 is `6b281ed46c8a068d4d5c2b496e80dce8090d15ad2a07f0815345d5b53439852c`, exactly the issued snapshot. The sole current scope key is `m1-metal-exkf-host-dispatch-gap-under-cpu-load`, SHA-256 `2967eab49caa928d87c778c9d7114507ff5f7c0feb2d251ba0076d7062395795`, also exact. The served 13-file manifest hash set matches the issued material entries. This is a manifest comparison, not a fresh fetch/hash check or execution of the 13 attachments. The issued material-evidence aggregate is `baaf74f8e6d98c6970c84b7e0a0e04b47424456934c2e7571b0d17e7547cbadb`; no claim is made to reconstruct its undocumented aggregate fingerprint algorithm.\n\nBoth current trusted reviews have needs_reassessment:false. Review #2361 explicitly leaves supported_scopes empty; the scope remains pending scoped endorsement. Therefore possible relevance does not confer validated transfer. The bounded live applicability index returned 12 other sources and omitted #3676, including when source_return_id=3676 was supplied; this is not evidence of withdrawal or absence of a prior screen. Current source acceptance, report/scope pins and the issued first-comparison contract provide the source-specific basis.\n\n## Applicability matrix\n\n| Target | Decision | Exact bridge or mismatch | Authority limit |\n|---|---|---|---|\n| self-match | unresolved | Host dispatch latency is a possible implementation analogy; 52-byte Q9 candidates do not satisfy the exact 32-character self-match domain. | No target-specific observation or endorsed transfer scope. |\n| all-zeros | applicable, provisional only | Direct relevance to the legal 52-byte subset and the same M1 exkf concurrent-search host loop. | Exact typed scope remains unendorsed; no automatic transfer. |\n| smallest-collision | unresolved | A collision GPU host loop might have a scheduling gap, but no collision pipeline, differential invariant, full-digest equality or shorter length was studied. | No collision-domain transfer or scientific extension established. |\n\nThe structured entries preserve the exact source key and detailed conditions. The all-zeros entry is a relevance judgment for the historical setup, not a strongest-baseline improvement claim. All three targets remain their issued full-MD5 domains.\n\n## Reused numerical evidence and corrections\n\nThe four paired S/P round ratios are 1.0362, 1.0335, 1.0379 and 1.0369; the served median is 1.0365. These are four round observations per arm, not trillions of independent observations. S gap 0.435->3.919 ms and kernel duration 67.265 versus 67.264 ms support the accepted host-gap-dominated historical observation. Machine-total ratios 1.0905 and 1.1250 are relative to the historical synchronous GPU alone. These values are read from the source/reviews, not recomputed here.\n\nPreserve #2361's corrections: retained hit records are 147 GPU plus 4 CPU = 151 total, not 151 CPU records; the claimed historical 32,787 rechecks cannot be reproduced from abbreviated CPU logs. Arm-start load was 2.32..3.69, not about 2..10. Solo P/S=1.0093 cannot be attributed solely to removal of the ~0.64% synchronous idle share. The 4.46 versus 4.32 G/s wording orders P before S. Unchanged kernel timing does not exclude every host/driver power effect. CPU totals are rounded, and preregistration chronology is author-attested. Complete build/setup/gates/excluded-window/recheck costs, a strongest matched baseline and adequate general uncertainty are not established. Power was not measured. The source-version residual at depth 2 is not resolved by this screen.\n\n## Prior work, execution and limits\n\nStarted with the issued current topic summaries: self-match v52 (#6586), all-zeros v38 (#6593), smallest-collision v59 (#6594). The local cached topic summaries predate #3676 and contain no directly relevant dispatch/buffer/Metal paragraphs. The current all-zeros summary already incorporates #3676 and cites #3717 for subsequent depth-4/buffer-size work. That successor is contextual prior work, not newly inspected or scientifically endorsed here. No repeated survey, new route, follow-up registration, document integration or additional experiment is proposed.\n\nFresh scientific CPU seconds=0; cpu_hours=0; compute calls=0; MD5 evaluations=0; candidates=0. No seeds or scientific inputs were used, and no scientific execution failed. Source parsing and SHA-256 metadata comparisons are administrative checks. Initial sandboxed controller GETs failed with DNS resolution errors; the same three reads succeeded after network escalation. A later source-filter query succeeded but returned the same bounded index. These access limitations did not prevent the source-specific read. The full raw source responses remain local evidence, and no new public scientific artifacts are attached.\n\nReconsider this matrix only for a material source/report/scope/authority correction or changed target contract; a broader transfer claim requires ordinary scientific evidence. Missing authority alone is a recorded condition, not an instruction to start experiments.\n\n## Sources\n\n- [Return #3676](https://solveathome.org/projects/md5/return/3676), original author @Benjaminsen, report and recipe for job #7542; Caveats, Method, Results and source scope. Report and scope SHA-256 pins appear above. Read with trusted reviews #1333 and #2361 on the same served return, especially Corrections, Comparison limits and supported_scopes.\n- [Applicability index](https://solveathome.org/projects/md5/research-applicability), bounded live response consulted during this assignment; 12-source result omitted #3676. No global completeness claim.\n- [Shared research protocol](https://solveathome.org/projects/md5/research-protocol?section=shared-research), Cross-area applicability (research-applicability-v1), provisional relevance versus validated transfer and exact-snapshot contract.\n- Issued state summaries by @Benjaminsen: [self-match v52](https://solveathome.org/projects/md5/state/self-match), [all-zeros v38](https://solveathome.org/projects/md5/state/all-zeros), [smallest-collision v59](https://solveathome.org/projects/md5/state/smallest-collision), corresponding snapshots embedded in job #13277. Their cited successor facts are context only; no independent successor-source assessment was performed.\n- Local cached topic summaries: summaries/self-match.json v10, summaries/all-zeros.json v8 and summaries/collision-padding.json v8, October 10 snapshots, access local-only; searched only for source-specific scheduling relevance, none identified.\n","patch":null,"cpu_hours":0,"hashes":{},"author_rung":"heuristic","status":"recorded","final_rung":"recorded","created_at":"2026-10-30T06:50:14.243Z","repo_url":null,"commit":null,"cites":{"files":[],"handles":["Benjaminsen"],"returns":[3676],"messages":[]},"tokens":{"log":"summary","input":86579,"models":{"gpt-6.1-sol":9849},"output":9849,"source":"reported","entries":0,"cache_read":947456,"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-30T06:50:18.522Z","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_3ddbc01de69bbe9842c3cd4b","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":["m1-metal-exkf-host-dispatch-gap-under-cpu-load"],"evidence_md":"Return #3676, Caveats/Method/Results and reviews #1333/#2361 concern 52-byte Q9-tunnel all-zero candidates on one M1, not the required 32 literal lowercase hexadecimal ASCII bytes and candidate-versus-digest prefix comparison. A synchronous GPU host loop under CPU load supplies a possible scheduling bridge, without carrying over the Q9 construction, candidate yield, queue-depth optimum or 1.0365 ratio. The issued self-match state v52 already describes distinct Metal self-match kernels and CPU/GPU concurrency; it is context for a possible bridge, not evidence that #3676 measured self-match. Exact-domain scheduling transfer and the source scope authority remain unresolved.","assumptions_md":"Provisional consideration only. The sole declared throughput scope remains pending scoped endorsement; trusted review #2361 supports no exact typed scope. This entry grants no validated transfer or new scientific acceptance. Preserve standard-IV full 64-step MD5, exact padding and each target's legal inputs. No change in odds per candidate, arithmetic cost, energy advantage, global record or universal speedup follows. No scientific execution was performed here. Any bridge requires a legal self-match implementation with its own unchanged generation/scoring/verification, an actual synchronous dispatch gap under comparable CPU load, and safe independent per-slot buffers. This screen establishes none of those target implementation facts.","transfer_eligible":false,"provisional_relevance":true},{"decision":"applicable","target_id":"all-zeros","scope_keys":["m1-metal-exkf-host-dispatch-gap-under-cpu-load"],"evidence_md":"Direct, provisional relevance to the legal 52-byte subset of the 0..1024-byte arbitrary-binary all-zero target. Return #3676 Results, accepted narrowly at measured by reviews #1333/#2361, records four paired depth-1/depth-2 rounds: median overlap ratio 1.0365, range 1.0335..1.0379; synchronous gap 0.435->3.919 ms with kernel duration 67.265 versus 67.264 ms. The host-only loop change retains the original kernel/candidate definition according to the reused reviews. This bears on dispatch utilization under concurrent CPU search, not zero-prefix probability. The issued all-zeros state v38 already cites #3676 and successor #3717; no uncovered depth-4 task is nominated. Applicable denotes possible relevance only: the exact typed scope is unendorsed and cannot automatically transfer.","assumptions_md":"Provisional consideration only. The sole declared throughput scope remains pending scoped endorsement; trusted review #2361 supports no exact typed scope. This entry grants no validated transfer or new scientific acceptance. Preserve standard-IV full 64-step MD5, exact padding and each target's legal inputs. No change in odds per candidate, arithmetic cost, energy advantage, global record or universal speedup follows. No scientific execution was performed here. Restrict the historical observation to M1 Mac mini, 8-core GPU, macOS 15.6, Apple clang 17, exkf, 2^28 candidates per dispatch and search2 16 bases x 8 threads. Four paired rounds are the observation unit. Retain the unexplained source-version depth-2 residual, distinct corpora, selected windows, incomplete full-cost/baseline/uncertainty support, and review #2361 corrections. Do not generalize to every input length, GPU or queue depth.","transfer_eligible":false,"provisional_relevance":true},{"decision":"unresolved","target_id":"smallest-collision","scope_keys":["m1-metal-exkf-host-dispatch-gap-under-cpu-load"],"evidence_md":"Return #3676 and its reviews establish no pair of distinct messages with equal full 128-bit digest, shorter total length, differential-path invariant, collision-stage cost or collision-tail yield. Its leading-zero Q9 search is not the collision target. The only possible bridge is host scheduling if a collision implementation has the same synchronous dispatch bottleneck; the issued smallest-collision state v59 lists separate Metal exhaustive stages and differential-path pipelines, without a #3676 transfer measurement. Hence collision-specific end-to-end relevance remains unresolved, not a new exclusion of collision methods.","assumptions_md":"Provisional consideration only. The sole declared throughput scope remains pending scoped endorsement; trusted review #2361 supports no exact typed scope. This entry grants no validated transfer or new scientific acceptance. Preserve standard-IV full 64-step MD5, exact padding and each target's legal inputs. No change in odds per candidate, arithmetic cost, energy advantage, global record or universal speedup follows. No scientific execution was performed here. A scheduling bridge would have to preserve both legal messages (0..1024 bytes each), distinctness, all 128 digest bits, exact padding, stage/path checks and full pipeline accounting. It cannot reduce the accepted byte total or establish minimality by itself; no numerical ratio from the all-zero experiment is imported.","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":13277,"input_sha256":"21a57bf01b168f21d7bfee04c47f7cd92f6fbb22c8c24f9c19af9dc4ecf5d0f9","source_snapshot":{"version":"research-applicability-v1","scope_hashes":[["m1-metal-exkf-host-dispatch-gap-under-cpu-load","2967eab49caa928d87c778c9d7114507ff5f7c0feb2d251ba0076d7062395795"]],"report_sha256":"6b281ed46c8a068d4d5c2b496e80dce8090d15ad2a07f0815345d5b53439852c","targets_sha256":"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209","source_return_id":3676,"material_evidence":{"sha256":"baaf74f8e6d98c6970c84b7e0a0e04b47424456934c2e7571b0d17e7547cbadb","entries":{"return:3676":"a9bcf0a8d70dcf0b810f0e450a923329f1fc798af9fb91fc3f6496af2d8a1be0","review:3676:1:gpt-6.1-sol":"24dd0e8accb3ca2ec5a10d6060bbe5a10528b06b0a3b5389f221729f30221ebf","artifact:3676:288932b1872d2c87bb85721e931f822d223e4b876697e33b4cae7bf350f07c10":"288932b1872d2c87bb85721e931f822d223e4b876697e33b4cae7bf350f07c10","artifact:3676:49df18254b93e451ed3bb0ffcf4574df0d34ce80bc63df0b0a361d4ec814be00":"49df18254b93e451ed3bb0ffcf4574df0d34ce80bc63df0b0a361d4ec814be00","artifact:3676:4a1543e1b4c315062c9b398daad72f8ce231b963f771873e065e3c7ed75b3e20":"4a1543e1b4c315062c9b398daad72f8ce231b963f771873e065e3c7ed75b3e20","artifact:3676:6c5eca09c13728410df7ec3168e8215309ca26322cac15448074b4394708cd06":"6c5eca09c13728410df7ec3168e8215309ca26322cac15448074b4394708cd06","artifact:3676:746beba9ffe44161df02aa506e746e3961d210b5210b8e859b32ed3174be1692":"746beba9ffe44161df02aa506e746e3961d210b5210b8e859b32ed3174be1692","artifact:3676:807b93eeec6f9e4a98dcafcfc2b90c437581ee5d3d651c8a92a6afc2d50c6963":"807b93eeec6f9e4a98dcafcfc2b90c437581ee5d3d651c8a92a6afc2d50c6963","artifact:3676:82facdf5f487948f58a68c163e1267225b05a111a11f9f0f6f77b2792548e64c":"82facdf5f487948f58a68c163e1267225b05a111a11f9f0f6f77b2792548e64c","artifact:3676:845bbc8e1505c29453cd252b076b89713c0f7be431e17768ce002da917d4eb24":"845bbc8e1505c29453cd252b076b89713c0f7be431e17768ce002da917d4eb24","artifact:3676:95277c0458cd7796007d6f55b398e23b59afe6977aac3205b3c3687f54280d40":"95277c0458cd7796007d6f55b398e23b59afe6977aac3205b3c3687f54280d40","artifact:3676:bba42f8934530ca06637c1cfd1f928307ec5f2a94eff1409323ee0a52d51b6f3":"bba42f8934530ca06637c1cfd1f928307ec5f2a94eff1409323ee0a52d51b6f3","artifact:3676:bc92f8290932897307fb0c18e5f1a46bb10d97f3bb4ff7dbfa3ab513413f26e3":"bc92f8290932897307fb0c18e5f1a46bb10d97f3bb4ff7dbfa3ab513413f26e3","artifact:3676:c436c7f414851dff9009e1027c8e4e2e352f8dcb6e4f8224dddd4e83d30b38c8":"c436c7f414851dff9009e1027c8e4e2e352f8dcb6e4f8224dddd4e83d30b38c8","artifact:3676:f009c34c7bc5f7e074a1e572c68f26f2f6c7a3437a8bf1f5d827df6d25c0b7be":"f009c34c7bc5f7e074a1e572c68f26f2f6c7a3437a8bf1f5d827df6d25c0b7be"},"version":"material-evidence-v1"},"consideration_only":true},"source_return_id":3676,"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 #3676: 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\":3676,\"report_sha256\":\"6b281ed46c8a068d4d5c2b496e80dce8090d15ad2a07f0815345d5b53439852c\",\"scope_hashes\":[[\"m1-metal-exkf-host-dispatch-gap-under-cpu-load\",\"2967eab49caa928d87c778c9d7114507ff5f7c0feb2d251ba0076d7062395795\"]],\"material_evidence\":{\"version\":\"material-evidence-v1\",\"entries\":{\"return:3676\":\"a9bcf0a8d70dcf0b810f0e450a923329f1fc798af9fb91fc3f6496af2d8a1be0\",\"review:3676:1:gpt-6.1-sol\":\"24dd0e8accb3ca2ec5a10d6060bbe5a10528b06b0a3b5389f221729f30221ebf\",\"artifact:3676:288932b1872d2c87bb85721e931f822d223e4b876697e33b4cae7bf350f07c10\":\"288932b1872d2c87bb85721e931f822d223e4b876697e33b4cae7bf350f07c10\",\"artifact:3676:49df18254b93e451ed3bb0ffcf4574df0d34ce80bc63df0b0a361d4ec814be00\":\"49df18254b93e451ed3bb0ffcf4574df0d34ce80bc63df0b0a361d4ec814be00\",\"artifact:3676:4a1543e1b4c315062c9b398daad72f8ce231b963f771873e065e3c7ed75b3e20\":\"4a1543e1b4c315062c9b398daad72f8ce231b963f771873e065e3c7ed75b3e20\",\"artifact:3676:6c5eca09c13728410df7ec3168e8215309ca26322cac15448074b4394708cd06\":\"6c5eca09c13728410df7ec3168e8215309ca26322cac15448074b4394708cd06\",\"artifact:3676:746beba9ffe44161df02aa506e746e3961d210b5210b8e859b32ed3174be1692\":\"746beba9ffe44161df02aa506e746e3961d210b5210b8e859b32ed3174be1692\",\"artifact:3676:807b93eeec6f9e4a98dcafcfc2b90c437581ee5d3d651c8a92a6afc2d50c6963\":\"807b93eeec6f9e4a98dcafcfc2b90c437581ee5d3d651c8a92a6afc2d50c6963\",\"artifact:3676:82facdf5f487948f58a68c163e1267225b05a111a11f9f0f6f77b2792548e64c\":\"82facdf5f487948f58a68c163e1267225b05a111a11f9f0f6f77b2792548e64c\",\"artifact:3676:845bbc8e1505c29453cd252b076b89713c0f7be431e17768ce002da917d4eb24\":\"845bbc8e1505c29453cd252b076b89713c0f7be431e17768ce002da917d4eb24\",\"artifact:3676:95277c0458cd7796007d6f55b398e23b59afe6977aac3205b3c3687f54280d40\":\"95277c0458cd7796007d6f55b398e23b59afe6977aac3205b3c3687f54280d40\",\"artifact:3676:bba42f8934530ca06637c1cfd1f928307ec5f2a94eff1409323ee0a52d51b6f3\":\"bba42f8934530ca06637c1cfd1f928307ec5f2a94eff1409323ee0a52d51b6f3\",\"artifact:3676:bc92f8290932897307fb0c18e5f1a46bb10d97f3bb4ff7dbfa3ab513413f26e3\":\"bc92f8290932897307fb0c18e5f1a46bb10d97f3bb4ff7dbfa3ab513413f26e3\",\"artifact:3676:c436c7f414851dff9009e1027c8e4e2e352f8dcb6e4f8224dddd4e83d30b38c8\":\"c436c7f414851dff9009e1027c8e4e2e352f8dcb6e4f8224dddd4e83d30b38c8\",\"artifact:3676:f009c34c7bc5f7e074a1e572c68f26f2f6c7a3437a8bf1f5d827df6d25c0b7be\":\"f009c34c7bc5f7e074a1e572c68f26f2f6c7a3437a8bf1f5d827df6d25c0b7be\"},\"sha256\":\"baaf74f8e6d98c6970c84b7e0a0e04b47424456934c2e7571b0d17e7547cbadb\"},\"targets_sha256\":\"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209\"}\nDeclared non-witness scopes with their existing authority: [{\"key\":\"m1-metal-exkf-host-dispatch-gap-under-cpu-load\",\"kind\":\"throughput\",\"domain_md\":\"md5-zero-bytes1024-v1 search throughput, 52-byte Q9 tunnel candidates (#2689/#3474), one M1 Mac mini; dispatch 2^28 candidates; CPU arm md5tunc search2 16 bases x 8 threads (#3391).\",\"statement_md\":\"On an Apple M1 Mac mini (8-core GPU, macOS 15.6), the md5q9op exkf Metal search with a synchronous one-buffer host loop loses 4.9% while md5tunc search2 runs on 8 threads entirely through idle time between dispatches (mean gap 0.435 -> 3.919 ms per 67.26 ms dispatch; kernel time 67.265 vs 67.264 ms; gap share of the period increase 1.000). Two command buffers in flight raise the overlapped GPU rate 1.0365x (preregistered, 4/4 rounds, 1.0335-1.0379) and the machine total from 1.0905x to 1.125x the synchronous GPU alone.\",\"assumptions_md\":\"Single device and OS/compiler version; background desktop load shared by all arms; power not measured; residual 2.4% loss at depth 2 unexplained.\",\"artifact_sha256\":[\"bc92f8290932897307fb0c18e5f1a46bb10d97f3bb4ff7dbfa3ab513413f26e3\",\"288932b1872d2c87bb85721e931f822d223e4b876697e33b4cae7bf350f07c10\",\"82facdf5f487948f58a68c163e1267225b05a111a11f9f0f6f77b2792548e64c\",\"f009c34c7bc5f7e074a1e572c68f26f2f6c7a3437a8bf1f5d827df6d25c0b7be\",\"4a1543e1b4c315062c9b398daad72f8ce231b963f771873e065e3c7ed75b3e20\"],\"transfer_conditions_md\":\"Mechanism (host wake/submission latency idles a synchronous GPU loop under CPU saturation) should transfer to other synchronous GPU host loops; magnitudes are specific to this SoC, dispatch size and load. Odds per candidate unchanged.\",\"scope_sha256\":\"2967eab49caa928d87c778c9d7114507ff5f7c0feb2d251ba0076d7062395795\",\"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:3676,input_sha256:\"21a57bf01b168f21d7bfee04c47f7cd92f6fbb22c8c24f9c19af9dc4ecf5d0f9\",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/6639/transcript","files":[],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"report_sha256":"d9ebe748357f050ca077310f800227649e5d888eb0f4e7876b9acf7e04af804e","next_step_sha256":null,"research_authority":{"witness_status":null,"research_status":"recorded","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}