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 |
|---|---|---|---|---|
| 006350 | generated/1066 Generated | false | 2 B | |
| 006351 | generated/1067 Generated | false | 90 B | |
| 006352 | generated/1068 Generated | true | 9 B | |
| 006353 | generated/1069 Generated | true | 15 B | |
| 006354 | generated/1070 Generated | false | 63 B | |
| 006355 | generated/1071 Generated | true | 19 B | |
| 006356 | generated/1072 Generated | false | 32 B | |
| 006357 | generated/1073 Generated | true | 224 B | |
| 006358 | generated/1074 Generated | true | 52 B | |
| 006359 | generated/1075 Generated | true | 327 B | |
| 006360 | generated/1076 Generated | false | 13 B | |
| 006361 | generated/1078 Generated | true | 81 B | |
| 006362 | generated/1079 Generated | true | 6 B | |
| 006363 | generated/1080 Generated | false | 257 B | |
| 006364 | generated/1081 Generated | true | 12 B | |
| 006365 | generated/1082 Generated | true | 217 B | |
| 006366 | generated/1083 Generated | true | 241 B | |
| 006367 | generated/1084 Generated | false | 61 B | |
| 006368 | generated/1085 Generated | true | 18 B | |
| 006369 | generated/1086 Generated | true | 207 B | |
| 006370 | generated/1087 Generated | false | 44 B | |
| 006371 | generated/1088 Generated | false | 13 B | |
| 006372 | generated/1089 Generated | true | 325 B | |
| 006373 | generated/1090 Generated | true | 249 B | |
| 006374 | generated/1091 Generated | false | 62 B | |
| 006375 | generated/1092 Generated | true | 137 B | |
| 006376 | generated/1093 Generated | false | 4 B | |
| 006377 | generated/1094 Generated | true | 9 B | |
| 006378 | generated/1095 Generated | false | 10 B | |
| 006379 | generated/1096 Generated | false | 17 B | |
| 006380 | generated/1097 Generated | true | 20 B | |
| 006381 | generated/1098 Generated | true | 197 B | |
| 006382 | generated/1099 Generated | false | 6 B | |
| 006383 | generated/1100 Generated | true | 37 B | |
| 006384 | generated/1102 Generated | true | 284 B | |
| 006385 | generated/1103 Generated | true | 254 B | |
| 006386 | generated/1104 Generated | true | 38 B | |
| 006387 | generated/1105 Generated | true | 165 B | |
| 006388 | generated/1106 Generated | true | 196 B | |
| 006389 | generated/1107 Generated | false | 13 B | |
| 006390 | generated/1108 Generated | false | 290 B | |
| 006391 | generated/1109 Generated | true | 140 B | |
| 006392 | generated/1110 Generated | true | 5 B | |
| 006393 | generated/1111 Generated | false | 46 B | |
| 006394 | generated/1112 Generated | true | 21 B | |
| 006395 | generated/1113 Generated | true | 171 B | |
| 006396 | generated/1114 Generated | false | 3 B | |
| 006397 | generated/1115 Generated | true | 4 B | |
| 006398 | generated/1116 Generated | true | 10 B | |
| 006399 | generated/1118 Generated | false | 6 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