frontpage.
newsnewestaskshowjobs

Open Source @Github

fp.

Kimi K3.1 Pro and K3.1 Pro Highspeed

https://www.kimi.ai/blog/kimi-k3-1-pro
451•Jowsey•3h ago•256 comments

Today, we hacked what we'd set out to hack: the iPhone

https://blog.calif.io/p/iphone
537•pavel_lishin•3h ago•356 comments

Apple Music 404 Not Found

https://music.apple.com/this-url-doesnt-exist
222•frizlab•7h ago•73 comments

Kimi K3.1 scores 55 on Artificial Analysis, placed on the Pareto line

https://artificialanalysis.ai/models/kimi-k3-1-pro
87•theanonymousone•1h ago•11 comments

Local Wikipedia: Wikipedia, but only for things a half hour walk from you

https://edjefferson.com/localwiki/
1074•sohkamyung•21h ago•210 comments

The Real Kevin Bacon

https://pudding.cool/2026/10/kevin-bacon/
143•xnx•3d ago•41 comments

How is music possible

https://www.henrikkarlsson.xyz/p/music
57•rafaelc•3h ago•37 comments

UUIDv7 doesn't have the properties you think it does

https://alexsci.com/blog/uuidv7-is-weird/
70•ibobev•3h ago•54 comments

Canadians are running out of time to oppose Bill C-22

https://www.eff.org/deeplinks/2026/10/canadians-are-running-out-time-oppose-dangerous-c-22-survei...
181•hn_acker•21h ago•72 comments

Air Purifiers as White Noise Machines

https://www.jefftk.com/p/air-purifiers-as-white-noise-machines
33•luu•2h ago•32 comments

I turned my TV into a Game Boy Color with a Pokemon town as my home screen

https://twitter.com/robbietilton/status/2111936458923851923
36•scrambled•2h ago•8 comments

Reforming English Spelling

https://blog.oup.com/2026/10/reforming-english-spelling/
10•jruohonen•4h ago•10 comments

Dessa: the most authentic full-duplex speech model ever built

https://block.xyz/dessa
10•dsr12•1h ago•0 comments

Docker is weird

https://codeandcake.dev/posts/2026-10-22-docker-is-weird
804•psxuaw•20h ago•332 comments

The Missed Opportunities of Sonic 06

https://isaacmarovitz.com/posts/sonic-06/
47•ibobev•3h ago•9 comments

Show HN: Impossible Machines: declaratively program the physical world

https://www.impossiblemachines.xyz
41•bhaprayan•20h ago•10 comments

Time Nuts (2005)

http://leapsecond.com/time-nuts.htm
22•jacquesm•3h ago•19 comments

LISP Comes of Age (1980)

https://microship.com/lisp-comes-of-age/
42•so-cal-schemer•1d ago•14 comments

Total Historian

https://www.theideasletter.org/essay/total-historian/
17•benbreen•3h ago•3 comments

Show HN: Swurf – Swipe through the real web

https://swurf.org/
27•webtjb096•13h ago•11 comments

Animations for System Builders

https://brooker.co.za/blog/2026/10/23/animations.html
12•KraftyOne•3h ago•1 comments

Job loss and cortisone mania

https://tilschuenemann.de/job-loss-cortisone-mania
147•speckx•9h ago•79 comments

Ask HN: If the models are so good, why doesn't OpenAI just start 100 companies?

518•ex-aws-dude•23h ago•566 comments

Gemma-4-26B-A4B with 39-69% less thinking at same accuracy

https://bottlecapai.com/post/thinkingcap-gemma-4-26b/
70•armcat•5h ago•10 comments

The foolishness of "natural language programming" (1978)

https://www.cs.utexas.edu/~EWD/transcriptions/EWD06xx/EWD667.html
343•xiaoyu2006•19h ago•231 comments

Can we replace a $150k Looker with a bucket of HTML files?

https://david.lequin.dev/blog/bi-software-is-dead/
63•skadamat•2h ago•44 comments

Show HN: OnKey – I'm a bad singer, so I built an app to show where I'm off-key

https://github.com/dsmurrell/onkey
189•dsmurrell•1d ago•81 comments

The alien space of science: Coherent but cognitively unavailable directions

https://arxiv.org/abs/2603.01092
188•martincsweiss•1d ago•74 comments

We have traits at home

https://www.axelmagn.com/blog/202610-zig-traits/
37•Ygg2•20h ago•12 comments

How does Fable 5.1 hide messages in images?

https://www.lesswrong.com/posts/WHEQps5PK8LrrcTAb/how-does-fable-5-1-hide-messages-in-images
187•gmays•22h ago•67 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?