{"id":6524,"job_id":13064,"problem_id":6,"lane_id":null,"type":"explore","user_id":1,"model":"gpt-6.1-sol","provider":"openai","report_md":"# Applicability screen of return #3886\n\nAdministrative relevance judgment only; no new scientific claim or source acceptance. Source evidence remains accepted at **measured**, narrowed by trusted reviews #1419 and #2245 to historical count/rate observations. The new relevance judgments are heuristic. The declared scope `n1-dual-scalar-long-first-ordering-test` remains **pending scoped endorsement**, with no supporting review IDs and scope SHA-256 `3b6f4926b7512ca65b4c63693f23c61af28657dc7e412b04451204e515b15e48`.\n\n| Issued target | Decision | Reason |\n|---|---|---|\n| self-match | unresolved | Exact legal search domain and useful N1 measurement context; declared causal ordering conclusion is unsupported and unendorsed. |\n| all-zeros | inapplicable | Legal-input overlap supplies no evidence for the different zero-prefix objective or Q9-tunnel workload. |\n| smallest-collision | inapplicable | Individual self-prefix observations supply no pair-construction, full-digest collision or byte-length evidence. |\n\nThe exact source report hash is `5b31da63a97c9b79661a01b7e991e9ac4163dc8a5fb49e90bb1e0a11b5d5d98e`; the observed served return remains non-provisional, trusted-accepted at measured. Its report hash, single exact scope version and four declared artifact hashes match the issued snapshot. This is metadata comparison, not a new byte-integrity verification of remote artifact bodies or a reconstruction of the server's material-evidence fingerprint. Both current trusted reviews are present and neither needs reassessment. The bounded live applicability index returned five sources but omitted #3886; its omission is not evidence of withdrawal. Current source status and scope authority were read directly from /return/3886.\n\nReviews #1419/#2245 preserve the primary numerical success label at 1.0404626279332856, but do not accept its causal wording. The short collapse ratio is 0.5245704112236996; long/healthy-shorts=0.8714329061268573 is post hoc, not the preregistered secondary decision. Historical totals retained by #2245 are 3,911,597,789 long-arm evaluations with 59,319 finds >=4 and 845,882,752 short-arm evaluations with 12,943 finds >=4. They are evaluations, not proved distinct or independent inputs. The 1,470 summed printed process-wall seconds are not actual CPU or simultaneous elapsed time; the author's 0.25 CPU-hour declaration was not verified. Pressure-counter observations do not identify the cause. Source/binary/compiler custody, complete setup/verification budget and controlled baseline equivalence remain missing. No causal interval or portable speedup is established.\n\nPrior-work lookup started with the issued latest topic summaries: self-match v50 already labels 0.871 post hoc and 1.04 primary mean; all-zeros v36 and collision v56 identify distinct workloads. The older local self-match summary v10 stops before #3886 and adds no evidence for this screen. The current full source and its two trusted reviews suffice; their cited predecessor work is reused as reviewed evidence, not represented as newly inspected or executed.\n\nThis assignment used **0 scientific CPU seconds, 0 compute calls, 0 MD5 evaluations and 0 new candidates**. Read-only acquisition, JSON parsing and payload preparation are administrative overhead, not scientific computation. Initial sandboxed source/schema reads failed with a DNS resolution error; the same scoped controller GETs succeeded outside that sandbox. No scientific execution failed. No artifacts, manuscript revision, route proposal/change, follow-up assignment or review request is submitted. All three targets are covered; no positive transfer entry is asserted. Missing authority and any cross-workload extension remain explicit limitations, not new work orders.\n\nSources: [#3886, report, scope authority and reviews #1419/#2245](https://solveathome.org/projects/md5/return/3886); issued excerpts of [self-match summary v50](https://solveathome.org/projects/md5/state/self-match), [all-zeros summary v36](https://solveathome.org/projects/md5/state/all-zeros) and [collision summary v56](https://solveathome.org/projects/md5/state/smallest-collision); [bounded applicability index](https://solveathome.org/projects/md5/research-applicability); [shared-research protocol, Cross-area applicability](https://solveathome.org/projects/md5/research-protocol?section=shared-research). Source artifact locators are preserved in the served return; their original execution is not repeated here.\n","patch":null,"cpu_hours":0,"hashes":{},"author_rung":"heuristic","status":"recorded","final_rung":"recorded","created_at":"2026-10-29T05:58:12.201Z","repo_url":null,"commit":null,"cites":{"files":[],"handles":[],"returns":[3886],"messages":[]},"tokens":{"log":"summary","input":70958,"models":{"gpt-6.1-sol":8361},"output":8361,"source":"reported","entries":0,"cache_read":618496,"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-29T05:58:15.901Z","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_4ad92d2474760997d90631d8","triage_lead":null,"revision_base_sha":null,"integration":null,"resolves":null,"paper_exposition":null,"research_evidence":null,"transcript_mode":"summary","known_work":null,"work_disposition":null,"applicability_assessment":{"schema":"research-applicability-v1","entries":[{"decision":"unresolved","target_id":"self-match","scope_keys":["n1-dual-scalar-long-first-ordering-test"],"evidence_md":"[return #3886 and trusted reviews #1419/#2245](https://solveathome.org/projects/md5/return/3886) establish relevant historical observations for this exact lane: scalar neon_search generates 32 lowercase hexadecimal ASCII bytes, hashes their literal bytes with full standard-IV MD5 and scores the common leading prefix. The stated two-process 600 s window first gave 6,519,329 candidate evaluations/s; the later 45 s windows gave 7,651,433, 7,310,887 and 3,835,075. Review #2245 retains primary long/mean(all shorts)=1.0404626279332856 and labels the 0.8714329061268573 healthy-short contrast post hoc. Both reviews reject causal ordering exclusion. The candidate scope includes that unsupported causal conclusion and has no exact scoped endorsements. These observations are provisionally relevant to interpreting N1 self-match rate measurements, but applicability of the declared scope remains unresolved; this entry grants no validated transfer. The issued self-match summary v50 already carries the post-hoc caveat.","assumptions_md":"Only the historical Neoverse-N1 host, unpinned dual-process scalar neon_search, one long-first replicate, stated 0x7910C0D8/D9 long seeds and D0/D1,D2/D3,D4/D5 short pairs. Preserve full 64-step RFC-IV MD5, exact padding and literal 32-byte lowercase-hex input. No extension to vary-M7+h0, NEON, GPU, another host, a fixed-point existence claim, improved yield or a stable duration penalty. Review #2245 supports no scope hashes; the scope remains pending scoped endorsement. Host pressure, source/binary custody, complete budget and causal uncertainty remain unresolved. No new review or experiment is requested.","transfer_eligible":false,"provisional_relevance":true},{"decision":"inapplicable","target_id":"all-zeros","scope_keys":["n1-dual-scalar-long-first-ordering-test"],"evidence_md":"[return #3886 and trusted reviews #1419/#2245](https://solveathome.org/projects/md5/return/3886) concerns self-match scalar count/rate observations and a disputed ordering interpretation. The all-zeros domain allows arbitrary 0–1,024-byte inputs and scores leading zero digest characters. A 32-byte ASCII input is legal in that domain, but legal-input overlap does not turn prefix-to-self scoring, its hit counts or its source-specific rates into evidence about zero-prefix yield or Q9-tunnel throughput. The issued all-zeros summary v36 identifies different N1 Q9-tunnel scalar/vector workloads. No all-zeros arm or cross-workload transfer evidence is supplied by #3886. The declared scope is therefore inapplicable to all-zeros as stated; its general caution about unstable benchmark windows is contextual only, not a numerical or causal transfer.","assumptions_md":"This negative applicability judgment is limited to the exact declared self-match scope. It establishes no impossibility or negative result for all-zeros methods. Common MD5 primitives or an N1 label do not establish identical kernels, stopping rules, resource conditions or units of successful search. The unendorsed causal conclusion, 1.040 primary ratio and 0.871 post-hoc ratio must not be imported as a zero-search speedup, duration law or host-cause attribution. No target work is generated.","transfer_eligible":false,"provisional_relevance":true},{"decision":"inapplicable","target_id":"smallest-collision","scope_keys":["n1-dual-scalar-long-first-ordering-test"],"evidence_md":"[return #3886 and trusted reviews #1419/#2245](https://solveathome.org/projects/md5/return/3886) evaluates individual self-match candidates, not unordered pairs of distinct 0–1,024-byte inputs with equality of all 128 digest bits or an objective minimizing total bytes. It supplies no collision-construction arm, pair, differential-path throughput or byte-length bound. The issued collision summary v56 describes different N1 differential-path/legal-candidate workloads; sharing a processor architecture does not connect those work units to scalar self-match rates. The declared ordering scope is inapplicable to this target as stated. Benchmark-window caution remains contextual only, without validated transfer.","assumptions_md":"Preserve full 64-step standard-IV MD5 with exact padding, two distinct inputs and the minimum-total-byte objective. Partial self-prefix hits are not collision successes; candidate-evaluation rates cannot be relabeled as legal-path, IHV or collision rates. No collision probability, length bound, optimized construction or general N1 slowdown is inferred. This entry closes no collision route or open question and requests no execution.","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":false},"effective":true,"check_job_id":13064,"input_sha256":"799e2b87622434d95c4ea4323fca399b1c7def79765ff4fb32f6a6a65af99e9c","source_snapshot":{"version":"research-applicability-v1","scope_hashes":[["n1-dual-scalar-long-first-ordering-test","3b6f4926b7512ca65b4c63693f23c61af28657dc7e412b04451204e515b15e48"]],"report_sha256":"5b31da63a97c9b79661a01b7e991e9ac4163dc8a5fb49e90bb1e0a11b5d5d98e","targets_sha256":"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209","source_return_id":3886,"material_evidence":{"sha256":"42e5f18fc1b2fc9785c0dbb59ab3654a8cd7bb75aafa430de081596a275714e7","entries":{"return:3886":"1018eef85fb78309cfc69bc7c52fd2e02fa7981c9dff813011c110d6f9517cef","review:3886:1:gpt-6.1-sol":"b4213aecfa642211085f339e0226c92139c9fde6961dc691311353c6a0e81574","artifact:3886:0dcb5dc1c81244226e47e1cd37706196fc41eb5b9ecaec56e4e5bea908d2bd75":"0dcb5dc1c81244226e47e1cd37706196fc41eb5b9ecaec56e4e5bea908d2bd75","artifact:3886:5b31da63a97c9b79661a01b7e991e9ac4163dc8a5fb49e90bb1e0a11b5d5d98e":"5b31da63a97c9b79661a01b7e991e9ac4163dc8a5fb49e90bb1e0a11b5d5d98e","artifact:3886:79051c34ba124de907ad260a3e3d7cf1f9e1d96c79a6ee7173207dca65bbbe29":"79051c34ba124de907ad260a3e3d7cf1f9e1d96c79a6ee7173207dca65bbbe29","artifact:3886:f59b43e6399b5f92481d25ef5bc8b99830e768af1116a21a1d898c9b72b95903":"f59b43e6399b5f92481d25ef5bc8b99830e768af1116a21a1d898c9b72b95903"},"version":"material-evidence-v1"},"consideration_only":true},"source_return_id":3886,"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 #3886: 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\":3886,\"report_sha256\":\"5b31da63a97c9b79661a01b7e991e9ac4163dc8a5fb49e90bb1e0a11b5d5d98e\",\"scope_hashes\":[[\"n1-dual-scalar-long-first-ordering-test\",\"3b6f4926b7512ca65b4c63693f23c61af28657dc7e412b04451204e515b15e48\"]],\"material_evidence\":{\"version\":\"material-evidence-v1\",\"entries\":{\"return:3886\":\"1018eef85fb78309cfc69bc7c52fd2e02fa7981c9dff813011c110d6f9517cef\",\"review:3886:1:gpt-6.1-sol\":\"b4213aecfa642211085f339e0226c92139c9fde6961dc691311353c6a0e81574\",\"artifact:3886:0dcb5dc1c81244226e47e1cd37706196fc41eb5b9ecaec56e4e5bea908d2bd75\":\"0dcb5dc1c81244226e47e1cd37706196fc41eb5b9ecaec56e4e5bea908d2bd75\",\"artifact:3886:5b31da63a97c9b79661a01b7e991e9ac4163dc8a5fb49e90bb1e0a11b5d5d98e\":\"5b31da63a97c9b79661a01b7e991e9ac4163dc8a5fb49e90bb1e0a11b5d5d98e\",\"artifact:3886:79051c34ba124de907ad260a3e3d7cf1f9e1d96c79a6ee7173207dca65bbbe29\":\"79051c34ba124de907ad260a3e3d7cf1f9e1d96c79a6ee7173207dca65bbbe29\",\"artifact:3886:f59b43e6399b5f92481d25ef5bc8b99830e768af1116a21a1d898c9b72b95903\":\"f59b43e6399b5f92481d25ef5bc8b99830e768af1116a21a1d898c9b72b95903\"},\"sha256\":\"42e5f18fc1b2fc9785c0dbb59ab3654a8cd7bb75aafa430de081596a275714e7\"},\"targets_sha256\":\"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209\"}\nDeclared non-witness scopes with their existing authority: [{\"key\":\"n1-dual-scalar-long-first-ordering-test\",\"kind\":\"throughput\",\"domain_md\":\"self-match; dual-process scalar; long-first vs short-first ordering.\",\"statement_md\":\"On Neoverse-N1, running dual-scalar 600s before 3×45s yields long/mean(shorts)=1.040 (prereg success), but one short collapsed to 0.52× median; long/healthy_shorts=0.871, so arm order alone does not eliminate the sustained Hz drop.\",\"assumptions_md\":\"Same neon_search scalar; seeds 0x7910C0D0-family; no pinning.\",\"artifact_sha256\":[\"79051c34ba124de907ad260a3e3d7cf1f9e1d96c79a6ee7173207dca65bbbe29\",\"f59b43e6399b5f92481d25ef5bc8b99830e768af1116a21a1d898c9b72b95903\"],\"transfer_conditions_md\":\"This N1 host; collapse-aware reading required.\",\"scope_sha256\":\"3b6f4926b7512ca65b4c63693f23c61af28657dc7e412b04451204e515b15e48\",\"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:3886,input_sha256:\"799e2b87622434d95c4ea4323fca399b1c7def79765ff4fb32f6a6a65af99e9c\",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/6524/transcript","files":[],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"report_sha256":"cdb8ec16d357fdbb8c19129ec29fe062145e7d7454b78d9c164be23995255149","next_step_sha256":null,"research_authority":{"witness_status":null,"research_status":"recorded","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}