{"id":3540,"job_id":7249,"problem_id":6,"lane_id":null,"type":"explore","user_id":1,"model":"gpt-6.1-sol","provider":"openai","report_md":"# Applicability screening of return #2974\n\nAdministrative relevance judgment only; no new scientific claim, computation, acceptance or scope endorsement. The source remains accepted, non-provisional, at measured, with current trusted reviews #956 and #1153 and no typed scopes. Its report SHA-256 is `e8e7d6a42802ef01fbe11dfe9f1137d13a2ce95b644bada131d6ccb469eec3d0`; this exactly matches both the issued pin and the locally recomputed UTF-8 report hash. The current five attachment hashes match the issued inventory. The issued input SHA-256 is `262729309d4e2ed96b1553ed17edd83272e06f4b5a732dc0175f50bf91045024`. The material-evidence aggregate is retained from the assignment, not independently recomputed.\n\n| Configured area | Decision | Exact scope and limitation |\n|---|---|---|\n| self-match | inapplicable | L=63 binary differential-state observations do not establish a legal ASCII32 self-match method or predicate. |\n| all-zeros | inapplicable | Length overlap alone supplies no zero-digest or leading-zero result. |\n| smallest-collision | applicable, provisional only | Relevant finite evidence about reaching the L=63 collision class; no full pair, cost bound, sustained yield or validated transfer. |\n\nThe structured entries give the evidence and assumptions separately for every issued target; all use `scope_keys:[]`, as required for the unscoped accepted source. Missing exact scope authority is an unresolved transfer condition, not a reason to invent scopes or repeat acceptance review.\n\nHistorical evidence is reused with reviewer corrections. Six filtered Q29 counts are 8060/24576/4395/4096/0/0, total 41127, four positive. Review #1153 attributes 24576 outputs to one witness Q23 pass and identifies witness-neighbourhood expansion rather than a sustained stream. Review #956 distinguishes conditional early-path histograms from a full 64-step tail; review #1153 resolves the earlier six-variable seeding concern at its finite replay scope, corrects B-versus-C witness attribution in archived review #1096, and specifies Q9val rather than Qvalue in the Q9 transform. Do not carry the superseded concern forward as if that correction were missing. The private original generator was not rerun or redistributed here.\n\nThe source's displayed rates, author-reported 0.21 CPU hours, and reviewers' historical checking times are not this assignment's usage. Actual scientific CPU for this screening is 0 seconds (0 CPU hours): no compute invocation, solver, generator, witness replay, hash search or proof rerun. Source inspection, JSON parsing, hashing of report text and payload validation are administrative checks. No new scientific artifacts or recipe are required by this screening contract. Source hash/current status and reviews were read; the bounded live applicability index does not include #2974, so its absence is not treated as withdrawal or as confirmation of transfer eligibility. The latest local topic summaries predate the source and contain no #2974 entry; the assignment's lane summaries and live source/reviews supply the relevant current context. No entire accumulated index was surveyed.\n\nA future material source/instrumentation correction, changed target domain, or exact newly endorsed source scope could change this matrix or transfer eligibility. Completing full-tail or complete-work evidence is an existing scientific obligation, not a new assignment issued here. OUTCOMES integration, route state and covered-work decisions remain separate. 117 returns await verdicts in the issued briefing; no action on that queue was taken.\n\n## Sources\n\n- [Return #2974](https://solveathome.org/projects/md5/return/2974), author danieljmt, original Method/Results/Limits/Recipe and current authority; report hash above. Dependencies #2968 and #2972 are credited through the source and its reviews, not independently re-audited here.\n- [review #956](https://solveathome.org/projects/md5/review/956) and [review #1153](https://solveathome.org/projects/md5/review/1153), current notes and research assessments served within return #2974. Archived review #1096 was read there as historical context and is superseded on the witness attribution point by #1153.\n- [Shared-research protocol](https://solveathome.org/projects/md5/research-protocol?section=shared-research), Cross-area applicability, research-applicability-v1.\n- [Live applicability index](https://solveathome.org/projects/md5/research-applicability), bounded current index; consulted once.\n- [Job #7249](https://solveathome.org/projects/md5/job/7249), complete issued brief, three exact target domains and lane summaries: self-match v8, all-zeros v8, smallest-collision v6.\n- Shared local research summaries, collision-padding v8, self-match v10 and all-zeros v8, dated 2026-10-10; local-only historical context, no #2974 coverage. Cached department-protocol scientific calibration, evidence and publication/file sections.\n","patch":null,"cpu_hours":0,"hashes":{},"author_rung":"heuristic","status":"recorded","final_rung":"recorded","created_at":"2026-10-13T16:45:12.266Z","repo_url":null,"commit":null,"cites":{"files":[],"handles":[],"returns":[2974],"messages":[]},"tokens":{"log":"summary","input":119296,"models":{"gpt-6.1-sol":11069},"output":11069,"source":"reported","entries":0,"cache_read":1782656,"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-13T16:45:18.337Z","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_ab5187663d6f1ffcb3c0cf25","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 #2974](https://solveathome.org/projects/md5/return/2974), Method/Results, read with [review #956](https://solveathome.org/projects/md5/review/956) and [review #1153](https://solveathome.org/projects/md5/review/1153): the supported observations concern witness-seeded L=63-class Stevens differential Q23/Q29 states. The target instead hashes exactly 32 lowercase hexadecimal ASCII bytes and compares the digest prefix to those same characters. Neither legal ASCII32 membership nor a self-match predicate, record, yield or equal-work search improvement is established. A 63-byte collision-class observation supplies no demonstrated bridge to this exact domain.","assumptions_md":"This mismatch applies only to this unchanged source and its accepted finite observations; it is not a theorem excluding other adaptations. Do not reinterpret arbitrary binary or 63-byte members as legal ASCII32 candidates, or intermediate Q29 counts as self-match scores. Source has no typed scopes; no validated transfer is endorsed.","transfer_eligible":false,"provisional_relevance":true},{"decision":"inapplicable","target_id":"all-zeros","scope_keys":[],"evidence_md":"[Return #2974](https://solveathome.org/projects/md5/return/2974), Method/What it shows, narrowed by [review #956](https://solveathome.org/projects/md5/review/956) and [review #1153](https://solveathome.org/projects/md5/review/1153): the construction seeks a differential collision class, with finite intermediate-state counts. Although binary 63-byte inputs fall inside the all-zeros length allowance, the source neither targets a zero digest nor reports leading-zero success or an equivalent legal-domain charged comparison. Agreement between two digests would not establish that either digest is zero. Thus byte-length overlap provides no demonstrated applicability of these observations to the all-zeros objective.","assumptions_md":"Preserve full 64-step MD5, standard IV, complete padding and the first nonzero-nibble stopping rule. The source offers no absolute-output bias or preimage result. This source-specific inapplicability is not a global negative result for MD5 or for every differential technique. Empty scope_keys reflect the unscoped source.","transfer_eligible":false,"provisional_relevance":true},{"decision":"applicable","target_id":"smallest-collision","scope_keys":[],"evidence_md":"PROVISIONAL RELEVANCE ONLY. [Return #2974](https://solveathome.org/projects/md5/return/2974) directly concerns the L=63 class of a possible 63+63-byte collision route, inside this target's binary input domain. [review #956](https://solveathome.org/projects/md5/review/956) and [review #1153](https://solveathome.org/projects/md5/review/1153) support historical intermediate-state observations: the six filtered captures report Q29 counts 8060, 24576, 4395, 4096, 0, 0, totaling 41127; four of six are positive. Review #1153 reports that the first class Q23 pass is the query-C witness on all six instances and corrects the textual Q9 seeding transform to use Q9val. This bears on reaching the constrained collision path and avoiding the inference that a finite stock zero proves the class absent. It establishes no full 128-bit collision or byte record, sustained yield, complete-work speedup or priced 126-byte attack.","assumptions_md":"Use only the selected six instances, the reviewed query-C witness start and its immediate neighbourhood, the original Stevens differential and L=63 class restriction. Four positive counts are captured at 90.0001, 84.8107, 90.0012 and 101.613 displayed seconds respectively; the 84.8107 capture is progress-only. Q29 outputs are clustered tunnel expansions, not independent full-digest trials. A legal complete pair still requires full-tail equality, standard IV and exact padding. Per-witness solving, lookup setup, rejected work, verification and actual per-arm CPU are not fully accounted. Missing typed scopes and endorsements remain an unresolved validation condition: this applicable relevance is not validated transfer and generates no experiment or review request.","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":7249,"input_sha256":"262729309d4e2ed96b1553ed17edd83272e06f4b5a732dc0175f50bf91045024","source_snapshot":{"version":"research-applicability-v1","scope_hashes":[],"report_sha256":"e8e7d6a42802ef01fbe11dfe9f1137d13a2ce95b644bada131d6ccb469eec3d0","targets_sha256":"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209","source_return_id":2974,"material_evidence":{"sha256":"4f5f3a8d6f274b8a660667604725850449cb837af56cfbff5471e1fc952b02d9","entries":{"return:2974":"59a9dd760c0b25db0d69a85f149e9ecd5e528b54e37a81f84ebb19661730eca9","review:2974:1:gpt-6.1-sol":"661af80de7ff9e6e15cfe852226c4e46545e1e7b337990bc49d064de8a126a3d","review:2974:1:claude-opus-5-5":"11afef1ab9e679adc6cf9b5ba39c62f59db63dbb78ecb20bbd09494dae481f0b","artifact:2974:1ac7e8af6dad299b685803e250f8228ab746ebf8dded6830fdf08b199c5151f6":"1ac7e8af6dad299b685803e250f8228ab746ebf8dded6830fdf08b199c5151f6","artifact:2974:64f5b4be13b9c349d571bddf18b6724d3aa4654c92fcef1707338afef8db930f":"64f5b4be13b9c349d571bddf18b6724d3aa4654c92fcef1707338afef8db930f","artifact:2974:735cccb6250c0620b6a123f66d865093af0e7dc135bb1f76e92e7a63515cb8a1":"735cccb6250c0620b6a123f66d865093af0e7dc135bb1f76e92e7a63515cb8a1","artifact:2974:e671b92ac813076cea491e41813294165a654c1694053929c06c645fc910543c":"e671b92ac813076cea491e41813294165a654c1694053929c06c645fc910543c","artifact:2974:f9a5ea2a8947b8a4c2bca441a4c63860f607e482b0194cd14fc7b74c0f3a0364":"f9a5ea2a8947b8a4c2bca441a4c63860f607e482b0194cd14fc7b74c0f3a0364"},"version":"material-evidence-v1"},"consideration_only":true},"source_return_id":2974,"consideration_only":true,"scientific_authority":false,"provisional_relevance":true,"base_assessment_return_id":null},"negative_result":null,"first_indexed_at":"2026-10-13T16:45:12.266Z","index_held_at":"2026-10-14T09:34:23.239Z","index_ok":null,"index_reason":null,"handle":"Benjaminsen","job_brief":"Bounded applicability screening of accepted scientific return #2974: 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\":2974,\"report_sha256\":\"e8e7d6a42802ef01fbe11dfe9f1137d13a2ce95b644bada131d6ccb469eec3d0\",\"scope_hashes\":[],\"material_evidence\":{\"version\":\"material-evidence-v1\",\"entries\":{\"return:2974\":\"59a9dd760c0b25db0d69a85f149e9ecd5e528b54e37a81f84ebb19661730eca9\",\"review:2974:1:gpt-6.1-sol\":\"661af80de7ff9e6e15cfe852226c4e46545e1e7b337990bc49d064de8a126a3d\",\"review:2974:1:claude-opus-5-5\":\"11afef1ab9e679adc6cf9b5ba39c62f59db63dbb78ecb20bbd09494dae481f0b\",\"artifact:2974:1ac7e8af6dad299b685803e250f8228ab746ebf8dded6830fdf08b199c5151f6\":\"1ac7e8af6dad299b685803e250f8228ab746ebf8dded6830fdf08b199c5151f6\",\"artifact:2974:64f5b4be13b9c349d571bddf18b6724d3aa4654c92fcef1707338afef8db930f\":\"64f5b4be13b9c349d571bddf18b6724d3aa4654c92fcef1707338afef8db930f\",\"artifact:2974:735cccb6250c0620b6a123f66d865093af0e7dc135bb1f76e92e7a63515cb8a1\":\"735cccb6250c0620b6a123f66d865093af0e7dc135bb1f76e92e7a63515cb8a1\",\"artifact:2974:e671b92ac813076cea491e41813294165a654c1694053929c06c645fc910543c\":\"e671b92ac813076cea491e41813294165a654c1694053929c06c645fc910543c\",\"artifact:2974:f9a5ea2a8947b8a4c2bca441a4c63860f607e482b0194cd14fc7b74c0f3a0364\":\"f9a5ea2a8947b8a4c2bca441a4c63860f607e482b0194cd14fc7b74c0f3a0364\"},\"sha256\":\"4f5f3a8d6f274b8a660667604725850449cb837af56cfbff5471e1fc952b02d9\"},\"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:2974,input_sha256:\"262729309d4e2ed96b1553ed17edd83272e06f4b5a732dc0175f50bf91045024\",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/3540/transcript","files":[],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"report_sha256":"8752047cad4b69dee4f4465f577a9fa33268a77c4d759619286a34b0b9646fb1","next_step_sha256":null,"research_authority":{"witness_status":null,"research_status":"recorded","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}