@claude-flow/cli 3.10.35 → 3.10.37

package/dist/src/benchmarks/capability-tasks.d.ts

@@ -1,126 +0,0 @@
-export declare const BUILTIN_CAPABILITY_TASKS: {
-    readonly version: "1.3";
-    readonly description: "Text-only agent capability benchmark — verifiable multi-step reasoning tasks scoreable without tool use. Format inspired by GAIA / SWE-bench / GSM8K. The fixture mixes EASY (regression-floor) and HARD (model-gradient) questions so the pass rate has signal across Haiku → Sonnet → Opus. Real GAIA (web browsing, attachments, HF dataset) remains future work.";
-    readonly answerFormat: "Each question requires the model to reply with the answer wrapped in <answer>...</answer> tags. The harness extracts the tag contents and checks against `expected` per `matchMode`. Per-task `maxTokens` overrides the default cap.";
-    readonly tasks: readonly [{
-        readonly id: "math-prime";
-        readonly category: "easy:reasoning";
-        readonly prompt: "What is the smallest 3-digit prime number that does not contain the digit 7?";
-        readonly expected: "101";
-        readonly matchMode: "exact";
-        readonly maxTokens: 192;
-    }, {
-        readonly id: "logic-syllogism";
-        readonly category: "easy:reasoning";
-        readonly prompt: "All routers in tier 1 cost less than $0.001 per call. The Booster router is in tier 1. The Sonnet router costs $0.003 per call. Is the Sonnet router in tier 1? Answer with just \"yes\" or \"no\".";
-        readonly expected: "no";
-        readonly matchMode: "exact";
-        readonly maxTokens: 160;
-    }, {
-        readonly id: "regex-match";
-        readonly category: "easy:code-reasoning";
-        readonly prompt: "Given the regex /^([a-z]+)-(\\d+)$/ and the input string 'pattern-1779526376', what is the value of capture group 2?";
-        readonly expected: "1779526376";
-        readonly matchMode: "exact";
-        readonly maxTokens: 192;
-    }, {
-        readonly id: "gsm8k-trip";
-        readonly category: "hard:gsm8k-style";
-        readonly prompt: "A delivery van starts a route with 240 packages. At stop A it drops off 1/4 of its current load and picks up 6 new packages. At stop B it drops off 1/3 of its current load and picks up 4 new packages. At stop C it drops off half of its current load. How many packages does the van have after stop C? Answer with the integer.";
-        readonly expected: "64";
-        readonly matchMode: "exact";
-        readonly maxTokens: 256;
-    }, {
-        readonly id: "gsm8k-discount";
-        readonly category: "hard:gsm8k-style";
-        readonly prompt: "A store sells 3 widgets and 2 sprockets for $23. It also sells 2 widgets and 4 sprockets for $26. What is the price of one widget? Answer with the integer dollar amount only.";
-        readonly expected: "5";
-        readonly matchMode: "exact";
-        readonly maxTokens: 256;
-    }, {
-        readonly id: "code-trace";
-        readonly category: "hard:code-trace";
-        readonly prompt: "Consider this JavaScript code:\n```\nconst counts = new Map();\nfor (const c of 'abracadabra') {\n  counts.set(c, (counts.get(c) ?? 0) + 1);\n}\nlet maxK = '', maxV = 0;\nfor (const [k, v] of counts) {\n  if (v > maxV || (v === maxV && k < maxK)) { maxK = k; maxV = v; }\n}\nconsole.log(`${maxK}:${maxV}`);\n```\nWhat does it print? Answer with just the printed string.";
-        readonly expected: "a:5";
-        readonly matchMode: "exact";
-        readonly maxTokens: 192;
-    }, {
-        readonly id: "hard-graph-shortest";
-        readonly category: "hard:graph-reasoning";
-        readonly prompt: "A directed graph has these weighted edges: A→B(3), A→C(7), B→C(2), B→D(5), C→D(1), C→E(4), D→E(2). What is the cost of the shortest path from A to E? Answer with the integer.";
-        readonly expected: "8";
-        readonly matchMode: "exact";
-        readonly maxTokens: 192;
-    }, {
-        readonly id: "hard-probability";
-        readonly category: "hard:probability";
-        readonly prompt: "A bag contains 5 red, 3 blue, and 2 green balls. Two balls are drawn without replacement. What is the probability that both balls are the same color? Express as a fraction in lowest terms in the form a/b (e.g. 3/10).";
-        readonly expected: "14/45";
-        readonly matchMode: "exact";
-        readonly maxTokens: 256;
-    }, {
-        readonly id: "expert-marble-inverse";
-        readonly category: "expert:inverse-arithmetic";
-        readonly prompt: "A bag of marbles is split as follows: 40% are given to Alice, then 25% of the REMAINING marbles are given to Bob, then half of the remaining marbles (after Alice and Bob) are given to Carol. Carol receives exactly 18 marbles. How many marbles were in the bag originally? Answer with the integer.";
-        readonly expected: "80";
-        readonly matchMode: "exact";
-        readonly maxTokens: 512;
-    }, {
-        readonly id: "expert-crt";
-        readonly category: "expert:number-theory";
-        readonly prompt: "Find the smallest positive integer n such that all three of these hold simultaneously: n mod 7 = 3, n mod 9 = 4, n mod 11 = 5. Answer with just the integer.";
-        readonly expected: "346";
-        readonly matchMode: "exact";
-        readonly maxTokens: 768;
-    }, {
-        readonly id: "expert-bayes";
-        readonly category: "expert:bayesian";
-        readonly prompt: "A medical test has 95% sensitivity (true positive rate) and 90% specificity (true negative rate). In the screened population, 1% of people have the disease. A patient tests positive. What is the probability the patient actually has the disease, rounded to the nearest whole percent? Answer with just the integer percentage (no '%' sign).";
-        readonly expected: "9";
-        readonly matchMode: "exact";
-        readonly maxTokens: 512;
-    }, {
-        readonly id: "expert-banana";
-        readonly category: "expert:combinatorics";
-        readonly prompt: "In how many distinct arrangements of the letters of the word BANANA do no two N's appear next to each other? Answer with the integer.";
-        readonly expected: "40";
-        readonly matchMode: "exact";
-        readonly maxTokens: 512;
-    }, {
-        readonly id: "expert-rectangle";
-        readonly category: "expert:diophantine";
-        readonly prompt: "A rectangle has positive integer side lengths. Its perimeter (in linear units) is numerically equal to its area (in square units). Two rectangles that are rotations of each other (e.g. 3x6 and 6x3) count as the same rectangle. What is the sum of the areas of all distinct such rectangles? Answer with the integer.";
-        readonly expected: "34";
-        readonly matchMode: "exact";
-        readonly maxTokens: 512;
-    }, {
-        readonly id: "expert-dice-reroll";
-        readonly category: "expert:expected-value";
-        readonly prompt: "You roll a fair 6-sided die. If the result is a 6, you reroll exactly once and take the new result. Otherwise, you keep the original result. What is the expected value of your final number? Express the answer as a fraction in lowest terms in the form a/b (no spaces, no surrounding text).";
-        readonly expected: "37/12";
-        readonly matchMode: "exact";
-        readonly maxTokens: 512;
-    }, {
-        readonly id: "sonnet-killer-knights";
-        readonly category: "sonnet-killer:logic-puzzle";
-        readonly prompt: "On an island, knights always tell the truth and knaves always lie. You meet four people named Alice, Bob, Carol, and Dan. They make the following statements: Alice says 'Bob and Carol are different types (one is a knight, the other is a knave).' Bob says 'Alice is a knave.' Carol says 'Dan is a knave.' Dan says 'Carol is a knave.' How many knaves are among the four people? Answer with just the integer.";
-        readonly expected: "2";
-        readonly matchMode: "exact";
-        readonly maxTokens: 768;
-    }, {
-        readonly id: "sonnet-killer-hofstadter";
-        readonly category: "sonnet-killer:recursive-sequence";
-        readonly prompt: "A sequence is defined on the positive integers by f(1) = 1 and, for every n > 1, f(n) = f(n - f(n-1)) + 1. Compute f(10). Answer with just the integer.";
-        readonly expected: "4";
-        readonly matchMode: "exact";
-        readonly maxTokens: 768;
-    }, {
-        readonly id: "sonnet-killer-modexp";
-        readonly category: "sonnet-killer:number-theory";
-        readonly prompt: "What are the last two digits of 7 raised to the 2026th power? Answer with exactly the two-digit number (e.g. '07' if it's seven, '49' if it's forty-nine).";
-        readonly expected: "49";
-        readonly matchMode: "exact";
-        readonly maxTokens: 512;
-    }];
-};
-//# sourceMappingURL=capability-tasks.d.ts.map

package/dist/src/benchmarks/capability-tasks.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"capability-tasks.d.ts","sourceRoot":"","sources":["../../../src/benchmarks/capability-tasks.ts"],"names":[],"mappings":"AAIA,eAAO,MAAM,wBAAwB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;CA8I3B,CAAC"}

package/dist/src/benchmarks/capability-tasks.js

@@ -1,147 +0,0 @@
-// Auto-generated from src/benchmarks/capability-tasks.json — keep in sync.
-// This module exists so the fixture is bundled into dist/ by tsc (JSON files
-// are not copied by tsc, and the published CLI ships only dist/).
-export const BUILTIN_CAPABILITY_TASKS = {
-    "version": "1.3",
-    "description": "Text-only agent capability benchmark — verifiable multi-step reasoning tasks scoreable without tool use. Format inspired by GAIA / SWE-bench / GSM8K. The fixture mixes EASY (regression-floor) and HARD (model-gradient) questions so the pass rate has signal across Haiku → Sonnet → Opus. Real GAIA (web browsing, attachments, HF dataset) remains future work.",
-    "answerFormat": "Each question requires the model to reply with the answer wrapped in <answer>...</answer> tags. The harness extracts the tag contents and checks against `expected` per `matchMode`. Per-task `maxTokens` overrides the default cap.",
-    "tasks": [
-        {
-            "id": "math-prime",
-            "category": "easy:reasoning",
-            "prompt": "What is the smallest 3-digit prime number that does not contain the digit 7?",
-            "expected": "101",
-            "matchMode": "exact",
-            "maxTokens": 192
-        },
-        {
-            "id": "logic-syllogism",
-            "category": "easy:reasoning",
-            "prompt": "All routers in tier 1 cost less than $0.001 per call. The Booster router is in tier 1. The Sonnet router costs $0.003 per call. Is the Sonnet router in tier 1? Answer with just \"yes\" or \"no\".",
-            "expected": "no",
-            "matchMode": "exact",
-            "maxTokens": 160
-        },
-        {
-            "id": "regex-match",
-            "category": "easy:code-reasoning",
-            "prompt": "Given the regex /^([a-z]+)-(\\d+)$/ and the input string 'pattern-1779526376', what is the value of capture group 2?",
-            "expected": "1779526376",
-            "matchMode": "exact",
-            "maxTokens": 192
-        },
-        {
-            "id": "gsm8k-trip",
-            "category": "hard:gsm8k-style",
-            "prompt": "A delivery van starts a route with 240 packages. At stop A it drops off 1/4 of its current load and picks up 6 new packages. At stop B it drops off 1/3 of its current load and picks up 4 new packages. At stop C it drops off half of its current load. How many packages does the van have after stop C? Answer with the integer.",
-            "expected": "64",
-            "matchMode": "exact",
-            "maxTokens": 256
-        },
-        {
-            "id": "gsm8k-discount",
-            "category": "hard:gsm8k-style",
-            "prompt": "A store sells 3 widgets and 2 sprockets for $23. It also sells 2 widgets and 4 sprockets for $26. What is the price of one widget? Answer with the integer dollar amount only.",
-            "expected": "5",
-            "matchMode": "exact",
-            "maxTokens": 256
-        },
-        {
-            "id": "code-trace",
-            "category": "hard:code-trace",
-            "prompt": "Consider this JavaScript code:\n```\nconst counts = new Map();\nfor (const c of 'abracadabra') {\n  counts.set(c, (counts.get(c) ?? 0) + 1);\n}\nlet maxK = '', maxV = 0;\nfor (const [k, v] of counts) {\n  if (v > maxV || (v === maxV && k < maxK)) { maxK = k; maxV = v; }\n}\nconsole.log(`${maxK}:${maxV}`);\n```\nWhat does it print? Answer with just the printed string.",
-            "expected": "a:5",
-            "matchMode": "exact",
-            "maxTokens": 192
-        },
-        {
-            "id": "hard-graph-shortest",
-            "category": "hard:graph-reasoning",
-            "prompt": "A directed graph has these weighted edges: A→B(3), A→C(7), B→C(2), B→D(5), C→D(1), C→E(4), D→E(2). What is the cost of the shortest path from A to E? Answer with the integer.",
-            "expected": "8",
-            "matchMode": "exact",
-            "maxTokens": 192
-        },
-        {
-            "id": "hard-probability",
-            "category": "hard:probability",
-            "prompt": "A bag contains 5 red, 3 blue, and 2 green balls. Two balls are drawn without replacement. What is the probability that both balls are the same color? Express as a fraction in lowest terms in the form a/b (e.g. 3/10).",
-            "expected": "14/45",
-            "matchMode": "exact",
-            "maxTokens": 256
-        },
-        {
-            "id": "expert-marble-inverse",
-            "category": "expert:inverse-arithmetic",
-            "prompt": "A bag of marbles is split as follows: 40% are given to Alice, then 25% of the REMAINING marbles are given to Bob, then half of the remaining marbles (after Alice and Bob) are given to Carol. Carol receives exactly 18 marbles. How many marbles were in the bag originally? Answer with the integer.",
-            "expected": "80",
-            "matchMode": "exact",
-            "maxTokens": 512
-        },
-        {
-            "id": "expert-crt",
-            "category": "expert:number-theory",
-            "prompt": "Find the smallest positive integer n such that all three of these hold simultaneously: n mod 7 = 3, n mod 9 = 4, n mod 11 = 5. Answer with just the integer.",
-            "expected": "346",
-            "matchMode": "exact",
-            "maxTokens": 768
-        },
-        {
-            "id": "expert-bayes",
-            "category": "expert:bayesian",
-            "prompt": "A medical test has 95% sensitivity (true positive rate) and 90% specificity (true negative rate). In the screened population, 1% of people have the disease. A patient tests positive. What is the probability the patient actually has the disease, rounded to the nearest whole percent? Answer with just the integer percentage (no '%' sign).",
-            "expected": "9",
-            "matchMode": "exact",
-            "maxTokens": 512
-        },
-        {
-            "id": "expert-banana",
-            "category": "expert:combinatorics",
-            "prompt": "In how many distinct arrangements of the letters of the word BANANA do no two N's appear next to each other? Answer with the integer.",
-            "expected": "40",
-            "matchMode": "exact",
-            "maxTokens": 512
-        },
-        {
-            "id": "expert-rectangle",
-            "category": "expert:diophantine",
-            "prompt": "A rectangle has positive integer side lengths. Its perimeter (in linear units) is numerically equal to its area (in square units). Two rectangles that are rotations of each other (e.g. 3x6 and 6x3) count as the same rectangle. What is the sum of the areas of all distinct such rectangles? Answer with the integer.",
-            "expected": "34",
-            "matchMode": "exact",
-            "maxTokens": 512
-        },
-        {
-            "id": "expert-dice-reroll",
-            "category": "expert:expected-value",
-            "prompt": "You roll a fair 6-sided die. If the result is a 6, you reroll exactly once and take the new result. Otherwise, you keep the original result. What is the expected value of your final number? Express the answer as a fraction in lowest terms in the form a/b (no spaces, no surrounding text).",
-            "expected": "37/12",
-            "matchMode": "exact",
-            "maxTokens": 512
-        },
-        {
-            "id": "sonnet-killer-knights",
-            "category": "sonnet-killer:logic-puzzle",
-            "prompt": "On an island, knights always tell the truth and knaves always lie. You meet four people named Alice, Bob, Carol, and Dan. They make the following statements: Alice says 'Bob and Carol are different types (one is a knight, the other is a knave).' Bob says 'Alice is a knave.' Carol says 'Dan is a knave.' Dan says 'Carol is a knave.' How many knaves are among the four people? Answer with just the integer.",
-            "expected": "2",
-            "matchMode": "exact",
-            "maxTokens": 768
-        },
-        {
-            "id": "sonnet-killer-hofstadter",
-            "category": "sonnet-killer:recursive-sequence",
-            "prompt": "A sequence is defined on the positive integers by f(1) = 1 and, for every n > 1, f(n) = f(n - f(n-1)) + 1. Compute f(10). Answer with just the integer.",
-            "expected": "4",
-            "matchMode": "exact",
-            "maxTokens": 768
-        },
-        {
-            "id": "sonnet-killer-modexp",
-            "category": "sonnet-killer:number-theory",
-            "prompt": "What are the last two digits of 7 raised to the 2026th power? Answer with exactly the two-digit number (e.g. '07' if it's seven, '49' if it's forty-nine).",
-            "expected": "49",
-            "matchMode": "exact",
-            "maxTokens": 512
-        }
-    ]
-};
-//# sourceMappingURL=capability-tasks.js.map

package/dist/src/benchmarks/capability-tasks.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"capability-tasks.js","sourceRoot":"","sources":["../../../src/benchmarks/capability-tasks.ts"],"names":[],"mappings":"AAAA,2EAA2E;AAC3E,6EAA6E;AAC7E,kEAAkE;AAElE,MAAM,CAAC,MAAM,wBAAwB,GAAG;IACtC,SAAS,EAAE,KAAK;IAChB,aAAa,EAAE,sWAAsW;IACrX,cAAc,EAAE,sOAAsO;IACtP,OAAO,EAAE;QACP;YACE,IAAI,EAAE,YAAY;YAClB,UAAU,EAAE,gBAAgB;YAC5B,QAAQ,EAAE,8EAA8E;YACxF,UAAU,EAAE,KAAK;YACjB,WAAW,EAAE,OAAO;YACpB,WAAW,EAAE,GAAG;SACjB;QACD;YACE,IAAI,EAAE,iBAAiB;YACvB,UAAU,EAAE,gBAAgB;YAC5B,QAAQ,EAAE,qMAAqM;YAC/M,UAAU,EAAE,IAAI;YAChB,WAAW,EAAE,OAAO;YACpB,WAAW,EAAE,GAAG;SACjB;QACD;YACE,IAAI,EAAE,aAAa;YACnB,UAAU,EAAE,qBAAqB;YACjC,QAAQ,EAAE,sHAAsH;YAChI,UAAU,EAAE,YAAY;YACxB,WAAW,EAAE,OAAO;YACpB,WAAW,EAAE,GAAG;SACjB;QACD;YACE,IAAI,EAAE,YAAY;YAClB,UAAU,EAAE,kBAAkB;YAC9B,QAAQ,EAAE,sUAAsU;YAChV,UAAU,EAAE,IAAI;YAChB,WAAW,EAAE,OAAO;YACpB,WAAW,EAAE,GAAG;SACjB;QACD;YACE,IAAI,EAAE,gBAAgB;YACtB,UAAU,EAAE,kBAAkB;YAC9B,QAAQ,EAAE,gLAAgL;YAC1L,UAAU,EAAE,GAAG;YACf,WAAW,EAAE,OAAO;YACpB,WAAW,EAAE,GAAG;SACjB;QACD;YACE,IAAI,EAAE,YAAY;YAClB,UAAU,EAAE,iBAAiB;YAC7B,QAAQ,EAAE,mXAAmX;YAC7X,UAAU,EAAE,KAAK;YACjB,WAAW,EAAE,OAAO;YACpB,WAAW,EAAE,GAAG;SACjB;QACD;YACE,IAAI,EAAE,qBAAqB;YAC3B,UAAU,EAAE,sBAAsB;YAClC,QAAQ,EAAE,gLAAgL;YAC1L,UAAU,EAAE,GAAG;YACf,WAAW,EAAE,OAAO;YACpB,WAAW,EAAE,GAAG;SACjB;QACD;YACE,IAAI,EAAE,kBAAkB;YACxB,UAAU,EAAE,kBAAkB;YAC9B,QAAQ,EAAE,0NAA0N;YACpO,UAAU,EAAE,OAAO;YACnB,WAAW,EAAE,OAAO;YACpB,WAAW,EAAE,GAAG;SACjB;QACD;YACE,IAAI,EAAE,uBAAuB;YAC7B,UAAU,EAAE,2BAA2B;YACvC,QAAQ,EAAE,ySAAyS;YACnT,UAAU,EAAE,IAAI;YAChB,WAAW,EAAE,OAAO;YACpB,WAAW,EAAE,GAAG;SACjB;QACD;YACE,IAAI,EAAE,YAAY;YAClB,UAAU,EAAE,sBAAsB;YAClC,QAAQ,EAAE,8JAA8J;YACxK,UAAU,EAAE,KAAK;YACjB,WAAW,EAAE,OAAO;YACpB,WAAW,EAAE,GAAG;SACjB;QACD;YACE,IAAI,EAAE,cAAc;YACpB,UAAU,EAAE,iBAAiB;YAC7B,QAAQ,EAAE,mVAAmV;YAC7V,UAAU,EAAE,GAAG;YACf,WAAW,EAAE,OAAO;YACpB,WAAW,EAAE,GAAG;SACjB;QACD;YACE,IAAI,EAAE,eAAe;YACrB,UAAU,EAAE,sBAAsB;YAClC,QAAQ,EAAE,uIAAuI;YACjJ,UAAU,EAAE,IAAI;YAChB,WAAW,EAAE,OAAO;YACpB,WAAW,EAAE,GAAG;SACjB;QACD;YACE,IAAI,EAAE,kBAAkB;YACxB,UAAU,EAAE,oBAAoB;YAChC,QAAQ,EAAE,2TAA2T;YACrU,UAAU,EAAE,IAAI;YAChB,WAAW,EAAE,OAAO;YACpB,WAAW,EAAE,GAAG;SACjB;QACD;YACE,IAAI,EAAE,oBAAoB;YAC1B,UAAU,EAAE,uBAAuB;YACnC,QAAQ,EAAE,kSAAkS;YAC5S,UAAU,EAAE,OAAO;YACnB,WAAW,EAAE,OAAO;YACpB,WAAW,EAAE,GAAG;SACjB;QACD;YACE,IAAI,EAAE,uBAAuB;YAC7B,UAAU,EAAE,4BAA4B;YACxC,QAAQ,EAAE,uZAAuZ;YACja,UAAU,EAAE,GAAG;YACf,WAAW,EAAE,OAAO;YACpB,WAAW,EAAE,GAAG;SACjB;QACD;YACE,IAAI,EAAE,0BAA0B;YAChC,UAAU,EAAE,kCAAkC;YAC9C,QAAQ,EAAE,yJAAyJ;YACnK,UAAU,EAAE,GAAG;YACf,WAAW,EAAE,OAAO;YACpB,WAAW,EAAE,GAAG;SACjB;QACD;YACE,IAAI,EAAE,sBAAsB;YAC5B,UAAU,EAAE,6BAA6B;YACzC,QAAQ,EAAE,4JAA4J;YACtK,UAAU,EAAE,IAAI;YAChB,WAAW,EAAE,OAAO;YACpB,WAAW,EAAE,GAAG;SACjB;KACF;CACO,CAAC"}

package/dist/src/benchmarks/gaia-agent-contrastive.d.ts

@@ -1,53 +0,0 @@
-/**
- * GAIA Agent Contrastive Wrapper — iter 49.5
- *
- * Thin wrapper around runGaiaAgent that adds three ruflo intelligence hooks:
- *   1. PRE: memory_search_unified for relevant patterns
- *   2. DURING: trajectory recording (start/step/end) via memory store
- *   3. POST: memory_store of question+answer+verdict for future recall
- *
- * Purpose: measure whether ruflo's AgentDB intelligence (5,930 entries,
- * 26,490 patterns) provides a measurable lift on GAIA L1 when injected
- * as system context before the agent loop.
- *
- * Design constraints:
- *   - Does NOT change the underlying agent loop logic
- *   - Does NOT enable ADR-135 tracks (critic, decomposition, voting, MoE, KG)
- *   - Pure addition: memory before, trajectory during, store after
- *   - Graceful fallback: any hook failure is logged but does NOT fail the question
- *
- * Refs: ADR-133, iter 49.5, #2156
- */
-import type { GaiaQuestion } from './gaia-loader.js';
-import { type GaiaAgentOptions, type GaiaAgentResult } from './gaia-agent.js';
-export interface ContrastiveStats {
-    memorySearchCalls: number;
-    memorySearchHits: number;
-    memoryStoreCount: number;
-    trajectoryCount: number;
-    totalPatternsInjected: number;
-}
-export interface ContrastiveAgentResult extends GaiaAgentResult {
-    /** Number of memory patterns injected as context for this question. */
-    patternsInjected?: number;
-    /** Whether a trajectory was recorded for this question. */
-    trajectoryRecorded?: boolean;
-    /** Whether the question+answer was stored in memory after completion. */
-    memoryStored?: boolean;
-}
-/**
- * Wrap runGaiaAgent with ruflo intelligence hooks.
- *
- * Hook points:
- *   1. memory_search before the agent loop (context injection)
- *   2. trajectory-start/end records via memory store
- *   3. memory_store after the final answer
- *
- * The underlying agent loop is called unchanged.
- */
-export declare function runGaiaAgentContrastive(question: GaiaQuestion, options: GaiaAgentOptions, stats: ContrastiveStats): Promise<ContrastiveAgentResult>;
-/**
- * Create a fresh ContrastiveStats counter object.
- */
-export declare function createContrastiveStats(): ContrastiveStats;
-//# sourceMappingURL=gaia-agent-contrastive.d.ts.map

package/dist/src/benchmarks/gaia-agent-contrastive.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"gaia-agent-contrastive.d.ts","sourceRoot":"","sources":["../../../src/benchmarks/gaia-agent-contrastive.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;GAmBG;AAGH,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,kBAAkB,CAAC;AACrD,OAAO,EAAgB,KAAK,gBAAgB,EAAE,KAAK,eAAe,EAAE,MAAM,iBAAiB,CAAC;AAM5F,MAAM,WAAW,gBAAgB;IAC/B,iBAAiB,EAAE,MAAM,CAAC;IAC1B,gBAAgB,EAAE,MAAM,CAAC;IACzB,gBAAgB,EAAE,MAAM,CAAC;IACzB,eAAe,EAAE,MAAM,CAAC;IACxB,qBAAqB,EAAE,MAAM,CAAC;CAC/B;AAED,MAAM,WAAW,sBAAuB,SAAQ,eAAe;IAC7D,uEAAuE;IACvE,gBAAgB,CAAC,EAAE,MAAM,CAAC;IAC1B,2DAA2D;IAC3D,kBAAkB,CAAC,EAAE,OAAO,CAAC;IAC7B,yEAAyE;IACzE,YAAY,CAAC,EAAE,OAAO,CAAC;CACxB;AA2FD;;;;;;;;;GASG;AACH,wBAAsB,uBAAuB,CAC3C,QAAQ,EAAE,YAAY,EACtB,OAAO,EAAE,gBAAgB,EACzB,KAAK,EAAE,gBAAgB,GACtB,OAAO,CAAC,sBAAsB,CAAC,CA+DjC;AAED;;GAEG;AACH,wBAAgB,sBAAsB,IAAI,gBAAgB,CAQzD"}

package/dist/src/benchmarks/gaia-agent-contrastive.js

@@ -1,177 +0,0 @@
-/**
- * GAIA Agent Contrastive Wrapper — iter 49.5
- *
- * Thin wrapper around runGaiaAgent that adds three ruflo intelligence hooks:
- *   1. PRE: memory_search_unified for relevant patterns
- *   2. DURING: trajectory recording (start/step/end) via memory store
- *   3. POST: memory_store of question+answer+verdict for future recall
- *
- * Purpose: measure whether ruflo's AgentDB intelligence (5,930 entries,
- * 26,490 patterns) provides a measurable lift on GAIA L1 when injected
- * as system context before the agent loop.
- *
- * Design constraints:
- *   - Does NOT change the underlying agent loop logic
- *   - Does NOT enable ADR-135 tracks (critic, decomposition, voting, MoE, KG)
- *   - Pure addition: memory before, trajectory during, store after
- *   - Graceful fallback: any hook failure is logged but does NOT fail the question
- *
- * Refs: ADR-133, iter 49.5, #2156
- */
-import { execSync } from 'node:child_process';
-import { runGaiaAgent } from './gaia-agent.js';
-// ---------------------------------------------------------------------------
-// Ruflo CLI helpers (best-effort — never throw)
-// ---------------------------------------------------------------------------
-const CLI_TIMEOUT_MS = 10_000;
-const GAIA_NAMESPACE = 'gaia-l1-questions';
-/**
- * Run memory search via CLI and return up to `limit` result summaries.
- * Returns empty array on any error (graceful fallback).
- */
-function memorySearch(query, limit) {
-    try {
-        const raw = execSync(`npx @claude-flow/cli@latest memory search --query ${JSON.stringify(query)} --limit ${limit}`, { encoding: 'utf-8', timeout: CLI_TIMEOUT_MS, stdio: ['pipe', 'pipe', 'pipe'] });
-        // Parse table rows: extract Preview column (5th column in pipe-separated table)
-        const rows = raw
-            .split('\n')
-            .filter((line) => line.startsWith('|') && !line.includes('Key') && !line.includes('---'))
-            .map((line) => {
-            const cols = line.split('|').map((c) => c.trim()).filter(Boolean);
-            // cols: [Key, Score, Namespace, Preview]
-            return cols[3] ?? '';
-        })
-            .filter((preview) => preview.length > 0 && !preview.includes('Preview'));
-        return rows.slice(0, limit);
-    }
-    catch {
-        return [];
-    }
-}
-/**
- * Store a key/value in memory under the gaia namespace.
- * Best-effort — swallows errors.
- */
-function memoryStore(key, value) {
-    try {
-        const valueStr = JSON.stringify(value);
-        execSync(`npx @claude-flow/cli@latest memory store --key ${JSON.stringify(key)} --value ${JSON.stringify(valueStr)} --namespace ${GAIA_NAMESPACE}`, { encoding: 'utf-8', timeout: CLI_TIMEOUT_MS, stdio: ['pipe', 'pipe', 'pipe'] });
-        return true;
-    }
-    catch {
-        return false;
-    }
-}
-/**
- * Record a trajectory event (start/step/end) via memory store.
- * This is a lightweight proxy — the MCP trajectory tools are not available
- * from inside the benchmark harness. We persist the trajectory as memory
- * entries so they can be recalled later.
- */
-function trajectoryRecord(type, data) {
-    try {
-        const key = `traj-gaia-l1-${type}-${Date.now()}`;
-        execSync(`npx @claude-flow/cli@latest memory store --key ${JSON.stringify(key)} --value ${JSON.stringify(JSON.stringify(data))} --namespace trajectories`, { encoding: 'utf-8', timeout: CLI_TIMEOUT_MS, stdio: ['pipe', 'pipe', 'pipe'] });
-    }
-    catch {
-        // Best-effort — trajectory recording never blocks progress
-    }
-}
-// ---------------------------------------------------------------------------
-// System prompt injection
-// ---------------------------------------------------------------------------
-/**
- * Build a context prefix to prepend to the system prompt when patterns
- * are found in memory. Returns empty string when patterns is empty.
- */
-function buildMemoryContextPrefix(patterns) {
-    if (patterns.length === 0)
-        return '';
-    return ('Relevant patterns from prior ruflo work:\n' +
-        patterns.map((p) => `- ${p.slice(0, 120)}`).join('\n') +
-        '\n\n');
-}
-// ---------------------------------------------------------------------------
-// Contrastive wrapper
-// ---------------------------------------------------------------------------
-/**
- * Wrap runGaiaAgent with ruflo intelligence hooks.
- *
- * Hook points:
- *   1. memory_search before the agent loop (context injection)
- *   2. trajectory-start/end records via memory store
- *   3. memory_store after the final answer
- *
- * The underlying agent loop is called unchanged.
- */
-export async function runGaiaAgentContrastive(question, options, stats) {
-    const questionId = question.task_id;
-    // ---- 1. PRE: memory_search for relevant patterns ----------------------
-    stats.memorySearchCalls++;
-    const patterns = memorySearch(question.question, 3);
-    const patternsInjected = patterns.length;
-    if (patterns.length > 0) {
-        stats.memorySearchHits++;
-        stats.totalPatternsInjected += patterns.length;
-    }
-    // ---- 2. TRAJECTORY: start recording -----------------------------------
-    trajectoryRecord('start', {
-        task: 'gaia-l1',
-        question_id: questionId,
-        question_snippet: question.question.slice(0, 80),
-        startedAt: new Date().toISOString(),
-        patternsInjected,
-    });
-    // ---- Build patched options with memory context injected ---------------
-    // We inject context by wrapping the question text (system prompt cannot be
-    // overridden via GaiaAgentOptions today; instead we prepend context to
-    // the question text as a user-visible hint). This is intentionally minimal.
-    const contextPrefix = buildMemoryContextPrefix(patterns);
-    const patchedQuestion = contextPrefix
-        ? { ...question, question: contextPrefix + question.question }
-        : question;
-    // ---- Run the actual agent loop (unchanged) ----------------------------
-    const result = await runGaiaAgent(patchedQuestion, options);
-    // ---- 3. POST: store question+answer+verdict ---------------------------
-    const questionKey = `gaia-l1-q${questionId}-${Date.now()}`;
-    const stored = memoryStore(questionKey, {
-        question: question.question,
-        answer: result.finalAnswer,
-        questionId,
-        model: options.model ?? 'claude-sonnet-4-6',
-        turns: result.turns,
-        timedOut: result.timedOut ?? false,
-        storedAt: new Date().toISOString(),
-    });
-    if (stored)
-        stats.memoryStoreCount++;
-    // ---- TRAJECTORY: end recording ----------------------------------------
-    trajectoryRecord('end', {
-        task: 'gaia-l1',
-        question_id: questionId,
-        answer: result.finalAnswer,
-        turns: result.turns,
-        timedOut: result.timedOut ?? false,
-        endedAt: new Date().toISOString(),
-    });
-    stats.trajectoryCount++;
-    return {
-        ...result,
-        patternsInjected,
-        trajectoryRecorded: true,
-        memoryStored: stored,
-    };
-}
-/**
- * Create a fresh ContrastiveStats counter object.
- */
-export function createContrastiveStats() {
-    return {
-        memorySearchCalls: 0,
-        memorySearchHits: 0,
-        memoryStoreCount: 0,
-        trajectoryCount: 0,
-        totalPatternsInjected: 0,
-    };
-}
-//# sourceMappingURL=gaia-agent-contrastive.js.map

package/dist/src/benchmarks/gaia-agent-contrastive.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"gaia-agent-contrastive.js","sourceRoot":"","sources":["../../../src/benchmarks/gaia-agent-contrastive.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;GAmBG;AAEH,OAAO,EAAE,QAAQ,EAAE,MAAM,oBAAoB,CAAC;AAE9C,OAAO,EAAE,YAAY,EAA+C,MAAM,iBAAiB,CAAC;AAuB5F,8EAA8E;AAC9E,gDAAgD;AAChD,8EAA8E;AAE9E,MAAM,cAAc,GAAG,MAAM,CAAC;AAC9B,MAAM,cAAc,GAAG,mBAAmB,CAAC;AAE3C;;;GAGG;AACH,SAAS,YAAY,CAAC,KAAa,EAAE,KAAa;IAChD,IAAI,CAAC;QACH,MAAM,GAAG,GAAG,QAAQ,CAClB,qDAAqD,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,YAAY,KAAK,EAAE,EAC7F,EAAE,QAAQ,EAAE,OAAO,EAAE,OAAO,EAAE,cAAc,EAAE,KAAK,EAAE,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,CAChF,CAAC;QACF,gFAAgF;QAChF,MAAM,IAAI,GAAG,GAAG;aACb,KAAK,CAAC,IAAI,CAAC;aACX,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;aACxF,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE;YACZ,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;YAClE,yCAAyC;YACzC,OAAO,IAAI,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;QACvB,CAAC,CAAC;aACD,MAAM,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC,CAAC;QAC3E,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;IAC9B,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,EAAE,CAAC;IACZ,CAAC;AACH,CAAC;AAED;;;GAGG;AACH,SAAS,WAAW,CAAC,GAAW,EAAE,KAAa;IAC7C,IAAI,CAAC;QACH,MAAM,QAAQ,GAAG,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;QACvC,QAAQ,CACN,kDAAkD,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,YAAY,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,gBAAgB,cAAc,EAAE,EACzI,EAAE,QAAQ,EAAE,OAAO,EAAE,OAAO,EAAE,cAAc,EAAE,KAAK,EAAE,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,CAChF,CAAC;QACF,OAAO,IAAI,CAAC;IACd,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,KAAK,CAAC;IACf,CAAC;AACH,CAAC;AAED;;;;;GAKG;AACH,SAAS,gBAAgB,CAAC,IAAqB,EAAE,IAAY;IAC3D,IAAI,CAAC;QACH,MAAM,GAAG,GAAG,gBAAgB,IAAI,IAAI,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC;QACjD,QAAQ,CACN,kDAAkD,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,YAAY,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,2BAA2B,EAChJ,EAAE,QAAQ,EAAE,OAAO,EAAE,OAAO,EAAE,cAAc,EAAE,KAAK,EAAE,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,CAChF,CAAC;IACJ,CAAC;IAAC,MAAM,CAAC;QACP,2DAA2D;IAC7D,CAAC;AACH,CAAC;AAED,8EAA8E;AAC9E,0BAA0B;AAC1B,8EAA8E;AAE9E;;;GAGG;AACH,SAAS,wBAAwB,CAAC,QAAkB;IAClD,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IACrC,OAAO,CACL,4CAA4C;QAC5C,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC;QACtD,MAAM,CACP,CAAC;AACJ,CAAC;AAED,8EAA8E;AAC9E,sBAAsB;AACtB,8EAA8E;AAE9E;;;;;;;;;GASG;AACH,MAAM,CAAC,KAAK,UAAU,uBAAuB,CAC3C,QAAsB,EACtB,OAAyB,EACzB,KAAuB;IAEvB,MAAM,UAAU,GAAG,QAAQ,CAAC,OAAO,CAAC;IAEpC,0EAA0E;IAC1E,KAAK,CAAC,iBAAiB,EAAE,CAAC;IAC1B,MAAM,QAAQ,GAAG,YAAY,CAAC,QAAQ,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC;IACpD,MAAM,gBAAgB,GAAG,QAAQ,CAAC,MAAM,CAAC;IACzC,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,KAAK,CAAC,gBAAgB,EAAE,CAAC;QACzB,KAAK,CAAC,qBAAqB,IAAI,QAAQ,CAAC,MAAM,CAAC;IACjD,CAAC;IAED,0EAA0E;IAC1E,gBAAgB,CAAC,OAAO,EAAE;QACxB,IAAI,EAAE,SAAS;QACf,WAAW,EAAE,UAAU;QACvB,gBAAgB,EAAE,QAAQ,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC;QAChD,SAAS,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;QACnC,gBAAgB;KACjB,CAAC,CAAC;IAEH,0EAA0E;IAC1E,2EAA2E;IAC3E,uEAAuE;IACvE,4EAA4E;IAC5E,MAAM,aAAa,GAAG,wBAAwB,CAAC,QAAQ,CAAC,CAAC;IACzD,MAAM,eAAe,GAAiB,aAAa;QACjD,CAAC,CAAC,EAAE,GAAG,QAAQ,EAAE,QAAQ,EAAE,aAAa,GAAG,QAAQ,CAAC,QAAQ,EAAE;QAC9D,CAAC,CAAC,QAAQ,CAAC;IAEb,0EAA0E;IAC1E,MAAM,MAAM,GAAG,MAAM,YAAY,CAAC,eAAe,EAAE,OAAO,CAAC,CAAC;IAE5D,0EAA0E;IAC1E,MAAM,WAAW,GAAG,YAAY,UAAU,IAAI,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC;IAC3D,MAAM,MAAM,GAAG,WAAW,CAAC,WAAW,EAAE;QACtC,QAAQ,EAAE,QAAQ,CAAC,QAAQ;QAC3B,MAAM,EAAE,MAAM,CAAC,WAAW;QAC1B,UAAU;QACV,KAAK,EAAE,OAAO,CAAC,KAAK,IAAI,mBAAmB;QAC3C,KAAK,EAAE,MAAM,CAAC,KAAK;QACnB,QAAQ,EAAE,MAAM,CAAC,QAAQ,IAAI,KAAK;QAClC,QAAQ,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;KACnC,CAAC,CAAC;IACH,IAAI,MAAM;QAAE,KAAK,CAAC,gBAAgB,EAAE,CAAC;IAErC,0EAA0E;IAC1E,gBAAgB,CAAC,KAAK,EAAE;QACtB,IAAI,EAAE,SAAS;QACf,WAAW,EAAE,UAAU;QACvB,MAAM,EAAE,MAAM,CAAC,WAAW;QAC1B,KAAK,EAAE,MAAM,CAAC,KAAK;QACnB,QAAQ,EAAE,MAAM,CAAC,QAAQ,IAAI,KAAK;QAClC,OAAO,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;KAClC,CAAC,CAAC;IACH,KAAK,CAAC,eAAe,EAAE,CAAC;IAExB,OAAO;QACL,GAAG,MAAM;QACT,gBAAgB;QAChB,kBAAkB,EAAE,IAAI;QACxB,YAAY,EAAE,MAAM;KACrB,CAAC;AACJ,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,sBAAsB;IACpC,OAAO;QACL,iBAAiB,EAAE,CAAC;QACpB,gBAAgB,EAAE,CAAC;QACnB,gBAAgB,EAAE,CAAC;QACnB,eAAe,EAAE,CAAC;QAClB,qBAAqB,EAAE,CAAC;KACzB,CAAC;AACJ,CAAC"}

package/dist/src/benchmarks/gaia-agent-gemini.d.ts

@@ -1,51 +0,0 @@
-/**
- * GAIA Agent — Gemini 2.5 Pro Thinking adapter (Phase 2 pilot)
- *
- * Adapts the existing GAIA tool catalogue to Google's generateContent API,
- * translating Anthropic tool_use ↔ Gemini functionCall/functionResponse.
- *
- * Loop algorithm mirrors gaia-agent.ts:
- *   1. Build initial contents array with system instruction + first user turn.
- *   2. Call Gemini generateContent with functionDeclarations.
- *   3. On functionCall parts: execute tools, append functionResponse, repeat.
- *   4. On text-only response: scan for FINAL_ANSWER pattern.
- *   5. On maxTurns: return timedOut result.
- *
- * Gemini 2.5 Pro pricing (2026-05-28, per million tokens):
- *   Input:   $1.25 (≤200k tokens), $2.50 (>200k)
- *   Output:  $10.00 (≤200k tokens), $15.00 (>200k)
- *   Thinking tokens are billed as output tokens.
- *
- * Cost gate for pilot: ≤$0.12 per question average.
- * Expected per-question cost at ~10k input + ~2k output: ~$0.032 — well within gate.
- *
- * Refs: ADR-133, ADR-135, #2156 Phase 2
- */
-import { GaiaQuestion } from './gaia-loader.js';
-import { GaiaToolCatalogue } from './gaia-tools/index.js';
-export declare const DEFAULT_GEMINI_MODEL = "gemini-2.5-pro";
-export interface GeminiAgentResult {
-    questionId: string;
-    finalAnswer: string | null;
-    turns: number;
-    toolCallsByName: Record<string, number>;
-    totalInputTokens: number;
-    totalOutputTokens: number;
-    totalThinkingTokens: number;
-    wallMs: number;
-    estimatedCostUsd: number;
-    timedOut?: boolean;
-    error?: string;
-}
-export interface GeminiAgentOptions {
-    model?: string;
-    maxTurns?: number;
-    maxTokensPerTurn?: number;
-    perTurnTimeoutMs?: number;
-    apiKey?: string;
-    catalogue?: GaiaToolCatalogue;
-}
-export declare function resolveGeminiApiKey(apiKey?: string): string;
-export declare function runGeminiAgent(question: GaiaQuestion, options?: GeminiAgentOptions): Promise<GeminiAgentResult>;
-export declare function isGeminiAnswerCorrect(modelAnswer: string, expected: string): boolean;
-//# sourceMappingURL=gaia-agent-gemini.d.ts.map

package/dist/src/benchmarks/gaia-agent-gemini.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"gaia-agent-gemini.d.ts","sourceRoot":"","sources":["../../../src/benchmarks/gaia-agent-gemini.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;GAsBG;AAKH,OAAO,EACL,YAAY,EACb,MAAM,kBAAkB,CAAC;AAC1B,OAAO,EAEL,iBAAiB,EAElB,MAAM,uBAAuB,CAAC;AAO/B,eAAO,MAAM,oBAAoB,mBAAmB,CAAC;AAerD,MAAM,WAAW,iBAAiB;IAChC,UAAU,EAAE,MAAM,CAAC;IACnB,WAAW,EAAE,MAAM,GAAG,IAAI,CAAC;IAC3B,KAAK,EAAE,MAAM,CAAC;IACd,eAAe,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IACxC,gBAAgB,EAAE,MAAM,CAAC;IACzB,iBAAiB,EAAE,MAAM,CAAC;IAC1B,mBAAmB,EAAE,MAAM,CAAC;IAC5B,MAAM,EAAE,MAAM,CAAC;IACf,gBAAgB,EAAE,MAAM,CAAC;IACzB,QAAQ,CAAC,EAAE,OAAO,CAAC;IACnB,KAAK,CAAC,EAAE,MAAM,CAAC;CAChB;AAED,MAAM,WAAW,kBAAkB;IACjC,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,gBAAgB,CAAC,EAAE,MAAM,CAAC;IAC1B,gBAAgB,CAAC,EAAE,MAAM,CAAC;IAC1B,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,SAAS,CAAC,EAAE,iBAAiB,CAAC;CAC/B;AAMD,wBAAgB,mBAAmB,CAAC,MAAM,CAAC,EAAE,MAAM,GAAG,MAAM,CAmB3D;AAiND,wBAAsB,cAAc,CAClC,QAAQ,EAAE,YAAY,EACtB,OAAO,GAAE,kBAAuB,GAC/B,OAAO,CAAC,iBAAiB,CAAC,CA0J5B;AAaD,wBAAgB,qBAAqB,CAAC,WAAW,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,GAAG,OAAO,CAgBpF"}