Hacker News: bmc7505

New comment by bmc7505 in "Expanding Swift's IDE Support"

bmc7505 — Wed, 08 Apr 2026 23:30:52 +0000

I've recently been using this plugin [1], which is still under development but is an adequate stopgap until a better solution comes along.

[1]: https://plugins.jetbrains.com/plugin/22150-noctule-the-swift...

Tetris Is Hard with Just One Piece Type

bmc7505 — Thu, 12 Mar 2026 03:45:54 +0000

Article URL: https://arxiv.org/abs/2603.09958

Comments URL: https://news.ycombinator.com/item?id=47346201

Points: 3

# Comments: 0

New comment by bmc7505 in "A CPU that runs entirely on GPU"

bmc7505 — Wed, 04 Mar 2026 06:29:32 +0000

As foretold six years ago. [1]

[1]: https://breandan.net/2020/06/30/graph-computation#roadmap

Yet another catalogue of fast matrix multiplication algorithms

bmc7505 — Sat, 28 Feb 2026 13:36:02 +0000

Article URL: https://fmm.univ-lille.fr/

Comments URL: https://news.ycombinator.com/item?id=47195211

Points: 1

# Comments: 0

New comment by bmc7505 in "Smallest transformer that can add two 10-digit numbers"

bmc7505 — Sat, 28 Feb 2026 13:35:28 +0000

Fast matrix multiplication would be a more useful benchmark: https://fmm.univ-lille.fr/

New comment by bmc7505 in "The path to ubiquitous AI (17k tokens/sec)"

bmc7505 — Fri, 20 Feb 2026 17:40:19 +0000

17k TPS is slow compared to other probabilistic models. It was possible to hit ~10-20 million TPS decades ago with n-gram and PDFA models, without custom silicon. A more informative KPI would be Pass@k on a downstream reasoning task - for many such benchmarks, increasing token throughput by several orders of magnitude does not even move the needle on sample efficiency.

Show HN: TidyPython – Real-time syntax repair for Python

bmc7505 — Wed, 21 Jan 2026 23:03:13 +0000

Article URL: https://tidyparse.github.io/python.html

Comments URL: https://news.ycombinator.com/item?id=46712917

Points: 1

# Comments: 0

New comment by bmc7505 in "“Stop Designing Languages. Write Libraries Instead” (2016)"

bmc7505 — Wed, 07 Jan 2026 17:57:59 +0000

There are a few approaches if you want to write a new language. One, as the author argues, is to write a library in an existing language, which may require sacrificing ergonomics to fit inside the syntax of the host language, but is safe, modular and reusable.

Many DSLs can be bolted onto an existing language with support for compiler extensions. This approach offers more flexibility, but often leads to fragmentation and poor interoperability in the language ecosystem.

There is third approach, established by a group in Minnesota [1], which is to design languages and tools which are modular and extensible from the get-go, so that extensions are more interoperable. They do research on how to make this work using attribute grammars.

If the host language has a sufficiently expressive type system, you can often get away with writing a fluent API [2] or type safe embedded DSL. But designing languages and type systems with good support for meta-programming is also an active area of research. [3, 4]

If none of these options work, the last resort is to start from tabula rasa and write your own parser, compiler, and developer tools. This offers the most flexibility, but requires an enormous amount of engineering, and generally is not recommended in 2026.

[1]: https://melt.cs.umn.edu

[2]: https://arxiv.org/pdf/2211.01473

[3]: https://www.cs.tsukuba.ac.jp/~kam/papers/aplas2016.pdf

[4]: https://arxiv.org/pdf/2404.17065

New comment by bmc7505 in "Fabrice Bellard Releases MicroQuickJS"

bmc7505 — Wed, 24 Dec 2025 00:37:46 +0000

Interesting. I wonder if mqjs would make it feasible to massively parallelize JavaScript on the GPU. I’m looking for a way to run thousands of simultaneous JS interpreters, each with an isolated heap and some shared memory. There are some research projects [1, 2] in this direction, but they are fairly experimental.

[1]: https://github.com/SamGinzburg/VectorVisor

[2]: https://github.com/beehive-lab/ProtonVM

Introduction to Linear Types

bmc7505 — Sat, 06 Sep 2025 19:01:56 +0000

Article URL: https://austral-lang.org/linear-types

Comments URL: https://news.ycombinator.com/item?id=45151970

Points: 2

# Comments: 0

New comment by bmc7505 in "Does the Bitter Lesson Have Limits?"

bmc7505 — Sat, 02 Aug 2025 11:48:36 +0000

You could argue that since automatic differentiation and symbolic differentiation are equivalent, [1] symbolic AI did succeed by becoming massively parallelizable, we just needed to scale up the data and hardware in kind.

[1]: https://arxiv.org/pdf/1904.02990

New comment by bmc7505 in "Does the Bitter Lesson Have Limits?"

bmc7505 — Sat, 02 Aug 2025 11:31:07 +0000

> The solvers participating in this track will be executed with a wall-clock time limit of 1000 seconds. Each solver will be run an a single AWS machine of the type m6i.16xlarge, which has 64 virtual cores and 256GB of memory.

For comparison, an H100 has 14,592 CUDA cores, with GPU clusters measured in the exaflops. The scaling exponents are clearly favorable for LLM training and inference, but whether the same algorithms used for parallel SAT would benefit from compute scaling is unclear. I maintain that either (1) SAT researchers have not yet learned the bitter lesson, or (2) it is not applicable across all of AI as Sutton claims.

New comment by bmc7505 in "Does the Bitter Lesson Have Limits?"

bmc7505 — Sat, 02 Aug 2025 00:18:06 +0000

The difference is that SAT/SMT solvers have primarily relied on single-threaded algorithmic improvements [1] and unlike neural networks, we have not [yet] discovered a uniformly effective strategy for leveraging additional computation to accelerate wall-clock runtime. [2]

[1]: https://arxiv.org/pdf/2008.02215

[2]: https://news.ycombinator.com/item?id=36081350

New comment by bmc7505 in "Type-constrained code generation with language models"

bmc7505 — Wed, 14 May 2025 01:03:36 +0000

The correct way to do this is with finite model theory but we're not there yet.

New comment by bmc7505 in "Bored of It"

bmc7505 — Fri, 04 Apr 2025 13:23:32 +0000

Gingsberg stole it from Yeats — “the best lack all conviction…” / “the best minds of my generation…” — many similar verses, e.g., “what rough beast…” / “what sphinx of cement…”

https://www.poetryfoundation.org/poems/43290/the-second-comi...