frontpage.
newsnewestaskshowjobs

Made with ♥ by @iamnishanth

Open Source @Github

fp.

Show HN: Caslib – Computer Algebra Calculator (Hack Club Project)

https://github.com/breynard0/caslib
1•breynard•2m ago

At Age 25, Wikipedia Refuses to Evolve

https://spectrum.ieee.org/wikipedia-at-25
1•asdefghyk•2m ago•1 comments

Show HN: ReviewReact – AI review responses inside Google Maps ($19/mo)

https://reviewreact.com
1•sara_builds•2m ago•0 comments

Why AlphaTensor Failed at 3x3 Matrix Multiplication: The Anchor Barrier

https://zenodo.org/records/18514533
1•DarenWatson•3m ago•0 comments

Ask HN: How much of your token use is fixing the bugs Claude Code causes?

1•laurex•7m ago•0 comments

Show HN: Agents – Sync MCP Configs Across Claude, Cursor, Codex Automatically

https://github.com/amtiYo/agents
1•amtiyo•8m ago•0 comments

Hello

1•otrebladih•9m ago•0 comments

FSD helped save my father's life during a heart attack

https://twitter.com/JJackBrandt/status/2019852423980875794
2•blacktulip•12m ago•0 comments

Show HN: Writtte – Draft and publish articles without reformatting, anywhere

https://writtte.xyz
1•lasgawe•14m ago•0 comments

Portuguese icon (FROM A CAN) makes a simple meal (Canned Fish Files) [video]

https://www.youtube.com/watch?v=e9FUdOfp8ME
1•zeristor•15m ago•0 comments

Brookhaven Lab's RHIC Concludes 25-Year Run with Final Collisions

https://www.hpcwire.com/off-the-wire/brookhaven-labs-rhic-concludes-25-year-run-with-final-collis...
2•gnufx•18m ago•0 comments

Transcribe your aunts post cards with Gemini 3 Pro

https://leserli.ch/ocr/
1•nielstron•21m ago•0 comments

.72% Variance Lance

1•mav5431•23m ago•0 comments

ReKindle – web-based operating system designed specifically for E-ink devices

https://rekindle.ink
1•JSLegendDev•24m ago•0 comments

Encrypt It

https://encryptitalready.org/
1•u1hcw9nx•24m ago•1 comments

NextMatch – 5-minute video speed dating to reduce ghosting

https://nextmatchdating.netlify.app/
1•Halinani8•25m ago•1 comments

Personalizing esketamine treatment in TRD and TRBD

https://www.frontiersin.org/articles/10.3389/fpsyt.2025.1736114
1•PaulHoule•27m ago•0 comments

SpaceKit.xyz – a browser‑native VM for decentralized compute

https://spacekit.xyz
1•astorrivera•27m ago•0 comments

NotebookLM: The AI that only learns from you

https://byandrev.dev/en/blog/what-is-notebooklm
2•byandrev•27m ago•1 comments

Show HN: An open-source starter kit for developing with Postgres and ClickHouse

https://github.com/ClickHouse/postgres-clickhouse-stack
1•saisrirampur•28m ago•0 comments

Game Boy Advance d-pad capacitor measurements

https://gekkio.fi/blog/2026/game-boy-advance-d-pad-capacitor-measurements/
1•todsacerdoti•28m ago•0 comments

South Korean crypto firm accidentally sends $44B in bitcoins to users

https://www.reuters.com/world/asia-pacific/crypto-firm-accidentally-sends-44-billion-bitcoins-use...
2•layer8•29m ago•0 comments

Apache Poison Fountain

https://gist.github.com/jwakely/a511a5cab5eb36d088ecd1659fcee1d5
1•atomic128•31m ago•2 comments

Web.whatsapp.com appears to be having issues syncing and sending messages

http://web.whatsapp.com
1•sabujp•31m ago•2 comments

Google in Your Terminal

https://gogcli.sh/
1•johlo•33m ago•0 comments

Shannon: Claude Code for Pen Testing: #1 on Github today

https://github.com/KeygraphHQ/shannon
1•hendler•33m ago•0 comments

Anthropic: Latest Claude model finds more than 500 vulnerabilities

https://www.scworld.com/news/anthropic-latest-claude-model-finds-more-than-500-vulnerabilities
2•Bender•38m ago•0 comments

Brooklyn cemetery plans human composting option, stirring interest and debate

https://www.cbsnews.com/newyork/news/brooklyn-green-wood-cemetery-human-composting/
1•geox•38m ago•0 comments

Why the 'Strivers' Are Right

https://greyenlightenment.com/2026/02/03/the-strivers-were-right-all-along/
1•paulpauper•39m ago•0 comments

Brain Dumps as a Literary Form

https://davegriffith.substack.com/p/brain-dumps-as-a-literary-form
1•gmays•39m ago•0 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))