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
205 of 7,246 cases · 0 true · 205 false
| Case | Name | Expected | Note | Size |
|---|---|---|---|---|
| 006317 | generated/1029 Generated | false | 18 B | |
| 006324 | generated/1037 Generated | false | 117 B | |
| 006325 | generated/1038 Generated | false | 54 B | |
| 006326 | generated/1039 Generated | false | 39 B | |
| 006328 | generated/1041 Generated | false | 16 B | |
| 006338 | generated/1052 Generated | false | 305 B | |
| 006342 | generated/1056 Generated | false | 28 B | |
| 006349 | generated/1065 Generated | false | 17 B | |
| 006351 | generated/1067 Generated | false | 90 B | |
| 006360 | generated/1076 Generated | false | 13 B | |
| 006363 | generated/1080 Generated | false | 257 B | |
| 006370 | generated/1087 Generated | false | 44 B | |
| 006376 | generated/1093 Generated | false | 4 B | |
| 006378 | generated/1095 Generated | false | 10 B | |
| 006382 | generated/1099 Generated | false | 6 B | |
| 006393 | generated/1111 Generated | false | 46 B | |
| 006402 | generated/1121 Generated | false | 126 B | |
| 006411 | generated/1130 Generated | false | 5 B | |
| 006435 | generated/1154 Generated | false | 320 B | |
| 006445 | generated/1164 Generated | false | 76 B | |
| 006473 | generated/1193 Generated | false | 75 B | |
| 006497 | generated/1217 Generated | false | 332 B | |
| 006513 | generated/1234 Generated | false | 80 B | |
| 006516 | generated/1237 Generated | false | 17 B | |
| 006523 | generated/1244 Generated | false | 16 B | |
| 006537 | generated/1258 Generated | false | 18 B | |
| 006548 | generated/1270 Generated | false | 74 B | |
| 006563 | generated/1286 Generated | false | 343 B | |
| 006568 | generated/1291 Generated | false | 6 B | |
| 006588 | generated/1311 Generated | false | 15 B | |
| 006601 | generated/1325 Generated | false | 12 B | |
| 006619 | generated/1343 Generated | false | 14 B | |
| 006620 | generated/1344 Generated | false | 33 B | |
| 006626 | generated/1350 Generated | false | 308 B | |
| 006655 | generated/1382 Generated | false | 8 B | |
| 006663 | generated/1390 Generated | false | 4 B | |
| 006679 | generated/1407 Generated | false | 14 B | |
| 006680 | generated/1408 Generated | false | 14 B | |
| 006685 | generated/1413 Generated | false | 3 B | |
| 006703 | generated/1432 Generated | false | 33 B | |
| 006706 | generated/1435 Generated | false | 37 B | |
| 006707 | generated/1436 Generated | false | 67 B | |
| 006709 | generated/1438 Generated | false | 33 B | |
| 006732 | generated/1463 Generated | false | 32 B | |
| 006738 | generated/1469 Generated | false | 15 B | |
| 006752 | generated/1484 Generated | false | 62 B | |
| 006753 | generated/1485 Generated | false | 397 B | |
| 006763 | generated/1495 Generated | false | 398 B | |
| 006764 | generated/1496 Generated | false | 8 B | |
| 006777 | generated/1510 Generated | false | 22 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