[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"report-2026-05-21":3,"U72bQfuGsO":629,"RK3XULo90X":644,"EwIAleDuoP":654,"fVNMlCDuhm":664,"UAoyHn1SYW":674,"KwiVt37YoI":822,"f0FaImkdlq":833,"tr3mz5agU9":844,"ouzSJG6QYR":870,"p7G3LKt7XB":905,"ViEYi5Cinf":1026,"0FvkQHYoEn":1048,"mhbZMwXaMB":1069,"eUfsNPQ3CQ":1086,"o6FVzkWN3d":1096,"HCHQ4RXn8J":1106,"VgueLa5Blr":1116,"M4nn4llXdO":1126,"gnAL0pBGlt":1136,"VZNnZXJNVU":1146,"SJNMwXMNjh":1245,"ZLcKT1lZK5":1296,"xxbvEKIjzo":1332,"zpQ4xB3dOH":1383,"kW50eEblWe":1393,"wAu1z5K9ZY":1403,"7rCh7aJHCs":1413,"w5aqHyLL9J":1423,"CDsTvrJiL2":1433,"tFfvSCSkLd":1443,"RX4QbtOBJJ":1453,"jwLDT0wPLS":1463,"6uVJtYXv3R":1473,"X3Z6mj3nNI":1587,"6KrNrqDi5r":1598,"ITWvsEw5z3":1614,"TTOfIrfcDb":1630,"AQcCBRjFVW":1661,"IAFT4g7Suf":1781,"GCQiqqsH60":1808,"NV6Qgd87Xa":1829,"pReioQRTE9":1850,"50hrXv4Z1a":1860,"miuP6j6Ujl":1870,"A6xz1lkSV3":1880,"X8pTfMF70z":1890,"kyayZmvNbQ":1900,"MSkXmvGnHv":1910,"Og4oBf9LP8":2023,"9kkAgxSGmd":2074,"OKmBVuDYYf":2090,"xxPmRXJsdS":2124,"79sxk4iMca":2159,"xx7nR20ui2":2210,"yjYYhw9Q23":2220,"qo39wB8ICQ":2230,"oe7op2F6BS":2240,"eC2wP8fGyO":2250,"R09BaTPhb6":2260,"3F2OfY0EE5":2270,"dXwFbaax5A":2280,"FeDc9mWZ9a":2290,"18jE8BToL3":2353,"sHbQvwhUJW":2363,"OBaMiGmgIS":2373,"HvR29w73lB":2407,"Z9YQbqoBNF":2473,"InE9TD8sFe":2492,"gcm32vibfd":2502,"81EAUMS9Qi":2563,"4KaeKeiBY1":2587,"mV4do3kFJF":2603,"6NjUWzbzb7":2656,"mBxjZ4WCiO":2702,"YkP25Ii05b":2736,"461yCwOwKs":2770,"ebnDuQYXiR":2834,"WCYmpKtu4y":2844,"uAxMmRYrw2":2854,"bPt1Ojc6pJ":2904,"tAOTsFOepA":2952,"M0ZggtEPqS":2962,"13BsA50Vaz":2972,"I7ad9RuTXx":3024,"0wIuLhwDtJ":3040,"KFBGHxOsAq":3056,"YYgCbJPR1I":3125,"15Hzw5DqIG":3135,"KhBnsPz3C9":3145,"KxUhZJnbbh":3184,"2Lf72KseTQ":3328,"8VGexcugIC":3349,"8R3a0ybCnx":3756},{"report":4,"adjacent":627},{"version":5,"date":6,"title":7,"sources":8,"hook":19,"deepDives":20,"quickBites":344,"communityOverview":608,"dailyActions":609,"outro":626},"20260216.0","2026-05-21","AI 趨勢日報：2026-05-21",[9,10,11,12,13,14,15,16,17,18],"alibaba","anthropic","community","deepseek","github","huggingface","meta","nvidia","openai","stability","AI 今日同時宣告三件事：能解千年幾何難題、能創造企業獲利、能以月費 £18 替代 £200 的前沿訂閱——但 GitHub 供應鏈漏洞提醒，每次工具普及都會同步放大攻擊面。",[21,104,172,246],{"category":22,"source":17,"title":23,"subtitle":24,"publishDate":6,"tier1Source":25,"supplementSources":28,"tldr":45,"context":57,"mechanics":58,"benchmark":59,"useCases":60,"engineerLens":68,"businessLens":69,"devilsAdvocate":70,"community":73,"hypeScore":91,"hypeMax":92,"adoptionAdvice":93,"actionItems":94},"tech","OpenAI 模型推翻離散幾何核心猜想：AI 數學推理的里程碑","近 80 年無人突破的 Erdős 單位距離問題，被 AI 以代數數論工具自主反證",{"name":26,"url":27},"OpenAI","https://openai.com/index/model-disproves-discrete-geometry-conjecture/",[29,33,37,41],{"name":30,"url":31,"detail":32},"TechCrunch","https://techcrunch.com/2026/05/20/openai-claims-it-solved-an-80-year-old-math-problem-for-real-this-time/","對比 2025 年 10 月 Kevin Weil 烏龍事件，分析此次結果的可信度差異",{"name":34,"url":35,"detail":36},"OpenAI PDF：Remarks on the Disproof of the Unit Distance Conjecture","https://cdn.openai.com/pdf/74c24085-19b0-4534-9c90-465b8e29ad73/unit-distance-remarks.pdf","可供人工閱讀的技術論文，涵蓋完整數學論證",{"name":38,"url":39,"detail":40},"Hacker News 討論串","https://news.ycombinator.com/item?id=48212493","社群對 AI 真正原創性與高階搜尋的爭辯，含 doginasuit 等用戶的質疑聲音",{"name":42,"url":43,"detail":44},"Interesting Engineering","https://interestingengineering.com/ai-robotics/openai-paul-erdos-geometry-problem-cracked","技術細節補充，聚焦無限類域塔與 Golod–Shafarevich 理論的應用背景",{"tagline":46,"points":47},"AI 首次自主走上反證路徑，顛覆了近 80 年無人突破的幾何猜想",[48,51,54],{"label":49,"text":50},"技術","OpenAI 內部通用推理模型以代數數論工具（無限類域塔 + Golod–Shafarevich 理論）自主構造反例，n 個點可產生 n^(1+δ) 對單位距離，突破傳統格點上界。",{"label":52,"text":53},"成本","整個反證由模型獨立完成，無人工逐步引導，但外部工程師目前無法存取此內部模型；社群對「真正原創」還是「高階文獻串連」仍有爭議。",{"label":55,"text":56},"落地","Tim Gowers(Fields Medal) 、Noga Alon、Melanie Wood 等頂尖數學家已背書認可，但短期內此結果難以直接轉化為商業工具，宜追蹤整體趨勢。","#### 離散幾何的世紀猜想與 AI 的反證\n\n1946 年，匈牙利數學家 Paul Erdős 提出「平面單位距離問題」：在平面上放 n 個點，最多能有多少對點之間的距離恰好為 1？近 80 年來，數學界普遍相信正方格點陣列 (square grid) 是最優構造，沒有任何方法能突破其上界。\n\n2026 年 5 月 20 日，OpenAI 宣布旗下一個內部通用推理模型**自主反證**了這一猜想，找到一族全新構造，使得 n 個點可產生至少 n^(1+δ) （δ 為某固定正指數）對單位距離，遠遠超越傳統格點上界。此結果通過外部同行評審，Noga Alon、Melanie Wood、Thomas Bloom 等頂尖數學家均公開背書認可。\n\n值得一提的歷史背景：2025 年 10 月，OpenAI 前 VP Kevin Weil 曾誤稱 GPT-5 解決了 10 道 Erdős 開放問題，遭 Yann LeCun、Demis Hassabis 等人批評後刪文。而這次背書認可的數學家，正是當初提出批評的那些人，這讓本次結果的可信度格外突出。\n\n#### o3-mini 如何找到反例：技術細節拆解\n\n模型突破的核心在於放棄傳統的高斯整數 (Gaussian integers) 框架，轉而採用代數數論的複雜數域推廣。傳統做法在高斯整數環內尋找具有特定單位距離性質的點集，但其對稱性不足，難以突破線性上界。\n\n模型採用的關鍵工具是**無限類域塔 (infinite class field towers)**：透過構造一系列巢狀的數域擴張，讓底層代數結構具備更豐富的對稱性，從而製造出遠多於格點的單位長度差值對。\n\n第二個核心工具是**Golod–Shafarevich 理論**，用以嚴格保證所需的無限類域塔確實存在，為整個反證提供數學嚴格性。整個解題過程由模型獨立完成：問題敘述由人工輸入，但無任何逐步引導或半完成草稿，模型直接產出可供人工閱讀的完整論文。\n\n數學家 trostaft（HN，數學博士後）評述：這個證明確實受文獻既有結果啟發，但其中的調整是不平凡的 (non-trivial) 。\n\n> **名詞解釋**\n> 高斯整數：複數平面上實部與虛部皆為整數的數（如 3+4i），是數論中研究整除性的基本代數結構，也是傳統單位距離問題的標準代數背景。\n\n#### 數學界的反應：興奮與質疑並存\n\nFields Medal 得主 Tim Gowers 將此成果稱為「AI 數學領域的一個里程碑」，數論學家 Arul Shankar 指出此結果證明 AI 能夠「產生真正原創的想法」。\n\nThomas Bloom 則進一步指出，這一發現暗示「深層數論可能對離散幾何中若干未解問題提供解答」，為後續研究開拓了新方向。\n\n然而，Hacker News 討論串中的質疑同樣清晰。用戶 mooreat 認為這本質上是「找到一個反例」而非「發展新的深層數學」，模型執行的可能是「把現有想法串連起來的高階搜尋」。\n\n用戶 isotypic 擔憂數學家未來將淪為「讀取存在於 LLM 權重中的幽靈教科書的讀者」，數學實踐退化為提示詞工程。對於「自 2023 年以來 AI 推理品質提升都只靠更多算力」的懷疑，社群也並未完全打消。\n\n#### AI 輔助數學研究的未來走向\n\n此次成果最重要的意義，可能不在於「AI 解決了難題」，而在於**AI 採取了逆向路徑**——大多數人類數學家把研究資源投入在正面構造，而模型卻獨立走向了反證方向，並從代數數論中找到了支撐工具。\n\nHN 用戶 horhay 提供了較為平衡的視角：這件事確實了不起，但並不超出 AI 近期在數學領域成功模式的範圍，不需要敲響警報——真正的份量在於結果本身的事實重量，而非對 AI 能力的誇大解讀。\n\n這一框架提示我們：AI 輔助數學研究可能最先在「反例搜尋」和「跨領域工具遷移」兩個場景中發揮作用，而不是在「從零構建全新理論」上。","OpenAI 這次反證的核心技術突破，在於模型主動跨越了近 80 年數學研究的「思維定式」——放棄高斯整數框架，轉向代數數論的複雜數域推廣。傳統方法礙於高斯整數的對稱性限制，無法突破格點上界；而新方法透過構造具有更豐富代數結構的數域，讓「製造單位距離對」這件事在更深層的代數空間中得以實現。\n\n#### 機制 1：用複雜數域取代高斯整數\n\n高斯整數（形如 a+bi 的複數）是傳統單位距離問題的標準代數背景，其對稱群相對簡單。模型選擇的替代方案是代數數域的推廣：在這些更複雜的數域中，同一個「長度為 1」的條件對應到更多不同的代數元素對，從而能構造出密度更高的單位距離點集。\n\n#### 機制 2：無限類域塔提供可無限擴張的代數結構\n\n無限類域塔是一系列巢狀的數域擴張鏈，每個擴張都在前一層基礎上添加新的代數對稱性。模型利用這個工具，在每一層數域中都能找到更多滿足單位距離條件的點對，累積效應使整體點對數突破了傳統格點的多項式上界，達到 n^(1+δ) 。\n\n> **名詞解釋**\n> 無限類域塔：代數數論中一種特殊的數域擴張序列，由 Golod 與 Shafarevich 在 1964 年證明其存在，最初用於解決 Burnside 問題的一般情形。\n\n#### 機制 3：Golod–Shafarevich 理論嚴格保證存在性\n\n即使找到了一個構造方向，數學嚴格性要求必須**證明**這樣的無限類域塔確實存在。Golod–Shafarevich 定理（1964 年）在代數 K 理論框架下，以群展示的生成元與關係子數量關係，嚴格確保某類數域上的無限類域塔存在性，為整個反證提供最後的保障。\n\n> **白話比喻**\n> 想像傳統數學家在一個 8×8 棋盤上找「距離恰好 1」的棋子對，而模型在一個「多層棋盤疊加體」上操作——每層棋盤之間有規律的代數對應關係，讓「距離 1」的對數在每層累積，最終突破了只在單一棋盤上能達到的上限。","#### 與既有 AI 數學成果對比\n\n過去 AI 在數學上的突破多屬於「已知答案的搜尋最佳化」（如 AlphaProof 在 IMO 問題上的表現）或「形式化驗證輔助」。此次反證的特殊之處在於：問題已開放近 80 年，且此前數學界在正面方向投入大量研究卻未能突破，AI 卻從反方向自主找到路徑。\n\n若以「獨立性」和「問題年齡」衡量，此次成果是迄今為止 AI 在基礎數學研究中最具分量的單一結果，優於 2025 年 AlphaProof 在 IMO 競賽題上的表現——後者為有明確答案的競賽題，而非持續 80 年的開放猜想。",{"recommended":61,"avoid":65},[62,63,64],"AI 輔助數學反例搜尋：對已有長期未被反證的猜想，使用推理模型從代數和組合角度探索反例構造路徑","跨領域工具識別：讓 AI 掃描不同數學分支（如代數數論、組合幾何）中可遷移的工具，發現人類研究者通常不會主動尋找的跨領域連接","數學文獻綜述與假設生成：在確定研究方向前，用推理模型系統性整理現有文獻並生成新假設路徑",[66,67],"需要全新定理構建的深層理論突破：目前 AI 仍依賴既有文獻工具，無法從零構建全新的數學框架","對可靠性要求極高的工業應用數學：AI 數學輸出仍需外部同行評審，不可直接用於工程或安全關鍵計算","#### 環境需求\n\n此次成果屬於 OpenAI 內部通用推理模型，外部工程師目前無法直接存取。最接近的公開可用工具是 o3、o4-mini(OpenAI) 或 Claude Opus(Anthropic) 等推理型模型；若需形式化驗證，可搭配 Lean 4 或 Coq。\n\n#### 最小 PoC\n\n```python\nimport anthropic\n\nclient = anthropic.Anthropic()\nresp = client.messages.create(\n    model=\"claude-opus-4-7\",\n    max_tokens=8192,\n    messages=[{\n        \"role\": \"user\",\n        \"content\": \"Explore algebraic number theory to disprove the unit distance conjecture. Focus on number fields beyond Gaussian integers.\"\n    }]\n)\nprint(resp.content[0].text)\n```\n\n#### 驗測規劃\n\n對 AI 數學研究輔助工具的評估，應聚焦於「模型能否識別正確的研究方向」，而非直接驗證數學命題的正確性。建議先提供一個已知有反例的簡單組合問題，觀察模型是否能自主找到反例路徑。\n\n#### 常見陷阱\n\n- 模型可能產生「看似合理但實際錯誤」的數學論述，所有代數推導需人工或形式化工具驗證\n- 大型語言模型在符號計算上容易出錯，不可直接信任數值或代數推導結果\n\n#### 上線檢核清單\n\n- 觀測：產出論證是否有完整的前提假設鏈；引用文獻是否真實存在（防止幻覺）\n- 成本：數學研究輔助屬高 token 消耗場景，搭配 extended thinking 的 API 呼叫費用可能顯著，需評估批次處理策略\n- 風險：未經同行評審的 AI 數學輸出不得直接發表或引用，必須透過外部數學家驗證","#### 競爭版圖\n\n- **直接競品**：DeepMind AlphaProof（專注形式化數學）、Wolfram Alpha（符號計算）、Lean/Coq 形式化驗證工具\n- **間接競品**：通用推理模型（Gemini 2.5、Claude Opus）在數學助理場景的應用\n\n#### 護城河類型\n\n- **工程護城河**：OpenAI 此次使用的是內部通用推理模型而非特化數學模型，暗示其基礎推理能力已延伸至數學基礎研究，形成差距\n- **生態護城河**：與 Tim Gowers、Thomas Bloom 等頂尖數學家建立的公信力合作關係，為未來 AI 數學研究背書提供可信度基礎\n\n#### 定價策略\n\n目前 OpenAI 未宣布針對數學研究的專屬產品定價，成果以技術論文形式公開發布。但此類突破性成果是強力品牌資產，可支撐 o-series 推理模型在高端研究場景的定價溢價。\n\n#### 企業導入阻力\n\n- 外部無法存取此次使用的內部模型，難以直接複現效果\n- 數學研究界的信任建立需要長期積累，單一成果不足以改變研究機構的工作流程\n\n#### 第二序影響\n\n- 若 AI 能系統性解決開放猜想，學術發表流程和同行評審機制將面臨根本性重構\n- 數學訓練資料和教育體系可能被倒逼重新設計，「找到反例」類型問題的研究方法論將改變\n\n#### 判決里程碑確立（但短期難以複現與商業化）\n\nAI 在數學基礎研究的里程碑意義已確立，但距離系統性輔助工具的商業成熟仍有相當距離。對大多數組織而言，正確態度是持續追蹤整體趨勢，而非立即投入資源部署。",[71,72],"模型執行的可能是高階文獻串連搜尋，而非真正的數學直覺創造——此次反證所用的代數工具 (Golod–Shafarevich) 早已存在文獻中，模型是否「理解」了數學，還是只是把既有工具以統計方式組合在一起，仍是未解的哲學問題。","外部無法驗證此次使用的內部模型能力，OpenAI 有商業動機誇大 AI 的獨立性貢獻——在 2025 年 Kevin Weil 烏龍事件的陰影下，即使頂尖數學家背書，整個敘事框架仍由 OpenAI 掌控，難以完全排除公關操作的成分。",[74,78,81,85,88],{"platform":75,"user":76,"quote":77},"Hacker News","horhay（HN 用戶）","這件事很了不起，它並不超出 AI 近期在數學領域成功模式的範圍，但正因如此，人們不應敲響警報——這個成果的分量在於事實本身的重量，而非誇大解讀。",{"platform":75,"user":79,"quote":80},"doginasuit（HN 用戶）","自 2023 年以來，我們沒有看到大型語言模型的輸出品質有顯著提升，除非是投入更多算力的結果。AI「推理」不過是遞迴迭代自身輸出，每次改進都在遞減。",{"platform":82,"user":83,"quote":84},"Bluesky","timkellogg.me（Tim Kellogg，35 likes）","一個通用（沒有特殊化）的 OpenAI 內部模型解決了離散幾何中最著名的未解問題之一。這個解法涉及的決策數量遠超出任何人類可行的探索範圍。",{"platform":75,"user":86,"quote":87},"dev1ycan（HN 用戶）","我不會感到驚訝，如果他們只是在付錢給數學天才做研究，然後把功勞歸給 AI 模型。",{"platform":75,"user":89,"quote":90},"dmix（HN 用戶）","如果真的有人懷疑這是 OpenAI 暗中資助數學研究再偽裝成 AI 成果的陰謀，他們等於是在說 OpenAI 說服了多位頂尖數學家一起造假——這個解釋比「AI 確實解了題」更難讓人相信。",4,5,"追整體趨勢",[95,98,101],{"type":96,"text":97},"Try","用 o3、o4-mini 或 Claude Opus 向模型提出你所在領域的一個已知開放問題，觀察它是否能自主識別反證方向或跨領域工具",{"type":99,"text":100},"Build","設計「AI 生成猜測路徑 + Lean 4 形式化驗證」的混合流程，探索在你的研究或工程問題中自動化反例搜尋",{"type":102,"text":103},"Watch","追蹤 Tim Gowers 的後續評論、OpenAI 是否開放此次使用的推理模型，以及 DeepMind AlphaProof 的對標進展",{"category":105,"source":10,"title":106,"subtitle":107,"publishDate":6,"tier1Source":108,"supplementSources":111,"tldr":116,"context":128,"teamAndTech":129,"dealAnalysis":130,"marketLandscape":131,"risks":132,"devilsAdvocate":143,"community":146,"hypeScore":91,"hypeMax":92,"adoptionAdvice":164,"actionItems":165},"funding","Anthropic 即將迎來首個獲利季，月付 xAI 12.5 億美元買算力","首季營業獲利 5.59 億美元，卻同步簽下四年 400 億美元的算力對賭",{"name":109,"url":110},"TechCrunch：Anthropic says it's about to have its first profitable quarter","https://techcrunch.com/2026/05/20/anthropic-says-its-about-to-have-its-first-profitable-quarter/",[112],{"name":113,"url":114,"detail":115},"TechCrunch：Anthropic will pay xAI $1.25B per month for compute","https://techcrunch.com/2026/05/20/anthropic-will-pay-xai-1-25-billion-per-month-for-compute/","SpaceX S-1 SEC 申報文件揭露 Anthropic 與 xAI 的算力採購合約細節，包括月付金額、合約期限與雙方終止條款",{"tagline":117,"points":118},"首季獲利 5.59 億美元，但每月燒掉 12.5 億美元買算力——AI 商業化的真正考驗才剛開始",[119,122,125],{"label":120,"text":121},"融資","Q2 2026 預估營收約 109 億美元，較上季翻倍，預計實現 5.59 億美元首季營業獲利，但 Anthropic 警示全年獲利能力仍存在不確定性。",{"label":123,"text":124},"算力","與 xAI 簽訂月付 12.5 億美元算力採購合約，包下田納西州孟菲斯 Colossus 1 資料中心全部 300MW 輸出，合約效期至 2029 年 5 月，總金額逾 400 億美元。",{"label":126,"text":127},"市場","向競爭對手 xAI 採購算力折射 AI 算力極度稀缺，與 OpenAI 預期 IPO 時程重疊，標誌頂級 AI 實驗室進入「競合」商業新常態。","#### 首季獲利：Anthropic 營收翻倍至 109 億美元\n\nAnthropic 向最新融資輪投資人揭露的財務預測顯示，公司預計在 2026 年第二季實現營業獲利，Q2 預估營收約為 109 億美元，較上一季翻倍以上成長。\n\n這是 Anthropic 自 2021 年創立以來首次觸及獲利門檻，預計 Q2 營業利潤約為 5.59 億美元，從先前投資人文件中「全年不獲利」的預期發生重大轉變。\n\n然而 Anthropic 同時警示，由於高額算力成本，全年獲利能力仍存在不確定性——即便單季獲利，不代表商業模式已完全建立。此消息由 Wall Street Journal 首先報導，Anthropic 被詢問時拒絕進一步置評。\n\n#### 月付 12.5 億美元：與 xAI 的算力交易始末\n\n2026 年 5 月，SpaceX 提交 S-1 SEC 申報文件時意外揭露一項震驚業界的合約：Anthropic 與 Elon Musk 旗下的 xAI 達成龐大算力採購協議，每月支付高達 12.5 億美元，合約效期至 2029 年 5 月，總合約金額逾 400 億美元。\n\nxAI 提供的是位於田納西州孟菲斯的 Colossus 1 資料中心，Anthropic 一口氣包下該設施全部 300 百萬瓦的算力輸出。此交易的背景是 xAI 自家 Grok 用戶參與度下滑，導致閒置算力有餘裕可對外出售——xAI 自身將此定義為「將我們基礎設施的閒置算力貨幣化」。\n\n合約設有靈活的退出機制：雙方均可提前 90 天通知終止。xAI 也表示預期將與其他廠商簽署類似的服務合約，顯示其正在將算力出租轉型為常態業務。\n\n#### 從燒錢到獲利：AI 新創商業模式轉捩點\n\nAnthropic 能走向獲利，關鍵在於客戶結構的多元化擴張。公司近期推出面向小企業主的專屬服務，並針對律師事務所等專業族群導入垂直工具，Claude 在企業專業人士中的採用率顯著提升。\n\n這印證了一個長期備受爭議的命題：大型語言模型的推論本身可以有正毛利，真正拖累財務的是訓練成本與研發投入。當企業客戶願意為生產力工具付出溢價，且模型服務邊際成本持續下降，獲利路徑便逐漸清晰。\n\n> **名詞解釋**\n> ARR（年化經常性收入）：將當季或當月訂閱收入乘以 12，用來衡量訂閱制業務的規模；不代表實際全年收入，但常作為投資人評估成長動能的指標。\n\n#### 對產業競爭格局的連鎖效應\n\n此消息曝光的時間點恰與 OpenAI 預期於 2026 年 9 月申請 IPO 高度重疊，兩家頂級 AI 實驗室同時走向「商業成熟」里程碑，標誌著 AI 新創從燒錢擴張轉向獲利導向的結構性拐點。\n\n更引人注目的是，Anthropic 選擇向直接競爭對手 xAI 採購算力，而非自建或仰賴傳統雲端供應商。這折射出當前 AI 算力市場的極度稀缺：即便存在競爭關係，業者也必須跨越邊界尋求務實合作。\n\n這種「競合」模式或許將成為頂級 AI 實驗室的新常態——在訓練與產品層面激烈競爭，卻在基礎設施層面共享稀缺資源。","#### 核心團隊\n\nCEO Dario Amodei 與總裁 Daniela Amodei 均為前 OpenAI 核心成員，兩人率領超過千名員工的研究與工程團隊。公司以「負責任的 AI 開發」為核心使命，同時快速推進商業化。\n\n#### 技術壁壘\n\nClaude 系列模型（Sonnet、Opus、Haiku）在程式撰寫、長文脈推理等多項基準測試中位居前列。Anthropic 自主研發 Constitutional AI 訓練方法，並在企業合規場景中積累了差異化的客戶信任。\n\n> **名詞解釋**\n> Constitutional AI：Anthropic 開發的一種訓練方法，透過讓模型依據一套「憲法」原則自我批評與修正，以減少有害輸出，不需要大量人工標注。\n\n#### 技術成熟度\n\nClaude 3.5／4 系列已進入 GA（正式可用）階段，API 大規模商業化部署。Dario Amodei 曾公開表示推論毛利率已超過 50%，意味著模型服務本身具備盈利能力，主要成本壓力來自持續訓練與研發投入。","#### 融資結構\n\n此筆並非傳統股權融資，而是一份算力採購合約。Anthropic 與 xAI 簽訂月付 12.5 億美元的算力購買協議，合約效期至 2029 年 5 月，總合約金額逾 400 億美元。雙方均可提前 90 天通知對方終止合約。\n\n#### 估值邏輯\n\n以 Q2 2026 預估營收 109 億美元換算，年化約達 436 億美元 ARR。若能維持成長動能，Anthropic 當前市場估值相對於 ARR 的倍數將大幅壓縮，對後期機構投資人而言估值吸引力提升。\n\n#### 資金用途\n\n算力採購是 Anthropic 當前最大的支出項目之一。400 億美元的 xAI 合約顯示公司正在以外購算力的方式支撐持續成長的企業客戶推論需求，同時規避自建資料中心的鉅額前期資本支出。","#### 競爭版圖\n\n- **直接競品**：OpenAI（預期 2026 年 9 月 IPO，旗下 ChatGPT 仍是市場最大入口）、Google DeepMind（Gemini 系列深度整合 Workspace）\n- **間接競品**：Mistral（歐洲開源路線）、Meta LLaMA 開源生態、Microsoft Azure AI（以 OpenAI 模型為主力）\n\n#### 市場規模\n\n企業 AI 助理與工作流程自動化市場預估至 2028 年達數千億美元規模。Anthropic 進軍小企業主與律師事務所等垂直場景，正在開拓此前未被充分服務的長尾企業市場。\n\n#### 差異化定位\n\nAnthropic 以「安全優先」品牌形象打入企業市場，Claude 的長文脈處理能力（最高 200K tokens）及相對較低的幻覺率，成為法律、金融等高合規要求場景的優先選擇，與 OpenAI 的消費者導向形成明顯區隔。",[133,137,140],{"label":134,"color":135,"markdown":136},"算力依賴風險","red","400 億美元的 xAI 算力合約使 Anthropic 的服務連續性與競爭對手高度綁定。若 Colossus 1 設施出現運維問題、或 xAI 決定優先供應自家 Grok 需求，Anthropic 的企業客戶將首當其衝。儘管合約設有 90 天終止條款，替換如此大規模的算力供應在現實中極為困難。",{"label":138,"color":135,"markdown":139},"全年獲利不確定性","Anthropic 明確警示：單季獲利不代表全年獲利能力已確立。訓練下一代模型的鉅額資本支出，加上每月 12.5 億美元的固定算力成本，仍可能使年度財務重返虧損。如 Bill Gurley 所指出，若推論服務以低於成本的價格銷售只是為拉抬帳面營收，獲利品質將大打折扣。",{"label":141,"color":135,"markdown":142},"競合模式的策略風險","向直接競爭對手採購核心基礎設施資源，在商業史上充滿變數。xAI 作為 Colossus 算力的主要提供方握有合約終止的主動權；一旦雙方產品競爭加劇，這份合約可能在談判桌上成為 Anthropic 的弱點。此外，企業客戶也可能因算力供應商身份疑慮而降低採購意願。",[144,145],"獲利數字來自公司向投資人揭露的財務預測，而非經稽核的公開財報；在 IPO 或上市前，這類數字存在被美化的動機，實際結果可能出現落差。","月付 12.5 億美元的算力合約意味著即便單季獲利，現金流壓力依然極大；400 億美元的總合約義務一旦營收成長放緩，將立刻轉化為生死存亡的財務危機。",[147,151,154,158,161],{"platform":148,"user":149,"quote":150},"X","@wallstengine（X 用戶）","ANTHROPIC Q2 年化營收將翻倍至 109 億美元。公司預計繳出首季營業獲利，Q2 營業利潤預計為 5.59 億美元。這與先前投資人文件中 Anthropic 預期全年不獲利的說法相比，是重大轉變。",{"platform":148,"user":152,"quote":153},"@bgurley（Bill Gurley，Benchmark Capital 普通合夥人）","這類分析應以毛利而非營收作為基準。我們都同意這是 token 經濟——這些公司既買 token 也賣 token。1999 年我們說的是用 0.85 美元賣 1 美元。以低於成本的價格轉售 NVIDIA token 是拉抬帳面營收的捷徑。情況很複雜。",{"platform":155,"user":156,"quote":157},"HN","this_user（HN 用戶）","Anthropic 顯然從去年就開始朝這個方向努力——他們更專注於在模型周邊打造可貨幣化的產品，而非繼續競爭最先進的聊天機器人。這是進軍企業市場的更大策略一環，因為錢在企業端，不在補貼給消費者的訂閱方案裡。市場想看到的正是這個：一條可信的獲利路徑。",{"platform":82,"user":159,"quote":160},"edzitron.com（Ed Zitron，304 upvotes）","這篇報導有一個重要觀點：Anthropic 和 OpenAI 未來四年需要籌措或賺取 1.25 兆美元才能履行算力合約義務。目前尚不清楚這如何實現，因為兩家公司都仍在虧損，且都沒有明確的獲利路徑。",{"platform":155,"user":162,"quote":163},"aurareturn（HN 用戶）","我個人不擔心短期獲利問題。如果 Anthropic 每個月新增 150 億美元 ARR，而且毛利率超過 50%（Dario 本人說的），獲利是必然結果。我最擔心的是 SpaceX 將 X.com 和 xAI 捆綁在一起——我不想讓錢跟著 Elon 的情緒起伏。","先觀望",[166,168,170],{"type":96,"text":167},"評估 Claude API 企業方案，特別是針對法律、金融等高合規需求場景的垂直套件，趁定價尚未因獲利壓力而調漲前建立使用基礎。",{"type":99,"text":169},"若正在規劃 AI 應用產品，可研究 Anthropic 的小企業工具定價策略——從消費者訂閱轉向企業垂直化，是本輪獲利的核心驅動力，值得借鑒。",{"type":102,"text":171},"追蹤 Anthropic 全年獲利能力的後續財務揭露，以及 xAI Colossus 擴建進展；若算力供應緊張緩解，Claude API 定價可能出現波動。",{"category":173,"source":12,"title":174,"subtitle":175,"publishDate":6,"tier1Source":176,"supplementSources":179,"tldr":196,"context":206,"mechanics":207,"benchmark":208,"useCases":209,"engineerLens":218,"businessLens":219,"devilsAdvocate":220,"community":223,"hypeScore":91,"hypeMax":92,"adoptionAdvice":164,"actionItems":239},"ecosystem","Deepseek Code 正式組隊：挑戰 Claude Code 與 Codex 的開源野心","從模型研究組織到 Coding Agent 產品公司，Harness 架構如何重新定義開發者工具競爭格局",{"name":177,"url":178},"The Decoder","https://the-decoder.com/deepseek-wants-to-take-on-claude-code-and-openais-codex-with-deepseek-code/",[180,184,188,192],{"name":181,"url":182,"detail":183},"Deli Chen on X（原始招募公告）","https://x.com/victor207755822/status/2057064415300841626","Deepseek 研究員 Deli Chen 發布的 Harness 團隊招募公告，24 小時獲得 18.8 萬次瀏覽",{"name":185,"url":186,"detail":187},"SCMP：DeepSeek 招募前 Jane Street 工程師","https://www.scmp.com/tech/big-tech/article/3354113/deepseek-recruits-former-jane-street-engineer-catch-ai-agents-revenue-race","報導 Deepseek 3 月招募 Cui Tianyi 加入 Harness 團隊，顯示佈局早於公告曝光",{"name":189,"url":190,"detail":191},"Bloomberg：DeepSeek 發布新一批 Agentic AI 職缺","https://www.bloomberg.com/news/articles/2026-03-24/deepseek-s-latest-job-postings-highlight-pivot-to-agentic-ai","Bloomberg 確認 Deepseek 明確轉向 agentic AI 產品賽道",{"name":193,"url":194,"detail":195},"Digg：DeepSeek 在北京成立新 Harness 團隊","https://digg.com/ai/e50x2f7r","Digg 報導 Harness 團隊定位與競爭背景概述",{"tagline":197,"points":198},"Harness = Agent 基礎設施，Deepseek 正將成本優勢轉化為 Coding Agent 產品野心",[199,202,204],{"label":200,"text":201},"生態","Deepseek 在北京組建 Harness 新團隊，直接對標 Claude Code 與 Codex 的完整技術棧：agent loops、MCP、multi-agent systems、context engineering，以競品重度用戶作為招募篩選條件。",{"label":52,"text":203},"Deepseek V4-Flash API 成本僅 Claude Opus 的 1/107，已讓開發者自發組裝低成本 coding agent，月費從 £200 降至 £18 的實例已有社群驗證。",{"label":55,"text":205},"Deepseek Code 產品尚在籌備階段，開源策略未定，IDE 整合能力尚缺，企業導入阻力存在，短期觀望為宜。","#### Deepseek Code 的北京新團隊與產品定位\n\n2026 年 5 月 19 日，Deepseek 研究員 Deli Chen 在 X 平台發布招募公告，宣布成立全新「Harness」團隊，任務是從零打造代號「Deepseek Code」的 coding agent 產品。公告在 24 小時內獲得超過 18.8 萬次瀏覽。\n\n職缺分為兩類：Harness 產品經理與 R&D 工程師，要求應聘者具備深度使用 Claude Code、Cursor、Codex、GitHub Copilot 的實戰經驗。以競品重度用戶作為招募篩選條件，是業界罕見的公開對標宣言。\n\n這不是臨時性招募。2026 年 3 月，Deepseek 已悄悄招募前 Jane Street 工程師 Cui Tianyi 加入 Harness 團隊，顯示相關佈局早在招募公告曝光前六週便已啟動，彰顯其戰略縱深。\n\nDeeseek 將「Harness」定義為模型之外的一切：tool use（工具調用）、planning（規劃）、memory（記憶），以及讓這一切協作的 agentic loop 基礎設施。這個定義直接對標 Claude Code 的架構哲學——model + harness = AI agent。\n\n#### Claude Code、Codex、Deepseek Code：三方對決\n\n招募說明書幾乎是 Claude Code 技術棧的完整複製清單：agent loops、MCP(Model Context Protocol) 、multi-agent systems、context engineering，以及 vibe coding 實作經驗。\n\n> **名詞解釋**\n> MCP(Model Context Protocol) 是 Anthropic 提出的開放協議，讓 AI 模型與外部工具、資料庫、IDE 之間能以標準化方式通訊，類似 AI 版的 USB 介面。\n\nThe Decoder 分析指出，Deepseek 將此計畫定位在「research 與 product 的交叉點」，顯示 Deepseek Code 將是 first-party 產品，而非現有 API 的簡單封裝。\n\nDeeseek V4 已被整合至 OpenCode、Codex CLI、Cline、Kilo Code 等第三方 coding agent，模型層的 coding 能力已獲生態驗證。三方對決的戰場不是模型本身，而是誰能建立最強的 Harness 基礎設施——工具調用穩定性、context 管理能力、跨檔案推理深度。\n\nClaude Code 的優勢在於與 Anthropic 模型的深度整合與長期調校；Codex 的優勢在於 GitHub 原生整合；Deepseek Code 的切入點則是成本不對稱與潛在的開源策略。\n\n#### 開源策略能否撼動閉源 Coding Agent\n\nDeeseek 的模型層以開源著稱：V4-Pro（1.6T 參數）與 V4-Flash(284B) 均採 MIT 授權，API 成本僅為 Claude Opus 4.7 的 1/53。這種成本優勢已讓部分開發者自行組裝「低成本 Harness」——將 Deepseek V4 接入 Claude Code 的 agent 框架使用。\n\n然而，coding agent 的護城河不只是模型成本。IDE 整合深度（Cursor 的即時 Tab 補全）、語言服務器協議支援、長期使用者工作流黏性，以及持續累積的 context engineering 最佳實踐，都是閉源工具的實際壁壘。\n\n目前 Deepseek Code 的開源策略尚未宣布。若走開源路線，將複製其在模型層的不對稱競爭策略，對 Cursor 等閉源工具形成系統性衝擊。但這個信號目前強度仍弱，屬於合理推測而非既定方向。\n\n#### 開發者工具市場的下一輪洗牌\n\n2026 年 3 月，Claude Code 部分原始碼意外外洩（SCMP 報導），意外加速了整個行業對 harness 架構的認知，讓 Deepseek 等後進者得以解構競品的技術棧設計。\n\nDeeseek 從「模型研究組織」向「產品公司」的戰略轉型，體現在多個時間點的連貫佈局：3 月招募前 Jane Street 工程師、4 月以 MIT 授權開源 V4、5 月公開組建 Harness 團隊。這條時間線顯示，招募公告並非倉促決定，而是預謀已久的節奏釋放。\n\nBloomberg 報導確認，Deepseek 的最新職缺清單標誌著其明確轉向 agentic AI 產品賽道。開發者工具市場即將進入三強格局，而成本維度將成為其中最不可忽視的競爭軸線。","Deepseek 的「Harness」架構哲學不只是技術選型，更是對 coding agent 競爭格局的重新定義。理解其架構邏輯，是預測 Deepseek Code 長期競爭力的關鍵所在。\n\n#### 機制 1：Harness 作為可替換模型的容器\n\nDeeseek 刻意將模型視為可替換元件，把 tool use、planning、memory、agent loops 定義為真正的產品護城河。這與「以模型為中心」的主流思路形成對比——大多數 coding agent 工具的核心賣點是與特定模型提供商的深度整合。\n\n若 Harness 層足夠強健，Deepseek Code 未來可在不更換框架的情況下，快速接入更強的新模型，賦予其在模型競賽中更靈活的戰略空間。\n\n#### 機制 2：MCP 作為生態擴張的槓桿\n\n招募說明書明確列出 MCP 經驗要求，暗示 Deepseek Code 將採用 Model Context Protocol 作為工具通訊標準。MCP 雖由 Anthropic 提出，但已成為第三方工具的事實標準。\n\n若 Deepseek Code 完整實作 MCP，現有 Claude Code 用戶已整合的 MCP server（資料庫、IDE 插件、外部 API）可低成本遷移。以他人建立的生態作為自己的進入點，是開放協議最強的使用案例。\n\n#### 機制 3：100 倍成本差作為市場切入槓桿\n\nV4-Flash 每百萬 input token 僅 $0.14，對比 Claude Opus 4.6 的 $15.00，成本差距約 107 倍。個人開發者已自發驗證：用 Deepseek V4 後端取代 Claude API，月費從 £200 降至 £18。\n\n對企業客戶而言，若 Deepseek Code 能在 Harness 品質達到 80% 的情況下維持 10% 的成本，採購決策天秤將難以保持平衡。成本不對稱是 Deepseek 最確定的切入武器。\n\n> **白話比喻**\n> 把 Harness 想像成咖啡機，模型是咖啡豆。Deepseek 的策略是：先推出最便宜的咖啡豆 (V4) ，再打造一台咖啡機 (Harness) ，讓你不用買昂貴的膠囊 (Claude API) 也能喝到接近品質的咖啡。","#### 模型層 Coding 能力\n\nDeeseek V4-Pro 在主流 agent benchmark 上接近 GPT-5.5 與 Claude Opus 4.7，但社群實測顯示其在高層設計選擇上仍有落差：複雜架構決策時不如 Opus 4.7 直接，且更容易陷入「whack-a-mole」式的修 bug 迴圈。\n\n#### 成本比較\n\nDeeseek V4-Flash 約 $0.14/M tokens，V4-Pro 約 $0.27/M tokens，Claude Opus 4.6 為 $15.00/M tokens，成本差距達 50–107 倍。注意：Deepseek Code 作為獨立產品尚未發布，上述數據僅反映模型 API 層面的成本比較，不代表最終產品定價。",{"recommended":210,"avoid":214},[211,212,213],"成本敏感的個人開發者：以 Deepseek V4 作為 Claude Code 後端替換，大幅降低 API 月費，適合任務複雜度中等的日常 coding 工作流","中小型團隊評估開源替代方案，在 PoC 階段測試 MCP 整合相容性，建立供應商多元化的備援能力","對 Coding Agent 架構設計感興趣的研究者，追蹤 Harness 模式的生態競爭演進動態",[215,216,217],"需要穩定生產環境的企業客戶（Deepseek Code 產品尚未發布，無可用 SLA）","依賴 IDE 深度整合體驗的日常開發工作流（如 Cursor Tab 補全、JetBrains 內嵌 AI）","對供應商資料處理地域合規有嚴格要求的場景（Deepseek 伺服器位於中國境內）","#### 環境需求\n\n目前 Deepseek Code 尚未正式發布，但開發者已可透過環境變數將 Deepseek V4 接入 Claude Code 的 agent 框架，作為後端模型替換方案。建議先在個人專案做小規模驗測，再評估是否擴大使用。\n\n#### 遷移／整合步驟\n\n現有 Claude Code 用戶若想試用 Deepseek V4 後端，可參考以下環境變數設定：\n\n```bash\n# 將 Claude Code 導向 Deepseek API 端點\nexport ANTHROPIC_BASE_URL=\"https://api.deepseek.com\"\nexport ANTHROPIC_API_KEY=\"your-deepseek-api-key\"\nexport ANTHROPIC_MODEL=\"deepseek-chat\"\n```\n\n注意此方式依賴 Deepseek 的 OpenAI 相容端點，部分 Claude 特定功能（如 extended thinking）不可用，需自行評估任務相容性後再正式切換。\n\n#### 驗測規劃\n\n遷移後建議以三個維度驗測：程式碼生成正確率（基準任務測試集）、跨檔案 context 理解深度（大型 repo 推理任務）、cost per task（與 Claude 原生的成本對比）。建議保留 2 週 A/B 比較期，不要倉促全量切換。\n\n#### 常見陷阱\n\n- 高層架構設計任務不建議完全替換 Opus 4.7，Deepseek 在此類任務的表現落差已有社群回報\n- 長尾 debug 任務容易觸發 whack-a-mole 迴圈，需設置最大迭代次數限制\n- Deepseek API 服務穩定性與 SLA 尚未達到 Anthropic 的企業級水準，需備有 fallback 方案\n\n#### 上線檢核清單\n\n- 觀測：token 使用量、每次 agent 呼叫往返次數、context window 使用率\n- 成本：與 Claude 訂閱費的每月對比、快取命中率 (cache hit rate)\n- 風險：API 服務穩定性、資料處理地域合規（中國境內伺服器）","#### 競爭版圖\n\n- **直接競品**：Claude Code(Anthropic) 、Codex(OpenAI cloud coding agent) 、Cursor(Anysphere)\n- **間接競品**：GitHub Copilot(Microsoft/GitHub) 、Codeium/Windsurf、JetBrains AI Assistant\n\n#### 護城河類型\n\n- **工程護城河**：agent loop 穩定性、MCP 生態整合廣度、IDE 深度整合（Deepseek Code 尚無此項優勢）\n- **生態護城河**：開源社群貢獻者數量、第三方工具相容性（Deepseek V4 已被 OpenCode、Cline、Kilo Code 等整合）\n\n#### 定價策略\n\n若延續 Deepseek 一貫的成本不對稱策略，Deepseek Code 可能以極低定價（或免費開源）切入市場，逼迫 Cursor 等閉源工具調整定價。目前定價策略尚未公開，屬推測。\n\n#### 企業導入阻力\n\n- 產品尚未發布，無法評估穩定性與 SLA\n- 中國資料處理合規問題在部分企業 IT 政策中構成障礙\n- 缺乏 IDE 原生整合，無法提供即時 Tab 補全等功能\n- 長尾 debug 任務可靠性尚待大規模實戰驗證\n\n#### 第二序影響\n\n- Cursor、Claude Code 等工具面臨定價壓力，可能加速推出更具成本競爭力的方案\n- 若 Deepseek Code 開源，將催生新一波基於開放 Harness 架構的第三方工具生態\n\n#### 判決：結構性威脅（但時間表未定）\n\nDeeseek 的技術能力與成本優勢已獲市場驗證，Harness 戰略清晰可信。但 coding agent 的護城河（IDE 整合、工作流黏性）短期內難以僅憑成本優勢直接突破。12–18 個月後的市場格局，取決於開源策略是否落地、Harness 品質能否縮短與 Claude Code 的差距。",[221,222],"Deepseek Code 的最大風險是自己的成功：若開源 Harness 框架被第三方工具廣泛採用，Deepseek Code 產品本身可能淪為可選項而非必選項，反而替競品鋪路","Claude Code 的核心優勢在於與 Claude 模型的深度協同調校，這種整合品質不是技術規格可以快速複製的；即便 Harness 框架開源，模型層的質量差距仍是真正的護城河",[224,227,230,233,236],{"platform":148,"user":225,"quote":226},"@PrajwalTomar_","你不明白這有多大。你現在可以以極低成本運行 Claude Code，只需將 DeepSeek V4 接入作為後端大腦。Claude 負責設計，DeepSeek 負責邏輯，Codex 抓 bug。三個模型，一個工作流，成本大幅降低。",{"platform":155,"user":228,"quote":229},"spacedcowboy（HN 用戶）","我一直用 Claude Code 搭配 deepseek flash 後端，這讓我可以把 Claude 訂閱費從每月 £200 降到 £18，大多數工作交給 deepseek，只用 claude 來驗證假設和微調。我在讓它們設計 FPGA 的 HDL 並為最終 CPU 寫一個編譯器——絕非瑣碎任務。",{"platform":148,"user":231,"quote":232},"@KhalidWarsa","DeepSeek V4 Pro 在 OpenCode 上非常強大。我用 Claude Code 做架構規劃並建立詳細的 GitHub issue，然後用這個組合快速衝刺完成。支援獨立 worktree、pre-commit 檢查、commit & push PR、review 並留下回饋、解決評論——完成。",{"platform":155,"user":234,"quote":235},"josephg（HN 用戶）","我試了 deepseek 最好的模型，透過官方 API。極其便宜，但在程式設計上明顯不如 Opus 4.7。在高層設計選擇上差距很大，也更容易陷入「打地鼠」式的修 bug 迴圈。我停下來讓 opus 解決同一個問題，opus 立刻看出了解法。我是透過 claude 的 code agent harness 運行 deepseek 的。",{"platform":155,"user":237,"quote":238},"mewse-hn（HN 用戶）","是的，我用 claude code 軟體，透過環境變數配置 deepseek v4-pro API——我發現 API 存取真的很實惠。",[240,242,244],{"type":96,"text":241},"將 Deepseek V4-Flash 接入 Claude Code 作為後端，實測自己的日常 coding 任務，用 2 週 A/B 比較成本與品質的實際差距",{"type":99,"text":243},"盤點現有 MCP server 清單，記錄哪些工具在 Deepseek Code 發布後可直接遷移，提前建立相容性評估基線",{"type":102,"text":245},"追蹤 Deepseek Code 的開源策略公告——若走 MIT 授權，市場格局將在 6 個月內出現結構性變化，屆時需重新評估 Cursor 等閉源工具的採購決策",{"category":247,"source":15,"title":248,"subtitle":249,"publishDate":6,"tier1Source":250,"supplementSources":253,"tldr":266,"context":278,"devilsAdvocate":279,"community":282,"hypeScore":91,"hypeMax":92,"adoptionAdvice":93,"actionItems":298,"policyDetail":305,"complianceImpact":306,"industryImpact":316,"timeline":317},"policy","Meta 在中東系統性封鎖人權帳號：AI 平台治理的灰色地帶","100+ 個 NGO 與學者帳號遭地理封鎖，揭示平台合規機制的結構性隱蔽與人權盲區",{"name":251,"url":252},"ALQST for Human Rights","https://www.alqst.org/ar/posts/1190",[254,258,262],{"name":255,"url":256,"detail":257},"Hacker News Discussion #48206768","https://news.ycombinator.com/item?id=48206768","HN 社群對 Meta 封鎖事件的企業責任與政府角色辯論",{"name":259,"url":260,"detail":261},"Meta Transparency Center — Content Restrictions","https://transparency.meta.com/reports/content-restrictions/case-studies/","Meta 官方透明度報告中的內容限制案例存檔",{"name":263,"url":264,"detail":265},"Saudi Arabia's Digital Rights Hypocrisy — ECDHR","https://www.ecdhr.org/saudi-arabias-digital-rights-hypocrisy/","ECDHR 對沙烏地數位管制系統化壓制模式的分析報告",{"tagline":267,"points":268},"遵從或退出，Meta 選了留下——而代價由人權組織承擔",[269,272,275],{"label":270,"text":271},"政策","自 2026 年 3 月起，Meta 依沙烏地與阿聯酋政府請求，對逾 100 個帳號實施地理封鎖，對象涵蓋 NGO、學者與個人維權者，呈現系統性規模。",{"label":273,"text":274},"合規","Meta 援引「當地法律要求」執行封鎖，但審查流程對外不透明，受影響者難以舉證申訴，形成結構性隱蔽——帳號未刪除，卻對目標受眾完全消失。",{"label":276,"text":277},"影響","ALQST 等長期記錄人權侵害的 NGO 在沙烏地境內被「隱形刪除」，受害者家屬失去連結管道，Meta 的合規選擇同時為其他平台設下示範先例。","#### 系統性封鎖：Meta 在沙烏地與阿聯酋的審查實錄\n\n自 2026 年 3 月起，Meta 開始針對沙烏地阿拉伯與阿聯酋境內的用戶，對逾 100 個 Facebook 頁面與 Instagram 帳號實施地理封鎖。\n\n被封鎖的對象包括人權組織 ALQST for Human Rights、Democratic Diwan，以及沙烏地研究員 Abdullah Alaoudh 和人權捍衛者 Yahya Assiri。阿聯酋境內亦有至少一名學者帳號受到同樣限制。2026 年 5 月 20 日，ALQST 發布聯合聲明，公開記錄這波系統性封鎖的始末。\n\nALQST 的核心工作是記錄沙烏地境內的強迫失蹤、政治犯與酷刑案例。其帳號在境內消失，等同於切斷了受害者家屬與外界的重要連結管道。被援引的「違法內容」描述竟是「報導區域地緣政治衝突與安全動態」——即對人權狀況的如實記錄。\n\n#### 演算法即審查：平台 AI 如何執行隱形禁令\n\n地理封鎖 (geo-blocking) 的設計使審查得以「無聲化」：受封鎖帳號在境外看起來一切正常，帳號持有人甚至不會收到直接通知說明哪些內容被針對。\n\n> **名詞解釋**\n> 地理封鎖 (geo-blocking) ：依據用戶的 IP 位置，在特定國家或地區封鎖對特定內容或帳號的存取，其他地區用戶不受影響，也難以察覺封鎖的存在。\n\n這種結構性隱蔽性讓受影響者難以舉證、難以申訴，也讓平台得以對外宣稱「內容未被刪除」，同時卻讓關鍵受眾完全看不見這些內容。Meta 的透明度中心雖然記錄了部分案例，但實際審查流程對外不透明，外界無從判斷每起封鎖請求是否經過人權影響評估。\n\n類似手法先前已見於 X（前 Twitter）：沙烏地政府同樣要求對異見帳號實施地理封鎖，顯示這已成為威權政府常用的平台施壓模式。\n\n#### 科技公司在威權國家的合規困境\n\nMeta 面臨的選擇被 HN 社群直白描述為「遵從或退出 (comply or exit) 」。封鎖通知援引「當地法律要求」或「政府請求」作為依據，法律基礎為兩國各自的網路犯罪法。\n\n批評者指出，選擇留在市場並配合政治性封鎖，本質上是以商業利益為由使審查機制合法化，並對其他平台產生示範效應。HN 上亦有聲音認為「把短期增長凌駕一切，就注定無法堅守原則」——這句話點出了科技平台在全球市場擴張與人權承諾之間長期存在的結構性矛盾。\n\nECDHR 的報告進一步指出，沙烏地的數位管制模式已形成系統化壓制，科技公司若選擇留在該市場，便難以迴避成為壓制基礎設施一環的指控。\n\n#### 社群迴響與人權組織的下一步行動\n\nALQST 的公開聲明不只是譴責，更提出具體問責訴求：要求 Meta 說明針對受封鎖頁面的人權盡職調查 (due diligence) 由誰執行、適用何種標準，以及公司如何判斷「依政府要求限制人權組織」符合其所聲稱的價值承諾。\n\n> **名詞解釋**\n> 人權盡職調查 (human rights due diligence) ：企業識別、預防並緩解其業務活動對人權造成負面影響的系統化評估流程，源自聯合國《工商業與人權指導原則》 (UNGPs) 。\n\nHN 社群的討論顯示，輿論關注點在「企業責任」與「政府才是根本問題」之間存在明顯分歧。這一張力本身反映了科技公司在全球政治地緣格局中難以迴避的結構性處境——平台的「人權承諾」，在威權政府的法律要求面前仍是最脆弱的一環。",[280,281],"Meta 若拒絕政府請求，沙烏地與阿聯酋當局可全面封鎖 Facebook 和 Instagram，反而讓當地數百萬一般用戶失去相對開放的資訊空間——留在市場或許是兩害相權取其輕的務實選擇。","平台執行地理封鎖至少在透明度報告中留有存檔，相較於直接刪除內容或協助政府識別異見人士身份，合規的形式仍存在程度上的差別，不應一概論之。",[283,286,289,292,295],{"platform":82,"user":284,"quote":285},"thomashansen.bsky.social（Thomas Hansen，50 讚）","Meta 暫停了挪威《Dagsavisen》記者 Helle Lyng Svendsen 的帳號，她曾就新聞自由與人權問題公開質問印度總理莫迪。",{"platform":148,"user":287,"quote":288},"Human Rights Foundation（HRF，人權非政府組織）","加彭總統府女發言人 Jennyfer Mélodie Sambat 在訪談中為停權措施辯護，稱此舉是針對 Meta 平台的「監管行動」與「臨時暫停」，並指控 Meta 散布她認定為誹謗性和「政治性」的內容。",{"platform":82,"user":290,"quote":291},"yourdigitalbrain.bsky.social（Digital Brain，6 讚）","逾 100 個帳號應海灣國家政府要求遭 Meta 封禁——當局究竟會走到多遠來控制輿論敘事？此舉引發外界對言論自由及社群媒體在人權倡議中所扮演角色的嚴重質疑。",{"platform":82,"user":293,"quote":294},"fightforthefuture.org（Fight for the Future，19 讚）","5 月 12 日，我們與 Access Now、NYCLU、EFF 及其他主要人權組織聯名致函 Meta，要求公司立即將私信的端對端加密設為預設值。",{"platform":148,"user":296,"quote":297},"@hrw（Human Rights Watch，國際人權非政府組織）","Meta 旗下的 Instagram 與 Facebook 在 2021 年 5 月以巴衝突期間移除了記錄人權侵害行為的內容。在暴力衝突期間審查此類內容，是對人權的傷害。",[299,301,303],{"type":102,"text":300},"追蹤 Meta 透明度中心的內容限制報告更新，觀察沙烏地與阿聯酋的封鎖請求數量與拒絕率是否出現變化，作為平台治理風向的先行指標。",{"type":102,"text":302},"關注 ALQST 後續問責行動，以及 Meta 是否正式回應人權盡職調查機制的公開質詢；若歐盟 DSA 介入調查，將是平台治理規則重設的關鍵節點。",{"type":99,"text":304},"若產品或服務涵蓋可能受地理管制的地區用戶，建立封鎖預案：含用戶通知機制、替代接觸管道（自架伺服器或 RSS 訂閱），以及跨地區服務可用性監控。","#### 核心條款\n\nMeta 的全球性「當地法律遵循政策」允許公司依各國政府的正式法律請求，對特定帳號或內容實施地理封鎖。沙烏地與阿聯酋援引的法律基礎是兩國各自的網路犯罪法，而被歸類為「違法內容」的行為竟是「報導區域地緣政治衝突與安全動態」——即對人權狀況的如實記錄。\n\n地理封鎖執行後，受影響帳號在該國境內顯示為「無法存取」，但帳號本身並未被刪除，帳號持有人在境外仍可正常使用。Meta 於透明度中心發布相關案例，但具體的審查決策標準不對外公開。\n\n#### 適用範圍\n\n本次限制措施影響沙烏地阿拉伯與阿聯酋境內的 Facebook 和 Instagram 用戶，受影響對象橫跨人權 NGO（ALQST、Democratic Diwan）、學術研究人員 (Abdullah Alaoudh) 與個人人權捍衛者 (Yahya Assiri) 。\n\n自 2026 年 3 月起短短兩個月內已超過 100 個帳號遭封鎖，涵蓋範圍之廣顯示這不是個案，而是系統性的地區管制行動。阿聯酋境內亦有至少一名學者帳號受波及，地理範圍超出單一國家。\n\n#### 執法機制\n\nMeta 的封鎖通知以「當地法律要求」或「政府請求」為由，但申訴管道對受影響帳號持有人而言幾乎不透明。\n\n受影響者的主要困境在於：帳號持有人在境外看起來一切正常，目標受眾（即境內用戶）卻完全看不見內容，受害者往往不知道自己已遭封鎖，更難以得知具體是哪些內容觸發了政府請求。",[307,310,313],{"label":308,"markdown":309},"工程改造需求","地理封鎖是大型平台基礎設施層面的既有能力，執行政府請求本身不需要額外工程開發。\n\n然而若要符合人權標準，平台需建立自動化的「封鎖通知機制」——讓帳號持有人即時得知哪個地區、哪些內容受到限制；以及結構化的「人權影響評估流程」，在執行封鎖前進行強制審查。這兩套機制目前均不存在或未對外公開。",{"label":311,"markdown":312},"合規成本估計","若 Meta 選擇建立完整的人權盡職調查機制，預估需投入：\n\n- 跨區域人權法律專家團隊（每年數百萬美元）\n- 政府請求審查平台的工程開發（一次性成本加維護費用）\n- 透明度報告細粒度化的額外人力與法律審核\n\n若選擇維持現有模式繼續運行，長期面臨的是聲譽成本與歐盟 DSA 等跨境法規的潛在罰款風險。",{"label":314,"markdown":315},"最小合規路徑","符合國際人權標準的最低限度行動包含以下步驟：\n\n1. 向受封鎖帳號持有人發送書面通知，說明封鎖地區與援引的法律依據\n2. 公開每次政府封鎖請求的人權影響評估結果（至少摘要層級）\n3. 建立獨立的外部申訴管道，允許 NGO 對封鎖決定提出異議\n4. 定期發布分國家、分類別的封鎖請求數量與拒絕率統計","#### 直接影響者\n\n首當其衝的是在威權國家境內經營的人權 NGO 與公民社會組織。其社群媒體帳號是對外溝通的主要管道，一旦遭地理封鎖，便等同在目標受眾面前被「隱形刪除」。\n\n受害者家屬無法取得組織的聯絡資訊，境內潛在舉報人也失去安全聯繫管道——對 ALQST 而言，帳號消失直接切斷了其與沙烏地受迫害家庭的聯繫。獨立記者與異見學者是第二波直接受害者，研究成果與評論無法觸及最需要這些資訊的本地受眾。\n\n#### 間接波及者\n\n其他主要社群媒體平台（X、YouTube、TikTok）面臨示範效應壓力：沙烏地已對 X 施壓要求地理封鎖異見帳號，Meta 的合規行為等同於為後續政府請求設定了「市場先例」。\n\nVPN 服務商、鏡像網站服務與去中心化平台（如 Mastodon、Farcaster）則可能因此獲得更多來自管制地區的用戶需求，成為間接受益者。\n\n#### 成本轉嫁效應\n\n對沙烏地與阿聯酋的一般用戶而言，資訊空間的可信人權內容正系統性地消失，替代資訊源的獲取門檻（如需使用 VPN）進一步加劇了資訊不對稱。\n\n長期來看，這會強化威權政府對輿論的掌控，並讓平台成為資訊管制基礎設施的一部分——代價最終由需要資訊的普通公民承擔。",[318,323,327,331,336,340],{"date":319,"label":320,"text":321,"phase":322},"2026-03-01","起始","受影響的 Facebook 頁面與 Instagram 帳號開始陸續遭到地理封鎖，累計超過 100 個帳號受波及。","past",{"date":324,"label":325,"text":326,"phase":322},"2026-04-30","關鍵事件","Meta 對 ALQST、Democratic Diwan、Abdullah Alaoudh、Yahya Assiri 等主要帳號正式實施沙烏地與阿聯酋境內封鎖。",{"date":328,"label":329,"text":330,"phase":322},"2026-05-20","公開揭露","ALQST 發布聯合聲明，公開記錄封鎖事件始末，並要求 Meta 說明人權盡職調查的執行細節與標準。",{"date":332,"label":333,"text":334,"phase":335},"短期（0-3 月）","短期","Meta 是否正式回應 ALQST 的問責要求；其他受影響帳號是否持續增加；NGO 聯盟的後續施壓與媒體報導走向。","future",{"date":337,"label":338,"text":339,"phase":335},"中期（3-12 月）","中期","歐盟 DSA（數位服務法）是否介入調查 Meta 對威權國家請求的處理機制；Meta 透明度報告的細粒度是否提升。",{"date":341,"label":342,"text":343,"phase":335},"後續觀察","觀察","其他平台是否跟進類似地理封鎖合規模式；去中心化平台能否成為人權組織在管制地區的可行替代渠道。",[345,382,417,453,489,525,560,585],{"category":173,"source":9,"title":346,"publishDate":6,"tier1Source":347,"supplementSources":350,"coreInfo":357,"engineerView":358,"businessView":359,"viewALabel":360,"viewBLabel":361,"bench":362,"communityQuotes":363,"verdict":380,"impact":381},"Qwen 即將再推 27B 新模型，開源社群期待 MoE 升級",{"name":348,"url":349},"InsiderLLM","https://insiderllm.com/guides/qwen-3-7-preview-scored-57-aai-27b-35b-open-weights-watch/",[351,354],{"name":352,"url":353},"MarkTechPost — Alibaba Qwen Team Releases Qwen3.6-27B","https://www.marktechpost.com/2026/04/22/alibaba-qwen-team-releases-qwen3-6-27b-a-dense-open-weight-model-outperforming-397b-moe-on-agentic-coding-benchmarks/",{"name":355,"url":356},"Reddit r/LocalLLaMA 討論","https://www.reddit.com/r/LocalLLaMA/comments/1tiwnpc/qwen_will_release_another_27b_with_high/","#### Qwen 3.7 Max 登頂 AAI，開源版本備受期待\n\nQwen 3.7 Max API 預覽版於 2026-05-19 正式上線，在 Artificial Analysis Intelligence Index(AAI)218 個模型中奪得第一，評分 57，較 Qwen 3.6 Max 的 52 提升 5 分，Arena AI Elo 達 1,489。\n\n> **名詞解釋**\n> AAI 是整合多項任務評測模型能力的綜合排行榜，類似模型界的「綜合大學排名」。\n\n#### 社群預測：27B 與 35B 開源權重即將跟進\n\nr/LocalLLaMA 社群普遍看好開源版本即將推出，理由是 Qwen 已建立「API 先行、開源跟進」模式——3.6-27B 於 2026-04-22 以 Apache 2.0 授權發布。\n\n預期 27B(dense) 延續 Gated DeltaNet 線性注意力混合架構，支援 Multi-Token Prediction(MTP) 加速推理；Q4_K_M 量化版預計需約 15–16 GiB VRAM。35B 預計維持 MoE 架構，GGUF 版通常在主要權重發布後 24–72 小時跟上。\n\n> **名詞解釋**\n> MoE(Mixture of Experts) 是每次只啟動部分參數的架構，推理成本遠低於同參數量的 dense 模型。","開源權重確認後，27B Q4_K_M 量化版需約 15–16 GiB VRAM，是消費級 GPU 的甜蜜點。部署時建議關閉 mmap，在記憶體溢出至 RAM 的情境下可顯著加速 prefill。若選 35B MoE，GGUF 版通常在主權重後 24–72 小時跟上，可優先在 Ollama 或 LM Studio 快速部署測試，再決定是否整合進現有工作流程。","Qwen 27B 本機部署對高頻推理場景有明確 ROI——社群實測在 RTX 3090 搭配 agent 工作流程，7 天成本顯著低於雲端 API 費用。規模較小的團隊可等 27B 開源後先做 PoC，再評估是否值得投入 GPU 硬體，而非直接鎖定付費 API 合約。","開發者視角（部署／整合）","生態影響","#### 效能基準\n\n- AAI 評分：57（218 個模型第一名）\n- 較 Qwen 3.6 Max 提升：+5 分 (52 → 57)\n- Arena AI Elo：1,489\n- 預測 27B AAI 評分：約 51（接近 3.6 Max 水準）",[364,368,371,374,377],{"platform":365,"user":366,"quote":367},"Reddit r/LocalLLaMA","u/Borkato","我個人覺得 35a3b 和 Qwen 27B 就是……完美。它們彼此完美互補，我幾乎不需要用其他模型。",{"platform":365,"user":369,"quote":370},"u/Saraozte01","希望能包含 122B，如果能用 3.7 架構推出更大規模的 MoE 就太棒了。",{"platform":365,"user":372,"quote":373},"u/Xantrk","為什麼要關閉 mmap？我也收到同樣建議但沒人解釋。記憶體溢出到 RAM 時，關閉 mmap 可以讓 prefill 快非常多。",{"platform":148,"user":375,"quote":376},"@LottoLabs","在 3090 上跑 Qwen 27b 幫我省了一大筆費用。這是搭配 Hermes agent 使用 7 天的成本節省，保守估計 80% 快取命中率。27b 的能力介於 Sonnet 和 5.4 mini 之間。",{"platform":75,"user":378,"quote":379},"HN 用戶 (542458)","讓我保持樂觀的原因：人們不斷找到方法把更多智慧壓縮進更小的模型。以前頂尖 70B 模型只能「有時候」寫出能跑的程式碼，現在 Qwen 27B 就做得到了。","觀望","Qwen 27B/35B 開源權重尚未確認發布日期，但一旦落地將衝擊中型 GPU 用戶的部署選擇，並加速企業評估從付費 API 轉向本機推理的可行性。",{"category":173,"source":14,"title":383,"publishDate":6,"tier1Source":384,"supplementSources":387,"coreInfo":394,"engineerView":395,"businessView":396,"viewALabel":397,"viewBLabel":398,"bench":399,"communityQuotes":400,"verdict":415,"impact":416},"Hugging Face 基準資料集新增模型大小篩選功能",{"name":385,"url":386},"Hugging Face Changelog","https://huggingface.co/changelog/leaderboard-filter-by-size",[388,391],{"name":389,"url":390},"Reddit r/LocalLLaMA 討論串","https://www.reddit.com/r/LocalLLaMA/comments/1tilvit/huggingface_benchmark_datasets_now_let_you_filter/",{"name":392,"url":393},"Hugging Face Community Evals 介紹 — InfoQ","https://www.infoq.com/news/2026/02/hugging-face-evals/","#### 功能概覽\n\n2026 年 5 月 20 日，Hugging Face 正式推出排行榜模型大小篩選功能。所有帶有 `benchmark` 標籤的資料集排行榜頁面，頂部會自動顯示參數量區間篩選器，選定後排名即時刷新。每個大小分桶前三名以 🏅 標示，方便快速定位同量級最佳模型。\n\n#### 技術架構\n\n篩選機制從各模型的 model card 讀取評測結果，以 Git 版本化基礎設施維護，資料可追溯。此功能與 2026 年 2 月上線的 Community Evals 系統共用同一套 `.eval_results/` YAML 架構，允許模型作者與社群貢獻者提交評測結果，所有變更均有版本記錄。\n\n> **名詞解釋**\n> Community Evals：Hugging Face 的社群評測系統，任何人皆可透過提交 `eval.yaml`（遵循 Inspect AI 格式）為模型新增基準測試結果，並以 Git 追蹤所有變更。","選模型不再需要手動瀏覽整份大型排行榜。只需在目標 benchmark 頁面設定參數量區間（如 7B–13B），即可即時看到同量級最佳選項及 🏅 前三名。若要提交自家模型的評測結果，按 Community Evals 規格寫入 `.eval_results/` YAML 並 push 即可，變更自動納入版本記錄。","部署成本往往左右模型選型，而此功能讓「同等預算下最強模型」的搜尋成本趨近於零。小型語言模型的競爭格局因此更透明——以往藏在大型排行榜深處的 small LM 方案，現在可在同量級比較中脫穎而出，直接加速企業的 PoC 評估流程。","開發者評測工作流","生態系影響","",[401,404,407,409,412],{"platform":365,"user":402,"quote":403},"u/LoSboccacc","這是個新功能，適用於標記 benchmark 的資料集，會從 model card 擷取結果……它們坐落在你點擊的每個 benchmark 頁面頂部",{"platform":365,"user":405,"quote":406},"u/East-Muffin-6472","可別忘了 LFM 系列和 small LM 系列，他們在小型語言模型領域做了很瘋狂的工作",{"platform":365,"user":405,"quote":408},"工具推理相當有趣，因為它能讓模型針對推理任務進行微調——讓你的智慧型手機也能執行 agent、替你完成各種任務",{"platform":75,"user":410,"quote":411},"tarruda","我有一台 128G Mac Studio，397B 模型以超高量化韌性讓我驚喜——2.54BPW 量化版在 128k context 下跑出 20 tps 生成速度、200 tps 預填速度，同時在多項基準保持高分",{"platform":75,"user":413,"quote":414},"DiabloD3","在相同量化等級 (F16 KV cache) 的對等測試中，35B-A3B 在任何稍複雜的任務上都不如 27B dense；Qwen 自己也承認，在邏輯、數學、工具呼叫等有意義的基準上，27B dense 表現接近 122B-10B 和 397B-A17B","追","讓「同量級最佳模型」的搜尋從手動過濾變成一鍵篩選，直接降低小型模型評估門檻，加速 PoC 選型流程。",{"category":173,"source":11,"title":418,"publishDate":6,"tier1Source":419,"supplementSources":422,"coreInfo":431,"engineerView":432,"businessView":433,"viewALabel":434,"viewBLabel":361,"bench":435,"communityQuotes":436,"verdict":415,"impact":452},"Guardrails 讓 8B 小模型在 Agent 任務從 53% 跳到 99%",{"name":420,"url":421},"GitHub: antoinezambelli/forge","https://github.com/antoinezambelli/forge",[423,426,429],{"name":424,"url":425},"Show HN: Forge – Guardrails take an 8B model from 53% to 99% on agentic tasks","https://news.ycombinator.com/item?id=48192383",{"name":427,"url":428},"ACM CAIS 2026 Demo：Forge – Closing the Agentic Reliability Gap","https://www.caisconf.org/program/2026/demos/forge-agentic-reliability/",{"name":355,"url":430},"https://www.reddit.com/r/LocalLLaMA/comments/1ticykd/guardrails_take_an_8b_model_from_53_to_99_on/","#### Forge：本地 LLM 的可靠性護欄\n\n德州儀器 AI Director Antoine Zambelli 開源的 Forge，是專為本地端 LLM tool-calling 設計的可靠性中間層。加上 guardrails 後，8B 小模型的 agentic 任務完成率從 **53% 躍升至 99%**，表現甚至超越未加護欄的頂尖商業 API。\n\n> **名詞解釋**\n> Agentic 任務：LLM 需自主規劃、連續呼叫工具的複雜任務，如「搜尋→整理→寫入」多步驟流程。\n\n#### 評測關鍵發現\n\n50+ 種模型╱後端組合、9 個場景各跑 50 次的評測揭示：**相同模型在不同 serving backend 上，準確率差異可達 0% 對 78%**。前沿大模型不加護欄時完成率僅 49–87%，錯誤恢復率為 0%——模型尺寸越大並不保證越好。\n\n護欄堆疊含五大機制（retry nudges、step enforcement、error recovery、context compaction、VRAM-aware budgeting），三種整合模式支援從結構化 agent loop 到 OpenAI API 相容代理的完整部署需求。","Forge 提供三種整合路徑：WorkflowRunner（全新 agent loop）、Guardrails middleware（可插入現有 pipeline）、Proxy server（相容 OpenAI API，遷移成本最低）。\n\n環境需求 Python 3.12+，支援 Ollama、llama-server、Llamafile、Anthropic 後端；vLLM 支援在實驗分支 (`az/vllm`) ，尚未合併主線。MIT 授權、1.2k stars，可直接 clone 評估引入。","Forge 重塑了「本地推論 vs. 雲端 API」的成本決策基準。若 8B 模型加護欄後能達 99% agentic 可靠性，企業可大幅降低對商業 API 的依賴，並讓資料留在本地以滿足合規要求。\n\n論文已收錄為 ACM CAIS 2026 demo，預計 2026-05-28 在 San Jose 展示；德州儀器的工業場景加持，也讓技術落地可信度更高。","開發者整合視角","#### Agentic 任務完成率\n\n- 8B 模型（加 Forge 護欄）：53% → **99%**\n- 頂尖商業 API（未加護欄）：49–87%，錯誤恢復率 0%\n- 相同模型不同 backend 差異：最大 0% vs. 78%\n\n#### 評測規模\n\n- 50+ 種模型╱後端組合\n- 9 個 agentic 場景 × 50 次，共 26 個評估情境",[437,440,443,446,449],{"platform":75,"user":438,"quote":439},"somethingsome(HN)","在 2x L40S 用 vLLM 成功跑起來了，但碰到 model name 問題——Forge 把 'default' 傳給後端而非真正的 model name。加上 --served-model-name 別名就解決了。我還沒正式測 Forge 本身，光跑起來就很開心了。",{"platform":75,"user":441,"quote":442},"zambelli（Forge 作者）","這是個好發現，我會把它記成 GitHub issue。很高興聽到它能跑起來！",{"platform":75,"user":444,"quote":445},"tempoponet(HN)","謝謝你詳細的回應。我有幾張較小的 3080 想找個用途，這看起來是個好機會。",{"platform":148,"user":447,"quote":448},"@MorgantWillis","關於 AI agent 安全性的討論很多。Strands Agents 現在整合了 Agent Control——你可以加入執行時護欄，評估 agent 工作流程的每個步驟，檢查 LLM 輸入輸出、封鎖不安全的工具呼叫，或引導模型行為。",{"platform":82,"user":450,"quote":451},"interjectedfuture.com(iamwil)","我已找到兩三個機會，在 agentic 程式碼迴圈中以 Quint 作為護欄。讓 agent 寫出證明，我審閱後再生成 trace 由單元測試執行——這些充當硬性關卡，比告訴它「絕對不要犯錯」更有效。","本地 8B 模型加上 Forge 護欄後，agentic 任務可靠性媲美前沿商業 API，直接重塑企業自托管推論的成本效益計算。",{"category":247,"source":13,"title":454,"publishDate":6,"tier1Source":455,"supplementSources":458,"coreInfo":467,"engineerView":468,"businessView":469,"viewALabel":470,"viewBLabel":471,"bench":399,"communityQuotes":472,"verdict":93,"impact":488},"GitHub 確認遭入侵：惡意 VS Code 擴充套件竊取 3,800 個內部 Repository",{"name":456,"url":457},"BleepingComputer","https://www.bleepingcomputer.com/news/security/github-confirms-breach-of-3-800-repos-via-malicious-vscode-extension/",[459,463],{"name":460,"url":461,"detail":462},"The Record","https://therecord.media/github-confirms-teampcp-hack-customers-unaffected","GitHub 官方確認遭 TeamPCP 入侵，客戶未受影響",{"name":464,"url":465,"detail":466},"Help Net Security","https://www.helpnetsecurity.com/2026/05/20/github-breached-teampcp/","TeamPCP 攻擊 GitHub 內部代碼庫詳情","#### 惡意擴充套件開啟後門\n\n2026-05-20，GitHub 確認遭駭客組織 TeamPCP 入侵，約 3,800 個內部程式碼 repository 遭竊取。攻擊入口出奇地簡單：一名 GitHub 員工安裝了惡意 VS Code 擴充套件，攻擊者藉此竊取驗證 token、私鑰及環境變數，再以竊得憑證直接 clone 內部 repository。\n\n> **名詞解釋**\n> TeamPCP 是自 2026 年 3 月起活躍的駭客組織，曾針對 npm、PyPI 及 VS Code 擴充套件生態系發動多起供應鏈攻擊，此前目標包含 TanStack、LiteLLM 及歐盟委員會。\n\n#### 影響範圍與即時處置\n\nGitHub 表示目前無客戶資料或使用者 repository 遭竊的跡象，入侵後已輪換關鍵憑證並隔離受影響員工裝置。然而 TeamPCP 已在犯罪論壇開價 $50,000 美元出售竊取原始碼，威脅若無人購買將公開釋出。\n\n更深層的隱患在於 VS Code 至今缺乏擴充套件沙箱機制——GitHub 早在 2018 年開立的 issue #52116 要求沙箱化，八年來懸而未決。","此事件的核心教訓是：開發者機器是供應鏈最薄弱環節。VS Code 擴充套件可完整讀取機器上所有憑證、雲端金鑰與 SSH 金鑰，目前無任何沙箱限制。\n\n即時行動建議：\n\n- 審查已安裝的 VS Code 擴充套件，移除非必要或來源不明者\n- 改用 secrets manager（如 1Password CLI、AWS Secrets Manager）取代環境變數明文存放金鑰\n- 企業可透過 VS Code Policy 建立允許安裝的擴充套件白名單","GitHub 管理全球大量開源與私有程式碼基礎設施，此次內部原始碼外洩雖暫未直接衝擊用戶，但暴露出平台本身在供應鏈安全上的隱患。\n\n對企業而言，需評估的風險包括：\n\n- GitHub Actions workflow 是否依賴可能遭竄改的內部工具\n- GitHub Advanced Security 或 Copilot 的分析邏輯若被修改，是否影響企業資安決策\n- 若 TeamPCP 公開原始碼，競爭對手或其他攻擊者可取得 GitHub 內部架構細節","合規實作影響","企業風險與成本",[473,476,479,482,485],{"platform":75,"user":474,"quote":475},"az226","不只是支援人員，也不只是他們服務的客戶——任何 GitHub 員工都能隨意存取任何 repo。",{"platform":75,"user":477,"quote":478},"LiamPowell","擴充套件從來就不需要被授予對所有東西的未沙箱化存取權。這是他們主動做出的選擇。",{"platform":75,"user":480,"quote":481},"xbar","把 3,800 當成一個「方向」來說，是對英語的濫用。",{"platform":148,"user":483,"quote":484},"@Rus_Khairullin","GitHub 剛被入侵。超過 3,800 個 repository 遭攻陷。攻擊手法並不複雜：一名 GitHub 員工安裝了惡意 VS Code 擴充套件，擴充套件竊取了存取金鑰，駭客就從前門走了進來。讓這件事沉澱一下。",{"platform":82,"user":486,"quote":487},"echobit.de（Echobit，40 upvotes）","GitHub：「我們正在調查 GitHub 內部 repository 的未授權存取事件。目前我們沒有客戶儲存在 GitHub 內部 repository 以外的資訊受到影響的跡象……」\n\n所以 GitHub 現在是開源的了。","VS Code 擴充套件供應鏈攻擊成為企業級安全的新威脅入口，開發者本機憑證管理亟需系統性升級。",{"category":22,"source":18,"title":490,"publishDate":6,"tier1Source":491,"supplementSources":493,"coreInfo":502,"engineerView":503,"businessView":504,"viewALabel":505,"viewBLabel":506,"bench":507,"communityQuotes":508,"verdict":415,"impact":524},"Stability AI 發布 Stable Audio 3.0：四款模型家族，最長生成 6 分 20 秒完整歌曲",{"name":30,"url":492},"https://techcrunch.com/2026/05/20/stability-ai-release-a-new-audio-model-that-can-create-six-minute-songs/",[494,496,499],{"name":177,"url":495},"https://the-decoder.com/stability-ai-launches-stable-audio-3-0-with-up-to-six-minute-tracks-and-open-weights/",{"name":497,"url":498},"Stability AI 官方公告","https://stability.ai/news-updates/meet-stable-audio-3-the-model-family-built-for-artistic-experimentation-with-open-weight-models",{"name":500,"url":501},"arXiv 論文 2605.17991v1","https://arxiv.org/html/2605.17991v1","#### 四款模型家族，生成時長提升 8 倍\n\nStability AI 發布 Stable Audio 3.0，推出 Large(2.7B) 、Medium(1.4B) 、Small 與 Small SFX（各 459M）四款模型。旗艦版最長可生成 **6 分 20 秒**完整歌曲，較前代 47 秒提升 8 倍；Small 可在消費筆電或手機側推論，約 0.44 秒完成生成。\n\n#### 架構亮點：SAME + Ping-pong Sampling\n\n核心採用 **Semantic-Acoustic Autoencoder(SAME)** 搭配 Diffusion Transformer，SAME 達成 4096× 降採樣，讓長音訊得以在消費硬體上運行。首創 **Ping-pong sampling** 雙向自我修正推論策略，不依賴 classifier-free guidance。支援音訊 Inpainting 與完整 LoRA 微調，訓練資料 100% 授權，論文已發表於 arXiv(2605.17991v1) 。\n\n> **名詞解釋**\n> SAME(Semantic-Acoustic Autoencoder) ：透過 4096× 降採樣壓縮音訊語意，將長音訊計算量壓縮至消費硬體可負擔的範圍。","Small 與 Medium 開放權重、支援 LoRA 微調，可在消費硬體側推論，工程整合門檻大幅降低。SAME 架構的 4096× 降採樣直接解決長音訊生成的計算瓶頸，Ping-pong sampling 無需 classifier-free guidance 即達高品質輸出。arXiv 論文與 GitHub pipeline 同步釋出，可快速驗證並整合至現有工具鏈。","授權策略清晰：年營收 $1M 以下免費商業使用，輸出版權歸使用者，吸引中小型創作者與獨立工作室。與 Universal Music Group、Warner Music Group 的授權合作，正面對比 Suno、Udio 的版權訴訟困境，有效降低企業法律顧慮，商業採購阻力顯著小於競品。","工程師視角","商業視角","#### 推論效能\n\n- Small(459M) ：消費級筆電約 **0.44 秒**\n- Medium(1.4B) ：H200 GPU 約 **1.31 秒**\n- Large(2.7B) ：API 存取，推論速度未公開\n- 生成時長：Large／Medium **6 分 20 秒**（前代 2.0：47 秒，提升 8 倍）",[509,512,515,518,521],{"platform":82,"user":510,"quote":511},"Jordi Pons(jordiponsdotme.bsky.social)","Stable Audio 3，用 5 張圖解釋。這是一個用於生成器樂和音效的開放權重模型家族。模型速度快、支援編輯，並使用授權及 Creative Commons 音訊素材訓練。",{"platform":148,"user":513,"quote":514},"Ed Newton-Rex（@ednewtonrex，Fairly Trained 共同創辦人）","很高興看到 Universal Music 與 Stability AI 的合作。Stable Audio 從一開始就使用授權資料集訓練，很開心看到這一進展演變成今日的消息。使用授權資料集才是正確之道。繼續前進。",{"platform":75,"user":516,"quote":517},"truncate（HN 用戶）","Spotify 上已有歌曲被聽眾誤以為是人類創作，實際上卻是 AI 生成，Spotify 不得不開始加上 AI 標籤。甚至有 AI「樂團」整張專輯都是熱門單曲。但我不認為其中任何一首稱得上真正的好音樂——音樂是主觀的，不同人有不同品味。",{"platform":82,"user":519,"quote":520},"AI Strides(aistrides.bsky.social)","Stability AI 的 Stable Audio 3.0 讓使用者能在個人裝置上生成六分鐘音軌，大幅提升音樂人與內容創作者的可及性。模型聚焦授權資料，降低法律風險，有助鼓勵更廣泛的商業採用。",{"platform":148,"user":522,"quote":523},"averyx99（@averyx99，8 位數唱片公司創辦人）","Universal Music 剛剛和解了那場本來要摧毀 AI 音樂的訴訟。身為一個擁有 27 億次串流、經營八位數唱片公司的人，我一直密切關注這件事。這個和解結果非常出乎意料。","開放權重音訊生成進入消費硬體時代，授權清晰策略為商業化應用鋪路，AI 音樂創作工具生態將加速重組。",{"category":105,"source":17,"title":526,"publishDate":6,"tier1Source":527,"supplementSources":529,"coreInfo":538,"engineerView":539,"businessView":540,"viewALabel":541,"viewBLabel":542,"bench":399,"communityQuotes":543,"verdict":93,"impact":559},"OpenAI 全力衝刺 IPO，最快九月掛牌",{"name":30,"url":528},"https://techcrunch.com/2026/05/20/openai-barrels-toward-ipo-that-may-happen-in-september/",[530,534],{"name":531,"url":532,"detail":533},"Benzinga","https://www.benzinga.com/markets/prediction-markets/26/05/52699251/openai-could-file-for-ipo-on-friday-how-the-musk-lawsuit-unlocked-acceleration","Musk 訴訟解鎖 IPO 加速的預測市場分析",{"name":535,"url":536,"detail":537},"The Next Web","https://thenextweb.com/news/openai-ipo-confidential-filing-anthropic-race","OpenAI vs Anthropic IPO 競賽報導","#### Musk 敗訴解鎖 IPO 時程\n\n2026 年 5 月 19 日，加州陪審團駁回 Elon Musk 對 OpenAI 及 Sam Altman 的訴訟，裁定提告時效已過。敗訴隔天，OpenAI 即傳出最快於 5 月 24 日秘密遞交 IPO 招股說明書草案 (confidential filing) ，目標最快 9 月掛牌，上市估值劍指逾 1 兆美元。\n\n> **名詞解釋**\n> Confidential filing（秘密申報）：美國上市程序中，企業可先向 SEC 秘密遞交招股書草案，待確認上市時程後再公開，防止計畫提前曝光。\n\n此前 CFO Sarah Friar 計畫 2026 下半年遞交文件、2027 年掛牌；法律雲霧散去後，時程大幅提前。Goldman Sachs 與 Morgan Stanley 共同主導承銷，法律顧問為 Cooley 律師事務所。\n\n#### IPO 背後的財務現實\n\nOpenAI 2026 年 3 月剛以 8,520 億美元估值完成私募，Amazon、Nvidia、SoftBank、Microsoft 等共注資 1,220 億美元。然而公司預估全年淨虧損約 140 億美元，主因為基礎設施與算力成本，同時面臨內部營收及用戶成長目標未達標的壓力。","IPO 申報文件一旦公開，將是業界首次以法律等級揭露 OpenAI 基礎設施成本與研究支出結構。工程師最值得關注的指標：年虧 140 億美元的算力成本分拆、模型訓練與推論的資本支出比例，以及是否揭示前沿模型的訓練規模。這些數字將成為整個 AI 產業「真實燒錢速度」的公開基準，對算力採購與技術選型都有參考意義。","從私募估值 8,520 億美元衝刺 1 兆美元上市，意味著 OpenAI 正在要求公開市場給予額外溢價。年虧 140 億美元加上算力成本尚未見頂，機構投資人需要判斷「成長故事能否支撐」。Musk 敗訴後，預測市場顯示 OpenAI 先於 Anthropic 上市的機率從 32% 飆至 83%——但季報透明度的壓力，才是上市後的真正挑戰。","技術實力評估","市場與投資觀點",[544,547,550,553,556],{"platform":148,"user":545,"quote":546},"@aakashg0（Aakash Gupta，產品成長分析師）","Anthropic 並非在和 OpenAI 搶著上市。數字說的是另一回事。Anthropic 剛以 3,500 億美元估值融資，IPO 目標估值也是 3,000 至 3,500 億美元——零溢價。OpenAI 融資估值 3,000 至 5,000 億美元，IPO 目標卻是 1 兆美元，跳升 2 至 3 倍。以和上一輪融資相同價格上市，不是在競賽——是在管控市場預期。",{"platform":82,"user":548,"quote":549},"Conor Sen（Bluesky，77 讚）","就在 OpenAI 傳出最快 9 月 IPO 的同一天，《華爾街日報》發出了一篇 Anthropic 財務數字相當亮眼的報導。這看起來不像是巧合。",{"platform":75,"user":551,"quote":552},"iLoveOncall(Hacker News)","等看到再說。Anthropic 或 OpenAI IPO 簡直是在簽自己的死亡證明。一旦必須提交真實數字，而不是端給投資人那盤東拼西湊的廢話大餐，估值就會歸零。",{"platform":82,"user":554,"quote":555},"bloomberg.com（Bluesky，23 讚）","即便贏了 Elon Musk 的訴訟，OpenAI 在 IPO 之路上仍面臨重重未知。",{"platform":82,"user":557,"quote":558},"George Pearkes（Bluesky，9 讚）","太平洋另一端的市場今天好不熱鬧。韓國 KOSPI 大漲 6.1%，三星、SK 海力士延續漲勢。SoftBank 集團股價飆升近 20%，受 OpenAI 及 SB Energy IPO 消息推動。","OpenAI IPO 將首次公開前沿 AI 公司真實財務結構，重塑整個 AI 產業的估值基準與資本市場預期。",{"category":561,"source":11,"title":562,"publishDate":6,"tier1Source":563,"supplementSources":566,"coreInfo":575,"engineerView":576,"businessView":577,"viewALabel":578,"viewBLabel":579,"bench":399,"communityQuotes":580,"verdict":93,"impact":584},"discourse","不用 LLM 也能做分類：傳統方法的回歸反思",{"name":564,"url":565},"softwaremaniacs.org","https://softwaremaniacs.org/blog/2026/05/18/shoppy/",[567,571],{"name":568,"url":569,"detail":570},"Lobste.rs 討論串","https://lobste.rs/s/folw9m","社群標籤與討論",{"name":572,"url":573,"detail":574},"Text Classification in the LLM Era(arXiv)","https://arxiv.org/pdf/2502.11830","學術研究：傳統方法在分類任務上的競爭力分析","#### 傳統 NLP 的底氣\n\nhighlight.js 原作者 Ivan Sagalaev 在 2026 年 5 月發表文章，介紹他為購物清單 app 打造的分類工具 Shoppy，設計刻意迴避 LLM：輸入文字先做 tokenization 與 stemming，再組合 unigrams 與 bigrams，以排序實現詞序無關性。\n\n> **名詞解釋**\n> Bigram 是兩個相鄰詞的組合；查詢時 bigrams 優先於 unigrams，讓「apple juice」優先歸類為飲料而非水果，有效解決詞義歧義。\n\n整份資料集僅約 500 筆 CSV 條目，未知詞彙直接忽略，系統仍能依已知詞彙做出合理歸類。\n\n#### 工具選擇應匹配問題規模\n\n作者明確指出此方案「更簡單、本機運行、免費、且具倫理性」，直指 LLM 方案的四個隱性成本：複雜度、網路依賴、API 費用、隱私疑慮。\n\n學術研究 (arXiv 2025-02) 亦指出，傳統方法在特定分類任務上仍具競爭力，成本遠低於 LLM 推論。本文意義不在技術創新，而在提供「工具選型應匹配問題規模」的清晰實踐示範。","Bigram 優先 + stemming 組合在封閉領域（固定商品詞彙）表現穩定、易維護。整體堆疊輕量：後端 Django、前端原生 HTML + 現代 CSS，無需重型 JS 框架。\n\n在詞彙域固定、資料集小的情境下，規則系統往往比串接 LLM API 更易除錯、更可預測，且省去 rate limit 與網路延遲的顧慮。","每次 LLM 推論的 API 費用、資料隱私合規、第三方服務依賴，在分類邏輯固定的中小型應用中可能都是過度投資。\n\n傳統 NLP 方案能帶來更可控的成本結構、更高的資料主權，並避免廠商鎖定風險。技術選型應先問：「問題規模是否值得 LLM 的代價？」","實務觀點","產業結構影響",[581],{"platform":148,"user":582,"quote":583},"@ljvmiranda（Explosion AI / Prodigy 貢獻者）","文字分類範例的標注有個常見難題：類別不平衡——要標注數千筆才能找到那個稀有類別，實在令人頭疼。結果發現，LLM 非常適合這項工作。因此，我們推出了以 GPT-3 驅動的 Prodigy textcat 標注配方！","特定領域分類問題中，傳統 NLP 手段成本更低、更具隱私性，值得在採用 LLM 前納入技術選型評估。",{"category":105,"source":16,"title":586,"publishDate":6,"tier1Source":587,"supplementSources":589,"coreInfo":596,"engineerView":597,"businessView":598,"viewALabel":541,"viewBLabel":542,"bench":599,"communityQuotes":600,"verdict":93,"impact":607},"Nvidia 再創營收紀錄，持有 430 億美元新創投資部位",{"name":30,"url":588},"https://techcrunch.com/2026/05/20/nvidia-posts-another-record-quarter-reveals-43-billion-of-holdings-in-startups/",[590,593],{"name":591,"url":592},"Fortune","https://fortune.com/2026/05/20/nvidia-q1-earnings-forecast-dividend-stock-buybacks/",{"name":594,"url":595},"StockTitan","https://www.stocktitan.net/news/NVDA/nvidia-announces-financial-results-for-first-quarter-fiscal-fq78amc9h84m.html","#### 季度亮點：再創歷史新高\n\nNvidia FY2027 Q1（截至 2026 年 4 月）總營收達 **816 億美元**，年增 85%、季增 20%，創歷史新高。調整後 EPS $1.87 優於市場預估 $1.77。Blackwell 架構已被全球每家主要超大規模雲端商及模型開發商採用，資料中心單季營收 **752 億美元**，佔比高達 92%。\n\n#### 新創版圖：430 億美元的股權布局\n\nNvidia 本季未上市股權持倉從年初 220 億美元**翻倍至 430 億美元**，單季買入 185 億美元（前季僅 6.49 億美元），投資節奏急遽加速。\n\n> **名詞解釋**\n> 非上市股權 (non-marketable equity securities) ：持有尚未公開上市的新創公司股份，流動性低、但潛在回報高。\n\n這筆 430 億尚不含已公告的 300 億美元 OpenAI 承諾及已上市股票持倉，Nvidia 正以「算力供應換股權」的策略建立 AI 生態版圖。Q2 指引約 910 億美元 (±2%) ，季增幅降至約 12%，略低於市場預期。","Blackwell 架構獲全球主要雲端商與模型開發商全面採用，技術護城河短期難被動搖。AMD 和 Google TPU 雖在追趕，但 Nvidia 同步布局 CPU 業務（今年預計達 200 億美元），朝全棧基礎設施供應商演進。工程師所依賴的 CUDA 生態系黏著度持續加深，短期內遷移成本極高。","430 億美元未上市股權加上 OpenAI 的 300 億承諾，顯示 Nvidia 不僅賣硬體，更以算力換股權構建生態控制力。800 億美元回購計畫與股息從 $0.01 升至 $0.25，向市場傳遞強烈財務信心。但 Q2 指引季增幅降至 12%，高速成長是否可持續仍是投資人最大疑慮。","#### 財務基準\n\n- 總營收：816 億美元（年增 85%、季增 20%）\n- 資料中心：752 億美元（佔比 92%）\n- 調整後 EPS：$1.87（優於預估 $1.77）\n- Q2 指引：約 910 億美元 (±2%)\n- 新創股權部位：430 億美元（本季淨增 185 億）",[601,604],{"platform":148,"user":602,"quote":603},"@TechCrunch（科技媒體）","在過去兩年間，Nvidia 利用其不斷增長的財富，投資了逾 80 家 AI 新創公司。以下是這家半導體巨頭最大規模的幾筆投資。",{"platform":148,"user":605,"quote":606},"@NOTUSreports（政治新聞媒體）","SBA 局長 Kelly Loeffler 在私人 AI 新創公司 Groq 獲得 Nvidia 高利潤合約的數個月前，投入了 300 萬美元投資。","Nvidia 以算力換股權策略深度綁定 AI 生態系，超大規模算力需求仍是市場主旋律","#### 社群熱議排行\n\n今日五大熱議主題（依社群討論熱度排序）：\n\n- **DeepSeek Code 挑戰 Claude Code**：spacedcowboy(HN) 稱月費從 £200 降至 £18，成本壓縮實測爆發，X 上同步流傳三模型組合工作流。\n- **OpenAI 推翻離散幾何猜想**：timkellogg.me（Bluesky，35 likes）：「決策數量遠超任何人類可行探索範圍。」\n- **Anthropic 首季獲利在望**：Ed Zitron（Bluesky，304 upvotes）質疑算力合約義務高達 1.25 兆美元。\n- **GitHub 供應鏈攻擊**：echobit.de（Bluesky，40 upvotes）諷刺「GitHub 現在是開源的了」。\n- **Guardrails 讓 8B 模型 agentic 可靠性從 53% 升至 99%**：HN 社群熱議自托管替代前沿 API 可行性。\n\n#### 技術爭議與分歧\n\n**DeepSeek vs. 前沿模型**：spacedcowboy(HN) 實測：「把訂閱費從 £200 降至 £18，大多數工作交給 DeepSeek，只用 Claude 驗證假設。」\n\njosephg(HN) 反駁：「DeepSeek 在高層設計選擇差距很大，更容易陷入打地鼠式修 bug 迴圈；我停下讓 opus 解同一問題，opus 立刻看出了解法。」\n\n**Anthropic 獲利真實性**：Bill Gurley(Benchmark Capital) 批評：「以低於成本的價格轉售 NVIDIA token 是拉抬帳面營收的捷徑。情況很複雜。」\n\nthis_user(HN) 反駁：「錢在企業端，不在補貼消費者的訂閱方案；市場想看到的正是一條可信的獲利路徑。」\n\n#### 實戰經驗\n\n「@LottoLabs(X) ：在 3090 上跑 Qwen 27b，搭配 Hermes agent 使用 7 天，保守估計 80% 快取命中率；27b 能力介於 Sonnet 和 5.4 mini 之間。」\n\n「spacedcowboy(HN) ：Claude Code + DeepSeek Flash 後端，月費從 £200 降至 £18，任務涵蓋為 FPGA 設計 HDL 並寫最終 CPU 的編譯器——並非瑣碎任務。」\n\n「somethingsome(HN) ：在 2x L40S 用 vLLM 跑 Forge 護欄，遇 model name 問題後以 --served-model-name 別名解決；8B 模型 agentic 可靠性確認從 53% 升至 99%。」\n\n#### 未解問題與社群預期\n\nOpenAI 數學突破後，doginasuit(HN) 提出核心質疑：「AI 推理不過是遞迴迭代自身輸出，每次改進都在遞減。」官方至今未回應，也未宣布是否開放推理模型。\n\nGitHub 供應鏈攻擊後，LiamPowell(HN) 批評：「擴充套件從來就不需要未沙箱化存取權，這是他們主動的選擇。」微軟尚未宣布強制沙箱化時間表。\n\nMeta 在中東封鎖人權帳號後，yourdigitalbrain.bsky.social（Bluesky，6 讚）追問：「當局究竟會走到多遠來控制輿論敘事？」社群期待歐盟 DSA 介入，但 Meta 正式回應至今缺席。",[610,612,614,616,618,620,622,624],{"type":96,"text":611},"將 DeepSeek V4-Flash 接入 Claude Code 作為後端，以 2 週 A/B 測試比較成本與品質差距——spacedcowboy 實測月費從 £200 降至 £18，但 josephg 提醒高層設計任務仍需前沿模型驗收。",{"type":96,"text":613},"用 o3、o4-mini 或 Claude Opus 向模型提出你所在領域的一個已知開放問題，觀察它是否能自主識別反證方向或引入跨領域工具。",{"type":99,"text":615},"設計「AI 生成猜測路徑 + Lean 4 形式化驗證」混合流程，探索在研究或工程問題中自動化反例搜尋。",{"type":99,"text":617},"盤點現有 MCP server 清單，記錄哪些工具在 DeepSeek Code 發布後可直接遷移，提前建立相容性評估基線。",{"type":99,"text":619},"若產品涵蓋受地理管制地區的用戶，建立封鎖預案：含用戶通知機制、替代接觸管道（自架伺服器或 RSS 訂閱）及跨地區服務可用性監控。",{"type":102,"text":621},"追蹤 OpenAI 是否開放此次數學推理模型，以及 DeepMind AlphaProof 的對標進展——兩者將決定 AI 數學推理能力的下一個里程碑。",{"type":102,"text":623},"關注 Anthropic 全年財務揭露與 xAI Colossus 擴建進展；若 DeepSeek Code 走 MIT 授權，市場格局將在 6 個月內出現結構性變化。",{"type":102,"text":625},"追蹤 OpenAI IPO 進度與 Meta 透明度中心的內容限制報告更新，兩者均是 AI 商業化與平台治理走向的先行指標。","今日的 AI 版圖在三個維度同步擴張：推理能力抵達了人類無法踏入的數學疆域，商業模型在企業垂直化驅動下觸及獲利臨界點，而開源生態以極低成本重組了工具鏈的可及性。\n\n但擴張帶來的不僅是機會。GitHub 供應鏈漏洞提醒每位開發者，本機環境已是新攻擊面；Meta 在中東的封鎖操作則指出，平台治理尚無法應對國家級的內容控制壓力。\n\n最值得關注的訊號是 Anthropic 獲利路徑的浮現——這意味著 AI 服務正在從「燒錢換市佔」轉向「實際創造價值」的新階段，定價、合規與企業整合將成為下半年競爭的核心戰場。",{"prev":328,"next":628},"2026-05-22",{"data":630,"body":631,"excerpt":-1,"toc":641},{"title":399,"description":46},{"type":632,"children":633},"root",[634],{"type":635,"tag":636,"props":637,"children":638},"element","p",{},[639],{"type":640,"value":46},"text",{"title":399,"searchDepth":642,"depth":642,"links":643},2,[],{"data":645,"body":646,"excerpt":-1,"toc":652},{"title":399,"description":50},{"type":632,"children":647},[648],{"type":635,"tag":636,"props":649,"children":650},{},[651],{"type":640,"value":50},{"title":399,"searchDepth":642,"depth":642,"links":653},[],{"data":655,"body":656,"excerpt":-1,"toc":662},{"title":399,"description":53},{"type":632,"children":657},[658],{"type":635,"tag":636,"props":659,"children":660},{},[661],{"type":640,"value":53},{"title":399,"searchDepth":642,"depth":642,"links":663},[],{"data":665,"body":666,"excerpt":-1,"toc":672},{"title":399,"description":56},{"type":632,"children":667},[668],{"type":635,"tag":636,"props":669,"children":670},{},[671],{"type":640,"value":56},{"title":399,"searchDepth":642,"depth":642,"links":673},[],{"data":675,"body":676,"excerpt":-1,"toc":820},{"title":399,"description":399},{"type":632,"children":677},[678,685,690,703,708,714,719,731,743,748,766,772,777,782,787,792,798,810,815],{"type":635,"tag":679,"props":680,"children":682},"h4",{"id":681},"離散幾何的世紀猜想與-ai-的反證",[683],{"type":640,"value":684},"離散幾何的世紀猜想與 AI 的反證",{"type":635,"tag":636,"props":686,"children":687},{},[688],{"type":640,"value":689},"1946 年，匈牙利數學家 Paul Erdős 提出「平面單位距離問題」：在平面上放 n 個點，最多能有多少對點之間的距離恰好為 1？近 80 年來，數學界普遍相信正方格點陣列 (square grid) 是最優構造，沒有任何方法能突破其上界。",{"type":635,"tag":636,"props":691,"children":692},{},[693,695,701],{"type":640,"value":694},"2026 年 5 月 20 日，OpenAI 宣布旗下一個內部通用推理模型",{"type":635,"tag":696,"props":697,"children":698},"strong",{},[699],{"type":640,"value":700},"自主反證",{"type":640,"value":702},"了這一猜想，找到一族全新構造，使得 n 個點可產生至少 n^(1+δ) （δ 為某固定正指數）對單位距離，遠遠超越傳統格點上界。此結果通過外部同行評審，Noga Alon、Melanie Wood、Thomas Bloom 等頂尖數學家均公開背書認可。",{"type":635,"tag":636,"props":704,"children":705},{},[706],{"type":640,"value":707},"值得一提的歷史背景：2025 年 10 月，OpenAI 前 VP Kevin Weil 曾誤稱 GPT-5 解決了 10 道 Erdős 開放問題，遭 Yann LeCun、Demis Hassabis 等人批評後刪文。而這次背書認可的數學家，正是當初提出批評的那些人，這讓本次結果的可信度格外突出。",{"type":635,"tag":679,"props":709,"children":711},{"id":710},"o3-mini-如何找到反例技術細節拆解",[712],{"type":640,"value":713},"o3-mini 如何找到反例：技術細節拆解",{"type":635,"tag":636,"props":715,"children":716},{},[717],{"type":640,"value":718},"模型突破的核心在於放棄傳統的高斯整數 (Gaussian integers) 框架，轉而採用代數數論的複雜數域推廣。傳統做法在高斯整數環內尋找具有特定單位距離性質的點集，但其對稱性不足，難以突破線性上界。",{"type":635,"tag":636,"props":720,"children":721},{},[722,724,729],{"type":640,"value":723},"模型採用的關鍵工具是",{"type":635,"tag":696,"props":725,"children":726},{},[727],{"type":640,"value":728},"無限類域塔 (infinite class field towers)",{"type":640,"value":730},"：透過構造一系列巢狀的數域擴張，讓底層代數結構具備更豐富的對稱性，從而製造出遠多於格點的單位長度差值對。",{"type":635,"tag":636,"props":732,"children":733},{},[734,736,741],{"type":640,"value":735},"第二個核心工具是",{"type":635,"tag":696,"props":737,"children":738},{},[739],{"type":640,"value":740},"Golod–Shafarevich 理論",{"type":640,"value":742},"，用以嚴格保證所需的無限類域塔確實存在，為整個反證提供數學嚴格性。整個解題過程由模型獨立完成：問題敘述由人工輸入，但無任何逐步引導或半完成草稿，模型直接產出可供人工閱讀的完整論文。",{"type":635,"tag":636,"props":744,"children":745},{},[746],{"type":640,"value":747},"數學家 trostaft（HN，數學博士後）評述：這個證明確實受文獻既有結果啟發，但其中的調整是不平凡的 (non-trivial) 。",{"type":635,"tag":749,"props":750,"children":751},"blockquote",{},[752],{"type":635,"tag":636,"props":753,"children":754},{},[755,760,764],{"type":635,"tag":696,"props":756,"children":757},{},[758],{"type":640,"value":759},"名詞解釋",{"type":635,"tag":761,"props":762,"children":763},"br",{},[],{"type":640,"value":765},"\n高斯整數：複數平面上實部與虛部皆為整數的數（如 3+4i），是數論中研究整除性的基本代數結構，也是傳統單位距離問題的標準代數背景。",{"type":635,"tag":679,"props":767,"children":769},{"id":768},"數學界的反應興奮與質疑並存",[770],{"type":640,"value":771},"數學界的反應：興奮與質疑並存",{"type":635,"tag":636,"props":773,"children":774},{},[775],{"type":640,"value":776},"Fields Medal 得主 Tim Gowers 將此成果稱為「AI 數學領域的一個里程碑」，數論學家 Arul Shankar 指出此結果證明 AI 能夠「產生真正原創的想法」。",{"type":635,"tag":636,"props":778,"children":779},{},[780],{"type":640,"value":781},"Thomas Bloom 則進一步指出，這一發現暗示「深層數論可能對離散幾何中若干未解問題提供解答」，為後續研究開拓了新方向。",{"type":635,"tag":636,"props":783,"children":784},{},[785],{"type":640,"value":786},"然而，Hacker News 討論串中的質疑同樣清晰。用戶 mooreat 認為這本質上是「找到一個反例」而非「發展新的深層數學」，模型執行的可能是「把現有想法串連起來的高階搜尋」。",{"type":635,"tag":636,"props":788,"children":789},{},[790],{"type":640,"value":791},"用戶 isotypic 擔憂數學家未來將淪為「讀取存在於 LLM 權重中的幽靈教科書的讀者」，數學實踐退化為提示詞工程。對於「自 2023 年以來 AI 推理品質提升都只靠更多算力」的懷疑，社群也並未完全打消。",{"type":635,"tag":679,"props":793,"children":795},{"id":794},"ai-輔助數學研究的未來走向",[796],{"type":640,"value":797},"AI 輔助數學研究的未來走向",{"type":635,"tag":636,"props":799,"children":800},{},[801,803,808],{"type":640,"value":802},"此次成果最重要的意義，可能不在於「AI 解決了難題」，而在於",{"type":635,"tag":696,"props":804,"children":805},{},[806],{"type":640,"value":807},"AI 採取了逆向路徑",{"type":640,"value":809},"——大多數人類數學家把研究資源投入在正面構造，而模型卻獨立走向了反證方向，並從代數數論中找到了支撐工具。",{"type":635,"tag":636,"props":811,"children":812},{},[813],{"type":640,"value":814},"HN 用戶 horhay 提供了較為平衡的視角：這件事確實了不起，但並不超出 AI 近期在數學領域成功模式的範圍，不需要敲響警報——真正的份量在於結果本身的事實重量，而非對 AI 能力的誇大解讀。",{"type":635,"tag":636,"props":816,"children":817},{},[818],{"type":640,"value":819},"這一框架提示我們：AI 輔助數學研究可能最先在「反例搜尋」和「跨領域工具遷移」兩個場景中發揮作用，而不是在「從零構建全新理論」上。",{"title":399,"searchDepth":642,"depth":642,"links":821},[],{"data":823,"body":825,"excerpt":-1,"toc":831},{"title":399,"description":824},"OpenAI 這次反證的核心技術突破，在於模型主動跨越了近 80 年數學研究的「思維定式」——放棄高斯整數框架，轉向代數數論的複雜數域推廣。傳統方法礙於高斯整數的對稱性限制，無法突破格點上界；而新方法透過構造具有更豐富代數結構的數域，讓「製造單位距離對」這件事在更深層的代數空間中得以實現。",{"type":632,"children":826},[827],{"type":635,"tag":636,"props":828,"children":829},{},[830],{"type":640,"value":824},{"title":399,"searchDepth":642,"depth":642,"links":832},[],{"data":834,"body":836,"excerpt":-1,"toc":842},{"title":399,"description":835},"高斯整數（形如 a+bi 的複數）是傳統單位距離問題的標準代數背景，其對稱群相對簡單。模型選擇的替代方案是代數數域的推廣：在這些更複雜的數域中，同一個「長度為 1」的條件對應到更多不同的代數元素對，從而能構造出密度更高的單位距離點集。",{"type":632,"children":837},[838],{"type":635,"tag":636,"props":839,"children":840},{},[841],{"type":640,"value":835},{"title":399,"searchDepth":642,"depth":642,"links":843},[],{"data":845,"body":847,"excerpt":-1,"toc":868},{"title":399,"description":846},"無限類域塔是一系列巢狀的數域擴張鏈，每個擴張都在前一層基礎上添加新的代數對稱性。模型利用這個工具，在每一層數域中都能找到更多滿足單位距離條件的點對，累積效應使整體點對數突破了傳統格點的多項式上界，達到 n^(1+δ) 。",{"type":632,"children":848},[849,853],{"type":635,"tag":636,"props":850,"children":851},{},[852],{"type":640,"value":846},{"type":635,"tag":749,"props":854,"children":855},{},[856],{"type":635,"tag":636,"props":857,"children":858},{},[859,863,866],{"type":635,"tag":696,"props":860,"children":861},{},[862],{"type":640,"value":759},{"type":635,"tag":761,"props":864,"children":865},{},[],{"type":640,"value":867},"\n無限類域塔：代數數論中一種特殊的數域擴張序列，由 Golod 與 Shafarevich 在 1964 年證明其存在，最初用於解決 Burnside 問題的一般情形。",{"title":399,"searchDepth":642,"depth":642,"links":869},[],{"data":871,"body":873,"excerpt":-1,"toc":903},{"title":399,"description":872},"即使找到了一個構造方向，數學嚴格性要求必須證明這樣的無限類域塔確實存在。Golod–Shafarevich 定理（1964 年）在代數 K 理論框架下，以群展示的生成元與關係子數量關係，嚴格確保某類數域上的無限類域塔存在性，為整個反證提供最後的保障。",{"type":632,"children":874},[875,887],{"type":635,"tag":636,"props":876,"children":877},{},[878,880,885],{"type":640,"value":879},"即使找到了一個構造方向，數學嚴格性要求必須",{"type":635,"tag":696,"props":881,"children":882},{},[883],{"type":640,"value":884},"證明",{"type":640,"value":886},"這樣的無限類域塔確實存在。Golod–Shafarevich 定理（1964 年）在代數 K 理論框架下，以群展示的生成元與關係子數量關係，嚴格確保某類數域上的無限類域塔存在性，為整個反證提供最後的保障。",{"type":635,"tag":749,"props":888,"children":889},{},[890],{"type":635,"tag":636,"props":891,"children":892},{},[893,898,901],{"type":635,"tag":696,"props":894,"children":895},{},[896],{"type":640,"value":897},"白話比喻",{"type":635,"tag":761,"props":899,"children":900},{},[],{"type":640,"value":902},"\n想像傳統數學家在一個 8×8 棋盤上找「距離恰好 1」的棋子對，而模型在一個「多層棋盤疊加體」上操作——每層棋盤之間有規律的代數對應關係，讓「距離 1」的對數在每層累積，最終突破了只在單一棋盤上能達到的上限。",{"title":399,"searchDepth":642,"depth":642,"links":904},[],{"data":906,"body":907,"excerpt":-1,"toc":1024},{"title":399,"description":399},{"type":632,"children":908},[909,914,939,944,967,972,977,982,995,1000,1013,1019],{"type":635,"tag":679,"props":910,"children":912},{"id":911},"競爭版圖",[913],{"type":640,"value":911},{"type":635,"tag":915,"props":916,"children":917},"ul",{},[918,929],{"type":635,"tag":919,"props":920,"children":921},"li",{},[922,927],{"type":635,"tag":696,"props":923,"children":924},{},[925],{"type":640,"value":926},"直接競品",{"type":640,"value":928},"：DeepMind AlphaProof（專注形式化數學）、Wolfram Alpha（符號計算）、Lean/Coq 形式化驗證工具",{"type":635,"tag":919,"props":930,"children":931},{},[932,937],{"type":635,"tag":696,"props":933,"children":934},{},[935],{"type":640,"value":936},"間接競品",{"type":640,"value":938},"：通用推理模型（Gemini 2.5、Claude Opus）在數學助理場景的應用",{"type":635,"tag":679,"props":940,"children":942},{"id":941},"護城河類型",[943],{"type":640,"value":941},{"type":635,"tag":915,"props":945,"children":946},{},[947,957],{"type":635,"tag":919,"props":948,"children":949},{},[950,955],{"type":635,"tag":696,"props":951,"children":952},{},[953],{"type":640,"value":954},"工程護城河",{"type":640,"value":956},"：OpenAI 此次使用的是內部通用推理模型而非特化數學模型，暗示其基礎推理能力已延伸至數學基礎研究，形成差距",{"type":635,"tag":919,"props":958,"children":959},{},[960,965],{"type":635,"tag":696,"props":961,"children":962},{},[963],{"type":640,"value":964},"生態護城河",{"type":640,"value":966},"：與 Tim Gowers、Thomas Bloom 等頂尖數學家建立的公信力合作關係，為未來 AI 數學研究背書提供可信度基礎",{"type":635,"tag":679,"props":968,"children":970},{"id":969},"定價策略",[971],{"type":640,"value":969},{"type":635,"tag":636,"props":973,"children":974},{},[975],{"type":640,"value":976},"目前 OpenAI 未宣布針對數學研究的專屬產品定價，成果以技術論文形式公開發布。但此類突破性成果是強力品牌資產，可支撐 o-series 推理模型在高端研究場景的定價溢價。",{"type":635,"tag":679,"props":978,"children":980},{"id":979},"企業導入阻力",[981],{"type":640,"value":979},{"type":635,"tag":915,"props":983,"children":984},{},[985,990],{"type":635,"tag":919,"props":986,"children":987},{},[988],{"type":640,"value":989},"外部無法存取此次使用的內部模型，難以直接複現效果",{"type":635,"tag":919,"props":991,"children":992},{},[993],{"type":640,"value":994},"數學研究界的信任建立需要長期積累，單一成果不足以改變研究機構的工作流程",{"type":635,"tag":679,"props":996,"children":998},{"id":997},"第二序影響",[999],{"type":640,"value":997},{"type":635,"tag":915,"props":1001,"children":1002},{},[1003,1008],{"type":635,"tag":919,"props":1004,"children":1005},{},[1006],{"type":640,"value":1007},"若 AI 能系統性解決開放猜想，學術發表流程和同行評審機制將面臨根本性重構",{"type":635,"tag":919,"props":1009,"children":1010},{},[1011],{"type":640,"value":1012},"數學訓練資料和教育體系可能被倒逼重新設計，「找到反例」類型問題的研究方法論將改變",{"type":635,"tag":679,"props":1014,"children":1016},{"id":1015},"判決里程碑確立但短期難以複現與商業化",[1017],{"type":640,"value":1018},"判決里程碑確立（但短期難以複現與商業化）",{"type":635,"tag":636,"props":1020,"children":1021},{},[1022],{"type":640,"value":1023},"AI 在數學基礎研究的里程碑意義已確立，但距離系統性輔助工具的商業成熟仍有相當距離。對大多數組織而言，正確態度是持續追蹤整體趨勢，而非立即投入資源部署。",{"title":399,"searchDepth":642,"depth":642,"links":1025},[],{"data":1027,"body":1028,"excerpt":-1,"toc":1046},{"title":399,"description":399},{"type":632,"children":1029},[1030,1036,1041],{"type":635,"tag":679,"props":1031,"children":1033},{"id":1032},"與既有-ai-數學成果對比",[1034],{"type":640,"value":1035},"與既有 AI 數學成果對比",{"type":635,"tag":636,"props":1037,"children":1038},{},[1039],{"type":640,"value":1040},"過去 AI 在數學上的突破多屬於「已知答案的搜尋最佳化」（如 AlphaProof 在 IMO 問題上的表現）或「形式化驗證輔助」。此次反證的特殊之處在於：問題已開放近 80 年，且此前數學界在正面方向投入大量研究卻未能突破，AI 卻從反方向自主找到路徑。",{"type":635,"tag":636,"props":1042,"children":1043},{},[1044],{"type":640,"value":1045},"若以「獨立性」和「問題年齡」衡量，此次成果是迄今為止 AI 在基礎數學研究中最具分量的單一結果，優於 2025 年 AlphaProof 在 IMO 競賽題上的表現——後者為有明確答案的競賽題，而非持續 80 年的開放猜想。",{"title":399,"searchDepth":642,"depth":642,"links":1047},[],{"data":1049,"body":1050,"excerpt":-1,"toc":1067},{"title":399,"description":399},{"type":632,"children":1051},[1052],{"type":635,"tag":915,"props":1053,"children":1054},{},[1055,1059,1063],{"type":635,"tag":919,"props":1056,"children":1057},{},[1058],{"type":640,"value":62},{"type":635,"tag":919,"props":1060,"children":1061},{},[1062],{"type":640,"value":63},{"type":635,"tag":919,"props":1064,"children":1065},{},[1066],{"type":640,"value":64},{"title":399,"searchDepth":642,"depth":642,"links":1068},[],{"data":1070,"body":1071,"excerpt":-1,"toc":1084},{"title":399,"description":399},{"type":632,"children":1072},[1073],{"type":635,"tag":915,"props":1074,"children":1075},{},[1076,1080],{"type":635,"tag":919,"props":1077,"children":1078},{},[1079],{"type":640,"value":66},{"type":635,"tag":919,"props":1081,"children":1082},{},[1083],{"type":640,"value":67},{"title":399,"searchDepth":642,"depth":642,"links":1085},[],{"data":1087,"body":1088,"excerpt":-1,"toc":1094},{"title":399,"description":71},{"type":632,"children":1089},[1090],{"type":635,"tag":636,"props":1091,"children":1092},{},[1093],{"type":640,"value":71},{"title":399,"searchDepth":642,"depth":642,"links":1095},[],{"data":1097,"body":1098,"excerpt":-1,"toc":1104},{"title":399,"description":72},{"type":632,"children":1099},[1100],{"type":635,"tag":636,"props":1101,"children":1102},{},[1103],{"type":640,"value":72},{"title":399,"searchDepth":642,"depth":642,"links":1105},[],{"data":1107,"body":1108,"excerpt":-1,"toc":1114},{"title":399,"description":117},{"type":632,"children":1109},[1110],{"type":635,"tag":636,"props":1111,"children":1112},{},[1113],{"type":640,"value":117},{"title":399,"searchDepth":642,"depth":642,"links":1115},[],{"data":1117,"body":1118,"excerpt":-1,"toc":1124},{"title":399,"description":121},{"type":632,"children":1119},[1120],{"type":635,"tag":636,"props":1121,"children":1122},{},[1123],{"type":640,"value":121},{"title":399,"searchDepth":642,"depth":642,"links":1125},[],{"data":1127,"body":1128,"excerpt":-1,"toc":1134},{"title":399,"description":124},{"type":632,"children":1129},[1130],{"type":635,"tag":636,"props":1131,"children":1132},{},[1133],{"type":640,"value":124},{"title":399,"searchDepth":642,"depth":642,"links":1135},[],{"data":1137,"body":1138,"excerpt":-1,"toc":1144},{"title":399,"description":127},{"type":632,"children":1139},[1140],{"type":635,"tag":636,"props":1141,"children":1142},{},[1143],{"type":640,"value":127},{"title":399,"searchDepth":642,"depth":642,"links":1145},[],{"data":1147,"body":1148,"excerpt":-1,"toc":1243},{"title":399,"description":399},{"type":632,"children":1149},[1150,1156,1161,1166,1171,1177,1182,1187,1192,1198,1203,1208,1223,1228,1233,1238],{"type":635,"tag":679,"props":1151,"children":1153},{"id":1152},"首季獲利anthropic-營收翻倍至-109-億美元",[1154],{"type":640,"value":1155},"首季獲利：Anthropic 營收翻倍至 109 億美元",{"type":635,"tag":636,"props":1157,"children":1158},{},[1159],{"type":640,"value":1160},"Anthropic 向最新融資輪投資人揭露的財務預測顯示，公司預計在 2026 年第二季實現營業獲利，Q2 預估營收約為 109 億美元，較上一季翻倍以上成長。",{"type":635,"tag":636,"props":1162,"children":1163},{},[1164],{"type":640,"value":1165},"這是 Anthropic 自 2021 年創立以來首次觸及獲利門檻，預計 Q2 營業利潤約為 5.59 億美元，從先前投資人文件中「全年不獲利」的預期發生重大轉變。",{"type":635,"tag":636,"props":1167,"children":1168},{},[1169],{"type":640,"value":1170},"然而 Anthropic 同時警示，由於高額算力成本，全年獲利能力仍存在不確定性——即便單季獲利，不代表商業模式已完全建立。此消息由 Wall Street Journal 首先報導，Anthropic 被詢問時拒絕進一步置評。",{"type":635,"tag":679,"props":1172,"children":1174},{"id":1173},"月付-125-億美元與-xai-的算力交易始末",[1175],{"type":640,"value":1176},"月付 12.5 億美元：與 xAI 的算力交易始末",{"type":635,"tag":636,"props":1178,"children":1179},{},[1180],{"type":640,"value":1181},"2026 年 5 月，SpaceX 提交 S-1 SEC 申報文件時意外揭露一項震驚業界的合約：Anthropic 與 Elon Musk 旗下的 xAI 達成龐大算力採購協議，每月支付高達 12.5 億美元，合約效期至 2029 年 5 月，總合約金額逾 400 億美元。",{"type":635,"tag":636,"props":1183,"children":1184},{},[1185],{"type":640,"value":1186},"xAI 提供的是位於田納西州孟菲斯的 Colossus 1 資料中心，Anthropic 一口氣包下該設施全部 300 百萬瓦的算力輸出。此交易的背景是 xAI 自家 Grok 用戶參與度下滑，導致閒置算力有餘裕可對外出售——xAI 自身將此定義為「將我們基礎設施的閒置算力貨幣化」。",{"type":635,"tag":636,"props":1188,"children":1189},{},[1190],{"type":640,"value":1191},"合約設有靈活的退出機制：雙方均可提前 90 天通知終止。xAI 也表示預期將與其他廠商簽署類似的服務合約，顯示其正在將算力出租轉型為常態業務。",{"type":635,"tag":679,"props":1193,"children":1195},{"id":1194},"從燒錢到獲利ai-新創商業模式轉捩點",[1196],{"type":640,"value":1197},"從燒錢到獲利：AI 新創商業模式轉捩點",{"type":635,"tag":636,"props":1199,"children":1200},{},[1201],{"type":640,"value":1202},"Anthropic 能走向獲利，關鍵在於客戶結構的多元化擴張。公司近期推出面向小企業主的專屬服務，並針對律師事務所等專業族群導入垂直工具，Claude 在企業專業人士中的採用率顯著提升。",{"type":635,"tag":636,"props":1204,"children":1205},{},[1206],{"type":640,"value":1207},"這印證了一個長期備受爭議的命題：大型語言模型的推論本身可以有正毛利，真正拖累財務的是訓練成本與研發投入。當企業客戶願意為生產力工具付出溢價，且模型服務邊際成本持續下降，獲利路徑便逐漸清晰。",{"type":635,"tag":749,"props":1209,"children":1210},{},[1211],{"type":635,"tag":636,"props":1212,"children":1213},{},[1214,1218,1221],{"type":635,"tag":696,"props":1215,"children":1216},{},[1217],{"type":640,"value":759},{"type":635,"tag":761,"props":1219,"children":1220},{},[],{"type":640,"value":1222},"\nARR（年化經常性收入）：將當季或當月訂閱收入乘以 12，用來衡量訂閱制業務的規模；不代表實際全年收入，但常作為投資人評估成長動能的指標。",{"type":635,"tag":679,"props":1224,"children":1226},{"id":1225},"對產業競爭格局的連鎖效應",[1227],{"type":640,"value":1225},{"type":635,"tag":636,"props":1229,"children":1230},{},[1231],{"type":640,"value":1232},"此消息曝光的時間點恰與 OpenAI 預期於 2026 年 9 月申請 IPO 高度重疊，兩家頂級 AI 實驗室同時走向「商業成熟」里程碑，標誌著 AI 新創從燒錢擴張轉向獲利導向的結構性拐點。",{"type":635,"tag":636,"props":1234,"children":1235},{},[1236],{"type":640,"value":1237},"更引人注目的是，Anthropic 選擇向直接競爭對手 xAI 採購算力，而非自建或仰賴傳統雲端供應商。這折射出當前 AI 算力市場的極度稀缺：即便存在競爭關係，業者也必須跨越邊界尋求務實合作。",{"type":635,"tag":636,"props":1239,"children":1240},{},[1241],{"type":640,"value":1242},"這種「競合」模式或許將成為頂級 AI 實驗室的新常態——在訓練與產品層面激烈競爭，卻在基礎設施層面共享稀缺資源。",{"title":399,"searchDepth":642,"depth":642,"links":1244},[],{"data":1246,"body":1247,"excerpt":-1,"toc":1294},{"title":399,"description":399},{"type":632,"children":1248},[1249,1254,1259,1264,1269,1284,1289],{"type":635,"tag":679,"props":1250,"children":1252},{"id":1251},"核心團隊",[1253],{"type":640,"value":1251},{"type":635,"tag":636,"props":1255,"children":1256},{},[1257],{"type":640,"value":1258},"CEO Dario Amodei 與總裁 Daniela Amodei 均為前 OpenAI 核心成員，兩人率領超過千名員工的研究與工程團隊。公司以「負責任的 AI 開發」為核心使命，同時快速推進商業化。",{"type":635,"tag":679,"props":1260,"children":1262},{"id":1261},"技術壁壘",[1263],{"type":640,"value":1261},{"type":635,"tag":636,"props":1265,"children":1266},{},[1267],{"type":640,"value":1268},"Claude 系列模型（Sonnet、Opus、Haiku）在程式撰寫、長文脈推理等多項基準測試中位居前列。Anthropic 自主研發 Constitutional AI 訓練方法，並在企業合規場景中積累了差異化的客戶信任。",{"type":635,"tag":749,"props":1270,"children":1271},{},[1272],{"type":635,"tag":636,"props":1273,"children":1274},{},[1275,1279,1282],{"type":635,"tag":696,"props":1276,"children":1277},{},[1278],{"type":640,"value":759},{"type":635,"tag":761,"props":1280,"children":1281},{},[],{"type":640,"value":1283},"\nConstitutional AI：Anthropic 開發的一種訓練方法，透過讓模型依據一套「憲法」原則自我批評與修正，以減少有害輸出，不需要大量人工標注。",{"type":635,"tag":679,"props":1285,"children":1287},{"id":1286},"技術成熟度",[1288],{"type":640,"value":1286},{"type":635,"tag":636,"props":1290,"children":1291},{},[1292],{"type":640,"value":1293},"Claude 3.5／4 系列已進入 GA（正式可用）階段，API 大規模商業化部署。Dario Amodei 曾公開表示推論毛利率已超過 50%，意味著模型服務本身具備盈利能力，主要成本壓力來自持續訓練與研發投入。",{"title":399,"searchDepth":642,"depth":642,"links":1295},[],{"data":1297,"body":1298,"excerpt":-1,"toc":1330},{"title":399,"description":399},{"type":632,"children":1299},[1300,1305,1310,1315,1320,1325],{"type":635,"tag":679,"props":1301,"children":1303},{"id":1302},"融資結構",[1304],{"type":640,"value":1302},{"type":635,"tag":636,"props":1306,"children":1307},{},[1308],{"type":640,"value":1309},"此筆並非傳統股權融資，而是一份算力採購合約。Anthropic 與 xAI 簽訂月付 12.5 億美元的算力購買協議，合約效期至 2029 年 5 月，總合約金額逾 400 億美元。雙方均可提前 90 天通知對方終止合約。",{"type":635,"tag":679,"props":1311,"children":1313},{"id":1312},"估值邏輯",[1314],{"type":640,"value":1312},{"type":635,"tag":636,"props":1316,"children":1317},{},[1318],{"type":640,"value":1319},"以 Q2 2026 預估營收 109 億美元換算，年化約達 436 億美元 ARR。若能維持成長動能，Anthropic 當前市場估值相對於 ARR 的倍數將大幅壓縮，對後期機構投資人而言估值吸引力提升。",{"type":635,"tag":679,"props":1321,"children":1323},{"id":1322},"資金用途",[1324],{"type":640,"value":1322},{"type":635,"tag":636,"props":1326,"children":1327},{},[1328],{"type":640,"value":1329},"算力採購是 Anthropic 當前最大的支出項目之一。400 億美元的 xAI 合約顯示公司正在以外購算力的方式支撐持續成長的企業客戶推論需求，同時規避自建資料中心的鉅額前期資本支出。",{"title":399,"searchDepth":642,"depth":642,"links":1331},[],{"data":1333,"body":1334,"excerpt":-1,"toc":1381},{"title":399,"description":399},{"type":632,"children":1335},[1336,1340,1361,1366,1371,1376],{"type":635,"tag":679,"props":1337,"children":1338},{"id":911},[1339],{"type":640,"value":911},{"type":635,"tag":915,"props":1341,"children":1342},{},[1343,1352],{"type":635,"tag":919,"props":1344,"children":1345},{},[1346,1350],{"type":635,"tag":696,"props":1347,"children":1348},{},[1349],{"type":640,"value":926},{"type":640,"value":1351},"：OpenAI（預期 2026 年 9 月 IPO，旗下 ChatGPT 仍是市場最大入口）、Google DeepMind（Gemini 系列深度整合 Workspace）",{"type":635,"tag":919,"props":1353,"children":1354},{},[1355,1359],{"type":635,"tag":696,"props":1356,"children":1357},{},[1358],{"type":640,"value":936},{"type":640,"value":1360},"：Mistral（歐洲開源路線）、Meta LLaMA 開源生態、Microsoft Azure AI（以 OpenAI 模型為主力）",{"type":635,"tag":679,"props":1362,"children":1364},{"id":1363},"市場規模",[1365],{"type":640,"value":1363},{"type":635,"tag":636,"props":1367,"children":1368},{},[1369],{"type":640,"value":1370},"企業 AI 助理與工作流程自動化市場預估至 2028 年達數千億美元規模。Anthropic 進軍小企業主與律師事務所等垂直場景，正在開拓此前未被充分服務的長尾企業市場。",{"type":635,"tag":679,"props":1372,"children":1374},{"id":1373},"差異化定位",[1375],{"type":640,"value":1373},{"type":635,"tag":636,"props":1377,"children":1378},{},[1379],{"type":640,"value":1380},"Anthropic 以「安全優先」品牌形象打入企業市場，Claude 的長文脈處理能力（最高 200K tokens）及相對較低的幻覺率，成為法律、金融等高合規要求場景的優先選擇，與 OpenAI 的消費者導向形成明顯區隔。",{"title":399,"searchDepth":642,"depth":642,"links":1382},[],{"data":1384,"body":1385,"excerpt":-1,"toc":1391},{"title":399,"description":136},{"type":632,"children":1386},[1387],{"type":635,"tag":636,"props":1388,"children":1389},{},[1390],{"type":640,"value":136},{"title":399,"searchDepth":642,"depth":642,"links":1392},[],{"data":1394,"body":1395,"excerpt":-1,"toc":1401},{"title":399,"description":139},{"type":632,"children":1396},[1397],{"type":635,"tag":636,"props":1398,"children":1399},{},[1400],{"type":640,"value":139},{"title":399,"searchDepth":642,"depth":642,"links":1402},[],{"data":1404,"body":1405,"excerpt":-1,"toc":1411},{"title":399,"description":142},{"type":632,"children":1406},[1407],{"type":635,"tag":636,"props":1408,"children":1409},{},[1410],{"type":640,"value":142},{"title":399,"searchDepth":642,"depth":642,"links":1412},[],{"data":1414,"body":1415,"excerpt":-1,"toc":1421},{"title":399,"description":144},{"type":632,"children":1416},[1417],{"type":635,"tag":636,"props":1418,"children":1419},{},[1420],{"type":640,"value":144},{"title":399,"searchDepth":642,"depth":642,"links":1422},[],{"data":1424,"body":1425,"excerpt":-1,"toc":1431},{"title":399,"description":145},{"type":632,"children":1426},[1427],{"type":635,"tag":636,"props":1428,"children":1429},{},[1430],{"type":640,"value":145},{"title":399,"searchDepth":642,"depth":642,"links":1432},[],{"data":1434,"body":1435,"excerpt":-1,"toc":1441},{"title":399,"description":197},{"type":632,"children":1436},[1437],{"type":635,"tag":636,"props":1438,"children":1439},{},[1440],{"type":640,"value":197},{"title":399,"searchDepth":642,"depth":642,"links":1442},[],{"data":1444,"body":1445,"excerpt":-1,"toc":1451},{"title":399,"description":201},{"type":632,"children":1446},[1447],{"type":635,"tag":636,"props":1448,"children":1449},{},[1450],{"type":640,"value":201},{"title":399,"searchDepth":642,"depth":642,"links":1452},[],{"data":1454,"body":1455,"excerpt":-1,"toc":1461},{"title":399,"description":203},{"type":632,"children":1456},[1457],{"type":635,"tag":636,"props":1458,"children":1459},{},[1460],{"type":640,"value":203},{"title":399,"searchDepth":642,"depth":642,"links":1462},[],{"data":1464,"body":1465,"excerpt":-1,"toc":1471},{"title":399,"description":205},{"type":632,"children":1466},[1467],{"type":635,"tag":636,"props":1468,"children":1469},{},[1470],{"type":640,"value":205},{"title":399,"searchDepth":642,"depth":642,"links":1472},[],{"data":1474,"body":1475,"excerpt":-1,"toc":1585},{"title":399,"description":399},{"type":632,"children":1476},[1477,1483,1488,1493,1498,1503,1509,1514,1529,1534,1539,1544,1550,1555,1560,1565,1570,1575,1580],{"type":635,"tag":679,"props":1478,"children":1480},{"id":1479},"deepseek-code-的北京新團隊與產品定位",[1481],{"type":640,"value":1482},"Deepseek Code 的北京新團隊與產品定位",{"type":635,"tag":636,"props":1484,"children":1485},{},[1486],{"type":640,"value":1487},"2026 年 5 月 19 日，Deepseek 研究員 Deli Chen 在 X 平台發布招募公告，宣布成立全新「Harness」團隊，任務是從零打造代號「Deepseek Code」的 coding agent 產品。公告在 24 小時內獲得超過 18.8 萬次瀏覽。",{"type":635,"tag":636,"props":1489,"children":1490},{},[1491],{"type":640,"value":1492},"職缺分為兩類：Harness 產品經理與 R&D 工程師，要求應聘者具備深度使用 Claude Code、Cursor、Codex、GitHub Copilot 的實戰經驗。以競品重度用戶作為招募篩選條件，是業界罕見的公開對標宣言。",{"type":635,"tag":636,"props":1494,"children":1495},{},[1496],{"type":640,"value":1497},"這不是臨時性招募。2026 年 3 月，Deepseek 已悄悄招募前 Jane Street 工程師 Cui Tianyi 加入 Harness 團隊，顯示相關佈局早在招募公告曝光前六週便已啟動，彰顯其戰略縱深。",{"type":635,"tag":636,"props":1499,"children":1500},{},[1501],{"type":640,"value":1502},"Deeseek 將「Harness」定義為模型之外的一切：tool use（工具調用）、planning（規劃）、memory（記憶），以及讓這一切協作的 agentic loop 基礎設施。這個定義直接對標 Claude Code 的架構哲學——model + harness = AI agent。",{"type":635,"tag":679,"props":1504,"children":1506},{"id":1505},"claude-codecodexdeepseek-code三方對決",[1507],{"type":640,"value":1508},"Claude Code、Codex、Deepseek Code：三方對決",{"type":635,"tag":636,"props":1510,"children":1511},{},[1512],{"type":640,"value":1513},"招募說明書幾乎是 Claude Code 技術棧的完整複製清單：agent loops、MCP(Model Context Protocol) 、multi-agent systems、context engineering，以及 vibe coding 實作經驗。",{"type":635,"tag":749,"props":1515,"children":1516},{},[1517],{"type":635,"tag":636,"props":1518,"children":1519},{},[1520,1524,1527],{"type":635,"tag":696,"props":1521,"children":1522},{},[1523],{"type":640,"value":759},{"type":635,"tag":761,"props":1525,"children":1526},{},[],{"type":640,"value":1528},"\nMCP(Model Context Protocol) 是 Anthropic 提出的開放協議，讓 AI 模型與外部工具、資料庫、IDE 之間能以標準化方式通訊，類似 AI 版的 USB 介面。",{"type":635,"tag":636,"props":1530,"children":1531},{},[1532],{"type":640,"value":1533},"The Decoder 分析指出，Deepseek 將此計畫定位在「research 與 product 的交叉點」，顯示 Deepseek Code 將是 first-party 產品，而非現有 API 的簡單封裝。",{"type":635,"tag":636,"props":1535,"children":1536},{},[1537],{"type":640,"value":1538},"Deeseek V4 已被整合至 OpenCode、Codex CLI、Cline、Kilo Code 等第三方 coding agent，模型層的 coding 能力已獲生態驗證。三方對決的戰場不是模型本身，而是誰能建立最強的 Harness 基礎設施——工具調用穩定性、context 管理能力、跨檔案推理深度。",{"type":635,"tag":636,"props":1540,"children":1541},{},[1542],{"type":640,"value":1543},"Claude Code 的優勢在於與 Anthropic 模型的深度整合與長期調校；Codex 的優勢在於 GitHub 原生整合；Deepseek Code 的切入點則是成本不對稱與潛在的開源策略。",{"type":635,"tag":679,"props":1545,"children":1547},{"id":1546},"開源策略能否撼動閉源-coding-agent",[1548],{"type":640,"value":1549},"開源策略能否撼動閉源 Coding Agent",{"type":635,"tag":636,"props":1551,"children":1552},{},[1553],{"type":640,"value":1554},"Deeseek 的模型層以開源著稱：V4-Pro（1.6T 參數）與 V4-Flash(284B) 均採 MIT 授權，API 成本僅為 Claude Opus 4.7 的 1/53。這種成本優勢已讓部分開發者自行組裝「低成本 Harness」——將 Deepseek V4 接入 Claude Code 的 agent 框架使用。",{"type":635,"tag":636,"props":1556,"children":1557},{},[1558],{"type":640,"value":1559},"然而，coding agent 的護城河不只是模型成本。IDE 整合深度（Cursor 的即時 Tab 補全）、語言服務器協議支援、長期使用者工作流黏性，以及持續累積的 context engineering 最佳實踐，都是閉源工具的實際壁壘。",{"type":635,"tag":636,"props":1561,"children":1562},{},[1563],{"type":640,"value":1564},"目前 Deepseek Code 的開源策略尚未宣布。若走開源路線，將複製其在模型層的不對稱競爭策略，對 Cursor 等閉源工具形成系統性衝擊。但這個信號目前強度仍弱，屬於合理推測而非既定方向。",{"type":635,"tag":679,"props":1566,"children":1568},{"id":1567},"開發者工具市場的下一輪洗牌",[1569],{"type":640,"value":1567},{"type":635,"tag":636,"props":1571,"children":1572},{},[1573],{"type":640,"value":1574},"2026 年 3 月，Claude Code 部分原始碼意外外洩（SCMP 報導），意外加速了整個行業對 harness 架構的認知，讓 Deepseek 等後進者得以解構競品的技術棧設計。",{"type":635,"tag":636,"props":1576,"children":1577},{},[1578],{"type":640,"value":1579},"Deeseek 從「模型研究組織」向「產品公司」的戰略轉型，體現在多個時間點的連貫佈局：3 月招募前 Jane Street 工程師、4 月以 MIT 授權開源 V4、5 月公開組建 Harness 團隊。這條時間線顯示，招募公告並非倉促決定，而是預謀已久的節奏釋放。",{"type":635,"tag":636,"props":1581,"children":1582},{},[1583],{"type":640,"value":1584},"Bloomberg 報導確認，Deepseek 的最新職缺清單標誌著其明確轉向 agentic AI 產品賽道。開發者工具市場即將進入三強格局，而成本維度將成為其中最不可忽視的競爭軸線。",{"title":399,"searchDepth":642,"depth":642,"links":1586},[],{"data":1588,"body":1590,"excerpt":-1,"toc":1596},{"title":399,"description":1589},"Deepseek 的「Harness」架構哲學不只是技術選型，更是對 coding agent 競爭格局的重新定義。理解其架構邏輯，是預測 Deepseek Code 長期競爭力的關鍵所在。",{"type":632,"children":1591},[1592],{"type":635,"tag":636,"props":1593,"children":1594},{},[1595],{"type":640,"value":1589},{"title":399,"searchDepth":642,"depth":642,"links":1597},[],{"data":1599,"body":1601,"excerpt":-1,"toc":1612},{"title":399,"description":1600},"Deeseek 刻意將模型視為可替換元件，把 tool use、planning、memory、agent loops 定義為真正的產品護城河。這與「以模型為中心」的主流思路形成對比——大多數 coding agent 工具的核心賣點是與特定模型提供商的深度整合。",{"type":632,"children":1602},[1603,1607],{"type":635,"tag":636,"props":1604,"children":1605},{},[1606],{"type":640,"value":1600},{"type":635,"tag":636,"props":1608,"children":1609},{},[1610],{"type":640,"value":1611},"若 Harness 層足夠強健，Deepseek Code 未來可在不更換框架的情況下，快速接入更強的新模型，賦予其在模型競賽中更靈活的戰略空間。",{"title":399,"searchDepth":642,"depth":642,"links":1613},[],{"data":1615,"body":1617,"excerpt":-1,"toc":1628},{"title":399,"description":1616},"招募說明書明確列出 MCP 經驗要求，暗示 Deepseek Code 將採用 Model Context Protocol 作為工具通訊標準。MCP 雖由 Anthropic 提出，但已成為第三方工具的事實標準。",{"type":632,"children":1618},[1619,1623],{"type":635,"tag":636,"props":1620,"children":1621},{},[1622],{"type":640,"value":1616},{"type":635,"tag":636,"props":1624,"children":1625},{},[1626],{"type":640,"value":1627},"若 Deepseek Code 完整實作 MCP，現有 Claude Code 用戶已整合的 MCP server（資料庫、IDE 插件、外部 API）可低成本遷移。以他人建立的生態作為自己的進入點，是開放協議最強的使用案例。",{"title":399,"searchDepth":642,"depth":642,"links":1629},[],{"data":1631,"body":1633,"excerpt":-1,"toc":1659},{"title":399,"description":1632},"V4-Flash 每百萬 input token 僅 $0.14，對比 Claude Opus 4.6 的 $15.00，成本差距約 107 倍。個人開發者已自發驗證：用 Deepseek V4 後端取代 Claude API，月費從 £200 降至 £18。",{"type":632,"children":1634},[1635,1639,1644],{"type":635,"tag":636,"props":1636,"children":1637},{},[1638],{"type":640,"value":1632},{"type":635,"tag":636,"props":1640,"children":1641},{},[1642],{"type":640,"value":1643},"對企業客戶而言，若 Deepseek Code 能在 Harness 品質達到 80% 的情況下維持 10% 的成本，採購決策天秤將難以保持平衡。成本不對稱是 Deepseek 最確定的切入武器。",{"type":635,"tag":749,"props":1645,"children":1646},{},[1647],{"type":635,"tag":636,"props":1648,"children":1649},{},[1650,1654,1657],{"type":635,"tag":696,"props":1651,"children":1652},{},[1653],{"type":640,"value":897},{"type":635,"tag":761,"props":1655,"children":1656},{},[],{"type":640,"value":1658},"\n把 Harness 想像成咖啡機，模型是咖啡豆。Deepseek 的策略是：先推出最便宜的咖啡豆 (V4) ，再打造一台咖啡機 (Harness) ，讓你不用買昂貴的膠囊 (Claude API) 也能喝到接近品質的咖啡。",{"title":399,"searchDepth":642,"depth":642,"links":1660},[],{"data":1662,"body":1663,"excerpt":-1,"toc":1779},{"title":399,"description":399},{"type":632,"children":1664},[1665,1669,1690,1694,1715,1719,1724,1728,1751,1755,1768,1774],{"type":635,"tag":679,"props":1666,"children":1667},{"id":911},[1668],{"type":640,"value":911},{"type":635,"tag":915,"props":1670,"children":1671},{},[1672,1681],{"type":635,"tag":919,"props":1673,"children":1674},{},[1675,1679],{"type":635,"tag":696,"props":1676,"children":1677},{},[1678],{"type":640,"value":926},{"type":640,"value":1680},"：Claude Code(Anthropic) 、Codex(OpenAI cloud coding agent) 、Cursor(Anysphere)",{"type":635,"tag":919,"props":1682,"children":1683},{},[1684,1688],{"type":635,"tag":696,"props":1685,"children":1686},{},[1687],{"type":640,"value":936},{"type":640,"value":1689},"：GitHub Copilot(Microsoft/GitHub) 、Codeium/Windsurf、JetBrains AI Assistant",{"type":635,"tag":679,"props":1691,"children":1692},{"id":941},[1693],{"type":640,"value":941},{"type":635,"tag":915,"props":1695,"children":1696},{},[1697,1706],{"type":635,"tag":919,"props":1698,"children":1699},{},[1700,1704],{"type":635,"tag":696,"props":1701,"children":1702},{},[1703],{"type":640,"value":954},{"type":640,"value":1705},"：agent loop 穩定性、MCP 生態整合廣度、IDE 深度整合（Deepseek Code 尚無此項優勢）",{"type":635,"tag":919,"props":1707,"children":1708},{},[1709,1713],{"type":635,"tag":696,"props":1710,"children":1711},{},[1712],{"type":640,"value":964},{"type":640,"value":1714},"：開源社群貢獻者數量、第三方工具相容性（Deepseek V4 已被 OpenCode、Cline、Kilo Code 等整合）",{"type":635,"tag":679,"props":1716,"children":1717},{"id":969},[1718],{"type":640,"value":969},{"type":635,"tag":636,"props":1720,"children":1721},{},[1722],{"type":640,"value":1723},"若延續 Deepseek 一貫的成本不對稱策略，Deepseek Code 可能以極低定價（或免費開源）切入市場，逼迫 Cursor 等閉源工具調整定價。目前定價策略尚未公開，屬推測。",{"type":635,"tag":679,"props":1725,"children":1726},{"id":979},[1727],{"type":640,"value":979},{"type":635,"tag":915,"props":1729,"children":1730},{},[1731,1736,1741,1746],{"type":635,"tag":919,"props":1732,"children":1733},{},[1734],{"type":640,"value":1735},"產品尚未發布，無法評估穩定性與 SLA",{"type":635,"tag":919,"props":1737,"children":1738},{},[1739],{"type":640,"value":1740},"中國資料處理合規問題在部分企業 IT 政策中構成障礙",{"type":635,"tag":919,"props":1742,"children":1743},{},[1744],{"type":640,"value":1745},"缺乏 IDE 原生整合，無法提供即時 Tab 補全等功能",{"type":635,"tag":919,"props":1747,"children":1748},{},[1749],{"type":640,"value":1750},"長尾 debug 任務可靠性尚待大規模實戰驗證",{"type":635,"tag":679,"props":1752,"children":1753},{"id":997},[1754],{"type":640,"value":997},{"type":635,"tag":915,"props":1756,"children":1757},{},[1758,1763],{"type":635,"tag":919,"props":1759,"children":1760},{},[1761],{"type":640,"value":1762},"Cursor、Claude Code 等工具面臨定價壓力，可能加速推出更具成本競爭力的方案",{"type":635,"tag":919,"props":1764,"children":1765},{},[1766],{"type":640,"value":1767},"若 Deepseek Code 開源，將催生新一波基於開放 Harness 架構的第三方工具生態",{"type":635,"tag":679,"props":1769,"children":1771},{"id":1770},"判決結構性威脅但時間表未定",[1772],{"type":640,"value":1773},"判決：結構性威脅（但時間表未定）",{"type":635,"tag":636,"props":1775,"children":1776},{},[1777],{"type":640,"value":1778},"Deeseek 的技術能力與成本優勢已獲市場驗證，Harness 戰略清晰可信。但 coding agent 的護城河（IDE 整合、工作流黏性）短期內難以僅憑成本優勢直接突破。12–18 個月後的市場格局，取決於開源策略是否落地、Harness 品質能否縮短與 Claude Code 的差距。",{"title":399,"searchDepth":642,"depth":642,"links":1780},[],{"data":1782,"body":1783,"excerpt":-1,"toc":1806},{"title":399,"description":399},{"type":632,"children":1784},[1785,1791,1796,1801],{"type":635,"tag":679,"props":1786,"children":1788},{"id":1787},"模型層-coding-能力",[1789],{"type":640,"value":1790},"模型層 Coding 能力",{"type":635,"tag":636,"props":1792,"children":1793},{},[1794],{"type":640,"value":1795},"Deeseek V4-Pro 在主流 agent benchmark 上接近 GPT-5.5 與 Claude Opus 4.7，但社群實測顯示其在高層設計選擇上仍有落差：複雜架構決策時不如 Opus 4.7 直接，且更容易陷入「whack-a-mole」式的修 bug 迴圈。",{"type":635,"tag":679,"props":1797,"children":1799},{"id":1798},"成本比較",[1800],{"type":640,"value":1798},{"type":635,"tag":636,"props":1802,"children":1803},{},[1804],{"type":640,"value":1805},"Deeseek V4-Flash 約 $0.14/M tokens，V4-Pro 約 $0.27/M tokens，Claude Opus 4.6 為 $15.00/M tokens，成本差距達 50–107 倍。注意：Deepseek Code 作為獨立產品尚未發布，上述數據僅反映模型 API 層面的成本比較，不代表最終產品定價。",{"title":399,"searchDepth":642,"depth":642,"links":1807},[],{"data":1809,"body":1810,"excerpt":-1,"toc":1827},{"title":399,"description":399},{"type":632,"children":1811},[1812],{"type":635,"tag":915,"props":1813,"children":1814},{},[1815,1819,1823],{"type":635,"tag":919,"props":1816,"children":1817},{},[1818],{"type":640,"value":211},{"type":635,"tag":919,"props":1820,"children":1821},{},[1822],{"type":640,"value":212},{"type":635,"tag":919,"props":1824,"children":1825},{},[1826],{"type":640,"value":213},{"title":399,"searchDepth":642,"depth":642,"links":1828},[],{"data":1830,"body":1831,"excerpt":-1,"toc":1848},{"title":399,"description":399},{"type":632,"children":1832},[1833],{"type":635,"tag":915,"props":1834,"children":1835},{},[1836,1840,1844],{"type":635,"tag":919,"props":1837,"children":1838},{},[1839],{"type":640,"value":215},{"type":635,"tag":919,"props":1841,"children":1842},{},[1843],{"type":640,"value":216},{"type":635,"tag":919,"props":1845,"children":1846},{},[1847],{"type":640,"value":217},{"title":399,"searchDepth":642,"depth":642,"links":1849},[],{"data":1851,"body":1852,"excerpt":-1,"toc":1858},{"title":399,"description":221},{"type":632,"children":1853},[1854],{"type":635,"tag":636,"props":1855,"children":1856},{},[1857],{"type":640,"value":221},{"title":399,"searchDepth":642,"depth":642,"links":1859},[],{"data":1861,"body":1862,"excerpt":-1,"toc":1868},{"title":399,"description":222},{"type":632,"children":1863},[1864],{"type":635,"tag":636,"props":1865,"children":1866},{},[1867],{"type":640,"value":222},{"title":399,"searchDepth":642,"depth":642,"links":1869},[],{"data":1871,"body":1872,"excerpt":-1,"toc":1878},{"title":399,"description":267},{"type":632,"children":1873},[1874],{"type":635,"tag":636,"props":1875,"children":1876},{},[1877],{"type":640,"value":267},{"title":399,"searchDepth":642,"depth":642,"links":1879},[],{"data":1881,"body":1882,"excerpt":-1,"toc":1888},{"title":399,"description":271},{"type":632,"children":1883},[1884],{"type":635,"tag":636,"props":1885,"children":1886},{},[1887],{"type":640,"value":271},{"title":399,"searchDepth":642,"depth":642,"links":1889},[],{"data":1891,"body":1892,"excerpt":-1,"toc":1898},{"title":399,"description":274},{"type":632,"children":1893},[1894],{"type":635,"tag":636,"props":1895,"children":1896},{},[1897],{"type":640,"value":274},{"title":399,"searchDepth":642,"depth":642,"links":1899},[],{"data":1901,"body":1902,"excerpt":-1,"toc":1908},{"title":399,"description":277},{"type":632,"children":1903},[1904],{"type":635,"tag":636,"props":1905,"children":1906},{},[1907],{"type":640,"value":277},{"title":399,"searchDepth":642,"depth":642,"links":1909},[],{"data":1911,"body":1912,"excerpt":-1,"toc":2021},{"title":399,"description":399},{"type":632,"children":1913},[1914,1920,1925,1930,1935,1941,1946,1961,1966,1971,1976,1981,1986,1991,1996,2001,2016],{"type":635,"tag":679,"props":1915,"children":1917},{"id":1916},"系統性封鎖meta-在沙烏地與阿聯酋的審查實錄",[1918],{"type":640,"value":1919},"系統性封鎖：Meta 在沙烏地與阿聯酋的審查實錄",{"type":635,"tag":636,"props":1921,"children":1922},{},[1923],{"type":640,"value":1924},"自 2026 年 3 月起，Meta 開始針對沙烏地阿拉伯與阿聯酋境內的用戶，對逾 100 個 Facebook 頁面與 Instagram 帳號實施地理封鎖。",{"type":635,"tag":636,"props":1926,"children":1927},{},[1928],{"type":640,"value":1929},"被封鎖的對象包括人權組織 ALQST for Human Rights、Democratic Diwan，以及沙烏地研究員 Abdullah Alaoudh 和人權捍衛者 Yahya Assiri。阿聯酋境內亦有至少一名學者帳號受到同樣限制。2026 年 5 月 20 日，ALQST 發布聯合聲明，公開記錄這波系統性封鎖的始末。",{"type":635,"tag":636,"props":1931,"children":1932},{},[1933],{"type":640,"value":1934},"ALQST 的核心工作是記錄沙烏地境內的強迫失蹤、政治犯與酷刑案例。其帳號在境內消失，等同於切斷了受害者家屬與外界的重要連結管道。被援引的「違法內容」描述竟是「報導區域地緣政治衝突與安全動態」——即對人權狀況的如實記錄。",{"type":635,"tag":679,"props":1936,"children":1938},{"id":1937},"演算法即審查平台-ai-如何執行隱形禁令",[1939],{"type":640,"value":1940},"演算法即審查：平台 AI 如何執行隱形禁令",{"type":635,"tag":636,"props":1942,"children":1943},{},[1944],{"type":640,"value":1945},"地理封鎖 (geo-blocking) 的設計使審查得以「無聲化」：受封鎖帳號在境外看起來一切正常，帳號持有人甚至不會收到直接通知說明哪些內容被針對。",{"type":635,"tag":749,"props":1947,"children":1948},{},[1949],{"type":635,"tag":636,"props":1950,"children":1951},{},[1952,1956,1959],{"type":635,"tag":696,"props":1953,"children":1954},{},[1955],{"type":640,"value":759},{"type":635,"tag":761,"props":1957,"children":1958},{},[],{"type":640,"value":1960},"\n地理封鎖 (geo-blocking) ：依據用戶的 IP 位置，在特定國家或地區封鎖對特定內容或帳號的存取，其他地區用戶不受影響，也難以察覺封鎖的存在。",{"type":635,"tag":636,"props":1962,"children":1963},{},[1964],{"type":640,"value":1965},"這種結構性隱蔽性讓受影響者難以舉證、難以申訴，也讓平台得以對外宣稱「內容未被刪除」，同時卻讓關鍵受眾完全看不見這些內容。Meta 的透明度中心雖然記錄了部分案例，但實際審查流程對外不透明，外界無從判斷每起封鎖請求是否經過人權影響評估。",{"type":635,"tag":636,"props":1967,"children":1968},{},[1969],{"type":640,"value":1970},"類似手法先前已見於 X（前 Twitter）：沙烏地政府同樣要求對異見帳號實施地理封鎖，顯示這已成為威權政府常用的平台施壓模式。",{"type":635,"tag":679,"props":1972,"children":1974},{"id":1973},"科技公司在威權國家的合規困境",[1975],{"type":640,"value":1973},{"type":635,"tag":636,"props":1977,"children":1978},{},[1979],{"type":640,"value":1980},"Meta 面臨的選擇被 HN 社群直白描述為「遵從或退出 (comply or exit) 」。封鎖通知援引「當地法律要求」或「政府請求」作為依據，法律基礎為兩國各自的網路犯罪法。",{"type":635,"tag":636,"props":1982,"children":1983},{},[1984],{"type":640,"value":1985},"批評者指出，選擇留在市場並配合政治性封鎖，本質上是以商業利益為由使審查機制合法化，並對其他平台產生示範效應。HN 上亦有聲音認為「把短期增長凌駕一切，就注定無法堅守原則」——這句話點出了科技平台在全球市場擴張與人權承諾之間長期存在的結構性矛盾。",{"type":635,"tag":636,"props":1987,"children":1988},{},[1989],{"type":640,"value":1990},"ECDHR 的報告進一步指出，沙烏地的數位管制模式已形成系統化壓制，科技公司若選擇留在該市場，便難以迴避成為壓制基礎設施一環的指控。",{"type":635,"tag":679,"props":1992,"children":1994},{"id":1993},"社群迴響與人權組織的下一步行動",[1995],{"type":640,"value":1993},{"type":635,"tag":636,"props":1997,"children":1998},{},[1999],{"type":640,"value":2000},"ALQST 的公開聲明不只是譴責，更提出具體問責訴求：要求 Meta 說明針對受封鎖頁面的人權盡職調查 (due diligence) 由誰執行、適用何種標準，以及公司如何判斷「依政府要求限制人權組織」符合其所聲稱的價值承諾。",{"type":635,"tag":749,"props":2002,"children":2003},{},[2004],{"type":635,"tag":636,"props":2005,"children":2006},{},[2007,2011,2014],{"type":635,"tag":696,"props":2008,"children":2009},{},[2010],{"type":640,"value":759},{"type":635,"tag":761,"props":2012,"children":2013},{},[],{"type":640,"value":2015},"\n人權盡職調查 (human rights due diligence) ：企業識別、預防並緩解其業務活動對人權造成負面影響的系統化評估流程，源自聯合國《工商業與人權指導原則》 (UNGPs) 。",{"type":635,"tag":636,"props":2017,"children":2018},{},[2019],{"type":640,"value":2020},"HN 社群的討論顯示，輿論關注點在「企業責任」與「政府才是根本問題」之間存在明顯分歧。這一張力本身反映了科技公司在全球政治地緣格局中難以迴避的結構性處境——平台的「人權承諾」，在威權政府的法律要求面前仍是最脆弱的一環。",{"title":399,"searchDepth":642,"depth":642,"links":2022},[],{"data":2024,"body":2025,"excerpt":-1,"toc":2072},{"title":399,"description":399},{"type":632,"children":2026},[2027,2032,2037,2042,2047,2052,2057,2062,2067],{"type":635,"tag":679,"props":2028,"children":2030},{"id":2029},"核心條款",[2031],{"type":640,"value":2029},{"type":635,"tag":636,"props":2033,"children":2034},{},[2035],{"type":640,"value":2036},"Meta 的全球性「當地法律遵循政策」允許公司依各國政府的正式法律請求，對特定帳號或內容實施地理封鎖。沙烏地與阿聯酋援引的法律基礎是兩國各自的網路犯罪法，而被歸類為「違法內容」的行為竟是「報導區域地緣政治衝突與安全動態」——即對人權狀況的如實記錄。",{"type":635,"tag":636,"props":2038,"children":2039},{},[2040],{"type":640,"value":2041},"地理封鎖執行後，受影響帳號在該國境內顯示為「無法存取」，但帳號本身並未被刪除，帳號持有人在境外仍可正常使用。Meta 於透明度中心發布相關案例，但具體的審查決策標準不對外公開。",{"type":635,"tag":679,"props":2043,"children":2045},{"id":2044},"適用範圍",[2046],{"type":640,"value":2044},{"type":635,"tag":636,"props":2048,"children":2049},{},[2050],{"type":640,"value":2051},"本次限制措施影響沙烏地阿拉伯與阿聯酋境內的 Facebook 和 Instagram 用戶，受影響對象橫跨人權 NGO（ALQST、Democratic Diwan）、學術研究人員 (Abdullah Alaoudh) 與個人人權捍衛者 (Yahya Assiri) 。",{"type":635,"tag":636,"props":2053,"children":2054},{},[2055],{"type":640,"value":2056},"自 2026 年 3 月起短短兩個月內已超過 100 個帳號遭封鎖，涵蓋範圍之廣顯示這不是個案，而是系統性的地區管制行動。阿聯酋境內亦有至少一名學者帳號受波及，地理範圍超出單一國家。",{"type":635,"tag":679,"props":2058,"children":2060},{"id":2059},"執法機制",[2061],{"type":640,"value":2059},{"type":635,"tag":636,"props":2063,"children":2064},{},[2065],{"type":640,"value":2066},"Meta 的封鎖通知以「當地法律要求」或「政府請求」為由，但申訴管道對受影響帳號持有人而言幾乎不透明。",{"type":635,"tag":636,"props":2068,"children":2069},{},[2070],{"type":640,"value":2071},"受影響者的主要困境在於：帳號持有人在境外看起來一切正常，目標受眾（即境內用戶）卻完全看不見內容，受害者往往不知道自己已遭封鎖，更難以得知具體是哪些內容觸發了政府請求。",{"title":399,"searchDepth":642,"depth":642,"links":2073},[],{"data":2075,"body":2077,"excerpt":-1,"toc":2088},{"title":399,"description":2076},"地理封鎖是大型平台基礎設施層面的既有能力，執行政府請求本身不需要額外工程開發。",{"type":632,"children":2078},[2079,2083],{"type":635,"tag":636,"props":2080,"children":2081},{},[2082],{"type":640,"value":2076},{"type":635,"tag":636,"props":2084,"children":2085},{},[2086],{"type":640,"value":2087},"然而若要符合人權標準，平台需建立自動化的「封鎖通知機制」——讓帳號持有人即時得知哪個地區、哪些內容受到限制；以及結構化的「人權影響評估流程」，在執行封鎖前進行強制審查。這兩套機制目前均不存在或未對外公開。",{"title":399,"searchDepth":642,"depth":642,"links":2089},[],{"data":2091,"body":2093,"excerpt":-1,"toc":2122},{"title":399,"description":2092},"若 Meta 選擇建立完整的人權盡職調查機制，預估需投入：",{"type":632,"children":2094},[2095,2099,2117],{"type":635,"tag":636,"props":2096,"children":2097},{},[2098],{"type":640,"value":2092},{"type":635,"tag":915,"props":2100,"children":2101},{},[2102,2107,2112],{"type":635,"tag":919,"props":2103,"children":2104},{},[2105],{"type":640,"value":2106},"跨區域人權法律專家團隊（每年數百萬美元）",{"type":635,"tag":919,"props":2108,"children":2109},{},[2110],{"type":640,"value":2111},"政府請求審查平台的工程開發（一次性成本加維護費用）",{"type":635,"tag":919,"props":2113,"children":2114},{},[2115],{"type":640,"value":2116},"透明度報告細粒度化的額外人力與法律審核",{"type":635,"tag":636,"props":2118,"children":2119},{},[2120],{"type":640,"value":2121},"若選擇維持現有模式繼續運行，長期面臨的是聲譽成本與歐盟 DSA 等跨境法規的潛在罰款風險。",{"title":399,"searchDepth":642,"depth":642,"links":2123},[],{"data":2125,"body":2127,"excerpt":-1,"toc":2157},{"title":399,"description":2126},"符合國際人權標準的最低限度行動包含以下步驟：",{"type":632,"children":2128},[2129,2133],{"type":635,"tag":636,"props":2130,"children":2131},{},[2132],{"type":640,"value":2126},{"type":635,"tag":2134,"props":2135,"children":2136},"ol",{},[2137,2142,2147,2152],{"type":635,"tag":919,"props":2138,"children":2139},{},[2140],{"type":640,"value":2141},"向受封鎖帳號持有人發送書面通知，說明封鎖地區與援引的法律依據",{"type":635,"tag":919,"props":2143,"children":2144},{},[2145],{"type":640,"value":2146},"公開每次政府封鎖請求的人權影響評估結果（至少摘要層級）",{"type":635,"tag":919,"props":2148,"children":2149},{},[2150],{"type":640,"value":2151},"建立獨立的外部申訴管道，允許 NGO 對封鎖決定提出異議",{"type":635,"tag":919,"props":2153,"children":2154},{},[2155],{"type":640,"value":2156},"定期發布分國家、分類別的封鎖請求數量與拒絕率統計",{"title":399,"searchDepth":642,"depth":642,"links":2158},[],{"data":2160,"body":2161,"excerpt":-1,"toc":2208},{"title":399,"description":399},{"type":632,"children":2162},[2163,2168,2173,2178,2183,2188,2193,2198,2203],{"type":635,"tag":679,"props":2164,"children":2166},{"id":2165},"直接影響者",[2167],{"type":640,"value":2165},{"type":635,"tag":636,"props":2169,"children":2170},{},[2171],{"type":640,"value":2172},"首當其衝的是在威權國家境內經營的人權 NGO 與公民社會組織。其社群媒體帳號是對外溝通的主要管道，一旦遭地理封鎖，便等同在目標受眾面前被「隱形刪除」。",{"type":635,"tag":636,"props":2174,"children":2175},{},[2176],{"type":640,"value":2177},"受害者家屬無法取得組織的聯絡資訊，境內潛在舉報人也失去安全聯繫管道——對 ALQST 而言，帳號消失直接切斷了其與沙烏地受迫害家庭的聯繫。獨立記者與異見學者是第二波直接受害者，研究成果與評論無法觸及最需要這些資訊的本地受眾。",{"type":635,"tag":679,"props":2179,"children":2181},{"id":2180},"間接波及者",[2182],{"type":640,"value":2180},{"type":635,"tag":636,"props":2184,"children":2185},{},[2186],{"type":640,"value":2187},"其他主要社群媒體平台（X、YouTube、TikTok）面臨示範效應壓力：沙烏地已對 X 施壓要求地理封鎖異見帳號，Meta 的合規行為等同於為後續政府請求設定了「市場先例」。",{"type":635,"tag":636,"props":2189,"children":2190},{},[2191],{"type":640,"value":2192},"VPN 服務商、鏡像網站服務與去中心化平台（如 Mastodon、Farcaster）則可能因此獲得更多來自管制地區的用戶需求，成為間接受益者。",{"type":635,"tag":679,"props":2194,"children":2196},{"id":2195},"成本轉嫁效應",[2197],{"type":640,"value":2195},{"type":635,"tag":636,"props":2199,"children":2200},{},[2201],{"type":640,"value":2202},"對沙烏地與阿聯酋的一般用戶而言，資訊空間的可信人權內容正系統性地消失，替代資訊源的獲取門檻（如需使用 VPN）進一步加劇了資訊不對稱。",{"type":635,"tag":636,"props":2204,"children":2205},{},[2206],{"type":640,"value":2207},"長期來看，這會強化威權政府對輿論的掌控，並讓平台成為資訊管制基礎設施的一部分——代價最終由需要資訊的普通公民承擔。",{"title":399,"searchDepth":642,"depth":642,"links":2209},[],{"data":2211,"body":2212,"excerpt":-1,"toc":2218},{"title":399,"description":321},{"type":632,"children":2213},[2214],{"type":635,"tag":636,"props":2215,"children":2216},{},[2217],{"type":640,"value":321},{"title":399,"searchDepth":642,"depth":642,"links":2219},[],{"data":2221,"body":2222,"excerpt":-1,"toc":2228},{"title":399,"description":326},{"type":632,"children":2223},[2224],{"type":635,"tag":636,"props":2225,"children":2226},{},[2227],{"type":640,"value":326},{"title":399,"searchDepth":642,"depth":642,"links":2229},[],{"data":2231,"body":2232,"excerpt":-1,"toc":2238},{"title":399,"description":330},{"type":632,"children":2233},[2234],{"type":635,"tag":636,"props":2235,"children":2236},{},[2237],{"type":640,"value":330},{"title":399,"searchDepth":642,"depth":642,"links":2239},[],{"data":2241,"body":2242,"excerpt":-1,"toc":2248},{"title":399,"description":334},{"type":632,"children":2243},[2244],{"type":635,"tag":636,"props":2245,"children":2246},{},[2247],{"type":640,"value":334},{"title":399,"searchDepth":642,"depth":642,"links":2249},[],{"data":2251,"body":2252,"excerpt":-1,"toc":2258},{"title":399,"description":339},{"type":632,"children":2253},[2254],{"type":635,"tag":636,"props":2255,"children":2256},{},[2257],{"type":640,"value":339},{"title":399,"searchDepth":642,"depth":642,"links":2259},[],{"data":2261,"body":2262,"excerpt":-1,"toc":2268},{"title":399,"description":343},{"type":632,"children":2263},[2264],{"type":635,"tag":636,"props":2265,"children":2266},{},[2267],{"type":640,"value":343},{"title":399,"searchDepth":642,"depth":642,"links":2269},[],{"data":2271,"body":2272,"excerpt":-1,"toc":2278},{"title":399,"description":280},{"type":632,"children":2273},[2274],{"type":635,"tag":636,"props":2275,"children":2276},{},[2277],{"type":640,"value":280},{"title":399,"searchDepth":642,"depth":642,"links":2279},[],{"data":2281,"body":2282,"excerpt":-1,"toc":2288},{"title":399,"description":281},{"type":632,"children":2283},[2284],{"type":635,"tag":636,"props":2285,"children":2286},{},[2287],{"type":640,"value":281},{"title":399,"searchDepth":642,"depth":642,"links":2289},[],{"data":2291,"body":2292,"excerpt":-1,"toc":2351},{"title":399,"description":399},{"type":632,"children":2293},[2294,2300,2305,2320,2326,2331,2336],{"type":635,"tag":679,"props":2295,"children":2297},{"id":2296},"qwen-37-max-登頂-aai開源版本備受期待",[2298],{"type":640,"value":2299},"Qwen 3.7 Max 登頂 AAI，開源版本備受期待",{"type":635,"tag":636,"props":2301,"children":2302},{},[2303],{"type":640,"value":2304},"Qwen 3.7 Max API 預覽版於 2026-05-19 正式上線，在 Artificial Analysis Intelligence Index(AAI)218 個模型中奪得第一，評分 57，較 Qwen 3.6 Max 的 52 提升 5 分，Arena AI Elo 達 1,489。",{"type":635,"tag":749,"props":2306,"children":2307},{},[2308],{"type":635,"tag":636,"props":2309,"children":2310},{},[2311,2315,2318],{"type":635,"tag":696,"props":2312,"children":2313},{},[2314],{"type":640,"value":759},{"type":635,"tag":761,"props":2316,"children":2317},{},[],{"type":640,"value":2319},"\nAAI 是整合多項任務評測模型能力的綜合排行榜，類似模型界的「綜合大學排名」。",{"type":635,"tag":679,"props":2321,"children":2323},{"id":2322},"社群預測27b-與-35b-開源權重即將跟進",[2324],{"type":640,"value":2325},"社群預測：27B 與 35B 開源權重即將跟進",{"type":635,"tag":636,"props":2327,"children":2328},{},[2329],{"type":640,"value":2330},"r/LocalLLaMA 社群普遍看好開源版本即將推出，理由是 Qwen 已建立「API 先行、開源跟進」模式——3.6-27B 於 2026-04-22 以 Apache 2.0 授權發布。",{"type":635,"tag":636,"props":2332,"children":2333},{},[2334],{"type":640,"value":2335},"預期 27B(dense) 延續 Gated DeltaNet 線性注意力混合架構，支援 Multi-Token Prediction(MTP) 加速推理；Q4_K_M 量化版預計需約 15–16 GiB VRAM。35B 預計維持 MoE 架構，GGUF 版通常在主要權重發布後 24–72 小時跟上。",{"type":635,"tag":749,"props":2337,"children":2338},{},[2339],{"type":635,"tag":636,"props":2340,"children":2341},{},[2342,2346,2349],{"type":635,"tag":696,"props":2343,"children":2344},{},[2345],{"type":640,"value":759},{"type":635,"tag":761,"props":2347,"children":2348},{},[],{"type":640,"value":2350},"\nMoE(Mixture of Experts) 是每次只啟動部分參數的架構，推理成本遠低於同參數量的 dense 模型。",{"title":399,"searchDepth":642,"depth":642,"links":2352},[],{"data":2354,"body":2355,"excerpt":-1,"toc":2361},{"title":399,"description":358},{"type":632,"children":2356},[2357],{"type":635,"tag":636,"props":2358,"children":2359},{},[2360],{"type":640,"value":358},{"title":399,"searchDepth":642,"depth":642,"links":2362},[],{"data":2364,"body":2365,"excerpt":-1,"toc":2371},{"title":399,"description":359},{"type":632,"children":2366},[2367],{"type":635,"tag":636,"props":2368,"children":2369},{},[2370],{"type":640,"value":359},{"title":399,"searchDepth":642,"depth":642,"links":2372},[],{"data":2374,"body":2375,"excerpt":-1,"toc":2405},{"title":399,"description":399},{"type":632,"children":2376},[2377,2382],{"type":635,"tag":679,"props":2378,"children":2380},{"id":2379},"效能基準",[2381],{"type":640,"value":2379},{"type":635,"tag":915,"props":2383,"children":2384},{},[2385,2390,2395,2400],{"type":635,"tag":919,"props":2386,"children":2387},{},[2388],{"type":640,"value":2389},"AAI 評分：57（218 個模型第一名）",{"type":635,"tag":919,"props":2391,"children":2392},{},[2393],{"type":640,"value":2394},"較 Qwen 3.6 Max 提升：+5 分 (52 → 57)",{"type":635,"tag":919,"props":2396,"children":2397},{},[2398],{"type":640,"value":2399},"Arena AI Elo：1,489",{"type":635,"tag":919,"props":2401,"children":2402},{},[2403],{"type":640,"value":2404},"預測 27B AAI 評分：約 51（接近 3.6 Max 水準）",{"title":399,"searchDepth":642,"depth":642,"links":2406},[],{"data":2408,"body":2409,"excerpt":-1,"toc":2471},{"title":399,"description":399},{"type":632,"children":2410},[2411,2416,2430,2435,2448],{"type":635,"tag":679,"props":2412,"children":2414},{"id":2413},"功能概覽",[2415],{"type":640,"value":2413},{"type":635,"tag":636,"props":2417,"children":2418},{},[2419,2421,2428],{"type":640,"value":2420},"2026 年 5 月 20 日，Hugging Face 正式推出排行榜模型大小篩選功能。所有帶有 ",{"type":635,"tag":2422,"props":2423,"children":2425},"code",{"className":2424},[],[2426],{"type":640,"value":2427},"benchmark",{"type":640,"value":2429}," 標籤的資料集排行榜頁面，頂部會自動顯示參數量區間篩選器，選定後排名即時刷新。每個大小分桶前三名以 🏅 標示，方便快速定位同量級最佳模型。",{"type":635,"tag":679,"props":2431,"children":2433},{"id":2432},"技術架構",[2434],{"type":640,"value":2432},{"type":635,"tag":636,"props":2436,"children":2437},{},[2438,2440,2446],{"type":640,"value":2439},"篩選機制從各模型的 model card 讀取評測結果，以 Git 版本化基礎設施維護，資料可追溯。此功能與 2026 年 2 月上線的 Community Evals 系統共用同一套 ",{"type":635,"tag":2422,"props":2441,"children":2443},{"className":2442},[],[2444],{"type":640,"value":2445},".eval_results/",{"type":640,"value":2447}," YAML 架構，允許模型作者與社群貢獻者提交評測結果，所有變更均有版本記錄。",{"type":635,"tag":749,"props":2449,"children":2450},{},[2451],{"type":635,"tag":636,"props":2452,"children":2453},{},[2454,2458,2461,2463,2469],{"type":635,"tag":696,"props":2455,"children":2456},{},[2457],{"type":640,"value":759},{"type":635,"tag":761,"props":2459,"children":2460},{},[],{"type":640,"value":2462},"\nCommunity Evals：Hugging Face 的社群評測系統，任何人皆可透過提交 ",{"type":635,"tag":2422,"props":2464,"children":2466},{"className":2465},[],[2467],{"type":640,"value":2468},"eval.yaml",{"type":640,"value":2470},"（遵循 Inspect AI 格式）為模型新增基準測試結果，並以 Git 追蹤所有變更。",{"title":399,"searchDepth":642,"depth":642,"links":2472},[],{"data":2474,"body":2476,"excerpt":-1,"toc":2490},{"title":399,"description":2475},"選模型不再需要手動瀏覽整份大型排行榜。只需在目標 benchmark 頁面設定參數量區間（如 7B–13B），即可即時看到同量級最佳選項及 🏅 前三名。若要提交自家模型的評測結果，按 Community Evals 規格寫入 .eval_results/ YAML 並 push 即可，變更自動納入版本記錄。",{"type":632,"children":2477},[2478],{"type":635,"tag":636,"props":2479,"children":2480},{},[2481,2483,2488],{"type":640,"value":2482},"選模型不再需要手動瀏覽整份大型排行榜。只需在目標 benchmark 頁面設定參數量區間（如 7B–13B），即可即時看到同量級最佳選項及 🏅 前三名。若要提交自家模型的評測結果，按 Community Evals 規格寫入 ",{"type":635,"tag":2422,"props":2484,"children":2486},{"className":2485},[],[2487],{"type":640,"value":2445},{"type":640,"value":2489}," YAML 並 push 即可，變更自動納入版本記錄。",{"title":399,"searchDepth":642,"depth":642,"links":2491},[],{"data":2493,"body":2494,"excerpt":-1,"toc":2500},{"title":399,"description":396},{"type":632,"children":2495},[2496],{"type":635,"tag":636,"props":2497,"children":2498},{},[2499],{"type":640,"value":396},{"title":399,"searchDepth":642,"depth":642,"links":2501},[],{"data":2503,"body":2504,"excerpt":-1,"toc":2561},{"title":399,"description":399},{"type":632,"children":2505},[2506,2512,2524,2539,2544,2556],{"type":635,"tag":679,"props":2507,"children":2509},{"id":2508},"forge本地-llm-的可靠性護欄",[2510],{"type":640,"value":2511},"Forge：本地 LLM 的可靠性護欄",{"type":635,"tag":636,"props":2513,"children":2514},{},[2515,2517,2522],{"type":640,"value":2516},"德州儀器 AI Director Antoine Zambelli 開源的 Forge，是專為本地端 LLM tool-calling 設計的可靠性中間層。加上 guardrails 後，8B 小模型的 agentic 任務完成率從 ",{"type":635,"tag":696,"props":2518,"children":2519},{},[2520],{"type":640,"value":2521},"53% 躍升至 99%",{"type":640,"value":2523},"，表現甚至超越未加護欄的頂尖商業 API。",{"type":635,"tag":749,"props":2525,"children":2526},{},[2527],{"type":635,"tag":636,"props":2528,"children":2529},{},[2530,2534,2537],{"type":635,"tag":696,"props":2531,"children":2532},{},[2533],{"type":640,"value":759},{"type":635,"tag":761,"props":2535,"children":2536},{},[],{"type":640,"value":2538},"\nAgentic 任務：LLM 需自主規劃、連續呼叫工具的複雜任務，如「搜尋→整理→寫入」多步驟流程。",{"type":635,"tag":679,"props":2540,"children":2542},{"id":2541},"評測關鍵發現",[2543],{"type":640,"value":2541},{"type":635,"tag":636,"props":2545,"children":2546},{},[2547,2549,2554],{"type":640,"value":2548},"50+ 種模型╱後端組合、9 個場景各跑 50 次的評測揭示：",{"type":635,"tag":696,"props":2550,"children":2551},{},[2552],{"type":640,"value":2553},"相同模型在不同 serving backend 上，準確率差異可達 0% 對 78%",{"type":640,"value":2555},"。前沿大模型不加護欄時完成率僅 49–87%，錯誤恢復率為 0%——模型尺寸越大並不保證越好。",{"type":635,"tag":636,"props":2557,"children":2558},{},[2559],{"type":640,"value":2560},"護欄堆疊含五大機制（retry nudges、step enforcement、error recovery、context compaction、VRAM-aware budgeting），三種整合模式支援從結構化 agent loop 到 OpenAI API 相容代理的完整部署需求。",{"title":399,"searchDepth":642,"depth":642,"links":2562},[],{"data":2564,"body":2566,"excerpt":-1,"toc":2585},{"title":399,"description":2565},"Forge 提供三種整合路徑：WorkflowRunner（全新 agent loop）、Guardrails middleware（可插入現有 pipeline）、Proxy server（相容 OpenAI API，遷移成本最低）。",{"type":632,"children":2567},[2568,2572],{"type":635,"tag":636,"props":2569,"children":2570},{},[2571],{"type":640,"value":2565},{"type":635,"tag":636,"props":2573,"children":2574},{},[2575,2577,2583],{"type":640,"value":2576},"環境需求 Python 3.12+，支援 Ollama、llama-server、Llamafile、Anthropic 後端；vLLM 支援在實驗分支 (",{"type":635,"tag":2422,"props":2578,"children":2580},{"className":2579},[],[2581],{"type":640,"value":2582},"az/vllm",{"type":640,"value":2584},") ，尚未合併主線。MIT 授權、1.2k stars，可直接 clone 評估引入。",{"title":399,"searchDepth":642,"depth":642,"links":2586},[],{"data":2588,"body":2590,"excerpt":-1,"toc":2601},{"title":399,"description":2589},"Forge 重塑了「本地推論 vs. 雲端 API」的成本決策基準。若 8B 模型加護欄後能達 99% agentic 可靠性，企業可大幅降低對商業 API 的依賴，並讓資料留在本地以滿足合規要求。",{"type":632,"children":2591},[2592,2596],{"type":635,"tag":636,"props":2593,"children":2594},{},[2595],{"type":640,"value":2589},{"type":635,"tag":636,"props":2597,"children":2598},{},[2599],{"type":640,"value":2600},"論文已收錄為 ACM CAIS 2026 demo，預計 2026-05-28 在 San Jose 展示；德州儀器的工業場景加持，也讓技術落地可信度更高。",{"title":399,"searchDepth":642,"depth":642,"links":2602},[],{"data":2604,"body":2605,"excerpt":-1,"toc":2654},{"title":399,"description":399},{"type":632,"children":2606},[2607,2613,2636,2641],{"type":635,"tag":679,"props":2608,"children":2610},{"id":2609},"agentic-任務完成率",[2611],{"type":640,"value":2612},"Agentic 任務完成率",{"type":635,"tag":915,"props":2614,"children":2615},{},[2616,2626,2631],{"type":635,"tag":919,"props":2617,"children":2618},{},[2619,2621],{"type":640,"value":2620},"8B 模型（加 Forge 護欄）：53% → ",{"type":635,"tag":696,"props":2622,"children":2623},{},[2624],{"type":640,"value":2625},"99%",{"type":635,"tag":919,"props":2627,"children":2628},{},[2629],{"type":640,"value":2630},"頂尖商業 API（未加護欄）：49–87%，錯誤恢復率 0%",{"type":635,"tag":919,"props":2632,"children":2633},{},[2634],{"type":640,"value":2635},"相同模型不同 backend 差異：最大 0% vs. 78%",{"type":635,"tag":679,"props":2637,"children":2639},{"id":2638},"評測規模",[2640],{"type":640,"value":2638},{"type":635,"tag":915,"props":2642,"children":2643},{},[2644,2649],{"type":635,"tag":919,"props":2645,"children":2646},{},[2647],{"type":640,"value":2648},"50+ 種模型╱後端組合",{"type":635,"tag":919,"props":2650,"children":2651},{},[2652],{"type":640,"value":2653},"9 個 agentic 場景 × 50 次，共 26 個評估情境",{"title":399,"searchDepth":642,"depth":642,"links":2655},[],{"data":2657,"body":2658,"excerpt":-1,"toc":2700},{"title":399,"description":399},{"type":632,"children":2659},[2660,2665,2670,2685,2690,2695],{"type":635,"tag":679,"props":2661,"children":2663},{"id":2662},"惡意擴充套件開啟後門",[2664],{"type":640,"value":2662},{"type":635,"tag":636,"props":2666,"children":2667},{},[2668],{"type":640,"value":2669},"2026-05-20，GitHub 確認遭駭客組織 TeamPCP 入侵，約 3,800 個內部程式碼 repository 遭竊取。攻擊入口出奇地簡單：一名 GitHub 員工安裝了惡意 VS Code 擴充套件，攻擊者藉此竊取驗證 token、私鑰及環境變數，再以竊得憑證直接 clone 內部 repository。",{"type":635,"tag":749,"props":2671,"children":2672},{},[2673],{"type":635,"tag":636,"props":2674,"children":2675},{},[2676,2680,2683],{"type":635,"tag":696,"props":2677,"children":2678},{},[2679],{"type":640,"value":759},{"type":635,"tag":761,"props":2681,"children":2682},{},[],{"type":640,"value":2684},"\nTeamPCP 是自 2026 年 3 月起活躍的駭客組織，曾針對 npm、PyPI 及 VS Code 擴充套件生態系發動多起供應鏈攻擊，此前目標包含 TanStack、LiteLLM 及歐盟委員會。",{"type":635,"tag":679,"props":2686,"children":2688},{"id":2687},"影響範圍與即時處置",[2689],{"type":640,"value":2687},{"type":635,"tag":636,"props":2691,"children":2692},{},[2693],{"type":640,"value":2694},"GitHub 表示目前無客戶資料或使用者 repository 遭竊的跡象，入侵後已輪換關鍵憑證並隔離受影響員工裝置。然而 TeamPCP 已在犯罪論壇開價 $50,000 美元出售竊取原始碼，威脅若無人購買將公開釋出。",{"type":635,"tag":636,"props":2696,"children":2697},{},[2698],{"type":640,"value":2699},"更深層的隱患在於 VS Code 至今缺乏擴充套件沙箱機制——GitHub 早在 2018 年開立的 issue #52116 要求沙箱化，八年來懸而未決。",{"title":399,"searchDepth":642,"depth":642,"links":2701},[],{"data":2703,"body":2705,"excerpt":-1,"toc":2734},{"title":399,"description":2704},"此事件的核心教訓是：開發者機器是供應鏈最薄弱環節。VS Code 擴充套件可完整讀取機器上所有憑證、雲端金鑰與 SSH 金鑰，目前無任何沙箱限制。",{"type":632,"children":2706},[2707,2711,2716],{"type":635,"tag":636,"props":2708,"children":2709},{},[2710],{"type":640,"value":2704},{"type":635,"tag":636,"props":2712,"children":2713},{},[2714],{"type":640,"value":2715},"即時行動建議：",{"type":635,"tag":915,"props":2717,"children":2718},{},[2719,2724,2729],{"type":635,"tag":919,"props":2720,"children":2721},{},[2722],{"type":640,"value":2723},"審查已安裝的 VS Code 擴充套件，移除非必要或來源不明者",{"type":635,"tag":919,"props":2725,"children":2726},{},[2727],{"type":640,"value":2728},"改用 secrets manager（如 1Password CLI、AWS Secrets Manager）取代環境變數明文存放金鑰",{"type":635,"tag":919,"props":2730,"children":2731},{},[2732],{"type":640,"value":2733},"企業可透過 VS Code Policy 建立允許安裝的擴充套件白名單",{"title":399,"searchDepth":642,"depth":642,"links":2735},[],{"data":2737,"body":2739,"excerpt":-1,"toc":2768},{"title":399,"description":2738},"GitHub 管理全球大量開源與私有程式碼基礎設施，此次內部原始碼外洩雖暫未直接衝擊用戶，但暴露出平台本身在供應鏈安全上的隱患。",{"type":632,"children":2740},[2741,2745,2750],{"type":635,"tag":636,"props":2742,"children":2743},{},[2744],{"type":640,"value":2738},{"type":635,"tag":636,"props":2746,"children":2747},{},[2748],{"type":640,"value":2749},"對企業而言，需評估的風險包括：",{"type":635,"tag":915,"props":2751,"children":2752},{},[2753,2758,2763],{"type":635,"tag":919,"props":2754,"children":2755},{},[2756],{"type":640,"value":2757},"GitHub Actions workflow 是否依賴可能遭竄改的內部工具",{"type":635,"tag":919,"props":2759,"children":2760},{},[2761],{"type":640,"value":2762},"GitHub Advanced Security 或 Copilot 的分析邏輯若被修改，是否影響企業資安決策",{"type":635,"tag":919,"props":2764,"children":2765},{},[2766],{"type":640,"value":2767},"若 TeamPCP 公開原始碼，競爭對手或其他攻擊者可取得 GitHub 內部架構細節",{"title":399,"searchDepth":642,"depth":642,"links":2769},[],{"data":2771,"body":2772,"excerpt":-1,"toc":2832},{"title":399,"description":399},{"type":632,"children":2773},[2774,2780,2792,2798,2817],{"type":635,"tag":679,"props":2775,"children":2777},{"id":2776},"四款模型家族生成時長提升-8-倍",[2778],{"type":640,"value":2779},"四款模型家族，生成時長提升 8 倍",{"type":635,"tag":636,"props":2781,"children":2782},{},[2783,2785,2790],{"type":640,"value":2784},"Stability AI 發布 Stable Audio 3.0，推出 Large(2.7B) 、Medium(1.4B) 、Small 與 Small SFX（各 459M）四款模型。旗艦版最長可生成 ",{"type":635,"tag":696,"props":2786,"children":2787},{},[2788],{"type":640,"value":2789},"6 分 20 秒",{"type":640,"value":2791},"完整歌曲，較前代 47 秒提升 8 倍；Small 可在消費筆電或手機側推論，約 0.44 秒完成生成。",{"type":635,"tag":679,"props":2793,"children":2795},{"id":2794},"架構亮點same-ping-pong-sampling",[2796],{"type":640,"value":2797},"架構亮點：SAME + Ping-pong Sampling",{"type":635,"tag":636,"props":2799,"children":2800},{},[2801,2803,2808,2810,2815],{"type":640,"value":2802},"核心採用 ",{"type":635,"tag":696,"props":2804,"children":2805},{},[2806],{"type":640,"value":2807},"Semantic-Acoustic Autoencoder(SAME)",{"type":640,"value":2809}," 搭配 Diffusion Transformer，SAME 達成 4096× 降採樣，讓長音訊得以在消費硬體上運行。首創 ",{"type":635,"tag":696,"props":2811,"children":2812},{},[2813],{"type":640,"value":2814},"Ping-pong sampling",{"type":640,"value":2816}," 雙向自我修正推論策略，不依賴 classifier-free guidance。支援音訊 Inpainting 與完整 LoRA 微調，訓練資料 100% 授權，論文已發表於 arXiv(2605.17991v1) 。",{"type":635,"tag":749,"props":2818,"children":2819},{},[2820],{"type":635,"tag":636,"props":2821,"children":2822},{},[2823,2827,2830],{"type":635,"tag":696,"props":2824,"children":2825},{},[2826],{"type":640,"value":759},{"type":635,"tag":761,"props":2828,"children":2829},{},[],{"type":640,"value":2831},"\nSAME(Semantic-Acoustic Autoencoder) ：透過 4096× 降採樣壓縮音訊語意，將長音訊計算量壓縮至消費硬體可負擔的範圍。",{"title":399,"searchDepth":642,"depth":642,"links":2833},[],{"data":2835,"body":2836,"excerpt":-1,"toc":2842},{"title":399,"description":503},{"type":632,"children":2837},[2838],{"type":635,"tag":636,"props":2839,"children":2840},{},[2841],{"type":640,"value":503},{"title":399,"searchDepth":642,"depth":642,"links":2843},[],{"data":2845,"body":2846,"excerpt":-1,"toc":2852},{"title":399,"description":504},{"type":632,"children":2847},[2848],{"type":635,"tag":636,"props":2849,"children":2850},{},[2851],{"type":640,"value":504},{"title":399,"searchDepth":642,"depth":642,"links":2853},[],{"data":2855,"body":2856,"excerpt":-1,"toc":2902},{"title":399,"description":399},{"type":632,"children":2857},[2858,2863],{"type":635,"tag":679,"props":2859,"children":2861},{"id":2860},"推論效能",[2862],{"type":640,"value":2860},{"type":635,"tag":915,"props":2864,"children":2865},{},[2866,2876,2886,2891],{"type":635,"tag":919,"props":2867,"children":2868},{},[2869,2871],{"type":640,"value":2870},"Small(459M) ：消費級筆電約 ",{"type":635,"tag":696,"props":2872,"children":2873},{},[2874],{"type":640,"value":2875},"0.44 秒",{"type":635,"tag":919,"props":2877,"children":2878},{},[2879,2881],{"type":640,"value":2880},"Medium(1.4B) ：H200 GPU 約 ",{"type":635,"tag":696,"props":2882,"children":2883},{},[2884],{"type":640,"value":2885},"1.31 秒",{"type":635,"tag":919,"props":2887,"children":2888},{},[2889],{"type":640,"value":2890},"Large(2.7B) ：API 存取，推論速度未公開",{"type":635,"tag":919,"props":2892,"children":2893},{},[2894,2896,2900],{"type":640,"value":2895},"生成時長：Large／Medium ",{"type":635,"tag":696,"props":2897,"children":2898},{},[2899],{"type":640,"value":2789},{"type":640,"value":2901},"（前代 2.0：47 秒，提升 8 倍）",{"title":399,"searchDepth":642,"depth":642,"links":2903},[],{"data":2905,"body":2906,"excerpt":-1,"toc":2950},{"title":399,"description":399},{"type":632,"children":2907},[2908,2914,2919,2934,2939,2945],{"type":635,"tag":679,"props":2909,"children":2911},{"id":2910},"musk-敗訴解鎖-ipo-時程",[2912],{"type":640,"value":2913},"Musk 敗訴解鎖 IPO 時程",{"type":635,"tag":636,"props":2915,"children":2916},{},[2917],{"type":640,"value":2918},"2026 年 5 月 19 日，加州陪審團駁回 Elon Musk 對 OpenAI 及 Sam Altman 的訴訟，裁定提告時效已過。敗訴隔天，OpenAI 即傳出最快於 5 月 24 日秘密遞交 IPO 招股說明書草案 (confidential filing) ，目標最快 9 月掛牌，上市估值劍指逾 1 兆美元。",{"type":635,"tag":749,"props":2920,"children":2921},{},[2922],{"type":635,"tag":636,"props":2923,"children":2924},{},[2925,2929,2932],{"type":635,"tag":696,"props":2926,"children":2927},{},[2928],{"type":640,"value":759},{"type":635,"tag":761,"props":2930,"children":2931},{},[],{"type":640,"value":2933},"\nConfidential filing（秘密申報）：美國上市程序中，企業可先向 SEC 秘密遞交招股書草案，待確認上市時程後再公開，防止計畫提前曝光。",{"type":635,"tag":636,"props":2935,"children":2936},{},[2937],{"type":640,"value":2938},"此前 CFO Sarah Friar 計畫 2026 下半年遞交文件、2027 年掛牌；法律雲霧散去後，時程大幅提前。Goldman Sachs 與 Morgan Stanley 共同主導承銷，法律顧問為 Cooley 律師事務所。",{"type":635,"tag":679,"props":2940,"children":2942},{"id":2941},"ipo-背後的財務現實",[2943],{"type":640,"value":2944},"IPO 背後的財務現實",{"type":635,"tag":636,"props":2946,"children":2947},{},[2948],{"type":640,"value":2949},"OpenAI 2026 年 3 月剛以 8,520 億美元估值完成私募，Amazon、Nvidia、SoftBank、Microsoft 等共注資 1,220 億美元。然而公司預估全年淨虧損約 140 億美元，主因為基礎設施與算力成本，同時面臨內部營收及用戶成長目標未達標的壓力。",{"title":399,"searchDepth":642,"depth":642,"links":2951},[],{"data":2953,"body":2954,"excerpt":-1,"toc":2960},{"title":399,"description":539},{"type":632,"children":2955},[2956],{"type":635,"tag":636,"props":2957,"children":2958},{},[2959],{"type":640,"value":539},{"title":399,"searchDepth":642,"depth":642,"links":2961},[],{"data":2963,"body":2964,"excerpt":-1,"toc":2970},{"title":399,"description":540},{"type":632,"children":2965},[2966],{"type":635,"tag":636,"props":2967,"children":2968},{},[2969],{"type":640,"value":540},{"title":399,"searchDepth":642,"depth":642,"links":2971},[],{"data":2973,"body":2974,"excerpt":-1,"toc":3022},{"title":399,"description":399},{"type":632,"children":2975},[2976,2982,2987,3002,3007,3012,3017],{"type":635,"tag":679,"props":2977,"children":2979},{"id":2978},"傳統-nlp-的底氣",[2980],{"type":640,"value":2981},"傳統 NLP 的底氣",{"type":635,"tag":636,"props":2983,"children":2984},{},[2985],{"type":640,"value":2986},"highlight.js 原作者 Ivan Sagalaev 在 2026 年 5 月發表文章，介紹他為購物清單 app 打造的分類工具 Shoppy，設計刻意迴避 LLM：輸入文字先做 tokenization 與 stemming，再組合 unigrams 與 bigrams，以排序實現詞序無關性。",{"type":635,"tag":749,"props":2988,"children":2989},{},[2990],{"type":635,"tag":636,"props":2991,"children":2992},{},[2993,2997,3000],{"type":635,"tag":696,"props":2994,"children":2995},{},[2996],{"type":640,"value":759},{"type":635,"tag":761,"props":2998,"children":2999},{},[],{"type":640,"value":3001},"\nBigram 是兩個相鄰詞的組合；查詢時 bigrams 優先於 unigrams，讓「apple juice」優先歸類為飲料而非水果，有效解決詞義歧義。",{"type":635,"tag":636,"props":3003,"children":3004},{},[3005],{"type":640,"value":3006},"整份資料集僅約 500 筆 CSV 條目，未知詞彙直接忽略，系統仍能依已知詞彙做出合理歸類。",{"type":635,"tag":679,"props":3008,"children":3010},{"id":3009},"工具選擇應匹配問題規模",[3011],{"type":640,"value":3009},{"type":635,"tag":636,"props":3013,"children":3014},{},[3015],{"type":640,"value":3016},"作者明確指出此方案「更簡單、本機運行、免費、且具倫理性」，直指 LLM 方案的四個隱性成本：複雜度、網路依賴、API 費用、隱私疑慮。",{"type":635,"tag":636,"props":3018,"children":3019},{},[3020],{"type":640,"value":3021},"學術研究 (arXiv 2025-02) 亦指出，傳統方法在特定分類任務上仍具競爭力，成本遠低於 LLM 推論。本文意義不在技術創新，而在提供「工具選型應匹配問題規模」的清晰實踐示範。",{"title":399,"searchDepth":642,"depth":642,"links":3023},[],{"data":3025,"body":3027,"excerpt":-1,"toc":3038},{"title":399,"description":3026},"Bigram 優先 + stemming 組合在封閉領域（固定商品詞彙）表現穩定、易維護。整體堆疊輕量：後端 Django、前端原生 HTML + 現代 CSS，無需重型 JS 框架。",{"type":632,"children":3028},[3029,3033],{"type":635,"tag":636,"props":3030,"children":3031},{},[3032],{"type":640,"value":3026},{"type":635,"tag":636,"props":3034,"children":3035},{},[3036],{"type":640,"value":3037},"在詞彙域固定、資料集小的情境下，規則系統往往比串接 LLM API 更易除錯、更可預測，且省去 rate limit 與網路延遲的顧慮。",{"title":399,"searchDepth":642,"depth":642,"links":3039},[],{"data":3041,"body":3043,"excerpt":-1,"toc":3054},{"title":399,"description":3042},"每次 LLM 推論的 API 費用、資料隱私合規、第三方服務依賴，在分類邏輯固定的中小型應用中可能都是過度投資。",{"type":632,"children":3044},[3045,3049],{"type":635,"tag":636,"props":3046,"children":3047},{},[3048],{"type":640,"value":3042},{"type":635,"tag":636,"props":3050,"children":3051},{},[3052],{"type":640,"value":3053},"傳統 NLP 方案能帶來更可控的成本結構、更高的資料主權，並避免廠商鎖定風險。技術選型應先問：「問題規模是否值得 LLM 的代價？」",{"title":399,"searchDepth":642,"depth":642,"links":3055},[],{"data":3057,"body":3058,"excerpt":-1,"toc":3123},{"title":399,"description":399},{"type":632,"children":3059},[3060,3066,3085,3091,3103,3118],{"type":635,"tag":679,"props":3061,"children":3063},{"id":3062},"季度亮點再創歷史新高",[3064],{"type":640,"value":3065},"季度亮點：再創歷史新高",{"type":635,"tag":636,"props":3067,"children":3068},{},[3069,3071,3076,3078,3083],{"type":640,"value":3070},"Nvidia FY2027 Q1（截至 2026 年 4 月）總營收達 ",{"type":635,"tag":696,"props":3072,"children":3073},{},[3074],{"type":640,"value":3075},"816 億美元",{"type":640,"value":3077},"，年增 85%、季增 20%，創歷史新高。調整後 EPS $1.87 優於市場預估 $1.77。Blackwell 架構已被全球每家主要超大規模雲端商及模型開發商採用，資料中心單季營收 ",{"type":635,"tag":696,"props":3079,"children":3080},{},[3081],{"type":640,"value":3082},"752 億美元",{"type":640,"value":3084},"，佔比高達 92%。",{"type":635,"tag":679,"props":3086,"children":3088},{"id":3087},"新創版圖430-億美元的股權布局",[3089],{"type":640,"value":3090},"新創版圖：430 億美元的股權布局",{"type":635,"tag":636,"props":3092,"children":3093},{},[3094,3096,3101],{"type":640,"value":3095},"Nvidia 本季未上市股權持倉從年初 220 億美元",{"type":635,"tag":696,"props":3097,"children":3098},{},[3099],{"type":640,"value":3100},"翻倍至 430 億美元",{"type":640,"value":3102},"，單季買入 185 億美元（前季僅 6.49 億美元），投資節奏急遽加速。",{"type":635,"tag":749,"props":3104,"children":3105},{},[3106],{"type":635,"tag":636,"props":3107,"children":3108},{},[3109,3113,3116],{"type":635,"tag":696,"props":3110,"children":3111},{},[3112],{"type":640,"value":759},{"type":635,"tag":761,"props":3114,"children":3115},{},[],{"type":640,"value":3117},"\n非上市股權 (non-marketable equity securities) ：持有尚未公開上市的新創公司股份，流動性低、但潛在回報高。",{"type":635,"tag":636,"props":3119,"children":3120},{},[3121],{"type":640,"value":3122},"這筆 430 億尚不含已公告的 300 億美元 OpenAI 承諾及已上市股票持倉，Nvidia 正以「算力供應換股權」的策略建立 AI 生態版圖。Q2 指引約 910 億美元 (±2%) ，季增幅降至約 12%，略低於市場預期。",{"title":399,"searchDepth":642,"depth":642,"links":3124},[],{"data":3126,"body":3127,"excerpt":-1,"toc":3133},{"title":399,"description":597},{"type":632,"children":3128},[3129],{"type":635,"tag":636,"props":3130,"children":3131},{},[3132],{"type":640,"value":597},{"title":399,"searchDepth":642,"depth":642,"links":3134},[],{"data":3136,"body":3137,"excerpt":-1,"toc":3143},{"title":399,"description":598},{"type":632,"children":3138},[3139],{"type":635,"tag":636,"props":3140,"children":3141},{},[3142],{"type":640,"value":598},{"title":399,"searchDepth":642,"depth":642,"links":3144},[],{"data":3146,"body":3147,"excerpt":-1,"toc":3182},{"title":399,"description":399},{"type":632,"children":3148},[3149,3154],{"type":635,"tag":679,"props":3150,"children":3152},{"id":3151},"財務基準",[3153],{"type":640,"value":3151},{"type":635,"tag":915,"props":3155,"children":3156},{},[3157,3162,3167,3172,3177],{"type":635,"tag":919,"props":3158,"children":3159},{},[3160],{"type":640,"value":3161},"總營收：816 億美元（年增 85%、季增 20%）",{"type":635,"tag":919,"props":3163,"children":3164},{},[3165],{"type":640,"value":3166},"資料中心：752 億美元（佔比 92%）",{"type":635,"tag":919,"props":3168,"children":3169},{},[3170],{"type":640,"value":3171},"調整後 EPS：$1.87（優於預估 $1.77）",{"type":635,"tag":919,"props":3173,"children":3174},{},[3175],{"type":640,"value":3176},"Q2 指引：約 910 億美元 (±2%)",{"type":635,"tag":919,"props":3178,"children":3179},{},[3180],{"type":640,"value":3181},"新創股權部位：430 億美元（本季淨增 185 億）",{"title":399,"searchDepth":642,"depth":642,"links":3183},[],{"data":3185,"body":3186,"excerpt":-1,"toc":3326},{"title":399,"description":399},{"type":632,"children":3187},[3188,3193,3198,3251,3256,3266,3271,3281,3286,3291,3296,3301,3306,3311,3316,3321],{"type":635,"tag":679,"props":3189,"children":3191},{"id":3190},"社群熱議排行",[3192],{"type":640,"value":3190},{"type":635,"tag":636,"props":3194,"children":3195},{},[3196],{"type":640,"value":3197},"今日五大熱議主題（依社群討論熱度排序）：",{"type":635,"tag":915,"props":3199,"children":3200},{},[3201,3211,3221,3231,3241],{"type":635,"tag":919,"props":3202,"children":3203},{},[3204,3209],{"type":635,"tag":696,"props":3205,"children":3206},{},[3207],{"type":640,"value":3208},"DeepSeek Code 挑戰 Claude Code",{"type":640,"value":3210},"：spacedcowboy(HN) 稱月費從 £200 降至 £18，成本壓縮實測爆發，X 上同步流傳三模型組合工作流。",{"type":635,"tag":919,"props":3212,"children":3213},{},[3214,3219],{"type":635,"tag":696,"props":3215,"children":3216},{},[3217],{"type":640,"value":3218},"OpenAI 推翻離散幾何猜想",{"type":640,"value":3220},"：timkellogg.me（Bluesky，35 likes）：「決策數量遠超任何人類可行探索範圍。」",{"type":635,"tag":919,"props":3222,"children":3223},{},[3224,3229],{"type":635,"tag":696,"props":3225,"children":3226},{},[3227],{"type":640,"value":3228},"Anthropic 首季獲利在望",{"type":640,"value":3230},"：Ed Zitron（Bluesky，304 upvotes）質疑算力合約義務高達 1.25 兆美元。",{"type":635,"tag":919,"props":3232,"children":3233},{},[3234,3239],{"type":635,"tag":696,"props":3235,"children":3236},{},[3237],{"type":640,"value":3238},"GitHub 供應鏈攻擊",{"type":640,"value":3240},"：echobit.de（Bluesky，40 upvotes）諷刺「GitHub 現在是開源的了」。",{"type":635,"tag":919,"props":3242,"children":3243},{},[3244,3249],{"type":635,"tag":696,"props":3245,"children":3246},{},[3247],{"type":640,"value":3248},"Guardrails 讓 8B 模型 agentic 可靠性從 53% 升至 99%",{"type":640,"value":3250},"：HN 社群熱議自托管替代前沿 API 可行性。",{"type":635,"tag":679,"props":3252,"children":3254},{"id":3253},"技術爭議與分歧",[3255],{"type":640,"value":3253},{"type":635,"tag":636,"props":3257,"children":3258},{},[3259,3264],{"type":635,"tag":696,"props":3260,"children":3261},{},[3262],{"type":640,"value":3263},"DeepSeek vs. 前沿模型",{"type":640,"value":3265},"：spacedcowboy(HN) 實測：「把訂閱費從 £200 降至 £18，大多數工作交給 DeepSeek，只用 Claude 驗證假設。」",{"type":635,"tag":636,"props":3267,"children":3268},{},[3269],{"type":640,"value":3270},"josephg(HN) 反駁：「DeepSeek 在高層設計選擇差距很大，更容易陷入打地鼠式修 bug 迴圈；我停下讓 opus 解同一問題，opus 立刻看出了解法。」",{"type":635,"tag":636,"props":3272,"children":3273},{},[3274,3279],{"type":635,"tag":696,"props":3275,"children":3276},{},[3277],{"type":640,"value":3278},"Anthropic 獲利真實性",{"type":640,"value":3280},"：Bill Gurley(Benchmark Capital) 批評：「以低於成本的價格轉售 NVIDIA token 是拉抬帳面營收的捷徑。情況很複雜。」",{"type":635,"tag":636,"props":3282,"children":3283},{},[3284],{"type":640,"value":3285},"this_user(HN) 反駁：「錢在企業端，不在補貼消費者的訂閱方案；市場想看到的正是一條可信的獲利路徑。」",{"type":635,"tag":679,"props":3287,"children":3289},{"id":3288},"實戰經驗",[3290],{"type":640,"value":3288},{"type":635,"tag":636,"props":3292,"children":3293},{},[3294],{"type":640,"value":3295},"「@LottoLabs(X) ：在 3090 上跑 Qwen 27b，搭配 Hermes agent 使用 7 天，保守估計 80% 快取命中率；27b 能力介於 Sonnet 和 5.4 mini 之間。」",{"type":635,"tag":636,"props":3297,"children":3298},{},[3299],{"type":640,"value":3300},"「spacedcowboy(HN) ：Claude Code + DeepSeek Flash 後端，月費從 £200 降至 £18，任務涵蓋為 FPGA 設計 HDL 並寫最終 CPU 的編譯器——並非瑣碎任務。」",{"type":635,"tag":636,"props":3302,"children":3303},{},[3304],{"type":640,"value":3305},"「somethingsome(HN) ：在 2x L40S 用 vLLM 跑 Forge 護欄，遇 model name 問題後以 --served-model-name 別名解決；8B 模型 agentic 可靠性確認從 53% 升至 99%。」",{"type":635,"tag":679,"props":3307,"children":3309},{"id":3308},"未解問題與社群預期",[3310],{"type":640,"value":3308},{"type":635,"tag":636,"props":3312,"children":3313},{},[3314],{"type":640,"value":3315},"OpenAI 數學突破後，doginasuit(HN) 提出核心質疑：「AI 推理不過是遞迴迭代自身輸出，每次改進都在遞減。」官方至今未回應，也未宣布是否開放推理模型。",{"type":635,"tag":636,"props":3317,"children":3318},{},[3319],{"type":640,"value":3320},"GitHub 供應鏈攻擊後，LiamPowell(HN) 批評：「擴充套件從來就不需要未沙箱化存取權，這是他們主動的選擇。」微軟尚未宣布強制沙箱化時間表。",{"type":635,"tag":636,"props":3322,"children":3323},{},[3324],{"type":640,"value":3325},"Meta 在中東封鎖人權帳號後，yourdigitalbrain.bsky.social（Bluesky，6 讚）追問：「當局究竟會走到多遠來控制輿論敘事？」社群期待歐盟 DSA 介入，但 Meta 正式回應至今缺席。",{"title":399,"searchDepth":642,"depth":642,"links":3327},[],{"data":3329,"body":3331,"excerpt":-1,"toc":3347},{"title":399,"description":3330},"今日的 AI 版圖在三個維度同步擴張：推理能力抵達了人類無法踏入的數學疆域，商業模型在企業垂直化驅動下觸及獲利臨界點，而開源生態以極低成本重組了工具鏈的可及性。",{"type":632,"children":3332},[3333,3337,3342],{"type":635,"tag":636,"props":3334,"children":3335},{},[3336],{"type":640,"value":3330},{"type":635,"tag":636,"props":3338,"children":3339},{},[3340],{"type":640,"value":3341},"但擴張帶來的不僅是機會。GitHub 供應鏈漏洞提醒每位開發者，本機環境已是新攻擊面；Meta 在中東的封鎖操作則指出，平台治理尚無法應對國家級的內容控制壓力。",{"type":635,"tag":636,"props":3343,"children":3344},{},[3345],{"type":640,"value":3346},"最值得關注的訊號是 Anthropic 獲利路徑的浮現——這意味著 AI 服務正在從「燒錢換市佔」轉向「實際創造價值」的新階段，定價、合規與企業整合將成為下半年競爭的核心戰場。",{"title":399,"searchDepth":642,"depth":642,"links":3348},[],{"data":3350,"body":3351,"excerpt":-1,"toc":3754},{"title":399,"description":399},{"type":632,"children":3352},[3353,3358,3363,3369,3697,3702,3707,3712,3725,3730,3748],{"type":635,"tag":679,"props":3354,"children":3356},{"id":3355},"環境需求",[3357],{"type":640,"value":3355},{"type":635,"tag":636,"props":3359,"children":3360},{},[3361],{"type":640,"value":3362},"此次成果屬於 OpenAI 內部通用推理模型，外部工程師目前無法直接存取。最接近的公開可用工具是 o3、o4-mini(OpenAI) 或 Claude Opus(Anthropic) 等推理型模型；若需形式化驗證，可搭配 Lean 4 或 Coq。",{"type":635,"tag":679,"props":3364,"children":3366},{"id":3365},"最小-poc",[3367],{"type":640,"value":3368},"最小 PoC",{"type":635,"tag":3370,"props":3371,"children":3375},"pre",{"className":3372,"code":3373,"language":3374,"meta":399,"style":399},"language-python shiki shiki-themes vitesse-dark","import anthropic\n\nclient = anthropic.Anthropic()\nresp = client.messages.create(\n    model=\"claude-opus-4-7\",\n    max_tokens=8192,\n    messages=[{\n        \"role\": \"user\",\n        \"content\": \"Explore algebraic number theory to disprove the unit distance conjecture. Focus on number fields beyond Gaussian integers.\"\n    }]\n)\nprint(resp.content[0].text)\n","python",[3376],{"type":635,"tag":2422,"props":3377,"children":3378},{"__ignoreMap":399},[3379,3397,3406,3441,3481,3515,3538,3552,3593,3628,3637,3646],{"type":635,"tag":3380,"props":3381,"children":3384},"span",{"class":3382,"line":3383},"line",1,[3385,3391],{"type":635,"tag":3380,"props":3386,"children":3388},{"style":3387},"--shiki-default:#4D9375",[3389],{"type":640,"value":3390},"import",{"type":635,"tag":3380,"props":3392,"children":3394},{"style":3393},"--shiki-default:#DBD7CAEE",[3395],{"type":640,"value":3396}," anthropic\n",{"type":635,"tag":3380,"props":3398,"children":3399},{"class":3382,"line":642},[3400],{"type":635,"tag":3380,"props":3401,"children":3403},{"emptyLinePlaceholder":3402},true,[3404],{"type":640,"value":3405},"\n",{"type":635,"tag":3380,"props":3407,"children":3409},{"class":3382,"line":3408},3,[3410,3415,3421,3426,3431,3436],{"type":635,"tag":3380,"props":3411,"children":3412},{"style":3393},[3413],{"type":640,"value":3414},"client ",{"type":635,"tag":3380,"props":3416,"children":3418},{"style":3417},"--shiki-default:#666666",[3419],{"type":640,"value":3420},"=",{"type":635,"tag":3380,"props":3422,"children":3423},{"style":3393},[3424],{"type":640,"value":3425}," anthropic",{"type":635,"tag":3380,"props":3427,"children":3428},{"style":3417},[3429],{"type":640,"value":3430},".",{"type":635,"tag":3380,"props":3432,"children":3433},{"style":3393},[3434],{"type":640,"value":3435},"Anthropic",{"type":635,"tag":3380,"props":3437,"children":3438},{"style":3417},[3439],{"type":640,"value":3440},"()\n",{"type":635,"tag":3380,"props":3442,"children":3443},{"class":3382,"line":91},[3444,3449,3453,3458,3462,3467,3471,3476],{"type":635,"tag":3380,"props":3445,"children":3446},{"style":3393},[3447],{"type":640,"value":3448},"resp ",{"type":635,"tag":3380,"props":3450,"children":3451},{"style":3417},[3452],{"type":640,"value":3420},{"type":635,"tag":3380,"props":3454,"children":3455},{"style":3393},[3456],{"type":640,"value":3457}," client",{"type":635,"tag":3380,"props":3459,"children":3460},{"style":3417},[3461],{"type":640,"value":3430},{"type":635,"tag":3380,"props":3463,"children":3464},{"style":3393},[3465],{"type":640,"value":3466},"messages",{"type":635,"tag":3380,"props":3468,"children":3469},{"style":3417},[3470],{"type":640,"value":3430},{"type":635,"tag":3380,"props":3472,"children":3473},{"style":3393},[3474],{"type":640,"value":3475},"create",{"type":635,"tag":3380,"props":3477,"children":3478},{"style":3417},[3479],{"type":640,"value":3480},"(\n",{"type":635,"tag":3380,"props":3482,"children":3483},{"class":3382,"line":92},[3484,3490,3494,3500,3506,3510],{"type":635,"tag":3380,"props":3485,"children":3487},{"style":3486},"--shiki-default:#BD976A",[3488],{"type":640,"value":3489},"    model",{"type":635,"tag":3380,"props":3491,"children":3492},{"style":3417},[3493],{"type":640,"value":3420},{"type":635,"tag":3380,"props":3495,"children":3497},{"style":3496},"--shiki-default:#C98A7D77",[3498],{"type":640,"value":3499},"\"",{"type":635,"tag":3380,"props":3501,"children":3503},{"style":3502},"--shiki-default:#C98A7D",[3504],{"type":640,"value":3505},"claude-opus-4-7",{"type":635,"tag":3380,"props":3507,"children":3508},{"style":3496},[3509],{"type":640,"value":3499},{"type":635,"tag":3380,"props":3511,"children":3512},{"style":3417},[3513],{"type":640,"value":3514},",\n",{"type":635,"tag":3380,"props":3516,"children":3518},{"class":3382,"line":3517},6,[3519,3524,3528,3534],{"type":635,"tag":3380,"props":3520,"children":3521},{"style":3486},[3522],{"type":640,"value":3523},"    max_tokens",{"type":635,"tag":3380,"props":3525,"children":3526},{"style":3417},[3527],{"type":640,"value":3420},{"type":635,"tag":3380,"props":3529,"children":3531},{"style":3530},"--shiki-default:#4C9A91",[3532],{"type":640,"value":3533},"8192",{"type":635,"tag":3380,"props":3535,"children":3536},{"style":3417},[3537],{"type":640,"value":3514},{"type":635,"tag":3380,"props":3539,"children":3541},{"class":3382,"line":3540},7,[3542,3547],{"type":635,"tag":3380,"props":3543,"children":3544},{"style":3486},[3545],{"type":640,"value":3546},"    messages",{"type":635,"tag":3380,"props":3548,"children":3549},{"style":3417},[3550],{"type":640,"value":3551},"=[{\n",{"type":635,"tag":3380,"props":3553,"children":3555},{"class":3382,"line":3554},8,[3556,3561,3566,3570,3575,3580,3585,3589],{"type":635,"tag":3380,"props":3557,"children":3558},{"style":3496},[3559],{"type":640,"value":3560},"        \"",{"type":635,"tag":3380,"props":3562,"children":3563},{"style":3502},[3564],{"type":640,"value":3565},"role",{"type":635,"tag":3380,"props":3567,"children":3568},{"style":3496},[3569],{"type":640,"value":3499},{"type":635,"tag":3380,"props":3571,"children":3572},{"style":3417},[3573],{"type":640,"value":3574},":",{"type":635,"tag":3380,"props":3576,"children":3577},{"style":3496},[3578],{"type":640,"value":3579}," \"",{"type":635,"tag":3380,"props":3581,"children":3582},{"style":3502},[3583],{"type":640,"value":3584},"user",{"type":635,"tag":3380,"props":3586,"children":3587},{"style":3496},[3588],{"type":640,"value":3499},{"type":635,"tag":3380,"props":3590,"children":3591},{"style":3417},[3592],{"type":640,"value":3514},{"type":635,"tag":3380,"props":3594,"children":3596},{"class":3382,"line":3595},9,[3597,3601,3606,3610,3614,3618,3623],{"type":635,"tag":3380,"props":3598,"children":3599},{"style":3496},[3600],{"type":640,"value":3560},{"type":635,"tag":3380,"props":3602,"children":3603},{"style":3502},[3604],{"type":640,"value":3605},"content",{"type":635,"tag":3380,"props":3607,"children":3608},{"style":3496},[3609],{"type":640,"value":3499},{"type":635,"tag":3380,"props":3611,"children":3612},{"style":3417},[3613],{"type":640,"value":3574},{"type":635,"tag":3380,"props":3615,"children":3616},{"style":3496},[3617],{"type":640,"value":3579},{"type":635,"tag":3380,"props":3619,"children":3620},{"style":3502},[3621],{"type":640,"value":3622},"Explore algebraic number theory to disprove the unit distance conjecture. Focus on number fields beyond Gaussian integers.",{"type":635,"tag":3380,"props":3624,"children":3625},{"style":3496},[3626],{"type":640,"value":3627},"\"\n",{"type":635,"tag":3380,"props":3629,"children":3631},{"class":3382,"line":3630},10,[3632],{"type":635,"tag":3380,"props":3633,"children":3634},{"style":3417},[3635],{"type":640,"value":3636},"    }]\n",{"type":635,"tag":3380,"props":3638,"children":3640},{"class":3382,"line":3639},11,[3641],{"type":635,"tag":3380,"props":3642,"children":3643},{"style":3417},[3644],{"type":640,"value":3645},")\n",{"type":635,"tag":3380,"props":3647,"children":3649},{"class":3382,"line":3648},12,[3650,3656,3661,3666,3670,3674,3679,3684,3689,3693],{"type":635,"tag":3380,"props":3651,"children":3653},{"style":3652},"--shiki-default:#B8A965",[3654],{"type":640,"value":3655},"print",{"type":635,"tag":3380,"props":3657,"children":3658},{"style":3417},[3659],{"type":640,"value":3660},"(",{"type":635,"tag":3380,"props":3662,"children":3663},{"style":3393},[3664],{"type":640,"value":3665},"resp",{"type":635,"tag":3380,"props":3667,"children":3668},{"style":3417},[3669],{"type":640,"value":3430},{"type":635,"tag":3380,"props":3671,"children":3672},{"style":3393},[3673],{"type":640,"value":3605},{"type":635,"tag":3380,"props":3675,"children":3676},{"style":3417},[3677],{"type":640,"value":3678},"[",{"type":635,"tag":3380,"props":3680,"children":3681},{"style":3530},[3682],{"type":640,"value":3683},"0",{"type":635,"tag":3380,"props":3685,"children":3686},{"style":3417},[3687],{"type":640,"value":3688},"].",{"type":635,"tag":3380,"props":3690,"children":3691},{"style":3393},[3692],{"type":640,"value":640},{"type":635,"tag":3380,"props":3694,"children":3695},{"style":3417},[3696],{"type":640,"value":3645},{"type":635,"tag":679,"props":3698,"children":3700},{"id":3699},"驗測規劃",[3701],{"type":640,"value":3699},{"type":635,"tag":636,"props":3703,"children":3704},{},[3705],{"type":640,"value":3706},"對 AI 數學研究輔助工具的評估，應聚焦於「模型能否識別正確的研究方向」，而非直接驗證數學命題的正確性。建議先提供一個已知有反例的簡單組合問題，觀察模型是否能自主找到反例路徑。",{"type":635,"tag":679,"props":3708,"children":3710},{"id":3709},"常見陷阱",[3711],{"type":640,"value":3709},{"type":635,"tag":915,"props":3713,"children":3714},{},[3715,3720],{"type":635,"tag":919,"props":3716,"children":3717},{},[3718],{"type":640,"value":3719},"模型可能產生「看似合理但實際錯誤」的數學論述，所有代數推導需人工或形式化工具驗證",{"type":635,"tag":919,"props":3721,"children":3722},{},[3723],{"type":640,"value":3724},"大型語言模型在符號計算上容易出錯，不可直接信任數值或代數推導結果",{"type":635,"tag":679,"props":3726,"children":3728},{"id":3727},"上線檢核清單",[3729],{"type":640,"value":3727},{"type":635,"tag":915,"props":3731,"children":3732},{},[3733,3738,3743],{"type":635,"tag":919,"props":3734,"children":3735},{},[3736],{"type":640,"value":3737},"觀測：產出論證是否有完整的前提假設鏈；引用文獻是否真實存在（防止幻覺）",{"type":635,"tag":919,"props":3739,"children":3740},{},[3741],{"type":640,"value":3742},"成本：數學研究輔助屬高 token 消耗場景，搭配 extended thinking 的 API 呼叫費用可能顯著，需評估批次處理策略",{"type":635,"tag":919,"props":3744,"children":3745},{},[3746],{"type":640,"value":3747},"風險：未經同行評審的 AI 數學輸出不得直接發表或引用，必須透過外部數學家驗證",{"type":635,"tag":3749,"props":3750,"children":3751},"style",{},[3752],{"type":640,"value":3753},"html .default .shiki span {color: var(--shiki-default);background: var(--shiki-default-bg);font-style: var(--shiki-default-font-style);font-weight: var(--shiki-default-font-weight);text-decoration: var(--shiki-default-text-decoration);}html .shiki span {color: var(--shiki-default);background: var(--shiki-default-bg);font-style: var(--shiki-default-font-style);font-weight: var(--shiki-default-font-weight);text-decoration: var(--shiki-default-text-decoration);}",{"title":399,"searchDepth":642,"depth":642,"links":3755},[],{"data":3757,"body":3758,"excerpt":-1,"toc":3949},{"title":399,"description":399},{"type":632,"children":3759},[3760,3764,3769,3775,3780,3887,3892,3896,3901,3905,3923,3927,3945],{"type":635,"tag":679,"props":3761,"children":3762},{"id":3355},[3763],{"type":640,"value":3355},{"type":635,"tag":636,"props":3765,"children":3766},{},[3767],{"type":640,"value":3768},"目前 Deepseek Code 尚未正式發布，但開發者已可透過環境變數將 Deepseek V4 接入 Claude Code 的 agent 框架，作為後端模型替換方案。建議先在個人專案做小規模驗測，再評估是否擴大使用。",{"type":635,"tag":679,"props":3770,"children":3772},{"id":3771},"遷移整合步驟",[3773],{"type":640,"value":3774},"遷移／整合步驟",{"type":635,"tag":636,"props":3776,"children":3777},{},[3778],{"type":640,"value":3779},"現有 Claude Code 用戶若想試用 Deepseek V4 後端，可參考以下環境變數設定：",{"type":635,"tag":3370,"props":3781,"children":3785},{"className":3782,"code":3783,"language":3784,"meta":399,"style":399},"language-bash shiki shiki-themes vitesse-dark","# 將 Claude Code 導向 Deepseek API 端點\nexport ANTHROPIC_BASE_URL=\"https://api.deepseek.com\"\nexport ANTHROPIC_API_KEY=\"your-deepseek-api-key\"\nexport ANTHROPIC_MODEL=\"deepseek-chat\"\n","bash",[3786],{"type":635,"tag":2422,"props":3787,"children":3788},{"__ignoreMap":399},[3789,3798,3829,3858],{"type":635,"tag":3380,"props":3790,"children":3791},{"class":3382,"line":3383},[3792],{"type":635,"tag":3380,"props":3793,"children":3795},{"style":3794},"--shiki-default:#758575DD",[3796],{"type":640,"value":3797},"# 將 Claude Code 導向 Deepseek API 端點\n",{"type":635,"tag":3380,"props":3799,"children":3800},{"class":3382,"line":642},[3801,3807,3812,3816,3820,3825],{"type":635,"tag":3380,"props":3802,"children":3804},{"style":3803},"--shiki-default:#CB7676",[3805],{"type":640,"value":3806},"export",{"type":635,"tag":3380,"props":3808,"children":3809},{"style":3486},[3810],{"type":640,"value":3811}," ANTHROPIC_BASE_URL",{"type":635,"tag":3380,"props":3813,"children":3814},{"style":3417},[3815],{"type":640,"value":3420},{"type":635,"tag":3380,"props":3817,"children":3818},{"style":3496},[3819],{"type":640,"value":3499},{"type":635,"tag":3380,"props":3821,"children":3822},{"style":3502},[3823],{"type":640,"value":3824},"https://api.deepseek.com",{"type":635,"tag":3380,"props":3826,"children":3827},{"style":3496},[3828],{"type":640,"value":3627},{"type":635,"tag":3380,"props":3830,"children":3831},{"class":3382,"line":3408},[3832,3836,3841,3845,3849,3854],{"type":635,"tag":3380,"props":3833,"children":3834},{"style":3803},[3835],{"type":640,"value":3806},{"type":635,"tag":3380,"props":3837,"children":3838},{"style":3486},[3839],{"type":640,"value":3840}," ANTHROPIC_API_KEY",{"type":635,"tag":3380,"props":3842,"children":3843},{"style":3417},[3844],{"type":640,"value":3420},{"type":635,"tag":3380,"props":3846,"children":3847},{"style":3496},[3848],{"type":640,"value":3499},{"type":635,"tag":3380,"props":3850,"children":3851},{"style":3502},[3852],{"type":640,"value":3853},"your-deepseek-api-key",{"type":635,"tag":3380,"props":3855,"children":3856},{"style":3496},[3857],{"type":640,"value":3627},{"type":635,"tag":3380,"props":3859,"children":3860},{"class":3382,"line":91},[3861,3865,3870,3874,3878,3883],{"type":635,"tag":3380,"props":3862,"children":3863},{"style":3803},[3864],{"type":640,"value":3806},{"type":635,"tag":3380,"props":3866,"children":3867},{"style":3486},[3868],{"type":640,"value":3869}," ANTHROPIC_MODEL",{"type":635,"tag":3380,"props":3871,"children":3872},{"style":3417},[3873],{"type":640,"value":3420},{"type":635,"tag":3380,"props":3875,"children":3876},{"style":3496},[3877],{"type":640,"value":3499},{"type":635,"tag":3380,"props":3879,"children":3880},{"style":3502},[3881],{"type":640,"value":3882},"deepseek-chat",{"type":635,"tag":3380,"props":3884,"children":3885},{"style":3496},[3886],{"type":640,"value":3627},{"type":635,"tag":636,"props":3888,"children":3889},{},[3890],{"type":640,"value":3891},"注意此方式依賴 Deepseek 的 OpenAI 相容端點，部分 Claude 特定功能（如 extended thinking）不可用，需自行評估任務相容性後再正式切換。",{"type":635,"tag":679,"props":3893,"children":3894},{"id":3699},[3895],{"type":640,"value":3699},{"type":635,"tag":636,"props":3897,"children":3898},{},[3899],{"type":640,"value":3900},"遷移後建議以三個維度驗測：程式碼生成正確率（基準任務測試集）、跨檔案 context 理解深度（大型 repo 推理任務）、cost per task（與 Claude 原生的成本對比）。建議保留 2 週 A/B 比較期，不要倉促全量切換。",{"type":635,"tag":679,"props":3902,"children":3903},{"id":3709},[3904],{"type":640,"value":3709},{"type":635,"tag":915,"props":3906,"children":3907},{},[3908,3913,3918],{"type":635,"tag":919,"props":3909,"children":3910},{},[3911],{"type":640,"value":3912},"高層架構設計任務不建議完全替換 Opus 4.7，Deepseek 在此類任務的表現落差已有社群回報",{"type":635,"tag":919,"props":3914,"children":3915},{},[3916],{"type":640,"value":3917},"長尾 debug 任務容易觸發 whack-a-mole 迴圈，需設置最大迭代次數限制",{"type":635,"tag":919,"props":3919,"children":3920},{},[3921],{"type":640,"value":3922},"Deepseek API 服務穩定性與 SLA 尚未達到 Anthropic 的企業級水準，需備有 fallback 方案",{"type":635,"tag":679,"props":3924,"children":3925},{"id":3727},[3926],{"type":640,"value":3727},{"type":635,"tag":915,"props":3928,"children":3929},{},[3930,3935,3940],{"type":635,"tag":919,"props":3931,"children":3932},{},[3933],{"type":640,"value":3934},"觀測：token 使用量、每次 agent 呼叫往返次數、context window 使用率",{"type":635,"tag":919,"props":3936,"children":3937},{},[3938],{"type":640,"value":3939},"成本：與 Claude 訂閱費的每月對比、快取命中率 (cache hit rate)",{"type":635,"tag":919,"props":3941,"children":3942},{},[3943],{"type":640,"value":3944},"風險：API 服務穩定性、資料處理地域合規（中國境內伺服器）",{"type":635,"tag":3749,"props":3946,"children":3947},{},[3948],{"type":640,"value":3753},{"title":399,"searchDepth":642,"depth":642,"links":3950},[]]