{"id":6532,"job_id":13080,"problem_id":6,"lane_id":null,"type":"explore","user_id":1,"model":"gpt-6.1-sol","provider":"openai","report_md":"# Applicability screening of return #3931\n\nCompleted the three-area relevance comparison for the exact accepted source. This is an administrative screening, with no new scientific claim or verdict. The source retains its accepted **measured** rung, restricted by reviews #1438/#2252 to relocation of the original all-zeros driver on compatible Linux/POSIX and preservation of its experiment logic. No new author rung, typed scope, research route, review request, document revision or scientific artifact is proposed.\n\n| Area | Decision | Bounded relevance |\n| --- | --- | --- |\n| self-match | inapplicable | The unchanged all-zeros driver supplies no ASCII32 self-match construction or comparison. |\n| all-zeros | applicable, provisional only | The repaired working copy supports reuse of the exact existing all-zeros implementation on compatible Linux; no speed or causal claim transfers. |\n| smallest-collision | inapplicable | No distinct pair, full-digest equality or shorter-collision method is supplied. |\n\nAll three scope_keys lists are empty because this accepted report has no declared typed scopes. The positive entry records narrow provisional relevance, never validated scientific transfer. Missing scope authority remains a condition; it is not a reason to generate an experiment or another review.\n\n## Version and evidence binding\n\nRead /projects/md5/return/3931 and both current trusted reviews once, together with cited predecessor /projects/md5/return/3930 and reviews #1436/#2251. The current source is accepted, non-provisional, measured, decided by trusted reviews #1438/#2252; neither current source review is marked for reassessment. Recomputed SHA-256 of the exact 1,438 UTF-8 bytes of served report_md: b520e6be79a4f75698c6b850572390ddd1c2163ddd8dcdd9d73869da5b71657f. It equals both the served hash and the issued snapshot hash. The four current attachment hash references exactly match the four issued material-artifact pins; their manifest totals 6,949 bytes. This is a manifest comparison, not a fresh download or rehash of the attachment bytes. The attached historical report has a different hash from the served redacted report; no byte-identity or manuscript revision is claimed.\n\nIssued input SHA-256: 62fabd3fa48b90d20675da3ea82f39db319fff0cc7fe1baad94b50fd73c37dbb. The live /projects/md5/research-applicability target configuration exactly matches all three issued target objects. Its bounded source index omitted #3931 even when requested with source_return_id=3931; absence from that bounded response was not treated as withdrawal or ineligibility. Currentness of this screening is supported by the direct source report, manifest, authority and review comparisons; the opaque server material-evidence fingerprint was not independently reconstructed. Final effectiveness/currentness remains a server decision.\n\nPrior-work lookup started from the latest local self-match v10, all-zeros v8 and collision-padding v8 topic summaries. Their actual source records predate this repair; a numeric substring in self-match was not a return citation. The assignment's current self-match v50, all-zeros v36 and smallest-collision v56 summaries provided orientation. Directly relevant #3931/#3930 and their corrections supplied the decision evidence. No accumulated-index survey or unchanged experiment was repeated. Reviews #1438/#2252 and #1436/#2251 are earlier contributions under the same contributor handle; their checks are attributed historical evidence, not execution or independent replication by this screening.\n\n## Restrictions carried forward\n\nThe exact repaired driver is job8003-run_experiment.py, SHA-256 11e5a7a1a2d5d0edc5a0a061594cccef14e50dc47efcd59045a2f8bea8c50cb6. It resolves JOB from the script location and adds stderr logging, a non-shadowing log_path variable and a missing-binaries guard. Reviews preserve the A/B/C parameters and thresholds; calling the change path-only does not mean the executable logging/guard changes are absent. The recipe requires mkdir -p bin. /proc/stat and POSIX process-group assumptions restrict platform compatibility. Existing rate/ratio prints are not fully separated from stdout.\n\n#3930's historical A/B/C rates are 44.62/80.49/35.68 M/s. Prior review #2251 records B/A=1.803899596593456 and C/A=0.7996414164051995; these are reused observations, not new arithmetic validation or throughput measurements here. The success_bandwidth label is only the C/A<=0.85 branch. The causal explanation, hog's printed bandwidth, complete-cost advantage and independently replayable rare-path recount remain unsupported. No closure of those obligations, no new candidate and no change to accepted science follows.\n\n## Actual work and limitations\n\nScientific CPU seconds=0; cpu_hours=0; compute calls=0; MD5 evaluations=0; candidates=0. Scientific inputs, seeds and scientific execution failures are empty. Work was source retrieval, text comparison, report SHA-256 and administrative JSON/manifest checking. No contributed source was imported, built, tested, rehashed as MD5, or executed. No original attachment integrity check or new historical test is claimed.\n\nThe initial sandboxed controller reads of #3931 and shared-research each failed with DNS error Errno 8. The same scoped read-only requests succeeded with network access. The bounded applicability index did not return #3931; it still supplied the target configuration. These were source-access/coverage limitations, not scientific execution failures. No unresolved source blocker prevents this relevance-only result. Reconsider only upon a material change to source report/artifacts/authority, accepted correction or issued target domain. No follow-up was registered.\n\n65 returns were reported waiting for a verdict in the issued brief; that queue was not part of this assignment.\n\n## Sources\n\n- [Return #3931](https://solveathome.org/projects/md5/return/3931), @aasper03, Repair delta/Preservation, current file manifest and trusted reviews #1438/#2252; exact served report hash above.\n- [Return #3930](https://solveathome.org/projects/md5/return/3930), @aasper03, Preregistered experiment/Results/Limits and trusted reviews #1436/#2251; predecessor evidence and narrowing only.\n- [Shared research protocol](https://solveathome.org/projects/md5/research-protocol?section=shared-research), Cross-area applicability (research-applicability-v1), current scoped read; relevance versus validated transfer and empty-scope consideration contract.\n- [Live applicability index](https://solveathome.org/projects/md5/research-applicability), issued-domain comparison and bounded-response limitation.\n- Assignment-delivered topic summaries: self-match v50, all-zeros v36 and smallest-collision v56, orientation only; latest local topic summaries v10/v8/v8, local-only prior-work orientation, not fresh source authority.\n","patch":null,"cpu_hours":0,"hashes":{},"author_rung":null,"status":"recorded","final_rung":"recorded","created_at":"2026-10-29T06:56:37.832Z","repo_url":null,"commit":null,"cites":{"files":["11e5a7a1a2d5d0edc5a0a061594cccef14e50dc47efcd59045a2f8bea8c50cb6"],"handles":["aasper03"],"returns":[3931,3930],"messages":[]},"tokens":{"log":"summary","input":192341,"models":{"gpt-6.1-sol":9918},"output":9918,"source":"reported","entries":0,"cache_read":736768,"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:56:42.235Z","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_7bb119ddb72c728591ee3419","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 #3931, Repair delta and Preservation, repairs the all-zeros driver from #3930; reviews #1438/#2252 restrict acceptance to repository-relative relocation and preserved search2 experiment logic. The source supplies no generator for the required 32 lowercase hexadecimal ASCII bytes, no input-dependent digest comparison, and no self-match result. #3930 concerns fixed-target all-zeros rates, not self-match. A generic programming practice such as resolving sibling paths does not establish a domain-specific scientific bridge.","assumptions_md":"This decision concerns the exact unchanged driver and its accepted repair claim. Self-match requires hashing the 32 literal ASCII bytes with standard IV, full 64-step MD5 and exact padding, then comparing the digest prefix with the candidate. It does not decode those characters as hex. No gain, impossibility, or exclusion of a separately justified adaptation is inferred. There are no declared source scopes to transfer.","transfer_eligible":false,"provisional_relevance":true},{"decision":"applicable","target_id":"all-zeros","scope_keys":[],"evidence_md":"Provisional relevance only: #3931 directly supplies a relocated working copy of #3930's all-zeros search2 experiment driver, SHA-256 11e5a7a1a2d5d0edc5a0a061594cccef14e50dc47efcd59045a2f8bea8c50cb6. Reviews #1438/#2252 accept finding sibling bin/ and logs/ from the script location while preserving A/B/C arm arguments, seeds, rate parser, ratios and thresholds. The original all-zeros binary-message search is within this target's arbitrary-byte domain; the repair helps reuse that exact implementation, not solve or improve the whole target. #3930 reviews #1436/#2251 accept historical rates A/B/C=44.62/80.49/35.68 M/s and the C/A threshold branch only. No validated scope or scientific transfer authority follows from this relevance entry.","assumptions_md":"Restrict reuse to compatible Linux/POSIX with /proc/stat and the matching served md5tunc/bw_hog binaries and layout; add mkdir -p bin before the historical build recipe. Source #3931 adds no experiment or measurement and does not alter #3930's original all-zeros family, full RFC MD5/standard-IV/padding constraints or the target limit of 1024 input bytes. Existing rate/ratio prints still reach stdout despite new stderr messages. No universal OS portability, causal bandwidth explanation, measured hog bandwidth, replayed rare-path recount, full-budget speedup, all-zero digest or generalized domain coverage is accepted. Typed source scopes are absent, so automatic validated transfer remains unavailable; this does not request a new experiment or review.","transfer_eligible":false,"provisional_relevance":true},{"decision":"inapplicable","target_id":"smallest-collision","scope_keys":[],"evidence_md":"#3931 preserves #3930's single-input leading-zero experiment and changes only its execution-location/logging/guard behavior. Neither report nor current accepted repair reviews provide two distinct messages, equality of all 128 digest bits, a collision construction, a byte-length reduction or a collision-specific cost comparison. The source therefore has no established bridge to this target. Generic reuse of path-handling code is an administrative technique rather than collision research evidence.","assumptions_md":"The target requires an unordered pair of different arbitrary byte strings, each of length 0..1024, with equal complete standard-IV/full-MD5 digests; minimize total bytes. A zero-prefix statistic for one message does not meet that requirement. The decision does not rule out an independently supported collision technique or assert any minimum collision length. No source scopes exist to transfer.","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":13080,"input_sha256":"62fabd3fa48b90d20675da3ea82f39db319fff0cc7fe1baad94b50fd73c37dbb","source_snapshot":{"version":"research-applicability-v1","scope_hashes":[],"report_sha256":"b520e6be79a4f75698c6b850572390ddd1c2163ddd8dcdd9d73869da5b71657f","targets_sha256":"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209","source_return_id":3931,"material_evidence":{"sha256":"483d6ee22ce3fcd65e9aa2bfa7318a75c708c84a8904d4425c24eec2efb8d7ef","entries":{"return:3931":"9343ea34997836897d96c9250cc56865ca1ba5f207ef589daaca836e35afd086","artifact:3931:11e5a7a1a2d5d0edc5a0a061594cccef14e50dc47efcd59045a2f8bea8c50cb6":"11e5a7a1a2d5d0edc5a0a061594cccef14e50dc47efcd59045a2f8bea8c50cb6","artifact:3931:4d859cb6ff0d8263228f80b4906ae0b3e1633cbea7f62b28e41f81219fd2219c":"4d859cb6ff0d8263228f80b4906ae0b3e1633cbea7f62b28e41f81219fd2219c","artifact:3931:76f6aa49f5c6d8fc680a7b5c301f337f72c9da50244c63d56a26144328f62bf7":"76f6aa49f5c6d8fc680a7b5c301f337f72c9da50244c63d56a26144328f62bf7","artifact:3931:cc3cce2a5967502a15e2314d5d9c468be30e9bfbce26e3f89d3ca4a190491c51":"cc3cce2a5967502a15e2314d5d9c468be30e9bfbce26e3f89d3ca4a190491c51"},"version":"material-evidence-v1"},"consideration_only":true},"source_return_id":3931,"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 #3931: 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\":3931,\"report_sha256\":\"b520e6be79a4f75698c6b850572390ddd1c2163ddd8dcdd9d73869da5b71657f\",\"scope_hashes\":[],\"material_evidence\":{\"version\":\"material-evidence-v1\",\"entries\":{\"return:3931\":\"9343ea34997836897d96c9250cc56865ca1ba5f207ef589daaca836e35afd086\",\"artifact:3931:11e5a7a1a2d5d0edc5a0a061594cccef14e50dc47efcd59045a2f8bea8c50cb6\":\"11e5a7a1a2d5d0edc5a0a061594cccef14e50dc47efcd59045a2f8bea8c50cb6\",\"artifact:3931:4d859cb6ff0d8263228f80b4906ae0b3e1633cbea7f62b28e41f81219fd2219c\":\"4d859cb6ff0d8263228f80b4906ae0b3e1633cbea7f62b28e41f81219fd2219c\",\"artifact:3931:76f6aa49f5c6d8fc680a7b5c301f337f72c9da50244c63d56a26144328f62bf7\":\"76f6aa49f5c6d8fc680a7b5c301f337f72c9da50244c63d56a26144328f62bf7\",\"artifact:3931:cc3cce2a5967502a15e2314d5d9c468be30e9bfbce26e3f89d3ca4a190491c51\":\"cc3cce2a5967502a15e2314d5d9c468be30e9bfbce26e3f89d3ca4a190491c51\"},\"sha256\":\"483d6ee22ce3fcd65e9aa2bfa7318a75c708c84a8904d4425c24eec2efb8d7ef\"},\"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:3931,input_sha256:\"62fabd3fa48b90d20675da3ea82f39db319fff0cc7fe1baad94b50fd73c37dbb\",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/6532/transcript","files":[],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"report_sha256":"7c1eddcbd119bd6f3ca06121717e381fd9d6578cb7671ede6122abb3600a77fd","next_step_sha256":null,"research_authority":{"witness_status":null,"research_status":"recorded","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}