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 |
|---|---|---|---|---|
| 006250 | generated/0962 Generated | true | 55 B | |
| 006251 | generated/0963 Generated | true | 12 B | |
| 006252 | generated/0964 Generated | true | 194 B | |
| 006253 | generated/0965 Generated | true | 70 B | |
| 006254 | generated/0966 Generated | false | 7 B | |
| 006255 | generated/0967 Generated | true | 7 B | |
| 006256 | generated/0968 Generated | true | 4 B | |
| 006257 | generated/0969 Generated | false | 324 B | |
| 006258 | generated/0970 Generated | true | 9 B | |
| 006259 | generated/0971 Generated | true | 257 B | |
| 006260 | generated/0972 Generated | true | 163 B | |
| 006261 | generated/0973 Generated | true | 256 B | |
| 006262 | generated/0974 Generated | false | 5 B | |
| 006263 | generated/0975 Generated | false | 6 B | |
| 006264 | generated/0976 Generated | true | 9 B | |
| 006265 | generated/0977 Generated | true | 56 B | |
| 006266 | generated/0978 Generated | true | 3 B | |
| 006267 | generated/0979 Generated | true | 13 B | |
| 006268 | generated/0980 Generated | false | 175 B | |
| 006269 | generated/0981 Generated | true | 14 B | |
| 006270 | generated/0982 Generated | false | 13 B | |
| 006271 | generated/0983 Generated | true | 60 B | |
| 006272 | generated/0984 Generated | false | 3 B | |
| 006273 | generated/0985 Generated | true | 340 B | |
| 006274 | generated/0986 Generated | false | 6 B | |
| 006275 | generated/0987 Generated | true | 165 B | |
| 006276 | generated/0988 Generated | true | 16 B | |
| 006277 | generated/0989 Generated | true | 219 B | |
| 006278 | generated/0990 Generated | true | 82 B | |
| 006279 | generated/0991 Generated | true | 5 B | |
| 006280 | generated/0992 Generated | false | 380 B | |
| 006281 | generated/0993 Generated | true | 79 B | |
| 006282 | generated/0994 Generated | true | 3 B | |
| 006283 | generated/0995 Generated | true | 4 B | |
| 006284 | generated/0996 Generated | false | 30 B | |
| 006285 | generated/0997 Generated | false | 91 B | |
| 006286 | generated/0998 Generated | true | 61 B | |
| 006287 | generated/0999 Generated | true | 396 B | |
| 006288 | generated/1000 Generated | true | 29 B | |
| 006289 | generated/1001 Generated | true | 11 B | |
| 006290 | generated/1002 Generated | false | 120 B | |
| 006291 | generated/1003 Generated | false | 3 B | |
| 006292 | generated/1004 Generated | true | 356 B | |
| 006293 | generated/1005 Generated | true | 9 B | |
| 006294 | generated/1006 Generated | false | 50 B | |
| 006295 | generated/1007 Generated | false | 27 B | |
| 006296 | generated/1008 Generated | true | 60 B | |
| 006297 | generated/1009 Generated | true | 60 B | |
| 006298 | generated/1010 Generated | false | 7 B | |
| 006299 | generated/1011 Generated | true | 76 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