<?xml version="1.0" encoding="utf-8"?>
<feed xmlns="http://www.w3.org/2005/Atom">
    <id>https://674019130.github.io/</id>
    <title>苏</title>
    <updated>2026-09-14T12:02:51.510Z</updated>
    <generator>https://github.com/jpmonette/feed</generator>
    <author>
        <name>苏</name>
        <email>i@valaxy.site</email>
        <uri>https://valaxy.site</uri>
    </author>
    <link rel="alternate" href="https://674019130.github.io/"/>
    <link rel="self" href="https://674019130.github.io/atom.xml"/>
    <subtitle>I was 26 years old and didn't know what I could do other than write some simple code.</subtitle>
    <logo>https://gravatar.com/avatar/2914ec1292f53a19b51340bda091c50faaeef0fd3a5d35c1c525ad27693bb6eb?v=1775685650000&amp;size=256&amp;d=initials</logo>
    <icon>https://674019130.github.io/favicon.svg</icon>
    <rights>CC BY-NC-SA 4.0 2026 © 苏</rights>
    <entry>
        <title type="html"><![CDATA[关于代码规范的一些粗浅想法]]></title>
        <id>https://674019130.github.io/posts/关于代码规范的一些粗浅想法</id>
        <link href="https://674019130.github.io/posts/关于代码规范的一些粗浅想法"/>
        <updated>2026-09-14T12:02:08.166Z</updated>
        <content type="html"><![CDATA[<h1>什么是代码规范？</h1>
<blockquote>
<p>“衡量代码质量的唯一标准是阅读该代码时说脏话的次数”。</p>
<p>——Robert C. Martin</p>
<p>&lt;img src=&quot;<a href="https://pica.zhim">https://pica.zhim</a></p>
</blockquote>
<br/><p>访问 <a href="https://674019130.github.io/posts/关于代码规范的一些粗浅想法" target="_blank">https://674019130.github.io/posts/关于代码规范的一些粗浅想法</a> 阅读全文。</p>]]></content>
        <author>
            <name>苏</name>
            <email>i@valaxy.site</email>
            <uri>https://valaxy.site</uri>
        </author>
        <published>2026-09-14T12:02:08.166Z</published>
    </entry>
    <entry>
        <title type="html"><![CDATA[常用算法代码片段]]></title>
        <id>https://674019130.github.io/posts/常用算法代码片段</id>
        <link href="https://674019130.github.io/posts/常用算法代码片段"/>
        <updated>2026-09-14T12:02:08.166Z</updated>
        <content type="html"><![CDATA[<h1>快速排序（递归版）</h1>
<pre><code class="language-java">import java.util.Arrays;

public class QuickSort {

  public static void sort(</code></pre>
<br/><p>访问 <a href="https://674019130.github.io/posts/常用算法代码片段" target="_blank">https://674019130.github.io/posts/常用算法代码片段</a> 阅读全文。</p>]]></content>
        <author>
            <name>苏</name>
            <email>i@valaxy.site</email>
            <uri>https://valaxy.site</uri>
        </author>
        <published>2026-09-14T12:02:08.166Z</published>
    </entry>
    <entry>
        <title type="html"><![CDATA[Oracle-Mybatis-批量更新返回值问题]]></title>
        <id>https://674019130.github.io/posts/Oracle-Mybatis-批量更新返回值问题</id>
        <link href="https://674019130.github.io/posts/Oracle-Mybatis-批量更新返回值问题"/>
        <updated>2026-09-14T12:02:08.165Z</updated>
        <content type="html"><![CDATA[<h1>场景</h1>
<p>ORM：Mybatis</p>
<p>数据库：Oracle</p>
<p>组里新人写的一个接口。</p>
<p>传给 Mapper 层的是两个元素数量相等的 List，根据某两个字段是否与 List 中的元素匹配，对 st</p>
<br/><p>访问 <a href="https://674019130.github.io/posts/Oracle-Mybatis-批量更新返回值问题" target="_blank">https://674019130.github.io/posts/Oracle-Mybatis-批量更新返回值问题</a> 阅读全文。</p>]]></content>
        <author>
            <name>苏</name>
            <email>i@valaxy.site</email>
            <uri>https://valaxy.site</uri>
        </author>
        <published>2026-09-14T12:02:08.165Z</published>
    </entry>
    <entry>
        <title type="html"><![CDATA[Windows 下 docker 使用笔记]]></title>
        <id>https://674019130.github.io/posts/Windows 下 docker 使用笔记</id>
        <link href="https://674019130.github.io/posts/Windows 下 docker 使用笔记"/>
        <updated>2026-09-14T12:02:08.165Z</updated>
        <content type="html"><![CDATA[<p><strong>Docker 伟大，无需多言！</strong></p>
<blockquote>
<p>但是 Windows 下的 Docker 使用体验像吃了那个。</p>
</blockquote>
<blockquote>
<p>换了 MacBook 之后终于丝滑体验了！</p>
</blockquote>
<!-- ![image.png](https://s2.loli.net/2024/05/28/17kjdQVX35ieZvb.png) -->
<br/><p>访问 <a href="https://674019130.github.io/posts/Windows 下 docker 使用笔记" target="_blank">https://674019130.github.io/posts/Windows 下 docker 使用笔记</a> 阅读全文。</p>]]></content>
        <author>
            <name>苏</name>
            <email>i@valaxy.site</email>
            <uri>https://valaxy.site</uri>
        </author>
        <published>2026-09-14T12:02:08.165Z</published>
    </entry>
    <entry>
        <title type="html"><![CDATA[Hello, Valaxy!]]></title>
        <id>https://674019130.github.io/posts/hello-valaxy</id>
        <link href="https://674019130.github.io/posts/hello-valaxy"/>
        <updated>2026-09-14T12:02:08.165Z</updated>
        <content type="html"><![CDATA[<h2>Valaxy</h2>
<p>Next Generation Static Blog Framework.</p>
<p>Write your first post!<br>
$$ test a_2$$</p>
<h2>Usage</h2>
<br/><p>访问 <a href="https://674019130.github.io/posts/hello-valaxy" target="_blank">https://674019130.github.io/posts/hello-valaxy</a> 阅读全文。</p>]]></content>
        <author>
            <name>苏</name>
            <email>i@valaxy.site</email>
            <uri>https://valaxy.site</uri>
        </author>
        <published>2026-09-14T12:02:08.165Z</published>
    </entry>
    <entry>
        <title type="html"><![CDATA[Hello, World!]]></title>
        <id>https://674019130.github.io/posts/hello-world</id>
        <link href="https://674019130.github.io/posts/hello-world"/>
        <updated>2026-09-14T12:02:08.165Z</updated>
        <content type="html"><![CDATA[<p>Welcome to <a href="https://hexo.io/">Hexo</a>! This is your very first post. Check [documentation](<a href="https://hex">https://hex</a></p>
<br/><p>访问 <a href="https://674019130.github.io/posts/hello-world" target="_blank">https://674019130.github.io/posts/hello-world</a> 阅读全文。</p>]]></content>
        <author>
            <name>苏</name>
            <email>i@valaxy.site</email>
            <uri>https://valaxy.site</uri>
        </author>
        <published>2026-09-14T12:02:08.165Z</published>
    </entry>
    <entry>
        <title type="html"><![CDATA[记一次从 Hexo 到 Valaxy 的迁移，GitHub Actions 部署 GitHub Pages]]></title>
        <id>https://674019130.github.io/posts/hexo-to-valaxy-migration</id>
        <link href="https://674019130.github.io/posts/hexo-to-valaxy-migration"/>
        <updated>2026-09-14T12:02:08.165Z</updated>
        <content type="html"><![CDATA[<p><em>仿佛只有有一个自己的博客，才像个理想中的程序员。</em></p>
<p><em>从买一台云主机，部署 WordPress，到 Hexo，再到前几天被 <a href="https://github.com/YunYouJun">云游君</a> 安利的（也就是现在在使用的）Valaxy，也经历了蛮久。</em></p>
<p><em>但是记录和折腾这么久，自己又真正学到了什么东西呢？</em></p>
<br/><p>访问 <a href="https://674019130.github.io/posts/hexo-to-valaxy-migration" target="_blank">https://674019130.github.io/posts/hexo-to-valaxy-migration</a> 阅读全文。</p>]]></content>
        <author>
            <name>苏</name>
            <email>i@valaxy.site</email>
            <uri>https://valaxy.site</uri>
        </author>
        <published>2026-09-14T12:02:08.165Z</published>
    </entry>
    <entry>
        <title type="html"><![CDATA[Vibe Coding 个人实践总结]]></title>
        <id>https://674019130.github.io/posts/Cursor 实践总结</id>
        <link href="https://674019130.github.io/posts/Cursor 实践总结"/>
        <updated>2026-09-14T12:02:08.164Z</updated>
        <content type="html"><![CDATA[<blockquote>
<p>在使用新工具的路上四处张望，捡起了一些未知价值的石子。</p>
</blockquote>
<blockquote>
<p>一定不要忘了原来的工具怎么用，AI 辅助编程越强大，理解代码的能力和架构设计的能力就越重要。<br>
代码越多，包袱越重，有一个宏观的视角会让我们举重若轻；微观上理解每一个细节，可以让我们精简代码，以及确保走在正确的道路上。</p>
</blockquote>
<br/><p>访问 <a href="https://674019130.github.io/posts/Cursor 实践总结" target="_blank">https://674019130.github.io/posts/Cursor 实践总结</a> 阅读全文。</p>]]></content>
        <author>
            <name>苏</name>
            <email>i@valaxy.site</email>
            <uri>https://valaxy.site</uri>
        </author>
        <published>2026-09-14T12:02:08.164Z</published>
    </entry>
    <entry>
        <title type="html"><![CDATA[DSPy 0x01]]></title>
        <id>https://674019130.github.io/posts/DSPy 0x01</id>
        <link href="https://674019130.github.io/posts/DSPy 0x01"/>
        <updated>2026-09-14T12:02:08.164Z</updated>
        <content type="html"><![CDATA[<hr>
<p>新框架层出不穷，或许你也想通过机器学习训练得到最佳 prompt？</p>
<p><img src="https://dspy.ai/static/img/dspy_logo.png" alt="dspylogo"></p>
<br/><p>访问 <a href="https://674019130.github.io/posts/DSPy 0x01" target="_blank">https://674019130.github.io/posts/DSPy 0x01</a> 阅读全文。</p>]]></content>
        <author>
            <name>苏</name>
            <email>i@valaxy.site</email>
            <uri>https://valaxy.site</uri>
        </author>
        <published>2026-09-14T12:02:08.164Z</published>
    </entry>
    <entry>
        <title type="html"><![CDATA[《Designing Data-Intensive Applications》 读书笔记 | 0x00]]></title>
        <id>https://674019130.github.io/posts/Designing Data-Intensive Applications 读书笔记 0x00</id>
        <link href="https://674019130.github.io/posts/Designing Data-Intensive Applications 读书笔记 0x00"/>
        <updated>2026-09-14T12:02:08.164Z</updated>
        <content type="html"><![CDATA[<h1>第一章：可靠性、可伸缩性和可维护性</h1>
<!-- > ![图 1-3 用于分发推特至关注者的数据流水线，2012 年 11 月的负载参数【16】](https://1126993343-files.<br/><p>访问 <a href="https://674019130.github.io/posts/Designing Data-Intensive Applications 读书笔记 0x00" target="_blank">https://674019130.github.io/posts/Designing Data-Intensive Applications 读书笔记 0x00</a> 阅读全文。</p>]]></content>
        <author>
            <name>苏</name>
            <email>i@valaxy.site</email>
            <uri>https://valaxy.site</uri>
        </author>
        <published>2026-09-14T12:02:08.164Z</published>
    </entry>
    <entry>
        <title type="html"><![CDATA[《Designing Data-Intensive Applications》 读书笔记 | 0x01]]></title>
        <id>https://674019130.github.io/posts/Designing Data-Intensive Applications 读书笔记 0x01</id>
        <link href="https://674019130.github.io/posts/Designing Data-Intensive Applications 读书笔记 0x01"/>
        <updated>2026-09-14T12:02:08.164Z</updated>
        <content type="html"><![CDATA[<h1>第二章：数据模型与查询语言</h1>
<blockquote>
<p>多数应用使用层层叠加的数据模型构建。对于每层数据模型的关键问题是：它是如何用低一层数据模型来 <strong>表示</strong> 的？例如：</p>
<ol>
<li>作为一名应用开发人员，你观</li>
</ol>
</blockquote>
<br/><p>访问 <a href="https://674019130.github.io/posts/Designing Data-Intensive Applications 读书笔记 0x01" target="_blank">https://674019130.github.io/posts/Designing Data-Intensive Applications 读书笔记 0x01</a> 阅读全文。</p>]]></content>
        <author>
            <name>苏</name>
            <email>i@valaxy.site</email>
            <uri>https://valaxy.site</uri>
        </author>
        <published>2026-09-14T12:02:08.164Z</published>
    </entry>
    <entry>
        <title type="html"><![CDATA[《Designing Data-Intensive Applications》 读书笔记 | 0x02]]></title>
        <id>https://674019130.github.io/posts/Designing Data-Intensive Applications 读书笔记 0x02</id>
        <link href="https://674019130.github.io/posts/Designing Data-Intensive Applications 读书笔记 0x02"/>
        <updated>2026-09-14T12:02:08.164Z</updated>
        <content type="html"><![CDATA[<h1>第三章：存储与检索</h1>
<blockquote>
<p>为了高效查找数据库中特定键的值，我们需要一个数据结构：<strong>索引（index）</strong>。本章将介绍一系列的索引结构，并在它们之间进行比较。索引背后的大致思想是通过保存一些额外</p>
</blockquote>
<br/><p>访问 <a href="https://674019130.github.io/posts/Designing Data-Intensive Applications 读书笔记 0x02" target="_blank">https://674019130.github.io/posts/Designing Data-Intensive Applications 读书笔记 0x02</a> 阅读全文。</p>]]></content>
        <author>
            <name>苏</name>
            <email>i@valaxy.site</email>
            <uri>https://valaxy.site</uri>
        </author>
        <published>2026-09-14T12:02:08.164Z</published>
    </entry>
    <entry>
        <title type="html"><![CDATA[《Designing Data-Intensive Applications》 读书笔记 | 0x03]]></title>
        <id>https://674019130.github.io/posts/Designing Data-Intensive Applications 读书笔记 0x03</id>
        <link href="https://674019130.github.io/posts/Designing Data-Intensive Applications 读书笔记 0x03"/>
        <updated>2026-09-14T12:02:08.164Z</updated>
        <content type="html"><![CDATA[<blockquote>
<p>唯变所适</p>
<p>—— 以弗所的赫拉克利特，为柏拉图所引（公元前 360 年）</p>
</blockquote>
<hr>
<blockquote>
<h4>远程过程调用（RPC）的问题</h4>
<p>Web 服务仅仅是通过网络进行 API 请求的一系</p>
</blockquote>
<br/><p>访问 <a href="https://674019130.github.io/posts/Designing Data-Intensive Applications 读书笔记 0x03" target="_blank">https://674019130.github.io/posts/Designing Data-Intensive Applications 读书笔记 0x03</a> 阅读全文。</p>]]></content>
        <author>
            <name>苏</name>
            <email>i@valaxy.site</email>
            <uri>https://valaxy.site</uri>
        </author>
        <published>2026-09-14T12:02:08.164Z</published>
    </entry>
    <entry>
        <title type="html"><![CDATA[《Designing Data-Intensive Applications》 读书笔记 | 0x04]]></title>
        <id>https://674019130.github.io/posts/Designing Data-Intensive Applications 读书笔记 0x04</id>
        <link href="https://674019130.github.io/posts/Designing Data-Intensive Applications 读书笔记 0x04"/>
        <updated>2026-09-14T12:02:08.164Z</updated>
        <content type="html"><![CDATA[<blockquote>
<p>与可能出错的东西比，&quot;不可能&quot;出错的东西最显著的特点就是：一旦真的出错，通常就彻底玩完了。</p>
<p>—— 道格拉斯・亚当斯（1992）</p>
</blockquote>
<hr>
<blockquote>
<p>复制意味着在通过网络连接的多台机器上保留相</p>
</blockquote>
<br/><p>访问 <a href="https://674019130.github.io/posts/Designing Data-Intensive Applications 读书笔记 0x04" target="_blank">https://674019130.github.io/posts/Designing Data-Intensive Applications 读书笔记 0x04</a> 阅读全文。</p>]]></content>
        <author>
            <name>苏</name>
            <email>i@valaxy.site</email>
            <uri>https://valaxy.site</uri>
        </author>
        <published>2026-09-14T12:02:08.164Z</published>
    </entry>
    <entry>
        <title type="html"><![CDATA[《Designing Data-Intensive Applications》 读书笔记 | 0x05]]></title>
        <id>https://674019130.github.io/posts/Designing Data-Intensive Applications 读书笔记 0x05</id>
        <link href="https://674019130.github.io/posts/Designing Data-Intensive Applications 读书笔记 0x05"/>
        <updated>2026-09-14T12:02:08.164Z</updated>
        <content type="html"><![CDATA[<blockquote>
<p>我们必须跳出电脑指令序列的窠臼。叙述定义、描述元数据、梳理关系，<strong>而不是编写过程</strong>。</p>
<p>—— Grace Murray Hopper，未来的计算机及其管理（1962）</p>
</blockquote>
<br/><p>访问 <a href="https://674019130.github.io/posts/Designing Data-Intensive Applications 读书笔记 0x05" target="_blank">https://674019130.github.io/posts/Designing Data-Intensive Applications 读书笔记 0x05</a> 阅读全文。</p>]]></content>
        <author>
            <name>苏</name>
            <email>i@valaxy.site</email>
            <uri>https://valaxy.site</uri>
        </author>
        <published>2026-09-14T12:02:08.164Z</published>
    </entry>
    <entry>
        <title type="html"><![CDATA[Google Prompt Engineering 白皮书阅读笔记]]></title>
        <id>https://674019130.github.io/posts/Google Prompt Engineering 白皮书阅读笔记</id>
        <link href="https://674019130.github.io/posts/Google Prompt Engineering 白皮书阅读笔记"/>
        <updated>2026-09-14T12:02:08.164Z</updated>
        <content type="html"><![CDATA[<blockquote>
<p>You don't need to be a data scientist or a machine learning engineer – everyone can write a prompt.</p>
</blockquote>
<p><img src="https://s2.loli.net/2025/04/16/zEiAw6lyxd3DpRK.png" alt="CleanShot 2025-04-16 at 12.47.13@2x.png"></p>
<br/><p>访问 <a href="https://674019130.github.io/posts/Google Prompt Engineering 白皮书阅读笔记" target="_blank">https://674019130.github.io/posts/Google Prompt Engineering 白皮书阅读笔记</a> 阅读全文。</p>]]></content>
        <author>
            <name>苏</name>
            <email>i@valaxy.site</email>
            <uri>https://valaxy.site</uri>
        </author>
        <published>2026-09-14T12:02:08.164Z</published>
    </entry>
    <entry>
        <title type="html"><![CDATA[Java Lock Notes]]></title>
        <id>https://674019130.github.io/posts/Java Lock Notes</id>
        <link href="https://674019130.github.io/posts/Java Lock Notes"/>
        <updated>2026-09-14T12:02:08.164Z</updated>
        <content type="html"><![CDATA[<blockquote>
<p><a href="https://tech.meituan.com/2018/11/15/java-lock.html">https://tech.meituan.com/2018/11/15/java-lock.html</a></p>
</blockquote>
<p>美团这篇写的很好，非常适合拿来复习。</p>
<hr>
<p>![img](https://awps-</p>
<br/><p>访问 <a href="https://674019130.github.io/posts/Java Lock Notes" target="_blank">https://674019130.github.io/posts/Java Lock Notes</a> 阅读全文。</p>]]></content>
        <author>
            <name>苏</name>
            <email>i@valaxy.site</email>
            <uri>https://valaxy.site</uri>
        </author>
        <published>2026-09-14T12:02:08.164Z</published>
    </entry>
    <entry>
        <title type="html"><![CDATA[Java 面试优质题目笔记]]></title>
        <id>https://674019130.github.io/posts/Java 面试优质题目笔记</id>
        <link href="https://674019130.github.io/posts/Java 面试优质题目笔记"/>
        <updated>2026-09-14T12:02:08.164Z</updated>
        <content type="html"><![CDATA[<blockquote>
<p>Talk is cheap, show me the code.</p>
</blockquote>
<br/><p>访问 <a href="https://674019130.github.io/posts/Java 面试优质题目笔记" target="_blank">https://674019130.github.io/posts/Java 面试优质题目笔记</a> 阅读全文。</p>]]></content>
        <author>
            <name>苏</name>
            <email>i@valaxy.site</email>
            <uri>https://valaxy.site</uri>
        </author>
        <published>2026-09-14T12:02:08.164Z</published>
    </entry>
    <entry>
        <title type="html"><![CDATA[When Relevance Meets Recency: Engineering a Multi-Stage Search Ranking System]]></title>
        <id>https://674019130.github.io/posts/multi-stage-search-ranking-en</id>
        <link href="https://674019130.github.io/posts/multi-stage-search-ranking-en"/>
        <updated>2026-07-29T12:05:00.000Z</updated>
        <content type="html"><![CDATA[<p>A production search engine is not a scoring formula with an API around it. It is a sequence of decisions: what the user is optimizing for, which documents are allowed to compete, where freshness belongs, when an expensive model is justified, and how page two can continue after page one has been rearranged.</p>
<p>This article presents a reusable model for that sequence. It deliberately stays above any one implementation: the interesting engineering ideas are the boundaries between stages, not a particular threshold, dictionary, or weight.</p>
<br/><p>访问 <a href="https://674019130.github.io/posts/multi-stage-search-ranking-en" target="_blank">https://674019130.github.io/posts/multi-stage-search-ranking-en</a> 阅读全文。</p>]]></content>
        <author>
            <name>苏</name>
            <email>i@valaxy.site</email>
            <uri>https://valaxy.site</uri>
        </author>
        <published>2026-07-29T12:05:00.000Z</published>
    </entry>
    <entry>
        <title type="html"><![CDATA[当相关性遇见时效性：多阶段搜索排序的工程设计]]></title>
        <id>https://674019130.github.io/posts/multi-stage-search-ranking-zh</id>
        <link href="https://674019130.github.io/posts/multi-stage-search-ranking-zh"/>
        <updated>2026-07-29T12:00:00.000Z</updated>
        <content type="html"><![CDATA[<p>生产搜索不是“找一个更好的公式”，而是在目标、候选集合、时效性先验和昂贵模型之间连续做决定。真正困难的部分，往往不是某一步算得准不准，而是每一步应该看见哪些候选、改变什么，以及怎样让下一页仍然接得上。</p>
<p>本文不讨论某个具体系统的参数，而是整理一套可以迁移的多阶段搜索设计：相关性排序与时间排序为什么应该分流，复杂 Query 为什么是一种策略信号，为什么完整智能排序通常集中在第一页，以及时效性为什么需要在融合前后各出现一次。</p>
<br/><p>访问 <a href="https://674019130.github.io/posts/multi-stage-search-ranking-zh" target="_blank">https://674019130.github.io/posts/multi-stage-search-ranking-zh</a> 阅读全文。</p>]]></content>
        <author>
            <name>苏</name>
            <email>i@valaxy.site</email>
            <uri>https://valaxy.site</uri>
        </author>
        <published>2026-07-29T12:00:00.000Z</published>
    </entry>
    <entry>
        <title type="html"><![CDATA[04-27 评测迭代]]></title>
        <id>https://674019130.github.io/posts/评测迭代 0x01</id>
        <link href="https://674019130.github.io/posts/评测迭代 0x01"/>
        <updated>2026-04-27T00:00:00.000Z</updated>
        <content type="html"><![CDATA[<p>学习「评测迭代」的笔记。整体路径是：从生产 trace 出发，经粗筛 + 精筛两层过滤，再到 prompt / 模型两条优化路线的闭环。</p>
<pre><code class="language-text">生产 trace
    │
    ├── 粗筛层（便宜、自动、覆盖广）
    │     ├─ LLM-as-Judge 抽样打分    ← 主观质量
    │     ├─ 用户点踩                  ← 显式负反馈
    │     └─ 停留时长 / 复制率 / 重问率 ← 隐式行为信号
    │
    ├── 精筛层（贵、人工、高质量）
    │     └─ 标注师挑 hard case → 评测集 + 训练集
    │
    └── 优化层（两条路并行）
          ├─ Prompt 层：自进化 + 蒙特卡洛搜 fewshot
          └─ 模型层：SFT（学会做对） / DPO（学会偏好）
</code></pre>
<p>主要学习内容：</p>
<ul>
<li>抽样 Trace</li>
<li>LLM as a Judge</li>
<li>蒙特卡洛优化 / 蒙特卡洛搜索树</li>
<li>SFT 和 DPO 的区别</li>
</ul>
<br/><p>访问 <a href="https://674019130.github.io/posts/评测迭代 0x01" target="_blank">https://674019130.github.io/posts/评测迭代 0x01</a> 阅读全文。</p>]]></content>
        <author>
            <name>苏</name>
            <email>i@valaxy.site</email>
            <uri>https://valaxy.site</uri>
        </author>
        <published>2026-04-27T00:00:00.000Z</published>
    </entry>
    <entry>
        <title type="html"><![CDATA[从 Chatbot 到 Multi-Agent：一部架构演进史 (v2)]]></title>
        <id>https://674019130.github.io/posts/从Chatbot到Multi-Agent-架构演进-v2</id>
        <link href="https://674019130.github.io/posts/从Chatbot到Multi-Agent-架构演进-v2"/>
        <updated>2026-04-13T22:45:00.000Z</updated>
        <content type="html"><![CDATA[<blockquote>
<p>这是口述 + Claude 协作整理的架构长文，v2 版本。v1 在 <a href="/posts/%E4%BB%8EChatbot%E5%88%B0Multi-Agent-%E6%9E%B6%E6%9E%84%E6%BC%94%E8%BF%9B-v1/">从 Chatbot 到 Multi-Agent (v1)</a> ，v2 诞生过程中的&quot;中肯 review&quot;在 <a href="/posts/%E4%BB%8EChatbot%E5%88%B0Multi-Agent-v1%E6%89%B9%E8%AF%84%E4%B8%8E%E6%94%B9%E8%BF%9B%E7%82%B9/">十个盲点</a> 。</p>
</blockquote>
<p>v2 相对于 v1 的主要变化：在开头补上了&quot;为什么要 Agent&quot;这个一直被架构文章忽略的哲学问题；把&quot;模型与 harness 共进化&quot;作为一条贯穿全文的暗线；在 B 阶段显著加厚 eval 的讨论；在 B+ 新增了&quot;失败模式目录&quot;&quot;成本经济学&quot;&quot;Prompt Injection 防御&quot;三块；在 B++ 新增了&quot;Human-in-the-loop 作为设计轴&quot;和&quot;现场保存与还原&quot;；在 C 阶段补充了 Gemini function calling 的差异和 Computer Use 作为另一种范式。</p>
<p>这不是一份对 v1 的打补丁，而是一次重写——主干保留，但加入了 v1 缺失的三条主线：<strong>为什么要做、会怎么失败、怎么被经济性反噬</strong>。</p>
<br/><p>访问 <a href="https://674019130.github.io/posts/从Chatbot到Multi-Agent-架构演进-v2" target="_blank">https://674019130.github.io/posts/从Chatbot到Multi-Agent-架构演进-v2</a> 阅读全文。</p>]]></content>
        <author>
            <name>苏</name>
            <email>i@valaxy.site</email>
            <uri>https://valaxy.site</uri>
        </author>
        <published>2026-04-13T22:45:00.000Z</published>
    </entry>
    <entry>
        <title type="html"><![CDATA[对自己写的东西做一次中肯 Review：Agent 架构文的十个盲点]]></title>
        <id>https://674019130.github.io/posts/从Chatbot到Multi-Agent-v1批评与改进点</id>
        <link href="https://674019130.github.io/posts/从Chatbot到Multi-Agent-v1批评与改进点"/>
        <updated>2026-04-13T22:25:00.000Z</updated>
        <content type="html"><![CDATA[<blockquote>
<p>我把 v1 的 Agent 架构长文交给 Claude 做了一次&quot;中肯评价&quot;，让它 think harder，告诉我哪里写错了、哪里视野不够、哪里是我看不到的盲点。结果是一份比我想象中更狠的 review。这篇文章就是这份 review 本身——作为一份&quot;对自己写的东西做系统 review&quot;的模板，同时也是 <a href="/posts/%E4%BB%8EChatbot%E5%88%B0Multi-Agent-%E6%9E%B6%E6%9E%84%E6%BC%94%E8%BF%9B-v2/">v2</a> 改写的起点。</p>
<p>v1 见 <a href="/posts/%E4%BB%8EChatbot%E5%88%B0Multi-Agent-%E6%9E%B6%E6%9E%84%E6%BC%94%E8%BF%9B-v1/">这里</a> 。</p>
</blockquote>
<br/><p>访问 <a href="https://674019130.github.io/posts/从Chatbot到Multi-Agent-v1批评与改进点" target="_blank">https://674019130.github.io/posts/从Chatbot到Multi-Agent-v1批评与改进点</a> 阅读全文。</p>]]></content>
        <author>
            <name>苏</name>
            <email>i@valaxy.site</email>
            <uri>https://valaxy.site</uri>
        </author>
        <published>2026-04-13T22:25:00.000Z</published>
    </entry>
    <entry>
        <title type="html"><![CDATA[从 Chatbot 到 Multi-Agent：一部架构演进史 (v1)]]></title>
        <id>https://674019130.github.io/posts/从Chatbot到Multi-Agent-架构演进-v1</id>
        <link href="https://674019130.github.io/posts/从Chatbot到Multi-Agent-架构演进-v1"/>
        <updated>2026-04-13T22:10:00.000Z</updated>
        <content type="html"><![CDATA[<blockquote>
<p>这是 DDIA 风格的长文第一版，基于我的口述由 Claude 协作整理。这一版后来被我在 <a href="/posts/%E4%BB%8EChatbot%E5%88%B0Multi-Agent-v1%E6%89%B9%E8%AF%84%E4%B8%8E%E6%94%B9%E8%BF%9B%E7%82%B9/">v1 批评与改进点</a> 中系统 review，并在 <a href="/posts/%E4%BB%8EChatbot%E5%88%B0Multi-Agent-%E6%9E%B6%E6%9E%84%E6%BC%94%E8%BF%9B-v2/">v2</a> 里重写。v1 保留不动作为对照。</p>
<p>本文试图用《Designing Data-Intensive Applications》那种&quot;一边讲原理，一边讲权衡&quot;的笔触，把&quot;大模型应用&quot;从最朴素的聊天机器人一路推演到今天最前沿的 Multi-Agent 团队。我们会把每一个阶段命名为一个架构代号 (A、A+、B、B+、B++、C、D)，并在每次跃迁时明确指出：<strong>哪些东西变了，哪些东西没变，又带来了哪些新问题</strong>。</p>
</blockquote>
<p>读者可以把本文当作一份演进路线图——每一个代号都是一次&quot;补丁叠加&quot;，最终的 D 并不是对 A 的推翻，而是在 A 的骨架上逐层长出的血肉。</p>
<br/><p>访问 <a href="https://674019130.github.io/posts/从Chatbot到Multi-Agent-架构演进-v1" target="_blank">https://674019130.github.io/posts/从Chatbot到Multi-Agent-架构演进-v1</a> 阅读全文。</p>]]></content>
        <author>
            <name>苏</name>
            <email>i@valaxy.site</email>
            <uri>https://valaxy.site</uri>
        </author>
        <published>2026-04-13T22:10:00.000Z</published>
    </entry>
    <entry>
        <title type="html"><![CDATA[Designing Data-Intensive Applications (2nd Edition) 读书笔记 0x00]]></title>
        <id>https://674019130.github.io/posts/ddia2-ch1</id>
        <link href="https://674019130.github.io/posts/ddia2-ch1"/>
        <updated>2026-03-02T00:00:00.000Z</updated>
        <content type="html"><![CDATA[<p>DDIA 第二版，第一章：可靠性、可扩展性和可维护性。</p>
<br/><p>访问 <a href="https://674019130.github.io/posts/ddia2-ch1" target="_blank">https://674019130.github.io/posts/ddia2-ch1</a> 阅读全文。</p>]]></content>
        <author>
            <name>苏</name>
            <email>i@valaxy.site</email>
            <uri>https://valaxy.site</uri>
        </author>
        <published>2026-03-02T00:00:00.000Z</published>
    </entry>
    <entry>
        <title type="html"><![CDATA[北京、海、雨]]></title>
        <id>https://674019130.github.io/posts/北京、海、雨</id>
        <link href="https://674019130.github.io/posts/北京、海、雨"/>
        <updated>2025-08-16T18:40:23.000Z</updated>
        <content type="html"><![CDATA[<blockquote>
<p>北京，六月底便已经非常闷热。步入七月后，更觉再无穿外套的必要，就连傍晚的风也变得粘稠。</p>
</blockquote>
<br/><p>访问 <a href="https://674019130.github.io/posts/北京、海、雨" target="_blank">https://674019130.github.io/posts/北京、海、雨</a> 阅读全文。</p>]]></content>
        <author>
            <name>苏</name>
            <email>i@valaxy.site</email>
            <uri>https://valaxy.site</uri>
        </author>
        <published>2025-08-16T18:40:23.000Z</published>
    </entry>
    <entry>
        <title type="html"><![CDATA[AI Horseless Carriages 读书笔记]]></title>
        <id>https://674019130.github.io/posts/AI Horseless Carriages</id>
        <link href="https://674019130.github.io/posts/AI Horseless Carriages"/>
        <updated>2025-04-27T14:17:00.000Z</updated>
        <content type="html"><![CDATA[<blockquote>
<p>I suspect that in the future we'll look back and laugh at the idea that a &quot;prompt injection&quot; (like &quot;Ignore previous instructions...&quot;) was something to be concerned about.</p>
</blockquote>
<blockquote>
<p>未来我们可能会对&quot;提示注入&quot;这种担忧感到好笑。<br>
<img src="https://koomen.dev/images/steam-carriage.png" alt="蒸汽机车"></p>
</blockquote>
<br/><p>访问 <a href="https://674019130.github.io/posts/AI Horseless Carriages" target="_blank">https://674019130.github.io/posts/AI Horseless Carriages</a> 阅读全文。</p>]]></content>
        <author>
            <name>苏</name>
            <email>i@valaxy.site</email>
            <uri>https://valaxy.site</uri>
        </author>
        <published>2025-04-27T14:17:00.000Z</published>
    </entry>
    <entry>
        <title type="html"><![CDATA[Sharing Valuable Articles on AI Usage]]></title>
        <id>https://674019130.github.io/posts/Sharing Valuable Articles on AI Usage</id>
        <link href="https://674019130.github.io/posts/Sharing Valuable Articles on AI Usage"/>
        <updated>2024-08-11T14:02:12.000Z</updated>
        <content type="html"><![CDATA[<blockquote>
<p>在 AI 出现后，信息量再次爆炸，我筛选出一些值得分享和阅读的内容，提高信息获取的效率。</p>
</blockquote>
<br/><p>访问 <a href="https://674019130.github.io/posts/Sharing Valuable Articles on AI Usage" target="_blank">https://674019130.github.io/posts/Sharing Valuable Articles on AI Usage</a> 阅读全文。</p>]]></content>
        <author>
            <name>苏</name>
            <email>i@valaxy.site</email>
            <uri>https://valaxy.site</uri>
        </author>
        <published>2024-08-11T14:02:12.000Z</published>
    </entry>
    <entry>
        <title type="html"><![CDATA[分布式事务解决方案 Seata 学习笔记]]></title>
        <id>https://674019130.github.io/posts/分布式事务 Seata 学习笔记</id>
        <link href="https://674019130.github.io/posts/分布式事务 Seata 学习笔记"/>
        <updated>2024-06-28T00:24:45.000Z</updated>
        <content type="html"><![CDATA[<p><strong>截至 2025-04-15，依然没能在项目中用上 T_T，是确实还没场景</strong></p>
<br/><p>访问 <a href="https://674019130.github.io/posts/分布式事务 Seata 学习笔记" target="_blank">https://674019130.github.io/posts/分布式事务 Seata 学习笔记</a> 阅读全文。</p>]]></content>
        <author>
            <name>苏</name>
            <email>i@valaxy.site</email>
            <uri>https://valaxy.site</uri>
        </author>
        <published>2024-06-28T00:24:45.000Z</published>
    </entry>
    <entry>
        <title type="html"><![CDATA[LeetCode record 2024-05]]></title>
        <id>https://674019130.github.io/posts/LeetCode record 2024-05</id>
        <link href="https://674019130.github.io/posts/LeetCode record 2024-05"/>
        <updated>2024-05-27T00:00:00.000Z</updated>
        <content type="html"><![CDATA[<p><strong>如果有一天没有打卡，会不会辜负踌躇满志的那个自己。</strong></p>
<br/><p>访问 <a href="https://674019130.github.io/posts/LeetCode record 2024-05" target="_blank">https://674019130.github.io/posts/LeetCode record 2024-05</a> 阅读全文。</p>]]></content>
        <author>
            <name>苏</name>
            <email>i@valaxy.site</email>
            <uri>https://valaxy.site</uri>
        </author>
        <published>2024-05-27T00:00:00.000Z</published>
    </entry>
    <entry>
        <title type="html"><![CDATA[LeetCode SQL 练习笔记]]></title>
        <id>https://674019130.github.io/posts/LeetCode-SQL-notes</id>
        <link href="https://674019130.github.io/posts/LeetCode-SQL-notes"/>
        <updated>2024-05-02T02:28:12.000Z</updated>
        <content type="html"><![CDATA[<h1>LeetCode 数据库刷题笔记</h1>
<blockquote>
<p>只做重点的记录。</p>
</blockquote>
<h2>[550. 游戏玩法分析 IV](<a href="https://leetcode.cn/problems/game-play-analysis-">https://leetcode.cn/problems/game-play-analysis-</a></h2>
<br/><p>访问 <a href="https://674019130.github.io/posts/LeetCode-SQL-notes" target="_blank">https://674019130.github.io/posts/LeetCode-SQL-notes</a> 阅读全文。</p>]]></content>
        <author>
            <name>苏</name>
            <email>i@valaxy.site</email>
            <uri>https://valaxy.site</uri>
        </author>
        <published>2024-05-02T02:28:12.000Z</published>
    </entry>
    <entry>
        <title type="html"><![CDATA[常用业务代码片段]]></title>
        <id>https://674019130.github.io/posts/常用业务代码片段</id>
        <link href="https://674019130.github.io/posts/常用业务代码片段"/>
        <updated>2024-05-02T02:28:12.000Z</updated>
        <content type="html"><![CDATA[<blockquote>
<p>跟 ChatGPT 聊天甚至都觉得有些麻烦了 T_T</p>
</blockquote>
<br/><p>访问 <a href="https://674019130.github.io/posts/常用业务代码片段" target="_blank">https://674019130.github.io/posts/常用业务代码片段</a> 阅读全文。</p>]]></content>
        <author>
            <name>苏</name>
            <email>i@valaxy.site</email>
            <uri>https://valaxy.site</uri>
        </author>
        <published>2024-05-02T02:28:12.000Z</published>
    </entry>
    <entry>
        <title type="html"><![CDATA[LeetCode record 2024-04]]></title>
        <id>https://674019130.github.io/posts/LeetCode record 2024-04</id>
        <link href="https://674019130.github.io/posts/LeetCode record 2024-04"/>
        <updated>2024-04-27T00:00:00.000Z</updated>
        <content type="html"><![CDATA[<h2><a href="https://leetcode.cn/problems/convert-to-base-2/">1017. 负二进制转换</a> 中等</h2>
<p>给你一个整数 <code>n</code> ，以二进制字符串的形式返回该整数的</p>
<br/><p>访问 <a href="https://674019130.github.io/posts/LeetCode record 2024-04" target="_blank">https://674019130.github.io/posts/LeetCode record 2024-04</a> 阅读全文。</p>]]></content>
        <author>
            <name>苏</name>
            <email>i@valaxy.site</email>
            <uri>https://valaxy.site</uri>
        </author>
        <published>2024-04-27T00:00:00.000Z</published>
    </entry>
</feed>