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 |
|---|---|---|---|---|
| 005323 | generated/0002 Generated | true | 36 B | |
| 005331 | generated/0011 Generated | false | 147 B | |
| 005337 | generated/0018 Generated | false | 2 B | |
| 005347 | generated/0028 Generated | true | 12 B | |
| 005348 | generated/0029 Generated | true | 4 B | |
| 005361 | generated/0044 Generated | false | 47 B | |
| 005364 | generated/0047 Generated | false | 2 B | |
| 005375 | generated/0058 Generated | true | 31 B | |
| 005398 | generated/0083 Generated | true | 44 B | |
| 005407 | generated/0092 Generated | true | 5 B | |
| 005410 | generated/0095 Generated | false | 2 B | |
| 005422 | generated/0107 Generated | false | 5 B | |
| 005430 | generated/0116 Generated | false | 11 B | |
| 005432 | generated/0118 Generated | true | 23 B | |
| 005439 | generated/0125 Generated | false | 9 B | |
| 005444 | generated/0130 Generated | true | 6 B | |
| 005457 | generated/0143 Generated | false | 5 B | |
| 005462 | generated/0148 Generated | false | 7 B | |
| 005463 | generated/0149 Generated | true | 15 B | |
| 005483 | generated/0169 Generated | false | 181 B | |
| 005484 | generated/0170 Generated | true | 49 B | |
| 005492 | generated/0178 Generated | false | 356 B | |
| 005508 | generated/0194 Generated | false | 160 B | |
| 005512 | generated/0198 Generated | false | 115 B | |
| 005535 | generated/0221 Generated | true | 37 B | |
| 005557 | generated/0243 Generated | false | 10 B | |
| 005573 | generated/0259 Generated | false | 2 B | |
| 005574 | generated/0260 Generated | true | 278 B | |
| 005578 | generated/0265 Generated | false | 11 B | |
| 005592 | generated/0279 Generated | false | 6 B | |
| 005597 | generated/0284 Generated | false | 19 B | |
| 005614 | generated/0302 Generated | true | 43 B | |
| 005616 | generated/0304 Generated | false | 6 B | |
| 005622 | generated/0310 Generated | true | 4 B | |
| 005623 | generated/0311 Generated | false | 15 B | |
| 005649 | generated/0337 Generated | true | 15 B | |
| 005656 | generated/0344 Generated | false | 4 B | |
| 005663 | generated/0351 Generated | false | 223 B | |
| 005671 | generated/0359 Generated | false | 2 B | |
| 005672 | generated/0360 Generated | false | 26 B | |
| 005685 | generated/0373 Generated | false | 2 B | |
| 005688 | generated/0376 Generated | false | 2 B | |
| 005689 | generated/0377 Generated | true | 33 B | |
| 005693 | generated/0381 Generated | false | 74 B | |
| 005721 | generated/0409 Generated | false | 91 B | |
| 005733 | generated/0421 Generated | false | 28 B | |
| 005734 | generated/0422 Generated | false | 14 B | |
| 005743 | generated/0431 Generated | false | 52 B | |
| 005744 | generated/0432 Generated | false | 33 B | |
| 005746 | generated/0434 Generated | false | 4 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