@agoric/cosmic-proto 0.5.0-u19.2 → 0.5.0-u20.0

package/dist/codegen/varint.js

@@ -1,409 +1 @@
-//@ts-nocheck
-/**
- * This file and any referenced files were automatically generated by @cosmology/telescope@1.8.3
- * DO NOT MODIFY BY HAND. Instead, download the latest proto files for your chain
- * and run the transpile command or npm scripts command that is used to regenerate this bundle.
- */
-// Copyright 2008 Google Inc.  All rights reserved.
-//
-// Redistribution and use in source and binary forms, with or without
-// modification, are permitted provided that the following conditions are
-// met:
-//
-// * Redistributions of source code must retain the above copyright
-// notice, this list of conditions and the following disclaimer.
-// * Redistributions in binary form must reproduce the above
-// copyright notice, this list of conditions and the following disclaimer
-// in the documentation and/or other materials provided with the
-// distribution.
-// * Neither the name of Google Inc. nor the names of its
-// contributors may be used to endorse or promote products derived from
-// this software without specific prior written permission.
-//
-// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
-// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
-// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
-// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
-// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
-// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
-// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
-// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
-// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
-// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
-// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-//
-// Code generated by the Protocol Buffer compiler is owned by the owner
-// of the input file used when generating it.  This code is not
-// standalone and requires a support library to be linked with it.  This
-// support library is itself covered by the above license.
-/* eslint-disable prefer-const,@typescript-eslint/restrict-plus-operands */
-/**
- * Read a 64 bit varint as two JS numbers.
- *
- * Returns tuple:
- * [0]: low bits
- * [1]: high bits
- *
- * Copyright 2008 Google Inc.  All rights reserved.
- *
- * See https://github.com/protocolbuffers/protobuf/blob/8a71927d74a4ce34efe2d8769fda198f52d20d12/js/experimental/runtime/kernel/buffer_decoder.js#L175
- */
-export function varint64read() {
-    let lowBits = 0;
-    let highBits = 0;
-    for (let shift = 0; shift < 28; shift += 7) {
-        let b = this.buf[this.pos++];
-        lowBits |= (b & 0x7f) << shift;
-        if ((b & 0x80) == 0) {
-            this.assertBounds();
-            return [lowBits, highBits];
-        }
-    }
-    let middleByte = this.buf[this.pos++];
-    // last four bits of the first 32 bit number
-    lowBits |= (middleByte & 0x0f) << 28;
-    // 3 upper bits are part of the next 32 bit number
-    highBits = (middleByte & 0x70) >> 4;
-    if ((middleByte & 0x80) == 0) {
-        this.assertBounds();
-        return [lowBits, highBits];
-    }
-    for (let shift = 3; shift <= 31; shift += 7) {
-        let b = this.buf[this.pos++];
-        highBits |= (b & 0x7f) << shift;
-        if ((b & 0x80) == 0) {
-            this.assertBounds();
-            return [lowBits, highBits];
-        }
-    }
-    throw new Error('invalid varint');
-}
-/**
- * Write a 64 bit varint, given as two JS numbers, to the given bytes array.
- *
- * Copyright 2008 Google Inc.  All rights reserved.
- *
- * See https://github.com/protocolbuffers/protobuf/blob/8a71927d74a4ce34efe2d8769fda198f52d20d12/js/experimental/runtime/kernel/writer.js#L344
- */
-export function varint64write(lo, hi, bytes) {
-    for (let i = 0; i < 28; i = i + 7) {
-        const shift = lo >>> i;
-        const hasNext = !(shift >>> 7 == 0 && hi == 0);
-        const byte = (hasNext ? shift | 0x80 : shift) & 0xff;
-        bytes.push(byte);
-        if (!hasNext) {
-            return;
-        }
-    }
-    const splitBits = ((lo >>> 28) & 0x0f) | ((hi & 0x07) << 4);
-    const hasMoreBits = !(hi >> 3 == 0);
-    bytes.push((hasMoreBits ? splitBits | 0x80 : splitBits) & 0xff);
-    if (!hasMoreBits) {
-        return;
-    }
-    for (let i = 3; i < 31; i = i + 7) {
-        const shift = hi >>> i;
-        const hasNext = !(shift >>> 7 == 0);
-        const byte = (hasNext ? shift | 0x80 : shift) & 0xff;
-        bytes.push(byte);
-        if (!hasNext) {
-            return;
-        }
-    }
-    bytes.push((hi >>> 31) & 0x01);
-}
-// constants for binary math
-const TWO_PWR_32_DBL = 0x100000000;
-/**
- * Parse decimal string of 64 bit integer value as two JS numbers.
- *
- * Copyright 2008 Google Inc.  All rights reserved.
- *
- * See https://github.com/protocolbuffers/protobuf-javascript/blob/a428c58273abad07c66071d9753bc4d1289de426/experimental/runtime/int64.js#L10
- */
-export function int64FromString(dec) {
-    // Check for minus sign.
-    const minus = dec[0] === '-';
-    if (minus) {
-        dec = dec.slice(1);
-    }
-    // Work 6 decimal digits at a time, acting like we're converting base 1e6
-    // digits to binary. This is safe to do with floating point math because
-    // Number.isSafeInteger(ALL_32_BITS * 1e6) == true.
-    const base = 1e6;
-    let lowBits = 0;
-    let highBits = 0;
-    function add1e6digit(begin, end) {
-        // Note: Number('') is 0.
-        const digit1e6 = Number(dec.slice(begin, end));
-        highBits *= base;
-        lowBits = lowBits * base + digit1e6;
-        // Carry bits from lowBits to
-        if (lowBits >= TWO_PWR_32_DBL) {
-            highBits = highBits + ((lowBits / TWO_PWR_32_DBL) | 0);
-            lowBits = lowBits % TWO_PWR_32_DBL;
-        }
-    }
-    add1e6digit(-24, -18);
-    add1e6digit(-18, -12);
-    add1e6digit(-12, -6);
-    add1e6digit(-6);
-    return minus ? negate(lowBits, highBits) : newBits(lowBits, highBits);
-}
-/**
- * Losslessly converts a 64-bit signed integer in 32:32 split representation
- * into a decimal string.
- *
- * Copyright 2008 Google Inc.  All rights reserved.
- *
- * See https://github.com/protocolbuffers/protobuf-javascript/blob/a428c58273abad07c66071d9753bc4d1289de426/experimental/runtime/int64.js#L10
- */
-export function int64ToString(lo, hi) {
-    let bits = newBits(lo, hi);
-    // If we're treating the input as a signed value and the high bit is set, do
-    // a manual two's complement conversion before the decimal conversion.
-    const negative = bits.hi & 0x80000000;
-    if (negative) {
-        bits = negate(bits.lo, bits.hi);
-    }
-    const result = uInt64ToString(bits.lo, bits.hi);
-    return negative ? '-' + result : result;
-}
-/**
- * Losslessly converts a 64-bit unsigned integer in 32:32 split representation
- * into a decimal string.
- *
- * Copyright 2008 Google Inc.  All rights reserved.
- *
- * See https://github.com/protocolbuffers/protobuf-javascript/blob/a428c58273abad07c66071d9753bc4d1289de426/experimental/runtime/int64.js#L10
- */
-export function uInt64ToString(lo, hi) {
-    ({ lo, hi } = toUnsigned(lo, hi));
-    // Skip the expensive conversion if the number is small enough to use the
-    // built-in conversions.
-    // Number.MAX_SAFE_INTEGER = 0x001FFFFF FFFFFFFF, thus any number with
-    // highBits <= 0x1FFFFF can be safely expressed with a double and retain
-    // integer precision.
-    // Proven by: Number.isSafeInteger(0x1FFFFF * 2**32 + 0xFFFFFFFF) == true.
-    if (hi <= 0x1fffff) {
-        return String(TWO_PWR_32_DBL * hi + lo);
-    }
-    // What this code is doing is essentially converting the input number from
-    // base-2 to base-1e7, which allows us to represent the 64-bit range with
-    // only 3 (very large) digits. Those digits are then trivial to convert to
-    // a base-10 string.
-    // The magic numbers used here are -
-    // 2^24 = 16777216 = (1,6777216) in base-1e7.
-    // 2^48 = 281474976710656 = (2,8147497,6710656) in base-1e7.
-    // Split 32:32 representation into 16:24:24 representation so our
-    // intermediate digits don't overflow.
-    const low = lo & 0xffffff;
-    const mid = ((lo >>> 24) | (hi << 8)) & 0xffffff;
-    const high = (hi >> 16) & 0xffff;
-    // Assemble our three base-1e7 digits, ignoring carries. The maximum
-    // value in a digit at this step is representable as a 48-bit integer, which
-    // can be stored in a 64-bit floating point number.
-    let digitA = low + mid * 6777216 + high * 6710656;
-    let digitB = mid + high * 8147497;
-    let digitC = high * 2;
-    // Apply carries from A to B and from B to C.
-    const base = 10000000;
-    if (digitA >= base) {
-        digitB += Math.floor(digitA / base);
-        digitA %= base;
-    }
-    if (digitB >= base) {
-        digitC += Math.floor(digitB / base);
-        digitB %= base;
-    }
-    // If digitC is 0, then we should have returned in the trivial code path
-    // at the top for non-safe integers. Given this, we can assume both digitB
-    // and digitA need leading zeros.
-    return (digitC.toString() +
-        decimalFrom1e7WithLeadingZeros(digitB) +
-        decimalFrom1e7WithLeadingZeros(digitA));
-}
-function toUnsigned(lo, hi) {
-    return { lo: lo >>> 0, hi: hi >>> 0 };
-}
-function newBits(lo, hi) {
-    return { lo: lo | 0, hi: hi | 0 };
-}
-/**
- * Returns two's compliment negation of input.
- * @see https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Operators/Bitwise_Operators#Signed_32-bit_integers
- */
-function negate(lowBits, highBits) {
-    highBits = ~highBits;
-    if (lowBits) {
-        lowBits = ~lowBits + 1;
-    }
-    else {
-        // If lowBits is 0, then bitwise-not is 0xFFFFFFFF,
-        // adding 1 to that, results in 0x100000000, which leaves
-        // the low bits 0x0 and simply adds one to the high bits.
-        highBits += 1;
-    }
-    return newBits(lowBits, highBits);
-}
-/**
- * Returns decimal representation of digit1e7 with leading zeros.
- */
-const decimalFrom1e7WithLeadingZeros = (digit1e7) => {
-    const partial = String(digit1e7);
-    return '0000000'.slice(partial.length) + partial;
-};
-/**
- * Write a 32 bit varint, signed or unsigned. Same as `varint64write(0, value, bytes)`
- *
- * Copyright 2008 Google Inc.  All rights reserved.
- *
- * See https://github.com/protocolbuffers/protobuf/blob/1b18833f4f2a2f681f4e4a25cdf3b0a43115ec26/js/binary/encoder.js#L144
- */
-export function varint32write(value, bytes) {
-    if (value >= 0) {
-        // write value as varint 32
-        while (value > 0x7f) {
-            bytes.push((value & 0x7f) | 0x80);
-            value = value >>> 7;
-        }
-        bytes.push(value);
-    }
-    else {
-        for (let i = 0; i < 9; i++) {
-            bytes.push((value & 127) | 128);
-            value = value >> 7;
-        }
-        bytes.push(1);
-    }
-}
-/**
- * Read an unsigned 32 bit varint.
- *
- * See https://github.com/protocolbuffers/protobuf/blob/8a71927d74a4ce34efe2d8769fda198f52d20d12/js/experimental/runtime/kernel/buffer_decoder.js#L220
- */
-export function varint32read() {
-    let b = this.buf[this.pos++];
-    let result = b & 0x7f;
-    if ((b & 0x80) == 0) {
-        this.assertBounds();
-        return result;
-    }
-    b = this.buf[this.pos++];
-    result |= (b & 0x7f) << 7;
-    if ((b & 0x80) == 0) {
-        this.assertBounds();
-        return result;
-    }
-    b = this.buf[this.pos++];
-    result |= (b & 0x7f) << 14;
-    if ((b & 0x80) == 0) {
-        this.assertBounds();
-        return result;
-    }
-    b = this.buf[this.pos++];
-    result |= (b & 0x7f) << 21;
-    if ((b & 0x80) == 0) {
-        this.assertBounds();
-        return result;
-    }
-    // Extract only last 4 bits
-    b = this.buf[this.pos++];
-    result |= (b & 0x0f) << 28;
-    for (let readBytes = 5; (b & 0x80) !== 0 && readBytes < 10; readBytes++)
-        b = this.buf[this.pos++];
-    if ((b & 0x80) != 0)
-        throw new Error('invalid varint');
-    this.assertBounds();
-    // Result can have 32 bits, convert it to unsigned
-    return result >>> 0;
-}
-/**
- * encode zig zag
- */
-export function zzEncode(lo, hi) {
-    let mask = hi >> 31;
-    hi = (((hi << 1) | (lo >>> 31)) ^ mask) >>> 0;
-    lo = ((lo << 1) ^ mask) >>> 0;
-    return [lo, hi];
-}
-/**
- * decode zig zag
- */
-export function zzDecode(lo, hi) {
-    let mask = -(lo & 1);
-    lo = (((lo >>> 1) | (hi << 31)) ^ mask) >>> 0;
-    hi = ((hi >>> 1) ^ mask) >>> 0;
-    return [lo, hi];
-}
-/**
- * unsigned int32 without moving pos.
- */
-export function readUInt32(buf, pos) {
-    return ((buf[pos] | (buf[pos + 1] << 8) | (buf[pos + 2] << 16)) +
-        buf[pos + 3] * 0x1000000);
-}
-/**
- * signed int32 without moving pos.
- */
-export function readInt32(buf, pos) {
-    return ((buf[pos] | (buf[pos + 1] << 8) | (buf[pos + 2] << 16)) +
-        (buf[pos + 3] << 24));
-}
-/**
- * writing varint32 to pos
- */
-export function writeVarint32(val, buf, pos) {
-    while (val > 127) {
-        buf[pos++] = (val & 127) | 128;
-        val >>>= 7;
-    }
-    buf[pos] = val;
-}
-/**
- * writing varint64 to pos
- */
-export function writeVarint64(val, buf, pos) {
-    while (val.hi) {
-        buf[pos++] = (val.lo & 127) | 128;
-        val.lo = ((val.lo >>> 7) | (val.hi << 25)) >>> 0;
-        val.hi >>>= 7;
-    }
-    while (val.lo > 127) {
-        buf[pos++] = (val.lo & 127) | 128;
-        val.lo = val.lo >>> 7;
-    }
-    buf[pos++] = val.lo;
-}
-export function int64Length(lo, hi) {
-    let part0 = lo, part1 = ((lo >>> 28) | (hi << 4)) >>> 0, part2 = hi >>> 24;
-    return part2 === 0
-        ? part1 === 0
-            ? part0 < 16384
-                ? part0 < 128
-                    ? 1
-                    : 2
-                : part0 < 2097152
-                    ? 3
-                    : 4
-            : part1 < 16384
-                ? part1 < 128
-                    ? 5
-                    : 6
-                : part1 < 2097152
-                    ? 7
-                    : 8
-        : part2 < 128
-            ? 9
-            : 10;
-}
-export function writeFixed32(val, buf, pos) {
-    buf[pos] = val & 255;
-    buf[pos + 1] = (val >>> 8) & 255;
-    buf[pos + 2] = (val >>> 16) & 255;
-    buf[pos + 3] = val >>> 24;
-}
-export function writeByte(val, buf, pos) {
-    buf[pos] = val & 255;
-}
-//# sourceMappingURL=varint.js.map
+export function varint64read(){let t=0,r=0;for(let n=0;n<28;n+=7){let o=this.buf[this.pos++];if(t|=(127&o)<<n,!(128&o))return this.assertBounds(),[t,r]}let n=this.buf[this.pos++];if(t|=(15&n)<<28,r=(112&n)>>4,!(128&n))return this.assertBounds(),[t,r];for(let n=3;n<=31;n+=7){let o=this.buf[this.pos++];if(r|=(127&o)<<n,!(128&o))return this.assertBounds(),[t,r]}throw new Error("invalid varint")}export function varint64write(t,r,n){for(let o=0;o<28;o+=7){const i=t>>>o,e=!(i>>>7==0&&0==r),s=255&(e?128|i:i);if(n.push(s),!e)return}const o=t>>>28&15|(7&r)<<4,i=!!(r>>3);if(n.push(255&(i?128|o:o)),i){for(let t=3;t<31;t+=7){const o=r>>>t,i=!(o>>>7==0),e=255&(i?128|o:o);if(n.push(e),!i)return}n.push(r>>>31&1)}}const t=4294967296;export function int64FromString(o){const i="-"===o[0];i&&(o=o.slice(1));const e=1e6;let s=0,u=0;function f(r,n){const i=Number(o.slice(r,n));u*=e,s=s*e+i,s>=t&&(u+=s/t|0,s%=t)}return f(-24,-18),f(-18,-12),f(-12,-6),f(-6),i?n(s,u):r(s,u)}export function int64ToString(t,o){let i=r(t,o);const e=2147483648&i.hi;e&&(i=n(i.lo,i.hi));const s=uInt64ToString(i.lo,i.hi);return e?"-"+s:s}export function uInt64ToString(r,n){if(({lo:r,hi:n}=function(t,r){return{lo:t>>>0,hi:r>>>0}}(r,n)),n<=2097151)return String(t*n+r);const i=16777215&(r>>>24|n<<8),e=n>>16&65535;let s=(16777215&r)+6777216*i+6710656*e,u=i+8147497*e,f=2*e;const h=1e7;return s>=h&&(u+=Math.floor(s/h),s%=h),u>=h&&(f+=Math.floor(u/h),u%=h),f.toString()+o(u)+o(s)}function r(t,r){return{lo:0|t,hi:0|r}}function n(t,n){return n=~n,t?t=1+~t:n+=1,r(t,n)}const o=t=>{const r=String(t);return"0000000".slice(r.length)+r};export function varint32write(t,r){if(t>=0){for(;t>127;)r.push(127&t|128),t>>>=7;r.push(t)}else{for(let n=0;n<9;n++)r.push(127&t|128),t>>=7;r.push(1)}}export function varint32read(){let t=this.buf[this.pos++],r=127&t;if(!(128&t))return this.assertBounds(),r;if(t=this.buf[this.pos++],r|=(127&t)<<7,!(128&t))return this.assertBounds(),r;if(t=this.buf[this.pos++],r|=(127&t)<<14,!(128&t))return this.assertBounds(),r;if(t=this.buf[this.pos++],r|=(127&t)<<21,!(128&t))return this.assertBounds(),r;t=this.buf[this.pos++],r|=(15&t)<<28;for(let r=5;128&t&&r<10;r++)t=this.buf[this.pos++];if(128&t)throw new Error("invalid varint");return this.assertBounds(),r>>>0}export function zzEncode(t,r){let n=r>>31;return r=((r<<1|t>>>31)^n)>>>0,[t=(t<<1^n)>>>0,r]}export function zzDecode(t,r){let n=-(1&t);return[t=((t>>>1|r<<31)^n)>>>0,r=(r>>>1^n)>>>0]}export function readUInt32(t,r){return(t[r]|t[r+1]<<8|t[r+2]<<16)+16777216*t[r+3]}export function readInt32(t,r){return(t[r]|t[r+1]<<8|t[r+2]<<16)+(t[r+3]<<24)}export function writeVarint32(t,r,n){for(;t>127;)r[n++]=127&t|128,t>>>=7;r[n]=t}export function writeVarint64(t,r,n){for(;t.hi;)r[n++]=127&t.lo|128,t.lo=(t.lo>>>7|t.hi<<25)>>>0,t.hi>>>=7;for(;t.lo>127;)r[n++]=127&t.lo|128,t.lo=t.lo>>>7;r[n++]=t.lo}export function int64Length(t,r){let n=(t>>>28|r<<4)>>>0,o=r>>>24;return 0===o?0===n?t<16384?t<128?1:2:t<2097152?3:4:n<16384?n<128?5:6:n<2097152?7:8:o<128?9:10}export function writeFixed32(t,r,n){r[n]=255&t,r[n+1]=t>>>8&255,r[n+2]=t>>>16&255,r[n+3]=t>>>24}export function writeByte(t,r,n){r[n]=255&t}

package/dist/helpers.js

@@ -1,22 +1 @@
-import { RequestQuery } from './codegen/tendermint/abci/types.js';
-export const typedJson = (typeStr, obj) => {
-    return {
-        '@type': typeStr,
-        ...obj,
-    };
-};
-const QUERY_REQ_TYPEURL_RE = /^\/(?<serviceName>\w+(?:\.\w+)*)\.Query(?<methodName>\w+)Request$/;
-export const typeUrlToGrpcPath = (typeUrl) => {
-    const match = typeUrl.match(QUERY_REQ_TYPEURL_RE);
-    if (!(match && match.groups)) {
-        throw TypeError(`Invalid typeUrl: ${typeUrl}. Must be a Query Request.`);
-    }
-    const { serviceName, methodName } = match.groups;
-    return `/${serviceName}.Query/${methodName}`;
-};
-export const toRequestQueryJson = (msg, opts = {}) => RequestQuery.toJSON(RequestQuery.fromPartial({
-    path: typeUrlToGrpcPath(msg.typeUrl),
-    data: msg.value,
-    ...opts,
-}));
-//# sourceMappingURL=helpers.js.map
+import{RequestQuery as e}from"./codegen/tendermint/abci/types.js";export const typedJson=(e,t)=>({"@type":e,...t});const t=/^\/(?<serviceName>\w+(?:\.\w+)*)\.Query(?<methodName>\w+)Request$/;export const typeUrlToGrpcPath=e=>{const r=e.match(t);if(!r||!r.groups)throw TypeError(`Invalid typeUrl: ${e}. Must be a Query Request.`);const{serviceName:o,methodName:s}=r.groups;return`/${o}.Query/${s}`};export const toRequestQueryJson=(t,r={})=>e.toJSON(e.fromPartial({path:typeUrlToGrpcPath(t.typeUrl),data:t.value,...r}));

package/dist/index.js

@@ -1,6 +1 @@
-// Do not export codegen/index.js because it entrains multiple megabytes of module imports.
-// Instead we have the top level be relatively conservative, just things that are safe to import into a vat.
-// This can include all the types because those are free (never included in a JS bundle).
-export * from './codegen/json-safe.js';
-export * from './helpers.js';
-//# sourceMappingURL=index.js.map
+export*from"./codegen/json-safe.js";export*from"./helpers.js";

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@agoric/cosmic-proto",
-  "version": "0.5.0-u19.2",
+  "version": "0.5.0-u20.0",
   "description": "Protobuf stubs for the Agoric cosmos-sdk module",
   "keywords": [],
   "author": "Agoric",
@@ -148,9 +148,9 @@
     "!CHANGELOG.md"
   ],
   "scripts": {
-    "build": "tsc --project tsconfig.build.json",
+    "build": "tsc --project tsconfig.build.json && scripts/minify.cjs",
     "clean": "rimraf dist",
-    "codegen": "./update-protos.sh && node scripts/codegen.cjs",
+    "codegen": "./update-protos.sh && scripts/codegen.cjs",
     "prepare": "npm run build",
     "lint-fix": "yarn lint:eslint --fix",
     "lint": "run-s --continue-on-error lint:*",
@@ -164,20 +164,22 @@
     "access": "public"
   },
   "devDependencies": {
-    "@agoric/cosmos": "^0.35.0-u19.2",
+    "@agoric/cosmos": "^0.35.0-u20.0",
     "@ava/typescript": "^4.1.0",
     "@cosmology/telescope": "https://gitpkg.vercel.app/agoric-labs/telescope/packages/telescope?8d2c2f6ba637a5578eead09a7368dc41c262a9d0",
-    "@endo/bundle-source": "^3.5.1",
-    "@endo/import-bundle": "^1.3.3",
-    "@endo/ses-ava": "^1.2.9",
+    "@endo/bundle-source": "^4.0.0",
+    "@endo/import-bundle": "^1.4.0",
+    "@endo/ses-ava": "^1.2.10",
     "ava": "^5.3.1",
+    "glob": "^4.5.3",
     "rimraf": "^5.0.0",
+    "terser": "^5.39.0",
     "tsd": "^0.31.1",
-    "typescript": "~5.8.1-rc"
+    "typescript": "~5.8.2"
   },
   "dependencies": {
     "@endo/base64": "^1.0.9",
-    "@endo/init": "^1.1.8",
+    "@endo/init": "^1.1.9",
     "bech32": "^2.0.0",
     "query-string": "^9.1.1"
   },
@@ -196,5 +198,5 @@
       "test/**/*.test.*"
     ]
   },
-  "gitHead": "f0ae74b84cb6de3724bfdcd18b4bea7e8199dee1"
+  "gitHead": "8e4207fa19dabf76c1f91f8779b5b5b93570ecea"
 }