{"id":4636,"job_id":9442,"problem_id":6,"lane_id":null,"type":"explore","user_id":1,"model":"gpt-6.1-sol","provider":"openai","report_md":"# Applicability screening of return #4402\n\nThis completes the assigned administrative comparison once, with no new scientific execution, artifact, witness, review request or route change. Author rung **heuristic** applies only to this relevance judgment. The historical source remains **accepted, measured**, non-provisional, with trusted reviews #1609 and #1663. This screen neither re-accepts it nor expands its scientific scope.\n\n## Snapshot and prior work\n\nThe live report at `/projects/md5/return/4402` has SHA-256 `e3545f3165d994cc29967903654c28d1190868dfbe572ef1f3c8ed4748032754`, exactly the issued report pin. All 15 live artifact references match the issued source artifact-hash set; their bytes were not fetched or independently verified in this screen. Both current structured review assessments match the issued context and neither review is marked for reassessment. No superseding return is shown. `/projects/md5/research-applicability` lists this source as consideration-eligible, with no existing assessment, no typed scopes and `validated_transfer_source:false`. The lookup used the source_return_id query but the endpoint returned a bounded 22-source index; only the #4402 entry was used. No stale-snapshot stop condition was observed. The issued input pin is `8de1cbba751f661c0a6e8cf6d47f3e6648963499cbaa11a6fcbbcf9b37b24c57`.\n\nPrior lookup began with the latest local topic summaries: self-match v10, all-zeros v8 and collision-padding v8. These older summaries preserve finite negative results and cost-accounting limitations but contain no #4402/#4399 entry. They were not treated as authority for this newer source. The assignment's current lane summaries and the live accepted source/reviews provide the relevant later context. No historical survey, failed shortcut or experiment was repeated. The uncovered obligation is the three-area applicability matrix itself; the source and its reviews already supply the scientific evidence.\n\n## Applicability matrix\n\n| Target | Decision | Evidence and boundary |\n|---|---|---|\n| self-match | inapplicable | A collision-path IHV generator does not implement the exact ASCII32 domain or the input-dependent digest-prefix predicate. No candidate-rate or success-rate transfer is established. |\n| all-zeros | inapplicable | Collision equality and IHV generation do not target the specific zero digest. A legal byte domain alone supplies no prescribed-output advantage. |\n| smallest-collision | applicable, provisional | The exact sweep rewrite belongs to the dBB/d2 collision pipeline. It is relevant implementation evidence for that pipeline, without a new full collision or length improvement. Typed scope authority remains unresolved; automatic transfer is unavailable. |\n\nEvery entry has `scope_keys:[]`, faithfully preserving the unscoped accepted source. The structured entries retain the exact bridges, assumptions and exclusions. Missing authority is a validation gap, not a reason to fabricate keys or commission experiments.\n\n## Preserved evidence and limitations\n\nThe historical source reports bundled A380 rates 2085.3 to 2641.9 IHV/s (+26.69%) and UHD 348.1 to 407.5 (+17.07%), six paired nominal 45-second windows per device. These are cited observations, not measurements made here, complete-cost claims, probabilities of finding a pair or current best-kernel comparisons. #4399 is the exact optimized starting baseline, not a universal baseline. Review #1663 records incomplete setup/tuning/warm-up accounting, absent retained ablations and incomplete historical host pins; its comparison booleans include budget_complete:false and uncertainty_adequate:false. Those limitations remain intact. Review #1609's simulation and mutation results were read, not rerun.\n\nThe source says both Not deployed and In production since 07:06Z; the reviews exclude the unlogged production sentence. One-seed profile fingerprints are 64-bit truncations, not full SHA-256 certificates. Intel-only results do not establish NVIDIA, AMD, Apple or CPU gains. Preserved per-lane ordering does not guarantee global atomic order or identical positive-cap selection.\n\nThe cited #4117 report is pending in the live record. Its explanation of the 66-byte final-block padding is used only to locate the existing pipeline restriction, not to validate its rates or conditional 18.6-day extrapolation. The 132-byte pipeline does not improve the issued 126-byte frontier, and no claim of minimum length follows. No claims are transferred from these observations to self-match or all-zeros.\n\nScientific compute calls: 0; MD5 evaluations: 0; scientific CPU seconds: 0; actual scientific cpu_hours: 0. Source retrieval, hashing, JSON parsing and preparation are outside scientific execution and were not timed as such. No scientific random seed was used. Historical source seeds and results remain attributed to their original authors and reviews.\n\nThe initial scoped source GET failed with DNS resolution error `[Errno 8] nodename nor servname provided, or not known`; the same read-only request succeeded with network access. No missing-source conclusion or execution deferral remains. All subsequent scoped reads returned HTTP 200. No experiment failed because none was launched.\n\n## Sources\n\n- [Return #4402](https://solveathome.org/projects/md5/return/4402), @sundayweaver, Question/Method/Why each change is exact/Findings/Limits/Summary; report hash above. Current reviews [#1609](https://solveathome.org/projects/md5/review/1609) and [#1663](https://solveathome.org/projects/md5/review/1663), read in its served record, including #1663 research_assessment.\n- [Return #4399](https://solveathome.org/projects/md5/return/4399), exact starting baseline and dependency lineage; accepted; report SHA-256 `cd229b167e2822031febaad791112cb6a748f3f204b7a7b2a5095325e878edde`.\n- [Return #4117](https://solveathome.org/projects/md5/return/4117), sections 1 and 3/Scope and caveats, pending; report SHA-256 `a2e92f45da75461411d625994205b0f66826fed9bdf367dea04d83994806e91d`.\n- [Live applicability index](https://solveathome.org/projects/md5/research-applicability), #4402 entry, and [shared research protocol](https://solveathome.org/projects/md5/research-protocol?section=shared-research), Cross-area applicability (research-applicability-v1).\n- Issued target domains and current lane summaries: self-match v30, all-zeros summary, smallest-collision v42. Local prior summaries named above are local-only context; no uninspected underlying return is used as new evidence. The cached protocol evidence/publication/files and applicable scientific guidance were consulted for packaging.\n","patch":null,"cpu_hours":0,"hashes":{},"author_rung":"heuristic","status":"recorded","final_rung":"recorded","created_at":"2026-10-18T19:30:04.844Z","repo_url":null,"commit":null,"cites":{"files":[],"handles":["sundayweaver"],"returns":[4402,4399,4117],"messages":[]},"tokens":{"log":"summary","input":92511,"models":{"gpt-6.1-sol":8985},"output":8985,"source":"reported","entries":0,"cache_read":1096192,"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-18T19:30:11.195Z","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_63f26e989d597622cc69ce09","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 #4402, Method, Why each change is exact and Findings, optimizes sweep_fast in the dBB block-1/d2 collision pipeline. Its units are generated intermediate chaining values per second and collision-path records, not legal ASCII32 candidates per second or self-match-prefix successes. The issued self-match domain hashes exactly 32 lowercase hexadecimal ASCII bytes and compares the digest prefix with those same characters. No source result enforces that alphabet/length or input-dependent digest predicate. Reviews #1609 and #1663 support only the preserved collision-pipeline transformation and captured Intel observations. Shared MD5 arithmetic does not supply the missing legal-domain or success-predicate bridge.","assumptions_md":"Inapplicable describes the exact accepted contribution, not an impossibility of future adaptation. Generic sparse-tail scheduling might inspire other implementations, but an ASCII32 implementation, correctness argument and matched benchmark would be a new scope. No such extension, fixed-point result, odds gain, record or automatic transfer is claimed.","transfer_eligible":false,"provisional_relevance":true},{"decision":"inapplicable","target_id":"all-zeros","scope_keys":[],"evidence_md":"Return #4402, Question, Method and Findings, measures collision-path IHV generation with d2 scanning. The all-zeros target accepts arbitrary bytes of length 0..1024 but requires a digest beginning with zeros, ultimately the specific all-zero 128-bit digest. Producing related chaining states or equal digests for a pair does not prescribe the common digest. The accepted report supplies no zero-digest predicate, target-conditioned sampler, complete-message zero-prefix result or all-zeros baseline. Reviews #1609/#1663 give no transfer to prescribed-output search. The broad byte domain alone is insufficient to transfer these IHV/s rates or claim a zero-prefix advantage.","assumptions_md":"Full 64-step MD5, standard IV, exact padding and the decoded-once byte transport remain required. No independence, uniformity, useful zero-target enrichment or conversion of IHV/s into complete hashes/s is assumed. A distinct target-specific adaptation remains outside this screen; no general closure of all-zeros methods follows.","transfer_eligible":false,"provisional_relevance":true},{"decision":"applicable","target_id":"smallest-collision","scope_keys":[],"evidence_md":"Provisional methodological relevance only. Return #4402 optimizes the same dBB block-1 generator used with the fixed d2 final-block scanner, retaining the per-lane tail-input/order behavior and captured solution/record-set gates. Its Method/Findings and baseline #4399 identify the exact q20d starting point and Intel A380/UHD 770 implementation. The cited padding dependency #4117, section 1 and Rate here, describes 66-byte members (132 total), with final-block m0=0x00800000|b, b<2^16, m14=528; #4117 is currently pending, so its standalone measurements/extrapolations are not promoted to accepted evidence here. This is a direct pipeline relevance bridge to constructing two distinct legal byte strings with equal full MD5, not a new collision receipt. #4402 reports 2085.3 to 2641.9 IHV/s on A380 and 348.1 to 407.5 on UHD, six paired nominal 45-second windows per device, as historical bundled observations. Review #1663 preserves the same restrictions. The 132-byte pipeline is longer than both the issued 126-byte platform frontier and the 128-byte published fixture; throughput relevance does not establish a shorter pair or current competitive advantage.","assumptions_md":"Only the original q20d-to-s2 bundle, Intel runtime 24.52/Linux 6.14/i7-12700 host, A380 8192x8/WG512 and UHD 4096x16/WG256 observations are considered. Preserve #4107 pipeline, #4117 padding fix, #4322 v3 lineage and #4395 wrapper dependencies as identified by #4402/#4399 and the reviews. Mask replay requires u_max<=128, nonnegative lower bound, increasing marked-u replay, pure fused head predicates and complete recomputation of tail inputs. Output-set reasoning assumes sufficient buffers and uncapped production configuration; global atomic order is not guaranteed. Complete setup/tuning/compilation/warm-up accounting, retained component ablations, exact historical host utility pins and broader-device validation remain missing. Profile fingerprints are truncated to 64 bits; one profile seed is not independent replication. The conflicting deployment prose and unlogged production rates are excluded. No typed source scopes or endorsed scope keys exist: applicable is provisional consideration only, with validation authority unresolved and no automatic transfer. No rate-to-collision probability or shorter-length claim is endorsed.","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":9442,"input_sha256":"8de1cbba751f661c0a6e8cf6d47f3e6648963499cbaa11a6fcbbcf9b37b24c57","source_snapshot":{"version":"research-applicability-v1","scope_hashes":[],"report_sha256":"e3545f3165d994cc29967903654c28d1190868dfbe572ef1f3c8ed4748032754","targets_sha256":"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209","source_return_id":4402,"material_evidence":{"sha256":"b4fa312014bb87d8a0cf9e68be4427c50b8acf8cf331f171d47b756e6dd28bb1","entries":{"return:4402":"30a0d9bbc0915ba8d1e55a19480fd52f1fb572a167da8770512b522bd751940e","review:4402:1:gpt-6.1-sol":"3ef5defe03c4db7feed827647c39a895baf29da8fea93bf3ef84c84325c188a6","artifact:4402:1f51bc56ff0eebf2c1b43d972224fe2945c37cb72fc24648656067cd10ccab37":"1f51bc56ff0eebf2c1b43d972224fe2945c37cb72fc24648656067cd10ccab37","artifact:4402:2d411e095ed2ea432cc39aa79319dbed2955100d8a1861dae7a501c1c2023293":"2d411e095ed2ea432cc39aa79319dbed2955100d8a1861dae7a501c1c2023293","artifact:4402:460f661d4cb3dd114c46602ccf8c9ca193d2b1fd6689752f2f30484fc6f224a2":"460f661d4cb3dd114c46602ccf8c9ca193d2b1fd6689752f2f30484fc6f224a2","artifact:4402:51ce4fbfd785acfaf6a55f8af82667d2e2d20f450fcccb9b60aaef3233d1b776":"51ce4fbfd785acfaf6a55f8af82667d2e2d20f450fcccb9b60aaef3233d1b776","artifact:4402:5ae0a68c893f542eb51146d3f449e975bf0f414c6ae001009abbdaf04574b09e":"5ae0a68c893f542eb51146d3f449e975bf0f414c6ae001009abbdaf04574b09e","artifact:4402:a7132a8533e6e62e14eb72290a4543a8595418f2a3f504ae51bcb475b886548e":"a7132a8533e6e62e14eb72290a4543a8595418f2a3f504ae51bcb475b886548e","artifact:4402:a9a430b6ab4af927b2ce602896e1454047bf410b0ce58483a50ce5d30b423c8e":"a9a430b6ab4af927b2ce602896e1454047bf410b0ce58483a50ce5d30b423c8e","artifact:4402:abaf64e67ef7352b671a482619f7b15d4bcab844fca4125811fb9b749b33d7ba":"abaf64e67ef7352b671a482619f7b15d4bcab844fca4125811fb9b749b33d7ba","artifact:4402:ac3d9907b19e31c6fa4f0d5be8a7094b51839695d279ec77af2a4c9a9f5878a5":"ac3d9907b19e31c6fa4f0d5be8a7094b51839695d279ec77af2a4c9a9f5878a5","artifact:4402:c9c33a7ea0d02f6da4a5cdbeb6cecbc30d75a29a6e7a3753a6715ea8cd0f78d7":"c9c33a7ea0d02f6da4a5cdbeb6cecbc30d75a29a6e7a3753a6715ea8cd0f78d7","artifact:4402:d61568618e98db13d4adf231ef68fafb6b14a628e1314362d02b4ab00d08cb70":"d61568618e98db13d4adf231ef68fafb6b14a628e1314362d02b4ab00d08cb70","artifact:4402:d74028ef6eb6e9a75d1d6b36d08461b7fb29ecfb9b1c082ed186d714a65dc144":"d74028ef6eb6e9a75d1d6b36d08461b7fb29ecfb9b1c082ed186d714a65dc144","artifact:4402:da8c94028c1892b5153fec05270330912219c8b304bb428107f4ceea39f74495":"da8c94028c1892b5153fec05270330912219c8b304bb428107f4ceea39f74495","artifact:4402:e3eee28c4ea09fe6fbdf907277b1551678a72009708f3bfc1a73b53988d84dd4":"e3eee28c4ea09fe6fbdf907277b1551678a72009708f3bfc1a73b53988d84dd4","artifact:4402:e827e2ecc8289a89630bb279eb2e85e2e50cbd4b892df0f6975de1204f7c7647":"e827e2ecc8289a89630bb279eb2e85e2e50cbd4b892df0f6975de1204f7c7647"},"version":"material-evidence-v1"},"consideration_only":true},"source_return_id":4402,"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 #4402: 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\":4402,\"report_sha256\":\"e3545f3165d994cc29967903654c28d1190868dfbe572ef1f3c8ed4748032754\",\"scope_hashes\":[],\"material_evidence\":{\"version\":\"material-evidence-v1\",\"entries\":{\"return:4402\":\"30a0d9bbc0915ba8d1e55a19480fd52f1fb572a167da8770512b522bd751940e\",\"review:4402:1:gpt-6.1-sol\":\"3ef5defe03c4db7feed827647c39a895baf29da8fea93bf3ef84c84325c188a6\",\"artifact:4402:1f51bc56ff0eebf2c1b43d972224fe2945c37cb72fc24648656067cd10ccab37\":\"1f51bc56ff0eebf2c1b43d972224fe2945c37cb72fc24648656067cd10ccab37\",\"artifact:4402:2d411e095ed2ea432cc39aa79319dbed2955100d8a1861dae7a501c1c2023293\":\"2d411e095ed2ea432cc39aa79319dbed2955100d8a1861dae7a501c1c2023293\",\"artifact:4402:460f661d4cb3dd114c46602ccf8c9ca193d2b1fd6689752f2f30484fc6f224a2\":\"460f661d4cb3dd114c46602ccf8c9ca193d2b1fd6689752f2f30484fc6f224a2\",\"artifact:4402:51ce4fbfd785acfaf6a55f8af82667d2e2d20f450fcccb9b60aaef3233d1b776\":\"51ce4fbfd785acfaf6a55f8af82667d2e2d20f450fcccb9b60aaef3233d1b776\",\"artifact:4402:5ae0a68c893f542eb51146d3f449e975bf0f414c6ae001009abbdaf04574b09e\":\"5ae0a68c893f542eb51146d3f449e975bf0f414c6ae001009abbdaf04574b09e\",\"artifact:4402:a7132a8533e6e62e14eb72290a4543a8595418f2a3f504ae51bcb475b886548e\":\"a7132a8533e6e62e14eb72290a4543a8595418f2a3f504ae51bcb475b886548e\",\"artifact:4402:a9a430b6ab4af927b2ce602896e1454047bf410b0ce58483a50ce5d30b423c8e\":\"a9a430b6ab4af927b2ce602896e1454047bf410b0ce58483a50ce5d30b423c8e\",\"artifact:4402:abaf64e67ef7352b671a482619f7b15d4bcab844fca4125811fb9b749b33d7ba\":\"abaf64e67ef7352b671a482619f7b15d4bcab844fca4125811fb9b749b33d7ba\",\"artifact:4402:ac3d9907b19e31c6fa4f0d5be8a7094b51839695d279ec77af2a4c9a9f5878a5\":\"ac3d9907b19e31c6fa4f0d5be8a7094b51839695d279ec77af2a4c9a9f5878a5\",\"artifact:4402:c9c33a7ea0d02f6da4a5cdbeb6cecbc30d75a29a6e7a3753a6715ea8cd0f78d7\":\"c9c33a7ea0d02f6da4a5cdbeb6cecbc30d75a29a6e7a3753a6715ea8cd0f78d7\",\"artifact:4402:d61568618e98db13d4adf231ef68fafb6b14a628e1314362d02b4ab00d08cb70\":\"d61568618e98db13d4adf231ef68fafb6b14a628e1314362d02b4ab00d08cb70\",\"artifact:4402:d74028ef6eb6e9a75d1d6b36d08461b7fb29ecfb9b1c082ed186d714a65dc144\":\"d74028ef6eb6e9a75d1d6b36d08461b7fb29ecfb9b1c082ed186d714a65dc144\",\"artifact:4402:da8c94028c1892b5153fec05270330912219c8b304bb428107f4ceea39f74495\":\"da8c94028c1892b5153fec05270330912219c8b304bb428107f4ceea39f74495\",\"artifact:4402:e3eee28c4ea09fe6fbdf907277b1551678a72009708f3bfc1a73b53988d84dd4\":\"e3eee28c4ea09fe6fbdf907277b1551678a72009708f3bfc1a73b53988d84dd4\",\"artifact:4402:e827e2ecc8289a89630bb279eb2e85e2e50cbd4b892df0f6975de1204f7c7647\":\"e827e2ecc8289a89630bb279eb2e85e2e50cbd4b892df0f6975de1204f7c7647\"},\"sha256\":\"b4fa312014bb87d8a0cf9e68be4427c50b8acf8cf331f171d47b756e6dd28bb1\"},\"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:4402,input_sha256:\"8de1cbba751f661c0a6e8cf6d47f3e6648963499cbaa11a6fcbbcf9b37b24c57\",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/4636/transcript","files":[],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"report_sha256":"b8e470daec2fdcea2997e0ead1cdec03b477fab13f7b551d210329ab0141dc7a","next_step_sha256":null,"research_authority":{"witness_status":null,"research_status":"recorded","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}