frontpage.
newsnewestaskshowjobs

Open Source @Github

fp.

Anthropic employee claims general proof of the Riemann Hypothesis [pdf]

https://alpo.ge/remark.pdf
507•iamronaldo•1h ago•253 comments

If you can't explain something in simple terms, you don't understand it (2017)

https://kottke.org/17/06/if-you-cant-explain-something-in-simple-terms-you-dont-understand-it
302•sammatilda•5h ago•181 comments

Frostbite: A new CPU architecture discovered, designed and verified by AI

https://architectlabs.com/blog/frostbite
371•shioyama•5h ago•241 comments

Show HN: I made an audio-to-MIDI model 60x more efficient

https://kobi.music/research/dettato
71•hidude562•3d ago•15 comments

Floppy3.5: A portable 3.5-inch floppy WiFi NAS

https://github.com/bigcrimping/floppy3.5
64•fortran77•1d ago•15 comments

Signal Is Serious About Protecting Your Privacy

https://signal.org/blog/protecting-your-privacy/
128•dotcoma•5h ago•44 comments

The Making of Oxygene

https://jeanmicheljarre.com/aaa/the-making-of-oxygene
115•hggh•4h ago•42 comments

Show HN: Fast deterministic natural language search for OpenStreetMap data

https://hippomaps.ch/?q=cafes+by+the+Limmat+100+m+from+the+lake+in+zurich#map=15.02/47.36708/8.54935
75•vihren•1d ago•24 comments

The G1 Garbage Collector

https://dev.java/learn/jvm/tool/garbage-collection/g1gc-overview/
14•ejboy•3d ago•3 comments

Show HN: Tinnitus frequency finder and audio notch tool

https://trynotched.com/find
93•brianrhea•2d ago•54 comments

OpenSSL: Buffer overflow in EVP_EncodeBlock() (CVE-2026-121481, CVSS 9.8)

https://github.com/openssl/openssl/pull/33652
326•JacobHenner•13h ago•274 comments

What people are building, discovered through new domains

https://startups.novumsignals.com/
99•walterschnitzel•5h ago•46 comments

Global stock markets slump as Anthropic's record IPO fails to stem AI sell-off

https://www.theguardian.com/business/2026/nov/20/global-stock-markets-slump-anthropic-ipo-ai-sell...
74•cdrnsf•2h ago•41 comments

Carnival Cruises emits ten times more sulphur oxide than all of Europe's cars (2019)

https://ecohustler.com/article/one-corporation-to-pollute-them-all/
329•sammatilda•6h ago•186 comments

I can’t believe it’s 1!

https://aperiodical.com/2026/11/i-cant-believe-its-1/
30•ColinWright•3d ago•27 comments

If you stop writing code, you also get worse at reviewing it

https://cekrem.github.io/posts/if-you-stop-writing-code-you-also-get-worse-at-reviewing-it/
94•theanonymousone•2h ago•25 comments

FFmpeg 9.1 'Gauss'

https://ffmpeg.org/download.html#release_9.1
229•gyan•11h ago•32 comments

UK fridges secured from hackers

https://www.bbc.co.uk/news/articles/c6eq49zyx7p4o
104•tomnext•5h ago•91 comments

Why there are still no non-WebKit browsers on iOS

https://blog.mozilla.org/en/mozilla/internet-policy/apple-ios-browser-engine-rules/
13•lapcat•27m ago•2 comments

µ-Wire – USB on an ATtiny 10

https://cpldcpu.com/2014/03/19/%c2%b5-wire-usb-on-an-attiny-10/
84•mofosyne•2d ago•10 comments

Postgres 19 Repack: Faster, Built-In Table Bloat Cleanup

https://www.snowflake.com/en/blog/engineering/postgres-19-repack-table-bloat/
150•craigkerstiens•12h ago•26 comments

Why the Airbus A321XLR often gets stuck climbing for first few hours of flight

https://simpleflying.com/airbus-a321xlr-often-stuck-climbing-1st-few-hours-flight/
58•edward•6d ago•43 comments

The Strongest Sokoban Solver

https://healeycodes.com/introducing-the-worlds-strongest-sokoban-solver
110•ibobev•3d ago•23 comments

How to CAD Almost Anything

https://ocw.mit.edu/courses/res-16-002-how-to-cad-almost-anything-january-iap-2024/
332•o4c•3d ago•113 comments

"I can tell you wrote this yourself"

https://em-online.bearblog.dev/i-can-tell-you-wrote-this-yourself/
317•BrunoBernardino•8h ago•303 comments

PostgreSQL 19

https://www.postgresql.org/docs/release/19.0/
307•linzhangrun•11h ago•18 comments

What Comes After AGI?

https://institute.deepmind.com/essays/what-comes-after-agi/
121•jdkee•12h ago•230 comments

Jujutsu Primer

https://ethanlowman.com/posts/jj-primer/
184•renehsz•9h ago•123 comments

Vint Cerf on why TCP/IP was never patented

https://seremot.com/p/vint-cerf-on-why-tcpip-was-never
139•emot•14h ago•73 comments

Pancreatic cancer halted by virus injection in three patients

https://www.newscientist.com/article/2528235-pancreatic-cancer-halted-by-virus-injection-in-three...
843•cybermango•22h ago•147 comments
Open in hackernews

The Fastest Way yet to Color Graphs

https://www.quantamagazine.org/the-fastest-way-yet-to-color-graphs-20250512/
62•GavCo•1y ago

Comments

tonyarkles•1y ago
In case you haven't looked at the article, this is looking specifically at the Edge Coloring problem and not the more commonly known Vertex Coloring problem. Vertex Coloring is NP-complete unfortunately.
erikvanoosten•1y ago
You can convert edge coloring problems into vertex coloring problems and vice versa through a simple O(n) procedure.
meindnoch•1y ago
Wrong. You can convert edge-coloring problems into vertex-coloring problems of the so-called line graph: https://en.m.wikipedia.org/wiki/Line_graph

But the opposite is not true, because not every graph is a line graph of some other graph.

erikvanoosten•1y ago
Indeed. Thanks, I stand corrected.
tonyarkles•1y ago
Hrm... right. It's been a while. And it looks like both Vertex Coloring and Edge Coloring are both NP-complete (because of the O(n) procedure you're talking about and the ability to reduce both problems down to 3-SAT). I've started looking closer at the actual paper to try to figure out what's going on here. Thanks for the reminder, I miss getting to regularly work on this stuff.

Edit: thanks sibling reply for pointing out that it's not a bidirectional transform.

mauricioc•1y ago
For the edge-coloring problem, the optimal number of colors needed to properly color the edges of G is always either Delta(G) (the maximum degree of G) or Delta(G) + 1, but deciding which one is the true optimum is an NP-complete problem.

Nevertheless, you can always properly edge-color a graph with Delta(G) + 1 colors. Finding such a coloring could in principle be slow, though: the original proof that Delta(G) + 1 colors is always doable amounted to a O(e(G) * v(G)) algorithm, where e(G) and v(G) denote the number of edges and vertices of G, respectively. This is polynomial, but nowhere near linear. What the paper in question shows is how, given any graph G, to find an edge coloring using Delta(G) + 1 colors in O(e(G) * log(Delta(G))) time, which is linear time if the maximum degree is a constant.

Syzygies•1y ago
Yes. The article ran through this point as follows:

"In 1964, a mathematician named Vadim Vizing proved a shocking result: No matter how large a graph is, it’s easy to figure out how many colors you’ll need to color it. Simply look for the maximum number of lines (or edges) connected to a single point (or vertex), and add 1."

I keep wondering why I ever read Quanta Magazine. It takes a pretty generous reading of "need" to make this a correct statement.

JohnKemeny•1y ago
phkahler•1y ago
Is this going to lead to faster compile times? Faster register allocation...
john-h-k•1y ago
Very few compilers actually use vertex coloring for register allocation
isaacimagine•1y ago
Totally. The hard part isn't coloring (you can use simple heuristics to get a decent register assignment), rather, it's figuring out which registers to spill (don't spill registers in hot loops! and a million other things!).
NooneAtAll3•1y ago
and this post isn't even about vertex coloring
DannyBee•1y ago
No.

In SSA, the graphs are chordal, so were already easily colorable (relatively).

Outside of SSA, this is not true, but the coloring is still not the hard part, it's the easy part.

Not really. Coloring a graph is almost always talking about proper coloring, meaning that things that objects that are related receive different colors.

If you read the introduction, you'll also read that the goal is to "color each of your lines and require that for every point, no two lines connected to it have the same color."

Ps. "How many colors a graph needs" is a very well established term in computer science and graph theory.

mockerell•1y ago
I think the comment referred to the phrase „a graph needs X (colors or whatever)“. For me, this can be read two ways: 1. „a graph always needs at least X colors“ or 2. „a graph always needs at most X colors“.

Personally, I would interpret this as option 1 (and so did the comment above I assume). In that case, the statement is wrong. But I’d prefer to specify „at most/ at least“ anyways.

Or even better, use actual vocabulary. „For every graph there exists a coloring with X colors.“ or „any graph can be coloured using X colors“.

PS: I also agree with the sentiment about quanta magazine. It’s hard to get some actual information from their articles if you know the topic.

JohnKemeny•1y ago
What about this statement:

No matter how large a car is, it is easy to figure out how much money you'll need to buy it. Simply look at the price tag.

(From: No matter how large a graph is, it’s easy to figure out how many colors you’ll need to color it. Simply look for the maximum ...)

mauricioc•1y ago
Parent's point is that sometimes (but not always) the store is perfectly fine selling you a car for $1 less than what the "price tag" of Delta(G)+1 dollars asks for, so "need" is a bit inaccurate.