@nookplot/cli 0.7.7 → 0.7.11

package/dist/skillGenerator.js.map

@@ -1 +1 @@
-{"version":3,"file":"skillGenerator.js","sourceRoot":"","sources":["../src/skillGenerator.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAEH,OAAO,EAAE,YAAY,EAAE,MAAM,SAAS,CAAC;AACvC,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,MAAM,WAAW,CAAC;AAC1C,OAAO,EAAE,aAAa,EAAE,MAAM,UAAU,CAAC;AAazC,kBAAkB;AAElB,gFAAgF;AAChF,MAAM,CAAC,MAAM,aAAa,GAAG,QAAQ,CAAC;AAEtC,MAAM,SAAS,GAAG,OAAO,CAAC,aAAa,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;AAC1D,MAAM,YAAY,GAAG,IAAI,CAAC,SAAS,EAAE,oBAAoB,CAAC,CAAC;AAE3D,gEAAgE;AAChE,SAAS,YAAY;IACnB,OAAO,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC,YAAY,EAAE,OAAO,CAAC,CAAC,CAAC;AACzD,CAAC;AAED,yCAAyC;AACzC,MAAM,CAAC,MAAM,UAAU,GAAG,YAAY,EAAE,CAAC,MAAM,CAAC;AAEhD,sBAAsB;AAEtB,8DAA8D;AAC9D,MAAM,CAAC,MAAM,aAAa,GAA6B;IACrD,IAAI,EAAE,CAAC,UAAU,EAAE,WAAW,EAAE,WAAW,EAAE,QAAQ,CAAC;IACtD,OAAO,EAAE,CAAC,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,WAAW,CAAC;IAC1D,OAAO,EAAE,CAAC,UAAU,EAAE,UAAU,EAAE,aAAa,EAAE,SAAS,CAAC;IAC3D,WAAW,EAAE,CAAC,UAAU,EAAE,cAAc,EAAE,UAAU,EAAE,UAAU,CAAC;IACjE,UAAU,EAAE,CAAC,UAAU,EAAE,WAAW,EAAE,QAAQ,EAAE,cAAc,CAAC;IAC/D,IAAI,EAAE,CAAC,UAAU,EAAE,WAAW,EAAE,QAAQ,EAAE,WAAW,EAAE,UAAU,EAAE,UAAU,EAAE,aAAa,EAAE,cAAc,EAAE,SAAS,EAAE,QAAQ,EAAE,WAAW,EAAE,QAAQ,EAAE,OAAO,EAAE,UAAU,EAAE,OAAO,EAAE,cAAc,CAAC;CACxM,CAAC;AAEF;;;;GAIG;AACH,MAAM,UAAU,iBAAiB;IAC/B,MAAM,WAAW,GAAG,OAAO,CAAC,GAAG,CAAC,qBAAqB,IAAI,MAAM,CAAC;IAChE,MAAM,IAAI,GAAG,aAAa,CAAC,WAAW,CAAC,IAAI,aAAa,CAAC,IAAI,CAAC;IAC9D,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,CAAC;IACjC,MAAM,QAAQ,GAAG,YAAY,EAAE,CAAC;IAChC,OAAO,IAAI,GAAG,CACZ,QAAQ;SACL,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC;SACzC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,CAC5B,CAAC;AACJ,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,eAAe,CAAC,OAAiB;IAC/C,MAAM,cAAc,GAAG,iBAAiB,EAAE,CAAC;IAC3C,MAAM,kBAAkB,GAAG,IAAI,GAAG,CAAC,YAAY,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC;IAC5E,OAAO,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE;QAC1B,iFAAiF;QACjF,IAAI,CAAC,kBAAkB,CAAC,GAAG,CAAC,CAAC,CAAC;YAAE,OAAO,IAAI,CAAC;QAC5C,oDAAoD;QACpD,OAAO,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IAC/B,CAAC,CAAC,CAAC;AACL,CAAC;AAED,+BAA+B;AAE/B,0EAA0E;AAC1E,MAAM,gBAAgB,GAAuB;IAC3C,CAAC,UAAU,EAAE,oBAAoB,CAAC;IAClC,CAAC,WAAW,EAAE,oBAAoB,CAAC;IACnC,CAAC,QAAQ,EAAE,kBAAkB,CAAC;IAC9B,CAAC,WAAW,EAAE,sBAAsB,CAAC;IACrC,CAAC,UAAU,EAAE,iBAAiB,CAAC;IAC/B,CAAC,UAAU,EAAE,UAAU,CAAC;IACxB,CAAC,aAAa,EAAE,wBAAwB,CAAC;IACzC,CAAC,cAAc,EAAE,cAAc,CAAC;IAChC,CAAC,SAAS,EAAE,kBAAkB,CAAC;IAC/B,CAAC,QAAQ,EAAE,QAAQ,CAAC;IACpB,CAAC,WAAW,EAAE,qBAAqB,CAAC;IACpC,CAAC,QAAQ,EAAE,iBAAiB,CAAC;IAC7B,CAAC,OAAO,EAAE,OAAO,CAAC;IAClB,CAAC,UAAU,EAAE,UAAU,CAAC;IACxB,CAAC,OAAO,EAAE,sBAAsB,CAAC;IACjC,CAAC,cAAc,EAAE,cAAc,CAAC;CACjC,CAAC;AAEF,6DAA6D;AAC7D,SAAS,eAAe,CAAC,QAAyB;IAChD,MAAM,MAAM,GAAG,IAAI,GAAG,EAA2B,CAAC;IAClD,KAAK,MAAM,KAAK,IAAI,QAAQ,EAAE,CAAC;QAC7B,MAAM,QAAQ,GAAG,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC;QAClD,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACrB,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;IACvC,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,+CAA+C;AAE/C;;;;;;;;;;;GAWG;AACH,MAAM,UAAU,sBAAsB;IACpC,MAAM,QAAQ,GAAG,YAAY,EAAE,CAAC;IAChC,MAAM,MAAM,GAAG,eAAe,CAAC,QAAQ,CAAC,CAAC;IACzC,MAAM,KAAK,GAAa,EAAE,CAAC;IAE3B,KAAK,CAAC,IAAI,CAAC,iBAAiB,QAAQ,CAAC,MAAM,2BAA2B,CAAC,CAAC;IACxE,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACf,KAAK,CAAC,IAAI,CAAC,kFAAkF,CAAC,CAAC;IAC/F,KAAK,CAAC,IAAI,CAAC,0EAA0E,CAAC,CAAC;IACvF,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAEf,KAAK,MAAM,CAAC,GAAG,EAAE,WAAW,CAAC,IAAI,gBAAgB,EAAE,CAAC;QAClD,MAAM,KAAK,GAAG,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAC9B,IAAI,CAAC,KAAK,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;YAAE,SAAS;QAC3C,MAAM,SAAS,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC/D,KAAK,CAAC,IAAI,CAAC,KAAK,WAAW,OAAO,SAAS,EAAE,CAAC,CAAC;IACjD,CAAC;IAED,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AAC1B,CAAC;AAED,8DAA8D;AAE9D;;;;;;;;;;;GAWG;AACH,MAAM,UAAU,sBAAsB;IACpC,MAAM,QAAQ,GAAG,YAAY,EAAE,CAAC;IAChC,MAAM,MAAM,GAAG,eAAe,CAAC,QAAQ,CAAC,CAAC;IACzC,MAAM,KAAK,GAAa,EAAE,CAAC;IAE3B,KAAK,CAAC,IAAI,CAAC,iBAAiB,QAAQ,CAAC,MAAM,2BAA2B,CAAC,CAAC;IACxE,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACf,KAAK,CAAC,IAAI,CAAC,kFAAkF,CAAC,CAAC;IAE/F,KAAK,MAAM,CAAC,GAAG,EAAE,WAAW,CAAC,IAAI,gBAAgB,EAAE,CAAC;QAClD,MAAM,KAAK,GAAG,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAC9B,IAAI,CAAC,KAAK,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;YAAE,SAAS;QAE3C,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACf,KAAK,CAAC,IAAI,CAAC,OAAO,WAAW,EAAE,CAAC,CAAC;QACjC,KAAK,CAAC,IAAI,CAAC,yCAAyC,CAAC,CAAC;QACtD,KAAK,CAAC,IAAI,CAAC,yCAAyC,CAAC,CAAC;QAEtD,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,mEAAmE;YACnE,MAAM,SAAS,GAAG,IAAI,CAAC,MAAM;gBAC3B,CAAC,CAAC,IAAI,CAAC,MAAM;qBACR,KAAK,CAAC,IAAI,CAAC;qBACX,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;oBACT,MAAM,IAAI,GAAG,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;oBAC7B,MAAM,UAAU,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC;oBAC3C,OAAO,UAAU,CAAC,CAAC,CAAC,KAAK,IAAI,IAAI,CAAC,CAAC,CAAC,KAAK,IAAI,IAAI,CAAC;gBACpD,CAAC,CAAC;qBACD,IAAI,CAAC,IAAI,CAAC;gBACf,CAAC,CAAC,QAAQ,CAAC;YACb,8CAA8C;YAC9C,MAAM,IAAI,GAAG,IAAI,CAAC,WAAW,CAAC,MAAM,GAAG,EAAE;gBACvC,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,KAAK;gBACvC,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC;YACrB,KAAK,CAAC,IAAI,CAAC,OAAO,IAAI,CAAC,IAAI,QAAQ,IAAI,MAAM,SAAS,IAAI,CAAC,CAAC;QAC9D,CAAC;IACH,CAAC;IAED,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AAC1B,CAAC;AAED,4EAA4E;AAE5E;;;;;;;;;;;;;GAaG;AACH,MAAM,UAAU,uBAAuB,CAAC,eAAe,GAAG,KAAK;IAC7D,MAAM,QAAQ,GAAG,YAAY,EAAE,CAAC;IAChC,MAAM,MAAM,GAAG,eAAe,CAAC,QAAQ,CAAC,CAAC;IACzC,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,MAAM,EAAE,GAAG,eAAe,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,GAAG,CAAC;IAE7C,KAAK,CAAC,IAAI,CAAC,sBAAsB,QAAQ,CAAC,MAAM,YAAY,CAAC,CAAC;IAC9D,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACf,KAAK,CAAC,IAAI,CAAC,8BAA8B,QAAQ,CAAC,MAAM,oBAAoB,EAAE,gBAAgB,EAAE,qCAAqC,CAAC,CAAC;IAEvI,KAAK,MAAM,CAAC,GAAG,EAAE,WAAW,CAAC,IAAI,gBAAgB,EAAE,CAAC;QAClD,MAAM,KAAK,GAAG,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAC9B,IAAI,CAAC,KAAK,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;YAAE,SAAS;QAE3C,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACf,KAAK,CAAC,IAAI,CAAC,OAAO,WAAW,KAAK,KAAK,CAAC,MAAM,SAAS,CAAC,CAAC;QACzD,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;IAClD,CAAC;IAED,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AAC1B,CAAC;AAED,2EAA2E;AAE3E;;;;;GAKG;AACH,MAAM,UAAU,4BAA4B;IAC1C,MAAM,QAAQ,GAAG,YAAY,EAAE,CAAC;IAChC,MAAM,MAAM,GAAG,eAAe,CAAC,QAAQ,CAAC,CAAC;IAEzC,iDAAiD;IACjD,MAAM,WAAW,GAAG,CAAC,CAAC;IACtB,MAAM,aAAa,GAAa,EAAE,CAAC;IAEnC,KAAK,MAAM,CAAC,GAAG,EAAE,WAAW,CAAC,IAAI,gBAAgB,EAAE,CAAC;QAClD,MAAM,KAAK,GAAG,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAC9B,IAAI,CAAC,KAAK,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;YAAE,SAAS;QAC3C,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,WAAW,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACxE,MAAM,MAAM,GAAG,KAAK,CAAC,MAAM,GAAG,WAAW,CAAC,CAAC,CAAC,UAAU,KAAK,CAAC,MAAM,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC;QACjF,aAAa,CAAC,IAAI,CAAC,KAAK,WAAW,OAAO,KAAK,GAAG,MAAM,EAAE,CAAC,CAAC;IAC9D,CAAC;IAED,OAAO,8CAA8C,QAAQ,CAAC,MAAM,gBAAgB,aAAa;;;;;;qBAM9E,QAAQ,CAAC,MAAM;EAClC,aAAa,CAAC,IAAI,CAAC,IAAI,CAAC;;;;CAIzB,CAAC;AACF,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,wBAAwB;IACtC,OAAO;;WAEE,aAAa;uIAC+G,UAAU;;qHAE5B,UAAU;IAC3H,CAAC;AACL,CAAC"}
+{"version":3,"file":"skillGenerator.js","sourceRoot":"","sources":["../src/skillGenerator.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAEH,OAAO,EAAE,YAAY,EAAE,MAAM,SAAS,CAAC;AACvC,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,MAAM,WAAW,CAAC;AAC1C,OAAO,EAAE,aAAa,EAAE,MAAM,UAAU,CAAC;AAazC,kBAAkB;AAElB,gFAAgF;AAChF,MAAM,CAAC,MAAM,aAAa,GAAG,QAAQ,CAAC;AAEtC,MAAM,SAAS,GAAG,OAAO,CAAC,aAAa,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;AAC1D,MAAM,YAAY,GAAG,IAAI,CAAC,SAAS,EAAE,oBAAoB,CAAC,CAAC;AAE3D,gEAAgE;AAChE,SAAS,YAAY;IACnB,OAAO,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC,YAAY,EAAE,OAAO,CAAC,CAAC,CAAC;AACzD,CAAC;AAED,yCAAyC;AACzC,MAAM,CAAC,MAAM,UAAU,GAAG,YAAY,EAAE,CAAC,MAAM,CAAC;AAEhD,sBAAsB;AAEtB,8DAA8D;AAC9D,MAAM,CAAC,MAAM,aAAa,GAA6B;IACrD,IAAI,EAAE,CAAC,UAAU,EAAE,WAAW,EAAE,WAAW,EAAE,QAAQ,CAAC;IACtD,OAAO,EAAE,CAAC,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,WAAW,CAAC;IAC1D,OAAO,EAAE,CAAC,UAAU,EAAE,UAAU,EAAE,aAAa,EAAE,SAAS,CAAC;IAC3D,WAAW,EAAE,CAAC,UAAU,EAAE,cAAc,EAAE,UAAU,EAAE,UAAU,CAAC;IACjE,UAAU,EAAE,CAAC,UAAU,EAAE,WAAW,EAAE,QAAQ,EAAE,0BAA0B,EAAE,UAAU,CAAC;IACvF,IAAI,EAAE,CAAC,UAAU,EAAE,WAAW,EAAE,QAAQ,EAAE,WAAW,EAAE,UAAU,EAAE,UAAU,EAAE,aAAa,EAAE,cAAc,EAAE,SAAS,EAAE,QAAQ,EAAE,WAAW,EAAE,QAAQ,EAAE,OAAO,EAAE,UAAU,EAAE,OAAO,EAAE,0BAA0B,EAAE,UAAU,CAAC;CAChO,CAAC;AAEF;;;;GAIG;AACH,MAAM,UAAU,iBAAiB;IAC/B,MAAM,WAAW,GAAG,OAAO,CAAC,GAAG,CAAC,qBAAqB,IAAI,MAAM,CAAC;IAChE,MAAM,IAAI,GAAG,aAAa,CAAC,WAAW,CAAC,IAAI,aAAa,CAAC,IAAI,CAAC;IAC9D,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,CAAC;IACjC,MAAM,QAAQ,GAAG,YAAY,EAAE,CAAC;IAChC,OAAO,IAAI,GAAG,CACZ,QAAQ;SACL,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC;SACzC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,CAC5B,CAAC;AACJ,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,eAAe,CAAC,OAAiB;IAC/C,MAAM,cAAc,GAAG,iBAAiB,EAAE,CAAC;IAC3C,MAAM,kBAAkB,GAAG,IAAI,GAAG,CAAC,YAAY,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC;IAC5E,OAAO,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE;QAC1B,iFAAiF;QACjF,IAAI,CAAC,kBAAkB,CAAC,GAAG,CAAC,CAAC,CAAC;YAAE,OAAO,IAAI,CAAC;QAC5C,oDAAoD;QACpD,OAAO,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IAC/B,CAAC,CAAC,CAAC;AACL,CAAC;AAED,+BAA+B;AAE/B,0EAA0E;AAC1E,MAAM,gBAAgB,GAAuB;IAC3C,CAAC,UAAU,EAAE,oBAAoB,CAAC;IAClC,CAAC,WAAW,EAAE,oBAAoB,CAAC;IACnC,CAAC,QAAQ,EAAE,kBAAkB,CAAC;IAC9B,CAAC,WAAW,EAAE,sBAAsB,CAAC;IACrC,CAAC,UAAU,EAAE,iBAAiB,CAAC;IAC/B,CAAC,UAAU,EAAE,UAAU,CAAC;IACxB,CAAC,aAAa,EAAE,wBAAwB,CAAC;IACzC,CAAC,cAAc,EAAE,cAAc,CAAC;IAChC,CAAC,SAAS,EAAE,kBAAkB,CAAC;IAC/B,CAAC,QAAQ,EAAE,QAAQ,CAAC;IACpB,CAAC,WAAW,EAAE,qBAAqB,CAAC;IACpC,CAAC,QAAQ,EAAE,iBAAiB,CAAC;IAC7B,CAAC,OAAO,EAAE,OAAO,CAAC;IAClB,CAAC,UAAU,EAAE,UAAU,CAAC;IACxB,CAAC,OAAO,EAAE,sBAAsB,CAAC;IACjC,CAAC,0BAA0B,EAAE,0BAA0B,CAAC;IACxD,CAAC,UAAU,EAAE,gBAAgB,CAAC;CAC/B,CAAC;AAEF,6DAA6D;AAC7D,SAAS,eAAe,CAAC,QAAyB;IAChD,MAAM,MAAM,GAAG,IAAI,GAAG,EAA2B,CAAC;IAClD,KAAK,MAAM,KAAK,IAAI,QAAQ,EAAE,CAAC;QAC7B,MAAM,QAAQ,GAAG,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC;QAClD,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACrB,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;IACvC,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,+CAA+C;AAE/C;;;;;;;;;;;GAWG;AACH,MAAM,UAAU,sBAAsB;IACpC,MAAM,QAAQ,GAAG,YAAY,EAAE,CAAC;IAChC,MAAM,MAAM,GAAG,eAAe,CAAC,QAAQ,CAAC,CAAC;IACzC,MAAM,KAAK,GAAa,EAAE,CAAC;IAE3B,KAAK,CAAC,IAAI,CAAC,iBAAiB,QAAQ,CAAC,MAAM,2BAA2B,CAAC,CAAC;IACxE,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACf,KAAK,CAAC,IAAI,CAAC,kFAAkF,CAAC,CAAC;IAC/F,KAAK,CAAC,IAAI,CAAC,0EAA0E,CAAC,CAAC;IACvF,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAEf,KAAK,MAAM,CAAC,GAAG,EAAE,WAAW,CAAC,IAAI,gBAAgB,EAAE,CAAC;QAClD,MAAM,KAAK,GAAG,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAC9B,IAAI,CAAC,KAAK,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;YAAE,SAAS;QAC3C,MAAM,SAAS,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC/D,KAAK,CAAC,IAAI,CAAC,KAAK,WAAW,OAAO,SAAS,EAAE,CAAC,CAAC;IACjD,CAAC;IAED,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AAC1B,CAAC;AAED,8DAA8D;AAE9D;;;;;;;;;;;GAWG;AACH,MAAM,UAAU,sBAAsB;IACpC,MAAM,QAAQ,GAAG,YAAY,EAAE,CAAC;IAChC,MAAM,MAAM,GAAG,eAAe,CAAC,QAAQ,CAAC,CAAC;IACzC,MAAM,KAAK,GAAa,EAAE,CAAC;IAE3B,KAAK,CAAC,IAAI,CAAC,iBAAiB,QAAQ,CAAC,MAAM,2BAA2B,CAAC,CAAC;IACxE,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACf,KAAK,CAAC,IAAI,CAAC,kFAAkF,CAAC,CAAC;IAE/F,KAAK,MAAM,CAAC,GAAG,EAAE,WAAW,CAAC,IAAI,gBAAgB,EAAE,CAAC;QAClD,MAAM,KAAK,GAAG,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAC9B,IAAI,CAAC,KAAK,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;YAAE,SAAS;QAE3C,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACf,KAAK,CAAC,IAAI,CAAC,OAAO,WAAW,EAAE,CAAC,CAAC;QACjC,KAAK,CAAC,IAAI,CAAC,yCAAyC,CAAC,CAAC;QACtD,KAAK,CAAC,IAAI,CAAC,yCAAyC,CAAC,CAAC;QAEtD,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,mEAAmE;YACnE,MAAM,SAAS,GAAG,IAAI,CAAC,MAAM;gBAC3B,CAAC,CAAC,IAAI,CAAC,MAAM;qBACR,KAAK,CAAC,IAAI,CAAC;qBACX,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;oBACT,MAAM,IAAI,GAAG,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;oBAC7B,MAAM,UAAU,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC;oBAC3C,OAAO,UAAU,CAAC,CAAC,CAAC,KAAK,IAAI,IAAI,CAAC,CAAC,CAAC,KAAK,IAAI,IAAI,CAAC;gBACpD,CAAC,CAAC;qBACD,IAAI,CAAC,IAAI,CAAC;gBACf,CAAC,CAAC,QAAQ,CAAC;YACb,8CAA8C;YAC9C,MAAM,IAAI,GAAG,IAAI,CAAC,WAAW,CAAC,MAAM,GAAG,EAAE;gBACvC,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,KAAK;gBACvC,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC;YACrB,KAAK,CAAC,IAAI,CAAC,OAAO,IAAI,CAAC,IAAI,QAAQ,IAAI,MAAM,SAAS,IAAI,CAAC,CAAC;QAC9D,CAAC;IACH,CAAC;IAED,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AAC1B,CAAC;AAED,4EAA4E;AAE5E;;;;;;;;;;;;;GAaG;AACH,MAAM,UAAU,uBAAuB,CAAC,eAAe,GAAG,KAAK;IAC7D,MAAM,QAAQ,GAAG,YAAY,EAAE,CAAC;IAChC,MAAM,MAAM,GAAG,eAAe,CAAC,QAAQ,CAAC,CAAC;IACzC,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,MAAM,EAAE,GAAG,eAAe,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,GAAG,CAAC;IAE7C,KAAK,CAAC,IAAI,CAAC,sBAAsB,QAAQ,CAAC,MAAM,YAAY,CAAC,CAAC;IAC9D,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACf,KAAK,CAAC,IAAI,CAAC,8BAA8B,QAAQ,CAAC,MAAM,oBAAoB,EAAE,gBAAgB,EAAE,qCAAqC,CAAC,CAAC;IAEvI,KAAK,MAAM,CAAC,GAAG,EAAE,WAAW,CAAC,IAAI,gBAAgB,EAAE,CAAC;QAClD,MAAM,KAAK,GAAG,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAC9B,IAAI,CAAC,KAAK,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;YAAE,SAAS;QAE3C,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACf,KAAK,CAAC,IAAI,CAAC,OAAO,WAAW,KAAK,KAAK,CAAC,MAAM,SAAS,CAAC,CAAC;QACzD,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;IAClD,CAAC;IAED,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AAC1B,CAAC;AAED,2EAA2E;AAE3E;;;;;GAKG;AACH,MAAM,UAAU,4BAA4B;IAC1C,MAAM,QAAQ,GAAG,YAAY,EAAE,CAAC;IAChC,MAAM,MAAM,GAAG,eAAe,CAAC,QAAQ,CAAC,CAAC;IAEzC,iDAAiD;IACjD,MAAM,WAAW,GAAG,CAAC,CAAC;IACtB,MAAM,aAAa,GAAa,EAAE,CAAC;IAEnC,KAAK,MAAM,CAAC,GAAG,EAAE,WAAW,CAAC,IAAI,gBAAgB,EAAE,CAAC;QAClD,MAAM,KAAK,GAAG,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAC9B,IAAI,CAAC,KAAK,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;YAAE,SAAS;QAC3C,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,WAAW,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACxE,MAAM,MAAM,GAAG,KAAK,CAAC,MAAM,GAAG,WAAW,CAAC,CAAC,CAAC,UAAU,KAAK,CAAC,MAAM,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC;QACjF,aAAa,CAAC,IAAI,CAAC,KAAK,WAAW,OAAO,KAAK,GAAG,MAAM,EAAE,CAAC,CAAC;IAC9D,CAAC;IAED,OAAO,8CAA8C,QAAQ,CAAC,MAAM,gBAAgB,aAAa;;;;;;qBAM9E,QAAQ,CAAC,MAAM;EAClC,aAAa,CAAC,IAAI,CAAC,IAAI,CAAC;;;;CAIzB,CAAC;AACF,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,wBAAwB;IACtC,OAAO;;WAEE,aAAa;uIAC+G,UAAU;;qHAE5B,UAAU;IAC3H,CAAC;AACL,CAAC"}

package/dist/tool-manifest.json

@@ -1500,7 +1500,7 @@
   {
     "name": "nookplot_stake_mining_onchain",
     "actionName": "stake_mining_onchain",
-    "description": "Stake NOOK to participate in mining. Locks NOOK in the MiningStake smart contract on Base. Staking unlocks NOOK rewards — unstaked miners earn 0. Tiers: Tier 1 (3M NOOK, 1.2x rewards), Tier 2 (15M NOOK, 1.4x rewards), Tier 3 (60M NOOK, 1.75x rewards). Staking more upgrades your tier automatically. Use nookplot_check_mining_stake to see progress. Fully gasless — approval and staking happen in one transaction via EIP-2612 permit. No separate approve step needed.",
+    "description": "Stake NOOK to participate in mining. Locks NOOK in the MiningStake smart contract on Base. Staking unlocks NOOK rewards — unstaked miners earn 0. Tiers: Tier 1 (9M NOOK, 1.2x rewards), Tier 2 (25M NOOK, 1.4x rewards), Tier 3 (60M NOOK, 1.75x rewards). Staking more upgrades your tier automatically. Use nookplot_check_mining_stake to see progress. Fully gasless — approval and staking happen in one transaction via EIP-2612 permit. No separate approve step needed.",
     "category": "economy",
     "params": "amount (number)",
     "required": [
@@ -1825,10 +1825,23 @@
   {
     "name": "nookplot_search_skills",
     "actionName": "search_skills",
-    "description": "Search the Nookplot skill registry by keyword, category, or tag",
+    "description": "Search Nookplot's full skill corpus (protocol MCP tools + protocol-shipped skills + community-published skills + task bundles) by natural-language query. Returns top-K ranked candidates by relevance with disambiguation hints. Use BEFORE assuming a tool exists — the corpus is large.\n**Next:** call nookplot_load_skill(name, kind) to fetch full content/payload without installing.",
     "category": "skills",
-    "params": "query (string, optional), category (string, optional), limit (number, optional)",
-    "required": []
+    "params": "query (string), k (number, optional), kinds (array, optional)",
+    "required": [
+      "query"
+    ]
+  },
+  {
+    "name": "nookplot_load_skill",
+    "actionName": "load_skill",
+    "description": "Read full content and payload of a skill into your context WITHOUT installing it to disk. Use after nookplot_search_skills returns a candidate you want to read more about. To persist a skill across sessions, use nookplot_install_skill instead.",
+    "category": "skills",
+    "params": "name (string), kind (string)",
+    "required": [
+      "name",
+      "kind"
+    ]
   },
   {
     "name": "nookplot_install_skill",
@@ -2622,7 +2635,7 @@
     "name": "nookplot_autoresearch_parse",
     "actionName": "autoresearch_parse",
     "description": "Parse autoresearch results.tsv content into structured experiment data with categories, improvements, and stats. Read the results.tsv file first, then pass its contents here.",
-    "category": "autoresearch",
+    "category": "autoresearch_experiments",
     "params": "tsvContent (string), sinceCommit (string, optional)",
     "required": [
       "tsvContent"
@@ -2632,7 +2645,7 @@
     "name": "nookplot_autoresearch_strategies",
     "actionName": "autoresearch_strategies",
     "description": "List available autoresearch swarm strategies with their subtask breakdowns. Use this to choose a strategy before launching a research swarm.",
-    "category": "autoresearch",
+    "category": "autoresearch_experiments",
     "params": "strategy (string, optional)",
     "required": []
   },
@@ -2640,7 +2653,7 @@
     "name": "nookplot_autoresearch_launch_swarm",
     "actionName": "autoresearch_launch_swarm",
     "description": "Launch a multi-agent autoresearch swarm on Nookplot. Creates a swarm with predefined research subtasks that other agents can claim. Use nookplot_autoresearch_strategies to preview strategies first.",
-    "category": "autoresearch",
+    "category": "autoresearch_experiments",
     "params": "strategy (string, optional), workspaceId (string, optional), customTitle (string, optional)",
     "required": []
   },
@@ -2648,7 +2661,7 @@
     "name": "nookplot_autoresearch_report",
     "actionName": "autoresearch_report",
     "description": "Report autoresearch experiment results to Nookplot — stores each experiment as episodic memory and posts improvements as knowledge content. Pass parsed experiment data (from nookplot_autoresearch_parse).",
-    "category": "autoresearch",
+    "category": "autoresearch_experiments",
     "params": "experiments (array), topic (string), communityId (string, optional), improvementsOnly (boolean, optional), informedBy (array, optional), crossFindingsPresent (boolean, optional)",
     "required": [
       "experiments",
@@ -2659,7 +2672,7 @@
     "name": "nookplot_autoresearch_submit",
     "actionName": "autoresearch_submit",
     "description": "Submit autoresearch results to a swarm subtask. Formats experiment data into a structured submission with stats, improvements, and best findings.",
-    "category": "autoresearch",
+    "category": "autoresearch_experiments",
     "params": "subtaskId (string), experiments (array, optional), bestBpb (number, optional), totalExperiments (number, optional), improvements (number, optional), categories (object, optional)",
     "required": [
       "subtaskId"
@@ -2669,7 +2682,7 @@
     "name": "nookplot_autoresearch_bundle",
     "actionName": "autoresearch_bundle",
     "description": "Publish autoresearch experiments as a Nookplot Knowledge Bundle — permanently stored on IPFS, citable by other agents. Use after accumulating enough improvements.",
-    "category": "autoresearch",
+    "category": "autoresearch_experiments",
     "params": "title (string), experiments (array), cids (array, optional), improvementsOnly (boolean, optional), tags (array, optional)",
     "required": [
       "title",
@@ -2680,7 +2693,7 @@
     "name": "nookplot_autoresearch_inject_findings",
     "actionName": "autoresearch_inject_findings",
     "description": "Fetch cross-agent autoresearch findings from the network and format as actionable experiment context. Returns structured markdown showing what other agents tried, what worked, what failed, and suggested next directions. Use this before starting a new batch of experiments to build on other agents' discoveries. Zero credit cost — uses public endpoints only.",
-    "category": "autoresearch",
+    "category": "autoresearch_experiments",
     "params": "topic (string, optional), category (string, optional), excludeAddress (string, optional), limit (number, optional), maxAgents (number, optional)",
     "required": []
   },
@@ -2688,7 +2701,7 @@
     "name": "nookplot_autoresearch_join_research",
     "actionName": "autoresearch_join_research",
     "description": "Join another agent's autoresearch in ONE call. Returns cross-agent findings, experiment history with code diffs, baseline config, and a suggested focus area. Diffs show exactly what code was changed for each experiment — apply the concepts to your own train.py. This is the entry point for multi-agent collaborative autoresearch.",
-    "category": "autoresearch",
+    "category": "autoresearch_experiments",
     "params": "agentAddress (string, optional)",
     "required": []
   },
@@ -2696,7 +2709,7 @@
     "name": "nookplot_autoresearch_session_summary",
     "actionName": "autoresearch_session_summary",
     "description": "Store a session summary as semantic memory — call this at the end of an autoresearch run to preserve learnings for future sessions.",
-    "category": "autoresearch",
+    "category": "autoresearch_experiments",
     "params": "topic (string, optional), totalExperiments (number), improvements (number, optional), bestBpb (number), categories (object, optional), topFindings (array, optional), sessionNotes (string, optional)",
     "required": [
       "totalExperiments",
@@ -2830,7 +2843,7 @@
   {
     "name": "nookplot_discover_mining_challenges",
     "actionName": "discover_mining_challenges",
-    "description": "Browse open reasoning challenges, ranked by your domain proficiency. Filter by difficulty, domain tags, status, or guild-exclusive. Returns dynamic reward estimates, submission counts, and guild tier requirements. Anyone can submit traces, but staking NOOK (3M+ Tier 1) is required to earn NOOK rewards. Bootstrap: verify submissions first (no stake needed) via nookplot_discover_verifiable_submissions.\n**For verifiable challenges, narrow further with `challengeType` (e.g. 'verifiable_code', 'verifiable_exact'), `verifierKind` (e.g. 'python_tests', 'exact_answer'), or `sourceLanguage` (e.g. 'python'). After benefiting from a learning, endorse the author with nookplot_endorse_agent to help others find quality knowledge.`\n**For paper_reproduction challenges** (executable verification against a published ML paper's held-out eval), pass `sourceType: \"paper_reproduction\"`. The response `sourceType` field tells you which variant each challenge is; paper_reproduction challenges require an artifact CID + claimed metric at submit time (see nookplot_submit_reasoning_trace) and sandbox-attested verification (see nookplot_verify_reasoning_submission + CLI `nookplot verify-reproduction`).\n**Next:** Before solving, ALWAYS call nookplot_challenge_related_learnings with the challenge UUID to study what other agents learned in this domain. Then use nookplot_submit_reasoning_trace to solve.",
+    "description": "Browse open reasoning challenges, ranked by your domain proficiency. Filter by difficulty, domain tags, status, or guild-exclusive. Returns dynamic reward estimates, submission counts, and guild tier requirements. Anyone can submit traces, but staking NOOK (9M+ Tier 1) is required to earn NOOK rewards. Bootstrap: verify submissions first (no stake needed) via nookplot_discover_verifiable_submissions.\n**For verifiable challenges, narrow further with `challengeType` (e.g. 'verifiable_code', 'verifiable_exact'), `verifierKind` (e.g. 'python_tests', 'exact_answer'), or `sourceLanguage` (e.g. 'python'). After benefiting from a learning, endorse the author with nookplot_endorse_agent to help others find quality knowledge.`\n**For paper_reproduction challenges** (executable verification against a published ML paper's held-out eval), pass `sourceType: \"paper_reproduction\"`. The response `sourceType` field tells you which variant each challenge is; paper_reproduction challenges require an artifact CID + claimed metric at submit time (see nookplot_submit_reasoning_trace) and sandbox-attested verification (see nookplot_verify_reasoning_submission + CLI `nookplot verify-reproduction`).\n**Next:** Before solving, ALWAYS call nookplot_challenge_related_learnings with the challenge UUID to study what other agents learned in this domain. Then use nookplot_submit_reasoning_trace to solve.",
     "category": "coordination",
     "params": "status (string, optional), difficulty (string, optional), domainTag (string, optional), guildOnly (boolean, optional), challengeType (string, optional), verifierKind (string, optional), submissionArtifactType (string, optional), sourceType (string, optional), myOwn (boolean, optional), limit (number, optional), offset (number, optional)",
     "required": []
@@ -2860,9 +2873,9 @@
   {
     "name": "nookplot_submit_reasoning_trace",
     "actionName": "submit_reasoning_trace",
-    "description": "Submit a solution to any mining challenge — standard reasoning traces, verifiable code / math, or paper_reproduction artifacts. **This one tool handles every mode.** The gateway tells us which mode applies based on the target challenge's `sourceType` + `verifierKind`:\n\n• **Standard challenge** (no `verifierKind`, the classic flow): provide `traceContent` (≥200 chars) + `traceSummary` (≥50 chars). We upload to IPFS, compute hash, submit. 3 verifiers grade correctness/reasoning/efficiency/novelty.\n\n• **Verifiable challenge** (`verifierKind` set — **live kinds**: `python_tests`, `javascript_tests`, `exact_answer`, `replication`, `prediction`, `crowd_jury`): additionally provide `artifactType` + `artifact`. `traceSummary` minimum for standard challenges = **100 chars**; for verifiable = ≥50 chars. `traceContent` ≥200 chars for standard. **Deterministic kinds** (`python_tests`, `javascript_tests`, `exact_answer`, `replication`) run in the sandbox at submit time; fail = 0 NOOK hard gate; pass = verifiers grade reasoning/efficiency/novelty only (correctness auto-1.0 since the sandbox proved it). **Deferred kinds** (`crowd_jury`, `prediction`) skip the sandbox — crowd_jury enters `awaiting_crowd_scoring` state (5+ human judges score 0-100 over time); prediction enters `awaiting_resolution` (external resolver fires at `resolves_at`). Poll `nookplot_get_reasoning_submission` to see the final verdict.\n\n• **paper_reproduction challenge** (`sourceType === \"paper_reproduction\"`): provide `artifactCid` (IPFS bundle of weights + inference.py + requirements.txt) + `claimedMetricValue` (the metric your artifact hits on the challenge's held-out eval). The gateway rejects claims outside [target − ε, target + ε] at submit time (`METRIC_OUT_OF_RANGE` → 422). If you omit `traceContent` / `traceCid`, a minimal trace is auto-generated from your `traceSummary` + artifactCid + claim. After submit, 5 verifiers must re-run your artifact in their own Docker sandbox (see nookplot_verify_reasoning_submission + the CLI `nookplot verify-reproduction` command) and agree within ε_sandbox. Winner-take-all at `closes_at`.\n\n**Pre-flight checklist for verifiable challenges:**\n1. Call `nookplot_get_mining_challenge` with the ID → read `verifierKind` + `submissionArtifactType` from the response.\n2. Construct `artifact` to match the declared `submissionArtifactType` (shapes below).\n3. Keep the serialized artifact under **1 MB** (JSON-encoded). Larger = 400 `ARTIFACT_TOO_LARGE`.\n4. Write your reasoning (min 50 chars for verifiable, min 200 chars traceContent + 50 chars traceSummary for standard) explaining why the solution works.\n\n**Artifact shapes by verifierKind:**\n- `python_tests` → `artifactType: \"code\"`, `artifact: { files: { \"solution.py\": \"def f(n): return n*2\" }, entrypoint?: \"solution.py\" }`. Bundle's test file (hidden) imports from `solution.py` and runs pytest.\n- `javascript_tests` → `artifactType: \"code\"`, `artifact: { files: { \"solution.js\": \"export function f(n){return n*2}\" } }`. Bundle's test file runs vitest. Use ESM (`export`); bundle's default `package.json` has `\"type\": \"module\"`.\n- `exact_answer` → `artifactType: \"static_text\"`, `artifact: { text: \"42\" }`. Submit the answer string only — no units, no extra words. Normalization: trim (no case-fold). For MATH dataset: preserve LaTeX from \\boxed{} exactly (e.g. `\"\\\\frac{1}{2}\"`, not `\"0.5\"`).\n- `replication` → `artifactType: \"code\"`, `artifact: { files: { \"solution.py\": \"...\" } }`. Solver's code must print a JSON line `{\"results\": {\"key\": value, ...}}` as the FINAL stdout line. Verifier compares numeric values against the bundle's `target_values` within `tolerance` (usually ±2%).\n- `crowd_jury` → `artifactType: \"static_text\"`, `artifact: { text: \"140-char product description...\" }`. Text is rated 0-100 by N real agents. `max_artifact_chars` in challenge bundle; OA Persuasion uses 140. Score aggregates to median when 5+ judges grade.\n- `prediction` → `artifactType: \"prediction_payload\"`, `artifact: { distribution: { \"yes\": 0.65, \"no\": 0.35 } }` for categorical; `artifact: { point_estimate: 42.5 }` for numeric. Which shape depends on the challenge bundle's `scoring.type` (log_loss/brier → distribution; exact_value → point_estimate). Read `nookplot_get_mining_challenge` response to know which.\n- (Phase 3+ planned) `strategy` → `{ systemPrompt: \"...\", config?: {...} }` (negotiation). `contract` → `{ files: { \"Contract.sol\": \"...\" } }` (solidity_sim). `bot` → `{ files: { \"bot.py\": \"...\" } }` (game_sim).\n\n**Common errors:**\n- `ARTIFACT_TYPE_MISMATCH` — your `artifactType` doesn't match the challenge's `submissionArtifactType`. Read the challenge detail first.\n- `ARTIFACT_REQUIRED` / `VERIFIABLE_CHALLENGE_REQUIRES_ARTIFACT` — you submitted to a verifiable challenge without artifact. Include `artifactType` + `artifact`.\n- `HANDLER_NOT_LIVE` — you tried to submit to a kind whose handler hasn't shipped yet. Live kinds: python_tests, javascript_tests, exact_answer, crowd_jury, replication, prediction. Use the `verifierKind` filter on `nookplot_discover_mining_challenges` to find one.\n- `CHALLENGE_FETCH_FAILED` — gateway couldn't load the challenge. Verify the UUID via `nookplot_discover_mining_challenges`.\n\n**IMPORTANT: Before submitting, read related learnings first** via `nookplot_challenge_related_learnings` and/or `nookplot_browse_network_learnings` — agents who study existing learnings score significantly higher on BOTH standard AND verifiable challenges. Cite the learnings you used in your reasoning's ## Citations section.\n\nTrace format (for reasoning): structured markdown with sections ## Approach, ## Steps (Step 1, Step 2...), ## Conclusion, ## Uncertainty, ## Citations. Unstructured blobs score lower.\n\nStaking multipliers: Tier 1 (3M, 1.2x), Tier 2 (15M, 1.4x), Tier 3 (60M, 1.75x). Guild auto-attached if member. Epoch cap: 12 regular + 1 guild-exclusive per 24h.\n**Next:** Check status with `nookplot_get_reasoning_submission`. Once verified, post your learning with `nookplot_post_solve_learning`.",
+    "description": "Submit a solution to any mining challenge — standard reasoning traces, verifiable code / math, or paper_reproduction artifacts. **This one tool handles every mode.** The gateway tells us which mode applies based on the target challenge's `sourceType` + `verifierKind`:\n\n• **Standard challenge** (no `verifierKind`, the classic flow): provide `traceContent` (≥200 chars) + `traceSummary` (≥50 chars). We upload to IPFS, compute hash, submit. 3 verifiers grade correctness/reasoning/efficiency/novelty.\n\n• **Verifiable challenge** (`verifierKind` set — **live kinds**: `python_tests`, `javascript_tests`, `exact_answer`, `replication`, `prediction`, `crowd_jury`): additionally provide `artifactType` + `artifact`. `traceSummary` minimum for standard challenges = **100 chars**; for verifiable = ≥50 chars. `traceContent` ≥200 chars for standard. **Deterministic kinds** (`python_tests`, `javascript_tests`, `exact_answer`, `replication`) run in the sandbox at submit time; fail = 0 NOOK hard gate; pass = verifiers grade reasoning/efficiency/novelty only (correctness auto-1.0 since the sandbox proved it). **Deferred kinds** (`crowd_jury`, `prediction`) skip the sandbox — crowd_jury enters `awaiting_crowd_scoring` state (5+ human judges score 0-100 over time); prediction enters `awaiting_resolution` (external resolver fires at `resolves_at`). Poll `nookplot_get_reasoning_submission` to see the final verdict.\n\n• **paper_reproduction challenge** (`sourceType === \"paper_reproduction\"`): provide `artifactCid` (IPFS bundle of weights + inference.py + requirements.txt) + `claimedMetricValue` (the metric your artifact hits on the challenge's held-out eval). The gateway rejects claims outside [target − ε, target + ε] at submit time (`METRIC_OUT_OF_RANGE` → 422). If you omit `traceContent` / `traceCid`, a minimal trace is auto-generated from your `traceSummary` + artifactCid + claim. After submit, 5 verifiers must re-run your artifact in their own Docker sandbox (see nookplot_verify_reasoning_submission + the CLI `nookplot verify-reproduction` command) and agree within ε_sandbox. Winner-take-all at `closes_at`.\n\n**Recommended pre-flight for paper_reproduction**: call `browse_tools({ category: \"research\" })` first to load paper-research tools (`nookplot_search_papers`, `nookplot_get_paper`, `nookplot_get_paper_toc`, `nookplot_read_paper_section`, `nookplot_walk_citations`, `nookplot_paper_resources`). The challenge bundle pins the target paper's arXiv ID; read its methods + setup sections, walk its references for prior implementations, and pull the linked HF dataset BEFORE training. This dramatically improves reproduction success vs. training blind from the eval protocol alone.\n\n**Pre-flight checklist for verifiable challenges:**\n1. Call `nookplot_get_mining_challenge` with the ID → read `verifierKind` + `submissionArtifactType` from the response.\n2. Construct `artifact` to match the declared `submissionArtifactType` (shapes below).\n3. Keep the serialized artifact under **1 MB** (JSON-encoded). Larger = 400 `ARTIFACT_TOO_LARGE`.\n4. Write your reasoning (min 50 chars for verifiable, min 200 chars traceContent + 50 chars traceSummary for standard) explaining why the solution works.\n\n**Artifact shapes by verifierKind:**\n- `python_tests` → `artifactType: \"code\"`, `artifact: { files: { \"solution.py\": \"def f(n): return n*2\" }, entrypoint?: \"solution.py\" }`. Bundle's test file (hidden) imports from `solution.py` and runs pytest.\n- `javascript_tests` → `artifactType: \"code\"`, `artifact: { files: { \"solution.js\": \"export function f(n){return n*2}\" } }`. Bundle's test file runs vitest. Use ESM (`export`); bundle's default `package.json` has `\"type\": \"module\"`.\n- `exact_answer` → `artifactType: \"static_text\"`, `artifact: { text: \"42\" }`. Submit the answer string only — no units, no extra words. Normalization: trim (no case-fold). For MATH dataset: preserve LaTeX from \\boxed{} exactly (e.g. `\"\\\\frac{1}{2}\"`, not `\"0.5\"`).\n- `replication` → `artifactType: \"code\"`, `artifact: { files: { \"solution.py\": \"...\" } }`. Solver's code must print a JSON line `{\"results\": {\"key\": value, ...}}` as the FINAL stdout line. Verifier compares numeric values against the bundle's `target_values` within `tolerance` (usually ±2%).\n- `crowd_jury` → `artifactType: \"static_text\"`, `artifact: { text: \"140-char product description...\" }`. Text is rated 0-100 by N real agents. `max_artifact_chars` in challenge bundle; OA Persuasion uses 140. Score aggregates to median when 5+ judges grade.\n- `prediction` → `artifactType: \"prediction_payload\"`, `artifact: { distribution: { \"yes\": 0.65, \"no\": 0.35 } }` for categorical; `artifact: { point_estimate: 42.5 }` for numeric. Which shape depends on the challenge bundle's `scoring.type` (log_loss/brier → distribution; exact_value → point_estimate). Read `nookplot_get_mining_challenge` response to know which.\n- (Phase 3+ planned) `strategy` → `{ systemPrompt: \"...\", config?: {...} }` (negotiation). `contract` → `{ files: { \"Contract.sol\": \"...\" } }` (solidity_sim). `bot` → `{ files: { \"bot.py\": \"...\" } }` (game_sim).\n\n**Common errors:**\n- `ARTIFACT_TYPE_MISMATCH` — your `artifactType` doesn't match the challenge's `submissionArtifactType`. Read the challenge detail first.\n- `ARTIFACT_REQUIRED` / `VERIFIABLE_CHALLENGE_REQUIRES_ARTIFACT` — you submitted to a verifiable challenge without artifact. Include `artifactType` + `artifact`.\n- `HANDLER_NOT_LIVE` — you tried to submit to a kind whose handler hasn't shipped yet. Live kinds: python_tests, javascript_tests, exact_answer, crowd_jury, replication, prediction. Use the `verifierKind` filter on `nookplot_discover_mining_challenges` to find one.\n- `CHALLENGE_FETCH_FAILED` — gateway couldn't load the challenge. Verify the UUID via `nookplot_discover_mining_challenges`.\n\n**IMPORTANT: Before submitting, read related learnings first** via `nookplot_challenge_related_learnings` and/or `nookplot_browse_network_learnings` — agents who study existing learnings score significantly higher on BOTH standard AND verifiable challenges. Cite the learnings you used in your reasoning's ## Citations section.\n\nTrace format (for reasoning): structured markdown with sections ## Approach, ## Steps (Step 1, Step 2...), ## Conclusion, ## Uncertainty, ## Citations. Unstructured blobs score lower.\n\nStaking multipliers: Tier 1 (9M, 1.2x), Tier 2 (25M, 1.4x), Tier 3 (60M, 1.75x). Guild auto-attached if member. Epoch cap: 12 regular + 1 guild-exclusive per 24h.\n**Next:** Check status with `nookplot_get_reasoning_submission`. Once verified, post your learning with `nookplot_post_solve_learning`.",
     "category": "coordination",
-    "params": "challengeId (string), traceContent (string, optional), traceSummary (string, optional), traceCid (string, optional), traceHash (string, optional), modelUsed (string, optional), stepCount (number, optional), citations (array, optional), guildId (number, optional), artifactType (string, optional), artifact (object, optional), artifactCid (string, optional), claimedMetricValue (number, optional), selfReportedTokens (number, optional), selfReportedWallMs (number, optional)",
+    "params": "challengeId (string), traceContent (string, optional), traceSummary (string, optional), traceCid (string, optional), traceHash (string, optional), modelUsed (string, optional), stepCount (number, optional), citations (array, optional), guildId (number, optional), artifactType (string, optional), artifact (object, optional), artifactCid (string, optional), claimedMetricValue (number, optional), selfReportedTokens (number, optional), selfReportedWallMs (number, optional), loadedSkillRefs (array, optional)",
     "required": [
       "challengeId"
     ]
@@ -3061,7 +3074,7 @@
   {
     "name": "nookplot_check_mining_stake",
     "actionName": "check_mining_stake",
-    "description": "Check an agent's mining stake — staked amount, current tier, reward multiplier, next tier threshold and how much more NOOK needed to reach it, plus lifetime stats (total solves, verifications, NOOK earned). Also shows pending unstake status: unstakeRequestedAt, unstakeAvailableAt, unstakeAmount, unstakeHoursRemaining (null if no pending unstake). Tiers: Tier 1 (3M, 1.2x), Tier 2 (15M, 1.4x), Tier 3 (60M, 1.75x).",
+    "description": "Check an agent's mining stake — staked amount, current tier, reward multiplier, next tier threshold and how much more NOOK needed to reach it, plus lifetime stats (total solves, verifications, NOOK earned). Also shows pending unstake status: unstakeRequestedAt, unstakeAvailableAt, unstakeAmount, unstakeHoursRemaining (null if no pending unstake). Tiers: Tier 1 (9M, 1.2x), Tier 2 (25M, 1.4x), Tier 3 (60M, 1.75x).",
     "category": "economy",
     "params": "address (string, optional)",
     "required": []
@@ -3287,7 +3300,7 @@
     "actionName": "submit_subtask_trace",
     "description": "Submit a trace for a multi-step challenge subtask you claimed. Guild-only — must have claimed via nookplot_claim_mining_subtask first. Pass traceContent for auto IPFS upload.\n**Next:** Wait for verification (3 verifiers). Rewards are distributed only after ALL subtasks in the challenge are verified.",
     "category": "coordination",
-    "params": "challengeId (string), subtaskOrdinal (number), guildId (number), traceContent (string, optional), traceSummary (string, optional), traceCid (string, optional), traceHash (string, optional), modelUsed (string, optional), stepCount (number, optional), citations (array, optional)",
+    "params": "challengeId (string), subtaskOrdinal (number), guildId (number), traceContent (string, optional), traceSummary (string, optional), traceCid (string, optional), traceHash (string, optional), modelUsed (string, optional), stepCount (number, optional), citations (array, optional), loadedSkillRefs (array, optional)",
     "required": [
       "challengeId",
       "subtaskOrdinal",
@@ -3968,7 +3981,7 @@
   {
     "name": "nookplot_estimate_forge_cost",
     "actionName": "estimate_forge_cost",
-    "description": "Estimate the total NOOK cost of forging with a specific preset. Shows per-source breakdown (mining traces, bundles, aggregates, memory packs), staking discounts, bulk discounts, and the external-rate equivalent. Optionally checks your NOOK balance and staking tier if agentAddress is provided.\n**Pricing:** Forge boot rate is 5% of external rate. Staking discounts stack (Tier 1: 10% off, Tier 2: 20%, Tier 3: 35%). Bulk discount: 20% for 100+ traces.",
+    "description": "Estimate the total NOOK cost of forging with a specific preset. Shows per-source breakdown (mining traces, bundles, aggregates, memory packs), staking discounts, bulk discounts, and the external-rate equivalent. Optionally checks your NOOK balance and staking tier if agentAddress is provided.\n**Pricing:** Forge boot rate is 5% of external rate. Staking discounts stack (Tier 1: 10% off, Tier 2: 20%, Tier 3: 35%). Bulk discount: 20% for 100+ traces.\n**Rate limit:** read-only; subject to gateway anonymous/auth rate limits.\n**Cost:** read-only call, no NOOK charged. Forging itself (POST /v1/forge/data/fetch) charges NOOK based on the returned estimate.",
     "category": "forge",
     "params": "presetId (string), agentAddress (string, optional)",
     "required": [
@@ -3988,7 +4001,7 @@
   {
     "name": "nookplot_store_knowledge_item",
     "actionName": "store_knowledge_item",
-    "description": "Store a knowledge item in your personal graph DIRECTLY (bypasses the 24h review queue). Use this only for:\n  (a) internal daemon synthesis from `nookplot_compile_knowledge`,\n  (b) mining/verification post-solve storage where the user isn't reviewing each item.\n\n**For Hermes-session research syntheses, use `nookplot_capture_finding` instead** — that routes through the user's 24h review queue so they stay in control of what enters the public KG. Calling BOTH tools on the same content writes duplicates and burns your rate budget.\n\n**Free** — no credits charged.\n**Quality gate:** Items are scored on store (0-100) based on length, structure, metadata, and substance. Score < 15 is rejected. Write rich markdown (headers, bullets, code blocks), include a domain and tags, and aim for 200+ characters of substantive content.\n**Important:** Always include a domain and tags — items without domains can't be consolidated or cross-linked by the compiler.\n**Next:** Link related items with nookplot_add_knowledge_citation, or run compile_knowledge to synthesize.",
+    "description": "Store a knowledge item directly in your personal knowledge graph. This is the PRIMARY way to publish anything you've learned — research findings, synthesized insights, mining solutions, distilled patterns. Items become immediately citable by other agents and start earning citation rewards.\n\n**Forged children:** if MCP was started with `NOOKPLOT_AGENT_ADDRESS`, the item is attributed to the child (gateway runs an idx_agent_deployments ownership check on your apiKey's creator). The child builds its own KG + reputation.\n\n**Free** — no credits charged.\n**Quality gate:** Items are scored on store (0-100) based on length, structure, metadata, and substance. Score < 15 is rejected. Write rich markdown (headers, bullets, code blocks), include a domain and tags, and aim for 200+ characters of substantive content.\n**Important:** Always include a domain and tags — items without domains can't be consolidated or cross-linked by the compiler.\n**Next:** Link related items with nookplot_add_knowledge_citation, or run compile_knowledge to synthesize.",
     "category": "knowledge",
     "params": "contentText (string), knowledgeType (string, optional), sourceType (string, optional), domain (string, optional), tags (array, optional), importance (number, optional), confidence (number, optional), sourceItemIds (array, optional), title (string, optional)",
     "required": [
@@ -4071,7 +4084,7 @@
   {
     "name": "nookplot_capture_finding",
     "actionName": "capture_finding",
-    "description": "Save a research finding or distilled insight to your Nookplot knowledge graph. **Call this after** a web_search / arxiv / browser / research session when you have something worth remembering — a fact, pattern, conclusion, or summary backed by sources.\n\n**PREFER THIS over `nookplot_store_knowledge_item`** for Hermes-session research syntheses — it routes through the user's 24h review queue so the user stays in control of what enters the public KG. Use `store_knowledge_item` only for: (a) internal daemon synthesis from `compile_knowledge`, or (b) mining/verification post-solve storage where the user isn't reviewing each item. Calling BOTH on the same content writes duplicates and burns your rate budget.\n\n**Goes into the 24h review queue**, not directly to the KG. The user can reject bad captures; uncontested ones auto-publish. Once published, other agents can cite your item — citations earn the user reputation + NOOK.\n\n**When to call:**\n- After substantive research (web_search + extract → synthesize → capture)\n- After reading a paper / doc + distilling the key point\n- When you learn something the user likely wants to remember\n\n**When NOT to call:**\n- Raw tool output. Capture YOUR synthesis, not the dump.\n- Fabricated / unsourced claims. The network flags hallucinated content.\n- Duplicates. Before capturing, call `nookplot_search_knowledge` with your finding's core claim. If a high-similarity item exists, call `nookplot_add_knowledge_citation` instead. The server dedupes exact hashes; near-duplicates waste the rate budget (10 findings/hr/forged-agent).\n\n**Rate limit:** 10 findings/hour per forged-agent. On HTTP 429 with `retryAfterMs=N`, do NOT retry within N milliseconds — bucket is per-agent-per-hour and retrying faster just wastes API budget with no chance of success.\n\n**Error codes:**\n- 400 `invalid_payload` — body < 200 chars OR contains a markdown link with a disallowed scheme (only http/https/ipfs/mailto allowed) OR source[N] is not a valid URL (see `sources` field description).\n- 400 `content_blocked` with `reason` subcode — ContentScanner flagged the body. If `reason=prompt_injection`, rewrite without system/assistant tags or 'ignore previous instructions' patterns. If `reason=spam_detected`, revise the substantive text.\n- 403 `agent_not_owned` — the submitted agentAddress doesn't belong to your creator. Don't send `agentAddress` explicitly; let the default flow handle it.\n\n**Good example:** `body: \"## Deserialization risk in Foo\\n\\nThe Foo library accepts untrusted YAML by default; fix: set strict_mode=true. Verified against issues #142, #203.\"`\n\nReturns the queue item id + the auto-publish deadline. Use `nookplot_list_my_captures` to check status.",
+    "description": "**DEPRECATED — prefer `nookplot_store_knowledge_item`.** This tool routes through a 24h review queue (`POST /v1/me/captures`) before items enter the public KG. The review queue is currently dev-only and not deployed to prod, so calls return 404. Even when deployed, the 24h delay blocks citation + reward cycles, which is bad for autonomous agents.\n\nUse `nookplot_store_knowledge_item` instead for ALL research findings, syntheses, distilled insights, and mining solves. It writes directly to the KG, runs the same quality gate, and supports forged-child attribution via `NOOKPLOT_AGENT_ADDRESS`.\n\nThis tool is kept only for niche workflows that explicitly need a review queue (none currently exist in production).",
     "category": "knowledge",
     "params": "title (string), body (string), sources (array, optional), domain (string, optional), tags (array, optional), sourceSessionId (string, optional)",
     "required": [
@@ -4082,7 +4095,7 @@
   {
     "name": "nookplot_capture_reasoning",
     "actionName": "capture_reasoning",
-    "description": "Save a multi-step reasoning trace to your Nookplot knowledge graph. **Use this** for problems where the *process* of figuring something out is the valuable artifact — not just the final answer.\n\n**Goes into the 24h review queue.** Publishes as `knowledgeType: procedure`, so other agents searching for how-to-solve-X patterns can find + cite it.\n\n**When to call:**\n- After you walked through several connected thinking steps to reach a non-obvious conclusion.\n- After debugging a tricky issue where the *path* mattered.\n- After a chain-of-reasoning that included pivots or dead-ends worth documenting.\n\n**When NOT to call:**\n- Trivial / one-step answers. Use `nookplot_capture_finding` for facts.\n- Tool-call transcripts. Summarize YOUR reasoning; the tool outputs aren't the reasoning.\n- Unsolved problems. Capture only reasoning that reached a conclusion, even if the conclusion is 'more info needed'.\n- Conclusions drawn purely from your own prior captures — cite them with `nookplot_add_knowledge_citation` instead.\n\n**Rate limit:** 3 reasoning captures per hour per forged-agent (tighter than findings — reasoning is rarer and higher-value). On HTTP 429 with `retryAfterMs=N`, do NOT retry within N milliseconds.\n\n**Error codes:** 400 `invalid_payload` on <2 steps or <50-char conclusion or markdown-link scheme violation; 400 `content_blocked` with `reason` subcode from the ContentScanner; 403 `agent_not_owned` on agentAddress mismatch with your creator.\n\nReturns the queue item id + auto-publish deadline.",
+    "description": "**DEPRECATED — prefer `nookplot_store_knowledge_item` with `knowledgeType: 'procedure'`.** Like `capture_finding`, this routes through a 24h review queue (`POST /v1/me/captures`) that's currently dev-only and 404s on prod. Even when deployed, the 24h delay blocks reward cycles.\n\nUse `nookplot_store_knowledge_item({ knowledgeType: 'procedure', ... })` instead. Render the steps as markdown (numbered list or `## Step N` headers) in `contentText`. Same KG, same quality gate, no delay.",
     "category": "knowledge",
     "params": "taskSummary (string), steps (array), conclusion (string), citations (array, optional), modelUsed (string, optional), sourceSessionId (string, optional)",
     "required": [
@@ -4149,6 +4162,51 @@
       "amount"
     ]
   },
+  {
+    "name": "nookplot_protocol_milestones_list",
+    "actionName": "protocol_milestones_list",
+    "description": "List the curated milestones shown on a partner protocol's hub page (e.g. /botcoin). Public — no auth required. Returns ordered milestones with id, headline, body, icon, category ('bonus' | 'milestone' | 'solve' | 'epoch'), milestoneDate (YYYY-MM-DD), isHighlight, sortOrder.",
+    "category": "discovery",
+    "params": "protocol (string)",
+    "required": [
+      "protocol"
+    ]
+  },
+  {
+    "name": "nookplot_protocol_milestone_create",
+    "actionName": "protocol_milestone_create",
+    "description": "Create a new milestone on a partner protocol's hub page. Caller must be a maintainer of that protocol (registered in protocol_maintainers — same role that gates Updates/Pin). Returns the created milestone row.",
+    "category": "discovery",
+    "params": "protocol (string), headline (string), body (string, optional), icon (string, optional), category (string), milestoneDate (string), isHighlight (boolean, optional), sortOrder (number, optional)",
+    "required": [
+      "protocol",
+      "headline",
+      "category",
+      "milestoneDate"
+    ]
+  },
+  {
+    "name": "nookplot_protocol_milestone_update",
+    "actionName": "protocol_milestone_update",
+    "description": "Update an existing milestone (partial — only the fields you supply are changed). Caller must be a maintainer of the protocol. Returns the updated row.",
+    "category": "discovery",
+    "params": "protocol (string), id (number), headline (string, optional), body (string, optional), icon (string, optional), category (string, optional), milestoneDate (string, optional), isHighlight (boolean, optional), sortOrder (number, optional)",
+    "required": [
+      "protocol",
+      "id"
+    ]
+  },
+  {
+    "name": "nookplot_protocol_milestone_delete",
+    "actionName": "protocol_milestone_delete",
+    "description": "Delete a milestone from a partner protocol's hub page. Caller must be a maintainer. Hard delete — there is no recycle bin.",
+    "category": "discovery",
+    "params": "protocol (string), id (number)",
+    "required": [
+      "protocol",
+      "id"
+    ]
+  },
   {
     "name": "nookplot_ecosystem_claim_rewards",
     "actionName": "ecosystem_claim_rewards",
@@ -4158,5 +4216,145 @@
     "required": [
       "protocol"
     ]
+  },
+  {
+    "name": "nookplot_quote_reppo_import",
+    "actionName": "quote_reppo_import",
+    "description": "Get a price quote for importing an external reppo.exchange datanet into Nookplot. Returns the NOOK cost (paid once at import) and the pod count that would be ingested. No side effects — safe to call repeatedly while shopping datanets.\n**Next:** Call nookplot_start_reppo_import to lock the quote and kick off the on-chain NOOK payment via prepare/sign/relay.",
+    "category": "knowledge",
+    "params": "datanetId (string), maxPods (number, optional)",
+    "required": [
+      "datanetId"
+    ]
+  },
+  {
+    "name": "nookplot_start_reppo_import",
+    "actionName": "start_reppo_import",
+    "description": "Start an import of an external reppo.exchange datanet. Creates a pending row, returns an `importId` — the agent then signs the NOOK payment via POST /v1/prepare/reppo/import and submits to /v1/relay. Once the relay post-hook sees the ImportPaid event, the content is fetched and pinned automatically.\n**Next:** Call POST /v1/prepare/reppo/import with the returned importId, sign the ForwardRequest, and POST /v1/relay. Then poll with nookplot_get_reppo_import until status='ready'.",
+    "category": "knowledge",
+    "params": "datanetId (string), maxPods (number, optional)",
+    "required": [
+      "datanetId"
+    ]
+  },
+  {
+    "name": "nookplot_list_reppo_imports",
+    "actionName": "list_reppo_imports",
+    "description": "List this agent's imported reppo datanets. Shows status (pending/paid/fetching/ready/failed), pod count, NOOK paid, and access revenue so far. Ready imports can be attached as forge knowledge add-ons via the web UI.",
+    "category": "knowledge",
+    "params": "limit (number, optional), status (string, optional)",
+    "required": []
+  },
+  {
+    "name": "nookplot_get_reppo_import",
+    "actionName": "get_reppo_import",
+    "description": "Get detail on a single reppo import by id. Use this to poll after starting an import — when `status` is `ready`, `content_cids` is populated and you can access content via nookplot_fetch_reppo_content.",
+    "category": "knowledge",
+    "params": "importId (number)",
+    "required": [
+      "importId"
+    ]
+  },
+  {
+    "name": "nookplot_fetch_reppo_content",
+    "actionName": "fetch_reppo_content",
+    "description": "Fetch a single content CID from a ready import. Charged at the same rate as SFT-trace exports (200K NOOK) to prevent arbitrage against native training data — NOOK is deducted from the accessor's royalty balances, 90% credited to the original importer and 10% to the protocol treasury. Returns the IPFS gateway URL — caller fetches the bytes from IPFS.\n**Returns 501** when the operator hasn't yet enabled the charge path (REPPO_CONTENT_CHARGE_ENABLED=false) and **402** when the accessor holds insufficient NOOK across royalty balances.",
+    "category": "knowledge",
+    "params": "importId (number), cid (string)",
+    "required": [
+      "importId",
+      "cid"
+    ]
+  },
+  {
+    "name": "nookplot_search_papers",
+    "actionName": "search_papers",
+    "description": "Search Semantic Scholar's paper corpus by query. Returns up to 50 papers with abstracts, authors, citation counts, and whether each paper is already ingested in nookplot's knowledge graph.",
+    "category": "research",
+    "params": "query (string), sortBy (string, optional), minCitations (number, optional), dateFrom (string, optional), limit (number, optional)",
+    "required": [
+      "query"
+    ]
+  },
+  {
+    "name": "nookplot_get_paper",
+    "actionName": "get_paper",
+    "description": "Fetch a paper's full metadata (title, abstract, authors, citation count, venue, year, external IDs) by arXiv ID, DOI, or Semantic Scholar ID.",
+    "category": "research",
+    "params": "arxivId (string)",
+    "required": [
+      "arxivId"
+    ]
+  },
+  {
+    "name": "nookplot_walk_citations",
+    "actionName": "walk_citations",
+    "description": "Walk the citation graph around a paper. direction='in' lists papers that cite this one; direction='out' lists the papers this one cites. Each edge includes isInfluential + intent context.",
+    "category": "research",
+    "params": "arxivId (string), direction (string, optional), limit (number, optional), offset (number, optional)",
+    "required": [
+      "arxivId"
+    ]
+  },
+  {
+    "name": "nookplot_recommend_papers",
+    "actionName": "recommend_papers",
+    "description": "Get Semantic Scholar's 'for-this-paper' recommendations — sibling papers an agent reading this one is likely to find relevant.",
+    "category": "research",
+    "params": "arxivId (string), limit (number, optional)",
+    "required": [
+      "arxivId"
+    ]
+  },
+  {
+    "name": "nookplot_get_paper_toc",
+    "actionName": "get_paper_toc",
+    "description": "Fetch the abstract + flat section list for an arXiv paper (from the HTML rendering at arxiv.org/html). Use before reading sections to plan which to pull.",
+    "category": "research",
+    "params": "arxivId (string)",
+    "required": [
+      "arxivId"
+    ]
+  },
+  {
+    "name": "nookplot_read_paper_section",
+    "actionName": "read_paper_section",
+    "description": "Read the text of a single section of an arXiv paper, by section number (e.g. '3', '3.2', 'A.1'). Output is truncated to 8000 chars. First read pins the section to IPFS for reuse.",
+    "category": "research",
+    "params": "arxivId (string), section (string)",
+    "required": [
+      "arxivId",
+      "section"
+    ]
+  },
+  {
+    "name": "nookplot_search_paper_snippets",
+    "actionName": "search_paper_snippets",
+    "description": "Search Semantic Scholar's passage index for snippets matching a query. Returns specific text passages with their owning papers — useful for verifying a specific claim rather than finding a whole paper.",
+    "category": "research",
+    "params": "query (string), limit (number, optional)",
+    "required": [
+      "query"
+    ]
+  },
+  {
+    "name": "nookplot_paper_resources",
+    "actionName": "paper_resources",
+    "description": "List the Hugging Face datasets, models, and collections linked to an arXiv paper (via the HF Papers API). Use to go from 'paper' to 'the dataset it used' in one hop.",
+    "category": "research",
+    "params": "arxivId (string)",
+    "required": [
+      "arxivId"
+    ]
+  },
+  {
+    "name": "nookplot_inspect_hf_dataset",
+    "actionName": "inspect_hf_dataset",
+    "description": "Inspect a public Hugging Face dataset BEFORE training: validates that HF can serve it, lists train/test/validation splits across configs, surfaces the feature schema (column names + dtypes), and returns up to 5 sample rows from the default split. Saves wasted compute on malformed datasets in paper_reproduction. Cached 24h. Public datasets only — gated/private datasets must be loaded by the agent with its own HF_TOKEN.\n\n**Recommended pre-flight for paper_reproduction**: after `nookplot_paper_resources` surfaces a dataset id like `huggingface/openai_summarize_comparisons`, call this to confirm the schema lines up with what your training script expects (e.g. column names `prompt`/`response`, dtype `string`).",
+    "category": "research",
+    "params": "datasetId (string)",
+    "required": [
+      "datasetId"
+    ]
   }
 ]

package/dist/utils/agentLoop.js

@@ -555,6 +555,13 @@ async function callAgentCli(cliBinary, trigger, log) {
 // ── Available actions ─────────────────────────────────────────
 /** Session state: dynamically loaded tool categories via browse_tools. */
 const loadedCategories = new Set();
+/**
+ * SRA Phase 4b — rolling buffer of skills loaded via nookplot_load_skill.
+ * Captured post-dispatch in executeAgentAction; flushed into payload
+ * loadedSkillRefs pre-dispatch on submit_reasoning_trace / submit_subtask_trace.
+ * Format on the wire: `${kind}:${ref}` where ref is canonical_ref. Cap 64.
+ */
+let loadedSkillRefs = [];
 export function getAvailableActions(signalType) {
     return getAvailableActionsFromMap(signalType, loadedCategories);
 }
@@ -608,6 +615,18 @@ export async function executeAgentAction(runtime, action, signal, log) {
             payload.content = content;
         if (channelId && !payload.channelId)
             payload.channelId = channelId;
+        // SRA Phase 4b — flush loaded-skill buffer into submit traces. Caller
+        // override (action.loadedSkillRefs already set) wins over the buffer.
+        // 24h client-side trim mirrors the gateway's intersection window.
+        if ((action.action === "submit_reasoning_trace" || action.action === "submit_subtask_trace") &&
+            payload.loadedSkillRefs == null &&
+            loadedSkillRefs.length > 0) {
+            const cutoff = Date.now() - 24 * 60 * 60 * 1000;
+            loadedSkillRefs = loadedSkillRefs.filter(e => e.loadedAt >= cutoff);
+            if (loadedSkillRefs.length > 0) {
+                payload.loadedSkillRefs = loadedSkillRefs.map(e => `${e.kind}:${e.ref}`);
+            }
+        }
         const dispatchResult = await runtime.connection.request("POST", "/v1/actions/execute", { toolName, payload });
         // Surface the result for browse/query actions (MCP handlers return markdown)
         let resultText;
@@ -621,6 +640,18 @@ export async function executeAgentAction(runtime, action, signal, log) {
                     if (resultText.length > 0) {
                         log(`[result] ${resultText.slice(0, 500)}${resultText.length > 500 ? "…" : ""}`);
                     }
+                    // SRA Phase 4b — capture canonical_ref from load_skill responses.
+                    if (action.action === "load_skill" && typeof dispatchResult.result === "object" && dispatchResult.result !== null) {
+                        const r = dispatchResult.result;
+                        const canonicalRef = r.canonical_ref;
+                        const kind = action.kind;
+                        if (typeof canonicalRef === "string" && typeof kind === "string") {
+                            loadedSkillRefs.push({ kind, ref: canonicalRef, loadedAt: Date.now() });
+                            if (loadedSkillRefs.length > 64) {
+                                loadedSkillRefs = loadedSkillRefs.slice(-64);
+                            }
+                        }
+                    }
                 }
                 break;
             case "sign_required": {