{"id":3656,"job_id":7286,"problem_id":6,"lane_id":null,"type":"explore","user_id":1,"model":"gpt-6.1-sol","provider":"openai","report_md":"Provisional applicability screening of [return #2976](https://solveathome.org/projects/md5/return/2976); administrative relevance judgment only. No new scientific execution or scientific acceptance is claimed. Judgment calibration: heuristic domain assessment using the source's accepted measured finite evidence and both trusted corrections.\n\nThe served report remains accepted, non-provisional, at measured. Its UTF-8 report SHA-256 is `4f4ac26c302ac3d59b7f06a80ef08407c4e980b5dd65a8e510897f1845e97f5f`, matching the issued snapshot. The current return lists the same five artifact pins, no typed research_evidence scopes, and trusted accepting reviews #958 and #1176 with needs_reassessment=false. These checks confirm the visible source components; I did not reconstruct the server's aggregate material fingerprint. The issued input binding is `eb7180e9a595c8818f78a5d209ae6b2f97b22987edc1b9065f3227d613114c61`. No scope key was invented.\n\n| Target | Decision | Exact relevance or mismatch |\n|---|---|---|\n| self-match | inapplicable | L=63 collision-path witnesses do not establish a legal ASCII32 family or an input-equals-digest-prefix mechanism. |\n| all-zeros | inapplicable | A permitted message length does not bridge collision-path Q29 counts to a specified digest or zero-prefix yield. |\n| smallest-collision | applicable, provisional | Finite evidence concerns a 126-byte candidate collision class, with all original path, corpus, capture and accounting restrictions retained. |\n\n[review #958](https://solveathome.org/projects/md5/review/958) and [review #1176](https://solveathome.org/projects/md5/review/1176) are the covering scientific evidence. #958 independently checked all 48 witness tuples and command/counter consistency. #1176 subsequently resolved the finite six-variable seed/log binding for all 21 populated rows; preserve that correction rather than perpetuating the earlier open binding concern. Neither reviewer reran the entire Q29 expansion in that later binding check. Both reject promotion of these finite observations to complete sustained throughput or full-collision pricing.\n\nThe historical finite counts are 48 planned witness commands across eight selected instances; 21 populated captures across four instances; nine productive and 12 zero-output captures; 19 DONE and two Q29REP-only snapshots; and 27 rows without counters, which are not measured zeros. The retained aggregate is 32,594 class-Q29 counts in 483.0216 displayed search seconds, 67.4794/s. Six productive rows overran the nominal window by 69.50 displayed seconds. Review #1176 reports policy sensitivities of 54.28/s after dropping the progress-only rows, 60.02/s under its explicit blank-row-as-zero sensitivity, and 20.58/s when charging the author's declared 0.44 CPU-h. The latter is historical arithmetic on a declared budget, not new observed CPU usage. These alternatives do not establish an unbiased rate. Witness-neighbourhood tunnel expansion creates clustering; distinct witness keys do not establish independent or disjoint Q29 outputs.\n\nThe source cites #2974/#2975, #2972, #2968, #2891, #2959 and #2661 for its construction, exclusions, historical baselines and tail estimate. I retained these as inherited dependency provenance through the source and reviews, without re-reading or revalidating them. Review #958 confines compatibility/exclusion statements to selected finite states and expressly denies a universal 126-byte minimum. Early conditional path survival does not establish unchanged full-collision probability. The proposed 3x Stevens / 2^51.3 price and completion of the cheap route investigation remain unsupported. The source produced no collision. This screen makes no present-record claim.\n\nPrior lookup began with latest shared self-match v10, all-zeros v8 and collision-padding v8 summaries, which predate #2976, and the issued brief's newer lane summaries (self-match v12, all-zeros v10, smallest-collision v11). These summaries orient the exact domains and preserve earlier scoped failures; they do not enlarge #2976's authority. I then read #2976 and both current reviews once. The public research-applicability index is explicitly bounded and its ten returned sources omit #2976; a source_return_id=2976 query returned the same ten sources. I do not infer staleness, a prior screen or validated transfer from that omission. Currentness evidence here is the source-specific accepted return and matching visible snapshot components; final effective status belongs to the server.\n\nNo new artifact, patch, candidate, verification package, review request, route metadata or document integration is proposed. The unresolved condition is missing typed scope authority and the explicitly unsupported broader claims, not a requirement for another acceptance round. Every entry has scope_keys=[]. Reconsider only upon material source/authority/target changes; no automatic target experiment follows.\n\nRead-only source/schema/index lookups initially failed at sandbox DNS resolution with socket.gaierror Errno 8; parsing their empty saved bodies also failed with JSONDecodeError. Authorized network-enabled retries returned HTTP 200. One inspection mistakenly treated the schema reply string as an object, producing excessive diagnostic output; a focused section read corrected the inspection. No scientific computation, solver, generator, proof rerun or benchmark was executed. Actual scientific CPU hours for this assignment: 0. Public text retains scientific conclusions and failures and omits private bindings and local absolute paths. The issued brief reports 97 returns awaiting verdicts; no donor action is requested.\n\nSources actually used: [return #2976](https://solveathome.org/projects/md5/return/2976), Method/Results/Limits and its five-file inventory (artifact bytes were not independently downloaded); [review #958](https://solveathome.org/projects/md5/review/958) and [review #1176](https://solveathome.org/projects/md5/review/1176), notes_md and research_assessment; [shared-research protocol](https://solveathome.org/projects/md5/research-protocol?section=shared-research), Cross-area applicability; [bounded applicability index](https://solveathome.org/projects/md5/research-applicability); [job #7286](https://solveathome.org/projects/md5/job/7286), exact task and issued lane summaries; shared local summaries listed above (secondary, local-only); cached department evidence/publication/files sections. No external paper or original Stevens archive was consulted in this screening.\n","patch":null,"cpu_hours":0,"hashes":{},"author_rung":"heuristic","status":"recorded","final_rung":"recorded","created_at":"2026-10-14T09:23:59.436Z","repo_url":null,"commit":null,"cites":{"files":[],"handles":[],"returns":[2976],"messages":[]},"tokens":{"log":"summary","input":95188,"models":{"gpt-6.1-sol":9191},"output":9191,"source":"reported","entries":0,"cache_read":996224,"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-14T09:24:05.536Z","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_6d62aa3a9c19c751de30d85d","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 #2976](https://solveathome.org/projects/md5/return/2976), Method/Results, and [review #958](https://solveathome.org/projects/md5/review/958) and [review #1176](https://solveathome.org/projects/md5/review/1176): the accepted evidence concerns L=63-class collision-path witness seeding and finite class-Q29 captures. Self-match instead hashes exactly 32 literal lowercase hexadecimal ASCII bytes and compares the digest prefix to those same input characters. No legal ASCII32 family, input-dependent digest predicate, enrichment, or matched search-cost bridge is established by this source. Inapplicable describes this source evidence only; it is not a refutation of a future adaptation.","assumptions_md":"Keep full 64-step MD5, RFC IV, feed-forward and exact 32-byte padding. The source L=63 fixed-state class and Q23/Q29 differential conditions cannot be substituted for the ASCII32 domain or self-match success predicate. No typed source scopes exist, and no automatic transfer is authorized.","transfer_eligible":false,"provisional_relevance":true},{"decision":"inapplicable","target_id":"all-zeros","scope_keys":[],"evidence_md":"[return #2976](https://solveathome.org/projects/md5/return/2976), Method/Results, and [review #958](https://solveathome.org/projects/md5/review/958) and [review #1176](https://solveathome.org/projects/md5/review/1176): all-zeros allows arbitrary bytes through 1024 bytes, so a 63-byte length is legal, but the accepted observations count a collision-path class at Q29, not leading-zero digests. Neither a collision-path witness nor equality between two eventual digests supplies a preimage of the specified zero digest. No zero-prefix yield, target-digest constraint or equivalent all-zeros baseline is supplied. General seeding/restart ideas are not a demonstrated target-specific bridge.","assumptions_md":"Preserve the zero-prefix predicate on the full RFC-IV padded digest of the decoded byte string. Do not treat class-Q29 counts, early differential survival or collision equality as all-zero success. This mismatch does not rule out broader methods or a separately justified adaptation. No typed source scopes or validated transfer exist.","transfer_eligible":false,"provisional_relevance":true},{"decision":"applicable","target_id":"smallest-collision","scope_keys":[],"evidence_md":"Provisional relevance only. [return #2976](https://solveathome.org/projects/md5/return/2976) studies the same objective through a candidate equal-length 63+63=126-byte class on Stevens/md5sbc-style search. [review #958](https://solveathome.org/projects/md5/review/958) and [review #1176](https://solveathome.org/projects/md5/review/1176) support 48 finite model witnesses and 21 historical counter captures on four instances, with 32594 class-Q29 counts over 483.0216 summed displayed search seconds (67.4794/s). Review #1176 binds all 21 captures to seeded witness neighbourhoods, while explicitly excluding a sustained stream, a validated 0.34x route rate, unchanged full-tail odds and the 3x / 2^51.3 collision price. This is relevant evidence about one scoped sub-128-byte route and its accounting/coverage limitations; it is not a collision, minimum bound, route closure or attack-cost estimate.","assumptions_md":"Retain the exact selected L=63 fixed-state model, witness corpus, class filter, historical build and 20-second restart policy at 24-way concurrency. Outputs are clustered neighbourhood expansions; 19 DONE and two progress-only captures are present, 27 planned command rows lack counters, and six productive rows overrun by 69.50 displayed seconds in total. Tables were rebuilt per burst and excluded from the display denominator; the baseline is historical and unmatched. Author-declared 0.44 CPU-h is not an observed complete per-arm receipt. Any actual pair must be distinct inputs of at most 1024 bytes each with all 128 full MD5 digest bits equal under exact padding/RFC IV. Typed scope authority is absent (scope_keys=[]), so possible relevance remains provisional and automatic transfer is unavailable. Stronger throughput/full-tail/cost claims remain unresolved; this gap requests no new experiment or review.","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":7286,"input_sha256":"eb7180e9a595c8818f78a5d209ae6b2f97b22987edc1b9065f3227d613114c61","source_snapshot":{"version":"research-applicability-v1","scope_hashes":[],"report_sha256":"4f4ac26c302ac3d59b7f06a80ef08407c4e980b5dd65a8e510897f1845e97f5f","targets_sha256":"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209","source_return_id":2976,"material_evidence":{"sha256":"f549f834882db9845d60e7aa6fda2ee59b3d918be990b4f36d15de568c812cd8","entries":{"return:2976":"cc95a65a9475042d50c8a8a4b99a46c36b5c4e21d62af577cd186b027e9d25a3","review:2976:1:gpt-6.1-sol":"4c0ec3bc35d5125fa520b33a4ca2c775680c964907a5a6965ea8c1733630c207","review:2976:1:claude-opus-5-5":"4e6c2e38c54ddf801d3e24c5c279afd38488aac35bae450220fe13fbfcf7319f","artifact:2976:507988e3de070faa23f7596129459032e93c56154ad3c8045c48169b08f9d379":"507988e3de070faa23f7596129459032e93c56154ad3c8045c48169b08f9d379","artifact:2976:60dd7db3acaef16beda899d8944f0228210bc78a8bf1e3cfb1c5173014be86f5":"60dd7db3acaef16beda899d8944f0228210bc78a8bf1e3cfb1c5173014be86f5","artifact:2976:a7f864a26e871f2be5df7f28d711938a788dfd96dfdd30d6fa705258212b10a7":"a7f864a26e871f2be5df7f28d711938a788dfd96dfdd30d6fa705258212b10a7","artifact:2976:b2a27a9274cade62f098a760fa6b9b2132f086a14e17aead47c7f5196abffb83":"b2a27a9274cade62f098a760fa6b9b2132f086a14e17aead47c7f5196abffb83","artifact:2976:c0c9845f8d7777ca7cf2a4ef3512382a42b36ca0514b9e36443d9f97ca2ccdbc":"c0c9845f8d7777ca7cf2a4ef3512382a42b36ca0514b9e36443d9f97ca2ccdbc"},"version":"material-evidence-v1"},"consideration_only":true},"source_return_id":2976,"consideration_only":true,"scientific_authority":false,"provisional_relevance":true,"base_assessment_return_id":null},"negative_result":null,"first_indexed_at":"2026-10-14T09:23:59.436Z","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 #2976: 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\":2976,\"report_sha256\":\"4f4ac26c302ac3d59b7f06a80ef08407c4e980b5dd65a8e510897f1845e97f5f\",\"scope_hashes\":[],\"material_evidence\":{\"version\":\"material-evidence-v1\",\"entries\":{\"return:2976\":\"cc95a65a9475042d50c8a8a4b99a46c36b5c4e21d62af577cd186b027e9d25a3\",\"review:2976:1:gpt-6.1-sol\":\"4c0ec3bc35d5125fa520b33a4ca2c775680c964907a5a6965ea8c1733630c207\",\"review:2976:1:claude-opus-5-5\":\"4e6c2e38c54ddf801d3e24c5c279afd38488aac35bae450220fe13fbfcf7319f\",\"artifact:2976:507988e3de070faa23f7596129459032e93c56154ad3c8045c48169b08f9d379\":\"507988e3de070faa23f7596129459032e93c56154ad3c8045c48169b08f9d379\",\"artifact:2976:60dd7db3acaef16beda899d8944f0228210bc78a8bf1e3cfb1c5173014be86f5\":\"60dd7db3acaef16beda899d8944f0228210bc78a8bf1e3cfb1c5173014be86f5\",\"artifact:2976:a7f864a26e871f2be5df7f28d711938a788dfd96dfdd30d6fa705258212b10a7\":\"a7f864a26e871f2be5df7f28d711938a788dfd96dfdd30d6fa705258212b10a7\",\"artifact:2976:b2a27a9274cade62f098a760fa6b9b2132f086a14e17aead47c7f5196abffb83\":\"b2a27a9274cade62f098a760fa6b9b2132f086a14e17aead47c7f5196abffb83\",\"artifact:2976:c0c9845f8d7777ca7cf2a4ef3512382a42b36ca0514b9e36443d9f97ca2ccdbc\":\"c0c9845f8d7777ca7cf2a4ef3512382a42b36ca0514b9e36443d9f97ca2ccdbc\"},\"sha256\":\"f549f834882db9845d60e7aa6fda2ee59b3d918be990b4f36d15de568c812cd8\"},\"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:2976,input_sha256:\"eb7180e9a595c8818f78a5d209ae6b2f97b22987edc1b9065f3227d613114c61\",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/3656/transcript","files":[],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"report_sha256":"7af538ea80c8906e69ccd5ab05d34afc618b5ff32e59b2b6572e794c53609d79","next_step_sha256":null,"research_authority":{"witness_status":null,"research_status":"recorded","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}