From 32e5f72dab53d25bfaa7fb3fbedd085cc92b4980 Mon Sep 17 00:00:00 2001 From: Paul Brinkmeier Date: Wed, 5 Aug 2026 13:09:27 +0200 Subject: [PATCH] UTF-63: Fix missing p tag --- blog/utf63/index.html | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/blog/utf63/index.html b/blog/utf63/index.html index 2a2effb..341b5dd 100644 --- a/blog/utf63/index.html +++ b/blog/utf63/index.html @@ -54,8 +54,8 @@

For our entirely random example, this UTF-63 encoding uses only 16 bytes, a clear win over the whopping 21 bytes required by UTF-8 (that's 30% more!). So how does it work? -

+

Decoding is dead simple: We consider each set of 8 bytes a Big Endian 64-bit code unit. If the most significant bit is 0, the other 63 bits contain nine Basic Latin characters (i.e. ASCII characters) at 7 bits each.