What does Private-Message Patience, Handoff and Complaint Blocking conclude, in numbers, about “Practice and Falsification: a Closing-Skills Kit for Private-Message Service, Pre-Registered Tests and Refutation Conditions”?
Answer: Chapter 8 gives an owner's checklist, six red lines for scripts and a pre-registered testing plan whose largest test needs 3470 conversations per arm. Marked boxes separate published evidence, runnable Python calculations (18 programs), classical sources and the author's hypotheses.
Scope of the numbers: Its parameters are illustrative; all calculations are generated by its programs; it is not personalised legal, financial or business advice. Marked boxes separate published evidence, runnable Python calculations (18 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: 18, 3470
| alpha 0.05, power 0.8, 400 eligible chats a day | |||
| test p1 p2 n/arm days | |||
| H1 cutoff 45 s vs 120 s: abandonment | 0.180 0.140 | 1318 | 7 |
| H2 block at D: platform complaints | 0.060 0.045 | 3470 | 18 |
| H3 closing slices: good rating | 0.700 0.750 | 1251 | 7 |
| H4 amber zone: fumbled chats | 0.080 0.060 | 2554 | 13 |
Show the full program
# Chapter 8. p81: sample sizes for the pre-registered shop tests.
# Model: two-sided two-proportion z-test, alpha 0.05, power 0.80,
# n per arm = (z_a sqrt(2 pbar qbar) + z_b sqrt(p1 q1 + p2 q2))^2
# / (p1 - p2)^2,
# rounded up. The effect sizes are the smallest effects worth acting
# on (illustrative, set before data are seen). Days assume DAILY
# eligible chats split evenly between the two arms.
import math
from statistics import NormalDist
ND = NormalDist()
ALPHA, POWER, DAILY = 0.05, 0.80, 400
TESTS = (("H1 cutoff 45 s vs 120 s: abandonment", 0.18, 0.14),
("H2 block at D: platform complaints", 0.060, 0.045),
("H3 closing slices: good rating", 0.70, 0.75),
("H4 amber zone: fumbled chats", 0.080, 0.060))
def n_per_arm(p1, p2):
za, zb = ND.inv_cdf(1.0 - ALPHA / 2.0), ND.inv_cdf(POWER)
pbar = (p1 + p2) / 2.0
root = za * math.sqrt(2.0 * pbar * (1.0 - pbar)) + \
zb * math.sqrt(p1 * (1.0 - p1) + p2 * (1.0 - p2))
return math.ceil(root ** 2 / (p1 - p2) ** 2)
print("alpha {}, power {}, {} eligible chats a day".format(
ALPHA, POWER, DAILY))
print("{:38} {:>5} {:>5} {:>7} {:>5}".format(
"test", "p1", "p2", "n/arm", "days"))
for name, p1, p2 in TESTS:
n = n_per_arm(p1, p2)
print("{:38} {:5.3f} {:5.3f} {:7d} {:5d}".format(
name, p1, p2, n, math.ceil(2 * n / DAILY)))Single source and citation
Fan, Y. (2026). Patience-Decay Distributions in Private-Message Queues, Red-Amber-Green Human-AI Handoff Thresholds and Markov Blocking of Complaint Escalation (Version 1.0.0), Chapter 8: Practice and Falsification: a Closing-Skills Kit for Private-Message Service, Pre-Registered Tests and Refutation Conditions. 5D Library. DOI pending
DOI pending · monograph page goes live after publication · 5DL-B-175 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026175,
author = {Fan, Yafu},
title = {Patience-Decay Distributions in Private-Message Queues, Red-Amber-Green Human-AI Handoff Thresholds and Markov Blocking of Complaint Escalation},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
note = {DOI pending}
}Other chapter answers in this book
- Chapter 1 · The Shape of Patience: Exponential, Weibull and Lognormal Hazards, and Estimating Patience under Censoring
- Chapter 2 · Queues that Give Up: Erlang C, Erlang-A and Square-Root Staffing
- Chapter 3 · The Handoff Cutoff in Seconds: Expected Lost Value, Human Cost and Queue Feedback
- Chapter 4 · Red, Amber, Green: Cost-Sensitive Handoff Thresholds on the ROC Curve
- Chapter 5 · A Markov Chain of Complaint Escalation: Absorption Probabilities and the Cheapest Point of Blocking
- Chapter 6 · The Mental Accounting of Waiting: the Peak-End Rule, Eight Propositions on Waiting, and the Fairness Cost of Priority
- Chapter 7 · The Classics Examined: the Nine Postures of the Guiguzi's "Fu Yan" and Erlang's Telephone Exchange