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 |
|---|---|---|---|---|
| 007221 | generated/1974 Generated | true | 212 B | |
| 007222 | generated/1975 Generated | false | 6 B | |
| 007223 | generated/1976 Generated | true | 144 B | |
| 007224 | generated/1977 Generated | true | 379 B | |
| 007225 | generated/1978 Generated | true | 68 B | |
| 007226 | generated/1979 Generated | false | 30 B | |
| 007227 | generated/1980 Generated | false | 3 B | |
| 007228 | generated/1981 Generated | true | 11 B | |
| 007229 | generated/1982 Generated | true | 4 B | |
| 007230 | generated/1983 Generated | false | 159 B | |
| 007231 | generated/1984 Generated | true | 32 B | |
| 007232 | generated/1985 Generated | false | 18 B | |
| 007233 | generated/1986 Generated | false | 10 B | |
| 007234 | generated/1987 Generated | false | 70 B | |
| 007235 | generated/1988 Generated | true | 11 B | |
| 007236 | generated/1989 Generated | false | 86 B | |
| 007237 | generated/1990 Generated | true | 239 B | |
| 007238 | generated/1991 Generated | true | 11 B | |
| 007239 | generated/1993 Generated | false | 223 B | |
| 007240 | generated/1994 Generated | false | 10 B | |
| 007241 | generated/1995 Generated | true | 8 B | |
| 007242 | generated/1996 Generated | false | 171 B | |
| 007243 | generated/1997 Generated | true | 326 B | |
| 007244 | generated/1998 Generated | false | 53 B | |
| 007245 | generated/1999 Generated | false | 13 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