# Messaging-redundancy study: R independent blend cascades per emission (R in 1..4).
# Measures delivery_R (reliability) and deanon_R / full_deanon_R (anonymity cost), and feeds the
# time-to-link / stake-inference figures.
#
# Statistics: 1200 rounds x 8 topology seeds = 9600 rounds per cell -> binomial SEM <= 0.005 on
# every delivery rate, enough to resolve the 1-(1-p)^R law (a coarser grid was non-monotonic in R).
# degree 3 is included because it is the one setting where the responsive sub-graph fragments, so
# it tests whether redundancy can buy back coverage (it cannot -- see the report).
# max_blend_delay=0 keeps it affordable: redundancy multiplies propagation cost by R, and mixing
# delays are not the subject here (the headline delay study is configs/default.yaml).
n_nodes: [20000]
degree: [3, 8]
blend_hops: [1, 3]
max_blend_delay: [0]
unresponsive_frac: [0.0, 0.1, 0.2, 0.3, 0.5]
redundancy: [1, 2, 3, 4]
f_adv: [0.1, 0.2, 0.33]
adversary_mode: [random, worstcase_coverage]
seeds: 8
base:
  n_rounds: 1200
  n_placements: 4
  worstcase_max_n: 100000