frontpage.
newsnewestaskshowjobs

Open Source @Github

fp.

Universal XSS in uBlock Origin from website-driven element picker

https://iter.ca/post/ubo-uxss/
201•zaik•3h ago•51 comments

Qwen4-Max

https://qwen.ai/blog?id=qwen4-max
274•ilreb•3h ago•92 comments

Old Bitly links are being hijacked

https://ransomnews.com/burger-king-tweet-bitly-link-hijack-2026/
229•hspeiser•7h ago•125 comments

What's Next for Nvidia?

https://steveblank.com/2026/11/15/whats-next-for-nvidia/
160•zdw•5h ago•207 comments

Tor Project Issues Rapid-Response DoS-Defense Fix Amid Sustained DDoS Attack

https://forum.torproject.org/t/security-release-0-4-9-17/22454
92•aillia•5h ago•24 comments

Preserving 30 years of Salon journalism

https://blog.archive.org/2026/11/12/preserving-30-years-of-salon-journalism/
118•CharlesW•6h ago•34 comments

Protomaps: Self-hosting map tiles has gotten cheap and easy

https://bruceroettgers.eu/blog/protomaps/
247•bcye•10h ago•51 comments

The Miracle Cure: In 1977, a drug rejected by doctors became a sensation

https://slate.com/technology/2026/11/doctor-medicine-cancer-cure-pill-history.html
25•mutexjp•2d ago•8 comments

A short explainer on how El Niño works [video]

https://www.youtube.com/watch?v=7_JF3etiAv8
208•nharada•11h ago•90 comments

Do we still have to denormalize? Have your schema and search it too

https://www.paradedb.com/blog/joins
46•philippemnoel•2d ago•6 comments

Handwriting, as a Font

https://ductus.sorenblank.com
196•coinfused•9h ago•44 comments

The MacBook Pro's OLED PWM problem

https://macanorak.com/the-macbook-pros-oled-pwm-problem-when-a-better-display-becomes-worse-to-use/
447•MacAnorak•16h ago•255 comments

Crows make decisions faster than we can

https://www.nytimes.com/2026/11/15/science/birdbrain-crows-birds-research-decision.html
200•gumby•11h ago•145 comments

Tell HN: HN is being scraped for emails to scam

46•eks391•2h ago•8 comments

Coles hit by a cybersecurity incident

https://www.colesgroup.com.au/updates/
81•sagunsh•4h ago•59 comments

Claude Code and Codex reverse engineered my 1994 Jeep's ECU over a $3 Arduino [video]

https://www.youtube.com/watch?v=WPj3aQ-xxpI
385•envoked•4d ago•192 comments

WebGL Flight Simulator with seed generated terrain

https://baron.by.dai.studio/
111•ranger_danger•9h ago•18 comments

Mini.nvim Is Now on Tangled

https://tangled.org/nvim-mini.org/mini.nvim
50•nerdypepper•5h ago•14 comments

Stop Filming in Log

https://digitalfilms.wordpress.com/2026/11/15/stop-filming-in-log/
3•dabinat•59m ago•0 comments

Artificial Intelligence for the Z80

https://www.dfsantos.com/en/libro-ia-z80
15•AlexeyBrin•2d ago•2 comments

Things That Turbo Pascal Is Smaller Than (2011)

https://prog21.dadgum.com/116.html
218•ksec•15h ago•115 comments

Skydio's asymmetrical F10 Lightrunner solves a problem with fixed-wing drones

https://spectrum.ieee.org/skydio-f10-lightrunner-asymmetrical-drone
21•Gaishan•5h ago•0 comments

Microsoft 365 outage leads to chlorine gas poisoning of 15 hotel guests

https://www1.wdr.de/nrw/rheinland/rhein-erft-kreis/technischer-defekt-chlor-phantasialand-100.html
467•DeepLogin•11h ago•197 comments

1900s How do you Wash a Kimono?

https://www.oldphotosjapan.com/photos/877/laundry-washing-clothes-meiji-19th-century-vintage-albu...
40•Matrixik•2d ago•10 comments

A quest to create the perfect whiskey glass

https://www.nytimes.com/2026/11/13/dining/drinks/kurt-josef-zalto-whiskey-glass.html
58•Kaibeezy•2d ago•60 comments

Linux was created as a rejection of robust software architecture and tools

https://twitter.com/GrapheneOS/status/2122079826257588569
26•privacyishuman•1h ago•19 comments

Eclipse Mosquitto – An open source MQTT broker

https://github.com/eclipse-mosquitto/mosquitto
82•gregsadetsky•11h ago•29 comments

Clice v1.0 Released: Welcome to Modern C++

https://ykiko.me/en/articles/2105384023094834022/
121•molenzwiebel•12h ago•75 comments

What happens if you write a TCP stack in Python? (2014)

https://jvns.ca/blog/2014/08/12/what-happens-if-you-write-a-tcp-stack-in-python/
11•zenincognito•3d ago•1 comments

Emacs Is My Browser

https://joshblais.com/blog/emacs-as-my-browser/
194•nyc111•14h ago•112 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.