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 |
|---|---|---|---|---|
| 005571 | generated/0257 Generated | true | 12 B | |
| 005572 | generated/0258 Generated | true | 114 B | |
| 005573 | generated/0259 Generated | false | 2 B | |
| 005574 | generated/0260 Generated | true | 278 B | |
| 005575 | generated/0261 Generated | false | 23 B | |
| 005576 | generated/0262 Generated | false | 393 B | |
| 005577 | generated/0263 Generated | true | 20 B | |
| 005578 | generated/0265 Generated | false | 11 B | |
| 005579 | generated/0266 Generated | true | 15 B | |
| 005580 | generated/0267 Generated | true | 346 B | |
| 005581 | generated/0268 Generated | true | 30 B | |
| 005582 | generated/0269 Generated | false | 17 B | |
| 005583 | generated/0270 Generated | true | 36 B | |
| 005584 | generated/0271 Generated | false | 75 B | |
| 005585 | generated/0272 Generated | true | 10 B | |
| 005586 | generated/0273 Generated | false | 70 B | |
| 005587 | generated/0274 Generated | false | 9 B | |
| 005588 | generated/0275 Generated | true | 389 B | |
| 005589 | generated/0276 Generated | false | 24 B | |
| 005590 | generated/0277 Generated | true | 62 B | |
| 005591 | generated/0278 Generated | false | 380 B | |
| 005592 | generated/0279 Generated | false | 6 B | |
| 005593 | generated/0280 Generated | true | 26 B | |
| 005594 | generated/0281 Generated | false | 337 B | |
| 005595 | generated/0282 Generated | true | 6 B | |
| 005596 | generated/0283 Generated | true | 46 B | |
| 005597 | generated/0284 Generated | false | 19 B | |
| 005598 | generated/0286 Generated | false | 147 B | |
| 005599 | generated/0287 Generated | true | 8 B | |
| 005600 | generated/0288 Generated | false | 36 B | |
| 005601 | generated/0289 Generated | false | 15 B | |
| 005602 | generated/0290 Generated | false | 71 B | |
| 005603 | generated/0291 Generated | true | 68 B | |
| 005604 | generated/0292 Generated | true | 74 B | |
| 005605 | generated/0293 Generated | false | 13 B | |
| 005606 | generated/0294 Generated | false | 20 B | |
| 005607 | generated/0295 Generated | false | 4 B | |
| 005608 | generated/0296 Generated | false | 3 B | |
| 005609 | generated/0297 Generated | false | 9 B | |
| 005610 | generated/0298 Generated | false | 10 B | |
| 005611 | generated/0299 Generated | false | 50 B | |
| 005612 | generated/0300 Generated | true | 94 B | |
| 005613 | generated/0301 Generated | false | 29 B | |
| 005614 | generated/0302 Generated | true | 43 B | |
| 005615 | generated/0303 Generated | false | 192 B | |
| 005616 | generated/0304 Generated | false | 6 B | |
| 005617 | generated/0305 Generated | true | 114 B | |
| 005618 | generated/0306 Generated | true | 194 B | |
| 005619 | generated/0307 Generated | false | 33 B | |
| 005620 | generated/0308 Generated | true | 4 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