frontpage.
newsnewestaskshowjobs

Open Source @Github

fp.

GLM-5.3: Frontier coding with emergent cyber capabilities

https://z.ai/blog/glm-5.3
610•pella•6h ago•303 comments

DeepSeek peak/off-peak pricing update

https://api-docs.deepseek.com/news/news260813/
72•fagnerbrack•2h ago•26 comments

Gemini 3.7 Flash

https://blog.google/innovation-and-ai/models-and-research/gemini-models/introducing-gemini-3-7-fl...
882•thisisauserid•18h ago•448 comments

Differential Heuristics

https://www.redblobgames.com/blog/2026-08-08-differential-heuristics/
37•ibobev•4d ago•1 comments

Accelerating GPT-5.6 Sol Ultrafast

https://www.cerebras.ai/blog/accelerating-gpt-5-6-sol-ultrafast-with-openai
638•pr337h4m•18h ago•251 comments

Hello, me. It's been a while

https://themech.net/2026/08/hello-me-its-been-a-while/
264•somesoftdev•17h ago•146 comments

Show HN: C# Game Engine with its own scripting language and IDE

https://github.com/ArcadeMakerSources/ArcadeMaker
63•am-gm•2d ago•31 comments

Protect Your Relays

https://www.iroh.computer/blog/authenticated-relays
7•surprisetalk•3d ago•7 comments

DeepSeek Harness developer preview

https://deepseek.com/harness/en/
683•bjin•23h ago•279 comments

Spaghettifying DRAM

https://github.com/xoreaxeaxeax/skitter-creek-bath-salts
650•matt_d•21h ago•167 comments

Why does Opus 5 feel worse to work with?

https://mun-logadan.github.io/why-does-opus-5-feel-worse/
117•numeri•2h ago•107 comments

Ruby 4.0 Universal RCE Deserialization Gadget Chain

https://www.elttam.com/blog/ruby-4-0-universal-rce-deserialization-gadget-chain
44•pentestercrab•6h ago•10 comments

Mistral OCR 4.1

https://docs.mistral.ai/models/ocr-4-1
373•spelk•19h ago•151 comments

We're not done with point clouds

https://claytonwramsey.com/blog/mvt/
17•claytonwramsey•3d ago•2 comments

Bluesky Protocol Services

https://atproto.com/blog/introducing-bluesky-protocol-services
174•danabramov•12h ago•46 comments

Show HN: Lumabri – Run Moe Models on a P2P Swarm with Colibri

https://github.com/JustVugg/lumabri
34•vforno•11h ago•12 comments

Understanding is the new bottleneck

https://www.geoffreylitt.com/2026/07/02/understanding-is-the-new-bottleneck
363•sebg•17h ago•189 comments

Choose Boring Technology (2015)

https://mcfunley.com/choose-boring-technology
371•tosh•18h ago•200 comments

Donkey.bas is 45 Years Old – 131 line of Glory

https://donkeybas.com/
248•jkrauska•18h ago•118 comments

Nine PBS sues Iron Mountain over blocked access to archival data

https://current.org/2026/08/nine-pbs-sues-iron-mountain-over-blocked-access-to-archival-data/
325•vinayakborkar•23h ago•188 comments

What an improv stage can teach you about leading cross-cultural teams in Tokyo

https://www.tokyodev.com/articles/yes-and-what-an-improv-stage-can-teach-you-about-leading-cross-...
21•pwim•1w ago•3 comments

How Compaction Works in Pi

https://earendil.com/posts/compaction-in-pi/
177•tosh•18h ago•73 comments

Single log line is 49KB+ (ext4) / 110KB+ (btrfs) of systemd-journald disk writes

https://github.com/systemd/systemd/issues/40262
231•ValdikSS•17h ago•159 comments

Where did the old web go? We followed 657,607 links to find out

https://0.mk/blog/link-rot
195•tdx•18h ago•190 comments

Credibility is the barrier to entry in silicon

https://www.siliconimist.com/p/credibility-is-the-barrier-to-entry
32•johncole•4d ago•15 comments

Blog about things you don't understand yet

https://www.seangoedecke.com/blog-about-things-you-dont-understand-yet/
121•gfysfm•12h ago•36 comments

How Organizations Use AI: Evidence from ChatGPT [pdf]

https://cdn.openai.com/pdf/how-organizations-use-chatgpt.pdf
114•malshe•16h ago•85 comments

The Library of Ashurbanipal (2025)

https://www.historytoday.com/archive/feature/library-ashurbanipal
39•samizdis•3d ago•9 comments

Ordinary Abundance

https://ordinaryabundance.com/
326•yen223•22h ago•159 comments

NP-overrated

https://gruhn.me/blog/2026-08-13/
223•theanonymousone•16h ago•159 comments
Open in hackernews

Writing a Self-Mutating x86_64 C Program (2013)

https://ephemeral.cx/2013/12/writing-a-self-mutating-x86_64-c-program/
118•kepler471•1y ago

Comments

belter•1y ago
I guess in OpenBSD because of W ^ X this would not work?
akdas•1y ago
I was thinking the same thing. Usually, you'd want to write the new code to a page that you mark as read and write, then switch that page to read and execute. This becomes tricky if the code that's doing the modifying is in the same page as the code being modified.
timewizard•1y ago
The way it's coded it wouldn't; however, you can map the same shared memory twice. Once with R|W and a second time with R|X. Then you can write into one region and execute out of it's mirrored mapping.
rkeene2•1y ago
In Linux it also needs mprotect() to change the permissions on the page so it can write it. The OpenBSD man page[0] indicate that it supports this as well, though notes that not all implementations are guaranteed to allow it, but my guess is it would generally work.

[0] https://man.openbsd.org/mprotect.2

Retr0id•1y ago
It's not required on linux, if the ELF headers are set up such that the page is mapped rwx to begin with. (but rwx mappings are generally frowned upon from a security perspective)
mananaysiempre•1y ago
Not as is, but I think OpenBSD permits you to map the same memory twice, once as W and once as X (which would be a reasonable hoop to jump through for JITs etc., except there’s no portable way to do it). ARM64 MacOS doesn’t even permit that, and you need to use OS-specific incantations[1] that essentially prohibit two JITs coexisting in the same process.

[1] https://developer.apple.com/documentation/apple-silicon/port...

saagarjha•1y ago
No, the protection is per-thread. You can run the JITs in different threads
alcover•1y ago
I often think this could maybe allow fantastic runtime optimisations. I realise this would be hardly debuggable but still..
Retr0id•1y ago
It already does, in the form of JIT compilation.
alcover•1y ago
OK but I meant in already native code, like in a C program - no bytecode.
Retr0id•1y ago
I mean that, too.
connicpu•1y ago
LuaJIT has a wonderful dynamic code generation system in the form of the DynASM[1] library. You can use it separately from LuaJIT for dynamic runtime code generation to create machine code optimized for a particular problem.

[1]: https://luajit.org/dynasm.html

lmm•1y ago
If you are generating or modifying code at runtime then how is that different from bytecode? Standardised bytecodes and JITs are just an organised way of doing the same thing.
oxcabe•1y ago
It's impressive how well laid out the content in this article is. The spacing, tables, and code segments all look pristine to me, which is especially helpful given how dense and technical the content is.
AStonesThrow•1y ago
It was designed by Elves on Christmas Island where Dwarves run the servers and Hobbits operate the power plant
f1shy•1y ago
I have the suspicion that there is a high correlation between how organized the content is, and how organized and clear the mind of the writer is.
ivanjermakov•1y ago
I had a great experience writing self modified programs is a single instruction programming game SIC-1: https://store.steampowered.com/app/2124440/SIC1/
ycombinatrix•1y ago
Cool recommendation, will give it a try.
Someone•1y ago
Fun article, but the resulting code is extremely brittle:

- assumes x86_64

- makes the invalid assumption that functions get compiled into a contiguous range of bytes (I’m not aware of any compiler that violates that, but especially with profile-guided optimization or compilers that try to minimize program size, that may not be true, and there is nothing in the standard that guarantees it)

- assumes (as the article acknowledges) that “to determine the length of foo(), we added an empty function, bar(), that immediately follows foo(). By subtracting the address of bar() from foo() we can determine the length in bytes of foo().”. Even simple “all functions align at cache lines” slightly violates that, and I can see a compiler or a linker move the otherwise unused bar away from foo for various reasons.

- makes assumptions about the OS it is running on.

- makes assumptions about the instructions that its source code gets compiled into. For example, in the original example, a sufficiently smart compiler could compile

  void foo(void) {
    int i=0;
    i++;
    printf("i: %d\n", i);
  }
as

  void foo(void) {
    printf("1\n");
  }
or maybe even

  void foo(void) {
    puts("1");
  }
Changing compiler flags can already break this program.

Also, why does this example work without flushing the instruction cache after modifying the code?

nekitamo•1y ago
For the mainstream OSes (Windows, OSX, Linux Android) You don't need to flush the instruction cache on most x86 CPUs after modifying the code segment dynamically, but you do on ARM and MIPS.

This has burned me before while writing a binary packer for Android.

saagarjha•1y ago
They check all those assumptions by disassembling the code.
Cloudef•1y ago
xixixao•1y ago
I’ve been thinking a lot about this topic lately, even studying how executables look on arm macOS. My motivation was exploring truly fast incremental compilation for native code.

The only way to do this now on macOS is remapping whole pages as JIT. This makes it quite a challenge but still it might work…

Cloudef•1y ago
Kaze Emanuar's "Optimizing with Bad Code" video also goes briefly go through self-modifying code https://www.youtube.com/watch?v=4LiP39gJuqE
pfdietz•1y ago
A program that can generate, compile, and execute new code is nothing special in the Common Lisp world. One can build lambda expressions, invoke the compile function on them, and call the resulting compiled functions. One can even assign these functions to the symbol-function slot of symbols, allowing them to be called from pre-existing code that had been making calls to that function named by that symbol.
BenjiWiebe•1y ago
I know that no other language can match Lisp, but many languages can generate and execute new code, if they're interpreted. Compile, too, if they're JITted. They all require quite a bit of runtime support though.
DrZhvago•1y ago
Someone correct me if I am wrong, but self-mutating code is not as uncommon as the author portrays it. I thought the whole idea of hotspot optimization in a compiler is essentially self-mutating code.

Also, I spent a moderately successful internship at Microsoft working on dynamic assemblies. I never got deep enough into that to fully understand when and how customers where actually using it.

https://learn.microsoft.com/en-us/dotnet/fundamentals/reflec...

iamcreasy•1y ago
Is it possible to mutate the text segment by another process? For example, injecting something malicious instead of exec-ing a shell?
vbezhenar•1y ago
I used GNU lightning library once for such optimisation. I think it was ICFPC 2006 task. I had to write an interpreter for virtual machine. Naive approach worked but was slow, so I decided to speed it up a bit using JIT. It wasn't a 100% JIT, I think I just implemented it for loops but it was enough to tremendously speed it up.
userbinator•1y ago
Programs from the 80s-90s are likely to have such tricks. I have done something similar to "hardcode" semi-constants like frame sizes and quantisers in critical loops related to audio and video decompression, and the performance gain is indeed measurable.
alcover•1y ago
> "hardcode" semi-constants

You mean you somehow avoided a load. But what if the constant was already placed in a register ? Also how could you pinpoint the reference to your constant in the machine code ? I'm quite profane about all this.

ronsor•1y ago
> Also how could you pinpoint the reference to your constant in the machine code?

Not OP, but often one uses an easily identifiable dummy pattern like 0xC0DECA57 or 0xDEADBEEF which can be substituted without also messing up the machine code.

mananaysiempre•1y ago
If you’re willing to parse object files (a much easier proposition for ELF than for just about anything else), another option is to have the source code mention the constants as addresses of external symbols, then parse the relocations in the compiled object. Unfortunately, I’ve been unable to figure out a reliable recipe to get a C compiler to emit absolute relocations in position-independent code, even after restricting myself to GCC and Clang for x86 Linux; in some configurations it works and in others you (rather pointlessly) get a PC-relative one followed by an add.
userbinator•1y ago
All the registers were already taken.

You use a label.

econ•1y ago
The 80's:

Say you set a value for some reason. Later you have to check IF it is set. If the condition needs to be checked many times you replace it with the code (rather than set a value to check some place). If you need to check if something is still true repeatedly you replace the condition check with no-ops when it isn't true.

Also funny are insanely large loop unrolls with hard coded valued. You could make a kind of rainbow table of those.

barchar•1y ago
It sometimes can, but you then have to balance the time spent optimizing against the time spent actually doing whatever you were optimizing.

Also on modern chips you must wait quite a number of cycles before executing modified code or endure a catastrophic performance hit. This is ok for loops and stuff, but makes a lot of the really clever stuff pointless.

The debuggers software breakpoints _are_ self-modifying code :)

112233•1y ago
Linux kernel had the same idea, and now they have "static keys". It's both impressive and terrifying.
> self-modifying code > brittle

I mean that is to be very much expected, unless someone comes up with a programming language that fully embraces the concept.

znpy•1y ago
The author clearly explained that the whole article is more a demonstration for illustrative purposes than anything else.

> Changing compiler flags can already break this program.

That's not the point of the article.