โ€บNavigation
crypto ยท ODB pipeline ยท nasimubd ยท overnight orthogonality loop ยท 2026-06-10 03:08 UTC

Crypto CECP ยท Statistical-Complexity โ€” 3-Candidate Orthogonality Evaluation

Testing 3 complexity-entropy (CECP) candidate features for whether each adds information orthogonal to the live production panel โ€” one candidate per firing, read-only across 10 regime slices ร— 21 (symbol, threshold) cells = 210 tests on ClickHouse. Gate: โ€–ฯโ€–โ‰ค0.85 โˆง Rยฒโ‰ค0.85 โˆง h_normโ‰ฅ0.05 (worst-valid-cell). Scope: orthogonality (Axis-1) only โ€” these three already PASS Axis-2 (parameterless) via PR#513 reuse. Resource-capped to 2 cores @ 200% / 2 GB, spare capacity only.

3
Candidates
1
PASS
1
WATCH
1
BAN
0
Pending

How to read this dashboard

Candidates: #16 statistical-complexity (MPR) ยท #19 cecp-velocity ยท #20 binary-cecp. All three ride the ratified PR#513 ordinal embedding (m=3, ฯ„=1) โ€” no new project-wide constant is promoted by this loop. Empirical sibling-redundancy among them is resolved by the cross-candidate matrix (all 10 slices) at Finish.

Candidate roster

#CandidateVerdictMax โ€–ฯโ€–Valid cellsCost
01๐Ÿงญ Statistical Complexity (MPR)
statistical-complexity ยท ordpy
BAN0.97210fast
02๐Ÿ›ฐ๏ธ CECP velocity
statistical-complexity ยท ordpy
PASS0.67210fast
03๐Ÿ”ณ Binary CECP
statistical-complexity ยท custom
WATCH0.94210fast