sproutboat 0.27.0 → 0.29.0

package/vendor/ltx-restore/LICENSE

@@ -0,0 +1,202 @@
+
+                                 Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+
+   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+   1. Definitions.
+
+      "License" shall mean the terms and conditions for use, reproduction,
+      and distribution as defined by Sections 1 through 9 of this document.
+
+      "Licensor" shall mean the copyright owner or entity authorized by
+      the copyright owner that is granting the License.
+
+      "Legal Entity" shall mean the union of the acting entity and all
+      other entities that control, are controlled by, or are under common
+      control with that entity. For the purposes of this definition,
+      "control" means (i) the power, direct or indirect, to cause the
+      direction or management of such entity, whether by contract or
+      otherwise, or (ii) ownership of fifty percent (50%) or more of the
+      outstanding shares, or (iii) beneficial ownership of such entity.
+
+      "You" (or "Your") shall mean an individual or Legal Entity
+      exercising permissions granted by this License.
+
+      "Source" form shall mean the preferred form for making modifications,
+      including but not limited to software source code, documentation
+      source, and configuration files.
+
+      "Object" form shall mean any form resulting from mechanical
+      transformation or translation of a Source form, including but
+      not limited to compiled object code, generated documentation,
+      and conversions to other media types.
+
+      "Work" shall mean the work of authorship, whether in Source or
+      Object form, made available under the License, as indicated by a
+      copyright notice that is included in or attached to the work
+      (an example is provided in the Appendix below).
+
+      "Derivative Works" shall mean any work, whether in Source or Object
+      form, that is based on (or derived from) the Work and for which the
+      editorial revisions, annotations, elaborations, or other modifications
+      represent, as a whole, an original work of authorship. For the purposes
+      of this License, Derivative Works shall not include works that remain
+      separable from, or merely link (or bind by name) to the interfaces of,
+      the Work and Derivative Works thereof.
+
+      "Contribution" shall mean any work of authorship, including
+      the original version of the Work and any modifications or additions
+      to that Work or Derivative Works thereof, that is intentionally
+      submitted to Licensor for inclusion in the Work by the copyright owner
+      or by an individual or Legal Entity authorized to submit on behalf of
+      the copyright owner. For the purposes of this definition, "submitted"
+      means any form of electronic, verbal, or written communication sent
+      to the Licensor or its representatives, including but not limited to
+      communication on electronic mailing lists, source code control systems,
+      and issue tracking systems that are managed by, or on behalf of, the
+      Licensor for the purpose of discussing and improving the Work, but
+      excluding communication that is conspicuously marked or otherwise
+      designated in writing by the copyright owner as "Not a Contribution."
+
+      "Contributor" shall mean Licensor and any individual or Legal Entity
+      on behalf of whom a Contribution has been received by Licensor and
+      subsequently incorporated within the Work.
+
+   2. Grant of Copyright License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      copyright license to reproduce, prepare Derivative Works of,
+      publicly display, publicly perform, sublicense, and distribute the
+      Work and such Derivative Works in Source or Object form.
+
+   3. Grant of Patent License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      (except as stated in this section) patent license to make, have made,
+      use, offer to sell, sell, import, and otherwise transfer the Work,
+      where such license applies only to those patent claims licensable
+      by such Contributor that are necessarily infringed by their
+      Contribution(s) alone or by combination of their Contribution(s)
+      with the Work to which such Contribution(s) was submitted. If You
+      institute patent litigation against any entity (including a
+      cross-claim or counterclaim in a lawsuit) alleging that the Work
+      or a Contribution incorporated within the Work constitutes direct
+      or contributory patent infringement, then any patent licenses
+      granted to You under this License for that Work shall terminate
+      as of the date such litigation is filed.
+
+   4. Redistribution. You may reproduce and distribute copies of the
+      Work or Derivative Works thereof in any medium, with or without
+      modifications, and in Source or Object form, provided that You
+      meet the following conditions:
+
+      (a) You must give any other recipients of the Work or
+          Derivative Works a copy of this License; and
+
+      (b) You must cause any modified files to carry prominent notices
+          stating that You changed the files; and
+
+      (c) You must retain, in the Source form of any Derivative Works
+          that You distribute, all copyright, patent, trademark, and
+          attribution notices from the Source form of the Work,
+          excluding those notices that do not pertain to any part of
+          the Derivative Works; and
+
+      (d) If the Work includes a "NOTICE" text file as part of its
+          distribution, then any Derivative Works that You distribute must
+          include a readable copy of the attribution notices contained
+          within such NOTICE file, excluding those notices that do not
+          pertain to any part of the Derivative Works, in at least one
+          of the following places: within a NOTICE text file distributed
+          as part of the Derivative Works; within the Source form or
+          documentation, if provided along with the Derivative Works; or,
+          within a display generated by the Derivative Works, if and
+          wherever such third-party notices normally appear. The contents
+          of the NOTICE file are for informational purposes only and
+          do not modify the License. You may add Your own attribution
+          notices within Derivative Works that You distribute, alongside
+          or as an addendum to the NOTICE text from the Work, provided
+          that such additional attribution notices cannot be construed
+          as modifying the License.
+
+      You may add Your own copyright statement to Your modifications and
+      may provide additional or different license terms and conditions
+      for use, reproduction, or distribution of Your modifications, or
+      for any such Derivative Works as a whole, provided Your use,
+      reproduction, and distribution of the Work otherwise complies with
+      the conditions stated in this License.
+
+   5. Submission of Contributions. Unless You explicitly state otherwise,
+      any Contribution intentionally submitted for inclusion in the Work
+      by You to the Licensor shall be under the terms and conditions of
+      this License, without any additional terms or conditions.
+      Notwithstanding the above, nothing herein shall supersede or modify
+      the terms of any separate license agreement you may have executed
+      with Licensor regarding such Contributions.
+
+   6. Trademarks. This License does not grant permission to use the trade
+      names, trademarks, service marks, or product names of the Licensor,
+      except as required for reasonable and customary use in describing the
+      origin of the Work and reproducing the content of the NOTICE file.
+
+   7. Disclaimer of Warranty. Unless required by applicable law or
+      agreed to in writing, Licensor provides the Work (and each
+      Contributor provides its Contributions) on an "AS IS" BASIS,
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+      implied, including, without limitation, any warranties or conditions
+      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+      PARTICULAR PURPOSE. You are solely responsible for determining the
+      appropriateness of using or redistributing the Work and assume any
+      risks associated with Your exercise of permissions under this License.
+
+   8. Limitation of Liability. In no event and under no legal theory,
+      whether in tort (including negligence), contract, or otherwise,
+      unless required by applicable law (such as deliberate and grossly
+      negligent acts) or agreed to in writing, shall any Contributor be
+      liable to You for damages, including any direct, indirect, special,
+      incidental, or consequential damages of any character arising as a
+      result of this License or out of the use or inability to use the
+      Work (including but not limited to damages for loss of goodwill,
+      work stoppage, computer failure or malfunction, or any and all
+      other commercial damages or losses), even if such Contributor
+      has been advised of the possibility of such damages.
+
+   9. Accepting Warranty or Additional Liability. While redistributing
+      the Work or Derivative Works thereof, You may choose to offer,
+      and charge a fee for, acceptance of support, warranty, indemnity,
+      or other liability obligations and/or rights consistent with this
+      License. However, in accepting such obligations, You may act only
+      on Your own behalf and on Your sole responsibility, not on behalf
+      of any other Contributor, and only if You agree to indemnify,
+      defend, and hold each Contributor harmless for any liability
+      incurred by, or claims asserted against, such Contributor by reason
+      of your accepting any such warranty or additional liability.
+
+   END OF TERMS AND CONDITIONS
+
+   APPENDIX: How to apply the Apache License to your work.
+
+      To apply the Apache License to your work, attach the following
+      boilerplate notice, with the fields enclosed by brackets "[]"
+      replaced with your own identifying information. (Don't include
+      the brackets!)  The text should be enclosed in the appropriate
+      comment syntax for the file format. We also recommend that a
+      file or class name and description of purpose be included on the
+      same "printed page" as the copyright notice for easier
+      identification within third-party archives.
+
+   Copyright [yyyy] [name of copyright owner]
+
+   Licensed under the Apache License, Version 2.0 (the "License");
+   you may not use this file except in compliance with the License.
+   You may obtain a copy of the License at
+
+       http://www.apache.org/licenses/LICENSE-2.0
+
+   Unless required by applicable law or agreed to in writing, software
+   distributed under the License is distributed on an "AS IS" BASIS,
+   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+   See the License for the specific language governing permissions and
+   limitations under the License.

package/vendor/ltx-restore/NOTICE

@@ -0,0 +1,32 @@
+sqlite-js-stream
+Copyright Platformatic
+
+This product is a port of Litestream:
+
+  Litestream
+  https://github.com/benbjohnson/litestream
+  Copyright 2018-2025 Ben Johnson
+  Licensed under the Apache License, Version 2.0.
+
+The LTX file format and related design are derived from:
+
+  ltx (superfly) - https://github.com/superfly/ltx
+  Copyright the ltx authors
+  Licensed under the Apache License, Version 2.0.
+
+This product includes adaptations of documentation from the litestream repository
+(docs/ARCHITECTURE.md, docs/SQLITE_INTERNALS.md, docs/LTX_FORMAT.md, docs/PATTERNS.md),
+used under the Apache License, Version 2.0, with attribution.
+
+Portions of the WAL / LTX format descriptions are based on the SQLite documentation
+(https://www.sqlite.org/wal.html), which is in the public domain.
+
+Workspace modifications to ltx/crc64.ts include the two-word CRC reference loop
+and an optional bridge to Sproutboat's existing native capture CRC kernel.
+The bridge is prototype code by OpenAI Codex (GPT-6.1), not an upstream API.
+
+Native restore adaptation in Sproutboat CLI:
+- Streaming reader and bounded decoder, checksum and native bytes ABI integration.
+- Separate trusted startup/controller and publication checks.
+AI assistance: OpenAI Codex (GPT-6.1).
+Upstream snapshot: platformatic/sqlite-js-stream a5b830d5f1e408c54a04285c2199019b40154c25.

package/vendor/ltx-restore/crc64-native.ts.txt

@@ -0,0 +1,7 @@
+declare function __Porffor_sproutboat_crc64_v1(state: Uint8Array, data: Uint8Array, offset: number, length: number): void;
+
+// The compiler owns the versioned view validation and CRC boundary.
+// Only the trusted restore build enables --sb-native-bytes-v1.
+export function updateNativeCrc64(state: Uint8Array, data: Uint8Array): void {
+  __Porffor_sproutboat_crc64_v1(state, data, 0, data.length);
+}

package/vendor/ltx-restore/errors.ts.txt

@@ -0,0 +1,74 @@
+/**
+ * Shared error base for sqlite-js-stream.
+ *
+ * Every typed library error extends {@link SqliteJsStreamError} and carries a
+ * stable, Node-style `code` string (e.g. `ERR_NO_MATCHING_BACKUP`). This lets
+ * callers catch any library error with a single `instanceof`, and branch on the
+ * precise failure via `err.code` without matching message text.
+ */
+export class SqliteJsStreamError extends Error {
+  /** Stable, machine-readable error code (Node.js convention). */
+  readonly code: string;
+
+  constructor(code: string, message: string) {
+    super(message);
+    this.name = 'SqliteJsStreamError';
+    this.code = code;
+  }
+}
+
+/** A required function argument is missing or invalid (`ERR_INVALID_ARGUMENT`). */
+export class InvalidArgumentError extends SqliteJsStreamError {
+  constructor(message: string) {
+    super('ERR_INVALID_ARGUMENT', message);
+    this.name = 'InvalidArgumentError';
+  }
+}
+
+/** An incremental LTX file's page size differs from the base database. */
+export class PageSizeMismatchError extends SqliteJsStreamError {
+  constructor(message: string) {
+    super('ERR_PAGE_SIZE_MISMATCH', message);
+    this.name = 'PageSizeMismatchError';
+  }
+}
+
+/** An LTX file is malformed/corrupt or violates the format (`ERR_LTX_FORMAT`). */
+export class LTXFormatError extends SqliteJsStreamError {
+  constructor(message: string) {
+    super('ERR_LTX_FORMAT', message);
+    this.name = 'LTXFormatError';
+  }
+}
+
+/** A SQLite WAL file is malformed/corrupt (`ERR_WAL_FORMAT`). */
+export class WALFormatError extends SqliteJsStreamError {
+  constructor(message: string) {
+    super('ERR_WAL_FORMAT', message);
+    this.name = 'WALFormatError';
+  }
+}
+
+/** A replica URL is malformed or uses an unsupported scheme (`ERR_REPLICA_URL`). */
+export class ReplicaURLError extends SqliteJsStreamError {
+  constructor(message: string) {
+    super('ERR_REPLICA_URL', message);
+    this.name = 'ReplicaURLError';
+  }
+}
+
+/** A file/backend replica operation failed (`ERR_FILE_REPLICA`). */
+export class FileReplicaError extends SqliteJsStreamError {
+  constructor(message: string) {
+    super('ERR_FILE_REPLICA', message);
+    this.name = 'FileReplicaError';
+  }
+}
+
+/** A SQLite database file is missing/invalid or could not be read (`ERR_DATABASE`). */
+export class DatabaseError extends SqliteJsStreamError {
+  constructor(message: string) {
+    super('ERR_DATABASE', message);
+    this.name = 'DatabaseError';
+  }
+}

package/vendor/ltx-restore/file-io.ts.txt

@@ -0,0 +1,54 @@
+import { ByteReader } from './ltx/byte-reader.ts';
+
+// Explicit build-only ABI. The toolchain validates buffers, paths and offsets.
+declare function __Porffor_sproutboat_file_ctl_v1(operation: number, path: string, fd: number, position: number): number;
+declare function __Porffor_sproutboat_file_io_v1(operation: number, fd: number, data: Uint8Array, offset: number, length: number, position: number): number;
+
+export class FileSink {
+  fd: number;
+  pos = 0;
+  constructor(path: string) {
+    this.fd = __Porffor_sproutboat_file_ctl_v1(1, path, 0, 0);
+    if (this.fd < 0) throw new Error('cannot open output');
+  }
+  write(data: Uint8Array): void {
+    if (__Porffor_sproutboat_file_io_v1(1, this.fd, data, 0, data.length, this.pos) !== data.length) throw new Error('short file write');
+    this.pos += data.length;
+  }
+  sync(): void { if (__Porffor_sproutboat_file_ctl_v1(4, '', this.fd, 0) !== 0) throw new Error('fsync failed'); }
+  readAt(data: Uint8Array, offset: number): void {
+    if (__Porffor_sproutboat_file_io_v1(0, this.fd, data, 0, data.length, offset) !== data.length) throw new Error('short output read');
+  }
+  writeAt(data: Uint8Array, offset: number): void {
+    if (__Porffor_sproutboat_file_io_v1(1, this.fd, data, 0, data.length, offset) !== data.length) throw new Error('short output write');
+  }
+  truncate(size: number): void {
+    if (__Porffor_sproutboat_file_ctl_v1(5, '', this.fd, size) !== 0) throw new Error('truncate failed');
+    this.pos = size;
+  }
+  close(): void { if (this.fd >= 0) { __Porffor_sproutboat_file_ctl_v1(3, '', this.fd, 0); this.fd = -1; } }
+}
+
+export class FileReader extends ByteReader {
+  fd: number;
+  private size: number;
+  constructor(path: string) {
+    super(new Uint8Array(0));
+    this.fd = __Porffor_sproutboat_file_ctl_v1(0, path, 0, 0);
+    if (this.fd < 0) throw new Error('cannot open input');
+    this.size = __Porffor_sproutboat_file_ctl_v1(2, '', this.fd, 0);
+    if (this.size < 0) { this.close(); throw new Error('cannot stat input'); }
+  }
+  get length(): number { return this.size; }
+  get remaining(): number { return this.size - this.pos; }
+  slice(start: number, end: number): Uint8Array {
+    const n = end - start;
+    if (start < 0 || n < 0 || n > 131072 || end > this.size) throw new Error('invalid bounded file read');
+    const data = new Uint8Array(n);
+    if (__Porffor_sproutboat_file_io_v1(0, this.fd, data, 0, data.length, start) !== n) throw new Error('short file read');
+    return data;
+  }
+  readFull(n: number): Uint8Array { const data = this.slice(this.pos, this.pos + n); this.pos += n; return data; }
+  readByte(): number { return this.readFull(1)[0]; }
+  close(): void { if (this.fd >= 0) { __Porffor_sproutboat_file_ctl_v1(3, '', this.fd, 0); this.fd = -1; } }
+}

package/vendor/ltx-restore/ltx/byte-reader.ts.txt

@@ -0,0 +1,46 @@
+/**
+ * A sequential byte reader over an in-memory buffer. Used by the LTX decoder
+ * to walk the page block, page index, and trailer while tracking position.
+ */
+
+import { assertFull } from './bytes.ts';
+import { LTXFormatError } from '../errors.ts';
+
+export class ByteReader {
+  private buf: Uint8Array;
+  pos: number;
+
+  constructor(buf: Uint8Array, start = 0) {
+    this.buf = buf;
+    this.pos = start;
+  }
+
+  get length(): number {
+    return this.buf.length;
+  }
+
+  get remaining(): number {
+    return this.buf.length - this.pos;
+  }
+
+  /** Reads one byte, advancing the position. Throws on EOF. */
+  readByte(): number {
+    if (this.pos >= this.buf.length) {
+      throw new LTXFormatError('unexpected end of input');
+    }
+    return this.buf[this.pos++];
+  }
+
+  /** Reads exactly `n` bytes, advancing the position. Throws on short input. */
+  readFull(n: number): Uint8Array {
+    assertFull(this.buf, this.pos, n);
+    const out = this.buf.subarray(this.pos, this.pos + n);
+    this.pos += n;
+    return out;
+  }
+
+  /** Returns a view of the bytes in [start, end) without moving the position. */
+  slice(start: number, end: number): Uint8Array {
+    return this.buf.subarray(start, end);
+  }
+}

package/vendor/ltx-restore/ltx/bytes.ts.txt

@@ -0,0 +1,87 @@
+/**
+ * Big-endian byte helpers for LTX marshalling.
+ */
+
+export function writeU8(buf: Uint8Array, off: number, v: number): void {
+  buf[off] = v & 0xff;
+}
+
+export function writeU16BE(buf: Uint8Array, off: number, v: number): void {
+  buf[off] = (v >>> 8) & 0xff;
+  buf[off + 1] = v & 0xff;
+}
+
+export function writeU32BE(buf: Uint8Array, off: number, v: number): void {
+  buf[off] = (v >>> 24) & 0xff;
+  buf[off + 1] = (v >>> 16) & 0xff;
+  buf[off + 2] = (v >>> 8) & 0xff;
+  buf[off + 3] = v & 0xff;
+}
+
+export function writeU64BE(buf: Uint8Array, off: number, v: bigint): void {
+  let n = v;
+  for (let i = 0; i < 8; i++) {
+    buf[off + (7 - i)] = Number(n & 0xffn);
+    n >>= 8n;
+  }
+}
+
+export function readU16BE(buf: Uint8Array, off: number): number {
+  return (buf[off] << 8) | buf[off + 1];
+}
+
+export function readU32BE(buf: Uint8Array, off: number): number {
+  return (
+    ((buf[off] | 0) << 24) >>> 0 |
+    (buf[off + 1] << 16) |
+    (buf[off + 2] << 8) |
+    buf[off + 3]
+  ) >>> 0;
+}
+
+export function readU32LE(buf: Uint8Array, off: number): number {
+  return (
+    buf[off] |
+    (buf[off + 1] << 8) |
+    (buf[off + 2] << 16) |
+    ((buf[off + 3] | 0) << 24)
+  ) >>> 0;
+}
+
+export function readU64BE(buf: Uint8Array, off: number): bigint {
+  let n = 0n;
+  for (let i = 0; i < 8; i++) {
+    n = (n << 8n) | BigInt(buf[off + i]);
+  }
+  return n;
+}
+
+/** Converts a number to a big-endian 4-byte array. */
+export function u32BE(v: number): Uint8Array {
+  const b = new Uint8Array(4);
+  writeU32BE(b, 0, v);
+  return b;
+}
+
+/** Converts a number to a big-endian 8-byte array. */
+export function u64BE(v: bigint): Uint8Array {
+  const b = new Uint8Array(8);
+  writeU64BE(b, 0, v);
+  return b;
+}
+
+/** Converts a number to a big-endian 2-byte array. */
+export function u16BE(v: number): Uint8Array {
+  const b = new Uint8Array(2);
+  writeU16BE(b, 0, v);
+  return b;
+}
+
+/** Throws unless exactly `n` bytes are available to read. */
+export function assertFull(buf: Uint8Array, off: number, n: number): void {
+  if (off + n > buf.length) {
+    throw new RangeError(
+      `short buffer: need ${n} bytes at offset ${off}, have ${buf.length - off}`,
+    );
+  }
+}

package/vendor/ltx-restore/ltx/checksum.ts.txt

@@ -0,0 +1,46 @@
+/**
+ * LTX checksum helpers: per-page checksums and the rolling DB checksum.
+ */
+
+import { ChecksumFlag, lockPgno } from './constants.ts';
+import { Crc64 } from './crc64.ts';
+import { u32BE } from './bytes.ts';
+
+/**
+ * ChecksumPage returns a CRC-64 checksum that combines the page number with
+ * the page data: `ChecksumFlag | CRC64-ISO(pgno_be4 ++ data)`.
+ */
+export function checksumPage(pgno: number, data: Uint8Array): bigint {
+  const h = new Crc64();
+  h.update(u32BE(pgno));
+  h.update(data);
+  return ChecksumFlag | h.sum64();
+}
+
+export function checksumPageWithHasher(h: Crc64, pgno: number, data: Uint8Array): bigint {
+  h.reset();
+  h.update(u32BE(pgno));
+  h.update(data);
+  return ChecksumFlag | h.sum64();
+}
+
+/**
+ * ChecksumReader computes the rolling DB checksum over a byte buffer split
+ * into pages of `pageSize`. The "lock page" is skipped entirely (its checksum
+ * contributes nothing), matching Go's `ChecksumReader`.
+ *
+ * For large databases this should later read page-by-page from a file rather
+ * than buffering the whole DB; provided as a buffer for Milestone 1.
+ */
+export function checksumReader(data: Uint8Array, pageSize: number): bigint {
+  const lockPg = lockPgno(pageSize);
+  let chksum = 0n;
+  let offset = 0;
+  for (let pgno = 1; offset < data.length; pgno++, offset += pageSize) {
+    const page = data.subarray(offset, offset + pageSize);
+    if (pgno !== lockPg) {
+      chksum = ChecksumFlag | (chksum ^ checksumPage(pgno, page));
+    }
+  }
+  return chksum;
+}

package/vendor/ltx-restore/ltx/constants.ts.txt

@@ -0,0 +1,71 @@
+/**
+ * LTX format constants.
+ *
+ * Ground truth: superfly/ltx v0.5.2 (vendored by litestream). The byte layout
+ * here must match Go's `ltx` package exactly so files interoperate.
+ */
+
+/** Magic is the first 4 bytes of every LTX file. */
+export const Magic = 'LTX1';
+
+/** Version is the current version of the LTX file format. */
+export const Version = 3;
+
+/** Size constants. */
+export const HeaderSize = 100;
+export const PageHeaderSize = 6;
+export const TrailerSize = 16;
+
+/** Checksum size & positions. */
+export const ChecksumSize = 8;
+export const TrailerChecksumOffset = TrailerSize - ChecksumSize;
+
+/** ChecksumFlag ensures a checksum is non-zero. */
+export const ChecksumFlag = 1n << 63n;
+
+/** Entry byte offset of the PENDING_BYTE within a database. */
+export const PENDING_BYTE = 0x40000000;
+
+/** Header flags. */
+export const HeaderFlagMask = 0x00000002;
+export const HeaderFlagNoChecksum = 0x00000002;
+
+/** Page header flags. */
+/** PageHeaderFlagSize indicates a 4-byte size field follows the page header. */
+export const PageHeaderFlagSize = 0x0001;
+
+/** MaxPageSize is the maximum allowed SQLite page size. */
+export const MaxPageSize = 65536;
+
+/** SnapshotLevel is the LTX level reserved for full-database snapshots. */
+export const SnapshotLevel = 9;
+
+/** Error messages / codes. */
+export const ErrInvalidFile = 'invalid LTX file';
+export const ErrDecoderClosed = 'ltx decoder closed';
+export const ErrEncoderClosed = 'ltx encoder closed';
+export const ErrEncoderAborted = 'ltx encoder aborted';
+export const ErrNoChecksum = 'no file checksum';
+export const ErrInvalidChecksumFormat = 'invalid file checksum format';
+export const ErrChecksumMismatch = 'file checksum mismatch';
+
+/**
+ * LockPgno returns the page number at which the PENDING_BYTE exists.
+ * This page is never part of the LTX payload.
+ */
+export function lockPgno(pageSize: number): number {
+  return Math.floor(PENDING_BYTE / pageSize) + 1;
+}
+
+/** IsValidPageSize returns true if sz is between 512 and 64K and a power of two. */
+export function isValidPageSize(sz: number): boolean {
+  for (let i = 512; i <= MaxPageSize; i *= 2) {
+    if (sz === i) return true;
+  }
+  return false;
+}
+
+/** IsValidHeaderFlags returns true unless flags outside the valid mask are set. */
+export function isValidHeaderFlags(flags: number): boolean {
+  return flags === (flags & HeaderFlagMask);
+}