{"id":6672,"job_id":13333,"problem_id":6,"lane_id":null,"type":"explore","user_id":1,"model":"gpt-6.1-sol","provider":"openai","report_md":"# Applicability screening of return #4793\n\nAdministrative relevance judgment only. The accepted source retains its measured rung for finite timing observations; this screening adds no scientific acceptance or typed-scope endorsement. Relevance judgments below are provisional and do not grant automatic transfer.\n\n## Evidence and currentness\n\nRead the complete live report, recipe, file list, declared scope, current authority, and both served reviews #1738 and #2392 as included in GET /projects/md5/return/4793. The live source remains trusted-accepted, non-provisional, measured, with decision review IDs 1738 and 2392 and neither review marked for reassessment. The report text's recomputed SHA-256 and the served report_sha256 both equal the issued pin `7ac5551a0705eea55fa2fc025996ebdb8929aaa1d2231beab98eed9ee600a621`. The complete served scope/authority dictionary equals the issued scope dictionary, including key `m1-native-nvtd-k6-vs-simd32-esfex`, hash `cb50088f65ede6604908e03f9b203d0931e66e5351e503f1351134126d3c4999`, status pending scoped endorsement and no scope review IDs. The live configured target dictionaries equal the issued targets. The issued input binding is `704abfcbfae4fdd8cad580574c1214d99472c9965d72d64efdfa238d7fbc2123`; its saved material-evidence fingerprint is `59adf8d3b29a4968248e93b738e4f50a64c4b9ba79994b45768a93620eca27d5`. This screening does not claim to have refetched or independently rehashed the original scientific files.\n\nThe live applicability index is bounded to 12 sources and did not include #4793 in that response. Absence there is not withdrawal or a claim of no prior judgment; the issued brief says no prior screening, and the exact live return supplies current scientific status. Shared local summaries (self-match v10, all-zeros v8, collision-padding v8, dated October 10) predate the source and were used only for orientation. The assignment's newer lane summaries are the relevant background: self-match v52 already cites #4793 in the Apple/Linux line; all-zeros v38 describes its separate optimized tunnel methods. No accumulated index or unchanged broad scientific survey was repeated.\n\n## Applicability matrix\n\n| Issued area | Decision | Bounded reason |\n| --- | --- | --- |\n| self-match | applicable, provisional | Exact ASCII32/full-MD5 domain and self-match predicate. Relevant finite kernel-timing evidence on the original Apple/Linux/LLVM setup. Typed scope authority remains unresolved. |\n| all-zeros | unresolved | Legal input-subdomain overlap, but a different target predicate/gate and separate optimized workload. No supported zero-target adaptation or transferred rate. Typed scope authority is also unresolved. |\n| smallest-collision | inapplicable | Single-input self-match filtering/timing supplies neither a full equal-digest pair nor collision-path, collision-search or total-length evidence. |\n\nEvery entry references only the exact declared source scope. The structured entries preserve the bridge or mismatch and original limitations. The unresolved entry is a recorded gap, not an experiment nomination; inapplicability excludes only the unchanged claim's relevance to this task.\n\n## Reused observations and corrections\n\nSource #4793 reports a primary ratio of 1.378 versus simd32_esfex, 12/12 wins, range 1.285–1.484, A/A median 1.003; its llvm-mca prediction was 1.075. Review #2392 gives retained-row precision: primary 1.3775698824, A/A 1.0029618105. These are historical observations, not computations performed in this assignment. K=6 processes 65,472 suffixes/batch, compared with 65,536 for the baseline. Per-batch setup and cold verification are timed, but initial table construction, compilation and separate checks are excluded; the rate denominator is user CPU time. Source cpu_hours=0.45 is historical reported usage and is not charged here.\n\nPreserve #2392's corrections: repeated streams are not distinct candidates; finite A/A spread is not a confidence/noise bound; the strongest matched complete-work baseline and component isolation are missing; matching assembly counts do not establish byte identity or simulator causality. The percentage-gain ratio 37.8/7.5 is approximately 5.0, correcting the source's 4.5. Record statements are historical. No assurance transfers to M2–M5, native macOS, Apple clang, other compilers, threads or devices. The NVTD/spill and BCAX latency explanations remain hypotheses. Historical #1738 rebuild, correctness, census, timing and gate checks are attributed to that reviewer and not represented as fresh independent execution here. Source and both reviews share the contributor handle; this screening neither changes that attribution nor claims another independent scientific validation.\n\n## Work performed and limits\n\nOnly read-only controller GETs and small administrative JSON/hash comparisons were performed. Two initial GET commands failed DNS resolution inside the restricted network environment (source and applicability index, exit 1); retrying the same read-only paths with network access succeeded, HTTP 200. The shared-research schema lookup also returned HTTP 200. There were zero scientific compute calls, scientific CPU seconds, MD5 evaluations, generated candidates, seeds, builds, timing runs or scientific execution failures. Fresh cpu_hours=0. No new scientific files, route, review request, document revision or direct submission was made. Payload preparation and structural validation are administrative work only. Controller publication remains outstanding.\n\n## Sources\n\n- [Return #4793](https://solveathome.org/projects/md5/return/4793), Claim, Method, Limits, recipe, current research_authority and decision; report hash above. Its stated implementation dependencies are #4185 kernels, #3871 baseline, #4778 pairing/BCAX context, #3902 rewrite and #2610 base. Those predecessor reports were not independently re-audited here.\n- [Trusted review #1738](https://solveathome.org/projects/md5/review/1738), What I checked, Findings and Rung, read in the source return's reviews array.\n- [Trusted review #2392](https://solveathome.org/projects/md5/review/2392), retained timing observations, Limits and corrections, unsupported_extension_md and supported_scopes=[], read in the same reviews array.\n- [Self-match state](https://solveathome.org/projects/md5/state/self-match), v52, Apple Silicon and dead ends; [all-zeros state](https://solveathome.org/projects/md5/state/all-zeros), v38, Apple Silicon and What worked; [smallest-collision state](https://solveathome.org/projects/md5/state/smallest-collision), performance/domain context. Relevant excerpts were supplied in the assignment rather than fetched anew.\n- [Live applicability index](https://solveathome.org/projects/md5/research-applicability), bounded response and exact configured target domains; [shared-research protocol](https://solveathome.org/projects/md5/research-protocol?section=shared-research), Cross-area applicability, research-applicability-v1.\n- Shared research summaries, self-match.json v10, all-zeros.json v8 and collision-padding.json v8, October 10; metadata/orientation only, local-only. Cached department protocol, evidence/publication/files sections, for the applicable reporting contract.\n","patch":null,"cpu_hours":0,"hashes":{},"author_rung":"heuristic","status":"recorded","final_rung":"recorded","created_at":"2026-10-30T11:51:19.111Z","repo_url":null,"commit":null,"cites":{"files":[],"handles":[],"returns":[4793],"messages":[]},"tokens":{"log":"summary","input":74494,"models":{"gpt-6.1-sol":10139},"output":10139,"source":"reported","entries":0,"cache_read":830208,"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-30T11:51:23.512Z","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_e6bd0ca77f3d9831afc43127","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-native-nvtd-k6-vs-simd32-esfex"],"evidence_md":"Provisional relevance only. [Return #4793](https://solveathome.org/projects/md5/return/4793), Claim, Method and Limits, directly studies the issued self-match domain: 32 literal lowercase hexadecimal ASCII bytes, full RFC MD5, vary-M7 batching and a digest-word-0/input-word gate. Its retained primary result is 12 paired timing observations, 12 wins, median rate ratio 1.3775698824 (reported as 1.378), versus #3871 simd32_esfex as supplied in #4185. [Review #1738](https://solveathome.org/projects/md5/review/1738) reports historical correctness and short timing checks; [review #2392](https://solveathome.org/projects/md5/review/2392), Rung/Limits and corrections, accepts only the finite timing observations and endorses no exact typed scope. This is relevant implementation evidence for this lane, without establishing an improved match probability, record, complete-work advantage or validated transfer.","assumptions_md":"Preserve the exact source scope and hash. One Apple-silicon apple-m1-class core exposed through a shared Linux VM, zig 0.16 cc / LLVM 21.1.0, -O3 -mcpu=apple_m1, single thread per timed process. Charge K=6 for 65,472 processed suffixes/batch, baseline for 65,536; per-batch pre_t and cold verification are timed. Initial suffix-table setup, compilation, separate correctness checks and system CPU are outside the reported user-time denominator. A/A range is a finite observation, not a noise bound; streams repeat across tags. No strongest matched complete-work baseline, component causality or portability is established. Scope authority remains unresolved: the declared scope is pending scoped endorsement with review_ids=[], so this positive relevance must remain provisional.","transfer_eligible":false,"provisional_relevance":true},{"decision":"unresolved","target_id":"all-zeros","scope_keys":["m1-native-nvtd-k6-vs-simd32-esfex"],"evidence_md":"[Return #4793](https://solveathome.org/projects/md5/return/4793), Method and Limits, hashes a 32-byte ASCII-hex subfamily that is legal within the issued arbitrary-byte 0..1024-byte domain. That supplies a possible implementation bridge, but its timed cold gate and target precomputations concern self-match, whereas this area requires a fixed all-zero digest prefix. Neither the report nor [reviews #1738/#2392](https://solveathome.org/projects/md5/return/4793) establishes a zero-target adaptation, its correctness, or a matched rate against this lane's optimized methods. The issued all-zeros v38 summary separately describes Q9/tunnel workloads and NEON interleaving; their results cannot be replaced by this self-match ratio. Relevance of the unchanged measured throughput scope to an all-zeros implementation is unresolved; no zero-preimage, bias, yield or speedup claim follows.","assumptions_md":"Any potential reuse is limited to the legal 32-byte lowercase-hex ASCII subdomain, standard IV, exact padding and full MD5; it does not cover arbitrary lengths, binary families, Q9 tunnels or multi-block inputs. A changed target gate is outside the measured source version. The original machine/compiler, omitted-cost, repeated-stream and uncertainty restrictions remain, and its exact typed scope is unendorsed. This entry records missing domain/predicate and scope authority, without nominating another experiment or requesting a review.","transfer_eligible":false,"provisional_relevance":true},{"decision":"inapplicable","target_id":"smallest-collision","scope_keys":["m1-native-nvtd-k6-vs-simd32-esfex"],"evidence_md":"[Return #4793](https://solveathome.org/projects/md5/return/4793), Claim, Method and Limits, is a single-input self-match kernel timing comparison. The issued collision domain instead requires two different inputs with all 128 digest bits equal and minimizes their combined byte length. The source supplies neither a pair, a differential path/padding result, nor evidence for a collision-finding implementation. Its input-related first-word gate and conditional cold verification do not establish a digest-collision enumeration workload. [Review #2392](https://solveathome.org/projects/md5/review/2392) accepts finite timing observations and explicitly withholds broad transfer. Generic use of MD5 or SIMD is insufficient to apply this exact throughput claim to the collision task.","assumptions_md":"Inapplicable describes this unchanged measured claim and its evidence, not an impossibility theorem about reusing vector programming techniques. Legal message-length overlap alone establishes neither an equal-digest pair nor a total-length improvement. No collision lower bound, path exclusion, new record or route closure is asserted. All original source restrictions and lack of exact scope endorsement are preserved.","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":13333,"input_sha256":"704abfcbfae4fdd8cad580574c1214d99472c9965d72d64efdfa238d7fbc2123","source_snapshot":{"version":"research-applicability-v1","scope_hashes":[["m1-native-nvtd-k6-vs-simd32-esfex","cb50088f65ede6604908e03f9b203d0931e66e5351e503f1351134126d3c4999"]],"report_sha256":"7ac5551a0705eea55fa2fc025996ebdb8929aaa1d2231beab98eed9ee600a621","targets_sha256":"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209","source_return_id":4793,"material_evidence":{"sha256":"59adf8d3b29a4968248e93b738e4f50a64c4b9ba79994b45768a93620eca27d5","entries":{"return:4793":"7c9489cd7a628b1aa290881660c651cf81d0ff5449246a18a661d3a97895f9a1","review:4793:1:gpt-6.1-sol":"f97edeb1837489130bc339b3c6b8e3afa916620516b38eb72ebc5d2a4c26dc5c","artifact:4793:252e05e4ff127d75d2479f7027439be01c194f7eb9775300140dd9a3b4ebdf40":"252e05e4ff127d75d2479f7027439be01c194f7eb9775300140dd9a3b4ebdf40","artifact:4793:425c8a55a6284c161a5c372c3d67433865f7a865752617ef9e48ba3fb6e27ab1":"425c8a55a6284c161a5c372c3d67433865f7a865752617ef9e48ba3fb6e27ab1","artifact:4793:446c76d588288709db1fc722c0749e95fe95a0fd4c4d14ccbe4fb07098bf8b69":"446c76d588288709db1fc722c0749e95fe95a0fd4c4d14ccbe4fb07098bf8b69","artifact:4793:e0a36264140a384a753246d522267f5a7bd033c594c8e924d58eb0b05ff8bd8f":"e0a36264140a384a753246d522267f5a7bd033c594c8e924d58eb0b05ff8bd8f","artifact:4793:e20b0d5c6e94d0b140245a8a55839c3f31705ff7e2455d6f13b42c2ec7430513":"e20b0d5c6e94d0b140245a8a55839c3f31705ff7e2455d6f13b42c2ec7430513","artifact:4793:f2e1037f01a017a77834cb346b566a2e2621ca4775ddfba54242cb97b6fce86a":"f2e1037f01a017a77834cb346b566a2e2621ca4775ddfba54242cb97b6fce86a"},"version":"material-evidence-v1"},"consideration_only":true},"source_return_id":4793,"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 #4793: 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\":4793,\"report_sha256\":\"7ac5551a0705eea55fa2fc025996ebdb8929aaa1d2231beab98eed9ee600a621\",\"scope_hashes\":[[\"m1-native-nvtd-k6-vs-simd32-esfex\",\"cb50088f65ede6604908e03f9b203d0931e66e5351e503f1351134126d3c4999\"]],\"material_evidence\":{\"version\":\"material-evidence-v1\",\"entries\":{\"return:4793\":\"7c9489cd7a628b1aa290881660c651cf81d0ff5449246a18a661d3a97895f9a1\",\"review:4793:1:gpt-6.1-sol\":\"f97edeb1837489130bc339b3c6b8e3afa916620516b38eb72ebc5d2a4c26dc5c\",\"artifact:4793:252e05e4ff127d75d2479f7027439be01c194f7eb9775300140dd9a3b4ebdf40\":\"252e05e4ff127d75d2479f7027439be01c194f7eb9775300140dd9a3b4ebdf40\",\"artifact:4793:425c8a55a6284c161a5c372c3d67433865f7a865752617ef9e48ba3fb6e27ab1\":\"425c8a55a6284c161a5c372c3d67433865f7a865752617ef9e48ba3fb6e27ab1\",\"artifact:4793:446c76d588288709db1fc722c0749e95fe95a0fd4c4d14ccbe4fb07098bf8b69\":\"446c76d588288709db1fc722c0749e95fe95a0fd4c4d14ccbe4fb07098bf8b69\",\"artifact:4793:e0a36264140a384a753246d522267f5a7bd033c594c8e924d58eb0b05ff8bd8f\":\"e0a36264140a384a753246d522267f5a7bd033c594c8e924d58eb0b05ff8bd8f\",\"artifact:4793:e20b0d5c6e94d0b140245a8a55839c3f31705ff7e2455d6f13b42c2ec7430513\":\"e20b0d5c6e94d0b140245a8a55839c3f31705ff7e2455d6f13b42c2ec7430513\",\"artifact:4793:f2e1037f01a017a77834cb346b566a2e2621ca4775ddfba54242cb97b6fce86a\":\"f2e1037f01a017a77834cb346b566a2e2621ca4775ddfba54242cb97b6fce86a\"},\"sha256\":\"59adf8d3b29a4968248e93b738e4f50a64c4b9ba79994b45768a93620eca27d5\"},\"targets_sha256\":\"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209\"}\nDeclared non-witness scopes with their existing authority: [{\"key\":\"m1-native-nvtd-k6-vs-simd32-esfex\",\"kind\":\"throughput\",\"domain_md\":\"md5-mirror-ascii32-v1 candidates (32 lowercase hex ASCII bytes, full RFC 1321 MD5); vary-M7 batches of 65,536 suffixes per random 28-char prefix; gate on digest word 0.\",\"statement_md\":\"On one Apple-silicon apple-m1-class core (Linux VM), zig 0.16 cc / LLVM 21.1.0 -O3 -mcpu=apple_m1, single thread, #4185's kern_nvtd_k6_kf_bcax processes 1.378x the candidates per user-CPU second of #3871's kern_simd32_esfex (12/12 concurrent pairs, range 1.285-1.484; A/A 1.003). #4185's mca prediction was 1.075x. In the same setup, K=8 is 1.048x, K=4 0.983x, simd64_esfex 0.979x and simd32_esfex_bcax 0.805x.\",\"assumptions_md\":\"Concurrent pairs on a shared host cancel load; the A/A control bounds residual asymmetry at about +/-4%. Equal charging of setup (pre_t) and cold-path verification. The K=6 kernels are charged for the 65,472 candidates they process per batch.\",\"artifact_sha256\":[\"425c8a55a6284c161a5c372c3d67433865f7a865752617ef9e48ba3fb6e27ab1\",\"446c76d588288709db1fc722c0749e95fe95a0fd4c4d14ccbe4fb07098bf8b69\",\"e0a36264140a384a753246d522267f5a7bd033c594c8e924d58eb0b05ff8bd8f\",\"e20b0d5c6e94d0b140245a8a55839c3f31705ff7e2455d6f13b42c2ec7430513\",\"f2e1037f01a017a77834cb346b566a2e2621ca4775ddfba54242cb97b6fce86a\",\"252e05e4ff127d75d2479f7027439be01c194f7eb9775300140dd9a3b4ebdf40\",\"bde355d72b269a662cc07c4c1e1815fe79808cf55a1966c1a6d631cd663e4a4e\"],\"transfer_conditions_md\":\"Holds for this core class with upstream LLVM 21 at -mcpu=apple_m1 on Linux. Other M-generations, Apple clang or macOS may change the magnitudes; a re-time with the same driver and pair runner decides.\",\"scope_sha256\":\"cb50088f65ede6604908e03f9b203d0931e66e5351e503f1351134126d3c4999\",\"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:4793,input_sha256:\"704abfcbfae4fdd8cad580574c1214d99472c9965d72d64efdfa238d7fbc2123\",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/6672/transcript","files":[],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"report_sha256":"dab02497c3b74f120e03579211f03428de3059125c40dbf4b9b8e51e006f5bcf","next_step_sha256":null,"research_authority":{"witness_status":null,"research_status":"recorded","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}