frontpage.
newsnewestaskshowjobs

Open Source @Github

fp.

ChatGPT is adding real cartoonists' signatures to fake New Yorker cartoons

https://www.niemanlab.org/2026/10/chatgpt-is-adding-real-cartoonists-signatures-to-fake-new-yorke...
274•rdmuser•3h ago•151 comments

Beam: Reflection's 501B open-weight model

https://reflection.ai/blog/introducing-beam
320•Philpax•7h ago•91 comments

Find the flattest route between any two points in SF

https://flattensf.com/
114•ishan0102•4h ago•41 comments

Dust: Pretraining Transformers Without Backpropagation

https://qlabs.sh/research/dust
111•E-Reverance•5h ago•18 comments

AI Tutoring with Khanmigo in a Two-Year School Experiment

https://edworkingpapers.com/ai26-1551
31•bryan0•2h ago•22 comments

Example.com Just Launched the Biggest Redesign in Decades

https://www.debugbear.com/blog/example-dot-com-redesign-history
91•jgx0•3h ago•57 comments

Friendship ended with Deno, now Node is my best friend

https://dbushell.com/2026/10/03/deno-to-node/
64•ibobev•3h ago•12 comments

Opus 5.5 agents discover two room-temperature magnetic semiconductor candidates

https://www.vals.ai/blogs/room-temperature-magnetic-semiconductors
219•outlier99•5h ago•163 comments

Samon: Designing a Zen Garden Raking Puzzle

https://gwern.net/doc/design/2026-10-03-gwern-samon.html
20•networked•2h ago•7 comments

An Algorithmic Failure Beneath the Secret Ballot

https://blog.citp.princeton.edu/2026/08/03/an-algorithmic-failure-beneath-the-secret-ballot/
30•leecoursey•2d ago•9 comments

Worth Building

https://armstr.ng/writing/worth-building
39•colinarms•3h ago•29 comments

Web Search API

https://developers.cloudflare.com/changelog/post/2026-10-02-introducing-web-search-api/
490•tosh•15h ago•222 comments

Ephemeral Testing

https://lemire.me/blog/2026/10/05/ephemeral-testing/
35•ibobev•3h ago•12 comments

Using Blu-ray M-Disk as backup of last resort

https://smyck.net/2026/10/03/holocron-the-backup-of-last-resort/
64•hukl•1d ago•60 comments

Competitive Programmer's Handbook (2018) [pdf]

https://cses.fi/book/book.pdf
123•vinhnx•2d ago•27 comments

DEDA – Tracking Dots Extraction, Decoding and Anonymisation Toolkit

https://github.com/dfd-tud/deda
32•greyface-•1d ago•4 comments

Anthropic reported diary entry to police, woman faces felony charge

https://www.techspot.com/news/114091-florida-woman-used-claude-diary-anthropic-reported-shoot.html
560•emptybits•20h ago•471 comments

Testing 12 different Zigbee temperature/humidity sensors

https://smarthomescene.com/reviews/best-selling-zigbee-temperature-sensors-tested/
38•walrus01•1d ago•7 comments

Global Solar Atlas: summary of solar power potential globally

https://globalsolaratlas.info/
14•stratts•3h ago•9 comments

Texas city demands $2M for public records on Flock usage

https://arstechnica.com/tech-policy/2026/10/texas-city-demands-2m-for-public-records-on-flock-usage/
106•01-_-•4h ago•15 comments

Unruly Folded Sheets

https://literaryreview.co.uk/unruly-folded-sheets
4•Thevet•1d ago•0 comments

Better Space-Time Trade-Offs for LSM-Tree Based Key-Value Stores [pdf]

https://nivdayan.github.io/dostoevsky.pdf
17•ibobev•3h ago•0 comments

Making a GTK application in Haskell, part 1

https://floreal.tech/blog/2026/making-a-gtk-app-in-haskell-part-1/
135•Vosporos•11h ago•33 comments

Learning Jazz Pianist Style with Cross-Attention Conditioning

https://almostimplemented.github.io/jazz-pianist-style/
21•ishan0102•3h ago•2 comments

High Diesel Prices Bankrupted 16 Trucking Companies in Just 30 Days

https://www.thedrive.com/news/high-diesel-prices-bankrupted-16-trucking-companies-in-just-30-days
23•speckx•1h ago•7 comments

Apple and a hacker's future

https://stratechery.com/2026/apple-and-a-hackers-future/
210•maguay•16h ago•187 comments

The lamps in my house

https://arslan.io/2026/10/05/the-lamps-in-my-house/
132•farslan•12h ago•66 comments

The Future of Mathematics

https://terrytao.wordpress.com/2026/10/05/the-future-of-mathematics/
102•smilelamp•6h ago•56 comments

Qualcomm licenses patents on Huawei’s LogicFolding chip tech

https://www.bloomberg.com/news/articles/2026-10-05/qualcomm-licenses-patents-on-huawei-s-logicfol...
176•0xedb•18h ago•117 comments

Linux containers in 500 lines of code (2016)

https://blog.lizzie.io/linux-containers-in-500-loc.html
100•mkornaukhov•12h ago•22 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?