I, Pencil verification

xyz.sotapop由 sotapop.xyz 发布v1.1.0更新于 Oct 30, 2026

检查 Proof of Process 链:记录、文件匹配、时间戳、注册表。绝不只凭单一结论。

AI 翻译由 AI 模型根据下方的原文描述翻译,可能有误。

原文描述

Check Proof of Process chains: record, file match, timestamps, registry. Never one verdict.

已验证STDIO仅桌面

概览

I, Pencil verification 的本地 MCP 服务,由 sotapop.xyz 发布;无需登录;STDIO;3 个工具。

暂无 AI 概览:以下信息来自注册中心条目和服务本身。

发布者
sotapop.xyz

安装

在 SourceWeft 中

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

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

工具

3

verify_proof

Verify an I, Pencil proof

Verify an I, Pencil (ipencil-chain) process proof and, optionally, check a file against it. Returns the ipencil-verification/1 result plus `statements`: one pre-scoped sentence per question. There is deliberately NO single valid/invalid verdict — the result answers four separate questions (record unaltered, file matches, time established, authorship) with different strengths of evidence. When reporting to a person, quote the statements rather than summarising them as 'verified'. Offline by default; set checkRegistry to also confirm the proof's registration on Base.

输入参数proofnetworkfilePathfilePhashproofPathcheckRegistry

check_registration

Check a chain head on the registry

Look up whether a chain head (64 hex chars, the `chain` of a proof's last checkpoint) was published to the I, Pencil registry on Base. With a pointer (the transaction hash a proof carries) this is one exact check at any age. Without one it searches recent blocks only, and a miss means 'not found in the blocks searched', never 'not registered'. A registration records publication by an address, not ownership or authorship.

输入参数txHashnetworkchainHead必填maxRequests

find_registrations_by_phash

Find registrations by image fingerprint

Reverse lookup: given only an image's 64-bit perceptual hash (16 hex chars), find registry entries whose final fingerprint is EXACTLY that value. Searches recent blocks only (no index exists yet), so a miss is not evidence of absence, and a resized or re-compressed copy may have a slightly different hash and not match. Returns every match: 64-bit hashes can collide, so several works may share one. A match locates a published chain head; obtain and verify that proof before drawing any conclusion.

输入参数phash必填networkmaxRequests

版本历史

2
  1. v1.1.0最新Oct 23, 2026
  2. v1.0.1Oct 19, 2026

评分

已满足适用检查项的 55%

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

  • 近 30 天内可连通25 分
  • 已声明认证方式10 分

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

  • 已列出工具必需15 分
  • 描述必需15 分
  • 图标10 分

    请在注册中心条目中发布图标。

  • 文档15 分

    请声明包含 README 的 GitHub 仓库,或在 OAuth 受保护资源元数据中提供 resource_documentation。

  • 许可证10 分

    请在仓库或注册中心条目中声明许可证。