frontpage.
newsnewestaskshowjobs

Open Source @Github

fp.

Mesh LLM: distributed AI computing on iroh

https://www.iroh.computer/blog/mesh-llm
140•tionis•5h ago•32 comments

We Know Simple Fluids Can Flow. Turns Out, Some Can Fracture

https://www.quantamagazine.org/we-know-simple-fluids-can-flow-turns-out-some-can-fracture-20260710/
26•Anon84•1h ago•5 comments

A pure scheme web programming tool

https://goeteia.dev
33•guenchi•2h ago•13 comments

Show HN: Ant – A JavaScript runtime and ecosystem

https://antjs.org
206•theMackabu•7h ago•86 comments

A dock that wakes up reliably

https://fabiensanglard.net/tb4/index.html
42•ingve•3h ago•31 comments

RISCBoy is an open-source portable games console, designed from scratch

https://github.com/Wren6991/RISCBoy
75•mariuz•5h ago•17 comments

I Did Not Kill Stanley Lieber: How to Draw (With 9front)

https://triapul.cz/automa/i_did_not_kill_stanley_lieber
24•c-c-c-c-c•2d ago•3 comments

The Energetic Costs of Cellular Computation (2012)

https://arxiv.org/abs/1203.5426
9•lioeters•1h ago•1 comments

Nvidia, CoreWeave, and Nebius: Inside the Circular Financing of the GPU Boom

https://io-fund.com/ai-stocks/nvidia-coreweave-nebius-circular-financing-gpu-boom
182•adletbalzhanov•10h ago•62 comments

What xAI's Grok Build CLI Actually Sends to xAI

https://gist.github.com/cereblab/dc9a40bc26120f4540e4e09b75ffb547
101•jhoho•2h ago•52 comments

A Erlang style pure Scheme Webserver and further

https://igropyr.com
12•guenchi•2h ago•1 comments

Billions of Sketches Reveal Hidden Cultural Variation in Human Concepts

https://arxiv.org/abs/2607.07267
63•Anon84•2d ago•8 comments

We scaled PgBouncer to 4x throughput

https://clickhouse.com/blog/pgbouncer-clickhouse-managed-postgres
187•saisrirampur•12h ago•38 comments

UPI: Anatomy of a Payment Transaction

https://timeseriesofindia.com/economy/reads/upi-architecture/
121•prtk25•11h ago•45 comments

Jellyfish Undersea Roundabout

https://visitfaroeislands.com/en/plan-your-stay/getting-around/world-first-under-sea-roundabout
8•hydrogen7800•3d ago•0 comments

Long Covid May Physically Damage the Nerves That Control the Stomach

https://www.ijidonline.com/article/S1201-9712(26)00608-9/fulltext
65•thenerdhead•3h ago•34 comments

The early History of the Singular Value Decomposition (1993) [pdf]

https://www.math.ucdavis.edu/~saito/courses/229A/stewart-svd.pdf
99•wolfi1•12h ago•60 comments

Show HN: Quantum-Qec / Matrix-Free Quantum Homeostatic Engine(Blueprint)

https://github.com/PJHkorea/quantum-mesh-qec
3•PJHkorea•1h ago•2 comments

An agent in 100 lines of Lisp

https://thebeach.dev/posts/lisp-agent/
50•jamiebeach•4d ago•1 comments

Prefer strict tables in SQLite

https://evanhahn.com/prefer-strict-tables-in-sqlite/
236•ingve•10h ago•118 comments

Doctors die. It's not like the rest of us, but it should be (2016)

https://archive.cancerworld.net/featured/how-doctors-die/
100•downbad_•4h ago•59 comments

Biff.graph: structure your Clojure codebase as a queryable graph

https://github.com/jacobobryant/biff/tree/v2.x/libs/graph
92•jacobobryant•4d ago•9 comments

Show HN: Learn by rebuilding Redis, Git, a database from scratch

https://shipthatcode.com
137•acley•14h ago•39 comments

Optimization Solver as a Service

https://www.quicopt.com/developer/getting-started/
21•paddi91•3d ago•12 comments

Martha Lillard, last US polio patient using iron lung, dies at 78 in Oklahoma

https://abcnews.com/US/wireStory/martha-lillard-us-polio-patient-iron-lung-dies-134668491
42•daniel_iversen•3h ago•6 comments

Show HN: Sqlsure – deterministic semantic checks for AI-generated SQL

https://github.com/sqlsure/sqlsure
23•tejusarora•7h ago•3 comments

How to Achieve Pruning When Querying by Non-Partitioned Columns in PostgreSQL

https://hakibenita.com/postgresql-partition-pruning
8•theanonymousone•2d ago•1 comments

Sixtyfour (YC P25) Is Hiring

https://www.ycombinator.com/companies/sixtyfour/jobs/bIbgQkL-operations-associate-data-samples-cu...
1•HPMOR•10h ago

ZeroFS vs. Amazon S3 Files

https://www.zerofs.net/blog/zerofs-vs-aws-s3-files/
68•cbrewster•9h ago•16 comments

Show HN: Orbit – AR satellite tracker, watch 15k+ objects

https://nagylukas.github.io/orbit.html
64•lukas9•11h ago•17 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?