Skip to content
verify mcp Beta VerifyMCP is currently in beta. If you notice any issues, get in touch and we’ll put it right.

UK Data: Code utilities

REMOTE · UKDATA.RELINESS.CO.UK

Deterministic string, list and number routines: palindromes, sorting, searching, validation, merging

+3 this week 75 Trust /100

Last scanned (12 hours ago)

Scores higher than 62% of remote servers

Reachable. Last reached 21 Nov 2026.

Category Developer Tools

Trust breakdown (7 categories)

How this component scores in each security and reliability category. Every signal is checked automatically against the live server, and we only credit what we can confirm. How we score → Why this is hard to score →

Endpoint Security69
  • The endpoint's TLS certificate is valid, in date, and uses a strong key. View diagnostics → Pass
  • 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. See how to fix → View diagnostics → Partial
  • HTTPS check failed: the endpoint is reachable over plaintext HTTP. See how to fix → View diagnostics → Fail
  • The HSTS (Strict-Transport-Security) header is present. View diagnostics → Pass
  • DNSSEC check failed: this domain isn't protected by DNSSEC. See how to fix → View diagnostics → Fail
Transport & Reachability100
Schema Quality & AI Usability81
  • AI-judged instruction clarity (excellent).Pass
  • Tool/resource definitions use about 2172 tokens (~67/item across 32 items; 32 tools + 0 resources), lean.Pass
  • Usage-examples check failed: none of the tools include examples. See how to fix → Fail
Stability & Change Management47
  • Stability observed for 14 of 30 days with no destabilising changes; credit accrues until the full window elapses.Partial
Tool Coverage100
  • 100% of tools have a non-trivial description (not blank, and not just the tool's name).Pass
  • 100% of tool parameters carry a description.Pass
Tool Safety75
  • No prompt-injection markers were found in the server instructions, tool names or descriptions we captured.Pass
  • 0 of 2 tool(s) whose name or description implies an irreversible operation declare an MCP destructiveHint annotation; "merge_dictionaries" implies "merge" and declares readOnlyHint instead, contradicting what its own name says it does. See how to fix → Fail
  • An AI judge read all 32 captured unit(s) of tool text and found none that tries to manipulate the model reading it.Pass
Capabilities100
  • Implements a supported MCP spec version (2025-11-25); the latest is 2026-07-28.Pass
What we tested

Checks we ran (13)

  • TLS certificate
  • Authorization
  • HTTPS
  • HSTS header
  • DNSSEC
  • Transport
  • Schema quality
  • Stability
  • Tool coverage
  • Injection markers
  • Destructive annotations
  • Judged manipulation
  • MCP protocol

Does not apply to this hosted endpoint (2)

  • Supply Chain SecurityScored on package channels only. This is a hosted endpoint, so there is nothing to install or inspect.
  • Provenance & TransparencyScored on package channels only. This is a hosted endpoint, so there is nothing to install or inspect.

The score does not measure everything. What the score does not measure →

Changelog

Every change we have recorded for this component, newest first. Security-relevant changes are always shown. ▲ marks a change for the better, ▼ a change for the worse; unmarked changes are neutral.

  • 20 Nov 26 +1

    No change was recorded against any check on this day. Stability & Change Management went from 40 to 43. That category is still filling its 30-day observation window: 12 days of observed history at the previous scan, 13 at this one. The score rises as the window fills, whether or not the server changes.

  • 18 Nov 26 +1

    No change was recorded against any check on this day. Stability & Change Management went from 33 to 37. That category is still filling its 30-day observation window: 10 days of observed history at the previous scan, 11 at this one. The score rises as the window fills, whether or not the server changes.

  • 16 Nov 26 +1

    No change was recorded against any check on this day. Stability & Change Management went from 27 to 30. That category is still filling its 30-day observation window: 8 days of observed history at the previous scan, 9 at this one. The score rises as the window fills, whether or not the server changes.

  • 14 Nov 26 +1

    No change was recorded against any check on this day. Stability & Change Management went from 20 to 23. That category is still filling its 30-day observation window: 6 days of observed history at the previous scan, 7 at this one. The score rises as the window fills, whether or not the server changes.

  • 11 Nov 26 +1

    No change was recorded against any check on this day. Stability & Change Management went from 10 to 13. That category is still filling its 30-day observation window: 3 days of observed history at the previous scan, 4 at this one. The score rises as the window fills, whether or not the server changes.

  • 9 Nov 26 +1

    No change was recorded against any check on this day. Stability & Change Management went from 3 to 7. That category is still filling its 30-day observation window: 1 days of observed history at the previous scan, 2 at this one. The score rises as the window fills, whether or not the server changes.

  • 8 Nov 26 0
    • Stability: unverified → 0.03 ▲ functional
  • 7 Nov 26 69

    First indexed and scored.

Diagnostics

Diagnostic detail from the automated scan of this channel: what the scanner observed at each step, so you can see exactly where a check passed or failed. It is informational only and never changes the trust score.

Captured 21 Nov 2026 · Probed https://ukdata.reliness.co.uk/mcp/code-utilities

TLS valid

Negotiated TLS 1.3 with TLS_AES_128_GCM_SHA256 .

Subject Issuer Valid from Valid until Key Signature Serial
CN=reliness.co.uk CN=WE1,O=Google Trust Services,C=US 4 Nov 2026 2 Feb 2027 ECDSA 256 ECDSA-SHA256 f1d4f4e9f24c919b0e13c306162294a4
SANs: reliness.co.uk, ukdata.reliness.co.uk, *.ukdata.reliness.co.uk
CN=WE1,O=Google Trust Services,C=US (CA) CN=GTS Root R4,O=Google Trust Services LLC,C=US 13 Dec 2023 20 Feb 2029 ECDSA 256 ECDSA-SHA384 7ff31977972c224a76155d13b6d685e3
CN=GTS Root R4,O=Google Trust Services LLC,C=US (CA) CN=GlobalSign Root CA,OU=Root CA,O=GlobalSign nv-sa,C=BE 15 Nov 2023 28 Jan 2028 ECDSA 384 SHA256-RSA 7fe530bf331343bedd821610493d8a1b

Background: What to check on a remote MCP endpoint →

DNSSEC insecure

Validation of ukdata.reliness.co.uk. — Not signed

Zone DS Keys Algorithms Outcome
. Trust anchor 20326, 38696 8, 8 Verified
uk. DS published 43876 8 Verified
co.uk. DS published 11810 8 Verified
reliness.co.uk. No DS Unsigned (proven) parent-signed NSEC/NSEC3 proves an unsigned delegation
Authentication No authorisation required

The endpoint answered without asking for a token. Anyone who knows the URL can reach it.

Result No authorisation required
HTTP status 200
Header Value
strict-transport-security max-age=31536000; includeSubDomains
x-content-type-options nosniff
referrer-policy strict-origin-when-cross-origin

Background: How OAuth 2.1 works in the 2026 MCP spec →

Transports 2 probes
Transport URL Outcome Status Location
streamable-http https://ukdata.reliness.co.uk/mcp/code-utilities Verified 200
http (plaintext) http://ukdata.reliness.co.uk/mcp/code-utilities Served over HTTP 200
MCP tools · 32 exposed · ~2,172 tokens

The tools this component advertises to a client, with an estimated token cost for each. Expand a tool to see its parameters and schema. The per-tool counts are indicative and are not scored directly; the schema's total context footprint is one signal in Schema Quality & AI Usability. A tool's description is untrusted text the model reads on every call, which is what makes this list a security surface and not just an inventory: how tool poisoning works →

Tool Tokens
binary_addition ~85

Adds two binary numbers represented as strings and returns the sum as a binary string. Performs binary arithmetic with carry propagation. (cost: 1 credit)

NameTypeReqDescription
astring–string, required, first binary number as string (e.g., '1010')
bstring–string, required, second binary number as string (e.g., '1101')

No output schema declared.

No examples provided.

binary_search ~70

Performs binary search on a sorted list to find the index of a target value, returning -1 if not found. (cost: 1 credit)

NameTypeReqDescription
arr––array of numbers, required, the sorted list to search
targetnumber|string–number, required, the value to find

No output schema declared.

No examples provided.

can_attend_meetings ~71

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)

NameTypeReqDescription
intervals––array, required, list of meeting time intervals as [start, end] pairs

No output schema declared.

No examples provided.

count_bits ~52

Counts the number of set bits (1's) in the binary representation of a non-negative integer. (cost: 1 credit)

NameTypeReqDescription
numstring–integer, required, the non-negative integer to analyze

No output schema declared.

No examples provided.

find_duplicate_number ~54

Finds the duplicate number in a list of integers where exactly one number appears more than once. Returns the duplicate value. (cost: 1 credit)

NameTypeReqDescription
nums––array, required, list of integers containing one duplicate

No output schema declared.

No examples provided.

find_equilibrium_index ~72

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)

NameTypeReqDescription
arr––array of numbers, required, the input array to search, no units, no default

No output schema declared.

No examples provided.

find_first_non_repeating_char ~60

Finds the first character in a string that appears only once. Returns null if all characters repeat. (cost: 1 credit)

NameTypeReqDescription
sstring–string, required, the input string to search, no units, no default

No output schema declared.

No examples provided.

find_kth_smallest ~81

Finds the kth smallest number in an unsorted list (1-indexed, where k=1 returns the smallest element). (cost: 1 credit)

NameTypeReqDescription
kstring–integer, required, the position of the desired smallest element (1-indexed)
nums––array of numbers, required, the list of numbers to search

No output schema declared.

No examples provided.

find_longest_word ~62

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)

NameTypeReqDescription
textstring–string, required, the text to search for the longest word

No output schema declared.

No examples provided.

find_majority_element ~71

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)

NameTypeReqDescription
nums––array, required, list of integers to search

No output schema declared.

No examples provided.

find_max_subarray_sum ~50

Finds the maximum sum of any contiguous subarray using Kadane's algorithm. (cost: 1 credit)

NameTypeReqDescription
nums––array of numbers, required, the list of integers to analyze

No output schema declared.

No examples provided.

find_minimum_rotated_sorted_array ~71

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)

NameTypeReqDescription
nums––array of numbers, required, the rotated sorted array to search, no units, no default

No output schema declared.

No examples provided.

find_missing_number ~72

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)

NameTypeReqDescription
nums––array of integers, required, list containing numbers from 0 to n with one missing, no units, no default

No output schema declared.

No examples provided.

find_n_largest ~73

Finds the n largest numbers from a list and returns them in descending order. (cost: 1 credit)

NameTypeReqDescription
nstring–integer, required, number of largest values to find, count, no default
nums––array, required, list of numeric values, no unit, no default

No output schema declared.

No examples provided.

find_next_greater_element ~59

For each element in a list, finds the next greater element to its right. Returns -1 if no greater element exists. (cost: 1 credit)

NameTypeReqDescription
nums––array of numbers, required, list of numbers to process

No output schema declared.

No examples provided.

find_pairs_with_sum ~77

Finds all unique pairs of integers in a list that sum to a specified target value. Returns pairs as arrays. (cost: 1 credit)

NameTypeReqDescription
nums––array, required, list of integers, no unit, no default
targetstring–integer, required, target sum value, no unit, no default

No output schema declared.

No examples provided.

find_peak_element ~55

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)

NameTypeReqDescription
nums––array, required, list of integers to search

No output schema declared.

No examples provided.

flatten_list ~59

Flattens a nested list structure into a single-level list by recursively extracting all elements regardless of nesting depth. (cost: 1 credit)

NameTypeReqDescription
nested_list––array, required, the nested list structure to flatten, no units, no default

No output schema declared.

No examples provided.

is_anagram ~85

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)

NameTypeReqDescription
word1string–string, required, first word to compare, no units, no default
word2string–string, required, second word to compare, no units, no default

No output schema declared.

No examples provided.

is_palindrome ~56

Checks if a string is a valid palindrome, considering only alphanumeric characters and ignoring case and spaces. (cost: 1 credit)

NameTypeReqDescription
textstring–string, required, text to check, no unit, no default

No output schema declared.

No examples provided.

is_perfect_square ~56

Checks if a number is a perfect square (i.e., the square of an integer). (cost: 1 credit)

NameTypeReqDescription
numnumber|string–number, required, number to check, no unit, no default

No output schema declared.

No examples provided.

is_power ~81

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)

NameTypeReqDescription
basenumber|string–number, required, the base to test against
numnumber|string–number, required, the number to check

No output schema declared.

No examples provided.

is_rotation ~93

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)

NameTypeReqDescription
str1string–string, required, first string to compare
str2string–string, required, second string to check if it's a rotation of str1

No output schema declared.

No examples provided.

is_sum_of_cubes ~80

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)

NameTypeReqDescription
numstring–integer, required, the number to check (must be non-negative)

No output schema declared.

No examples provided.

is_valid_ip_address ~59

Validates whether a string is a properly formatted IPv4 address with four octets (0-255) separated by dots. (cost: 1 credit)

NameTypeReqDescription
ipstring–string, required, the IP address string to validate

No output schema declared.

No examples provided.

is_valid_parentheses ~77

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)

NameTypeReqDescription
sstring–string, required, the input string containing parentheses/brackets/braces to validate, no units, no default

No output schema declared.

No examples provided.

merge_dictionaries ~76

Merges two dictionaries into a single dictionary, with values from the second dictionary overwriting those from the first for duplicate keys. (cost: 1 credit)

NameTypeReqDescription
dict1string–object, required, the first dictionary
dict2string–object, required, the second dictionary to merge into the first

No output schema declared.

No examples provided.

merge_sorted_lists ~62

Merges two sorted lists into a single sorted list maintaining ascending order. Returns the merged sorted list. (cost: 1 credit)

NameTypeReqDescription
list1––array, required, first sorted list
list2––array, required, second sorted list

No output schema declared.

No examples provided.

min_meeting_rooms ~65

Finds the minimum number of meeting rooms required to accommodate all meetings given their time intervals. Uses interval scheduling algorithm. (cost: 1 credit)

NameTypeReqDescription
intervals––array of arrays, required, list of meeting time intervals where each interval is [start_time, end_time]

No output schema declared.

No examples provided.

reverse_string ~48

Reverses the order of characters in a given string, returning the string backwards. (cost: 1 credit)

NameTypeReqDescription
textstring–string, required, the text string to reverse

No output schema declared.

No examples provided.

sort_numbers ~51

Sorts a list of numbers in ascending order using a deterministic sorting algorithm. (cost: 1 credit)

NameTypeReqDescription
numbers––array, required, list of numeric values to sort, no unit, no default

No output schema declared.

No examples provided.

validate_sudoku ~89

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)

NameTypeReqDescription
board––array, required, 9x9 2D array representing the Sudoku board with digits 1-9 or empty cells

No output schema declared.

No examples provided.

Install

How do I install the UK Data: Code utilities MCP server?

UK Data: Code utilities is a hosted endpoint at https://ukdata.reliness.co.uk/mcp/code-utilities, so there is nothing to install locally. Ready-made configuration for Claude, Cursor, VS Code, Codex and 5 more is on this page, copied from each client's own documentation.

remote · ukdata.reliness.co.uk

# add to Claude Code
claude mcp add --transport http uk-co-reliness-code-utilities 'https://ukdata.reliness.co.uk/mcp/code-utilities'
Common questions

What is the UK Data: Code utilities MCP server?

UK Data: Code utilities is an MCP server listed in the public MCP registry as uk.co.reliness/code-utilities. Deterministic string, list and number routines: palindromes, sorting, searching, validation, merging. This page covers its hosted endpoint (https://ukdata.reliness.co.uk/mcp/code-utilities).

Is the UK Data: Code utilities MCP server safe to use?

UK Data: Code utilities scores 75 out of 100 on VerifyMCP. That is a record of what we were able to check automatically, not an endorsement. The category breakdown on this page shows every signal behind the number, including the ones we could not confirm.

What tools does the UK Data: Code utilities MCP server expose?

UK Data: Code utilities exposes 32 tools: is_valid_ip_address, find_max_subarray_sum, merge_dictionaries, find_kth_smallest, count_bits, and 27 more. Their descriptions and schemas cost roughly 2,172 tokens of context every time the server is loaded.

Does the UK Data: Code utilities MCP server require authentication?

No. We connected to UK Data: Code utilities without credentials and it answered, so anything it exposes is reachable by anyone who knows the address.

Is the UK Data: Code utilities MCP server still maintained?

UK Data: Code utilities is still listed as active in the MCP registry. We last reached this channel on 21 November 2026. Those dates come from our own scans of the registry and the channel itself, not from anything the publisher announced.

What did VerifyMCP test on the UK Data: Code utilities MCP server?

VerifyMCP ran 13 checks on UK Data: Code utilities, covering TLS certificate, Authorization, HTTPS, HSTS header and 9 more. Supply Chain Security and Provenance & Transparency do not apply to a hosted endpoint, so they were not tested. The score does not measure everything, and the scoring documentation lists what it leaves out.