Claims Browser

GLM-5.3-Flash may be the best intelligence-per-dollar option according to community response

"more substantive claims that the model may now be the best intelligence-per-dollar option"

Open Chinese labs are converging on similar architecture choices around linear attention, sparse attention, residual path design, and Muon

"posts arguing that open Chinese labs are converging on similar architecture choices around linear attention, sparse attention, residual path design, and Muon"

GLM-5.3-Flash is stronger on practical code/agentic workflows than on broad real-world factual knowledge

"GLM-5.3-Flash may be much stronger on practical code/agentic workflows than on broad real-world factual knowledge"

GLM-5.3-Flash achieves 28% accuracy and 28% hallucination rate on knowledge/factual benchmarks

"AA-Omniscience score: +7Accuracy: 28%Hallucination rate: 28%"

GLM-5.3-Flash is much stronger on practical code/agentic workflows than on broad real-world factual knowledge

"This suggests a recurring theme in reactions: GLM-5.3-Flash may be much stronger on practical code/agentic workflows than on broad real-world factual knowledge."

GLM-5.3-Flash uses a hybrid attention architecture with 34 KDA layers and 11 MLA/DSA layers

"Kimi Linear-style 3:1 hybrid attention34 KDA layers (Kimi Delta Attention)11 MLA/DSA layersMLA = Multi-head Latent AttentionDSA = DeepSeek Sparse Attention"

GLM-5.3-Flash costs approximately 1/10th of GLM-5.2 while reducing active parameters from 32B to 18B

"compared to GLM-5.2:~1/10 the costactive params 32B → 18Blayers 92 → 45"

Nearly all Chinese frontier models now use linear attention and sparse attention/indexer-compression designs

"nearly all Chinese frontier models now use linear attentionnearly all use sparse attention / indexer-compression designs"

GLM-5.3 Flash became the fastest growing model in Cline history, driving 11% of all traffic in less than a week

"Cline said GLM-5.3 Flash was already its fastest growing model in Cline history, driving 11% of all traffic in less than a week"

The GLM-5.3 infrastructure agent co-authored parts of the work by helping with kernels, bottlenecks, and serving stack optimization

"says the GLM-5.3 infrastructure agent co-authored parts of the work by helping with kernels, bottlenecks, and serving stack optimization"

GLM-5.3-Flash was immediately slotted into real inference/developer stacks rather than treated as a curiosity

"This matters because it reinforces that GLM-5.3-Flash was not treated as a curiosity; it was immediately slotted into real inference/developer stacks."

GLM-5.3-Flash achieves an AA Intelligence Index score of 57 at $0.09 cost per task

"Artificial Analysis reports AA Intelligence Index 57 and $0.09 cost/task, plus various benchmark details and pricing."

GLM-5.3-Flash represents evidence of exciting convergence in Chinese frontier open architectures

"eliebakouch framed it as evidence of exciting convergence in Chinese frontier open architectures."

GLM-5.3-Flash is the best intelligence-per-dollar choice available

"zainhas argued it is now the best intelligence-per-dollar choice."

The subsampled randomized Hadamard transform (SRHT) achieves coordinate-wise accuracy guarantees for overconstrained L2 regression with O(ε^-2 d^(1+Θ(√(log log n/log d)))) rows

"Price, Song and Woodruff initiated the study of this problem and showed that the subsampled randomized Hadamard transform (SRHT) with $O(ε^{-2} d^{1+Θ(\sqrt{\log\log n/\log d})})$ rows achieves this guarantee."

A prior work by Song, Ye, Yin and Zhang claiming to improve row count to O(ε^-2 d log^3 n) has a flawed proof that relies on an independence assumption that does not hold in general

"A subsequent work of Song, Ye, Yin and Zhang claimed to improve the row count to $O(ε^{-2}d\log^3 n)$. Unfortunately, their proof relies on an independence assumption that does not hold in general, and we exhibit an explicit instance on which it fails."

A new fast, dense randomized transform combining Hadamard flattening, random permutation, and balanced Gaussian pooling achieves L∞ guarantees with O(ε^-2 d log d) rows

"To achieve a truly nearly-linear-in-$d$ row count, we introduce a new fast, dense randomized transform, which combines a randomized Hadamard flattening, a random permutation, and balanced, disjoint Gaussian pooling. Conditioned on the Hadamard-and-permutation stage, the sketched problem becomes an exact Gaussian regression in which the noise is independent of the entire sketched design; this conditional independence is exactly what the earlier argument was missing. Our sketch yields the $\ell_\infty$ guarantee with $m=O(ε^{-2}d\log d)$ rows"

The new randomized transform can compute the sketched pair (SA, Sb) in O(nd + ε^-2 d^4) time using one Hadamard pass

"uses one Hadamard pass with a padded internal dimension $N=\widetilde{O}(n+ε^{-2}d^3)$, and is efficient to apply: the sketched pair $(SA, Sb)$ can be computed in $O(Nd\log N)=\widetilde{O}(nd+ε^{-2}d^4)$ time."