What does Najia and Qimen Combinatorics conclude, in numbers, about “A Budget of Conventions and a Pre-Registered Matching Test”?

Answer: Chapter 8 gives a budget of conventions (two engines with different choices disagree on 0.4800 of double-hours in Shanghai) and a pre-registered matching test (447 participants). Marked boxes separate evidence, 16 runnable Python programs, classical sources and hypotheses.

Scope of the numbers: Marked boxes separate evidence, 16 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. printed values that match the answer: 0.4800

   calendar: split-supplement vs intercalation          0.3067
   tomb rule: common vs yang-dies                       0.1944
   hour from the clock vs true solar time, Shanghai     0.0690
   hour from the clock vs true solar time, Kuala Lumpur 0.6100
   Shanghai    : engines differing in all three choices show
                 a different chart or verdict on 0.4800 of hours
   Kuala Lumpur: engines differing in all three choices show
                 a different chart or verdict on 0.7822 of hours
Reading: before any question of meaning, two honest engines
that make different but defensible choices disagree on about
half of all hours in Shanghai and on most hours in Kuala Lumpur.
Show the full program
# Chapter 8. A convention budget for two Qimen engines.
# Each line is a choice two programs can make differently, with the share
# of bureau-hours it affects, as computed earlier in this book (p06 and
# p11) or in Volume 66 (true solar time, Shanghai and Kuala Lumpur). If
# the choices were independent, the share of hours on which two engines
# that differ in all of them show the same chart is the product of the
# shares unaffected.
BUDGET = (
    ("calendar: split-supplement vs intercalation", 0.3067),   # p06
    ("tomb rule: common vs yang-dies", 0.1944),                 # p11
    ("hour from the clock vs true solar time, Shanghai", 0.069),
    ("hour from the clock vs true solar time, Kuala Lumpur", 0.610),
)

def same_share(shares):
    out = 1.0
    for s in shares:
        out *= 1 - s
    return out

if __name__ == "__main__":
    for name, s in BUDGET:
        print("   {:52s} {:.4f}".format(name, s))
    for city, solar in (("Shanghai", BUDGET[2][1]),
                        ("Kuala Lumpur", BUDGET[3][1])):
        same = same_share((BUDGET[0][1], BUDGET[1][1], solar))
        print("   {:12s}: engines differing in all three choices show"
              .format(city))
        print("                 a different chart or verdict on {:.4f}"
              " of hours".format(1 - same))
    print("\nReading: before any question of meaning, two honest engines")
    print("that make different but defensible choices disagree on about")
    print("half of all hours in Shanghai and on most hours in Kuala Lumpur.")

Single source and citation

Fan, Y. (2026). Najia Hexagram Encoding and Qimen Dunjia Combinatorial Engines (Version 1.0.0), Chapter 8: A Budget of Conventions and a Pre-Registered Matching Test. 5D Library. https://doi.org/10.5281/zenodo.24090182

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

BibTeX
@book{fan2026067,
  author    = {Fan, Yafu},
  title     = {Najia Hexagram Encoding and Qimen Dunjia Combinatorial Engines},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  doi       = {10.5281/zenodo.24090182},
  url       = {https://doi.org/10.5281/zenodo.24090182}
}

Other chapter answers in this book