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 |
|---|---|---|---|---|
| 006697 | generated/1426 Generated | false | 12 B | |
| 006699 | generated/1428 Generated | true | 63 B | |
| 006719 | generated/1450 Generated | true | 9 B | |
| 006720 | generated/1451 Generated | true | 109 B | |
| 006742 | generated/1473 Generated | false | 69 B | |
| 006751 | generated/1483 Generated | false | 10 B | |
| 006755 | generated/1487 Generated | true | 6 B | |
| 006772 | generated/1504 Generated | true | 50 B | |
| 006799 | generated/1535 Generated | true | 3 B | |
| 006813 | generated/1549 Generated | false | 25 B | |
| 006815 | generated/1551 Generated | false | 35 B | |
| 006818 | generated/1555 Generated | false | 193 B | |
| 006853 | generated/1590 Generated | false | 112 B | |
| 006854 | generated/1591 Generated | true | 2 B | |
| 006870 | generated/1608 Generated | false | 2 B | |
| 006873 | generated/1611 Generated | true | 38 B | |
| 006888 | generated/1628 Generated | true | 63 B | |
| 006906 | generated/1647 Generated | false | 12 B | |
| 006912 | generated/1654 Generated | true | 92 B | |
| 006914 | generated/1656 Generated | false | 222 B | |
| 006931 | generated/1673 Generated | false | 68 B | |
| 006935 | generated/1677 Generated | true | 12 B | |
| 006940 | generated/1682 Generated | true | 4 B | |
| 006945 | generated/1687 Generated | false | 6 B | |
| 006949 | generated/1691 Generated | false | 5 B | |
| 006950 | generated/1693 Generated | false | 2 B | |
| 006966 | generated/1709 Generated | true | 3 B | |
| 006981 | generated/1724 Generated | false | 181 B | |
| 006988 | generated/1731 Generated | false | 41 B | |
| 006993 | generated/1736 Generated | true | 3 B | |
| 006998 | generated/1741 Generated | false | 364 B | |
| 007003 | generated/1746 Generated | false | 66 B | |
| 007008 | generated/1751 Generated | true | 11 B | |
| 007015 | generated/1758 Generated | false | 7 B | |
| 007023 | generated/1766 Generated | true | 14 B | |
| 007030 | generated/1773 Generated | false | 15 B | |
| 007041 | generated/1785 Generated | false | 42 B | |
| 007066 | generated/1810 Generated | false | 2 B | |
| 007068 | generated/1812 Generated | true | 62 B | |
| 007099 | generated/1843 Generated | true | 94 B | |
| 007115 | generated/1859 Generated | false | 33 B | |
| 007120 | generated/1864 Generated | false | 58 B | |
| 007131 | generated/1876 Generated | false | 60 B | |
| 007139 | generated/1884 Generated | false | 37 B | |
| 007141 | generated/1886 Generated | false | 50 B | |
| 007194 | generated/1945 Generated | true | 5 B | |
| 007196 | generated/1947 Generated | true | 3 B | |
| 007215 | generated/1968 Generated | false | 3 B | |
| 007216 | generated/1969 Generated | false | 2 B | |
| 007219 | generated/1972 Generated | false | 8 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