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
764 of 7,246 cases · 764 true · 0 false
| Case | Name | Expected | Note | Size |
|---|---|---|---|---|
| 006836 | generated/1573 Generated | true | 35 B | |
| 006839 | generated/1576 Generated | true | 33 B | |
| 006842 | generated/1579 Generated | true | 20 B | |
| 006844 | generated/1581 Generated | true | 315 B | |
| 006846 | generated/1583 Generated | true | 60 B | |
| 006847 | generated/1584 Generated | true | 6 B | |
| 006848 | generated/1585 Generated | true | 290 B | |
| 006850 | generated/1587 Generated | true | 8 B | |
| 006851 | generated/1588 Generated | true | 12 B | |
| 006856 | generated/1594 Generated | true | 370 B | |
| 006858 | generated/1596 Generated | true | 149 B | |
| 006859 | generated/1597 Generated | true | 43 B | |
| 006862 | generated/1600 Generated | true | 397 B | |
| 006864 | generated/1602 Generated | true | 19 B | |
| 006865 | generated/1603 Generated | true | 139 B | |
| 006867 | generated/1605 Generated | true | 121 B | |
| 006871 | generated/1609 Generated | true | 67 B | |
| 006875 | generated/1613 Generated | true | 35 B | |
| 006876 | generated/1614 Generated | true | 233 B | |
| 006879 | generated/1617 Generated | true | 58 B | |
| 006882 | generated/1621 Generated | true | 7 B | |
| 006884 | generated/1624 Generated | true | 4 B | |
| 006885 | generated/1625 Generated | true | 56 B | |
| 006892 | generated/1632 Generated | true | 66 B | |
| 006893 | generated/1633 Generated | true | 39 B | |
| 006894 | generated/1634 Generated | true | 227 B | |
| 006895 | generated/1635 Generated | true | 17 B | |
| 006899 | generated/1639 Generated | true | 297 B | |
| 006901 | generated/1641 Generated | true | 143 B | |
| 006902 | generated/1642 Generated | true | 258 B | |
| 006903 | generated/1643 Generated | true | 5 B | |
| 006905 | generated/1646 Generated | true | 51 B | |
| 006907 | generated/1648 Generated | true | 102 B | |
| 006909 | generated/1650 Generated | true | 15 B | |
| 006926 | generated/1668 Generated | true | 4 B | |
| 006927 | generated/1669 Generated | true | 139 B | |
| 006928 | generated/1670 Generated | true | 301 B | |
| 006929 | generated/1671 Generated | true | 188 B | |
| 006930 | generated/1672 Generated | true | 346 B | |
| 006933 | generated/1675 Generated | true | 59 B | |
| 006936 | generated/1678 Generated | true | 97 B | |
| 006937 | generated/1679 Generated | true | 74 B | |
| 006938 | generated/1680 Generated | true | 333 B | |
| 006941 | generated/1683 Generated | true | 40 B | |
| 006942 | generated/1684 Generated | true | 42 B | |
| 006943 | generated/1685 Generated | true | 105 B | |
| 006944 | generated/1686 Generated | true | 20 B | |
| 006947 | generated/1689 Generated | true | 21 B | |
| 006948 | generated/1690 Generated | true | 22 B | |
| 006953 | generated/1696 Generated | true | 130 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