{"$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-21T22:58:19.007Z","url":"https://verifymcp.io/servers/uk-co-reliness-code-utilities/mcp-code-utilities","markdownUrl":"https://verifymcp.io/servers/uk-co-reliness-code-utilities/mcp-code-utilities.md","server":{"slug":"uk-co-reliness-code-utilities","name":"UK Data: Code utilities","registryName":"uk.co.reliness/code-utilities","description":"Deterministic string, list and number routines: palindromes, sorting, searching, validation, merging","registryStatus":"active","deletedAt":null,"statusMessage":null,"liveness":"live","publisher":{"class":"unknown","claimed":false}},"component":{"slug":"mcp-code-utilities","type":"remote","identifier":"https://ukdata.reliness.co.uk/mcp/code-utilities","withdrawn":false,"url":"https://verifymcp.io/servers/uk-co-reliness-code-utilities/mcp-code-utilities","version":"1.5.0","transport":null,"scoredAt":"2026-11-21T10:14:15.500Z"},"score":{"total":75,"tier":"medium","status":"scored","weekDelta":3,"history":[{"date":"2026-11-21","total":75},{"date":"2026-11-20","total":75},{"date":"2026-11-19","total":74},{"date":"2026-11-18","total":74},{"date":"2026-11-17","total":73},{"date":"2026-11-16","total":73},{"date":"2026-11-15","total":72},{"date":"2026-11-14","total":72},{"date":"2026-11-13","total":71},{"date":"2026-11-12","total":71},{"date":"2026-11-11","total":71},{"date":"2026-11-10","total":70},{"date":"2026-11-09","total":70},{"date":"2026-11-08","total":69},{"date":"2026-11-07","total":69}]},"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":81,"verdict":"fail","reasons":["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."],"codes":[{"code":"schema.ai_quality","args":{"band":"excellent"}},{"code":"schema.footprint_lean","args":{"avg":"67","items":"32","tools":"32","tokens":"2172","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":75,"verdict":"fail","reasons":["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."],"codes":[{"code":"toolsafety.injection_clean","args":{}},{"code":"toolsafety.destructive_undeclared","args":{"pct":"0","tool":"merge_dictionaries","verb":"merge","declared":"read_only","annotated":"0","destructive":"2"}},{"code":"toolsafety.manipulation_clean","args":{"units":"32","judged":"32"}}]},{"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-code-utilities","type":"remote","identifier":"https://ukdata.reliness.co.uk/mcp/code-utilities","withdrawn":false,"score":75,"current":true,"url":"https://verifymcp.io/servers/uk-co-reliness-code-utilities/mcp-code-utilities","markdownUrl":"https://verifymcp.io/servers/uk-co-reliness-code-utilities/mcp-code-utilities.md"}],"facts":[{"label":"Endpoint","value":"https://ukdata.reliness.co.uk/mcp/code-utilities"},{"label":"Transports","value":"streamable-http"},{"label":"Auth","value":"none"},{"label":"Version","value":"1.5.0"}],"install":{"available":true,"bundleSha256":null},"tools":[{"name":"is_valid_ip_address","title":null,"description":"Validates whether a string is a properly formatted IPv4 address with four octets (0-255) separated by dots. (cost: 1 credit)","inputs":[{"name":"ip","type":"string","required":false,"description":"string, required, the IP address string to validate"}],"outputs":[],"hasOutputSchema":false,"hasExamples":false,"tokenEstimate":59},{"name":"find_max_subarray_sum","title":null,"description":"Finds the maximum sum of any contiguous subarray using Kadane's algorithm. (cost: 1 credit)","inputs":[{"name":"nums","type":null,"required":false,"description":"array of numbers, required, the list of integers to analyze"}],"outputs":[],"hasOutputSchema":false,"hasExamples":false,"tokenEstimate":50},{"name":"merge_dictionaries","title":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)","inputs":[{"name":"dict1","type":"string","required":false,"description":"object, required, the first dictionary"},{"name":"dict2","type":"string","required":false,"description":"object, required, the second dictionary to merge into the first"}],"outputs":[],"hasOutputSchema":false,"hasExamples":false,"tokenEstimate":76},{"name":"find_kth_smallest","title":null,"description":"Finds the kth smallest number in an unsorted list (1-indexed, where k=1 returns the smallest element). (cost: 1 credit)","inputs":[{"name":"k","type":"string","required":false,"description":"integer, required, the position of the desired smallest element (1-indexed)"},{"name":"nums","type":null,"required":false,"description":"array of numbers, required, the list of numbers to search"}],"outputs":[],"hasOutputSchema":false,"hasExamples":false,"tokenEstimate":81},{"name":"count_bits","title":null,"description":"Counts the number of set bits (1's) in the binary representation of a non-negative integer. (cost: 1 credit)","inputs":[{"name":"num","type":"string","required":false,"description":"integer, required, the non-negative integer to analyze"}],"outputs":[],"hasOutputSchema":false,"hasExamples":false,"tokenEstimate":52},{"name":"binary_search","title":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)","inputs":[{"name":"arr","type":null,"required":false,"description":"array of numbers, required, the sorted list to search"},{"name":"target","type":"number|string","required":false,"description":"number, required, the value to find"}],"outputs":[],"hasOutputSchema":false,"hasExamples":false,"tokenEstimate":70},{"name":"reverse_string","title":null,"description":"Reverses the order of characters in a given string, returning the string backwards. (cost: 1 credit)","inputs":[{"name":"text","type":"string","required":false,"description":"string, required, the text string to reverse"}],"outputs":[],"hasOutputSchema":false,"hasExamples":false,"tokenEstimate":48},{"name":"min_meeting_rooms","title":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)","inputs":[{"name":"intervals","type":null,"required":false,"description":"array of arrays, required, list of meeting time intervals where each interval is [start_time, end_time]"}],"outputs":[],"hasOutputSchema":false,"hasExamples":false,"tokenEstimate":65},{"name":"find_next_greater_element","title":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)","inputs":[{"name":"nums","type":null,"required":false,"description":"array of numbers, required, list of numbers to process"}],"outputs":[],"hasOutputSchema":false,"hasExamples":false,"tokenEstimate":59},{"name":"binary_addition","title":null,"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)","inputs":[{"name":"a","type":"string","required":false,"description":"string, required, first binary number as string (e.g., '1010')"},{"name":"b","type":"string","required":false,"description":"string, required, second binary number as string (e.g., '1101')"}],"outputs":[],"hasOutputSchema":false,"hasExamples":false,"tokenEstimate":85},{"name":"is_palindrome","title":null,"description":"Checks if a string is a valid palindrome, considering only alphanumeric characters and ignoring case and spaces. (cost: 1 credit)","inputs":[{"name":"text","type":"string","required":false,"description":"string, required, text to check, no unit, no default"}],"outputs":[],"hasOutputSchema":false,"hasExamples":false,"tokenEstimate":56},{"name":"sort_numbers","title":null,"description":"Sorts a list of numbers in ascending order using a deterministic sorting algorithm. (cost: 1 credit)","inputs":[{"name":"numbers","type":null,"required":false,"description":"array, required, list of numeric values to sort, no unit, no default"}],"outputs":[],"hasOutputSchema":false,"hasExamples":false,"tokenEstimate":51},{"name":"find_pairs_with_sum","title":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)","inputs":[{"name":"nums","type":null,"required":false,"description":"array, required, list of integers, no unit, no default"},{"name":"target","type":"string","required":false,"description":"integer, required, target sum value, no unit, no default"}],"outputs":[],"hasOutputSchema":false,"hasExamples":false,"tokenEstimate":77},{"name":"is_perfect_square","title":null,"description":"Checks if a number is a perfect square (i.e., the square of an integer). (cost: 1 credit)","inputs":[{"name":"num","type":"number|string","required":false,"description":"number, required, number to check, no unit, no default"}],"outputs":[],"hasOutputSchema":false,"hasExamples":false,"tokenEstimate":56},{"name":"find_n_largest","title":null,"description":"Finds the n largest numbers from a list and returns them in descending order. (cost: 1 credit)","inputs":[{"name":"n","type":"string","required":false,"description":"integer, required, number of largest values to find, count, no default"},{"name":"nums","type":null,"required":false,"description":"array, required, list of numeric values, no unit, no default"}],"outputs":[],"hasOutputSchema":false,"hasExamples":false,"tokenEstimate":73},{"name":"is_valid_parentheses","title":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)","inputs":[{"name":"s","type":"string","required":false,"description":"string, required, the input string containing parentheses/brackets/braces to validate, no units, no default"}],"outputs":[],"hasOutputSchema":false,"hasExamples":false,"tokenEstimate":77},{"name":"find_minimum_rotated_sorted_array","title":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)","inputs":[{"name":"nums","type":null,"required":false,"description":"array of numbers, required, the rotated sorted array to search, no units, no default"}],"outputs":[],"hasOutputSchema":false,"hasExamples":false,"tokenEstimate":71},{"name":"flatten_list","title":null,"description":"Flattens a nested list structure into a single-level list by recursively extracting all elements regardless of nesting depth. (cost: 1 credit)","inputs":[{"name":"nested_list","type":null,"required":false,"description":"array, required, the nested list structure to flatten, no units, no default"}],"outputs":[],"hasOutputSchema":false,"hasExamples":false,"tokenEstimate":59},{"name":"is_anagram","title":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)","inputs":[{"name":"word1","type":"string","required":false,"description":"string, required, first word to compare, no units, no default"},{"name":"word2","type":"string","required":false,"description":"string, required, second word to compare, no units, no default"}],"outputs":[],"hasOutputSchema":false,"hasExamples":false,"tokenEstimate":85},{"name":"find_first_non_repeating_char","title":null,"description":"Finds the first character in a string that appears only once. Returns null if all characters repeat. (cost: 1 credit)","inputs":[{"name":"s","type":"string","required":false,"description":"string, required, the input string to search, no units, no default"}],"outputs":[],"hasOutputSchema":false,"hasExamples":false,"tokenEstimate":60},{"name":"find_equilibrium_index","title":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)","inputs":[{"name":"arr","type":null,"required":false,"description":"array of numbers, required, the input array to search, no units, no default"}],"outputs":[],"hasOutputSchema":false,"hasExamples":false,"tokenEstimate":72},{"name":"find_missing_number","title":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)","inputs":[{"name":"nums","type":null,"required":false,"description":"array of integers, required, list containing numbers from 0 to n with one missing, no units, no default"}],"outputs":[],"hasOutputSchema":false,"hasExamples":false,"tokenEstimate":72},{"name":"is_power","title":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)","inputs":[{"name":"base","type":"number|string","required":false,"description":"number, required, the base to test against"},{"name":"num","type":"number|string","required":false,"description":"number, required, the number to check"}],"outputs":[],"hasOutputSchema":false,"hasExamples":false,"tokenEstimate":81},{"name":"find_longest_word","title":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)","inputs":[{"name":"text","type":"string","required":false,"description":"string, required, the text to search for the longest word"}],"outputs":[],"hasOutputSchema":false,"hasExamples":false,"tokenEstimate":62},{"name":"can_attend_meetings","title":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)","inputs":[{"name":"intervals","type":null,"required":false,"description":"array, required, list of meeting time intervals as [start, end] pairs"}],"outputs":[],"hasOutputSchema":false,"hasExamples":false,"tokenEstimate":71},{"name":"is_rotation","title":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)","inputs":[{"name":"str1","type":"string","required":false,"description":"string, required, first string to compare"},{"name":"str2","type":"string","required":false,"description":"string, required, second string to check if it's a rotation of str1"}],"outputs":[],"hasOutputSchema":false,"hasExamples":false,"tokenEstimate":93},{"name":"find_peak_element","title":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)","inputs":[{"name":"nums","type":null,"required":false,"description":"array, required, list of integers to search"}],"outputs":[],"hasOutputSchema":false,"hasExamples":false,"tokenEstimate":55},{"name":"find_duplicate_number","title":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)","inputs":[{"name":"nums","type":null,"required":false,"description":"array, required, list of integers containing one duplicate"}],"outputs":[],"hasOutputSchema":false,"hasExamples":false,"tokenEstimate":54},{"name":"is_sum_of_cubes","title":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)","inputs":[{"name":"num","type":"string","required":false,"description":"integer, required, the number to check (must be non-negative)"}],"outputs":[],"hasOutputSchema":false,"hasExamples":false,"tokenEstimate":80},{"name":"validate_sudoku","title":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)","inputs":[{"name":"board","type":null,"required":false,"description":"array, required, 9x9 2D array representing the Sudoku board with digits 1-9 or empty cells"}],"outputs":[],"hasOutputSchema":false,"hasExamples":false,"tokenEstimate":89},{"name":"find_majority_element","title":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)","inputs":[{"name":"nums","type":null,"required":false,"description":"array, required, list of integers to search"}],"outputs":[],"hasOutputSchema":false,"hasExamples":false,"tokenEstimate":71},{"name":"merge_sorted_lists","title":null,"description":"Merges two sorted lists into a single sorted list maintaining ascending order. Returns the merged sorted list. (cost: 1 credit)","inputs":[{"name":"list1","type":null,"required":false,"description":"array, required, first sorted list"},{"name":"list2","type":null,"required":false,"description":"array, required, second sorted list"}],"outputs":[],"hasOutputSchema":false,"hasExamples":false,"tokenEstimate":62}],"toolsTruncatedAtCapture":false,"diagnostics":{"capturedAt":"2026-11-21T10:14:15.000Z","track":"remote","endpoint":"https://ukdata.reliness.co.uk/mcp/code-utilities","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_01a1f87c-506d-7d40-bf3c-de9ad3dec1e8","kind":"score.total_changed","summary":"Trust score (74 → 75)","materiality":"functional","direction":"improvement","scoreDelta":1,"occurredOn":"2026-11-20","url":"https://verifymcp.io/servers/uk-co-reliness-code-utilities/mcp-code-utilities#chg-chg_01a1f87c-506d-7d40-bf3c-de9ad3dec1e8"},{"id":"chg_01a1ee22-47b3-7a3c-ae40-0e1b2ba55051","kind":"score.total_changed","summary":"Trust score (73 → 74)","materiality":"functional","direction":"improvement","scoreDelta":1,"occurredOn":"2026-11-18","url":"https://verifymcp.io/servers/uk-co-reliness-code-utilities/mcp-code-utilities#chg-chg_01a1ee22-47b3-7a3c-ae40-0e1b2ba55051"},{"id":"chg_01a1e3d3-66c3-7aa2-8771-c02e7b384792","kind":"score.total_changed","summary":"Trust score (72 → 73)","materiality":"functional","direction":"improvement","scoreDelta":1,"occurredOn":"2026-11-16","url":"https://verifymcp.io/servers/uk-co-reliness-code-utilities/mcp-code-utilities#chg-chg_01a1e3d3-66c3-7aa2-8771-c02e7b384792"},{"id":"chg_01a1d986-fe4a-75e6-b404-24f02dc05db4","kind":"score.total_changed","summary":"Trust score (71 → 72)","materiality":"functional","direction":"improvement","scoreDelta":1,"occurredOn":"2026-11-14","url":"https://verifymcp.io/servers/uk-co-reliness-code-utilities/mcp-code-utilities#chg-chg_01a1d986-fe4a-75e6-b404-24f02dc05db4"},{"id":"chg_01a1ca14-b2cf-7e0d-9f6d-34bf6e54542e","kind":"score.total_changed","summary":"Trust score (70 → 71)","materiality":"functional","direction":"improvement","scoreDelta":1,"occurredOn":"2026-11-11","url":"https://verifymcp.io/servers/uk-co-reliness-code-utilities/mcp-code-utilities#chg-chg_01a1ca14-b2cf-7e0d-9f6d-34bf6e54542e"},{"id":"chg_01a1bfd9-7b46-7d4b-bf32-1a02df0fb022","kind":"score.total_changed","summary":"Trust score (69 → 70)","materiality":"functional","direction":"improvement","scoreDelta":1,"occurredOn":"2026-11-09","url":"https://verifymcp.io/servers/uk-co-reliness-code-utilities/mcp-code-utilities#chg-chg_01a1bfd9-7b46-7d4b-bf32-1a02df0fb022"},{"id":"chg_01a1babf-acbf-7c49-a34e-1e4354faf0ec","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-code-utilities/mcp-code-utilities#chg-chg_01a1babf-acbf-7c49-a34e-1e4354faf0ec"},{"id":"chg_01a1b618-b6ec-756f-8188-2267b1841cd6","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-code-utilities/mcp-code-utilities#chg-chg_01a1b618-b6ec-756f-8188-2267b1841cd6"}],"truncated":false,"feedUrl":"https://verifymcp.io/servers/uk-co-reliness-code-utilities/mcp-code-utilities/changelog.json"},"links":{"html":"https://verifymcp.io/servers/uk-co-reliness-code-utilities/mcp-code-utilities","markdown":"https://verifymcp.io/servers/uk-co-reliness-code-utilities/mcp-code-utilities.md","changelogJson":"https://verifymcp.io/servers/uk-co-reliness-code-utilities/mcp-code-utilities/changelog.json","changelogRss":"https://verifymcp.io/servers/uk-co-reliness-code-utilities/mcp-code-utilities.xml","external":[{"label":"Remote endpoint","href":"https://ukdata.reliness.co.uk/mcp/code-utilities"},{"label":"Website","href":"https://ukdata.reliness.co.uk/"}]}}