What does Retrodiction and Upsell Automata conclude, in numbers, about “What Pain-Point Agitation Buys and Costs, and Two Guardrails”?
Answer: Chapter 4 computes pain-point agitation: with refunds and churn counted the best intensity is still 0.63, and the share of buyers in acute distress rises with intensity from 0.100 to 0.206; a cooling-off period and a distress screen together bring it down to 0.056.
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.100, 0.206, 0.63
| a | buyers | first net | repeat net | total net | distressed share |
|---|---|---|---|---|---|
| 0.0 | 40.0 | 3732 | 5472 | 9204 | 0.100 |
| 0.1 | 49.6 | 4608 | 6422 | 11030 | 0.129 |
| 0.2 | 59.2 | 5429 | 7181 | 12610 | 0.149 |
| 0.3 | 68.8 | 6172 | 7735 | 13907 | 0.163 |
| 0.4 | 78.4 | 6814 | 8074 | 14889 | 0.173 |
| 0.5 | 88.0 | 7333 | 8197 | 15530 | 0.182 |
| 0.6 | 97.6 | 7704 | 8107 | 15811 | 0.189 |
| 0.7 | 107.2 | 7906 | 7811 | 15717 | 0.194 |
| 0.8 | 116.8 | 7915 | 7326 | 15241 | 0.199 |
| 0.9 | 126.4 | 7708 | 6672 | 14380 | 0.203 |
| 1.0 | 136.0 | 7262 | 5875 | 13138 | 0.206 |
| best a for first-purchase revenue only: 0.75 | |||||
| best a counting refunds and repeat business: 0.63 | |||||
| Reading: refunds and churn pull the optimum down, but not | |||||
| to zero: on its own the market still rewards fairly strong | |||||
| agitation, and the harder it is, the larger the share of | |||||
| buyers who are in acute distress. Limits have to be set. |
Show the full program
# Chapter 4. [p07] Pain-point agitation: what it buys and what it costs.
# Agitation intensity a in [0, 1] (how hard a sales page stirs up a
# fear or a pain). Per visitor: conversion c(a) = 0.04 + 0.08 a for
# ordinary visitors; 10% of visitors are in acute distress and convert
# at 0.04 + 0.24 a. First purchase 99; refund or chargeback share
# phi(a) = 0.05 + 0.35 a^2, each costing a 15 fee on top of the refund;
# buyers stay for repeat purchases worth 240 over a year with
# probability 0.6 - 0.3 a (regret drives churn). Reported per 1,000
# visitors: net revenue, and the share of buyers who were in distress.
def per_thousand(a):
c_ord = 0.04 + 0.08 * a
c_dis = 0.04 + 0.24 * a
buyers = 1000 * (0.9 * c_ord + 0.1 * c_dis)
phi = 0.05 + 0.35 * a * a
first = buyers * ((1 - phi) * 99 - phi * 15)
repeat = buyers * (1 - phi) * (0.6 - 0.3 * a) * 240
distress = 100 * c_dis / buyers
return first, repeat, first + repeat, buyers, distress
if __name__ == "__main__":
print(" a buyers first net repeat net total net"
" distressed share")
rows = []
for k in range(0, 11):
a = k / 10
f, r, t, b, d = per_thousand(a)
rows.append((t, a))
print(" {:3.1f} {:8.1f} {:10.0f} {:11.0f} {:10.0f} {:17.3f}".format(
a, b, f, r, t, d))
first_best = max(range(0, 101),
key=lambda k: per_thousand(k / 100)[0]) / 100
total_best = max(range(0, 101),
key=lambda k: per_thousand(k / 100)[2]) / 100
print(" best a for first-purchase revenue only: {:.2f}".format(
first_best))
print(" best a counting refunds and repeat business: {:.2f}".format(
total_best))
print("\nReading: refunds and churn pull the optimum down, but not")
print("to zero: on its own the market still rewards fairly strong")
print("agitation, and the harder it is, the larger the share of")
print("buyers who are in acute distress. Limits have to be set.")Single source and citation
Fan, Y. (2026). Retrodictive Belief Locking, Sequential Pain-Point Agitation and Markovian Upsell Automata (Version 1.0.0), Chapter 4: What Pain-Point Agitation Buys and Costs, and Two Guardrails. 5D Library. https://doi.org/10.5281/zenodo.24090186
DOI: 10.5281/zenodo.24090186 · Read the monograph · 5DL-B-069 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026069,
author = {Fan, Yafu},
title = {Retrodictive Belief Locking, Sequential Pain-Point Agitation and Markovian Upsell Automata},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
doi = {10.5281/zenodo.24090186},
url = {https://doi.org/10.5281/zenodo.24090186}
}Other chapter answers in this book
- Chapter 1 · Retrodictive Statements and the "Trust Avalanche"
- Chapter 2 · Testing Retrodiction Fairly: Sequential Tests and Selective Recall
- Chapter 3 · The Commitment Ratchet: Price Ratios and Upsell Timing
- Chapter 5 · The Three-Stage Rocket: an Absorbing Markov Chain of Reading, Academy and Licence
- Chapter 6 · Cross-Module Transition Matrices: Estimation, Cannibalization and Heterogeneity
- Chapter 7 · "Probing" and "Flying and Clamping" in the *Guiguzi*, "The Difficulties of Persuasion" in the *Han Feizi*
- Chapter 8 · A Calculator for the User and a Pre-Registered Blinded Test