Cardano Updates

Aggregate all nodes' chain trees into a merged view showing fork
structure across the cluster. Each tip displays a badge with the
number of nodes currently on that fork. Shown as a blurred overlay
in the lower-right of the topology graph.

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

Three fixes for chainsync pipeline stalls found during deep concurrency audit:

1. Iterator rollback signal missed on new iterators (chain/chain.go):
   rollbackLocked() checked iter.lastPoint.Slot > point.Slot, but new
   iterators have zero-value lastPoint. Use startPoint as fallback
   reference so newly created iterators receive rollback signals.

2. Pipeline reader reads currentTip without lock (ledger/state.go):
   ledgerReadChain() read ls.currentTip.Point without RLock, racing with
   concurrent rollbacks. Snapshot under lock and handle FromPoint failure
   gracefully — the outer loop retries after rollback updates the tip.

3. Rollback doesn't wake blocked iterators (chain/chain.go):
   rollbackLocked() set needsRollback but never called
   notifyWaitingIterators(). Blocked iterators would sleep until new
   blocks arrived, stalling indefinitely if connections died after
   rollback.

Also includes defer close(resultCh) and cached batch done-channel fix
from the pipeline deadlock PR.

Signed-off-by: wcatz <[email protected]>

Signed-off-by: Eric Torreborre <[email protected]>

and extract missing data checks into a function analogous to
`missingRequiredDatums` check from Alonzo UTXOW

Signed-off-by: Eric Torreborre <[email protected]>

Three fixes for chainsync pipeline stalls found during deep concurrency audit:

1. Iterator rollback signal missed on new iterators (chain/chain.go):
   rollbackLocked() checked iter.lastPoint.Slot > point.Slot, but new
   iterators have zero-value lastPoint. Use startPoint as fallback
   reference so newly created iterators receive rollback signals.

2. Pipeline reader reads currentTip without lock (ledger/state.go):
   ledgerReadChain() read ls.currentTip.Point without RLock, racing with
   concurrent rollbacks. Snapshot under lock and handle FromPoint failure
   gracefully — the outer loop retries after rollback updates the tip.

3. Rollback doesn't wake blocked iterators (chain/chain.go):
   rollbackLocked() set needsRollback but never called
   notifyWaitingIterators(). Blocked iterators would sleep until new
   blocks arrived, stalling indefinitely if connections died after
   rollback.

Also includes defer close(resultCh) and cached batch done-channel fix
from the pipeline deadlock PR.

Signed-off-by: wcatz <[email protected]>

* Make sure sequencer starts without catchup

* Fix compilation

* Fix test

Signed-off-by: Eric Torreborre <[email protected]>

Display the node's consensus chain tree in the inspector panel as an
SVG diagram of linked blocks. The main chain is shown in blue with the
tip in green; fork blocks appear in orange. Fork blocks share the main
lane when their column is free, and only get their own lane when there
is a collision — descendants inherit their parent's lane.

Backend: add ChainTreeEntry type and ChainTree::snapshot() which walks
backward from the adopted tip for up to 10 blocks, collecting fork
blocks within the window and extending to include fork points. The
snapshot is included in the stats POST to the cluster server and
forwarded to the UI via the stats API.

Cluster: mirror ChainTreeEntry in net-cluster types with serde(default)
for backward compatibility with older net-node binaries.

UI: new ChainTreeView SVG component with auto-scroll to latest blocks.
Integrated into InspectorPanel below the tip display. Dark-themed
scrollbars across all components via MUI CssBaseline overrides.

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

Previously, when a peer announced a longer competing chain, consensus
only fetched the tip block. Intermediate blocks between the common
ancestor and the new tip were never fetched, leaving the ChainStore
incomplete and causing the chain tree display to show a truncated chain
after fork switches.

Changes:

Coordinator: forward all ChainSync headers to the application (not just
tips ahead of best), so consensus can build a complete chain tree with
intermediate block headers from competing forks.

Consensus (on_tip_advanced): use the header's own point (not the tip
point) when inserting intermediate headers during catch-up, since the
header and tip differ when a peer is ahead by multiple blocks. Issue
FetchBlockRange instead of FetchBlock, walking the chain tree backward
to find the earliest unvalidated ancestor and fetching the full range
in one request.

Consensus (on_validation_complete): handle out-of-order block arrival
from range fetches. When a validated block is an ancestor of the adopted
tip (not a fork), inject it without triggering a spurious fork switch.
After injection, check for remaining unvalidated ancestors and fetch any
gaps. Track validated blocks in a HashSet for efficient lookup.

Protocol: add FetchBlockRange { from, to } to NetworkCommand, routed by
the coordinator to the best peer via the existing BlockFetch range
protocol (PeerCommand::FetchBlocks).

Telemetry: derive tip_block_no and tip_hash from the adopted tip (same
source as chain_tree snapshot) rather than from speculative TipAdvanced
events, ensuring consistency between the stats fields and chain tree.

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

`mithril-client` now activate `reqwest/system-proxy` which add
additional system dependencies on windows.

Signed-off-by: Allain Magyar <[email protected]>