What does Flying Stars, Compass and Facial Ratios conclude, in numbers, about “A Ten-Flag Audit and a Pre-Registered Blind Paired Test”?

Answer: Chapter 8 gives a ten-flag audit and a pre-registered blind paired test (204 pairs at a true hit rate of 0.60). Marked boxes separate evidence, runnable Python programs, classical sources and hypotheses.

Scope of the numbers: Compass errors, declinations, facial dimensions and landmark errors are illustrative parameters; chart rules follow conventions stated in the book. Marked boxes separate evidence, runnable Python programs, classical sources and 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.60, 204

pairs hits needed power at 0.550.60 0.65
5033 0.0765 0.2369 0.5060
10061 0.1343 0.4621 0.8276
200115 0.2617 0.7868 0.9884
400221 0.4806 0.9762 1.0000
800429 0.7932 0.9999 1.0000
true hit rate 0.6590 pairs for power 0.80
true hit rate 0.60204 pairs for power 0.80
true hit rate 0.55786 pairs for power 0.80
Reading: a practitioner who is right 65 times in 100 can
show it with under a hundred pairs; a modest edge of 0.55
needs several hundred. Either way the test is cheap compared
with a lifetime of untested readings.
Show the full program
# Chapter 8. p16: A pre-registered blind test of chart readings.
# Pairs of homes are matched on facing half, city and build period;
# within each pair, one household had the better pre-registered
# outcome over three years. A practitioner sees only the two floor
# plans, facings and build years, and picks the home predicted to do
# better. Under no skill the hit rate is 0.5. Exact binomial test,
# two-sided 0.05: the program finds the critical number of hits for n
# pairs and the exact power when the true hit rate is 0.55, 0.60 or
# 0.65, and the smallest n giving power 0.80 for each.
import math

def pmf(n, k, p):
    return math.comb(n, k) * p ** k * (1 - p) ** (n - k)

def critical(n):
    tail, k = 0.0, n
    while k >= 0:
        t = tail + pmf(n, k, 0.5)
        if 2 * t > 0.05:
            return k + 1
        tail, k = t, k - 1
    return 0

def power(n, p):
    c = critical(n)
    return sum(pmf(n, k, p) for k in range(c, n + 1))

if __name__ == "__main__":
    print("   pairs   hits needed   power at 0.55   0.60    0.65")
    for n in (50, 100, 200, 400, 800):
        print("   {:5d} {:13d} {:15.4f} {:7.4f} {:7.4f}".format(
            n, critical(n), power(n, 0.55), power(n, 0.60),
            power(n, 0.65)))
    print()
    for p in (0.65, 0.60, 0.55):
        n = 10
        while power(n, p) < 0.80:
            n += 2
        print("   true hit rate {:.2f}: {} pairs for power 0.80".format(p, n))
    print("\nReading: a practitioner who is right 65 times in 100 can")
    print("show it with under a hundred pairs; a modest edge of 0.55")
    print("needs several hundred. Either way the test is cheap compared")
    print("with a lifetime of untested readings.")

Single source and citation

Fan, Y. (2026). Xuankong Flying-Star Permutations, Twenty-Four-Mountain Compass Discretization and Craniofacial Ratio Metrology (Version 1.0.0), Chapter 8: A Ten-Flag Audit and a Pre-Registered Blind Paired Test. 5D Library. https://doi.org/10.5281/zenodo.24090215

DOI: 10.5281/zenodo.24090215 · Read the monograph · 5DL-B-082 · v1.0.0 · CC-BY-NC-ND-4.0

BibTeX
@book{fan2026082,
  author    = {Fan, Yafu},
  title     = {Xuankong Flying-Star Permutations, Twenty-Four-Mountain Compass Discretization and Craniofacial Ratio Metrology},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  doi       = {10.5281/zenodo.24090215},
  url       = {https://doi.org/10.5281/zenodo.24090215}
}

Other chapter answers in this book