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
1,925 of 7,246 cases · 1,057 true · 868 false
| Case | Name | Expected | Note | Size |
|---|---|---|---|---|
| 006821 | generated/1558 Generated | false | 11 B | |
| 006822 | generated/1559 Generated | false | 338 B | |
| 006823 | generated/1560 Generated | true | 365 B | |
| 006824 | generated/1561 Generated | false | 20 B | |
| 006825 | generated/1562 Generated | true | 39 B | |
| 006826 | generated/1563 Generated | true | 322 B | |
| 006827 | generated/1564 Generated | true | 253 B | |
| 006828 | generated/1565 Generated | true | 59 B | |
| 006829 | generated/1566 Generated | true | 13 B | |
| 006830 | generated/1567 Generated | false | 148 B | |
| 006831 | generated/1568 Generated | true | 296 B | |
| 006832 | generated/1569 Generated | false | 14 B | |
| 006833 | generated/1570 Generated | true | 68 B | |
| 006834 | generated/1571 Generated | true | 197 B | |
| 006835 | generated/1572 Generated | true | 99 B | |
| 006836 | generated/1573 Generated | true | 35 B | |
| 006837 | generated/1574 Generated | false | 12 B | |
| 006838 | generated/1575 Generated | false | 52 B | |
| 006839 | generated/1576 Generated | true | 33 B | |
| 006840 | generated/1577 Generated | false | 52 B | |
| 006841 | generated/1578 Generated | false | 2 B | |
| 006842 | generated/1579 Generated | true | 20 B | |
| 006843 | generated/1580 Generated | false | 3 B | |
| 006844 | generated/1581 Generated | true | 315 B | |
| 006845 | generated/1582 Generated | false | 204 B | |
| 006846 | generated/1583 Generated | true | 60 B | |
| 006847 | generated/1584 Generated | true | 6 B | |
| 006848 | generated/1585 Generated | true | 290 B | |
| 006849 | generated/1586 Generated | false | 325 B | |
| 006850 | generated/1587 Generated | true | 8 B | |
| 006851 | generated/1588 Generated | true | 12 B | |
| 006852 | generated/1589 Generated | false | 61 B | |
| 006853 | generated/1590 Generated | false | 112 B | |
| 006854 | generated/1591 Generated | true | 2 B | |
| 006855 | generated/1593 Generated | false | 3 B | |
| 006856 | generated/1594 Generated | true | 370 B | |
| 006857 | generated/1595 Generated | false | 235 B | |
| 006858 | generated/1596 Generated | true | 149 B | |
| 006859 | generated/1597 Generated | true | 43 B | |
| 006860 | generated/1598 Generated | false | 27 B | |
| 006861 | generated/1599 Generated | false | 360 B | |
| 006862 | generated/1600 Generated | true | 397 B | |
| 006863 | generated/1601 Generated | false | 11 B | |
| 006864 | generated/1602 Generated | true | 19 B | |
| 006865 | generated/1603 Generated | true | 139 B | |
| 006866 | generated/1604 Generated | false | 70 B | |
| 006867 | generated/1605 Generated | true | 121 B | |
| 006868 | generated/1606 Generated | false | 27 B | |
| 006869 | generated/1607 Generated | false | 7 B | |
| 006870 | generated/1608 Generated | false | 2 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