frontpage.
newsnewestaskshowjobs

Made with ♥ by @iamnishanth

Open Source @Github

fp.

Rob Pike's Rules of Programming (1989)

https://www.cs.unc.edu/~stotts/COMP590-059-f24/robsrules.html
693•vismit2000•9h ago•365 comments

OpenRocket

https://openrocket.info/
156•zeristor•3d ago•39 comments

Show HN: Hacker News archive (47M+ items, 11.6GB) as Parquet, updated every 5m

https://huggingface.co/datasets/open-index/hacker-news
143•tamnd•4d ago•60 comments

Wanter – A tiny, decentralised tool to explore the small web

https://susam.net/wander/
38•susam•12h ago•25 comments

2025 Turing award given for quantum information science

https://awards.acm.org/about/2025-turing
48•srvmshr•9h ago•11 comments

AI coding is gambling

https://notes.visaint.space/ai-coding-is-gambling/
192•speckx•2h ago•209 comments

Nightingale – open-source karaoke app that works with any song on your computer

https://nightingale.cafe/
410•rzzzzru•11h ago•116 comments

Nvidia NemoClaw

https://github.com/NVIDIA/NemoClaw
136•hmokiguess•4h ago•103 comments

Show HN: Playing LongTurn FreeCiv with Friends

https://github.com/ndroo/freeciv.andrewmcgrath.info
6•verelo•51m ago•0 comments

Wander – A tiny, decentralised tool (just 2 files) to explore the small web

https://susam.net/wander/
54•oystersareyum•4h ago•15 comments

Federal Cyber Experts Called Microsoft's Cloud "A Pile of Shit", yet Approved It

https://www.propublica.org/article/microsoft-cloud-fedramp-cybersecurity-government
356•hn_acker•5h ago•149 comments

Book: The Emerging Science of Machine Learning Benchmarks

https://mlbenchmarks.org/00-preface.html
11•jxmorris12•3d ago•0 comments

Machine Payments Protocol (MPP)

https://stripe.com/blog/machine-payments-protocol
96•bpierre•4h ago•49 comments

Death to Scroll Fade

https://dbushell.com/2026/01/09/death-to-scroll-fade/
273•PaulHoule•4h ago•149 comments

CVE-2026-3888: Important Snap Flaw Enables Local Privilege Escalation to Root

https://blog.qualys.com/vulnerabilities-threat-research/2026/03/17/cve-2026-3888-important-snap-f...
33•askl•4h ago•10 comments

Show HN: Tmux-IDE, OSS agent-first terminal IDE

https://tmux.thijsverreck.com
25•thijsverreck•2h ago•9 comments

Snowflake AI Escapes Sandbox and Executes Malware

https://www.promptarmor.com/resources/snowflake-ai-escapes-sandbox-and-executes-malware
179•ozgune•4h ago•53 comments

Write up of my homebrew CPU build

https://willwarren.com/2026/03/12/building-my-own-cpu-part-3-from-simulation-to-hardware/
209•wwarren•3d ago•40 comments

Using calculus to do number theory

https://hidden-phenomena.com/articles/hensels
77•cpp_frog•2d ago•15 comments

Google Engineers Launch "Sashiko" for Agentic AI Code Review of the Linux Kernel

https://www.phoronix.com/news/Sashiko-Linux-AI-Code-Review
61•speckx•3h ago•23 comments

Restoring the first recording of computer music (2018)

https://www.bl.uk/stories/blogs/posts/restoring-the-first-recording-of-computer-music
24•OJFord•4d ago•8 comments

Celebrating Tony Hoare's mark on computer science

https://bertrandmeyer.com/2026/03/16/celebrating-tony-hoares-mark-on-computer-science/
108•benhoyt•13h ago•29 comments

EU Inc.: A new harmonised corporate legal regime

https://commission.europa.eu/topics/business-and-industry/doing-business-eu/company-law-and-corpo...
25•guidoiaquinti•2h ago•6 comments

The pleasures of poor product design

https://www.inconspicuous.info/p/the-pleasures-of-poor-product-design
232•NaOH•18h ago•81 comments

A ngrok-style secure tunnel server written in Rust and Open Source

https://github.com/joaoh82/rustunnel
49•joaoh82•5h ago•21 comments

Ndea (YC W26) is hiring a symbolic RL search guidance lead

https://ndea.com/jobs/search-guidance
1•mikeknoop•12h ago

Show HN: Sub-millisecond VM sandboxes using CoW memory forking

https://github.com/adammiribyan/zeroboot
277•adammiribyan•1d ago•65 comments

Show HN: Will my flight have Starlink?

79•bblcla•2h ago•61 comments

Get Shit Done: A meta-prompting, context engineering and spec-driven dev system

https://github.com/gsd-build/get-shit-done
421•stefankuehnel•23h ago•233 comments

Python 3.15's JIT is now back on track

https://fidget-spinner.github.io/posts/jit-on-track.html
461•guidoiaquinti•1d ago•279 comments
Open in hackernews

2025 Turing award given for quantum information science

https://awards.acm.org/about/2025-turing
48•srvmshr•9h ago
https://blog.computationalcomplexity.org/2026/03/bennett-and...

https://www.quantamagazine.org/quantum-cryptography-pioneers...

https://www.nytimes.com/2026/03/18/technology/turing-award-w...

https://www.wired.com/story/a-quantum-leap-for-the-turing-aw...

Comments

srvmshr•9h ago
* From the announcement [0]:

ACM has named Charles H. Bennett and Gilles Brassard as the recipients of the 2025 ACM A.M. Turing Award for their essential role in establishing the foundations of quantum information science and transforming secure communication and computing.

* An accessible news excerpt via CNN science [1]

Years before emails, internet banking, cloud servers and cryptocurrency wallets, two scientists devised a way to keep secrets perfectly safe and indecipherable to eavesdropping outsiders.

Their 1984 work depended on the hidden, counterintuitive world of quantum physics, which governs the way the world works at the smallest, subatomic scale, rather than complex but theoretically breakable mathematical codes to secure data.

The insights of Charles Bennett, an American physicist who is a fellow at IBM Research, and Gilles Brassard, a Canadian computer scientist and professor at the University of Montreal, have since transformed cryptography and computing. The pair received the A.M. Turing Award on Wednesday for their groundbreaking work on quantum key cryptography.

[0] https://www.acm.org/media-center/2026/march/turing-award-202...

[1] https://edition.cnn.com/2026/03/18/science/quantum-key-crypt...

rvz•9h ago
Well deserved and much needed recognition in quantum key cryptography, for once not a single mention of "AI" anywhere.

Congratulations to Charles Bennett and Gilles Brassard.

MeteorMarc•1h ago
Really curious, not a critique: apart from the idea of the possibility of intrusion detection due to the quantum nature of the communication link, what is special about the protocol that is mentioned?
bawolff•1h ago
> Bennett and Brassard, with Ethan Bernstein and Umesh Vazirani, showed that in black-box setting, quantum computers would require big-omega(sqrt(n)) queries to search n entries, matching Grover's algorithm. For some reason, the popular press rarely covers these results that limit the power of quantum computing.

This is mentioned almost as a footnote, but to (layman) me seems much more important than QKD, especially from a comp sci perspective instead of a physics perspective.

shemnon42•45m ago
QKD can be sold today.

The quantum computers are not quite large enough to search at an `n` such that O(n)` is not viable but `O(sqrt(n))` is, that's where there's money to be made, especially if viability is defined by small time horizons. So it's a footnote for the future.

bawolff•37m ago
> QKD can be sold today.

It can, but it isn't largely because the classical solutions solve the problem better and you usually have to resort to classical solutions to solve MITM anyways afaik. However my point is less about practicality and more QKD seems more like a physics or engineering thing and not a computer science thing.

After all, this is supposed to be a computer science prize not a make money prize, so which is more sellable should be besides the point.

shorden•2m ago
Worth noting that this is a bound on arbitrary search, but there exist some problems with structure (e.g. integer factorization) for which quantum algorithms are exponentially faster than known classical algorithms (a problem believed to be in NP and BQP but not P).
DrNosferatu•1h ago
The math might be beautiful, but I'm very skeptical - practical - quantum computers will ever deliver their promise.
spot5010•33m ago
As a young grad student, I remember going to a talk by Bennett where he explained how a Quantum Computer allows manipulation in a 2^N dimensional hilbert space, while the outputs measurements give you only N bits of information. The trick is to somehow encode the result in the final N bits.

I felt this was a much better layman explanation of what a quantum computer does than simply saying a quantum computer runs all possible paths in parallel.

aleph_minus_one•19m ago
> I felt this was a much better layman explanation of what a quantum computer does than simply saying a quantum computer runs all possible paths in parallel.

Relevant concerning your point:

> "The Talk"

> https://www.smbc-comics.com/comic/the-talk-3

RRRA•3m ago
That's 2 Turing award for the Université de Montréal in 6 years. Sadly, I never had those 2 teachers during my years there!

I did see Gilles' lunch talks though, it was really insightful!