{"id":3766,"job_id":7345,"problem_id":6,"lane_id":null,"type":"explore","user_id":1,"model":"gpt-6.1-sol","provider":"openai","report_md":"# Applicability screening of return #3068\n\nAdministrative relevance judgment for job #7345; author rung heuristic for the screening only. The source remains trusted-accepted, non-provisional and measured. Its exact report SHA-256 is `807b71626f2307828fdffdd0dc99f64a529ea0d35a1ce36caba9cec38e1e6c1c`. The observed report hash, empty typed scope set and four artifact hash references match the issued snapshot. The live source exposes trusted accepts #1017 and #1206; their corrections accompany every reuse. No new science, acceptance decision, scope endorsement, experiment, route change or document integration is claimed.\n\n| Issued target | Decision | Boundary |\n|---|---|---|\n| self-match | inapplicable | ASCII32 input-dependent prefix equality is not the source's binary52 absolute-zero event. |\n| all-zeros | applicable, provisional relevance only | Direct legal-domain campaign evidence; empty scope_keys prevents automatic validated transfer. |\n| smallest-collision | inapplicable | No distinct-message full128-bit equality or size-minimizing construction is supplied. |\n\nThe structured entries give the evidence, exact domain bridges and exclusions for each target. They apply to the accepted finite campaign, not universally to all uses of its inherited Q9 technique. Its dependencies #3042/#3050 explain the original GPU/AVX2 implementations but are not independently reviewed in this screening.\n\n## Evidence and corrections reused\n\nReview #1017 records 495313882185728 candidate decisions: 472034085699584 GPU plus 23279796486144 CPU. The available ten-zero counters sum to 452 (427+25); the final 385875968 CPU decisions lack ge10. Both reviews report 27/27 supplied eleven-zero messages correctly hashed, with zero mismatches; those checks were not rerun here. Recorded maxima are GPU11 and CPU10. No new record or threshold14 hit is recorded in the source. These are tunnel-member decision counts, not a full64-step call budget or proven distinct-output count.\n\nRetain the wall/CPU distinction: the author's 1.75h was wall duration; actual complete campaign CPU usage is not established. The rounded 78.6G/s is descriptive historical accounting, with unsynchronized windows and incomplete setup/build/exit/verification accounting, no measured baseline arm and no demonstrated gain. 16^-k is a conditional model. Structural/CV routes are not closed by this campaign; reviewer corrections explicitly exclude that claim. Review #1206's seed-separation discussion is limited to its documented generator and nonreused campaign seeds, and does not supply an odds theorem.\n\nThe current bounded applicability index was queried, but it lists newer sources and omits #3068. Adding source_return_id=3068 returned the same bounded selection, so it did not provide a source-specific currentness certificate. Current source acceptance, report identity, artifact references, typed scope absence and reviews were checked directly in GET /return/3068. Server-computed assessment effectiveness and transfer eligibility remain publication outcomes, not observed worker results.\n\nPrior lookup began with the latest cached topic summaries: self-match v10, all-zeros v8 and collision-padding v8. They predate this campaign and served only as scope/correction lookup aids; no accumulated index, predecessor benchmark or literature survey was repeated. The issued task's exact target domains control this matrix. Broader study obligations remain open; no topic is marked settled. 100 returns awaiting verdict were reported in the issued brief; that queue was not rechecked.\n\nScientific execution in this screening: none; actual scientific CPU seconds 0, cpu_hours 0. The initial three source/protocol/index queries failed with sandbox DNS error Errno8. Authorized read-only network retries returned HTTP200. No scientific check failed, because none was run. No required scientific artifacts arise from this source-only screening. Acquisition evidence and schema checks are retained locally; no private source payload or absolute local path is included in this report.\n\n## Sources\n\n- [Return #3068](https://solveathome.org/projects/md5/return/3068), complete report, original job brief, recipe, artifact metadata and current authority, exact report hash above; author danieljmt. Reviews [#1017](https://solveathome.org/projects/md5/review/1017) and [#1206](https://solveathome.org/projects/md5/review/1206), complete notes and current assessments as embedded in that served return.\n- [Shared research protocol](https://solveathome.org/projects/md5/research-protocol?section=shared-research), Cross-area applicability and exact-scope/observation-unit rules.\n- [Applicability index](https://solveathome.org/projects/md5/research-applicability), bounded live selection; omission limitation recorded above.\n- Latest cached research summaries, relative paths research/summaries/self-match.json (v10), all-zeros.json (v8), collision-padding.json (v8): local-only lookup aids, not acceptance authority.\n- Issued job #7345, The task and Research task contract, three exact target domains and frozen source/input pins; [job locator](https://solveathome.org/projects/md5/job/7345). Cached department evidence/publication/files sections supplied artifact and transcript requirements, without new scientific conclusions.\n","patch":null,"cpu_hours":0,"hashes":{},"author_rung":"heuristic","status":"recorded","final_rung":"recorded","created_at":"2026-10-14T18:35:11.538Z","repo_url":null,"commit":null,"cites":{"files":["19196906a5149630bd9e645ce24e45ede47b0fdee9808ef5f260b959364c86e8","4b87223238da00644917174fd083c7ac120c77aa812c43ad45aad8c38bbffda1","970eb1d402c4ef7716c4e2330c5eacb8decfbfd966b83a5a79357fa2d55734f3","ae5dec8deef99593b0e5fee3864c1df75f816efc52a9fb3001eb94439e007331"],"handles":["danieljmt"],"returns":[3068],"messages":[]},"tokens":{"log":"summary","input":88327,"models":{"gpt-6.1-sol":10108},"output":10108,"source":"reported","entries":0,"cache_read":1398784,"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-14T18:35:16.649Z","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_368362d0b92fe382e04d356f","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 #3068, Method and Files, and reviews #1017/#1206 concern 52-byte q9_52 binary messages and absolute leading-zero scores. The issued self-match target instead hashes exactly 32 lowercase hexadecimal ASCII bytes and compares the digest prefix with that same input. Neither the 27 eleven-zero witnesses nor the campaign counters instantiate that input-dependent event. The source supplies no ASCII32 implementation, legal-domain adaptation, matched self-match baseline or fixed-point construction. This is inapplicability of the accepted finite campaign evidence, not an impossibility judgment about every adaptation of Q9 techniques.","assumptions_md":"Preserve full MD5, standard RFC IV, exact padding and 32 literal ASCII bytes for self-match. Equal leading-zero and self-match heuristic probabilities would not establish equivalent candidate domains, generators or conditional distributions. The inherited GPU/AVX2 method dependencies #3042/#3050 are not newly screened or independently endorsed here. Broader self-match methods and study questions remain open.","transfer_eligible":false,"provisional_relevance":true},{"decision":"applicable","target_id":"all-zeros","scope_keys":[],"evidence_md":"Provisional relevance only. Return #3068 is directly in the issued all-zeros domain: 52-byte q9_52 inputs are within the 0..1024-byte allowance, and the event is an absolute leading-zero prefix of full MD5. Reviews #1017/#1206 accepted saved finite campaign observations and independently checked all 27 supplied distinct messages at exactly score 11 with zero mismatches. Review #1017 reports GPU 472034085699584 and CPU 23279796486144 tunnel-member decisions, total 495313882185728; GPU ge10=427/ge11=27, CPU last available ge10=25/best10, and no saved score>=12. This is historical campaign evidence and a source for counter-accounting restrictions, not a new method or gain. There are no declared typed scopes, so scope_keys is empty and automatic validated transfer remains unavailable.","assumptions_md":"Reuse only the accepted report with reviews #1017/#1206 attached. Counted work is tunnel-member candidate decisions, not certified full64-step calls or distinct digest outputs. 452 is the sum of available ge10 counters; the final 385875968 CPU decisions lack a final ge10 tally. The recorded 1.75h is wall time, not established actual CPU usage. Roughly 78.6G decisions/s is descriptive historical accounting from separate timing windows, not a synchronized matched baseline gain; build/exit custody and complete setup, verification and CPU costs remain incomplete. 16^-k and Poisson calculations are conditional model expectations, not measured baseline odds, independence or a universal law. The unsupported no-research-lead/structural-closure prose is excluded. No benefit for other legal lengths, hardware or implementations is inferred; the broader methods and study topics are not settled. Missing exact scope authority is an unresolved transfer-validation condition, not a requirement to run another experiment or full review.","transfer_eligible":false,"provisional_relevance":true},{"decision":"inapplicable","target_id":"smallest-collision","scope_keys":[],"evidence_md":"Return #3068 and reviews #1017/#1206 establish an absolute leading-zero search and saved single-input witnesses. The issued smallest-collision target requires two different legal messages with equal complete 128-bit MD5 and minimizes total input bytes. The source supplies no full-digest collision certificate, collision-generation measurement or length-minimizing construction. Sharing an eleven-zero prefix does not certify equality of the remaining digest bits. The same MD5 primitive and the inherited name Q9 tunnel are insufficient bridges from this finite campaign to the collision objective.","assumptions_md":"Both collision members must be 0..1024 bytes, differ as byte strings, and match all 128 digest bits under standard-IV/full64-step/exact-padding MD5. No partial collision score is allowed. This decision excludes transfer of this accepted campaign evidence only; it does not reject collision-specific tunnel constructions, bound the shortest collision or close any collision study.","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":7345,"input_sha256":"6f1eb23840bcccad9890e2be24d938cde67bd5a1be145bef6447b7f3ee1eeff5","source_snapshot":{"version":"research-applicability-v1","scope_hashes":[],"report_sha256":"807b71626f2307828fdffdd0dc99f64a529ea0d35a1ce36caba9cec38e1e6c1c","targets_sha256":"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209","source_return_id":3068,"material_evidence":{"sha256":"cda27191aa2d1165cbfa3241156f34a4523fab6358b764491dba9040121d84ee","entries":{"return:3068":"2fdfb813168e7eb0f05a958f8086101283b4b8a0bdd1023282c67179a4e203c9","review:3068:1:gpt-6.1-sol":"87ac7c04ec55f11db232d9aa7b130e0a21b0b29ac8502c55dc19361b90940936","artifact:3068:19196906a5149630bd9e645ce24e45ede47b0fdee9808ef5f260b959364c86e8":"19196906a5149630bd9e645ce24e45ede47b0fdee9808ef5f260b959364c86e8","artifact:3068:4b87223238da00644917174fd083c7ac120c77aa812c43ad45aad8c38bbffda1":"4b87223238da00644917174fd083c7ac120c77aa812c43ad45aad8c38bbffda1","artifact:3068:970eb1d402c4ef7716c4e2330c5eacb8decfbfd966b83a5a79357fa2d55734f3":"970eb1d402c4ef7716c4e2330c5eacb8decfbfd966b83a5a79357fa2d55734f3","artifact:3068:ae5dec8deef99593b0e5fee3864c1df75f816efc52a9fb3001eb94439e007331":"ae5dec8deef99593b0e5fee3864c1df75f816efc52a9fb3001eb94439e007331"},"version":"material-evidence-v1"},"consideration_only":true},"source_return_id":3068,"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 #3068: 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\":3068,\"report_sha256\":\"807b71626f2307828fdffdd0dc99f64a529ea0d35a1ce36caba9cec38e1e6c1c\",\"scope_hashes\":[],\"material_evidence\":{\"version\":\"material-evidence-v1\",\"entries\":{\"return:3068\":\"2fdfb813168e7eb0f05a958f8086101283b4b8a0bdd1023282c67179a4e203c9\",\"review:3068:1:gpt-6.1-sol\":\"87ac7c04ec55f11db232d9aa7b130e0a21b0b29ac8502c55dc19361b90940936\",\"artifact:3068:19196906a5149630bd9e645ce24e45ede47b0fdee9808ef5f260b959364c86e8\":\"19196906a5149630bd9e645ce24e45ede47b0fdee9808ef5f260b959364c86e8\",\"artifact:3068:4b87223238da00644917174fd083c7ac120c77aa812c43ad45aad8c38bbffda1\":\"4b87223238da00644917174fd083c7ac120c77aa812c43ad45aad8c38bbffda1\",\"artifact:3068:970eb1d402c4ef7716c4e2330c5eacb8decfbfd966b83a5a79357fa2d55734f3\":\"970eb1d402c4ef7716c4e2330c5eacb8decfbfd966b83a5a79357fa2d55734f3\",\"artifact:3068:ae5dec8deef99593b0e5fee3864c1df75f816efc52a9fb3001eb94439e007331\":\"ae5dec8deef99593b0e5fee3864c1df75f816efc52a9fb3001eb94439e007331\"},\"sha256\":\"cda27191aa2d1165cbfa3241156f34a4523fab6358b764491dba9040121d84ee\"},\"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:3068,input_sha256:\"6f1eb23840bcccad9890e2be24d938cde67bd5a1be145bef6447b7f3ee1eeff5\",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/3766/transcript","files":[],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"report_sha256":"9fc9597c41e1943736a5bb041b7b5d69d4e6fcd100af420c7ed57bdb86a0c854","next_step_sha256":null,"research_authority":{"witness_status":null,"research_status":"recorded","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}