Copy-and-Patch Compilation: A fast compilation algorithm for high-level languages and bytecode · HackerPapers discussions

Copy-and-Patch Compilation: A fast compilation algorithm for high-level languages and bytecode — mentioned by darkamaul

Fri, 26 Sep 2025 07:59:05 GMT

I think the _copy-and-patch_ approach [0] is probably the best compromise here. You get many of the guarantees of compiled code (strong correctness, reduced mismatch between interpreter vs JIT semantics, etc.), while still being very close to native performance. In fact, Python is already moving in that direction: the new bytecode-based copy-and-patch JIT in Python 3.13 shows correct results even before heavy performance tuning. So to me this seems like a very promising road: I wonder how practical this is if the base language is not C/C++ but Rust (or any kind of memory safe language). [0]…

Paper and discussion history. A mention is not an endorsement.

Copy-and-Patch Compilation: A fast compilation algorithm for high-level languages and bytecode — mentioned by UncleEntity

Tue, 29 Apr 2025 12:02:30 GMT

I've been messing with Claude pretty heavily the last week or so and found if I guide it in the right direction it (mostly) does the right thing. I've been having it reproduce the lua peg parser thingie (plus utf-8 support)[0] from the paper they wrote about it while also using the 'musttail' interpreter pattern [1] just because that sounded like a good idea. Once I got over the fact that Claude is really bad at debugging and Deepseek, while much better at it, isn't very reliable due to 'server busy' timeouts things have been going swimmingly. While I don't do very much debugging once in a…

Paper and discussion history. A mention is not an endorsement.

Copy-and-Patch Compilation: A fast compilation algorithm for high-level languages and bytecode — mentioned by ris

Mon, 22 Jul 2024 18:36:52 GMT

Read the paper which fully explains the subtle cleverness that sets it apart: https://arxiv.org/abs/2011.13127

Paper and discussion history. A mention is not an endorsement.

Copy-and-Patch Compilation: A fast compilation algorithm for high-level languages and bytecode — mentioned by alserio

Sun, 02 Jun 2024 17:28:36 GMT

Link to the HTML version for those who need it and to help spread the knowledge of the wonderful arxiv ar5iv tool: https://ar5iv.labs.arxiv.org/html/2011.13127

Paper and discussion history. A mention is not an endorsement.

Copy-and-Patch Compilation: A fast compilation algorithm for high-level languages and bytecode — HN submission

Sun, 02 Jun 2024 12:07:07 GMT

Copy-and-Patch: Fast compilation for high-level languages and bytecode (2020)

182 points; 50 discussion replies on HN. Paper and source history. A submission is not an endorsement.

Copy-and-Patch Compilation: A fast compilation algorithm for high-level languages and bytecode — mentioned by AlexErrant

Mon, 18 Mar 2024 12:45:15 GMT

Not quite fresh, but > A paper from 2020 [0] showed that Cranelift was an order of magnitude faster than LLVM, while producing code that was approximately twice as slow on some benchmarks. [0] https://arxiv.org/pdf/2011.13127.pdf

Paper and discussion history. A mention is not an endorsement.

Copy-and-Patch Compilation: A fast compilation algorithm for high-level languages and bytecode — mentioned by vanderZwan

Tue, 09 Jan 2024 11:20:11 GMT

I think it's really cool that Haoran Xu and Fredrik Kjolstad's copy-and-patch technique[0] is catching on, I remember discovering it through Xu's blog posts about his LuaJIT remake project[1][2], where he intends to apply these techniques to Lua (and I probably found those through a post here). I was just blown away by how they "recycled" all these battle-tested techniques and technologies, and used it to synthesize something novel. I'm not a compiler writer but it felt really clever to me. I highly recommend the blog posts if you're into learning how languages are implemented, by the way.…

Paper and discussion history. A mention is not an endorsement.

Copy-and-Patch Compilation: A fast compilation algorithm for high-level languages and bytecode — mentioned by nickpsecurity

Tue, 26 Dec 2023 22:06:40 GMT

Arxiv version: https://arxiv.org/abs/2011.13127

Paper and discussion history. A mention is not an endorsement.

Copy-and-Patch Compilation: A fast compilation algorithm for high-level languages and bytecode — mentioned by Qem

Mon, 25 Dec 2023 11:30:42 GMT

I think this is the copy and patch JIT paper mentioned: https://arxiv.org/pdf/2011.13127.pdf

Paper and discussion history. A mention is not an endorsement.

Copy-and-Patch Compilation: A fast compilation algorithm for high-level languages and bytecode — mentioned by fsfod

Wed, 23 Nov 2022 00:59:02 GMT

The author also worked on the Copy-and-Patch Compilation paper[1], I wonder if they are going to use the same idea for ones of tiers of the JIT idk if it would beat LuaJIT's JIT for code compilation speed but the machine code could be faster. [1] https://arxiv.org/abs/2011.13127

Paper and discussion history. A mention is not an endorsement.

Copy-and-Patch Compilation: A fast compilation algorithm for high-level languages and bytecode — mentioned by cfallin

Tue, 20 Sep 2022 17:29:57 GMT

The perf blogpost actually uses SpiderMonkey-compiled-to-Wasm as a benchmark rather than a comparison (peer) of Wasmtime. However, there are some good comparisons done by a third party in this paper: https://arxiv.org/pdf/2011.13127.pdf See Figs. 20-22 on page 19. They found Wasmtime to be quite competitive to V8 and others. (disclosure: I work on Wasmtime + Cranelift)

Paper and discussion history. A mention is not an endorsement.

Copy-and-Patch Compilation: A fast compilation algorithm for high-level languages and bytecode — HN submission

Thu, 16 Sep 2021 02:01:41 GMT

Copy-and-Patch: Fast JIT Compilation for SQL, WebAssembly, and Others

30 points; 7 discussion replies on HN. Paper and source history. A submission is not an endorsement.