frontpage.
newsnewestaskshowjobs

Open Source @Github

fp.

Show HN: Getting GLM 5.2 running on my slow computer

https://github.com/JustVugg/colibri
434•vforno•19h ago•110 comments

Focus

https://boz.com/articles/focus
52•iacguy•2h ago•28 comments

EU Parliament greenlights Chat Control 1.0

https://www.patrick-breyer.de/en/eu-parliament-greenlights-chat-control-1-0-breyer-our-children-l...
1042•rapnie•16h ago•505 comments

GPT-5.6

https://openai.com/index/gpt-5-6/
1102•logickkk1•10h ago•799 comments

Show HN: 18 Words

https://18words.com/
852•pompomsheep•14h ago•288 comments

Train sim created by just one person is being called the best ever made

https://kotaku.com/a-train-sim-created-by-just-one-person-is-being-called-the-best-ever-made-2000...
327•oumua_don17•4d ago•124 comments

Star Just Ate a Planet, and It's Not Done Yet

https://www.nytimes.com/2026/07/09/science/space/planetary-engulfment-hungry-star.html
19•wglb•1h ago•22 comments

My Story of 3D Realms / Apogee Part I (2020)

https://joesiegler.blog/2020/11/my-story-of-apogee-3dr/
44•Michelangelo11•1w ago•1 comments

Hy3

https://hy.tencent.com/research/hy3
402•andai•11h ago•87 comments

Interview with Mitchell Hashimoto about Ghostty and Zig

https://alexalejandre.com/programming/interview-with-mitchell-hashimoto/
143•veqq•10h ago•57 comments

Postgres rewritten in Rust, now passing 100% of the Postgres regression tests

https://github.com/malisper/pgrust
423•SweetSoftPillow•21h ago•430 comments

Triple Dragon Fractal (2020)

https://paulbourke.net/fractals/tripledragon/
23•nhatcher•3d ago•4 comments

Build your own vulnerability harness

https://blog.cloudflare.com/build-your-own-vulnerability-harness/
14•ianrahman•1h ago•6 comments

No leap second will be introduced at the end of December 2026

https://datacenter.iers.org/data/latestVersion/bulletinC.txt
250•ChrisArchitect•13h ago•190 comments

The glass backbone: Why the Army's logistics will break in the next war

https://mwi.westpoint.edu/the-glass-backbone-why-the-armys-logistics-will-break-in-the-next-war/
311•baud147258•13h ago•394 comments

A road to Lisp: Why Lisp

https://scotto.me/blog/2026-07-09-why-lisp/
123•silcoon•14h ago•123 comments

Building a real-time AI tutor for 5-year-olds

https://www.ello.com/blog/teaching-a-child-in-1000-ms
55•catalinvoss•6h ago•72 comments

Girls just wanna have fast MPMC queues with bounded waiting

https://nahla.dev/blog/waitfree_queue/
142•EvgeniyZh•3d ago•31 comments

Launch HN: Context.dev (YC S26) – API to get structured data from any website

https://www.context.dev
76•TheYahiaBakour•11h ago•56 comments

Life with Hazard Ratios

https://dynomight.net/hazard-ratios/
9•surprisetalk•3d ago•0 comments

Why American ambulance rides are so expensive

https://davidoks.blog/p/why-american-ambulance-rides-are
113•jyunwai•5h ago•153 comments

A possible future for Damn Interesting

https://www.damninteresting.com/a-possible-future/
249•mzur•11h ago•33 comments

Muse Spark 1.1

https://ai.meta.com/blog/introducing-muse-spark-meta-model-api/
334•ot•13h ago•174 comments

Cache-Conscious Data Layout in Rust: Field Zoning, False Sharing, 128-Byte Rule

https://debasishg.github.io/blog/part1-cache-conscious-data-layout-in-rust/
13•eigenBasis•3d ago•1 comments

Patterncollider: Generate and explore quasiperiodic tiling patterns

https://github.com/aatishb/patterncollider
27•tobr•3d ago•1 comments

Study: "Mommy, do you love your phone more than me?"

https://www.frontiersin.org/journals/psychology/articles/10.3389/fpsyg.2026.1766665/full
10•hbcondo714•2h ago•0 comments

Wildcard (YC W25) Is Hiring a Founding Engineer

https://www.ycombinator.com/companies/wildcard/jobs/ZSLVaaU-founding-engineer
1•kaushikmahorker•10h ago

Opinionated and easy Pi.dev configuration

https://lazypi.org/
119•lwhsiao•11h ago•62 comments

Buried Apple feature turns an iPhone into the perfect kids' dumb phone

https://www.wired.com/story/this-buried-apple-feature-turns-an-iphone-into-the-perfect-kids-dumb-...
288•PotatoNinja•3d ago•169 comments

GLM 5.2 is nearly as accurate as a human book keeper

https://toot-books.pages.dev/blog/glm-5-2-vat-benchmark
192•adamkurkiewicz•8h ago•113 comments
Open in hackernews

How ZGC allocates memory for the Java heap

https://joelsiks.com/posts/zgc-heap-memory-allocation/
86•lichtenberger•1y ago

Comments

gopalv•1y ago
The 32x virtual memory to physical memory ratio plays into relocation and colored pointers (i.e pointers where some bits serve as flag bits).

Putting the actual data layouts in 44 bits out of 64 is a neat trick which relies on the allocator being aware of the mappings between physical and virtual addresses.

twoodfin•1y ago
When your comment and the article refer to “physical” addresses, those are physical in the context of the JVM, right? To the OS they’re virtual addresses in the JVM process space?
acchow•1y ago
Correct. ZGC has no way to escape from the virtualization by the kernel (assuming your hardware and kernel uses an MMU)
MBCook•1y ago
Thank you for the answer, I was wondering that as well.
hinkley•1y ago
In the beginning of the 32 bit revolution, when the future was here but unevenly distributed, there was a lot of talk about how 32 bit pointers would fundamentally change how people wrote code. Among other things it got rid of a bunch of odd bookkeeping, and if you don’t have to do the bookkeeping you don’t have to write the code in a way that supports it, so you can do other things.

Not too long after someone asked what sort of interesting changes 64 bit will bring. And I’ve been keeping that question in the back of my mind ever since.

Aliasing memory multiple times in order to do read or write barriers and make GC much cheaper is a pretty good one. But another one I know of is that one of the secrets of the L4 microkernel is that its IPC speed comes substantially from reducing the amount of TLB work that needs to be done to switch to another process running in a different address space. They use the same address space and only swap out the access rights which cuts the call overhead in half. It’s pretty easy to put a bunch of processes into a 64 bit address space and just throw each one a randomly located 4GB slice of RAM.

twoodfin•1y ago
Yeah, would love to see the CPU vendors invent some primitives to let user code pull those kinds of privilege isolation tricks within a single process and address space.

Something like: “From now on, code on these pages can only access data on these pages, and only return to/call into other code through these gates…”

hinkley•1y ago
Thread based seems like it at least should be possible.
ahartmetz•1y ago
I've had some ideas about avoiding format validation in IPC receivers if the data is encoded by trusted code, which is also the only code that has rights to send the IPC data / to connect to the receiver. I can't really think of an important problem that it would solve, though. DBus always validates received data, but it's not really meant or very suitable for large amounts of data anyway.
pron•1y ago
For relevant upcoming changes see Automatic Heap Sizing for ZGC: https://openjdk.org/jeps/8329758
twoodfin•1y ago
What I’m looking for is a way for a process to de/re-escalate its privileges to access memory, without an expensive context switch being required at the transition. The CPU would simply enforce different rules based on (say) the high-order bits of the instruction pointer.

Imagine a server process that wants to run some elaborate third-party content parser. It’d be great to be sure that no matter how buggy or malicious that code, it can’t leak the TLS keys.

Today, high-security architectures must use process isolation to achieve this kind of architectural guarantee, but even finely tuned IPC like L4’s is an order of magnitude slower than a predictable jump.

gpderetta•1y ago
For a brief moment Intel supported MPX which did something similar.

You can also play tricks with the virtualization hardware, bit it need kernel support.

Eventually we will get segments back again.

MarkSweep•1y ago
That would be pretty cool. Something like the Win32 function GetWriteWatch, but implemented in hardware instead of the page fault handler (I assume).

https://learn.microsoft.com/en-us/windows/win32/api/memoryap...

Or some sort of special write barrier store op-code, idk.

mike_hearn•1y ago
It exists, that's called MPKs.
twoodfin•1y ago
I don’t think MPK’s will fit the need I have. Simply: Run some arbitrary, untrusted, non-sandboxed code in the same thread with assurance it can’t read page X. When that code completes and I’m back in code I trust, X is readable again.

Is that something MPK makes possible? The doc I’ve read suggests either your process can flip permission bits or it can’t. Great for avoiding out-of-sandbox reads. But if there’s arbitrary execution happening, why can’t that code flip the access to secrets back on?

mike_hearn•1y ago
Oracle Labs has tech that does that:

https://youtu.be/T05FI93MBI8?si=EieFgujaGiW2gbO8&t=958

The trick is to do a cascading disassembly of all untrusted code you'll execute to prove it can't change the MPK register.

twoodfin•1y ago
Wow. Neat trick and exactly the kind of thing I was looking for.

Thanks!

EDIT: Looks like this is the relevant paper from the Graal team: https://www.graalvm.org/resources/articles/binsweep.pdf

jdougan•1y ago
Is that something like the memory protection scheme on the Newton OS?
nyanpasu64•1y ago
Isn't not swapping page tables during a call precisely what the KPTI mitigations had to turn off for Meltdown mitigations?