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 |
|---|---|---|---|---|
| 006300 | generated/1012 Generated | true | 200 B | |
| 006301 | generated/1013 Generated | false | 3 B | |
| 006302 | generated/1014 Generated | true | 64 B | |
| 006303 | generated/1015 Generated | false | 70 B | |
| 006304 | generated/1016 Generated | true | 17 B | |
| 006305 | generated/1017 Generated | false | 66 B | |
| 006306 | generated/1018 Generated | true | 5 B | |
| 006307 | generated/1019 Generated | true | 15 B | |
| 006308 | generated/1020 Generated | false | 49 B | |
| 006309 | generated/1021 Generated | true | 85 B | |
| 006310 | generated/1022 Generated | true | 7 B | |
| 006311 | generated/1023 Generated | true | 6 B | |
| 006312 | generated/1024 Generated | true | 27 B | |
| 006313 | generated/1025 Generated | false | 69 B | |
| 006314 | generated/1026 Generated | true | 42 B | |
| 006315 | generated/1027 Generated | false | 8 B | |
| 006316 | generated/1028 Generated | true | 395 B | |
| 006317 | generated/1029 Generated | false | 18 B | |
| 006318 | generated/1030 Generated | true | 71 B | |
| 006319 | generated/1031 Generated | true | 59 B | |
| 006320 | generated/1032 Generated | false | 74 B | |
| 006321 | generated/1033 Generated | true | 10 B | |
| 006322 | generated/1035 Generated | false | 97 B | |
| 006323 | generated/1036 Generated | true | 78 B | |
| 006324 | generated/1037 Generated | false | 117 B | |
| 006325 | generated/1038 Generated | false | 54 B | |
| 006326 | generated/1039 Generated | false | 39 B | |
| 006327 | generated/1040 Generated | true | 6 B | |
| 006328 | generated/1041 Generated | false | 16 B | |
| 006329 | generated/1043 Generated | false | 16 B | |
| 006330 | generated/1044 Generated | false | 33 B | |
| 006331 | generated/1045 Generated | true | 258 B | |
| 006332 | generated/1046 Generated | true | 10 B | |
| 006333 | generated/1047 Generated | true | 18 B | |
| 006334 | generated/1048 Generated | true | 144 B | |
| 006335 | generated/1049 Generated | true | 216 B | |
| 006336 | generated/1050 Generated | true | 4 B | |
| 006337 | generated/1051 Generated | true | 50 B | |
| 006338 | generated/1052 Generated | false | 305 B | |
| 006339 | generated/1053 Generated | true | 50 B | |
| 006340 | generated/1054 Generated | true | 27 B | |
| 006341 | generated/1055 Generated | true | 278 B | |
| 006342 | generated/1056 Generated | false | 28 B | |
| 006343 | generated/1057 Generated | true | 157 B | |
| 006344 | generated/1058 Generated | true | 61 B | |
| 006345 | generated/1059 Generated | false | 157 B | |
| 006346 | generated/1062 Generated | true | 159 B | |
| 006347 | generated/1063 Generated | true | 10 B | |
| 006348 | generated/1064 Generated | true | 11 B | |
| 006349 | generated/1065 Generated | false | 17 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