frontpage.
newsnewestaskshowjobs

Open Source @Github

fp.

Toyota, Nissan, and Honda to Standardize Parts to Lower Costs

https://www.caranddriver.com/news/a74490092/toyota-nissan-honda-standardize-parts-lower-costs/
85•zdw•1h ago•38 comments

Pill to treat pancreatic cancer hailed as 'biggest breakthrough in decades'

https://www.theguardian.com/society/2026/nov/20/pill-pancreatic-cancer-breakthrough-daraxonrasib
808•rafaelc•1d ago•190 comments

Lean verification of the Riemann Hypothesis

https://leanprover-community.github.io/blog/posts/riemann-hypothesis/
920•g-b-r•14h ago•780 comments

Sandwich Simulator

https://stulle.app/
102•subdomain•4h ago•46 comments

Inkling-2-Mini in 5.4 GB Memory

https://github.com/ShinMegamiBoson/lookatmyquant
405•k__•11h ago•101 comments

Detonating a pile of lead azide

https://www.science.org/content/blog-post/detonating-huge-pile-lead-azide-really
574•beginning_end•15h ago•373 comments

Data Processing Incidents on Inference Providers

https://openrouter.ai/blog/announcements/data-processing-incidents-on-inference-providers/
61•sdko•2h ago•25 comments

Getting the mind to steer the body to steer you

https://notnottalmud.substack.com/p/getting-the-mind-to-steer-the-body
206•jger15•1d ago•67 comments

PcapAnalyzer – self-hosted pcap analyzer with 27 problem detectors

https://github.com/sebaandrada-cell/PcapAnalyzer
88•sebaandrada•6h ago•9 comments

Leonida – PC Recompilation of the Xbox Version of GTA 6

https://github.com/ItsNotRexed/Leonida
93•ebrahimh•4h ago•58 comments

My monitor was cutting my download speed by 75%

https://blog.tymscar.com/posts/studiodisplayethernet/
534•soheilpro•18h ago•258 comments

The Most Popular Car Colors in America

https://www.iseecars.com/most-popular-car-colors-study
11•cisc•2h ago•16 comments

Shaping the Loops, Closing the Loops

https://revyl.com/blog/pattern-engineering/
18•based0x10•3d ago•8 comments

Upload2Shell (CVE-2026-125396)

https://pwn.ai/upload2shell
97•f311a•10h ago•41 comments

Pandex – Official European Law for AI Agents, over MCP

https://www.pandex.io
53•vasie•8h ago•10 comments

Split Radiance Cascades

https://www.jacktollenaar.top/articles/split-rc.html
5•ibobev•2d ago•0 comments

Unit-testing in the Ü programming language

https://panzerschrek.github.io/U-00DC-Sprache-site/2026/11/18/unit-testing.html
9•Panzerschrek•2d ago•1 comments

Advice for the next 100 Rust GUIs

https://linebender.org/blog/next-100-guis/
118•raphlinus•7h ago•28 comments

PostgreSQL Extensions in Go

https://jespino.github.io/gopgext/
132•valyala•11h ago•23 comments

LLMs can read and write executables byte by byte from a hex dump

https://sgiannopoulos.github.io/blog/machine-code-programming/
218•fortran77•3d ago•137 comments

Show HN: Zero C# – C# without a runtime or GC

https://onurgumus.github.io/zero-csharp/index.html
146•reverseblade2•13h ago•103 comments

Tasklet (YC P26) Is Hiring Product and Agent Infra Engineers

https://tasklet.ai/careers
1•mayop100•7h ago

Since last year, we asked: "What if AI solved the Riemann Hypothesis?"

https://www.youtube.com/watch?v=zqzk43bSdDI
19•droidjj•2h ago•1 comments

Why there are still no non-WebKit browsers on iOS

https://blog.mozilla.org/en/mozilla/internet-policy/apple-ios-browser-engine-rules/
525•lapcat•1d ago•284 comments

Tropical Rainforests Species may be surprisingly young

https://phys.org/news/2026-11-species-tropical-rainforests-young-emergence.html
47•PaulHoule•4d ago•27 comments

Ask HN: I have been unemployed for 2y. 15 years of experience, US. What to do?

653•LetThingsBeDiff•1d ago•738 comments

Exponential Behavior in Magic: The Gathering

https://levineuwirth.org/essays/exponential-magic/
102•neuwirth•3d ago•68 comments

Verification files for the Lean proof of the Riemann Hypothesis

https://math.mit.edu/~drew/grh/
106•Bluestein•13h ago•38 comments

RCE in Gnupg

https://lists.gnupg.org/pipermail/gnupg-announce/2026q4/000517.html
246•gdgghhhhh•20h ago•98 comments

Together.ai: Prompt Leakage for Requests

https://www.together.ai/blog/security-event-prompt-leakage-for-requests-in-june-and-july-of-2026
8•Fe2O3•1h ago•4 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.