frontpage.
newsnewestaskshowjobs

Made with ♥ by @iamnishanth

Open Source @Github

fp.

Postgres Message Queue (PGMQ)

https://github.com/pgmq/pgmq
1•Lwrless•2m ago•0 comments

Show HN: Django-rclone: Database and media backups for Django, powered by rclone

https://github.com/kjnez/django-rclone
1•cui•5m ago•1 comments

NY lawmakers proposed statewide data center moratorium

https://www.niagara-gazette.com/news/local_news/ny-lawmakers-proposed-statewide-data-center-morat...
1•geox•6m ago•0 comments

OpenClaw AI chatbots are running amok – these scientists are listening in

https://www.nature.com/articles/d41586-026-00370-w
2•EA-3167•7m ago•0 comments

Show HN: AI agent forgets user preferences every session. This fixes it

https://www.pref0.com/
4•fliellerjulian•9m ago•0 comments

Introduce the Vouch/Denouncement Contribution Model

https://github.com/ghostty-org/ghostty/pull/10559
2•DustinEchoes•11m ago•0 comments

Show HN: SSHcode – Always-On Claude Code/OpenCode over Tailscale and Hetzner

https://github.com/sultanvaliyev/sshcode
1•sultanvaliyev•11m ago•0 comments

Microsoft appointed a quality czar. He has no direct reports and no budget

https://jpcaparas.medium.com/microsoft-appointed-a-quality-czar-he-has-no-direct-reports-and-no-b...
1•RickJWagner•13m ago•0 comments

Multi-agent coordination on Claude Code: 8 production pain points and patterns

https://gist.github.com/sigalovskinick/6cc1cef061f76b7edd198e0ebc863397
1•nikolasi•13m ago•0 comments

Washington Post CEO Will Lewis Steps Down After Stormy Tenure

https://www.nytimes.com/2026/02/07/technology/washington-post-will-lewis.html
4•jbegley•14m ago•0 comments

DevXT – Building the Future with AI That Acts

https://devxt.com
2•superpecmuscles•15m ago•4 comments

A Minimal OpenClaw Built with the OpenCode SDK

https://github.com/CefBoud/MonClaw
1•cefboud•15m ago•0 comments

The silent death of Good Code

https://amit.prasad.me/blog/rip-good-code
3•amitprasad•15m ago•0 comments

The Internal Negotiation You Have When Your Heart Rate Gets Uncomfortable

https://www.vo2maxpro.com/blog/internal-negotiation-heart-rate
1•GoodluckH•17m ago•0 comments

Show HN: Glance – Fast CSV inspection for the terminal (SIMD-accelerated)

https://github.com/AveryClapp/glance
2•AveryClapp•18m ago•0 comments

Busy for the Next Fifty to Sixty Bud

https://pestlemortar.substack.com/p/busy-for-the-next-fifty-to-sixty-had-all-my-money-in-bitcoin-...
1•mithradiumn•19m ago•0 comments

Imperative

https://pestlemortar.substack.com/p/imperative
1•mithradiumn•20m ago•0 comments

Show HN: I decomposed 87 tasks to find where AI agents structurally collapse

https://github.com/XxCotHGxX/Instruction_Entropy
1•XxCotHGxX•23m ago•1 comments

I went back to Linux and it was a mistake

https://www.theverge.com/report/875077/linux-was-a-mistake
3•timpera•24m ago•1 comments

Octrafic – open-source AI-assisted API testing from the CLI

https://github.com/Octrafic/octrafic-cli
1•mbadyl•26m ago•1 comments

US Accuses China of Secret Nuclear Testing

https://www.reuters.com/world/china/trump-has-been-clear-wanting-new-nuclear-arms-control-treaty-...
2•jandrewrogers•27m ago•1 comments

Peacock. A New Programming Language

2•hashhooshy•31m ago•1 comments

A postcard arrived: 'If you're reading this I'm dead, and I really liked you'

https://www.washingtonpost.com/lifestyle/2026/02/07/postcard-death-teacher-glickman/
3•bookofjoe•33m ago•1 comments

What to know about the software selloff

https://www.morningstar.com/markets/what-know-about-software-stock-selloff
2•RickJWagner•36m ago•0 comments

Show HN: Syntux – generative UI for websites, not agents

https://www.getsyntux.com/
3•Goose78•37m ago•0 comments

Microsoft appointed a quality czar. He has no direct reports and no budget

https://jpcaparas.medium.com/ab75cef97954
2•birdculture•37m ago•0 comments

AI overlay that reads anything on your screen (invisible to screen capture)

https://lowlighter.app/
1•andylytic•38m ago•1 comments

Show HN: Seafloor, be up and running with OpenClaw in 20 seconds

https://seafloor.bot/
1•k0mplex•39m ago•0 comments

Tesla turbine-inspired structure generates electricity using compressed air

https://techxplore.com/news/2026-01-tesla-turbine-generates-electricity-compressed.html
2•PaulHoule•40m ago•0 comments

State Department deleting 17 years of tweets (2009-2025); preservation needed

https://www.npr.org/2026/02/07/nx-s1-5704785/state-department-trump-posts-x
5•sleazylice•40m ago•2 comments
Open in hackernews

Graduate Student Solves Classic Problem About the Limits of Addition

https://www.quantamagazine.org/graduate-student-solves-classic-problem-about-the-limits-of-addition-20250522/
76•sonabinu•8mo ago

Comments

VladVladikoff•8mo ago
Why is the lower bound N/3 and not N/2? Doesn’t the set of all odd numbers make the lower bound N/2?
Bootvis•8mo ago
N/3 + log log N holds for any arbitrary set, not just for 1 … N or something.
hiddencost•8mo ago
An adversary first gives you any set, and then you have to find a subset.

They could give you only even numbers.

VladVladikoff•8mo ago
Ohhhh ok thanks!
svat•8mo ago
So cool. On the one hand, going from n/3 to (n/3 + log log n) seems like such a small improvement, but as the article shows, the history is formidable:

- n/3 (Erdős, 1965)

- (n+1)/3 (Alon and Kleitman, 1990)

- (n+2)/3 (Bourgain, 1997)

- n/3 + Ω(log log n) (this paper, Benjamin Bedert, https://arxiv.org/abs/2502.08624)

And the upper bound:

- n/3 + o(n) (Eberhard, Green, Manners, 2014).

Ben Green's list of 100 open problems is which this is (was?) Problem 1, is here: https://people.maths.ox.ac.uk/greenbj/papers/open-problems.p...

nyc111•8mo ago
Is the main subject here addition or sets?
abetusk•8mo ago
It concerns the size of the largest sum-free set [0]. Take a (finite) set of integers, A. What is the largest subset of A such that no two entries sum to a third.

The previous results was not much better than |A|/3. The current, just proved, result shows that the largest subset is |A|/3 + c log(log(|A|)).

For example, the set {1,2,3} is not sum-free (1+2 = 3) but the subset {2,3} is sum-free (2+3 \notin {2,3}).

[0] https://en.wikipedia.org/wiki/Sum-free_set

nyc111•8mo ago
"It concerns the size of the largest sum-free set [0]. Take a (finite) set of integers, A. What is the largest subset of A such that no two entries sum to a third."

Yes, it seems to me we are focusing mainly about sets, not addition. Addition is secondary. Mainly I'm debating the title. The word "set" ought to be in the title too. I guess not a big deal.

abetusk•8mo ago
I see. Yes, I agree, the title is bad.
svat•8mo ago
Although as students we learn addition before we learn about sets, from the viewpoint of mathematics, sets are everywhere / everything can be expressed in terms of sets, so there's no point talking about sets in any given problem (unless it involves matters deep in set theory, which this does not). This is evident even colloquially, where we can talk about problems without explicitly using the word “set” — for example, “given some numbers, how many can you pick such that no two of them add up to another?” — while it's hard to avoid using “add” or “addition”.

So this problem is really more about addition than about sets, as the mathematicians who worked on it will say: the amount of set theory it involves is very little/almost nonexistent, while the properties of addition it involves are fairly deep.

(But sure, no harm if sets were mentioned in the title, I guess!)

dooglius•8mo ago
It's weird to spend paragraphs talking about the incremental improvements to (N+1)/3 and (N+2)/3 and then miss that the new bound is N/3 + c*log(log(n)) for some c>0, not N/3+log(log(n))