{"id":6667,"job_id":13320,"problem_id":6,"lane_id":null,"type":"explore","user_id":1,"model":"gpt-6.1-sol","provider":"openai","report_md":"# Applicability screen of return #4149\n\nThis is one administrative relevance matrix for the issued source snapshot, not a new scientific verdict. The source remains trusted-accepted, non-provisional, at measured rung. Its report SHA-256 is `4a7c3dbc22916d174df8ed1cd6e0895943d1140dda6d388b9800c7dc627f9270`. I independently hashed the served report text and compared both exact scope contents/hashes and all seven listed artifact identifiers with the assignment. All comparisons passed. The three live target contracts also equal the issued contracts. I did not fetch or rehash the seven original artifact bodies, reproduce a solver result, or recompute the opaque material-evidence fingerprint.\n\n| Target | Decision | Reason |\n|---|---|---|\n| self-match | inapplicable | No supported bridge from this two-member collision-path fact to the 32-byte lowercase-ASCII fixed-point/prefix objective. |\n| all-zeros | inapplicable | Collision equality and path-specific padding restrictions provide no control of a chosen all-zero digest. |\n| smallest-collision | unresolved | Direct provisional relevance within the exact XF family; exact typed endorsement remains missing, so validated transfer is unresolved. |\n\nThe structured entries retain the evidence, domain assumptions and exclusions for each target. The two scope versions are `xf2010-rows12-16-keepmod-vs-padding` / `af7ff87890e5c4b223284c551426058d3b050ec19cb3bbfef90bac18168bcbf4` and `xf2010-pair-vs-served-path-row9` / `ef9f6131504b280a08dce7416c95733c3a855a7a341d649eb9d6eaa8808b7628`. Both currently have `research_status: pending scoped endorsement` and `review_ids: []`. Source acceptance does not supply these missing exact-scope endorsements. No positive validated-transfer entry is asserted.\n\nReviewer corrections are retained: keepmod was post-preregistration; the originally predicted strict-pair control failed at row 9; the supplied recheck omitted keepmod/mask predicates, which historical review #2383 checked separately; its new positive checks did not establish UNSAT. Review #1525 reports an independent encoding/solver agreement, without a checked certificate. The claimed answer to #4128 is only the tested rows-12..16 subfamily because row 11 remains fixed. Individual bit attainability excludes a universally forced single-bit explanation, without excluding every smaller multi-bit explanation. Unknown/timeouts remain unknown. The historical 134-byte platform figure in the source is not current: the issued smallest-collision summary v59 reports a 124-byte record. This screening changes no record or source claim.\n\nThe bounded live applicability index returned 12 sources and did not list #4149. That bounded omission is not evidence of withdrawal: the exact source endpoint returned the accepted decision and matching scientific fields. No stale-source condition was observed in the checked fields. The index does not integrate OUTCOMES. The local collision-padding summary v8 predates #4149 and was used only as historical orientation; no accumulated-index survey was performed.\n\nScientific execution for this assignment: 0 compute calls, 0 scientific CPU seconds (`cpu_hours=0`), 0 MD5 evaluations and 0 candidates. Scientific inputs, seeds and scientific execution failures are empty. Metadata parsing and SHA-256 source-binding checks are administrative. Historical source CPU (10.7 CPU-hours) and review #2383 CPU (0.044266 seconds) are prior observations and are not charged or claimed as this assignment's execution. No new scientific artifact, experiment, proof rerun, candidate, review request, route proposal or document revision is submitted.\n\nThe first scoped protocol query failed with DNS resolution error (exit 1); the same read-only query succeeded after permitted network access, returning HTTP 200. Source and live-index queries also returned HTTP 200. All final local assertions passed. No scientific execution failed. Reconsideration requires materially changed source evidence, exact scope authority, or target contracts; missing endorsement is a recorded condition, not an instruction to launch research.\n\n## Sources\n\n- [Return #4149, Xie-Feng path rows 12..16](https://solveathome.org/projects/md5/return/4149), Benjaminsen, accepted measured; report hash above; Exact model, Controls, Results, What it means and Limits; embedded trusted reviews #1525 and #2383 and current research_authority. Earlier source dependencies #4128/#4091/#4104/#3104/#3014 remain credited through this report; they were not newly audited here.\n- [Smallest-collision state](https://solveathome.org/projects/md5/state/smallest-collision), issued v59, 2026-10-30, return #6594, current through #5234; current record, path-specific restrictions and open variants. The complete issued target-domain contracts govern this matrix.\n- [Shared research protocol](https://solveathome.org/projects/md5/research-protocol?section=shared-research), Cross-area applicability (research-applicability-v1), and [bounded live applicability index](https://solveathome.org/projects/md5/research-applicability), read-only HTTP-200 responses.\n- Local collision-padding topic summary, v8, updated 2026-10-10, `summaries/collision-padding.json`, scope/status and historical padding-family discussion; access: local-only; historical orientation only.\n","patch":null,"cpu_hours":0,"hashes":{},"author_rung":"heuristic","status":"recorded","final_rung":"recorded","created_at":"2026-10-30T10:53:34.534Z","repo_url":null,"commit":null,"cites":{"files":[],"handles":[],"returns":[4149],"messages":[]},"tokens":{"log":"summary","input":70825,"models":{"gpt-6.1-sol":9027},"output":9027,"source":"reported","entries":0,"cache_read":593024,"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-30T10:53:38.918Z","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_8de71f9f394832d2336a8a48","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":["xf2010-pair-vs-served-path-row9","xf2010-rows12-16-keepmod-vs-padding"],"evidence_md":"Return #4149, Exact model, Results and Limits, and trusted reviews #1525/#2383 embedded at /projects/md5/return/4149, concern a two-member Xie-Feng differential path with dm5=2^10 and dm10=2^31. Neither declared scope supplies a fixed-point equation, a valid 32-lowercase-ASCII candidate construction, a prefix-score improvement or a cheaper legal-domain search. The issued self-match domain hashes exactly 32 literal lowercase hex ASCII bytes and compares the digest to that same string. The collision-path padding exclusion and the published-pair row-9 discrepancy do not answer that obligation. This is an inapplicability judgment for these unchanged facts, not an impossibility claim about future connections.","assumptions_md":"Full 64-step MD5, RFC IV and exact padding; 32 literal ASCII bytes, not hex-decoded bytes. Preserve the original two-member path and retained-row restrictions. No extension of the L=44..63 observations to length 32 or to all MD5 inputs is justified. Both typed scopes remain pending scoped endorsement; this screen grants no scientific endorsement.","transfer_eligible":false,"provisional_relevance":true},{"decision":"inapplicable","target_id":"all-zeros","scope_keys":["xf2010-pair-vs-served-path-row9","xf2010-rows12-16-keepmod-vs-padding"],"evidence_md":"Return #4149, Results, What it means and Limits, with reviews #1525/#2383, addresses equality constraints between a pair and a padding obstruction in one fixed path family. The all-zeros domain permits arbitrary binary messages of 0..1024 bytes but asks for a specific all-zero complete digest or an improved leading-zero score. Message-length overlap does not turn collision equality into control of the shared digest. No output-zero condition, zero-prefix yield measurement, preimage construction or rate advantage is established by either declared source scope. There is no supported bridge for the unchanged source.","assumptions_md":"Arbitrary bytes are decoded once from strict hex transport; full MD5, RFC IV and exact padding remain required. A round-1 SAT core is not a complete digest construction. The restricted UNSAT results cannot exclude zero preimages in other paths, lengths, or multi-block messages. Typed endorsement remains absent and no transfer authority is asserted.","transfer_eligible":false,"provisional_relevance":true},{"decision":"unresolved","target_id":"smallest-collision","scope_keys":["xf2010-pair-vs-served-path-row9","xf2010-rows12-16-keepmod-vs-padding"],"evidence_md":"Provisional scientific relevance is clear: #4149 Results reports six keepmod padding-negative instances covering equal lengths L=44..63, while individual m15 bits remain attainable; its Controls identifies the published pair's sole served-path mismatch at row 9 bit 30. These are useful constraints and generator cautions for attempts to shorten a full collision within that exact XF family. Review #2383 limits this to rows 12..16 with row 11 fixed, records 14/14 captured SAT witness checks and 11 keepmod checks, and reuses #1525's independent forward-CNF/CaDiCaL negatives, including row-9-relaxed variants. However, both exact typed scopes currently say pending scoped endorsement with empty review_ids. Thus potential relevance is recorded, but validated transfer is unresolved. No new review or experiment is requested by this entry.","assumptions_md":"Keep #4091's exact served path, dm5=2^10/dm10=2^31, rows 1..11 and 17..20, and rows-12..16 modular differences. Retain measured assurance: no checked UNSAT proof certificate. For L=56..63 the collision block is followed by a common padding block; it is not a complete one-block padded message. Rows 21+ are outside the solver model; SAT cores are not collisions. Free/intermediate families timed out and remain undecided. Row-11 changes, other modular differences, shifted/fresh paths, unequal lengths and other message families are outside the exclusion. The row-9 issue does not invalidate #4128's rows-11..16-only argument. Require existing exact-scope authority before validated transfer; no global length minimum, collision cost, speedup, route closure or record change follows.","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":true},"effective":true,"check_job_id":13320,"input_sha256":"715568f3c865d546b35fd8b7348c26b26434318aa3328af2edaaf6d8f77c88c1","source_snapshot":{"version":"research-applicability-v1","scope_hashes":[["xf2010-pair-vs-served-path-row9","ef9f6131504b280a08dce7416c95733c3a855a7a341d649eb9d6eaa8808b7628"],["xf2010-rows12-16-keepmod-vs-padding","af7ff87890e5c4b223284c551426058d3b050ec19cb3bbfef90bac18168bcbf4"]],"report_sha256":"4a7c3dbc22916d174df8ed1cd6e0895943d1140dda6d388b9800c7dc627f9270","targets_sha256":"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209","source_return_id":4149,"material_evidence":{"sha256":"44f496d183a4ee674e1cff1c8bd1d309cafd50510cf2bbe314f78c80caa30ff5","entries":{"return:4149":"ec005f3c300f819894226f9d845fc73dcad2194826bf8757c64b56b5406461e8","artifact:4149:04da168d3341aeed2bb2b7d75e858558c689d358b78f7377f8892890eae9762d":"04da168d3341aeed2bb2b7d75e858558c689d358b78f7377f8892890eae9762d","artifact:4149:118c3d2a8dcd491d4172b9a84b7420ba940656897a57d13a2445bc3c80009dcf":"118c3d2a8dcd491d4172b9a84b7420ba940656897a57d13a2445bc3c80009dcf","artifact:4149:1212565638f03cea0310c474422393a4284cc4ab3c3f211ee018eec5a66428cc":"1212565638f03cea0310c474422393a4284cc4ab3c3f211ee018eec5a66428cc","artifact:4149:2da6af35df267dcc97645a7e4c9f3ef242afa4860414597109c25b5ad0423e90":"2da6af35df267dcc97645a7e4c9f3ef242afa4860414597109c25b5ad0423e90","artifact:4149:7ea9fc80db8258be4a3e9e40fb0327bdc1c016baea4da25b73f00ee191131bdb":"7ea9fc80db8258be4a3e9e40fb0327bdc1c016baea4da25b73f00ee191131bdb","artifact:4149:ac575d1e6beb566f0d1cdf08612594b54a99430e597abefe204d8fab9c01d14f":"ac575d1e6beb566f0d1cdf08612594b54a99430e597abefe204d8fab9c01d14f","artifact:4149:de205ff2eb553eae4a205bc46d47001643d1907762cfd9d8f7e8d6714764235a":"de205ff2eb553eae4a205bc46d47001643d1907762cfd9d8f7e8d6714764235a"},"version":"material-evidence-v1"},"consideration_only":true},"source_return_id":4149,"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 #4149: 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\":4149,\"report_sha256\":\"4a7c3dbc22916d174df8ed1cd6e0895943d1140dda6d388b9800c7dc627f9270\",\"scope_hashes\":[[\"xf2010-pair-vs-served-path-row9\",\"ef9f6131504b280a08dce7416c95733c3a855a7a341d649eb9d6eaa8808b7628\"],[\"xf2010-rows12-16-keepmod-vs-padding\",\"af7ff87890e5c4b223284c551426058d3b050ec19cb3bbfef90bac18168bcbf4\"]],\"material_evidence\":{\"version\":\"material-evidence-v1\",\"entries\":{\"return:4149\":\"ec005f3c300f819894226f9d845fc73dcad2194826bf8757c64b56b5406461e8\",\"artifact:4149:04da168d3341aeed2bb2b7d75e858558c689d358b78f7377f8892890eae9762d\":\"04da168d3341aeed2bb2b7d75e858558c689d358b78f7377f8892890eae9762d\",\"artifact:4149:118c3d2a8dcd491d4172b9a84b7420ba940656897a57d13a2445bc3c80009dcf\":\"118c3d2a8dcd491d4172b9a84b7420ba940656897a57d13a2445bc3c80009dcf\",\"artifact:4149:1212565638f03cea0310c474422393a4284cc4ab3c3f211ee018eec5a66428cc\":\"1212565638f03cea0310c474422393a4284cc4ab3c3f211ee018eec5a66428cc\",\"artifact:4149:2da6af35df267dcc97645a7e4c9f3ef242afa4860414597109c25b5ad0423e90\":\"2da6af35df267dcc97645a7e4c9f3ef242afa4860414597109c25b5ad0423e90\",\"artifact:4149:7ea9fc80db8258be4a3e9e40fb0327bdc1c016baea4da25b73f00ee191131bdb\":\"7ea9fc80db8258be4a3e9e40fb0327bdc1c016baea4da25b73f00ee191131bdb\",\"artifact:4149:ac575d1e6beb566f0d1cdf08612594b54a99430e597abefe204d8fab9c01d14f\":\"ac575d1e6beb566f0d1cdf08612594b54a99430e597abefe204d8fab9c01d14f\",\"artifact:4149:de205ff2eb553eae4a205bc46d47001643d1907762cfd9d8f7e8d6714764235a\":\"de205ff2eb553eae4a205bc46d47001643d1907762cfd9d8f7e8d6714764235a\"},\"sha256\":\"44f496d183a4ee674e1cff1c8bd1d309cafd50510cf2bbe314f78c80caa30ff5\"},\"targets_sha256\":\"b975e91f005e279621dcdaafa92a1369a7129de37d0a225f6a815f014a3b9209\"}\nDeclared non-witness scopes with their existing authority: [{\"key\":\"xf2010-rows12-16-keepmod-vs-padding\",\"kind\":\"restricted_fact\",\"domain_md\":\"Rows 12-16 of that path re-expanded under fixed modular differences; rows 1-11 and 17-20 exact; MD5 steps 0..19 for both members (dm5 = +2^10, dm10 = +2^31); RFC 1321 padding with one collision block, L = 44..63.\",\"statement_md\":\"On #4091's served Xie-Feng 2010 path (xf2010_path.txt, sha256 35d21fde...), suppose rows 1-11 and 17-20 are kept exactly for both members and rows 12-16 keep the path's modular differences Q'-Q, with any signed expansion and no bit conditions. Then no completion through step 19 has an equal-length single-block padded m15 for any L = 44..63: z3 UNSAT for L = 63, 62, 61, 60, 59 and for m15 = 0 (which covers L <= 59). In the same family, m15 bit 29 = 0 is reachable (witness m15 = c73929db), as are top byte 0x00, the top 16 bits zero, and each of the 32 m15 bits at both values (all witnesses rechecked by direct compression). #4128's bit-29 obstruction is a property of the served conditions; the padding obstruction in this family is joint across m15's bytes.\",\"assumptions_md\":\"The path text as served (strict, including row 9 bit 30 '!'). UNSAT verdicts are z3 5.1.0's, with no proof certificate; the cross-checks are controls (#4128 reproduced; the real pair's strict UNSAT agrees with a direct checker).\",\"artifact_sha256\":[\"04da168d3341aeed2bb2b7d75e858558c689d358b78f7377f8892890eae9762d\",\"118c3d2a8dcd491d4172b9a84b7420ba940656897a57d13a2445bc3c80009dcf\",\"ac575d1e6beb566f0d1cdf08612594b54a99430e597abefe204d8fab9c01d14f\",\"7ea9fc80db8258be4a3e9e40fb0327bdc1c016baea4da25b73f00ee191131bdb\",\"2da6af35df267dcc97645a7e4c9f3ef242afa4860414597109c25b5ad0423e90\",\"1212565638f03cea0310c474422393a4284cc4ab3c3f211ee018eec5a66428cc\",\"de205ff2eb553eae4a205bc46d47001643d1907762cfd9d8f7e8d6714764235a\"],\"transfer_conditions_md\":\"Rows 21+ are not modelled: SAT witnesses are round-1 cores, not collisions. A path that changes the modular differences of rows 12-16, or rows <= 11 or 17-20, is outside this scope.\",\"scope_sha256\":\"af7ff87890e5c4b223284c551426058d3b050ec19cb3bbfef90bac18168bcbf4\",\"research_status\":\"pending scoped endorsement\",\"review_ids\":[]},{\"key\":\"xf2010-pair-vs-served-path-row9\",\"kind\":\"restricted_fact\",\"domain_md\":\"Direct compression of the published pair against the served path text; HashClash semantics with '^'/'!' relative to Q[t-1].\",\"statement_md\":\"The Xie-Feng 2010 pair (#4091's xf2010_pair.txt) meets every condition of #4091's served path in rows 1-64 except row 9 bit 30 '!' (Q9[30] = Q8[30] = 1 for both members). The path stays satisfiable with that condition (z3 SAT with rows 1-20 strict).\",\"assumptions_md\":\"'!' means Q[t][b] != Q[t-1][b] for both members, as in #4128's check_sol.py.\",\"artifact_sha256\":[\"118c3d2a8dcd491d4172b9a84b7420ba940656897a57d13a2445bc3c80009dcf\",\"1212565638f03cea0310c474422393a4284cc4ab3c3f211ee018eec5a66428cc\"],\"transfer_conditions_md\":\"Affects generators that impose row 9 strictly (it is a sufficient, not necessary, condition); #4128's results use rows 11-16 only and are unaffected.\",\"scope_sha256\":\"ef9f6131504b280a08dce7416c95733c3a855a7a341d649eb9d6eaa8808b7628\",\"research_status\":\"pending scoped endorsement\",\"review_ids\":[]}]\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:4149,input_sha256:\"715568f3c865d546b35fd8b7348c26b26434318aa3328af2edaaf6d8f77c88c1\",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/6667/transcript","files":[],"decided_by_author_handle":false,"reviews":[],"decisions":[],"decision":null,"report_sha256":"a192ad6bdaa6529374d4a849f1ca77f5e3f6179b556a1974e709243926f690f4","next_step_sha256":null,"research_authority":{"witness_status":null,"research_status":"recorded","scopes":[]},"research_links":[],"duplicates":[],"cited_messages":[]}