frontpage.
newsnewestaskshowjobs

Open Source @Github

fp.

Anthropic’s Nasdaq debut

https://www.reuters.com/business/finance/anthropics-historic-debut-put-ais-promise-peril-wall-st-...
975•wslh•10h ago•1903 comments

Gemini 4 Neon is the new #1 on the Models Engineering Index

https://git-aarvin.github.io/mei/
203•hn-aarvin•3h ago•120 comments

Pancreatic cancer halted by virus injection in three patients

https://www.newscientist.com/article/2528235-pancreatic-cancer-halted-by-virus-injection-in-three...
636•cybermango•10h ago•100 comments

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

https://github.com/openssl/openssl/pull/33652
42•JacobHenner•1h ago•9 comments

Claude solves two open problems in the physics of black holes

https://www.anthropic.com/research/claude-black-hole-physics
417•cybermango•9h ago•187 comments

Vint Cerf on why TCP/IP was never patented

https://seremot.com/p/vint-cerf-on-why-tcpip-was-never
28•emot•2h ago•5 comments

How to CAD Almost Anything

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

Garage Door Spam

https://blog.harrison.page/garage-door-spam/
778•harrisonpage•3d ago•322 comments

Postgres 19 is out, and it's available on Neon and Databricks Lakebase

https://www.databricks.com/blog/postgresql-19-available-lakebase
18•sp_from_db•2h ago•4 comments

RegExr: Temporarily Offline

https://regexr.com/
59•somebudyelse•4h ago•28 comments

The 98% Slot Machine: How Paid Advertising Became an Extraction Tax

https://globalcommercegraph.com/writing/the-ninety-eight-percent-slot-machine
222•dev1one1•8h ago•120 comments

Synology Security Advisory

https://www.synology.com/en-uk/security/advisory/Synology_SA_26_21
116•choult•5h ago•83 comments

Launch HN: Onlook (YC W25) – An open-source developer tool for designers

https://github.com/onlook-dev/onlook/
91•D_R_Farrell•10h ago•69 comments

Someone reported java4shell bug in September 2026

https://github.com/openjdk/jdk/pull/32781
386•notmine1337•15h ago•103 comments

Should governments slow frontier AI? Jacob Coxon and Robin Hanson debate [video]

https://www.youtube.com/watch?v=lwfewYL7X0o
86•sandslash•8h ago•152 comments

Weight-Space Programming builds neural networks like a 1990s researcher

https://notesbylex.com/weight-space-programming-1990s
25•lexandstuff•2d ago•1 comments

Show HN: Cornhole News – A Hacker News inspired site for news across the Midwest

https://cornholenews.news
196•cornholemedia•11h ago•94 comments

Talking Venice with Mahesh Subramony at AMD In-Depth

https://chipsandcheese.com/p/talking-venice-with-mahesh-subramony
17•rbanffy•2d ago•0 comments

Visa, Mastercard and JPMorgan Customer Data Leaked by Hackers

https://www.wsj.com/finance/banking/visa-mastercard-and-jpmorgan-customer-data-leaked-by-hackers-...
120•mikhael•3h ago•37 comments

UK government forced to admit it issued Apple a secret encryption order

https://macanorak.com/uk-government-forced-to-admit-it-issued-apple-a-secret-encryption-order/
543•Terretta•11h ago•246 comments

Making 8-page foldable zines from a single A4 sheet in the browser

https://krthr.co/paper-folds-and-whats-new-in-fanzines-app/
258•krthr•14h ago•57 comments

Rebuilding my local voice assistant pipeline

https://blog.platypush.tech/article/Rewriting-my-voice-assistant-pipeline
69•todsacerdoti•6h ago•12 comments

IRA Velinsky, industrial designer for Commodore and Atari

https://dfarq.homeip.net/ira-velinsky-industrial-designer-of-the-commodore-64/
6•onename•1d ago•0 comments

Nintendo takes Picofly firmware down from GitHub [video]

https://www.youtube.com/watch?v=-TLCGUpoD6c
264•cowlevel•1d ago•105 comments

An Oregon library ditched Dewey Decimal and got people excited about books again

https://www.fastcompany.com/91597520/oregon-library-ditched-dewey-decimal-wayfinding-system
208•bookofjoe•2d ago•146 comments

Computer Graphics from Scratch (2021)

https://www.gabrielgambetta.com/computer-graphics-from-scratch/index.html
62•ibobev•2d ago•12 comments

How the European Commission rolled out Matrix to more than 40k staff

https://element.io/blog/how-the-european-commission-rolled-out-matrix-to-more-than-40-000-staff/
672•liotier•16h ago•327 comments

Do not buy RAM, compress

https://curiousbits.nl/blog/do-not-buy-ram-compress/
267•Ecno92•18h ago•215 comments

Reverse-Engineering Kevin J. Lang's Lost OCaml Code in Apache DataSketches

https://www.tisonkun.io/posts/ai-repair-program/
38•tison•3d ago•2 comments

What's New in PHP 8.6

https://www.php.net/releases/8.6/en.php
281•netol•17h ago•128 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.