Why DeepSeek's Liang Wenfeng Rarely Signs Flagship Model Reports, Only Foundational Technique Papers
Lei Feng Net author Gao Yunyi surveyed the 11 papers Liang Wenfeng signed over the past three years, finding he consistently appears on foundational technique papers—MoE routing, attention mechanisms, network topology, inference operators, and sandbox infrastructure—while rarely appearing on flagship model reports that carry over a hundred author names. This signing pattern points to a coherent technical route: attacking cost and efficiency bottlenecks at the architectural substrate, rather than chasing model scale.
ImportanceMaterialEvidenceE3 inspectableWrite-upQuick
Over the past three years, DeepSeek has released multiple flagship models, each technical report carrying over a hundred author names. But look at the author lists and you find an interesting pattern: Liang Wenfeng's name rarely appears on V3.2, V4, or V4.1-Flash reports. Instead, he consistently appears on a different class of papers—MLA attention mechanism, MoE routing strategy, mHC network topology, DSpark inference scheduling, and DSec sandbox infrastructure. These are the atomic technical units that constitute model capability, not the models themselves.
Lei Feng Net author Gao Yunyi compiled this observation into an article, calling it a technical sniping route, and counted the 11 foundational papers Liang Wenfeng signed. The signing pattern itself is verifiable: check the author lists on arXiv. What it reveals is that Liang Wenfeng's personal focus is not training a larger model but finding the deepest bottleneck that makes a model cheaper or stronger.
Take MLA (Multi-head Latent Attention) as an example. When large models process long text, they must cache massive key-value pairs (KV Cache), which directly determines memory usage and speed during inference. MLA's approach is to compress this cache with low-rank vectors, reducing KV Cache volume by approximately 93.3%. This is not optimization at the model level but a redesign of the data structure for one specific component within the attention mechanism. Similarly, MoE routing solves the scheduling problem of which experts each token should invoke; NSA solves the memory-access problem of how to align sparse computation with GPU hardware circuits; mHC solves the topological constraint problem of whether numerical stability will collapse during very deep network training.