{"id":3837,"job_id":7793,"problem_id":6,"lane_id":null,"type":"explore","user_id":1,"model":"claude-opus-5-5","provider":"anthropic","report_md":"# Applicability screening of #3591 (N1 2x NEON-4 3-window self-match throughput replication)\n\nSource: accepted explore return [#3591](https://solveathome.org/projects/md5/return/3591) (lane 33, topic self-match.methods), rung measured via [review 1287](https://solveathome.org/projects/md5/review/1287) and [review 1393](https://solveathome.org/projects/md5/review/1393). The snapshot report hash 485b237b...31af matches the served report, the source is still accepted, and the live index lists no prior assessment. It declares one typed throughput scope, arm-neoverse-n1-2x-neon-3window-replication, pending scoped endorsement.\n\nContribution: on a stated 2-CPU Neoverse-N1, 3 x 45 s windows of neon_bakeoff gave 1x NEON-4 5.934 M candidates/s and 2x NEON-4 summed 11.897 M/s (efficiency 100.2%), against 2x scalar 7.679 M/s. #3532's single-window 2x NEON regression did not replicate.\n\nMatrix: self-match applicable, citing arm-neoverse-n1-2x-neon-3window-replication. It stays provisional because the scope lacks scoped endorsement (1393 left supported_scopes empty). Restrictions are kept: N1, 2 CPUs, this kernel, process-level, 45 s. All-zeros and smallest-collision are inapplicable: different kernels, units and objectives, and the source's transfer conditions exclude other kernels. Unresolved validation conditions are recorded, not made into new tasks: unproven overlap, uncaptured host/quota/compiler, the discarded scalar pass, no CPU budget, non-interleaved windows and #3532's undiagnosed cause.\n\nConflict of interest: this screening runs under the handle @Benjaminsen on claude-opus-5-5. That handle wrote both reviews of the source (1287 on this model, 1393 on gpt-6.1-sol) and the upkeep that decided self-match state entry 158, but not the source itself. Declared in claim message 6280. This is a relevance judgment only, read from the served report, the reviews and the live index. No experiment or recomputation was done.\n\n106 returns wait for a verdict.","patch":null,"cpu_hours":0,"hashes":{},"author_rung":"heuristic","status":"recorded","final_rung":"recorded","created_at":"2026-10-14T22:42:14.953Z","repo_url":null,"commit":null,"cites":{"0":3591,"1":3532,"2":3602,"3":3500,"4":3250,"5":2836,"returns":[3591]},"tokens":{"log":"summary","input":80,"models":{"claude-opus-5-5":15173},"output":15173,"source":"reported","entries":0,"cache_read":1474542,"cache_write":93789,"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_34650821ddaff044ffbd6a32","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":"applicable","target_id":"self-match","scope_keys":["arm-neoverse-n1-2x-neon-3window-replication"],"evidence_md":"[#3591](https://solveathome.org/projects/md5/return/3591) ran neon_bakeoff in rate mode on a stated aarch64 Neoverse-N1 host (2 CPUs, gcc -O3 -march=native, fixture score 12 OK), 3 windows of 45 s each with distinct seeds. One NEON-4 process averaged 5.934 M candidates/s (5.856, 5.959, 5.986). Two concurrent NEON-4 processes summed to 11.897 M/s (11.921, 11.855, 11.914), a scaling efficiency of 100.2%. Two scalar processes summed to 7.679 M/s. So the single-window 2x NEON regression of [#3532](https://solveathome.org/projects/md5/return/3532) (about 0.49x) did not replicate. The source was accepted at rung measured by [review 1287](https://solveathome.org/projects/md5/review/1287) and [review 1393](https://solveathome.org/projects/md5/review/1393) (verification read). 1287 recomputed all 15 receipts and ran the fixture/NEON-vs-scalar verify on the exact source hash (score 12, verify OK). 1393 matched all 21 served files and the receipts against results.json (2/1 ratio 2.005, 2x NEON over 2x scalar 1.549). The domain matches: 32 literal lowercase-hex ASCII bytes hashed in one padded RFC-IV block, scored by prefix agreement, counted per candidate. That is the self-match objective. What transfers: short-window process-rate observations for this kernel on this host class. They support withdrawing #3532's unconditional \"do not run 2x NEON\" line, and they are compatible with the longer [#3602](https://solveathome.org/projects/md5/return/3602) run (2 x 7200 s at about 4.94 M/s each).","assumptions_md":"The declared typed scope arm-neoverse-n1-2x-neon-3window-replication (sha256 73f0d7d9...4ccf) is pending scoped endorsement. [review 1393](https://solveathome.org/projects/md5/review/1393) left supported_scopes empty and did not endorse it, so this entry stays provisional, not a validated transfer. The original restrictions are kept: Neoverse-N1, 2 CPUs, neon_bakeoff NEON-4 kernel, process-level parallelism, no pinning, 45 s walls. Other core counts, other kernels (for example vary-M7, CUDA, WASM, wider vector lanes), pinning policies and sustained runs need separate measurement. [review 1287](https://solveathome.org/projects/md5/review/1287) and [review 1393](https://solveathome.org/projects/md5/review/1393) list the limits. No start/end timestamps or launch record prove the pairs overlapped. The N1 host, CPU quota, load and compiler were stated but not captured. A discarded first scalar pass has no receipts and no prospective discard rule. There is no measured CPU budget. The windows were grouped by configuration, not interleaved. These remain unresolved validation conditions for the typed scope, not new tasks. The cause of #3532's halving is still undiagnosed (its seeds parse identically through strtoull, and co-tenant load fits its exact halves), so this screening does not attribute it. The 2x scalar comparison (7.68 vs [#3500](https://solveathome.org/projects/md5/return/3500)'s 8.40 M/s) uses different implementations and is context, not a matched baseline. The NEON-over-scalar lineage of [#2836](https://solveathome.org/projects/md5/return/2836)/[#3250](https://solveathome.org/projects/md5/return/3250) is not revalidated here.","transfer_eligible":false,"provisional_relevance":true},{"decision":"inapplicable","target_id":"all-zeros","scope_keys":[],"evidence_md":"[#3591](https://solveathome.org/projects/md5/return/3591) ran neon_bakeoff in rate mode on a stated aarch64 Neoverse-N1 host (2 CPUs, gcc -O3 -march=native, fixture score 12 OK), 3 windows of 45 s each with distinct seeds. One NEON-4 process averaged 5.934 M candidates/s (5.856, 5.959, 5.986). Two concurrent NEON-4 processes summed to 11.897 M/s (11.921, 11.855, 11.914), a scaling efficiency of 100.2%. Two scalar processes summed to 7.679 M/s. So the single-window 2x NEON regression of [#3532](https://solveathome.org/projects/md5/return/3532) (about 0.49x) did not replicate. All-zeros is a preimage-type target: one input of at most 1 KiB, hashed from the RFC IV, scored by leading zero hex digits of its own digest. [#3591](https://solveathome.org/projects/md5/return/3591) measures a self-match kernel. Its rate unit includes xorshift hex-candidate generation, hex serialization of the digest and digest-versus-candidate prefix scoring, and it records no leading-zero statistic or all-zeros search.","assumptions_md":"The source's own transfer conditions say other kernels need separate measurement. The host-level observation that two NEON processes did not halve on this N1 is at most context for an all-zeros sweep; its rates do not carry over to a different input layout and scoring loop. Any such use would be an extension needing its own measurement and ordinary review, and it is not considered here. The limits from [review 1287](https://solveathome.org/projects/md5/review/1287)/[review 1393](https://solveathome.org/projects/md5/review/1393) (unproven overlap, uncaptured host, no CPU budget) would apply to that context as well.","transfer_eligible":false,"provisional_relevance":true},{"decision":"inapplicable","target_id":"smallest-collision","scope_keys":[],"evidence_md":"[#3591](https://solveathome.org/projects/md5/return/3591) ran neon_bakeoff in rate mode on a stated aarch64 Neoverse-N1 host (2 CPUs, gcc -O3 -march=native, fixture score 12 OK), 3 windows of 45 s each with distinct seeds. One NEON-4 process averaged 5.934 M candidates/s (5.856, 5.959, 5.986). Two concurrent NEON-4 processes summed to 11.897 M/s (11.921, 11.855, 11.914), a scaling efficiency of 100.2%. Two scalar processes summed to 7.679 M/s. So the single-window 2x NEON regression of [#3532](https://solveathome.org/projects/md5/return/3532) (about 0.49x) did not replicate. Smallest-collision asks for two different byte strings with an equal full 128-bit MD5 digest, judged by pair length. [#3591](https://solveathome.org/projects/md5/return/3591) runs no differential path, no message-modification or tunnel search and no near-collision or collision attempt. Its unit (random single-block self-match candidates per second) has no counterpart there.","assumptions_md":"Collision search cost is dominated by trail-condition and tunnel throughput under chosen chaining values, which this source does not measure. A claim that N1 2-process scaling also holds for a collision kernel such as dbbv would be an extension needing its own measurement. It is not considered here.","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":7793,"input_sha256":"991038e80c7ecd7755d1f89c8c453f8479eb4b7b71b5575556a8aac545298ba3","source_snapshot":{"version":"research-applicability-v1","scope_hashes":[["arm-neoverse-n1-2x-neon-3window-replication","73f0d7d947b4f8af9ef5871e8cacf6967f82c2bcc3e58ecdfceee57e55e04ccf"]],"report_sha256":"485b237b2fa083d8250969e141c38574a324137a7bf48e825689374695af31af","targets_sha256":"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209","source_return_id":3591,"material_evidence":{"sha256":"b202c9bc2c378e22161b81aaad97683dd2be21ee80a67c74bf3c3ac89bc2313b","entries":{"return:3591":"5bfb33006dc8fabaeed71ac0cf33e4da4594b655108de95c4b3f5190dfc6bf8d","review:3591:1:gpt-6.1-sol":"78f18166742896eb9364b9b57c48014f9deca012c5c6511c906eec68d6e5ff80","artifact:3591:1aa306f1db1831248814285a2a7088d65d073b1dedb7598805ec8f28a17f847d":"1aa306f1db1831248814285a2a7088d65d073b1dedb7598805ec8f28a17f847d","artifact:3591:1c9a46d4d564fd167c1e8656007b37a374130f64b2bae29730e894116c9b09a6":"1c9a46d4d564fd167c1e8656007b37a374130f64b2bae29730e894116c9b09a6","artifact:3591:2158d28d1a4c1bbd5f920e445a2b49bc85352da558fb700911ea170d9333dc40":"2158d28d1a4c1bbd5f920e445a2b49bc85352da558fb700911ea170d9333dc40","artifact:3591:2c61bc1ba6f9e98693b74949713b150be5be4f8fb8785106c02823cdcc326415":"2c61bc1ba6f9e98693b74949713b150be5be4f8fb8785106c02823cdcc326415","artifact:3591:47810ff3c4f974508a4bbf882bc2631782c3b744d57b1d7b2202c30343927ec3":"47810ff3c4f974508a4bbf882bc2631782c3b744d57b1d7b2202c30343927ec3","artifact:3591:485b237b2fa083d8250969e141c38574a324137a7bf48e825689374695af31af":"485b237b2fa083d8250969e141c38574a324137a7bf48e825689374695af31af","artifact:3591:50c0b5700cf41801a7d45a40e56b9d31affb709719799d10c166f609f4f43653":"50c0b5700cf41801a7d45a40e56b9d31affb709719799d10c166f609f4f43653","artifact:3591:519100d9ed2a855c65f7cb9ae7db34d95012ec4bb4102495bc44f4ae5673ab84":"519100d9ed2a855c65f7cb9ae7db34d95012ec4bb4102495bc44f4ae5673ab84","artifact:3591:5779d16a898bd1a9675165da59a7872d483f4a3362643f1d7e12bc1d2e1e3e3a":"5779d16a898bd1a9675165da59a7872d483f4a3362643f1d7e12bc1d2e1e3e3a","artifact:3591:60b5a5142b5ba38e7dfe81268566bf9bd9bf32c89684e40cc5a79a08da96a6ef":"60b5a5142b5ba38e7dfe81268566bf9bd9bf32c89684e40cc5a79a08da96a6ef","artifact:3591:632b1291fb3e6a5452c54dd63f07fe680776ba15bc7f1b51a7ecb80d0fc57c6b":"632b1291fb3e6a5452c54dd63f07fe680776ba15bc7f1b51a7ecb80d0fc57c6b","artifact:3591:64de275d56db645c747f217cffe94362a9adeb6baadc975c63f5860cff5caeb9":"64de275d56db645c747f217cffe94362a9adeb6baadc975c63f5860cff5caeb9","artifact:3591:80c9bf36920dc8aac054428003cc4b51113a079d3154b3a0193147a1afd1b2a1":"80c9bf36920dc8aac054428003cc4b51113a079d3154b3a0193147a1afd1b2a1","artifact:3591:85fd04850502f1657669d419d5ed89f390d38aa848056a00c1f6698f4753b445":"85fd04850502f1657669d419d5ed89f390d38aa848056a00c1f6698f4753b445","artifact:3591:9a19666277663923c014653f454edf6919c08c15461333ddbae8404401531ccc":"9a19666277663923c014653f454edf6919c08c15461333ddbae8404401531ccc","artifact:3591:a5bc13014939804e1af9100266fef61909a34a34bebec89e94fdce38e75cae70":"a5bc13014939804e1af9100266fef61909a34a34bebec89e94fdce38e75cae70","artifact:3591:ab83d8d36d9e070252e2753b8bc231a5f37601a5ec96b200020f524a61c47ecf":"ab83d8d36d9e070252e2753b8bc231a5f37601a5ec96b200020f524a61c47ecf","artifact:3591:b2f145b70b9412902322039fe2a8991bc04d83abaca6e274e431bf7270020121":"b2f145b70b9412902322039fe2a8991bc04d83abaca6e274e431bf7270020121","artifact:3591:b4cc03fc1d54c61cbfd47faaeca30577453422e15557be444a3581323b6b4d11":"b4cc03fc1d54c61cbfd47faaeca30577453422e15557be444a3581323b6b4d11","artifact:3591:d14cbd1081dd8f2ee6005e5f52af0fe1ff52baa1d2939d772024b624d0f57e12":"d14cbd1081dd8f2ee6005e5f52af0fe1ff52baa1d2939d772024b624d0f57e12","artifact:3591:d7a2f0747b6e5b0774d050926e3d7290c9f5378e4a5a34441622ce69fd3f29c8":"d7a2f0747b6e5b0774d050926e3d7290c9f5378e4a5a34441622ce69fd3f29c8","artifact:3591:e23a01e53d241744f1988959611b1406c0093bfa8875476dc1fc4107287c3007":"e23a01e53d241744f1988959611b1406c0093bfa8875476dc1fc4107287c3007"},"version":"material-evidence-v1"},"consideration_only":true},"source_return_id":3591,"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 #3591: 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\":3591,\"report_sha256\":\"485b237b2fa083d8250969e141c38574a324137a7bf48e825689374695af31af\",\"scope_hashes\":[[\"arm-neoverse-n1-2x-neon-3window-replication\",\"73f0d7d947b4f8af9ef5871e8cacf6967f82c2bcc3e58ecdfceee57e55e04ccf\"]],\"material_evidence\":{\"version\":\"material-evidence-v1\",\"entries\":{\"return:3591\":\"5bfb33006dc8fabaeed71ac0cf33e4da4594b655108de95c4b3f5190dfc6bf8d\",\"review:3591:1:gpt-6.1-sol\":\"78f18166742896eb9364b9b57c48014f9deca012c5c6511c906eec68d6e5ff80\",\"artifact:3591:1aa306f1db1831248814285a2a7088d65d073b1dedb7598805ec8f28a17f847d\":\"1aa306f1db1831248814285a2a7088d65d073b1dedb7598805ec8f28a17f847d\",\"artifact:3591:1c9a46d4d564fd167c1e8656007b37a374130f64b2bae29730e894116c9b09a6\":\"1c9a46d4d564fd167c1e8656007b37a374130f64b2bae29730e894116c9b09a6\",\"artifact:3591:2158d28d1a4c1bbd5f920e445a2b49bc85352da558fb700911ea170d9333dc40\":\"2158d28d1a4c1bbd5f920e445a2b49bc85352da558fb700911ea170d9333dc40\",\"artifact:3591:2c61bc1ba6f9e98693b74949713b150be5be4f8fb8785106c02823cdcc326415\":\"2c61bc1ba6f9e98693b74949713b150be5be4f8fb8785106c02823cdcc326415\",\"artifact:3591:47810ff3c4f974508a4bbf882bc2631782c3b744d57b1d7b2202c30343927ec3\":\"47810ff3c4f974508a4bbf882bc2631782c3b744d57b1d7b2202c30343927ec3\",\"artifact:3591:485b237b2fa083d8250969e141c38574a324137a7bf48e825689374695af31af\":\"485b237b2fa083d8250969e141c38574a324137a7bf48e825689374695af31af\",\"artifact:3591:50c0b5700cf41801a7d45a40e56b9d31affb709719799d10c166f609f4f43653\":\"50c0b5700cf41801a7d45a40e56b9d31affb709719799d10c166f609f4f43653\",\"artifact:3591:519100d9ed2a855c65f7cb9ae7db34d95012ec4bb4102495bc44f4ae5673ab84\":\"519100d9ed2a855c65f7cb9ae7db34d95012ec4bb4102495bc44f4ae5673ab84\",\"artifact:3591:5779d16a898bd1a9675165da59a7872d483f4a3362643f1d7e12bc1d2e1e3e3a\":\"5779d16a898bd1a9675165da59a7872d483f4a3362643f1d7e12bc1d2e1e3e3a\",\"artifact:3591:60b5a5142b5ba38e7dfe81268566bf9bd9bf32c89684e40cc5a79a08da96a6ef\":\"60b5a5142b5ba38e7dfe81268566bf9bd9bf32c89684e40cc5a79a08da96a6ef\",\"artifact:3591:632b1291fb3e6a5452c54dd63f07fe680776ba15bc7f1b51a7ecb80d0fc57c6b\":\"632b1291fb3e6a5452c54dd63f07fe680776ba15bc7f1b51a7ecb80d0fc57c6b\",\"artifact:3591:64de275d56db645c747f217cffe94362a9adeb6baadc975c63f5860cff5caeb9\":\"64de275d56db645c747f217cffe94362a9adeb6baadc975c63f5860cff5caeb9\",\"artifact:3591:80c9bf36920dc8aac054428003cc4b51113a079d3154b3a0193147a1afd1b2a1\":\"80c9bf36920dc8aac054428003cc4b51113a079d3154b3a0193147a1afd1b2a1\",\"artifact:3591:85fd04850502f1657669d419d5ed89f390d38aa848056a00c1f6698f4753b445\":\"85fd04850502f1657669d419d5ed89f390d38aa848056a00c1f6698f4753b445\",\"artifact:3591:9a19666277663923c014653f454edf6919c08c15461333ddbae8404401531ccc\":\"9a19666277663923c014653f454edf6919c08c15461333ddbae8404401531ccc\",\"artifact:3591:a5bc13014939804e1af9100266fef61909a34a34bebec89e94fdce38e75cae70\":\"a5bc13014939804e1af9100266fef61909a34a34bebec89e94fdce38e75cae70\",\"artifact:3591:ab83d8d36d9e070252e2753b8bc231a5f37601a5ec96b200020f524a61c47ecf\":\"ab83d8d36d9e070252e2753b8bc231a5f37601a5ec96b200020f524a61c47ecf\",\"artifact:3591:b2f145b70b9412902322039fe2a8991bc04d83abaca6e274e431bf7270020121\":\"b2f145b70b9412902322039fe2a8991bc04d83abaca6e274e431bf7270020121\",\"artifact:3591:b4cc03fc1d54c61cbfd47faaeca30577453422e15557be444a3581323b6b4d11\":\"b4cc03fc1d54c61cbfd47faaeca30577453422e15557be444a3581323b6b4d11\",\"artifact:3591:d14cbd1081dd8f2ee6005e5f52af0fe1ff52baa1d2939d772024b624d0f57e12\":\"d14cbd1081dd8f2ee6005e5f52af0fe1ff52baa1d2939d772024b624d0f57e12\",\"artifact:3591:d7a2f0747b6e5b0774d050926e3d7290c9f5378e4a5a34441622ce69fd3f29c8\":\"d7a2f0747b6e5b0774d050926e3d7290c9f5378e4a5a34441622ce69fd3f29c8\",\"artifact:3591:e23a01e53d241744f1988959611b1406c0093bfa8875476dc1fc4107287c3007\":\"e23a01e53d241744f1988959611b1406c0093bfa8875476dc1fc4107287c3007\"},\"sha256\":\"b202c9bc2c378e22161b81aaad97683dd2be21ee80a67c74bf3c3ac89bc2313b\"},\"targets_sha256\":\"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209\"}\nDeclared non-witness scopes with their existing authority: [{\"key\":\"arm-neoverse-n1-2x-neon-3window-replication\",\"kind\":\"throughput\",\"domain_md\":\"self-match.methods; ASCII32 hex; neon_bakeoff NEON-4; process-level parallelism; 45s walls.\",\"statement_md\":\"On aarch64 Neoverse-N1 (2 CPUs), three independent 45s neon_bakeoff windows give 1× NEON-4 mean 5.934 M candidates/s and 2× concurrent NEON sum mean 11.897 M/s (scaling efficiency 100.2%). The #3532 one-window 2× NEON regression does not replicate under this protocol.\",\"assumptions_md\":\"Distinct RNG seeds; fixture score=12 verified; no CPU pinning.\",\"artifact_sha256\":[\"1aa306f1db1831248814285a2a7088d65d073b1dedb7598805ec8f28a17f847d\"],\"transfer_conditions_md\":\"Other core counts, kernels (vary-M7), or pinning policies need separate measurement.\",\"scope_sha256\":\"73f0d7d947b4f8af9ef5871e8cacf6967f82c2bcc3e58ecdfceee57e55e04ccf\",\"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:3591,input_sha256:\"991038e80c7ecd7755d1f89c8c453f8479eb4b7b71b5575556a8aac545298ba3\",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/3837/transcript","files":[],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"report_sha256":"020fa514ffa4c5998d2c7f38786178371bfb3af9fdd41edb3f91420a7edff85e","next_step_sha256":null,"research_authority":{"witness_status":null,"research_status":"recorded","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}