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 |
|---|---|---|---|---|
| 006721 | generated/1452 Generated | true | 39 B | |
| 006722 | generated/1453 Generated | false | 27 B | |
| 006723 | generated/1454 Generated | true | 166 B | |
| 006724 | generated/1455 Generated | true | 83 B | |
| 006725 | generated/1456 Generated | true | 345 B | |
| 006726 | generated/1457 Generated | false | 378 B | |
| 006727 | generated/1458 Generated | true | 30 B | |
| 006728 | generated/1459 Generated | true | 80 B | |
| 006729 | generated/1460 Generated | true | 132 B | |
| 006730 | generated/1461 Generated | false | 385 B | |
| 006731 | generated/1462 Generated | true | 14 B | |
| 006732 | generated/1463 Generated | false | 32 B | |
| 006733 | generated/1464 Generated | true | 28 B | |
| 006734 | generated/1465 Generated | false | 5 B | |
| 006735 | generated/1466 Generated | true | 28 B | |
| 006736 | generated/1467 Generated | false | 17 B | |
| 006737 | generated/1468 Generated | true | 8 B | |
| 006738 | generated/1469 Generated | false | 15 B | |
| 006739 | generated/1470 Generated | false | 6 B | |
| 006740 | generated/1471 Generated | true | 52 B | |
| 006741 | generated/1472 Generated | true | 14 B | |
| 006742 | generated/1473 Generated | false | 69 B | |
| 006743 | generated/1474 Generated | true | 15 B | |
| 006744 | generated/1475 Generated | true | 9 B | |
| 006745 | generated/1476 Generated | true | 370 B | |
| 006746 | generated/1478 Generated | true | 4 B | |
| 006747 | generated/1479 Generated | true | 52 B | |
| 006748 | generated/1480 Generated | true | 43 B | |
| 006749 | generated/1481 Generated | false | 400 B | |
| 006750 | generated/1482 Generated | false | 179 B | |
| 006751 | generated/1483 Generated | false | 10 B | |
| 006752 | generated/1484 Generated | false | 62 B | |
| 006753 | generated/1485 Generated | false | 397 B | |
| 006754 | generated/1486 Generated | false | 7 B | |
| 006755 | generated/1487 Generated | true | 6 B | |
| 006756 | generated/1488 Generated | true | 307 B | |
| 006757 | generated/1489 Generated | true | 131 B | |
| 006758 | generated/1490 Generated | true | 170 B | |
| 006759 | generated/1491 Generated | true | 13 B | |
| 006760 | generated/1492 Generated | false | 39 B | |
| 006761 | generated/1493 Generated | true | 6 B | |
| 006762 | generated/1494 Generated | true | 159 B | |
| 006763 | generated/1495 Generated | false | 398 B | |
| 006764 | generated/1496 Generated | false | 8 B | |
| 006765 | generated/1497 Generated | true | 13 B | |
| 006766 | generated/1498 Generated | false | 11 B | |
| 006767 | generated/1499 Generated | true | 14 B | |
| 006768 | generated/1500 Generated | false | 4 B | |
| 006769 | generated/1501 Generated | false | 6 B | |
| 006770 | generated/1502 Generated | false | 3 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