@useaccord/sdk 0.1.0

package/dist/generated/accounts/pendingUpdate.d.ts

@@ -0,0 +1,43 @@
+/**
+ * This code was AUTOGENERATED using the Codama library.
+ * Please DO NOT EDIT THIS FILE, instead use visitors
+ * to add features, then rerun Codama to update it.
+ *
+ * @see https://github.com/codama-idl/codama
+ */
+import { fetchEncodedAccount, fetchEncodedAccounts, type Account, type Address, type Codec, type Decoder, type EncodedAccount, type Encoder, type FetchAccountConfig, type FetchAccountsConfig, type MaybeAccount, type MaybeEncodedAccount, type ReadonlyUint8Array } from "@solana/kit";
+import { type UpdatePayload, type UpdatePayloadArgs } from "../types";
+export declare const PENDING_UPDATE_DISCRIMINATOR: ReadonlyUint8Array;
+export declare function getPendingUpdateDiscriminatorBytes(): ReadonlyUint8Array;
+export type PendingUpdate = {
+    discriminator: ReadonlyUint8Array;
+    subaccord: Address;
+    nonce: bigint;
+    proposed: UpdatePayload;
+    proposedBy: Address;
+    /** Earliest slot at which `execute_subaccord_update` may land. */
+    executeAfterSlot: bigint;
+    bump: number;
+};
+export type PendingUpdateArgs = {
+    subaccord: Address;
+    nonce: number | bigint;
+    proposed: UpdatePayloadArgs;
+    proposedBy: Address;
+    /** Earliest slot at which `execute_subaccord_update` may land. */
+    executeAfterSlot: number | bigint;
+    bump: number;
+};
+/** Gets the encoder for {@link PendingUpdateArgs} account data. */
+export declare function getPendingUpdateEncoder(): Encoder<PendingUpdateArgs>;
+/** Gets the decoder for {@link PendingUpdate} account data. */
+export declare function getPendingUpdateDecoder(): Decoder<PendingUpdate>;
+/** Gets the codec for {@link PendingUpdate} account data. */
+export declare function getPendingUpdateCodec(): Codec<PendingUpdateArgs, PendingUpdate>;
+export declare function decodePendingUpdate<TAddress extends string = string>(encodedAccount: EncodedAccount<TAddress>): Account<PendingUpdate, TAddress>;
+export declare function decodePendingUpdate<TAddress extends string = string>(encodedAccount: MaybeEncodedAccount<TAddress>): MaybeAccount<PendingUpdate, TAddress>;
+export declare function fetchPendingUpdate<TAddress extends string = string>(rpc: Parameters<typeof fetchEncodedAccount>[0], address: Address<TAddress>, config?: FetchAccountConfig): Promise<Account<PendingUpdate, TAddress>>;
+export declare function fetchMaybePendingUpdate<TAddress extends string = string>(rpc: Parameters<typeof fetchEncodedAccount>[0], address: Address<TAddress>, config?: FetchAccountConfig): Promise<MaybeAccount<PendingUpdate, TAddress>>;
+export declare function fetchAllPendingUpdate(rpc: Parameters<typeof fetchEncodedAccounts>[0], addresses: Array<Address>, config?: FetchAccountsConfig): Promise<Account<PendingUpdate>[]>;
+export declare function fetchAllMaybePendingUpdate(rpc: Parameters<typeof fetchEncodedAccounts>[0], addresses: Array<Address>, config?: FetchAccountsConfig): Promise<MaybeAccount<PendingUpdate>[]>;
+//# sourceMappingURL=pendingUpdate.d.ts.map

package/dist/generated/accounts/pendingUpdate.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"pendingUpdate.d.ts","sourceRoot":"","sources":["../../../src/generated/accounts/pendingUpdate.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,OAAO,EAKL,mBAAmB,EACnB,oBAAoB,EAcpB,KAAK,OAAO,EACZ,KAAK,OAAO,EACZ,KAAK,KAAK,EACV,KAAK,OAAO,EACZ,KAAK,cAAc,EACnB,KAAK,OAAO,EACZ,KAAK,kBAAkB,EACvB,KAAK,mBAAmB,EACxB,KAAK,YAAY,EACjB,KAAK,mBAAmB,EACxB,KAAK,kBAAkB,EACxB,MAAM,aAAa,CAAC;AACrB,OAAO,EAGL,KAAK,aAAa,EAClB,KAAK,iBAAiB,EACvB,MAAM,UAAU,CAAC;AAElB,eAAO,MAAM,4BAA4B,EAAE,kBAEzC,CAAC;AAEH,wBAAgB,kCAAkC,IAAI,kBAAkB,CAIvE;AAED,MAAM,MAAM,aAAa,GAAG;IAC1B,aAAa,EAAE,kBAAkB,CAAC;IAClC,SAAS,EAAE,OAAO,CAAC;IACnB,KAAK,EAAE,MAAM,CAAC;IACd,QAAQ,EAAE,aAAa,CAAC;IACxB,UAAU,EAAE,OAAO,CAAC;IACpB,kEAAkE;IAClE,gBAAgB,EAAE,MAAM,CAAC;IACzB,IAAI,EAAE,MAAM,CAAC;CACd,CAAC;AAEF,MAAM,MAAM,iBAAiB,GAAG;IAC9B,SAAS,EAAE,OAAO,CAAC;IACnB,KAAK,EAAE,MAAM,GAAG,MAAM,CAAC;IACvB,QAAQ,EAAE,iBAAiB,CAAC;IAC5B,UAAU,EAAE,OAAO,CAAC;IACpB,kEAAkE;IAClE,gBAAgB,EAAE,MAAM,GAAG,MAAM,CAAC;IAClC,IAAI,EAAE,MAAM,CAAC;CACd,CAAC;AAEF,mEAAmE;AACnE,wBAAgB,uBAAuB,IAAI,OAAO,CAAC,iBAAiB,CAAC,CAapE;AAED,+DAA+D;AAC/D,wBAAgB,uBAAuB,IAAI,OAAO,CAAC,aAAa,CAAC,CAUhE;AAED,6DAA6D;AAC7D,wBAAgB,qBAAqB,IAAI,KAAK,CAC5C,iBAAiB,EACjB,aAAa,CACd,CAEA;AAED,wBAAgB,mBAAmB,CAAC,QAAQ,SAAS,MAAM,GAAG,MAAM,EAClE,cAAc,EAAE,cAAc,CAAC,QAAQ,CAAC,GACvC,OAAO,CAAC,aAAa,EAAE,QAAQ,CAAC,CAAC;AACpC,wBAAgB,mBAAmB,CAAC,QAAQ,SAAS,MAAM,GAAG,MAAM,EAClE,cAAc,EAAE,mBAAmB,CAAC,QAAQ,CAAC,GAC5C,YAAY,CAAC,aAAa,EAAE,QAAQ,CAAC,CAAC;AAUzC,wBAAsB,kBAAkB,CAAC,QAAQ,SAAS,MAAM,GAAG,MAAM,EACvE,GAAG,EAAE,UAAU,CAAC,OAAO,mBAAmB,CAAC,CAAC,CAAC,CAAC,EAC9C,OAAO,EAAE,OAAO,CAAC,QAAQ,CAAC,EAC1B,MAAM,CAAC,EAAE,kBAAkB,GAC1B,OAAO,CAAC,OAAO,CAAC,aAAa,EAAE,QAAQ,CAAC,CAAC,CAI3C;AAED,wBAAsB,uBAAuB,CAAC,QAAQ,SAAS,MAAM,GAAG,MAAM,EAC5E,GAAG,EAAE,UAAU,CAAC,OAAO,mBAAmB,CAAC,CAAC,CAAC,CAAC,EAC9C,OAAO,EAAE,OAAO,CAAC,QAAQ,CAAC,EAC1B,MAAM,CAAC,EAAE,kBAAkB,GAC1B,OAAO,CAAC,YAAY,CAAC,aAAa,EAAE,QAAQ,CAAC,CAAC,CAGhD;AAED,wBAAsB,qBAAqB,CACzC,GAAG,EAAE,UAAU,CAAC,OAAO,oBAAoB,CAAC,CAAC,CAAC,CAAC,EAC/C,SAAS,EAAE,KAAK,CAAC,OAAO,CAAC,EACzB,MAAM,CAAC,EAAE,mBAAmB,GAC3B,OAAO,CAAC,OAAO,CAAC,aAAa,CAAC,EAAE,CAAC,CAQnC;AAED,wBAAsB,0BAA0B,CAC9C,GAAG,EAAE,UAAU,CAAC,OAAO,oBAAoB,CAAC,CAAC,CAAC,CAAC,EAC/C,SAAS,EAAE,KAAK,CAAC,OAAO,CAAC,EACzB,MAAM,CAAC,EAAE,mBAAmB,GAC3B,OAAO,CAAC,YAAY,CAAC,aAAa,CAAC,EAAE,CAAC,CAGxC"}

package/dist/generated/accounts/round.d.ts

@@ -0,0 +1,143 @@
+/**
+ * This code was AUTOGENERATED using the Codama library.
+ * Please DO NOT EDIT THIS FILE, instead use visitors
+ * to add features, then rerun Codama to update it.
+ *
+ * @see https://github.com/codama-idl/codama
+ */
+import { fetchEncodedAccount, fetchEncodedAccounts, type Account, type Address, type EncodedAccount, type FetchAccountConfig, type FetchAccountsConfig, type FixedSizeCodec, type FixedSizeDecoder, type FixedSizeEncoder, type MaybeAccount, type MaybeEncodedAccount, type ReadonlyUint8Array } from "@solana/kit";
+export declare const ROUND_DISCRIMINATOR: ReadonlyUint8Array;
+export declare function getRoundDiscriminatorBytes(): ReadonlyUint8Array;
+export type Round = {
+    discriminator: ReadonlyUint8Array;
+    roundIdx: number;
+    jurorCount: number;
+    commitCount: number;
+    revealCount: number;
+    /**
+     * Same-size redraw counter within this round (ADR-0021). Orthogonal to
+     * `round_idx`: bumping it changes only the sortition seed, never the panel
+     * size or the appeal budget. `(0,0)` = initial draw; resets implicitly on a
+     * new appeal round (fresh `Round` PDA keyed by the new `round_idx`).
+     */
+    drawAttempt: number;
+    /**
+     * Whether this round's coherence settlement has been applied
+     * (CONCEPT-REVIEW Ugly 5 / bean accord-r6ti). 0 until
+     * `finalize_dispute` (final round) or `settle_round` (prior rounds)
+     * processes it; 1 after. Idempotency guard against double-settlement.
+     * (`u8` not `bool` — `bool` is not `Pod`.)
+     */
+    settled: number;
+    bump: number;
+    pad0: ReadonlyUint8Array;
+    /** Commit opens at this timestamp (= draw_time + review_window). */
+    reviewEnd: bigint;
+    /** Reveal opens at this timestamp (= review_end + commit_window). */
+    commitEnd: bigint;
+    /** Round can be finalized after this timestamp (= commit_end + reveal_window). */
+    revealEnd: bigint;
+    /**
+     * The tallied round result; `u64::MAX` = not set. `Plurality`: winning
+     * option index. `Median` (ADR-0025): the median of revealed scalar votes.
+     */
+    result: bigint;
+    dispute: Address;
+    jurors: Array<Address>;
+    /**
+     * `hash(vote_le, salt, juror_pubkey)` per drawn Juror; `[0;32]` until
+     * committed. `vote_le` = the 8-byte little-endian vote (ADR-0025).
+     */
+    commits: Array<ReadonlyUint8Array>;
+    /**
+     * Cumulative-from-left prefix per drawn seat (bean accord-tzo0). Filled
+     * when the seat lands; later seats read these to verify that every prior
+     * sortition retry genuinely collided with an already-drawn juror —
+     * eliminating caller choice (no draw_attempt grind).
+     */
+    seatPrefix: Array<bigint>;
+    /**
+     * Leaf stake per drawn seat. With `seat_prefix`, defines the sortition
+     * range `[prefix, prefix+stake)` used for deterministic collision checks.
+     */
+    seatStake: Array<bigint>;
+    /**
+     * Revealed vote per drawn Juror; `u64::MAX` until revealed. Option index
+     * for `Plurality`, fixed-point scalar (settlement-mint base units) for
+     * `Median` (ADR-0025). Tail field — struct size stays a multiple of 8.
+     */
+    reveals: Array<bigint>;
+};
+export type RoundArgs = {
+    roundIdx: number;
+    jurorCount: number;
+    commitCount: number;
+    revealCount: number;
+    /**
+     * Same-size redraw counter within this round (ADR-0021). Orthogonal to
+     * `round_idx`: bumping it changes only the sortition seed, never the panel
+     * size or the appeal budget. `(0,0)` = initial draw; resets implicitly on a
+     * new appeal round (fresh `Round` PDA keyed by the new `round_idx`).
+     */
+    drawAttempt: number;
+    /**
+     * Whether this round's coherence settlement has been applied
+     * (CONCEPT-REVIEW Ugly 5 / bean accord-r6ti). 0 until
+     * `finalize_dispute` (final round) or `settle_round` (prior rounds)
+     * processes it; 1 after. Idempotency guard against double-settlement.
+     * (`u8` not `bool` — `bool` is not `Pod`.)
+     */
+    settled: number;
+    bump: number;
+    pad0: ReadonlyUint8Array;
+    /** Commit opens at this timestamp (= draw_time + review_window). */
+    reviewEnd: number | bigint;
+    /** Reveal opens at this timestamp (= review_end + commit_window). */
+    commitEnd: number | bigint;
+    /** Round can be finalized after this timestamp (= commit_end + reveal_window). */
+    revealEnd: number | bigint;
+    /**
+     * The tallied round result; `u64::MAX` = not set. `Plurality`: winning
+     * option index. `Median` (ADR-0025): the median of revealed scalar votes.
+     */
+    result: number | bigint;
+    dispute: Address;
+    jurors: Array<Address>;
+    /**
+     * `hash(vote_le, salt, juror_pubkey)` per drawn Juror; `[0;32]` until
+     * committed. `vote_le` = the 8-byte little-endian vote (ADR-0025).
+     */
+    commits: Array<ReadonlyUint8Array>;
+    /**
+     * Cumulative-from-left prefix per drawn seat (bean accord-tzo0). Filled
+     * when the seat lands; later seats read these to verify that every prior
+     * sortition retry genuinely collided with an already-drawn juror —
+     * eliminating caller choice (no draw_attempt grind).
+     */
+    seatPrefix: Array<number | bigint>;
+    /**
+     * Leaf stake per drawn seat. With `seat_prefix`, defines the sortition
+     * range `[prefix, prefix+stake)` used for deterministic collision checks.
+     */
+    seatStake: Array<number | bigint>;
+    /**
+     * Revealed vote per drawn Juror; `u64::MAX` until revealed. Option index
+     * for `Plurality`, fixed-point scalar (settlement-mint base units) for
+     * `Median` (ADR-0025). Tail field — struct size stays a multiple of 8.
+     */
+    reveals: Array<number | bigint>;
+};
+/** Gets the encoder for {@link RoundArgs} account data. */
+export declare function getRoundEncoder(): FixedSizeEncoder<RoundArgs>;
+/** Gets the decoder for {@link Round} account data. */
+export declare function getRoundDecoder(): FixedSizeDecoder<Round>;
+/** Gets the codec for {@link Round} account data. */
+export declare function getRoundCodec(): FixedSizeCodec<RoundArgs, Round>;
+export declare function decodeRound<TAddress extends string = string>(encodedAccount: EncodedAccount<TAddress>): Account<Round, TAddress>;
+export declare function decodeRound<TAddress extends string = string>(encodedAccount: MaybeEncodedAccount<TAddress>): MaybeAccount<Round, TAddress>;
+export declare function fetchRound<TAddress extends string = string>(rpc: Parameters<typeof fetchEncodedAccount>[0], address: Address<TAddress>, config?: FetchAccountConfig): Promise<Account<Round, TAddress>>;
+export declare function fetchMaybeRound<TAddress extends string = string>(rpc: Parameters<typeof fetchEncodedAccount>[0], address: Address<TAddress>, config?: FetchAccountConfig): Promise<MaybeAccount<Round, TAddress>>;
+export declare function fetchAllRound(rpc: Parameters<typeof fetchEncodedAccounts>[0], addresses: Array<Address>, config?: FetchAccountsConfig): Promise<Account<Round>[]>;
+export declare function fetchAllMaybeRound(rpc: Parameters<typeof fetchEncodedAccounts>[0], addresses: Array<Address>, config?: FetchAccountsConfig): Promise<MaybeAccount<Round>[]>;
+export declare function getRoundSize(): number;
+//# sourceMappingURL=round.d.ts.map

package/dist/generated/accounts/round.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"round.d.ts","sourceRoot":"","sources":["../../../src/generated/accounts/round.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,OAAO,EAKL,mBAAmB,EACnB,oBAAoB,EAoBpB,KAAK,OAAO,EACZ,KAAK,OAAO,EACZ,KAAK,cAAc,EACnB,KAAK,kBAAkB,EACvB,KAAK,mBAAmB,EACxB,KAAK,cAAc,EACnB,KAAK,gBAAgB,EACrB,KAAK,gBAAgB,EACrB,KAAK,YAAY,EACjB,KAAK,mBAAmB,EACxB,KAAK,kBAAkB,EACxB,MAAM,aAAa,CAAC;AAErB,eAAO,MAAM,mBAAmB,EAAE,kBAEhC,CAAC;AAEH,wBAAgB,0BAA0B,IAAI,kBAAkB,CAE/D;AAED,MAAM,MAAM,KAAK,GAAG;IAClB,aAAa,EAAE,kBAAkB,CAAC;IAClC,QAAQ,EAAE,MAAM,CAAC;IACjB,UAAU,EAAE,MAAM,CAAC;IACnB,WAAW,EAAE,MAAM,CAAC;IACpB,WAAW,EAAE,MAAM,CAAC;IACpB;;;;;OAKG;IACH,WAAW,EAAE,MAAM,CAAC;IACpB;;;;;;OAMG;IACH,OAAO,EAAE,MAAM,CAAC;IAChB,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,kBAAkB,CAAC;IACzB,oEAAoE;IACpE,SAAS,EAAE,MAAM,CAAC;IAClB,qEAAqE;IACrE,SAAS,EAAE,MAAM,CAAC;IAClB,kFAAkF;IAClF,SAAS,EAAE,MAAM,CAAC;IAClB;;;OAGG;IACH,MAAM,EAAE,MAAM,CAAC;IACf,OAAO,EAAE,OAAO,CAAC;IACjB,MAAM,EAAE,KAAK,CAAC,OAAO,CAAC,CAAC;IACvB;;;OAGG;IACH,OAAO,EAAE,KAAK,CAAC,kBAAkB,CAAC,CAAC;IACnC;;;;;OAKG;IACH,UAAU,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC;IAC1B;;;OAGG;IACH,SAAS,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC;IACzB;;;;OAIG;IACH,OAAO,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC;CACxB,CAAC;AAEF,MAAM,MAAM,SAAS,GAAG;IACtB,QAAQ,EAAE,MAAM,CAAC;IACjB,UAAU,EAAE,MAAM,CAAC;IACnB,WAAW,EAAE,MAAM,CAAC;IACpB,WAAW,EAAE,MAAM,CAAC;IACpB;;;;;OAKG;IACH,WAAW,EAAE,MAAM,CAAC;IACpB;;;;;;OAMG;IACH,OAAO,EAAE,MAAM,CAAC;IAChB,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,kBAAkB,CAAC;IACzB,oEAAoE;IACpE,SAAS,EAAE,MAAM,GAAG,MAAM,CAAC;IAC3B,qEAAqE;IACrE,SAAS,EAAE,MAAM,GAAG,MAAM,CAAC;IAC3B,kFAAkF;IAClF,SAAS,EAAE,MAAM,GAAG,MAAM,CAAC;IAC3B;;;OAGG;IACH,MAAM,EAAE,MAAM,GAAG,MAAM,CAAC;IACxB,OAAO,EAAE,OAAO,CAAC;IACjB,MAAM,EAAE,KAAK,CAAC,OAAO,CAAC,CAAC;IACvB;;;OAGG;IACH,OAAO,EAAE,KAAK,CAAC,kBAAkB,CAAC,CAAC;IACnC;;;;;OAKG;IACH,UAAU,EAAE,KAAK,CAAC,MAAM,GAAG,MAAM,CAAC,CAAC;IACnC;;;OAGG;IACH,SAAS,EAAE,KAAK,CAAC,MAAM,GAAG,MAAM,CAAC,CAAC;IAClC;;;;OAIG;IACH,OAAO,EAAE,KAAK,CAAC,MAAM,GAAG,MAAM,CAAC,CAAC;CACjC,CAAC;AAEF,2DAA2D;AAC3D,wBAAgB,eAAe,IAAI,gBAAgB,CAAC,SAAS,CAAC,CA4B7D;AAED,uDAAuD;AACvD,wBAAgB,eAAe,IAAI,gBAAgB,CAAC,KAAK,CAAC,CAyBzD;AAED,qDAAqD;AACrD,wBAAgB,aAAa,IAAI,cAAc,CAAC,SAAS,EAAE,KAAK,CAAC,CAEhE;AAED,wBAAgB,WAAW,CAAC,QAAQ,SAAS,MAAM,GAAG,MAAM,EAC1D,cAAc,EAAE,cAAc,CAAC,QAAQ,CAAC,GACvC,OAAO,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC;AAC5B,wBAAgB,WAAW,CAAC,QAAQ,SAAS,MAAM,GAAG,MAAM,EAC1D,cAAc,EAAE,mBAAmB,CAAC,QAAQ,CAAC,GAC5C,YAAY,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC;AAUjC,wBAAsB,UAAU,CAAC,QAAQ,SAAS,MAAM,GAAG,MAAM,EAC/D,GAAG,EAAE,UAAU,CAAC,OAAO,mBAAmB,CAAC,CAAC,CAAC,CAAC,EAC9C,OAAO,EAAE,OAAO,CAAC,QAAQ,CAAC,EAC1B,MAAM,CAAC,EAAE,kBAAkB,GAC1B,OAAO,CAAC,OAAO,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC,CAInC;AAED,wBAAsB,eAAe,CAAC,QAAQ,SAAS,MAAM,GAAG,MAAM,EACpE,GAAG,EAAE,UAAU,CAAC,OAAO,mBAAmB,CAAC,CAAC,CAAC,CAAC,EAC9C,OAAO,EAAE,OAAO,CAAC,QAAQ,CAAC,EAC1B,MAAM,CAAC,EAAE,kBAAkB,GAC1B,OAAO,CAAC,YAAY,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC,CAGxC;AAED,wBAAsB,aAAa,CACjC,GAAG,EAAE,UAAU,CAAC,OAAO,oBAAoB,CAAC,CAAC,CAAC,CAAC,EAC/C,SAAS,EAAE,KAAK,CAAC,OAAO,CAAC,EACzB,MAAM,CAAC,EAAE,mBAAmB,GAC3B,OAAO,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC,CAI3B;AAED,wBAAsB,kBAAkB,CACtC,GAAG,EAAE,UAAU,CAAC,OAAO,oBAAoB,CAAC,CAAC,CAAC,CAAC,EAC/C,SAAS,EAAE,KAAK,CAAC,OAAO,CAAC,EACzB,MAAM,CAAC,EAAE,mBAAmB,GAC3B,OAAO,CAAC,YAAY,CAAC,KAAK,CAAC,EAAE,CAAC,CAGhC;AAED,wBAAgB,YAAY,IAAI,MAAM,CAErC"}

package/dist/generated/accounts/subaccord.d.ts

@@ -0,0 +1,300 @@
+/**
+ * This code was AUTOGENERATED using the Codama library.
+ * Please DO NOT EDIT THIS FILE, instead use visitors
+ * to add features, then rerun Codama to update it.
+ *
+ * @see https://github.com/codama-idl/codama
+ */
+import { fetchEncodedAccount, fetchEncodedAccounts, type Account, type Address, type EncodedAccount, type FetchAccountConfig, type FetchAccountsConfig, type FixedSizeCodec, type FixedSizeDecoder, type FixedSizeEncoder, type MaybeAccount, type MaybeEncodedAccount, type ReadonlyUint8Array } from "@solana/kit";
+import { type Aggregation, type AggregationArgs, type ShortfallPolicy, type ShortfallPolicyArgs } from "../types";
+export declare const SUBACCORD_DISCRIMINATOR: ReadonlyUint8Array;
+export declare function getSubaccordDiscriminatorBytes(): ReadonlyUint8Array;
+export type Subaccord = {
+    discriminator: ReadonlyUint8Array;
+    creator: Address;
+    stakingToken: Address;
+    /**
+     * Compensation mint — fees + appeal bonds (ADR-0020). Distinct from
+     * `staking_token` so collateral and compensation are decoupled.
+     */
+    feeToken: Address;
+    minStake: bigint;
+    /**
+     * Slash factor in basis points (10% = 1000). Incoherent Juror loses
+     * `alpha_bps * min_stake / 10_000` (flat — ADR-0003 consequence).
+     */
+    alphaBps: number;
+    reviewWindow: bigint;
+    commitWindow: bigint;
+    revealWindow: bigint;
+    /**
+     * Appeal window after a round resolves before the dispute goes final
+     * (ADR-0022). Per-Subaccord; frozen onto `CaseTerms` at filing.
+     */
+    appealWindow: bigint;
+    maxAppeals: number;
+    /**
+     * Round-1 (round-0) juror panel size (accord-9q3e, supersedes ADR-0019's
+     * fixed constant). Immutable at creation — determines the appeal-ladder
+     * geometry `(J+1)·2^k − 1`. Must be odd (tie avoidance) and the ladder top
+     * `(J+1)·2^max_appeals − 1` must fit `MAX_JURORS`. Default 3. Frozen onto
+     * `CaseTerms` at filing so governance cannot shift panel size mid-dispute.
+     * A pool wanting a single juror sets `min_jury_size = 1` + `max_appeals = 0`.
+     */
+    minJurySize: number;
+    /** Per-Subaccord aggregation rule (ADR-0019). v1 = `Plurality`. */
+    aggregation: Aggregation;
+    feePerJuror: bigint;
+    /**
+     * Reveal-quorum fraction in basis points (ADR-0021). A round is
+     * authoritative only if `reveal_count >= ceil(panel × bps / 10_000)`.
+     * Default 6666 (= 2/3); the absolute commitment escalates per appeal
+     * for free via panel growth.
+     */
+    revealThresholdBps: number;
+    /** What to do on a shortfall (ADR-0021). v1 = `Redraw`. */
+    shortfallPolicy: ShortfallPolicy;
+    /**
+     * Maximum same-size redraws per round before the dispute fails (ADR-0021).
+     * `(round_idx, draw_attempt)` with `draw_attempt` reaching this bound ⇒
+     * `Failed`. Orthogonal to `max_appeals` (which bounds `round_idx`).
+     */
+    maxDrawAttempts: number;
+    /**
+     * Coherence tolerance for `Median` pools (ADR-0025), in bps of the final
+     * median: a revealed vote is coherent iff
+     * `|vote − ruling| · 10_000 ≤ ruling · coherence_tol_bps`. `0` = exact
+     * match. Inert for `Plurality` (exact option equality). Frozen onto
+     * `CaseTerms` at filing; immutable on the Subaccord (not in
+     * `UpdatePayload`) — it defines the pool's coherence game.
+     */
+    coherenceTolBps: number;
+    /** `Pubkey::default()` => immutable. Otherwise signs propose/execute updates. */
+    authority: Address;
+    evidenceOperator: Address;
+    /** Immutable identity hash: what class of dispute this pool adjudicates. */
+    domainRef: ReadonlyUint8Array;
+    /** Immutable evidence-format spec hash (ADR-0006). */
+    evidenceSpec: ReadonlyUint8Array;
+    /**
+     * Attestation-gated juror pool (PROG-ATTESTTION). When both are
+     * `Pubkey::default()` the Subaccord is stake-only (today's behavior,
+     * unchanged). When set, jurors must hold a valid SAS attestation from
+     * `juror_credential` under `juror_schema` to stake and be drawn. Immutable
+     * at creation — joins `domain_ref` + `evidence_spec` as the identity
+     * triplet (ADR-0005). Both-or-neither: a half-bound Subaccord is rejected
+     * at `create_subaccord` (`AttestationBindingPartial`).
+     */
+    jurorCredential: Address;
+    jurorSchema: Address;
+    /**
+     * Count of **distinct Jurors with any stake** (`JurorStake.staked > 0`).
+     * Maintained O(1) by `stake`/`unstake` (0→positive increments,
+     * positive→0 decrements). This is a *coarse* intake gate for
+     * `create_dispute`/`appeal` (SPEC edge case: revert if fewer active
+     * distinct stakers than the required panel). It deliberately does NOT track
+     * `min_stake` eligibility — that changes via the 48h timelock and cannot be
+     * recomputed without the O(n) ledger ADR-0003 rejected. Precise eligibility
+     * (amount ≥ min_stake, distinctness) is verified at `draw` against the
+     * finalized Merkle Snapshot.
+     */
+    stakerCount: number;
+    /**
+     * On-chain stake accumulator root (ADR-0012). Maintained incrementally on
+     * every `stake`/`unstake` via client-supplied Merkle paths; canonical by
+     * construction — there is no posted root to withhold or fabricate.
+     */
+    rootHash: ReadonlyUint8Array;
+    /** Total stake committed to by the accumulator tree (= root node sum). */
+    totalStake: bigint;
+    /**
+     * Next free leaf index in the append-only tree. Incremented once per
+     * first-time staker; never reused (full unstake zeros the leaf weight but
+     * keeps its `tree_index`).
+     */
+    nextIndex: number;
+    /** Fixed tree depth (bounds the pool at `2^depth`). Set at `create_subaccord`. */
+    depth: number;
+    /**
+     * Parallel vault ledger — fee side (bean accord-fdad). Tracks every
+     * `fee_token` SPL transfer in/out of the `fee_vault`, independent of the
+     * vault's live balance. The vault balance is a *derivable consequence*:
+     * `fee_vault.amount == fee_vault_deposited - fee_vault_withdrawn`
+     * (separate-mint) or the fee portion of a shared ATA (same-mint).
+     */
+    feeVaultDeposited: bigint;
+    feeVaultWithdrawn: bigint;
+    /**
+     * Parallel vault ledger — stake side (bean accord-fdad). Tracks every
+     * `staking_token` SPL transfer in/out of the `stake_vault`. Bumped only by
+     * `stake` (in) and `withdraw` (out); slashing and `request_withdraw` are
+     * ledger-only and never touch these.
+     */
+    stakeVaultDeposited: bigint;
+    stakeVaultWithdrawn: bigint;
+    /**
+     * Head of the free-slot linked list (RECLAIM-LEAF). `u32::MAX` = list empty.
+     * When non-MAX, points to a JurorStake whose slot has been reclaimed and is
+     * available for reuse by a new staker. Maintained by `reclaim_slot` (push)
+     * and `stake` (pop).
+     */
+    freeHead: number;
+    bump: number;
+    /**
+     * Reserved tail space for future field extensions. Zeroed at `init`;
+     * must stay the last field — new fields are carved out of it without
+     * moving existing offsets or resizing the account.
+     */
+    padding: ReadonlyUint8Array;
+};
+export type SubaccordArgs = {
+    creator: Address;
+    stakingToken: Address;
+    /**
+     * Compensation mint — fees + appeal bonds (ADR-0020). Distinct from
+     * `staking_token` so collateral and compensation are decoupled.
+     */
+    feeToken: Address;
+    minStake: number | bigint;
+    /**
+     * Slash factor in basis points (10% = 1000). Incoherent Juror loses
+     * `alpha_bps * min_stake / 10_000` (flat — ADR-0003 consequence).
+     */
+    alphaBps: number;
+    reviewWindow: number | bigint;
+    commitWindow: number | bigint;
+    revealWindow: number | bigint;
+    /**
+     * Appeal window after a round resolves before the dispute goes final
+     * (ADR-0022). Per-Subaccord; frozen onto `CaseTerms` at filing.
+     */
+    appealWindow: number | bigint;
+    maxAppeals: number;
+    /**
+     * Round-1 (round-0) juror panel size (accord-9q3e, supersedes ADR-0019's
+     * fixed constant). Immutable at creation — determines the appeal-ladder
+     * geometry `(J+1)·2^k − 1`. Must be odd (tie avoidance) and the ladder top
+     * `(J+1)·2^max_appeals − 1` must fit `MAX_JURORS`. Default 3. Frozen onto
+     * `CaseTerms` at filing so governance cannot shift panel size mid-dispute.
+     * A pool wanting a single juror sets `min_jury_size = 1` + `max_appeals = 0`.
+     */
+    minJurySize: number;
+    /** Per-Subaccord aggregation rule (ADR-0019). v1 = `Plurality`. */
+    aggregation: AggregationArgs;
+    feePerJuror: number | bigint;
+    /**
+     * Reveal-quorum fraction in basis points (ADR-0021). A round is
+     * authoritative only if `reveal_count >= ceil(panel × bps / 10_000)`.
+     * Default 6666 (= 2/3); the absolute commitment escalates per appeal
+     * for free via panel growth.
+     */
+    revealThresholdBps: number;
+    /** What to do on a shortfall (ADR-0021). v1 = `Redraw`. */
+    shortfallPolicy: ShortfallPolicyArgs;
+    /**
+     * Maximum same-size redraws per round before the dispute fails (ADR-0021).
+     * `(round_idx, draw_attempt)` with `draw_attempt` reaching this bound ⇒
+     * `Failed`. Orthogonal to `max_appeals` (which bounds `round_idx`).
+     */
+    maxDrawAttempts: number;
+    /**
+     * Coherence tolerance for `Median` pools (ADR-0025), in bps of the final
+     * median: a revealed vote is coherent iff
+     * `|vote − ruling| · 10_000 ≤ ruling · coherence_tol_bps`. `0` = exact
+     * match. Inert for `Plurality` (exact option equality). Frozen onto
+     * `CaseTerms` at filing; immutable on the Subaccord (not in
+     * `UpdatePayload`) — it defines the pool's coherence game.
+     */
+    coherenceTolBps: number;
+    /** `Pubkey::default()` => immutable. Otherwise signs propose/execute updates. */
+    authority: Address;
+    evidenceOperator: Address;
+    /** Immutable identity hash: what class of dispute this pool adjudicates. */
+    domainRef: ReadonlyUint8Array;
+    /** Immutable evidence-format spec hash (ADR-0006). */
+    evidenceSpec: ReadonlyUint8Array;
+    /**
+     * Attestation-gated juror pool (PROG-ATTESTTION). When both are
+     * `Pubkey::default()` the Subaccord is stake-only (today's behavior,
+     * unchanged). When set, jurors must hold a valid SAS attestation from
+     * `juror_credential` under `juror_schema` to stake and be drawn. Immutable
+     * at creation — joins `domain_ref` + `evidence_spec` as the identity
+     * triplet (ADR-0005). Both-or-neither: a half-bound Subaccord is rejected
+     * at `create_subaccord` (`AttestationBindingPartial`).
+     */
+    jurorCredential: Address;
+    jurorSchema: Address;
+    /**
+     * Count of **distinct Jurors with any stake** (`JurorStake.staked > 0`).
+     * Maintained O(1) by `stake`/`unstake` (0→positive increments,
+     * positive→0 decrements). This is a *coarse* intake gate for
+     * `create_dispute`/`appeal` (SPEC edge case: revert if fewer active
+     * distinct stakers than the required panel). It deliberately does NOT track
+     * `min_stake` eligibility — that changes via the 48h timelock and cannot be
+     * recomputed without the O(n) ledger ADR-0003 rejected. Precise eligibility
+     * (amount ≥ min_stake, distinctness) is verified at `draw` against the
+     * finalized Merkle Snapshot.
+     */
+    stakerCount: number;
+    /**
+     * On-chain stake accumulator root (ADR-0012). Maintained incrementally on
+     * every `stake`/`unstake` via client-supplied Merkle paths; canonical by
+     * construction — there is no posted root to withhold or fabricate.
+     */
+    rootHash: ReadonlyUint8Array;
+    /** Total stake committed to by the accumulator tree (= root node sum). */
+    totalStake: number | bigint;
+    /**
+     * Next free leaf index in the append-only tree. Incremented once per
+     * first-time staker; never reused (full unstake zeros the leaf weight but
+     * keeps its `tree_index`).
+     */
+    nextIndex: number;
+    /** Fixed tree depth (bounds the pool at `2^depth`). Set at `create_subaccord`. */
+    depth: number;
+    /**
+     * Parallel vault ledger — fee side (bean accord-fdad). Tracks every
+     * `fee_token` SPL transfer in/out of the `fee_vault`, independent of the
+     * vault's live balance. The vault balance is a *derivable consequence*:
+     * `fee_vault.amount == fee_vault_deposited - fee_vault_withdrawn`
+     * (separate-mint) or the fee portion of a shared ATA (same-mint).
+     */
+    feeVaultDeposited: number | bigint;
+    feeVaultWithdrawn: number | bigint;
+    /**
+     * Parallel vault ledger — stake side (bean accord-fdad). Tracks every
+     * `staking_token` SPL transfer in/out of the `stake_vault`. Bumped only by
+     * `stake` (in) and `withdraw` (out); slashing and `request_withdraw` are
+     * ledger-only and never touch these.
+     */
+    stakeVaultDeposited: number | bigint;
+    stakeVaultWithdrawn: number | bigint;
+    /**
+     * Head of the free-slot linked list (RECLAIM-LEAF). `u32::MAX` = list empty.
+     * When non-MAX, points to a JurorStake whose slot has been reclaimed and is
+     * available for reuse by a new staker. Maintained by `reclaim_slot` (push)
+     * and `stake` (pop).
+     */
+    freeHead: number;
+    bump: number;
+    /**
+     * Reserved tail space for future field extensions. Zeroed at `init`;
+     * must stay the last field — new fields are carved out of it without
+     * moving existing offsets or resizing the account.
+     */
+    padding: ReadonlyUint8Array;
+};
+/** Gets the encoder for {@link SubaccordArgs} account data. */
+export declare function getSubaccordEncoder(): FixedSizeEncoder<SubaccordArgs>;
+/** Gets the decoder for {@link Subaccord} account data. */
+export declare function getSubaccordDecoder(): FixedSizeDecoder<Subaccord>;
+/** Gets the codec for {@link Subaccord} account data. */
+export declare function getSubaccordCodec(): FixedSizeCodec<SubaccordArgs, Subaccord>;
+export declare function decodeSubaccord<TAddress extends string = string>(encodedAccount: EncodedAccount<TAddress>): Account<Subaccord, TAddress>;
+export declare function decodeSubaccord<TAddress extends string = string>(encodedAccount: MaybeEncodedAccount<TAddress>): MaybeAccount<Subaccord, TAddress>;
+export declare function fetchSubaccord<TAddress extends string = string>(rpc: Parameters<typeof fetchEncodedAccount>[0], address: Address<TAddress>, config?: FetchAccountConfig): Promise<Account<Subaccord, TAddress>>;
+export declare function fetchMaybeSubaccord<TAddress extends string = string>(rpc: Parameters<typeof fetchEncodedAccount>[0], address: Address<TAddress>, config?: FetchAccountConfig): Promise<MaybeAccount<Subaccord, TAddress>>;
+export declare function fetchAllSubaccord(rpc: Parameters<typeof fetchEncodedAccounts>[0], addresses: Array<Address>, config?: FetchAccountsConfig): Promise<Account<Subaccord>[]>;
+export declare function fetchAllMaybeSubaccord(rpc: Parameters<typeof fetchEncodedAccounts>[0], addresses: Array<Address>, config?: FetchAccountsConfig): Promise<MaybeAccount<Subaccord>[]>;
+export declare function getSubaccordSize(): number;
+//# sourceMappingURL=subaccord.d.ts.map

package/dist/generated/accounts/subaccord.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"subaccord.d.ts","sourceRoot":"","sources":["../../../src/generated/accounts/subaccord.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,OAAO,EAKL,mBAAmB,EACnB,oBAAoB,EAkBpB,KAAK,OAAO,EACZ,KAAK,OAAO,EACZ,KAAK,cAAc,EACnB,KAAK,kBAAkB,EACvB,KAAK,mBAAmB,EACxB,KAAK,cAAc,EACnB,KAAK,gBAAgB,EACrB,KAAK,gBAAgB,EACrB,KAAK,YAAY,EACjB,KAAK,mBAAmB,EACxB,KAAK,kBAAkB,EACxB,MAAM,aAAa,CAAC;AACrB,OAAO,EAKL,KAAK,WAAW,EAChB,KAAK,eAAe,EACpB,KAAK,eAAe,EACpB,KAAK,mBAAmB,EACzB,MAAM,UAAU,CAAC;AAElB,eAAO,MAAM,uBAAuB,EAAE,kBAEpC,CAAC;AAEH,wBAAgB,8BAA8B,IAAI,kBAAkB,CAEnE;AAED,MAAM,MAAM,SAAS,GAAG;IACtB,aAAa,EAAE,kBAAkB,CAAC;IAClC,OAAO,EAAE,OAAO,CAAC;IACjB,YAAY,EAAE,OAAO,CAAC;IACtB;;;OAGG;IACH,QAAQ,EAAE,OAAO,CAAC;IAClB,QAAQ,EAAE,MAAM,CAAC;IACjB;;;OAGG;IACH,QAAQ,EAAE,MAAM,CAAC;IACjB,YAAY,EAAE,MAAM,CAAC;IACrB,YAAY,EAAE,MAAM,CAAC;IACrB,YAAY,EAAE,MAAM,CAAC;IACrB;;;OAGG;IACH,YAAY,EAAE,MAAM,CAAC;IACrB,UAAU,EAAE,MAAM,CAAC;IACnB;;;;;;;OAOG;IACH,WAAW,EAAE,MAAM,CAAC;IACpB,mEAAmE;IACnE,WAAW,EAAE,WAAW,CAAC;IACzB,WAAW,EAAE,MAAM,CAAC;IACpB;;;;;OAKG;IACH,kBAAkB,EAAE,MAAM,CAAC;IAC3B,2DAA2D;IAC3D,eAAe,EAAE,eAAe,CAAC;IACjC;;;;OAIG;IACH,eAAe,EAAE,MAAM,CAAC;IACxB;;;;;;;OAOG;IACH,eAAe,EAAE,MAAM,CAAC;IACxB,iFAAiF;IACjF,SAAS,EAAE,OAAO,CAAC;IACnB,gBAAgB,EAAE,OAAO,CAAC;IAC1B,4EAA4E;IAC5E,SAAS,EAAE,kBAAkB,CAAC;IAC9B,sDAAsD;IACtD,YAAY,EAAE,kBAAkB,CAAC;IACjC;;;;;;;;OAQG;IACH,eAAe,EAAE,OAAO,CAAC;IACzB,WAAW,EAAE,OAAO,CAAC;IACrB;;;;;;;;;;OAUG;IACH,WAAW,EAAE,MAAM,CAAC;IACpB;;;;OAIG;IACH,QAAQ,EAAE,kBAAkB,CAAC;IAC7B,0EAA0E;IAC1E,UAAU,EAAE,MAAM,CAAC;IACnB;;;;OAIG;IACH,SAAS,EAAE,MAAM,CAAC;IAClB,kFAAkF;IAClF,KAAK,EAAE,MAAM,CAAC;IACd;;;;;;OAMG;IACH,iBAAiB,EAAE,MAAM,CAAC;IAC1B,iBAAiB,EAAE,MAAM,CAAC;IAC1B;;;;;OAKG;IACH,mBAAmB,EAAE,MAAM,CAAC;IAC5B,mBAAmB,EAAE,MAAM,CAAC;IAC5B;;;;;OAKG;IACH,QAAQ,EAAE,MAAM,CAAC;IACjB,IAAI,EAAE,MAAM,CAAC;IACb;;;;OAIG;IACH,OAAO,EAAE,kBAAkB,CAAC;CAC7B,CAAC;AAEF,MAAM,MAAM,aAAa,GAAG;IAC1B,OAAO,EAAE,OAAO,CAAC;IACjB,YAAY,EAAE,OAAO,CAAC;IACtB;;;OAGG;IACH,QAAQ,EAAE,OAAO,CAAC;IAClB,QAAQ,EAAE,MAAM,GAAG,MAAM,CAAC;IAC1B;;;OAGG;IACH,QAAQ,EAAE,MAAM,CAAC;IACjB,YAAY,EAAE,MAAM,GAAG,MAAM,CAAC;IAC9B,YAAY,EAAE,MAAM,GAAG,MAAM,CAAC;IAC9B,YAAY,EAAE,MAAM,GAAG,MAAM,CAAC;IAC9B;;;OAGG;IACH,YAAY,EAAE,MAAM,GAAG,MAAM,CAAC;IAC9B,UAAU,EAAE,MAAM,CAAC;IACnB;;;;;;;OAOG;IACH,WAAW,EAAE,MAAM,CAAC;IACpB,mEAAmE;IACnE,WAAW,EAAE,eAAe,CAAC;IAC7B,WAAW,EAAE,MAAM,GAAG,MAAM,CAAC;IAC7B;;;;;OAKG;IACH,kBAAkB,EAAE,MAAM,CAAC;IAC3B,2DAA2D;IAC3D,eAAe,EAAE,mBAAmB,CAAC;IACrC;;;;OAIG;IACH,eAAe,EAAE,MAAM,CAAC;IACxB;;;;;;;OAOG;IACH,eAAe,EAAE,MAAM,CAAC;IACxB,iFAAiF;IACjF,SAAS,EAAE,OAAO,CAAC;IACnB,gBAAgB,EAAE,OAAO,CAAC;IAC1B,4EAA4E;IAC5E,SAAS,EAAE,kBAAkB,CAAC;IAC9B,sDAAsD;IACtD,YAAY,EAAE,kBAAkB,CAAC;IACjC;;;;;;;;OAQG;IACH,eAAe,EAAE,OAAO,CAAC;IACzB,WAAW,EAAE,OAAO,CAAC;IACrB;;;;;;;;;;OAUG;IACH,WAAW,EAAE,MAAM,CAAC;IACpB;;;;OAIG;IACH,QAAQ,EAAE,kBAAkB,CAAC;IAC7B,0EAA0E;IAC1E,UAAU,EAAE,MAAM,GAAG,MAAM,CAAC;IAC5B;;;;OAIG;IACH,SAAS,EAAE,MAAM,CAAC;IAClB,kFAAkF;IAClF,KAAK,EAAE,MAAM,CAAC;IACd;;;;;;OAMG;IACH,iBAAiB,EAAE,MAAM,GAAG,MAAM,CAAC;IACnC,iBAAiB,EAAE,MAAM,GAAG,MAAM,CAAC;IACnC;;;;;OAKG;IACH,mBAAmB,EAAE,MAAM,GAAG,MAAM,CAAC;IACrC,mBAAmB,EAAE,MAAM,GAAG,MAAM,CAAC;IACrC;;;;;OAKG;IACH,QAAQ,EAAE,MAAM,CAAC;IACjB,IAAI,EAAE,MAAM,CAAC;IACb;;;;OAIG;IACH,OAAO,EAAE,kBAAkB,CAAC;CAC7B,CAAC;AAEF,+DAA+D;AAC/D,wBAAgB,mBAAmB,IAAI,gBAAgB,CAAC,aAAa,CAAC,CA0CrE;AAED,2DAA2D;AAC3D,wBAAgB,mBAAmB,IAAI,gBAAgB,CAAC,SAAS,CAAC,CAuCjE;AAED,yDAAyD;AACzD,wBAAgB,iBAAiB,IAAI,cAAc,CAAC,aAAa,EAAE,SAAS,CAAC,CAE5E;AAED,wBAAgB,eAAe,CAAC,QAAQ,SAAS,MAAM,GAAG,MAAM,EAC9D,cAAc,EAAE,cAAc,CAAC,QAAQ,CAAC,GACvC,OAAO,CAAC,SAAS,EAAE,QAAQ,CAAC,CAAC;AAChC,wBAAgB,eAAe,CAAC,QAAQ,SAAS,MAAM,GAAG,MAAM,EAC9D,cAAc,EAAE,mBAAmB,CAAC,QAAQ,CAAC,GAC5C,YAAY,CAAC,SAAS,EAAE,QAAQ,CAAC,CAAC;AAUrC,wBAAsB,cAAc,CAAC,QAAQ,SAAS,MAAM,GAAG,MAAM,EACnE,GAAG,EAAE,UAAU,CAAC,OAAO,mBAAmB,CAAC,CAAC,CAAC,CAAC,EAC9C,OAAO,EAAE,OAAO,CAAC,QAAQ,CAAC,EAC1B,MAAM,CAAC,EAAE,kBAAkB,GAC1B,OAAO,CAAC,OAAO,CAAC,SAAS,EAAE,QAAQ,CAAC,CAAC,CAIvC;AAED,wBAAsB,mBAAmB,CAAC,QAAQ,SAAS,MAAM,GAAG,MAAM,EACxE,GAAG,EAAE,UAAU,CAAC,OAAO,mBAAmB,CAAC,CAAC,CAAC,CAAC,EAC9C,OAAO,EAAE,OAAO,CAAC,QAAQ,CAAC,EAC1B,MAAM,CAAC,EAAE,kBAAkB,GAC1B,OAAO,CAAC,YAAY,CAAC,SAAS,EAAE,QAAQ,CAAC,CAAC,CAG5C;AAED,wBAAsB,iBAAiB,CACrC,GAAG,EAAE,UAAU,CAAC,OAAO,oBAAoB,CAAC,CAAC,CAAC,CAAC,EAC/C,SAAS,EAAE,KAAK,CAAC,OAAO,CAAC,EACzB,MAAM,CAAC,EAAE,mBAAmB,GAC3B,OAAO,CAAC,OAAO,CAAC,SAAS,CAAC,EAAE,CAAC,CAI/B;AAED,wBAAsB,sBAAsB,CAC1C,GAAG,EAAE,UAAU,CAAC,OAAO,oBAAoB,CAAC,CAAC,CAAC,CAAC,EAC/C,SAAS,EAAE,KAAK,CAAC,OAAO,CAAC,EACzB,MAAM,CAAC,EAAE,mBAAmB,GAC3B,OAAO,CAAC,YAAY,CAAC,SAAS,CAAC,EAAE,CAAC,CAGpC;AAED,wBAAgB,gBAAgB,IAAI,MAAM,CAEzC"}