frontpage.
newsnewestaskshowjobs

Open Source @Github

fp.

Hurried Announcement: Alessandro Masullo GRH

https://math216.wordpress.com/2026/11/20/hurried-announcement-alessandro-masullo-grh/
1712•jasondavies•9h ago•765 comments

Inkling 2 Mini

https://thinkingmachines.ai/news/inkling-2-mini/
783•jasondavies•7h ago•133 comments

Levent Alpöge claims proof of the Generalized Riemann Hypothesis [pdf]

https://alpo.ge/remark.pdf
2433•iamronaldo•13h ago•1642 comments

NINLIVE: The Nine Inch Nails live archive

https://ninlive.com/
161•CharlesW•5h ago•41 comments

We promoted developers into architects without informing them

https://manidoraisamy.com/developer-to-architect.html
338•QueensGambit•9h ago•203 comments

Unforced Navier-Stokes Singularity and the Generalized Riemann Hypothesis

https://terrytao.wordpress.com/2026/11/20/unforced-euler-singularity-unforced-navier-stokes-singu...
374•archon1410•10h ago•154 comments

Valkey kills the skiplist, cuts sorted set overhead by up to 43%

https://valkey.io/blog/from-skiplist-to-b+tree/
65•reconditerose•3d ago•29 comments

Language Models Can Rewrite Their Own Weights

https://arxiv.org/abs/2611.21885
359•lwhsiao•11h ago•113 comments

Sir Brian May adds new dimension to Hera asteroid

https://www.esa.int/articles/about-us/directorates/operations/space-safety/hera/sir-brian-may-add...
54•mooreds•4h ago•12 comments

DreamCoder: Coding harness and IDE from the author of Mastering Emacs

https://www.masteringemacs.org/article/announcing-dreamcoder
140•facundo_olano•7h ago•25 comments

Clojure will affect the way you think about programming (2017)

https://eli.thegreenplace.net/2017/clojure-the-perfect-language-to-expand-your-brain/
8•sammatilda•1h ago•0 comments

Finite-time blow-up for the Navier–Stokes equations

https://github.com/tristanbuckmaster/navier-stokes/
266•trotro•12h ago•86 comments

And yet, it moves

https://signoregalilei.com/2026/11/20/and-yet-it-moves/
115•notfried•7h ago•55 comments

Restricting AI agents in mobile operating systems platforms from capturing data

https://signal.org/blog/protecting-your-privacy/
527•dotcoma•18h ago•310 comments

Re: Riemann

https://borretti.me/article/re-riemann
170•_dain_•4h ago•161 comments

Vibecoding an inference chip

https://ankitg.me/blog/vibecoding-inference-chip/
121•ankitvgupta•9h ago•48 comments

The stochastic parrots have apparently proved the Riemann Hypothesis

https://scottaaronson.blog/?p=10344
238•stratos123•7h ago•215 comments

Serious cyberattack thought backed by wealthy operators

https://www.ruv.is/english/2026-11-20-serious-cyberattack-thought-backed-by-wealthy-operators-493411
29•Bender•4h ago•15 comments

Winedroid – run Android apps without Android (WASM demo)

https://winedroid.soham.sh/demo/
113•sohzm•8h ago•36 comments

Substrate: A Lisp for WebAssembly

https://substrate-lang.com
3•unignorant•3d ago•0 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/
95•edward•6d ago•65 comments

How to Bypass Rust's Orphan Rule

https://edvong.com/bypass-orphan-rule/
23•todsacerdoti•2d ago•3 comments

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

https://kobi.music/research/dettato
254•hidude562•4d ago•55 comments

I can’t believe it’s 1!

https://aperiodical.com/2026/11/i-cant-believe-its-1/
50•ColinWright•4d ago•55 comments

The Hungry Butler Effect: Concealed Commercial Incentives in LLMs

https://www.researchgate.net/publication/418143113_The_Hungry_Butler_Effect_Concealed_Commercial_...
21•undefinedmethod•5h ago•8 comments

US SEC's Nvidia probe is examining potential accounting issues – sources

https://www.marketscreener.com/news/us-sec-s-nvidia-probe-is-examining-potential-accounting-issue...
256•ftchd•7h ago•133 comments

I'm Peter Roberts, immigration attorney who does work for YC and startups. AMA

101•proberts•11h ago•146 comments

Integrals of Polynomials with Galois Group S_p

https://m-slee.netlify.app/posts/integrals-galois-polynomials
6•richard_chase•2h ago•1 comments

Show HN: OpenComputer – an open source alternative to Devin

https://github.com/diggerhq/opencomputer
74•iacguy•7h ago•22 comments

I Don't Trust Visual Recordings Anymore. But One Day I Will Again

https://spectrum.ieee.org/fighting-back-against-deep-fakes
10•jnord•3h ago•1 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.