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 |
|---|---|---|---|---|
| 007171 | generated/1920 Generated | false | 58 B | |
| 007172 | generated/1921 Generated | false | 17 B | |
| 007173 | generated/1922 Generated | false | 8 B | |
| 007174 | generated/1923 Generated | true | 57 B | |
| 007175 | generated/1924 Generated | true | 44 B | |
| 007176 | generated/1925 Generated | false | 9 B | |
| 007177 | generated/1926 Generated | true | 57 B | |
| 007178 | generated/1927 Generated | true | 13 B | |
| 007179 | generated/1928 Generated | false | 239 B | |
| 007180 | generated/1929 Generated | false | 45 B | |
| 007181 | generated/1930 Generated | true | 343 B | |
| 007182 | generated/1931 Generated | true | 67 B | |
| 007183 | generated/1932 Generated | true | 17 B | |
| 007184 | generated/1933 Generated | true | 358 B | |
| 007185 | generated/1935 Generated | true | 244 B | |
| 007186 | generated/1936 Generated | true | 14 B | |
| 007187 | generated/1937 Generated | false | 36 B | |
| 007188 | generated/1938 Generated | true | 27 B | |
| 007189 | generated/1939 Generated | false | 178 B | |
| 007190 | generated/1940 Generated | true | 218 B | |
| 007191 | generated/1942 Generated | false | 18 B | |
| 007192 | generated/1943 Generated | true | 12 B | |
| 007193 | generated/1944 Generated | false | 237 B | |
| 007194 | generated/1945 Generated | true | 5 B | |
| 007195 | generated/1946 Generated | true | 81 B | |
| 007196 | generated/1947 Generated | true | 3 B | |
| 007197 | generated/1948 Generated | false | 80 B | |
| 007198 | generated/1950 Generated | false | 20 B | |
| 007199 | generated/1951 Generated | false | 7 B | |
| 007200 | generated/1952 Generated | true | 5 B | |
| 007201 | generated/1953 Generated | true | 3 B | |
| 007202 | generated/1954 Generated | false | 11 B | |
| 007203 | generated/1955 Generated | true | 28 B | |
| 007204 | generated/1956 Generated | true | 63 B | |
| 007205 | generated/1957 Generated | true | 4 B | |
| 007206 | generated/1958 Generated | false | 328 B | |
| 007207 | generated/1959 Generated | false | 4 B | |
| 007208 | generated/1960 Generated | false | 3 B | |
| 007209 | generated/1961 Generated | true | 37 B | |
| 007210 | generated/1962 Generated | true | 9 B | |
| 007211 | generated/1963 Generated | true | 67 B | |
| 007212 | generated/1964 Generated | true | 48 B | |
| 007213 | generated/1966 Generated | false | 12 B | |
| 007214 | generated/1967 Generated | true | 355 B | |
| 007215 | generated/1968 Generated | false | 3 B | |
| 007216 | generated/1969 Generated | false | 2 B | |
| 007217 | generated/1970 Generated | false | 5 B | |
| 007218 | generated/1971 Generated | true | 246 B | |
| 007219 | generated/1972 Generated | false | 8 B | |
| 007220 | generated/1973 Generated | true | 48 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