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 |
|---|---|---|---|---|
| 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 | |
| 005621 | generated/0309 Generated | true | 6 B | |
| 005622 | generated/0310 Generated | true | 4 B | |
| 005623 | generated/0311 Generated | false | 15 B | |
| 005624 | generated/0312 Generated | true | 139 B | |
| 005625 | generated/0313 Generated | false | 12 B | |
| 005626 | generated/0314 Generated | false | 49 B | |
| 005627 | generated/0315 Generated | false | 76 B | |
| 005628 | generated/0316 Generated | false | 291 B | |
| 005629 | generated/0317 Generated | false | 42 B | |
| 005630 | generated/0318 Generated | true | 33 B | |
| 005631 | generated/0319 Generated | true | 24 B | |
| 005632 | generated/0320 Generated | true | 26 B | |
| 005633 | generated/0321 Generated | false | 6 B | |
| 005634 | generated/0322 Generated | true | 19 B | |
| 005635 | generated/0323 Generated | false | 42 B | |
| 005636 | generated/0324 Generated | false | 161 B | |
| 005637 | generated/0325 Generated | true | 52 B | |
| 005638 | generated/0326 Generated | true | 131 B | |
| 005639 | generated/0327 Generated | false | 73 B | |
| 005640 | generated/0328 Generated | true | 20 B | |
| 005641 | generated/0329 Generated | true | 161 B | |
| 005642 | generated/0330 Generated | true | 85 B | |
| 005643 | generated/0331 Generated | true | 11 B | |
| 005644 | generated/0332 Generated | true | 2 B | |
| 005645 | generated/0333 Generated | true | 40 B | |
| 005646 | generated/0334 Generated | true | 68 B | |
| 005647 | generated/0335 Generated | false | 5 B | |
| 005648 | generated/0336 Generated | false | 15 B | |
| 005649 | generated/0337 Generated | true | 15 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