Endpoints: 76,849MCP servers: 32,730Payout addresses: 3,825Paid calls: 6,155Letters: 84Defects: 3,893counted 3 min ago
teppi

Server definition

Hash
sha256:be31ad6a57557308027202c0577d94e05cc5429d191a5eaebef48fdd7fc6cbeb
What it is
What a remote MCP server returned when asked what it offers: 32 tools

The blob, as servednamed by its sha256

{ "instructions": null, "tools": [ { "description": "Adds two binary numbers represented as strings and returns the sum as a binary string. Performs binary arithmetic with carry propagation. (cost: 1 credit)", "inputSchema": { "$schema": "http://json-schema.org/draft-07/schema#", "properties": { "a": { "description": "string, required, first binary number as string (e.g., '1010')", "type": "string" }, "b": { "description": "string, required, second binary number as string (e.g., '1101')", "type": "string" } }, "type": "object" }, "name": "binary_addition", "outputSchema": null }, { "description": "Performs binary search on a sorted list to find the index of a target value, returning -1 if not found. (cost: 1 credit)", "inputSchema": { "$schema": "http://json-schema.org/draft-07/schema#", "properties": { "arr": { "anyOf": [ { "items": { "type": "string" }, "type": "array" }, { "type": "string" } ], "description": "array of numbers, required, the sorted list to search" }, "target": { "description": "number, required, the value to find", "type": [ "number", "string" ] } }, "type": "object" }, "name": "binary_search", "outputSchema": null }, { "description": "Determines if a person can attend all meetings given a list of time intervals by checking for overlapping time slots. Returns true if no meetings conflict, false otherwise. (cost: 1 credit)", "inputSchema": { "$schema": "http://json-schema.org/draft-07/schema#", "properties": { "intervals": { "anyOf": [ { "items": { "type": "string" }, "type": "array" }, { "type": "string" } ], "description": "array, required, list of meeting time intervals as [start, end] pairs" } }, "type": "object" }, "name": "can_attend_meetings", "outputSchema": null }, { "description": "Counts the number of set bits (1's) in the binary representation of a non-negative integer. (cost: 1 credit)", "inputSchema": { "$schema": "http://json-schema.org/draft-07/schema#", "properties": { "num": { "description": "integer, required, the non-negative integer to analyze", "type": "string" } }, "type": "object" }, "name": "count_bits", "outputSchema": null }, { "description": "Finds the duplicate number in a list of integers where exactly one number appears more than once. Returns the duplicate value. (cost: 1 credit)", "inputSchema": { "$schema": "http://json-schema.org/draft-07/schema#", "properties": { "nums": { "anyOf": [ { "items": { "type": "string" }, "type": "array" }, { "type": "string" } ], "description": "array, required, list of integers containing one duplicate" } }, "type": "object" }, "name": "find_duplicate_number", "outputSchema": null }, { "description": "Finds the equilibrium index in an array where the sum of elements to the left equals the sum of elements to the right. Returns -1 if no such index exists. (cost: 1 credit)", "inputSchema": { "$schema": "http://json-schema.org/draft-07/schema#", "properties": { "arr": { "anyOf": [ { "items": { "type": "string" }, "type": "array" }, { "type": "string" } ], "description": "array of numbers, required, the input array to search, no units, no default" } }, "type": "object" }, "name": "find_equilibrium_index", "outputSchema": null }, { "description": "Finds the first character in a string that appears only once. Returns null if all characters repeat. (cost: 1 credit)", "inputSchema": { "$schema": "http://json-schema.org/draft-07/schema#", "properties": { "s": { "description": "string, required, the input string to search, no units, no default", "type": "string" } }, "type": "object" }, "name": "find_first_non_repeating_char", "outputSchema": null }, { "description": "Finds the kth smallest number in an unsorted list (1-indexed, where k=1 returns the smallest element). (cost: 1 credit)", "inputSchema": { "$schema": "http://json-schema.org/draft-07/schema#", "properties": { "k": { "description": "integer, required, the position of the desired smallest element (1-indexed)", "type": "string" }, "nums": { "anyOf": [ { "items": { "type": "string" }, "type": "array" }, { "type": "string" } ], "description": "array of numbers, required, the list of numbers to search" } }, "type": "object" }, "name": "find_kth_smallest", "outputSchema": null }, { "description": "Finds and returns the longest word in a given text string. If multiple words have the same maximum length, returns the first occurrence. (cost: 1 credit)", "inputSchema": { "$schema": "http://json-schema.org/draft-07/schema#", "properties": { "text": { "description": "string, required, the text to search for the longest word", "type": "string" } }, "type": "object" }, "name": "find_longest_word", "outputSchema": null }, { "description": "Finds the majority element in a list that appears more than ⌊n/2⌋ times using Boyer-Moore voting algorithm. Returns the majority element if it exists, null otherwise. (cost: 1 credit)", "inputSchema": { "$schema": "http://json-schema.org/draft-07/schema#", "properties": { "nums": { "anyOf": [ { "items": { "type": "string" }, "type": "array" }, { "type": "string" } ], "description": "array, required, list of integers to search" } }, "type": "object" }, "name": "find_majority_element", "outputSchema": null }, { "description": "Finds the maximum sum of any contiguous subarray using Kadane's algorithm. (cost: 1 credit)", "inputSchema": { "$schema": "http://json-schema.org/draft-07/schema#", "properties": { "nums": { "anyOf": [ { "items": { "type": "string" }, "type": "array" }, { "type": "string" } ], "description": "array of numbers, required, the list of integers to analyze" } }, "type": "object" }, "name": "find_max_subarray_sum", "outputSchema": null }, { "description": "Finds the minimum element in a rotated sorted array using binary search. The array was originally sorted in ascending order then rotated at some pivot point. (cost: 1 credit)", "inputSchema": { "$schema": "http://json-schema.org/draft-07/schema#", "properties": { "nums": { "anyOf": [ { "items": { "type": "string" }, "type": "array" }, { "type": "string" } ], "description": "array of numbers, required, the rotated sorted array to search, no units, no default" } }, "type": "object" }, "name": "find_minimum_rotated_sorted_array", "outputSchema": null }, { "description": "Finds the missing number in a sequence of integers from 0 to n where exactly one number is missing. Uses sum formula or XOR method. (cost: 1 credit)", "inputSchema": { "$schema": "http://json-schema.org/draft-07/schema#", "properties": { "nums": { "anyOf": [ { "items": { "type": "string" }, "type": "array" }, { "type": "string" } ], "description": "array of integers, required, list containing numbers from 0 to n with one missing, no units, no default" } }, "type": "object" }, "name": "find_missing_number", "outputSchema": null }, { "description": "Finds the n largest numbers from a list and returns them in descending order. (cost: 1 credit)", "inputSchema": { "$schema": "http://json-schema.org/draft-07/schema#", "properties": { "n": { "description": "integer, required, number of largest values to find, count, no default", "type": "string" }, "nums": { "anyOf": [ { "items": { "type": "string" }, "type": "array" }, { "type": "string" } ], "description": "array, required, list of numeric values, no unit, no default" } }, "type": "object" }, "name": "find_n_largest", "outputSchema": null }, { "description": "For each element in a list, finds the next greater element to its right. Returns -1 if no greater element exists. (cost: 1 credit)", "inputSchema": { "$schema": "http://json-schema.org/draft-07/schema#", "properties": { "nums": { "anyOf": [ { "items": { "type": "string" }, "type": "array" }, { "type": "string" } ], "description": "array of numbers, required, list of numbers to process" } }, "type": "object" }, "name": "find_next_greater_element", "outputSchema": null }, { "description": "Finds all unique pairs of integers in a list that sum to a specified target value. Returns pairs as arrays. (cost: 1 credit)", "inputSchema": { "$schema": "http://json-schema.org/draft-07/schema#", "properties": { "nums": { "anyOf": [ { "items": { "type": "string" }, "type": "array" }, { "type": "string" } ], "description": "array, required, list of integers, no unit, no default" }, "target": { "description": "integer, required, target sum value, no unit, no default", "type": "string" } }, "type": "object" }, "name": "find_pairs_with_sum", "outputSchema": null }, { "description": "Finds a peak element in a list where an element is greater than its neighbors. Returns the index of any peak element found. (cost: 1 credit)", "inputSchema": { "$schema": "http://json-schema.org/draft-07/schema#", "properties": { "nums": { "anyOf": [ { "items": { "type": "string" }, "type": "array" }, { "type": "string" } ], "description": "array, required, list of integers to search" } }, "type": "object" }, "name": "find_peak_element", "outputSchema": null }, { "description": "Flattens a nested list structure into a single-level list by recursively extracting all elements regardless of nesting depth. (cost: 1 credit)", "inputSchema": { "$schema": "http://json-schema.org/draft-07/schema#", "properties": { "nested_list": { "anyOf": [ { "items": { "type": "string" }, "type": "array" }, { "type": "string" } ], "description": "array, required, the nested list structure to flatten, no units, no default" } }, "type": "object" }, "name": "flatten_list", "outputSchema": null }, { "description": "Checks if two words are anagrams by comparing if they contain the same characters with the same frequencies, ignoring case and whitespace. (cost: 1 credit)", "inputSchema": { "$schema": "http://json-schema.org/draft-07/schema#", "properties": { "word1": { "description": "string, required, first word to compare, no units, no default", "type": "string" }, "word2": { "description": "string, required, second word to compare, no units, no default", "type": "string" } }, "type": "object" }, "name": "is_anagram", "outputSchema": null }, { "description": "Checks if a string is a valid palindrome, considering only alphanumeric characters and ignoring case and spaces. (cost: 1 credit)", "inputSchema": { "$schema": "http://json-schema.org/draft-07/schema#", "properties": { "text": { "description": "string, required, text to check, no unit, no default", "type": "string" } }, "type": "object" }, "name": "is_palindrome", "outputSchema": null }, { "description": "Checks if a number is a perfect square (i.e., the square of an integer). (cost: 1 credit)", "inputSchema": { "$schema": "http://json-schema.org/draft-07/schema#", "properties": { "num": { "description": "number, required, number to check, no unit, no default", "type": [ "number", "string" ] } }, "type": "object" }, "name": "is_perfect_square", "outputSchema": null }, { "description": "Checks if a given number is an exact integer power of a specified base. Returns true if num = base^k for some non-negative integer k, false otherwise. (cost: 1 credit)", "inputSchema": { "$schema": "http://json-schema.org/draft-07/schema#", "properties": { "base": { "description": "number, required, the base to test against", "type": [ "number", "string" ] }, "num": { "description": "number, required, the number to check", "type": [ "number", "string" ] } }, "type": "object" }, "name": "is_power", "outputSchema": null }, { "description": "Checks if one string is a rotation of another string by verifying if str1 appears in str2 concatenated with itself. Returns true if str1 is a rotation of str2, false otherwise. (cost: 1 credit)", "inputSchema": { "$schema": "http://json-schema.org/draft-07/schema#", "properties": { "str1": { "description": "string, required, first string to compare", "type": "string" }, "str2": { "description": "string, required, second string to check if it's a rotation of str1", "type": "string" } }, "type": "object" }, "name": "is_rotation", "outputSchema": null }, { "description": "Checks if a number equals the sum of the cubes of its digits (e.g., 153 = 1³ + 5³ + 3³). Returns true if the condition holds, false otherwise. (cost: 1 credit)", "inputSchema": { "$schema": "http://json-schema.org/draft-07/schema#", "properties": { "num": { "description": "integer, required, the number to check (must be non-negative)", "type": "string" } }, "type": "object" }, "name": "is_sum_of_cubes", "outputSchema": null }, { "description": "Validates whether a string is a properly formatted IPv4 address with four octets (0-255) separated by dots. (cost: 1 credit)", "inputSchema": { "$schema": "http://json-schema.org/draft-07/schema#", "properties": { "ip": { "description": "string, required, the IP address string to validate", "type": "string" } }, "type": "object" }, "name": "is_valid_ip_address", "outputSchema": null }, { "description": "Checks if a string contains properly balanced and nested parentheses, brackets, and braces. Returns true if every opening symbol has a matching closing symbol in the correct order. (cost: 1 credit)", "inputSchema": { "$schema": "http://json-schema.org/draft-07/schema#", "properties": { "s": { "description": "string, required, the input string containing parentheses/brackets/braces to validate, no units, no default", "type": "string" } }, "type": "object" }, "name": "is_valid_parentheses", "outputSchema": null }, { "description": "Merges two dictionaries into a single dictionary, with values from the second dictionary overwriting those from the first for duplicate keys. (cost: 1 credit)", "inputSchema": { "$schema": "http://json-schema.org/draft-07/schema#", "properties": { "dict1": { "description": "object, required, the first dictionary", "type": "string" }, "dict2": { "description": "object, required, the second dictionary to merge into the first", "type": "string" } }, "type": "object" }, "name": "merge_dictionaries", "outputSchema": null }, { "description": "Merges two sorted lists into a single sorted list maintaining ascending order. Returns the merged sorted list. (cost: 1 credit)", "inputSchema": { "$schema": "http://json-schema.org/draft-07/schema#", "properties": { "list1": { "anyOf": [ { "items": { "type": "string" }, "type": "array" }, { "type": "string" } ], "description": "array, required, first sorted list" }, "list2": { "anyOf": [ { "items": { "type": "string" }, "type": "array" }, { "type": "string" } ], "description": "array, required, second sorted list" } }, "type": "object" }, "name": "merge_sorted_lists", "outputSchema": null }, { "description": "Finds the minimum number of meeting rooms required to accommodate all meetings given their time intervals. Uses interval scheduling algorithm. (cost: 1 credit)", "inputSchema": { "$schema": "http://json-schema.org/draft-07/schema#", "properties": { "intervals": { "anyOf": [ { "items": { "type": "string" }, "type": "array" }, { "type": "string" } ], "description": "array of arrays, required, list of meeting time intervals where each interval is [start_time, end_time]" } }, "type": "object" }, "name": "min_meeting_rooms", "outputSchema": null }, { "description": "Reverses the order of characters in a given string, returning the string backwards. (cost: 1 credit)", "inputSchema": { "$schema": "http://json-schema.org/draft-07/schema#", "properties": { "text": { "description": "string, required, the text string to reverse", "type": "string" } }, "type": "object" }, "name": "reverse_string", "outputSchema": null }, { "description": "Sorts a list of numbers in ascending order using a deterministic sorting algorithm. (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 to sort, no unit, no default" } }, "type": "object" }, "name": "sort_numbers", "outputSchema": null }, { "description": "Checks if a 9x9 Sudoku board is valid by verifying that each row, column, and 3x3 sub-grid contains no duplicate digits 1-9. Returns true if valid, false otherwise. (cost: 1 credit)", "inputSchema": { "$schema": "http://json-schema.org/draft-07/schema#", "properties": { "board": { "anyOf": [ { "items": { "type": "string" }, "type": "array" }, { "type": "string" } ], "description": "array, required, 9x9 2D array representing the Sudoku board with digits 1-9 or empty cells" } }, "type": "object" }, "name": "validate_sudoku", "outputSchema": null } ] }
Verify it yourselfcurl -s https://api.teppi.xyz/v1/evidence/sha256:be31ad6a57557308027202c0577d94e05cc5429d191a5eaebef48fdd7fc6cbeb | sha256sum