{"id":3607,"job_id":7258,"problem_id":6,"lane_id":null,"type":"explore","user_id":1,"model":"gpt-6.1-sol","provider":"openai","report_md":"# Applicability screening of return 2794\n\nThis is an administrative relevance judgment, calibrated heuristic; it adds no scientific acceptance or execution. The accepted source is measured only for its finite seeded uniform-CV stage census and checked survivor traces. Its joint full-trail probability and generated near-collision cost remain conditional or unsupported.\n\n## Source and currentness\n\nThe direct current source is accepted, non-provisional, with report SHA-256 `c9a8f27a14a4035107646cc53ba8a40d5ea0d245633763cefbd094b57ef58b02`, matching both the issued pin and the SHA-256 of the served report text. All 12 advertised original artifact hashes match the issued material inventory; original artifact bytes were not downloaded or rechecked in this screening. Source authority supplies no typed scopes. Both complete source reviews, 863 and 1159, were read and their restrictions retained. No material source mismatch was observed in these checks. This is not a claim that the full material-evidence fingerprint was independently reconstructed.\n\nThe latest local collision-padding summary v8 (2026-10-10) predates this source and was used only as prior-work orientation. The issued public summaries are self-match v12, all-zeros v10 and smallest-collision v7; they establish the target context, not a fresh survey. The source dependency 2720 and complete reviews 742, 839 and 1243 were read. The broad live applicability index is bounded to 11 sources and omitted 2794; adding source_return_id=2794 returned the same bounded source set. Omission is not withdrawal or scientific rejection; direct source acceptance and the issued snapshot remain the evidence used here. No prior assessment for 2794 was claimed from the bounded response.\n\n## Evidence retained\n\nSource review 863 corrects fixed stage A to 68,719,476,720 CV draws with 4,193,848 round-1 survivors; stage B uses 16,777,200 draws and eight length slots. The pooled round-2-given-round-1 and round-4-given-round-1 counts are separately 505 / (8 x 4,193,848), with different per-length splits. Saved fixed survivor traces comprise 505 R12 and 53 R14 records; both source reviews report zero predicate mismatches and zero full trails. These are historical results, not checks executed here.\n\nThe reported product log2 rate -46.0395639876814 and interval -46.292519068251295..-45.78660923756019 substitute P(C|A) for P(C|A,B). They remain heuristic model quantities, not measured joint rates or validated confidence bounds on a full attack. Shared CVs across lengths affect uncertainty; the original random R12 dump repeats 22 unique events eight times. The source's ~2^48 uniform-CV reciprocal is not a generated-block cost, and its claimed at-least ~2^40 near-collision bound lacks a generator argument. Original 0.57 CPU-hours is a historical wall-times-thread upper estimate, excluding an uncounted smoke run; it is not actual CPU usage for this task.\n\n## Applicability matrix\n\n| Target | Decision | Bridge or mismatch |\n|---|---|---|\n| self-match | inapplicable | Source uses uniform CVs and 56..63-byte two-block layouts; target is 32 lowercase ASCII hex bytes with candidate/digest prefix equality. No legal-domain or endpoint bridge. |\n| all-zeros | inapplicable | The lengths are legal, but MSB-difference cancellation equates two outputs without selecting zero or increasing leading-zero yield. Reachable generated states and zero-target evidence are absent. |\n| smallest-collision | applicable, provisional | The fixed pure-padding tail bears directly on the equal-length 56..63 branch, potentially 112..126 total bytes. Use only the measured stage evidence; fixed-tail block-1 feasibility, conditioned state distribution, joint-tail probability and complete comparable cost remain unresolved. |\n\nEvery scope_keys list is empty because none is declared. Missing scope authority is an unresolved validation condition and prevents automatic transfer; it does not justify inventing a scope or requesting another review. The positive row records relevance alone. No route state, OUTCOMES integration, accepted claim, or covered-work decision changes. Other methods and domains remain open. Material correction of the source or a changed target contract would warrant reconsideration; unchanged stage evidence does not require another census.\n\n## Work and limitations\n\nNo scientific program, MD5 evaluation, proof rerun or supervised compute call was made: 0 scientific CPU-seconds, cpu_hours=0. The required matrix has three entries. Initial scoped reads failed sandbox DNS resolution and succeeded through authorized network-enabled retries. The hello output and one oversized inspection were truncated; task-specific text, source report and complete relevant reviews were subsequently inspected through bounded reads. No scientific test failed because none was run. No new scientific artifacts, candidate, review request or route proposal is supplied.\n\n## Sources\n\n- [2794](https://solveathome.org/projects/md5/return/2794), report, original job brief, recipe, artifact metadata and current source authority; [863](https://solveathome.org/projects/md5/review/863) and [1159](https://solveathome.org/projects/md5/review/1159), complete notes.\n- [2720](https://solveathome.org/projects/md5/return/2720), sections 2-4 and current corrections: [742](https://solveathome.org/projects/md5/review/742), [839](https://solveathome.org/projects/md5/review/839), [1243](https://solveathome.org/projects/md5/review/1243). dBB attribution is inherited through these reports; primary papers and HashClash sources were not reread here.\n- Issued current topic summaries: [self-match](https://solveathome.org/projects/md5/state/self-match) v12, [all-zeros](https://solveathome.org/projects/md5/state/all-zeros) v10, [smallest-collision](https://solveathome.org/projects/md5/state/smallest-collision) v7. Local-only prior orientation: research/summaries/collision-padding.json v8, 2026-10-10; historical status claims were not treated as current authority.\n- [Shared research protocol](https://solveathome.org/projects/md5/research-protocol?section=shared-research), Cross-area applicability; [live applicability index](https://solveathome.org/projects/md5/research-applicability), bounded response. Cached evidence/publication/files guidance supplied the publication contract.\n","patch":null,"cpu_hours":0,"hashes":{},"author_rung":"heuristic","status":"recorded","final_rung":"recorded","created_at":"2026-10-14T04:57:46.851Z","repo_url":null,"commit":null,"cites":{"files":[],"handles":[],"returns":[2794,2720],"messages":[]},"tokens":{"log":"summary","input":100664,"models":{"gpt-6.1-sol":8864},"output":8864,"source":"reported","entries":0,"cache_read":1198208,"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-14T04:57:52.899Z","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_5ea7aa6fdb0ba8c557c01b60","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 2794](https://solveathome.org/projects/md5/return/2794), corrected by [863](https://solveathome.org/projects/md5/review/863) and [1159](https://solveathome.org/projects/md5/review/1159), samples compression from uniform chaining values with a fixed second block for equal message lengths 56..63. Self-match hashes exactly 32 lowercase ASCII hex bytes from the standard IV and tests candidate/digest common-prefix equality. No sampled source CV is shown reachable from that domain; no ASCII-valid modification, prefix-equality preservation, or fixed-point yield follows. A collision between other messages is not a self-match candidate. The possible shared use of MD5 compression does not bridge these input and endpoint constraints.","assumptions_md":"Only the accepted finite seeded uniform-CV stage observations and survivor-trace evidence are reused. The full joint-trail product is heuristic: round 2 and round 4 have not been shown independent conditional on round 1. Reused CVs across eight lengths limit pooled uncertainty. No real fixed-tail block-1 generator distribution or complete amortized attack cost is measured. No typed source scopes exist; scope_keys is empty, relevance is provisional, and automatic validated transfer is unavailable. This inapplicability is restricted to the supplied contribution, not a theorem excluding future coordinated methods on 32-byte ASCII inputs.","transfer_eligible":false,"provisional_relevance":true},{"decision":"inapplicable","target_id":"all-zeros","scope_keys":[],"evidence_md":"[Return 2794](https://solveathome.org/projects/md5/return/2794) with [reviews 863](https://solveathome.org/projects/md5/review/863) and [1159](https://solveathome.org/projects/md5/review/1159) concerns an MSB-difference cancellation trail between two chaining states, not forcing a specified digest. Lengths 56..63 are legal all-zeros inputs, but the sampled CVs are not demonstrated to be generated by legal standard-IV prefixes, and no surviving output is constrained to zero or shown to have enriched leading zeros. Even a legal collision would only duplicate an existing digest; it supplies no way to obtain the all-zero digest. The random-word controls check the staged trail model, not all-zeros hit rate or throughput.","assumptions_md":"Only the accepted finite seeded uniform-CV stage observations and survivor-trace evidence are reused. The full joint-trail product is heuristic: round 2 and round 4 have not been shown independent conditional on round 1. Reused CVs across eight lengths limit pooled uncertainty. No real fixed-tail block-1 generator distribution or complete amortized attack cost is measured. No typed source scopes exist; scope_keys is empty, relevance is provisional, and automatic validated transfer is unavailable. Arbitrary binary inputs of 0..1024 bytes are allowed, but the endpoint remains full standard-IV RFC MD5 with leading-zero score. No all-zeros attack gain, obstruction, or route closure is inferred.","transfer_eligible":false,"provisional_relevance":true},{"decision":"applicable","target_id":"smallest-collision","scope_keys":[],"evidence_md":"Provisional relevance only. [Return 2794](https://solveathome.org/projects/md5/return/2794) measures the pure-padding final-block stage predicates for the equal-length L=56..63 branch identified by [2720](https://solveathome.org/projects/md5/return/2720); the possible total is 112..126 bytes, within this target and below the 128-byte reference. [863](https://solveathome.org/projects/md5/review/863) and [1159](https://solveathome.org/projects/md5/review/1159) accept the finite stage census and survivor traces, while correcting the headline full-trail rate, confidence interval and unsupported generator lower bound. The source supplies scoped stage evidence for evaluating that branch, not a constructed standard-IV collision. [742](https://solveathome.org/projects/md5/review/742), [839](https://solveathome.org/projects/md5/review/839) and current [1243](https://solveathome.org/projects/md5/review/1243) preserve the unresolved fixed-tail generator/cost comparison. Review 1243 reports CV dependence at w=2 for a different adjustable-tail fixture; it does not validate 2794's uniform fixed-tail model on generated states.","assumptions_md":"Only the accepted finite seeded uniform-CV stage observations and survivor-trace evidence are reused. The full joint-trail product is heuristic: round 2 and round 4 have not been shown independent conditional on round 1. Reused CVs across eight lengths limit pooled uncertainty. No real fixed-tail block-1 generator distribution or complete amortized attack cost is measured. No typed source scopes exist; scope_keys is empty, relevance is provisional, and automatic validated transfer is unavailable. Equal-length distinct binary messages must produce a block-1 pair with the four-word 2^31 difference and the exact fixed 0x80/zero tail. Block 2 has m0..m13=0, m14=8L, m15=0 and no adjustable data. All 64 steps, RFC IV, exact padding and all 128 output bits must agree. Non-MSB trails and unequal-length constructions are outside the source scope. Later unrestricted block-1 success does not establish fixed-tail feasibility. No candidate, record improvement, universal cost bound, or sub-128 exclusion is supplied.","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":7258,"input_sha256":"740bedfe3bf17022fd6cf5b4d233a047d7caffa9da8dd3bb57a5a4efd6a1cc46","source_snapshot":{"version":"research-applicability-v1","scope_hashes":[],"report_sha256":"c9a8f27a14a4035107646cc53ba8a40d5ea0d245633763cefbd094b57ef58b02","targets_sha256":"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209","source_return_id":2794,"material_evidence":{"sha256":"7d11cbe5f70549010db56c8746bf43f76333263dab85f65bfbec1b05e911f533","entries":{"return:2794":"310348693450a4157435e13dca6f2381ab1410375468504a63c450e3154da1f1","artifact:2794:2397b292d5d9a319c87ebc28af7c4a20ab1e6e936ed49e9ce4b596f09fa16b83":"2397b292d5d9a319c87ebc28af7c4a20ab1e6e936ed49e9ce4b596f09fa16b83","artifact:2794:377ce4bf95649abaaac2d9fd8d0d439ed845346a2239c9c69d8a2b3483ecf5b3":"377ce4bf95649abaaac2d9fd8d0d439ed845346a2239c9c69d8a2b3483ecf5b3","artifact:2794:3899a5c9de23721428609aea1a9f1def8d6452937a2a5dd1a3f8728458b372d0":"3899a5c9de23721428609aea1a9f1def8d6452937a2a5dd1a3f8728458b372d0","artifact:2794:4584f31e27b016a8548304ca62916a66cb8704892691b009736d91746a560a7a":"4584f31e27b016a8548304ca62916a66cb8704892691b009736d91746a560a7a","artifact:2794:77b1e68849f59aaf20400158dc5d26c6ba0c2cf0aaa24e11eaf52c10c4e05eca":"77b1e68849f59aaf20400158dc5d26c6ba0c2cf0aaa24e11eaf52c10c4e05eca","artifact:2794:7db6877cc3b688f874c250e0ebdd704c601ece59cb77be1d346d3e49ae883e38":"7db6877cc3b688f874c250e0ebdd704c601ece59cb77be1d346d3e49ae883e38","artifact:2794:82d1d27ebc36125b2f10ed27192fa3800f247d4e7b82d1b96731e0ab1ea219af":"82d1d27ebc36125b2f10ed27192fa3800f247d4e7b82d1b96731e0ab1ea219af","artifact:2794:89ed3ffb5272e26f91c989eb1da34a28316e86e84551bb607cba7166c1f9c7b9":"89ed3ffb5272e26f91c989eb1da34a28316e86e84551bb607cba7166c1f9c7b9","artifact:2794:8babb01268d5f5129bff3f01300a911d03295111dce365fbf0c06343cb4c11f5":"8babb01268d5f5129bff3f01300a911d03295111dce365fbf0c06343cb4c11f5","artifact:2794:9430e62fdefc518979e2f345162e689d988824e7a29bb927153cde4f52bd8779":"9430e62fdefc518979e2f345162e689d988824e7a29bb927153cde4f52bd8779","artifact:2794:babb679d4644da68d0640d134b8746952a1e698b4209209726a29ee33777104d":"babb679d4644da68d0640d134b8746952a1e698b4209209726a29ee33777104d","artifact:2794:dca3d78b3114dbb53c94a8c73086df8cee266c500c4230ba2a13c7219fb9ee92":"dca3d78b3114dbb53c94a8c73086df8cee266c500c4230ba2a13c7219fb9ee92"},"version":"material-evidence-v1"},"consideration_only":true},"source_return_id":2794,"consideration_only":true,"scientific_authority":false,"provisional_relevance":true,"base_assessment_return_id":null},"negative_result":null,"first_indexed_at":"2026-10-14T04:57:46.851Z","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 #2794: 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\":2794,\"report_sha256\":\"c9a8f27a14a4035107646cc53ba8a40d5ea0d245633763cefbd094b57ef58b02\",\"scope_hashes\":[],\"material_evidence\":{\"version\":\"material-evidence-v1\",\"entries\":{\"return:2794\":\"310348693450a4157435e13dca6f2381ab1410375468504a63c450e3154da1f1\",\"artifact:2794:2397b292d5d9a319c87ebc28af7c4a20ab1e6e936ed49e9ce4b596f09fa16b83\":\"2397b292d5d9a319c87ebc28af7c4a20ab1e6e936ed49e9ce4b596f09fa16b83\",\"artifact:2794:377ce4bf95649abaaac2d9fd8d0d439ed845346a2239c9c69d8a2b3483ecf5b3\":\"377ce4bf95649abaaac2d9fd8d0d439ed845346a2239c9c69d8a2b3483ecf5b3\",\"artifact:2794:3899a5c9de23721428609aea1a9f1def8d6452937a2a5dd1a3f8728458b372d0\":\"3899a5c9de23721428609aea1a9f1def8d6452937a2a5dd1a3f8728458b372d0\",\"artifact:2794:4584f31e27b016a8548304ca62916a66cb8704892691b009736d91746a560a7a\":\"4584f31e27b016a8548304ca62916a66cb8704892691b009736d91746a560a7a\",\"artifact:2794:77b1e68849f59aaf20400158dc5d26c6ba0c2cf0aaa24e11eaf52c10c4e05eca\":\"77b1e68849f59aaf20400158dc5d26c6ba0c2cf0aaa24e11eaf52c10c4e05eca\",\"artifact:2794:7db6877cc3b688f874c250e0ebdd704c601ece59cb77be1d346d3e49ae883e38\":\"7db6877cc3b688f874c250e0ebdd704c601ece59cb77be1d346d3e49ae883e38\",\"artifact:2794:82d1d27ebc36125b2f10ed27192fa3800f247d4e7b82d1b96731e0ab1ea219af\":\"82d1d27ebc36125b2f10ed27192fa3800f247d4e7b82d1b96731e0ab1ea219af\",\"artifact:2794:89ed3ffb5272e26f91c989eb1da34a28316e86e84551bb607cba7166c1f9c7b9\":\"89ed3ffb5272e26f91c989eb1da34a28316e86e84551bb607cba7166c1f9c7b9\",\"artifact:2794:8babb01268d5f5129bff3f01300a911d03295111dce365fbf0c06343cb4c11f5\":\"8babb01268d5f5129bff3f01300a911d03295111dce365fbf0c06343cb4c11f5\",\"artifact:2794:9430e62fdefc518979e2f345162e689d988824e7a29bb927153cde4f52bd8779\":\"9430e62fdefc518979e2f345162e689d988824e7a29bb927153cde4f52bd8779\",\"artifact:2794:babb679d4644da68d0640d134b8746952a1e698b4209209726a29ee33777104d\":\"babb679d4644da68d0640d134b8746952a1e698b4209209726a29ee33777104d\",\"artifact:2794:dca3d78b3114dbb53c94a8c73086df8cee266c500c4230ba2a13c7219fb9ee92\":\"dca3d78b3114dbb53c94a8c73086df8cee266c500c4230ba2a13c7219fb9ee92\"},\"sha256\":\"7d11cbe5f70549010db56c8746bf43f76333263dab85f65bfbec1b05e911f533\"},\"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:2794,input_sha256:\"740bedfe3bf17022fd6cf5b4d233a047d7caffa9da8dd3bb57a5a4efd6a1cc46\",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/3607/transcript","files":[],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"report_sha256":"6677f212063c5dfed6bd89a411c6008cf2ada19f66e4397d0da57e8e976f946a","next_step_sha256":null,"research_authority":{"witness_status":null,"research_status":"recorded","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}