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
2,070 of 7,246 cases · 761 true · 1,309 false
| Case | Name | Expected | Note | Size |
|---|---|---|---|---|
| 002704 | regression/E0 9F BF at 80 in ASCII Focused regression | false | 128 B | |
| 002705 | regression/E0 9F BF at 81 in ASCII Focused regression | false | 128 B | |
| 002706 | regression/E0 9F BF at 92 in ASCII Focused regression | false | 128 B | |
| 002707 | regression/E0 9F BF at 93 in ASCII Focused regression | false | 128 B | |
| 002708 | regression/E0 9F BF at 94 in ASCII Focused regression | false | 128 B | |
| 002709 | regression/E0 9F BF at 95 in ASCII Focused regression | false | 128 B | |
| 002710 | regression/E0 9F BF at 96 in ASCII Focused regression | false | 128 B | |
| 002711 | regression/E0 9F BF at 97 in ASCII Focused regression | false | 128 B | |
| 002712 | regression/E0 9F BF at 108 in ASCII Focused regression | false | 128 B | |
| 002713 | regression/E0 9F BF at 109 in ASCII Focused regression | false | 128 B | |
| 002714 | regression/E0 9F BF at 110 in ASCII Focused regression | false | 128 B | |
| 002715 | regression/E0 9F BF at 111 in ASCII Focused regression | false | 128 B | |
| 002716 | regression/E0 9F BF at 112 in ASCII Focused regression | false | 128 B | |
| 002717 | regression/E0 9F BF at 113 in ASCII Focused regression | false | 128 B | |
| 002718 | regression/E0 9F BF at 124 in ASCII Focused regression | false | 128 B | |
| 002719 | regression/F0 8F BF BF at 0 in ASCII Focused regression | false | 128 B | |
| 002720 | regression/F0 8F BF BF at 1 in ASCII Focused regression | false | 128 B | |
| 002721 | regression/F0 8F BF BF at 12 in ASCII Focused regression | false | 128 B | |
| 002722 | regression/F0 8F BF BF at 13 in ASCII Focused regression | false | 128 B | |
| 002723 | regression/F0 8F BF BF at 14 in ASCII Focused regression | false | 128 B | |
| 002724 | regression/F0 8F BF BF at 15 in ASCII Focused regression | false | 128 B | |
| 002725 | regression/F0 8F BF BF at 16 in ASCII Focused regression | false | 128 B | |
| 002726 | regression/F0 8F BF BF at 17 in ASCII Focused regression | false | 128 B | |
| 002727 | regression/F0 8F BF BF at 28 in ASCII Focused regression | false | 128 B | |
| 002728 | regression/F0 8F BF BF at 29 in ASCII Focused regression | false | 128 B | |
| 002729 | regression/F0 8F BF BF at 30 in ASCII Focused regression | false | 128 B | |
| 002730 | regression/F0 8F BF BF at 31 in ASCII Focused regression | false | 128 B | |
| 002731 | regression/F0 8F BF BF at 32 in ASCII Focused regression | false | 128 B | |
| 002732 | regression/F0 8F BF BF at 33 in ASCII Focused regression | false | 128 B | |
| 002733 | regression/F0 8F BF BF at 44 in ASCII Focused regression | false | 128 B | |
| 002734 | regression/F0 8F BF BF at 45 in ASCII Focused regression | false | 128 B | |
| 002735 | regression/F0 8F BF BF at 46 in ASCII Focused regression | false | 128 B | |
| 002736 | regression/F0 8F BF BF at 47 in ASCII Focused regression | false | 128 B | |
| 002737 | regression/F0 8F BF BF at 48 in ASCII Focused regression | false | 128 B | |
| 002738 | regression/F0 8F BF BF at 49 in ASCII Focused regression | false | 128 B | |
| 002739 | regression/F0 8F BF BF at 60 in ASCII Focused regression | false | 128 B | |
| 002740 | regression/F0 8F BF BF at 61 in ASCII Focused regression | false | 128 B | |
| 002741 | regression/F0 8F BF BF at 62 in ASCII Focused regression | false | 128 B | |
| 002742 | regression/F0 8F BF BF at 63 in ASCII Focused regression | false | 128 B | |
| 002743 | regression/F0 8F BF BF at 64 in ASCII Focused regression | false | 128 B | |
| 002744 | regression/F0 8F BF BF at 65 in ASCII Focused regression | false | 128 B | |
| 002745 | regression/F0 8F BF BF at 76 in ASCII Focused regression | false | 128 B | |
| 002746 | regression/F0 8F BF BF at 77 in ASCII Focused regression | false | 128 B | |
| 002747 | regression/F0 8F BF BF at 78 in ASCII Focused regression | false | 128 B | |
| 002748 | regression/F0 8F BF BF at 79 in ASCII Focused regression | false | 128 B | |
| 002749 | regression/F0 8F BF BF at 80 in ASCII Focused regression | false | 128 B | |
| 002750 | regression/F0 8F BF BF at 81 in ASCII Focused regression | false | 128 B | |
| 002751 | regression/F0 8F BF BF at 92 in ASCII Focused regression | false | 128 B | |
| 002752 | regression/F0 8F BF BF at 93 in ASCII Focused regression | false | 128 B | |
| 002753 | regression/F0 8F BF BF at 94 in ASCII Focused regression | false | 128 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