What does Joining Genealogies and the Perpetual Clan Estate conclude, in numbers, about “The Quarterly Merge Check-up: Procedure, Distilled Tool and Pre-registered Refutation”?

Answer: Chapter 8 gives a quarterly merge check-up, the distilled Island Genealogy Merge Matcher and a pre-registered plan of refutation needing 385 reviewed pairs and 435 blindly checked pairs per arm. Marked boxes separate published evidence, runnable Python calculations (20 programs), classical sources and the author's hypotheses.

Scope of the numbers: All data are synthetic or illustrative, all calculations come from its programs, and it is general analysis, not legal, financial or business advice; it compares no lineages or ethnic groups. Marked boxes separate published evidence, runnable Python calculations (20 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: 385, 435

H1 precision of the name key, reviewed same-name pairs
half-width 0.10: n97
half-width 0.05: n385
half-width 0.03: n1,068
H2 false merges among auto-links, per arm
0.20 vs 0.05: n76
0.10 vs 0.05: n435
0.20 vs 0.10: n199
H3 founding lines extinct within ten generations
at 0.8031, half-width 0.05: n243
at 0.5, half-width 0.05 (worst case): n385
Show the full program
# Chapter 8. p82: sample sizes for the pre-registered tests.
# H1 (Chapters 1 and 2): among pairs that share surname, generation
# character, given name and county, the share that are one person
# (precision of the name key) is at most 0.5. Estimated with a 95%
# interval of half-width E: n = z^2 p (1 - p) / E^2 at p = 0.5.
# H1 is refuted if the lower bound of that interval exceeds 0.9.
# H2: false-merge rate among auto-links, name key versus the
# two-threshold rule, planned at 0.20 versus 0.05 (alpha 0.05 two-sided,
# power 0.8), normal approximation for two proportions.
# H3 (Chapter 6): share of founding lines extinct within ten generations
# in consenting, de-identified books, planned near the Lotka value
# 0.8031 from p61, half-width 0.05.
# Planning values are the book's illustrative figures.
import math
from statistics import NormalDist

Z = NormalDist()


def n_one(p, half, conf=0.95):
    z = Z.inv_cdf(0.5 + conf / 2.0)
    return math.ceil(z * z * p * (1.0 - p) / (half * half))


def n_two(p1, p2, alpha=0.05, power=0.8):
    za, zb = Z.inv_cdf(1.0 - alpha / 2.0), Z.inv_cdf(power)
    pbar = (p1 + p2) / 2.0
    top = (za * math.sqrt(2.0 * pbar * (1.0 - pbar)) +
           zb * math.sqrt(p1 * (1.0 - p1) + p2 * (1.0 - p2))) ** 2
    return math.ceil(top / (p1 - p2) ** 2)


if __name__ == "__main__":
    print("H1 precision of the name key, reviewed same-name pairs")
    for half in (0.10, 0.05, 0.03):
        print("   half-width {:.2f}: n = {:,}".format(
            half, n_one(0.5, half)))
    print("H2 false merges among auto-links, per arm")
    for p1, p2 in ((0.20, 0.05), (0.10, 0.05), (0.20, 0.10)):
        print("   {:.2f} vs {:.2f}: n = {}".format(p1, p2, n_two(p1, p2)))
    print("H3 founding lines extinct within ten generations")
    print("   at 0.8031, half-width 0.05: n = {}".format(
        n_one(0.8031, 0.05)))
    print("   at 0.5, half-width 0.05 (worst case): n = {}".format(
        n_one(0.5, 0.05)))

Single source and citation

Fan, Y. (2026). Genealogical DAG Merge Algorithms, Generation-Poem Congruence Coding and the Institutional Economics of the Fan Clan Charitable Estate (Version 1.0.0), Chapter 8: The Quarterly Merge Check-up: Procedure, Distilled Tool and Pre-registered Refutation. 5D Library. DOI pending

DOI pending · monograph page goes live after publication · 5DL-B-334 · v1.0.0 · CC-BY-NC-ND-4.0

BibTeX
@book{fan2026334,
  author    = {Fan, Yafu},
  title     = {Genealogical DAG Merge Algorithms, Generation-Poem Congruence Coding and the Institutional Economics of the Fan Clan Charitable Estate},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

Other chapter answers in this book