Endpoints: 76,849MCP servers: 32,728Payout addresses: 3,825Paid calls: 6,143Letters: 84Defects: 3,891counted just now
teppi

Server definition

Hash
sha256:1abc35bcbe3d12c58a6d9e5837dd624a58ca0213a6eb2f1ff874912bd10cc42f
What it is
What a remote MCP server returned when asked what it offers: 22 tools

The blob, as servednamed by its sha256

{ "instructions": null, "tools": [ { "description": "Calculates the arithmetic mean (average) of a list of numbers by summing all values and dividing by the count. (cost: 1 credit)", "inputSchema": { "$schema": "http://json-schema.org/draft-07/schema#", "properties": { "numbers": { "anyOf": [ { "items": { "type": "string" }, "type": "array" }, { "type": "string" } ], "description": "array, required, list of numeric values, no unit, no default" } }, "type": "object" }, "name": "average", "outputSchema": null }, { "description": "Calculates the area of geometric shapes including circle (πr²), triangle (½×base×height), rectangle (length×width), and square (side²). Returns area in square units. (cost: 1 credit)", "inputSchema": { "$schema": "http://json-schema.org/draft-07/schema#", "properties": { "measurements": { "description": "object, required, shape-specific measurements (radius/base/height/length/width/side), appropriate units, no default", "type": "string" }, "shape": { "description": "string, required, shape type (circle/triangle/rectangle/square), no unit, no default", "type": "string" } }, "type": "object" }, "name": "calculate_area", "outputSchema": null }, { "description": "Calculates the smaller angle in degrees between the hour and minute hands of an analog clock given the time. Returns angle between 0 and 180 degrees. (cost: 1 credit)", "inputSchema": { "$schema": "http://json-schema.org/draft-07/schema#", "properties": { "hour": { "description": "integer, required, hour value (0-23 or 1-12)", "type": "string" }, "minute": { "description": "integer, required, minute value (0-59)", "type": "string" } }, "type": "object" }, "name": "calculate_clock_angle", "outputSchema": null }, { "description": "Calculates the great-circle distance between two geographic points using the Haversine formula. Returns distance in kilometers, miles, or nautical miles. (cost: 1 credit)", "inputSchema": { "$schema": "http://json-schema.org/draft-07/schema#", "properties": { "lat1": { "description": "number, required, latitude of first point, decimal degrees, no default", "type": [ "number", "string" ] }, "lat2": { "description": "number, required, latitude of second point, decimal degrees, no default", "type": [ "number", "string" ] }, "lon1": { "description": "number, required, longitude of first point, decimal degrees, no default", "type": [ "number", "string" ] }, "lon2": { "description": "number, required, longitude of second point, decimal degrees, no default", "type": [ "number", "string" ] }, "unit": { "description": "string, optional, unit of measurement (km/miles/nautical), no unit, default km", "type": "string" } }, "type": "object" }, "name": "calculate_distance", "outputSchema": null }, { "description": "Calculates the median (middle value) of a list of numbers. For even-length lists, returns the average of the two middle values. (cost: 1 credit)", "inputSchema": { "$schema": "http://json-schema.org/draft-07/schema#", "properties": { "numbers": { "anyOf": [ { "items": { "type": "string" }, "type": "array" }, { "type": "string" } ], "description": "array of numbers, required, list of numeric values to find the median of" } }, "type": "object" }, "name": "calculate_median", "outputSchema": null }, { "description": "Calculates the population standard deviation of a list of numbers using the standard formula: sqrt(Σ(x - μ)² / N). (cost: 1 credit)", "inputSchema": { "$schema": "http://json-schema.org/draft-07/schema#", "properties": { "numbers": { "anyOf": [ { "items": { "type": "string" }, "type": "array" }, { "type": "string" } ], "description": "array, required, list of numeric values, no unit, no default" } }, "type": "object" }, "name": "calculate_standard_deviation", "outputSchema": null }, { "description": "Performs a Chi-Square test for independence on a 2x2 contingency table. Returns the chi-square statistic, p-value, and whether to reject the null hypothesis at the given significance level. (cost: 1 credit)", "inputSchema": { "$schema": "http://json-schema.org/draft-07/schema#", "properties": { "contingency_table": { "description": "2D array, required, 2x2 table of observed frequencies [[a, b], [c, d]]", "type": "string" }, "significance_level": { "description": "number, required, significance level for the test (e.g., 0.05 for 5%)", "type": [ "number", "string" ] } }, "type": "object" }, "name": "chi_square_independence_test", "outputSchema": null }, { "description": "Calculates the cosine similarity between two vectors, returning a value between -1 and 1 where 1 indicates identical direction. (cost: 1 credit)", "inputSchema": { "$schema": "http://json-schema.org/draft-07/schema#", "properties": { "vector_a": { "anyOf": [ { "items": { "type": "string" }, "type": "array" }, { "type": "string" } ], "description": "array of numbers, required, the first vector" }, "vector_b": { "anyOf": [ { "items": { "type": "string" }, "type": "array" }, { "type": "string" } ], "description": "array of numbers, required, the second vector (must be same length as vector_a)" } }, "type": "object" }, "name": "cosine_similarity", "outputSchema": null }, { "description": "Creates a histogram by counting the frequency of data points falling into specified bins or ranges. Returns the frequency count for each bin. (cost: 1 credit)", "inputSchema": { "$schema": "http://json-schema.org/draft-07/schema#", "properties": { "bins": { "description": "integer or array, required, number of bins or array of bin edges", "type": "string" }, "data": { "anyOf": [ { "items": { "type": "string" }, "type": "array" }, { "type": "string" } ], "description": "array of numbers, required, data points to create histogram from" } }, "type": "object" }, "name": "create_histogram", "outputSchema": null }, { "description": "Calculates the probability of rolling a specific sum with a given number of dice, each with a specified number of faces. (cost: 1 credit)", "inputSchema": { "$schema": "http://json-schema.org/draft-07/schema#", "properties": { "num_dice": { "description": "integer, required, number of dice to roll", "type": "string" }, "num_faces": { "description": "integer, required, number of faces on each die", "type": "string" }, "target_sum": { "description": "integer, required, the desired sum to calculate probability for", "type": "string" } }, "type": "object" }, "name": "dice_roll_probability", "outputSchema": null }, { "description": "Computes the Euclidean distance between two points in a 2D plane using the formula: sqrt((x2-x1)² + (y2-y1)²). (cost: 1 credit)", "inputSchema": { "$schema": "http://json-schema.org/draft-07/schema#", "properties": { "point_a": { "anyOf": [ { "items": { "type": "string" }, "type": "array" }, { "type": "string" } ], "description": "array of two numbers, required, coordinates of first point [x, y]" }, "point_b": { "anyOf": [ { "items": { "type": "string" }, "type": "array" }, { "type": "string" } ], "description": "array of two numbers, required, coordinates of second point [x, y]" } }, "type": "object" }, "name": "euclidean_distance", "outputSchema": null }, { "description": "Calculates the factorial of a non-negative integer n, which is the product of all positive integers less than or equal to n. Returns n! = n × (n-1) × ... × 1. (cost: 1 credit)", "inputSchema": { "$schema": "http://json-schema.org/draft-07/schema#", "properties": { "number": { "description": "integer, required, non-negative integer to calculate factorial of", "type": "string" } }, "type": "object" }, "name": "factorial", "outputSchema": null }, { "description": "Generates the first n numbers in the Fibonacci sequence, where each number is the sum of the two preceding ones, starting with 0 and 1. (cost: 1 credit)", "inputSchema": { "$schema": "http://json-schema.org/draft-07/schema#", "properties": { "n": { "description": "integer, required, number of Fibonacci numbers to generate (must be positive)", "type": "string" } }, "type": "object" }, "name": "fibonacci", "outputSchema": null }, { "description": "Computes the greatest common divisor (GCD) of two non-negative integers using the Euclidean algorithm. (cost: 1 credit)", "inputSchema": { "$schema": "http://json-schema.org/draft-07/schema#", "properties": { "a": { "description": "integer, required, the first non-negative integer", "type": "string" }, "b": { "description": "integer, required, the second non-negative integer", "type": "string" } }, "type": "object" }, "name": "greatest_common_divisor", "outputSchema": null }, { "description": "Checks if a number is a power of two (2^n for some non-negative integer n). (cost: 1 credit)", "inputSchema": { "$schema": "http://json-schema.org/draft-07/schema#", "properties": { "num": { "description": "integer, required, the number to check", "type": "string" } }, "type": "object" }, "name": "is_power_of_two", "outputSchema": null }, { "description": "Checks if a positive integer is a prime number (only divisible by 1 and itself). Returns false for numbers less than 2. (cost: 1 credit)", "inputSchema": { "$schema": "http://json-schema.org/draft-07/schema#", "properties": { "num": { "description": "integer, required, the number to test for primality, no units, no default", "type": "string" } }, "type": "object" }, "name": "is_prime", "outputSchema": null }, { "description": "Computes the least common multiple (LCM) of two positive integers using the relationship LCM(a,b) = (a × b) / GCD(a,b). (cost: 1 credit)", "inputSchema": { "$schema": "http://json-schema.org/draft-07/schema#", "properties": { "a": { "description": "integer, required, the first positive integer", "type": "string" }, "b": { "description": "integer, required, the second positive integer", "type": "string" } }, "type": "object" }, "name": "least_common_multiple", "outputSchema": null }, { "description": "Predicts the y-value for a given x-value using simple linear regression (least squares method) fitted to the provided data points. (cost: 1 credit)", "inputSchema": { "$schema": "http://json-schema.org/draft-07/schema#", "properties": { "target_x": { "description": "number, required, the x-value for which to predict y", "type": [ "number", "string" ] }, "x_values": { "anyOf": [ { "items": { "type": "string" }, "type": "array" }, { "type": "string" } ], "description": "array of numbers, required, the x-coordinates of data points" }, "y_values": { "anyOf": [ { "items": { "type": "string" }, "type": "array" }, { "type": "string" } ], "description": "array of numbers, required, the y-coordinates of data points (same length as x_values)" } }, "type": "object" }, "name": "linear_regression_prediction", "outputSchema": null }, { "description": "Calculates the number of permutations P(n,k) = n!/(n-k)! representing ordered arrangements of k elements selected from n elements. Returns the count as an integer. (cost: 1 credit)", "inputSchema": { "$schema": "http://json-schema.org/draft-07/schema#", "properties": { "k": { "description": "integer, required, number of elements to select (must be 0 ≤ k ≤ n)", "type": "string" }, "n": { "description": "integer, required, total number of elements (must be non-negative)", "type": "string" } }, "type": "object" }, "name": "permutation_count", "outputSchema": null }, { "description": "Calculates the area of a polygon given its vertices using the shoelace formula (also known as the surveyor's formula). (cost: 1 credit)", "inputSchema": { "$schema": "http://json-schema.org/draft-07/schema#", "properties": { "vertices": { "anyOf": [ { "items": { "type": "string" }, "type": "array" }, { "type": "string" } ], "description": "array of [x, y] coordinate pairs, required, the vertices of the polygon in order" } }, "type": "object" }, "name": "polygon_area_shoelace", "outputSchema": null }, { "description": "Calculates the probability of rolling a specific value consecutively for a given number of rolls on a die with specified sides using the formula (1/num_sides)^num_rolls. Returns probability as a decimal between 0 and 1. (cost: 1 credit)", "inputSchema": { "$schema": "http://json-schema.org/draft-07/schema#", "properties": { "num_rolls": { "description": "integer, required, number of consecutive rolls (must be positive)", "type": "string" }, "num_sides": { "description": "integer, required, number of sides on the die (must be positive)", "type": "string" }, "target_value": { "description": "integer, required, the target value to roll (must be between 1 and num_sides)", "type": "string" } }, "type": "object" }, "name": "probability_consecutive_rolls", "outputSchema": null }, { "description": "Computes the real and complex roots of a quadratic equation ax² + bx + c = 0 using the quadratic formula. Returns both roots or indicates if no real solutions exist. (cost: 1 credit)", "inputSchema": { "$schema": "http://json-schema.org/draft-07/schema#", "properties": { "a": { "description": "number, required, coefficient of x² term (must be non-zero)", "type": [ "number", "string" ] }, "b": { "description": "number, required, coefficient of x term", "type": [ "number", "string" ] }, "c": { "description": "number, required, constant term", "type": [ "number", "string" ] } }, "type": "object" }, "name": "solve_quadratic", "outputSchema": null } ] }
Verify it yourselfcurl -s https://api.teppi.xyz/v1/evidence/sha256:1abc35bcbe3d12c58a6d9e5837dd624a58ca0213a6eb2f1ff874912bd10cc42f | sha256sum