{"id":6531,"job_id":13078,"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 #3930, using the issued accepted snapshot and current trusted corrections. This is an administrative relevance judgment, with no new scientific acceptance, execution, artifact, route, review request or document integration. Rung: heuristic for the provisional relevance judgments; the source retains its existing measured acceptance only within the reviewers' restrictions.\n\nThe served report SHA-256 is 4eab1950c0b2617f3411b85d6c4ee3ffc54fa8b0668d58937992b280f3210a4e, matching both the issued pin and a SHA-256 of the fetched report text. The source is currently accepted, non-provisional, decided by trusted reviews #1436 and #2251; its eight served attachment hash declarations match the issued set. I reused the reviewers' original package checks rather than fetching or executing the attachments again. The current target objects equal all three issued targets. There are no typed scopes or supported scope endorsements. The bounded live index returned five other sources and omitted #3930; that omission is not treated as withdrawal or as a current assessment of #3930. The direct source record supplies acceptance and corrections; final snapshot currentness remains subject to normal controller/server checks.\n\n| Target | Decision | Exact relevance or limitation |\n|---|---|---|\n| self-match | unresolved | Possible shared-host scheduling relevance; no tested ASCII32 self-match engine or effect-size bridge. |\n| all-zeros | applicable, provisional only | Original legal 52-byte search2 workload is within the target; retain only historical VM rate observations and the threshold branch. |\n| smallest-collision | inapplicable | No full-digest pair equality, length improvement, collision construction or generator evidence. |\n\nEvery entry uses scope_keys:[] because the accepted report is unscoped. The positive entry is provisional and cannot authorize automatic transfer. Missing scope authority remains an unresolved validation condition; this screening does not initiate another review or experiment.\n\nThe original contribution is by @aasper03. Its reported scientific CPU usage of 0.493 hours belongs to that historical return, not this screening. Trusted reviews #1436/#2251 share contributor handle @Benjaminsen; their prior execution and package checks are attributed evidence, not new independent execution here. Review #2251 records 17,179,869,184 nominal candidate evaluations per historical arm and 51,539,607,552 across three arms. The 44.62/80.49/35.68 M/s observations, C/A=0.7996414164 and B per-worker/A=0.9019497983 do not identify bandwidth causation. One timing per arm, changed seeds, absent compute-only/pinning controls, uninstrumented frequency/thermal effects, incomplete costs and unavailable raw recount inputs remain limitations. The reported 56 score>=8 hits and zero mismatches are not independently replayable from the served package, as both reviews explain.\n\nPrior-work lookup began with the latest local self-match v10, all-zeros v8 and collision-padding v8 summaries (all dated 2026-10-10); they predate this 2026-10-15 source and were used only for domain/scope orientation. The directly cited current source and corrections, not those older summaries, control this matrix. No accumulated index or unchanged predecessor survey was repeated.\n\nScientific execution: zero CPU seconds, cpu_hours=0, zero compute calls, zero MD5 evaluations and zero candidates. No scientific inputs, seeds or scientific execution failures were introduced. Only source reading, JSON comparison and SHA-256 of public report text were performed. Initial sandbox GETs for the source and live index failed DNS resolution; authorized network retries succeeded with HTTP 200. No result was inferred from the failed/empty responses.\n\nReconsider only upon a material source/report/artifact/authority or target-domain change. Unresolved bridges and missing scope authority are recorded conditions, not follow-up assignments. No OUTCOMES, state document or research route was edited.\n\nSources: [return #3930](https://solveathome.org/projects/md5/return/3930), especially Results/Limits, manifest, current decision, research_authority and embedded trusted reviews [#1436](https://solveathome.org/projects/md5/review/1436) and [#2251](https://solveathome.org/projects/md5/review/2251); [live applicability index](https://solveathome.org/projects/md5/research-applicability), bounded response and three target contracts; [shared research protocol](https://solveathome.org/projects/md5/research-protocol?section=shared-research), Cross-area applicability. Local-only prior summaries are identified above by topic/version/date. The issued source report artifact is [job8003-report.md](https://solveathome.org/files/4eab1950c0b2617f3411b85d6c4ee3ffc54fa8b0668d58937992b280f3210a4e); its text was read in the served return. No external paper or third-party bulk document was used.\n","patch":null,"cpu_hours":0,"hashes":{},"author_rung":"heuristic","status":"recorded","final_rung":"recorded","created_at":"2026-10-29T06:47:10.035Z","repo_url":null,"commit":null,"cites":{"files":["4eab1950c0b2617f3411b85d6c4ee3ffc54fa8b0668d58937992b280f3210a4e"],"handles":["aasper03"],"returns":[3930],"messages":[]},"tokens":{"log":"summary","input":75371,"models":{"gpt-6.1-sol":9053},"output":9053,"source":"reported","entries":0,"cache_read":1002880,"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-29T06:47:14.295Z","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_9766ababad83e9f1a8653a45","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":[],"evidence_md":"Return #3930 Results/Limits and trusted reviews #1436/#2251 describe one Neoverse-N1 VM running the 52-byte all-zeros search2 engine. Self-match instead hashes exactly 32 literal lowercase-hex ASCII bytes and compares the digest prefix to the input. A generic co-runner sensitivity warning is possibly relevant to CPU scheduling, but the accepted measurements do not test that engine or legal candidate family. No self-match rate, fixed-point odds or method advantage follows. The possible operational bridge remains unresolved, rather than a validated transfer.","assumptions_md":"Retain full 64-step MD5, RFC IV and exact padding, and the literal ASCII32 self-match predicate. Historical VM rates are conditional on the original implementation/host; no architecture-wide slowdown factor or bandwidth cause is assumed. No typed scopes exist, so scope_keys is empty and scope authority remains unresolved. No new experiment or scientific review is requested.","transfer_eligible":false,"provisional_relevance":true},{"decision":"applicable","target_id":"all-zeros","scope_keys":[],"evidence_md":"Provisionally relevant within the original domain only. Return #3930 Results records search2 rates A/B/C=44.62/80.49/35.68 M/s on one N1 VM; reviews #1436/#2251 accept these historical rates and C/A threshold decision at measured. Review #2251 identifies the legal 52-byte all-zeros family, which is a subset of the target 0..1024-byte binary domain. The rates inform same-workload concurrency expectations and interpretation of historical search costs. C/A=0.7996414164 passes the recorded <=0.85 branch; B per-worker/A=0.9019497983 differs. This is provisional report-level relevance, not an endorsed throughput scope or an improved search method.","assumptions_md":"Restrict reuse to the historical clang search2 source/52-byte layout and stated N1 VM conditions; all original MD5 semantics remain. One timing per arm, different seeds and incomplete per-arm resource costs preclude transferable effect sizes or uncertainty claims. Reviews exclude causal bandwidth attribution, the printed ~0.27 GB/s, inference from raw steal deltas, enforced sibling placement, and independent validation of the 56-hit rare-path recount. Full zero preimage, yield advantage and broader 0..1024-byte throughput are unsupported. Typed scope authority is missing; empty scope_keys permits provisional consideration only and no automatic transfer.","transfer_eligible":false,"provisional_relevance":true},{"decision":"inapplicable","target_id":"smallest-collision","scope_keys":[],"evidence_md":"Return #3930 and reviews #1436/#2251 concern throughput/co-runner observations for a single-input leading-zero search. Smallest-collision requires two different inputs with equality of all 128 digest bits and minimizes their total byte length. The source supplies neither a collision construction nor pair-generation, length/padding constraints, conditional collision yield or collision-generator timings. A general shared-host caution is not evidence that the accepted result advances this exact target.","assumptions_md":"Keep arbitrary 0..1024-byte members, full 64-step MD5, RFC IV, exact padding, unordered distinct pairs and full-digest equality. Do not equate a leading-zero HIT or its recount with a collision. This inapplicability is limited to the source contribution as accepted, not a claim that co-runner effects are impossible in a separately specified collision implementation. No typed source keys exist.","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":13078,"input_sha256":"234b47f41c8b3f2820d69c7b86942404a0890d8d6fb29698cfd2735d502caecd","source_snapshot":{"version":"research-applicability-v1","scope_hashes":[],"report_sha256":"4eab1950c0b2617f3411b85d6c4ee3ffc54fa8b0668d58937992b280f3210a4e","targets_sha256":"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209","source_return_id":3930,"material_evidence":{"sha256":"234b658dad51ad91961139a8312c2437e3ffdc199f816d26552d95648160943d","entries":{"return:3930":"fcd837e3ce98de0a711568ca1ff8209cf304ca8286b409f84fc0959e210415ac","review:3930:1:gpt-6.1-sol":"0bbe9338b1a592cce881779cac25cbd688d11d2973bda328e1d4b2bf0990ea29","artifact:3930:239f3eff0a2e5bb79e24c0bf15e83f21df1671bb8f16b8e884305a708eaee9fe":"239f3eff0a2e5bb79e24c0bf15e83f21df1671bb8f16b8e884305a708eaee9fe","artifact:3930:4eab1950c0b2617f3411b85d6c4ee3ffc54fa8b0668d58937992b280f3210a4e":"4eab1950c0b2617f3411b85d6c4ee3ffc54fa8b0668d58937992b280f3210a4e","artifact:3930:5e170a1f0eb4fcaeccc0c591660d06b5e892795244739a94d9f9a4d0251ec125":"5e170a1f0eb4fcaeccc0c591660d06b5e892795244739a94d9f9a4d0251ec125","artifact:3930:734ae39c4c363fdfdc82afe3454c5e412e7e073bd4465a3ce8bf4390332554ae":"734ae39c4c363fdfdc82afe3454c5e412e7e073bd4465a3ce8bf4390332554ae","artifact:3930:7495de3deccee529ee6f70dabfc2cbd7067eddf9fbd75d49e6591baee7c41736":"7495de3deccee529ee6f70dabfc2cbd7067eddf9fbd75d49e6591baee7c41736","artifact:3930:83c9d33060bc8079beecaa9d2456c97b1d90eb7ddcec1fb238f86cb573bd6b70":"83c9d33060bc8079beecaa9d2456c97b1d90eb7ddcec1fb238f86cb573bd6b70","artifact:3930:8ab62221d646d1dd174c3bd38bd94f1dc183be4f1880888119652abbf5d3bdd8":"8ab62221d646d1dd174c3bd38bd94f1dc183be4f1880888119652abbf5d3bdd8","artifact:3930:ff684590f5ad90e95ac97c8e8350eac58dd4a75f7db30a67201efe16d7439106":"ff684590f5ad90e95ac97c8e8350eac58dd4a75f7db30a67201efe16d7439106"},"version":"material-evidence-v1"},"consideration_only":true},"source_return_id":3930,"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 #3930: 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\":3930,\"report_sha256\":\"4eab1950c0b2617f3411b85d6c4ee3ffc54fa8b0668d58937992b280f3210a4e\",\"scope_hashes\":[],\"material_evidence\":{\"version\":\"material-evidence-v1\",\"entries\":{\"return:3930\":\"fcd837e3ce98de0a711568ca1ff8209cf304ca8286b409f84fc0959e210415ac\",\"review:3930:1:gpt-6.1-sol\":\"0bbe9338b1a592cce881779cac25cbd688d11d2973bda328e1d4b2bf0990ea29\",\"artifact:3930:239f3eff0a2e5bb79e24c0bf15e83f21df1671bb8f16b8e884305a708eaee9fe\":\"239f3eff0a2e5bb79e24c0bf15e83f21df1671bb8f16b8e884305a708eaee9fe\",\"artifact:3930:4eab1950c0b2617f3411b85d6c4ee3ffc54fa8b0668d58937992b280f3210a4e\":\"4eab1950c0b2617f3411b85d6c4ee3ffc54fa8b0668d58937992b280f3210a4e\",\"artifact:3930:5e170a1f0eb4fcaeccc0c591660d06b5e892795244739a94d9f9a4d0251ec125\":\"5e170a1f0eb4fcaeccc0c591660d06b5e892795244739a94d9f9a4d0251ec125\",\"artifact:3930:734ae39c4c363fdfdc82afe3454c5e412e7e073bd4465a3ce8bf4390332554ae\":\"734ae39c4c363fdfdc82afe3454c5e412e7e073bd4465a3ce8bf4390332554ae\",\"artifact:3930:7495de3deccee529ee6f70dabfc2cbd7067eddf9fbd75d49e6591baee7c41736\":\"7495de3deccee529ee6f70dabfc2cbd7067eddf9fbd75d49e6591baee7c41736\",\"artifact:3930:83c9d33060bc8079beecaa9d2456c97b1d90eb7ddcec1fb238f86cb573bd6b70\":\"83c9d33060bc8079beecaa9d2456c97b1d90eb7ddcec1fb238f86cb573bd6b70\",\"artifact:3930:8ab62221d646d1dd174c3bd38bd94f1dc183be4f1880888119652abbf5d3bdd8\":\"8ab62221d646d1dd174c3bd38bd94f1dc183be4f1880888119652abbf5d3bdd8\",\"artifact:3930:ff684590f5ad90e95ac97c8e8350eac58dd4a75f7db30a67201efe16d7439106\":\"ff684590f5ad90e95ac97c8e8350eac58dd4a75f7db30a67201efe16d7439106\"},\"sha256\":\"234b658dad51ad91961139a8312c2437e3ffdc199f816d26552d95648160943d\"},\"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:3930,input_sha256:\"234b47f41c8b3f2820d69c7b86942404a0890d8d6fb29698cfd2735d502caecd\",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/6531/transcript","files":[],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"report_sha256":"3350abd9e89da45cb7b862c5ebef5254127ab10a3444bfa6fb43f24b1fba1d7f","next_step_sha256":null,"research_authority":{"witness_status":null,"research_status":"recorded","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}