frontpage.
newsnewestaskshowjobs

Open Source @Github

fp.

Muse – Meta’s personal AI agent

https://ai.meta.com/muse/
273•yks•5h ago•262 comments

Large language models develop novel social biases through adaptive exploration

https://openreview.net/challenge?redirect=%2Fforum%3Fid%3Dpc7fqaOcAH
83•paimapi•3h ago•44 comments

How to build a printer

https://nishantjosh.dev/blogs/how-to-build-a-fking-printer/
117•cat-whisperer•3h ago•25 comments

AlphaGenome Atlas: a high-resolution map of human DNA

https://blog.google/innovation-and-ai/models-and-research/google-deepmind/alphagenome-atlas/
484•utiiiD•10h ago•115 comments

Navier-Stokes – Tristan Buckmaster [pdf]

https://cims.nyu.edu/~tristanb/statement.pdf
1216•procedurecall•19h ago•532 comments

On the Navier–Stokes Millennium Prize Problem

https://openai.com/index/navier-stokes-solution/
1087•tedsanders•7h ago•947 comments

DaVinci Resolve 21.1

https://www.blackmagicdesign.com/media/release/20260908-03
345•tosh•11h ago•154 comments

A Topological Picture Book, Rendered

https://e-infinity.space/picture-book/
40•mathgenius•2h ago•5 comments

The Microeconomics of Artificial Intelligence (2025)

https://direct.mit.edu/books/oa-monograph/6067/The-Microeconomics-of-Artificial-Intelligence
21•neehao•2d ago•6 comments

Benchmarking Qwen3.8 27B quantizations: 4-bit holds up, 1-bit collapses

https://quesma.com/blog/qwen38-27b-quantizations-benchmarked/
207•stared•10h ago•104 comments

Kimi K3 (2.8T) at 1 token/s on a MacBook Pro, streamed from four SSDs

https://github.com/argonautlabsai/deltafin
202•Argonautlabs•4h ago•103 comments

I-have-ADHD: A skill to stop coding agents from burying the answer

https://github.com/ayghri/i-have-adhd
305•domhudson•10h ago•241 comments

Animation in Bevy: The Big Picture

https://glocq.com/en/blog/20260827/
42•ibobev•4h ago•2 comments

Ask HN: 3.5 inch diskette read errors, would a period correct drive do better?

7•rietta•1d ago•5 comments

I Resigned from Anthropic Today

https://xcancel.com/hilbertspaess/status/2097476196791709843#m
20•yurivish•20m ago•3 comments

Mercury 2.5

https://www.inceptionlabs.ai/blog/introducing-mercury-2-5
118•Topfi•4h ago•15 comments

Tao: Open math problems being non-renewably mined by AI

https://mathstodon.xyz/@tao/117237320796901560
112•_alternator_•3h ago•78 comments

Implementation of GCC's Nested Functions (vs. C++ Lambdas)

https://uecker.codeberg.page/2026-09-05.html
54•uecker•3d ago•9 comments

Show HN: LLM Attention Visualization

https://ishamf.dev/p/llm-attention-visualizer/
117•ifz•8h ago•19 comments

Getting phpBB 1.4.4 working in Docker

https://www.thran.uk/writ/devlog/2026/09/phpbb-144-in-docker.html
16•HeckFeck•1d ago•4 comments

Replacing a Rust Enum with a 64-Bit Word Made My Interpreter 17% Faster

https://pointersgonewild.com/2026-08-25-replacing-a-rust-enum-with-a-64-bit-word/
78•metrofun•3d ago•37 comments

Tracing np.add, all the way down

https://blog.veitheller.de/numpy.html
34•luu•4d ago•2 comments

The Helicopter with Radioactive Blades

https://hackaday.com/2026/09/07/the-helicopter-with-radioactive-blades/
146•zdw•1d ago•43 comments

Show HN: Copperhead – Cursor for circuit boards

https://copperhead.sh/
204•animeshchouhan•11h ago•78 comments

We built our house for LAN parties (2024)

https://lanparty.house/
406•fittingopposite•3d ago•308 comments

Reverse Engineering an ASIC

https://kjartanvandriel.github.io/asic/
25•burekqueen•1d ago•4 comments

The two Christian saints who are the Buddha

https://signoregalilei.com/2026/08/30/the-two-christian-saints-who-are-secretly-the-buddha/
216•surprisetalk•10h ago•151 comments

The 92-Year-Old Mathematician and the Teenage Apprentice

https://www.nytimes.com/2026/09/06/science/92-year-old-mathematician-apprentice.html
137•robinhouston•2d ago•11 comments

C*: Unifying Programming and Verification in C (2025)

https://arxiv.org/abs/2504.02246
69•rramadass•9h ago•41 comments

Connecting the machines

https://herdr.dev/blog/connecting-the-machines/
76•collinmanderson•8h ago•26 comments
Open in hackernews

Right-Truncatable Prime Counter

https://github.com/EbodShojaei/Right-Truncatable-Primes
9•rainmans•1y ago

Comments

throwawaymaths•1y ago
Curious about base 2. Obviously if you hit a 0 it's immediately not prime, but maybe adjust the rules so:

- you drill through as many 0's on the right.

- you finish on 1.

3, 5, 7, 11, 13, 15, 17 are all right truncatable, 19 is the first non-truncatable prime in this scheme.

nh23423fefe•1y ago
i dont think smaller radixes make the problem more interesting. the problem is interesting because base 10 has a large branching factor
throwawaymaths•1y ago
I think in the base2 reformulation I propose we do not know for certain if the list of numbers terminates, as all Fermat primes are in the set and we don't know if there are infinitely many Fermat primes.

For base-10 and the original rules the set is provably closed.

"Drilling through zeros" makes the branching unbounded.

jinwoo68•1y ago
There's a Project Euler problem for finding truncatable prime numbers, from both left and right: https://projecteuler.net/problem=37
thechao•1y ago
Just in case any else is wondering: there are only 83 right-truncatable primes (RTP) and that is it. There's two constraints that let you see this "immediately":

1. An RTP must start with {2,3,5,7,9}; and,

2. An RTP must end with {1,3,7,9}.

So, let's take the largest RTP (73939133) and try to "extend" it: there are only four possible extensions: 73939133[1], 73939133[3], 73939133[7], 73939133[9]. None of these are prime. This holds for the other 8-digit RTPs. Therefore, there is no extension to a 9-or-longer RTP. Thus, the list is exhaustive.