What does Multi-Model Voting with Correlated Errors conclude, in numbers, about “Comparing Ways to Decorrelate: Resampling, Different Prompts, Different Models and Standard-Library Checks”?
Answer: Chapter 4 compares decorrelation strategies: resampling one model has a ceiling of only 0.7366, five different models a ceiling of 0.8257, and four models plus a standard-library check that decides wherever it applies reach 0.8887.
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.7366, 0.8257, 0.8887
| A. majority accuracy by pool and number of votes | |
| pool p rho n | 1 n=3 n=5 n=9 ceiling |
| resample | 0.72 0.60 0.7200 0.7289 0.7316 0.7337 0.7366 |
| prompts | 0.70 0.35 0.7000 0.7263 0.7362 0.7446 0.7578 |
| models | 0.68 0.15 0.6800 0.7292 0.7533 0.7773 0.8257 |
| B. four different models plus a standard-library check | |
| four models alone, coin on 2-2 | 0.7292 |
| check as one ordinary fifth vote | 0.7969 |
| check decides where it applies | 0.8887 |
| C. decider design by check coverage | |
| coverage 0.2 | 0.7824 |
| coverage 0.4 | 0.8355 |
| coverage 0.6 | 0.8887 |
| coverage 0.8 | 0.9418 |
Show the full program
# Chapter 4. p42: comparing ways to decorrelate a multi-model verdict.
# Model: each pool is exchangeable Beta-binomial (p21) with its own
# mean accuracy p and correlation rho. Illustrative pools:
# resample one model, one prompt, sampled again p 0.72 rho 0.60
# prompts one model, different prompts p 0.70 rho 0.35
# models different models from other makers p 0.68 rho 0.15
# A standard-library check (a deterministic recomputation) applies to
# a share cov = 0.60 of questions, is right with prob 0.995 there and
# is independent of the models. Used as one ordinary vote it joins
# four models; used as a decider it settles the questions it covers.
# Even splits are broken by a coin. Exact sums with math.fsum.
import math
def lbeta(a, b):
return math.lgamma(a) + math.lgamma(b) - math.lgamma(a + b)
def ab(p, rho):
s = 1 / rho - 1
return p * s, (1 - p) * s
def bb_major(n, p, rho):
if rho == 0:
lp, lq = math.log(p), math.log(1 - p)
terms = [math.exp(math.lgamma(n + 1) - math.lgamma(k + 1)
- math.lgamma(n - k + 1) + k * lp
+ (n - k) * lq)
for k in range(n // 2 + 1, n + 1)]
return math.fsum(terms)
a, b = ab(p, rho)
terms = [math.exp(math.lgamma(n + 1) - math.lgamma(k + 1)
- math.lgamma(n - k + 1) + lbeta(k + a, n - k + b)
- lbeta(a, b))
for k in range(n // 2 + 1, n + 1)]
return math.fsum(terms)
def betacf(a, b, x):
tiny = 1e-300
c, d = 1.0, 1.0 - (a + b) * x / (a + 1)
d = 1.0 / (d if abs(d) > tiny else tiny)
h = d
for m in range(1, 400):
m2 = 2 * m
for num in (m * (b - m) * x / ((a + m2 - 1) * (a + m2)),
-(a + m) * (a + b + m) * x / ((a + m2) * (a + m2 + 1))):
d = 1.0 + num * d
d = 1.0 / (d if abs(d) > tiny else tiny)
c = 1.0 + num / c
c = c if abs(c) > tiny else tiny
h *= d * c
if abs(d * c - 1.0) < 1e-15:
break
return h
def betai(a, b, x):
if x <= 0:
return 0.0
if x >= 1:
return 1.0
lead = math.exp(a * math.log(x) + b * math.log(1 - x) - lbeta(a, b))
if x < (a + 1) / (a + b + 2):
return lead * betacf(a, b, x) / a
return 1.0 - lead * betacf(b, a, 1 - x) / b
def limit(p, rho):
if rho == 0:
return 1.0 if p > 0.5 else 0.0
a, b = ab(p, rho)
return 1.0 - betai(a, b, 0.5)
def pmf(n, p, rho):
if rho == 0:
return [math.comb(n, k) * p ** k * (1 - p) ** (n - k)
for k in range(n + 1)]
a, b = ab(p, rho)
return [math.exp(math.lgamma(n + 1) - math.lgamma(k + 1)
- math.lgamma(n - k + 1) + lbeta(k + a, n - k + b)
- lbeta(a, b)) for k in range(n + 1)]
def maj(dist, extra=None):
# extra: None = no extra voter; 1 / 0 = one more voter, right / wrong
n = len(dist) - 1
tot = n if extra is None else n + 1
terms = []
for k, w in enumerate(dist):
right = k if extra is None else k + extra
if 2 * right > tot:
terms.append(w)
elif 2 * right == tot:
terms.append(w / 2)
return math.fsum(terms)
def plain(n, p, rho):
return maj(pmf(n, p, rho), None)
def with_check(p, rho, cov, pc, decider):
d4 = pmf(4, p, rho)
alone = maj(d4, None)
if decider:
return cov * pc + (1 - cov) * alone
joined = pc * maj(d4, 1) + (1 - pc) * maj(d4, 0)
return cov * joined + (1 - cov) * alone
if __name__ == "__main__":
pools = (("resample", 0.72, 0.6), ("prompts", 0.70, 0.35),
("models", 0.68, 0.15))
print("A. majority accuracy by pool and number of votes")
print(" pool p rho n=1 n=3 n=5 n=9 ceiling")
for name, p, rho in pools:
cells = " ".join("{:.4f}".format(plain(n, p, rho))
for n in (1, 3, 5, 9))
print(" {:<9} {:.2f} {:.2f} {} {:.4f}".format(
name, p, rho, cells, limit(p, rho)))
print("B. four different models plus a standard-library check")
p, rho = 0.68, 0.15
print(" four models alone, coin on 2-2 {:.4f}".format(
plain(4, p, rho)))
print(" check as one ordinary fifth vote {:.4f}".format(
with_check(p, rho, 0.6, 0.995, False)))
print(" check decides where it applies {:.4f}".format(
with_check(p, rho, 0.6, 0.995, True)))
print("C. decider design by check coverage")
for cov in (0.2, 0.4, 0.6, 0.8):
print(" coverage {:.1f}: {:.4f}".format(
cov, with_check(p, rho, cov, 0.995, True)))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 4: Comparing Ways to Decorrelate: Resampling, Different Prompts, Different Models and Standard-Library Checks. 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 1 · Condorcet's Binomial Majority: Why Independent Votes Grow More Accurate
- 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 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