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 |
|---|---|---|---|---|
| 006421 | generated/1140 Generated | true | 45 B | |
| 006422 | generated/1141 Generated | false | 73 B | |
| 006423 | generated/1142 Generated | false | 330 B | |
| 006424 | generated/1143 Generated | true | 12 B | |
| 006425 | generated/1144 Generated | true | 66 B | |
| 006426 | generated/1145 Generated | true | 379 B | |
| 006427 | generated/1146 Generated | true | 327 B | |
| 006428 | generated/1147 Generated | true | 40 B | |
| 006429 | generated/1148 Generated | true | 26 B | |
| 006430 | generated/1149 Generated | false | 269 B | |
| 006431 | generated/1150 Generated | false | 238 B | |
| 006432 | generated/1151 Generated | true | 319 B | |
| 006433 | generated/1152 Generated | true | 54 B | |
| 006434 | generated/1153 Generated | true | 16 B | |
| 006435 | generated/1154 Generated | false | 320 B | |
| 006436 | generated/1155 Generated | true | 14 B | |
| 006437 | generated/1156 Generated | false | 222 B | |
| 006438 | generated/1157 Generated | false | 309 B | |
| 006439 | generated/1158 Generated | true | 28 B | |
| 006440 | generated/1159 Generated | true | 92 B | |
| 006441 | generated/1160 Generated | true | 5 B | |
| 006442 | generated/1161 Generated | true | 68 B | |
| 006443 | generated/1162 Generated | false | 7 B | |
| 006444 | generated/1163 Generated | true | 377 B | |
| 006445 | generated/1164 Generated | false | 76 B | |
| 006446 | generated/1165 Generated | true | 77 B | |
| 006447 | generated/1166 Generated | true | 137 B | |
| 006448 | generated/1167 Generated | false | 78 B | |
| 006449 | generated/1168 Generated | false | 77 B | |
| 006450 | generated/1169 Generated | true | 9 B | |
| 006451 | generated/1170 Generated | false | 9 B | |
| 006452 | generated/1171 Generated | false | 12 B | |
| 006453 | generated/1172 Generated | true | 23 B | |
| 006454 | generated/1173 Generated | true | 379 B | |
| 006455 | generated/1174 Generated | true | 32 B | |
| 006456 | generated/1175 Generated | false | 65 B | |
| 006457 | generated/1176 Generated | true | 79 B | |
| 006458 | generated/1177 Generated | true | 9 B | |
| 006459 | generated/1178 Generated | false | 3 B | |
| 006460 | generated/1179 Generated | false | 17 B | |
| 006461 | generated/1180 Generated | false | 213 B | |
| 006462 | generated/1181 Generated | true | 15 B | |
| 006463 | generated/1182 Generated | true | 52 B | |
| 006464 | generated/1183 Generated | false | 48 B | |
| 006465 | generated/1184 Generated | true | 76 B | |
| 006466 | generated/1186 Generated | true | 4 B | |
| 006467 | generated/1187 Generated | true | 265 B | |
| 006468 | generated/1188 Generated | true | 7 B | |
| 006469 | generated/1189 Generated | true | 52 B | |
| 006470 | generated/1190 Generated | true | 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