@agoric/cosmic-proto 0.4.1-orchestration-dev-096c4e8.0 → 0.4.1-other-dev-fbe72e7.0.fbe72e7

package/dist/codegen/cosmos/ics23/v1/proofs.d.ts

@@ -0,0 +1,585 @@
+import { BinaryReader, BinaryWriter } from '../../../binary.js';
+import { type JsonSafe } from '../../../json-safe.js';
+export declare enum HashOp {
+    /** NO_HASH - NO_HASH is the default if no data passed. Note this is an illegal argument some places. */
+    NO_HASH = 0,
+    SHA256 = 1,
+    SHA512 = 2,
+    KECCAK256 = 3,
+    RIPEMD160 = 4,
+    /** BITCOIN - ripemd160(sha256(x)) */
+    BITCOIN = 5,
+    SHA512_256 = 6,
+    BLAKE2B_512 = 7,
+    BLAKE2S_256 = 8,
+    BLAKE3 = 9,
+    UNRECOGNIZED = -1
+}
+export declare const HashOpSDKType: typeof HashOp;
+export declare function hashOpFromJSON(object: any): HashOp;
+export declare function hashOpToJSON(object: HashOp): string;
+/**
+ * LengthOp defines how to process the key and value of the LeafOp
+ * to include length information. After encoding the length with the given
+ * algorithm, the length will be prepended to the key and value bytes.
+ * (Each one with it's own encoded length)
+ */
+export declare enum LengthOp {
+    /** NO_PREFIX - NO_PREFIX don't include any length info */
+    NO_PREFIX = 0,
+    /** VAR_PROTO - VAR_PROTO uses protobuf (and go-amino) varint encoding of the length */
+    VAR_PROTO = 1,
+    /** VAR_RLP - VAR_RLP uses rlp int encoding of the length */
+    VAR_RLP = 2,
+    /** FIXED32_BIG - FIXED32_BIG uses big-endian encoding of the length as a 32 bit integer */
+    FIXED32_BIG = 3,
+    /** FIXED32_LITTLE - FIXED32_LITTLE uses little-endian encoding of the length as a 32 bit integer */
+    FIXED32_LITTLE = 4,
+    /** FIXED64_BIG - FIXED64_BIG uses big-endian encoding of the length as a 64 bit integer */
+    FIXED64_BIG = 5,
+    /** FIXED64_LITTLE - FIXED64_LITTLE uses little-endian encoding of the length as a 64 bit integer */
+    FIXED64_LITTLE = 6,
+    /** REQUIRE_32_BYTES - REQUIRE_32_BYTES is like NONE, but will fail if the input is not exactly 32 bytes (sha256 output) */
+    REQUIRE_32_BYTES = 7,
+    /** REQUIRE_64_BYTES - REQUIRE_64_BYTES is like NONE, but will fail if the input is not exactly 64 bytes (sha512 output) */
+    REQUIRE_64_BYTES = 8,
+    UNRECOGNIZED = -1
+}
+export declare const LengthOpSDKType: typeof LengthOp;
+export declare function lengthOpFromJSON(object: any): LengthOp;
+export declare function lengthOpToJSON(object: LengthOp): string;
+/**
+ * ExistenceProof takes a key and a value and a set of steps to perform on it.
+ * The result of peforming all these steps will provide a "root hash", which can
+ * be compared to the value in a header.
+ *
+ * Since it is computationally infeasible to produce a hash collission for any of the used
+ * cryptographic hash functions, if someone can provide a series of operations to transform
+ * a given key and value into a root hash that matches some trusted root, these key and values
+ * must be in the referenced merkle tree.
+ *
+ * The only possible issue is maliablity in LeafOp, such as providing extra prefix data,
+ * which should be controlled by a spec. Eg. with lengthOp as NONE,
+ * prefix = FOO, key = BAR, value = CHOICE
+ * and
+ * prefix = F, key = OOBAR, value = CHOICE
+ * would produce the same value.
+ *
+ * With LengthOp this is tricker but not impossible. Which is why the "leafPrefixEqual" field
+ * in the ProofSpec is valuable to prevent this mutability. And why all trees should
+ * length-prefix the data before hashing it.
+ */
+export interface ExistenceProof {
+    key: Uint8Array;
+    value: Uint8Array;
+    leaf?: LeafOp;
+    path: InnerOp[];
+}
+export interface ExistenceProofProtoMsg {
+    typeUrl: '/cosmos.ics23.v1.ExistenceProof';
+    value: Uint8Array;
+}
+/**
+ * ExistenceProof takes a key and a value and a set of steps to perform on it.
+ * The result of peforming all these steps will provide a "root hash", which can
+ * be compared to the value in a header.
+ *
+ * Since it is computationally infeasible to produce a hash collission for any of the used
+ * cryptographic hash functions, if someone can provide a series of operations to transform
+ * a given key and value into a root hash that matches some trusted root, these key and values
+ * must be in the referenced merkle tree.
+ *
+ * The only possible issue is maliablity in LeafOp, such as providing extra prefix data,
+ * which should be controlled by a spec. Eg. with lengthOp as NONE,
+ * prefix = FOO, key = BAR, value = CHOICE
+ * and
+ * prefix = F, key = OOBAR, value = CHOICE
+ * would produce the same value.
+ *
+ * With LengthOp this is tricker but not impossible. Which is why the "leafPrefixEqual" field
+ * in the ProofSpec is valuable to prevent this mutability. And why all trees should
+ * length-prefix the data before hashing it.
+ */
+export interface ExistenceProofSDKType {
+    key: Uint8Array;
+    value: Uint8Array;
+    leaf?: LeafOpSDKType;
+    path: InnerOpSDKType[];
+}
+/**
+ * NonExistenceProof takes a proof of two neighbors, one left of the desired key,
+ * one right of the desired key. If both proofs are valid AND they are neighbors,
+ * then there is no valid proof for the given key.
+ */
+export interface NonExistenceProof {
+    /** TODO: remove this as unnecessary??? we prove a range */
+    key: Uint8Array;
+    left?: ExistenceProof;
+    right?: ExistenceProof;
+}
+export interface NonExistenceProofProtoMsg {
+    typeUrl: '/cosmos.ics23.v1.NonExistenceProof';
+    value: Uint8Array;
+}
+/**
+ * NonExistenceProof takes a proof of two neighbors, one left of the desired key,
+ * one right of the desired key. If both proofs are valid AND they are neighbors,
+ * then there is no valid proof for the given key.
+ */
+export interface NonExistenceProofSDKType {
+    key: Uint8Array;
+    left?: ExistenceProofSDKType;
+    right?: ExistenceProofSDKType;
+}
+/** CommitmentProof is either an ExistenceProof or a NonExistenceProof, or a Batch of such messages */
+export interface CommitmentProof {
+    exist?: ExistenceProof;
+    nonexist?: NonExistenceProof;
+    batch?: BatchProof;
+    compressed?: CompressedBatchProof;
+}
+export interface CommitmentProofProtoMsg {
+    typeUrl: '/cosmos.ics23.v1.CommitmentProof';
+    value: Uint8Array;
+}
+/** CommitmentProof is either an ExistenceProof or a NonExistenceProof, or a Batch of such messages */
+export interface CommitmentProofSDKType {
+    exist?: ExistenceProofSDKType;
+    nonexist?: NonExistenceProofSDKType;
+    batch?: BatchProofSDKType;
+    compressed?: CompressedBatchProofSDKType;
+}
+/**
+ * LeafOp represents the raw key-value data we wish to prove, and
+ * must be flexible to represent the internal transformation from
+ * the original key-value pairs into the basis hash, for many existing
+ * merkle trees.
+ *
+ * key and value are passed in. So that the signature of this operation is:
+ * leafOp(key, value) -> output
+ *
+ * To process this, first prehash the keys and values if needed (ANY means no hash in this case):
+ * hkey = prehashKey(key)
+ * hvalue = prehashValue(value)
+ *
+ * Then combine the bytes, and hash it
+ * output = hash(prefix || length(hkey) || hkey || length(hvalue) || hvalue)
+ */
+export interface LeafOp {
+    hash: HashOp;
+    prehashKey: HashOp;
+    prehashValue: HashOp;
+    length: LengthOp;
+    /**
+     * prefix is a fixed bytes that may optionally be included at the beginning to differentiate
+     * a leaf node from an inner node.
+     */
+    prefix: Uint8Array;
+}
+export interface LeafOpProtoMsg {
+    typeUrl: '/cosmos.ics23.v1.LeafOp';
+    value: Uint8Array;
+}
+/**
+ * LeafOp represents the raw key-value data we wish to prove, and
+ * must be flexible to represent the internal transformation from
+ * the original key-value pairs into the basis hash, for many existing
+ * merkle trees.
+ *
+ * key and value are passed in. So that the signature of this operation is:
+ * leafOp(key, value) -> output
+ *
+ * To process this, first prehash the keys and values if needed (ANY means no hash in this case):
+ * hkey = prehashKey(key)
+ * hvalue = prehashValue(value)
+ *
+ * Then combine the bytes, and hash it
+ * output = hash(prefix || length(hkey) || hkey || length(hvalue) || hvalue)
+ */
+export interface LeafOpSDKType {
+    hash: HashOp;
+    prehash_key: HashOp;
+    prehash_value: HashOp;
+    length: LengthOp;
+    prefix: Uint8Array;
+}
+/**
+ * InnerOp represents a merkle-proof step that is not a leaf.
+ * It represents concatenating two children and hashing them to provide the next result.
+ *
+ * The result of the previous step is passed in, so the signature of this op is:
+ * innerOp(child) -> output
+ *
+ * The result of applying InnerOp should be:
+ * output = op.hash(op.prefix || child || op.suffix)
+ *
+ * where the || operator is concatenation of binary data,
+ * and child is the result of hashing all the tree below this step.
+ *
+ * Any special data, like prepending child with the length, or prepending the entire operation with
+ * some value to differentiate from leaf nodes, should be included in prefix and suffix.
+ * If either of prefix or suffix is empty, we just treat it as an empty string
+ */
+export interface InnerOp {
+    hash: HashOp;
+    prefix: Uint8Array;
+    suffix: Uint8Array;
+}
+export interface InnerOpProtoMsg {
+    typeUrl: '/cosmos.ics23.v1.InnerOp';
+    value: Uint8Array;
+}
+/**
+ * InnerOp represents a merkle-proof step that is not a leaf.
+ * It represents concatenating two children and hashing them to provide the next result.
+ *
+ * The result of the previous step is passed in, so the signature of this op is:
+ * innerOp(child) -> output
+ *
+ * The result of applying InnerOp should be:
+ * output = op.hash(op.prefix || child || op.suffix)
+ *
+ * where the || operator is concatenation of binary data,
+ * and child is the result of hashing all the tree below this step.
+ *
+ * Any special data, like prepending child with the length, or prepending the entire operation with
+ * some value to differentiate from leaf nodes, should be included in prefix and suffix.
+ * If either of prefix or suffix is empty, we just treat it as an empty string
+ */
+export interface InnerOpSDKType {
+    hash: HashOp;
+    prefix: Uint8Array;
+    suffix: Uint8Array;
+}
+/**
+ * ProofSpec defines what the expected parameters are for a given proof type.
+ * This can be stored in the client and used to validate any incoming proofs.
+ *
+ * verify(ProofSpec, Proof) -> Proof | Error
+ *
+ * As demonstrated in tests, if we don't fix the algorithm used to calculate the
+ * LeafHash for a given tree, there are many possible key-value pairs that can
+ * generate a given hash (by interpretting the preimage differently).
+ * We need this for proper security, requires client knows a priori what
+ * tree format server uses. But not in code, rather a configuration object.
+ */
+export interface ProofSpec {
+    /**
+     * any field in the ExistenceProof must be the same as in this spec.
+     * except Prefix, which is just the first bytes of prefix (spec can be longer)
+     */
+    leafSpec?: LeafOp;
+    innerSpec?: InnerSpec;
+    /**
+     * max_depth (if > 0) is the maximum number of InnerOps allowed (mainly for fixed-depth tries)
+     * the max_depth is interpreted as 128 if set to 0
+     */
+    maxDepth: number;
+    /** min_depth (if > 0) is the minimum number of InnerOps allowed (mainly for fixed-depth tries) */
+    minDepth: number;
+    /**
+     * prehash_key_before_comparison is a flag that indicates whether to use the
+     * prehash_key specified by LeafOp to compare lexical ordering of keys for
+     * non-existence proofs.
+     */
+    prehashKeyBeforeComparison: boolean;
+}
+export interface ProofSpecProtoMsg {
+    typeUrl: '/cosmos.ics23.v1.ProofSpec';
+    value: Uint8Array;
+}
+/**
+ * ProofSpec defines what the expected parameters are for a given proof type.
+ * This can be stored in the client and used to validate any incoming proofs.
+ *
+ * verify(ProofSpec, Proof) -> Proof | Error
+ *
+ * As demonstrated in tests, if we don't fix the algorithm used to calculate the
+ * LeafHash for a given tree, there are many possible key-value pairs that can
+ * generate a given hash (by interpretting the preimage differently).
+ * We need this for proper security, requires client knows a priori what
+ * tree format server uses. But not in code, rather a configuration object.
+ */
+export interface ProofSpecSDKType {
+    leaf_spec?: LeafOpSDKType;
+    inner_spec?: InnerSpecSDKType;
+    max_depth: number;
+    min_depth: number;
+    prehash_key_before_comparison: boolean;
+}
+/**
+ * InnerSpec contains all store-specific structure info to determine if two proofs from a
+ * given store are neighbors.
+ *
+ * This enables:
+ *
+ * isLeftMost(spec: InnerSpec, op: InnerOp)
+ * isRightMost(spec: InnerSpec, op: InnerOp)
+ * isLeftNeighbor(spec: InnerSpec, left: InnerOp, right: InnerOp)
+ */
+export interface InnerSpec {
+    /**
+     * Child order is the ordering of the children node, must count from 0
+     * iavl tree is [0, 1] (left then right)
+     * merk is [0, 2, 1] (left, right, here)
+     */
+    childOrder: number[];
+    childSize: number;
+    minPrefixLength: number;
+    /** the max prefix length must be less than the minimum prefix length + child size */
+    maxPrefixLength: number;
+    /** empty child is the prehash image that is used when one child is nil (eg. 20 bytes of 0) */
+    emptyChild: Uint8Array;
+    /** hash is the algorithm that must be used for each InnerOp */
+    hash: HashOp;
+}
+export interface InnerSpecProtoMsg {
+    typeUrl: '/cosmos.ics23.v1.InnerSpec';
+    value: Uint8Array;
+}
+/**
+ * InnerSpec contains all store-specific structure info to determine if two proofs from a
+ * given store are neighbors.
+ *
+ * This enables:
+ *
+ * isLeftMost(spec: InnerSpec, op: InnerOp)
+ * isRightMost(spec: InnerSpec, op: InnerOp)
+ * isLeftNeighbor(spec: InnerSpec, left: InnerOp, right: InnerOp)
+ */
+export interface InnerSpecSDKType {
+    child_order: number[];
+    child_size: number;
+    min_prefix_length: number;
+    max_prefix_length: number;
+    empty_child: Uint8Array;
+    hash: HashOp;
+}
+/** BatchProof is a group of multiple proof types than can be compressed */
+export interface BatchProof {
+    entries: BatchEntry[];
+}
+export interface BatchProofProtoMsg {
+    typeUrl: '/cosmos.ics23.v1.BatchProof';
+    value: Uint8Array;
+}
+/** BatchProof is a group of multiple proof types than can be compressed */
+export interface BatchProofSDKType {
+    entries: BatchEntrySDKType[];
+}
+/** Use BatchEntry not CommitmentProof, to avoid recursion */
+export interface BatchEntry {
+    exist?: ExistenceProof;
+    nonexist?: NonExistenceProof;
+}
+export interface BatchEntryProtoMsg {
+    typeUrl: '/cosmos.ics23.v1.BatchEntry';
+    value: Uint8Array;
+}
+/** Use BatchEntry not CommitmentProof, to avoid recursion */
+export interface BatchEntrySDKType {
+    exist?: ExistenceProofSDKType;
+    nonexist?: NonExistenceProofSDKType;
+}
+export interface CompressedBatchProof {
+    entries: CompressedBatchEntry[];
+    lookupInners: InnerOp[];
+}
+export interface CompressedBatchProofProtoMsg {
+    typeUrl: '/cosmos.ics23.v1.CompressedBatchProof';
+    value: Uint8Array;
+}
+export interface CompressedBatchProofSDKType {
+    entries: CompressedBatchEntrySDKType[];
+    lookup_inners: InnerOpSDKType[];
+}
+/** Use BatchEntry not CommitmentProof, to avoid recursion */
+export interface CompressedBatchEntry {
+    exist?: CompressedExistenceProof;
+    nonexist?: CompressedNonExistenceProof;
+}
+export interface CompressedBatchEntryProtoMsg {
+    typeUrl: '/cosmos.ics23.v1.CompressedBatchEntry';
+    value: Uint8Array;
+}
+/** Use BatchEntry not CommitmentProof, to avoid recursion */
+export interface CompressedBatchEntrySDKType {
+    exist?: CompressedExistenceProofSDKType;
+    nonexist?: CompressedNonExistenceProofSDKType;
+}
+export interface CompressedExistenceProof {
+    key: Uint8Array;
+    value: Uint8Array;
+    leaf?: LeafOp;
+    /** these are indexes into the lookup_inners table in CompressedBatchProof */
+    path: number[];
+}
+export interface CompressedExistenceProofProtoMsg {
+    typeUrl: '/cosmos.ics23.v1.CompressedExistenceProof';
+    value: Uint8Array;
+}
+export interface CompressedExistenceProofSDKType {
+    key: Uint8Array;
+    value: Uint8Array;
+    leaf?: LeafOpSDKType;
+    path: number[];
+}
+export interface CompressedNonExistenceProof {
+    /** TODO: remove this as unnecessary??? we prove a range */
+    key: Uint8Array;
+    left?: CompressedExistenceProof;
+    right?: CompressedExistenceProof;
+}
+export interface CompressedNonExistenceProofProtoMsg {
+    typeUrl: '/cosmos.ics23.v1.CompressedNonExistenceProof';
+    value: Uint8Array;
+}
+export interface CompressedNonExistenceProofSDKType {
+    key: Uint8Array;
+    left?: CompressedExistenceProofSDKType;
+    right?: CompressedExistenceProofSDKType;
+}
+export declare const ExistenceProof: {
+    typeUrl: "/cosmos.ics23.v1.ExistenceProof";
+    encode(message: ExistenceProof, writer?: BinaryWriter): BinaryWriter;
+    decode(input: BinaryReader | Uint8Array, length?: number): ExistenceProof;
+    fromJSON(object: any): ExistenceProof;
+    toJSON(message: ExistenceProof): JsonSafe<ExistenceProof>;
+    fromPartial(object: Partial<ExistenceProof>): ExistenceProof;
+    fromProtoMsg(message: ExistenceProofProtoMsg): ExistenceProof;
+    toProto(message: ExistenceProof): Uint8Array;
+    toProtoMsg(message: ExistenceProof): ExistenceProofProtoMsg;
+};
+export declare const NonExistenceProof: {
+    typeUrl: "/cosmos.ics23.v1.NonExistenceProof";
+    encode(message: NonExistenceProof, writer?: BinaryWriter): BinaryWriter;
+    decode(input: BinaryReader | Uint8Array, length?: number): NonExistenceProof;
+    fromJSON(object: any): NonExistenceProof;
+    toJSON(message: NonExistenceProof): JsonSafe<NonExistenceProof>;
+    fromPartial(object: Partial<NonExistenceProof>): NonExistenceProof;
+    fromProtoMsg(message: NonExistenceProofProtoMsg): NonExistenceProof;
+    toProto(message: NonExistenceProof): Uint8Array;
+    toProtoMsg(message: NonExistenceProof): NonExistenceProofProtoMsg;
+};
+export declare const CommitmentProof: {
+    typeUrl: "/cosmos.ics23.v1.CommitmentProof";
+    encode(message: CommitmentProof, writer?: BinaryWriter): BinaryWriter;
+    decode(input: BinaryReader | Uint8Array, length?: number): CommitmentProof;
+    fromJSON(object: any): CommitmentProof;
+    toJSON(message: CommitmentProof): JsonSafe<CommitmentProof>;
+    fromPartial(object: Partial<CommitmentProof>): CommitmentProof;
+    fromProtoMsg(message: CommitmentProofProtoMsg): CommitmentProof;
+    toProto(message: CommitmentProof): Uint8Array;
+    toProtoMsg(message: CommitmentProof): CommitmentProofProtoMsg;
+};
+export declare const LeafOp: {
+    typeUrl: "/cosmos.ics23.v1.LeafOp";
+    encode(message: LeafOp, writer?: BinaryWriter): BinaryWriter;
+    decode(input: BinaryReader | Uint8Array, length?: number): LeafOp;
+    fromJSON(object: any): LeafOp;
+    toJSON(message: LeafOp): JsonSafe<LeafOp>;
+    fromPartial(object: Partial<LeafOp>): LeafOp;
+    fromProtoMsg(message: LeafOpProtoMsg): LeafOp;
+    toProto(message: LeafOp): Uint8Array;
+    toProtoMsg(message: LeafOp): LeafOpProtoMsg;
+};
+export declare const InnerOp: {
+    typeUrl: "/cosmos.ics23.v1.InnerOp";
+    encode(message: InnerOp, writer?: BinaryWriter): BinaryWriter;
+    decode(input: BinaryReader | Uint8Array, length?: number): InnerOp;
+    fromJSON(object: any): InnerOp;
+    toJSON(message: InnerOp): JsonSafe<InnerOp>;
+    fromPartial(object: Partial<InnerOp>): InnerOp;
+    fromProtoMsg(message: InnerOpProtoMsg): InnerOp;
+    toProto(message: InnerOp): Uint8Array;
+    toProtoMsg(message: InnerOp): InnerOpProtoMsg;
+};
+export declare const ProofSpec: {
+    typeUrl: "/cosmos.ics23.v1.ProofSpec";
+    encode(message: ProofSpec, writer?: BinaryWriter): BinaryWriter;
+    decode(input: BinaryReader | Uint8Array, length?: number): ProofSpec;
+    fromJSON(object: any): ProofSpec;
+    toJSON(message: ProofSpec): JsonSafe<ProofSpec>;
+    fromPartial(object: Partial<ProofSpec>): ProofSpec;
+    fromProtoMsg(message: ProofSpecProtoMsg): ProofSpec;
+    toProto(message: ProofSpec): Uint8Array;
+    toProtoMsg(message: ProofSpec): ProofSpecProtoMsg;
+};
+export declare const InnerSpec: {
+    typeUrl: "/cosmos.ics23.v1.InnerSpec";
+    encode(message: InnerSpec, writer?: BinaryWriter): BinaryWriter;
+    decode(input: BinaryReader | Uint8Array, length?: number): InnerSpec;
+    fromJSON(object: any): InnerSpec;
+    toJSON(message: InnerSpec): JsonSafe<InnerSpec>;
+    fromPartial(object: Partial<InnerSpec>): InnerSpec;
+    fromProtoMsg(message: InnerSpecProtoMsg): InnerSpec;
+    toProto(message: InnerSpec): Uint8Array;
+    toProtoMsg(message: InnerSpec): InnerSpecProtoMsg;
+};
+export declare const BatchProof: {
+    typeUrl: "/cosmos.ics23.v1.BatchProof";
+    encode(message: BatchProof, writer?: BinaryWriter): BinaryWriter;
+    decode(input: BinaryReader | Uint8Array, length?: number): BatchProof;
+    fromJSON(object: any): BatchProof;
+    toJSON(message: BatchProof): JsonSafe<BatchProof>;
+    fromPartial(object: Partial<BatchProof>): BatchProof;
+    fromProtoMsg(message: BatchProofProtoMsg): BatchProof;
+    toProto(message: BatchProof): Uint8Array;
+    toProtoMsg(message: BatchProof): BatchProofProtoMsg;
+};
+export declare const BatchEntry: {
+    typeUrl: "/cosmos.ics23.v1.BatchEntry";
+    encode(message: BatchEntry, writer?: BinaryWriter): BinaryWriter;
+    decode(input: BinaryReader | Uint8Array, length?: number): BatchEntry;
+    fromJSON(object: any): BatchEntry;
+    toJSON(message: BatchEntry): JsonSafe<BatchEntry>;
+    fromPartial(object: Partial<BatchEntry>): BatchEntry;
+    fromProtoMsg(message: BatchEntryProtoMsg): BatchEntry;
+    toProto(message: BatchEntry): Uint8Array;
+    toProtoMsg(message: BatchEntry): BatchEntryProtoMsg;
+};
+export declare const CompressedBatchProof: {
+    typeUrl: "/cosmos.ics23.v1.CompressedBatchProof";
+    encode(message: CompressedBatchProof, writer?: BinaryWriter): BinaryWriter;
+    decode(input: BinaryReader | Uint8Array, length?: number): CompressedBatchProof;
+    fromJSON(object: any): CompressedBatchProof;
+    toJSON(message: CompressedBatchProof): JsonSafe<CompressedBatchProof>;
+    fromPartial(object: Partial<CompressedBatchProof>): CompressedBatchProof;
+    fromProtoMsg(message: CompressedBatchProofProtoMsg): CompressedBatchProof;
+    toProto(message: CompressedBatchProof): Uint8Array;
+    toProtoMsg(message: CompressedBatchProof): CompressedBatchProofProtoMsg;
+};
+export declare const CompressedBatchEntry: {
+    typeUrl: "/cosmos.ics23.v1.CompressedBatchEntry";
+    encode(message: CompressedBatchEntry, writer?: BinaryWriter): BinaryWriter;
+    decode(input: BinaryReader | Uint8Array, length?: number): CompressedBatchEntry;
+    fromJSON(object: any): CompressedBatchEntry;
+    toJSON(message: CompressedBatchEntry): JsonSafe<CompressedBatchEntry>;
+    fromPartial(object: Partial<CompressedBatchEntry>): CompressedBatchEntry;
+    fromProtoMsg(message: CompressedBatchEntryProtoMsg): CompressedBatchEntry;
+    toProto(message: CompressedBatchEntry): Uint8Array;
+    toProtoMsg(message: CompressedBatchEntry): CompressedBatchEntryProtoMsg;
+};
+export declare const CompressedExistenceProof: {
+    typeUrl: "/cosmos.ics23.v1.CompressedExistenceProof";
+    encode(message: CompressedExistenceProof, writer?: BinaryWriter): BinaryWriter;
+    decode(input: BinaryReader | Uint8Array, length?: number): CompressedExistenceProof;
+    fromJSON(object: any): CompressedExistenceProof;
+    toJSON(message: CompressedExistenceProof): JsonSafe<CompressedExistenceProof>;
+    fromPartial(object: Partial<CompressedExistenceProof>): CompressedExistenceProof;
+    fromProtoMsg(message: CompressedExistenceProofProtoMsg): CompressedExistenceProof;
+    toProto(message: CompressedExistenceProof): Uint8Array;
+    toProtoMsg(message: CompressedExistenceProof): CompressedExistenceProofProtoMsg;
+};
+export declare const CompressedNonExistenceProof: {
+    typeUrl: "/cosmos.ics23.v1.CompressedNonExistenceProof";
+    encode(message: CompressedNonExistenceProof, writer?: BinaryWriter): BinaryWriter;
+    decode(input: BinaryReader | Uint8Array, length?: number): CompressedNonExistenceProof;
+    fromJSON(object: any): CompressedNonExistenceProof;
+    toJSON(message: CompressedNonExistenceProof): JsonSafe<CompressedNonExistenceProof>;
+    fromPartial(object: Partial<CompressedNonExistenceProof>): CompressedNonExistenceProof;
+    fromProtoMsg(message: CompressedNonExistenceProofProtoMsg): CompressedNonExistenceProof;
+    toProto(message: CompressedNonExistenceProof): Uint8Array;
+    toProtoMsg(message: CompressedNonExistenceProof): CompressedNonExistenceProofProtoMsg;
+};
+//# sourceMappingURL=proofs.d.ts.map

package/dist/codegen/cosmos/ics23/v1/proofs.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"proofs.d.ts","sourceRoot":"","sources":["../../../../../src/codegen/cosmos/ics23/v1/proofs.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,YAAY,EAAE,YAAY,EAAE,MAAM,oBAAoB,CAAC;AAIhE,OAAO,EAAE,KAAK,QAAQ,EAAE,MAAM,uBAAuB,CAAC;AACtD,oBAAY,MAAM;IAChB,wGAAwG;IACxG,OAAO,IAAI;IACX,MAAM,IAAI;IACV,MAAM,IAAI;IACV,SAAS,IAAI;IACb,SAAS,IAAI;IACb,qCAAqC;IACrC,OAAO,IAAI;IACX,UAAU,IAAI;IACd,WAAW,IAAI;IACf,WAAW,IAAI;IACf,MAAM,IAAI;IACV,YAAY,KAAK;CAClB;AACD,eAAO,MAAM,aAAa,eAAS,CAAC;AACpC,wBAAgB,cAAc,CAAC,MAAM,EAAE,GAAG,GAAG,MAAM,CAqClD;AACD,wBAAgB,YAAY,CAAC,MAAM,EAAE,MAAM,GAAG,MAAM,CA0BnD;AACD;;;;;GAKG;AACH,oBAAY,QAAQ;IAClB,0DAA0D;IAC1D,SAAS,IAAI;IACb,uFAAuF;IACvF,SAAS,IAAI;IACb,4DAA4D;IAC5D,OAAO,IAAI;IACX,2FAA2F;IAC3F,WAAW,IAAI;IACf,oGAAoG;IACpG,cAAc,IAAI;IAClB,2FAA2F;IAC3F,WAAW,IAAI;IACf,oGAAoG;IACpG,cAAc,IAAI;IAClB,2HAA2H;IAC3H,gBAAgB,IAAI;IACpB,2HAA2H;IAC3H,gBAAgB,IAAI;IACpB,YAAY,KAAK;CAClB;AACD,eAAO,MAAM,eAAe,iBAAW,CAAC;AACxC,wBAAgB,gBAAgB,CAAC,MAAM,EAAE,GAAG,GAAG,QAAQ,CAkCtD;AACD,wBAAgB,cAAc,CAAC,MAAM,EAAE,QAAQ,GAAG,MAAM,CAwBvD;AACD;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,MAAM,WAAW,cAAc;IAC7B,GAAG,EAAE,UAAU,CAAC;IAChB,KAAK,EAAE,UAAU,CAAC;IAClB,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,IAAI,EAAE,OAAO,EAAE,CAAC;CACjB;AACD,MAAM,WAAW,sBAAsB;IACrC,OAAO,EAAE,iCAAiC,CAAC;IAC3C,KAAK,EAAE,UAAU,CAAC;CACnB;AACD;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,MAAM,WAAW,qBAAqB;IACpC,GAAG,EAAE,UAAU,CAAC;IAChB,KAAK,EAAE,UAAU,CAAC;IAClB,IAAI,CAAC,EAAE,aAAa,CAAC;IACrB,IAAI,EAAE,cAAc,EAAE,CAAC;CACxB;AACD;;;;GAIG;AACH,MAAM,WAAW,iBAAiB;IAChC,2DAA2D;IAC3D,GAAG,EAAE,UAAU,CAAC;IAChB,IAAI,CAAC,EAAE,cAAc,CAAC;IACtB,KAAK,CAAC,EAAE,cAAc,CAAC;CACxB;AACD,MAAM,WAAW,yBAAyB;IACxC,OAAO,EAAE,oCAAoC,CAAC;IAC9C,KAAK,EAAE,UAAU,CAAC;CACnB;AACD;;;;GAIG;AACH,MAAM,WAAW,wBAAwB;IACvC,GAAG,EAAE,UAAU,CAAC;IAChB,IAAI,CAAC,EAAE,qBAAqB,CAAC;IAC7B,KAAK,CAAC,EAAE,qBAAqB,CAAC;CAC/B;AACD,sGAAsG;AACtG,MAAM,WAAW,eAAe;IAC9B,KAAK,CAAC,EAAE,cAAc,CAAC;IACvB,QAAQ,CAAC,EAAE,iBAAiB,CAAC;IAC7B,KAAK,CAAC,EAAE,UAAU,CAAC;IACnB,UAAU,CAAC,EAAE,oBAAoB,CAAC;CACnC;AACD,MAAM,WAAW,uBAAuB;IACtC,OAAO,EAAE,kCAAkC,CAAC;IAC5C,KAAK,EAAE,UAAU,CAAC;CACnB;AACD,sGAAsG;AACtG,MAAM,WAAW,sBAAsB;IACrC,KAAK,CAAC,EAAE,qBAAqB,CAAC;IAC9B,QAAQ,CAAC,EAAE,wBAAwB,CAAC;IACpC,KAAK,CAAC,EAAE,iBAAiB,CAAC;IAC1B,UAAU,CAAC,EAAE,2BAA2B,CAAC;CAC1C;AACD;;;;;;;;;;;;;;;GAeG;AACH,MAAM,WAAW,MAAM;IACrB,IAAI,EAAE,MAAM,CAAC;IACb,UAAU,EAAE,MAAM,CAAC;IACnB,YAAY,EAAE,MAAM,CAAC;IACrB,MAAM,EAAE,QAAQ,CAAC;IACjB;;;OAGG;IACH,MAAM,EAAE,UAAU,CAAC;CACpB;AACD,MAAM,WAAW,cAAc;IAC7B,OAAO,EAAE,yBAAyB,CAAC;IACnC,KAAK,EAAE,UAAU,CAAC;CACnB;AACD;;;;;;;;;;;;;;;GAeG;AACH,MAAM,WAAW,aAAa;IAC5B,IAAI,EAAE,MAAM,CAAC;IACb,WAAW,EAAE,MAAM,CAAC;IACpB,aAAa,EAAE,MAAM,CAAC;IACtB,MAAM,EAAE,QAAQ,CAAC;IACjB,MAAM,EAAE,UAAU,CAAC;CACpB;AACD;;;;;;;;;;;;;;;;GAgBG;AACH,MAAM,WAAW,OAAO;IACtB,IAAI,EAAE,MAAM,CAAC;IACb,MAAM,EAAE,UAAU,CAAC;IACnB,MAAM,EAAE,UAAU,CAAC;CACpB;AACD,MAAM,WAAW,eAAe;IAC9B,OAAO,EAAE,0BAA0B,CAAC;IACpC,KAAK,EAAE,UAAU,CAAC;CACnB;AACD;;;;;;;;;;;;;;;;GAgBG;AACH,MAAM,WAAW,cAAc;IAC7B,IAAI,EAAE,MAAM,CAAC;IACb,MAAM,EAAE,UAAU,CAAC;IACnB,MAAM,EAAE,UAAU,CAAC;CACpB;AACD;;;;;;;;;;;GAWG;AACH,MAAM,WAAW,SAAS;IACxB;;;OAGG;IACH,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,SAAS,CAAC,EAAE,SAAS,CAAC;IACtB;;;OAGG;IACH,QAAQ,EAAE,MAAM,CAAC;IACjB,kGAAkG;IAClG,QAAQ,EAAE,MAAM,CAAC;IACjB;;;;OAIG;IACH,0BAA0B,EAAE,OAAO,CAAC;CACrC;AACD,MAAM,WAAW,iBAAiB;IAChC,OAAO,EAAE,4BAA4B,CAAC;IACtC,KAAK,EAAE,UAAU,CAAC;CACnB;AACD;;;;;;;;;;;GAWG;AACH,MAAM,WAAW,gBAAgB;IAC/B,SAAS,CAAC,EAAE,aAAa,CAAC;IAC1B,UAAU,CAAC,EAAE,gBAAgB,CAAC;IAC9B,SAAS,EAAE,MAAM,CAAC;IAClB,SAAS,EAAE,MAAM,CAAC;IAClB,6BAA6B,EAAE,OAAO,CAAC;CACxC;AACD;;;;;;;;;GASG;AACH,MAAM,WAAW,SAAS;IACxB;;;;OAIG;IACH,UAAU,EAAE,MAAM,EAAE,CAAC;IACrB,SAAS,EAAE,MAAM,CAAC;IAClB,eAAe,EAAE,MAAM,CAAC;IACxB,qFAAqF;IACrF,eAAe,EAAE,MAAM,CAAC;IACxB,8FAA8F;IAC9F,UAAU,EAAE,UAAU,CAAC;IACvB,+DAA+D;IAC/D,IAAI,EAAE,MAAM,CAAC;CACd;AACD,MAAM,WAAW,iBAAiB;IAChC,OAAO,EAAE,4BAA4B,CAAC;IACtC,KAAK,EAAE,UAAU,CAAC;CACnB;AACD;;;;;;;;;GASG;AACH,MAAM,WAAW,gBAAgB;IAC/B,WAAW,EAAE,MAAM,EAAE,CAAC;IACtB,UAAU,EAAE,MAAM,CAAC;IACnB,iBAAiB,EAAE,MAAM,CAAC;IAC1B,iBAAiB,EAAE,MAAM,CAAC;IAC1B,WAAW,EAAE,UAAU,CAAC;IACxB,IAAI,EAAE,MAAM,CAAC;CACd;AACD,2EAA2E;AAC3E,MAAM,WAAW,UAAU;IACzB,OAAO,EAAE,UAAU,EAAE,CAAC;CACvB;AACD,MAAM,WAAW,kBAAkB;IACjC,OAAO,EAAE,6BAA6B,CAAC;IACvC,KAAK,EAAE,UAAU,CAAC;CACnB;AACD,2EAA2E;AAC3E,MAAM,WAAW,iBAAiB;IAChC,OAAO,EAAE,iBAAiB,EAAE,CAAC;CAC9B;AACD,6DAA6D;AAC7D,MAAM,WAAW,UAAU;IACzB,KAAK,CAAC,EAAE,cAAc,CAAC;IACvB,QAAQ,CAAC,EAAE,iBAAiB,CAAC;CAC9B;AACD,MAAM,WAAW,kBAAkB;IACjC,OAAO,EAAE,6BAA6B,CAAC;IACvC,KAAK,EAAE,UAAU,CAAC;CACnB;AACD,6DAA6D;AAC7D,MAAM,WAAW,iBAAiB;IAChC,KAAK,CAAC,EAAE,qBAAqB,CAAC;IAC9B,QAAQ,CAAC,EAAE,wBAAwB,CAAC;CACrC;AACD,MAAM,WAAW,oBAAoB;IACnC,OAAO,EAAE,oBAAoB,EAAE,CAAC;IAChC,YAAY,EAAE,OAAO,EAAE,CAAC;CACzB;AACD,MAAM,WAAW,4BAA4B;IAC3C,OAAO,EAAE,uCAAuC,CAAC;IACjD,KAAK,EAAE,UAAU,CAAC;CACnB;AACD,MAAM,WAAW,2BAA2B;IAC1C,OAAO,EAAE,2BAA2B,EAAE,CAAC;IACvC,aAAa,EAAE,cAAc,EAAE,CAAC;CACjC;AACD,6DAA6D;AAC7D,MAAM,WAAW,oBAAoB;IACnC,KAAK,CAAC,EAAE,wBAAwB,CAAC;IACjC,QAAQ,CAAC,EAAE,2BAA2B,CAAC;CACxC;AACD,MAAM,WAAW,4BAA4B;IAC3C,OAAO,EAAE,uCAAuC,CAAC;IACjD,KAAK,EAAE,UAAU,CAAC;CACnB;AACD,6DAA6D;AAC7D,MAAM,WAAW,2BAA2B;IAC1C,KAAK,CAAC,EAAE,+BAA+B,CAAC;IACxC,QAAQ,CAAC,EAAE,kCAAkC,CAAC;CAC/C;AACD,MAAM,WAAW,wBAAwB;IACvC,GAAG,EAAE,UAAU,CAAC;IAChB,KAAK,EAAE,UAAU,CAAC;IAClB,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,6EAA6E;IAC7E,IAAI,EAAE,MAAM,EAAE,CAAC;CAChB;AACD,MAAM,WAAW,gCAAgC;IAC/C,OAAO,EAAE,2CAA2C,CAAC;IACrD,KAAK,EAAE,UAAU,CAAC;CACnB;AACD,MAAM,WAAW,+BAA+B;IAC9C,GAAG,EAAE,UAAU,CAAC;IAChB,KAAK,EAAE,UAAU,CAAC;IAClB,IAAI,CAAC,EAAE,aAAa,CAAC;IACrB,IAAI,EAAE,MAAM,EAAE,CAAC;CAChB;AACD,MAAM,WAAW,2BAA2B;IAC1C,2DAA2D;IAC3D,GAAG,EAAE,UAAU,CAAC;IAChB,IAAI,CAAC,EAAE,wBAAwB,CAAC;IAChC,KAAK,CAAC,EAAE,wBAAwB,CAAC;CAClC;AACD,MAAM,WAAW,mCAAmC;IAClD,OAAO,EAAE,8CAA8C,CAAC;IACxD,KAAK,EAAE,UAAU,CAAC;CACnB;AACD,MAAM,WAAW,kCAAkC;IACjD,GAAG,EAAE,UAAU,CAAC;IAChB,IAAI,CAAC,EAAE,+BAA+B,CAAC;IACvC,KAAK,CAAC,EAAE,+BAA+B,CAAC;CACzC;AASD,eAAO,MAAM,cAAc;;oBAGd,cAAc,WACf,YAAY,GACnB,YAAY;kBAeD,YAAY,GAAG,UAAU,WAAW,MAAM,GAAG,cAAc;qBA2BxD,GAAG,GAAG,cAAc;oBAYrB,cAAc,GAAG,QAAQ,CAAC,cAAc,CAAC;wBAmBrC,OAAO,CAAC,cAAc,CAAC,GAAG,cAAc;0BAWtC,sBAAsB,GAAG,cAAc;qBAG5C,cAAc,GAAG,UAAU;wBAGxB,cAAc,GAAG,sBAAsB;CAM5D,CAAC;AAQF,eAAO,MAAM,iBAAiB;;oBAGjB,iBAAiB,WAClB,YAAY,GACnB,YAAY;kBAYD,YAAY,GAAG,UAAU,WAAW,MAAM,GAAG,iBAAiB;qBAwB3D,GAAG,GAAG,iBAAiB;oBAWxB,iBAAiB,GAAG,QAAQ,CAAC,iBAAiB,CAAC;wBAgB3C,OAAO,CAAC,iBAAiB,CAAC,GAAG,iBAAiB;0BAa5C,yBAAyB,GAAG,iBAAiB;qBAGlD,iBAAiB,GAAG,UAAU;wBAG3B,iBAAiB,GAAG,yBAAyB;CAMlE,CAAC;AASF,eAAO,MAAM,eAAe;;oBAGf,eAAe,WAChB,YAAY,GACnB,YAAY;kBAqBD,YAAY,GAAG,UAAU,WAAW,MAAM,GAAG,eAAe;qBA8BzD,GAAG,GAAG,eAAe;oBAgBtB,eAAe,GAAG,QAAQ,CAAC,eAAe,CAAC;wBAoBvC,OAAO,CAAC,eAAe,CAAC,GAAG,eAAe;0BAoBxC,uBAAuB,GAAG,eAAe;qBAG9C,eAAe,GAAG,UAAU;wBAGzB,eAAe,GAAG,uBAAuB;CAM9D,CAAC;AAUF,eAAO,MAAM,MAAM;;oBAGN,MAAM,WACP,YAAY,GACnB,YAAY;kBAkBD,YAAY,GAAG,UAAU,WAAW,MAAM,GAAG,MAAM;qBA8BhD,GAAG,GAAG,MAAM;oBAeb,MAAM,GAAG,QAAQ,CAAC,MAAM,CAAC;wBAerB,OAAO,CAAC,MAAM,CAAC,GAAG,MAAM;0BAStB,cAAc,GAAG,MAAM;qBAG5B,MAAM,GAAG,UAAU;wBAGhB,MAAM,GAAG,cAAc;CAM5C,CAAC;AAQF,eAAO,MAAM,OAAO;;oBAGP,OAAO,WACR,YAAY,GACnB,YAAY;kBAYD,YAAY,GAAG,UAAU,WAAW,MAAM,GAAG,OAAO;qBAwBjD,GAAG,GAAG,OAAO;oBAWd,OAAO,GAAG,QAAQ,CAAC,OAAO,CAAC;wBAavB,OAAO,CAAC,OAAO,CAAC,GAAG,OAAO;0BAOxB,eAAe,GAAG,OAAO;qBAG9B,OAAO,GAAG,UAAU;wBAGjB,OAAO,GAAG,eAAe;CAM9C,CAAC;AAUF,eAAO,MAAM,SAAS;;oBAGT,SAAS,WACV,YAAY,GACnB,YAAY;kBAkBD,YAAY,GAAG,UAAU,WAAW,MAAM,GAAG,SAAS;qBA8BnD,GAAG,GAAG,SAAS;oBAehB,SAAS,GAAG,QAAQ,CAAC,SAAS,CAAC;wBAkB3B,OAAO,CAAC,SAAS,CAAC,GAAG,SAAS;0BAgB5B,iBAAiB,GAAG,SAAS;qBAGlC,SAAS,GAAG,UAAU;wBAGnB,SAAS,GAAG,iBAAiB;CAMlD,CAAC;AAWF,eAAO,MAAM,SAAS;;oBAGT,SAAS,WACV,YAAY,GACnB,YAAY;kBAuBD,YAAY,GAAG,UAAU,WAAW,MAAM,GAAG,SAAS;qBAwCnD,GAAG,GAAG,SAAS;oBAkBhB,SAAS,GAAG,QAAQ,CAAC,SAAS,CAAC;wBAsB3B,OAAO,CAAC,SAAS,CAAC,GAAG,SAAS;0BAU5B,iBAAiB,GAAG,SAAS;qBAGlC,SAAS,GAAG,UAAU;wBAGnB,SAAS,GAAG,iBAAiB;CAMlD,CAAC;AAMF,eAAO,MAAM,UAAU;;oBAGV,UAAU,WACX,YAAY,GACnB,YAAY;kBAMD,YAAY,GAAG,UAAU,WAAW,MAAM,GAAG,UAAU;qBAkBpD,GAAG,GAAG,UAAU;oBAOjB,UAAU,GAAG,QAAQ,CAAC,UAAU,CAAC;wBAW7B,OAAO,CAAC,UAAU,CAAC,GAAG,UAAU;0BAK9B,kBAAkB,GAAG,UAAU;qBAGpC,UAAU,GAAG,UAAU;wBAGpB,UAAU,GAAG,kBAAkB;CAMpD,CAAC;AAOF,eAAO,MAAM,UAAU;;oBAGV,UAAU,WACX,YAAY,GACnB,YAAY;kBAYD,YAAY,GAAG,UAAU,WAAW,MAAM,GAAG,UAAU;qBAqBpD,GAAG,GAAG,UAAU;oBAUjB,UAAU,GAAG,QAAQ,CAAC,UAAU,CAAC;wBAY7B,OAAO,CAAC,UAAU,CAAC,GAAG,UAAU;0BAY9B,kBAAkB,GAAG,UAAU;qBAGpC,UAAU,GAAG,UAAU;wBAGpB,UAAU,GAAG,kBAAkB;CAMpD,CAAC;AAOF,eAAO,MAAM,oBAAoB;;oBAGpB,oBAAoB,WACrB,YAAY,GACnB,YAAY;kBAUN,YAAY,GAAG,UAAU,WACvB,MAAM,GACd,oBAAoB;qBAuBN,GAAG,GAAG,oBAAoB;oBAU3B,oBAAoB,GAAG,QAAQ,CAAC,oBAAoB,CAAC;wBAkBjD,OAAO,CAAC,oBAAoB,CAAC,GAAG,oBAAoB;0BAQlD,4BAA4B,GAAG,oBAAoB;qBAGxD,oBAAoB,GAAG,UAAU;wBAG9B,oBAAoB,GAAG,4BAA4B;CAMxE,CAAC;AAOF,eAAO,MAAM,oBAAoB;;oBAGpB,oBAAoB,WACrB,YAAY,GACnB,YAAY;kBAgBN,YAAY,GAAG,UAAU,WACvB,MAAM,GACd,oBAAoB;qBA2BN,GAAG,GAAG,oBAAoB;oBAU3B,oBAAoB,GAAG,QAAQ,CAAC,oBAAoB,CAAC;wBAYjD,OAAO,CAAC,oBAAoB,CAAC,GAAG,oBAAoB;0BAYlD,4BAA4B,GAAG,oBAAoB;qBAGxD,oBAAoB,GAAG,UAAU;wBAG9B,oBAAoB,GAAG,4BAA4B;CAMxE,CAAC;AASF,eAAO,MAAM,wBAAwB;;oBAGxB,wBAAwB,WACzB,YAAY,GACnB,YAAY;kBAkBN,YAAY,GAAG,UAAU,WACvB,MAAM,GACd,wBAAwB;qBAkCV,GAAG,GAAG,wBAAwB;oBAapC,wBAAwB,GAChC,QAAQ,CAAC,wBAAwB,CAAC;wBAoB3B,OAAO,CAAC,wBAAwB,CAAC,GACxC,wBAAwB;0BAYhB,gCAAgC,GACxC,wBAAwB;qBAGV,wBAAwB,GAAG,UAAU;wBAI3C,wBAAwB,GAChC,gCAAgC;CAMpC,CAAC;AAQF,eAAO,MAAM,2BAA2B;;oBAG3B,2BAA2B,WAC5B,YAAY,GACnB,YAAY;kBAmBN,YAAY,GAAG,UAAU,WACvB,MAAM,GACd,2BAA2B;qBA8Bb,GAAG,GAAG,2BAA2B;oBAYvC,2BAA2B,GACnC,QAAQ,CAAC,2BAA2B,CAAC;wBAiB9B,OAAO,CAAC,2BAA2B,CAAC,GAC3C,2BAA2B;0BAcnB,mCAAmC,GAC3C,2BAA2B;qBAGb,2BAA2B,GAAG,UAAU;wBAI9C,2BAA2B,GACnC,mCAAmC;CAMvC,CAAC"}

package/dist/codegen/cosmos/ics23/v1/proofs.js

@@ -0,0 +1 @@
+import{BinaryReader as e,BinaryWriter as o}from"../../../binary.js";import{isSet as t}from"../../../helpers.js";import{decodeBase64 as r}from"@endo/base64";import{encodeBase64 as n}from"@endo/base64";import{}from"../../../json-safe.js";export var HashOp;!function(e){e[e.NO_HASH=0]="NO_HASH",e[e.SHA256=1]="SHA256",e[e.SHA512=2]="SHA512",e[e.KECCAK256=3]="KECCAK256",e[e.RIPEMD160=4]="RIPEMD160",e[e.BITCOIN=5]="BITCOIN",e[e.SHA512_256=6]="SHA512_256",e[e.BLAKE2B_512=7]="BLAKE2B_512",e[e.BLAKE2S_256=8]="BLAKE2S_256",e[e.BLAKE3=9]="BLAKE3",e[e.UNRECOGNIZED=-1]="UNRECOGNIZED"}(HashOp||(HashOp={}));export const HashOpSDKType=HashOp;export function hashOpFromJSON(e){switch(e){case 0:case"NO_HASH":return HashOp.NO_HASH;case 1:case"SHA256":return HashOp.SHA256;case 2:case"SHA512":return HashOp.SHA512;case 3:case"KECCAK256":return HashOp.KECCAK256;case 4:case"RIPEMD160":return HashOp.RIPEMD160;case 5:case"BITCOIN":return HashOp.BITCOIN;case 6:case"SHA512_256":return HashOp.SHA512_256;case 7:case"BLAKE2B_512":return HashOp.BLAKE2B_512;case 8:case"BLAKE2S_256":return HashOp.BLAKE2S_256;case 9:case"BLAKE3":return HashOp.BLAKE3;default:return HashOp.UNRECOGNIZED}}export function hashOpToJSON(e){switch(e){case HashOp.NO_HASH:return"NO_HASH";case HashOp.SHA256:return"SHA256";case HashOp.SHA512:return"SHA512";case HashOp.KECCAK256:return"KECCAK256";case HashOp.RIPEMD160:return"RIPEMD160";case HashOp.BITCOIN:return"BITCOIN";case HashOp.SHA512_256:return"SHA512_256";case HashOp.BLAKE2B_512:return"BLAKE2B_512";case HashOp.BLAKE2S_256:return"BLAKE2S_256";case HashOp.BLAKE3:return"BLAKE3";case HashOp.UNRECOGNIZED:default:return"UNRECOGNIZED"}}export var LengthOp;!function(e){e[e.NO_PREFIX=0]="NO_PREFIX",e[e.VAR_PROTO=1]="VAR_PROTO",e[e.VAR_RLP=2]="VAR_RLP",e[e.FIXED32_BIG=3]="FIXED32_BIG",e[e.FIXED32_LITTLE=4]="FIXED32_LITTLE",e[e.FIXED64_BIG=5]="FIXED64_BIG",e[e.FIXED64_LITTLE=6]="FIXED64_LITTLE",e[e.REQUIRE_32_BYTES=7]="REQUIRE_32_BYTES",e[e.REQUIRE_64_BYTES=8]="REQUIRE_64_BYTES",e[e.UNRECOGNIZED=-1]="UNRECOGNIZED"}(LengthOp||(LengthOp={}));export const LengthOpSDKType=LengthOp;export function lengthOpFromJSON(e){switch(e){case 0:case"NO_PREFIX":return LengthOp.NO_PREFIX;case 1:case"VAR_PROTO":return LengthOp.VAR_PROTO;case 2:case"VAR_RLP":return LengthOp.VAR_RLP;case 3:case"FIXED32_BIG":return LengthOp.FIXED32_BIG;case 4:case"FIXED32_LITTLE":return LengthOp.FIXED32_LITTLE;case 5:case"FIXED64_BIG":return LengthOp.FIXED64_BIG;case 6:case"FIXED64_LITTLE":return LengthOp.FIXED64_LITTLE;case 7:case"REQUIRE_32_BYTES":return LengthOp.REQUIRE_32_BYTES;case 8:case"REQUIRE_64_BYTES":return LengthOp.REQUIRE_64_BYTES;default:return LengthOp.UNRECOGNIZED}}export function lengthOpToJSON(e){switch(e){case LengthOp.NO_PREFIX:return"NO_PREFIX";case LengthOp.VAR_PROTO:return"VAR_PROTO";case LengthOp.VAR_RLP:return"VAR_RLP";case LengthOp.FIXED32_BIG:return"FIXED32_BIG";case LengthOp.FIXED32_LITTLE:return"FIXED32_LITTLE";case LengthOp.FIXED64_BIG:return"FIXED64_BIG";case LengthOp.FIXED64_LITTLE:return"FIXED64_LITTLE";case LengthOp.REQUIRE_32_BYTES:return"REQUIRE_32_BYTES";case LengthOp.REQUIRE_64_BYTES:return"REQUIRE_64_BYTES";case LengthOp.UNRECOGNIZED:default:return"UNRECOGNIZED"}}function s(){return{key:new Uint8Array,value:new Uint8Array,leaf:void 0,path:[]}}export const ExistenceProof={typeUrl:"/cosmos.ics23.v1.ExistenceProof",encode(e,t=o.create()){0!==e.key.length&&t.uint32(10).bytes(e.key),0!==e.value.length&&t.uint32(18).bytes(e.value),void 0!==e.leaf&&LeafOp.encode(e.leaf,t.uint32(26).fork()).ldelim();for(const o of e.path)InnerOp.encode(o,t.uint32(34).fork()).ldelim();return t},decode(o,t){const r=o instanceof e?o:new e(o);let n=void 0===t?r.len:r.pos+t;const i=s();for(;r.pos<n;){const e=r.uint32();switch(e>>>3){case 1:i.key=r.bytes();break;case 2:i.value=r.bytes();break;case 3:i.leaf=LeafOp.decode(r,r.uint32());break;case 4:i.path.push(InnerOp.decode(r,r.uint32()));break;default:r.skipType(7&e)}}return i},fromJSON:e=>({key:t(e.key)?r(e.key):new Uint8Array,value:t(e.value)?r(e.value):new Uint8Array,leaf:t(e.leaf)?LeafOp.fromJSON(e.leaf):void 0,path:Array.isArray(e?.path)?e.path.map((e=>InnerOp.fromJSON(e))):[]}),toJSON(e){const o={};return void 0!==e.key&&(o.key=n(void 0!==e.key?e.key:new Uint8Array)),void 0!==e.value&&(o.value=n(void 0!==e.value?e.value:new Uint8Array)),void 0!==e.leaf&&(o.leaf=e.leaf?LeafOp.toJSON(e.leaf):void 0),e.path?o.path=e.path.map((e=>e?InnerOp.toJSON(e):void 0)):o.path=[],o},fromPartial(e){const o=s();return o.key=e.key??new Uint8Array,o.value=e.value??new Uint8Array,o.leaf=void 0!==e.leaf&&null!==e.leaf?LeafOp.fromPartial(e.leaf):void 0,o.path=e.path?.map((e=>InnerOp.fromPartial(e)))||[],o},fromProtoMsg:e=>ExistenceProof.decode(e.value),toProto:e=>ExistenceProof.encode(e).finish(),toProtoMsg:e=>({typeUrl:"/cosmos.ics23.v1.ExistenceProof",value:ExistenceProof.encode(e).finish()})};function i(){return{key:new Uint8Array,left:void 0,right:void 0}}export const NonExistenceProof={typeUrl:"/cosmos.ics23.v1.NonExistenceProof",encode:(e,t=o.create())=>(0!==e.key.length&&t.uint32(10).bytes(e.key),void 0!==e.left&&ExistenceProof.encode(e.left,t.uint32(18).fork()).ldelim(),void 0!==e.right&&ExistenceProof.encode(e.right,t.uint32(26).fork()).ldelim(),t),decode(o,t){const r=o instanceof e?o:new e(o);let n=void 0===t?r.len:r.pos+t;const s=i();for(;r.pos<n;){const e=r.uint32();switch(e>>>3){case 1:s.key=r.bytes();break;case 2:s.left=ExistenceProof.decode(r,r.uint32());break;case 3:s.right=ExistenceProof.decode(r,r.uint32());break;default:r.skipType(7&e)}}return s},fromJSON:e=>({key:t(e.key)?r(e.key):new Uint8Array,left:t(e.left)?ExistenceProof.fromJSON(e.left):void 0,right:t(e.right)?ExistenceProof.fromJSON(e.right):void 0}),toJSON(e){const o={};return void 0!==e.key&&(o.key=n(void 0!==e.key?e.key:new Uint8Array)),void 0!==e.left&&(o.left=e.left?ExistenceProof.toJSON(e.left):void 0),void 0!==e.right&&(o.right=e.right?ExistenceProof.toJSON(e.right):void 0),o},fromPartial(e){const o=i();return o.key=e.key??new Uint8Array,o.left=void 0!==e.left&&null!==e.left?ExistenceProof.fromPartial(e.left):void 0,o.right=void 0!==e.right&&null!==e.right?ExistenceProof.fromPartial(e.right):void 0,o},fromProtoMsg:e=>NonExistenceProof.decode(e.value),toProto:e=>NonExistenceProof.encode(e).finish(),toProtoMsg:e=>({typeUrl:"/cosmos.ics23.v1.NonExistenceProof",value:NonExistenceProof.encode(e).finish()})};export const CommitmentProof={typeUrl:"/cosmos.ics23.v1.CommitmentProof",encode:(e,t=o.create())=>(void 0!==e.exist&&ExistenceProof.encode(e.exist,t.uint32(10).fork()).ldelim(),void 0!==e.nonexist&&NonExistenceProof.encode(e.nonexist,t.uint32(18).fork()).ldelim(),void 0!==e.batch&&BatchProof.encode(e.batch,t.uint32(26).fork()).ldelim(),void 0!==e.compressed&&CompressedBatchProof.encode(e.compressed,t.uint32(34).fork()).ldelim(),t),decode(o,t){const r=o instanceof e?o:new e(o);let n=void 0===t?r.len:r.pos+t;const s={exist:void 0,nonexist:void 0,batch:void 0,compressed:void 0};for(;r.pos<n;){const e=r.uint32();switch(e>>>3){case 1:s.exist=ExistenceProof.decode(r,r.uint32());break;case 2:s.nonexist=NonExistenceProof.decode(r,r.uint32());break;case 3:s.batch=BatchProof.decode(r,r.uint32());break;case 4:s.compressed=CompressedBatchProof.decode(r,r.uint32());break;default:r.skipType(7&e)}}return s},fromJSON:e=>({exist:t(e.exist)?ExistenceProof.fromJSON(e.exist):void 0,nonexist:t(e.nonexist)?NonExistenceProof.fromJSON(e.nonexist):void 0,batch:t(e.batch)?BatchProof.fromJSON(e.batch):void 0,compressed:t(e.compressed)?CompressedBatchProof.fromJSON(e.compressed):void 0}),toJSON(e){const o={};return void 0!==e.exist&&(o.exist=e.exist?ExistenceProof.toJSON(e.exist):void 0),void 0!==e.nonexist&&(o.nonexist=e.nonexist?NonExistenceProof.toJSON(e.nonexist):void 0),void 0!==e.batch&&(o.batch=e.batch?BatchProof.toJSON(e.batch):void 0),void 0!==e.compressed&&(o.compressed=e.compressed?CompressedBatchProof.toJSON(e.compressed):void 0),o},fromPartial(e){const o={exist:void 0,nonexist:void 0,batch:void 0,compressed:void 0};return o.exist=void 0!==e.exist&&null!==e.exist?ExistenceProof.fromPartial(e.exist):void 0,o.nonexist=void 0!==e.nonexist&&null!==e.nonexist?NonExistenceProof.fromPartial(e.nonexist):void 0,o.batch=void 0!==e.batch&&null!==e.batch?BatchProof.fromPartial(e.batch):void 0,o.compressed=void 0!==e.compressed&&null!==e.compressed?CompressedBatchProof.fromPartial(e.compressed):void 0,o},fromProtoMsg:e=>CommitmentProof.decode(e.value),toProto:e=>CommitmentProof.encode(e).finish(),toProtoMsg:e=>({typeUrl:"/cosmos.ics23.v1.CommitmentProof",value:CommitmentProof.encode(e).finish()})};function a(){return{hash:0,prehashKey:0,prehashValue:0,length:0,prefix:new Uint8Array}}export const LeafOp={typeUrl:"/cosmos.ics23.v1.LeafOp",encode:(e,t=o.create())=>(0!==e.hash&&t.uint32(8).int32(e.hash),0!==e.prehashKey&&t.uint32(16).int32(e.prehashKey),0!==e.prehashValue&&t.uint32(24).int32(e.prehashValue),0!==e.length&&t.uint32(32).int32(e.length),0!==e.prefix.length&&t.uint32(42).bytes(e.prefix),t),decode(o,t){const r=o instanceof e?o:new e(o);let n=void 0===t?r.len:r.pos+t;const s=a();for(;r.pos<n;){const e=r.uint32();switch(e>>>3){case 1:s.hash=r.int32();break;case 2:s.prehashKey=r.int32();break;case 3:s.prehashValue=r.int32();break;case 4:s.length=r.int32();break;case 5:s.prefix=r.bytes();break;default:r.skipType(7&e)}}return s},fromJSON:e=>({hash:t(e.hash)?hashOpFromJSON(e.hash):-1,prehashKey:t(e.prehashKey)?hashOpFromJSON(e.prehashKey):-1,prehashValue:t(e.prehashValue)?hashOpFromJSON(e.prehashValue):-1,length:t(e.length)?lengthOpFromJSON(e.length):-1,prefix:t(e.prefix)?r(e.prefix):new Uint8Array}),toJSON(e){const o={};return void 0!==e.hash&&(o.hash=hashOpToJSON(e.hash)),void 0!==e.prehashKey&&(o.prehashKey=hashOpToJSON(e.prehashKey)),void 0!==e.prehashValue&&(o.prehashValue=hashOpToJSON(e.prehashValue)),void 0!==e.length&&(o.length=lengthOpToJSON(e.length)),void 0!==e.prefix&&(o.prefix=n(void 0!==e.prefix?e.prefix:new Uint8Array)),o},fromPartial(e){const o=a();return o.hash=e.hash??0,o.prehashKey=e.prehashKey??0,o.prehashValue=e.prehashValue??0,o.length=e.length??0,o.prefix=e.prefix??new Uint8Array,o},fromProtoMsg:e=>LeafOp.decode(e.value),toProto:e=>LeafOp.encode(e).finish(),toProtoMsg:e=>({typeUrl:"/cosmos.ics23.v1.LeafOp",value:LeafOp.encode(e).finish()})};function c(){return{hash:0,prefix:new Uint8Array,suffix:new Uint8Array}}export const InnerOp={typeUrl:"/cosmos.ics23.v1.InnerOp",encode:(e,t=o.create())=>(0!==e.hash&&t.uint32(8).int32(e.hash),0!==e.prefix.length&&t.uint32(18).bytes(e.prefix),0!==e.suffix.length&&t.uint32(26).bytes(e.suffix),t),decode(o,t){const r=o instanceof e?o:new e(o);let n=void 0===t?r.len:r.pos+t;const s=c();for(;r.pos<n;){const e=r.uint32();switch(e>>>3){case 1:s.hash=r.int32();break;case 2:s.prefix=r.bytes();break;case 3:s.suffix=r.bytes();break;default:r.skipType(7&e)}}return s},fromJSON:e=>({hash:t(e.hash)?hashOpFromJSON(e.hash):-1,prefix:t(e.prefix)?r(e.prefix):new Uint8Array,suffix:t(e.suffix)?r(e.suffix):new Uint8Array}),toJSON(e){const o={};return void 0!==e.hash&&(o.hash=hashOpToJSON(e.hash)),void 0!==e.prefix&&(o.prefix=n(void 0!==e.prefix?e.prefix:new Uint8Array)),void 0!==e.suffix&&(o.suffix=n(void 0!==e.suffix?e.suffix:new Uint8Array)),o},fromPartial(e){const o=c();return o.hash=e.hash??0,o.prefix=e.prefix??new Uint8Array,o.suffix=e.suffix??new Uint8Array,o},fromProtoMsg:e=>InnerOp.decode(e.value),toProto:e=>InnerOp.encode(e).finish(),toProtoMsg:e=>({typeUrl:"/cosmos.ics23.v1.InnerOp",value:InnerOp.encode(e).finish()})};export const ProofSpec={typeUrl:"/cosmos.ics23.v1.ProofSpec",encode:(e,t=o.create())=>(void 0!==e.leafSpec&&LeafOp.encode(e.leafSpec,t.uint32(10).fork()).ldelim(),void 0!==e.innerSpec&&InnerSpec.encode(e.innerSpec,t.uint32(18).fork()).ldelim(),0!==e.maxDepth&&t.uint32(24).int32(e.maxDepth),0!==e.minDepth&&t.uint32(32).int32(e.minDepth),!0===e.prehashKeyBeforeComparison&&t.uint32(40).bool(e.prehashKeyBeforeComparison),t),decode(o,t){const r=o instanceof e?o:new e(o);let n=void 0===t?r.len:r.pos+t;const s={leafSpec:void 0,innerSpec:void 0,maxDepth:0,minDepth:0,prehashKeyBeforeComparison:!1};for(;r.pos<n;){const e=r.uint32();switch(e>>>3){case 1:s.leafSpec=LeafOp.decode(r,r.uint32());break;case 2:s.innerSpec=InnerSpec.decode(r,r.uint32());break;case 3:s.maxDepth=r.int32();break;case 4:s.minDepth=r.int32();break;case 5:s.prehashKeyBeforeComparison=r.bool();break;default:r.skipType(7&e)}}return s},fromJSON:e=>({leafSpec:t(e.leafSpec)?LeafOp.fromJSON(e.leafSpec):void 0,innerSpec:t(e.innerSpec)?InnerSpec.fromJSON(e.innerSpec):void 0,maxDepth:t(e.maxDepth)?Number(e.maxDepth):0,minDepth:t(e.minDepth)?Number(e.minDepth):0,prehashKeyBeforeComparison:!!t(e.prehashKeyBeforeComparison)&&Boolean(e.prehashKeyBeforeComparison)}),toJSON(e){const o={};return void 0!==e.leafSpec&&(o.leafSpec=e.leafSpec?LeafOp.toJSON(e.leafSpec):void 0),void 0!==e.innerSpec&&(o.innerSpec=e.innerSpec?InnerSpec.toJSON(e.innerSpec):void 0),void 0!==e.maxDepth&&(o.maxDepth=Math.round(e.maxDepth)),void 0!==e.minDepth&&(o.minDepth=Math.round(e.minDepth)),void 0!==e.prehashKeyBeforeComparison&&(o.prehashKeyBeforeComparison=e.prehashKeyBeforeComparison),o},fromPartial(e){const o={leafSpec:void 0,innerSpec:void 0,maxDepth:0,minDepth:0,prehashKeyBeforeComparison:!1};return o.leafSpec=void 0!==e.leafSpec&&null!==e.leafSpec?LeafOp.fromPartial(e.leafSpec):void 0,o.innerSpec=void 0!==e.innerSpec&&null!==e.innerSpec?InnerSpec.fromPartial(e.innerSpec):void 0,o.maxDepth=e.maxDepth??0,o.minDepth=e.minDepth??0,o.prehashKeyBeforeComparison=e.prehashKeyBeforeComparison??!1,o},fromProtoMsg:e=>ProofSpec.decode(e.value),toProto:e=>ProofSpec.encode(e).finish(),toProtoMsg:e=>({typeUrl:"/cosmos.ics23.v1.ProofSpec",value:ProofSpec.encode(e).finish()})};function p(){return{childOrder:[],childSize:0,minPrefixLength:0,maxPrefixLength:0,emptyChild:new Uint8Array,hash:0}}export const InnerSpec={typeUrl:"/cosmos.ics23.v1.InnerSpec",encode(e,t=o.create()){t.uint32(10).fork();for(const o of e.childOrder)t.int32(o);return t.ldelim(),0!==e.childSize&&t.uint32(16).int32(e.childSize),0!==e.minPrefixLength&&t.uint32(24).int32(e.minPrefixLength),0!==e.maxPrefixLength&&t.uint32(32).int32(e.maxPrefixLength),0!==e.emptyChild.length&&t.uint32(42).bytes(e.emptyChild),0!==e.hash&&t.uint32(48).int32(e.hash),t},decode(o,t){const r=o instanceof e?o:new e(o);let n=void 0===t?r.len:r.pos+t;const s=p();for(;r.pos<n;){const e=r.uint32();switch(e>>>3){case 1:if(2==(7&e)){const e=r.uint32()+r.pos;for(;r.pos<e;)s.childOrder.push(r.int32())}else s.childOrder.push(r.int32());break;case 2:s.childSize=r.int32();break;case 3:s.minPrefixLength=r.int32();break;case 4:s.maxPrefixLength=r.int32();break;case 5:s.emptyChild=r.bytes();break;case 6:s.hash=r.int32();break;default:r.skipType(7&e)}}return s},fromJSON:e=>({childOrder:Array.isArray(e?.childOrder)?e.childOrder.map((e=>Number(e))):[],childSize:t(e.childSize)?Number(e.childSize):0,minPrefixLength:t(e.minPrefixLength)?Number(e.minPrefixLength):0,maxPrefixLength:t(e.maxPrefixLength)?Number(e.maxPrefixLength):0,emptyChild:t(e.emptyChild)?r(e.emptyChild):new Uint8Array,hash:t(e.hash)?hashOpFromJSON(e.hash):-1}),toJSON(e){const o={};return e.childOrder?o.childOrder=e.childOrder.map((e=>Math.round(e))):o.childOrder=[],void 0!==e.childSize&&(o.childSize=Math.round(e.childSize)),void 0!==e.minPrefixLength&&(o.minPrefixLength=Math.round(e.minPrefixLength)),void 0!==e.maxPrefixLength&&(o.maxPrefixLength=Math.round(e.maxPrefixLength)),void 0!==e.emptyChild&&(o.emptyChild=n(void 0!==e.emptyChild?e.emptyChild:new Uint8Array)),void 0!==e.hash&&(o.hash=hashOpToJSON(e.hash)),o},fromPartial(e){const o=p();return o.childOrder=e.childOrder?.map((e=>e))||[],o.childSize=e.childSize??0,o.minPrefixLength=e.minPrefixLength??0,o.maxPrefixLength=e.maxPrefixLength??0,o.emptyChild=e.emptyChild??new Uint8Array,o.hash=e.hash??0,o},fromProtoMsg:e=>InnerSpec.decode(e.value),toProto:e=>InnerSpec.encode(e).finish(),toProtoMsg:e=>({typeUrl:"/cosmos.ics23.v1.InnerSpec",value:InnerSpec.encode(e).finish()})};export const BatchProof={typeUrl:"/cosmos.ics23.v1.BatchProof",encode(e,t=o.create()){for(const o of e.entries)BatchEntry.encode(o,t.uint32(10).fork()).ldelim();return t},decode(o,t){const r=o instanceof e?o:new e(o);let n=void 0===t?r.len:r.pos+t;const s={entries:[]};for(;r.pos<n;){const e=r.uint32();if(e>>>3==1)s.entries.push(BatchEntry.decode(r,r.uint32()));else r.skipType(7&e)}return s},fromJSON:e=>({entries:Array.isArray(e?.entries)?e.entries.map((e=>BatchEntry.fromJSON(e))):[]}),toJSON(e){const o={};return e.entries?o.entries=e.entries.map((e=>e?BatchEntry.toJSON(e):void 0)):o.entries=[],o},fromPartial(e){const o={entries:[]};return o.entries=e.entries?.map((e=>BatchEntry.fromPartial(e)))||[],o},fromProtoMsg:e=>BatchProof.decode(e.value),toProto:e=>BatchProof.encode(e).finish(),toProtoMsg:e=>({typeUrl:"/cosmos.ics23.v1.BatchProof",value:BatchProof.encode(e).finish()})};export const BatchEntry={typeUrl:"/cosmos.ics23.v1.BatchEntry",encode:(e,t=o.create())=>(void 0!==e.exist&&ExistenceProof.encode(e.exist,t.uint32(10).fork()).ldelim(),void 0!==e.nonexist&&NonExistenceProof.encode(e.nonexist,t.uint32(18).fork()).ldelim(),t),decode(o,t){const r=o instanceof e?o:new e(o);let n=void 0===t?r.len:r.pos+t;const s={exist:void 0,nonexist:void 0};for(;r.pos<n;){const e=r.uint32();switch(e>>>3){case 1:s.exist=ExistenceProof.decode(r,r.uint32());break;case 2:s.nonexist=NonExistenceProof.decode(r,r.uint32());break;default:r.skipType(7&e)}}return s},fromJSON:e=>({exist:t(e.exist)?ExistenceProof.fromJSON(e.exist):void 0,nonexist:t(e.nonexist)?NonExistenceProof.fromJSON(e.nonexist):void 0}),toJSON(e){const o={};return void 0!==e.exist&&(o.exist=e.exist?ExistenceProof.toJSON(e.exist):void 0),void 0!==e.nonexist&&(o.nonexist=e.nonexist?NonExistenceProof.toJSON(e.nonexist):void 0),o},fromPartial(e){const o={exist:void 0,nonexist:void 0};return o.exist=void 0!==e.exist&&null!==e.exist?ExistenceProof.fromPartial(e.exist):void 0,o.nonexist=void 0!==e.nonexist&&null!==e.nonexist?NonExistenceProof.fromPartial(e.nonexist):void 0,o},fromProtoMsg:e=>BatchEntry.decode(e.value),toProto:e=>BatchEntry.encode(e).finish(),toProtoMsg:e=>({typeUrl:"/cosmos.ics23.v1.BatchEntry",value:BatchEntry.encode(e).finish()})};export const CompressedBatchProof={typeUrl:"/cosmos.ics23.v1.CompressedBatchProof",encode(e,t=o.create()){for(const o of e.entries)CompressedBatchEntry.encode(o,t.uint32(10).fork()).ldelim();for(const o of e.lookupInners)InnerOp.encode(o,t.uint32(18).fork()).ldelim();return t},decode(o,t){const r=o instanceof e?o:new e(o);let n=void 0===t?r.len:r.pos+t;const s={entries:[],lookupInners:[]};for(;r.pos<n;){const e=r.uint32();switch(e>>>3){case 1:s.entries.push(CompressedBatchEntry.decode(r,r.uint32()));break;case 2:s.lookupInners.push(InnerOp.decode(r,r.uint32()));break;default:r.skipType(7&e)}}return s},fromJSON:e=>({entries:Array.isArray(e?.entries)?e.entries.map((e=>CompressedBatchEntry.fromJSON(e))):[],lookupInners:Array.isArray(e?.lookupInners)?e.lookupInners.map((e=>InnerOp.fromJSON(e))):[]}),toJSON(e){const o={};return e.entries?o.entries=e.entries.map((e=>e?CompressedBatchEntry.toJSON(e):void 0)):o.entries=[],e.lookupInners?o.lookupInners=e.lookupInners.map((e=>e?InnerOp.toJSON(e):void 0)):o.lookupInners=[],o},fromPartial(e){const o={entries:[],lookupInners:[]};return o.entries=e.entries?.map((e=>CompressedBatchEntry.fromPartial(e)))||[],o.lookupInners=e.lookupInners?.map((e=>InnerOp.fromPartial(e)))||[],o},fromProtoMsg:e=>CompressedBatchProof.decode(e.value),toProto:e=>CompressedBatchProof.encode(e).finish(),toProtoMsg:e=>({typeUrl:"/cosmos.ics23.v1.CompressedBatchProof",value:CompressedBatchProof.encode(e).finish()})};export const CompressedBatchEntry={typeUrl:"/cosmos.ics23.v1.CompressedBatchEntry",encode:(e,t=o.create())=>(void 0!==e.exist&&CompressedExistenceProof.encode(e.exist,t.uint32(10).fork()).ldelim(),void 0!==e.nonexist&&CompressedNonExistenceProof.encode(e.nonexist,t.uint32(18).fork()).ldelim(),t),decode(o,t){const r=o instanceof e?o:new e(o);let n=void 0===t?r.len:r.pos+t;const s={exist:void 0,nonexist:void 0};for(;r.pos<n;){const e=r.uint32();switch(e>>>3){case 1:s.exist=CompressedExistenceProof.decode(r,r.uint32());break;case 2:s.nonexist=CompressedNonExistenceProof.decode(r,r.uint32());break;default:r.skipType(7&e)}}return s},fromJSON:e=>({exist:t(e.exist)?CompressedExistenceProof.fromJSON(e.exist):void 0,nonexist:t(e.nonexist)?CompressedNonExistenceProof.fromJSON(e.nonexist):void 0}),toJSON(e){const o={};return void 0!==e.exist&&(o.exist=e.exist?CompressedExistenceProof.toJSON(e.exist):void 0),void 0!==e.nonexist&&(o.nonexist=e.nonexist?CompressedNonExistenceProof.toJSON(e.nonexist):void 0),o},fromPartial(e){const o={exist:void 0,nonexist:void 0};return o.exist=void 0!==e.exist&&null!==e.exist?CompressedExistenceProof.fromPartial(e.exist):void 0,o.nonexist=void 0!==e.nonexist&&null!==e.nonexist?CompressedNonExistenceProof.fromPartial(e.nonexist):void 0,o},fromProtoMsg:e=>CompressedBatchEntry.decode(e.value),toProto:e=>CompressedBatchEntry.encode(e).finish(),toProtoMsg:e=>({typeUrl:"/cosmos.ics23.v1.CompressedBatchEntry",value:CompressedBatchEntry.encode(e).finish()})};function h(){return{key:new Uint8Array,value:new Uint8Array,leaf:void 0,path:[]}}export const CompressedExistenceProof={typeUrl:"/cosmos.ics23.v1.CompressedExistenceProof",encode(e,t=o.create()){0!==e.key.length&&t.uint32(10).bytes(e.key),0!==e.value.length&&t.uint32(18).bytes(e.value),void 0!==e.leaf&&LeafOp.encode(e.leaf,t.uint32(26).fork()).ldelim(),t.uint32(34).fork();for(const o of e.path)t.int32(o);return t.ldelim(),t},decode(o,t){const r=o instanceof e?o:new e(o);let n=void 0===t?r.len:r.pos+t;const s=h();for(;r.pos<n;){const e=r.uint32();switch(e>>>3){case 1:s.key=r.bytes();break;case 2:s.value=r.bytes();break;case 3:s.leaf=LeafOp.decode(r,r.uint32());break;case 4:if(2==(7&e)){const e=r.uint32()+r.pos;for(;r.pos<e;)s.path.push(r.int32())}else s.path.push(r.int32());break;default:r.skipType(7&e)}}return s},fromJSON:e=>({key:t(e.key)?r(e.key):new Uint8Array,value:t(e.value)?r(e.value):new Uint8Array,leaf:t(e.leaf)?LeafOp.fromJSON(e.leaf):void 0,path:Array.isArray(e?.path)?e.path.map((e=>Number(e))):[]}),toJSON(e){const o={};return void 0!==e.key&&(o.key=n(void 0!==e.key?e.key:new Uint8Array)),void 0!==e.value&&(o.value=n(void 0!==e.value?e.value:new Uint8Array)),void 0!==e.leaf&&(o.leaf=e.leaf?LeafOp.toJSON(e.leaf):void 0),e.path?o.path=e.path.map((e=>Math.round(e))):o.path=[],o},fromPartial(e){const o=h();return o.key=e.key??new Uint8Array,o.value=e.value??new Uint8Array,o.leaf=void 0!==e.leaf&&null!==e.leaf?LeafOp.fromPartial(e.leaf):void 0,o.path=e.path?.map((e=>e))||[],o},fromProtoMsg:e=>CompressedExistenceProof.decode(e.value),toProto:e=>CompressedExistenceProof.encode(e).finish(),toProtoMsg:e=>({typeUrl:"/cosmos.ics23.v1.CompressedExistenceProof",value:CompressedExistenceProof.encode(e).finish()})};function f(){return{key:new Uint8Array,left:void 0,right:void 0}}export const CompressedNonExistenceProof={typeUrl:"/cosmos.ics23.v1.CompressedNonExistenceProof",encode:(e,t=o.create())=>(0!==e.key.length&&t.uint32(10).bytes(e.key),void 0!==e.left&&CompressedExistenceProof.encode(e.left,t.uint32(18).fork()).ldelim(),void 0!==e.right&&CompressedExistenceProof.encode(e.right,t.uint32(26).fork()).ldelim(),t),decode(o,t){const r=o instanceof e?o:new e(o);let n=void 0===t?r.len:r.pos+t;const s=f();for(;r.pos<n;){const e=r.uint32();switch(e>>>3){case 1:s.key=r.bytes();break;case 2:s.left=CompressedExistenceProof.decode(r,r.uint32());break;case 3:s.right=CompressedExistenceProof.decode(r,r.uint32());break;default:r.skipType(7&e)}}return s},fromJSON:e=>({key:t(e.key)?r(e.key):new Uint8Array,left:t(e.left)?CompressedExistenceProof.fromJSON(e.left):void 0,right:t(e.right)?CompressedExistenceProof.fromJSON(e.right):void 0}),toJSON(e){const o={};return void 0!==e.key&&(o.key=n(void 0!==e.key?e.key:new Uint8Array)),void 0!==e.left&&(o.left=e.left?CompressedExistenceProof.toJSON(e.left):void 0),void 0!==e.right&&(o.right=e.right?CompressedExistenceProof.toJSON(e.right):void 0),o},fromPartial(e){const o=f();return o.key=e.key??new Uint8Array,o.left=void 0!==e.left&&null!==e.left?CompressedExistenceProof.fromPartial(e.left):void 0,o.right=void 0!==e.right&&null!==e.right?CompressedExistenceProof.fromPartial(e.right):void 0,o},fromProtoMsg:e=>CompressedNonExistenceProof.decode(e.value),toProto:e=>CompressedNonExistenceProof.encode(e).finish(),toProtoMsg:e=>({typeUrl:"/cosmos.ics23.v1.CompressedNonExistenceProof",value:CompressedNonExistenceProof.encode(e).finish()})};