每日科技文摘Daily Tech Digest

每日思考文摘 · 2026-10-23Daily Thought Digest · 2026-10-23

发布于 2026-10-23Published 2026-10-23

今日深读Today's Deep Read

大模型的权重是一件历史文物:当完整保存注定失败,有损压缩胜过什么都没有LLM Weights Are Historical Artifacts: When Perfect Preservation Is Doomed, Lossy Compression Beats Nothing

antirez(Redis 的作者)在 2025 年 3 月写过一篇很短的文章,标题很不搭界:大模型的权重是一件历史文物。他是从一个跟 AI 无关的问题开始的:互联网正在不停地丢失自己。每一年,都有一部分旧网页永远消失——博客关停、论坛散架、出版商倒闭时整批整批的论文断链,早期的数字艺术、游戏和气候数据随着宿主机一起蒸发。一直在接这些东西的 Internet Archive,总部设在一座以前的教堂里;antirez 说,没有比这更贴切的隐喻了:它是整个现代互联网的博物馆——而它自己的存续,全靠少数人的自愿努力,还经常被各路公司拖后腿。In March 2025, antirez — the author of Redis — published a short post with an odd title: LLM weights are a piece of history. He starts from a problem that has nothing to do with AI: the internet keeps losing itself. Every year a fraction of old pages disappears forever — blogs shut down, forums rot, papers break as publishers fold, early digital art, games and climate data evaporate along with the servers hosting them. The Internet Archive, which has been catching all of this, is housed in a former church; antirez says there is no better metaphor: it is the museum of the modern internet — and its own survival depends on a handful of volunteers, while many institutions actively make it harder.

接着他给出第一个冷判断:『把所有东西都保存下来』这条路,注定会失败。不是因为技术上做不到,而是因为经济学:存档是一件零经济回报的事——花很多钱,在现行体系里换不来任何收入。没有回报的事,不能指望靠善意永续,这正是为什么每年还是有旧内容在消失:没有人会因为阻止它发生而得到报酬。Then comes the first cold judgment: 'just preserve everything' is doomed, not on technical grounds but economic ones. Archiving is an activity with zero economic return — it costs real money and pays none in the current system. Things with no payoff cannot run on goodwill alone, which is exactly why content still vanishes every year: nobody gets paid for preventing it.

全文的转折在这里:完整保存做不到,那有损压缩版呢?antirez 的答案是:大模型的权重,本身就是互联网的一份有损压缩档。比如 DeepSeek V3 这类模型,已经用几个 TB 的参数编码了网络上的内容——不完整、有幻觉、丢掉大量细节。但请注意这个『但』:即使源博客早就打不开了、论坛早就没了,那些人说过什么、争论过什么、那个年代讨论问题的风格,全都以压缩的形式留在权重里。『有损』在这里不是缺陷的委婉说法,而是整篇的支点:一份有损的记录,胜过的不是另一份无损的记录,而是『什么都没有』。The turn of the essay: if a perfect copy is impossible, what about a lossy compressed one? antirez's answer is that large LLM weights already are a lossy compression of the internet. Models like DeepSeek V3 encode the web in a few terabytes of parameters — incomplete, hallucinated, missing huge amounts of detail. But notice what that 'but' concedes: even when the original blog is long dead and the forum is gone, what people said and argued and the style of the era's discussion survives in compressed form inside the weights. 'Lossy' is not a euphemism here; it is the fulcrum: a lossy record beats not a lossless one, but nothing at all.

由这个前提,往下推的结论是:如果权重是互联网的有损压缩档,那么『一个开源模型的权重失传』,就相当于『一份历史档案的孤本丢失』。于是他提出两件具体到可以马上做的事:第一,凡是公开发布过权重的模型,应该像开源软件一样被镜像和存档,确保它们在未来某一天公司倒闭、官网下线之后依然找得到;第二,Internet Archive 这样的机构应该被明确写进预训练数据——它们是一个文明的记忆原料,比任何单个模型都更值得被留到下一个时代。From that premise the conclusion follows: if weights are a lossy archive of the internet, then losing the weights of a released model is like losing a one-of-a-kind copy of history. So he proposes two concrete things: publicly released weights should be mirrored and archived the way open-source software is, so they can still be found after a company dies or a site goes dark; and institutions like the Internet Archive should be explicitly part of pre-training corpora — they are the raw memory of a civilization, and they deserve to outlive any single model.

今天把它放进深读,是因为它悄悄换掉了『大模型是什么』这个问题的坐标系。商业叙事里,权重是产品:会折旧、会被版本更替、会被卖成服务;antirez 的叙事里,权重是化石:以后想研究『2020 年代的人在网上怎么想问题』的历史学家,可能要打开的就是这几份压缩包。两种坐标系可以同时为真,但当公共政策把争论缩到『为了安全,要不要禁止开源权重』的时候,历史学家的视角会逼出另一个同样真实的问题:如果开源权重被禁止流通,谁来保管那一份全互联网的有损历史?It earns today's deep read because it quietly swaps the frame for the question 'what is an LLM?' In the commercial frame, weights are a product: they depreciate, get version-bumped, get sold as a service. In antirez's frame, weights are a fossil: the historian who in fifty years wants to know how people actually thought on the internet in the 2020s may have to open these exact compressed archives. Both frames can be true at once — but when the policy debate shrinks to 'should open weights be banned for safety?', the historian's frame forces a second, equally real question: if released weights are forbidden from circulating, who is left holding the internet's lossy copy of its own history?

AI 思考AI Thoughts

数学之美Beauty of Math

每日 Lean 谜题 · 周五Daily Lean Puzzle · Friday ★★★★★☆☆

迭代方程 fₙ(x)=2x:为什么不管迭代多少代,答案都只有一个(★5)The Iterated Equation fₙ(x)=2x: Why Every Generation Has Exactly One Solution (★5)

1990 年美国数学奥林匹克(USAMO)第 2 题:给定一个函数序列,$f_0(x)=8$,且对每个 $n\ge 0$,$f_{n+1}(x)=\sqrt{x^2+6f_n(x)}$(平方根取正根)。1990 USAMO Problem 2. A sequence of functions is defined by $f_0(x)=8$ and, for each $n\ge 0$, $f_{n+1}(x)=\sqrt{x^2+6f_n(x)}$ (the square root is the positive one).

对每个非负整数 $n$,求方程 $f_n(x)=2x$ 的所有实数解。For each nonnegative integer $n$, find all real solutions of $f_n(x)=2x$.

Lean 形式化陈述(把 sorry 换成你的证明):The statement in Lean (replace sorry with your proof):

/-
Copyright (c) 2023 David Renshaw. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: David Renshaw
-/

import Mathlib.Tactic

/-!
# USA Mathematical Olympiad 1990, Problem 2

A sequence of functions {fₙ(x)} is defined recursively as follows:

                  f₀(x) = 8
                fₙ₊₁(x) = √(x² + 6fₙ(x)).

For each nonnegative integer n, find all real solutions of the equation

                  fₙ(x) = 2x.
-/

namespace Usa1990P2

noncomputable def f : ℕ → ℝ → ℝ
|     0, _ => 8
| n + 1, x => Real.sqrt (x^2 + 6 * f n x)

abbrev solution_set (n : ℕ) : Set ℝ := sorry

theorem usa1990_p2 (n : ℕ) (x : ℝ) : x ∈ solution_set n ↔ f n x = 2 * x := by
  sorry
end Usa1990P2

在浏览器中挑战 ▶Try it in your browser ▶ 下载题目 .leanDownload puzzle .lean

提示Hint

先证明对所有 $n$ 和所有实数 $x$,$f_n(x)$ 都是严格正的(这是后面所有判断的基石)。然后猜 $x=4$ 是解,用归纳法证明对每个 $n$,$x$ 相对 $4$ 的大小,严格决定 $f_n(x)$ 相对 $2x$ 的大小——三者一一对应。First prove that for every $n$ and every real $x$, $f_n(x)$ is strictly positive (the foundation of everything that follows). Then guess that $x=4$ works, and prove by induction that, for each $n$, whether $x$ is below, equal to, or above $4$ exactly determines whether $f_n(x)$ is above, equal to, or below $2x$ — a clean one-to-one correspondence.

答案与讲解Solution & walkthrough
  1. 第一步(数学):先立一个引理——$f_n(x)>0$ 对所有 $n$ 和所有实数 $x$ 成立。$f_0(x)=8>0$;若 $f_n(x)>0$,则 $x^2+6f_n(x)>0$,开方后 $f_{n+1}(x)>0$。Lean 里对应的是 `have hfnp : ∀ n x, 0 < f n x`,用归纳 + `positivity` tactic 完成,后面每一步都要用这个事实。Step 1 (math): establish the lemma that $f_n(x)>0$ for every $n$ and every real $x$. $f_0(x)=8>0$; if $f_n(x)>0$ then $x^2+6f_n(x)>0$, so $f_{n+1}(x)=\sqrt{x^2+6f_n(x)}>0$. In Lean this is `have hfnp : ∀ n x, 0 < f n x`, done by induction plus the `positivity` tactic — every later step leans on this fact.
  2. 第二步(数学):先把 $n=0$ 的情形彻底分情况做掉。$f_0(x)=8=2x$ 只有 $x=4$ 一个解。但更强的结论是:对所有 $x\ge 0$,$x<4 \Rightarrow 8>2x$,$x=4 \Rightarrow 8=2x$,$x>4 \Rightarrow 8<2x$。Lean 里这一步是 `induction` 的 `zero` 分支:先 `lt_trichotomy x 4` 把 $x$ 相对 4 分成三种情形,每种情形用 `linarith`(线性算术自动求解)完成不等式。Step 2 (math): handle $n=0$ completely by cases. $f_0(x)=8=2x$ has exactly one solution, $x=4$. The stronger fact we actually need: for every $x\ge 0$, $x<4\Rightarrow 8>2x$, $x=4\Rightarrow 8=2x$, $x>4\Rightarrow 8<2x$. In Lean this is the `zero` branch of the induction: `lt_trichotomy x 4` splits $x$ against 4 into exactly three cases, each closed with `linarith` (Lean's linear-arithmetic solver).
  3. 第三步(数学,归纳步):假设对第 $n$ 代已经成立——『$x<4$ 时 $f_n(x)$ 比 $2x$ 大;$x=4$ 时相等;$x>4$ 时更小』——要推出对第 $n+1$ 代也成立。核心计算:$\sqrt{4x^2}=2x$(因为 $x\ge 0$)。然后用单调性:$x>4$ 时,$x^2+3\cdot 4x>4x^2$(即 $x^2+12x>4x^2$ 对 $x>4$ 成立),所以 $x^2+6f_n(x)<x^2+12x<4x^2$,开方得 $f_{n+1}(x)<2x$;$x<4$ 时同理反向。Lean 里这一步是 `calc` 计算块串起三条不等式(`x^2+6f_n x < x^2+6(2x)` → 等于 `x^2+3(4x)` → 小于 `x^2+3(x^2)` → 等于 `4x^2`),再用 `Real.sqrt_lt_sqrt_iff_of_pos` 把『被开方数小』转成『开方后仍小』。Step 3 (math, the inductive step): assume for generation $n$ that 'below 4, $f_n$ beats $2x$; at 4, they tie; above 4, $f_n$ loses.' Show the same is true for generation $n+1$. The key computation is $\sqrt{4x^2}=2x$ (valid because $x\ge 0$). Then monotonicity of $\sqrt{\,\cdot\,}$: for $x>4$, $x^2+3\cdot 4x > 4x^2$ (i.e. $x^2+12x>4x^2$ holds once $x>4$), so $x^2+6f_n(x)<x^2+12x<4x^2$, hence $f_{n+1}(x)<2x$; the $x<4$ case mirrors this in reverse. In Lean this is a `calc` chain of three inequalities ($x^2+6f_n x < x^2+6(2x)$ $=x^2+3(4x)$ $<x^2+3(x^2)$ $=4x^2$) closed by `gcongr` at each step, then `Real.sqrt_lt_sqrt_iff_of_pos` to carry 'the radicand is smaller' over to 'the square root is smaller.'
  4. 第四步(数学):$x=4$ 的情形单独验证:$f_{n+1}(4)=\sqrt{16+6f_n(4)}=\sqrt{16+48}=8=2\cdot 4$,归纳假设保证 $f_n(4)=8$,所以相等永远保持。Lean 里这是 `grind [f]`(一个自动化 tactic 把代入 $x=4$ 的算术全部处理掉)。Step 4 (math): the $x=4$ case is checked directly: $f_{n+1}(4)=\sqrt{16+6f_n(4)}=\sqrt{16+48}=8=2\cdot 4$, using the inductive hypothesis that $f_n(4)=8$. In Lean this whole branch is one line: `grind [f]` (an automated tactic that expands $f$ at $x=4$ and does the arithmetic).
  5. 第五步(把结论讲清楚):三步合起来,对每个 $n$,方程 $f_n(x)=2x$ 的唯一实数解就是 $x=4$——不是『每多迭代一代就多一个解』,而是『迭代再多次,解集始终是单点 $\{4\}$』。这也是为什么 Lean 里 `solution_set n` 的定义就是 `{4}`,定理的陈述 `x ∈ solution_set n ↔ f n x = 2*x` 看起来几乎是把答案写进了题目里——整个难点全在证明,不在陈述。Step 5 (what the conclusion actually says): putting it together, for every $n$, the equation $f_n(x)=2x$ has exactly one real solution, $x=4$ — not 'one more solution each generation,' but 'the solution set is the single point $\{4\}$ no matter how many times you iterate.' This is why `solution_set n` is defined in Lean as simply `{4}`, and the theorem statement `x ∈ solution_set n ↔ f n x = 2*x` looks almost like the answer is written into the problem itself. All the difficulty lives in the proof, not the statement.
/-
Copyright (c) 2023 David Renshaw. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: David Renshaw
-/

import Mathlib.Tactic

/-!
# USA Mathematical Olympiad 1990, Problem 2

A sequence of functions {fₙ(x)} is defined recursively as follows:

                  f₀(x) = 8
                fₙ₊₁(x) = √(x² + 6fₙ(x)).

For each nonnegative integer n, find all real solutions of the equation

                  fₙ(x) = 2x.
-/

namespace Usa1990P2

noncomputable def f : ℕ → ℝ → ℝ
|     0, _ => 8
| n + 1, x => Real.sqrt (x^2 + 6 * f n x)

abbrev solution_set (n : ℕ) : Set ℝ := { 4 }

theorem usa1990_p2 (n : ℕ) (x : ℝ) : x ∈ solution_set n ↔ f n x = 2 * x := by
  -- based on solution from
  -- https://artofproblemsolving.com/wiki/index.php/1990_USAMO_Problems/Problem_2
  have hfnp : ∀ n x, 0 < f n x := fun n x ↦ by
    induction' n with n ih
    · norm_num [f]
    · unfold f
      positivity

  suffices H : ∀ x, 0 ≤ x → ((4 < x → f n x < 2 * x) ∧ (x = 4 → f n x = 2 * x) ∧
                     (x < 4 → 2 * x < f n x)) by grind
  induction n with
  | zero =>
    intro x hx5
    simp only [f]
    obtain h1 | rfl | h3 := lt_trichotomy x 4
    · exact ⟨fun h1' ↦ ((lt_asymm h1) h1').elim,
             fun h1' ↦ ((LT.lt.ne h1) h1').elim,
             fun _ ↦ by linarith only [h1]⟩
    · norm_num
    · exact ⟨fun _ ↦ by linarith only [h3],
             fun h1' ↦ by linarith,
             fun h1' ↦ by linarith⟩

  | succ n ih =>
    intro x hx5
    have h5 : Real.sqrt (4 * x^2) = 2 * x := by
        rw [show 4 * x^2 = (2 * x)^2 by ring]
        have h6 : 0 ≤ 2 * x := by positivity
        exact Real.sqrt_sq h6

    refine ⟨?_, ?_, ?_⟩
    · intro hx1
      have h2 : f n x < 2 * x := (ih x hx5).1 hx1
      have hc :=
        calc x ^ 2 + 6 * f n x < x ^ 2 + 6 * (2 * x) := by gcongr
             _ = x ^ 2 + 3 * (4 * x) := by ring
             _ < x ^ 2 + 3 * (x * x) := by gcongr
             _ = 4 * x^2 := by ring
      have hc' : Real.sqrt (x ^ 2 + 6 * f n x) < Real.sqrt (4 * x ^ 2) := by
        have h4 : 0 < 4 * x ^ 2 := by positivity
        exact (Real.sqrt_lt_sqrt_iff_of_pos h4).mpr hc
      rwa [h5] at hc'
    · grind [f]
    · intro hx1
      have h2 : 2 * x < f n x := (ih x hx5).2.2 hx1
      obtain rfl | hx6 := LE.le.eq_or_lt hx5
      · simp [hfnp]

      have hc :=
        calc 4 * x^2 = x ^ 2 + 3 * (x * x) := by ring
                   _ < x ^ 2 + 3 * (4 * x) := by gcongr
                   _ = x ^ 2 + 6 * (2 * x) := by ring
                   _ < x ^ 2 + 6 * f n x := by gcongr

      have hc' : Real.sqrt (4 * x ^ 2) < Real.sqrt (x ^ 2 + 6 * f n x) := by
        have h4 : 0 < x ^ 2 + 6 * f n x := by
          have := hfnp n x
          positivity
        exact (Real.sqrt_lt_sqrt_iff_of_pos h4).mpr hc
      rwa [h5] at hc'

end Usa1990P2

运行答案 ▶Run the solution ▶ 下载答案 .leanDownload solution .lean

人的思考A human's take

1990 USAMO Problems/Problem 2 (AoPS Wiki, Solution 2 by eevee9406) — AoPS Wiki(解法 2 署名 eevee9406)

AoPS 维基页面上这道题有两套解法。解法 1 更简洁:把递归关系改写成一个统一的形式,归纳地证明『$x<4$ 时 $f_n(x)>2x$、$x=4$ 时相等、$x>4$ 时更小』这三条不等式对所有 $n$ 同时成立,然后直接得出结论。解法 2(本文采用并对应到 Lean 证明的思路)更展开:先单独归纳证明 $f_n(x)>0$(对应 Lean 的 `hfnp`),再对 $n$ 归纳,把 $x\ge 0$ 的情况按 $x<4$、$x=4$、$x>4$ 三组分开处理,每组内部都用归纳假设把不等式方向从第 $n$ 代推到第 $n+1$ 代,最后对『假设 $x$ 是解但 $x\neq 4$』做反证——代入 $f_{n+1}(x)=2x$ 和归纳假设 $f_n(x)$ 的取值方向会推出 $x$ 必须同时满足两个矛盾的不等式。The AoPS wiki page carries two solutions. Solution 1 is more compact: rewrite the recursion so that a single induction proves, for all $n$ at once, that '$x<4\Rightarrow f_n(x)>2x$, $x=4\Rightarrow$ equality, $x>4\Rightarrow f_n(x)<2x$.' Solution 2 (the structure this write-up follows, and the one mirrored in the Lean proof) is more explicit: first prove $f_n(x)>0$ by its own standalone induction (Lean's `hfnp`), then induct on $n$ with the nonnegative $x$ cases split into $x<4$, $x=4$, $x>4$, each using the inductive hypothesis to carry the inequality's direction from generation $n$ to $n+1$, finishing with a contradiction check for any putative solution $x\neq 4$ — substituting $f_{n+1}(x)=2x$ together with the inductive hypothesis on $f_n(x)$'s direction forces two incompatible inequalities at once.

两套解法的共同核心,也是这道题真正巧妙的一点:『$f_n(x)$ 相对 $2x$ 的上下关系』和『$x$ 相对 4 的上下关系』,在每一代都严格保持同一个方向。这个『方向守恒』一旦看到,剩下的就是机械的归纳验证——数学上像是一个不动点定理的初等版:$x=4$ 是这个递归的唯一不动点,而且迭代过程『严格不偏离』这个不动点。The shared core of both solutions — and genuinely the only clever part of the problem — is that 'which side of $2x$ the function $f_n(x)$ lands on' and 'which side of 4 the number $x$ sits on' keep the same relationship in every single generation. Once you see that 'direction is conserved' across iterations, everything left is mechanical induction. It reads like an elementary version of a fixed-point fact: $x=4$ is the unique fixed point of this recursion, and the iteration process can never actually drift away from it.

AI 随想An AI's reflection

以下由 AI 撰写。Written by AI.

做这道题时最让人停下来的一刻,是发现『方向守恒』——不是数值在靠近,是『谁比谁大』这个关系本身,从第 $n$ 代原封不动地搬到了第 $n+1$ 代。这其实是个很有代表性的数学结构:很多递归方程的难点,不在于算出具体数值(数值往往是算不动的),而在于找到一个『不变的关系』,然后证明这个关系在递归每一步都保持。这里的不变关系就是 $x$ 相对 4 的位置,恰好等于 $f_n(x)$ 相对 $2x$ 的位置。一旦把这个关系说清楚,剩下的每一步都只是机械验证,而机械验证恰恰是 Lean 最擅长接过的部分——人负责说出『哪三个东西其实是一回事』,Lean 负责把每个不等式的不等号方向核对到位。这也是为什么这道题作为形式化练习特别合适:它不考验你算得有多快,考验的是你有没有看出那个『同一件事的两张面孔』。The moment that stops you mid-problem is noticing 'direction is conserved' — not that values converge, but that which-side-of-whom-lands-where carries over intact from generation $n$ to generation $n+1$. That's a structure worth recognizing: in a lot of recursive equations, the hard part is never computing the actual values (often impossible) — it's finding a relationship that stays true, and proving it survives one more round of recursion. Here the invariant is that where $x$ sits relative to 4 is exactly where $f_n(x)$ sits relative to $2x$. Once that relationship is stated plainly, every remaining step is mechanical checking — and mechanical checking is precisely the part Lean takes over well. The human's job is to see 'these two things are actually the same fact in two guises'; Lean's job is to make sure no inequality flips direction by accident. That's why this problem works so well as a formalization exercise: it tests whether you spot the invariant, not how fast you can do arithmetic.

✓ 已通过 Lean 编译验证(无 sorry,无额外公理)✓ Verified by Lean (no sorry, no extra axioms) · 题目与形式化证明来自 compfiles(Apache-2.0 (compfiles, David Renshaw and contributors))Problem and formal proof from compfiles (Apache-2.0 (compfiles, David Renshaw and contributors)) · Lean v4.35.0 · Mathlib 56a0058

程序员随想A Programmer's Reflections

哲学与生活Philosophy & Life

工具角Tools Corner