frontpage.
newsnewestaskshowjobs

Open Source @Github

fp.

Gemini 4 Neon

https://blog.google/innovation-and-ai/models-and-research/gemini-models/introducing-gemini-4-neon/
455•yigitdemirag•4h ago•429 comments

Unauthenticated remote code execution in Nginx

https://www.wiz.io/blog/nginx-http2-rce-vulnerabilities
1145•speedping•10h ago•511 comments

Gemini 4 Neon looks like an Opus 5.5 competitor

https://micjm.com/blog/gemini-4-neon-looks-like-a-top-model/
67•seizethecheese•1h ago•21 comments

Multiple vulnerabilities in Regexp and String case conversion

https://www.ruby-lang.org/en/news/2026/11/18/multiple-vulnerabilities-in-regexp-and-string/
70•runesoerensen•2h ago•15 comments

Seven new models at scalable price-performance

https://microsoft.ai/news/microsoft-ignite-2026/
451•gmays•9h ago•315 comments

LLM assisted reverse engineering

https://www.slowchronicle.com/posts/llm-assisted-reverse-engineering
63•ioma8•3h ago•14 comments

AI agents ask better questions than KPMG accountants in audit trial

https://europeanbusinessmagazine.com/ai-agents-better-questions-kpmg/
362•Betelbuddy•10h ago•163 comments

Inside Deutsche Bank

https://www.inside-db.com/
563•gyre007•10h ago•190 comments

DNS resolvers are the wrong place to fight piracy

https://techstackups.com/articles/quad9-leaves-france-dns-blocking/
602•ritzaco•12h ago•223 comments

Anthropic prices initial public offering

https://www.anthropic.com/news/anthropic-prices-initial-public-offering
53•surprisetalk•2h ago•23 comments

DaisyRose-27B

https://www.radixark.com/blog/daisyrose-27b
138•de_sty•6h ago•41 comments

Fable: Written, painted and directed by Claude Fable 5.2

https://claudia.gallery/fable/
31•CharlesW•1h ago•24 comments

Dumping an AES key from a MyQ garage opener to stop rebooting when offline

https://kusha.me/blog/stop_myq_homebridge_819lmb_rebooting/
40•kusha•2d ago•16 comments

AI Will Not Make You Rich (2025)

https://colossus.com/article/ai-will-not-make-you-rich/
3•madars•7m ago•0 comments

We need smart people who give a shit

https://violetpixel.com/blog/2026-11-17-we-need-smart-people-who-give-a-shit/
215•ExMachina73•2h ago•111 comments

Advancing chip design with OpenAI models

https://openai.com/index/advancing-chip-design-with-our-models/
163•vighneshiyer•8h ago•104 comments

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

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

Genie 4 is now available

https://blog.google/innovation-and-ai/models-and-research/google-deepmind/genie-4-now-available-p...
190•leumon•7h ago•143 comments

Collisions in Hash Functions

https://collisions.zksecurity.xyz/
5•baby•2d ago•0 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
238•DeepLogin•11h ago•172 comments

Show HN: ADE Index – a sourced and ranked index of 975 agentic coding tools

https://adeindex.com
3•jonnyasmar•24m ago•0 comments

A Collage Showing 49 Drill Holes Made by NASA's Curiosity Mars Rover

https://science.nasa.gov/photojournal/a-collage-showing-49-drill-holes-made-by-nasas-curiosity-ma...
33•wawayanda•2d ago•2 comments

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

https://exitpath-ruddy.vercel.app/
167•zerocool0101•9h ago•49 comments

FailTrace – Reproduce a failed GitHub Actions run locally from its URL

https://github.com/Ri4dH/failtrace
3•ri4dh•27m ago•0 comments

Unreal Tournament 2004 in the Browser

https://ut2004.dev/
5•TheAceOfHearts•29m ago•0 comments

GTA6-like as a 942Kb UEFI bootable image

https://github.com/eklavya-raj/gta6-uefi
44•bananaboy•3h ago•39 comments

Previous-Token Prediction Based LLM Inversion for Prompt Reconstruction

https://arxiv.org/abs/2607.29378
3•dalmo3•31m ago•0 comments

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

https://rshekhar.com/voyager/
152•raj-shekhar•9h ago•34 comments

Show HN: Open-source, real-time object tracking for live video feeds

https://github.com/aryamandarda/tamserve
45•aryaman_darda•2d ago•2 comments

Palo Alto Networks to Acquire Applied Compute for $4.5B

https://investors.paloaltonetworks.com/news-releases/news-release-details/palo-alto-networks-acqu...
10•alpb•2h ago•0 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.