# UK Data: Code utilities (remote · ukdata.reliness.co.uk)

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

- Trust score: 75/100 (medium)
- Change this week: +3
- Registry status: active
- Liveness: live
- Owner verified: no
- Last scored: 2026-11-21

## Components

- remote · `ukdata.reliness.co.uk`: 75/100 (this document), [markdown](https://verifymcp.io/servers/uk-co-reliness-code-utilities/mcp-code-utilities.md), [page](https://verifymcp.io/servers/uk-co-reliness-code-utilities/mcp-code-utilities)

## Channel facts

- Endpoint: `https://ukdata.reliness.co.uk/mcp/code-utilities`
- Transports: `streamable-http`
- Auth: `none`
- Version: `1.5.0`

## Trust breakdown

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. Scores are 0–100 per category. Scoring method: https://verifymcp.io/docs/scoring (what has changed: https://verifymcp.io/docs/scoring/changelog)

Scored 2026-11-21.

- **Endpoint Security**: 69/100
  - 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.
- **Transport & Reachability**: 100/100
  - Verified streamable-http transport via a live MCP handshake.
- **Schema Quality & AI Usability**: 81/100
  - AI-judged instruction clarity (excellent).
  - Tool/resource definitions use about 2172 tokens (~67/item across 32 items; 32 tools + 0 resources), lean.
  - Usage-examples check failed: none of the tools include examples.
- **Stability & Change Management**: 47/100
  - Stability observed for 14 of 30 days with no destabilising changes; credit accrues until the full window elapses.
- **Tool Coverage**: 100/100
  - 100% of tools have a non-trivial description (not blank, and not just the tool's name).
  - 100% of tool parameters carry a description.
- **Tool Safety**: 75/100
  - No prompt-injection markers were found in the server instructions, tool names or descriptions we captured.
  - 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.
  - An AI judge read all 32 captured unit(s) of tool text and found none that tries to manipulate the model reading it.
- **Capabilities**: 100/100
  - Implements a supported MCP spec version (2025-11-25); the latest is 2026-07-28.

## 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.

### Claude

```bash
claude mcp add --transport http uk-co-reliness-code-utilities 'https://ukdata.reliness.co.uk/mcp/code-utilities'
```

### Cursor

```json
{
  "mcpServers": {
    "uk-co-reliness-code-utilities": {
      "url": "https://ukdata.reliness.co.uk/mcp/code-utilities"
    }
  }
}
```

### VS Code

```json
{
  "servers": {
    "uk-co-reliness-code-utilities": {
      "type": "http",
      "url": "https://ukdata.reliness.co.uk/mcp/code-utilities"
    }
  }
}
```

### Codex

```toml
[mcp_servers.uk-co-reliness-code-utilities]
url = "https://ukdata.reliness.co.uk/mcp/code-utilities"
```

### opencode

```json
{
  "$schema": "https://opencode.ai/config.json",
  "mcp": {
    "uk-co-reliness-code-utilities": {
      "type": "remote",
      "url": "https://ukdata.reliness.co.uk/mcp/code-utilities",
      "enabled": true
    }
  }
}
```

### OpenClaw

```bash
openclaw mcp add uk-co-reliness-code-utilities --url 'https://ukdata.reliness.co.uk/mcp/code-utilities' --transport streamable-http
```

### Hermes

```yaml
mcp_servers:
  uk-co-reliness-code-utilities:
    url: "https://ukdata.reliness.co.uk/mcp/code-utilities"
```

### Netclaw

```json
{
  "McpServers": {
    "uk-co-reliness-code-utilities": {
      "Transport": "http",
      "Url": "https://ukdata.reliness.co.uk/mcp/code-utilities"
    }
  }
}
```

### Vellum

```bash
assistant mcp add uk-co-reliness-code-utilities -t streamable-http -u 'https://ukdata.reliness.co.uk/mcp/code-utilities'
```

### Other

```json
{
  "mcpServers": {
    "uk-co-reliness-code-utilities": {
      "type": "http",
      "url": "https://ukdata.reliness.co.uk/mcp/code-utilities"
    }
  }
}
```

The mcpServers block is a cross-client convention. Remote transports vary, so check your client's docs.

## Changelog

Every change recorded for this component, newest first. Days that predate change tracking, or that we cannot explain, say so: "we were watching and nothing happened" and "we were not watching" are different claims.

### 2026-11-20 (score 75, +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.

### 2026-11-18 (score 74, +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.

### 2026-11-16 (score 73, +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.

### 2026-11-14 (score 72, +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.

### 2026-11-11 (score 71, +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.

### 2026-11-09 (score 70, +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.

### 2026-11-08 (score 69, 0)

- [functional improvement] Stability: unverified → 0.03

### 2026-11-07 (score 69)

First indexed and scored.

## MCP tools (32)

### `is_valid_ip_address` (~59 tokens)

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

Input parameters:

- `ip` (string): string, required, the IP address string to validate

### `find_max_subarray_sum` (~50 tokens)

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

Input parameters:

- `nums`: array of numbers, required, the list of integers to analyze

### `merge_dictionaries` (~76 tokens)

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

Input parameters:

- `dict1` (string): object, required, the first dictionary
- `dict2` (string): object, required, the second dictionary to merge into the first

### `find_kth_smallest` (~81 tokens)

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

Input parameters:

- `k` (string): integer, required, the position of the desired smallest element (1-indexed)
- `nums`: array of numbers, required, the list of numbers to search

### `count_bits` (~52 tokens)

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

Input parameters:

- `num` (string): integer, required, the non-negative integer to analyze

### `binary_search` (~70 tokens)

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

Input parameters:

- `arr`: array of numbers, required, the sorted list to search
- `target` (number|string): number, required, the value to find

### `reverse_string` (~48 tokens)

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

Input parameters:

- `text` (string): string, required, the text string to reverse

### `min_meeting_rooms` (~65 tokens)

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

Input parameters:

- `intervals`: array of arrays, required, list of meeting time intervals where each interval is [start_time, end_time]

### `find_next_greater_element` (~59 tokens)

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

Input parameters:

- `nums`: array of numbers, required, list of numbers to process

### `binary_addition` (~85 tokens)

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

Input parameters:

- `a` (string): string, required, first binary number as string (e.g., '1010')
- `b` (string): string, required, second binary number as string (e.g., '1101')

### `is_palindrome` (~56 tokens)

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

Input parameters:

- `text` (string): string, required, text to check, no unit, no default

### `sort_numbers` (~51 tokens)

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

Input parameters:

- `numbers`: array, required, list of numeric values to sort, no unit, no default

### `find_pairs_with_sum` (~77 tokens)

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

Input parameters:

- `nums`: array, required, list of integers, no unit, no default
- `target` (string): integer, required, target sum value, no unit, no default

### `is_perfect_square` (~56 tokens)

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

Input parameters:

- `num` (number|string): number, required, number to check, no unit, no default

### `find_n_largest` (~73 tokens)

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

Input parameters:

- `n` (string): integer, required, number of largest values to find, count, no default
- `nums`: array, required, list of numeric values, no unit, no default

### `is_valid_parentheses` (~77 tokens)

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)

Input parameters:

- `s` (string): string, required, the input string containing parentheses/brackets/braces to validate, no units, no default

### `find_minimum_rotated_sorted_array` (~71 tokens)

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)

Input parameters:

- `nums`: array of numbers, required, the rotated sorted array to search, no units, no default

### `flatten_list` (~59 tokens)

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

Input parameters:

- `nested_list`: array, required, the nested list structure to flatten, no units, no default

### `is_anagram` (~85 tokens)

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)

Input parameters:

- `word1` (string): string, required, first word to compare, no units, no default
- `word2` (string): string, required, second word to compare, no units, no default

### `find_first_non_repeating_char` (~60 tokens)

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

Input parameters:

- `s` (string): string, required, the input string to search, no units, no default

### `find_equilibrium_index` (~72 tokens)

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)

Input parameters:

- `arr`: array of numbers, required, the input array to search, no units, no default

### `find_missing_number` (~72 tokens)

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)

Input parameters:

- `nums`: array of integers, required, list containing numbers from 0 to n with one missing, no units, no default

### `is_power` (~81 tokens)

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)

Input parameters:

- `base` (number|string): number, required, the base to test against
- `num` (number|string): number, required, the number to check

### `find_longest_word` (~62 tokens)

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)

Input parameters:

- `text` (string): string, required, the text to search for the longest word

### `can_attend_meetings` (~71 tokens)

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)

Input parameters:

- `intervals`: array, required, list of meeting time intervals as [start, end] pairs

### `is_rotation` (~93 tokens)

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)

Input parameters:

- `str1` (string): string, required, first string to compare
- `str2` (string): string, required, second string to check if it's a rotation of str1

### `find_peak_element` (~55 tokens)

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)

Input parameters:

- `nums`: array, required, list of integers to search

### `find_duplicate_number` (~54 tokens)

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

Input parameters:

- `nums`: array, required, list of integers containing one duplicate

### `is_sum_of_cubes` (~80 tokens)

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)

Input parameters:

- `num` (string): integer, required, the number to check (must be non-negative)

### `validate_sudoku` (~89 tokens)

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)

Input parameters:

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

### `find_majority_element` (~71 tokens)

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)

Input parameters:

- `nums`: array, required, list of integers to search

### `merge_sorted_lists` (~62 tokens)

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

Input parameters:

- `list1`: array, required, first sorted list
- `list2`: array, required, second sorted list

## Diagnostics

Captured diagnostic sections: TLS, DNSSEC, Authorisation, Transports. The full working is on the page: https://verifymcp.io/servers/uk-co-reliness-code-utilities/mcp-code-utilities#diagnostics

## Score history

- 2026-11-21: 75
- 2026-11-20: 75
- 2026-11-19: 74
- 2026-11-18: 74
- 2026-11-17: 73
- 2026-11-16: 73
- 2026-11-15: 72
- 2026-11-14: 72
- 2026-11-13: 71
- 2026-11-12: 71
- 2026-11-11: 71
- 2026-11-10: 70
- 2026-11-09: 70
- 2026-11-08: 69
- 2026-11-07: 69

## 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.

## Links

- Remote endpoint: https://ukdata.reliness.co.uk/mcp/code-utilities
- Website: https://ukdata.reliness.co.uk/
- Changelog RSS feed: https://verifymcp.io/servers/uk-co-reliness-code-utilities/mcp-code-utilities.xml
- Changelog JSON feed: https://verifymcp.io/servers/uk-co-reliness-code-utilities/mcp-code-utilities/changelog.json
- Trust report (JSON): https://verifymcp.io/servers/uk-co-reliness-code-utilities/mcp-code-utilities.json
- HTML version of this page: https://verifymcp.io/servers/uk-co-reliness-code-utilities/mcp-code-utilities
