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 |
|---|---|---|---|---|
| 006050 | generated/0754 Generated | false | 144 B | |
| 006051 | generated/0755 Generated | true | 5 B | |
| 006052 | generated/0756 Generated | true | 3 B | |
| 006053 | generated/0757 Generated | false | 157 B | |
| 006054 | generated/0758 Generated | false | 370 B | |
| 006055 | generated/0759 Generated | true | 60 B | |
| 006056 | generated/0760 Generated | true | 40 B | |
| 006057 | generated/0761 Generated | false | 179 B | |
| 006058 | generated/0762 Generated | false | 3 B | |
| 006059 | generated/0763 Generated | false | 20 B | |
| 006060 | generated/0764 Generated | true | 72 B | |
| 006061 | generated/0765 Generated | true | 32 B | |
| 006062 | generated/0766 Generated | false | 92 B | |
| 006063 | generated/0767 Generated | true | 82 B | |
| 006064 | generated/0768 Generated | true | 15 B | |
| 006065 | generated/0769 Generated | false | 27 B | |
| 006066 | generated/0770 Generated | false | 13 B | |
| 006067 | generated/0771 Generated | true | 64 B | |
| 006068 | generated/0772 Generated | true | 388 B | |
| 006069 | generated/0773 Generated | false | 403 B | |
| 006070 | generated/0774 Generated | true | 6 B | |
| 006071 | generated/0775 Generated | true | 180 B | |
| 006072 | generated/0776 Generated | false | 17 B | |
| 006073 | generated/0777 Generated | false | 14 B | |
| 006074 | generated/0778 Generated | true | 12 B | |
| 006075 | generated/0779 Generated | false | 212 B | |
| 006076 | generated/0780 Generated | true | 14 B | |
| 006077 | generated/0781 Generated | false | 113 B | |
| 006078 | generated/0782 Generated | true | 51 B | |
| 006079 | generated/0783 Generated | false | 364 B | |
| 006080 | generated/0784 Generated | false | 3 B | |
| 006081 | generated/0785 Generated | false | 56 B | |
| 006082 | generated/0786 Generated | false | 15 B | |
| 006083 | generated/0787 Generated | true | 59 B | |
| 006084 | generated/0788 Generated | true | 4 B | |
| 006085 | generated/0789 Generated | true | 39 B | |
| 006086 | generated/0790 Generated | true | 76 B | |
| 006087 | generated/0791 Generated | true | 166 B | |
| 006088 | generated/0792 Generated | true | 17 B | |
| 006089 | generated/0793 Generated | false | 23 B | |
| 006090 | generated/0794 Generated | true | 72 B | |
| 006091 | generated/0795 Generated | false | 13 B | |
| 006092 | generated/0796 Generated | true | 17 B | |
| 006093 | generated/0797 Generated | false | 121 B | |
| 006094 | generated/0798 Generated | false | 188 B | |
| 006095 | generated/0799 Generated | true | 110 B | |
| 006096 | generated/0800 Generated | true | 159 B | |
| 006097 | generated/0801 Generated | false | 11 B | |
| 006098 | generated/0802 Generated | true | 9 B | |
| 006099 | generated/0803 Generated | false | 317 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