Performance in BQN versus C
BQN, despite being interpreted through a C-based system (CBQN), can sometimes outperform hand-written C code due to efficient use of array-oriented programming and optimized primitives. Performance advantages arise particularly in tasks leveraging BQN's built-in operations, such as processing line endings in text files. However, achieving such performance requires programmer expertise and favorable problem structures, and typical BQN programs are unlikely to surpass well-optimized C in general.
- ▪BQN programs can outperform equivalent C programs in specific cases, especially when using built-in primitives like Scan, Transpose, or Sort.
- ▪CBQN leverages low-level optimizations such as SIMD and lookup tables, enabling it to achieve up to 10x speed improvements over basic C implementations.
- ▪In a real-world benchmark replacing CRLF with LF in text, BQN matched C at around 200 bytes and reached over 5x faster performance on larger inputs, exceeding 10x with AVX-512 enabled.
- ▪Writing high-performance code in both C and BQN demands specialized knowledge—branchless programming and bit manipulation in C, and array-oriented techniques in BQN.
- ▪The performance advantage of BQN is not universal and depends on problem structure, input density, and hardware factors like cache and vector instruction support.
Hacker News (Newest) files mainly under programming. We currently carry 5,306 of its stories.
Story provenance
Source · retrieval · rights · ranking — open for full record
inspect →
Story provenance
Attribution is not the same as permission. This drawer separates discovery metadata, excerpts, WeSearch-generated summaries, reuse status, and whether the publisher receives the visit. Nothing here claims a legal grant the publisher has not made.
Record
| Original publisher | Github |
| Canonical URL | https://mlochbaum.github.io/BQN/implementation/versusc.html |
| Publication time | Sat, 16 May 2026 09:48:23 +0000 |
| Retrieval time | 2026-05-16T10:10:18.168Z |
| Last seen | 2026-05-16T10:10:18.168Z |
| Headline source | Publisher (no WeSearch rewrite) |
| Excerpt source | publisher body |
| Excerpt method | First ~120 words (~800 chars) of extracted publisher body, fair-use limited. |
| Summary | WeSearch · cerebras-chat (WeSearch summarizer) |
| Summary source text | contentText |
| Citation coverage | Summary is a WeSearch-generated derivative; primary citation is the original publisher URL. |
| Cluster | arNXsosm87UD |
| Cluster logic | Grouped by semantic title/content similarity across sources within a rolling window. Same-publisher template collisions are excluded from coverage comparison. |
| Ranking reason | Story pages are not engagement-ranked. Hub feeds use recency, with optional source-diversified chronological ordering (cap consecutive stories per source). No personalized ranking. |
| Publisher visit | Yes — open original |
| Substitutes article? | No — link-out required for full text |
Rights status (four layers)
WeSearch handling by dimension
| Indexing | May the item be indexed (stored, ranked, made findable)? | Allowed |
| Snippet | May a short excerpt of the publisher's text be shown? | Allowed |
| AI summary | May WeSearch generate its own short summary of the article? | Limited |
| Retrieval / RAG | May the content be exposed for third-party retrieval-augmented generation? | Not asserted |
| Model training | May the content be used to train AI models? | Not asserted |
| Commercial reuse | May the content be reused commercially? | Not permitted |
Basis: Derived from the published RSS/Atom feed. Contact: [email protected]. Reviewed: 2026-07-24.
Opening excerpt (first ~120 words) tap to expand
(github) / BQN / implementation Performance in BQN versus C The title alone! You know BQN has some fast performance to wave around! If you think it's paradoxical that programs written for CBQN, a C-based interpreter, might outperform programs written directly in C, it's because you think performance comes from the language implementation. Not so: performance comes from the programmer, taking advantage of the features offered by their language implementation. The difficulty of doing so has two consequences: BQN programs can and do outperform equivalent C programs. Your BQN programs are unlikely to outperform equivalent C programs.
…
Excerpt limited to ~120 words for fair-use compliance. The full article is at Github.
Discussion
0 commentsMore from Github
