「一无所有」并不便宜:从同态加密的换模术到存在问题的隐藏账单Nothing Is Not the Cheap Option: Modulus Switching, Stateless Shuffles, and the Hidden Bill of Existence
发布于 2026-11-13Published 2026-11-13
今日深读Today's Deep Read
为什么是有东西,而不是一无所有?——先算清「一无所有」的隐藏账单Why Is There Something Rather Than Nothing? First Audit the Hidden Bill of 'Nothing'
「为什么是有东西,而不是一无所有?」莱布尼茨在 1714 年把这句话写成了哲学史上最著名的一问。它古怪在于:世界里有东西,这个最显然的事实,反而是最没人能解释的。维特根斯坦把「世界存在」称作神秘之物,叔本华称它为一个「深不见底、永远躁动的问题」。问题背后是一个直觉:「无」应该比「有」更简单、更便宜。按奥卡姆剃刀,更简单的可能性概率更高——可现实偏偏选了这团嘈杂喧闹的东西。"Why is there something rather than nothing?" Leibniz turned the sentence into philosophy's most famous question in 1714. Its strangeness: the plainest fact in the world — that things exist — is the one nobody can explain. Wittgenstein called the existence of the world mystical; Schopenhauer, a fathomless, eternally restless problem. Under the question sits an intuition: nothing should be simpler and cheaper than something. By Occam's razor the simpler possibility should carry higher probability — yet reality picked this noisy, crowded option instead.
三百年来,多数哲学家认为这个问题问不出名堂。亨佩尔 1973 年论证它逻辑上不可能有答案:任何解释都必须诉诸某个已经存在的东西,解释企鹅的存在只能搬出更多企鹅。于是想回答的人被嘲笑,宣布问题无效的人成了主流。哲学家 Andrew T. Brenner 本月发在 Aeon 上的这篇文章不认账,他的策略恰恰是去做亨佩尔说不可能做到的事——但第一步,他要先拆掉这个问题赖以成立的直觉。For three centuries most philosophers held that the question has no answer. Hempel argued in 1973 that an answer is logically impossible: every explanation has to appeal to something already existing, so explaining penguins means fetching more penguins. Those who tried to answer were mocked; those who dissolved the question became mainstream. In a new Aeon essay, philosopher Andrew T. Brenner refuses both. His strategy is to do precisely what Hempel said can't be done — but first he dismantles the intuition that makes the question feel urgent.
他用的手术刀,是「存在性真理」与「非存在性真理」的区分。地球绕着太阳转、树比狗多,这些说的是存在物。但有一类真理不依赖任何事物:2+3=5;肯定前件式有效;方的圆不可能;哪怕伊沃克从未存在过,「掐伊沃克幼崽不是好事」照样成立。现在想象一个什么都没有的世界:它并不空,反而塞满了这类非存在性真理,而每一条都仍然欠着解释——为什么虚空偏偏带上这些规律而不是别的?结论是:「无」不是我们以为的零,它是一份预装了大量未经解释之物的方案。His scalpel is the distinction between ontological and non-ontological truths. The Earth orbits the sun, there are more trees than dogs — those are about things. But some truths don't depend on things: 2+3=5; modus ponens is valid; square circles are impossible; even if no Ewoks had ever existed, pinching an Ewok's fur would still be wrong. Now imagine a world with nothing in it: it isn't empty. It is packed with non-ontological truths, each still demanding an explanation — why would the void come equipped with these laws and not others? So 'nothing' is not the zero we assumed; it is a plan preloaded with unexplained items.
有人会反驳:真的一无所有时,真理从哪来?Brenner 指出这是偷换了问题。我们问的是「为什么有东西」,不是「为什么有真理」;而「没有任何真理」根本构不成一个可描述的情形——因为任何描述本身就是一个真理。空的世界是一个含真理、不含事物的可能世界,不是一个既无真理也无事物的世界。Someone will object: if truly nothing exists, where do truths come from? Brenner answers that this changes the subject. We asked why something exists, not why truths obtain — and 'no truths at all' isn't even a describable situation, since every description is itself a truth. The empty world is a possible world containing truths but no things, not a world with neither.
真正让这篇文章配得上「新答案」的,是下一步:如果设定「有某个东西存在」能一次解释掉大量非存在性真理,这个设定反而降低了总账的复杂度——正如达尔文的共同祖先:看似多搬进来一个实体,实际省下无数条各自为政的解释。Brenner 列出三个候选:上帝(把道德与逻辑真理奠基于他的本性,且被视为极大单纯的存在);初始奇点加自然律(说明哪些东西不会存在,甚至为「什么是可能的」提供根据);人类自己(道德反实在论、逻辑约定论、直觉主义数学都把这类真理看作人类实践的产物)。他不裁决高下,只说每条都有严肃辩护者。The step that earns the 'new answer' billing: if positing one existing thing explains away many non-ontological truths at once, the positing lowers reality's total complexity — as Darwin's common ancestor looked like one extra entity but saved countless separate explanations. Brenner names three candidates: God (grounding moral and logical truths in a maximally simple nature); an initial singularity plus laws (explaining which things never exist, and what is possible); human beings (anti-realists, conventionalists and intuitionists treat these truths as made by our practices). He does not rank them, only notes each has serious defenders.
如果「有对的种类的东西存在」比「什么都没有」更简单,莱布尼茨的惊奇就该消解:现实可能恰是所有可能世界中最简单的那一个。他还多走一步——并承认非常思辨:如果实在能「因为更简单而取更简单的形态」,奥卡姆剃刀为什么屡屡奏效也就有了答案。但他也写下:即使这一步成立,更大的谜还在——万物可能的样态无穷无尽,为什么偏偏是这一种?If something of the right sort is simpler than nothing, Leibniz's wonder dissolves: reality may be the simplest of all possible worlds. Brenner then dares a speculative move: if reality can take the simpler form because it is simpler, Occam's razor itself might be explained. He is honest about the residue: even then, of endlessly many ways things could go, why this one?
对程序员来说,这篇文章真正可迁移的是前半段:当你说「方案 A 明显更简单」时,先检查你是不是把方案 B 悄悄塞进了一堆没被审视的默认项。「空世界」不免费,因为规律不免费;很多「简化」只是把复杂度搬到了账本的暗处。至于宇宙是否真的趋向最小值——那是 Brenner 的赌注,你可以不下。For engineers, the portable part is the first half: before you say 'option A is obviously simpler,' check what you quietly loaded into option B's unexamined defaults. The empty world is not free, because laws are not free. Much 'simplification' just moves complexity into the dark of the ledger. Whether the universe really tends toward the minimum — that is Brenner's bet, and you are free not to take it.
AI 思考AI Thoughts
- 把推理当路径搜索:模型优化的「命中率」,不是「收敛」Reasoning as Pathfinding: Models Optimize a Hit Probability, Not Convergence
- 一组悖论先摆出来:训练时模型的思维链越拉越长、正确率随之上升;可推理时强行加长某一条链,过某个点后不再有用,甚至变差(「过度思考」)。如果「想得更久」就是在收敛到答案,多想怎么会错?Start with a paradox: during RL training, chains of thought lengthen and accuracy climbs; at inference, forcibly lengthening one chain stops helping past a point, sometimes hurting ('overthinking'). If thinking longer were converging on the answer, why could extra thinking ever be wrong?
- Alex Wang 的换轴:推理不是收敛到真相的单一过程,而是 token 空间里的路径搜索。给定问题 x 和验证器 r,存在许多条落进正确答案集合 S_x 的路径 z;模型每次采样一条路径,能力压缩成一个数字——命中概率 p_x。Alex Wang swaps the frame: reasoning is not one process converging on truth but pathfinding in token space. For problem x with verifier r, many paths z land in the correct-answer set S_x; the model samples paths, and ability compresses to one number — the hit probability p_x.
- 由此分开两种截然不同的「用算力买智能」:一是多采样,best-of-k 成功率 1−(1−p_x)^k,只要 p_x 大于零就严格单调上升;二是训练提升 p_x 本身(拒绝采样、RL),它增大「模型找到某条路」的概率,但不保证任何单条路径步步「收敛到正确」。Two utterly different ways to buy intelligence with compute now separate: more samples, where best-of-k succeeds at 1−(1−p_x)^k and strictly improves as long as p_x > 0; or training that raises p_x itself (rejection sampling, RL), which increases the odds of finding some path but guarantees no single chain 'converges' step by step.
- 几个诡异现象顺手被解释:思维链为什么可以「不忠实」——训练只奖励落点,从不要求路径是模型真实的因果路线;reward hacking 为什么必然发生——被优化的是「落在 S_x 里」这个命中率,路径自然会找到验证器盲区的捷径。A few spooky phenomena get explained for free: chains of thought can be unfaithful, because training rewards the landing, never requiring the path be the model's true causal route; reward hacking is inevitable, because what gets optimized is the hit rate on 'lands in S_x', and paths will find the verifier's blind spots.
- 带走的一条:以后读任何 test-time compute scaling 的文章,先分清两个轴——样本数,还是路径长度——它们不可互换。「想得久等于更聪明」是把训练期经验错读成了推理期事实。Take away one habit: whenever you read a test-time-compute-scaling paper, ask which axis is moving — sample count or path length. They are not interchangeable, and 'longer thinking equals smarter' misreads a training-time fact as an inference-time one.
- AI 花八小时「想」出的一次权重编辑,其实是一道线性规划The Eight-Hour 'Thought' That Edited Model Weights Was Really a Linear Program
- MIT CSAIL 上周发布《Sparks of Weight-Space Programming》:GPT-6 级的 Astra 能从原始权重反推一个小网络被训练来玩哪个游戏,能在只看规则时直接写出玩游戏的权重,还把 Qwen3.5-0.8B 的 MATH-500 从 7.9% 提到 48.1%——只改了 0.016% 的权重。Nathan Barry 看完日志,认出了真相。MIT CSAIL's 'Sparks of Weight-Space Programming' landed last week: GPT-6-class Astra can infer which game a small network was trained to play just by reading its weights, write playing weights from rules alone, and lift Qwen3.5-0.8B on MATH-500 from 7.9% to 48.1% by touching 0.016% of the weights. Nathan Barry read the traces and recognized what had actually happened.
- 先拆这次编辑:小推理模型的通病是「思考循环」,93% 的答例把 32k token 烧光。残差流是每层不断累加的向量,循环文本与正常文本的均值残差流之差,就是「循环方向 u」。把 MLP 输出投影 W 的每一列沿 u 分量改掉,整个编辑等于一个秩一扰动 ΔW = u·vᵀ——u 定了,未知的只剩向量 v:改哪些列、改多少。Dismantle the edit: small reasoning models die by thinking loops — 93% of answers burned the full 32k tokens. The residual stream accumulates every layer; the mean-gap between looping and normal text defines a 'loop direction u'. Rewriting W's columns along u makes the whole edit a rank-one perturbation ΔW = u·vᵀ: once u is fixed, the only unknown is v — which columns, by how much.
- Barry 的观测:Astra 试错八小时满足的每一条约束——循环 token 尽量被推离 u、正常 token 尽量不被扰动——都是 v 的线性函数。所以这根本是个线性规划。把它显式写成 LP 加 L1 目标,交给求解器解,L1 球体的菱形顶点自动挑出稀疏的列集合。Barry's observation: every constraint Astra's eight-hour trial-and-error satisfied — push looping tokens away from u, disturb normal tokens as little as possible — is linear in v. That is a linear program. Write it down explicitly, add an L1 objective, and the diamond corners of the L1 ball pick the sparse column set for you.
- 结果:现成求解器 HiGHS 二十多分钟,他自写的 GPU PDHG 约一分钟到最优 0.2% 以内;得到的编辑比 Astra 的八小时试错更小,精度持平或更好;对照组「随机方向」完全无效。他诚实标注边界:这题上「恒定推一把」几乎同样好用,LP 的每-token 约束没展现额外价值,层的选择也仍要靠 Astra。The scoreboard: off-the-shelf HiGHS takes over twenty minutes; his own GPU PDHG reaches within 0.2% of optimal in about one. The resulting edit is smaller than Astra's, accuracy equal or better; the 'random direction' control does nothing. He flags the limits honestly: a constant push nearly ties here, the per-token constraints showed no extra value, and choosing the layer still needs Astra.
- 可迁移的一招:遇到 AI 似乎在「有灵感」的地方,先检查它的搜索空间是不是暗藏结构——说不定它在昂贵地重解一道人类数学已有标准解法的题。这不是贬低 AI,这正是把八小时变成一分钟的方法。The transferable move: whenever an AI seems to be having inspiration, check whether its search space secretly has structure — it may be expensively re-solving a problem human math already solved. That is not a knock on AI; it is exactly how eight hours become one minute.
数学之美The Beauty of Math
- CKKS 的换模术:环里除不动,就抬出环去「真除」一次CKKS Rescaling: When You Can't Divide in the Ring, Lift Out and Really Divide
- CKKS 是「能在密文上算」的同态加密,算的是定点数:密文加密 m、带着标度 Δ,解码恒等式是 c₀+c₁·s = Δm+e。连乘两个密文会同时弄坏两件事:标度变成 Δ²,噪声随 Δ·e 增长——不做点什么,几层乘法后密文就被自己的噪声吃掉。CKKS is the homomorphic scheme that computes on encrypted fixed-point numbers: a ciphertext encrypts m at scale Δ, with the decoding identity c₀+c₁·s = Δm+e. Multiplying two ciphertexts breaks two things at once — the scale becomes Δ² and noise grows like Δ·e — so after a few layers the ciphertext is devoured by its own noise.
- 自然的念头是把密文「除以 Δ」。Kun 先用十几行脚本演示:在环里除(乘模逆元)会把 e=1 的良性噪声放大成约 10¹⁶ 量级的怪物;而且若 Δ 与模数 Q 有公因子,环内除法根本无定义。此路不通。The natural idea is to divide the ciphertext by Δ. Kun first shows, in a dozen lines of code, why dividing inside the ring (via a modular inverse) blows a benign e=1 up into a monstrosity around 10¹⁶ — and if Δ shares a factor with the modulus Q, in-ring division isn't even defined. Dead end.
- 真正的出路:把密文提升到整数代表元,在实数里真除——(c₀+c₁s)/Δ = Δm + e/Δ + tQ/Δ。妙处在于这条等式在模 Q/Δ 的新环里刚好形状正确:标度回到 Δ,噪声缩小 Δ 倍,讨厌的 tQ 项在新模数下自动消失。代价是商必须取整,引入微小的舍入噪声 z₀、z₁。The real move: lift the ciphertext to integer representatives and do actual division in the reals — (c₀+c₁s)/Δ = Δm + e/Δ + tQ/Δ. The punchline is that this equation has exactly the right shape in the new ring modulo Q/Δ: scale back to Δ, noise shrunk Δ-fold, and the nuisance tQ term vanishes under the new modulus. The price: the quotient must be rounded, introducing small rounding noise z₀, z₁.
- 对新的误差 e/Δ + z₀ + z₁s 做一次完整的记账:z 形如 ±1/2 上的均匀分布;z₁ 与稀疏密钥 s 的乘积经符号抵消后平均只有约 √(h/12) 量级——远小于不除的代价。一次换模,同时买到「标度降」和「噪声降」。One full error audit of the new noise e/Δ + z₀ + z₁s: z behaves like uniform ±1/2, and z₁·s against a sparse secret key cancels in sign to roughly √(h/12) on average — far cheaper than not dividing. A single rescale buys both a lower scale and lower noise.
- 工程后果:为了让除法干净,Q 必须能被 Δ 一路分解(模数链);要高效地做这一切就需要 RNS(剩余数系)表示——下一篇。全文陪你把「modulus switching」从一团乱麻里亲手发明出来,是「讲解一个想法」的范本。The engineering consequence: for division to be clean, Q must factor through Δ step by step (a modulus chain), and doing all this efficiently requires RNS representation — the next post in the series. The whole piece walks you through inventing modulus switching out of a mess, a model lesson in explaining an idea.
- 不洗牌、不存状态:用 Feistel 网络把「随机遍历」做成纯函数A Stateless Shuffle: Turning Random Traversal into a Pure Function with a Feistel Network
- 任务:从 n 个里无放回地随机取 k 个(渲染里每帧采样一组光源是原型)。教科书答案是 Fisher-Yates 洗牌——但它是 O(n) 时间,还要物化整个置换。当 n 是十亿、k 只有一万,两头都崩。The task: draw k items from n without replacement (sampling a set of lights per frame in rendering is the archetype). The textbook answer is a Fisher-Yates shuffle — O(n) time and it materializes the whole permutation. With n in the billions and k in the thousands, both die.
- Helmer 先给常规补丁(哈希表只记录被换过的下标,O(k) 内存),再一针见血:所有这类方案都需要「状态」。真正想要的是一个纯函数——给定 seed 和位置 i,直接算出打乱后第 i 个元素,不落盘任何东西。Helmer first shows the usual patch (a hash map storing only the swapped indices, O(k) memory), then puts the finger on the real wound: every such scheme carries state. What you actually want is a pure function — given a seed and position i, compute the i-th element of the shuffle without materializing anything.
- 构造目标:f(seed, i, n),满足 i↦f 在 {0..n−1} 上是双射(不重不漏),且输出看起来随机。工具三件:Feistel 网络(把数拆成左右两半,用轮函数构造成可逆映射)、乘以一个大奇数常数(mod 2^32 下的双射,打散比特相关性)、几个异或移位做扩散。The specification: f(seed, i, n) such that i↦f is a bijection on {0..n−1} (no repeats, nothing missed) and outputs look random. Three tools do it: a Feistel network (split the number in halves, build an invertible mapping from round functions), multiply by a large odd constant (a bijection mod 2^32 that scrambles bit correlations), and a few XOR-shifts for diffusion.
- 收益立现:O(k) 时间、O(1) 内存,还随机访问——任何线程、任何机器、任何乱序,都能查打乱序列的第 1,372,914 位。并行渲染、分布式采样从此「免费」。The payoff is immediate: O(k) time, O(1) memory, and random access — any thread, any machine, any order can ask for position 1,372,914 of the permutation. Parallel rendering and distributed sampling become free.
- 作者把边界也标清楚:这不是密码学强度的置换,只保证统计上「像洗牌」;文中还提到后续工作把构造扩展到 64 位。全文是「用函数替换数据结构、用纯计算替换状态」的教科书案例。The author marks the edges: this is not cryptographic strength, only statistical 'looks shuffled', and he points to follow-up work extending the construction to 64 bits. A textbook case of replacing a data structure with a function, and state with pure computation.
- 正确性不是工具问题,是自然律:从停机问题到复杂性下界的九十年Correctness Is a Law of Nature, Not a Tooling Problem: Ninety Years from Halting to Hardness
- 作者把近九十年的逻辑与复杂性结果收拢成一句话:「正确的软件很难写」不是工具不好——不存在任何工具、任何语言,能让「完全证明程序正确」变得便宜。希尔伯特刻在墓碑上的「我们必须知道,我们将会知道」,被哥德尔和图灵反过来讲给了计算本身听。The author gathers ninety years of logic and complexity into one sentence: 'correct software is hard' is not a tooling gap — no tool, no language makes fully proving a program correct cheap. Gödel and Turing answered Hilbert's engraved 'We must know — we will know' on behalf of computation itself.
- 第一条链(不可判定):停机问题(对角线自指引发矛盾)→ 可达性 → Rice 定理:程序行为的一切非平凡性质都算法上不可判定,包括「这个程序是否总是输出输入的平方」。所以通用验证器不存在——今天不存在,永远也不存在。Chain one (undecidability): the halting problem (diagonal self-reference producing contradiction) → reachability → Rice's theorem: every nontrivial property of program behavior is algorithmically undecidable, including 'does this program always output the square of its input'. So the universal verifier does not exist — not today, not ever.
- 第二条链(复杂性):即便性质可判定,代价也是自然律。从 Hartmanis–Stearns 1965 年定义复杂性度量开始,模型检查、静态分析逐一坠入 NP/PSPACE-难。1952 年 Newman 问图灵「时间呢?」图灵答:「时间因素正是全部实际困难所在。」三十年后复杂性理论给出了正式判决书:指数。Chain two (complexity): even decidable properties cost you by law. From Hartmanis–Stearns in 1965 defining the measure onward, model checking and static analysis fall one by one into NP- and PSPACE-hardness. In 1952 Newman asked Turing 'what about time?'; Turing replied that the time factor is where all the real difficulty lies. Thirty years later complexity theory delivered the verdict in writing: exponential.
- 作者的总结一句话:没有容易的办法解决困难的题——如果你的问题是预测、创作或导演一个计算过程,那么它就是难的。某些「用对工具正确性就简单」的许诺不是工程乐观,是哲学上对自然律的冒犯。The author's summary: there are no easy solutions to hard problems — and if your problem is to predict, author, or direct a computational process, then it is hard. Promises that 'the right tool makes correctness easy' are not engineering optimism but philosophical offenses against a law of nature.
- 带走的姿势:每一个抽象、类型系统、测试策略,都是在「某些场景买到保证、另一些场景放弃保证」之间做预算。管理正确性像管理能量,你可以精打细算,但无法免税。(原文发表于 2016 年,仍是这件事最好的单篇综述。)The takeaway posture: every abstraction, type system, and test strategy buys guarantees in some scenarios by forfeiting them in others. Managing correctness is like managing energy: you can budget carefully, never be exempt. (Originally 2016; still the best single overview of the subject.)
程序员随想Programmer Reflections
- 当 AI 同时改代码和测试,把契约搬进「数据」里When AI Changes Code and Tests Together, Move the Contract into Data
- 2026 年初作者访谈 Thoughtworks 的 26 位开发者:「你们信测试吗?」答几乎一致——不太信。因为每个新功能都是 AI 连代码带测试一起重构的,没人能每次重读所有被改动的测试。Early 2026 the author interviewed 26 Thoughtworks developers: do you trust your tests? Nearly unanimous — not really, because every feature arrives as AI-refactored code and AI-refactored tests in one bundle, and nobody re-reads every changed test every time.
- 问题有两层。量:测试代码比生产代码更多、更无聊,根本 review 不完。耦合:AI 生成的大量单元/集成测试用 mock、stub 验证「A 调用了 B」而非「结果正确」,甚至会把 bug 当事实锁定进断言里。Two layers of trouble. Volume: test code is larger and more boring than production code, so review never finishes. Coupling: the flood of AI-written unit and integration tests verifies 'A called B' through mocks and stubs instead of 'the result is right', and happily immortalizes bugs as assertions.
- 视角的关键翻转:AI 开始写代码之后,开发者就变成了 AI 的「客户」。TDD 时代测试是开发者之间的内部契约;现在需要的是人与机器之间的外部契约——客户说了算的那种。The pivotal reframe: once AI writes the code, the developer is the customer — of the AI. Tests were an internal contract among developers since TDD; what is needed now is an external contract between humans and machines, the kind where the customer says what counts.
- 处方:把断言从测试代码搬进测试数据。三件套——customer tests(XP 验收传统的表格:输入列、输出列、期望列);spec by example / Go 式表驱动测试;approval testing(把期望状态存成文本文件逐字比对)。表格和文件没法被「顺手重构」,每一次改动都是人类必须签字的 diff。The prescription: move assertions from test code into test data. Three vehicles — customer tests (the XP acceptance tables: input columns, output columns, expected columns), spec-by-example and Go-style table tests, and approval testing (expected state as text files compared verbatim). A table cannot be 'refactored along the way': every change is a human-signed diff.
- 作者自我设限也写得很清楚:不是所有契约都进得了表格(并发、属性、类型系统除外);规格驱动开发的那份 markdown 同样会被 AI 重写,harness 本身需要保护,「给测试写的测试」也依然要有。执行引擎可以让 AI 写——从前 DSL 贵,现在便宜,这是全文最实在的一句。The author's own limits are stated: not every contract fits a table (concurrency, properties, type systems); a spec-driven markdown gets rewritten by AI just as easily; the harness itself needs protection and tests-for-tests remain. Let AI write the execution engine — DSLs were expensive, engines are cheap now. That is the most practical sentence in the piece.
- 魔法时代的 Emacs 工匠:当 LLM 抹平键盘效率与 Lisp 表达力,你还剩什么Emacs Craftsmanship in the Age of Magic: What's Left When LLMs Erase the Edge
- 这是一篇以「commercial Emacs」恶搞仓库名义写的未署名散文: Emacs 工匠的骄傲建立在两件事上——键盘效率(少碰鼠标)与 Lisp 表达力(想改就改)。LLM 是新的「魔法」,它同时抹平了这两条护城河。An unsigned essay published under the parody 'commercial Emacs' repo: the Emacs craftsman's pride rests on two things — keyboard efficiency (never touch the mouse) and Lisp expressiveness (change anything). The LLM arrives as new magic and erases both moats at once.
- 第一个案例:新手用 agent 把 Excalidraw 整个「重新实现」进 Emacs(excali-mode.el);第二个案例:有人让 AI 生成 cooked.el。传统意义上的「浪费」在建起和拆掉都等于拨一下开关的时代失去了意义——每个用户都会拥有自己的「私人爱达荷」,一堆用完即弃的 hack。Case one: a newcomer has an agent 'reimplement' all of Excalidraw inside Emacs (excali-mode.el); case two: someone has AI generate cooked.el. Traditional wastefulness loses its meaning when building up and tearing down are like flipping a switch — every user will own a private Idaho of throwaway hacks.
- 对 Emacs 社区病理的解剖最狠:那些「宏大计划」(换成 Guile Scheme、LISP 线程)喊了十几年无人动工——作者断言,没人真的那么想要它们,大家想要的是谈论它们;而「抱怨是有趣的,你得到全部注意力而不承担任何工作」。The dissection of community pathology bites hardest: the grand plans (replace Elisp with Guile, preemptive LISP threads) have been talked about for over a decade with no code — the author's charge is that nobody really wanted the things, only wanted to talk about them, because complaining gets you all the attention and none of the work.
- 一篇 HN 帖「软件的 Emacs 化」被引为佐证:作者让 AI 按自己的口味写了个 markdown 查看器,并预言一切应用都会被私人定制;他把 r/emacs 的精神总结成一句话——0% Product Hunt,100% Show and Tell。A cited HN post, 'The Emacsification of Software', corroborates: its author had AI write a personal markdown viewer and predicts every application gets privately customized; he nails the ethos of r/emacs as '0% Product Hunt and 100% Show and Tell'.
- 结尾的反讽值得裱起来:AI 把 Stallman 的软件自由翻了个面——让计算机做你能想象的任何事,这才是真自由;唯一的代价是你完全不知道它怎么工作,而且没人知道。(全文带真实代码仓库与「FAQ」,形式和内容一样好笑。)The closing irony deserves a frame: AI inverts Stallman's software freedom — having your computer do whatever you can imagine is the real freedom, and the only catch is that you will have no idea how it works. No one does. (The essay ships with a real repo and its own FAQ; the form is as funny as the content.)
哲学与生活Philosophy and Life
- 一千万个 IMG_0416:互联网最真实的一段流,是谁都没策展的意外Ten Million IMG_0416s: The Internet's Most Honest Feed Was an Accident Nobody Curated
- 观察对象:YouTube 上大量名为 IMG_XXXX 的裸视频,没有标题、没有剪辑、没有作者意图——它们全部来自 2009 年 12 月 iPhone 3GS 的一个功能:相机相册里「发送到 YouTube」,一键上传、默认命名、默认私有被人手滑设成公开。The specimen: millions of bare videos on YouTube titled IMG_XXXX — no titles, no edits, no authorial intent. All of them come from one iPhone 3GS feature shipped in December 2009: 'Send to YouTube' from the camera roll, uploading one-tap, with default names and privacy settings casually slipped open.
- 作者的论证核心在「偶然性制造真实」:这些视频是千万人没打算被看见的生活边角——睡房、车库、孩子、抖动的手。正因为没有任何策展、任何观众预期,它们反而成了社交平台时代最接近「实况流」的东西。The core claim: contingency manufactures authenticity. These clips are the offcuts of everyday life from tens of millions of people who never meant them to be seen — bedrooms, garages, kids, shaking hands. With zero curation and no imagined audience, they became the closest thing to a live feed the social web ever produced.
- 对照当下:TikTok 和 Reels 的算法把每个人训练成自己的编辑,「随手记录」早已是有钩子、有封面、有完播率优化的表演。IMG_0416 们是无意的,这就是它们全部的魅力来源。The contrast with now: TikTok and Reels trained everyone into being their own editor; 'casual documentation' is performance with hooks, thumbnails, and watch-time optimization. The videos of IMG_0416 are unintentional, and that is exactly where all their charm comes from.
- 文章温柔但论点轻:它是一次对「真实性从何而来」的漂亮观察——真实性不来自坦诚的表演,来自没打算表演。策展制造假象,意外制造证据。A gentle essay with a light thesis, and it knows it: authenticity does not come from candid performance but from not performing at all. Curation makes fiction; accidents make evidence.