frontpage.
newsnewestaskshowjobs

Open Source @Github

fp.

Run Qwen 3.8 Flash Next (125B) on consumer hardware (RTX 4090) at 100T/s

https://github.com/Niko1221/Strata
572•snehesht•11h ago•272 comments

Infidel goes wild

https://blog.zarfhome.com/2026/10/infidel-goes-wild
49•tobr•1d ago•3 comments

Turn off Apple Intelligence on macOS 27 and get its disk space back

https://github.com/omlahore/RemoveMacAI
296•privacyisntdead•4h ago•180 comments

Self-hosted HTTP tunnels with SSH and Nginx

https://vincent.bernat.ch/en/blog/2026-http-over-ssh
27•renehsz•1h ago•5 comments

Improper redaction reveals Google Data Center water and electricity usage

https://www.1011now.com/2026/09/30/more-questions-than-answers-about-lincolns-google-data-center-...
200•sensanaty•4h ago•297 comments

A browser-native classic Visual Basic VB6 IDE

https://wieslawsoltes.github.io/VB6/
51•wiso•5h ago•18 comments

Homa: The end of TCP for AI clusters [video]

https://www.youtube.com/watch?v=eZ8WWZzoaR0
46•signa11•4h ago•12 comments

A map of every lighthouse

https://mapped.earth/lighthouses/world
156•karakoram•2d ago•72 comments

Tell HN: Bob Cringely has died

795•paveworld•23h ago•173 comments

Show HN: Glashütte Trash Clock – A 30-minute pendulum clock made from trash

https://niklasroy.com/gtc/
161•r0r0•2d ago•22 comments

Xray-core concealed a certificate verification bypass vulnerability

https://github.com/net4people/bbs/issues/672
37•timbill•6h ago•0 comments

How to scale intent, quality, and artistry with AI [video]

https://www.youtube.com/watch?v=GLvFTMtw4Jk
44•simonjgreen•15h ago•13 comments

Incentives in Academic Research

https://www.msoos.org/2026/10/incentives-in-academic-research/
32•zero_k•6h ago•15 comments

Page Table Memory Consumption

https://frn.sh/pagetables/
38•shellpipe•3d ago•6 comments

Results from the ASIC puzzle

https://blog.janestreet.com/asic-puzzle-results/
69•eru•2d ago•31 comments

Show HN: AI search for every photo and every frame of video on macOS

https://github.com/allenv0/SCM
135•allenleee•14h ago•64 comments

Demystifying Tufte's data-ink ratio – Tufte's Razor

https://tuftesrazor.scienceux.org/
3•s4074433•2d ago•0 comments

Bill Draper has died

https://www.nytimes.com/2026/09/30/technology/william-draper-dead.html
68•bookofjoe•11h ago•17 comments

Why don't more developers “use the platform”?

https://nolanlawson.com/2026/10/03/why-dont-more-developers-use-the-platform/
272•vinhnx•20h ago•285 comments

'Neanderthals Among Us' review

https://www.historytoday.com/archive/review/neanderthals-among-us-peter-sahlins-review
52•pepys•1d ago•46 comments

Declaring a bird extinct: The median wait is 36 years after the last sighting

https://birdshistory.com/how-long-to-declare-a-bird-extinct/
18•Heidi_70•1d ago•7 comments

What is going on with ceiling fans

https://mcmansionhell.com/post/829127919552151552/what-is-going-on-with-ceiling-fans
189•colinprince•3d ago•160 comments

The work by Valve's Timur Kristóf on improving old AMD GPUs on Linux

https://www.phoronix.com/news/XDC-2026-Valve-Timur-AMDGPU
456•speckx•1d ago•92 comments

Show HN: Build with Python – a beginner course where your code draws

https://scimigo.com/en/learn/build-with-python/01-draw-with-python
21•davidwshao•5h ago•6 comments

In the wake of closure, a digital archive of animated materials appears online

https://filmstories.co.uk/news/tippett-studios-in-the-wake-of-its-closure-a-digital-archive-of-an...
5•rdmuser•3h ago•1 comments

Agents don't need memory, they need documentation

https://liao.gg/blog/agents-dont-need-memory
344•kmeh•1d ago•210 comments

cp: -r or -R?

https://movq.de/blog/postings/2026-09-30/0/POSTING-en.html
81•zdw•4d ago•93 comments

Surely you have ultra-wideband radios on your bins too?

https://sjg.io/writing/binrange-have-you-actually-put-the-bins-out/
125•simonjgreen•1d ago•70 comments

Interview with Chicken Scheme Maintainer Sjamaan/Peter Bex

https://alexalejandre.com/interviews/peter-bex/
4•veqq•2d ago•1 comments

Emitting metadata early makes building/checking Rust up to twice as fast

https://github.com/PowderworksCode/headstart
123•knuckleheads•17h ago•30 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?