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
200 of 7,246 cases · 81 true · 119 false
| Case | Name | Expected | Note | Size |
|---|---|---|---|---|
| 005769 | generated/0458 Generated | false | 14 B | |
| 005773 | generated/0462 Generated | true | 41 B | |
| 005779 | generated/0470 Generated | false | 10 B | |
| 005803 | generated/0495 Generated | true | 10 B | |
| 005809 | generated/0501 Generated | true | 104 B | |
| 005811 | generated/0503 Generated | true | 48 B | |
| 005836 | generated/0530 Generated | true | 23 B | |
| 005863 | generated/0558 Generated | false | 5 B | |
| 005872 | generated/0568 Generated | true | 37 B | |
| 005875 | generated/0571 Generated | true | 93 B | |
| 005876 | generated/0572 Generated | false | 117 B | |
| 005879 | generated/0575 Generated | false | 94 B | |
| 005882 | generated/0578 Generated | true | 149 B | |
| 005883 | generated/0579 Generated | true | 32 B | |
| 005885 | generated/0581 Generated | true | 145 B | |
| 005890 | generated/0586 Generated | false | 2 B | |
| 005892 | generated/0588 Generated | false | 108 B | |
| 005894 | generated/0590 Generated | true | 4 B | |
| 005896 | generated/0592 Generated | true | 123 B | |
| 005898 | generated/0594 Generated | false | 86 B | |
| 005914 | generated/0611 Generated | true | 133 B | |
| 005915 | generated/0612 Generated | false | 9 B | |
| 005920 | generated/0617 Generated | true | 236 B | |
| 005924 | generated/0621 Generated | false | 32 B | |
| 005937 | generated/0635 Generated | true | 9 B | |
| 005938 | generated/0636 Generated | false | 101 B | |
| 005940 | generated/0638 Generated | true | 320 B | |
| 005966 | generated/0667 Generated | false | 355 B | |
| 005972 | generated/0673 Generated | false | 18 B | |
| 005976 | generated/0677 Generated | false | 9 B | |
| 005990 | generated/0691 Generated | true | 2 B | |
| 005998 | generated/0699 Generated | true | 89 B | |
| 005999 | generated/0700 Generated | true | 2 B | |
| 006000 | generated/0701 Generated | false | 65 B | |
| 006001 | generated/0702 Generated | false | 5 B | |
| 006035 | generated/0737 Generated | false | 2 B | |
| 006038 | generated/0740 Generated | false | 4 B | |
| 006050 | generated/0754 Generated | false | 144 B | |
| 006052 | generated/0756 Generated | true | 3 B | |
| 006057 | generated/0761 Generated | false | 179 B | |
| 006061 | generated/0765 Generated | true | 32 B | |
| 006080 | generated/0784 Generated | false | 3 B | |
| 006107 | generated/0811 Generated | false | 133 B | |
| 006136 | generated/0844 Generated | false | 37 B | |
| 006143 | generated/0852 Generated | false | 8 B | |
| 006152 | generated/0861 Generated | true | 8 B | |
| 006157 | generated/0867 Generated | false | 64 B | |
| 006166 | generated/0877 Generated | false | 4 B | |
| 006170 | generated/0881 Generated | false | 276 B | |
| 006175 | generated/0886 Generated | true | 20 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