frontpage.
newsnewestaskshowjobs

Open Source @Github

fp.

Gemini 4 Neon

https://blog.google/innovation-and-ai/models-and-research/gemini-models/introducing-gemini-4-neon/
134•yigitdemirag•25m ago•93 comments

Unauthenticated remote code execution in Nginx

https://www.wiz.io/blog/nginx-http2-rce-vulnerabilities
902•speedping•6h ago•389 comments

Seven new models at scalable price-performance

https://microsoft.ai/news/microsoft-ignite-2026/
366•gmays•5h ago•247 comments

DaisyRose-27B: 1,200-task RL took Qwen3.8 from 5.6% to 12% on Terminal-Bench 4.1

https://www.radixark.com/blog/daisyrose-27b
73•de_sty•2h ago•15 comments

Inside Deutsche Bank

https://www.inside-db.com/
453•gyre007•6h ago•155 comments

AI agents ask better questions than KPMG accountants in audit trial

https://europeanbusinessmagazine.com/ai-agents-better-questions-kpmg/
248•Betelbuddy•6h ago•120 comments

DNS resolvers are the wrong place to fight piracy

https://techstackups.com/articles/quad9-leaves-france-dns-blocking/
518•ritzaco•8h ago•180 comments

Advancing chip design with OpenAI models

https://openai.com/index/advancing-chip-design-with-our-models/
110•vighneshiyer•4h ago•58 comments

Search Browser – Minimalist WebKit browser with Chrome extension support

https://searchbrowser.app/
30•rsaz•1h ago•21 comments

Google Gemini's "Tasks" Personal Assistant Is Now Free

https://blog.google/innovation-and-ai/products/gemini-app/tasks-in-gemini-free-new-features/
33•hackeratrandom•1h ago•21 comments

Genie 4 is now available

https://blog.google/innovation-and-ai/models-and-research/google-deepmind/genie-4-now-available-p...
142•leumon•3h ago•118 comments

Show HN: ExitPath – Open-source ways out of Slack, Notion and Microsoft 365

https://exitpath-ruddy.vercel.app/
114•zerocool0101•5h ago•27 comments

The Cambridge Dictionary has named ‘human’ as the Word of the Year 2026

https://www.cam.ac.uk/news/cambridge-dictionary-reveals-word-of-the-year-2026
203•DeepLogin•7h ago•156 comments

The First Revolver: How We Got from Blackbeard's Six Pistols to the Six-Shooter

https://americanhandgunner.com/handguns/revolvers/the-first-revolver/
41•bushwart•3d ago•15 comments

The Magic of Partial Evaluation

https://jimmyhmiller.com/magic-of-partial-evaluation
70•aray07•3h ago•12 comments

Show HN: Take Voyager 1 apart, down to a single memory chip

https://rshekhar.com/voyager/
116•raj-shekhar•5h ago•25 comments

Show HN: Mastra Factory, the open-source software factory we use to build Mastra

69•codekarate•5h ago•21 comments

Cuttlefish on Mac: Android's Virtual Device Framework on Apple Silicon

https://engineering.fb.com/2026/11/13/android/cuttlefish-on-mac/
6•acossta•3d ago•0 comments

KVM: x86: Unconditionally reset MMU context when emulating INIT (CVE-2026-99312)

https://www.cve.org/CVERecord?id=CVE-2026-99312
154•Kozmik1•5h ago•109 comments

F-22 Next-Generation micro–Data Transfer Cartridge (mDTC)

https://sam.gov/workspace/contract/opp/8948e8601e964c6aba9c801eee16b1be/view
129•birdboat00•6h ago•84 comments

CrossPoint Reader

https://crosspointreader.com
67•kristianpaul•4h ago•38 comments

The x86 CPU: From 4004 to 486

https://pikuma.com/blog/history-of-x86-4004-to-486
120•ibobev•7h ago•33 comments

A live service duress prototype

https://github.com/Ymsniper/vault-share
11•Ymsniper•3d ago•0 comments

When Free Software Isn't Free Enough

https://foss.life/notes/2026/free-software-isnt-free-enough/
34•hn_acker•3h ago•28 comments

Sexp Matrix

https://lisper.cc/ideas/entangle.html
18•todsacerdoti•1h ago•3 comments

Evidence (YC S21) Is Hiring

https://www.ycombinator.com/companies/evidence/jobs/1xb9PpP-founding-gtm-lead
1•amcaskill•9h ago

Launch HN: Maritime (YC F26) – A managed cloud for production AI agents

31•ashriv•4h ago•25 comments

Energy-Based Reasoners: 385x more efficient inference

https://energy-based-reasoners.github.io/
291•frenchmajesty•12h ago•48 comments

A Primer on Fourier Series (2025)

https://arxiv.org/abs/2510.18203
92•teleforce•7h ago•23 comments

Octopus, Gecko and Tortoise: the 3 scanners hunting your AI keys

https://tin.computer/blog/fake-ai-crawler-secrets-scanners
18•demegire•3h ago•2 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.