Reduced out-of-catalog fixture · 1 MiB / 20 patterns
Regex automata duel
Run one existing reduced engine against the deterministic 1,048,576-code-point BMP corpus:
native JavaScript RegExp, the project Thompson-NFA JavaScript engine, or the
project Thompson-to-DFA linear-Wasm scanner.
This is not the full text.regex-engine-duel.v1 contract. That unavailable contract
requires 32 MiB and 40 patterns. This page stays fixed at 1 MiB and 20 patterns, leaves
frozen-v1 coverage at 0/38, and provides no performance ranking, corpus result, or general
engine claim.
Run in a fresh module worker
Unavailable: JavaScript and module workers are required to run this fixture.
Exact checks
Each run verifies the ordered match-tuple SHA-256 and exact code-point, pattern, match, capture, and boundary-crossing counters. A mismatch fails the run; it is never presented as a completed result.
Lifecycle
Start creates a fresh module worker, keeping fixture generation and scanning off the main thread. Cancel, completion, error, navigation, or the fixed 120-second timeout terminates that worker. Token checks ignore stale messages. Fixtures and results remain in memory.
Source and build
- Executed workload adapter
- Exact fixture generator
- Native RegExp source
- Thompson engine source
- Authored Wasm text
- Engine build manifest
- Commit-bound demo manifest
- Closed demo-manifest schema
The controls, fixed scope, source routes, and limitations are in this raw HTML response.
Limitations & Scope
- One deterministic 1 MiB BMP corpus and 20 frozen safe patterns only.
- The full 32 MiB / 40-pattern proposal contract is typed unavailable.
- No uploads, pattern edits, persistence, result submission, or mutation route.
- No durations, rankings, accepted corpus evidence, or comparative conclusion.