Another better lower bound for n=17 square packing (gus-massa.blogspot.com)

Screenshot of gus-massa.blogspot.com: Another better lower bound for n=17 square packing

First screen, captured 2 months ago.

Looks similar

Screenshot of gus-massa.blogspot.com: Decomposing factorial of 300K as the product of 300K factors larger than 100K

Decomposing factorial of 300K as the product of 300K factors larger than 100K (gus-massa.blogspot.com)

90 points by gus_massa 1 year ago | 9 comments

Screenshot of blog.jgc.org: My primality testing code is faster than Sir Roger Penrose's

My primality testing code is faster than Sir Roger Penrose's (blog.jgc.org)

109 points by jgrahamc 2 years ago | 24 comments

Screenshot of marc-b-reynolds.github.io: Moving integer division to floating-point is trivial

Moving integer division to floating-point is trivial (marc-b-reynolds.github.io)

34 points by matt_d 2 months ago | 13 comments

Screenshot of simonwillison.net: Understanding GPT tokenizers

Understanding GPT tokenizers (simonwillison.net)

380 points by simonw 3 years ago | 110 comments

Simon Willison blog post explaining how GPT tokenizers convert text to integer tokens, with an Observable notebook tool for encoding, decoding and searching tokens.

tokenizers gpt openai llm

Screenshot of log.pfad.fr: Optimi-Zi(n)g Sudoku-Solving

Optimi-Zi(n)g Sudoku-Solving (log.pfad.fr)

14 points by todsacerdoti 1 year ago | 2 comments

Screenshot of quaxio.com: Hacker News' favorite Xkcd comics (2022)

Hacker News' favorite Xkcd comics (2022)(quaxio.com)

53 points by monort 2 years ago | 15 comments

Looks similar

Decomposing factorial of 300K as the product of 300K factors larger than 100K(gus-massa.blogspot.com)

My primality testing code is faster than Sir Roger Penrose's(blog.jgc.org)

Moving integer division to floating-point is trivial(marc-b-reynolds.github.io)

Understanding GPT tokenizers(simonwillison.net)

Optimi-Zi(n)g Sudoku-Solving(log.pfad.fr)