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 |
|---|---|---|---|---|
| 006100 | generated/0804 Generated | true | 12 B | |
| 006101 | generated/0805 Generated | true | 42 B | |
| 006102 | generated/0806 Generated | false | 387 B | |
| 006103 | generated/0807 Generated | true | 63 B | |
| 006104 | generated/0808 Generated | false | 292 B | |
| 006105 | generated/0809 Generated | true | 4 B | |
| 006106 | generated/0810 Generated | true | 73 B | |
| 006107 | generated/0811 Generated | false | 133 B | |
| 006108 | generated/0812 Generated | false | 10 B | |
| 006109 | generated/0813 Generated | false | 15 B | |
| 006110 | generated/0814 Generated | true | 45 B | |
| 006111 | generated/0815 Generated | false | 3 B | |
| 006112 | generated/0817 Generated | true | 12 B | |
| 006113 | generated/0818 Generated | true | 3 B | |
| 006114 | generated/0819 Generated | false | 168 B | |
| 006115 | generated/0820 Generated | false | 277 B | |
| 006116 | generated/0821 Generated | true | 272 B | |
| 006117 | generated/0822 Generated | true | 6 B | |
| 006118 | generated/0823 Generated | true | 377 B | |
| 006119 | generated/0824 Generated | false | 57 B | |
| 006120 | generated/0825 Generated | true | 266 B | |
| 006121 | generated/0826 Generated | true | 37 B | |
| 006122 | generated/0827 Generated | true | 236 B | |
| 006123 | generated/0828 Generated | true | 13 B | |
| 006124 | generated/0829 Generated | false | 27 B | |
| 006125 | generated/0830 Generated | true | 60 B | |
| 006126 | generated/0831 Generated | false | 30 B | |
| 006127 | generated/0833 Generated | false | 14 B | |
| 006128 | generated/0834 Generated | true | 183 B | |
| 006129 | generated/0835 Generated | false | 23 B | |
| 006130 | generated/0836 Generated | false | 4 B | |
| 006131 | generated/0837 Generated | false | 7 B | |
| 006132 | generated/0838 Generated | false | 74 B | |
| 006133 | generated/0839 Generated | false | 15 B | |
| 006134 | generated/0840 Generated | false | 266 B | |
| 006135 | generated/0842 Generated | true | 83 B | |
| 006136 | generated/0844 Generated | false | 37 B | |
| 006137 | generated/0845 Generated | false | 8 B | |
| 006138 | generated/0846 Generated | false | 60 B | |
| 006139 | generated/0847 Generated | false | 43 B | |
| 006140 | generated/0849 Generated | true | 61 B | |
| 006141 | generated/0850 Generated | true | 16 B | |
| 006142 | generated/0851 Generated | true | 74 B | |
| 006143 | generated/0852 Generated | false | 8 B | |
| 006144 | generated/0853 Generated | true | 80 B | |
| 006145 | generated/0854 Generated | false | 350 B | |
| 006146 | generated/0855 Generated | true | 211 B | |
| 006147 | generated/0856 Generated | true | 262 B | |
| 006148 | generated/0857 Generated | true | 260 B | |
| 006149 | generated/0858 Generated | true | 104 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