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 |
|---|---|---|---|---|
| 006900 | generated/1640 Generated | false | 71 B | |
| 006901 | generated/1641 Generated | true | 143 B | |
| 006902 | generated/1642 Generated | true | 258 B | |
| 006903 | generated/1643 Generated | true | 5 B | |
| 006904 | generated/1645 Generated | false | 56 B | |
| 006905 | generated/1646 Generated | true | 51 B | |
| 006906 | generated/1647 Generated | false | 12 B | |
| 006907 | generated/1648 Generated | true | 102 B | |
| 006908 | generated/1649 Generated | false | 33 B | |
| 006909 | generated/1650 Generated | true | 15 B | |
| 006910 | generated/1651 Generated | false | 23 B | |
| 006911 | generated/1653 Generated | true | 99 B | |
| 006912 | generated/1654 Generated | true | 92 B | |
| 006913 | generated/1655 Generated | false | 3 B | |
| 006914 | generated/1656 Generated | false | 222 B | |
| 006915 | generated/1657 Generated | false | 179 B | |
| 006916 | generated/1658 Generated | false | 45 B | |
| 006917 | generated/1659 Generated | false | 70 B | |
| 006918 | generated/1660 Generated | false | 179 B | |
| 006919 | generated/1661 Generated | false | 10 B | |
| 006920 | generated/1662 Generated | true | 13 B | |
| 006921 | generated/1663 Generated | false | 25 B | |
| 006922 | generated/1664 Generated | false | 242 B | |
| 006923 | generated/1665 Generated | false | 8 B | |
| 006924 | generated/1666 Generated | false | 8 B | |
| 006925 | generated/1667 Generated | false | 21 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 | |
| 006931 | generated/1673 Generated | false | 68 B | |
| 006932 | generated/1674 Generated | true | 9 B | |
| 006933 | generated/1675 Generated | true | 59 B | |
| 006934 | generated/1676 Generated | false | 6 B | |
| 006935 | generated/1677 Generated | true | 12 B | |
| 006936 | generated/1678 Generated | true | 97 B | |
| 006937 | generated/1679 Generated | true | 74 B | |
| 006938 | generated/1680 Generated | true | 333 B | |
| 006939 | generated/1681 Generated | true | 13 B | |
| 006940 | generated/1682 Generated | true | 4 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 | |
| 006945 | generated/1687 Generated | false | 6 B | |
| 006946 | generated/1688 Generated | false | 376 B | |
| 006947 | generated/1689 Generated | true | 21 B | |
| 006948 | generated/1690 Generated | true | 22 B | |
| 006949 | generated/1691 Generated | false | 5 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