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
1,925 of 7,246 cases · 1,057 true · 868 false
| Case | Name | Expected | Note | Size |
|---|---|---|---|---|
| 005771 | generated/0460 Generated | true | 8 B | |
| 005772 | generated/0461 Generated | false | 73 B | |
| 005773 | generated/0462 Generated | true | 41 B | |
| 005774 | generated/0463 Generated | false | 5 B | |
| 005775 | generated/0465 Generated | false | 20 B | |
| 005776 | generated/0466 Generated | false | 346 B | |
| 005777 | generated/0468 Generated | false | 9 B | |
| 005778 | generated/0469 Generated | true | 8 B | |
| 005779 | generated/0470 Generated | false | 10 B | |
| 005780 | generated/0471 Generated | false | 11 B | |
| 005781 | generated/0472 Generated | false | 4 B | |
| 005782 | generated/0473 Generated | true | 73 B | |
| 005783 | generated/0474 Generated | true | 16 B | |
| 005784 | generated/0475 Generated | true | 114 B | |
| 005785 | generated/0476 Generated | true | 396 B | |
| 005786 | generated/0477 Generated | true | 6 B | |
| 005787 | generated/0478 Generated | true | 2 B | |
| 005788 | generated/0479 Generated | true | 191 B | |
| 005789 | generated/0480 Generated | true | 197 B | |
| 005790 | generated/0481 Generated | false | 20 B | |
| 005791 | generated/0482 Generated | false | 4 B | |
| 005792 | generated/0483 Generated | false | 358 B | |
| 005793 | generated/0484 Generated | true | 204 B | |
| 005794 | generated/0485 Generated | true | 44 B | |
| 005795 | generated/0487 Generated | false | 68 B | |
| 005796 | generated/0488 Generated | true | 14 B | |
| 005797 | generated/0489 Generated | true | 333 B | |
| 005798 | generated/0490 Generated | true | 13 B | |
| 005799 | generated/0491 Generated | true | 4 B | |
| 005800 | generated/0492 Generated | false | 17 B | |
| 005801 | generated/0493 Generated | true | 75 B | |
| 005802 | generated/0494 Generated | true | 14 B | |
| 005803 | generated/0495 Generated | true | 10 B | |
| 005804 | generated/0496 Generated | false | 73 B | |
| 005805 | generated/0497 Generated | true | 4 B | |
| 005806 | generated/0498 Generated | true | 50 B | |
| 005807 | generated/0499 Generated | true | 64 B | |
| 005808 | generated/0500 Generated | false | 44 B | |
| 005809 | generated/0501 Generated | true | 104 B | |
| 005810 | generated/0502 Generated | true | 52 B | |
| 005811 | generated/0503 Generated | true | 48 B | |
| 005812 | generated/0504 Generated | true | 69 B | |
| 005813 | generated/0505 Generated | true | 15 B | |
| 005814 | generated/0506 Generated | false | 17 B | |
| 005815 | generated/0507 Generated | true | 206 B | |
| 005816 | generated/0508 Generated | true | 71 B | |
| 005817 | generated/0509 Generated | true | 75 B | |
| 005818 | generated/0510 Generated | false | 13 B | |
| 005819 | generated/0511 Generated | true | 54 B | |
| 005820 | generated/0512 Generated | false | 246 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