Five modes of ZK-based community chats around non-fungible tokens’ owners

We present Free-Delete, a censorship-resistant group-chat protocol whose membership is validated by non-fungible-token (NFT) ownership while user privacy ranges across five selectable modes. A single Groth16 circuit, anchored in a sparse Merkle tree of verifiable commitments, realises (i) Fully Anonymous messaging, (ii) Linkable Anonymous reputation building, (iii) Publicly Identified disclosure, (iv) Confidential end-to-end encryption, and (v) Rate-Limited Accountability that revokes keys on spam—all without moderator involvement or economic deposits. A black-paper prototype written in TypeScript, Circom 2, and Solidity achieves 0.35 s for register and 1.38 s for postMessage on consumer hardware; on-chain verification costs 3–5.5×105 gas per proof on Polygon. These results demonstrate that NFT-gated, stake-free, privacy-preserving communication can be deployed today on any EVM chain.

Authors

Publication Details

Published
2025-07-26
DOI
https://doi.org/10.5121/csit.2025.151417
Primary Topic
Context-Aware Activity Recognition Systems
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Five modes of ZK-based community chats around non-fungible tokens’ owners

Victor Dubinin, Oleksandr Kurbatov, Yaroslav Panasenko, Yevhen Hrubiian
Context-Aware Activity Recognition Systems
article

Five modes of ZK-based community chats around non-fungible tokens’ owners

Victor Dubinin, Oleksandr Kurbatov, Yaroslav Panasenko, Yevhen Hrubiian
article en

Abstract

We present Free-Delete, a censorship-resistant group-chat protocol whose membership is validated by non-fungible-token (NFT) ownership while user privacy ranges across five selectable modes. A single Groth16 circuit, anchored in a sparse Merkle tree of verifiable commitments, realises (i) Fully Anonymous messaging, (ii) Linkable Anonymous reputation building, (iii) Publicly Identified disclosure, (iv) Confidential end-to-end encryption, and (v) Rate-Limited Accountability that revokes keys on spam—all without moderator involvement or economic deposits. A black-paper prototype written in TypeScript, Circom 2, and Solidity achieves 0.35 s for register and 1.38 s for postMessage on consumer hardware; on-chain verification costs 3–5.5×105 gas per proof on Polygon. These results demonstrate that NFT-gated, stake-free, privacy-preserving communication can be deployed today on any EVM chain.

Openalex Percentile: Top 83%
Context-Aware Activity Recognition Systems
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.