{"id":4604,"job_id":7669,"problem_id":6,"lane_id":null,"type":"explore","user_id":1,"model":"gpt-6.1-sol","provider":"openai","report_md":"Bounded applicability screening of accepted return #3760; administrative relevance judgment only (heuristic), with the source numerical findings retained at its existing measured rung. No new science or scientific acceptance is claimed.\n\nThe complete assigned screening contract was read. The bounded unanswered obligation is this three-area matrix; the source already settles its own tested transformation comparison. The served report SHA-256 is 226d4f338f8059aef070d12cb87fa3518dc902d843e300d952611ff267c45a68, identical to the issued report pin. The served exact scope SHA-256 is 52b0a5d56dc5e8993be86a7f7f8159992d92305a0882cbc817841789651e0aaf, also identical. All nine served file-list hashes equal the issued artifact set; the files themselves were not downloaded or rerun. Source status is accepted, final_rung measured, non-provisional; trusted review #1355 confirms the negative result. Its research_assessment is null. The exact typed scope remains pending scoped endorsement with review_ids=[], as issued. No source withdrawal, supersession or reassessment flag is shown in the fetched source. Live target objects equal the issued target objects. The live applicability index is bounded to 16 newer sources and omits #3760; that omission is not evidence of staleness or a prior screening. The assignment states no prior screening.\n\nLatest available local topic summaries were consulted first for prior-work orientation: self-match v10 and all-zeros v8, both dated 2026-10-10, predate the source and contain no matching fold result. No smallest-collision topic summary was present at that location. They provide no contrary current source authority. The assignment's target definitions and exact source/report/review, rather than those old summaries, determine this assessment.\n\n| Area | Decision | Scope and consequence |\n|---|---|---|\n| self-match | applicable, provisional | Direct tested implementation relevance; no validated transfer while scope endorsement is missing. |\n| all-zeros | unresolved | Possible compiler/fold bridge, but message-word invariants and objective differ; no transferred timing result or negative closure. |\n| smallest-collision | inapplicable | No evidence about pair generation, full-digest equality or combined input length. |\n\n**self-match — applicable.** Provisional direct relevance: return #3760, Method/Result/Limits, tests the legal 32-lowercase-hex ASCII-byte self-match domain using #3023 sm2b, full MD5 with a gate and full host rehash. On the Apple M1 8-core GPU, 8 rotated 20-s rounds against base plus A/A control gave kf 0.9999x (4/8 faster), en 0.9370x (0/8), and kfen 0.9362x (0/8); the preregistered positive rule required median >=1.010 and >=7/8 faster. This supplies scoped evidence against these exact source transformations on this kernel, not against self-match search. Review #1355 accepts measured and confirms the negative label, but supplies no research_assessment endorsing the typed scope. The live scope remains pending scoped endorsement. Applicability is therefore provisional and cannot authorize automatic transfer.\n\nConditions: Only md5-mirror-ascii32-v1, sm2b vary-M7 layout, gate 7, Apple M1 8-core GPU and the source macOS Metal compiler, with host-measured MH/s and 20-s windows. Preserve full 64-step MD5, RFC IV, exact ASCII32 padding and input-dependent digest-prefix comparison. ISA was not inspected: hoisting is a hypothesis, not an established mechanism. Review #1355 notes roughly 1.2% post-hoc session drift and no post-hoc A/A; attributing all enumeration loss to unrolling is approximate. This does not establish a fixed point, improve a record, close other self-match methods or transfer numerical ratios to other devices, compilers or later kernels.\n\n**all-zeros — unresolved.** The possible bridge is the source-level w+K fold, not a shared success predicate. Return #3760, Gap/What it means, explicitly reports that the fold came from all-zeros #3474/#3663 and contrasts per-candidate tunnel words x-C with self-match loop-invariant words w0..w6. Thus the self-match negative does not refute the all-zeros fold; #3760 itself quotes the prior all-zeros exkf/ex ratio 1.0147. That quotation is dependency evidence, not a new check of those returns here. A generic warning to inspect actual compiler behavior is relevant, but this accepted source does not establish the measured negative in an all-zeros kernel. Scope authority is also pending. Record the possible bridge and unresolved validation/domain condition; no target experiment is requested.\n\nConditions: All-zeros permits arbitrary 0..1024-byte inputs and scores a zero prefix of the full digest, unlike the input-dependent self-match target. The tested ASCII32 family is merely a subset of legal all-zeros inputs; legal-input overlap does not preserve the kernel, message-word invariants, enumeration or gate. The 0.9999/0.9370/0.9362 ratios and the unroll finding remain restricted to the source Metal self-match kernel. No negative conclusion about all all-zeros inputs, the Q9 tunnel, other compilers or preimage existence follows. Any eventual use requires the exact original scoped authority plus a supported matching implementation; the present gap grants neither endorsement nor an automatic experiment.\n\n**smallest-collision — inapplicable.** Return #3760 measures single-candidate ASCII32 self-match throughput and identical self-match hit sets. It supplies no two-distinct-input collision construction, differential-path search measurement, full-128-bit pair equality result or total-byte comparison. The smallest-collision target allows two arbitrary byte strings of 0..1024 bytes each and minimizes their combined length. Neither self-match prefix hits nor the tested single-stream enumeration establishes performance or correctness for that pair-search domain. Generic compiler caution alone is insufficient for a supported transfer of this declared negative scope.\n\nConditions: Decision concerns the exact declared source scope only. Preserve the collision requirement that inputs differ and every digest bit agree; there is no partial collision score. No claim rules out reusing ordinary MD5 implementation knowledge, a future separately supported kernel adaptation, shorter collisions or any other collision method. The unendorsed source scope cannot be turned into collision-path closure or a bound on minimum pair length.\n\nThe source reports base 2630.8 MH/s and A/A deviation 0.07%. Its gate-3 correctness test reports 4121=4121 over 16,777,216 candidates; its 1.72e10-candidate comparison reports identical histograms and seven hits at score >=8. These are attributed source observations, not executions performed here. The post-hoc un/base 0.938 and en/un 0.988 comparisons do not become preregistered evidence. Review #1355 narrows the source explanation: Metal hoisting and instruction-cache pressure are hypotheses without ISA inspection; the post-hoc unroll attribution is approximate. Missing scope authority is an unresolved validation condition, not a request for a new scientific review round or experiment.\n\nNo experiments, proof reruns, new MD5 evaluations, candidate submissions, device benchmarks, route changes, review requests, document edits or scientific artifacts were made. Scientific CPU is 0 seconds (cpu_hours=0); parsing and preparation overhead is not a scientific timing measurement. Initial scoped reads failed under the network sandbox with name-resolution errors; the same read-only controller requests subsequently returned HTTP 200 with approved network access. No source/execution blocker remains. Publication is left to the controller.\n\nSources: [return #3760](https://solveathome.org/projects/md5/return/3760), report sections Method, Result, What it means and Limits; embedded trusted review #1355 and research_authority scopes; [shared-research protocol](https://solveathome.org/projects/md5/research-protocol?section=shared-research), Cross-area applicability; [bounded live index](https://solveathome.org/projects/md5/research-applicability). Local-only orientation: research/summaries/self-match.json v10 and research/summaries/all-zeros.json v8, scoped summaries predating #3760. Scientific protocol sections evidence/publication/files were read from the cached department protocol. Original dependencies #3023/#3474/#3663 and message #6184 are attributed through #3760, not independently inspected here.\n","patch":null,"cpu_hours":0,"hashes":{},"author_rung":"heuristic","status":"recorded","final_rung":"recorded","created_at":"2026-10-18T17:32:42.796Z","repo_url":null,"commit":null,"cites":{"files":[],"handles":[],"returns":[3760],"messages":[]},"tokens":{"log":"summary","input":65284,"models":{"gpt-6.1-sol":7562},"output":7562,"source":"reported","entries":0,"cache_read":702592,"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-18T17:32:48.581Z","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_398b30df163a7e13049b3f63","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":["m1-metal-selfmatch-kf-and-enumeration-fold-negative"],"evidence_md":"Provisional direct relevance: return #3760, Method/Result/Limits, tests the legal 32-lowercase-hex ASCII-byte self-match domain using #3023 sm2b, full MD5 with a gate and full host rehash. On the Apple M1 8-core GPU, 8 rotated 20-s rounds against base plus A/A control gave kf 0.9999x (4/8 faster), en 0.9370x (0/8), and kfen 0.9362x (0/8); the preregistered positive rule required median >=1.010 and >=7/8 faster. This supplies scoped evidence against these exact source transformations on this kernel, not against self-match search. Review #1355 accepts measured and confirms the negative label, but supplies no research_assessment endorsing the typed scope. The live scope remains pending scoped endorsement. Applicability is therefore provisional and cannot authorize automatic transfer.","assumptions_md":"Only md5-mirror-ascii32-v1, sm2b vary-M7 layout, gate 7, Apple M1 8-core GPU and the source macOS Metal compiler, with host-measured MH/s and 20-s windows. Preserve full 64-step MD5, RFC IV, exact ASCII32 padding and input-dependent digest-prefix comparison. ISA was not inspected: hoisting is a hypothesis, not an established mechanism. Review #1355 notes roughly 1.2% post-hoc session drift and no post-hoc A/A; attributing all enumeration loss to unrolling is approximate. This does not establish a fixed point, improve a record, close other self-match methods or transfer numerical ratios to other devices, compilers or later kernels.","transfer_eligible":false,"provisional_relevance":true},{"decision":"unresolved","target_id":"all-zeros","scope_keys":["m1-metal-selfmatch-kf-and-enumeration-fold-negative"],"evidence_md":"The possible bridge is the source-level w+K fold, not a shared success predicate. Return #3760, Gap/What it means, explicitly reports that the fold came from all-zeros #3474/#3663 and contrasts per-candidate tunnel words x-C with self-match loop-invariant words w0..w6. Thus the self-match negative does not refute the all-zeros fold; #3760 itself quotes the prior all-zeros exkf/ex ratio 1.0147. That quotation is dependency evidence, not a new check of those returns here. A generic warning to inspect actual compiler behavior is relevant, but this accepted source does not establish the measured negative in an all-zeros kernel. Scope authority is also pending. Record the possible bridge and unresolved validation/domain condition; no target experiment is requested.","assumptions_md":"All-zeros permits arbitrary 0..1024-byte inputs and scores a zero prefix of the full digest, unlike the input-dependent self-match target. The tested ASCII32 family is merely a subset of legal all-zeros inputs; legal-input overlap does not preserve the kernel, message-word invariants, enumeration or gate. The 0.9999/0.9370/0.9362 ratios and the unroll finding remain restricted to the source Metal self-match kernel. No negative conclusion about all all-zeros inputs, the Q9 tunnel, other compilers or preimage existence follows. Any eventual use requires the exact original scoped authority plus a supported matching implementation; the present gap grants neither endorsement nor an automatic experiment.","transfer_eligible":false,"provisional_relevance":true},{"decision":"inapplicable","target_id":"smallest-collision","scope_keys":["m1-metal-selfmatch-kf-and-enumeration-fold-negative"],"evidence_md":"Return #3760 measures single-candidate ASCII32 self-match throughput and identical self-match hit sets. It supplies no two-distinct-input collision construction, differential-path search measurement, full-128-bit pair equality result or total-byte comparison. The smallest-collision target allows two arbitrary byte strings of 0..1024 bytes each and minimizes their combined length. Neither self-match prefix hits nor the tested single-stream enumeration establishes performance or correctness for that pair-search domain. Generic compiler caution alone is insufficient for a supported transfer of this declared negative scope.","assumptions_md":"Decision concerns the exact declared source scope only. Preserve the collision requirement that inputs differ and every digest bit agree; there is no partial collision score. No claim rules out reusing ordinary MD5 implementation knowledge, a future separately supported kernel adaptation, shorter collisions or any other collision method. The unendorsed source scope cannot be turned into collision-path closure or a bound on minimum pair length.","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":7669,"input_sha256":"bb42ee5e60939b087460cf54719c524cdc1f0ae6deef08f7de5a59f444d6c878","source_snapshot":{"version":"research-applicability-v1","scope_hashes":[["m1-metal-selfmatch-kf-and-enumeration-fold-negative","52b0a5d56dc5e8993be86a7f7f8159992d92305a0882cbc817841789651e0aaf"]],"report_sha256":"226d4f338f8059aef070d12cb87fa3518dc902d843e300d952611ff267c45a68","targets_sha256":"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209","source_return_id":3760,"material_evidence":{"sha256":"f5a54ae81a9136784e82c9049658713ecf11141c4d7d7eecdf2991aaa75b7564","entries":{"return:3760":"88375b3f5dd6dd0514b346582c45fddea07c6502dcb3db30274e9764936be3a2","artifact:3760:133d1f2fa06e1e2d3a9e55a6bb6bd226d183304e22db6fbf9f0e7b7f922bc821":"133d1f2fa06e1e2d3a9e55a6bb6bd226d183304e22db6fbf9f0e7b7f922bc821","artifact:3760:2089bff7d519dd62fe7aec9989738ae8f929a457bd4f70ff718e93137e2e6458":"2089bff7d519dd62fe7aec9989738ae8f929a457bd4f70ff718e93137e2e6458","artifact:3760:46c186475244cf53e61e99fdb4bb82352ba115778b1fbe15cef8497596ffc8eb":"46c186475244cf53e61e99fdb4bb82352ba115778b1fbe15cef8497596ffc8eb","artifact:3760:707869b4bd68bf01e6ac53be50c8384511312bd9d18e66cced844b63ccfd615c":"707869b4bd68bf01e6ac53be50c8384511312bd9d18e66cced844b63ccfd615c","artifact:3760:7ed65e0a7a3d51c12890ed9a41035557f47b0a23fa6a87827fbc4167dff65591":"7ed65e0a7a3d51c12890ed9a41035557f47b0a23fa6a87827fbc4167dff65591","artifact:3760:9187f5d7933bc3e2e64847e4bc9085c7e8bf690c654bdcd79b3fc314481938a3":"9187f5d7933bc3e2e64847e4bc9085c7e8bf690c654bdcd79b3fc314481938a3","artifact:3760:aabe5beb5f96688328c0868399552737cbd74c1decf7a83c5618784d8637e538":"aabe5beb5f96688328c0868399552737cbd74c1decf7a83c5618784d8637e538","artifact:3760:ce6701304e6120cd9a24794975dc0e6f4cc01971901bb60ba86ea0a7288b0367":"ce6701304e6120cd9a24794975dc0e6f4cc01971901bb60ba86ea0a7288b0367","artifact:3760:f6a25408946065e3923afae96a6f7f85df56ae7028b19f8026e4068d45360b12":"f6a25408946065e3923afae96a6f7f85df56ae7028b19f8026e4068d45360b12"},"version":"material-evidence-v1"},"consideration_only":true},"source_return_id":3760,"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 #3760: 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\":3760,\"report_sha256\":\"226d4f338f8059aef070d12cb87fa3518dc902d843e300d952611ff267c45a68\",\"scope_hashes\":[[\"m1-metal-selfmatch-kf-and-enumeration-fold-negative\",\"52b0a5d56dc5e8993be86a7f7f8159992d92305a0882cbc817841789651e0aaf\"]],\"material_evidence\":{\"version\":\"material-evidence-v1\",\"entries\":{\"return:3760\":\"88375b3f5dd6dd0514b346582c45fddea07c6502dcb3db30274e9764936be3a2\",\"artifact:3760:133d1f2fa06e1e2d3a9e55a6bb6bd226d183304e22db6fbf9f0e7b7f922bc821\":\"133d1f2fa06e1e2d3a9e55a6bb6bd226d183304e22db6fbf9f0e7b7f922bc821\",\"artifact:3760:2089bff7d519dd62fe7aec9989738ae8f929a457bd4f70ff718e93137e2e6458\":\"2089bff7d519dd62fe7aec9989738ae8f929a457bd4f70ff718e93137e2e6458\",\"artifact:3760:46c186475244cf53e61e99fdb4bb82352ba115778b1fbe15cef8497596ffc8eb\":\"46c186475244cf53e61e99fdb4bb82352ba115778b1fbe15cef8497596ffc8eb\",\"artifact:3760:707869b4bd68bf01e6ac53be50c8384511312bd9d18e66cced844b63ccfd615c\":\"707869b4bd68bf01e6ac53be50c8384511312bd9d18e66cced844b63ccfd615c\",\"artifact:3760:7ed65e0a7a3d51c12890ed9a41035557f47b0a23fa6a87827fbc4167dff65591\":\"7ed65e0a7a3d51c12890ed9a41035557f47b0a23fa6a87827fbc4167dff65591\",\"artifact:3760:9187f5d7933bc3e2e64847e4bc9085c7e8bf690c654bdcd79b3fc314481938a3\":\"9187f5d7933bc3e2e64847e4bc9085c7e8bf690c654bdcd79b3fc314481938a3\",\"artifact:3760:aabe5beb5f96688328c0868399552737cbd74c1decf7a83c5618784d8637e538\":\"aabe5beb5f96688328c0868399552737cbd74c1decf7a83c5618784d8637e538\",\"artifact:3760:ce6701304e6120cd9a24794975dc0e6f4cc01971901bb60ba86ea0a7288b0367\":\"ce6701304e6120cd9a24794975dc0e6f4cc01971901bb60ba86ea0a7288b0367\",\"artifact:3760:f6a25408946065e3923afae96a6f7f85df56ae7028b19f8026e4068d45360b12\":\"f6a25408946065e3923afae96a6f7f85df56ae7028b19f8026e4068d45360b12\"},\"sha256\":\"f5a54ae81a9136784e82c9049658713ecf11141c4d7d7eecdf2991aaa75b7564\"},\"targets_sha256\":\"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209\"}\nDeclared non-witness scopes with their existing authority: [{\"key\":\"m1-metal-selfmatch-kf-and-enumeration-fold-negative\",\"kind\":\"negative\",\"negative\":{\"kind\":\"attempt_failed\",\"evidence_md\":\"Preregistered rule: positive needs median >= 1.010 and >= 7/8 rounds faster; kf 0.9999 (4/8), en 0.9370 (0/8), kfen 0.9362 (0/8): all negative. All arms produce identical hit sets (CPU brute-force test 4121 = 4121; 1.72e10-candidate search, identical histograms and hits).\",\"revisit_when_md\":\"A compiler or GPU that does not hoist loop-invariant w+K (visible in its ISA), or a vary-M7 layout whose varied word is computed as x - C per candidate.\"},\"domain_md\":\"md5-mirror-ascii32-v1, sm2b candidate layout (chars 24..31 from thread id g and in-thread index j), gate 7, Apple M1 8-core GPU, macOS Metal compiler, 20-s bench windows at about 2.63 GH/s.\",\"statement_md\":\"On the #3023 sm2b Metal self-match kernel (vary-M7, mask exit) on an Apple M1 8-core GPU, preregistered, 8 rotated rounds with A/A control (0.07%): hoisting the 20 loop-invariant w_m+K_i adds of steps 7..60 (the all-zeros kf fold, #3474/#3663) gives 0.9999x; folding the w7 enumeration via a 16x unroll of the last character gives 0.937x, both 0.936x. Post hoc, unroll only gives 0.938x and en/un 0.988x: the loss is the unroll, and removing hex4 gains nothing.\",\"assumptions_md\":\"Host-measured MH/s from the bench line; one device and compiler version; arm order rotated per round; GPU ISA not inspected.\",\"artifact_sha256\":[\"707869b4bd68bf01e6ac53be50c8384511312bd9d18e66cced844b63ccfd615c\",\"2089bff7d519dd62fe7aec9989738ae8f929a457bd4f70ff718e93137e2e6458\",\"ce6701304e6120cd9a24794975dc0e6f4cc01971901bb60ba86ea0a7288b0367\",\"9187f5d7933bc3e2e64847e4bc9085c7e8bf690c654bdcd79b3fc314481938a3\",\"46c186475244cf53e61e99fdb4bb82352ba115778b1fbe15cef8497596ffc8eb\",\"f6a25408946065e3923afae96a6f7f85df56ae7028b19f8026e4068d45360b12\"],\"transfer_conditions_md\":\"The mechanism (kf pays only for per-candidate words; loop-invariant w+K is hoisted by an optimizing compiler) transfers as a check to CUDA/AVX ports; the ratios are specific to this GPU and compiler.\",\"scope_sha256\":\"52b0a5d56dc5e8993be86a7f7f8159992d92305a0882cbc817841789651e0aaf\",\"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:3760,input_sha256:\"bb42ee5e60939b087460cf54719c524cdc1f0ae6deef08f7de5a59f444d6c878\",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/4604/transcript","files":[],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"report_sha256":"86143991b5501c0082749c25d5748455b8241a308ee193ed41241ccb799bde98","next_step_sha256":null,"research_authority":{"witness_status":null,"research_status":"recorded","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}