frontpage.
newsnewestaskshowjobs

Made with ♥ by @iamnishanth

Open Source @Github

fp.

Magnifica Humanitas (Encyclical Letter)

https://www.vatican.va/content/leo-xiv/en/encyclicals/documents/20260515-magnifica-humanitas.html
71•theletterf•1h ago•12 comments

Didgeridoo playing as alternative treatment for obstructive sleep apnoea (2006)

https://pmc.ncbi.nlm.nih.gov/articles/PMC1360393/
158•kelseyfrog•2d ago•59 comments

Show HN: Geomatic – a command-driven geometry studio enabled with autodiff

https://www.tinyvolt.com/geomatic
24•nivter•2h ago•6 comments

Show HN: Audiomass – a free, open-source multitrack audio editor for the web

https://audiomass.co/?multitrack=1
384•pantelisk•19h ago•86 comments

DeepSeek reasonix, DeepSeek native coding agent with high caching and low cost

https://esengine.github.io/DeepSeek-Reasonix/
581•Alifatisk•22h ago•243 comments

Migrating from Go to Rust

https://corrode.dev/learn/migration-guides/go-to-rust/
307•jabits•16h ago•297 comments

Bytecode VMs in surprising places (2024)

https://dubroy.com/blog/bytecode-vms-in-surprising-places/
33•azhenley•2d ago•13 comments

Jira Is Turing-Complete

https://seriot.ch/computation/jira.html
188•vinhnx•7h ago•83 comments

White Rabbit – sub-nanosecond synchronization for large distributed systems

https://ohwr.org/projects/white-rabbit/
112•michaelsbradley•2d ago•28 comments

Notes about reading messages with the Python email packages

https://utcc.utoronto.ca/~cks/space/blog/python/EmailPackagesNotes
16•ankitg12•5d ago•0 comments

Bug 1950764: Work Around Crash on Intel Raptor Lake CPU

https://phabricator.services.mozilla.com/D301917
104•luu•2d ago•33 comments

I spent 50 hours drawing a line graph

https://www.dougmacdowell.com/50-hours-to-draw-some-lines.html
557•dougdude3339•3d ago•94 comments

A fundamental principle of aeronautical engineering has been overturned

https://www.wired.com/story/a-fundamental-principle-of-aeronautical-engineering-has-been-overturned/
173•littlexsparkee•16h ago•83 comments

I love my Bluetooth keyboard

https://liquidbrain.net/blog/i-love-my-bluetooth-keyboard/
88•evakhoury•2d ago•89 comments

Defeating Git Rigour Fatigue with Jujutsu

https://ikesau.co/blog/defeating-git-rigour-fatigue-with-jujutsu/
128•ikesau•16h ago•138 comments

Microsoft open-sources “the earliest DOS source code discovered to date”

https://arstechnica.com/gadgets/2026/04/microsoft-open-sources-the-earliest-dos-source-code-disco...
481•DamnInteresting•1d ago•170 comments

C constructs that still don't work in C++

https://lospino.so/blog/c-constructs-that-still-dont-work-in-cpp/
87•jalospinoso•3d ago•72 comments

AI errno(2) values

https://www.netmeister.org/blog/ai-errno.html
4•zdw•2d ago•1 comments

Constraint Decay: The Fragility of LLM Agents in Back End Code Generation

https://arxiv.org/abs/2605.06445
244•wek•22h ago•141 comments

Gorilla: A fast, scalable, in-memory time series database (2016)

https://blog.acolyer.org/2016/05/03/gorilla-a-fast-scalable-in-memory-time-series-database/
18•xnorswap•4d ago•3 comments

Building Pi with Pi

https://lucumr.pocoo.org/2026/5/24/pi-oss/
105•mplanchard•17h ago•72 comments

Why Do We Sleep Under Blankets, Even on the Hottest Nights? (2017)

https://www.atlasobscura.com/articles/blankets-summer-hot
53•downbad_•5h ago•39 comments

Scientists solve 200-year-old puzzle of how tobacco plants make nicotine

https://www.york.ac.uk/news-and-events/news/2026/research/200-year-old-puzzle-tobacco-plants-nico...
93•sohkamyung•2d ago•35 comments

Memory has grown to nearly two-thirds of AI chip component costs

https://epoch.ai/data-insights/ai-chip-component-cost-shares
396•intelkishan•18h ago•417 comments

Build Adafruit projects right from Firefox

https://www.firefox.com/en-US/landing/adafruit/
170•mch82•3d ago•62 comments

Childhood Computing

https://susam.net/childhood-computing.html
215•blenderob•23h ago•101 comments

Scammers are abusing an internal Microsoft account to send spam links

https://techcrunch.com/2026/05/21/scammers-are-abusing-an-internal-microsoft-account-to-send-spam/
291•spike021•1d ago•168 comments

Mastering Dyalog APL

https://mastering.dyalog.com/README.html
145•tosh•23h ago•37 comments

Greg Brockman interview [video]

https://fs.blog/knowledge-project-podcast/greg-brockman/
201•prakashqwerty•1d ago•218 comments

Using HTTP/2 Cleartext for a server in Go 1.24

https://www.clarityboss.com/blog/go-http2-cleartext-h2c-cloud-run
88•dan_sbl•5d ago•9 comments
Open in hackernews

Right-Truncatable Prime Counter

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

Comments

throwawaymaths•12mo 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•12mo ago
i dont think smaller radixes make the problem more interesting. the problem is interesting because base 10 has a large branching factor
throwawaymaths•12mo 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•12mo ago
There's a Project Euler problem for finding truncatable prime numbers, from both left and right: https://projecteuler.net/problem=37
thechao•12mo 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.