[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"skill:01M73DXHHQP9E3TB9KGJE9JSY7":3,"skill-same:01M73DXHHQP9E3TB9KGJE9JSY7":47},{"skillNo":4,"name":5,"nameZh":6,"description":6,"descriptionZh":6,"repositoryFullName":7,"ownerLogin":8,"ownerAvatarUrl":9,"ownerAccountNo":10,"ownerDisplayName":11,"repositoryNo":12,"starsCount":13,"licenseSpdxId":14,"licenseFileUrl":6,"sourceHtmlUrl":15,"categories":16,"keywords":17,"publishedAt":18,"linkOnly":19,"markdownContent":20,"markdownBody":21,"frontMatter":22,"refName":23,"commitSha":24,"skillDirectory":25,"forksCount":26,"repositoryHtmlUrl":27,"repositoryHomepageUrl":28,"ownerHtmlUrl":29,"ownerBlogUrl":30,"ownerDescription":31,"updatedAt":32,"install":33,"resources":46},"01M73DXHHQP9E3TB9KGJE9JSY7","ndarray-vector-math",null,"Horonomos-laps\u002FYana-AI","Horonomos-laps","https:\u002F\u002Favatars.githubusercontent.com\u002Fu\u002F355299122?v=4","01M76B3QPXE88ET2SQPDPVATZT"," Horonomos-laps","01M72ZQRJPCYPSSWT4D00VJR2A",13,"Apache-2.0","https:\u002F\u002Fgithub.com\u002FHoronomos-laps\u002FYana-AI\u002Fblob\u002Fmain\u002Fcore\u002Fskills\u002Fndarray-vector-math\u002FSKILL.md",[],[],"2026-11-11 15:11:14",false,"---\nname: ndarray-vector-math\ndescription: High-performance N-dimensional array operations for vector math in agent memory systems. Cosine similarity, dot product, Euclidean distance, batch matrix ops, and typed array backends. Sources: hughsk\u002Fndarray, scijs ecosystem.\norigin: yana-ai — synthesized from hughsk\u002Fndarray (MIT), scijs\u002Fndarray-ops\nlicense: Apache-2.0\nversion: 1.0.0\ncompatibility: yana-ai >= 1.3.48\n---\n\n# \u002Fndarray-vector-math\n\n## When to Use\n\n- Computing cosine similarity between embedding vectors in agent L1 memory\n- Batch nearest-neighbor search without an external vector DB\n- Matrix operations for PCA\u002Fdimensionality reduction on small embedding sets\n- Fast typed-array math without Python\u002FWASM dependency\n\n## Do NOT use for\n\n- > 100k vectors (use [[in-memory-vector-storage]] or pgvector instead)\n- GPU-accelerated matrix math (use ONNX runtime or TensorFlow.js)\n\n---\n\n## Cosine similarity\n\n```javascript\nimport ndarray from 'ndarray'\nimport ops     from 'ndarray-ops'\n\ntype Vec = Float32Array\n\nfunction cosine(a: Vec, b: Vec): number {\n  if (a.length !== b.length) throw new Error('dimension mismatch')\n  const n = a.length\n  let dot = 0, normA = 0, normB = 0\n  for (let i = 0; i \u003C n; i++) {\n    dot   += a[i] * b[i]\n    normA += a[i] * a[i]\n    normB += b[i] * b[i]\n  }\n  if (normA === 0 || normB === 0) return 0\n  return dot \u002F (Math.sqrt(normA) * Math.sqrt(normB))\n}\n\n\u002F\u002F Usage\nconst queryVec  = new Float32Array([0.1, 0.3, 0.8, ...])\nconst memVec    = new Float32Array([0.2, 0.2, 0.9, ...])\nconst similarity = cosine(queryVec, memVec)\n\u002F\u002F 1.0 = identical, 0.0 = orthogonal, -1.0 = opposite\n```\n\n---\n\n## ndarray batch operations\n\n```javascript\nimport ndarray from 'ndarray'\nimport ops     from 'ndarray-ops'\n\n\u002F\u002F Matrix of N embedding vectors, each of dim D\nconst N = 1000, D = 1536\nconst matrix = ndarray(new Float32Array(N * D), [N, D])\n\n\u002F\u002F Fill with embeddings\nfor (let i = 0; i \u003C N; i++) {\n  for (let d = 0; d \u003C D; d++) {\n    matrix.set(i, d, embeddings[i][d])\n  }\n}\n\n\u002F\u002F L2 normalize all rows in-place\nfor (let i = 0; i \u003C N; i++) {\n  const row  = matrix.pick(i, null)\n  let norm   = 0\n  for (let d = 0; d \u003C D; d++) norm += row.get(d) ** 2\n  norm = Math.sqrt(norm)\n  if (norm > 0) ops.divseq(row, norm)\n}\n```\n\n---\n\n## Top-K nearest neighbors (brute force)\n\n```javascript\nfunction topK(\n  query:     Float32Array,\n  corpus:    Float32Array[],\n  k         = 5,\n  threshold = 0.75\n): { index: number; score: number }[] {\n  return corpus\n    .map((vec, index) => ({ index, score: cosine(query, vec) }))\n    .filter(r => r.score >= threshold)\n    .sort((a, b) => b.score - a.score)\n    .slice(0, k)\n}\n```\n\n---\n\n## Anti-Fake-Pass Checklist\n\n```\n❌ Float64Array instead of Float32Array → 2× memory, no precision benefit for embeddings\n❌ cosine computed on non-normalized vectors → results not in [-1, 1] range\n❌ norm === 0 not checked → NaN propagates through all downstream comparisons\n❌ N > 100k with brute force → O(N*D) scan too slow (use HNSW index)\n❌ ndarray-ops not imported → ops.divseq silently undefined\n❌ Dimension mismatch not caught → silent wrong results (no runtime error)\n```\n","# \u002Fndarray-vector-math\n\n## When to Use\n\n- Computing cosine similarity between embedding vectors in agent L1 memory\n- Batch nearest-neighbor search without an external vector DB\n- Matrix operations for PCA\u002Fdimensionality reduction on small embedding sets\n- Fast typed-array math without Python\u002FWASM dependency\n\n## Do NOT use for\n\n- > 100k vectors (use [[in-memory-vector-storage]] or pgvector instead)\n- GPU-accelerated matrix math (use ONNX runtime or TensorFlow.js)\n\n---\n\n## Cosine similarity\n\n```javascript\nimport ndarray from 'ndarray'\nimport ops     from 'ndarray-ops'\n\ntype Vec = Float32Array\n\nfunction cosine(a: Vec, b: Vec): number {\n  if (a.length !== b.length) throw new Error('dimension mismatch')\n  const n = a.length\n  let dot = 0, normA = 0, normB = 0\n  for (let i = 0; i \u003C n; i++) {\n    dot   += a[i] * b[i]\n    normA += a[i] * a[i]\n    normB += b[i] * b[i]\n  }\n  if (normA === 0 || normB === 0) return 0\n  return dot \u002F (Math.sqrt(normA) * Math.sqrt(normB))\n}\n\n\u002F\u002F Usage\nconst queryVec  = new Float32Array([0.1, 0.3, 0.8, ...])\nconst memVec    = new Float32Array([0.2, 0.2, 0.9, ...])\nconst similarity = cosine(queryVec, memVec)\n\u002F\u002F 1.0 = identical, 0.0 = orthogonal, -1.0 = opposite\n```\n\n---\n\n## ndarray batch operations\n\n```javascript\nimport ndarray from 'ndarray'\nimport ops     from 'ndarray-ops'\n\n\u002F\u002F Matrix of N embedding vectors, each of dim D\nconst N = 1000, D = 1536\nconst matrix = ndarray(new Float32Array(N * D), [N, D])\n\n\u002F\u002F Fill with embeddings\nfor (let i = 0; i \u003C N; i++) {\n  for (let d = 0; d \u003C D; d++) {\n    matrix.set(i, d, embeddings[i][d])\n  }\n}\n\n\u002F\u002F L2 normalize all rows in-place\nfor (let i = 0; i \u003C N; i++) {\n  const row  = matrix.pick(i, null)\n  let norm   = 0\n  for (let d = 0; d \u003C D; d++) norm += row.get(d) ** 2\n  norm = Math.sqrt(norm)\n  if (norm > 0) ops.divseq(row, norm)\n}\n```\n\n---\n\n## Top-K nearest neighbors (brute force)\n\n```javascript\nfunction topK(\n  query:     Float32Array,\n  corpus:    Float32Array[],\n  k         = 5,\n  threshold = 0.75\n): { index: number; score: number }[] {\n  return corpus\n    .map((vec, index) => ({ index, score: cosine(query, vec) }))\n    .filter(r => r.score >= threshold)\n    .sort((a, b) => b.score - a.score)\n    .slice(0, k)\n}\n```\n\n---\n\n## Anti-Fake-Pass Checklist\n\n```\n❌ Float64Array instead of Float32Array → 2× memory, no precision benefit for embeddings\n❌ cosine computed on non-normalized vectors → results not in [-1, 1] range\n❌ norm === 0 not checked → NaN propagates through all downstream comparisons\n❌ N > 100k with brute force → O(N*D) scan too slow (use HNSW index)\n❌ ndarray-ops not imported → ops.divseq silently undefined\n❌ Dimension mismatch not caught → silent wrong results (no runtime error)\n```\n",{},"main","481dcd7dd2e288b9d627a2bd017db70e64e6c6fa","core\u002Fskills\u002Fndarray-vector-math",2,"https:\u002F\u002Fgithub.com\u002FHoronomos-laps\u002FYana-AI","https:\u002F\u002Fyana.vutam.link\u002F","https:\u002F\u002Fgithub.com\u002FHoronomos-laps","https:\u002F\u002Fyana.vutam.link","An open-source governed runtime & execution environment for multi-agent AI systems.","2026-11-14 13:24:09",{"source":7,"skillName":5,"commands":34,"prompt":44,"zipAvailable":45},[35,38,41],{"tool":36,"command":37},"npx","npx skills add Horonomos-laps\u002FYana-AI --skill ndarray-vector-math",{"tool":39,"command":40},"bunx","bunx skills add Horonomos-laps\u002FYana-AI --skill ndarray-vector-math",{"tool":42,"command":43},"pnpm","pnpm dlx skills add Horonomos-laps\u002FYana-AI --skill ndarray-vector-math","安装技能，技能地址：https:\u002F\u002Fgithub.com\u002FHoronomos-laps\u002FYana-AI\u002Fblob\u002Fmain\u002Fcore\u002Fskills\u002Fndarray-vector-math\u002FSKILL.md",true,[],[48,56,63,71,79,87],{"skillNo":49,"name":50,"nameZh":6,"description":51,"descriptionZh":6,"repositoryFullName":7,"ownerLogin":8,"ownerAvatarUrl":9,"ownerAccountNo":10,"ownerDisplayName":11,"repositoryNo":12,"starsCount":13,"licenseSpdxId":52,"licenseFileUrl":6,"sourceHtmlUrl":53,"categories":54,"keywords":55,"publishedAt":18},"01M735GKET5YVYKAY62W2P5YXB","openai--sentry--sentry","Use when the user asks to inspect Sentry issues or events, summarize recent production errors, or pull basic Sentry health data via the Sentry API; perform read-only queries with the bundled script and require `SENTRY_AUTH_TOKEN`.","MIT","https:\u002F\u002Fgithub.com\u002FHoronomos-laps\u002FYana-AI\u002Fblob\u002Fmain\u002F.claude\u002Fskills\u002Fopenai--sentry--sentry\u002FSKILL.md",[],[],{"skillNo":57,"name":58,"nameZh":6,"description":59,"descriptionZh":6,"repositoryFullName":7,"ownerLogin":8,"ownerAvatarUrl":9,"ownerAccountNo":10,"ownerDisplayName":11,"repositoryNo":12,"starsCount":13,"licenseSpdxId":14,"licenseFileUrl":6,"sourceHtmlUrl":60,"categories":61,"keywords":62,"publishedAt":18},"01M73DCAP83T17HY7SMGK7MGFE","ito-basket-compare","Compare Itô prediction-market baskets against a user's knowledge base, portfolio notes, financial context, watchlist, or research thesis. Use for read-only basket comparison and gap analysis without investment advice or live trading.","https:\u002F\u002Fgithub.com\u002FHoronomos-laps\u002FYana-AI\u002Fblob\u002Fmain\u002Fcore\u002Fskills\u002Fito-basket-compare\u002FSKILL.md",[],[],{"skillNo":64,"name":65,"nameZh":6,"description":66,"descriptionZh":6,"repositoryFullName":7,"ownerLogin":8,"ownerAvatarUrl":9,"ownerAccountNo":10,"ownerDisplayName":11,"repositoryNo":12,"starsCount":13,"licenseSpdxId":14,"licenseFileUrl":67,"sourceHtmlUrl":68,"categories":69,"keywords":70,"publishedAt":18},"01M734CYEMZFDR3KH6SW0JP8TD","implementing-network-traffic-baselining","Build network traffic baselines from NetFlow\u002FIPFIX data using Python pandas for statistical analysis, z-score anomaly detection, and hourly\u002Fdaily traffic pattern profiling","https:\u002F\u002Fgithub.com\u002Fyanacuti1121\u002FYana-AI\u002Fblob\u002Fmain\u002F.claude\u002Fskills\u002Fimplementing-network-traffic-baselining\u002FLICENSE","https:\u002F\u002Fgithub.com\u002FHoronomos-laps\u002FYana-AI\u002Fblob\u002Fmain\u002F.claude\u002Fskills\u002Fimplementing-network-traffic-baselining\u002FSKILL.md",[],[],{"skillNo":72,"name":73,"nameZh":6,"description":74,"descriptionZh":6,"repositoryFullName":7,"ownerLogin":8,"ownerAvatarUrl":9,"ownerAccountNo":10,"ownerDisplayName":11,"repositoryNo":12,"starsCount":13,"licenseSpdxId":14,"licenseFileUrl":75,"sourceHtmlUrl":76,"categories":77,"keywords":78,"publishedAt":18},"01M73ASZ6NJRJM44Z2P84NGQ3Q","detecting-evasion-techniques-in-endpoint-logs","Detects defense evasion techniques used by adversaries in endpoint logs including log tampering, timestomping, process injection, and security tool disabling. Use when investigating suspicious endpoint behavior, building detection rules for evasion tactics, or conducting threat hunting for stealthy adversary activity. Activates for requests involving evasion detection, defense evasion analysis, log tampering detection, or MITRE ATT&CK TA0005.","https:\u002F\u002Fgithub.com\u002Fyanacuti1121\u002FYana-AI\u002Fblob\u002Fmain\u002Fcore\u002Fskills\u002Fdetecting-evasion-techniques-in-endpoint-logs\u002FLICENSE","https:\u002F\u002Fgithub.com\u002FHoronomos-laps\u002FYana-AI\u002Fblob\u002Fmain\u002Fcore\u002Fskills\u002Fdetecting-evasion-techniques-in-endpoint-logs\u002FSKILL.md",[],[],{"skillNo":80,"name":81,"nameZh":6,"description":82,"descriptionZh":6,"repositoryFullName":7,"ownerLogin":8,"ownerAvatarUrl":9,"ownerAccountNo":10,"ownerDisplayName":11,"repositoryNo":12,"starsCount":13,"licenseSpdxId":14,"licenseFileUrl":83,"sourceHtmlUrl":84,"categories":85,"keywords":86,"publishedAt":18},"01M734AFNXD06Z78QRK0VKGT7Q","implementing-microsegmentation-with-guardicore","Implementing microsegmentation using Akamai Guardicore Segmentation to map application dependencies, create granular network policies, visualize east-west traffic flows, and enforce least-privilege communication between workloads across data centers and cloud.","https:\u002F\u002Fgithub.com\u002Fyanacuti1121\u002FYana-AI\u002Fblob\u002Fmain\u002F.claude\u002Fskills\u002Fimplementing-microsegmentation-with-guardicore\u002FLICENSE","https:\u002F\u002Fgithub.com\u002FHoronomos-laps\u002FYana-AI\u002Fblob\u002Fmain\u002F.claude\u002Fskills\u002Fimplementing-microsegmentation-with-guardicore\u002FSKILL.md",[],[],{"skillNo":88,"name":89,"nameZh":6,"description":6,"descriptionZh":6,"repositoryFullName":7,"ownerLogin":8,"ownerAvatarUrl":9,"ownerAccountNo":10,"ownerDisplayName":11,"repositoryNo":12,"starsCount":13,"licenseSpdxId":14,"licenseFileUrl":6,"sourceHtmlUrl":90,"categories":91,"keywords":92,"publishedAt":18},"01M736TK27QMCXK0DVCH25SJN5","ramdisk-tmpfs-patterns","https:\u002F\u002Fgithub.com\u002FHoronomos-laps\u002FYana-AI\u002Fblob\u002Fmain\u002F.claude\u002Fskills\u002Framdisk-tmpfs-patterns\u002FSKILL.md",[],[]]