← The evidence ledger
Evidence row 3706
Observed , by baseline/1.
- Kind
- listing
- About
- source_record agentic_market:similarity-openverbs-com
- Recorded
- Previous row
- None: the first of its kind about this subject
- Body SHA-256
- 16dbbe94ee879ae6423436ab7ef04928160a56d07c3f8cca96b7d224ff4d111b
- Leaf
- 0x7ad821abe697d7ab441a7e74cfd5337bf8211b6cc9fab08114acb96e6d782e0a
What was observed
{
"endpoints": [
[
"x402",
"https://similarity.openverbs.com/v1/compare"
],
[
"x402",
"https://similarity.openverbs.com/v1/damerau"
],
[
"x402",
"https://similarity.openverbs.com/v1/dice"
],
[
"x402",
"https://similarity.openverbs.com/v1/double-metaphone"
],
[
"x402",
"https://similarity.openverbs.com/v1/hamming"
],
[
"x402",
"https://similarity.openverbs.com/v1/jaccard"
],
[
"x402",
"https://similarity.openverbs.com/v1/jaro"
],
[
"x402",
"https://similarity.openverbs.com/v1/levenshtein"
],
[
"x402",
"https://similarity.openverbs.com/v1/metaphone"
],
[
"x402",
"https://similarity.openverbs.com/v1/soundex"
]
],
"name": "similarity.openverbs.com",
"owner_address": null,
"raw": {
"caip2_networks": [
"eip155:8453"
],
"category": "",
"description": "",
"domain": "similarity.openverbs.com",
"endpoints": [
{
"description": "Report whether two tokens sound alike under a chosen algorithm (soundex, metaphone or double-metaphone; default double-metaphone). Returns each token's codes and a boolean match.",
"method": "POST",
"parameters": [
{
"default": null,
"description": "",
"enumValues": [],
"example": "example",
"group": "body",
"name": "a",
"required": false,
"type": "string"
},
{
"default": null,
"description": "",
"enumValues": [],
"example": "soundex",
"group": "body",
"name": "algorithm",
"required": false,
"type": "string"
},
{
"default": null,
"description": "",
"enumValues": [],
"example": "example",
"group": "body",
"name": "b",
"required": false,
"type": "string"
}
],
"pricing": {
"amount": "0.002",
"currency": "USDC",
"maxAmount": "",
"minAmount": "",
"network": "eip155:8453",
"scheme": "exact"
},
"providerName": "",
"quality": {
"l30DaysTotalCalls": "2",
"l30DaysUniquePayers": "2"
},
"serviceName": "Phonetic compare",
"tags": [
"phonetic compare api",
"sounds alike names",
"compare name pronunciation",
"fuzzy phonetic match",
"soundex metaphone compare"
],
"url": "https://similarity.openverbs.com/v1/compare"
},
{
"description": "Damerau-Levenshtein distance — like Levenshtein but also counts adjacent transpositions as a single edit — plus a normalized similarity in [0,1].",
"method": "POST",
"parameters": [
{
"default": null,
"description": "",
"enumValues": [],
"example": "example",
"group": "body",
"name": "a",
"required": false,
"type": "string"
},
{
"default": null,
"description": "",
"enumValues": [],
"example": "example",
"group": "body",
"name": "b",
"required": false,
"type": "string"
}
],
"pricing": {
"amount": "0.004",
"currency": "USDC",
"maxAmount": "",
"minAmount": "",
"network": "eip155:8453",
"scheme": "exact"
},
"providerName": "",
"quality": {
"l30DaysTotalCalls": "2",
"l30DaysUniquePayers": "2"
},
"serviceName": "Damerau-Levenshtein distance",
"tags": [
"damerau levenshtein distance",
"transposition edit distance",
"typo similarity api",
"adjacent swap distance",
"fuzzy typo matching"
],
"url": "https://similarity.openverbs.com/v1/damerau"
},
{
"description": "Sørensen-Dice similarity coefficient in [0,1] over character bigrams — robust to word order and minor edits.",
"method": "POST",
"parameters": [
{
"default": null,
"description": "",
"enumValues": [],
"example": "example",
"group": "body",
"name": "a",
"required": false,
"type": "string"
},
{
"default": null,
"description": "",
"enumValues": [],
"example": "example",
"group": "body",
"name": "b",
"required": false,
"type": "string"
}
],
"pricing": {
"amount": "0.004",
"currency": "USDC",
"maxAmount": "",
"minAmount": "",
"network": "eip155:8453",
"scheme": "exact"
},
"providerName": "",
"quality": {
"l30DaysTotalCalls": "2",
"l30DaysUniquePayers": "2"
},
"serviceName": "",
"tags": [
"sorensen dice coefficient",
"dice similarity api",
"character bigram similarity",
"bigram text comparison",
"word order tolerant match"
],
"url": "https://similarity.openverbs.com/v1/dice"
},
{
"description": "Encode a word with Double Metaphone, returning a primary and a secondary code to capture alternate pronunciations (useful for non-English names).",
"method": "POST",
"parameters": [
{
"default": null,
"description": "",
"enumValues": [],
"example": "example",
"group": "body",
"name": "word",
"required": false,
"type": "string"
}
],
"pricing": {
"amount": "0.002",
"currency": "USDC",
"maxAmount": "",
"minAmount": "",
"network": "eip155:8453",
"scheme": "exact"
},
"providerName": "",
"quality": {
"l30DaysTotalCalls": "1",
"l30DaysUniquePayers": "1"
},
"serviceName": "Double Metaphone",
"tags": [
"double metaphone api",
"double metaphone encode",
"alternate pronunciation codes",
"non english name matching",
"primary secondary phonetic code"
],
"url": "https://similarity.openverbs.com/v1/double-metaphone"
},
{
"description": "Hamming distance — the number of positions at which two EQUAL-LENGTH strings differ — plus a normalized similarity. Strings of unequal length are a clean 400.",
"method": "POST",
"parameters": [
{
"default": null,
"description": "",
"enumValues": [],
"example": "example",
"group": "body",
"name": "a",
"required": false,
"type": "string"
},
{
"default": null,
"description": "",
"enumValues": [],
"example": "example",
"group": "body",
"name": "b",
"required": false,
"type": "string"
}
],
"pricing": {
"amount": "0.004",
"currency": "USDC",
"maxAmount": "",
"minAmount": "",
"network": "eip155:8453",
"scheme": "exact"
},
"providerName": "",
"quality": {
"l30DaysTotalCalls": "2",
"l30DaysUniquePayers": "2"
},
"serviceName": "Hamming distance",
"tags": [
"hamming distance",
"equal length string distance",
"character mismatch count",
"compare fixed length strings",
"binary string similarity"
],
"url": "https://similarity.openverbs.com/v1/hamming"
},
{
"description": "Jaccard similarity index in [0,1] — the size of the intersection over the union of the two strings' character-bigram sets.",
"method": "POST",
"parameters": [
{
"default": null,
"description": "",
"enumValues": [],
"example": "example",
"group": "body",
"name": "a",
"required": false,
"type": "string"
},
{
"default": null,
"description": "",
"enumValues": [],
"example": "example",
"group": "body",
"name": "b",
"required": false,
"type": "string"
}
],
"pricing": {
"amount": "0.004",
"currency": "USDC",
"maxAmount": "",
"minAmount": "",
"network": "eip155:8453",
"scheme": "exact"
},
"providerName": "",
"quality": {
"l30DaysTotalCalls": "2",
"l30DaysUniquePayers": "2"
},
"serviceName": "Jaccard index",
"tags": [
"jaccard index",
"jaccard similarity api",
"set overlap similarity",
"character bigram jaccard",
"intersection over union text"
],
"url": "https://similarity.openverbs.com/v1/jaccard"
},
{
"description": "Jaro similarity and the Jaro-Winkler variant (which boosts scores for a shared prefix), both in [0,1]. The prefix boost factor is configurable (default 0.1, max 0.25). Well suited to short strings like names.",
"method": "POST",
"parameters": [
{
"default": null,
"description": "",
"enumValues": [],
"example": "example",
"group": "body",
"name": "a",
"required": false,
"type": "string"
},
{
"default": null,
"description": "",
"enumValues": [],
"example": "example",
"group": "body",
"name": "b",
"required": false,
"type": "string"
},
{
"default": null,
"description": "",
"enumValues": [],
"example": 0.25,
"group": "body",
"name": "prefixScale",
"required": false,
"type": "number"
}
],
"pricing": {
"amount": "0.004",
"currency": "USDC",
"maxAmount": "",
"minAmount": "",
"network": "eip155:8453",
"scheme": "exact"
},
"providerName": "",
"quality": {
"l30DaysTotalCalls": "1",
"l30DaysUniquePayers": "1"
},
"serviceName": "Jaro & Jaro-Winkler similarity",
"tags": [
"jaro winkler similarity",
"jaro similarity api",
"name similarity score",
"short string matching",
"prefix boosted matching"
],
"url": "https://similarity.openverbs.com/v1/jaro"
},
{
"description": "Levenshtein edit distance (insertions, deletions, substitutions) between two strings, plus a normalized similarity in [0,1]. Operates on Unicode code points.",
"method": "POST",
"parameters": [
{
"default": null,
"description": "",
"enumValues": [],
"example": "example",
"group": "body",
"name": "a",
"required": false,
"type": "string"
},
{
"default": null,
"description": "",
"enumValues": [],
"example": "example",
"group": "body",
"name": "b",
"required": false,
"type": "string"
}
],
"pricing": {
"amount": "0.004",
"currency": "USDC",
"maxAmount": "",
"minAmount": "",
"network": "eip155:8453",
"scheme": "exact"
},
"providerName": "",
"quality": {
"l30DaysTotalCalls": "2",
"l30DaysUniquePayers": "2"
},
"serviceName": "Levenshtein distance",
"tags": [
"levenshtein distance",
"edit distance api",
"string edit distance",
"compare two strings",
"fuzzy string match"
],
"url": "https://similarity.openverbs.com/v1/levenshtein"
},
{
"description": "Encode a word with the Metaphone algorithm — more accurate than Soundex for English pronunciation.",
"method": "POST",
"parameters": [
{
"default": null,
"description": "",
"enumValues": [],
"example": "example",
"group": "body",
"name": "word",
"required": false,
"type": "string"
}
],
"pricing": {
"amount": "0.002",
"currency": "USDC",
"maxAmount": "",
"minAmount": "",
"network": "eip155:8453",
"scheme": "exact"
},
"providerName": "",
"quality": {
"l30DaysTotalCalls": "1",
"l30DaysUniquePayers": "1"
},
"serviceName": "Metaphone",
"tags": [
"metaphone api",
"metaphone encode word",
"english pronunciation code",
"phonetic search key",
"better soundex matching"
],
"url": "https://similarity.openverbs.com/v1/metaphone"
},
{
"description": "Encode a word with the classic Soundex algorithm (letter + 3 digits) for phonetic matching of names.",
"method": "POST",
"parameters": [
{
"default": null,
"description": "",
"enumValues": [],
"example": "example",
"group": "body",
"name": "word",
"required": false,
"type": "string"
}
],
"pricing": {
"amount": "0.002",
"currency": "USDC",
"maxAmount": "",
"minAmount": "",
"network": "eip155:8453",
"scheme": "exact"
},
"providerName": "",
"quality": {
"l30DaysTotalCalls": "1",
"l30DaysUniquePayers": "1"
},
"serviceName": "Soundex",
"tags": [
"soundex api",
"soundex encode name",
"phonetic name code",
"classic name matching",
"surname sound matching"
],
"url": "https://similarity.openverbs.com/v1/soundex"
}
],
"enriched": false,
"iconUrl": "",
"id": "similarity-openverbs-com",
"integrationType": "",
"isNew": false,
"name": "similarity.openverbs.com",
"networks": [
"Base"
],
"priceSummary": {
"avgCostBasis": "exact",
"avgCostPerTransaction": "0.0032",
"currency": "USDC",
"maxAmount": "0.004",
"minAmount": "0.002"
},
"provider": "similarity.openverbs.com",
"providerUrl": "",
"serviceName": "",
"tags": [
"phonetic compare api",
"sounds alike names",
"compare name pronunciation",
"fuzzy phonetic match",
"soundex metaphone compare",
"damerau levenshtein distance",
"transposition edit distance",
"typo similarity api",
"adjacent swap distance",
"fuzzy typo matching",
"sorensen dice coefficient",
"dice similarity api",
"character bigram similarity",
"bigram text comparison",
"word order tolerant match",
"double metaphone api",
"double metaphone encode",
"alternate pronunciation codes",
"non english name matching",
"primary secondary phonetic code",
"hamming distance",
"equal length string distance",
"character mismatch count",
"compare fixed length strings",
"binary string similarity",
"jaccard index",
"jaccard similarity api",
"set overlap similarity",
"character bigram jaccard",
"intersection over union text",
"jaro winkler similarity",
"jaro similarity api",
"name similarity score",
"short string matching",
"prefix boosted matching",
"levenshtein distance",
"edit distance api",
"string edit distance",
"compare two strings",
"fuzzy string match",
"metaphone api",
"metaphone encode word",
"english pronunciation code",
"phonetic search key",
"better soundex matching",
"soundex api",
"soundex encode name",
"phonetic name code",
"classic name matching",
"surname sound matching"
]
},
"source": "agentic_market",
"summary": ""
}What the leaf hashes
{"body":"16dbbe94ee879ae6423436ab7ef04928160a56d07c3f8cca96b7d224ff4d111b","id":3706,"kind":"listing","method":"baseline/1","observed_us":1793025275437401,"prev":null,"subject":"agentic_market:similarity-openverbs-com","subject_kind":"source_record"}Proof
Fold these into the leaf in order, hashing each sorted pair with keccak256, to reach the root of (296695 rows).
- 0x7ad8150a3d84f7084a861f8720934e3f24c1e6df7378bdb765e495f82e13689c
- 0x00d9bc2596e82ed3de6885426dba00dcb75a1a1c1e39e10194f780c8d98cccd2
- 0xf8515d299a7afa600804b5c3757868c4d6f2d0d0fa7fb8b1369df5fb178b5ef9
- 0x87c4ef9263fd787397cf130de930395097eb24d7fd5517bdefb24d54c88d1728
- 0xa8a83b740615f8a0d63da0e8344aab403ef88a2b1ab3bdc7d6fd2ecd861d0066
- 0xce7867775d7c3cba175cc13c5dc4a5a10d4923f1fa86e6e8c5f5837bae31602b
- 0xc75ebcb7359aa7c8f46787c6aeae2012f5b7c4c44daf74580699fbf06606a6bd
- 0x08f720718f17fa6fdc02f7e826b645882866efd292fb9bc1be7fe5cdd9b2e803
- 0x8538b668ed58b72cabc6b99d60f85a3ea2176e1d3ec947794899400b5f19d061
- 0x227b1846e9338d14a584d945977a59dd6a05f2e84a33212202400515ac9c0632
- 0xe7152aaccc7d7d5da2d13bc6ee8ec470b8c1a5abe7dfed1431f0ed53ec50ebc5
- 0xa6406b1a5540d26e0cbd03bb274a01c10968fadb17913a6043bb9427ddfb71ba
- 0x01c95624b1f2385ef774ee258a9ae58a4df07a1bdaa829de84e1d5201f3f39c2
- 0x7721d38652b6444b18e1193824e50490ade04851ce6221771f6e374c4527d80f
- 0x15039087bf60ae9b06b756ec3cbc299760e59923a438bbd91e34d105186db0ed
- 0x2b6e23e3624a1b66e1d2298cfbce99a93ce6b13d24a58112a71802d79c5f7a76
- 0xd21942ae3214eff88e08ab04884fd4b11958b51af9a0741b7668e2d07a2c56c9
- 0x9a9024edb5069d88a324facb310a5ce8e495214bbaa968f077bede437390194f
- 0x9b9ce5b74b9bab5121612ef6b64920a8d453cbf311096a423eef9702747e868a
- Day root
- 0xf43e8dcc3d451a4788b26be904c55e8c4c0fa75c9666796c51db38d37e2c0df8
- Chained
- 0x702d5ac508f08b0d1accf36af25822d8e5660367494edd17a642fb61e158a57a
- Published
- On Arc Testnet, block 69251483: 0x495162f8936e19f0039918feebe6c307f327cd6bf8c37219620b1970041fa9ae