Skip to main content
Glama
Sign In
mcp-parigp

mcp-parigp

by daedalus
OverviewSchemaSourceRelated ServersDiscussionsAdmin
Python

elllog

Determine the scalar multiplier k such that P = k*G on an elliptic curve, given curve E, point P, and base point G.

Instructions

Compute the discrete logarithm of a point on an elliptic curve.

Tool call template

Replace each placeholder with a value matching the input schema. Only required parameters are included; add optional parameters as needed.

{
  "id": 1,
  "jsonrpc": "2.0",
  "method": "tools/call",
  "params": {
    "arguments": {
      "E": "<E>",
      "P": "<P>",
      "G": "<G>"
    },
    "name": "elllog"
  }
}

Input Schema

NameRequiredDescriptionDefault
EYesElliptic curve structure.
GYesBase point.
PYesPoint.

Output Schema

NameRequiredDescriptionDefault
resultYes

Schema Changelog

Changes observed during successful MCP inspections.

  1. First observedv0.1.0

TDQS

B3.1/5.0
Behavior2/5

Does the description disclose side effects, auth requirements, rate limits, or destructive behavior?

No annotations are provided, so the description carries full burden. It only states the operation without disclosing behavior when no logarithm exists, potential error conditions, or return format. The output schema is not described.

Agents need to know what a tool does to the world before calling it. Descriptions should go beyond structured annotations to explain consequences.

Conciseness4/5

Is the description appropriately sized, front-loaded, and free of redundancy?

The description is a single, clear sentence that is front-loaded. It is efficient but lacks additional useful information that could be included without bloat, so not a perfect 5.

Shorter descriptions cost fewer tokens and are easier for agents to parse. Every sentence should earn its place.

Completeness2/5

Given the tool's complexity, does the description cover enough for an agent to succeed on first attempt?

Given the complexity of discrete logarithm computation (potential for non-existence, large computation), the description is too minimal. With an output schema present, return details could have been briefly noted. The description does not cover common behavioral contexts.

Complex tools with many parameters or behaviors need more documentation. Simple tools need less. This dimension scales expectations accordingly.

Parameters3/5

Does the description clarify parameter syntax, constraints, interactions, or defaults beyond what the schema provides?

Schema coverage is 100%, with each parameter having a description (Elliptic curve structure, Base point, Point). The tool description does not add any additional meaning beyond the schema, so baseline score of 3 is appropriate.

Input schemas describe structure but not intent. Descriptions should explain non-obvious parameter relationships and valid value ranges.

Purpose5/5

Does the description clearly state what the tool does and how it differs from similar tools?

The description clearly states the tool computes discrete logarithms on elliptic curves, using a specific verb 'compute' and resource 'discrete logarithm of a point on an elliptic curve'. This distinguishes it from sibling elliptic curve tools like elladd or ellap.

Agents choose between tools based on descriptions. A clear purpose with a specific verb and resource helps agents select the right tool.

Usage Guidelines2/5

Does the description explain when to use this tool, when not to, or what alternatives exist?

No guidance is provided on when to use this tool vs alternatives, nor any prerequisites (e.g., point must be on the curve) or conditions for correct usage. The description is purely descriptive.

Agents often have multiple tools that could apply. Explicit usage guidance like "use X instead of Y when Z" prevents misuse.

Deploy Server

Other Tools