Blog page for introducing cache-oblivious SGEMM implementation step by step.
2025/9/19
更简单的“缓存无关”（cache‐oblivious）的搜索树：不再依赖重量平衡B树，整棵结构可直接放进一个连续数组里（不需要指针），同时保持与以往方案相同的渐近复杂度与更好的空间利用率。A simpler cache-oblivious search tree: no weight-balanced B-trees needed; the whole tree fits in one contiguous, pointer-free array, with the same asymptotic bounds as before and better space use.
2025/9/10
解读Flash Attention历代优化工作A walkthrough of the successive generations of optimizations in Flash Attention
2025/9/3
论文构建一个自下而上的“数量清算”比特币定价框架，预测至2036年比特币市值空间。The paper builds a bottom-up, quantity-clearing Bitcoin pricing framework and projects the potential range of Bitcoin's market cap through 2036.
2025/8/12