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 |
|---|---|---|---|---|
| 006571 | generated/1294 Generated | true | 6 B | |
| 006572 | generated/1295 Generated | true | 219 B | |
| 006573 | generated/1296 Generated | true | 160 B | |
| 006574 | generated/1297 Generated | true | 298 B | |
| 006575 | generated/1298 Generated | true | 3 B | |
| 006576 | generated/1299 Generated | false | 15 B | |
| 006577 | generated/1300 Generated | true | 21 B | |
| 006578 | generated/1301 Generated | false | 63 B | |
| 006579 | generated/1302 Generated | false | 52 B | |
| 006580 | generated/1303 Generated | true | 4 B | |
| 006581 | generated/1304 Generated | true | 107 B | |
| 006582 | generated/1305 Generated | false | 48 B | |
| 006583 | generated/1306 Generated | true | 184 B | |
| 006584 | generated/1307 Generated | false | 59 B | |
| 006585 | generated/1308 Generated | true | 7 B | |
| 006586 | generated/1309 Generated | true | 185 B | |
| 006587 | generated/1310 Generated | true | 246 B | |
| 006588 | generated/1311 Generated | false | 15 B | |
| 006589 | generated/1312 Generated | false | 10 B | |
| 006590 | generated/1314 Generated | true | 358 B | |
| 006591 | generated/1315 Generated | true | 2 B | |
| 006592 | generated/1316 Generated | false | 5 B | |
| 006593 | generated/1317 Generated | false | 4 B | |
| 006594 | generated/1318 Generated | true | 165 B | |
| 006595 | generated/1319 Generated | true | 42 B | |
| 006596 | generated/1320 Generated | true | 371 B | |
| 006597 | generated/1321 Generated | false | 304 B | |
| 006598 | generated/1322 Generated | true | 19 B | |
| 006599 | generated/1323 Generated | true | 211 B | |
| 006600 | generated/1324 Generated | true | 15 B | |
| 006601 | generated/1325 Generated | false | 12 B | |
| 006602 | generated/1326 Generated | true | 40 B | |
| 006603 | generated/1327 Generated | true | 153 B | |
| 006604 | generated/1328 Generated | true | 177 B | |
| 006605 | generated/1329 Generated | true | 255 B | |
| 006606 | generated/1330 Generated | true | 293 B | |
| 006607 | generated/1331 Generated | true | 15 B | |
| 006608 | generated/1332 Generated | true | 15 B | |
| 006609 | generated/1333 Generated | true | 15 B | |
| 006610 | generated/1334 Generated | false | 49 B | |
| 006611 | generated/1335 Generated | true | 50 B | |
| 006612 | generated/1336 Generated | true | 37 B | |
| 006613 | generated/1337 Generated | true | 37 B | |
| 006614 | generated/1338 Generated | true | 13 B | |
| 006615 | generated/1339 Generated | true | 267 B | |
| 006616 | generated/1340 Generated | true | 109 B | |
| 006617 | generated/1341 Generated | true | 8 B | |
| 006618 | generated/1342 Generated | true | 329 B | |
| 006619 | generated/1343 Generated | false | 14 B | |
| 006620 | generated/1344 Generated | false | 33 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