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 |
|---|---|---|---|---|
| 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 | |
| 006621 | generated/1345 Generated | true | 181 B | |
| 006622 | generated/1346 Generated | true | 4 B | |
| 006623 | generated/1347 Generated | true | 78 B | |
| 006624 | generated/1348 Generated | true | 30 B | |
| 006625 | generated/1349 Generated | true | 52 B | |
| 006626 | generated/1350 Generated | false | 308 B | |
| 006627 | generated/1351 Generated | false | 14 B | |
| 006628 | generated/1352 Generated | false | 68 B | |
| 006629 | generated/1353 Generated | false | 54 B | |
| 006630 | generated/1354 Generated | true | 340 B | |
| 006631 | generated/1355 Generated | false | 71 B | |
| 006632 | generated/1356 Generated | false | 24 B | |
| 006633 | generated/1357 Generated | false | 389 B | |
| 006634 | generated/1358 Generated | true | 5 B | |
| 006635 | generated/1359 Generated | true | 228 B | |
| 006636 | generated/1360 Generated | true | 4 B | |
| 006637 | generated/1361 Generated | true | 12 B | |
| 006638 | generated/1362 Generated | true | 18 B | |
| 006639 | generated/1363 Generated | true | 42 B | |
| 006640 | generated/1364 Generated | false | 10 B | |
| 006641 | generated/1365 Generated | false | 25 B | |
| 006642 | generated/1366 Generated | false | 3 B | |
| 006643 | generated/1368 Generated | true | 19 B | |
| 006644 | generated/1369 Generated | true | 9 B | |
| 006645 | generated/1370 Generated | false | 20 B | |
| 006646 | generated/1371 Generated | true | 211 B | |
| 006647 | generated/1373 Generated | false | 12 B | |
| 006648 | generated/1375 Generated | true | 152 B | |
| 006649 | generated/1376 Generated | false | 241 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