docs: enter the project owner's decisions on clarifications 98, 102 and 103
Clarifications 18 to 20 of the pre-registration, approved 2026-11-13 before anything is computed: part II has no verdict when no step can be built, a single facility cannot be the 25 % step (clarification 104 of the specification, not coded yet), and the paths the ownership forms are compared on. Co-Authored-By: Claude Fable 5.2 <noreply@anthropic.com>
This commit is contained in:
parent
f5b386ff21
commit
b4aa608d6d
6 changed files with 84 additions and 15 deletions
10
CLAUDE.md
10
CLAUDE.md
|
|
@ -50,9 +50,11 @@ carousel, Python code, and a Claude plugin (own repo, later).
|
|||
the power system and the cash flow, and 82 to 87 those made when T and the loss of demand were taken through
|
||||
the levelised cost, ownership and scale, and 88 to 94 those made when M5 and the verdicts were coded for
|
||||
five solutions and three sensitivities of chapter 17.8 as switches, all settled against an independent
|
||||
reader's code. Clarifications 95 to 103 settle the run over the draws (the part of clarification 60 that
|
||||
concerns it); 98 (which paths the ownership forms are compared on) and 102 (part II when no step can be
|
||||
built) are choices put to the operator. Clarification 93 (which conditions can be named when M5 holds under
|
||||
reader's code. Clarifications 95 to 104 settle the run over the draws (the part of clarification 60 that
|
||||
concerns it); 98 (which paths the ownership forms are compared on), 102 (part II when no step can be built)
|
||||
and 104 (a single facility cannot be the 25 % step) were approved by the operator 2026-11-13 and are
|
||||
clarifications 20, 18 and 19 of the pre-registration. **104 is not coded yet:** `dommer.trinn_for_dommene`
|
||||
still follows clarification 57; it is coded with the thresholds, before anything is computed. Clarification 93 (which conditions can be named when M5 holds under
|
||||
conditions) was approved by the operator 2026-11-13 and is clarification 17 of the pre-registration; it is
|
||||
not coded yet, and `dommer.del_I` takes the answer as an argument.
|
||||
Solution T (`Losning.T_F`, `Losning.T_K`) goes through `lag_plan` (a `Trinnvisplan`) and `regn_program`
|
||||
|
|
@ -74,7 +76,7 @@ carousel, Python code, and a Claude plugin (own repo, later).
|
|||
Present values are exactly rounded sums (`math.fsum`), never numpy dot products: those are not repeatable
|
||||
to the last digit. Sums over technologies go in the plants' own order, never over a set of names: its order
|
||||
differs from run to run.
|
||||
`kjoring.py` is the run over the draws (clarifications 95 to 103): `regn_trekning` gives, for one set of
|
||||
`kjoring.py` is the run over the draws (clarifications 95 to 104): `regn_trekning` gives, for one set of
|
||||
values, every solution on every step of the ladder (`STIGE`) in the six scenarios (`SCENARIOER`) as a `Bane`
|
||||
(buildable or not, the timeline S50, and an `Utfall` per scenario: NNV, S42, M3, M4, M6); `kjor` does it for
|
||||
a sequence of sets, in the order of the draws and on `prosesser` processes with the same figures to the last
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue