Items

The priority items, each a node of the map; PRIORITIES.md is rendered from them.

1. Persistence of the certified core minimum open
2. A computable coherence modulus, or a proof there is none open
3. Registry completeness for the objection grammar open
4. Higher-dimensional sharpness for the movement cap open
5. Constructing rather than reading the audited pair open
6. Schema-level demand rates open
7. Model the market and the traders open
8. The doubly-soft weight class open
9. Forcing headlines that are squeezes open
10. Build the Lean in CI open
11. Verification-register presence check in CI open
12. A necessity witness for every hypothesis that lacks one open
13. Scaffolding self-verification open
14. Faithful acceleration: exact inherited status, and what ports open
15. Finite settlement classification, and the local delegation bridge open
16. The certificate inequality, derived open
17. Simulator substitution: the divergence witness open
18. Bounded densification study open
19. Triangle compatibility audit open
20. Admissibility red team, including the proof machinery closed
21. Signed versus magnitude control of grade error closed
22. The weakest protected-authority interface open
23. Lean promotion of the finite wave-1 results open
24. Selective validity of low-error self-assessment open
25. Bound the near-indifference leakage, or show it cannot be bounded open
26. Admissibility red team, rerun under skeleton v2 open
27. A fully-updated comparator with a fallible future agent open
28. Can any valuation price a jurisdiction assignment? closed
29. Does the Φ-regret reduction instantiate on this substrate? closed
30. A learner with sublinear Φ_law-regret, and what it retires open
31. Does the objection grammar already represent a remediable-pattern filing? open
32. Extract the bounded prospective loss interface open
33. Separate causal transformation structure from normative certification open
34. Does the selection-punishing menu bite the ported tower ⟹ Value chain? open
35. End-to-end module pipeline round open
36. The wiki's source in the repository, synced outward closed
37. Volatile quantities in `wiki/` cite the structured state or do not appear closed
38. Enforce the write-scope conditions and the job enumeration closed
39. Does normative statics produce a credal constraint, or only a price demand? open
40. Is bounded cumulative enforcement liability necessary? open
41. The safety theorem against the dependency's own construction closed
42. An efficiently presentable sufficient row family for coherence open
43. A compiler that is both exact and safe, or a proof there is none open
44. What governs removing a world from support altogether? open
45. Is either liability bridge necessary? open
46. Should force cost depend on the row presentation? open
47. Logical Induction over an assessment process closed
48. The modified market as a computable belief sequence closed
49. A kernel proof of `DistanceComplete` for the exact dual-distance family open
50. The piecewise-affine facts the projection compiler cites closed
51. The deductive coherence region as a computable rational vertex list closed
52. Import the Cartesian-frames definitions and delete the mirror open
53. The `May`-rule-to-scope compiler open
54. Defeater-uptake completeness open
55. The `Due` connection: token, docket item, certified response open
56. A citation discipline for `Licensed`, and its transport open
57. A checker for the applicability-in-source convention open
58. Composition of the reason state with the record calculus open
59. A `Due` an advisor cannot select within open
60. A transition model of reachable corrective capability closed
61. A normative source with summable enforcement liability open
62. The inertness dichotomy in Lean open
63. `Sigma_n` as a computable deductive process open
64. What the inquiry interface consumes open
65. Whether `L_min(V)` is needed in its strong form open
66. Grounded Replay in Lean open
67. A capability on authority-bearing standing open
68. Discharging provenance adequacy open
69. Bounded-lifetime liability open
70. A current-state certificate open
71. Build the due-activation term in `roots()` open
72. Close the two evasions the improvement theorem cannot open
73. What is the baseline for a demonstrated improvement open
74. Is the finite-horizon infeasibility certificate complete for the causal problem? open
75. Close the loop: policy-dependent date costs open
76. Certify a reason's temporal modulus open
77. What licenses authorized disposition? open
78. Canonicalize the legitimacy spine from the consolidation closed
79. Convex representability and compiler completeness for a declared requirement class open
80. Affordable service on an adaptive docket open
81. A jointly compatible practical-response ecology open
82. Aggregation laws with several parents open
83. Eligible liveness and the NLAL case split in Lean open
84. The operative-value-security bridge open
85. Margin realization and end-to-end rate compatibility open
86. Bounded competence against legitimate continuation policies under endogenous admissibility open
87. Realizing legitimate deference: the evaluation-ecosystem bill open
88. Affordability from the traderization perspective: a canonical presentation open
89. Sealed comparison: an architecture under which the constitutional comparison of `{π, 𝔠π}` is sealed against every continuation until settlement open
90. The generability certificate of the soft-weighted finite-menu constraint open
91. Empirical settlement of activated securities: an oracle-relativized inductor open
92. The reason-side supply obligation: the realization's protection rule and the general-cost optimum open
93. Discovery of decision-relevant reasons: the repertoire and the budget open
97. Declare each channel's reference in the evaluation ecosystem, and certify its realization open
98. The nondelegation certificate and the amendment event kind open
99. The allocation floor: delegation safety, allocation completeness, exact shortfall reporting, and the reach cone open
100. The normativity-side instance of the trace interface open
101. The shortfall event as a security: generability and pricing of `Short` open
102. BRIA's bids against the market: block claims as priced securities open
103. A decision theory for logical inductors without the split between a belief market and a choice learner open
104. The corrigibility kernel headline: the registered statements and what they leave open open
105. Belief–decision compatibility: W1 as a theorem of record, and the unresolved implication open
106. A candidate LI/BRIA synthesis against the acceptance statement open
107. The post's backing: thin legitimacy, effective authority, and the post's theorem open
108. The thin specification for evaluations, where no outside fact plays the world's role open
109. Preservation for a logical-inductor principal open
110. A definition of the baseline `B` open
111. Unbiasedness From Feedback for the score sequence, from `LogicalInduction` open
112. Occurrence-level defeat: the orphan pin closed
113. Settlement defeat for strength rows: a linear row contraposes closed
114. The pinned-region divergence against the pinned market maker open
115. Transport of `Licensed` across record transitions open
116. The record as reason trace: what it mediates, the defect, and the port's duplicate closed
117. The selection lock: a canonical joint rule for warrant strengths, and a selection the docket may seal open
118. Rational attainment and certificate completeness for the computed forced interval open
119. Hidden discord: a region-level convergence measure open
120. Exhaustive sharing on trace-constitutive dockets: what exchange equalizes live sets open
121. Transitive retirement, and the closure a settlement must carry closed
122. The transport's negated-form drop open
123. The sharp bankroll across a reopening, and the cushion exploit against the pinned market maker open
124. Certified bounds at the displayed price: the licence–force bridge closed
125. Distance-to-region conformance for the rowwise enforcer open
126. The bankroll across repeated reopenings open
127. Defeaters as undercutting occurrences: the grounded extension with attacks open
128. Admission from the accounted state closed
129. A per-day gap-bet bound from the constraint compiler open
130. An intervention semantics for Robust Openness, read off the accounted state open
131. The ask-list deviation as a dimension of the counted trace open
132. A settlement that produces grade trust, or the proof none does open
F1. Job names in prose, and root documents that classify into no layer open
F2. The deference line has no claims registry — *closed* closed
F3. A layer's theory is authoritative and its only code is in a disposable tree open
F4. A pointer into a superseded source tree still resolves — *closed* closed
F5. Agent worktrees live inside the repository and nothing ignores them — *closed* closed
F6. The name lint cannot see a citation — *closed* closed
F7. A round cannot record a dependency on an unindexed research checkpoint open
F8. A stack of merged pull requests never reached `main` — *closed* closed
Q1. What kind of statement bounds the near-indifference leakage? open
Q2. What disciplines the grade-to-quantity relation? open
Q3. How is foreclosure expressible? open
Q4. What certifies resource-separated computational futurity? open