Cardano Updates

Aligns all three committee modes to a consistent 75% quorum (wfa-ls was
already 450/600 = 75%) and captures nearly all block-producing nodes in
the top-stake-fraction committee.

Co-Authored-By: Claude Opus 4.6 (1M context) <[email protected]>

Add Determinism section covering all sources of non-determinism that
were found and fixed (HashMap iteration, shard assignment, TX ID
counters, rayon collect order, event stream sorting), what was tested
and found unnecessary (barrier synchronization), and what does not
affect determinism (CpuTaskQueue HashMap, config HashSets).

Add Benchmark Scripts section documenting cip-voting-options.sh,
poll-sim.sh, and the determinism verification methodology.

Co-Authored-By: Claude Opus 4.6 (1M context) <[email protected]>

When simulation stats lines are absent (e.g. 0 uncertified EBs),
grep exits with code 1 which trips set -e before the ${var:-0}
default can take effect.  Add || true to all stat-parsing greps.

Co-Authored-By: Claude Opus 4.6 (1M context) <[email protected]>

Two sources of cross-run non-determinism in the multi-shard
sequential engine:

1. Shard assignment: zero_latency_clusters, min_latency_clusters, and
   min_cut all collected components via HashMap whose iteration order
   varies per process.  Switch to BTreeMap and add a stable tiebreaker
   to the component sort so shard-to-node mapping is a pure function
   of the topology.

2. TX ID assignment: RealTransactionConfig used shared AtomicU64
   counters (next_id, input_id) across shard threads with Relaxed
   ordering, making ID assignment depend on OS scheduling.  Move
   counters into per-shard TxGeneratorCore with offset ranges
   (shard_index * 1B) so IDs are deterministic and non-overlapping.

Co-Authored-By: Claude Opus 4.6 (1M context) <[email protected]>

Multi-shard execution emits tracking events from concurrent shard
threads via an mpsc channel, so events at the same virtual timestamp
can arrive in arbitrary order.  Buffer events in timestamp buckets
(BTreeMap) with a 1-second flush window, sorting each bucket by
originating node ID before writing.  This makes the jsonl event
stream byte-identical across runs without affecting simulation logic.

Also adds Event::node_id() to extract the originating node from each
event variant for sorting purposes.

Co-Authored-By: Claude Opus 4.6 (1M context) <[email protected]>

Generated via generate_topology.py from topology-v2-cip.yaml (750 nodes).
Preserves degree distribution (relay med=35), latency profile
(p95=305ms, max=575ms), BP/relay ratio (432/1068), and stake total.

Source (v2-cip):    750 nodes, 19314 links, latency med=30.1ms
Expanded (1500):   1500 nodes, 38511 links, latency med=25.4ms

Co-Authored-By: Claude Opus 4.6 (1M context) <[email protected]>

generate_topology.py resamples an existing topology to a target node
count, preserving degree distribution, latency profile, stake
distribution, and BP/relay ratio. summarize_topology.py prints
statistics for one or more topology files.

Co-Authored-By: Claude Opus 4.6 (1M context) <[email protected]>

When set, writes per-run jsonl event streams to the given directory.
Filename includes throughput, mode, engine, seed, and label.

Co-Authored-By: Claude Opus 4.6 (1M context) <[email protected]>

Eliminates non-deterministic iteration order in NodeLeiosState,
LedgerState, and LinearLeiosNode.txs. All key types already implement
Ord. At typical map sizes (5-50 entries for leios state, 100s-1000s
for txs) BTreeMap has negligible CPU overhead and slightly lower
memory usage than HashMap.

The praos state (NodePraosState) was already using BTreeMap; this
brings the leios state into line. Remaining HashSet usages are pure
membership tests (contains/insert) that do not affect determinism.

Co-Authored-By: Claude Opus 4.6 (1M context) <[email protected]>

This makes is less surprising that a nix develop or direnv works
differently from within analysis/deltaq/linear-leios

This makes is less surprising that a nix develop or direnv works
differently from within analysis/deltaq/linear-leios

Update logbook in response to 2026 April 9 Consensu Office Hours

Co-authored-by: Sebastian Nagel <[email protected]>

Point ouroboros-consensus to dnadales/cumulative-tx-size (adds
shelleyCumulativeTxBytes to ShelleyLedgerState) and cardano-node-leios
to dnadales/cumulative-tx-bytes-metric (exposes it as a Prometheus
gauge via LedgerMetrics).

Adds a Grafana timeseries panel that plots txkB/s using:
  rate(cardano_node_metrics_cumulativeTxBytes_int[30s]) / 1000

Includes a 200 kB/s threshold line (the demo target from #845).

The experiment config's vote-generation-probability: 600 was being
ignored because the simulation uses persistent + non-persistent
probabilities directly (defaulting to 400 + 100 = 500). Override both
in the wfa-ls mode to get the intended 600 total with 80:20 split,
giving a 75% quorum at the existing threshold of 450.

Co-Authored-By: Claude Opus 4.6 (1M context) <[email protected]>

Co-Authored-By: Claude Opus 4.6 (1M context) <[email protected]>

Read VmRSS from /proc/self/status and log it alongside estimated totals
so we can directly compare instrumented vs actual memory usage.

Simplify praos.blocks stats back to basic entry count and tx_refs — the
detailed unique/endorse breakdown showed praos.blocks is not a
significant memory consumer.

Co-Authored-By: Claude Opus 4.6 (1M context) <[email protected]>