ata-validator 1.42.0 → 1.43.0

package/lib/scan-compiler.js

@@ -90,6 +90,22 @@ const BASE_CHANGING = new Set(['$id', '$anchor', '$dynamicAnchor', '$dynamicRef'
 // it. Sized for a node per declared property of a large generated schema,
 // not just for hand-written ones.
 const MAX_NODES = 8192;
+// See the size checks in compileScanner. One function past 64 KB is what V8's
+// Maglev tier aborted on: SchemaStore scanners of 0.5 to 1 MB, single
+// functions before references became calls. The total bounds the memory a
+// scanner takes.
+const MAX_FUNCTION_SOURCE = 64 * 1024;
+const MAX_SOURCE = 2 * 1024 * 1024;
+// A reference target is expanded at each reference while its expansions
+// together are at most this much source, and called otherwise.
+const INLINE_REF_MAX = 4096;
+// An object member whose scan is more than this much source is moved into a
+// function of its own (emitMember).
+const SPLIT_MIN = 4 * 1024;
+// The member source an object keeps inline before the rest move out.
+const SPLIT_OBJECT = 16 * 1024;
+// Declared names at least this long on average find a key's end with indexOf.
+const INDEX_KEY_MIN_AVG = 10;
 
 // Each position in a tuple emits its own branch inside the element loop, so a
 // long one is both a lot of source and a linear test per element.
@@ -155,9 +171,19 @@ function resolveLocalRef(root, ref) {
   if (ref === '#') return root;
   if (!ref.startsWith('#/')) decline('$ref:not-local');
   let node = root;
+  let first = true;
   for (const rawToken of ref.slice(2).split('/')) {
-    const token = decodeURIComponent(rawToken).split('~1').join('/').split('~0').join('~');
+    let token = decodeURIComponent(rawToken).split('~1').join('/').split('~0').join('~');
     if (node === null || typeof node !== 'object') decline('$ref:unresolved');
+    // Draft 7 schemas reach the scanner with `definitions` renamed to `$defs`
+    // (lib/draft7.js) and their references as written; the other engines
+    // read either name, and so does this. Without it no draft 7 schema that
+    // used a definition got a scanner.
+    if (first && node === root && !Array.isArray(node) && !Object.prototype.hasOwnProperty.call(node, token)) {
+      if (token === 'definitions' && Object.prototype.hasOwnProperty.call(node, '$defs')) token = '$defs';
+      else if (token === '$defs' && Object.prototype.hasOwnProperty.call(node, 'definitions')) token = 'definitions';
+    }
+    first = false;
     if (Array.isArray(node)) {
       if (!/^\d+$/.test(token)) decline('$ref:unresolved');
       node = node[Number(token)];
@@ -387,11 +413,45 @@ function spanHash(name) {
 // is a jump table.
 const HASH_DISPATCH_MIN = 48;
 
+// The scan is first emitted as one function with every reference expanded
+// where it is used, which is the fastest form: a call per member measured
+// about twice the cost of csslintrc's scan, a small enum referenced thirty
+// times. Only when a function would pass MAX_FUNCTION_SOURCE is it emitted
+// again with large reference targets and large object members moved into
+// functions of their own, so the source grows with the schema rather than
+// with the number of references to it.
 function compileScanner(schema, options) {
   const opts = options || {};
+  const whole = build(schema, opts, false);
+  if (whole !== null || declineReason !== 'size') return finish(whole, opts);
+  return finish(build(schema, opts, true), opts);
+}
+
+function finish(built, opts) {
+  if (built === null) {
+    if (opts.onDecline) opts.onDecline(declineReason);
+    return null;
+  }
+  const { ctx, body } = built;
+  let fn;
+  try {
+    // eslint-disable-next-line no-new-func
+    fn = new Function('_h', '_r', ctx.subSource.join('\n') + '\nreturn function scan(s){\n' + body + '\n}')(ctx.helpers, require('./scan-runtime'));
+  } catch {
+    return null; // a runtime without code generation has no scanner, by design
+  }
+  return { scan: fn, source: body, helpers: ctx.helpers.length, functions: [body, ...ctx.subSource] };
+}
+
+function build(schema, opts, split) {
   const ctx = {
     uid: 0, helpers: [], userFormats: opts.userFormats || null,
     root: schema, refStack: [], nodes: 0,
+    // With `split`, reference targets map to null when expanded in place,
+    // else to the name of the function in subSource that scans one (see the
+    // $ref case in emitValue), and large members move out too (emitMember).
+    split, subs: new Map(), subSource: [], refCounts: split ? countRefs(schema) : null,
+    inlineBytes: new Map(),
   };
   declineReason = null;
   let body;
@@ -404,21 +464,19 @@ function compileScanner(schema, options) {
     out.push('if(i<len)return 0;');
     out.push('return 1;');
     body = out.join('\n');
+    // A function this large is a cost of its own, and V8's Maglev tier
+    // aborted the process compiling scanners of 500 KB and more (traefik,
+    // detekt from SchemaStore), in plain JavaScript, on Node 24 and 25, after
+    // about a hundred calls. Unsplit, past the bound the scan is emitted
+    // split; split, past either bound the schema has no scanner and the text
+    // path parses as it does without one.
+    if (body.length > MAX_FUNCTION_SOURCE || ctx.subSource.some((x) => x.length > MAX_FUNCTION_SOURCE)) decline('size');
+    if (body.length + ctx.subSource.reduce((n, x) => n + x.length, 0) > MAX_SOURCE) decline('size');
   } catch (e) {
-    if (e === DECLINE) {
-      if (opts.onDecline) opts.onDecline(declineReason);
-      return null;
-    }
+    if (e === DECLINE) return null;
     throw e;
   }
-  let fn;
-  try {
-    // eslint-disable-next-line no-new-func
-    fn = new Function('_h', '_r', 'return function scan(s){\n' + body + '\n}')(ctx.helpers, require('./scan-runtime'));
-  } catch {
-    return null; // a runtime without code generation has no scanner, by design
-  }
-  return { scan: fn, source: body, helpers: ctx.helpers.length };
+  return { ctx, body };
 }
 
 function emitValue(schema, ctx, out, depth) {
@@ -443,9 +501,51 @@ function emitValue(schema, ctx, out, depth) {
     const ref = schema.$ref;
     if (ctx.refStack.includes(ref)) decline('$ref:recursive');
     const target = resolveLocalRef(ctx.root, ref);
+    if (!ctx.split) {
+      ctx.refStack.push(ref);
+      emitValue(target, ctx, out, depth);
+      ctx.refStack.pop();
+      return;
+    }
+    // Split (see compileScanner): a target whose expansions add up to more
+    // than a little source is emitted once, as a function of its own, and
+    // called wherever it is referenced. Expanded at every reference, the
+    // source grows with the number of references rather than with the
+    // schema: SchemaStore's traefik and detekt reach the same definitions
+    // from hundreds of places, and their scanners came to 0.5 to 1 MB, which
+    // V8's Maglev tier aborted the process compiling.
+    const sub = ctx.subs.get(target);
+    if (sub !== undefined) {
+      if (sub === null) {
+        ctx.refStack.push(ref);
+        emitValue(target, ctx, out, depth);
+        ctx.refStack.pop();
+      } else {
+        emitSubCall(sub, ctx, out);
+      }
+      return;
+    }
+    const body = [];
     ctx.refStack.push(ref);
-    emitValue(target, ctx, out, depth);
+    emitValue(target, ctx, body, depth);
     ctx.refStack.pop();
+    const text = body.join('\n');
+    // Expanded in place only while all its expansions together stay small:
+    // a small definition referenced from hundreds of places is source in
+    // hundreds of places.
+    if (text.length * (ctx.refCounts.get(ref) || 1) <= INLINE_REF_MAX) {
+      ctx.subs.set(target, null);
+      for (const line of body) out.push(line);
+      return;
+    }
+    const name = '_s' + (ctx.subSource.length + ctx.subs.size + ctx.uid++);
+    ctx.subs.set(target, name);
+    // The emitted scan of a value starts with `i` at its first character and
+    // `c` holding it, and ends with `i` past it; it answers 0 (invalid) or -1
+    // (bail) by returning. Here it returns the new position instead, which is
+    // at least 1, so the three cannot be confused.
+    ctx.subSource.push('function ' + name + '(s,i){var len=s.length,c=s.charCodeAt(i);\n' + text + '\nreturn i;}');
+    emitSubCall(name, ctx, out);
     return;
   }
 
@@ -478,6 +578,12 @@ function emitValue(schema, ctx, out, depth) {
   // present, not that it lists anything.
   let compositeAllowed = true;
   let compositeDelegate = null;
+  // The kinds the listed values have. A value of any other kind equals none
+  // of them, so its branch is left out and the value falls to the final
+  // `return 0`: csslintrc's `enum: [2, true, false]` used to scan strings
+  // only to reject them, at thirty references, and the dead branches alone
+  // pushed its scan past the size bound into calls.
+  let listedKinds = null;
   if (has('const') || has('enum')) {
     compositeAllowed = false;
     const listed = [];
@@ -486,6 +592,7 @@ function emitValue(schema, ctx, out, depth) {
       if (!Array.isArray(schema.enum)) decline('enum:not-array');
       for (const v of schema.enum) listed.push(v);
     }
+    listedKinds = new Set(listed.map((v) => (v === null ? 'null' : Array.isArray(v) ? 'array' : typeof v)));
     // An object or an array can only be compared as a whole. The scan steps
     // over that one subtree, parses its own text, and hands it to the check
     // the validator itself runs, so the document around it is still never
@@ -508,7 +615,7 @@ function emitValue(schema, ctx, out, depth) {
       + 'if(!' + compositeDelegate + '(_cv' + k + '))return 0;'
       + 'i=_ce' + k + ';c=s.charCodeAt(i);'];
   };
-  if (allows(types, 'object')) {
+  if (allows(types, 'object') && (listedKinds === null || listedKinds.has('object'))) {
     if (compositeDelegate) branches.push(['c===123', compositeBranch()]);
     else if (!compositeAllowed) branches.push(['c===123', ['return 0;']]);
     else {
@@ -517,7 +624,7 @@ function emitValue(schema, ctx, out, depth) {
       branches.push(['c===123', b]);
     }
   }
-  if (allows(types, 'array')) {
+  if (allows(types, 'array') && (listedKinds === null || listedKinds.has('array'))) {
     if (compositeDelegate) branches.push(['c===91', compositeBranch()]);
     else if (!compositeAllowed) branches.push(['c===91', ['return 0;']]);
     else {
@@ -526,22 +633,22 @@ function emitValue(schema, ctx, out, depth) {
       branches.push(['c===91', b]);
     }
   }
-  if (allows(types, 'string')) {
+  if (allows(types, 'string') && (listedKinds === null || listedKinds.has('string'))) {
     const b = [];
     emitString(schema, ctx, b);
     branches.push(['c===34', b]);
   }
-  if (allows(types, 'number')) {
+  if (allows(types, 'number') && (listedKinds === null || listedKinds.has('number'))) {
     const b = [];
     emitNumber(schema, ctx, b, types);
     branches.push(['c===45||(c>=48&&c<=57)', b]);
   }
-  if (allows(types, 'boolean')) {
+  if (allows(types, 'boolean') && (listedKinds === null || listedKinds.has('boolean'))) {
     const b = [];
     emitLiteral(schema, ctx, b, 'boolean');
     branches.push(['c===116||c===102', b]);
   }
-  if (allows(types, 'null')) {
+  if (allows(types, 'null') && (listedKinds === null || listedKinds.has('null'))) {
     const b = [];
     emitLiteral(schema, ctx, b, 'null');
     branches.push(['c===110', b]);
@@ -558,6 +665,42 @@ function emitValue(schema, ctx, out, depth) {
   out.push(parts.join('\n'));
 }
 
+// How many times each `$ref` string occurs in the schema, for the expand or
+// call decision. Schema positions and other values alike: a string that is not
+// a reference is never looked up.
+function countRefs(root) {
+  const counts = new Map();
+  const seen = new Set();
+  const walk = (n) => {
+    if (n === null || typeof n !== 'object' || seen.has(n)) return;
+    seen.add(n);
+    if (Array.isArray(n)) { for (const x of n) walk(x); return; }
+    if (typeof n.$ref === 'string') counts.set(n.$ref, (counts.get(n.$ref) || 0) + 1);
+    for (const k of Object.keys(n)) walk(n[k]);
+  };
+  walk(root);
+  return counts;
+}
+
+// A name with no character a JSON string would have to escape, so its raw
+// text in a document is the name itself.
+function plainName(name) {
+  for (let k = 0; k < name.length; k++) {
+    const c = name.charCodeAt(k);
+    if (c < 32 || c === 34 || c === 92) return false;
+  }
+  return true;
+}
+
+// A call answers invalid with the literal `return 0;`, as inline code does:
+// an object member rewrites that text into its own failure path, which goes on
+// scanning (a later duplicate key can replace the value), and a different
+// spelling would end the whole scan instead.
+function emitSubCall(name, ctx, out) {
+  const r = '_rq' + (ctx.uid++);
+  out.push('{var ' + r + '=' + name + '(s,i);if(' + r + '===-1)return -1;if(' + r + '===0)return 0;i=' + r + ';c=s.charCodeAt(i);}');
+}
+
 // Any JSON value, validated as JSON and stepped over.
 function emitSkip(out) {
   out.push('{var _j=_r.skipValue(s,i);if(_j===-2)return -1;if(_j<0)return 0;i=_j;c=s.charCodeAt(i);}');
@@ -749,8 +892,27 @@ function emitArray(schema, ctx, out, depth) {
 // the rule reaches nested objects: an inner object's own verdict is a value
 // failure at the level above it.
 function emitMember(sub, ctx, out, depth, objId) {
-  const lines = [];
+  let lines = [];
   emitValue(sub, ctx, lines, depth + 1);
+  // A large member value becomes a function of its own, so no one function
+  // grows with the whole schema: detekt nests hundreds of rule objects inline,
+  // no references involved. The value's code keeps its own labels and
+  // variables, so it moves as it is; the call answers invalid with
+  // `return 0;`, which the rewrite below turns into this member's failure.
+  // An object's members are judged together as well as one by one: thirty
+  // members just under SPLIT_MIN each would stay inline and add up to a
+  // function past the bound, so once the members kept inline in this object
+  // pass SPLIT_OBJECT, the rest move out whatever their size.
+  const size = lines.join('\n').length;
+  const kept = ctx.split ? (ctx.inlineBytes.get(objId) || 0) : 0;
+  if (ctx.split && (size > SPLIT_MIN || kept + size > SPLIT_OBJECT)) {
+    const name = '_s' + (ctx.subSource.length + ctx.subs.size + ctx.uid++);
+    ctx.subSource.push('function ' + name + '(s,i){var len=s.length,c=s.charCodeAt(i);\n' + lines.join('\n') + '\nreturn i;}');
+    lines = [];
+    emitSubCall(name, ctx, lines);
+  } else if (ctx.split) {
+    ctx.inlineBytes.set(objId, kept + size);
+  }
   const body = lines.join('\n');
   if (!body.includes('return 0;')) { out.push(body); return; }
   const label = '_mb' + (ctx.uid++);
@@ -828,10 +990,32 @@ function emitObject(schema, ctx, out, depth) {
       hashById = '_h[' + (ctx.helpers.length - 1) + ']';
     }
   }
-  emitStringSpan(ctx, out, kn, false, hashById !== null);
-  // A key written with an escape decodes to a name the raw span does not show,
-  // so the dispatch below would read it as a different property.
-  out.push('if(_x' + kn + ')return -1;');
+  // A key's end is found with indexOf, which is native, where the character
+  // loop below costs three compares a character: on csslintrc's 35 keys of
+  // twenty-odd characters the loop was most of the scan and made it slower
+  // than parsing. Every declared name is plain text, so a key that compares
+  // equal to one, character by character, is that name as written, and a
+  // key that does not is checked for an escape or a control character before
+  // it is read as additional. Either one bails, and so does a span that ends
+  // on a backslash, since that quote may be escaped: the parser decides what
+  // the key really is.
+  // indexOf costs about the same whatever the key's length, the loop about a
+  // nanosecond a character: on short keys the loop wins (problem-object's
+  // `type`, `title`, `status` measured 10 to 15 percent slower by indexOf),
+  // and from ten characters indexOf wins by 40 percent and more, so the
+  // choice follows the declared names' average length.
+  const indexKey = !useHash && names.length > 0 && names.every(plainName)
+    && names.reduce((n, x) => n + x.length, 0) >= INDEX_KEY_MIN_AVG * names.length;
+  if (indexKey) {
+    // A quote with a backslash before it may be escaped, and then the key
+    // goes on past it: bail before reading what follows as the colon.
+    out.push('var _p' + kn + '=++i,_e' + kn + '=s.indexOf(\'"\',i);if(_e' + kn + '<0)return 0;if(s.charCodeAt(_e' + kn + '-1)===92)return -1;i=_e' + kn + ';c=s.charCodeAt(++i);');
+  } else {
+    emitStringSpan(ctx, out, kn, false, hashById !== null);
+    // A key written with an escape decodes to a name the raw span does not
+    // show, so the dispatch below would read it as a different property.
+    out.push('if(_x' + kn + ')return -1;');
+  }
   out.push(WS);
   out.push('if(c!==58)return 0;');
   out.push('c=s.charCodeAt(++i);');
@@ -958,6 +1142,7 @@ function emitObject(schema, ctx, out, depth) {
     additional.push(lines.join('\n').split('return 0;').join('return -1;'));
   }
 
+  if (indexKey) additional.unshift('if(!_r.plainKey(s,_p' + kn + ',_e' + kn + '))return -1;');
   out.push('switch(_kl' + kn + '){');
   for (const [len, group] of byLen) {
     out.push('case ' + len + ':{');

package/lib/scan-runtime.js

@@ -155,4 +155,16 @@ function span(s, p, e, escaped) {
   return JSON.parse(s.slice(p - 1, e + 1));
 }
 
-module.exports = { hex4, skipValue, skipString, skipNumber, span, MALFORMED, TOO_DEEP, MAX_SKIP_DEPTH };
+// Whether the raw text of a key between `p` and `e` is its name as written:
+// no escape, no control character. A scanner that found the key's end with
+// indexOf calls this for a name it did not recognise; one it recognised was
+// compared character by character against a name that has neither.
+function plainKey(s, p, e) {
+  for (let k = p; k < e; k++) {
+    const c = s.charCodeAt(k);
+    if (c < 32 || c === 92) return false;
+  }
+  return true;
+}
+
+module.exports = { hex4, skipValue, skipString, skipNumber, span, plainKey, MALFORMED, TOO_DEEP, MAX_SKIP_DEPTH };

package/lib/validator-core.js

@@ -215,8 +215,27 @@ function codegenAvailable() {
   return _codegenAvailable;
 }
 
-// Schema compilation cache: same schema string -> reuse compiled functions
+// Schema compilation cache: same schema string -> reuse compiled functions.
+// It and the preprocess cache below are bounded, oldest out first. Unbounded,
+// they held every schema's text, compiled functions and their sources for the
+// life of the process: after compiling each of SchemaStore's schemas once and
+// dropping the validators, 1.2 GB stayed on the heap. A schema compiled again
+// after its entry left is compiled again, the cost of a miss and no more.
+const CACHE_ENTRIES = 128;
+const CACHE_KEY_CHARS = 16 * 1024 * 1024;
 const _compileCache = new Map();
+// Adds an entry and drops the oldest past either bound. The key characters
+// are counted on the map itself.
+function _boundedSet(map, key, entry) {
+  if (!map.has(key)) map._chars = (map._chars || 0) + key.length;
+  map.set(key, entry);
+  while (map.size > CACHE_ENTRIES || (map._chars > CACHE_KEY_CHARS && map.size > 1)) {
+    const oldest = map.keys().next().value;
+    map.delete(oldest);
+    map._chars -= oldest.length;
+  }
+}
+function _compileCacheSet(key, entry) { _boundedSet(_compileCache, key, entry); }
 // Generated preprocess passes, keyed like _compileCache plus the options that
 // shape the pass. Only passes that exist are kept: a schema with nothing to
 // rewrite answers `null` quickly, and keeping that answer held its key, the
@@ -911,7 +930,7 @@ class Validator {
       // A function bound to this validator's keyword functions or formats is
       // not the schema's alone, so it is not shared through the cache.
       if (!uf && !this._keywords) {
-        _compileCache.set(mapKey, { jsFn, combined: undefined, errFn: undefined, isCodegen: _isCodegen, full: false });
+        _compileCacheSet(mapKey, { jsFn, combined: undefined, errFn: undefined, isCodegen: _isCodegen, full: false });
       }
     }
     this._jsFn = jsFn;
@@ -938,7 +957,7 @@ class Validator {
       if (hit !== undefined) preprocess = hit;
       else {
         preprocess = _codegen.buildPreprocess(preprocessSchema, options) || null;
-        if (ppKey !== null && preprocess !== null) _preprocessCache.set(ppKey, preprocess);
+        if (ppKey !== null && preprocess !== null) _boundedSet(_preprocessCache, ppKey, preprocess);
       }
     }
     if (!preprocess) {
@@ -2259,4 +2278,4 @@ module.exports = {
 // surface of `require('ata-validator')` is what it was.
 Object.defineProperty(module.exports, '_registerCodegen', { value: _registerCodegen, enumerable: false });
 // What the compiled paths in index.js need from this module.
-Object.defineProperty(module.exports, '_internals', { value: { _jsonSyntaxRejection, ABORT_EARLY_RESULT, HYBRID_TIER_CALLS, SIMDJSON_THRESHOLD, VALID_RESULT, _bindEntry, _bindVerdict, _compileCache, _mustReject, _rememberInstance, _verboseWrap, compileCacheKey, getNative, isV1Dialect, resolveSchemaByPath }, enumerable: false });
+Object.defineProperty(module.exports, '_internals', { value: { _jsonSyntaxRejection, ABORT_EARLY_RESULT, HYBRID_TIER_CALLS, SIMDJSON_THRESHOLD, VALID_RESULT, _bindEntry, _bindVerdict, _compileCache, _compileCacheSet, _mustReject, _rememberInstance, _verboseWrap, compileCacheKey, getNative, isV1Dialect, resolveSchemaByPath }, enumerable: false });

package/lib/version.js

@@ -7,4 +7,4 @@
 //
 // Kept in lockstep with package.json by `tests/test_version_sync.js`.
 
-module.exports = '1.42.0';
+module.exports = '1.43.0';

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "ata-validator",
-  "version": "1.42.0",
+  "version": "1.43.0",
   "description": "JSON Schema validator that compiles to plain JavaScript, still runs where code generation is blocked, and can be compiled away at build time. Passes the full official test suite.",
   "main": "index.js",
   "module": "index.mjs",
@@ -64,7 +64,7 @@
     "release:check": "node tests/test_pack_purity.js && node scripts/check-doc-coverage.js && node tests/test_error_codes_lock.js && node tests/test_safe_regex_embed.js && node tests/test_version_sync.js",
     "build": "cmake-js build --target ata",
     "rebuild": "cmake-js rebuild --target ata",
-    "test": "node test.js && node tests/test_removed_aot_methods.js && node tests/test_no_native.js && node tests/test_no_eval.js && node tests/test_property_dependencies.js && node tests/test_v1_dialect.js && node tests/test_buffer_path_parity.js && node tests/test_number_text_parity.js && node tests/test_text_path_errors.js && node tests/test_compiled_parity.js && node tests/test_compiled_extension_parity.js && node tests/test_buffer_gate.js && node tests/test_scanner_differential.js && node tests/test_validate_json_scanner_cost.js && node tests/test_buffer_reject_cost.js && node tests/test_nan_verdict.js && node tests/test_remove_additional_nested.js && node tests/test_exclusive_bounds.js && node tests/test_engine_differential.js && node tests/test_error_shape_differential.js && node tests/test_error_list_differential.js && node tests/test_output_format.js && node tests/test_standard_json_schema.js && node tests/test_retry_message.js && node tests/test_describe_schema.js && node tests/test_aot_parse.js && node tests/test_draft7_semantics.js && node tests/test_metaschema_ref.js && node tests/test_pure_js_unsupported.js && node tests/test_native_load_order.js && node tests/test_pack_purity.js && node tests/test_make_native_package.js && node tests/test_browser.js && node tests/test_browser_nofs.js && node tests/test_browser_imports_guard.js && node tests/test_esm_exports.js && node tests/test_version_sync.js && node tests/test_native_loaded.js && node tests/test_native_lazy.js && node tests/test_buffer_apis_without_native.js && node tests/test_cold_start_modules.js && node tests/test_safe_regex_embed.js && node tests/test_t_builder.js && node tests/test_async_refine.js && node tests/test_safe_regex.js && node tests/test_safe_regex_integration.js && node tests/test_regex_ecma_whitespace.js && node tests/test_regex_native_linear.js && node tests/test_aot_build.js && node tests/test_aot_differential.js && node tests/test_aot_cli_build.js && node tests/test_aot_cli_smoke.js && node tests/test_bundle_standalone.js && node tests/test_standalone_anyof.js && node tests/test_standalone_formats.js && node tests/test_aot_format_mode.js && node tests/test_aot_additional_props_errors.js && node tests/test_id_anchor_refs.js && node tests/test_engine_routing.js && node tests/test_engine_option.js && node tests/test_compile_cache_order.js && node tests/test_engine_diagnostic.js && node tests/test_format_engine_parity.js && node tests/test_error_accumulator_collision.js && node tests/test_uri_helper_parity.js && node tests/test_uri_fast_path.js && node tests/test_extend_verdict.js && node tests/test_ipv4_regex.js && node tests/test_ipv6_fast_path.js && node tests/test_nested_recursion_decline.js && node tests/test_generator_error_content.js && node tests/test_inherited_key_presence.js && node tests/test_proto_accessor.js && node tests/test_hybrid_tier.js && node tests/test_first_rejection_builds_one.js && node tests/test_container_local.js && node tests/test_one_shot_validate.js && node tests/test_fixed_pattern_inline.js && node tests/test_plan_source.js && node tests/test_fused_remove_additional.js && node tests/test_runtime_parse.js && node tests/test_formats_single_pass.js && node tests/test_email_format_cost.js && node tests/test_format_single_error.js && node tests/test_defs_pointer_alias.js && node tests/test_encoded_refs.js && node tests/test_cross_doc_root_ref.js && node tests/test_codegen_entrypoint_agreement.js && node tests/test_schema_code_injection.js && node tests/test_aot_html_safe.js && node tests/test_ref_annotation_siblings.js && node tests/test_gate_wrapped_schemas.js && node tests/test_pattern_message_escape.js && node tests/test_nested_defaults_engines.js && node tests/test_nested_coercion_parity.js && node tests/test_preprocess_cache.js && node tests/test_large_schema_codegen.js && node tests/test_base_uri.js && node tests/test_hoisted_def_recursion.js && node tests/test_alias_definitions.js && node tests/test_property_names_ref.js && node tests/test_hybrid_agreement.js && node tests/test_codegen_edge_shapes.js && node tests/test_deferred_def_scope.js && node tests/test_node_scoped_ctx_flags.js && node tests/test_fast_slot_exhaustion.js && node tests/test_ajv_errors.js && node tests/test_custom_keywords.js && node tests/test_custom_keyword_codegen.js && node tests/test_strict_schema.js && node tests/test_aot_external_checks.js && node tests/test_ajv_parity.js && node tests/test_user_format_error_path.js && node tests/test_unevaluated_error_path.js && node tests/test_unevaluated_error_shape.js && node tests/test_unevaluated_differential.js && node tests/fuzz_differential.js && node tests/test_pattern_properties_errors.js && node tests/test_additional_properties_scaling.js && node tests/test_additional_props_combined_cost.js && node tests/test_no_input_mutation.js && node tests/test_typed_validator_runner.js && node tests/test_define_schema.js && node tests/test_error_codes_lock.js && node tests/test_error_code_lookup.js && node tests/test_error_order.js && node tests/test_error_order_ordinal.js && node tests/test_ref_error_order.js && node tests/test_rejection_shape.js && node tests/test_lazy_normalization.js && node tests/test_value_equality.js && node tests/test_vocabulary.js && node tests/test_schema_scan.js && node tests/test_lazy_errors.js && node tests/test_error_read_paths.js && node tests/test_unique_items_error_pair.js && node tests/test_rich_errors_generated.js && node tests/test_captured_verdict_stub.js && node tests/test_generated_returns_rewrite.js && node tests/test_deep_pointer_refs.js && node tests/test_uneval_props_dynamic.js && node tests/test_one_pass_no_fallback.js && node tests/test_single_pass_errors.js && node tests/test_lazy_json_errors.js && node tests/test_lazy_instance.js && node tests/test_cyclic_input.js && node tests/test_native_error_codes.js && node tests/test_verdict_preprocess.js && node tests/test_lite_parity.js && node tests/test_lite_bundle_size.js && node tests/test_defaults_own_keys.js && node tests/test_plan_compiler.js && node tests/test_nullable.js && node tests/test_validate_and_parse.js && node tests/test_validate_data.js && node tests/test_enrich_error.js && node tests/test_enrich_received.js && node tests/test_rich_errors_optout.js && node tests/test_error_messages.js && node tests/test_source_positions.js && node tests/fuzz_positions.js && node tests/test_malformed_json_termination.js && node tests/test_data_positions.js && node tests/test_targeted_positions.js && node tests/test_position_map_cost.js && node tests/test_targeted_positions_cost.js && node tests/test_aot_staleness.js && node tests/test_file_positions.js && node tests/test_aot_positions_cost.js && node tests/test_schema_hash.js && node tests/test_render_shared.js && node tests/test_renderers.js && node tests/test_render_without_process.js && node tests/test_additive_fields.js && node tests/test_diagnostic_source.js && node tests/test_diagnose.js && node tests/test_correlate.js && node tests/test_diagnostics_score.js && node tests/test_runtime_error_dx.js && node tests/test_aot_error_dx.js && node tests/test_aot_source_frames.js && node tests/test_abort_early.js && node tests/test_branch_collapse.js && node tests/test_suggestions.js && node tests/test_cli_validate.js && node tests/test_cli_version.js && node tests/test_collect_evaluated.js && node tests/test_differential_tiers.js && node tests/test_draft7.js && node tests/test_dual_path.js && node tests/test_keywords_codegen.js && node tests/test_ref_cross.js && node tests/test_shape_classifier.js && node tests/test_tier0.js && node benchmark/bench_aot_size.mjs",
+    "test": "node test.js && node tests/test_removed_aot_methods.js && node tests/test_no_native.js && node tests/test_no_eval.js && node tests/test_property_dependencies.js && node tests/test_v1_dialect.js && node tests/test_buffer_path_parity.js && node tests/test_number_text_parity.js && node tests/test_text_path_errors.js && node tests/test_compiled_parity.js && node tests/test_compiled_extension_parity.js && node tests/test_buffer_gate.js && node tests/test_scanner_differential.js && node tests/test_validate_json_scanner_cost.js && node tests/test_buffer_reject_cost.js && node tests/test_nan_verdict.js && node tests/test_remove_additional_nested.js && node tests/test_exclusive_bounds.js && node tests/test_engine_differential.js && node tests/test_error_shape_differential.js && node tests/test_error_list_differential.js && node tests/test_output_format.js && node tests/test_standard_json_schema.js && node tests/test_retry_message.js && node tests/test_describe_schema.js && node tests/test_aot_parse.js && node tests/test_draft7_semantics.js && node tests/test_metaschema_ref.js && node tests/test_pure_js_unsupported.js && node tests/test_native_load_order.js && node tests/test_pack_purity.js && node tests/test_make_native_package.js && node tests/test_browser.js && node tests/test_browser_nofs.js && node tests/test_browser_imports_guard.js && node tests/test_esm_exports.js && node tests/test_version_sync.js && node tests/test_native_loaded.js && node tests/test_native_lazy.js && node tests/test_buffer_apis_without_native.js && node tests/test_cold_start_modules.js && node tests/test_safe_regex_embed.js && node tests/test_t_builder.js && node tests/test_async_refine.js && node tests/test_safe_regex.js && node tests/test_safe_regex_integration.js && node tests/test_regex_ecma_whitespace.js && node tests/test_regex_native_linear.js && node tests/test_aot_build.js && node tests/test_aot_differential.js && node tests/test_aot_cli_build.js && node tests/test_aot_cli_smoke.js && node tests/test_bundle_standalone.js && node tests/test_standalone_anyof.js && node tests/test_standalone_formats.js && node tests/test_aot_format_mode.js && node tests/test_aot_additional_props_errors.js && node tests/test_id_anchor_refs.js && node tests/test_engine_routing.js && node tests/test_engine_option.js && node tests/test_compile_cache_order.js && node tests/test_engine_diagnostic.js && node tests/test_format_engine_parity.js && node tests/test_error_accumulator_collision.js && node tests/test_uri_helper_parity.js && node tests/test_uri_fast_path.js && node tests/test_extend_verdict.js && node tests/test_ipv4_regex.js && node tests/test_ipv6_fast_path.js && node tests/test_nested_recursion_decline.js && node tests/test_generator_error_content.js && node tests/test_inherited_key_presence.js && node tests/test_proto_accessor.js && node tests/test_hybrid_tier.js && node tests/test_first_rejection_builds_one.js && node tests/test_container_local.js && node tests/test_one_shot_validate.js && node tests/test_fixed_pattern_inline.js && node tests/test_plan_source.js && node tests/test_fused_remove_additional.js && node tests/test_runtime_parse.js && node tests/test_formats_single_pass.js && node tests/test_email_format_cost.js && node tests/test_format_single_error.js && node tests/test_defs_pointer_alias.js && node tests/test_encoded_refs.js && node tests/test_cross_doc_root_ref.js && node tests/test_codegen_entrypoint_agreement.js && node tests/test_schema_code_injection.js && node tests/test_aot_html_safe.js && node tests/test_ref_annotation_siblings.js && node tests/test_gate_wrapped_schemas.js && node tests/test_pattern_message_escape.js && node tests/test_nested_defaults_engines.js && node tests/test_nested_coercion_parity.js && node tests/test_preprocess_cache.js && node tests/test_large_schema_codegen.js && node tests/test_base_uri.js && node tests/test_hoisted_def_recursion.js && node tests/test_alias_definitions.js && node tests/test_property_names_ref.js && node tests/test_hybrid_agreement.js && node tests/test_codegen_edge_shapes.js && node tests/test_deferred_def_scope.js && node tests/test_node_scoped_ctx_flags.js && node tests/test_fast_slot_exhaustion.js && node tests/test_ajv_errors.js && node tests/test_custom_keywords.js && node tests/test_custom_keyword_codegen.js && node tests/test_strict_schema.js && node tests/test_aot_external_checks.js && node tests/test_ajv_parity.js && node tests/test_user_format_error_path.js && node tests/test_unevaluated_error_path.js && node tests/test_unevaluated_error_shape.js && node tests/test_unevaluated_differential.js && node tests/fuzz_differential.js && node tests/test_pattern_properties_errors.js && node tests/test_additional_properties_scaling.js && node tests/test_additional_props_combined_cost.js && node tests/test_no_input_mutation.js && node tests/test_typed_validator_runner.js && node tests/test_define_schema.js && node tests/test_error_codes_lock.js && node tests/test_error_code_lookup.js && node tests/test_error_order.js && node tests/test_error_order_ordinal.js && node tests/test_ref_error_order.js && node tests/test_rejection_shape.js && node tests/test_lazy_normalization.js && node tests/test_value_equality.js && node tests/test_vocabulary.js && node tests/test_schema_scan.js && node tests/test_lazy_errors.js && node tests/test_error_read_paths.js && node tests/test_unique_items_error_pair.js && node tests/test_rich_errors_generated.js && node tests/test_captured_verdict_stub.js && node tests/test_generated_returns_rewrite.js && node tests/test_deep_pointer_refs.js && node tests/test_uneval_props_dynamic.js && node tests/test_one_pass_no_fallback.js && node tests/test_scanner_size_cap.js && node tests/test_scanner_index_keys.js && node tests/test_both_defs_containers.js && node tests/test_uneval_branch_counts.js && node tests/test_branch_verdicts.js && node tests/test_shared_definitions.js && node tests/test_compile_cache_bound.js && node tests/test_uneval_items_dynamic.js && node tests/test_escaped_property_names.js && node tests/test_ref_siblings_combined.js && node tests/test_unicode_property_patterns.js && node tests/test_single_pass_errors.js && node tests/test_lazy_json_errors.js && node tests/test_lazy_instance.js && node tests/test_cyclic_input.js && node tests/test_native_error_codes.js && node tests/test_verdict_preprocess.js && node tests/test_lite_parity.js && node tests/test_lite_bundle_size.js && node tests/test_defaults_own_keys.js && node tests/test_plan_compiler.js && node tests/test_nullable.js && node tests/test_validate_and_parse.js && node tests/test_validate_data.js && node tests/test_enrich_error.js && node tests/test_enrich_received.js && node tests/test_rich_errors_optout.js && node tests/test_error_messages.js && node tests/test_source_positions.js && node tests/fuzz_positions.js && node tests/test_malformed_json_termination.js && node tests/test_data_positions.js && node tests/test_targeted_positions.js && node tests/test_position_map_cost.js && node tests/test_targeted_positions_cost.js && node tests/test_aot_staleness.js && node tests/test_file_positions.js && node tests/test_aot_positions_cost.js && node tests/test_schema_hash.js && node tests/test_render_shared.js && node tests/test_renderers.js && node tests/test_render_without_process.js && node tests/test_additive_fields.js && node tests/test_diagnostic_source.js && node tests/test_diagnose.js && node tests/test_correlate.js && node tests/test_diagnostics_score.js && node tests/test_runtime_error_dx.js && node tests/test_aot_error_dx.js && node tests/test_aot_source_frames.js && node tests/test_abort_early.js && node tests/test_branch_collapse.js && node tests/test_suggestions.js && node tests/test_cli_validate.js && node tests/test_cli_version.js && node tests/test_collect_evaluated.js && node tests/test_differential_tiers.js && node tests/test_draft7.js && node tests/test_dual_path.js && node tests/test_keywords_codegen.js && node tests/test_ref_cross.js && node tests/test_shape_classifier.js && node tests/test_tier0.js && node benchmark/bench_aot_size.mjs",
     "bench:size": "node benchmark/bench_aot_size.mjs",
     "test:suite": "node tests/run_suite.js && node tests/run_suite.js draft7 && node tests/run_suite.js v1",
     "test:compat": "node tests/test_compat.js",
@@ -143,13 +143,13 @@
     "LICENSE"
   ],
   "optionalDependencies": {
-    "@ata-validator/native-darwin-arm64": "1.42.0",
-    "@ata-validator/native-darwin-x64": "1.42.0",
-    "@ata-validator/native-linux-arm64-gnu": "1.42.0",
-    "@ata-validator/native-linux-arm64-musl": "1.42.0",
-    "@ata-validator/native-linux-x64-gnu": "1.42.0",
-    "@ata-validator/native-linux-x64-musl": "1.42.0",
-    "@ata-validator/native-win32-x64": "1.42.0"
+    "@ata-validator/native-darwin-arm64": "1.43.0",
+    "@ata-validator/native-darwin-x64": "1.43.0",
+    "@ata-validator/native-linux-arm64-gnu": "1.43.0",
+    "@ata-validator/native-linux-arm64-musl": "1.43.0",
+    "@ata-validator/native-linux-x64-gnu": "1.43.0",
+    "@ata-validator/native-linux-x64-musl": "1.43.0",
+    "@ata-validator/native-win32-x64": "1.43.0"
   },
   "peerDependencies": {
     "yaml": "^2.0.0"