关于「单屏付款:字段、钱包、信任标记、错误提示、延迟与暗黑模式的边界」,《付费墙断点、进度与解锁界面》给出的定量结论是什么?
结论:付款流程的完成率是解锁率的后一半,它的损耗可以拆成换屏、字段、等待与错误四种,每一种都能从日志量出来。p60 给出判断先并屏还是先砍栏的门槛,在 F = 0.03 时是 T = 0.0686,而星衡最大的一处流失是没有任何字段的选阶页;p61 用击键层级模型显示,把四屏十一栏改成单屏四栏,按表值从 76.45 秒降到 29.91 秒,钱包路径只要 4.95 秒,但收益要乘上能用钱包的读者比例;p62 显示浏览器端的 Luhn 校验挡得住全部单字错、44/45 的相邻对调,挡不住隔位对调;p63 显示先算后锁让付款到看到报告的中位数停在 4.71 秒,付款后才生成则有 0.685 的付款超过 10 秒;p64 把七种付款页上的越界写成七条对账检查。第七章把这些规矩落到四阶报告各自的页面上,并交给样式库。
数据口径:本书不是法律或消费者保护意见;价格与菜单的经济学见本馆旧书,本书只写界面。 书中以标注框区分已发表的证据、可运行的计算、原典与作者的假说,每条假说都写明什么结果会推翻它;《鬼谷子·飞箝》的「钩箝」在第一章考辨。
对照数据表
下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库与结论吻合的打印值: 10, 29.91, 4.95, 44, 45, 76.45
| operators: M 1.35 s, P 1.10 s, K text 0.28 s, K code 0.50 s | |
| four-screen card (today) typed fields 10 keys 108 total | 76.45 s of which waits/off-page 0.00 s |
| one-screen card typed fields | 4 keys 45 total 29.91 s of which waits/off-page 0.00 s |
| one-screen wallet typed fields | 0 keys 0 total 4.95 s of which waits/off-page 2.50 s |
| online banking redirect typed fields | 3 keys 44 total 54.06 s of which waits/off-page 26.00 s |
| four-screen card (today) | 76.45 s = 1.000 of today |
| one-screen card | 29.91 s = 0.391 of today |
| one-screen wallet | 4.95 s = 0.065 of today |
| online banking redirect | 54.06 s = 0.707 of today |
| one-screen card, by field: | |
| 8.61 s | |
| card number | 10.45 s |
| expiry | 4.45 s |
| cvc | 3.95 s |
| pay button | 2.45 s |
| expected seconds if a share w of readers can use a wallet and the rest type a card: | |
| w | 0.00: 29.91 s |
| w | 0.25: 23.67 s |
| w | 0.50: 17.43 s |
| w | 0.75: 11.19 s |
查看完整验算程序
# Chapter 6. p61: Keystroke-level time of four ways to pay for the RM 29 report, field by field.
# Operator values are the desktop table of Card, Moran and Newell (1980): M = 1.35 s mental preparation,
# P = 1.10 s pointing (used here for a thumb tap on a field), K = 0.28 s per key (average non-secretary
# typist) for text and 0.50 s (typing random letters) for codes such as card digits; the table's K runs
# from 0.08 s (best typist) to 1.20 s (worst). Phone thumbs are usually slower; read the totals as a ruler
# for comparing paths, not as a forecast.
# R are system waits and USER are off-page actions (bank app, SMS code); both are assumed values.
import math
M, P, K_TEXT, K_CODE = 1.35, 1.10, 0.28, 0.50
PATHS = {
"four-screen card (today)": [
("email", "text", 22), ("password", "text", 10), ("confirm password", "text", 10),
("full name", "text", 14), ("phone", "code", 10), ("country", "pick", 0),
("card number", "code", 16), ("expiry", "code", 4), ("cvc", "code", 3),
("name on card", "text", 14), ("postcode", "code", 5),
("next x3", "tap", 3), ("pay button", "tap", 1)],
"one-screen card": [
("email", "text", 22), ("card number", "code", 16), ("expiry", "code", 4), ("cvc", "code", 3),
("pay button", "tap", 1)],
"one-screen wallet": [
("email (shared by wallet)", "none", 0), ("wallet button", "tap", 1),
("wallet sheet opens", "wait", 1.5), ("face or fingerprint", "user", 1.0)],
"online banking redirect": [
("email", "text", 22), ("choose bank", "pick", 0), ("redirect out", "wait", 3.0),
("bank user id", "code", 10), ("bank password", "code", 12), ("approve in bank app", "user", 20.0),
("redirect back", "wait", 3.0)],
}
def step_time(kind, n):
if kind == "text":
return M + P + K_TEXT * n
if kind == "code":
return M + P + K_CODE * n
if kind == "pick":
return M + 2 * P
if kind == "tap":
return n * (M + P)
if kind in ("wait", "user"):
return float(n)
return 0.0
print("operators: M {:.2f} s, P {:.2f} s, K text {:.2f} s, K code {:.2f} s".format(M, P, K_TEXT, K_CODE))
totals = {}
for name, steps in PATHS.items():
parts = [step_time(k, n) for _, k, n in steps]
typed = sum(1 for _, k, _ in steps if k in ("text", "code"))
keys = sum(n for _, k, n in steps if k in ("text", "code"))
off = math.fsum(step_time(k, n) for _, k, n in steps if k in ("wait", "user"))
totals[name] = math.fsum(parts)
print("{:26s} typed fields {:2d} keys {:3d} total {:6.2f} s of which waits/off-page {:5.2f} s".format(
name, typed, keys, totals[name], off))
base = totals["four-screen card (today)"]
for name, t in totals.items():
print(" {:26s} {:6.2f} s = {:.3f} of today".format(name, t, t / base))
card = PATHS["one-screen card"]
print("one-screen card, by field:")
for label, k, n in card:
print(" {:12s} {:5.2f} s".format(label, step_time(k, n)))
share_wallet = [0.0, 0.25, 0.50, 0.75]
print("expected seconds if a share w of readers can use a wallet and the rest type a card:")
for w in share_wallet:
t = w * totals["one-screen wallet"] + (1 - w) * totals["one-screen card"]
print(" w = {:.2f}: {:6.2f} s".format(w, t))唯一数据源与引用
范雅福(Fan, Y.). (2026). 《多阶诊断付费墙悬念断点、进度沉没棘轮与微交互丝滑解锁界面学》第 6 章「单屏付款:字段、钱包、信任标记、错误提示、延迟与暗黑模式的边界」(版本 0.1.0). 5D Library. DOI 待发布
DOI 待发布 · 专著页正式发布后上线(本站暂无专著页) · 5DL-B-139 · v0.1.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026139,
author = {Fan, Yafu},
title = {Suspense Breakpoints in Multi-Tier Diagnostic Paywalls, Sunk-Progress Ratchets and Frictionless Unlock Interface Design},
year = {2026},
publisher = {5D Library},
edition = {0.1.0},
note = {DOI pending}
}