What does Multi-Model Voting with Correlated Errors conclude, in numbers, about “Condorcet's Binomial Majority: Why Independent Votes Grow More Accurate”?
Answer: The five columns of panel A correspond to single-vote accuracies of 0.45, 0.55, 0.60, 0.70 and 0.80. Take the column for 0.70. One vote gives 0.7000, three give 0.7840, five give 0.8369, fifteen give 0.9500 and fifty-one give 0.9986. With enough voters, the majority almost never errs. That is the bright side of Condorcet's theorem: independent judgements that are only modestly better than a coin toss can be pooled into something close to certainty.
Scope of the numbers: Its parameters are illustrative; all calculations are generated by its programs; it is general business analysis, not business advice. Marked boxes separate published evidence, runnable Python calculations (19 programs), classical sources and the author's hypotheses.
Data table
The numbers below are printed verbatim by the chapter's Python program and can be reproduced by running it. standard-library Python onlyprinted values that match the answer: 0.45, 0.55, 0.60, 0.70, 0.7000, 0.7840
| A. majority accuracy, n independent voters (exact) | |
| n p | 0.45 p=0.55 p=0.60 p=0.70 p=0.80 |
| 1 | 0.4500 0.5500 0.6000 0.7000 0.8000 |
| 3 | 0.4253 0.5747 0.6480 0.7840 0.8960 |
| 5 | 0.4069 0.5931 0.6826 0.8369 0.9421 |
| 9 | 0.3786 0.6214 0.7334 0.9012 0.9804 |
| 15 | 0.3465 0.6535 0.7869 0.9500 0.9958 |
| 25 | 0.3063 0.6937 0.8462 0.9825 0.9996 |
| 51 | 0.2359 0.7641 0.9265 0.9986 1.0000 |
| 101 | 0.1562 0.8438 0.9791 1.0000 1.0000 |
| B. gain from two more voters at p | 0.70 |
| 1 | 3: +0.0840 |
| 3 | 5: +0.0529 |
| 5 | 7: +0.0370 |
| 9 | 11: +0.0206 |
| 15 | 17: +0.0097 |
| C. even juries: n | 2k with a coin for ties equals n = 2k - 1 |
| n | 4: 0.784000 n = 3: 0.784000 |
| n | 10: 0.901191 n = 9: 0.901191 |
Key formula
Show the full program
# Chapter 1. p11: exact majority accuracy of n independent voters.
# Model: Condorcet's binomial case. Each of n voters (n odd) is right
# with the same probability p, independently of the others, on a yes/no
# question; the majority is right when more than n/2 are right.
# Exact rational arithmetic with fractions.Fraction; p values are
# illustrative accuracies of a single model, not measurements.
from fractions import Fraction
import functools
import math
import operator
def majority(n, p):
# P(more than n/2 of n independent voters are right), exact
q = 1 - p
terms = [math.comb(n, k) * p ** k * q ** (n - k)
for k in range(n // 2 + 1, n + 1)]
return functools.reduce(operator.add, terms, Fraction(0))
if __name__ == "__main__":
ps = [Fraction(45, 100), Fraction(55, 100), Fraction(6, 10),
Fraction(7, 10), Fraction(8, 10)]
print("A. majority accuracy, n independent voters (exact)")
print(" n p=0.45 p=0.55 p=0.60 p=0.70 p=0.80")
for n in (1, 3, 5, 9, 15, 25, 51, 101):
row = " ".join("{:.4f}".format(float(majority(n, p)))
for p in ps)
print(" {:>3} {}".format(n, row))
print("B. gain from two more voters at p = 0.70")
p = Fraction(7, 10)
for n in (1, 3, 5, 9, 15):
g = majority(n + 2, p) - majority(n, p)
print(" {:>2} -> {:>2}: +{:.4f}".format(n, n + 2, float(g)))
print("C. even juries: n = 2k with a coin for ties equals n = 2k - 1")
for k in (2, 5):
n = 2 * k
tie = math.comb(n, k) * p ** k * (1 - p) ** k
even = majority(n, p) + tie / 2
print(" n = {:>2}: {:.6f} n = {:>2}: {:.6f}".format(
n, float(even), n - 1, float(majority(n - 1, p))))Single source and citation
Fan, Y. (2026). Condorcet's Jury Theorem with Correlated Errors: When Multi-Model Voting Gets More Accurate and When Shared Origins Make Everyone Wrong Together (Version 1.0.0), Chapter 1: Condorcet's Binomial Majority: Why Independent Votes Grow More Accurate. 5D Library. DOI pending
DOI pending · monograph page goes live after publication · 5DL-B-309 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026309,
author = {Fan, Yafu},
title = {Condorcet's Jury Theorem with Correlated Errors: When Multi-Model Voting Gets More Accurate and When Shared Origins Make Everyone Wrong Together},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
note = {DOI pending}
}Other chapter answers in this book
- Chapter 2 · Correlated Errors and the Ceiling: the Beta-Binomial Model, Opinion Leaders and Shared Origins
- Chapter 3 · Measuring Correlation: Pairwise Correlation, the Q Statistic, Effective Votes and Colliding Wrong Answers
- Chapter 4 · Comparing Ways to Decorrelate: Resampling, Different Prompts, Different Models and Standard-Library Checks
- Chapter 5 · Weighted Majorities: Log-Odds Weights and the Double Counting of Correlated Clusters
- Chapter 6 · How Many Models and How Many Labelled Questions: the Vote Ledger and the Labelling Ledger below the Ceiling
- Chapter 7 · Classical Sources East and West: "When Three Read, Follow the Two" in the Great Plan and Condorcet's Essai of 1785
- Chapter 8 · Closing the Loop on Decorrelated Multi-Model Verdicts: a Procedure, the Correlated Voting Accuracy Calculator and a Pre-Registered Plan of Refutation