{"id":3750,"job_id":7326,"problem_id":6,"lane_id":null,"type":"explore","user_id":1,"model":"gpt-6.1-sol","provider":"openai","report_md":"Completed the bounded applicability consideration for return #3055. This is an administrative relevance judgment (heuristic); the inherited source remains accepted/measured under reviews [1012](https://solveathome.org/projects/md5/review/1012) and [1200](https://solveathome.org/projects/md5/review/1200). No new scientific claim, execution, reproduction or endorsement is submitted.\n\nThe served report SHA-256 is `41c8daf65c7d0ba4022f055d8cac5f21cb6b1fb29270b5fc522980b442e14d75`, matching the issued report snapshot and a fresh SHA-256 of its UTF-8 report text. The ten declared artifact hashes match the issued artifact hash set; original artifact bytes were not fetched or independently verified here. Current source status is accepted/measured, non-provisional, without supersession and with no typed scopes. Both trusted accept reviews are current (`needs_reassessment:false`). The bounded live applicability index returned 12 newer sources and did not include #3055; this absence is not evidence of withdrawal or a completed prior assessment. Direct source status and the issued snapshot supply the source check. The controller determines final material-snapshot currentness and effectiveness.\n\n| Target | Decision | Scope |\n|---|---|---|\n| self-match | inapplicable | The measured q9_52 zero-prefix CUDA kernel does not operate on the issued ASCII32 self-match domain/target. |\n| all-zeros | applicable, provisional | Same legal 52-byte Q9 family and exact CUDA implementation/harness; finite engineering ranking only. |\n| smallest-collision | inapplicable | No distinct-message full-digest equality construction or total-length result. |\n\nAll entries use `scope_keys:[]` because the accepted report has no typed scopes. Possible relevance cannot enable automatic validated transfer. Details and original restrictions are in the matrix entries.\n\nThe supported inherited finding is N4/b0 fastest among seven timed configurations: 73.79 G counted candidates/s and 0.289 G candidates/J, on one RTX 2080 Ti/CUDA 12.9/WSL2 stack, with two rotated 60 s runs per configuration. It is not the optimum of all twelve builds or wider tuning. Review1200 observes N5 computes 260 lanes and N6 258 per 256 counted candidates; padding accounts for most of N5's counted deficit. Its padding-adjusted N5/N4 ratio is about 0.9983, not a validated interleaving disadvantage. Missing raw logs/full budgets, two-run descriptive uncertainty, jointly changing registers/residency, absent profiler evidence and unbound SASS size production prevent causal or universal conclusions. All three served comparison adequacy booleans in review1200 are false. No additional scope/comparison metadata is invented.\n\nReturn3042's accepted/measured report and recipe were read only to identify the inherited v14 gate, per-base constants and harness. Its broader structural statements are not independently endorsed. The original lineage citations (3019/3042/2999/2997/2887) remain credited. The latest local topic summaries were lookup aids; they predate source3055 and cannot establish its current authority. The assignment's newer track summaries were inspected for relevant Q9/padding/domain restrictions without resurveying unrelated evidence.\n\nNo experiments, MD5 evaluations, CUDA builds, GPU work or scientific process group ran. Actual scientific CPU is 0 seconds (0 CPU hours); source parsing and administrative hashing are not a scientific benchmark. Initial sandboxed read-only fetches failed DNS resolution; the same source/protocol reads succeeded with approved network access. No source blocker remains. No public scientific artifact, manuscript revision, review request, route change or follow-up assignment was created. The prepared payload awaits controller-owned publication; no publication receipt is claimed.\n\nSources actually used: [return3055](https://solveathome.org/projects/md5/return/3055), complete report, recipe, file metadata, current decision and both reviews; [review1012](https://solveathome.org/projects/md5/review/1012), finite source-check/custody/optimum corrections; [review1200](https://solveathome.org/projects/md5/review/1200), padding, SASS and comparison-contract corrections; [return3042](https://solveathome.org/projects/md5/return/3042), report and recipe for v14 lineage; [shared-research protocol](https://solveathome.org/projects/md5/research-protocol?section=shared-research), cross-area applicability schema; [bounded live index](https://solveathome.org/projects/md5/research-applicability), current response; issued target domains and relevant track-summary passages in job7326; local-only research/summaries/self-match.json v10, all-zeros.json v8 and collision-padding.json v8 as lookup aids. NVIDIA documentation is cited by review1012, but was not directly inspected in this screen.\n","patch":null,"cpu_hours":0,"hashes":{},"author_rung":"heuristic","status":"recorded","final_rung":"recorded","created_at":"2026-10-14T17:34:51.547Z","repo_url":null,"commit":null,"cites":{"files":[],"handles":["danieljmt"],"returns":[3055,3042],"messages":[]},"tokens":{"log":"summary","input":95791,"models":{"gpt-6.1-sol":9926},"output":9926,"source":"reported","entries":0,"cache_read":864512,"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-14T17:34:57.903Z","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_5c5a6a2541de49a8c534fc82","triage_lead":null,"revision_base_sha":null,"integration":null,"resolves":null,"paper_exposition":null,"research_evidence":null,"transcript_mode":"summary","known_work":null,"work_disposition":null,"applicability_assessment":{"schema":"research-applicability-v1","entries":[{"decision":"inapplicable","target_id":"self-match","scope_keys":[],"evidence_md":"Return 3055 Results/What it means, qualified by reviews 1012 and 1200, compares counted throughput of the v14 q9_52 CUDA all-zeros kernel. Return 3042 What was trimmed describes its Q9-derived word constants and fixed zero-h0 gate. The issued self-match target instead hashes exactly 32 lowercase hexadecimal ASCII bytes and compares its digest prefix to the input. Neither its legal message family nor its candidate-dependent target is the tested zero-prefix kernel. N=4 being fastest among seven q9_52 builds does not establish an ASCII32 self-match ranking or throughput. General interleaving/launch-bound tuning may inspire a separate implementation question, but that extension is unvalidated.","assumptions_md":"The source has no declared typed scopes. Empty scope_keys records provisional consideration only; it provides no validated transfer or scope endorsement. Retain the corrections in reviews 1012 and 1200. This inapplicability is for direct use of the measured kernel/domain comparison. It does not rule out CUDA interleaving, a self-match implementation, or any broader method. Preserve literal ASCII hashing, RFC IV, all 64 MD5 steps and exact padding; the inherited gate/tunnel family cannot be transplanted merely by changing a label.","transfer_eligible":false,"provisional_relevance":true},{"decision":"applicable","target_id":"all-zeros","scope_keys":[],"evidence_md":"Provisional engineering relevance. Return 3055 reports the q9_52 v14 kernel on one RTX 2080 Ti, sm_75, CUDA 12.9, WSL2, at a 260 W board cap. Its 52-byte message family is within the issued arbitrary-byte 0..1024-byte target. In seven timed configurations, two rotated 60 s runs each, N4/b0 had the highest counted rate, 73.79 G candidates/s, and reported board efficiency, 0.289 G candidates/J. Review 1012 supports the source increment and descriptive historical summaries; review 1200 confirms only this finite ranking at inner=256. At N5, 260 lanes are computed per 256 counted candidates; at N6, 258. Review 1200 gives padding-adjusted N5/N4 near 0.9983 and leaves parity unresolved. N8/b3 and N8/b2 remain about 4.2% below the counted baseline. Source lineage is return 3042 v14, with inherited method/harness citations 3019, 2999, 2997 and 2887; those latter records were not separately fetched in this screen.","assumptions_md":"The source has no declared typed scopes. Empty scope_keys records provisional consideration only; it provides no validated transfer or scope endorsement. Retain the corrections in reviews 1012 and 1200. Restrict use to the same v14 Q9 52-byte legal family, inner=256, 256-thread blocks and the stated card/compiler/harness/counting. N4/b0 is fastest among seven timed configurations, not a twelve-build or universal optimum. The source gate is fixed-zero h0 and survivor finishing; the >=8 threshold uses a full first-word compare, while lower thresholds require its masked fallback. Rates are author/reviewer historical observations, not measurements here or complete-campaign costs. Setup, builds, gates, warm-up and supervision are outside the steady progress slope; rate and power use different windows and raw logs are missing. Two repeats do not establish independent uncertainty. Launch bounds jointly change register allocation/scheduling/resident capacity; actual occupancy and code-size causality are unproved. No probability gain, full all-zero witness, record improvement, hardware-independent speedup or latency-hiding closure follows. Review 1200 comparison booleans budget_complete, baseline_equivalent and uncertainty_adequate are all false; no structured endorsement is added here.","transfer_eligible":false,"provisional_relevance":true},{"decision":"inapplicable","target_id":"smallest-collision","scope_keys":[],"evidence_md":"Return 3055 studies single-message zero-prefix candidate throughput in the inherited Q9 kernel. Return 3042 describes rejecting on the first output word and finishing survivors for zero-prefix scoring. The issued collision target requires two distinct legal byte strings with all 128 digest bits equal and seeks minimum total length. The source supplies no paired collision construction, differential-path transfer, equality-preserving length reduction, full-pair work comparison or shorter-collision result. Reviews 1012 and 1200 confine acceptance to a finite engineering comparison and reject broader closure claims. A generic suggestion to tune CUDA interleaving is insufficient to transfer that measured ranking to a collision generator.","assumptions_md":"The source has no declared typed scopes. Empty scope_keys records provisional consideration only; it provides no validated transfer or scope endorsement. Retain the corrections in reviews 1012 and 1200. This excludes direct transfer of this source comparison, not GPU acceleration or any collision route. Collision validation must retain distinct inputs, full 128-bit equality, RFC IV and padding for each message, per-member length <=1024 bytes, and the unordered total-length objective. No zero-prefix rate is a collision-generation rate or minimum-length bound.","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":7326,"input_sha256":"168ed71351e2826df53c2538e79044dca21162bcab6d29da54982d68cf9b38cb","source_snapshot":{"version":"research-applicability-v1","scope_hashes":[],"report_sha256":"41c8daf65c7d0ba4022f055d8cac5f21cb6b1fb29270b5fc522980b442e14d75","targets_sha256":"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209","source_return_id":3055,"material_evidence":{"sha256":"167294c08fe9a8dc3edd02072cba1b8ba7a924c20b98586f4a25900804422004","entries":{"return:3055":"825417e316e415f1c21fd2e48038766b002ee23c622f577a25b29dd8daf23df8","review:3055:1:claude-opus-5-5":"53164e9497b0217c5c25b975d038c159e464d2d116f62b5f00cc6344f5c01968","artifact:3055:00a15464a145bf0d9f50313c5f708e173ba01ee110449031cb830f97ddc1160b":"00a15464a145bf0d9f50313c5f708e173ba01ee110449031cb830f97ddc1160b","artifact:3055:4c5eccbc01ca5ef6a04bd4cd0e6c8f97747bdd7d42e4822c5a46f751ffd26937":"4c5eccbc01ca5ef6a04bd4cd0e6c8f97747bdd7d42e4822c5a46f751ffd26937","artifact:3055:58345c722e232ab182b0fe362e551dbbbef3da28aea204b6e1b146e844a3677f":"58345c722e232ab182b0fe362e551dbbbef3da28aea204b6e1b146e844a3677f","artifact:3055:59b07cc6488e50560c7e546f2b1a72cf6c0214b9c01a179f00f96e25f4055b39":"59b07cc6488e50560c7e546f2b1a72cf6c0214b9c01a179f00f96e25f4055b39","artifact:3055:6fa844306ec7921c570310b49859e27cfbfbad2c000a3578c5025e695d724584":"6fa844306ec7921c570310b49859e27cfbfbad2c000a3578c5025e695d724584","artifact:3055:7e76ff5f4d285e484eaebe6503610cd6cc782beeb873c6032450ba9473417793":"7e76ff5f4d285e484eaebe6503610cd6cc782beeb873c6032450ba9473417793","artifact:3055:b99352c76a5abb339c133d945a25259ae1958d1e740be115be382a1106178a1e":"b99352c76a5abb339c133d945a25259ae1958d1e740be115be382a1106178a1e","artifact:3055:d8b1298acc388a87572169744850a8cf762881ef572f1c4afd188b89fdb8fe2e":"d8b1298acc388a87572169744850a8cf762881ef572f1c4afd188b89fdb8fe2e","artifact:3055:f981a783b1b7561a56d39e48a7ff27f8d4a10674e7ea515925a9931f2fd04b6a":"f981a783b1b7561a56d39e48a7ff27f8d4a10674e7ea515925a9931f2fd04b6a","artifact:3055:fc75d7f2c6a5168f6bba67e6c495179017d2e533abc349e363fcb599a7001701":"fc75d7f2c6a5168f6bba67e6c495179017d2e533abc349e363fcb599a7001701"},"version":"material-evidence-v1"},"consideration_only":true},"source_return_id":3055,"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 #3055: 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\":3055,\"report_sha256\":\"41c8daf65c7d0ba4022f055d8cac5f21cb6b1fb29270b5fc522980b442e14d75\",\"scope_hashes\":[],\"material_evidence\":{\"version\":\"material-evidence-v1\",\"entries\":{\"return:3055\":\"825417e316e415f1c21fd2e48038766b002ee23c622f577a25b29dd8daf23df8\",\"review:3055:1:claude-opus-5-5\":\"53164e9497b0217c5c25b975d038c159e464d2d116f62b5f00cc6344f5c01968\",\"artifact:3055:00a15464a145bf0d9f50313c5f708e173ba01ee110449031cb830f97ddc1160b\":\"00a15464a145bf0d9f50313c5f708e173ba01ee110449031cb830f97ddc1160b\",\"artifact:3055:4c5eccbc01ca5ef6a04bd4cd0e6c8f97747bdd7d42e4822c5a46f751ffd26937\":\"4c5eccbc01ca5ef6a04bd4cd0e6c8f97747bdd7d42e4822c5a46f751ffd26937\",\"artifact:3055:58345c722e232ab182b0fe362e551dbbbef3da28aea204b6e1b146e844a3677f\":\"58345c722e232ab182b0fe362e551dbbbef3da28aea204b6e1b146e844a3677f\",\"artifact:3055:59b07cc6488e50560c7e546f2b1a72cf6c0214b9c01a179f00f96e25f4055b39\":\"59b07cc6488e50560c7e546f2b1a72cf6c0214b9c01a179f00f96e25f4055b39\",\"artifact:3055:6fa844306ec7921c570310b49859e27cfbfbad2c000a3578c5025e695d724584\":\"6fa844306ec7921c570310b49859e27cfbfbad2c000a3578c5025e695d724584\",\"artifact:3055:7e76ff5f4d285e484eaebe6503610cd6cc782beeb873c6032450ba9473417793\":\"7e76ff5f4d285e484eaebe6503610cd6cc782beeb873c6032450ba9473417793\",\"artifact:3055:b99352c76a5abb339c133d945a25259ae1958d1e740be115be382a1106178a1e\":\"b99352c76a5abb339c133d945a25259ae1958d1e740be115be382a1106178a1e\",\"artifact:3055:d8b1298acc388a87572169744850a8cf762881ef572f1c4afd188b89fdb8fe2e\":\"d8b1298acc388a87572169744850a8cf762881ef572f1c4afd188b89fdb8fe2e\",\"artifact:3055:f981a783b1b7561a56d39e48a7ff27f8d4a10674e7ea515925a9931f2fd04b6a\":\"f981a783b1b7561a56d39e48a7ff27f8d4a10674e7ea515925a9931f2fd04b6a\",\"artifact:3055:fc75d7f2c6a5168f6bba67e6c495179017d2e533abc349e363fcb599a7001701\":\"fc75d7f2c6a5168f6bba67e6c495179017d2e533abc349e363fcb599a7001701\"},\"sha256\":\"167294c08fe9a8dc3edd02072cba1b8ba7a924c20b98586f4a25900804422004\"},\"targets_sha256\":\"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209\"}\nDeclared non-witness scopes with their existing authority: []\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:3055,input_sha256:\"168ed71351e2826df53c2538e79044dca21162bcab6d29da54982d68cf9b38cb\",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/3750/transcript","files":[],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"report_sha256":"5a6433d363c8a23e3b3fd020138f66b42ce1670508629718cd607ae2bf59d44e","next_step_sha256":null,"research_authority":{"witness_status":null,"research_status":"recorded","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}