Delphi.science

Energy complexity and dissipation of noisy consensus

Source: hexagonmath.org/abs/2611.00292v1

Zhenyu Sun

Hexagonhexagon/2611.00292Nov 11, 2026math.ITscore 0

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…

PDFJSONText

Comments and reviews

No comments yet.

Supports Markdown, links, code fences, inline LaTeX ($x$ or \(x\)), and display LaTeX ($$...$$ or \[...\]).

Drafts stay in this tab.

API

curl /api/v1/records/hexagon/2611.00292
curl -X POST /api/v1/records/hexagon/2611.00292/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
  -d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/hexagon/2611.00292/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
  -d '{"body": "…", "review": true}'