frontpage.
newsnewestaskshowjobs

Open Source @Github

fp.

Java4Shell: RCE in OpenJDK when processing Base64

https://calif.io/java4shell/
933•werrett•12h ago•239 comments

ID.me terms required for IRS sign-in

https://consumerrights.wiki/w/ID.me_terms_required_for_IRS_sign-in
355•DeepLogin•8h ago•161 comments

Quad9's withdrawal from France: A canary in the coal mine

https://blog.cloudflare.com/quad9-withdrawal-from-france/
593•subset•11h ago•191 comments

Google's AI answers reducing search traffic by 40%

https://revscope.co/blog/search-seo-geo-2026/
381•slashdev•9h ago•291 comments

Nvidia stopped disclosing Singapore sales as revenues hit $104B

https://www.ft.com/content/dbde7a30-548c-4f9d-a4be-7898a0c24dcf
541•louiereederson•16h ago•243 comments

Why is Gemini 4 Carbon taking so long?

https://kernel.dev/blog/why-is-gemini-4-carbon-taking-so-long/
93•deenadz•5h ago•45 comments

Talos Linux

https://www.siderolabs.com/talos-linux
29•SweetSoftPillow•1h ago•17 comments

Microsoft's ONNX Runtime has disappeared from GitHub

https://github.com/microsoft/onnxruntime
318•nvader•10h ago•70 comments

Interviewed at a YC startup, found out they used my LinkedIn without permission

https://reddit.com/r/recruitinghell/comments/1xyr6ml/interviewed_at_a_yc_startup_spent_30_hours/
392•throwawaysleep•4h ago•99 comments

Archive Team is archiving the Apple Support Community

https://wiki.archiveteam.org/index.php/Apple_Discussions
190•digitaldragon•10h ago•66 comments

Highly classified US national security communications network goes down

https://www.cnn.com/2026/11/17/politics/highly-classified-national-security-communications-networ...
576•monkeydust•18h ago•664 comments

AI is killing All About Berlin

https://nicolasbouliane.com/blog/death-by-ai
315•grey-area•3h ago•278 comments

Why Fibonacci?

https://www.evilgeniuslabs.org/why-fibonacci
35•_Microft•4h ago•2 comments

MAI Code 2 and Code 2 Flash

https://microsoft.ai/news/introducing-mai-code-2-and-mai-code-2-flash/
358•lemonish97•15h ago•154 comments

350 years ago, Ole Rømer discovered that light has a finite speed

https://www.sciencenorway.no/culture-history-history-of-science/350-years-ago-this-man-discovered...
331•dxs•14h ago•102 comments

Claude was trained on protein sequences at scale

http://xinmingtu.cn/blog/2026/claude-opus-5-5-protein-sequences/
50•gmays•6h ago•25 comments

Phrack 73

https://phrack.org/issues/73/introduction_md
379•notmine1337•15h ago•53 comments

jQuery 4.1.0

https://github.com/jquery/jquery/releases/tag/4.1.0
319•petecooper•13h ago•164 comments

Harvard researchers find AI coding agents shifted the bottleneck to code review

https://complexdiscovery.com/harvard-researchers-find-ai-coding-agents-shifted-the-bottleneck-to-...
179•judahmeek•12h ago•251 comments

Flattening Every Memory Peak in Long-Context Mixture-of-Experts Training

https://arxiv.org/abs/2609.14306
4•gmays•3d ago•0 comments

Australia's full national topographic library at your fingertips

https://www.ga.gov.au/news/australias-full-national-topographic-library-at-your-fingertips
14•bryanrasmussen•2h ago•8 comments

GPT‑6.2 Astra and Sol

https://openai.com/index/introducing-gpt-6-2-astra-sol/
1272•jasondavies•16h ago•792 comments

Solid 2.0

https://www.solidjs.com/blog/solid-2-0-the-long-hold/
310•pier25•14h ago•94 comments

Cerebras Disaggregated Inference

https://www.cerebras.ai/blog/cerebras-launches-disaggregated-inference
80•emschwartz•8h ago•19 comments

What is the best harness for each model?

https://runta.com/blog/introducing-frontierharness-eval-v1-1/
373•Edward40•18h ago•126 comments

Fun with Constrained Programming (2012)

https://blog.cmpxchg8b.com/2012/09/fun-with-constrained-programming.html
72•colejohnson66•3d ago•3 comments

Show HN: Unref – A Python dead code finder built on Ruff's parser

https://github.com/Apakottur/unref
24•McAvey•1d ago•3 comments

Tencent Hy4 Flash

https://hy.tencent.ai/research/hy4-flash
123•lyra1337•12h ago•22 comments

Web Browser Engineering (2021)

https://browser.engineering/
173•ibobev•13h ago•25 comments

Launch HN: StarSling (YC P25) – Self-improving CI for agent-volume repos

https://starsling.dev
67•yonasb•14h ago•38 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.