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
187 of 7,246 cases · 33 true · 154 false
| Case | Name | Expected | Note | Size |
|---|---|---|---|---|
| 005322 | generated/0001 Generated | false | 48 B | |
| 005345 | generated/0026 Generated | false | 43 B | |
| 005349 | generated/0030 Generated | false | 43 B | |
| 005351 | generated/0032 Generated | true | 75 B | |
| 005373 | generated/0056 Generated | true | 23 B | |
| 005374 | generated/0057 Generated | false | 346 B | |
| 005381 | generated/0066 Generated | false | 44 B | |
| 005391 | generated/0076 Generated | false | 43 B | |
| 005397 | generated/0082 Generated | false | 22 B | |
| 005428 | generated/0113 Generated | false | 44 B | |
| 005449 | generated/0135 Generated | false | 187 B | |
| 005465 | generated/0151 Generated | true | 150 B | |
| 005482 | generated/0168 Generated | true | 5 B | |
| 005510 | generated/0196 Generated | false | 215 B | |
| 005511 | generated/0197 Generated | false | 12 B | |
| 005515 | generated/0201 Generated | false | 54 B | |
| 005516 | generated/0202 Generated | false | 11 B | |
| 005519 | generated/0205 Generated | false | 31 B | |
| 005524 | generated/0210 Generated | true | 11 B | |
| 005536 | generated/0222 Generated | false | 73 B | |
| 005537 | generated/0223 Generated | false | 18 B | |
| 005546 | generated/0232 Generated | false | 11 B | |
| 005562 | generated/0248 Generated | false | 53 B | |
| 005566 | generated/0252 Generated | false | 79 B | |
| 005568 | generated/0254 Generated | false | 29 B | |
| 005587 | generated/0274 Generated | false | 9 B | |
| 005591 | generated/0278 Generated | false | 380 B | |
| 005600 | generated/0288 Generated | false | 36 B | |
| 005608 | generated/0296 Generated | false | 3 B | |
| 005626 | generated/0314 Generated | false | 49 B | |
| 005628 | generated/0316 Generated | false | 291 B | |
| 005647 | generated/0335 Generated | false | 5 B | |
| 005648 | generated/0336 Generated | false | 15 B | |
| 005654 | generated/0342 Generated | false | 70 B | |
| 005655 | generated/0343 Generated | false | 13 B | |
| 005662 | generated/0350 Generated | false | 7 B | |
| 005698 | generated/0386 Generated | false | 59 B | |
| 005699 | generated/0387 Generated | true | 4 B | |
| 005708 | generated/0396 Generated | false | 85 B | |
| 005711 | generated/0399 Generated | true | 349 B | |
| 005737 | generated/0425 Generated | false | 348 B | |
| 005780 | generated/0471 Generated | false | 11 B | |
| 005788 | generated/0479 Generated | true | 191 B | |
| 005826 | generated/0518 Generated | true | 47 B | |
| 005835 | generated/0527 Generated | false | 260 B | |
| 005848 | generated/0543 Generated | false | 66 B | |
| 005850 | generated/0545 Generated | false | 9 B | |
| 005865 | generated/0561 Generated | true | 61 B | |
| 005866 | generated/0562 Generated | false | 6 B | |
| 005899 | generated/0595 Generated | true | 262 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