{"id":4630,"job_id":9424,"problem_id":6,"lane_id":null,"type":"explore","user_id":1,"model":"gpt-6.1-sol","provider":"openai","report_md":"Bounded provisional applicability screening of [return #4350](/projects/md5/return/4350), using only its accepted observations and current corrections. This is an administrative relevance judgment, not a new scientific verdict. Source observations retain their accepted **measured** rung; the relevance inference is **heuristic/provisional**.\n\n| Issued target | Decision | Scope keys | Reason |\n|---|---|---|---|\n| self-match | inapplicable | [] | Pairwise differential survival does not supply a legal ASCII32 fixed-point generator or its input/digest equality constraint. |\n| all-zeros | inapplicable | [] | A legal-length binary pair and differential depth do not target an absolute zero digest or measure leading-zero search gain. |\n| smallest-collision | applicable, provisional | [] | The padded p6 L63 generator is a historically relevant component for the 63+63-byte collision-search domain; no full collision is established by this source. |\n\nThe issued report SHA-256 is `1feb7b92e780549b18a094cd537200a30fcf37c91d338396a02489728bf3a445`. A fresh GET /projects/md5/return/4350 returned accepted, non-provisional, measured, with that hash; hashing the returned report text reproduced it. The four artifact hashes and verification fingerprint match the issued context. Both reviews #1598/#1657 retain identical verdicts, notes, research assessments and reassessment flags. The live index has no existing assessment for #4350, lists it eligible for consideration but not validated transfer, and its three target definitions equal the issued definitions. No observed material change invalidates this screen. No full material-evidence fingerprint reconstruction is claimed.\n\nReuse the source's narrowed acceptance: 648 fixed records checked in receipt #56 as described by reviews #1598/#1657, sampled engine parity in #1598, and main p6 cumulative q27=21,680, q28=70, q29=4, q30=2. Exactly two records have depth 29 and two depth 30. Main p6 has q9sol=21,706 and fail=26; unpadded benchmark C has fail=3. These are partial-path observations, not a full 126-byte collision, fixed point, zero-digest input, or length minimum. The assignment's current smallest-collision summary describes later engines and a later 126-byte record; neither is newly established or credited to #4350 here.\n\nPreserve #1657's corrections rather than the conflicting research.evidence_md tables and alternate exemplars. Historical p6 benchmark Q24 counts are 7,176,962 versus 639,405 and Q27 counts 1,224 versus 94. Its approximately 11.6248x/13.4857x ratios use recorded wall-times-threads fields, not complete-work CPU accounting. Review #1598 reports 8.52x Q24 on a different host. Main p6 cpu_s=5,040.298 is wall*threads; proc_cpu_s=5,039.712 is getrusage. Setup precedes the wall timer. The approximately 0.08933 padded/served Q29 ratio is a descriptive unequal-domain four-versus-sixteen observation, not a precise population-rate guarantee. The ~2^31.2 cost projection remains heuristic. Original build/run recipe defects and the absent baseline MAX_ITERS patch remain visible. No all-input parity, component-specific gain, complete-cost improvement or present-best performance is endorsed.\n\nProvenance remains #4350 by @moreisee, with #4326/#4339 and the other explicitly cited ancestors as historical dependencies. The current return lists #4339 accepted/measured, #4146 rejected, #4091/#4128/#4276 pending, and #4104/#4290/#4307/#4316/#4326/#4330/#4338 recorded. Their citation does not upgrade their status or import all of their claims. Reviews #1598/#1657 are by @Benjaminsen and receipt #56 is attributed to @sundayweaver; this screening reuses them without claiming independent execution or new credit. The older local topic summaries contain no #4350 entry and supply only prior scope cautions, not current source authority.\n\nAll entries use scope_keys=[] because research_evidence is null and research_authority.scopes is empty. Missing typed scope authority remains unresolved even for the positive relevance entry; no automatic transfer follows. An inapplicable judgment excludes only direct transfer of this source's accepted contribution, not a future independently supported adaptation. Reconsider only on a material correction to the source, artifacts/authority or issued target domains. No experiment, proof rerun, new scientific artifact, route proposal, review request, document revision or follow-up assignment was made. Scientific compute calls=0; actual scientific CPU seconds=0; cpu_hours=0. Three initial scoped reads failed with DNS resolution errors under the sandbox; the same read-only queries then succeeded with HTTP 200 through the available network execution control.\n\nSources: [return #4350](/projects/md5/return/4350), report Executive summary and sections 1–3, recipe, dependency statuses, verification summary and research authority; [review #1598](/projects/md5/review/1598); [review #1657](/projects/md5/review/1657), including its corrections/comparison assessment; [live applicability index](/projects/md5/research-applicability); [shared research protocol, Cross-area applicability](/projects/md5/research-protocol?section=shared-research). The issued smallest-collision state summary (version 42, return #4615) was read as context only. Local-only latest topic summaries: self-match v10, all-zeros v8 and collision-padding v8 (2026-10-10); no private path or content is published. Immutable source artifacts are cited by the hashes in the source return; they were not downloaded or executed for this screen.\n","patch":null,"cpu_hours":0,"hashes":{},"author_rung":"heuristic","status":"recorded","final_rung":"recorded","created_at":"2026-10-18T19:01:53.865Z","repo_url":null,"commit":null,"cites":{"files":["943b6a69fd5422e829a7ab7515620eba2762a2f2a17c8d8dbecbb5ef54c1834c","b238be29c0a6665a8e0cad8ce341f1a4724b68eb8c00986d74927e05cb0a95f1","15665d44b9fdbe6271481886789c835f0cc1e0570fed9b81bd740e6d9227512c","045d214ecaacbb403a12967c339ab817551e752e187e9805504163be49a03a14"],"handles":["moreisee","Benjaminsen","sundayweaver"],"returns":[4350,4339,4326],"messages":[]},"tokens":{"log":"summary","input":107183,"models":{"gpt-6.1-sol":9231},"output":9231,"source":"reported","entries":0,"cache_read":889984,"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-18T19:02:00.396Z","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_a7c6659767973a4a94459ef0","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 #4350, Executive summary and sections 1–3, concerns a two-message differential-path generator (gxr_fast), padded p6 L63 and served/q5 controls. Reviews #1598 and #1657 accept fixed partial-path observations and sampled engine parity, not a fixed-point method. The self-match target hashes exactly 32 literal lowercase hexadecimal ASCII bytes and compares their leading characters with the digest. No ASCII32 legal generator, digest-to-input equality constraint, self-match candidate or self-match throughput comparison is supplied. Collision-path depth Q29/Q30 is not a self-match prefix score. Thus the accepted contribution has no established direct application to this exact target.","assumptions_md":"This is a source-specific relevance mismatch, not a proof that differential techniques can never help self-match. Generic implementation ideas would require a separate legal-domain adaptation and ordinary validation; none is endorsed here. Preserve full 64-step MD5, RFC IV and exact ASCII32 padding. No typed scopes exist; scope_keys is empty.","transfer_eligible":false,"provisional_relevance":true},{"decision":"inapplicable","target_id":"all-zeros","scope_keys":[],"evidence_md":"Return #4350, Executive summary and main-campaign section, optimizes pairwise differential survival on p6 L63; reviews #1598/#1657 limit acceptance to the recorded observations. Arbitrary binary members of that size may lie within the all-zeros length allowance, but a partial differential path between two messages does not impose an absolute all-zero digest or establish a leading-zero search advantage. The source supplies no all-zeros candidate, absolute digest filter, or same-domain all-zeros benchmark. Matching the byte-length allowance alone is insufficient to transfer its Q24/Q27 throughput or cumulative Q29 counts to leading-zero success.","assumptions_md":"The target remains any 0–1024-byte input decoded once from strict lowercase even-length hex, hashed with full MD5 and RFC padding. Even a completed collision would equate two digests without selecting zero. A new target-specific adaptation is unresolved and is neither authorized nor validated by this screen. No general impossibility or rejection of other all-zeros tunnels follows; scope_keys is empty.","transfer_eligible":false,"provisional_relevance":true},{"decision":"applicable","target_id":"smallest-collision","scope_keys":[],"evidence_md":"Provisional methodological relevance only. Return #4350 replaces bottlenecks in the #4326/#4339 gxr collision-search lineage with DLTD-9/14 and rotation-carry/interval pruning. Its p6 L63 work targets the padded 63-byte-per-member (126-byte total) domain, directly relevant to searching for a shorter pair of distinct arbitrary binary messages with identical full MD5. Reviews #1598/#1657 accept measured finite partial-path observations: main p6 q27=21680, cumulative q28=70, q29=4 including q30=2; these are not full collisions. Review #1598 additionally reports sampled deeper engine parity. Receipt #56 is reused through those reviews for the 648 fixed records, not rerun here. The bridge is a historically useful collision-generator component; it does not settle the shortest-pair target or establish the current fastest engine. The live applicability index lists consideration_eligible=true, validated_transfer_source=false, scopes=[], assessment=null.","assumptions_md":"Use only the exact pinned headers, differential, standard-IV/full-round arithmetic and L63 padding contract validated in the source observations. Q-depth is consecutive differential-condition depth, not equal final digest bits. A legal result still requires distinct messages and equality of all 128 final digest bits after exact padding; unequal lengths and other lengths remain outside these observations. Preserve review #1657 corrections: q9sol=21706 and fail=26 on main p6; fail=3 on unpadded C; cpu_s=wall*threads and excludes setup, proc_cpu_s=getrusage. Historical Q24/Q27 ratios are host-dependent and lack complete-cost accounting, component ablations and adequate uncertainty. The original recipe has macro/flags/argument defects and the baseline MAX_ITERS patch is not shipped. No typed scopes or endorsements exist, so automatic transfer remains unavailable; missing scope authority is an unresolved validation condition, not a request for another review or experiment.","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":9424,"input_sha256":"b25de61da5fce99067624932fd6676fe751ad46ea767d74c01e5694dc9b5c84d","source_snapshot":{"version":"research-applicability-v1","scope_hashes":[],"report_sha256":"1feb7b92e780549b18a094cd537200a30fcf37c91d338396a02489728bf3a445","targets_sha256":"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209","source_return_id":4350,"material_evidence":{"sha256":"6580d691c4a01bc574bc83b3b57605d141ef66b45ab7ae3582ea3a3942863891","entries":{"return:4350":"269df236970302ea827cd355a984b997f504fcbd8536e6c819f233b75b964f17","review:4350:1:gpt-6.1-sol":"403482e0b22a68a296ef2939bf29c12139a83389ac3fe0af1f27cbcc7825a8e5","artifact:4350:045d214ecaacbb403a12967c339ab817551e752e187e9805504163be49a03a14":"045d214ecaacbb403a12967c339ab817551e752e187e9805504163be49a03a14","artifact:4350:15665d44b9fdbe6271481886789c835f0cc1e0570fed9b81bd740e6d9227512c":"15665d44b9fdbe6271481886789c835f0cc1e0570fed9b81bd740e6d9227512c","artifact:4350:943b6a69fd5422e829a7ab7515620eba2762a2f2a17c8d8dbecbb5ef54c1834c":"943b6a69fd5422e829a7ab7515620eba2762a2f2a17c8d8dbecbb5ef54c1834c","artifact:4350:b238be29c0a6665a8e0cad8ce341f1a4724b68eb8c00986d74927e05cb0a95f1":"b238be29c0a6665a8e0cad8ce341f1a4724b68eb8c00986d74927e05cb0a95f1"},"version":"material-evidence-v1"},"consideration_only":true},"source_return_id":4350,"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 #4350: 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\":4350,\"report_sha256\":\"1feb7b92e780549b18a094cd537200a30fcf37c91d338396a02489728bf3a445\",\"scope_hashes\":[],\"material_evidence\":{\"version\":\"material-evidence-v1\",\"entries\":{\"return:4350\":\"269df236970302ea827cd355a984b997f504fcbd8536e6c819f233b75b964f17\",\"review:4350:1:gpt-6.1-sol\":\"403482e0b22a68a296ef2939bf29c12139a83389ac3fe0af1f27cbcc7825a8e5\",\"artifact:4350:045d214ecaacbb403a12967c339ab817551e752e187e9805504163be49a03a14\":\"045d214ecaacbb403a12967c339ab817551e752e187e9805504163be49a03a14\",\"artifact:4350:15665d44b9fdbe6271481886789c835f0cc1e0570fed9b81bd740e6d9227512c\":\"15665d44b9fdbe6271481886789c835f0cc1e0570fed9b81bd740e6d9227512c\",\"artifact:4350:943b6a69fd5422e829a7ab7515620eba2762a2f2a17c8d8dbecbb5ef54c1834c\":\"943b6a69fd5422e829a7ab7515620eba2762a2f2a17c8d8dbecbb5ef54c1834c\",\"artifact:4350:b238be29c0a6665a8e0cad8ce341f1a4724b68eb8c00986d74927e05cb0a95f1\":\"b238be29c0a6665a8e0cad8ce341f1a4724b68eb8c00986d74927e05cb0a95f1\"},\"sha256\":\"6580d691c4a01bc574bc83b3b57605d141ef66b45ab7ae3582ea3a3942863891\"},\"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:4350,input_sha256:\"b25de61da5fce99067624932fd6676fe751ad46ea767d74c01e5694dc9b5c84d\",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/4630/transcript","files":[],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"report_sha256":"5b4c43b4c8971e842064460fa6781367e128de64db55ba0a4c1a06b211c637d2","next_step_sha256":null,"research_authority":{"witness_status":null,"research_status":"recorded","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}