Complete bounded recovery checks and reconcile blocked workplans
Assistant: codex Assistant-Model: gpt-6-astra Assistant-Session: 01a0e738-9e15-7600-87e6-90dec3a7beef
This commit is contained in:
parent
aea9796908
commit
9baf6f1829
21 changed files with 2301 additions and 53 deletions
|
|
@ -1,8 +1,8 @@
|
|||
# Classification coverage
|
||||
|
||||
Generated by `python3 scripts/classification_coverage.py`; assessment: 2026-09-27.
|
||||
Generated by `python3 scripts/classification_coverage.py`; assessment: 2026-09-28.
|
||||
|
||||
17 developed drafts; 16 original seeds at `2a5dabd`. 7 original seeds developed, 9 without dedicated drafts, 10 later additions. All current candidates remain hypotheses; classification confers no admission or new evidence.
|
||||
18 developed drafts; 16 original seeds at `2a5dabd`. 7 original seeds developed, 9 without dedicated drafts, 11 later additions. All current candidates remain hypotheses; classification confers no admission or new evidence.
|
||||
|
||||
The original comparison above is the compact 16-entry table. The broader initial [patterns README](../../patterns/README.md) lists 59 seed names; it is a separate discovery inventory, not 59 developed records or a release quota.
|
||||
|
||||
|
|
@ -22,8 +22,8 @@ A zero means no assigned direct coverage, not absence of discussion. Force direc
|
|||
| affordance | 2 | 6 |
|
||||
| mutation | 0 | 4 |
|
||||
| synchronization | 2 | 5 |
|
||||
| composition | 2 | 4 |
|
||||
| execution | 0 | 3 |
|
||||
| composition | 2 | 5 |
|
||||
| execution | 0 | 4 |
|
||||
| quality | 2 | 3 |
|
||||
|
||||
## Scales
|
||||
|
|
@ -34,7 +34,7 @@ A zero means no assigned direct coverage, not absence of discussion. Force direc
|
|||
| L1 | 0 | 1 |
|
||||
| L2 | 3 | 6 |
|
||||
| L3 | 7 | 5 |
|
||||
| L4 | 2 | 3 |
|
||||
| L4 | 2 | 4 |
|
||||
| L5 | 1 | 2 |
|
||||
| L6 | 4 | 13 |
|
||||
| L7 | 0 | 0 |
|
||||
|
|
@ -53,7 +53,7 @@ These are direct-mechanism assignments, not family aliases. In particular, recon
|
|||
| mutation | 4 |
|
||||
| synchronization | 2 |
|
||||
| reconciliation | 4 |
|
||||
| composition | 3 |
|
||||
| composition | 4 |
|
||||
| execution | 3 |
|
||||
|
||||
## Forces
|
||||
|
|
@ -92,14 +92,14 @@ Selected trade-offs only. Counts are unique candidates per force, even if a forc
|
|||
| independent-deployability | 1 | 0 | 1 |
|
||||
| team-autonomy | 1 | 0 | 1 |
|
||||
| release-coupling | 0 | 0 | 0 |
|
||||
| compatibility-pressure | 0 | 2 | 2 |
|
||||
| implementation-complexity | 0 | 9 | 9 |
|
||||
| compatibility-pressure | 0 | 3 | 3 |
|
||||
| implementation-complexity | 0 | 10 | 10 |
|
||||
| reconciliation-complexity | 0 | 2 | 2 |
|
||||
| cognitive-load | 0 | 3 | 3 |
|
||||
| testability | 1 | 0 | 1 |
|
||||
| observability | 0 | 0 | 0 |
|
||||
| debuggability | 0 | 0 | 0 |
|
||||
| portability | 1 | 0 | 1 |
|
||||
| portability | 2 | 0 | 2 |
|
||||
| security-exposure | 0 | 0 | 0 |
|
||||
| scalability | 0 | 0 | 0 |
|
||||
| fault-containment | 1 | 0 | 1 |
|
||||
|
|
@ -112,6 +112,7 @@ Selected trade-offs only. Counts are unique candidates per force, even if a forc
|
|||
|
||||
| Candidate | Responsibilities | Intended benefit | Cost / tension | Rationale |
|
||||
| --- | --- | --- | --- | --- |
|
||||
| [Capability Contract Boundary](../candidates/CapabilityContractBoundary.md) | composition | portability | implementation-complexity, compatibility-pressure | Separates a semantic capability interface from its runtime carrier to support host portability; versioning, enforcement and cross-host compatibility add work. Declaring the contract alone supplies neither runtime isolation nor independent release. |
|
||||
| [Conflict Copy](../candidates/ConflictCopy.md) | reconciliation | recoverability, information-completeness | cognitive-load, reconciliation-complexity | Preserves divergent content for later semantic resolution; unresolved copies impose review and merge work. |
|
||||
| [Derived State](../candidates/DerivedState.md) | projection | authoritative-consistency | client-compute-cost, cache-invalidation-complexity | Projects coherent inputs without separately mutable derived copies; recomputation and cached dependency tracking cost work. |
|
||||
| [Explicit Reconciliation](../candidates/ExplicitReconciliation.md) | reconciliation, affordance | information-completeness, recoverability | cognitive-load, continuity-of-interaction | Makes semantic resolution an explicit comparison task; deciding among versions interrupts ordinary work. |
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue