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
764 of 7,246 cases · 764 true · 0 false
| Case | Name | Expected | Note | Size |
|---|---|---|---|---|
| 006470 | generated/1190 Generated | true | 13 B | |
| 006474 | generated/1194 Generated | true | 59 B | |
| 006477 | generated/1197 Generated | true | 44 B | |
| 006480 | generated/1200 Generated | true | 187 B | |
| 006482 | generated/1202 Generated | true | 128 B | |
| 006484 | generated/1204 Generated | true | 2 B | |
| 006485 | generated/1205 Generated | true | 11 B | |
| 006486 | generated/1206 Generated | true | 13 B | |
| 006489 | generated/1209 Generated | true | 361 B | |
| 006490 | generated/1210 Generated | true | 15 B | |
| 006491 | generated/1211 Generated | true | 303 B | |
| 006492 | generated/1212 Generated | true | 109 B | |
| 006493 | generated/1213 Generated | true | 20 B | |
| 006494 | generated/1214 Generated | true | 37 B | |
| 006496 | generated/1216 Generated | true | 279 B | |
| 006501 | generated/1221 Generated | true | 64 B | |
| 006502 | generated/1222 Generated | true | 62 B | |
| 006508 | generated/1229 Generated | true | 264 B | |
| 006509 | generated/1230 Generated | true | 64 B | |
| 006514 | generated/1235 Generated | true | 13 B | |
| 006518 | generated/1239 Generated | true | 336 B | |
| 006519 | generated/1240 Generated | true | 77 B | |
| 006520 | generated/1241 Generated | true | 8 B | |
| 006521 | generated/1242 Generated | true | 29 B | |
| 006522 | generated/1243 Generated | true | 131 B | |
| 006528 | generated/1249 Generated | true | 365 B | |
| 006530 | generated/1251 Generated | true | 59 B | |
| 006538 | generated/1259 Generated | true | 50 B | |
| 006541 | generated/1263 Generated | true | 60 B | |
| 006543 | generated/1265 Generated | true | 12 B | |
| 006544 | generated/1266 Generated | true | 10 B | |
| 006545 | generated/1267 Generated | true | 349 B | |
| 006547 | generated/1269 Generated | true | 273 B | |
| 006550 | generated/1272 Generated | true | 268 B | |
| 006553 | generated/1275 Generated | true | 9 B | |
| 006556 | generated/1278 Generated | true | 70 B | |
| 006557 | generated/1280 Generated | true | 9 B | |
| 006558 | generated/1281 Generated | true | 51 B | |
| 006561 | generated/1284 Generated | true | 35 B | |
| 006566 | generated/1289 Generated | true | 296 B | |
| 006567 | generated/1290 Generated | true | 37 B | |
| 006569 | generated/1292 Generated | true | 36 B | |
| 006572 | generated/1295 Generated | true | 219 B | |
| 006573 | generated/1296 Generated | true | 160 B | |
| 006574 | generated/1297 Generated | true | 298 B | |
| 006575 | generated/1298 Generated | true | 3 B | |
| 006580 | generated/1303 Generated | true | 4 B | |
| 006581 | generated/1304 Generated | true | 107 B | |
| 006585 | generated/1308 Generated | true | 7 B | |
| 006586 | generated/1309 Generated | true | 185 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