Discrete Structures

io.github.ZohaibCodez由 GitHub 账号 ZohaibCodez 发布v0.1.4更新于 Oct 24, 2026

Comprehensive tools for discrete mathematics: logic, algorithms, number theory, cryptography

已验证STDIO仅桌面开发者工具AI 与机器学习

概览

AI 生成的概览

本地 MCP 服务器,为助手提供 21 个离散数学工具:布尔逻辑、数论、算法可视化,以及古典、RSA 与 AES 密码学。

可以做什么
求值、化简布尔表达式,生成真值表并转换为 CNF/DNF 形式。判断素数、分解质因数、计算最大公约数与最小公倍数、模运算和欧拉函数。逐步演示排序、二分查找以及 Dijkstra、BFS/DFS 等图算法。使用凯撒、维吉尼亚、RSA 和 AES 进行加解密,并生成 RSA 密钥对。
适用场景
适合教学或学习离散数学、算法与密码学,练习算法面试题,或需要带解释的数论与布尔逻辑计算时使用。
运行要求
以 Python 包形式在本地运行(需 Python 3.11+),通过 uvx 或 pip 启动;未声明账号、API 密钥或环境变量。仅支持桌面 MCP 客户端。
安装前请注意
密码学工具会处理工具调用中传入的明文、密钥和密文,RSA 密钥生成会产生私钥,应视为敏感信息。凯撒与维吉尼亚密码仅供教学,不适合真实加密保护。未说明会向第三方发送数据。

安装

在 SourceWeft 中

  1. 打开 控制台中的 Discrete Structures,将其添加到工作区。
  2. 为需要使用其工具的对话启用该服务。

Desktop only,通过 STDIO。 STDIO 服务会启动本地进程,因此需要 SourceWeft 桌面宿主。

其他 MCP 客户端

参照 仓库 中的启动说明。

README

🎓 Discrete Structures MCP Server

[PyPI version] [Python Version] [MCP Registry] [License: MIT] [Downloads]

Professional-grade AI tools for discrete mathematics, algorithms, and cryptography

Installation • Features • Quick Start • Documentation • Examples


🚀 Overview

Discrete Structures MCP Server is a comprehensive Model Context Protocol server that brings 21 powerful mathematical tools to AI assistants like Claude Desktop, Cline, and Zed. Perfect for students, educators, and developers working with discrete mathematics, data structures, algorithms, and cryptography.

Why Choose This Server?

  • 🎯 21 Production-Ready Tools across 4 categories
  • 📚 Educational Focus with step-by-step visualizations
  • 🔒 Enterprise Cryptography (RSA, AES, Caesar, Vigenere)
  • 📊 Algorithm Visualizations for sorting and graph algorithms
  • 🧮 Boolean Logic with CNF/DNF conversion
  • 🔢 Number Theory including prime factorization and modular arithmetic
  • ⚡ Fast Installation via uvx discrete-structures-mcp
  • 🌐 MCP Registry Listed for easy discovery

✨ Features

🧮 Logic Tools (5 tools)

  • evaluate_boolean - Evaluate boolean expressions with truth tables
  • generate_truth_table - Complete truth table generation
  • simplify_boolean - Boolean algebra simplification
  • convert_to_cnf - Conjunctive Normal Form conversion
  • convert_to_dnf - Disjunctive Normal Form conversion

🔢 Number Theory Tools (5 tools)

  • is_prime - Primality testing with explanations
  • prime_factors - Complete prime factorization
  • gcd_lcm - Greatest Common Divisor & Least Common Multiple
  • modular_arithmetic - Modular operations (add, multiply, power)
  • euler_totient - Euler's φ function calculation

📊 Algorithm Visualizers (6 tools)

  • visualize_bubble_sort - O(n²) sorting with comparisons
  • visualize_quick_sort - O(n log n) divide-and-conquer
  • visualize_merge_sort - Stable merge sort visualization
  • visualize_binary_search - O(log n) search algorithm
  • visualize_dijkstra - Shortest path in weighted graphs
  • visualize_bfs_dfs - Graph traversal algorithms

🔐 Cryptography Tools (5 tools)

  • caesar_cipher - Classical shift cipher (educational)
  • vigenere_cipher - Polyalphabetic substitution
  • rsa_encrypt_decrypt - RSA public-key cryptography
  • aes_encrypt_decrypt - AES-256 symmetric encryption
  • generate_rsa_keys - Secure RSA key pair generation

📦 Installation

⚡ Quick Install (Recommended)

bash
# Install and run directly with uvxuvx discrete-structures-mcp

📥 Install with pip

bash
# Install globallypip install discrete-structures-mcp
# Run the serverdiscrete-structures-mcp

🛠️ Development Installation

bash
# Clone the repositorygit clone https://github.com/ZohaibCodez/discrete-structures-ai-platform.gitcd discrete-structures-ai-platform/mcp-server
# Install with uvuv sync
# Run locallyuv run discrete-structures-mcp

🎯 Quick Start

Usage with Claude Desktop

Add to your claude_desktop_config.json:

json
{  "mcpServers": {    "discrete-structures": {      "command": "uvx",      "args": ["discrete-structures-mcp"]    }  }}

Usage with Other MCP Clients

Compatible with any MCP client:

  • Cline - VS Code extension
  • Zed - Modern code editor
  • Continue - AI code assistant
  • Custom MCP clients via Python SDK

💻 Example Tool Calls

python
from mcp.client.session import ClientSessionfrom mcp.client.stdio import StdioServerParameters, stdio_client
server_params = StdioServerParameters(    command="uvx",    args=["discrete-structures-mcp"])
async with stdio_client(server_params) as (read, write):    async with ClientSession(read, write) as session:        await session.initialize()                # List available tools        tools = await session.list_tools()        print([tool.name for tool in tools.tools])                # Call a tool        result = await session.call_tool("gcd_lcm", {"numbers": "48,18"})        print(result)

💻 Example Tool Calls

🔢 Number Theory Examples

Calculate GCD and LCM
python
# Find greatest common divisor and least common multipleresult = await session.call_tool("gcd_lcm", {    "numbers": "48,18,24"})# Output: {"gcd": 6, "lcm": 144, "explanation": "..."}
Prime Factorization
python
result = await session.call_tool("prime_factors", {    "number": "84"})# Output: {"factors": [2, 2, 3, 7], "factorization": "2² × 3 × 7"}
Modular Arithmetic
python
result = await session.call_tool("modular_arithmetic", {    "operation": "power",    "base": "3",    "exponent": "5",    "modulus": "7"})# Output: {"result": 5, "explanation": "3^5 mod 7 = 5"}

🧮 Boolean Logic Examples

Generate Truth Table
python
result = await session.call_tool("generate_truth_table", {    "expression": "(A & B) | (~A & C)"})# Returns: Complete truth table with all input combinations
Simplify Boolean Expression
python
result = await session.call_tool("simplify_boolean", {    "expression": "(A & B) | (A & ~B)"})# Output: {"simplified": "A", "steps": ["..."]}
Convert to CNF
python
result = await session.call_tool("convert_to_cnf", {    "expression": "(A | B) & (C | D)"})# Output: Expression in Conjunctive Normal Form

📊 Algorithm Visualization Examples

Visualize Bubble Sort
python
result = await session.call_tool("visualize_bubble_sort", {    "array": "64,34,25,12,22,11,90"})# Returns: Step-by-step sorting with comparisons and swaps
Binary Search
python
result = await session.call_tool("visualize_binary_search", {    "array": "1,3,5,7,9,11,13,15",    "target": "7"})# Output: Search path with index calculations
Dijkstra's Algorithm
python
result = await session.call_tool("visualize_dijkstra", {    "graph": "A-B:4,A-C:2,B-C:1,B-D:5,C-D:8",    "start": "A",    "end": "D"})# Returns: Shortest path with distances

🔐 Cryptography Examples

RSA Encryption
python
# Generate keyskeys = await session.call_tool("generate_rsa_keys", {    "key_size": "2048"})
# Encrypt messageencrypted = await session.call_tool("rsa_encrypt_decrypt", {    "action": "encrypt",    "message": "Hello World",    "public_key": keys["public_key"]})
# Decrypt messagedecrypted = await session.call_tool("rsa_encrypt_decrypt", {    "action": "decrypt",    "ciphertext": encrypted["ciphertext"],    "private_key": keys["private_key"]})
AES Encryption
python
result = await session.call_tool("aes_encrypt_decrypt", {    "action": "encrypt",    "text": "Sensitive Data",    "key": "my-secret-key-32-characters-long"})# Output: {"ciphertext": "...", "iv": "...", "tag": "..."}
Caesar Cipher
python
result = await session.call_tool("caesar_cipher", {    "action": "encrypt",    "text": "HELLO",    "shift": "3"})# Output: {"result": "KHOOR", "explanation": "Each letter shifted by 3"}

🎓 Use Cases

  • Computer Science Education - Teach algorithms and data structures
  • Cryptography Learning - Understand encryption methods
  • Mathematics Research - Number theory and discrete math
  • Algorithm Analysis - Visualize complexity and performance
  • Code Interviews - Practice common algorithmic problems
  • Academic Projects - Implement mathematical concepts

🏗️ Technical Stack

  • Language: Python 3.11+
  • Framework: Model Context Protocol (MCP)
  • Math Libraries: SymPy, NumPy
  • Crypto: Python Cryptography library
  • Graphs: NetworkX
  • Build: UV package manager

📊 Performance

  • Startup Time: < 2 seconds
  • Response Time: < 100ms for most operations
  • Memory: < 50MB baseline
  • Concurrency: Async/await support

🔒 Security Note

Educational Purpose: Caesar and Vigenere ciphers are for learning only. Use AES or RSA for real-world encryption.

🤝 Contributing

We welcome contributions! Here's how to get started:

  1. Fork the repository
  2. Create a feature branch (git checkout -b feature/amazing-feature)
  3. Commit changes (git commit -m 'Add amazing feature')
  4. Push to branch (git push origin feature/amazing-feature)
  5. Open a Pull Request

See CONTRIBUTING.md for detailed guidelines.

📄 License

This project is licensed under the MIT License - see the LICENSE file for details.

🔗 Links & Resources

Official Links

Community

MCP Resources

📈 Project Stats

[GitHub stars] [GitHub forks] [GitHub issues] [GitHub pull requests]

🙏 Acknowledgments

  • Model Context Protocol team at Anthropic
  • SymPy and NumPy communities
  • Python Cryptography developers
  • NetworkX graph library maintainers
  • All contributors and users

📞 Support

  • 📧 Email: Open an issue for support
  • 💬 Discussions: Use GitHub Discussions
  • 🐛 Bugs: Report via Issues
  • 💡 Features: Request via Issues with enhancement label

Made with ❤️ for the discrete mathematics and computer science community

⭐ Star this repo if you find it useful! ⭐

Report Bug · Request Feature · Contribute

来源:mcp-server/README.md,提交 b878c1c

工具

0
SourceWeft 尚未在沙箱中启动过该软件包,因此其工具未知。

版本历史

1
  1. v0.1.4最新Sep 16, 2026

评分

已满足适用检查项的 40%

该评分衡量此收录条目的完整程度,依据注册中心条目、端点与公开来源计算得出。它不是对服务器本身的评价,也不表示服务器安全或当前可用:可连通性是带日期的检查结果,评分也不包含安装量或用户评价。

  • 近 30 天内可连通25 分

    请保持端点能够响应 MCP 握手;SourceWeft 每 30 天探测一次。

  • 已声明认证方式10 分

    请在注册中心条目中声明凭据请求头,或保持端点能够响应探测,以便判定其认证方式。

  • 已列出工具15 分

    请让服务器在无凭据时响应 tools/list,或发布可在沙箱中无凭据启动的软件包。

  • 描述必需15 分
  • 图标10 分
  • 文档15 分
  • 许可证10 分

    请在仓库或注册中心条目中声明许可证。