frontpage.
newsnewestaskshowjobs

Made with ♥ by @iamnishanth

Open Source @Github

fp.

Show HN: 289x speedup over MLP using Spectral Graphs

https://zenodo.org/login/?next=%2Fme%2Fuploads%3Fq%3D%26f%3Dshared_with_me%25253Afalse%26l%3Dlist...
1•andrespi•11s ago•0 comments

Teaching Mathematics

https://www.karlin.mff.cuni.cz/~spurny/doc/articles/arnold.htm
1•samuel246•2m ago•0 comments

3D Printed Microfluidic Multiplexing [video]

https://www.youtube.com/watch?v=VZ2ZcOzLnGg
1•downboots•2m ago•0 comments

Abstractions Are in the Eye of the Beholder

https://software.rajivprab.com/2019/08/29/abstractions-are-in-the-eye-of-the-beholder/
1•whack•3m ago•0 comments

Show HN: Routed Attention – 75-99% savings by routing between O(N) and O(N²)

https://zenodo.org/records/18518956
1•MikeBee•3m ago•0 comments

We didn't ask for this internet – Ezra Klein show [video]

https://www.youtube.com/shorts/ve02F0gyfjY
1•softwaredoug•4m ago•0 comments

The AI Talent War Is for Plumbers and Electricians

https://www.wired.com/story/why-there-arent-enough-electricians-and-plumbers-to-build-ai-data-cen...
1•geox•7m ago•0 comments

Show HN: MimiClaw, OpenClaw(Clawdbot)on $5 Chips

https://github.com/memovai/mimiclaw
1•ssslvky1•7m ago•0 comments

I Maintain My Blog in the Age of Agents

https://www.jerpint.io/blog/2026-02-07-how-i-maintain-my-blog-in-the-age-of-agents/
2•jerpint•7m ago•0 comments

The Fall of the Nerds

https://www.noahpinion.blog/p/the-fall-of-the-nerds
1•otoolep•9m ago•0 comments

I'm 15 and built a free tool for reading Greek/Latin texts. Would love feedback

https://the-lexicon-project.netlify.app/
1•breadwithjam•12m ago•1 comments

How close is AI to taking my job?

https://epoch.ai/gradient-updates/how-close-is-ai-to-taking-my-job
1•cjbarber•12m ago•0 comments

You are the reason I am not reviewing this PR

https://github.com/NixOS/nixpkgs/pull/479442
2•midzer•14m ago•1 comments

Show HN: FamilyMemories.video – Turn static old photos into 5s AI videos

https://familymemories.video
1•tareq_•15m ago•0 comments

How Meta Made Linux a Planet-Scale Load Balancer

https://softwarefrontier.substack.com/p/how-meta-turned-the-linux-kernel
1•CortexFlow•15m ago•0 comments

A Turing Test for AI Coding

https://t-cadet.github.io/programming-wisdom/#2026-02-06-a-turing-test-for-ai-coding
2•phi-system•16m ago•0 comments

How to Identify and Eliminate Unused AWS Resources

https://medium.com/@vkelk/how-to-identify-and-eliminate-unused-aws-resources-b0e2040b4de8
2•vkelk•16m ago•0 comments

A2CDVI – HDMI output from from the Apple IIc's digital video output connector

https://github.com/MrTechGadget/A2C_DVI_SMD
2•mmoogle•17m ago•0 comments

CLI for Common Playwright Actions

https://github.com/microsoft/playwright-cli
3•saikatsg•18m ago•0 comments

Would you use an e-commerce platform that shares transaction fees with users?

https://moondala.one/
1•HamoodBahzar•20m ago•1 comments

Show HN: SafeClaw – a way to manage multiple Claude Code instances in containers

https://github.com/ykdojo/safeclaw
2•ykdojo•23m ago•0 comments

The Future of the Global Open-Source AI Ecosystem: From DeepSeek to AI+

https://huggingface.co/blog/huggingface/one-year-since-the-deepseek-moment-blog-3
3•gmays•23m ago•0 comments

The Evolution of the Interface

https://www.asktog.com/columns/038MacUITrends.html
2•dhruv3006•25m ago•1 comments

Azure: Virtual network routing appliance overview

https://learn.microsoft.com/en-us/azure/virtual-network/virtual-network-routing-appliance-overview
2•mariuz•25m ago•0 comments

Seedance2 – multi-shot AI video generation

https://www.genstory.app/story-template/seedance2-ai-story-generator
2•RyanMu•29m ago•1 comments

Πfs – The Data-Free Filesystem

https://github.com/philipl/pifs
2•ravenical•32m ago•0 comments

Go-busybox: A sandboxable port of busybox for AI agents

https://github.com/rcarmo/go-busybox
3•rcarmo•33m ago•0 comments

Quantization-Aware Distillation for NVFP4 Inference Accuracy Recovery [pdf]

https://research.nvidia.com/labs/nemotron/files/NVFP4-QAD-Report.pdf
2•gmays•34m ago•0 comments

xAI Merger Poses Bigger Threat to OpenAI, Anthropic

https://www.bloomberg.com/news/newsletters/2026-02-03/musk-s-xai-merger-poses-bigger-threat-to-op...
2•andsoitis•34m ago•0 comments

Atlas Airborne (Boston Dynamics and RAI Institute) [video]

https://www.youtube.com/watch?v=UNorxwlZlFk
2•lysace•35m ago•0 comments
Open in hackernews

Is P=NP?

https://adlrocha.substack.com/p/adlrocha-is-nnp
10•adlrocha•1mo ago

Comments

fjfaase•1mo ago
The fact that thousands of people have failed to prove that P=NP indication that it is probably not true. It has even been proven that it cannot be proven by some methods.
ahmedfromtunis•1mo ago
This is a fairly new question; from the early 20th century, iirc.

There were many questions with no answers for literal centuries and thousands trying, and failing, to crack them. A solution was ultimately found despite that.

A new "math" might be needed, but an answer (affirming or not) will be found.

fjfaase•1mo ago
It is fairly new, but very relevant for daily life, like many others are not. Thousands of people have tried to write smart algorithms to solve NP problems and many have thought they found an algorithm in P only to be disproven later.

Whether the Riemann hypotesis is true or not, is not going to have any practical effect, accept for a small group of mathematisians who are working on it. Most people do not know what a Field medal is nor care about it.

skissane•1mo ago
> A new "math" might be needed, but an answer (affirming or not) will be found.

What if there exists a proof that P!=NP, but the shortest possible proof of that proposition is a googolplex symbols that long? Then P!=NP would be true, and provable and knowable in theory, yet eternally unprovable and unknowable in practice

ahmedfromtunis•1mo ago
That's exactly the kind of situation I had in mind when I wrote that.

Goodstein’s theory would take more symbols than there are atoms in the observable universe to write down in "classic" maths. To "fix" this, mathematicians had to use a "new" way of thinking about infinity known as transfinite induction.

I think if we're smart enough to detect(?) a proof, we'll find a way to express it in a finite manner.

skissane•1mo ago
Couldn’t you equally say “The fact that thousands of people have failed to prove that P!=NP indication that it is probably not true”?

My completely unscientific hunch is someone will eventually prove that P=?=NP is independent of ZF(C). Maybe the universe just really wants to mess with complexity theorists

fjfaase•1mo ago
Maybe I should have written: "Many have tried to find algorithms in P to solve NP problems and failed to find them." Even now, many people are working on algorithms to find solutions for NP problems. I understand that it has been proven that it is not possible to proof P=NP? using 'algorithms'. That might mean that even when a proof is found that P=NP that there still will be no P algorithm to solve NP problems.
skissane•1mo ago
Someone might eventually provide a non-constructive proof that P=NP - a proof that such an algorithm must exist but which fails to actually produce one.

Or even a galactic algorithm-an algorithm for solving an NP-complete problem that is technically in P, but completely useless for anything in practice, e.g. O(n^10000000)

IAmBroom•1mo ago
> solving an NP-complete problem that is technically in P, but completely useless for anything in practice

So it's P and NP. (Edit: I keep misphrasing this!)

P ?= NP is not about ease, nor even realistic efforts.

wjnc•1mo ago
My philosophy of math muscles tingle at both sentences at about the same rate.

P=NP and P=!NP are both proven nor disproven. (There is redundant information in this sentence.)

History shows us that the historical / ‘effort’ argument is not applicable to mathematics. All proofs were unproven once until proven successfully for the first time. Harder problems need bigger shoulders to stand on. Sometimes this is due to new tools, sometimes it is a magically gifted individual focusing on the problem, usually some mix of both. All we know is that all before have failed. It’s one of the beauties in math.

nrhrjrjrjtntbt•1mo ago
P=NP feels like too much of a free lunch. Yeah thats unscientific but a hunch.
skissane•1mo ago
It needn’t be a “free lunch” at all. An O(n^1000) algorithm for an NP-complete problem would constructively prove that P=NP yet be completely useless for solving any NP problems in practice
emorning4•1mo ago
Suppose some random nutjob thought they had solved this problem. What should they do with it?
RestartKernel•1mo ago
Am I naive to think we've reached the point where anyone would be able to get a revolutionary thought out there quite easily? If I were such a brilliant nutjob, I'd post it on some math or computer science forum if I just wanted to be recognised. Even if just a few people see it, such an audience would likely be entrenched with the right communities to signal boost it.
Cpoll•1mo ago
Nah, cranks post inscrutable incorrect proofs (and/or bizarre unified theories) to math forums regularly. They often lack the vocabulary to even format it in a way the community can read and correct.

I recall there was a mathematician that was cataloging all the 'squaring the circle' methods people kept mailing him (it's been proven to be impossible).

If their idea were legitimately revolutionary and they had the vocabulary to express it, they could simply publish.

panopoly•1mo ago
This is a baffling post.

From the original twit:

> I had a dream where P=NP.

Did this poster, in their dream, solve P=NP or they just heard it had already been solved?

Then after waking up from this dream they asked some slop slinger if P=NP?!?

From the follow up article:

> I guess by now you have a better understanding of why I thought I was crazy when I woke up thinking P=NP.

What do the details matter? Last week I had a dream that my childhood rat was the president of space. That's what dreams do.

> fun story: I still remember those “random oracles” that we used to proof cryptographic primitives in college

So someone who previously used 'random oracles' to prove 'cryptographic primitives' had to ask a slop slinger if P=NP?!?

SkyReflections•1mo ago
Here's a proof of P neq NP: https://zenodo.org/records/17913205 Authors write subtitle: "Conditional for Abstract Computation, Unconditional for Physical Reality"

I agree. Computational limits become physical law, not algorithmic puzzles. Cryptography is unconditionally secure. NP-hard problems require approximation, not solution. AI must be heuristic, not exhaustive. Understanding what physics forbids, not just what we haven't achieved -> focuses effort productively.