关于「漏桶、令牌桶与双重上限:每分钟整形与 24 小时独立收件人」,《私域速率整形》给出的定量结论是什么?

结论:第四章把每分钟整形与滑动 24 小时人数上限排进同一份计划。

数据口径:示意计划每分钟平均 10.0 条,攒批猛发仍被拒收 420 条,接上桶深 20 的令牌桶后为零。 书中参数为示意,平台数字注明文档与查阅日期;全部计算由书中程序生成,程序不读写文件、不联网;本书是非个人化经营建议,不是法律或合规意见,任何线上发送节奏的改动须由主事者人工复核放行。

English version

对照数据表

下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库与结论吻合的打印值: 24

tier Lper daydays for 12000binding limit
25025048tier
200020006tier
1000060202shaper
10000060202shaper
tier 2000, same daily total, worst moving 24 h count:
even pacing 10:00-20:00 every day : 2000
day 1 in its last hour, day 2 in its first hour : 4000
查看完整验算程序
# Chapter 4. p42: two limits at once, a per-minute shaper and a 24 h cap.
# Model (illustrative list and hours; tier steps as Meta publishes them:
# 250, 2,000, 10,000 and 100,000 unique recipients per moving 24 h).
# 12,000 consented contacts get one campaign message each. Sending is
# allowed 10:00 to 20:00 local time (600 minutes; a quiet-hours rule of
# the shop). The shaper gives at most b + r t in t minutes, r = 10,
# b = 20, so at most 6,020 a day. The platform caps unique recipients
# in any moving 24 h at the tier limit L. Meta's default throughput of
# 80 a second (4,800 a minute) never binds here. Second part: the same
# daily total can break a moving 24 h cap if the send time drifts.
import math

LIST, MINUTES, R, B = 12000, 600, 10, 20
SHAPER_DAY = B + R * MINUTES

print("tier L   per day  days for 12000  binding limit")
for L in (250, 2000, 10000, 100000):
    day = min(L, SHAPER_DAY)
    print("%6d  %8d  %14d  %s"
          % (L, day, math.ceil(LIST / day),
             "tier" if L < SHAPER_DAY else "shaper"))


def worst_24h(per_minute):
    best, run = 0, 0
    for i, x in enumerate(per_minute):
        run += x
        if i >= 1440:
            run -= per_minute[i - 1440]
        best = max(best, run)
    return best


L = 2000
even, drift = [0] * (3 * 1440), [0] * (3 * 1440)
for d in range(3):
    for k in range(L):
        even[d * 1440 + 600 + (k * MINUTES) // L] += 1
late = [1440 * 0 + 600 + 540 + (k * 60) // L for k in range(L)]
early = [1440 * 1 + 600 + (k * 60) // L for k in range(L)]
for t in late + early:
    drift[t] += 1
print("tier 2000, same daily total, worst moving 24 h count:")
print("  even pacing 10:00-20:00 every day : %d" % worst_24h(even))
print("  day 1 in its last hour, day 2 in its first hour : %d"
      % worst_24h(drift))

唯一数据源与引用

范雅福(Fan, Y.). (2026). 《私域通道防封号速率控制论、令牌桶限流与平台公示上限内的同意制触达吞吐母典》第 4 章「漏桶、令牌桶与双重上限:每分钟整形与 24 小时独立收件人」(版本 1.0.0). 5D Library. DOI 待发布

DOI 待发布 · 专著页正式发布后上线(本站暂无专著页) · 5DL-B-271 · v1.0.0 · CC-BY-NC-ND-4.0

BibTeX
@book{fan2026271,
  author    = {Fan, Yafu},
  title     = {Rate Control for Private Messaging Channels without Account Bans: Token-Bucket Shaping, Platform-Published Limits and Consent-Based Reach Throughput},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

本书其他章节结论