{"protocol":"mcp","protocolVersion":"2025-06-18","transport":"http-jsonrpc","endpoint":"https://datenvertrag.halowerk.com/mcp","server":{"name":"datenvertragswerk","title":"HALOWERK datenvertragswerk","version":"1.0.0"},"methods":["initialize","ping","tools/list","tools/call"],"tools":[{"name":"scd2_validity_ledger","title":"Check a bounded corrected dimension history before a data agent publishes it.","price_usdc":0.003},{"name":"delta_dv_replacement_precondition","title":"Check the two named atomic logical-file replacement preconditions before a data writer proposes a new deletion-vector identity for an existing physical file.","price_usdc":0.003},{"name":"merge_match_action_agreement","title":"Audit whether pre-resolved source actions for the same physical MERGE target row satisfy documented action-agreement conditions,or contain a provable UPDATE/DELETE or unequal-UPDATE conflict,before warehouse loading.","price_usdc":0.003},{"name":"unmatched_component_retraction_ledger","title":"Audit the signed retraction/restoration ledger of structurally unmatched left tuples when supplied left/right bag changes cross the zero-match boundary, before applying a materialized-view delta.","price_usdc":0.003},{"name":"reader_row_lineage_audit","title":"Audit row-lineage reader claims through manifest/file/row inheritance and explicit-value gates.","price_usdc":0.003},{"name":"minimum_palindromic_factorization_audit","title":"Find minimum nonoverlapping whole-word palindrome chunks, count all optimum cuts and return canonical full factorization.","price_usdc":0.003},{"name":"gaussian-euclidean-trace-audit","title":"Reconstruct exact Gaussian-integer Euclidean trace and canonical Bezout certificate","price_usdc":0.003}],"payment":{"protocol":"x402","network":"eip155:8453","asset":"USDC","note":"tools/list braucht keine Zahlung. tools/call rechnet den Werkzeugpreis über x402 ab."}}