@tangle-network/agent-eval 0.200.1 → 0.201.0
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/CHANGELOG.md +4 -0
- package/dist/adapters/http.d.ts +7 -8
- package/dist/adapters/http.d.ts.map +1 -1
- package/dist/adapters/http.js +2 -2
- package/dist/adapters/http.js.map +1 -1
- package/dist/agent-profile-DDfIjdyS.d.ts.map +1 -1
- package/dist/analyst/index.d.ts +76 -76
- package/dist/analyst/index.d.ts.map +1 -1
- package/dist/analyst/index.js +6 -6
- package/dist/{analyze-runs-DFbp2gB8.js → analyze-runs-BrIibNd0.js} +47 -42
- package/dist/{analyze-runs-DFbp2gB8.js.map → analyze-runs-BrIibNd0.js.map} +1 -1
- package/dist/{ast-CP9ae9B0.js → ast-DJ6Bc7ab.js} +5 -4
- package/dist/{ast-CP9ae9B0.js.map → ast-DJ6Bc7ab.js.map} +1 -1
- package/dist/authenticity/index.d.ts +14 -15
- package/dist/authenticity/index.d.ts.map +1 -1
- package/dist/{baseline-BC-eBZ7U.js → baseline-CVKsfWTg.js} +2 -2
- package/dist/{baseline-BC-eBZ7U.js.map → baseline-CVKsfWTg.js.map} +1 -1
- package/dist/{benchmark-BeQJyrRC.js → benchmark-BywPeAUo.js} +4 -3
- package/dist/{benchmark-BeQJyrRC.js.map → benchmark-BywPeAUo.js.map} +1 -1
- package/dist/{benchmark-command-EBmuMUBo.js → benchmark-command-DFs_i62N.js} +24 -23
- package/dist/{benchmark-command-EBmuMUBo.js.map → benchmark-command-DFs_i62N.js.map} +1 -1
- package/dist/benchmarks/index.d.ts +12 -12
- package/dist/benchmarks/index.d.ts.map +1 -1
- package/dist/benchmarks/index.js +3 -3
- package/dist/{bounded-process-BBZob7vl.js → bounded-process-Cj9YjXbE.js} +3 -3
- package/dist/{bounded-process-BBZob7vl.js.map → bounded-process-Cj9YjXbE.js.map} +1 -1
- package/dist/builder-eval/index.d.ts +16 -17
- package/dist/builder-eval/index.d.ts.map +1 -1
- package/dist/builder-eval/index.js +12 -10
- package/dist/builder-eval/index.js.map +1 -1
- package/dist/campaign/index.js +11 -11
- package/dist/{campaign-L391bmir.js → campaign-PmTWZi72.js} +30 -25
- package/dist/{campaign-L391bmir.js.map → campaign-PmTWZi72.js.map} +1 -1
- package/dist/{campaign-evidence-jL_U7Ikv.js → campaign-evidence-Dt_rWPk2.js} +4 -4
- package/dist/{campaign-evidence-jL_U7Ikv.js.map → campaign-evidence-Dt_rWPk2.js.map} +1 -1
- package/dist/{chat-client-CJORSG_J.js → chat-client-DUhWNQQS.js} +5 -4
- package/dist/{chat-client-CJORSG_J.js.map → chat-client-DUhWNQQS.js.map} +1 -1
- package/dist/{chat-json-call-DnlDjpco.js → chat-json-call-Dx_sHzqm.js} +2 -2
- package/dist/{chat-json-call-DnlDjpco.js.map → chat-json-call-Dx_sHzqm.js.map} +1 -1
- package/dist/{claim-V9Zqbq0J.js → claim-BXcZw-jo.js} +2 -2
- package/dist/{claim-V9Zqbq0J.js.map → claim-BXcZw-jo.js.map} +1 -1
- package/dist/cli.js +12 -11
- package/dist/cli.js.map +1 -1
- package/dist/contract/index.js +22 -19
- package/dist/contract/index.js.map +1 -1
- package/dist/{default-registry-xMLX160E.js → default-registry-D4qXx2aG.js} +2 -2
- package/dist/{default-registry-xMLX160E.js.map → default-registry-D4qXx2aG.js.map} +1 -1
- package/dist/define-agent-eval-1YuvJpOs.d.ts.map +1 -1
- package/dist/{define-agent-eval-7q_UwsTt.js → define-agent-eval-CJN9dTQw.js} +10 -9
- package/dist/{define-agent-eval-7q_UwsTt.js.map → define-agent-eval-CJN9dTQw.js.map} +1 -1
- package/dist/{descriptive-1V17A-qa.js → descriptive-D9LUFk1-.js} +2 -2
- package/dist/{descriptive-1V17A-qa.js.map → descriptive-D9LUFk1-.js.map} +1 -1
- package/dist/diagnosis/index.d.ts +7 -7
- package/dist/diagnosis/index.d.ts.map +1 -1
- package/dist/diagnosis/index.js +2 -2
- package/dist/diagnosis/index.js.map +1 -1
- package/dist/{dspy-rlm-engine-B5T43BkZ.js → dspy-rlm-engine-US8YsYGq.js} +5 -5
- package/dist/{dspy-rlm-engine-B5T43BkZ.js.map → dspy-rlm-engine-US8YsYGq.js.map} +1 -1
- package/dist/{eval-campaign-GapmPHIA.js → eval-campaign-ha_aWtk7.js} +14 -12
- package/dist/{eval-campaign-GapmPHIA.js.map → eval-campaign-ha_aWtk7.js.map} +1 -1
- package/dist/evaluation.d.ts +9 -10
- package/dist/evaluation.d.ts.map +1 -1
- package/dist/experiment/index.d.ts +29 -29
- package/dist/experiment/index.d.ts.map +1 -1
- package/dist/experiment/index.js +13 -12
- package/dist/experiment/index.js.map +1 -1
- package/dist/{exporters-DEcXbvgO.js → exporters-Coiv-qO2.js} +2 -2
- package/dist/{exporters-DEcXbvgO.js.map → exporters-Coiv-qO2.js.map} +1 -1
- package/dist/{external-optimizer-process-CEXcCKqd.js → external-optimizer-process-KLcw0Vnc.js} +2 -2
- package/dist/{external-optimizer-process-CEXcCKqd.js.map → external-optimizer-process-KLcw0Vnc.js.map} +1 -1
- package/dist/{external-optimizer-subprocess-laM1-UDV.js → external-optimizer-subprocess-CkyUUV7h.js} +4 -4
- package/dist/{external-optimizer-subprocess-laM1-UDV.js.map → external-optimizer-subprocess-CkyUUV7h.js.map} +1 -1
- package/dist/fuzz.d.ts +15 -15
- package/dist/fuzz.d.ts.map +1 -1
- package/dist/{hf-dataset-CRqtSjnR.js → hf-dataset-kjIfIK_e.js} +3 -3
- package/dist/{hf-dataset-CRqtSjnR.js.map → hf-dataset-kjIfIK_e.js.map} +1 -1
- package/dist/hosted/index.d.ts +8 -8
- package/dist/hosted/index.d.ts.map +1 -1
- package/dist/hosted/index.js +1 -1
- package/dist/{index-D4pC7Tvd2.d.ts → index-D4pC7Tvd.d.ts} +1 -1
- package/dist/index-D4pC7Tvd.d.ts.map +1 -0
- package/dist/index-DKmrHA02.d.ts.map +1 -1
- package/dist/{index-DNgf5gyG2.d.ts → index-DNgf5gyG.d.ts} +1 -1
- package/dist/index-DNgf5gyG.d.ts.map +1 -0
- package/dist/index.d.ts +124 -124
- package/dist/index.d.ts.map +1 -1
- package/dist/index.js +52 -42
- package/dist/index.js.map +1 -1
- package/dist/{integrity-BFP4kjGj.js → integrity-BvnVARVl.js} +30 -29
- package/dist/{integrity-BFP4kjGj.js.map → integrity-BvnVARVl.js.map} +1 -1
- package/dist/{integrity-BvHANvnp.js → integrity-uwK7XC-8.js} +2 -2
- package/dist/{integrity-BvHANvnp.js.map → integrity-uwK7XC-8.js.map} +1 -1
- package/dist/{internal-BMFSR8Ns.js → internal-BOe3zmjQ.js} +2 -2
- package/dist/{internal-BMFSR8Ns.js.map → internal-BOe3zmjQ.js.map} +1 -1
- package/dist/{jev-review-Cu9xtIu4.js → jev-review-DZEjDzlF.js} +7 -5
- package/dist/{jev-review-Cu9xtIu4.js.map → jev-review-DZEjDzlF.js.map} +1 -1
- package/dist/jev.d.ts +10 -10
- package/dist/jev.d.ts.map +1 -1
- package/dist/jev.js +2 -2
- package/dist/{judge-calibration-DYmaBtJr.js → judge-calibration-C5zgtiJT.js} +2 -2
- package/dist/{judge-calibration-DYmaBtJr.js.map → judge-calibration-C5zgtiJT.js.map} +1 -1
- package/dist/kind-factory-CdPPHtGZ.js.map +1 -1
- package/dist/{llm-client-c_bKHTXz.js → llm-client-Bhqoglar.js} +6 -4
- package/dist/{llm-client-c_bKHTXz.js.map → llm-client-Bhqoglar.js.map} +1 -1
- package/dist/{llm-judge-CL6f3utD.js → llm-judge-C-0P1WiT.js} +26 -21
- package/dist/{llm-judge-CL6f3utD.js.map → llm-judge-C-0P1WiT.js.map} +1 -1
- package/dist/matrix/index.d.ts +1 -1
- package/dist/matrix/index.js +1 -1
- package/dist/{matrix-_NLSWsKM.d.ts → matrix--IZKROxD.d.ts} +2 -2
- package/dist/{matrix-_NLSWsKM.d.ts.map → matrix--IZKROxD.d.ts.map} +1 -1
- package/dist/{matrix-pWinRMPl.js → matrix-DnlHn5x1.js} +8 -6
- package/dist/{matrix-pWinRMPl.js.map → matrix-DnlHn5x1.js.map} +1 -1
- package/dist/meta-eval/index.d.ts +55 -55
- package/dist/meta-eval/index.d.ts.map +1 -1
- package/dist/meta-eval/index.js +4 -4
- package/dist/{mint-iCD-W43s.js → mint-vlRckJEX.js} +2 -2
- package/dist/{mint-iCD-W43s.js.map → mint-vlRckJEX.js.map} +1 -1
- package/dist/multishot/golden/index.d.ts +23 -23
- package/dist/multishot/golden/index.d.ts.map +1 -1
- package/dist/multishot/golden/index.js +1 -1
- package/dist/multishot/index.d.ts +9 -9
- package/dist/multishot/index.d.ts.map +1 -1
- package/dist/multishot/index.js +1 -1
- package/dist/openapi.json +1 -1
- package/dist/{otel-spans-CQmSxtcS.js → otel-spans-C8YIJWy1.js} +9 -4
- package/dist/{otel-spans-CQmSxtcS.js.map → otel-spans-C8YIJWy1.js.map} +1 -1
- package/dist/{outcome-store-BXlkwMPR.js → outcome-store-DUcMj-3D.js} +2 -2
- package/dist/{outcome-store-BXlkwMPR.js.map → outcome-store-DUcMj-3D.js.map} +1 -1
- package/dist/package-version-D7lQHt_-.js.map +1 -1
- package/dist/{paired-arms-DKZFVPt8.js → paired-arms-DpS_h8ON.js} +8 -5
- package/dist/{paired-arms-DKZFVPt8.js.map → paired-arms-DpS_h8ON.js.map} +1 -1
- package/dist/{paired-binary-fzkwENI4.js → paired-binary-OMBVRtc-.js} +2 -2
- package/dist/{paired-binary-fzkwENI4.js.map → paired-binary-OMBVRtc-.js.map} +1 -1
- package/dist/{paired-promotion-decision-D5B1Cxc2.js → paired-promotion-decision-DhrmjdV8.js} +5 -4
- package/dist/{paired-promotion-decision-D5B1Cxc2.js.map → paired-promotion-decision-DhrmjdV8.js.map} +1 -1
- package/dist/{paired-tests-C8iCsioC.js → paired-tests-Ccr16gcW.js} +3 -3
- package/dist/{paired-tests-C8iCsioC.js.map → paired-tests-Ccr16gcW.js.map} +1 -1
- package/dist/pipelines/index.d.ts +19 -19
- package/dist/pipelines/index.d.ts.map +1 -1
- package/dist/pipelines/index.js +5 -4
- package/dist/pipelines/index.js.map +1 -1
- package/dist/{power-and-mde-K_CmO3dc.js → power-and-mde-bie6i965.js} +9 -6
- package/dist/{power-and-mde-K_CmO3dc.js.map → power-and-mde-bie6i965.js.map} +1 -1
- package/dist/{produced-state-DZMW8cuF.js → produced-state-CR2tAPLf.js} +8 -5
- package/dist/{produced-state-DZMW8cuF.js.map → produced-state-CR2tAPLf.js.map} +1 -1
- package/dist/{promotion-policy-C6FAJvmZ.js → promotion-policy-BI1RxzwD.js} +4 -4
- package/dist/{promotion-policy-C6FAJvmZ.js.map → promotion-policy-BI1RxzwD.js.map} +1 -1
- package/dist/{raw-provider-sink-CXuOhLvT.js → raw-provider-sink-rB2DYxr6.js} +2 -2
- package/dist/{raw-provider-sink-CXuOhLvT.js.map → raw-provider-sink-rB2DYxr6.js.map} +1 -1
- package/dist/{release-confidence-XQm_xjhR.js → release-confidence-CiFg1EPq.js} +3 -2
- package/dist/{release-confidence-XQm_xjhR.js.map → release-confidence-CiFg1EPq.js.map} +1 -1
- package/dist/{report-command-DKJ_yAIj.js → report-command-DzPpFgjB.js} +20 -18
- package/dist/{report-command-DKJ_yAIj.js.map → report-command-DzPpFgjB.js.map} +1 -1
- package/dist/reporting.js +5 -5
- package/dist/{reward-hacking-D0XwhVWE.js → reward-hacking-C-a__ShZ.js} +5 -3
- package/dist/{reward-hacking-D0XwhVWE.js.map → reward-hacking-C-a__ShZ.js.map} +1 -1
- package/dist/rl.d.ts +186 -186
- package/dist/rl.d.ts.map +1 -1
- package/dist/rl.js +21 -17
- package/dist/rl.js.map +1 -1
- package/dist/rollout/index.d.ts +1 -1
- package/dist/rollout/index.js +5 -5
- package/dist/{rollout-B-XBReTC.js → rollout-BUQixCoc.js} +5 -5
- package/dist/{rollout-B-XBReTC.js.map → rollout-BUQixCoc.js.map} +1 -1
- package/dist/{rubric-predictive-validity-CCK-1B7w.js → rubric-predictive-validity-B0Pg-3I5.js} +3 -3
- package/dist/{rubric-predictive-validity-CCK-1B7w.js.map → rubric-predictive-validity-B0Pg-3I5.js.map} +1 -1
- package/dist/{run-record-tNnlQIrD.js → run-record-BB290Y9A.js} +5 -3
- package/dist/{run-record-tNnlQIrD.js.map → run-record-BB290Y9A.js.map} +1 -1
- package/dist/{schema-C1aaAxTf.js → schema-DAMp77zB.js} +24 -20
- package/dist/{schema-C1aaAxTf.js.map → schema-DAMp77zB.js.map} +1 -1
- package/dist/search/index.d.ts +34 -34
- package/dist/search/index.d.ts.map +1 -1
- package/dist/search/index.js +2 -2
- package/dist/{search-kernel-AVgIjXaI.js → search-kernel-Dpniloks.js} +33 -26
- package/dist/{search-kernel-AVgIjXaI.js.map → search-kernel-Dpniloks.js.map} +1 -1
- package/dist/{search-ledger-CL0-mXQ8.js → search-ledger-CXQPwdWz.js} +4 -3
- package/dist/{search-ledger-CL0-mXQ8.js.map → search-ledger-CXQPwdWz.js.map} +1 -1
- package/dist/{search-shipper-Cs6K4km9.js → search-shipper-DhhofkDX.js} +3 -6
- package/dist/{search-shipper-Cs6K4km9.js.map → search-shipper-DhhofkDX.js.map} +1 -1
- package/dist/{search-summary-DvWk0hb3.js → search-summary-C1nAHgkB.js} +4 -4
- package/dist/{search-summary-DvWk0hb3.js.map → search-summary-C1nAHgkB.js.map} +1 -1
- package/dist/{semantic-concept-judge-2SE_kXGF.js → semantic-concept-judge-BcjYg37z.js} +4 -4
- package/dist/{semantic-concept-judge-2SE_kXGF.js.map → semantic-concept-judge-BcjYg37z.js.map} +1 -1
- package/dist/{sequential-Yz3OSskl.js → sequential-DWn_np6P.js} +2 -3
- package/dist/{sequential-Yz3OSskl.js.map → sequential-DWn_np6P.js.map} +1 -1
- package/dist/{server-D56r1lhp.js → server-B4jMhqQn.js} +2 -2
- package/dist/{server-D56r1lhp.js.map → server-B4jMhqQn.js.map} +1 -1
- package/dist/{skillopt-optimization-method-B2syNik0.js → skillopt-optimization-method-Bls9t-G_.js} +9 -9
- package/dist/{skillopt-optimization-method-B2syNik0.js.map → skillopt-optimization-method-Bls9t-G_.js.map} +1 -1
- package/dist/{statistical-heldout-BAFDCo07.js → statistical-heldout-CNLOvRq_.js} +3 -3
- package/dist/{statistical-heldout-BAFDCo07.js.map → statistical-heldout-CNLOvRq_.js.map} +1 -1
- package/dist/statistical-heldout-HswMvzbP.d.ts.map +1 -1
- package/dist/{store-DNe_Uv1Q.js → store-BhNuLdJw.js} +3 -5
- package/dist/{store-DNe_Uv1Q.js.map → store-BhNuLdJw.js.map} +1 -1
- package/dist/store-C4avFjIi.d.ts.map +1 -1
- package/dist/{store-otlp-BPowgPm6.js → store-otlp-yd9lDziN.js} +2 -2
- package/dist/{store-otlp-BPowgPm6.js.map → store-otlp-yd9lDziN.js.map} +1 -1
- package/dist/{store-tool-spans-BaGakFc2.js → store-tool-spans-Biio4_Nw.js} +4 -4
- package/dist/{store-tool-spans-BaGakFc2.js.map → store-tool-spans-Biio4_Nw.js.map} +1 -1
- package/dist/storyboard/index.d.ts +20 -21
- package/dist/storyboard/index.d.ts.map +1 -1
- package/dist/{student-t-BA-Uy51p.js → student-t-BBZYka0E.js} +4 -3
- package/dist/{student-t-BA-Uy51p.js.map → student-t-BBZYka0E.js.map} +1 -1
- package/dist/{summary-report-BeYnvddy.js → summary-report-DLzptLSA.js} +8 -7
- package/dist/{summary-report-BeYnvddy.js.map → summary-report-DLzptLSA.js.map} +1 -1
- package/dist/supervisor-run/index.d.ts +25 -25
- package/dist/supervisor-run/index.d.ts.map +1 -1
- package/dist/supervisor-run/index.js +2 -2
- package/dist/{tool-waste-CJDfxH45.js → tool-waste-B-u3rzCz.js} +11 -6
- package/dist/{tool-waste-CJDfxH45.js.map → tool-waste-B-u3rzCz.js.map} +1 -1
- package/dist/trace-repair/index.d.ts +96 -96
- package/dist/trace-repair/index.d.ts.map +1 -1
- package/dist/trace-repair/index.js +1 -1
- package/dist/trace-repair/index.js.map +1 -1
- package/dist/traces.d.ts +29 -29
- package/dist/traces.d.ts.map +1 -1
- package/dist/traces.js +9 -7
- package/dist/traces.js.map +1 -1
- package/dist/trajectory-replay/index.d.ts +35 -35
- package/dist/trajectory-replay/index.d.ts.map +1 -1
- package/dist/trajectory-replay/index.js +5 -5
- package/dist/trajectory-replay/index.js.map +1 -1
- package/dist/{tree-Ki_gW7z8.js → tree-D48IJUK0.js} +39 -31
- package/dist/{tree-Ki_gW7z8.js.map → tree-D48IJUK0.js.map} +1 -1
- package/dist/wire/index.d.ts +48 -48
- package/dist/wire/index.d.ts.map +1 -1
- package/dist/wire/index.js +1 -1
- package/package.json +18 -36
- package/dist/index-D4pC7Tvd2.d.ts.map +0 -1
- package/dist/index-DNgf5gyG2.d.ts.map +0 -1
package/dist/search/index.d.ts
CHANGED
|
@@ -4,9 +4,9 @@ import { $ as EXPANSION_OPERATORS, L as SearchPolicy, M as SearchUnitExtension,
|
|
|
4
4
|
import { AgentProfileResourceRef } from "@tangle-network/agent-interface";
|
|
5
5
|
//#region src/search/lenses/edit-credit.d.ts
|
|
6
6
|
/** Signal name a policy reads. */
|
|
7
|
-
declare const EDIT_CREDIT_SIGNAL = "reusableHunks";
|
|
7
|
+
export declare const EDIT_CREDIT_SIGNAL = "reusableHunks";
|
|
8
8
|
/** The estimator every gene credit names. */
|
|
9
|
-
declare const EDIT_CREDIT_ESTIMATOR: SearchSourceRef;
|
|
9
|
+
export declare const EDIT_CREDIT_ESTIMATOR: SearchSourceRef;
|
|
10
10
|
interface EditCreditOptions {
|
|
11
11
|
/**
|
|
12
12
|
* The parsed content a node's artifact reference names, or undefined when
|
|
@@ -211,10 +211,10 @@ type EditCreditResult = LensResult<EditCreditData, number | null> & {
|
|
|
211
211
|
* The edit-credit lens. Pure: the result depends only on `state` and what
|
|
212
212
|
* `readArtifact` returns for its references.
|
|
213
213
|
*/
|
|
214
|
-
declare function editCredit(state: SearchStateView, options: EditCreditOptions): EditCreditResult;
|
|
214
|
+
export declare function editCredit(state: SearchStateView, options: EditCreditOptions): EditCreditResult;
|
|
215
215
|
/** The lens as compact text: what `agent-eval search show --edit-credit`
|
|
216
216
|
* prints and a proposer can read. */
|
|
217
|
-
declare function editCreditText(result: EditCreditResult, options?: {
|
|
217
|
+
export declare function editCreditText(result: EditCreditResult, options?: {
|
|
218
218
|
limit?: number;
|
|
219
219
|
}): string;
|
|
220
220
|
//#endregion
|
|
@@ -269,7 +269,7 @@ interface FrontOptions {
|
|
|
269
269
|
* node reads 0, same as a dominated one, because "on the front" is the only
|
|
270
270
|
* claim this signal makes. */
|
|
271
271
|
type FrontSignal = Record<string, number>;
|
|
272
|
-
declare function front(state: SearchStateView, options?: FrontOptions): {
|
|
272
|
+
export declare function front(state: SearchStateView, options?: FrontOptions): {
|
|
273
273
|
data: FrontData;
|
|
274
274
|
signal: {
|
|
275
275
|
name: string;
|
|
@@ -306,7 +306,7 @@ interface GeometryLensResult<TData> extends LensResult<TData, number | null> {
|
|
|
306
306
|
* rung or the claim can no longer run (scored, final, cancelled, or errored
|
|
307
307
|
* with no attempt left). Cells a rung opened later do not un-screen it.
|
|
308
308
|
*/
|
|
309
|
-
declare function screenedNodes(state: SearchStateView, options?: {
|
|
309
|
+
export declare function screenedNodes(state: SearchStateView, options?: {
|
|
310
310
|
maxAttempts?: number;
|
|
311
311
|
}): string[];
|
|
312
312
|
//#endregion
|
|
@@ -351,7 +351,7 @@ interface SearchPlateau {
|
|
|
351
351
|
* order, which is registration order. Insufficient with fewer than `window`
|
|
352
352
|
* accepted nodes, or without a pooled variance above zero.
|
|
353
353
|
*/
|
|
354
|
-
declare function searchPlateau(view: SearchPlateauView, options?: SearchPlateauOptions): SearchPlateau;
|
|
354
|
+
export declare function searchPlateau(view: SearchPlateauView, options?: SearchPlateauOptions): SearchPlateau;
|
|
355
355
|
interface DraftOnPlateauOptions {
|
|
356
356
|
/** Accepted nodes the plateau's rise is measured across, and expansions
|
|
357
357
|
* between two drafts. Default 6. */
|
|
@@ -380,7 +380,7 @@ interface DraftOnPlateauOptions {
|
|
|
380
380
|
* `incumbent` expands only its leader, so a draft that starts below it is
|
|
381
381
|
* never refined.
|
|
382
382
|
*/
|
|
383
|
-
declare function draftOnPlateau(base: SearchPolicy, options?: DraftOnPlateauOptions): SearchPolicy;
|
|
383
|
+
export declare function draftOnPlateau(base: SearchPolicy, options?: DraftOnPlateauOptions): SearchPolicy;
|
|
384
384
|
//#endregion
|
|
385
385
|
//#region src/search/lenses/landscape.d.ts
|
|
386
386
|
/**
|
|
@@ -410,10 +410,10 @@ type LandscapeEmbedding = {
|
|
|
410
410
|
vector(node: SearchNode): readonly number[] | null;
|
|
411
411
|
};
|
|
412
412
|
/** The default: edits recorded between two profiles along the lineage. */
|
|
413
|
-
declare function lineageEdits(): LandscapeEmbedding;
|
|
413
|
+
export declare function lineageEdits(): LandscapeEmbedding;
|
|
414
414
|
/** Surfaces whose content digests differ: the edit distance between two
|
|
415
415
|
* profiles at the granularity of their declared surfaces. */
|
|
416
|
-
declare function surfaceDigestEdits(): LandscapeEmbedding;
|
|
416
|
+
export declare function surfaceDigestEdits(): LandscapeEmbedding;
|
|
417
417
|
/**
|
|
418
418
|
* Line edits between the surfaces' texts: for each declared surface, the
|
|
419
419
|
* fewest line insertions and deletions that turn one text into the other
|
|
@@ -422,19 +422,19 @@ declare function surfaceDigestEdits(): LandscapeEmbedding;
|
|
|
422
422
|
* cannot be read, which leaves every distance of that node unknown. The lens
|
|
423
423
|
* stays pure; the caller owns the I/O and its verification.
|
|
424
424
|
*/
|
|
425
|
-
declare function surfaceTextEdits(read: (surface: SearchCandidateSurface) => unknown): LandscapeEmbedding;
|
|
425
|
+
export declare function surfaceTextEdits(read: (surface: SearchCandidateSurface) => unknown): LandscapeEmbedding;
|
|
426
426
|
/** A caller's vector per node, for example a model embedding of its profile. */
|
|
427
|
-
declare function vectorEmbedding(name: string, vector: (node: SearchNode) => readonly number[] | null): LandscapeEmbedding;
|
|
427
|
+
export declare function vectorEmbedding(name: string, vector: (node: SearchNode) => readonly number[] | null): LandscapeEmbedding;
|
|
428
428
|
/**
|
|
429
429
|
* JSON as lines a diff can count: one line per scalar leaf, `path=value`, and
|
|
430
430
|
* one line per line of a string, so an edit inside a long prompt counts the
|
|
431
431
|
* lines it changed rather than the whole prompt. Object keys are visited in
|
|
432
432
|
* code-unit order.
|
|
433
433
|
*/
|
|
434
|
-
declare function profileTextLines(value: unknown, path?: string): string[];
|
|
434
|
+
export declare function profileTextLines(value: unknown, path?: string): string[];
|
|
435
435
|
/** Fewest line insertions plus deletions turning `a` into `b` (Myers' O(ND)
|
|
436
436
|
* greedy algorithm, which is fast when the texts are close). */
|
|
437
|
-
declare function lineEditDistance(a: readonly string[], b: readonly string[]): number;
|
|
437
|
+
export declare function lineEditDistance(a: readonly string[], b: readonly string[]): number;
|
|
438
438
|
interface LandscapeOptions {
|
|
439
439
|
/** The split scores come from. Default: the ranked split. */
|
|
440
440
|
split?: 'selection' | 'train';
|
|
@@ -580,16 +580,16 @@ interface LandscapeData {
|
|
|
580
580
|
* score over the placement, the basins of that surface, and the plateau
|
|
581
581
|
* signal. Pure: it reads the state and calls `embed`.
|
|
582
582
|
*/
|
|
583
|
-
declare function landscape(state: SearchStateView, embed?: LandscapeEmbedding, options?: LandscapeOptions): GeometryLensResult<LandscapeData>;
|
|
583
|
+
export declare function landscape(state: SearchStateView, embed?: LandscapeEmbedding, options?: LandscapeOptions): GeometryLensResult<LandscapeData>;
|
|
584
584
|
/**
|
|
585
585
|
* The symmetric k-nearest-neighbour graph of points in any dimension: each
|
|
586
586
|
* point joins its k nearest (ties by index) and every edge is kept in both
|
|
587
587
|
* directions. Brute force, so callers keep n in the low thousands.
|
|
588
588
|
*/
|
|
589
|
-
declare function nearestNeighbours(points: readonly (readonly number[])[], k: number): number[][];
|
|
589
|
+
export declare function nearestNeighbours(points: readonly (readonly number[])[], k: number): number[][];
|
|
590
590
|
/** The landscape as text for a terminal or a proposer's context: the same
|
|
591
591
|
* numbers the view draws, with a coarse shaded map. */
|
|
592
|
-
declare function formatLandscape(lens: GeometryLensResult<LandscapeData>): string;
|
|
592
|
+
export declare function formatLandscape(lens: GeometryLensResult<LandscapeData>): string;
|
|
593
593
|
//#endregion
|
|
594
594
|
//#region src/search/lenses/meta-search.d.ts
|
|
595
595
|
/** The configuration that ran a search, as its ledger records it. */
|
|
@@ -817,26 +817,26 @@ interface MetaSearchOptions {
|
|
|
817
817
|
objective?: string;
|
|
818
818
|
}
|
|
819
819
|
/** The signal's name, as a policy or a view reads it. */
|
|
820
|
-
declare const META_SEARCH_SIGNAL = "metaSearch.bestPolicyConfiguration";
|
|
820
|
+
export declare const META_SEARCH_SIGNAL = "metaSearch.bestPolicyConfiguration";
|
|
821
821
|
/** The per-search score `metaSearchScore` computes. An outer search names it
|
|
822
822
|
* as its objective's judge. */
|
|
823
|
-
declare const META_SEARCH_SCORE_SOURCE: SearchSourceRef;
|
|
823
|
+
export declare const META_SEARCH_SCORE_SOURCE: SearchSourceRef;
|
|
824
824
|
/**
|
|
825
825
|
* The genome of a search: the configuration its ledger records. Declared
|
|
826
826
|
* parts come from the header; the proposer comes from what the edges and
|
|
827
827
|
* candidate-generation operations name, because the header declares none.
|
|
828
828
|
*/
|
|
829
|
-
declare function searchPolicyGenome(state: SearchStateView): SearchPolicyGenome;
|
|
829
|
+
export declare function searchPolicyGenome(state: SearchStateView): SearchPolicyGenome;
|
|
830
830
|
/**
|
|
831
831
|
* A search's held-out lift per known dollar, from its claim and its test
|
|
832
832
|
* cells. Pure; it reads the test split, so a policy view (which holds no test
|
|
833
833
|
* cells) cannot call it; an outer search reads it from a closed inner search.
|
|
834
834
|
*/
|
|
835
|
-
declare function metaSearchScore(state: SearchStateView): MetaSearchScore;
|
|
835
|
+
export declare function metaSearchScore(state: SearchStateView): MetaSearchScore;
|
|
836
836
|
/** The lens: every search as a node of a search of searches. */
|
|
837
|
-
declare function metaSearch(searches: readonly SearchStateView[], options?: MetaSearchOptions): LensResult<MetaSearchData, BestPolicyConfiguration>;
|
|
837
|
+
export declare function metaSearch(searches: readonly SearchStateView[], options?: MetaSearchOptions): LensResult<MetaSearchData, BestPolicyConfiguration>;
|
|
838
838
|
/** `subject · metric (direction)`: the key searches are compared within. */
|
|
839
|
-
declare function objectiveKey(header: NonNullable<SearchStateView['header']>): string;
|
|
839
|
+
export declare function objectiveKey(header: NonNullable<SearchStateView['header']>): string;
|
|
840
840
|
interface MetaSearchTextOptions {
|
|
841
841
|
/** Searches listed under each outer node or parent before the rest are
|
|
842
842
|
* counted. Default 5. */
|
|
@@ -848,7 +848,7 @@ interface MetaSearchTextOptions {
|
|
|
848
848
|
* searches grouped under the outer node that ran them. `agent-eval search show
|
|
849
849
|
* --meta` prints it.
|
|
850
850
|
*/
|
|
851
|
-
declare function renderMetaSearchText(result: LensResult<MetaSearchData, BestPolicyConfiguration>, options?: MetaSearchTextOptions): string;
|
|
851
|
+
export declare function renderMetaSearchText(result: LensResult<MetaSearchData, BestPolicyConfiguration>, options?: MetaSearchTextOptions): string;
|
|
852
852
|
//#endregion
|
|
853
853
|
//#region src/search/lenses/skill-manifold.d.ts
|
|
854
854
|
interface SkillManifoldOptions {
|
|
@@ -1023,13 +1023,13 @@ interface SkillManifoldData {
|
|
|
1023
1023
|
* intrinsic dimension, at least 1, and 1 when too few nodes cross-validate).
|
|
1024
1024
|
* Pure: it reads the state, and `calibration` when given.
|
|
1025
1025
|
*/
|
|
1026
|
-
declare function skillManifold(state: SearchStateView, k?: number | 'auto', options?: SkillManifoldOptions): GeometryLensResult<SkillManifoldData>;
|
|
1026
|
+
export declare function skillManifold(state: SearchStateView, k?: number | 'auto', options?: SkillManifoldOptions): GeometryLensResult<SkillManifoldData>;
|
|
1027
1027
|
/** The loadings of a fitted manifold, for a later search over the same units
|
|
1028
1028
|
* to place its nodes on. Null unless cross-validation found at least one skill
|
|
1029
1029
|
* axis (intrinsic dimension 1 or more), and, for the linear model, measured
|
|
1030
1030
|
* the cell noise: loadings of an axis the held-out cells do not support would
|
|
1031
1031
|
* steer allocation by noise. */
|
|
1032
|
-
declare function skillCalibration(lens: GeometryLensResult<SkillManifoldData>): SkillCalibration | null;
|
|
1032
|
+
export declare function skillCalibration(lens: GeometryLensResult<SkillManifoldData>): SkillCalibration | null;
|
|
1033
1033
|
/**
|
|
1034
1034
|
* The `asha` extension that adds, at each rung, the units that best separate
|
|
1035
1035
|
* the leaders: the greedy `nextUnit` batch from `calibration`'s loadings,
|
|
@@ -1038,11 +1038,11 @@ declare function skillCalibration(lens: GeometryLensResult<SkillManifoldData>):
|
|
|
1038
1038
|
* every calibrated unit). Where the lens cannot rank (fewer than 2 leaders,
|
|
1039
1039
|
* or no measured noise), `asha` fills the rung from its seeded order.
|
|
1040
1040
|
*/
|
|
1041
|
-
declare function nextUnitExtension(calibration: SkillCalibration, options?: {
|
|
1041
|
+
export declare function nextUnitExtension(calibration: SkillCalibration, options?: {
|
|
1042
1042
|
leaders?: number;
|
|
1043
1043
|
}): SearchUnitExtension;
|
|
1044
1044
|
/** The manifold as text for a terminal or a proposer's context. */
|
|
1045
|
-
declare function formatSkillManifold(lens: GeometryLensResult<SkillManifoldData>): string;
|
|
1045
|
+
export declare function formatSkillManifold(lens: GeometryLensResult<SkillManifoldData>): string;
|
|
1046
1046
|
//#endregion
|
|
1047
1047
|
//#region src/search/lenses/task-matrix.d.ts
|
|
1048
1048
|
interface TaskMatrixCell {
|
|
@@ -1090,7 +1090,7 @@ interface TaskMatrixOptions {
|
|
|
1090
1090
|
/** unitClusterId → specialist gain; a cluster whose gain is null (fewer than
|
|
1091
1091
|
* 2 contributing nodes or 6 units) is omitted, not zeroed. */
|
|
1092
1092
|
type TaskMatrixSignal = Record<string, number>;
|
|
1093
|
-
declare function taskMatrix(state: SearchStateView, options?: TaskMatrixOptions): {
|
|
1093
|
+
export declare function taskMatrix(state: SearchStateView, options?: TaskMatrixOptions): {
|
|
1094
1094
|
data: TaskMatrixData;
|
|
1095
1095
|
signal: {
|
|
1096
1096
|
name: string;
|
|
@@ -1126,7 +1126,7 @@ interface TreeData {
|
|
|
1126
1126
|
nodeCount: number;
|
|
1127
1127
|
edgeCount: number;
|
|
1128
1128
|
}
|
|
1129
|
-
declare function tree(state: SearchStateView): {
|
|
1129
|
+
export declare function tree(state: SearchStateView): {
|
|
1130
1130
|
data: TreeData;
|
|
1131
1131
|
signal: {
|
|
1132
1132
|
name: string;
|
|
@@ -1169,19 +1169,19 @@ interface RunNestedSearchOptions<TConfig> extends Omit<RunSearchOptions<TConfig>
|
|
|
1169
1169
|
adoptInner?(input: NestedSearchRunInput<TConfig>): Promise<SearchStateView | null>;
|
|
1170
1170
|
}
|
|
1171
1171
|
/** The deterministic id of the inner search one outer cell attempt runs. */
|
|
1172
|
-
declare function nestedSearchId(containment: NestedSearchContainment): string;
|
|
1172
|
+
export declare function nestedSearchId(containment: NestedSearchContainment): string;
|
|
1173
1173
|
/**
|
|
1174
1174
|
* The codec for a plain JSON configuration: the node is the configuration's
|
|
1175
1175
|
* canonical JSON, and the diff names each top-level key whose value changed.
|
|
1176
1176
|
*/
|
|
1177
|
-
declare function searchConfigCodec<TConfig>(): SearchArtifactCodec<TConfig>;
|
|
1177
|
+
export declare function searchConfigCodec<TConfig>(): SearchArtifactCodec<TConfig>;
|
|
1178
1178
|
/**
|
|
1179
1179
|
* Run an outer search over search configurations to its close, or continue
|
|
1180
1180
|
* one from its ledger. The outer search must maximize (its score is lift per
|
|
1181
1181
|
* dollar), its nodes must be `runtime-config` artifacts, and its judge must be
|
|
1182
1182
|
* `META_SEARCH_SCORE_SOURCE`.
|
|
1183
1183
|
*/
|
|
1184
|
-
declare function runNestedSearch<TConfig>(options: RunNestedSearchOptions<TConfig>): Promise<SearchRunResult>;
|
|
1184
|
+
export declare function runNestedSearch<TConfig>(options: RunNestedSearchOptions<TConfig>): Promise<SearchRunResult>;
|
|
1185
1185
|
//#endregion
|
|
1186
|
-
export { type BestPolicyConfiguration, type DraftOnPlateauOptions,
|
|
1186
|
+
export { type BestPolicyConfiguration, type DraftOnPlateauOptions, EXPANSION_OPERATORS, type EditCreditData, type EditCreditOptions, type EditCreditResult, type EditCreditSignal, type EditGene, type EditGeneVerdict, type EditInteraction, type EditIntroduction, type EditLineageRow, type EditSkillCandidate, type ExpansionOperator, type FrontData, type FrontExtraAxis, type FrontOptions, type FrontRow, type FrontSignal, type GeometryLensResult, type GeometrySignal, type LandscapeBasin, type LandscapeData, type LandscapeEmbedding, type LandscapeGrid, type LandscapeNode, type LandscapeOptions, type LensResult, type LensSignal, MIN_OUTCOMES_FOR_WEIGHT, type MetaSearchConfiguration, type MetaSearchConfigurationEstimate, type MetaSearchData, type MetaSearchEntry, type MetaSearchLiftPerUsd, type MetaSearchOptions, type MetaSearchParent, type MetaSearchScore, type MetaSearchSpend, type MetaSearchTextOptions, type MetaSearchUnscoredReason, type NestedSearchContainment, type NestedSearchRunInput, type OperatorOutcomeCounts, type OperatorYieldData, type OperatorYieldOptions, type OperatorYieldRow, type OperatorYieldSignal, type RunNestedSearchOptions, type SampleSummary, type SearchPlateau, type SearchPlateauOptions, type SearchPlateauView, type SearchPolicyGenome, type SkillCalibration, type SkillManifoldData, type SkillManifoldNextUnit, type SkillManifoldNode, type SkillManifoldOptions, type SkillManifoldUnit, type TaskMatrixCell, type TaskMatrixCluster, type TaskMatrixData, type TaskMatrixOptions, type TaskMatrixSignal, type TaskMatrixSpecialistRow, type TreeData, type TreeNode, operatorYield, rankingSplit, summarizeSamples };
|
|
1187
1187
|
//# sourceMappingURL=index.d.ts.map
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"index.d.ts","names":[],"sources":["../../src/search/lenses/edit-credit.ts","../../src/search/lenses/front.ts","../../src/search/lenses/geometry.ts","../../src/search/lenses/plateau.ts","../../src/search/lenses/landscape.ts","../../src/search/lenses/meta-search.ts","../../src/search/lenses/skill-manifold.ts","../../src/search/lenses/task-matrix.ts","../../src/search/lenses/tree.ts","../../src/search/nested-search.ts"],"mappings":";;;;;;
|
|
1
|
+
{"version":3,"file":"index.d.ts","names":[],"sources":["../../src/search/lenses/edit-credit.ts","../../src/search/lenses/front.ts","../../src/search/lenses/geometry.ts","../../src/search/lenses/plateau.ts","../../src/search/lenses/landscape.ts","../../src/search/lenses/meta-search.ts","../../src/search/lenses/skill-manifold.ts","../../src/search/lenses/task-matrix.ts","../../src/search/lenses/tree.ts","../../src/search/nested-search.ts"],"mappings":";;;;;;qBA4Da;;qBA8BA,uBAAuB;UAKnB;;;;;;EAMf,aAAa,KAAK;;;EAGlB,QAAQ;;;EAGR;;KAGU;UAEK;EACf;EACA;EACA,UAAU;EACV;;EAEA;;UAGe;EACf;EACA;;;EAGA;;EAEA;;EAEA;;;;EAIA,YAAY;;EAEZ;;;EAGA;;EAEA;;;EAGA;EACA;;IAEE;;IAEA;;IAEA;;IAEA;;;;EAIF,QAAQ;EACR,SAAS;;;;EAIT;;UAGe;EACf;;EAEA;IACE;IACA;IACA;IACA;;;EAGF;EACA,QAAQ;;;;EAIR;;;EAGA;EACA;;EAEA;;EAEA;EACA;;;EAGA;;UAGe;;;;EAIf,UAAU,QAAQ;IAA2B;;EAC7C;IAAkB;IAAmB;MAAU;;;;EAE/C;EACA;EACA,QAAQ;;UAGO;EACf;EACA;EACA;EACA;EACA;EACA,UAAU;EACV,QAAQ;;EAER;EACA;;UAGe;EACf,OAAO;EACP;EACA;;IAEE;;IAEA;;IAEA,SAAS;;;;EAIX;IAAS;IAAe;;EACxB;IAAS;IAAe;IAAwB;;;EAEhD,OAAO;EACP,QAAQ,OAAO;;;EAGf,YAAY,OAAO;EACnB;IACE;;IAEA;;IAEA;IACA;IACA;;IAEA,OAAO;;EAET,iBAAiB;;;EAGjB;;IAEE;;;IAGA;IACA;;;;EAIF,SAAS;EACT;IACE,WAAW;IACX;IACA;IACA;IACA;;IAEA;;;;;UAMa,yBAAyB;;EAExC;;;EAGA;;KAGU,mBAAmB,WAAW;EACxC,QAAQ;;;;;;wBA0CM,WAAW,OAAO,iBAAiB,SAAS,oBAAoB;;;wBAs8BhE,eAAe,QAAQ,kBAAkB;EAAW;;;;UCtvCnD;EACf;EACA;;;;EAIA,MAAM,OAAO,iBAAiB;;UAGf;EACf;;;EAGA;;EAEA;EACA,QAAQ;;;EAGR;;;EAGA;;;EAGA;;;EAGA;;EAEA,UAAU;;KAGA;UAEK;EACf;EACA;EACA,MAAM;EACN;;EAEA;;EAEA,YAAY,OAAO;;UAGJ;EACf;EACA,OAAO;;;;;KAMG,cAAc;wBAEV,MACd,OAAO,iBACP,UAAS;EACN,MAAM;EAAW;IAAU;IAAc,OAAO;;;;;;;UClEpC,uBAAuB;;;EAGtC;;EAEA;;EAEA;;EAEA;;UAGe,mBAAmB,eAAe,WAAW;;EAE5D;EACA;;EAEA;EACA,QAAQ;;;;;;;;;wBAaM,cACd,OAAO,iBACP;EAAW;;;;;KCtCD,oBAAoB,KAC9B;UAIe;;EAEf;;UAGe;;;EAGf;EACA;;;;EAIA;;EAEA;;;EAGA;;;EAGA;EACA;IAAQ;IAAgB;IAAc;;;;EAGtC;EACA;EACA;EACA;;;;;;;wBAUc,cACd,MAAM,mBACN,UAAS,uBACR;UA6Ec;;;EAGf;;;EAGA;;;;;;;;;;;;;;;;;;;;;;wBAuBc,eACd,MAAM,cACN,UAAS,wBACR;;;;;;;;;;;;;;KCzGS;EACN;EAAiB;EAAc;;EAE/B;EACA;EACA;EACA,SAAS,GAAG,YAAY,GAAG;;EAG3B;EACA;EACA;EACA,OAAO,MAAM;;;wBAIH,gBAAgB;;;wBAWhB,sBAAsB;;;;;;;;;wBA6BtB,iBACd,OAAO,SAAS,qCACf;;wBAoDa,gBACd,cACA,SAAS,MAAM,0CACd;;;;;;;wBAea,iBAAiB,gBAAgB;;;wBAuBjC,iBAAiB,sBAAsB;UA2BtC;;EAEf;;EAEA;;EAEA;;;EAGA;;EAEA;;EAEA;;UAGe;EACf;EACA;EACA;EACA,QAAQ;;EAER;;EAEA;EACA;EACA;;;EAGA;;;EAGA;EACA;EACA,QAAQ;;;EAGR;;UAGe;EACf;EACA;EACA;EACA;;;;EAIA;;EAEA;EACA;;;;EAIA;IACE;IACA;IACA;;IAEA;;;;IAIA;;IAEA;;EAEF;;UAGe;;EAEf;IAAQ;IAAgB;IAAW;IAAW;IAAe;;;;;EAI7D;;;EAGA;EACA;EACA;;UAGe;EACf;EACA;EACA;IACE;IACA;IACA;;;IAGA;MAAoB;MAAgB;;;IAEpC;;IAEA;;;IAGA;IACA;IACA;;EAEF,OAAO;;EAEP,SAAS;IAAQ;IAAgB;IAAe;;EAChD,MAAM;EACN;EACA;IACE;;IAEA;;IAEA;;;IAGA;;IAEA;;;IAGA;IACA;IACA;IACA;IACA,OAAO;;EAET,SAAS;;;;;;;wBAmBK,UACd,OAAO,iBACP,QAAO,oBACP,UAAS,mBACR,mBAAmB;;;;;;wBA+2BN,kBAAkB,wCAAwC;;;wBAkC1D,gBAAgB,MAAM,mBAAmB;;;;UC5tCxC;;;;EAIf;;EAEA;EACA;IACE;IACA;IACA;IACA;IACA;;;;EAIF,WACI;IAAQ,MAAM;IAAoB;IAAc,QAAQ;;IAEtD;;;;EAIN,mBACI;IACM;IAAe,OAAO;;IACtB;IAAuB,QAAQ;;IAEnC;;;;KAII;UAQK;EACf;;EAEA;;EAEA;;;;KAKU;EAEN;EACA;;EAEA;;EAGA;;;;EAIA;EACA;EACA;;EAEA;EAAmB;;KAEb;EAEN;EACA;;EAEA;;EAEA,UAAU;;EAEV;;EAEA;EACA,OAAO;EACP,YAAY;;EAGZ;EACA,UAAU;EACV,QAAQ;EACR;EACA,OAAO;;;KAID;EAEN;EACA;;EAEA;;EAEA;;EAGA;EACA;EACA;EACA;;;EAGA;EACA;;UAGW;EACf;EACA;EACA;IAAa;IAAgB;;;EAE7B;EACA;EACA,aAAa;EACb,QAAQ;EACR,cAAc;EACd;EACA;EACA;EACA;IAAS;IAAiB;;EAC1B;IACE,UAAU;IACV;IACA;IACA;;EAEF,OAAO;EACP,QAAQ;EACR;;EAEA;;;EAGA;IAAS,OAAO;IAA+C;;;;UAIhD;;;EAGf;EACA;EACA;EACA,QAAQ;EACR;;EAEA;;UAGe;EACf,cAAc;EACd;EACA,QAAQ;EACR;EACA;IAAa;IAAc;IAAc;IAA+B;;;EAExE;;EAEA;EACA,UAAU,QAAQ,OAAO;EACzB,UAAU;;;;EAIV,YAAY;IACV;IACA;IACA;IACA,oBAAoB;IACpB,eAAe;;;UAIF;EACf,UAAU;EACV;;EAEA,gBAAgB;EAChB;;EAEA;;;;UAKe;;EAEf;EACA;EACA,cAAc;EACd,QAAQ;EACR;EACA,QAAQ;EACR,gBAAgB;EAChB,OAAO;EACP;;;EAGA;EACA;;;;EAIA;IAAa;IAAkB;;;EAE/B;;UAGe;;EAEf;;;;EAIA;;;qBAIW;;;qBA2BA,0BAA0B;;;;;;wBAUvB,mBAAmB,OAAO,kBAAkB;;;;;;wBAkD5C,gBAAgB,OAAO,kBAAkB;;wBAgFzC,WACd,mBAAmB,mBACnB,UAAS,oBACR,WAAW,gBAAgB;;wBA8Fd,aAAa,QAAQ,YAAY;UA+QhC;;;EAGf;;;;;;;;wBASc,qBACd,QAAQ,WAAW,gBAAgB,0BACnC,UAAS;;;UC9wBM;;EAEf;;EAEA;;EAEA;;EAEA;;EAEA;;;EAGA;;;;;;EAMA;;;;EAIA;;;EAGA,cAAc;;;;EAId;;;;EAIA;IAAU;IAAe;;;;UAIV;;EAEf;;;EAGA,MAAM;;;EAGN;EACA;EACA;EACA;;;EAGA;;EAEA,OAAO;IAAQ;IAAgB;IAAc;;;KAGnC;UAEK;EACf;EACA;EACA,QAAQ;;EAER;;;EAGA;;EAEA;EACA;;UAGe;EACf;;EAEA;;;EAGA;;;EAGA;;;EAGA;;EAEA;;UAGe;EACf;;;EAGA;;EAEA;;UAGe;EACf;EACA;;EAEA;EACA;EACA;IACE;IACA;;IAEA;IACA;;IAEA;;IAEA;IACA;;EAEF;IACE;IACA,MAAM;IACN;IACA;IACA;IACA;IACA;IACA;;;EAGF;IACE,QAAQ;MAAQ;MAAc;;;IAE9B;IACA;;EAEF;IACE;IACA;;IAEA;IACA;IACA,OAAO;MAAQ;MAAc;MAAe;;IAC5C;;;EAGF;EACA;EACA,OAAO;EACP,OAAO;EACP,SAAS;IAAQ;IAAgB;IAAuB;;EACxD,WAAW;;;EAGX;EACA;;;;;;;wBA8Cc,cACd,OAAO,iBACP,qBACA,UAAS,uBACR,mBAAmB;;;;;;wBA0SN,iBACd,MAAM,mBAAmB,qBACxB;;;;;;;;;wBAg3Ba,kBACd,aAAa,kBACb;EAAW;IACV;;wBAsEa,oBAAoB,MAAM,mBAAmB;;;UCz8C5C;EACf;EACA;;;EAGA;;UAGe;;EAEf;EACA;;UAGe;EACf;EACA;;;;;EAKA;;EAEA;;EAEA;;EAEA;;UAGe;EACf;EACA;;EAEA;EACA;EACA;EACA,cAAc;EACd,cAAc;EACd,OAAO;EACP,gBAAgB;;UAGD;EACf;;;;KAKU,mBAAmB;wBAEf,WACd,OAAO,iBACP,UAAS;EACN,MAAM;EAAgB;IAAU;IAAc,OAAO;;;;;UCtEzC;EACf;EACA,QAAQ;EACR;;;EAGA;EACA;;;EAGA;EACA;EACA;;;EAGA,UAAU;EACV,UAAU;;UAGK;;;;;EAKf,OAAO;EACP;EACA;;wBAGc,KAAK,OAAO;EAC1B,MAAM;EACN;IAAU;IAAc;;;;;;KCId,0BAA0B,YAAY;;UAGjC,qBAAqB;EACpC,QAAQ;;EAER,aAAa;;;;EAIb;EACA;IAAQ;IAAgB;IAAgB,OAAO;IAAa;;EAC5D,QAAQ;;UAGO,uBAAuB,iBAC9B,KAAK,iBAAiB;;;EAG9B,QAAQ,oBAAoB;;;EAG5B,MAAM;;;EAGN,SAAS,OAAO,qBAAqB,WAAW,QAAQ;;;EAGxD,YAAY,OAAO,qBAAqB,WAAW,QAAQ;;;wBAI7C,eAAe,aAAa;;;;;wBAS5B,kBAAkB,YAAY,oBAAoB;;;;;;;wBA6B5C,gBAAgB,SACpC,SAAS,uBAAuB,WAC/B,QAAQ"}
|
package/dist/search/index.js
CHANGED
|
@@ -1,6 +1,6 @@
|
|
|
1
1
|
import { a as hashCanonical } from "../canonical-BsZVgBhW.js";
|
|
2
|
-
import { _ as rankingSplit, h as operatorYield, m as MIN_OUTCOMES_FOR_WEIGHT, n as runSearch, p as EXPANSION_OPERATORS, v as summarizeSamples } from "../search-kernel-
|
|
3
|
-
import { A as editCreditText, C as draftOnPlateau, D as EDIT_CREDIT_ESTIMATOR, E as front, O as EDIT_CREDIT_SIGNAL, S as vectorEmbedding, T as screenedNodes, _ as lineageEdits, a as skillCalibration, b as surfaceDigestEdits, c as META_SEARCH_SIGNAL, d as objectiveKey, f as renderMetaSearchText, g as lineEditDistance, h as landscape, i as nextUnitExtension, k as editCredit, l as metaSearch, m as formatLandscape, n as taskMatrix, o as skillManifold, p as searchPolicyGenome, r as formatSkillManifold, s as META_SEARCH_SCORE_SOURCE, t as tree, u as metaSearchScore, v as nearestNeighbours, w as searchPlateau, x as surfaceTextEdits, y as profileTextLines } from "../tree-
|
|
2
|
+
import { _ as rankingSplit, h as operatorYield, m as MIN_OUTCOMES_FOR_WEIGHT, n as runSearch, p as EXPANSION_OPERATORS, v as summarizeSamples } from "../search-kernel-Dpniloks.js";
|
|
3
|
+
import { A as editCreditText, C as draftOnPlateau, D as EDIT_CREDIT_ESTIMATOR, E as front, O as EDIT_CREDIT_SIGNAL, S as vectorEmbedding, T as screenedNodes, _ as lineageEdits, a as skillCalibration, b as surfaceDigestEdits, c as META_SEARCH_SIGNAL, d as objectiveKey, f as renderMetaSearchText, g as lineEditDistance, h as landscape, i as nextUnitExtension, k as editCredit, l as metaSearch, m as formatLandscape, n as taskMatrix, o as skillManifold, p as searchPolicyGenome, r as formatSkillManifold, s as META_SEARCH_SCORE_SOURCE, t as tree, u as metaSearchScore, v as nearestNeighbours, w as searchPlateau, x as surfaceTextEdits, y as profileTextLines } from "../tree-D48IJUK0.js";
|
|
4
4
|
//#region src/search/nested-search.ts
|
|
5
5
|
/** The deterministic id of the inner search one outer cell attempt runs. */
|
|
6
6
|
function nestedSearchId(containment) {
|
|
@@ -1,12 +1,12 @@
|
|
|
1
1
|
import { a as hashCanonical, i as compareCodeUnits, r as canonicalString } from "./canonical-BsZVgBhW.js";
|
|
2
2
|
import { t as mulberry32 } from "./random-Dn5fPWkt.js";
|
|
3
|
-
import { t as confidenceInterval } from "./descriptive-
|
|
4
|
-
import { c as wilson } from "./paired-binary-
|
|
5
|
-
import { n as DECISION_PAIRED_DELTA_STATISTIC } from "./paired-tests-
|
|
6
|
-
import { i as pairedDeltaTest, r as minimumPairsForPairedDeltaTest, t as decidePairedPromotion } from "./paired-promotion-decision-
|
|
3
|
+
import { t as confidenceInterval } from "./descriptive-D9LUFk1-.js";
|
|
4
|
+
import { c as wilson } from "./paired-binary-OMBVRtc-.js";
|
|
5
|
+
import { n as DECISION_PAIRED_DELTA_STATISTIC } from "./paired-tests-Ccr16gcW.js";
|
|
6
|
+
import { i as pairedDeltaTest, r as minimumPairsForPairedDeltaTest, t as decidePairedPromotion } from "./paired-promotion-decision-DhrmjdV8.js";
|
|
7
7
|
import { a as SearchLedgerError } from "./search-ledger-file-DY0AXX3W.js";
|
|
8
8
|
import { f as redactText } from "./redact-Dk1ZdJEm.js";
|
|
9
|
-
import { f as searchUnitScores, l as searchCellId, t as FileSearchLedger } from "./search-ledger-
|
|
9
|
+
import { f as searchUnitScores, l as searchCellId, t as FileSearchLedger } from "./search-ledger-CXQPwdWz.js";
|
|
10
10
|
import { t as acquireSingleRunLock } from "./single-run-lock-fVu3MZWH.js";
|
|
11
11
|
//#region src/pareto.ts
|
|
12
12
|
/** Does candidate A weakly dominate B — strictly better on at least one objective and no worse on any? */
|
|
@@ -107,28 +107,35 @@ const CONFIDENCE = .95;
|
|
|
107
107
|
const RESAMPLES$1 = 2e3;
|
|
108
108
|
/** 6 at 95 %: the smallest sample an exact one-sided sign test can resolve. */
|
|
109
109
|
const DESCRIPTIVE_FROM = minimumPairsForPairedDeltaTest(CONFIDENCE);
|
|
110
|
+
/**
|
|
111
|
+
* Every choice the numbers depend on. Its digest is the estimator's revision:
|
|
112
|
+
* a producer and a verifier that report the same revision and the same
|
|
113
|
+
* `cellSetDigest` report the same estimate. Change a value here whenever the
|
|
114
|
+
* computation changes, so the revision moves with it.
|
|
115
|
+
*/
|
|
116
|
+
const ESTIMATOR_DEFINITION = {
|
|
117
|
+
name: "tangle.estimate-node.2026-09",
|
|
118
|
+
unit: "mean of the unit’s scored cells, summed in cellId order",
|
|
119
|
+
pairing: "units both nodes scored, in unitId order",
|
|
120
|
+
statistic: DECISION_PAIRED_DELTA_STATISTIC,
|
|
121
|
+
interval: "percentile paired bootstrap",
|
|
122
|
+
confidence: CONFIDENCE,
|
|
123
|
+
resamples: RESAMPLES$1,
|
|
124
|
+
rng: "mulberry32",
|
|
125
|
+
seed: "the first 32 bits of cellSetDigest",
|
|
126
|
+
signTest: "exact, one-sided toward improvement in the objective direction",
|
|
127
|
+
methods: {
|
|
128
|
+
none: "below 2 pairs",
|
|
129
|
+
insufficient: `below ${DESCRIPTIVE_FROM} pairs`,
|
|
130
|
+
descriptive: `below 20 pairs`,
|
|
131
|
+
bootstrap: `from 20 pairs`
|
|
132
|
+
},
|
|
133
|
+
indeterminate: "every paired delta equal: no interval and no sign p"
|
|
134
|
+
};
|
|
110
135
|
/** The estimator every `NodeEstimate` names. */
|
|
111
136
|
const SEARCH_ESTIMATOR = {
|
|
112
137
|
uri: "npm:@tangle-network/agent-eval#estimateNode",
|
|
113
|
-
revision: hashCanonical(
|
|
114
|
-
name: "tangle.estimate-node.2026-09",
|
|
115
|
-
unit: "mean of the unit’s scored cells, summed in cellId order",
|
|
116
|
-
pairing: "units both nodes scored, in unitId order",
|
|
117
|
-
statistic: DECISION_PAIRED_DELTA_STATISTIC,
|
|
118
|
-
interval: "percentile paired bootstrap",
|
|
119
|
-
confidence: CONFIDENCE,
|
|
120
|
-
resamples: RESAMPLES$1,
|
|
121
|
-
rng: "mulberry32",
|
|
122
|
-
seed: "the first 32 bits of cellSetDigest",
|
|
123
|
-
signTest: "exact, one-sided toward improvement in the objective direction",
|
|
124
|
-
methods: {
|
|
125
|
-
none: "below 2 pairs",
|
|
126
|
-
insufficient: `below ${DESCRIPTIVE_FROM} pairs`,
|
|
127
|
-
descriptive: `below 20 pairs`,
|
|
128
|
-
bootstrap: `from 20 pairs`
|
|
129
|
-
},
|
|
130
|
-
indeterminate: "every paired delta equal: no interval and no sign p"
|
|
131
|
-
})
|
|
138
|
+
revision: hashCanonical(ESTIMATOR_DEFINITION)
|
|
132
139
|
};
|
|
133
140
|
/** The method a paired sample of `pairs` units supports: the one staging
|
|
134
141
|
* every `NodeEstimate` and every search lens uses. */
|
|
@@ -1104,7 +1111,7 @@ function verifySearchClaim(state) {
|
|
|
1104
1111
|
}
|
|
1105
1112
|
/** Per-finalist confidence for `k` finalists. */
|
|
1106
1113
|
function bonferroni(k) {
|
|
1107
|
-
return 1 -
|
|
1114
|
+
return 1 - .050000000000000044 / k;
|
|
1108
1115
|
}
|
|
1109
1116
|
function rootDecision(root, fate, rule, reason) {
|
|
1110
1117
|
return {
|
|
@@ -2465,4 +2472,4 @@ function errorMessage(error) {
|
|
|
2465
2472
|
//#endregion
|
|
2466
2473
|
export { searchEstimateMethod as C, paretoFrontier as D, dominates as E, paretoFrontierWithCrowding as O, searchCellSetDigest as S, seedFromDigest as T, rankingSplit as _, searchPolicyView as a, estimateNode as b, planSearchClaim as c, pairedPromotionPower as d, requiredPairsForPairedPromotion as f, INSUFFICIENT_FROM as g, operatorYield as h, searchExpansionIndex as i, searchClaimReserveUsd as l, MIN_OUTCOMES_FOR_WEIGHT as m, runSearch as n, SEARCH_CLAIM_RULE as o, EXPANSION_OPERATORS as p, searchDivergence as r, decideSearchClaim as s, SEARCH_KERNEL_SOURCE as t, verifySearchClaim as u, summarizeSamples as v, searchPosterior as w, estimateNodeFromCells as x, SEARCH_ESTIMATOR as y };
|
|
2467
2474
|
|
|
2468
|
-
//# sourceMappingURL=search-kernel-
|
|
2475
|
+
//# sourceMappingURL=search-kernel-Dpniloks.js.map
|