What does First-Move Probes and Hidden Market Truth conclude, in numbers, about “Field Tools and Checker Specifications: The First-Move Probe Ledger, Pre-Registered Tests and the Plan for Refutation”?
Answer: Chapter 8 gives the first-move probe ledger, the distilled Intentional Perturbation Probe Designer and Information-Gain Calculator, checker specifications grouped by the four kits and a pre-registered refutation plan. Every probe is purchasable and honestly delivered, with no invented scarcity, no resetting countdown, no posing as a client and no pricing by protected characteristics. Marked boxes separate published evidence, runnable Python calculations (21 programs), classical sources and the author's hypotheses.
Scope of the numbers: Parameters are illustrative, calculations come from the book's programs, and all data are synthetic. This is general business analysis, not personalised legal, tax or investment advice; it promises no income.
Data table
The numbers below are printed verbatim by the chapter's Python program and can be reproduced by running it. standard-library Python only
| id | type | post | EIG | real | net | verdict |
|---|---|---|---|---|---|---|
| T1 | limited tier 0.069 | 0.95 | 0.84 | 8.9 | GREEN | |
| T2 | waitlist | 0.127 | 0.91 | 0.71 | 17.8 | GREEN |
| T3 | preorder | 0.080 | 0.63 | 0.24 | -4.2 | RED:M |
| T4 | open call | 0.600 | 1.16 | 1.80 | 18.9 | GREEN |
| T5 | rate card | 0.409 | 0.57 | 0.19 | 14.1 | GREEN |
| T6 | limited tier 0.043 | 0.38 | 0.10 | -30.5 | RED:H | |
| T7 | limited tier 0.050 | 0.27 | 0.06 | -33.1 | YELLOW | |
| T8 | quote ask | 0.375 | 0.34 | 0.09 | 8.4 | RED:P |
Show the full program
# Chapter 8. p81: scoring a week of the first-move probe ledger.
# Eight synthetic ledger rows (no real customer, order or counterpart).
# Each row: id, site, probe type, prior Beta(a, b) on the response rate,
# visitors or invitees n, responses k, set-up cost, value of a bit, and
# compliance flags: H = hypothesis registered before launch, R = price
# really payable and delivered, S = no invented stock or deadline,
# P = public channel only (no posing as a client), M = sample at least
# the registered minimum before any price change.
# Computed: posterior mean, expected information gain before launch
# (Lindley, bits), realised gain (KL posterior || prior, bits), net
# value, and a red / yellow / green verdict.
import math
ROWS = [
("T1", "academy", "limited tier", 2, 38, 120, 9, 15, "HRSPM"),
("T2", "academy", "waitlist", 3, 27, 80, 11, 5, "HRSPM"),
("T3", "homie-x", "preorder", 2, 18, 30, 2, 20, "HRSP"),
("T4", "aix", "open call", 4, 6, 40, 26, 10, "HRSPM"),
("T5", "aix", "rate card", 4, 6, 12, 5, 0, "HRSPM"),
("T6", "homie-x", "limited tier", 2, 38, 30, 1, 40, "RSPM"),
("T7", "academy", "limited tier", 2, 38, 20, 1, 40, "HRSPM"),
("T8", "aix", "quote ask", 4, 6, 6, 2, 0, "HRSM"),
]
BIT, MIN_N = 25.0, 50
def digamma(x):
acc = []
while x < 6.0:
acc.append(-1.0 / x)
x += 1.0
f = 1.0 / (x * x)
acc.append(math.log(x) - 0.5 / x - f * (1.0 / 12 - f * (
1.0 / 120 - f * (1.0 / 252 - f / 240))))
return math.fsum(acc)
def lbeta(a, b):
return math.lgamma(a) + math.lgamma(b) - math.lgamma(a + b)
def h_beta(a, b):
return (lbeta(a, b) - (a - 1) * digamma(a) - (b - 1) * digamma(b)
+ (a + b - 2) * digamma(a + b))
def eig(a, b, n):
terms = []
for k in range(n + 1):
lp = (math.lgamma(n + 1) - math.lgamma(k + 1)
- math.lgamma(n - k + 1) + lbeta(a + k, b + n - k)
- lbeta(a, b))
terms.append(math.exp(lp) * h_beta(a + k, b + n - k))
return (h_beta(a, b) - math.fsum(terms)) / math.log(2)
def kl_bits(a1, b1, a0, b0):
nats = (lbeta(a0, b0) - lbeta(a1, b1) + (a1 - a0) * digamma(a1)
+ (b1 - b0) * digamma(b1)
+ (a0 - a1 + b0 - b1) * digamma(a1 + b1))
return nats / math.log(2)
def verdict(flags, n, net):
missing = [f for f in "HRSP" if f not in flags]
if missing:
return "RED:" + "".join(missing)
if "M" not in flags and n < MIN_N:
return "RED:M"
return "YELLOW" if net < 0 else "GREEN"
if __name__ == "__main__":
print("id type post EIG real net verdict")
for rid, site, kind, a, b, n, k, cost, flags in ROWS:
post = (a + k) / (a + b + n)
g = eig(a, b, n)
real = kl_bits(a + k, b + n - k, a, b)
net = BIT * g - cost
print("{:<3} {:<12} {:>5.3f} {:>5.2f} {:>5.2f} {:>6.1f} {}".format(
rid, kind, post, g, real, net, verdict(flags, n, net)))Single source and citation
Fan, Y. (2026). High-Agency Active Inference, Intentional Perturbation Probes and Hidden Market-Truth Exploration (Version 1.0.0), Chapter 8: Field Tools and Checker Specifications: The First-Move Probe Ledger, Pre-Registered Tests and the Plan for Refutation. 5D Library. DOI pending
DOI pending · monograph page goes live after publication · 5DL-B-395 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026395,
author = {Fan, Yafu},
title = {High-Agency Active Inference, Intentional Perturbation Probes and Hidden Market-Truth Exploration},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
note = {DOI pending}
}Other chapter answers in this book
- Chapter 1 · The Bias Floor of Confounding: Why a Longer Passive Log Is Wrong with More Confidence
- Chapter 2 · Identifiability: What the Back Door, the Instrument and the Published Threshold Each Require
- Chapter 3 · Expected Information Gain: Put the Probe Where It Teaches the Most
- Chapter 4 · Exploration and Exploitation: The Regret Ledger of Thompson Sampling and Fixed Habits
- Chapter 5 · Commitment Strength Made Operational: Probes per Week, Delay to the First Probe and the Stopping Rule
- Chapter 6 · Bringing Willingness to Pay into View, and a Counterpart's Floor: BDM, Hypothetical Bias and Inference from Public Information
- Chapter 7 · The Classics Examined: Lu You, Wang Yangming, Bacon and Bernard on Doing and on Provoked Observation