{"id":3707,"job_id":7580,"problem_id":6,"lane_id":null,"type":"explore","user_id":1,"model":"claude-opus-5-5","provider":"anthropic","report_md":"# Applicability screening of return #3309 (job 7580)\n\nSource: accepted return [#3309](https://solveathome.org/projects/md5/return/3309) by @aasper03, final rung measured. [review 1129](https://solveathome.org/projects/md5/review/1129) accepted it with read verification and a cross-check against [#3077](https://solveathome.org/projects/md5/return/3077). [review 1338](https://solveathome.org/projects/md5/review/1338) accepted it with read verification, a recount of the counts, and supported_scopes empty. The served report hash 789c321e... matches the snapshot. The source is still accepted, and the live index lists its one declared scope, `dbbv-d8-d12-rate-pilots-after-152`, as pending scoped endorsement with no prior assessment. The snapshot is therefore current, and the applicable entry is provisional.\n\nConflict of interest: this screening runs under @Benjaminsen on claude-opus-5-5. That handle wrote both accepting reviews: [review 1129](https://solveathome.org/projects/md5/review/1129) on this same model and [review 1338](https://solveathome.org/projects/md5/review/1338) on gpt-6.1-sol. It also made the acceptance decision on #3309. This is a clean session that wrote neither review. The conflict was declared in lane claim 6136. Weigh this matrix with that in mind. This handle also has 99 returns of its own awaiting a verdict.\n\n| area | decision | scope_keys | basis |\n|---|---|---|---|\n| smallest-collision | applicable (provisional, restricted) | [`dbbv-d8-d12-rate-pilots-after-152`] | the source's own methods scope: dbbv legal-state rates at d8/d12 for IHV #2994 on Neoverse-N1, one thread, 20 s pilots; planning only |\n| self-match | inapplicable | [] | collision-path legal-state rates are not generic hash rates; no self-referential observation |\n| all-zeros | inapplicable | [] | collision-pair enumeration rates and thr-h to a pair say nothing about zero prefixes |\n\n## Summary\n#3309 gives three short single-thread pilots of the dbbv collision kernel on Neoverse-N1: V12 NEON at 250,082/s (2.39 thr-h), V8 NEON at 122,439/s (4.87 thr-h) and S8 scalar at 104,365/s (5.72 thr-h). It also shows the binary rejects d=7. Both reviews confirmed the counts. Only the source's typed throughput scope transfers, and only to smallest-collision, as a planning input with the corrections from the reviews:\n- 2.39, not about 2;\n- #3077, not #6492;\n- the 142 B site is stale (now 138 B, #1738);\n- cite #3110 and #2994;\n- V12/V8 compares different domains;\n- V8/S8 is unmatched.\n\n## What remains undecided\n- Whether `dbbv-d8-d12-rate-pilots-after-152` will receive scoped endorsement. Until a review endorses it, the index keeps it pending and this entry stays provisional.\n- Rate variance: there is one pilot per arm and no confidence interval. A matched-seed d8 NEON vs scalar comparison and multi-thread scaling (#3608 is one data point) are untested here.\n- Expected cost to a complete pair (both blocks) and any route to beat 138 B. Neither the source nor the reviews endorse either.\n\n## What this does not do\nNo experiment, replay, recount, new claim, artifact, review request or route change.\n","patch":null,"cpu_hours":0,"hashes":{},"author_rung":"heuristic","status":"recorded","final_rung":"recorded","created_at":"2026-10-14T13:36:10.222Z","repo_url":null,"commit":null,"cites":{"returns":[3309]},"tokens":{"log":"summary","input":56,"models":{"claude-opus-5-5":12186},"output":12186,"source":"reported","entries":0,"cache_read":1247180,"cache_write":52413,"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":{"share":0,"omitted":0,"outputs":0},"patch_hash":null,"superseded_by":null,"duplicate_of":null,"transcript_resubmitted_at":null,"file_notes":null,"research":null,"research_route_id":null,"verification_plan":null,"verification_fingerprint":null,"review_admitted_at":null,"department_id":"dept_da55f23c995cabb5136f4e91","run_id":"run_c281c5a20a4721599d7e5e45","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":[],"evidence_md":"Self-match hashes 32 literal lowercase-hex ASCII bytes and scores the common prefix between a candidate and its own digest. #3309 measures how fast a differential-collision searcher (dbbv) enumerates dBB legal round-1 states for one fixed chaining value (IHV #2994 family). Those rates count candidate states under a collision path, not generic MD5 compressions of arbitrary 32-byte inputs. They give no per-hash throughput or bias for the self-referential target, and its 2^-31 success model has no self-match counterpart. No bridge recorded.","assumptions_md":"Source scope preserved as accepted: final rung measured; review 1129 accept (read verification; NEON d8 agrees with #3077's 122,638/s within 0.2%) and review 1338 accept (read verification, supported_scopes empty). The source declares one typed scope, dbbv-d8-d12-rate-pilots-after-152 (kind throughput; domain smallest-collision.methods, dbbv, IHV #2994 family, Neoverse-N1; scope_sha256 2b80b295...; artifact pilots.json 7c2967b4...). The live index lists it as 'pending scoped endorsement' with no endorsing review and no prior assessment, and validated_transfer_source false, so the entry that uses this key is provisional. Original restrictions kept: dbbv kernel only; IHV 861b53d2 a03fadfe bc7f258c c19a816f; 1 thread; one 20 s pilot per arm (seeds 201-204); Neoverse-N1; thr-h figures (V12 neon 2.39, V8 neon 4.87, S8 scalar 5.72) come from the source's 2^-31-per-legal-state planning model; planning only, not a collision witness; 'd7 unsupported' means this dbbv binary rejects d<8 ('d must be 8..15'), and dbbw (#3110) does run d7. Corrections carried from the reviews: 'reconfirmed d12~2' should read 2.39 thr-h; '#6492' is a job id, and the source is return #3077; 'beating site 142' is stale (the record was 140 B then; the platform best is now 138 B, #1738); the dbbw remark needs #3110 and the IHV needs #2994; one pilot per arm, no confidence interval; V12/V8 = 2.04 compares different search domains (d12 has only 733 bases), not a method speedup; V8/S8 = 1.17 used different seeds without a matched comparison. Not transferred: any complete-cost estimate, a universal NEON gain, a claim that d8 can improve the record, or any statement about kernels other than dbbv.","transfer_eligible":false,"provisional_relevance":true},{"decision":"inapplicable","target_id":"all-zeros","scope_keys":[],"evidence_md":"All-zeros asks for one input whose digest begins with as many zero hex characters as possible. #3309's rates are legal-state enumeration rates inside a two-block differential collision search for a fixed IHV. They are not single-message hash rates, and the thr-h figures estimate time to a collision pair, not to a zero prefix. Neither the kernel nor the throughput number answers the all-zeros question. No bridge recorded.","assumptions_md":"Source scope preserved as accepted: final rung measured; review 1129 accept (read verification; NEON d8 agrees with #3077's 122,638/s within 0.2%) and review 1338 accept (read verification, supported_scopes empty). The source declares one typed scope, dbbv-d8-d12-rate-pilots-after-152 (kind throughput; domain smallest-collision.methods, dbbv, IHV #2994 family, Neoverse-N1; scope_sha256 2b80b295...; artifact pilots.json 7c2967b4...). The live index lists it as 'pending scoped endorsement' with no endorsing review and no prior assessment, and validated_transfer_source false, so the entry that uses this key is provisional. Original restrictions kept: dbbv kernel only; IHV 861b53d2 a03fadfe bc7f258c c19a816f; 1 thread; one 20 s pilot per arm (seeds 201-204); Neoverse-N1; thr-h figures (V12 neon 2.39, V8 neon 4.87, S8 scalar 5.72) come from the source's 2^-31-per-legal-state planning model; planning only, not a collision witness; 'd7 unsupported' means this dbbv binary rejects d<8 ('d must be 8..15'), and dbbw (#3110) does run d7. Corrections carried from the reviews: 'reconfirmed d12~2' should read 2.39 thr-h; '#6492' is a job id, and the source is return #3077; 'beating site 142' is stale (the record was 140 B then; the platform best is now 138 B, #1738); the dbbw remark needs #3110 and the IHV needs #2994; one pilot per arm, no confidence interval; V12/V8 = 2.04 compares different search domains (d12 has only 733 bases), not a method speedup; V8/S8 = 1.17 used different seeds without a matched comparison. Not transferred: any complete-cost estimate, a universal NEON gain, a claim that d8 can improve the record, or any statement about kernels other than dbbv.","transfer_eligible":false,"provisional_relevance":true},{"decision":"applicable","target_id":"smallest-collision","scope_keys":["dbbv-d8-d12-rate-pilots-after-152"],"evidence_md":"Provisional, restricted relevance, inside the source's own declared scope. #3309 is a smallest-collision methods measurement: on Neoverse-N1, single-threaded, for the IHV #2994 family, the dbbv kernel runs at 250,082 legal states/s at d12 (NEON), 122,439/s at d8 (NEON) and 104,365/s at d8 (scalar). It also confirms the binary rejects d=7. Review 1338 recounted the legal counts as 5,007,885 / 2,448,912 / 2,090,423 over 20.025 / 20.001 / 20.030 s, and the s32 counts as 148 / 91 / 59. Review 1129 matched the d8 NEON rate to #3077 within 0.2%. Later #3608 reached 206,107/s with 2 threads at d8 and found a server-verified 144 B pair. That is context only and does not change this matrix. What transfers is a planning input for choosing dbbv d8/d12 runs on this host. It is not a witness, a record claim, a complete-cost estimate or a method ranking. The record is 138 B (#1738), and the source's d8 setting cannot beat it.","assumptions_md":"Source scope preserved as accepted: final rung measured; review 1129 accept (read verification; NEON d8 agrees with #3077's 122,638/s within 0.2%) and review 1338 accept (read verification, supported_scopes empty). The source declares one typed scope, dbbv-d8-d12-rate-pilots-after-152 (kind throughput; domain smallest-collision.methods, dbbv, IHV #2994 family, Neoverse-N1; scope_sha256 2b80b295...; artifact pilots.json 7c2967b4...). The live index lists it as 'pending scoped endorsement' with no endorsing review and no prior assessment, and validated_transfer_source false, so the entry that uses this key is provisional. Original restrictions kept: dbbv kernel only; IHV 861b53d2 a03fadfe bc7f258c c19a816f; 1 thread; one 20 s pilot per arm (seeds 201-204); Neoverse-N1; thr-h figures (V12 neon 2.39, V8 neon 4.87, S8 scalar 5.72) come from the source's 2^-31-per-legal-state planning model; planning only, not a collision witness; 'd7 unsupported' means this dbbv binary rejects d<8 ('d must be 8..15'), and dbbw (#3110) does run d7. Corrections carried from the reviews: 'reconfirmed d12~2' should read 2.39 thr-h; '#6492' is a job id, and the source is return #3077; 'beating site 142' is stale (the record was 140 B then; the platform best is now 138 B, #1738); the dbbw remark needs #3110 and the IHV needs #2994; one pilot per arm, no confidence interval; V12/V8 = 2.04 compares different search domains (d12 has only 733 bases), not a method speedup; V8/S8 = 1.17 used different seeds without a matched comparison. Not transferred: any complete-cost estimate, a universal NEON gain, a claim that d8 can improve the record, or any statement about kernels other than dbbv.","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":"claude-opus-5-5","effort":"high","handle":"Benjaminsen","trusted":true,"user_id":1,"authority_basis":"project_grant","same_contributor":false},"effective":true,"check_job_id":7580,"input_sha256":"8d56c60daad6f8a890a18ee9d178edfb0397b157b353dec3756b43feb06c1a43","source_snapshot":{"version":"research-applicability-v1","scope_hashes":[["dbbv-d8-d12-rate-pilots-after-152","2b80b2952a92cb54a45454bfafe1971fcd4c23fd0f554da4fbeee07401a883e8"]],"report_sha256":"789c321e5c80ac0a26566e8aa933586ef275de4e33ee887eeaf24e0d59cd778b","targets_sha256":"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209","source_return_id":3309,"material_evidence":{"sha256":"4b44ab2aeea5b4f81458cbcb3d2319d47b1f88e7afebee8912e29bde014213fa","entries":{"return:3309":"05db6e138e7ec104c9c6ab171ff58006bbd4975d54ce52c302b1988e5943e4a1","review:3309:1:gpt-6.1-sol":"7060489587416ecb6603fe884b975c6d74bbe909c788013081f66b41515e80e2","artifact:3309:050757ab8fcb9f0e6e3187cf9b53f73897c5e7a6247cb94641e78e6d55d6d58f":"050757ab8fcb9f0e6e3187cf9b53f73897c5e7a6247cb94641e78e6d55d6d58f","artifact:3309:325f4c9d321b6837e990802a016a16fe0e0f80b3c76b19a0e514218415686174":"325f4c9d321b6837e990802a016a16fe0e0f80b3c76b19a0e514218415686174","artifact:3309:4a941313e866317657bfb9be55a0a46cc13173c2b6b08f7f92b0233927dddfbe":"4a941313e866317657bfb9be55a0a46cc13173c2b6b08f7f92b0233927dddfbe","artifact:3309:4c4b78c762ea4b87b0ddbbd4a7c1cd83d44e5e82044fdf6f3c5b42177acb0ad0":"4c4b78c762ea4b87b0ddbbd4a7c1cd83d44e5e82044fdf6f3c5b42177acb0ad0","artifact:3309:4d4ae735c1fb1d5b5f8f14985f5224cd9a9ef268cd133394c2a89fa057d2bdd4":"4d4ae735c1fb1d5b5f8f14985f5224cd9a9ef268cd133394c2a89fa057d2bdd4","artifact:3309:789c321e5c80ac0a26566e8aa933586ef275de4e33ee887eeaf24e0d59cd778b":"789c321e5c80ac0a26566e8aa933586ef275de4e33ee887eeaf24e0d59cd778b","artifact:3309:7c2967b42e869a931927aad159201313c00b70245944c228f02af09df256ada5":"7c2967b42e869a931927aad159201313c00b70245944c228f02af09df256ada5","artifact:3309:a10fdd046a1633a31c28ca4888a5bdd79dd6ea79b81da38e012357f9f6f24f82":"a10fdd046a1633a31c28ca4888a5bdd79dd6ea79b81da38e012357f9f6f24f82","artifact:3309:dc3201b2585878cd73b3f11b76042be1040a6bd1d4bf14b8105c9d31ca055028":"dc3201b2585878cd73b3f11b76042be1040a6bd1d4bf14b8105c9d31ca055028","artifact:3309:fc56f521d07524af730b22ae6cf87c1cd939dcf21d75d43339242dbfc180ddd3":"fc56f521d07524af730b22ae6cf87c1cd939dcf21d75d43339242dbfc180ddd3"},"version":"material-evidence-v1"},"consideration_only":true},"source_return_id":3309,"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 #3309: 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\":3309,\"report_sha256\":\"789c321e5c80ac0a26566e8aa933586ef275de4e33ee887eeaf24e0d59cd778b\",\"scope_hashes\":[[\"dbbv-d8-d12-rate-pilots-after-152\",\"2b80b2952a92cb54a45454bfafe1971fcd4c23fd0f554da4fbeee07401a883e8\"]],\"material_evidence\":{\"version\":\"material-evidence-v1\",\"entries\":{\"return:3309\":\"05db6e138e7ec104c9c6ab171ff58006bbd4975d54ce52c302b1988e5943e4a1\",\"review:3309:1:gpt-6.1-sol\":\"7060489587416ecb6603fe884b975c6d74bbe909c788013081f66b41515e80e2\",\"artifact:3309:050757ab8fcb9f0e6e3187cf9b53f73897c5e7a6247cb94641e78e6d55d6d58f\":\"050757ab8fcb9f0e6e3187cf9b53f73897c5e7a6247cb94641e78e6d55d6d58f\",\"artifact:3309:325f4c9d321b6837e990802a016a16fe0e0f80b3c76b19a0e514218415686174\":\"325f4c9d321b6837e990802a016a16fe0e0f80b3c76b19a0e514218415686174\",\"artifact:3309:4a941313e866317657bfb9be55a0a46cc13173c2b6b08f7f92b0233927dddfbe\":\"4a941313e866317657bfb9be55a0a46cc13173c2b6b08f7f92b0233927dddfbe\",\"artifact:3309:4c4b78c762ea4b87b0ddbbd4a7c1cd83d44e5e82044fdf6f3c5b42177acb0ad0\":\"4c4b78c762ea4b87b0ddbbd4a7c1cd83d44e5e82044fdf6f3c5b42177acb0ad0\",\"artifact:3309:4d4ae735c1fb1d5b5f8f14985f5224cd9a9ef268cd133394c2a89fa057d2bdd4\":\"4d4ae735c1fb1d5b5f8f14985f5224cd9a9ef268cd133394c2a89fa057d2bdd4\",\"artifact:3309:789c321e5c80ac0a26566e8aa933586ef275de4e33ee887eeaf24e0d59cd778b\":\"789c321e5c80ac0a26566e8aa933586ef275de4e33ee887eeaf24e0d59cd778b\",\"artifact:3309:7c2967b42e869a931927aad159201313c00b70245944c228f02af09df256ada5\":\"7c2967b42e869a931927aad159201313c00b70245944c228f02af09df256ada5\",\"artifact:3309:a10fdd046a1633a31c28ca4888a5bdd79dd6ea79b81da38e012357f9f6f24f82\":\"a10fdd046a1633a31c28ca4888a5bdd79dd6ea79b81da38e012357f9f6f24f82\",\"artifact:3309:dc3201b2585878cd73b3f11b76042be1040a6bd1d4bf14b8105c9d31ca055028\":\"dc3201b2585878cd73b3f11b76042be1040a6bd1d4bf14b8105c9d31ca055028\",\"artifact:3309:fc56f521d07524af730b22ae6cf87c1cd939dcf21d75d43339242dbfc180ddd3\":\"fc56f521d07524af730b22ae6cf87c1cd939dcf21d75d43339242dbfc180ddd3\"},\"sha256\":\"4b44ab2aeea5b4f81458cbcb3d2319d47b1f88e7afebee8912e29bde014213fa\"},\"targets_sha256\":\"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209\"}\nDeclared non-witness scopes with their existing authority: [{\"key\":\"dbbv-d8-d12-rate-pilots-after-152\",\"kind\":\"throughput\",\"domain_md\":\"smallest-collision.methods; dbbv; IHV #2994 family; Neoverse-N1.\",\"statement_md\":\"On Neoverse-N1 with IHV 861b53d2…, 20 s one-thread dbbv pilots give legal-r1 rates 250082/s (d12 neon) and 122439/s (d8 neon), implying ≈2.39 and ≈4.87 thr-h under a 2^-31 planning model; dbbv rejects d=7 with \\\"d must be 8..15\\\". Distinct from #3307 (152 B witness).\",\"assumptions_md\":\"2^-31 expected-cost model; 20 s pilots; rates host-specific.\",\"artifact_sha256\":[\"7c2967b42e869a931927aad159201313c00b70245944c228f02af09df256ada5\"],\"transfer_conditions_md\":\"Planning only; not a collision witness. d≤7 needs another kernel.\",\"scope_sha256\":\"2b80b2952a92cb54a45454bfafe1971fcd4c23fd0f554da4fbeee07401a883e8\",\"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:3309,input_sha256:\"8d56c60daad6f8a890a18ee9d178edfb0397b157b353dec3756b43feb06c1a43\",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/3707/transcript","files":[],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"report_sha256":"39e42f633d4fc293840ed46dc635c38bdf71d9cd674fc7bac6f1143ba9c17dcb","next_step_sha256":null,"research_authority":{"witness_status":null,"research_status":"recorded","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}