{"$schema":"https://verifymcp.io/schemas/trust-report.json","schemaVersion":1,"license":{"name":"CC BY-NC 4.0","url":"https://creativecommons.org/licenses/by-nc/4.0/"},"generatedAt":"2026-11-21T23:07:01.417Z","url":"https://verifymcp.io/servers/uk-co-reliness-maths-statistics/mcp-maths-statistics","markdownUrl":"https://verifymcp.io/servers/uk-co-reliness-maths-statistics/mcp-maths-statistics.md","server":{"slug":"uk-co-reliness-maths-statistics","name":"UK Data: Maths and statistics","registryName":"uk.co.reliness/maths-statistics","description":"Averages, spread, chi-square, regression, primes, factorials, probability, areas and distances","registryStatus":"active","deletedAt":null,"statusMessage":null,"liveness":"live","publisher":{"class":"unknown","claimed":false}},"component":{"slug":"mcp-maths-statistics","type":"remote","identifier":"https://ukdata.reliness.co.uk/mcp/maths-statistics","withdrawn":false,"url":"https://verifymcp.io/servers/uk-co-reliness-maths-statistics/mcp-maths-statistics","version":"1.5.0","transport":null,"scoredAt":"2026-11-21T02:06:23.966Z"},"score":{"total":77,"tier":"medium","status":"scored","weekDelta":4,"history":[{"date":"2026-11-21","total":77},{"date":"2026-11-20","total":76},{"date":"2026-11-19","total":76},{"date":"2026-11-18","total":75},{"date":"2026-11-17","total":75},{"date":"2026-11-16","total":74},{"date":"2026-11-15","total":74},{"date":"2026-11-14","total":73},{"date":"2026-11-13","total":73},{"date":"2026-11-12","total":72},{"date":"2026-11-11","total":72},{"date":"2026-11-10","total":71},{"date":"2026-11-09","total":71},{"date":"2026-11-08","total":70},{"date":"2026-11-07","total":70}]},"categories":[{"name":"Endpoint Security","score":69,"verdict":"fail","reasons":["The endpoint's TLS certificate is valid, in date, and uses a strong key.","No authorisation is required to call this server. Nothing on it is marked destructive, but we can't show that an anonymous caller can only read: full credit needs the server to list at least one tool and every tool to be verifiably read-only. We use a best-effort check of tool names and descriptions to tell read-only tools from tools that change things, so some genuinely read-only tools may not get full credit. Names that start with a read verb (get, list, read, search and similar) and accurate readOnlyHint annotations help. Meet that to earn full credit, or require authorisation.","HTTPS check failed: the endpoint is reachable over plaintext HTTP.","The HSTS (Strict-Transport-Security) header is present.","DNSSEC check failed: this domain isn't protected by DNSSEC."],"codes":[{"code":"tls.valid","args":{}},{"code":"auth.none_no_destructive","args":{}},{"code":"https.plaintext","args":{}},{"code":"headers.hsts_present","args":{}},{"code":"dnssec.absent","args":{}}]},{"name":"Transport & Reachability","score":100,"verdict":"pass","reasons":["Verified streamable-http transport via a live MCP handshake."],"codes":[{"code":"transport.verified","args":{"transport":"streamable-http"}}]},{"name":"Schema Quality & AI Usability","score":80,"verdict":"fail","reasons":["AI-judged instruction clarity (excellent).","Tool/resource definitions use about 1918 tokens (~87/item across 22 items; 22 tools + 0 resources), lean.","Usage-examples check failed: none of the tools include examples."],"codes":[{"code":"schema.ai_quality","args":{"band":"excellent"}},{"code":"schema.footprint_lean","args":{"avg":"87","items":"22","tools":"22","tokens":"1918","resources":"0"}},{"code":"schema.examples_absent","args":{}}]},{"name":"Stability & Change Management","score":47,"verdict":"partial","reasons":["Stability observed for 14 of 30 days with no destabilising changes; credit accrues until the full window elapses."],"codes":[{"code":"stability.building_history","args":{"days":"14"}}]},{"name":"Tool Coverage","score":100,"verdict":"pass","reasons":["100% of tools have a non-trivial description (not blank, and not just the tool's name).","100% of tool parameters carry a description."],"codes":[{"code":"toolquality.descriptions","args":{"pct":"100"}},{"code":"toolquality.param_docs","args":{"pct":"100"}}]},{"name":"Tool Safety","score":100,"verdict":"pass","reasons":["No prompt-injection markers were found in the server instructions, tool names or descriptions we captured.","We read all 22 captured tool definition(s), and no name or description among them implies an irreversible operation.","An AI judge read all 22 captured unit(s) of tool text and found none that tries to manipulate the model reading it."],"codes":[{"code":"toolsafety.injection_clean","args":{}},{"code":"toolsafety.destructive_none","args":{"tools":"22"}},{"code":"toolsafety.manipulation_clean","args":{"units":"22","judged":"22"}}]},{"name":"Capabilities","score":100,"verdict":"pass","reasons":["Implements a supported MCP spec version (2025-11-25); the latest is 2026-07-28."],"codes":[{"code":"protocol.supported","args":{"latest":"2026-07-28","version":"2025-11-25"}}]}],"inconclusive":[],"malware":[],"components":[{"slug":"mcp-maths-statistics","type":"remote","identifier":"https://ukdata.reliness.co.uk/mcp/maths-statistics","withdrawn":false,"score":77,"current":true,"url":"https://verifymcp.io/servers/uk-co-reliness-maths-statistics/mcp-maths-statistics","markdownUrl":"https://verifymcp.io/servers/uk-co-reliness-maths-statistics/mcp-maths-statistics.md"}],"facts":[{"label":"Endpoint","value":"https://ukdata.reliness.co.uk/mcp/maths-statistics"},{"label":"Transports","value":"streamable-http"},{"label":"Auth","value":"none"},{"label":"Version","value":"1.5.0"}],"install":{"available":true,"bundleSha256":null},"tools":[{"name":"is_power_of_two","title":null,"description":"Checks if a number is a power of two (2^n for some non-negative integer n). (cost: 1 credit)","inputs":[{"name":"num","type":"string","required":false,"description":"integer, required, the number to check"}],"outputs":[],"hasOutputSchema":false,"hasExamples":false,"tokenEstimate":52},{"name":"dice_roll_probability","title":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)","inputs":[{"name":"num_dice","type":"string","required":false,"description":"integer, required, number of dice to roll"},{"name":"num_faces","type":"string","required":false,"description":"integer, required, number of faces on each die"},{"name":"target_sum","type":"string","required":false,"description":"integer, required, the desired sum to calculate probability for"}],"outputs":[],"hasOutputSchema":false,"hasExamples":false,"tokenEstimate":94},{"name":"polygon_area_shoelace","title":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)","inputs":[{"name":"vertices","type":null,"required":false,"description":"array of [x, y] coordinate pairs, required, the vertices of the polygon in order"}],"outputs":[],"hasOutputSchema":false,"hasExamples":false,"tokenEstimate":68},{"name":"cosine_similarity","title":null,"description":"Calculates the cosine similarity between two vectors, returning a value between -1 and 1 where 1 indicates identical direction. (cost: 1 credit)","inputs":[{"name":"vector_a","type":null,"required":false,"description":"array of numbers, required, the first vector"},{"name":"vector_b","type":null,"required":false,"description":"array of numbers, required, the second vector (must be same length as vector_a)"}],"outputs":[],"hasOutputSchema":false,"hasExamples":false,"tokenEstimate":77},{"name":"greatest_common_divisor","title":null,"description":"Computes the greatest common divisor (GCD) of two non-negative integers using the Euclidean algorithm. (cost: 1 credit)","inputs":[{"name":"a","type":"string","required":false,"description":"integer, required, the first non-negative integer"},{"name":"b","type":"string","required":false,"description":"integer, required, the second non-negative integer"}],"outputs":[],"hasOutputSchema":false,"hasExamples":false,"tokenEstimate":69},{"name":"linear_regression_prediction","title":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)","inputs":[{"name":"target_x","type":"number|string","required":false,"description":"number, required, the x-value for which to predict y"},{"name":"x_values","type":null,"required":false,"description":"array of numbers, required, the x-coordinates of data points"},{"name":"y_values","type":null,"required":false,"description":"array of numbers, required, the y-coordinates of data points (same length as x_values)"}],"outputs":[],"hasOutputSchema":false,"hasExamples":false,"tokenEstimate":108},{"name":"least_common_multiple","title":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)","inputs":[{"name":"a","type":"string","required":false,"description":"integer, required, the first positive integer"},{"name":"b","type":"string","required":false,"description":"integer, required, the second positive integer"}],"outputs":[],"hasOutputSchema":false,"hasExamples":false,"tokenEstimate":79},{"name":"calculate_median","title":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)","inputs":[{"name":"numbers","type":null,"required":false,"description":"array of numbers, required, list of numeric values to find the median of"}],"outputs":[],"hasOutputSchema":false,"hasExamples":false,"tokenEstimate":63},{"name":"euclidean_distance","title":null,"description":"Computes the Euclidean distance between two points in a 2D plane using the formula: sqrt((x2-x1)² + (y2-y1)²). (cost: 1 credit)","inputs":[{"name":"point_a","type":null,"required":false,"description":"array of two numbers, required, coordinates of first point [x, y]"},{"name":"point_b","type":null,"required":false,"description":"array of two numbers, required, coordinates of second point [x, y]"}],"outputs":[],"hasOutputSchema":false,"hasExamples":false,"tokenEstimate":93},{"name":"fibonacci","title":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)","inputs":[{"name":"n","type":"string","required":false,"description":"integer, required, number of Fibonacci numbers to generate (must be positive)"}],"outputs":[],"hasOutputSchema":false,"hasExamples":false,"tokenEstimate":65},{"name":"chi_square_independence_test","title":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)","inputs":[{"name":"contingency_table","type":"string","required":false,"description":"2D array, required, 2x2 table of observed frequencies [[a, b], [c, d]]"},{"name":"significance_level","type":"number|string","required":false,"description":"number, required, significance level for the test (e.g., 0.05 for 5%)"}],"outputs":[],"hasOutputSchema":false,"hasExamples":false,"tokenEstimate":119},{"name":"create_histogram","title":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)","inputs":[{"name":"bins","type":"string","required":false,"description":"integer or array, required, number of bins or array of bin edges"},{"name":"data","type":null,"required":false,"description":"array of numbers, required, data points to create histogram from"}],"outputs":[],"hasOutputSchema":false,"hasExamples":false,"tokenEstimate":79},{"name":"calculate_clock_angle","title":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)","inputs":[{"name":"hour","type":"string","required":false,"description":"integer, required, hour value (0-23 or 1-12)"},{"name":"minute","type":"string","required":false,"description":"integer, required, minute value (0-59)"}],"outputs":[],"hasOutputSchema":false,"hasExamples":false,"tokenEstimate":85},{"name":"factorial","title":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)","inputs":[{"name":"number","type":"string","required":false,"description":"integer, required, non-negative integer to calculate factorial of"}],"outputs":[],"hasOutputSchema":false,"hasExamples":false,"tokenEstimate":74},{"name":"calculate_distance","title":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)","inputs":[{"name":"lat1","type":"number|string","required":false,"description":"number, required, latitude of first point, decimal degrees, no default"},{"name":"lat2","type":"number|string","required":false,"description":"number, required, latitude of second point, decimal degrees, no default"},{"name":"lon1","type":"number|string","required":false,"description":"number, required, longitude of first point, decimal degrees, no default"},{"name":"lon2","type":"number|string","required":false,"description":"number, required, longitude of second point, decimal degrees, no default"},{"name":"unit","type":"string","required":false,"description":"string, optional, unit of measurement (km/miles/nautical), no unit, default km"}],"outputs":[],"hasOutputSchema":false,"hasExamples":false,"tokenEstimate":162},{"name":"calculate_area","title":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)","inputs":[{"name":"measurements","type":"string","required":false,"description":"object, required, shape-specific measurements (radius/base/height/length/width/side), appropriate units, no default"},{"name":"shape","type":"string","required":false,"description":"string, required, shape type (circle/triangle/rectangle/square), no unit, no default"}],"outputs":[],"hasOutputSchema":false,"hasExamples":false,"tokenEstimate":112},{"name":"calculate_standard_deviation","title":null,"description":"Calculates the population standard deviation of a list of numbers using the standard formula: sqrt(Σ(x - μ)² / N). (cost: 1 credit)","inputs":[{"name":"numbers","type":null,"required":false,"description":"array, required, list of numeric values, no unit, no default"}],"outputs":[],"hasOutputSchema":false,"hasExamples":false,"tokenEstimate":62},{"name":"average","title":null,"description":"Calculates the arithmetic mean (average) of a list of numbers by summing all values and dividing by the count. (cost: 1 credit)","inputs":[{"name":"numbers","type":null,"required":false,"description":"array, required, list of numeric values, no unit, no default"}],"outputs":[],"hasOutputSchema":false,"hasExamples":false,"tokenEstimate":56},{"name":"is_prime","title":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)","inputs":[{"name":"num","type":"string","required":false,"description":"integer, required, the number to test for primality, no units, no default"}],"outputs":[],"hasOutputSchema":false,"hasExamples":false,"tokenEstimate":66},{"name":"solve_quadratic","title":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)","inputs":[{"name":"a","type":"number|string","required":false,"description":"number, required, coefficient of x² term (must be non-zero)"},{"name":"b","type":"number|string","required":false,"description":"number, required, coefficient of x term"},{"name":"c","type":"number|string","required":false,"description":"number, required, constant term"}],"outputs":[],"hasOutputSchema":false,"hasExamples":false,"tokenEstimate":104},{"name":"permutation_count","title":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)","inputs":[{"name":"k","type":"string","required":false,"description":"integer, required, number of elements to select (must be 0 ≤ k ≤ n)"},{"name":"n","type":"string","required":false,"description":"integer, required, total number of elements (must be non-negative)"}],"outputs":[],"hasOutputSchema":false,"hasExamples":false,"tokenEstimate":94},{"name":"probability_consecutive_rolls","title":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)","inputs":[{"name":"num_rolls","type":"string","required":false,"description":"integer, required, number of consecutive rolls (must be positive)"},{"name":"num_sides","type":"string","required":false,"description":"integer, required, number of sides on the die (must be positive)"},{"name":"target_value","type":"string","required":false,"description":"integer, required, the target value to roll (must be between 1 and num_sides)"}],"outputs":[],"hasOutputSchema":false,"hasExamples":false,"tokenEstimate":137}],"toolsTruncatedAtCapture":false,"diagnostics":{"capturedAt":"2026-11-21T02:06:23.000Z","track":"remote","endpoint":"https://ukdata.reliness.co.uk/mcp/maths-statistics","declaredUrl":null,"truncated":false,"tls":{"outcome":"valid","label":"Valid","version":"TLS 1.3","cipherSuite":"TLS_AES_128_GCM_SHA256","chainError":null,"certificates":[{"subject":"CN=reliness.co.uk","issuer":"CN=WE1,O=Google Trust Services,C=US","notBefore":"2026-11-04T08:26:44Z","notAfter":"2027-02-02T09:26:40Z","keyType":"ECDSA","keyBits":256,"isCa":false},{"subject":"CN=WE1,O=Google Trust Services,C=US","issuer":"CN=GTS Root R4,O=Google Trust Services LLC,C=US","notBefore":"2023-12-13T09:00:00Z","notAfter":"2029-02-20T14:00:00Z","keyType":"ECDSA","keyBits":256,"isCa":true},{"subject":"CN=GTS Root R4,O=Google Trust Services LLC,C=US","issuer":"CN=GlobalSign Root CA,OU=Root CA,O=GlobalSign nv-sa,C=BE","notBefore":"2023-11-15T03:43:21Z","notAfter":"2028-01-28T00:00:42Z","keyType":"ECDSA","keyBits":384,"isCa":true}]},"dnssec":{"result":"insecure","label":"Not signed","name":"ukdata.reliness.co.uk.","steps":[{"zone":".","outcome":"verified","label":"Verified"},{"zone":"uk.","outcome":"verified","label":"Verified"},{"zone":"co.uk.","outcome":"verified","label":"Verified"},{"zone":"reliness.co.uk.","outcome":"insecure_proven","label":"Unsigned (proven)"}]},"auth":{"outcome":"none","label":"No authorisation required","gate":null,"gateLabel":null,"status":200,"authorizationServers":[]},"httpsRedirect":{"outcome":"plaintext_served","label":"Served over HTTP","status":200},"transports":[{"transport":"streamable-http","outcome":"verified","label":"Verified","status":200,"followed":false}],"provenance":null,"installScripts":[],"installScriptsTotal":null,"vulnerabilities":[],"vulnerabilitiesTotal":null,"dependencies":null},"mismatches":[],"changelog":{"trackingSince":"2026-11-07","recent":[{"id":"chg_01a1fbda-d0ee-7e50-ab13-7b1017b88cdb","kind":"score.total_changed","summary":"Trust score (76 → 77)","materiality":"functional","direction":"improvement","scoreDelta":1,"occurredOn":"2026-11-21","url":"https://verifymcp.io/servers/uk-co-reliness-maths-statistics/mcp-maths-statistics#chg-chg_01a1fbda-d0ee-7e50-ab13-7b1017b88cdb"},{"id":"chg_01a1f18e-173f-7324-bdca-7bf533910fe0","kind":"score.total_changed","summary":"Trust score (75 → 76)","materiality":"functional","direction":"improvement","scoreDelta":1,"occurredOn":"2026-11-19","url":"https://verifymcp.io/servers/uk-co-reliness-maths-statistics/mcp-maths-statistics#chg-chg_01a1f18e-173f-7324-bdca-7bf533910fe0"},{"id":"chg_01a1e73f-7bda-74e4-89b1-476173bd012c","kind":"score.total_changed","summary":"Trust score (74 → 75)","materiality":"functional","direction":"improvement","scoreDelta":1,"occurredOn":"2026-11-17","url":"https://verifymcp.io/servers/uk-co-reliness-maths-statistics/mcp-maths-statistics#chg-chg_01a1e73f-7bda-74e4-89b1-476173bd012c"},{"id":"chg_01a1dcf3-9044-74d4-a1ed-9ee35c3d250b","kind":"score.total_changed","summary":"Trust score (73 → 74)","materiality":"functional","direction":"improvement","scoreDelta":1,"occurredOn":"2026-11-15","url":"https://verifymcp.io/servers/uk-co-reliness-maths-statistics/mcp-maths-statistics#chg-chg_01a1dcf3-9044-74d4-a1ed-9ee35c3d250b"},{"id":"chg_01a1d2a6-913f-799e-a3b7-780541923719","kind":"score.total_changed","summary":"Trust score (72 → 73)","materiality":"functional","direction":"improvement","scoreDelta":1,"occurredOn":"2026-11-13","url":"https://verifymcp.io/servers/uk-co-reliness-maths-statistics/mcp-maths-statistics#chg-chg_01a1d2a6-913f-799e-a3b7-780541923719"},{"id":"chg_01a1c85a-164d-7146-aae2-f7ee962b6e68","kind":"score.total_changed","summary":"Trust score (71 → 72)","materiality":"functional","direction":"improvement","scoreDelta":1,"occurredOn":"2026-11-11","url":"https://verifymcp.io/servers/uk-co-reliness-maths-statistics/mcp-maths-statistics#chg-chg_01a1c85a-164d-7146-aae2-f7ee962b6e68"},{"id":"chg_01a1be0d-dfaa-7eac-96c1-e407663accd3","kind":"score.total_changed","summary":"Trust score (70 → 71)","materiality":"functional","direction":"improvement","scoreDelta":1,"occurredOn":"2026-11-09","url":"https://verifymcp.io/servers/uk-co-reliness-maths-statistics/mcp-maths-statistics#chg-chg_01a1be0d-dfaa-7eac-96c1-e407663accd3"},{"id":"chg_01a1b8e6-5687-72c9-911d-66c9b8bbc8e1","kind":"check.reverified","summary":"Stability (unverified → 0.03)","materiality":"functional","direction":"improvement","scoreDelta":null,"occurredOn":"2026-11-08","url":"https://verifymcp.io/servers/uk-co-reliness-maths-statistics/mcp-maths-statistics#chg-chg_01a1b8e6-5687-72c9-911d-66c9b8bbc8e1"},{"id":"chg_01a1b618-f663-70d6-86cb-f0110b6b1f8c","kind":"score.first_scored","summary":"First indexed and scored","materiality":"functional","direction":"neutral","scoreDelta":null,"occurredOn":"2026-11-07","url":"https://verifymcp.io/servers/uk-co-reliness-maths-statistics/mcp-maths-statistics#chg-chg_01a1b618-f663-70d6-86cb-f0110b6b1f8c"}],"truncated":false,"feedUrl":"https://verifymcp.io/servers/uk-co-reliness-maths-statistics/mcp-maths-statistics/changelog.json"},"links":{"html":"https://verifymcp.io/servers/uk-co-reliness-maths-statistics/mcp-maths-statistics","markdown":"https://verifymcp.io/servers/uk-co-reliness-maths-statistics/mcp-maths-statistics.md","changelogJson":"https://verifymcp.io/servers/uk-co-reliness-maths-statistics/mcp-maths-statistics/changelog.json","changelogRss":"https://verifymcp.io/servers/uk-co-reliness-maths-statistics/mcp-maths-statistics.xml","external":[{"label":"Remote endpoint","href":"https://ukdata.reliness.co.uk/mcp/maths-statistics"},{"label":"Website","href":"https://ukdata.reliness.co.uk/"}]}}