Compliance cases
These are the 7,246 inputs a submission must answer.
A conforming implementation returns true
for the 2,791 valid ones and false
for the 4,455 invalid ones.
You can run the suite without reading it, or open any case to see its input and where its first ill-formed byte is.
Well-formed means Table 3-7 of the Unicode Standard, as RFC 3629 restates it: no overlong forms, surrogates, code points above U+10FFFF, stray continuation bytes or sequences cut short. The compliance suite combines Markus Kuhn's UTF-8 stress test, WPT's fatal TextDecoder tests, every lead byte against the edges of its allowed ranges, errors at every offset around 16-, 32- and 64-byte blocks and at the end of every length up to 130 bytes, large inputs, and seeded random text. simdutf, Python and a Table 3-7 reference agree on every answer.
Run the full compliance suite locally. Replace your-component.wasm
with your compiled component.
Download the suite
curl -fLo validate_utf8.comply.wasm https://calculated.world/comply/validate_utf8.wasm
npx qipok your-component.wasm --suite validate_utf8.comply.wasm
178 of 7,246 cases · 0 true · 178 false
| Case | Name | Expected | Note | Size |
|---|---|---|---|---|
| 006967 | generated/1710 Generated | false | 95 B | |
| 006968 | generated/1711 Generated | false | 31 B | |
| 006970 | generated/1713 Generated | false | 73 B | |
| 007007 | generated/1750 Generated | false | 76 B | |
| 007018 | generated/1761 Generated | false | 219 B | |
| 007021 | generated/1764 Generated | false | 12 B | |
| 007031 | generated/1774 Generated | false | 192 B | |
| 007051 | generated/1795 Generated | false | 326 B | |
| 007054 | generated/1798 Generated | false | 19 B | |
| 007059 | generated/1803 Generated | false | 78 B | |
| 007075 | generated/1819 Generated | false | 14 B | |
| 007088 | generated/1832 Generated | false | 96 B | |
| 007095 | generated/1839 Generated | false | 8 B | |
| 007103 | generated/1847 Generated | false | 11 B | |
| 007107 | generated/1851 Generated | false | 5 B | |
| 007121 | generated/1865 Generated | false | 3 B | |
| 007132 | generated/1877 Generated | false | 392 B | |
| 007135 | generated/1880 Generated | false | 29 B | |
| 007158 | generated/1906 Generated | false | 79 B | |
| 007164 | generated/1913 Generated | false | 284 B | |
| 007169 | generated/1918 Generated | false | 15 B | |
| 007176 | generated/1925 Generated | false | 9 B | |
| 007191 | generated/1942 Generated | false | 18 B | |
| 007199 | generated/1951 Generated | false | 7 B | |
| 007213 | generated/1966 Generated | false | 12 B | |
| 007222 | generated/1975 Generated | false | 6 B | |
| 007232 | generated/1985 Generated | false | 18 B | |
| 007244 | generated/1998 Generated | false | 53 B |
Where these rules come from
Well-formed UTF-8 is defined by Table 3-7 of
the Unicode Standard, chapter 3
, which
RFC 3629
restates as ABNF. Every answer is agreed by
simdutf
9.4.0, Python’s strict codec and a direct reading of the table; the
suite’s own tests add Node.js’s buffer.isUtf8
and a fatal TextDecoder.
- UTF-8 decoder capability and stress test — Markus Kuhn’s file, the source of the 80 Kuhn cases
-
WPT textdecoder-fatal tests
— what browsers must reject when decoding with
fatal: true - Validating UTF-8 In Less Than One Instruction Per Byte — John Keiser and Daniel Lemire’s vectorised algorithm, which simdutf uses