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 分

    請在儲存庫或註冊中心條目中宣告授權條款。