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 |
|---|---|---|---|---|
| 006000 | generated/0701 Generated | false | 65 B | |
| 006001 | generated/0702 Generated | false | 5 B | |
| 006002 | generated/0703 Generated | true | 17 B | |
| 006003 | generated/0704 Generated | true | 6 B | |
| 006004 | generated/0705 Generated | false | 267 B | |
| 006005 | generated/0706 Generated | true | 135 B | |
| 006006 | generated/0707 Generated | true | 335 B | |
| 006007 | generated/0708 Generated | false | 6 B | |
| 006008 | generated/0709 Generated | false | 42 B | |
| 006009 | generated/0710 Generated | true | 16 B | |
| 006010 | generated/0711 Generated | false | 42 B | |
| 006011 | generated/0712 Generated | false | 67 B | |
| 006012 | generated/0713 Generated | false | 308 B | |
| 006013 | generated/0714 Generated | false | 27 B | |
| 006014 | generated/0715 Generated | true | 57 B | |
| 006015 | generated/0716 Generated | false | 42 B | |
| 006016 | generated/0717 Generated | false | 78 B | |
| 006017 | generated/0718 Generated | true | 25 B | |
| 006018 | generated/0719 Generated | false | 19 B | |
| 006019 | generated/0721 Generated | false | 269 B | |
| 006020 | generated/0722 Generated | false | 63 B | |
| 006021 | generated/0723 Generated | true | 42 B | |
| 006022 | generated/0724 Generated | true | 397 B | |
| 006023 | generated/0725 Generated | false | 50 B | |
| 006024 | generated/0726 Generated | false | 7 B | |
| 006025 | generated/0727 Generated | true | 186 B | |
| 006026 | generated/0728 Generated | true | 74 B | |
| 006027 | generated/0729 Generated | false | 59 B | |
| 006028 | generated/0730 Generated | false | 399 B | |
| 006029 | generated/0731 Generated | true | 4 B | |
| 006030 | generated/0732 Generated | true | 79 B | |
| 006031 | generated/0733 Generated | false | 53 B | |
| 006032 | generated/0734 Generated | false | 72 B | |
| 006033 | generated/0735 Generated | true | 13 B | |
| 006034 | generated/0736 Generated | true | 120 B | |
| 006035 | generated/0737 Generated | false | 2 B | |
| 006036 | generated/0738 Generated | false | 134 B | |
| 006037 | generated/0739 Generated | true | 8 B | |
| 006038 | generated/0740 Generated | false | 4 B | |
| 006039 | generated/0741 Generated | true | 7 B | |
| 006040 | generated/0742 Generated | true | 385 B | |
| 006041 | generated/0743 Generated | false | 51 B | |
| 006042 | generated/0744 Generated | false | 7 B | |
| 006043 | generated/0747 Generated | true | 48 B | |
| 006044 | generated/0748 Generated | true | 18 B | |
| 006045 | generated/0749 Generated | true | 346 B | |
| 006046 | generated/0750 Generated | false | 62 B | |
| 006047 | generated/0751 Generated | false | 196 B | |
| 006048 | generated/0752 Generated | true | 312 B | |
| 006049 | generated/0753 Generated | false | 7 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