Author: Lucas Luhur Last updated: 2026-07-24

Summary

  1. Single-path mix model complete in both latency laws: uniform (mechanism) and geo (physical), end to end.
  2. Attribution: Fix $\sigma_d$, sweep $\sigma_Z$
  3. Stake inference: The $p_s$ cover sweep read against the maximum expected stake $E[M_N]$ swept over the Pareto shape $k$
  4. Next: the mix-net (Nym-like $W\times k$ grid). The layer and its geo route latencies

Parameters (current):

group parameter symbol value
consensus nodes $N$ 1000
active-slots coefficient $f$ $1/30$
Pareto shape (stake inequality) $k_{\text{stake}}$ $4/3$ ($G = 0.60$, Cardano-calibrated)
network / links connectivity (regular graph) $C$ 8
channel noise $\rho_{\text{net}}$ 0 (noise-free, $\lambda\to\infty$; $T_e = d$)
mean eccentricity ($C{=}8$, $N{=}1000$) $E[\text{ecc}]$ 5.0 hops
baseline link delay (flat) $d$ 0.3 s: the homogeneous link; for the uniform law only (geo replaces it with continent pings + $\delta_{proc}$)
mixing (AC path) mix hops (layers) $k$ 3
per-hop mix delay (mean) $1/\lambda_M$ swept axis (attribution) — $\text{Exp}(\lambda_M)$; operating point 1 s; $k$-hop total $\text{Gamma}(k,\lambda_M)$
sender hold (mean) $1/\lambda_S$ 0.25 s — $\text{Exp}(\lambda_S)$ (held)
delay ratio $\rho = \lambda_S/\lambda_M$ 4 at the operating point (PoPETs 2024/0136 target $\rho \ge 4$)
receiver delay — none ($\mathcal{R}$ does not delay $\Rightarrow$ $k$ stages)
cover / sender set attribution cover count 19 $\Rightarrow \lvert S\rvert = 20$ (fixed)
stake cover $p_s$ swept $\{0.02 \dots 0.9\}$
horizon epoch length $T$ 388,800 slots (attribution + stake full-epoch)

1. Single-path mix model complete (uniform + geo)

The model (recap): Every genuine proposal is routed down one shared path before the broadcast:

$$ \mathcal{S} \to M_1 \to \cdots \to M_k \to \mathcal{R} \longrightarrow \text{broadcast to } N \text{ nodes} $$

AC-path uniform geo
$\mathcal{S}\to M_1$ ($d_i^S$) $U(0,6.22)$, $\sigma_d \approx 1.75$ s continent ping, $\sigma_d \approx 0.028$ s
$M_1\to\cdots\to M_k$ ($D_M$) scalar $(k{-}1)d$ $\sum$ inter-mix continent pings
$M_k\to\mathcal{R}$ ($d_r^R$) $U(0,6.22)$ continent ping
$\mathcal{R}\to\text{all}$ ($D_{br}$) flat $d\cdot E[\text{ecc}] = 1.5$ s weighted Dijkstra $\approx 1.25$ s
random hold $Z$ $\text{Exp}(\lambda_S) + \text{Gamma}(k,\lambda_M)$ (geography-independent) (same)

Broadcasting

The one part that is not an AC-path link is the final block broadcast: once $R$ holds the block it gossips it to all $N$ consensus nodes, and $D_{br}$, the mean time to reach the farthest node, is the denominator of latency $\ell$.

  1. $E[\text{ecc}]$: the broadcast distance in hops**.** A source's eccentricity is the largest shortest-path distance from it to any other node, the hop count to the farthest node, i.e. how long the gossip takes to reach everyone; $E[\text{ecc}]$ averages it over sources.

    $\Pr(\text{ecc}>\ell) = 1 - \big(1 - \Pr(L>\ell)\big)^{N-1}, \qquad E[\text{ecc}] = \sum_{\ell\ge 0}\Pr(\text{ecc}>\ell)$

  2. $D_{br}$ : the broadcast latency. $D_{br}(s) = \max_{j\ne s}\text{dist}(s,j)$ is the source's weighted eccentricity, the same distance to the farthest node, but summing edge latencies instead of counting hops; $E[D_{br}]$ averages over broadcasters (‣).

  3. The full $E[D_{br}]$: