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 |
|---|---|---|---|---|
| 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 | |
| 005821 | generated/0513 Generated | true | 67 B | |
| 005822 | generated/0514 Generated | false | 47 B | |
| 005823 | generated/0515 Generated | false | 153 B | |
| 005824 | generated/0516 Generated | false | 43 B | |
| 005825 | generated/0517 Generated | false | 148 B | |
| 005826 | generated/0518 Generated | true | 47 B | |
| 005827 | generated/0519 Generated | false | 246 B | |
| 005828 | generated/0520 Generated | false | 10 B | |
| 005829 | generated/0521 Generated | false | 320 B | |
| 005830 | generated/0522 Generated | true | 33 B | |
| 005831 | generated/0523 Generated | false | 17 B | |
| 005832 | generated/0524 Generated | true | 105 B | |
| 005833 | generated/0525 Generated | true | 48 B | |
| 005834 | generated/0526 Generated | true | 106 B | |
| 005835 | generated/0527 Generated | false | 260 B | |
| 005836 | generated/0530 Generated | true | 23 B | |
| 005837 | generated/0531 Generated | true | 313 B | |
| 005838 | generated/0532 Generated | true | 68 B | |
| 005839 | generated/0534 Generated | true | 15 B | |
| 005840 | generated/0535 Generated | true | 379 B | |
| 005841 | generated/0536 Generated | true | 69 B | |
| 005842 | generated/0537 Generated | true | 76 B | |
| 005843 | generated/0538 Generated | true | 15 B | |
| 005844 | generated/0539 Generated | true | 346 B | |
| 005845 | generated/0540 Generated | true | 361 B | |
| 005846 | generated/0541 Generated | true | 263 B | |
| 005847 | generated/0542 Generated | false | 20 B | |
| 005848 | generated/0543 Generated | false | 66 B | |
| 005849 | generated/0544 Generated | false | 7 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