一键导入
compress
Compress text semantically with iterative validation, anchor checksums, and verified information preservation.
用 Codex 或 Claude 帮你安装 复制这段 Prompt,粘贴到 Codex、Claude 或其他助手里,让它检查 Skill 页面并帮你完成安装。
菜单
Compress text semantically with iterative validation, anchor checksums, and verified information preservation.
用 Codex 或 Claude 帮你安装 复制这段 Prompt,粘贴到 Codex、Claude 或其他助手里,让它检查 Skill 页面并帮你完成安装。
基于 SOC 职业分类
Web search without an API key using DuckDuckGo Lite via web_fetch. Use as a fallback when web_search fails with missing_brave_api_key error, or whenever you need to search the web and no search API is configured. Provides titles, URLs, and snippets for research queries. Zero dependencies — works with just the built-in web_fetch tool.
东方财富金融数据查询工具。支持行情数据(股价、资金流向、估值)、财务数据(财报、股东结构、高管信息)、关系与经营数据。通过自然语言查询,如"东方财富最新价"、"贵州茅台市盈率"。当用户需要查询股票、基金、指数、板块等金融数据时使用此skill。需要先配置apikey才能使用。
东方财富资讯搜索工具。基于东方财富妙想搜索能力,用于获取金融相关的新闻、公告、研报、政策、交易规则、事件分析、影响解读等时效性信息。支持个股资讯、板块新闻、宏观分析等。当用户需要搜索金融资讯、了解市场动态、查看研报解读时使用此skill。需要先配置apikey才能使用。
东方财富智能选股工具。支持基于自然语言查询筛选股票,包括行情指标、财务指标等条件;可查询指定行业/板块内的股票;支持A股、港股、美股。当用户需要选股、筛选股票、按条件查找股票时使用此skill。需要先配置apikey才能使用。
Compress files to reduce storage and transfer size. Use this skill when users ask to shrink PDFs or images, optimize upload/share size, or balance quality and size. Supports PDF compression and image compression with Python-first workflows plus Node.js fallback when Python dependencies are unavailable.
全自动检索 GitHub 热门仓库,分析并维护项目文档,自动提交 PR。用于发现文档问题(死链、typo、过时内容等)并自动修复提交。当用户需要批量维护开源项目文档、自动提 PR 修复文档问题时触发此技能。
| name | Compress |
| description | Compress text semantically with iterative validation, anchor checksums, and verified information preservation. |
This is SEMANTIC compression, not bit-perfect lossless.
1. Compress original O → compressed C
2. Extract anchors from O (entities, numbers, dates)
3. Reconstruct C → R (without seeing O)
4. Verify: anchors match + semantic diff
5. If mismatch → refine C with missing info
6. Repeat until validated (max 3 iterations)
Convergence = verified. No convergence after 3 rounds = level too aggressive.
| Task | Load |
|---|---|
| Compression levels (L1-L4) | levels.md |
| Validation algorithm details | validation.md |
| Format-specific strategies | formats.md |
| Token budgeting and metrics | metrics.md |
| Level | Ratio | Reliability | Use Case |
|---|---|---|---|
| L1 | ~0.8x | ✅ High | Production, human-readable |
| L2 | ~0.5x | ✅ Good | System prompts, repeated use |
| L3 | ~0.3x | ⚠️ Moderate | Experimental, review output |
| L4 | ~0.15x | ⚠️ Low | Research only, expect losses |
Before compression, extract critical facts:
[ANCHORS: 3 people, $42,000, 2024-03-15, "Project Alpha"]
Reconstruction MUST reproduce these exactly. If anchors mismatch → compression failed.
Each compression costs 3-4 LLM calls. Break-even calculation:
break_even_retrievals = compression_tokens / saved_tokens_per_use
Only cost-effective if: You'll retrieve the compressed content 6-8+ times.
For one-time use → just use the original text.