frontpage.
newsnewestaskshowjobs

Open Source @Github

fp.

Pre-auth RCE in Nginx HTTP/2 handling

https://www.wiz.io/blog/nginx-http2-rce-vulnerabilities
98•speedping•55m ago•29 comments

Quad9 Is Leaving France: Why DNS Resolvers Are the Wrong Place to Fight Piracy

https://techstackups.com/articles/quad9-leaves-france-dns-blocking/
284•ritzaco•2h ago•68 comments

'Human' Is Cambridge Dictionary's Word of the Year 2026

https://www.cam.ac.uk/news/cambridge-dictionary-reveals-word-of-the-year-2026
78•DeepLogin•1h ago•54 comments

Deutsche Bank

https://www.inside-db.com/
39•gyre007•36m ago•4 comments

U.S. AirForce is looking for old storage Media (CF or PC cards)

https://sam.gov/workspace/contract/opp/8948e8601e964c6aba9c801eee16b1be/view
26•birdboat00•39m ago•0 comments

Energy-Based Reasoners: 385x more efficient inference

https://energy-based-reasoners.github.io/
228•frenchmajesty•6h ago•33 comments

The x86 CPU: From 4004 to 486

https://pikuma.com/blog/history-of-x86-4004-to-486
19•ibobev•1h ago•2 comments

A Perfect SimCity

https://www.jeffquast.com/post/a-perfect-simcity/
167•mariuz•3d ago•66 comments

Google's AI answers reducing search traffic by 40%

https://revscope.co/blog/search-seo-geo-2026/
626•slashdev•15h ago•474 comments

A Primer on Fourier Series

https://arxiv.org/abs/2510.18203
11•teleforce•1h ago•0 comments

Show HN: Type Fighter 2

https://typefighter2.com/
71•torumitch•5h ago•36 comments

ID.me terms required for IRS sign-in

https://consumerrights.wiki/w/ID.me_terms_required_for_IRS_sign-in
446•DeepLogin•15h ago•232 comments

Energy drinks linked to 11 times more reports of cardiac arrest

https://www.sciencedaily.com/releases/2026/11/261110042543.htm
83•wjSgoWPm5bWAhXB•2h ago•42 comments

Evidence (YC S21) Is Hiring

https://www.ycombinator.com/companies/evidence/jobs/1xb9PpP-founding-gtm-lead
1•amcaskill•4h ago

When AI Knows More Than It Can Offer

https://medium.com/@smoking2man/when-ai-knows-more-than-it-can-offer-how-training-turns-an-intell...
61•Aldus551•3d ago•29 comments

Why is Gemini 4 Carbon taking so long?

https://kernel.dev/blog/why-is-gemini-4-carbon-taking-so-long/
222•deenadz•12h ago•115 comments

IPv6 delegation, an unusually subtle failure mode

https://savyasacheejha.com/posts/why-odhcpd/
49•genghizkhan•2d ago•32 comments

New FreeBSD Pkgbase(8) Tool

https://vermaden.wordpress.com/2026/11/10/freebsd-pkgbase-update-tool/
6•vermaden•2d ago•1 comments

Microsoft's ONNX Runtime has disappeared from GitHub

https://github.com/microsoft/onnxruntime
420•nvader•16h ago•86 comments

My Emacs 31 contributions

https://xenodium.com/my-emacs-31-contributions
91•xenodium•2d ago•11 comments

Archive Team is archiving the Apple Support Community

https://wiki.archiveteam.org/index.php/Apple_Discussions
249•digitaldragon•16h ago•101 comments

Java4Shell: RCE in OpenJDK when processing Base64

https://calif.io/java4shell/
1110•werrett•19h ago•297 comments

Harvard researchers find AI coding agents shifted the bottleneck to code review

https://complexdiscovery.com/harvard-researchers-find-ai-coding-agents-shifted-the-bottleneck-to-...
284•judahmeek•18h ago•368 comments

Poland says it thwarted false flag operation near border with Kaliningrad

https://www.yahoo.com/news/world/articles/russia-reportedly-planned-mass-casualty-090500574.html
45•ilamont•56m ago•2 comments

Phrack 73

https://phrack.org/issues/73/introduction_md
445•notmine1337•21h ago•64 comments

350 years ago, Ole Rømer discovered that light has a finite speed

https://www.sciencenorway.no/culture-history-history-of-science/350-years-ago-this-man-discovered...
389•dxs•20h ago•127 comments

MAI Code 2 and Code 2 Flash

https://microsoft.ai/news/introducing-mai-code-2-and-mai-code-2-flash/
400•lemonish97•21h ago•161 comments

Claude was trained on protein sequences at scale

http://xinmingtu.cn/blog/2026/claude-opus-5-5-protein-sequences/
130•gmays•12h ago•57 comments

jQuery 4.1.0

https://github.com/jquery/jquery/releases/tag/4.1.0
361•petecooper•20h ago•189 comments

Can Peer Review Survive AI-Generated Text? [pdf]

https://www.sas.upenn.edu/~jesusfv/Peer_Review.pdf
57•torutofu•2h ago•66 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?