[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"skill:01M77XS7BPVB6WG6K8SY5VNRSH":3,"skill-same:01M77XS7BPVB6WG6K8SY5VNRSH":69},{"skillNo":4,"name":5,"nameZh":6,"description":7,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":16,"categories":17,"keywords":18,"publishedAt":19,"linkOnly":20,"markdownContent":21,"markdownBody":22,"frontMatter":23,"refName":42,"commitSha":43,"skillDirectory":44,"forksCount":14,"repositoryHtmlUrl":45,"repositoryHomepageUrl":6,"ownerHtmlUrl":46,"ownerBlogUrl":6,"ownerDescription":47,"updatedAt":48,"install":49,"resources":62},"01M77XS7BPVB6WG6K8SY5VNRSH","faiss",null,"Facebook's library for efficient similarity search and clustering of dense vectors. Supports billions of vectors, GPU acceleration, and various index types (Flat, IVF, HNSW). Use for fast k-NN search, large-scale vector retrieval, or when you need pure similarity search without metadata. Best for high-performance applications.","math12345678\u002Fquanticle","math12345678","https:\u002F\u002Favatars.githubusercontent.com\u002Fu\u002F74202272?v=4","01M77XDK5Z6CNQM8T107PHDX1P","Smyan Reddy","01M77XDK6P25R6WF4RAGG08X9S",0,"MIT","https:\u002F\u002Fgithub.com\u002Fmath12345678\u002Fquanticle\u002Fblob\u002Fmain\u002Fquanticlee\u002Fsrc\u002Fskills\u002F15-rag\u002Ffaiss\u002FSKILL.md",[],[],"2026-11-15 14:19:17",false,"---\nname: faiss\ndescription: Facebook's library for efficient similarity search and clustering of dense vectors. Supports billions of vectors, GPU acceleration, and various index types (Flat, IVF, HNSW). Use for fast k-NN search, large-scale vector retrieval, or when you need pure similarity search without metadata. Best for high-performance applications.\nversion: 1.0.0\nauthor: Orchestra Research\nlicense: MIT\ntags: [RAG, FAISS, Similarity Search, Vector Search, Facebook AI, GPU Acceleration, Billion-Scale, K-NN, HNSW, High Performance, Large Scale]\ndependencies: [faiss-cpu, faiss-gpu, numpy]\n---\n\n# FAISS - Efficient Similarity Search\n\nFacebook AI's library for billion-scale vector similarity search.\n\n## When to use FAISS\n\n**Use FAISS when:**\n- Need fast similarity search on large vector datasets (millions\u002Fbillions)\n- GPU acceleration required\n- Pure vector similarity (no metadata filtering needed)\n- High throughput, low latency critical\n- Offline\u002Fbatch processing of embeddings\n\n**Metrics**:\n- **31,700+ GitHub stars**\n- Meta\u002FFacebook AI Research\n- **Handles billions of vectors**\n- **C++** with Python bindings\n\n**Use alternatives instead**:\n- **Chroma\u002FPinecone**: Need metadata filtering\n- **Weaviate**: Need full database features\n- **Annoy**: Simpler, fewer features\n\n## Quick start\n\n### Installation\n\n```bash\n# CPU only\npip install faiss-cpu\n\n# GPU support\npip install faiss-gpu\n```\n\n### Basic usage\n\n```python\nimport faiss\nimport numpy as np\n\n# Create sample data (1000 vectors, 128 dimensions)\nd = 128\nnb = 1000\nvectors = np.random.random((nb, d)).astype('float32')\n\n# Create index\nindex = faiss.IndexFlatL2(d)  # L2 distance\nindex.add(vectors)             # Add vectors\n\n# Search\nk = 5  # Find 5 nearest neighbors\nquery = np.random.random((1, d)).astype('float32')\ndistances, indices = index.search(query, k)\n\nprint(f\"Nearest neighbors: {indices}\")\nprint(f\"Distances: {distances}\")\n```\n\n## Index types\n\n### 1. Flat (exact search)\n\n```python\n# L2 (Euclidean) distance\nindex = faiss.IndexFlatL2(d)\n\n# Inner product (cosine similarity if normalized)\nindex = faiss.IndexFlatIP(d)\n\n# Slowest, most accurate\n```\n\n### 2. IVF (inverted file) - Fast approximate\n\n```python\n# Create quantizer\nquantizer = faiss.IndexFlatL2(d)\n\n# IVF index with 100 clusters\nnlist = 100\nindex = faiss.IndexIVFFlat(quantizer, d, nlist)\n\n# Train on data\nindex.train(vectors)\n\n# Add vectors\nindex.add(vectors)\n\n# Search (nprobe = clusters to search)\nindex.nprobe = 10\ndistances, indices = index.search(query, k)\n```\n\n### 3. HNSW (Hierarchical NSW) - Best quality\u002Fspeed\n\n```python\n# HNSW index\nM = 32  # Number of connections per layer\nindex = faiss.IndexHNSWFlat(d, M)\n\n# No training needed\nindex.add(vectors)\n\n# Search\ndistances, indices = index.search(query, k)\n```\n\n### 4. Product Quantization - Memory efficient\n\n```python\n# PQ reduces memory by 16-32×\nm = 8   # Number of subquantizers\nnbits = 8\nindex = faiss.IndexPQ(d, m, nbits)\n\n# Train and add\nindex.train(vectors)\nindex.add(vectors)\n```\n\n## Save and load\n\n```python\n# Save index\nfaiss.write_index(index, \"large.index\")\n\n# Load index\nindex = faiss.read_index(\"large.index\")\n\n# Continue using\ndistances, indices = index.search(query, k)\n```\n\n## GPU acceleration\n\n```python\n# Single GPU\nres = faiss.StandardGpuResources()\nindex_cpu = faiss.IndexFlatL2(d)\nindex_gpu = faiss.index_cpu_to_gpu(res, 0, index_cpu)  # GPU 0\n\n# Multi-GPU\nindex_gpu = faiss.index_cpu_to_all_gpus(index_cpu)\n\n# 10-100× faster than CPU\n```\n\n## LangChain integration\n\n```python\nfrom langchain_community.vectorstores import FAISS\nfrom langchain_openai import OpenAIEmbeddings\n\n# Create FAISS vector store\nvectorstore = FAISS.from_documents(docs, OpenAIEmbeddings())\n\n# Save\nvectorstore.save_local(\"faiss_index\")\n\n# Load\nvectorstore = FAISS.load_local(\n    \"faiss_index\",\n    OpenAIEmbeddings(),\n    allow_dangerous_deserialization=True\n)\n\n# Search\nresults = vectorstore.similarity_search(\"query\", k=5)\n```\n\n## LlamaIndex integration\n\n```python\nfrom llama_index.vector_stores.faiss import FaissVectorStore\nimport faiss\n\n# Create FAISS index\nd = 1536\nfaiss_index = faiss.IndexFlatL2(d)\n\nvector_store = FaissVectorStore(faiss_index=faiss_index)\n```\n\n## Best practices\n\n1. **Choose right index type** - Flat for \u003C10K, IVF for 10K-1M, HNSW for quality\n2. **Normalize for cosine** - Use IndexFlatIP with normalized vectors\n3. **Use GPU for large datasets** - 10-100× faster\n4. **Save trained indices** - Training is expensive\n5. **Tune nprobe\u002Fef_search** - Balance speed\u002Faccuracy\n6. **Monitor memory** - PQ for large datasets\n7. **Batch queries** - Better GPU utilization\n\n## Performance\n\n| Index Type | Build Time | Search Time | Memory | Accuracy |\n|------------|------------|-------------|--------|----------|\n| Flat | Fast | Slow | High | 100% |\n| IVF | Medium | Fast | Medium | 95-99% |\n| HNSW | Slow | Fastest | High | 99% |\n| PQ | Medium | Fast | Low | 90-95% |\n\n## Resources\n\n- **GitHub**: https:\u002F\u002Fgithub.com\u002Ffacebookresearch\u002Ffaiss ⭐ 31,700+\n- **Wiki**: https:\u002F\u002Fgithub.com\u002Ffacebookresearch\u002Ffaiss\u002Fwiki\n- **License**: MIT\n\n\n","# FAISS - Efficient Similarity Search\n\nFacebook AI's library for billion-scale vector similarity search.\n\n## When to use FAISS\n\n**Use FAISS when:**\n- Need fast similarity search on large vector datasets (millions\u002Fbillions)\n- GPU acceleration required\n- Pure vector similarity (no metadata filtering needed)\n- High throughput, low latency critical\n- Offline\u002Fbatch processing of embeddings\n\n**Metrics**:\n- **31,700+ GitHub stars**\n- Meta\u002FFacebook AI Research\n- **Handles billions of vectors**\n- **C++** with Python bindings\n\n**Use alternatives instead**:\n- **Chroma\u002FPinecone**: Need metadata filtering\n- **Weaviate**: Need full database features\n- **Annoy**: Simpler, fewer features\n\n## Quick start\n\n### Installation\n\n```bash\n# CPU only\npip install faiss-cpu\n\n# GPU support\npip install faiss-gpu\n```\n\n### Basic usage\n\n```python\nimport faiss\nimport numpy as np\n\n# Create sample data (1000 vectors, 128 dimensions)\nd = 128\nnb = 1000\nvectors = np.random.random((nb, d)).astype('float32')\n\n# Create index\nindex = faiss.IndexFlatL2(d)  # L2 distance\nindex.add(vectors)             # Add vectors\n\n# Search\nk = 5  # Find 5 nearest neighbors\nquery = np.random.random((1, d)).astype('float32')\ndistances, indices = index.search(query, k)\n\nprint(f\"Nearest neighbors: {indices}\")\nprint(f\"Distances: {distances}\")\n```\n\n## Index types\n\n### 1. Flat (exact search)\n\n```python\n# L2 (Euclidean) distance\nindex = faiss.IndexFlatL2(d)\n\n# Inner product (cosine similarity if normalized)\nindex = faiss.IndexFlatIP(d)\n\n# Slowest, most accurate\n```\n\n### 2. IVF (inverted file) - Fast approximate\n\n```python\n# Create quantizer\nquantizer = faiss.IndexFlatL2(d)\n\n# IVF index with 100 clusters\nnlist = 100\nindex = faiss.IndexIVFFlat(quantizer, d, nlist)\n\n# Train on data\nindex.train(vectors)\n\n# Add vectors\nindex.add(vectors)\n\n# Search (nprobe = clusters to search)\nindex.nprobe = 10\ndistances, indices = index.search(query, k)\n```\n\n### 3. HNSW (Hierarchical NSW) - Best quality\u002Fspeed\n\n```python\n# HNSW index\nM = 32  # Number of connections per layer\nindex = faiss.IndexHNSWFlat(d, M)\n\n# No training needed\nindex.add(vectors)\n\n# Search\ndistances, indices = index.search(query, k)\n```\n\n### 4. Product Quantization - Memory efficient\n\n```python\n# PQ reduces memory by 16-32×\nm = 8   # Number of subquantizers\nnbits = 8\nindex = faiss.IndexPQ(d, m, nbits)\n\n# Train and add\nindex.train(vectors)\nindex.add(vectors)\n```\n\n## Save and load\n\n```python\n# Save index\nfaiss.write_index(index, \"large.index\")\n\n# Load index\nindex = faiss.read_index(\"large.index\")\n\n# Continue using\ndistances, indices = index.search(query, k)\n```\n\n## GPU acceleration\n\n```python\n# Single GPU\nres = faiss.StandardGpuResources()\nindex_cpu = faiss.IndexFlatL2(d)\nindex_gpu = faiss.index_cpu_to_gpu(res, 0, index_cpu)  # GPU 0\n\n# Multi-GPU\nindex_gpu = faiss.index_cpu_to_all_gpus(index_cpu)\n\n# 10-100× faster than CPU\n```\n\n## LangChain integration\n\n```python\nfrom langchain_community.vectorstores import FAISS\nfrom langchain_openai import OpenAIEmbeddings\n\n# Create FAISS vector store\nvectorstore = FAISS.from_documents(docs, OpenAIEmbeddings())\n\n# Save\nvectorstore.save_local(\"faiss_index\")\n\n# Load\nvectorstore = FAISS.load_local(\n    \"faiss_index\",\n    OpenAIEmbeddings(),\n    allow_dangerous_deserialization=True\n)\n\n# Search\nresults = vectorstore.similarity_search(\"query\", k=5)\n```\n\n## LlamaIndex integration\n\n```python\nfrom llama_index.vector_stores.faiss import FaissVectorStore\nimport faiss\n\n# Create FAISS index\nd = 1536\nfaiss_index = faiss.IndexFlatL2(d)\n\nvector_store = FaissVectorStore(faiss_index=faiss_index)\n```\n\n## Best practices\n\n1. **Choose right index type** - Flat for \u003C10K, IVF for 10K-1M, HNSW for quality\n2. **Normalize for cosine** - Use IndexFlatIP with normalized vectors\n3. **Use GPU for large datasets** - 10-100× faster\n4. **Save trained indices** - Training is expensive\n5. **Tune nprobe\u002Fef_search** - Balance speed\u002Faccuracy\n6. **Monitor memory** - PQ for large datasets\n7. **Batch queries** - Better GPU utilization\n\n## Performance\n\n| Index Type | Build Time | Search Time | Memory | Accuracy |\n|------------|------------|-------------|--------|----------|\n| Flat | Fast | Slow | High | 100% |\n| IVF | Medium | Fast | Medium | 95-99% |\n| HNSW | Slow | Fastest | High | 99% |\n| PQ | Medium | Fast | Low | 90-95% |\n\n## Resources\n\n- **GitHub**: https:\u002F\u002Fgithub.com\u002Ffacebookresearch\u002Ffaiss ⭐ 31,700+\n- **Wiki**: https:\u002F\u002Fgithub.com\u002Ffacebookresearch\u002Ffaiss\u002Fwiki\n- **License**: MIT\n\n\n",{"name":5,"tags":24,"author":36,"license":15,"version":37,"description":7,"dependencies":38},[25,26,27,28,29,30,31,32,33,34,35],"RAG","FAISS","Similarity Search","Vector Search","Facebook AI","GPU Acceleration","Billion-Scale","K-NN","HNSW","High Performance","Large Scale","Orchestra Research","1.0.0",[39,40,41],"faiss-cpu","faiss-gpu","numpy","main","3c55f1641d1423e5271b321e2fd40d3a5ed92fd2","quanticlee\u002Fsrc\u002Fskills\u002F15-rag\u002Ffaiss","https:\u002F\u002Fgithub.com\u002Fmath12345678\u002Fquanticle","https:\u002F\u002Fgithub.com\u002Fmath12345678","I'm a 10th-grade student working at the intersection of computational biology, molecular virology, and AI-driven approaches to medicine and global health.","2026-06-30 15:02:45",{"source":8,"skillName":5,"commands":50,"prompt":60,"zipAvailable":61},[51,54,57],{"tool":52,"command":53},"npx","npx skills add math12345678\u002Fquanticle --skill faiss",{"tool":55,"command":56},"bunx","bunx skills add math12345678\u002Fquanticle --skill faiss",{"tool":58,"command":59},"pnpm","pnpm dlx skills add math12345678\u002Fquanticle --skill faiss","安装技能，技能地址：https:\u002F\u002Fgithub.com\u002Fmath12345678\u002Fquanticle\u002Fblob\u002Fmain\u002Fquanticlee\u002Fsrc\u002Fskills\u002F15-rag\u002Ffaiss\u002FSKILL.md",true,[63],{"path":64,"resourceType":65,"resourceTypeDesc":66,"sizeBytes":67,"sourceHtmlUrl":68},"references\u002Findex_types.md","REFERENCE","参考文档",6181,"https:\u002F\u002Fgithub.com\u002Fmath12345678\u002Fquanticle\u002Fblob\u002Fmain\u002Fquanticlee\u002Fsrc\u002Fskills\u002F15-rag\u002Ffaiss\u002Freferences\u002Findex_types.md",[70,77,84,91,98,105],{"skillNo":71,"name":72,"nameZh":6,"description":73,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":74,"categories":75,"keywords":76,"publishedAt":19},"01M77XYA93N9NZCDQQ58SCKQ49","ara-rigor-reviewer","Performs ARA Seal Level 2 semantic epistemic review on Agent-Native Research Artifacts, scoring six dimensions (evidence relevance, falsifiability, scope calibration, argument coherence, exploration integrity, methodological rigor) and producing a constructive, severity-ranked report with a Strong Accept-to-Reject recommendation. Use after Level 1 structural validation passes, when an ARA needs an objective epistemic critique before publication or release.","https:\u002F\u002Fgithub.com\u002Fmath12345678\u002Fquanticle\u002Fblob\u002Fmain\u002Fquanticlee\u002Fsrc\u002Fskills\u002F22-agent-native-research-artifact\u002Frigor-reviewer\u002FSKILL.md",[],[],{"skillNo":78,"name":79,"nameZh":6,"description":80,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":81,"categories":82,"keywords":83,"publishedAt":19},"01M77XY5PY6DRG8YBZG24WQ039","ara-research-manager","Records research provenance as a post-task epilogue, scanning conversation history at the end of a coding or research session to extract decisions, experiments, dead ends, claims, heuristics, and pivots, and writing them into the ara\u002F directory with user-vs-AI provenance tags. Use as a session epilogue — never during execution — to maintain a faithful, auditable trace of how a research project actually evolved.","https:\u002F\u002Fgithub.com\u002Fmath12345678\u002Fquanticle\u002Fblob\u002Fmain\u002Fquanticlee\u002Fsrc\u002Fskills\u002F22-agent-native-research-artifact\u002Fresearch-manager\u002FSKILL.md",[],[],{"skillNo":85,"name":86,"nameZh":6,"description":87,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":88,"categories":89,"keywords":90,"publishedAt":19},"01M77XY138ZMY0JG84569T8MSW","ara-compiler","Compiles any research input — PDF papers, GitHub repositories, experiment logs, code directories, or raw notes — into a complete Agent-Native Research Artifact (ARA) with cognitive layer (claims, concepts, heuristics), physical layer (configs, code stubs), exploration graph, and grounded evidence. Use when ingesting a paper or codebase into a structured, machine-executable knowledge package, building an ARA from scratch, or converting research outputs into a falsifiable, agent-traversable form.","https:\u002F\u002Fgithub.com\u002Fmath12345678\u002Fquanticle\u002Fblob\u002Fmain\u002Fquanticlee\u002Fsrc\u002Fskills\u002F22-agent-native-research-artifact\u002Fcompiler\u002FSKILL.md",[],[],{"skillNo":92,"name":93,"nameZh":6,"description":94,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":95,"categories":96,"keywords":97,"publishedAt":19},"01M77XXVQYZ3VVHM9KFFKB0PDB","creative-thinking-for-research","Applies cognitive science frameworks for creative thinking to CS and AI research ideation. Use when seeking genuinely novel research directions by leveraging combinatorial creativity, analogical reasoning, constraint manipulation, and other empirically grounded creative strategies.","https:\u002F\u002Fgithub.com\u002Fmath12345678\u002Fquanticle\u002Fblob\u002Fmain\u002Fquanticlee\u002Fsrc\u002Fskills\u002F21-research-ideation\u002Fcreative-thinking-for-research\u002FSKILL.md",[],[],{"skillNo":99,"name":100,"nameZh":6,"description":101,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":102,"categories":103,"keywords":104,"publishedAt":19},"01M77XXPGJ9FR86MNBG74RKV3W","brainstorming-research-ideas","Guides researchers through structured ideation frameworks to discover high-impact research directions. Use when exploring new problem spaces, pivoting between projects, or seeking novel angles on existing work.","https:\u002F\u002Fgithub.com\u002Fmath12345678\u002Fquanticle\u002Fblob\u002Fmain\u002Fquanticlee\u002Fsrc\u002Fskills\u002F21-research-ideation\u002Fbrainstorming-research-ideas\u002FSKILL.md",[],[],{"skillNo":106,"name":107,"nameZh":6,"description":108,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":109,"categories":110,"keywords":111,"publishedAt":19},"01M77XXG6R4E97DG3M1CT7CT0Q","systems-paper-writing","Comprehensive guide for writing systems papers targeting OSDI, SOSP, ASPLOS, NSDI, and EuroSys. Provides paragraph-level structural blueprints, writing patterns, venue-specific checklists, reviewer guidelines, LaTeX templates, and conference deadlines. Use this skill for all systems conference paper writing.","https:\u002F\u002Fgithub.com\u002Fmath12345678\u002Fquanticle\u002Fblob\u002Fmain\u002Fquanticlee\u002Fsrc\u002Fskills\u002F20-ml-paper-writing\u002Fsystems-paper-writing\u002FSKILL.md",[],[]]