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
All 7,246 cases · 2,791 true · 4,455 false
| Case | Name | Expected | Note | Size |
|---|---|---|---|---|
| 005700 | generated/0388 Generated | false | 4 B | |
| 005701 | generated/0389 Generated | true | 9 B | |
| 005702 | generated/0390 Generated | false | 125 B | |
| 005703 | generated/0391 Generated | false | 314 B | |
| 005704 | generated/0392 Generated | false | 226 B | |
| 005705 | generated/0393 Generated | false | 19 B | |
| 005706 | generated/0394 Generated | true | 337 B | |
| 005707 | generated/0395 Generated | false | 302 B | |
| 005708 | generated/0396 Generated | false | 85 B | |
| 005709 | generated/0397 Generated | true | 316 B | |
| 005710 | generated/0398 Generated | true | 244 B | |
| 005711 | generated/0399 Generated | true | 349 B | |
| 005712 | generated/0400 Generated | true | 39 B | |
| 005713 | generated/0401 Generated | false | 69 B | |
| 005714 | generated/0402 Generated | true | 12 B | |
| 005715 | generated/0403 Generated | true | 26 B | |
| 005716 | generated/0404 Generated | false | 37 B | |
| 005717 | generated/0405 Generated | true | 4 B | |
| 005718 | generated/0406 Generated | true | 12 B | |
| 005719 | generated/0407 Generated | true | 361 B | |
| 005720 | generated/0408 Generated | true | 4 B | |
| 005721 | generated/0409 Generated | false | 91 B | |
| 005722 | generated/0410 Generated | false | 64 B | |
| 005723 | generated/0411 Generated | true | 61 B | |
| 005724 | generated/0412 Generated | true | 73 B | |
| 005725 | generated/0413 Generated | true | 10 B | |
| 005726 | generated/0414 Generated | true | 309 B | |
| 005727 | generated/0415 Generated | true | 324 B | |
| 005728 | generated/0416 Generated | true | 362 B | |
| 005729 | generated/0417 Generated | true | 3 B | |
| 005730 | generated/0418 Generated | false | 80 B | |
| 005731 | generated/0419 Generated | true | 79 B | |
| 005732 | generated/0420 Generated | true | 4 B | |
| 005733 | generated/0421 Generated | false | 28 B | |
| 005734 | generated/0422 Generated | false | 14 B | |
| 005735 | generated/0423 Generated | true | 18 B | |
| 005736 | generated/0424 Generated | false | 335 B | |
| 005737 | generated/0425 Generated | false | 348 B | |
| 005738 | generated/0426 Generated | false | 134 B | |
| 005739 | generated/0427 Generated | false | 75 B | |
| 005740 | generated/0428 Generated | true | 12 B | |
| 005741 | generated/0429 Generated | true | 4 B | |
| 005742 | generated/0430 Generated | false | 79 B | |
| 005743 | generated/0431 Generated | false | 52 B | |
| 005744 | generated/0432 Generated | false | 33 B | |
| 005745 | generated/0433 Generated | true | 16 B | |
| 005746 | generated/0434 Generated | false | 4 B | |
| 005747 | generated/0435 Generated | false | 314 B | |
| 005748 | generated/0436 Generated | true | 60 B | |
| 005749 | generated/0437 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