frontpage.
newsnewestaskshowjobs

Open Source @Github

fp.

Since Chromium 148, Math.tanh is now fingerprintable to link underlying OS

https://scrapfly.dev/posts/browser-math-os-fingerprint/
356•joahnn_s•6h ago•168 comments

GhostLock, a stack-UAF that has existed in all Linux distributions for 15 years

https://nebusec.ai/research/ionstack-part-2/
122•ranger_danger•4d ago•44 comments

Cyberpunk Comics, Manga and Graphic Novels

https://shellzine.net/cyberpunk-comics/
100•zdw•4h ago•23 comments

Tiny Emulators

https://floooh.github.io/tiny8bit-preview/index.html
167•naves•7h ago•10 comments

Designing and assembling my first PCB

https://vilkeliskis.com/b/2026/0711.html
65•tadasv•4h ago•12 comments

Why Vanilla JavaScript

https://guseyn.com/html/posts/why-vanilla-js.html
81•guseyn•4h ago•39 comments

So you want to learn physics (second edition, 2021)

https://www.susanrigetti.com/physics
119•azhenley•5d ago•16 comments

Ask HN: Add flag for AI-generated articles

149•levkk•2h ago•100 comments

Modernizing Property Tax Assessments in Allegheny County

https://www.prohousingpgh.org/blog/new-report-modernizing-property-tax-assessments-in-allegheny-c...
23•mooreds•1h ago•7 comments

Migrating a production AI agent to GPT-5.6: 2.2x faster, 27% cheaper

https://ploy.ai/blog/migrating-a-production-ai-agent-to-gpt-5-6
152•brryant•10h ago•50 comments

Ask HN: What Are You Working On? (July 2026)

87•david927•6h ago•256 comments

Claude Code sends 33k tokens before reading the prompt; OpenCode sends 7k

https://systima.ai/blog/claude-code-vs-opencode-token-overhead
489•systima•9h ago•274 comments

How we can reduce traffic congestion

https://research.google/blog/the-power-of-collaboration-how-we-can-reduce-traffic-congestion/
89•raahelb•11h ago•105 comments

Kode Dot Programmable pocket device for makers, pentesters and geeks

https://kode.diy
47•iNic•6h ago•12 comments

First look at Quest, the final ship of Antarctic explorer Shackleton

https://www.cbc.ca/news/canada/quest-shipwreck-expedition-images-9.7262229
5•curmudgeon22•4d ago•0 comments

LARP – Revenue infrastructure for serious founders

https://www.larp.website/
172•BerislavLopac•10h ago•38 comments

I Learned to Read Again

https://substack.magazinenongrata.com/p/how-i-learned-to-read-again
109•georgex7•9h ago•48 comments

Why write code in 2026

https://softwaredoug.com/blog/2026/07/09/write-code
124•softwaredoug•2d ago•158 comments

The four horsemen behind Postgres outages

https://malisper.me/the-four-horsemen-behind-thousands-of-postgres-outages/
23•craigkerstiens•3d ago•7 comments

Calculix: A Free Software Three-Dimensional Structural Finite Element Program

https://www.calculix.de/
7•joebig•3d ago•1 comments

Architecture Description Languages [pdf]

https://ics.uci.edu/~taylor/documents/2000-ADLs-TSE.pdf
25•ascent817•4h ago•1 comments

Vint Cerf, “father of the Internet”, is retiring

https://techcrunch.com/2026/06/30/the-father-of-the-internet-is-finally-retiring/
285•compiler-guy•3d ago•163 comments

Automation Without Understanding

https://arxiv.org/abs/2607.06377
102•root-parent•10h ago•44 comments

Flash-MSA: Accelerating Million-Token Training with Sparse Attention Kernels

https://nanduruganesh.github.io/flash-msa/
29•rawsh•6h ago•1 comments

Profiling the "Abundance" housing bottleneck with real data

https://laxmena.com/same-capacity-less-throughput
31•laxmena•5h ago•13 comments

Mechanistic interpretability researchers applying causality theory to LLMs

https://cacm.acm.org/news/can-we-understand-how-large-language-models-reason/
86•adunk•9h ago•64 comments

I love LLMs, I hate hype

https://geohot.github.io//blog/jekyll/update/2026/07/12/i-love-llms.html
350•therepanic•8h ago•210 comments

Against Usefulness

https://www.motivenotes.ai/p/against-usefulness
88•supo•9h ago•23 comments

How to read more books

https://scotto.me/blog/2026-07-12-how-to-read-more-books/
273•silcoon•11h ago•150 comments

The One-Step Trap (In AI Research)

http://incompleteideas.net/IncIdeas/OneStepTrap.html
47•jxmorris12•8h ago•9 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.