@jinn-network/client 0.1.8 → 0.1.9-canary.02befda9

package/dist/types/task-document.d.ts

@@ -5,7 +5,7 @@
  * router compatibility surface. `solverType` is the protocol join key; `spec`
  * is the SolverType-specific payload.
  */
-import { z } from 'zod';
+import { z } from 'zod/v3';
 export declare const TaskClaimPolicySchema: z.ZodObject<{
     mode: z.ZodDefault<z.ZodEnum<["exclusive", "parallel"]>>;
     maxClaims: z.ZodNumber;
@@ -25,6 +25,14 @@ export declare const TaskClaimPolicySchema: z.ZodObject<{
      * network where verdict slots may be squatted.
      */
     requiredVerdicts: z.ZodOptional<z.ZodNumber>;
+    /**
+     * On-chain `TaskPolicy.allowSolverSelfEvaluation`. Optional; the adapter
+     * defaults it to `false` → the coordinator rejects a verdict whose evaluator
+     * is the attempt's solver (the independent-evaluation invariant). A testnet
+     * SolverNet sets it `true` so a single operator can solve + self-evaluate +
+     * close the loop solo (dogfooding). Leave unset/false on mainnet.
+     */
+    allowSolverSelfEvaluation: z.ZodOptional<z.ZodBoolean>;
 }, "passthrough", z.ZodTypeAny, z.objectOutputType<{
     mode: z.ZodDefault<z.ZodEnum<["exclusive", "parallel"]>>;
     maxClaims: z.ZodNumber;
@@ -44,6 +52,14 @@ export declare const TaskClaimPolicySchema: z.ZodObject<{
      * network where verdict slots may be squatted.
      */
     requiredVerdicts: z.ZodOptional<z.ZodNumber>;
+    /**
+     * On-chain `TaskPolicy.allowSolverSelfEvaluation`. Optional; the adapter
+     * defaults it to `false` → the coordinator rejects a verdict whose evaluator
+     * is the attempt's solver (the independent-evaluation invariant). A testnet
+     * SolverNet sets it `true` so a single operator can solve + self-evaluate +
+     * close the loop solo (dogfooding). Leave unset/false on mainnet.
+     */
+    allowSolverSelfEvaluation: z.ZodOptional<z.ZodBoolean>;
 }, z.ZodTypeAny, "passthrough">, z.objectInputType<{
     mode: z.ZodDefault<z.ZodEnum<["exclusive", "parallel"]>>;
     maxClaims: z.ZodNumber;
@@ -63,6 +79,14 @@ export declare const TaskClaimPolicySchema: z.ZodObject<{
      * network where verdict slots may be squatted.
      */
     requiredVerdicts: z.ZodOptional<z.ZodNumber>;
+    /**
+     * On-chain `TaskPolicy.allowSolverSelfEvaluation`. Optional; the adapter
+     * defaults it to `false` → the coordinator rejects a verdict whose evaluator
+     * is the attempt's solver (the independent-evaluation invariant). A testnet
+     * SolverNet sets it `true` so a single operator can solve + self-evaluate +
+     * close the loop solo (dogfooding). Leave unset/false on mainnet.
+     */
+    allowSolverSelfEvaluation: z.ZodOptional<z.ZodBoolean>;
 }, z.ZodTypeAny, "passthrough">>;
 export type TaskClaimPolicy = z.infer<typeof TaskClaimPolicySchema>;
 export declare const TaskV1Schema: z.ZodEffects<z.ZodEffects<z.ZodObject<{
@@ -121,6 +145,14 @@ export declare const TaskV1Schema: z.ZodEffects<z.ZodEffects<z.ZodObject<{
          * network where verdict slots may be squatted.
          */
         requiredVerdicts: z.ZodOptional<z.ZodNumber>;
+        /**
+         * On-chain `TaskPolicy.allowSolverSelfEvaluation`. Optional; the adapter
+         * defaults it to `false` → the coordinator rejects a verdict whose evaluator
+         * is the attempt's solver (the independent-evaluation invariant). A testnet
+         * SolverNet sets it `true` so a single operator can solve + self-evaluate +
+         * close the loop solo (dogfooding). Leave unset/false on mainnet.
+         */
+        allowSolverSelfEvaluation: z.ZodOptional<z.ZodBoolean>;
     }, "passthrough", z.ZodTypeAny, z.objectOutputType<{
         mode: z.ZodDefault<z.ZodEnum<["exclusive", "parallel"]>>;
         maxClaims: z.ZodNumber;
@@ -140,6 +172,14 @@ export declare const TaskV1Schema: z.ZodEffects<z.ZodEffects<z.ZodObject<{
          * network where verdict slots may be squatted.
          */
         requiredVerdicts: z.ZodOptional<z.ZodNumber>;
+        /**
+         * On-chain `TaskPolicy.allowSolverSelfEvaluation`. Optional; the adapter
+         * defaults it to `false` → the coordinator rejects a verdict whose evaluator
+         * is the attempt's solver (the independent-evaluation invariant). A testnet
+         * SolverNet sets it `true` so a single operator can solve + self-evaluate +
+         * close the loop solo (dogfooding). Leave unset/false on mainnet.
+         */
+        allowSolverSelfEvaluation: z.ZodOptional<z.ZodBoolean>;
     }, z.ZodTypeAny, "passthrough">, z.objectInputType<{
         mode: z.ZodDefault<z.ZodEnum<["exclusive", "parallel"]>>;
         maxClaims: z.ZodNumber;
@@ -159,6 +199,14 @@ export declare const TaskV1Schema: z.ZodEffects<z.ZodEffects<z.ZodObject<{
          * network where verdict slots may be squatted.
          */
         requiredVerdicts: z.ZodOptional<z.ZodNumber>;
+        /**
+         * On-chain `TaskPolicy.allowSolverSelfEvaluation`. Optional; the adapter
+         * defaults it to `false` → the coordinator rejects a verdict whose evaluator
+         * is the attempt's solver (the independent-evaluation invariant). A testnet
+         * SolverNet sets it `true` so a single operator can solve + self-evaluate +
+         * close the loop solo (dogfooding). Leave unset/false on mainnet.
+         */
+        allowSolverSelfEvaluation: z.ZodOptional<z.ZodBoolean>;
     }, z.ZodTypeAny, "passthrough">>;
     creator: z.ZodObject<{
         safeAddress: z.ZodString;
@@ -227,6 +275,14 @@ export declare const TaskV1Schema: z.ZodEffects<z.ZodEffects<z.ZodObject<{
          * network where verdict slots may be squatted.
          */
         requiredVerdicts: z.ZodOptional<z.ZodNumber>;
+        /**
+         * On-chain `TaskPolicy.allowSolverSelfEvaluation`. Optional; the adapter
+         * defaults it to `false` → the coordinator rejects a verdict whose evaluator
+         * is the attempt's solver (the independent-evaluation invariant). A testnet
+         * SolverNet sets it `true` so a single operator can solve + self-evaluate +
+         * close the loop solo (dogfooding). Leave unset/false on mainnet.
+         */
+        allowSolverSelfEvaluation: z.ZodOptional<z.ZodBoolean>;
     }, "passthrough", z.ZodTypeAny, z.objectOutputType<{
         mode: z.ZodDefault<z.ZodEnum<["exclusive", "parallel"]>>;
         maxClaims: z.ZodNumber;
@@ -246,6 +302,14 @@ export declare const TaskV1Schema: z.ZodEffects<z.ZodEffects<z.ZodObject<{
          * network where verdict slots may be squatted.
          */
         requiredVerdicts: z.ZodOptional<z.ZodNumber>;
+        /**
+         * On-chain `TaskPolicy.allowSolverSelfEvaluation`. Optional; the adapter
+         * defaults it to `false` → the coordinator rejects a verdict whose evaluator
+         * is the attempt's solver (the independent-evaluation invariant). A testnet
+         * SolverNet sets it `true` so a single operator can solve + self-evaluate +
+         * close the loop solo (dogfooding). Leave unset/false on mainnet.
+         */
+        allowSolverSelfEvaluation: z.ZodOptional<z.ZodBoolean>;
     }, z.ZodTypeAny, "passthrough">, z.objectInputType<{
         mode: z.ZodDefault<z.ZodEnum<["exclusive", "parallel"]>>;
         maxClaims: z.ZodNumber;
@@ -265,6 +329,14 @@ export declare const TaskV1Schema: z.ZodEffects<z.ZodEffects<z.ZodObject<{
          * network where verdict slots may be squatted.
          */
         requiredVerdicts: z.ZodOptional<z.ZodNumber>;
+        /**
+         * On-chain `TaskPolicy.allowSolverSelfEvaluation`. Optional; the adapter
+         * defaults it to `false` → the coordinator rejects a verdict whose evaluator
+         * is the attempt's solver (the independent-evaluation invariant). A testnet
+         * SolverNet sets it `true` so a single operator can solve + self-evaluate +
+         * close the loop solo (dogfooding). Leave unset/false on mainnet.
+         */
+        allowSolverSelfEvaluation: z.ZodOptional<z.ZodBoolean>;
     }, z.ZodTypeAny, "passthrough">>;
     creator: z.ZodObject<{
         safeAddress: z.ZodString;
@@ -333,6 +405,14 @@ export declare const TaskV1Schema: z.ZodEffects<z.ZodEffects<z.ZodObject<{
          * network where verdict slots may be squatted.
          */
         requiredVerdicts: z.ZodOptional<z.ZodNumber>;
+        /**
+         * On-chain `TaskPolicy.allowSolverSelfEvaluation`. Optional; the adapter
+         * defaults it to `false` → the coordinator rejects a verdict whose evaluator
+         * is the attempt's solver (the independent-evaluation invariant). A testnet
+         * SolverNet sets it `true` so a single operator can solve + self-evaluate +
+         * close the loop solo (dogfooding). Leave unset/false on mainnet.
+         */
+        allowSolverSelfEvaluation: z.ZodOptional<z.ZodBoolean>;
     }, "passthrough", z.ZodTypeAny, z.objectOutputType<{
         mode: z.ZodDefault<z.ZodEnum<["exclusive", "parallel"]>>;
         maxClaims: z.ZodNumber;
@@ -352,6 +432,14 @@ export declare const TaskV1Schema: z.ZodEffects<z.ZodEffects<z.ZodObject<{
          * network where verdict slots may be squatted.
          */
         requiredVerdicts: z.ZodOptional<z.ZodNumber>;
+        /**
+         * On-chain `TaskPolicy.allowSolverSelfEvaluation`. Optional; the adapter
+         * defaults it to `false` → the coordinator rejects a verdict whose evaluator
+         * is the attempt's solver (the independent-evaluation invariant). A testnet
+         * SolverNet sets it `true` so a single operator can solve + self-evaluate +
+         * close the loop solo (dogfooding). Leave unset/false on mainnet.
+         */
+        allowSolverSelfEvaluation: z.ZodOptional<z.ZodBoolean>;
     }, z.ZodTypeAny, "passthrough">, z.objectInputType<{
         mode: z.ZodDefault<z.ZodEnum<["exclusive", "parallel"]>>;
         maxClaims: z.ZodNumber;
@@ -371,6 +459,14 @@ export declare const TaskV1Schema: z.ZodEffects<z.ZodEffects<z.ZodObject<{
          * network where verdict slots may be squatted.
          */
         requiredVerdicts: z.ZodOptional<z.ZodNumber>;
+        /**
+         * On-chain `TaskPolicy.allowSolverSelfEvaluation`. Optional; the adapter
+         * defaults it to `false` → the coordinator rejects a verdict whose evaluator
+         * is the attempt's solver (the independent-evaluation invariant). A testnet
+         * SolverNet sets it `true` so a single operator can solve + self-evaluate +
+         * close the loop solo (dogfooding). Leave unset/false on mainnet.
+         */
+        allowSolverSelfEvaluation: z.ZodOptional<z.ZodBoolean>;
     }, z.ZodTypeAny, "passthrough">>;
     creator: z.ZodObject<{
         safeAddress: z.ZodString;
@@ -439,6 +535,14 @@ export declare const TaskV1Schema: z.ZodEffects<z.ZodEffects<z.ZodObject<{
          * network where verdict slots may be squatted.
          */
         requiredVerdicts: z.ZodOptional<z.ZodNumber>;
+        /**
+         * On-chain `TaskPolicy.allowSolverSelfEvaluation`. Optional; the adapter
+         * defaults it to `false` → the coordinator rejects a verdict whose evaluator
+         * is the attempt's solver (the independent-evaluation invariant). A testnet
+         * SolverNet sets it `true` so a single operator can solve + self-evaluate +
+         * close the loop solo (dogfooding). Leave unset/false on mainnet.
+         */
+        allowSolverSelfEvaluation: z.ZodOptional<z.ZodBoolean>;
     }, "passthrough", z.ZodTypeAny, z.objectOutputType<{
         mode: z.ZodDefault<z.ZodEnum<["exclusive", "parallel"]>>;
         maxClaims: z.ZodNumber;
@@ -458,6 +562,14 @@ export declare const TaskV1Schema: z.ZodEffects<z.ZodEffects<z.ZodObject<{
          * network where verdict slots may be squatted.
          */
         requiredVerdicts: z.ZodOptional<z.ZodNumber>;
+        /**
+         * On-chain `TaskPolicy.allowSolverSelfEvaluation`. Optional; the adapter
+         * defaults it to `false` → the coordinator rejects a verdict whose evaluator
+         * is the attempt's solver (the independent-evaluation invariant). A testnet
+         * SolverNet sets it `true` so a single operator can solve + self-evaluate +
+         * close the loop solo (dogfooding). Leave unset/false on mainnet.
+         */
+        allowSolverSelfEvaluation: z.ZodOptional<z.ZodBoolean>;
     }, z.ZodTypeAny, "passthrough">, z.objectInputType<{
         mode: z.ZodDefault<z.ZodEnum<["exclusive", "parallel"]>>;
         maxClaims: z.ZodNumber;
@@ -477,6 +589,14 @@ export declare const TaskV1Schema: z.ZodEffects<z.ZodEffects<z.ZodObject<{
          * network where verdict slots may be squatted.
          */
         requiredVerdicts: z.ZodOptional<z.ZodNumber>;
+        /**
+         * On-chain `TaskPolicy.allowSolverSelfEvaluation`. Optional; the adapter
+         * defaults it to `false` → the coordinator rejects a verdict whose evaluator
+         * is the attempt's solver (the independent-evaluation invariant). A testnet
+         * SolverNet sets it `true` so a single operator can solve + self-evaluate +
+         * close the loop solo (dogfooding). Leave unset/false on mainnet.
+         */
+        allowSolverSelfEvaluation: z.ZodOptional<z.ZodBoolean>;
     }, z.ZodTypeAny, "passthrough">>;
     creator: z.ZodObject<{
         safeAddress: z.ZodString;
@@ -545,6 +665,14 @@ export declare const TaskV1Schema: z.ZodEffects<z.ZodEffects<z.ZodObject<{
          * network where verdict slots may be squatted.
          */
         requiredVerdicts: z.ZodOptional<z.ZodNumber>;
+        /**
+         * On-chain `TaskPolicy.allowSolverSelfEvaluation`. Optional; the adapter
+         * defaults it to `false` → the coordinator rejects a verdict whose evaluator
+         * is the attempt's solver (the independent-evaluation invariant). A testnet
+         * SolverNet sets it `true` so a single operator can solve + self-evaluate +
+         * close the loop solo (dogfooding). Leave unset/false on mainnet.
+         */
+        allowSolverSelfEvaluation: z.ZodOptional<z.ZodBoolean>;
     }, "passthrough", z.ZodTypeAny, z.objectOutputType<{
         mode: z.ZodDefault<z.ZodEnum<["exclusive", "parallel"]>>;
         maxClaims: z.ZodNumber;
@@ -564,6 +692,14 @@ export declare const TaskV1Schema: z.ZodEffects<z.ZodEffects<z.ZodObject<{
          * network where verdict slots may be squatted.
          */
         requiredVerdicts: z.ZodOptional<z.ZodNumber>;
+        /**
+         * On-chain `TaskPolicy.allowSolverSelfEvaluation`. Optional; the adapter
+         * defaults it to `false` → the coordinator rejects a verdict whose evaluator
+         * is the attempt's solver (the independent-evaluation invariant). A testnet
+         * SolverNet sets it `true` so a single operator can solve + self-evaluate +
+         * close the loop solo (dogfooding). Leave unset/false on mainnet.
+         */
+        allowSolverSelfEvaluation: z.ZodOptional<z.ZodBoolean>;
     }, z.ZodTypeAny, "passthrough">, z.objectInputType<{
         mode: z.ZodDefault<z.ZodEnum<["exclusive", "parallel"]>>;
         maxClaims: z.ZodNumber;
@@ -583,6 +719,14 @@ export declare const TaskV1Schema: z.ZodEffects<z.ZodEffects<z.ZodObject<{
          * network where verdict slots may be squatted.
          */
         requiredVerdicts: z.ZodOptional<z.ZodNumber>;
+        /**
+         * On-chain `TaskPolicy.allowSolverSelfEvaluation`. Optional; the adapter
+         * defaults it to `false` → the coordinator rejects a verdict whose evaluator
+         * is the attempt's solver (the independent-evaluation invariant). A testnet
+         * SolverNet sets it `true` so a single operator can solve + self-evaluate +
+         * close the loop solo (dogfooding). Leave unset/false on mainnet.
+         */
+        allowSolverSelfEvaluation: z.ZodOptional<z.ZodBoolean>;
     }, z.ZodTypeAny, "passthrough">>;
     creator: z.ZodObject<{
         safeAddress: z.ZodString;
@@ -620,6 +764,7 @@ export declare const TaskV1Schema: z.ZodEffects<z.ZodEffects<z.ZodObject<{
         submissionDeadlineTs?: number | undefined;
         policyHook?: string | undefined;
         requiredVerdicts?: number | undefined;
+        allowSolverSelfEvaluation?: boolean | undefined;
     } & {
         [k: string]: unknown;
     };
@@ -684,6 +829,14 @@ export declare const TaskV1Schema: z.ZodEffects<z.ZodEffects<z.ZodObject<{
          * network where verdict slots may be squatted.
          */
         requiredVerdicts: z.ZodOptional<z.ZodNumber>;
+        /**
+         * On-chain `TaskPolicy.allowSolverSelfEvaluation`. Optional; the adapter
+         * defaults it to `false` → the coordinator rejects a verdict whose evaluator
+         * is the attempt's solver (the independent-evaluation invariant). A testnet
+         * SolverNet sets it `true` so a single operator can solve + self-evaluate +
+         * close the loop solo (dogfooding). Leave unset/false on mainnet.
+         */
+        allowSolverSelfEvaluation: z.ZodOptional<z.ZodBoolean>;
     }, "passthrough", z.ZodTypeAny, z.objectOutputType<{
         mode: z.ZodDefault<z.ZodEnum<["exclusive", "parallel"]>>;
         maxClaims: z.ZodNumber;
@@ -703,6 +856,14 @@ export declare const TaskV1Schema: z.ZodEffects<z.ZodEffects<z.ZodObject<{
          * network where verdict slots may be squatted.
          */
         requiredVerdicts: z.ZodOptional<z.ZodNumber>;
+        /**
+         * On-chain `TaskPolicy.allowSolverSelfEvaluation`. Optional; the adapter
+         * defaults it to `false` → the coordinator rejects a verdict whose evaluator
+         * is the attempt's solver (the independent-evaluation invariant). A testnet
+         * SolverNet sets it `true` so a single operator can solve + self-evaluate +
+         * close the loop solo (dogfooding). Leave unset/false on mainnet.
+         */
+        allowSolverSelfEvaluation: z.ZodOptional<z.ZodBoolean>;
     }, z.ZodTypeAny, "passthrough">, z.objectInputType<{
         mode: z.ZodDefault<z.ZodEnum<["exclusive", "parallel"]>>;
         maxClaims: z.ZodNumber;
@@ -722,6 +883,14 @@ export declare const TaskV1Schema: z.ZodEffects<z.ZodEffects<z.ZodObject<{
          * network where verdict slots may be squatted.
          */
         requiredVerdicts: z.ZodOptional<z.ZodNumber>;
+        /**
+         * On-chain `TaskPolicy.allowSolverSelfEvaluation`. Optional; the adapter
+         * defaults it to `false` → the coordinator rejects a verdict whose evaluator
+         * is the attempt's solver (the independent-evaluation invariant). A testnet
+         * SolverNet sets it `true` so a single operator can solve + self-evaluate +
+         * close the loop solo (dogfooding). Leave unset/false on mainnet.
+         */
+        allowSolverSelfEvaluation: z.ZodOptional<z.ZodBoolean>;
     }, z.ZodTypeAny, "passthrough">>;
     creator: z.ZodObject<{
         safeAddress: z.ZodString;
@@ -808,6 +977,14 @@ export declare const SignedTaskV1Schema: z.ZodEffects<z.ZodEffects<z.ZodObject<{
          * network where verdict slots may be squatted.
          */
         requiredVerdicts: z.ZodOptional<z.ZodNumber>;
+        /**
+         * On-chain `TaskPolicy.allowSolverSelfEvaluation`. Optional; the adapter
+         * defaults it to `false` → the coordinator rejects a verdict whose evaluator
+         * is the attempt's solver (the independent-evaluation invariant). A testnet
+         * SolverNet sets it `true` so a single operator can solve + self-evaluate +
+         * close the loop solo (dogfooding). Leave unset/false on mainnet.
+         */
+        allowSolverSelfEvaluation: z.ZodOptional<z.ZodBoolean>;
     }, "passthrough", z.ZodTypeAny, z.objectOutputType<{
         mode: z.ZodDefault<z.ZodEnum<["exclusive", "parallel"]>>;
         maxClaims: z.ZodNumber;
@@ -827,6 +1004,14 @@ export declare const SignedTaskV1Schema: z.ZodEffects<z.ZodEffects<z.ZodObject<{
          * network where verdict slots may be squatted.
          */
         requiredVerdicts: z.ZodOptional<z.ZodNumber>;
+        /**
+         * On-chain `TaskPolicy.allowSolverSelfEvaluation`. Optional; the adapter
+         * defaults it to `false` → the coordinator rejects a verdict whose evaluator
+         * is the attempt's solver (the independent-evaluation invariant). A testnet
+         * SolverNet sets it `true` so a single operator can solve + self-evaluate +
+         * close the loop solo (dogfooding). Leave unset/false on mainnet.
+         */
+        allowSolverSelfEvaluation: z.ZodOptional<z.ZodBoolean>;
     }, z.ZodTypeAny, "passthrough">, z.objectInputType<{
         mode: z.ZodDefault<z.ZodEnum<["exclusive", "parallel"]>>;
         maxClaims: z.ZodNumber;
@@ -846,6 +1031,14 @@ export declare const SignedTaskV1Schema: z.ZodEffects<z.ZodEffects<z.ZodObject<{
          * network where verdict slots may be squatted.
          */
         requiredVerdicts: z.ZodOptional<z.ZodNumber>;
+        /**
+         * On-chain `TaskPolicy.allowSolverSelfEvaluation`. Optional; the adapter
+         * defaults it to `false` → the coordinator rejects a verdict whose evaluator
+         * is the attempt's solver (the independent-evaluation invariant). A testnet
+         * SolverNet sets it `true` so a single operator can solve + self-evaluate +
+         * close the loop solo (dogfooding). Leave unset/false on mainnet.
+         */
+        allowSolverSelfEvaluation: z.ZodOptional<z.ZodBoolean>;
     }, z.ZodTypeAny, "passthrough">>;
     creator: z.ZodObject<{
         safeAddress: z.ZodString;
@@ -930,6 +1123,14 @@ export declare const SignedTaskV1Schema: z.ZodEffects<z.ZodEffects<z.ZodObject<{
          * network where verdict slots may be squatted.
          */
         requiredVerdicts: z.ZodOptional<z.ZodNumber>;
+        /**
+         * On-chain `TaskPolicy.allowSolverSelfEvaluation`. Optional; the adapter
+         * defaults it to `false` → the coordinator rejects a verdict whose evaluator
+         * is the attempt's solver (the independent-evaluation invariant). A testnet
+         * SolverNet sets it `true` so a single operator can solve + self-evaluate +
+         * close the loop solo (dogfooding). Leave unset/false on mainnet.
+         */
+        allowSolverSelfEvaluation: z.ZodOptional<z.ZodBoolean>;
     }, "passthrough", z.ZodTypeAny, z.objectOutputType<{
         mode: z.ZodDefault<z.ZodEnum<["exclusive", "parallel"]>>;
         maxClaims: z.ZodNumber;
@@ -949,6 +1150,14 @@ export declare const SignedTaskV1Schema: z.ZodEffects<z.ZodEffects<z.ZodObject<{
          * network where verdict slots may be squatted.
          */
         requiredVerdicts: z.ZodOptional<z.ZodNumber>;
+        /**
+         * On-chain `TaskPolicy.allowSolverSelfEvaluation`. Optional; the adapter
+         * defaults it to `false` → the coordinator rejects a verdict whose evaluator
+         * is the attempt's solver (the independent-evaluation invariant). A testnet
+         * SolverNet sets it `true` so a single operator can solve + self-evaluate +
+         * close the loop solo (dogfooding). Leave unset/false on mainnet.
+         */
+        allowSolverSelfEvaluation: z.ZodOptional<z.ZodBoolean>;
     }, z.ZodTypeAny, "passthrough">, z.objectInputType<{
         mode: z.ZodDefault<z.ZodEnum<["exclusive", "parallel"]>>;
         maxClaims: z.ZodNumber;
@@ -968,6 +1177,14 @@ export declare const SignedTaskV1Schema: z.ZodEffects<z.ZodEffects<z.ZodObject<{
          * network where verdict slots may be squatted.
          */
         requiredVerdicts: z.ZodOptional<z.ZodNumber>;
+        /**
+         * On-chain `TaskPolicy.allowSolverSelfEvaluation`. Optional; the adapter
+         * defaults it to `false` → the coordinator rejects a verdict whose evaluator
+         * is the attempt's solver (the independent-evaluation invariant). A testnet
+         * SolverNet sets it `true` so a single operator can solve + self-evaluate +
+         * close the loop solo (dogfooding). Leave unset/false on mainnet.
+         */
+        allowSolverSelfEvaluation: z.ZodOptional<z.ZodBoolean>;
     }, z.ZodTypeAny, "passthrough">>;
     creator: z.ZodObject<{
         safeAddress: z.ZodString;
@@ -1052,6 +1269,14 @@ export declare const SignedTaskV1Schema: z.ZodEffects<z.ZodEffects<z.ZodObject<{
          * network where verdict slots may be squatted.
          */
         requiredVerdicts: z.ZodOptional<z.ZodNumber>;
+        /**
+         * On-chain `TaskPolicy.allowSolverSelfEvaluation`. Optional; the adapter
+         * defaults it to `false` → the coordinator rejects a verdict whose evaluator
+         * is the attempt's solver (the independent-evaluation invariant). A testnet
+         * SolverNet sets it `true` so a single operator can solve + self-evaluate +
+         * close the loop solo (dogfooding). Leave unset/false on mainnet.
+         */
+        allowSolverSelfEvaluation: z.ZodOptional<z.ZodBoolean>;
     }, "passthrough", z.ZodTypeAny, z.objectOutputType<{
         mode: z.ZodDefault<z.ZodEnum<["exclusive", "parallel"]>>;
         maxClaims: z.ZodNumber;
@@ -1071,6 +1296,14 @@ export declare const SignedTaskV1Schema: z.ZodEffects<z.ZodEffects<z.ZodObject<{
          * network where verdict slots may be squatted.
          */
         requiredVerdicts: z.ZodOptional<z.ZodNumber>;
+        /**
+         * On-chain `TaskPolicy.allowSolverSelfEvaluation`. Optional; the adapter
+         * defaults it to `false` → the coordinator rejects a verdict whose evaluator
+         * is the attempt's solver (the independent-evaluation invariant). A testnet
+         * SolverNet sets it `true` so a single operator can solve + self-evaluate +
+         * close the loop solo (dogfooding). Leave unset/false on mainnet.
+         */
+        allowSolverSelfEvaluation: z.ZodOptional<z.ZodBoolean>;
     }, z.ZodTypeAny, "passthrough">, z.objectInputType<{
         mode: z.ZodDefault<z.ZodEnum<["exclusive", "parallel"]>>;
         maxClaims: z.ZodNumber;
@@ -1090,6 +1323,14 @@ export declare const SignedTaskV1Schema: z.ZodEffects<z.ZodEffects<z.ZodObject<{
          * network where verdict slots may be squatted.
          */
         requiredVerdicts: z.ZodOptional<z.ZodNumber>;
+        /**
+         * On-chain `TaskPolicy.allowSolverSelfEvaluation`. Optional; the adapter
+         * defaults it to `false` → the coordinator rejects a verdict whose evaluator
+         * is the attempt's solver (the independent-evaluation invariant). A testnet
+         * SolverNet sets it `true` so a single operator can solve + self-evaluate +
+         * close the loop solo (dogfooding). Leave unset/false on mainnet.
+         */
+        allowSolverSelfEvaluation: z.ZodOptional<z.ZodBoolean>;
     }, z.ZodTypeAny, "passthrough">>;
     creator: z.ZodObject<{
         safeAddress: z.ZodString;
@@ -1174,6 +1415,14 @@ export declare const SignedTaskV1Schema: z.ZodEffects<z.ZodEffects<z.ZodObject<{
          * network where verdict slots may be squatted.
          */
         requiredVerdicts: z.ZodOptional<z.ZodNumber>;
+        /**
+         * On-chain `TaskPolicy.allowSolverSelfEvaluation`. Optional; the adapter
+         * defaults it to `false` → the coordinator rejects a verdict whose evaluator
+         * is the attempt's solver (the independent-evaluation invariant). A testnet
+         * SolverNet sets it `true` so a single operator can solve + self-evaluate +
+         * close the loop solo (dogfooding). Leave unset/false on mainnet.
+         */
+        allowSolverSelfEvaluation: z.ZodOptional<z.ZodBoolean>;
     }, "passthrough", z.ZodTypeAny, z.objectOutputType<{
         mode: z.ZodDefault<z.ZodEnum<["exclusive", "parallel"]>>;
         maxClaims: z.ZodNumber;
@@ -1193,6 +1442,14 @@ export declare const SignedTaskV1Schema: z.ZodEffects<z.ZodEffects<z.ZodObject<{
          * network where verdict slots may be squatted.
          */
         requiredVerdicts: z.ZodOptional<z.ZodNumber>;
+        /**
+         * On-chain `TaskPolicy.allowSolverSelfEvaluation`. Optional; the adapter
+         * defaults it to `false` → the coordinator rejects a verdict whose evaluator
+         * is the attempt's solver (the independent-evaluation invariant). A testnet
+         * SolverNet sets it `true` so a single operator can solve + self-evaluate +
+         * close the loop solo (dogfooding). Leave unset/false on mainnet.
+         */
+        allowSolverSelfEvaluation: z.ZodOptional<z.ZodBoolean>;
     }, z.ZodTypeAny, "passthrough">, z.objectInputType<{
         mode: z.ZodDefault<z.ZodEnum<["exclusive", "parallel"]>>;
         maxClaims: z.ZodNumber;
@@ -1212,6 +1469,14 @@ export declare const SignedTaskV1Schema: z.ZodEffects<z.ZodEffects<z.ZodObject<{
          * network where verdict slots may be squatted.
          */
         requiredVerdicts: z.ZodOptional<z.ZodNumber>;
+        /**
+         * On-chain `TaskPolicy.allowSolverSelfEvaluation`. Optional; the adapter
+         * defaults it to `false` → the coordinator rejects a verdict whose evaluator
+         * is the attempt's solver (the independent-evaluation invariant). A testnet
+         * SolverNet sets it `true` so a single operator can solve + self-evaluate +
+         * close the loop solo (dogfooding). Leave unset/false on mainnet.
+         */
+        allowSolverSelfEvaluation: z.ZodOptional<z.ZodBoolean>;
     }, z.ZodTypeAny, "passthrough">>;
     creator: z.ZodObject<{
         safeAddress: z.ZodString;
@@ -1296,6 +1561,14 @@ export declare const SignedTaskV1Schema: z.ZodEffects<z.ZodEffects<z.ZodObject<{
          * network where verdict slots may be squatted.
          */
         requiredVerdicts: z.ZodOptional<z.ZodNumber>;
+        /**
+         * On-chain `TaskPolicy.allowSolverSelfEvaluation`. Optional; the adapter
+         * defaults it to `false` → the coordinator rejects a verdict whose evaluator
+         * is the attempt's solver (the independent-evaluation invariant). A testnet
+         * SolverNet sets it `true` so a single operator can solve + self-evaluate +
+         * close the loop solo (dogfooding). Leave unset/false on mainnet.
+         */
+        allowSolverSelfEvaluation: z.ZodOptional<z.ZodBoolean>;
     }, "passthrough", z.ZodTypeAny, z.objectOutputType<{
         mode: z.ZodDefault<z.ZodEnum<["exclusive", "parallel"]>>;
         maxClaims: z.ZodNumber;
@@ -1315,6 +1588,14 @@ export declare const SignedTaskV1Schema: z.ZodEffects<z.ZodEffects<z.ZodObject<{
          * network where verdict slots may be squatted.
          */
         requiredVerdicts: z.ZodOptional<z.ZodNumber>;
+        /**
+         * On-chain `TaskPolicy.allowSolverSelfEvaluation`. Optional; the adapter
+         * defaults it to `false` → the coordinator rejects a verdict whose evaluator
+         * is the attempt's solver (the independent-evaluation invariant). A testnet
+         * SolverNet sets it `true` so a single operator can solve + self-evaluate +
+         * close the loop solo (dogfooding). Leave unset/false on mainnet.
+         */
+        allowSolverSelfEvaluation: z.ZodOptional<z.ZodBoolean>;
     }, z.ZodTypeAny, "passthrough">, z.objectInputType<{
         mode: z.ZodDefault<z.ZodEnum<["exclusive", "parallel"]>>;
         maxClaims: z.ZodNumber;
@@ -1334,6 +1615,14 @@ export declare const SignedTaskV1Schema: z.ZodEffects<z.ZodEffects<z.ZodObject<{
          * network where verdict slots may be squatted.
          */
         requiredVerdicts: z.ZodOptional<z.ZodNumber>;
+        /**
+         * On-chain `TaskPolicy.allowSolverSelfEvaluation`. Optional; the adapter
+         * defaults it to `false` → the coordinator rejects a verdict whose evaluator
+         * is the attempt's solver (the independent-evaluation invariant). A testnet
+         * SolverNet sets it `true` so a single operator can solve + self-evaluate +
+         * close the loop solo (dogfooding). Leave unset/false on mainnet.
+         */
+        allowSolverSelfEvaluation: z.ZodOptional<z.ZodBoolean>;
     }, z.ZodTypeAny, "passthrough">>;
     creator: z.ZodObject<{
         safeAddress: z.ZodString;
@@ -1377,6 +1666,7 @@ export declare const SignedTaskV1Schema: z.ZodEffects<z.ZodEffects<z.ZodObject<{
         submissionDeadlineTs?: number | undefined;
         policyHook?: string | undefined;
         requiredVerdicts?: number | undefined;
+        allowSolverSelfEvaluation?: boolean | undefined;
     } & {
         [k: string]: unknown;
     };
@@ -1457,6 +1747,14 @@ export declare const SignedTaskV1Schema: z.ZodEffects<z.ZodEffects<z.ZodObject<{
          * network where verdict slots may be squatted.
          */
         requiredVerdicts: z.ZodOptional<z.ZodNumber>;
+        /**
+         * On-chain `TaskPolicy.allowSolverSelfEvaluation`. Optional; the adapter
+         * defaults it to `false` → the coordinator rejects a verdict whose evaluator
+         * is the attempt's solver (the independent-evaluation invariant). A testnet
+         * SolverNet sets it `true` so a single operator can solve + self-evaluate +
+         * close the loop solo (dogfooding). Leave unset/false on mainnet.
+         */
+        allowSolverSelfEvaluation: z.ZodOptional<z.ZodBoolean>;
     }, "passthrough", z.ZodTypeAny, z.objectOutputType<{
         mode: z.ZodDefault<z.ZodEnum<["exclusive", "parallel"]>>;
         maxClaims: z.ZodNumber;
@@ -1476,6 +1774,14 @@ export declare const SignedTaskV1Schema: z.ZodEffects<z.ZodEffects<z.ZodObject<{
          * network where verdict slots may be squatted.
          */
         requiredVerdicts: z.ZodOptional<z.ZodNumber>;
+        /**
+         * On-chain `TaskPolicy.allowSolverSelfEvaluation`. Optional; the adapter
+         * defaults it to `false` → the coordinator rejects a verdict whose evaluator
+         * is the attempt's solver (the independent-evaluation invariant). A testnet
+         * SolverNet sets it `true` so a single operator can solve + self-evaluate +
+         * close the loop solo (dogfooding). Leave unset/false on mainnet.
+         */
+        allowSolverSelfEvaluation: z.ZodOptional<z.ZodBoolean>;
     }, z.ZodTypeAny, "passthrough">, z.objectInputType<{
         mode: z.ZodDefault<z.ZodEnum<["exclusive", "parallel"]>>;
         maxClaims: z.ZodNumber;
@@ -1495,6 +1801,14 @@ export declare const SignedTaskV1Schema: z.ZodEffects<z.ZodEffects<z.ZodObject<{
          * network where verdict slots may be squatted.
          */
         requiredVerdicts: z.ZodOptional<z.ZodNumber>;
+        /**
+         * On-chain `TaskPolicy.allowSolverSelfEvaluation`. Optional; the adapter
+         * defaults it to `false` → the coordinator rejects a verdict whose evaluator
+         * is the attempt's solver (the independent-evaluation invariant). A testnet
+         * SolverNet sets it `true` so a single operator can solve + self-evaluate +
+         * close the loop solo (dogfooding). Leave unset/false on mainnet.
+         */
+        allowSolverSelfEvaluation: z.ZodOptional<z.ZodBoolean>;
     }, z.ZodTypeAny, "passthrough">>;
     creator: z.ZodObject<{
         safeAddress: z.ZodString;

package/dist/types/task-document.js

@@ -5,7 +5,7 @@
  * router compatibility surface. `solverType` is the protocol join key; `spec`
  * is the SolverType-specific payload.
  */
-import { z } from 'zod';
+import { z } from 'zod/v3';
 import { WindowSchema } from './window.js';
 const HexStringSchema = z
     .string()
@@ -39,6 +39,14 @@ export const TaskClaimPolicySchema = z.object({
      * network where verdict slots may be squatted.
      */
     requiredVerdicts: z.number().int().positive().optional(),
+    /**
+     * On-chain `TaskPolicy.allowSolverSelfEvaluation`. Optional; the adapter
+     * defaults it to `false` → the coordinator rejects a verdict whose evaluator
+     * is the attempt's solver (the independent-evaluation invariant). A testnet
+     * SolverNet sets it `true` so a single operator can solve + self-evaluate +
+     * close the loop solo (dogfooding). Leave unset/false on mainnet.
+     */
+    allowSolverSelfEvaluation: z.boolean().optional(),
 }).passthrough();
 const NoLegacyKindSchema = z.record(z.unknown()).superRefine((spec, ctx) => {
     if (Object.prototype.hasOwnProperty.call(spec, 'kind')) {

package/dist/types/task-document.js.map

@@ -1 +1 @@
-{"version":3,"file":"task-document.js","sourceRoot":"","sources":["../../src/types/task-document.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,OAAO,EAAE,CAAC,EAAE,MAAM,KAAK,CAAC;AACxB,OAAO,EAAE,YAAY,EAAE,MAAM,aAAa,CAAC;AAE3C,MAAM,eAAe,GAAG,CAAC;KACtB,MAAM,EAAE;KACR,KAAK,CAAC,kBAAkB,EAAE,kCAAkC,CAAC,CAAC;AAEjE,MAAM,eAAe,GAAG,CAAC,CAAC,MAAM,CAAC;IAC/B,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,WAAW,CAAC;IAC5B,MAAM,EAAE,eAAe;IACvB,IAAI,EAAE,eAAe;IACrB,GAAG,EAAE,eAAe;CACrB,CAAC,CAAC;AAEH,MAAM,aAAa,GAAG,CAAC,CAAC,MAAM,CAAC;IAC7B,WAAW,EAAE,eAAe;IAC5B,QAAQ,EAAE,eAAe;CAC1B,CAAC,CAAC;AAEH,MAAM,CAAC,MAAM,qBAAqB,GAAG,CAAC,CAAC,MAAM,CAAC;IAC5C,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,WAAW,EAAE,UAAU,CAAC,CAAC,CAAC,OAAO,CAAC,WAAW,CAAC;IAC5D,SAAS,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,EAAE,CAAC,QAAQ,EAAE;IACtC,oBAAoB,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,EAAE,CAAC,QAAQ,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC;IAC5D,kBAAkB,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,EAAE,CAAC,QAAQ,EAAE;IAC/C,gBAAgB,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,EAAE,CAAC,QAAQ,EAAE;IAC7C,oBAAoB,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,EAAE,CAAC,QAAQ,EAAE;IACjD,oBAAoB,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,EAAE,CAAC,QAAQ,EAAE,CAAC,OAAO,CAAC,EAAE,GAAG,EAAE,CAAC;IAClE,UAAU,EAAE,eAAe,CAAC,QAAQ,EAAE;IACtC;;;;;;;;OAQG;IACH,gBAAgB,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,EAAE,CAAC,QAAQ,EAAE,CAAC,QAAQ,EAAE;CACzD,CAAC,CAAC,WAAW,EAAE,CAAC;AAIjB,MAAM,kBAAkB,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,WAAW,CAAC,CAAC,IAAI,EAAE,GAAG,EAAE,EAAE;IACzE,IAAI,MAAM,CAAC,SAAS,CAAC,cAAc,CAAC,IAAI,CAAC,IAAI,EAAE,MAAM,CAAC,EAAE,CAAC;QACvD,GAAG,CAAC,QAAQ,CAAC;YACX,IAAI,EAAE,CAAC,CAAC,YAAY,CAAC,MAAM;YAC3B,OAAO,EAAE,gDAAgD;YACzD,IAAI,EAAE,CAAC,MAAM,CAAC;SACf,CAAC,CAAC;IACL,CAAC;AACH,CAAC,CAAC,CAAC;AAEH,MAAM,YAAY,GAAG;IACnB,aAAa,EAAE,CAAC,CAAC,OAAO,CAAC,SAAS,CAAC;IACnC,EAAE,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;IACrB;;;;;;;OAOG;IACH,UAAU,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;IAC7B;;;;;OAKG;IACH,oBAAoB,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;IACvC,+DAA+D;IAC/D,UAAU,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;IAC7B,4DAA4D;IAC5D,eAAe,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;IAClC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,aAAa,EAAE,YAAY,CAAC,CAAC,CAAC,OAAO,CAAC,aAAa,CAAC;IAClE,WAAW,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;IAC9B,MAAM,EAAE,YAAY;IACpB,IAAI,EAAE,kBAAkB;IACxB,WAAW,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;IAClC,WAAW,EAAE,qBAAqB;IAClC,OAAO,EAAE,aAAa;IACtB,SAAS,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,EAAE;CAC5B,CAAC;AAEF,SAAS,kBAAkB,CAA0B,MAAsB;IACzE,OAAO,MAAM,CAAC,WAAW,EAAE,CAAC,WAAW,CAAC,CAAC,IAAI,EAAE,GAAG,EAAE,EAAE;QACpD,IAAI,MAAM,CAAC,SAAS,CAAC,cAAc,CAAC,IAAI,CAAC,IAAI,EAAE,MAAM,CAAC,EAAE,CAAC;YACvD,GAAG,CAAC,QAAQ,CAAC;gBACX,IAAI,EAAE,CAAC,CAAC,YAAY,CAAC,MAAM;gBAC3B,OAAO,EAAE,2CAA2C;gBACpD,IAAI,EAAE,CAAC,MAAM,CAAC;aACf,CAAC,CAAC;QACL,CAAC;IACH,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,IAAI,EAAE,EAAE;QACpB,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,SAAS,EAAE,GAAG,IAAmD,CAAC;QAC1F,OAAO,SAAmC,CAAC;IAC7C,CAAC,CAAC,CAAC;AACL,CAAC;AAED,MAAM,CAAC,MAAM,YAAY,GAAG,kBAAkB,CAAC,CAAC,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC,CAAC;AAIvE,MAAM,CAAC,MAAM,kBAAkB,GAAG,kBAAkB,CAAC,CAAC,CAAC,MAAM,CAAC;IAC5D,GAAG,YAAY;IACf,SAAS,EAAE,eAAe;CAC3B,CAAC,CAAC,CAAC;AAIJ,MAAM,UAAU,WAAW,CAAC,KAAc;IACxC,OAAO,YAAY,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;AACnC,CAAC;AAED,MAAM,UAAU,iBAAiB,CAAC,KAAc;IAC9C,OAAO,kBAAkB,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;AACzC,CAAC"}
+{"version":3,"file":"task-document.js","sourceRoot":"","sources":["../../src/types/task-document.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,OAAO,EAAE,CAAC,EAAE,MAAM,QAAQ,CAAC;AAC3B,OAAO,EAAE,YAAY,EAAE,MAAM,aAAa,CAAC;AAE3C,MAAM,eAAe,GAAG,CAAC;KACtB,MAAM,EAAE;KACR,KAAK,CAAC,kBAAkB,EAAE,kCAAkC,CAAC,CAAC;AAEjE,MAAM,eAAe,GAAG,CAAC,CAAC,MAAM,CAAC;IAC/B,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,WAAW,CAAC;IAC5B,MAAM,EAAE,eAAe;IACvB,IAAI,EAAE,eAAe;IACrB,GAAG,EAAE,eAAe;CACrB,CAAC,CAAC;AAEH,MAAM,aAAa,GAAG,CAAC,CAAC,MAAM,CAAC;IAC7B,WAAW,EAAE,eAAe;IAC5B,QAAQ,EAAE,eAAe;CAC1B,CAAC,CAAC;AAEH,MAAM,CAAC,MAAM,qBAAqB,GAAG,CAAC,CAAC,MAAM,CAAC;IAC5C,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,WAAW,EAAE,UAAU,CAAC,CAAC,CAAC,OAAO,CAAC,WAAW,CAAC;IAC5D,SAAS,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,EAAE,CAAC,QAAQ,EAAE;IACtC,oBAAoB,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,EAAE,CAAC,QAAQ,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC;IAC5D,kBAAkB,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,EAAE,CAAC,QAAQ,EAAE;IAC/C,gBAAgB,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,EAAE,CAAC,QAAQ,EAAE;IAC7C,oBAAoB,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,EAAE,CAAC,QAAQ,EAAE;IACjD,oBAAoB,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,EAAE,CAAC,QAAQ,EAAE,CAAC,OAAO,CAAC,EAAE,GAAG,EAAE,CAAC;IAClE,UAAU,EAAE,eAAe,CAAC,QAAQ,EAAE;IACtC;;;;;;;;OAQG;IACH,gBAAgB,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,EAAE,CAAC,QAAQ,EAAE,CAAC,QAAQ,EAAE;IACxD;;;;;;OAMG;IACH,yBAAyB,EAAE,CAAC,CAAC,OAAO,EAAE,CAAC,QAAQ,EAAE;CAClD,CAAC,CAAC,WAAW,EAAE,CAAC;AAIjB,MAAM,kBAAkB,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,WAAW,CAAC,CAAC,IAAI,EAAE,GAAG,EAAE,EAAE;IACzE,IAAI,MAAM,CAAC,SAAS,CAAC,cAAc,CAAC,IAAI,CAAC,IAAI,EAAE,MAAM,CAAC,EAAE,CAAC;QACvD,GAAG,CAAC,QAAQ,CAAC;YACX,IAAI,EAAE,CAAC,CAAC,YAAY,CAAC,MAAM;YAC3B,OAAO,EAAE,gDAAgD;YACzD,IAAI,EAAE,CAAC,MAAM,CAAC;SACf,CAAC,CAAC;IACL,CAAC;AACH,CAAC,CAAC,CAAC;AAEH,MAAM,YAAY,GAAG;IACnB,aAAa,EAAE,CAAC,CAAC,OAAO,CAAC,SAAS,CAAC;IACnC,EAAE,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;IACrB;;;;;;;OAOG;IACH,UAAU,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;IAC7B;;;;;OAKG;IACH,oBAAoB,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;IACvC,+DAA+D;IAC/D,UAAU,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;IAC7B,4DAA4D;IAC5D,eAAe,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;IAClC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,aAAa,EAAE,YAAY,CAAC,CAAC,CAAC,OAAO,CAAC,aAAa,CAAC;IAClE,WAAW,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;IAC9B,MAAM,EAAE,YAAY;IACpB,IAAI,EAAE,kBAAkB;IACxB,WAAW,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;IAClC,WAAW,EAAE,qBAAqB;IAClC,OAAO,EAAE,aAAa;IACtB,SAAS,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,EAAE;CAC5B,CAAC;AAEF,SAAS,kBAAkB,CAA0B,MAAsB;IACzE,OAAO,MAAM,CAAC,WAAW,EAAE,CAAC,WAAW,CAAC,CAAC,IAAI,EAAE,GAAG,EAAE,EAAE;QACpD,IAAI,MAAM,CAAC,SAAS,CAAC,cAAc,CAAC,IAAI,CAAC,IAAI,EAAE,MAAM,CAAC,EAAE,CAAC;YACvD,GAAG,CAAC,QAAQ,CAAC;gBACX,IAAI,EAAE,CAAC,CAAC,YAAY,CAAC,MAAM;gBAC3B,OAAO,EAAE,2CAA2C;gBACpD,IAAI,EAAE,CAAC,MAAM,CAAC;aACf,CAAC,CAAC;QACL,CAAC;IACH,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,IAAI,EAAE,EAAE;QACpB,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,SAAS,EAAE,GAAG,IAAmD,CAAC;QAC1F,OAAO,SAAmC,CAAC;IAC7C,CAAC,CAAC,CAAC;AACL,CAAC;AAED,MAAM,CAAC,MAAM,YAAY,GAAG,kBAAkB,CAAC,CAAC,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC,CAAC;AAIvE,MAAM,CAAC,MAAM,kBAAkB,GAAG,kBAAkB,CAAC,CAAC,CAAC,MAAM,CAAC;IAC5D,GAAG,YAAY;IACf,SAAS,EAAE,eAAe;CAC3B,CAAC,CAAC,CAAC;AAIJ,MAAM,UAAU,WAAW,CAAC,KAAc;IACxC,OAAO,YAAY,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;AACnC,CAAC;AAED,MAAM,UAAU,iBAAiB,CAAC,KAAc;IAC9C,OAAO,kBAAkB,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;AACzC,CAAC"}