Ofac Match

io.github.krunalsolanki由 GitHub 账号 krunalsolanki 发布v2.0.0更新于 Nov 5, 2026

Explainable OFAC sanctions name screening against the SDN list. Runs locally, no API key.

发布方自己的服务:match.bot

已验证STDIO仅桌面金融安全与监控

概览

AI 生成的概览

本地运行的 MCP 服务器,用 OFAC SDN 制裁名单筛查姓名,并解释每个匹配分数的由来。

可以做什么
  • 对单个姓名或一批姓名进行 SDN 名单筛查,给出 0 到 100 的相似度分数
  • 查询某条制裁记录的别名、项目与登记信息
  • 比较两个姓名,说明各部分如何配对以及分数依据
  • 报告当前加载的制裁名单版本信息
适用场景
适合让助手协助制裁或合规姓名筛查,且需要为每个命中给出理由的场景;也适合希望筛查完全在本机完成、不使用 API 密钥的用户。
运行要求
作为本地进程在桌面端运行。可通过 .NET 包或 Claude Desktop 扩展安装;Claude Code 插件与 dnx 命令需要 .NET 10 SDK。需要联网下载公开的 SDN 名单,名单会缓存在本地。可选环境变量 OFACMATCH_DATA_DIR 与 OFACMATCH_REFRESH_HOURS 用于设置数据目录和刷新间隔。无需 API 密钥。
安装前请注意
分数只表示两个姓名写法上的相似程度,并不代表是同一个人;作者声明它不替用户做合规决定,也不构成法律意见,每个潜在匹配都应由人工复核。名单更新频繁,应至少每天重新加载。仅凭姓名筛查会产生大量误报,阈值越低越多。姓名在本机处理,唯一的网络请求是下载 SDN 名单。

安装

在 SourceWeft 中

  1. 打开 控制台中的 Ofac Match,将其添加到工作区。
  2. 为需要使用其工具的对话启用该服务。

Desktop only,通过 STDIO。 STDIO 服务会启动本地进程,因此需要 SourceWeft 桌面宿主。

其他 MCP 客户端

参照 仓库 中的启动说明。

README

OfacMatch

[Software DOI] [Paper DOI]

OFAC sanctions name screening for .NET that tells you why a name matched.

[OfacMatch screening a misspelled name, flagging a birth-year conflict and clearing a common name]

Try it in your browser: no install, and the names you type never leave your browser.

Why I built this

I spent ten years building title and mortgage systems at First American, including OFAC screening that stops a loan from going to someone on the Treasury's sanctions list. Name matching sounds simple until a compliance analyst asks why a name was flagged, or why a misspelled one wasn't.

Many teams still search OFAC's website by hand or rely on screening logic they can't see inside. I wanted something small and open: load the official list, score names the way OFAC describes in its own FAQ, and show the reasoning behind every score.

What it does

OfacMatch downloads the Specially Designated Nationals (SDN) list from OFAC, screens names against it, and gives each potential match a score from 0 to 100, the same scale OFAC's search tool uses. Every match comes with an explanation: which name or alias it hit, and how each part of the name paired up.

It handles the messy parts of real names: accents, LAST, First ordering, apostrophes and hyphens, titles like "Dr.", company endings like LLC or LTD (even misspelled), and aliases. If you pass a year of birth or country that disagrees with the listed record, the match is flagged rather than hidden, because that call belongs to a person.

It has no dependencies, runs inside your own process (names never leave your systems), and works on modern .NET as well as .NET Framework 4.7.2+.

I measured it on the real list rather than guessing, on names it was never tuned on: at a threshold of 85 it finds all 4,235 realistic variations of listed names in a held-out test, and 99.6% of 2,160 harder ones such as a wrong first letter, a nickname or an extra middle name. It is also compared with eight standard name-matching methods. The results below have the details, including where a simpler method does better.

Version 2.0 changes how a searched name with extra parts is scored; see the changelog. Feedback, bug reports and name variations that score badly are very welcome.

OfacMatch helps you screen; it doesn't make compliance decisions and isn't legal advice. A score says how alike two names are written, not whether two records are the same person. Pick your threshold from your own risk assessment and have someone review every potential match. More in Using OfacMatch responsibly.

Quick start

bash
dotnet add package OfacMatch
csharp
using OfacMatch.Data;using OfacMatch.Screening;
using var http = new HttpClient();var list = await SanctionsList.DownloadAsync(http, saveToDirectory: "ofac-data");
var screener = new SanctionsScreener(list, new ScreeningOptions { MinScore = 85 });
foreach (var match in screener.Screen("Aymen Zawahri")){    Console.WriteLine(match.Explain());}

Output against the SDN list published 27 October 2026:

text
Score 95.8 via NameParts against Primary name "AL ZAWAHIRI, Dr. Ayman"  Entry 2676: AL ZAWAHIRI, Dr. Ayman (Individual; programs: SDGT)  Full-name score 84.5; name-parts score 95.8  AYMEN -> AYMAN: similarity 0.907, sounds alike  ZAWAHRI -> ZAWAHIRI: similarity 0.946, sounds alike

How scoring works walks through this example step by step.

Screening with more context

csharp
var request = new ScreeningRequest("John Michael Doe"){    Type = EntryType.Individual, // a borrower is a person, so skip companies and vessels    YearOfBirth = 1971,          // flags matches whose listed dates of birth disagree    Country = "United States",   // flags matches whose listed addresses are all elsewhere};
var matches = screener.Screen(request);

Offline use

csharp
var list = SanctionsList.LoadFromDirectory("ofac-data"); // SDN.CSV, ALT.CSV, ADD.CSV

OFAC updates the list often. Reload it at least daily, and screen against the current list before every decision.

Use it from an AI assistant (MCP server)

OfacMatch.Mcp lets Claude, GitHub Copilot and other MCP clients screen names, look up SDN entries and explain scores. It runs locally and needs no API key.

Claude Desktop: download the extension for your computer from the latest release (ofac-match-windows.mcpb or ofac-match-mac-*.mcpb) and double-click it. No .NET or config file needed.

Claude Code plugin (adds the server plus a skill for reporting results responsibly; needs the .NET 10 SDK):

/plugin install ofac-match --marketplace krunalsolanki/ofac-match

Claude Code and other clients (needs the .NET 10 SDK):

bash
claude mcp add ofac-match -- dnx OfacMatch.Mcp --yes

Tools: screen_name, screen_names, get_sanctions_entry, compare_names, get_list_info. See the MCP server guide for other clients and settings.

Command line

bash
dotnet run --project samples/OfacMatch.Cli -- "Aymen Zawahri" --min 85 --yob 1951

Results on the real SDN list

OfacMatch was improved on a development set of names, then frozen and tested once on a separate held-out set: 600 other listed parties (400 individuals, 200 companies) and 3,000 ordinary names from a vocabulary never used during development, against the SDN list published 27 October 2026. The evaluation protocol explains the rules.

ThresholdVariations found (4,235)Harder variations found (2,160)Two-part ordinary names that alertThree-part ordinary names that alert
80100.0%99.9%75.7%51.0%
85100.0%99.6%37.5%10.3%
90100.0%98.4%10.2%2.2%
9599.6%83.4%2.1%0.0%
  • Variations: exact, surname first, lower case without punctuation, one wrong letter, two letters swapped, one letter missing, different transliteration, joined particles ("ALZAWAHIRI"), middle name left out, and changed company suffix.
  • Harder variations: wrong first letter ("Qassim" for "Kassim"), two wrong letters, a nickname or the same name in another language ("Sasha" for "Aleksandr"), first name as an initial, and an extra middle name that is not on the list.

Compared with other methods. The same cases were screened with eight standard methods, including Levenshtein, Jaro-Winkler, RapidFuzz-style token ratios and trigram TF-IDF (full comparison). To compare them fairly, each method gets the threshold at which the same share of ordinary names alerts. The strongest simple method, a token set ratio, found slightly more of the harder variations than OfacMatch (98.9% against 96.7% when 5% of ordinary names alert). OfacMatch raised clearly fewer alerts on names that share a first name with a listed person, such as "Ayman Smith" (11.9% against 16.4%), and it explains every score. For a review team, fewer alerts and a reason for each one is usually worth more than the last two points of recall, but that trade-off is yours to make.

Three things stand out in these numbers. Screening on a name alone alerts a lot: at 85, more than a third of ordinary two-part names look like something on the list. Date of birth and country are what let a reviewer clear those quickly. Moving the threshold from 85 to 90 cut those alerts by about three quarters while still finding every variation and 98.4% of the harder ones, so the threshold deserves a deliberate choice rather than a default. And since 2.0, a listed two-part name inside a longer searched name scores high, so three-part names alert more often at 85 than in 0.1.2 (10.3% against 3.3%).

You can re-run it yourself on the development set:

bash
dotnet run -c Release --project eval/OfacMatch.Evaluation -- --data ofac-data --out docs/evaluation.mddotnet run -c Release --project eval/OfacMatch.Evaluation -- --data ofac-data --baselines --out docs/baselines.md

Documentation

GuideWhat it covers
Why OfacMatchBenefits and comparison with other options
How scoring worksEvery step, with a worked example
API and configuration referenceTypes, options and defaults
Using OfacMatch responsiblyThresholds, review, record keeping, limits
Evaluation protocolHow the development and held-out sets are kept apart, and how settings were chosen
Held-out results and comparisonResults on names never used during development, and against eight standard methods
Development results, comparison and tuningThe set used while improving the method
MCP serverUsing OfacMatch from AI assistants

What's next

Things I'd like to work on, roughly in order:

  • Evaluation on the real list
  • Comparison with standard methods, and a held-out test
  • Extra middle names in the search (2.0)
  • Nicknames and equivalent names (Sasha, Aleksandr), from an independent source so they can be tested fairly
  • Give rare words more weight ("CUBA" should count more than "BANK"), to cut alerts on common names
  • Catch typos at the start of company endings ("LTMITED")
  • Support OFAC's Consolidated (non-SDN) list and the Advanced XML format
  • Faster batch screening
  • An ASP.NET Core sample and a dotnet tool package

If you'd like to help with any of these, or have a case that scores badly, open an issue. CONTRIBUTING.md has the details.

Citation

If you use OfacMatch in research or a write-up, please cite the paper:

Solanki, K. (2026). Explainable Name Screening Against the OFAC SDN List: An Open Implementation and Reproducible Evaluation (preprint). Zenodo. https://doi.org/10.5281/zenodo.23930926

bibtex
@misc{solanki2026ofacmatch,  author    = {Solanki, Krunal},  title     = {Explainable Name Screening Against the {OFAC} {SDN} List: An Open Implementation and Reproducible Evaluation},  year      = {2026},  publisher = {Zenodo},  note      = {Preprint},  doi       = {10.5281/zenodo.23930926},  url       = {https://doi.org/10.5281/zenodo.23930926}}

To cite the software itself:

Solanki, K. OfacMatch: explainable OFAC sanctions name screening (software). Zenodo. https://doi.org/10.5281/zenodo.23926803

Both DOIs always point to the latest version; each version also has its own DOI on Zenodo. GitHub's Cite this repository button gives the paper citation in other formats.

Credits

Built by Krunal Solanki. The idea and the compliance background come from my work on OFAC screening in mortgage lending.

Privacy Policy

OfacMatch collects nothing. Names you screen are processed on your own computer, or in your browser for the web page, and are never sent anywhere. The only network request is the download of the public SDN list from OFAC, which is cached locally. Full details: PRIVACY.md.

Data

The SDN list is published by the U.S. Department of the Treasury's Office of Foreign Assets Control. OfacMatch downloads it from OFAC's Sanctions List Service and does not redistribute it. The unit tests use fictional names only.

License

Apache License 2.0

来源:README.md,提交 45bf4db

工具

0
SourceWeft 曾在隔离沙箱中以无凭据方式启动该软件包一次,以列出其工具,但未能完成:该软件包类型无法在沙箱中运行。

版本历史

3
  1. v2.0.0最新Nov 5, 2026
  2. v0.1.2Nov 3, 2026
  3. v0.1.0Nov 3, 2026

评分

已满足适用检查项的 50%

该评分衡量此收录条目的完整程度,依据注册中心条目、端点与公开来源计算得出。它不是对服务器本身的评价,也不表示服务器安全或当前可用:可连通性是带日期的检查结果,评分也不包含安装量或用户评价。

  • 近 30 天内可连通25 分

    请保持端点能够响应 MCP 握手;SourceWeft 每 30 天探测一次。

  • 已声明认证方式10 分

    请在注册中心条目中声明凭据请求头,或保持端点能够响应探测,以便判定其认证方式。

  • 已列出工具15 分

    请让服务器在无凭据时响应 tools/list,或发布可在沙箱中无凭据启动的软件包。

  • 描述必需15 分
  • 图标10 分
  • 文档15 分
  • 许可证10 分

其他 Match 集成