@agoric/client-utils 0.1.1-dev-e077dea.0.e077dea → 0.1.1-dev-f6d536e.0.f6d536e

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

@@ -1,585 +0,0 @@
-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

@@ -1 +0,0 @@
-{"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"}