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
764 of 7,246 cases · 764 true · 0 false
| Case | Name | Expected | Note | Size |
|---|---|---|---|---|
| 006587 | generated/1310 Generated | true | 246 B | |
| 006590 | generated/1314 Generated | true | 358 B | |
| 006591 | generated/1315 Generated | true | 2 B | |
| 006594 | generated/1318 Generated | true | 165 B | |
| 006595 | generated/1319 Generated | true | 42 B | |
| 006596 | generated/1320 Generated | true | 371 B | |
| 006599 | generated/1323 Generated | true | 211 B | |
| 006600 | generated/1324 Generated | true | 15 B | |
| 006602 | generated/1326 Generated | true | 40 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 | |
| 006609 | generated/1333 Generated | true | 15 B | |
| 006611 | generated/1335 Generated | true | 50 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 | |
| 006621 | generated/1345 Generated | true | 181 B | |
| 006623 | generated/1347 Generated | true | 78 B | |
| 006624 | generated/1348 Generated | true | 30 B | |
| 006625 | generated/1349 Generated | true | 52 B | |
| 006630 | generated/1354 Generated | true | 340 B | |
| 006634 | generated/1358 Generated | true | 5 B | |
| 006635 | generated/1359 Generated | true | 228 B | |
| 006637 | generated/1361 Generated | true | 12 B | |
| 006639 | generated/1363 Generated | true | 42 B | |
| 006643 | generated/1368 Generated | true | 19 B | |
| 006646 | generated/1371 Generated | true | 211 B | |
| 006652 | generated/1379 Generated | true | 376 B | |
| 006659 | generated/1386 Generated | true | 342 B | |
| 006661 | generated/1388 Generated | true | 384 B | |
| 006668 | generated/1396 Generated | true | 51 B | |
| 006670 | generated/1398 Generated | true | 327 B | |
| 006672 | generated/1400 Generated | true | 33 B | |
| 006673 | generated/1401 Generated | true | 12 B | |
| 006675 | generated/1403 Generated | true | 88 B | |
| 006676 | generated/1404 Generated | true | 8 B | |
| 006686 | generated/1414 Generated | true | 310 B | |
| 006691 | generated/1420 Generated | true | 11 B | |
| 006692 | generated/1421 Generated | true | 29 B | |
| 006694 | generated/1423 Generated | true | 381 B | |
| 006695 | generated/1424 Generated | true | 4 B | |
| 006696 | generated/1425 Generated | true | 395 B | |
| 006698 | generated/1427 Generated | true | 6 B | |
| 006700 | generated/1429 Generated | true | 14 B | |
| 006701 | generated/1430 Generated | true | 68 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