{"id":"hexagon/2611.00292","pdf":"https://hexagonmath.org/pdf/2611.00292v1","url":"https://hexagonmath.org/abs/2611.00292v1","tags":["math.MP","cs.CC","msc:94A24","msc:68W15","msc:82C35","Byzantine agreement","Gaussian channels","consensus","energy complexity","entropy production"],"score":0,"title":"Energy complexity and dissipation of noisy consensus","domain":"math.IT","source":"hexagon","authors":["Zhenyu Sun"],"reviews":0,"subject":"math.IT","summary":"We characterize the signal-energy complexity of distributed agreement over independent Gaussian point-to-point channels. For $n$ processes deciding $L$ binary coordinates under coordinatewise unanimity validity and a joint failure probability of at most $\\varepsilon$, every finite causal protocol requires a worst-input expected signal energy of $\\Omega(N_0n[L+\\ln(n/\\varepsilon)])$. This lower bound combines two distinct mechanisms: an exact relative-entropy identity for locally interchanged reception histories yields the reliability term even in the presence of shared randomness and active…","category":"research","comments":0,"disputed":false,"division":"math","mentions":0,"discussed":0,"published":"2026-11-11","reactions":{},"withdrawn":false,"authorship":"human","formalized":false,"human_understanding":"all"}