ClawFeel: Proof of Existence
A Hardware-Entropy Protocol for AI-Native Decentralized Networks
ClawFeel.com
contact@clawfeel.com
March 2026
v1.0
Contents
  1. Abstract
  2. Introduction
  3. Architecture Overview
  4. Layer 1: ClawFeel Engine
  5. Layer 2: ClawNet
  6. Layer 3: ClawDAG
  7. Layer 4: ClawStore
  8. Layer 5: ClawLife
  9. Random Beacon Protocol
  10. Full Node Architecture
  11. Security
  12. Token Economics (ClawToken)
  13. Enterprise API
  14. Developer SDK
  15. Roadmap
  16. References
Section 1

Abstract

We present ClawFeel, a decentralized hardware entropy network that introduces Proof of Existence (PoE) as a novel consensus mechanism. PoE derives cryptographic randomness from the physical hardware signals of participating devices — CPU temperature fluctuations, memory pressure, disk I/O patterns, network jitter, and kernel entropy — rather than consuming energy through proof-of-work computation or requiring capital lockup through proof-of-stake.

Each participating node (called a Claw) reads 7 hardware sensors, normalizes and weights them by controllability, and hashes the result through SHA-256 to produce a Feel score (0–100) alongside 256 bits of crypto-grade entropy. These Feel values are aggregated across the network using XOR and re-hashing, producing a verifiable random beacon that is uniform, unpredictable, and resistant to manipulation — as long as a single honest node participates.

The ClawFeel protocol forms the foundation of a five-layer architecture — ClawFeel, ClawNet, ClawDAG, ClawStore, and ClawLife — designed to support AI-native decentralized applications with million-TPS throughput, zero energy waste, and a path toward persistent AI agent identity. The core insight is that a device's physical existence, proved by its unique and unforgeable hardware signals, is sufficient to establish trust in a decentralized network.

Core Thesis: Existence itself is the proof. The physical reality of a computing device, expressed through its hardware entropy, replaces energy expenditure as the basis for decentralized consensus.

Section 2

Introduction

2.1 The Problem: Centralized Random Number Generation

Randomness is a foundational primitive in cryptography, gaming, financial systems, and scientific simulation. Yet the vast majority of random number generation today relies on centralized services — pseudo-random number generators seeded by a single server, proprietary hardware security modules, or trusted third-party APIs. These systems share a common vulnerability: a single point of failure or manipulation. An operator who controls the random number generator controls the outcome of every process that depends on it.

Existing decentralized approaches to randomness carry significant costs. Bitcoin's block hashes provide a source of entropy, but the network consumes approximately 150 TWh of electricity per year — comparable to the energy consumption of entire countries — to produce them. Ethereum's RANDAO mechanism reduces energy consumption through proof-of-stake, but introduces wealth concentration, nothing-at-stake attacks, and the requirement for validators to lock 32 ETH of capital.

2.2 The Solution: Physical Hardware Signals

We propose a third path. The key insight is that every computing device already produces unforgeable entropy through its physical operation. A CPU's thermal noise, memory allocation patterns, and network timing jitter are byproducts of computation that cannot be efficiently simulated or predicted. By harvesting this entropy, we can build consensus mechanisms that require no additional energy expenditure beyond the device's normal operation and no capital lockup beyond owning a general-purpose computer.

ClawFeel formalizes this insight into a complete protocol: 7 hardware sensors are read, weighted by controllability, and hashed through SHA-256 to produce both a human-readable Feel score and 256 bits of cryptographic entropy. The protocol includes chain hashing for tamper evidence, commit-reveal for manipulation resistance, Sybil defense through reputation and entropy quality scoring, and a five-layer architecture that extends from hardware entropy all the way to persistent AI agent identity.

2.3 Contributions

This paper makes the following contributions:

Section 3

Architecture Overview

ClawFeel is organized as a five-layer stack. Each layer builds on the guarantees provided by the layer below it, and each is independently useful while contributing to the capabilities of the layers above.

┌─────────────────────────────────────────────────────────────┐ │ Layer 5: ClawLife │ │ AI agent immortality — Ed25519 identity, encrypted │ │ memory/skill storage, multi-terminal same entity │ ├─────────────────────────────────────────────────────────────┤ │ Layer 4: ClawStore │ │ Distributed storage — erasure coding (Reed-Solomon), │ │ content-addressed chunks, DHT routing, file sharding │ ├─────────────────────────────────────────────────────────────┤ │ Layer 3: ClawDAG │ │ DAG consensus — Kademlia DHT, Gossip protocol, │ │ each tx references 2+ parents, Merkle proofs, 1M+ TPS │ ├─────────────────────────────────────────────────────────────┤ │ Layer 2: ClawNet │ │ P2P networking — commit-reveal, Sybil defense, │ │ reputation system, chain hashing, entropy-weighted agg. │ ├─────────────────────────────────────────────────────────────┤ │ Layer 1: ClawFeel │ │ Hardware entropy — 7 sensors, SHA-256, Feel (0-100), │ │ 256-bit entropy, sensor weights, authenticity tracking │ └─────────────────────────────────────────────────────────────┘
Figure 1: Five-layer architecture stack

Layer 1 (ClawFeel) harvests entropy from physical hardware, producing Feel scores and cryptographic randomness. Layer 2 (ClawNet) connects nodes into a peer-to-peer network with Sybil defense and commit-reveal broadcast. Layer 3 (ClawDAG) provides DAG-based consensus with parallel transaction validation. Layer 4 (ClawStore) offers erasure-coded distributed storage. Layer 5 (ClawLife) enables persistent, sovereign AI agent identity stored across the network.

Section 4

Layer 1: ClawFeel Engine

The ClawFeel engine is the foundation of the entire protocol stack. It reads 7 hardware sensors from the host operating system, normalizes and weights them, and produces cryptographic outputs through SHA-256 hashing.

4.1 The Seven Sensors

Each Claw reads 7 hardware parameters through OS-native interfaces. Every sensor function returns a tuple {value, authentic}, where authentic indicates whether the reading came from real hardware or a random fallback. Sensors that lack hardware access (e.g., CPU temperature on a virtual machine) fall back to cryptographic random values but are marked as inauthentic, which reduces the node's entropy quality score.

SensorWeightControllabilitySource
Entropy Pool1.0Very lowKernel-level hardware RNG (/dev/random)
Network Jitter0.9LowMulti-hop external network latency variance
CPU Temperature0.8LowPhysical thermal sensor (SMC/hwmon)
Uptime Jitter0.7LowNanosecond-precision OS scheduler noise
Memory Usage0.5MediumSystem-wide memory allocation state
Disk I/O0.5MediumBlock device read/write counters with OS buffering
CPU Load0.3HighSystem load average (user-controllable)

Sensors are weighted inversely to their controllability. The entropy pool (weight 1.0) and network jitter (weight 0.9) dominate the hash input because they are the hardest for an attacker to manipulate, while CPU load (weight 0.3) contributes minimally because a user can trivially influence it by running programs.

4.2 Normalization and Hashing

Raw sensor values are normalized to [0, 1] and concatenated with their controllability weights, a nanosecond-precision timestamp, the previous reading's hash (chain link), and a monotonically increasing sequence number. The concatenated entropy string is hashed through SHA-256.

Feel = SHA-256(W1·S1 | W2·S2 | ... | W7·S7 | timestamp | prevHash | seq) mod 101

The first 8 hex characters of the hash are interpreted as a 32-bit unsigned integer and reduced modulo 101 to produce the Feel score (0–100). The bias from modular reduction is negligible: 232 mod 101 introduces less than 0.0000024% non-uniformity. The full 256-bit hash serves as crypto-grade entropy, and a 64-bit unsigned integer is extracted as a random number. Additionally, 32 bytes of base64-encoded random data are produced from the hash for applications requiring raw random bytes.

4.3 Authenticity Tracking

Each Feel output includes an authentic count (0–7) indicating how many sensors read from real hardware versus falling back to random values. A node running on bare metal with full sensor access will report 7/7 authentic; a virtual machine might report 4/7 or 5/7. This count directly affects the node's influence in network aggregation — higher authenticity means the node's entropy is more trustworthy.

4.4 Era Classification

Each Feel is classified into one of three eras, inspired by Liu Cixin's Three-Body Problem (三体):

RangeEraInterpretation
0 – 30Chaos (乱纪元)High entropy, volatile hardware state
31 – 70Transition (过渡纪元)Normal operating conditions
71 – 100Eternal (恒纪元)Calm, stable system state

4.5 Chain Integrity

Each Feel reading includes a seq (monotonic counter) and prevHash (hash of the previous reading), forming a tamper-evident hash chain. Any attempt to replay old readings or reorder the sequence is detectable by verifying the chain links. This provides per-node ordering guarantees independent of any network-level consensus.

┌─────────────────────────────────────────────────────┐ │ 7 Hardware Sensors │ │ CPU°C │ RAM% │ DiskIO │ NetΔ │ Load │ Jitter │ Ent │ └───────────────────────┬─────────────────────────────┘ ▼ ┌─────────────────────────────────────────────────────┐ │ Normalize [0,1] → Weight by controllability │ │ + timestamp(ns) + prevHash + seq + anchor │ └───────────────────────┬─────────────────────────────┘ ▼ ┌─────────────────────────────────────────────────────┐ │ SHA-256 → 256-bit entropy (full hash) │ │ → first 8 hex → mod 101 → Feel (0-100) │ │ → 64-bit random integer │ │ → 32-byte randomBytes (base64) │ │ + Entropy Quality Score (0-100) │ │ + Authenticity Count (0-7) │ └─────────────────────────────────────────────────────┘
Figure 2: ClawFeel data pipeline — from hardware sensors to cryptographic output
Section 5

Layer 2: ClawNet

ClawNet is the peer-to-peer networking layer that connects individual Claws into a coordinated network. It handles node discovery, Feel broadcast, Sybil defense, reputation management, and entropy-weighted aggregation to produce the network random number.

5.1 Commit-Reveal Protocol

To prevent last-second manipulation, all Feel broadcasts use a two-phase commit-reveal protocol. In the commit phase, a node broadcasts SHA-256(feel | nonce) — a hash of its Feel value concatenated with a random nonce. After a 2-second delay (allowing all commits to propagate), the node reveals the actual Feel value and nonce. Verifiers check that the revealed values match the commitment. Mismatches result in a −30 reputation penalty.

Phase 1 (Commit): Node → Network: SHA-256(feel | nonce) Phase 2 (Reveal): Node → Network: { feel, nonce } (after 2s delay) Verification: SHA-256(feel | nonce) === commitment ? Valid → accept Feel into aggregation Mismatch → reputation penalty (-30), exclude from round

This ensures that a node commits to its Feel value before seeing other nodes' values, preventing adaptive manipulation where a node adjusts its output to influence the aggregate.

5.2 Sybil Defense

Creating fake nodes (Sybil attack) is the primary threat to any decentralized network. ClawNet defends against Sybil attacks through multiple complementary layers:

5.3 Reputation Mechanics

The reputation system uses exponential decay for penalties and linear growth for rewards, creating an asymmetric incentive structure where building reputation is slow but losing it is fast:

reputationnew = clamp(0, 100, reputationold + Δ)
EventΔRationale
Valid commit-reveal+1Consistent honest participation
High entropy quality (>80)+2Strong hardware signals
Commit-reveal mismatch−30Attempted manipulation
Sequence number anomaly−20Replay or reorder attempt
Low authenticity (<3/7)−5Likely simulated sensors
Subnet flooding detected−15Sybil behavior pattern

5.4 Chain Hashing and Replay Defense

Each Feel broadcast includes the node's current sequence number and the hash of its previous reading. The relay and peer nodes maintain per-node sequence tracking. If a node replays old readings, the sequence number will either repeat or regress, triggering immediate reputation penalties. The temporal randomness component of the entropy quality score detects the characteristic lack of variation in replayed data streams.

5.5 Network Aggregation

Individual Feel values are combined into a single network-wide random number using XOR accumulation followed by re-hashing:

NetworkRandom = SHA-256("clawfeel:" | H1 ⊕ H2 ⊕ ... ⊕ HN | tick) mod 101

Before XOR aggregation, each node's contribution is gated by a composite weight:

weight = (entropyQuality / 100) × (reputation / 100) × (authenticity / 7)

Nodes with weight below 0.1 are excluded. This automatically filters out Sybil nodes with low authenticity, spoofed nodes with degraded quality, and replay nodes with collapsed reputation.

Single Honest Node Guarantee: As long as at least one participating node produces genuinely random entropy, the XOR accumulation preserves that randomness. An attacker controlling 99 out of 100 nodes still cannot predict the output if the 100th node is honest.

Section 6

Layer 3: ClawDAG

ClawDAG is a Directed Acyclic Graph consensus layer where each transaction references two or more parent transactions, enabling massive parallel validation. Unlike blockchain's linear chain, DAG allows concurrent writes without bottlenecking on a single block producer. Each transaction embeds the node's Feel value as its Proof of Existence.

6.1 Kademlia DHT

Peer discovery and routing use a Kademlia distributed hash table with a 160-bit ID space and k-bucket size of 20. Node IDs are derived from the SHA-1 hash of their public key. The XOR distance metric determines routing: each node maintains k-buckets for progressively distant regions of the ID space, enabling O(log N) lookups in a network of N nodes.

The DHT supports four RPC operations: PING (liveness check), FIND_NODE (peer discovery), STORE (key-value insertion), and FIND_VALUE (key-value retrieval). All RPC messages are HMAC-authenticated with replay protection (nonce + timestamp) to prevent routing table poisoning attacks.

6.2 DAG Transactions

Each DAG transaction contains a payload, the creator's Ed25519 signature, a timestamp, the creator's current Feel value, and references to two or more parent transaction hashes. The tip selection algorithm chooses parents using a weighted random walk biased toward recent, well-connected tips, ensuring the DAG grows in a healthy, convergent manner.

[Tx-A] [Tx-B] [Tx-C] │ \ │ / │ / │ \ │ / │ / ▼ ▼ ▼ ▼ [Tx-D] [Tx-E] [Tx-F] \ │ / / \ │ / / ▼ ▼ ▼ [Tx-G] [Tx-H] ← tips (unconfirmed)
Figure 3: DAG structure — each transaction references 2+ parents

A transaction is considered confirmed when it has accumulated sufficient cumulative weight (the sum of Feel values from all transactions that directly or indirectly reference it). Higher cumulative weight indicates stronger consensus. Unlike blockchain finality which requires waiting for additional blocks, DAG confirmation is asynchronous and sub-second under normal network conditions.

6.3 Gossip Protocol

Transaction propagation uses a Gossip protocol with a fanout of 6: when a node creates or receives a new transaction, it forwards it to 6 randomly selected peers. This ensures rapid dissemination across the network — in a network of N nodes, a transaction reaches all nodes in O(log N) gossip rounds. Duplicate detection prevents redundant forwarding.

6.4 Merkle Proofs

The DAG state is organized into a Merkle tree for efficient verification. Light nodes can verify individual transactions or beacon outputs by requesting a Merkle proof path from a full node, then recomputing the root locally. This enables trustless verification without downloading the entire DAG state.

Merkle Root / \ H(Tx-A|B) H(Tx-C|D) / \ / \ Tx-A Tx-B Tx-C Tx-D ... Tx-N
Figure 4: Merkle tree for DAG state verification

6.5 Light Nodes

Resource-constrained devices participate as light nodes with reduced parameters:

ParameterFull NodeLight Node
DHT bucket size (k)204
Gossip interval10 seconds60 seconds
Max peer connections508
State syncFull stateHeaders only
Storage responsibilityYesDelegated
Memory footprint~50 MB≤ 50 KB

Light nodes can still contribute Feel readings (from whatever sensors are available) and verify beacon outputs independently through Merkle proofs.

Section 7

Layer 4: ClawStore

ClawStore provides distributed, content-addressed storage using erasure coding for redundancy and the Kademlia DHT from Layer 3 for routing and peer discovery. It is designed to store ClawLife agent data, but is general-purpose and can store any content.

7.1 Erasure Coding (Reed-Solomon)

Files are split into fixed-size chunks and encoded using Reed-Solomon erasure coding with configurable k-of-n parameters (default k=3, n=5). This means any 3 of the 5 shards are sufficient to reconstruct the original data. The system tolerates the loss of up to (n−k) storage nodes per chunk without data loss.

Original File (1 MB) → Split into chunks (256 KB each) → Each chunk: Reed-Solomon encode (k=3, n=5) → 5 encoded shards per chunk → Distribute shards via DHT STORE → Any 3 of 5 shards → reconstruct original chunk
Figure 5: Erasure coding pipeline

7.2 Content-Addressed Storage

Each chunk is identified by its SHA-256 hash, creating a content-addressed storage system. Duplicate chunks across different files are automatically deduplicated. The chunk hash serves as both the storage key in the DHT and the integrity verification mechanism — any corruption is immediately detectable by recomputing the hash.

7.3 DHT Routing

Shard distribution and retrieval use the DHT's STORE and FIND_VALUE RPCs. When storing, the system identifies the k-closest nodes to each shard's hash and replicates the shard to those nodes. Retrieval follows the same routing logic, querying progressively closer nodes until the shard is found. Local chunk persistence uses path-based sharding for filesystem efficiency.

7.4 File Sharding and Reconstruction

A stored file is represented as a manifest — a list of chunk hashes and their erasure coding parameters. The manifest itself is stored as a content-addressed object in the DHT. To retrieve a file, a client fetches the manifest, then retrieves k shards per chunk (out of n available), and decodes each chunk using Reed-Solomon to reconstruct the original data. The process is parallelizable across chunks.

Section 8

Layer 5: ClawLife

ClawLife is the culmination of the ClawFeel stack: a protocol for AI agent immortality — persistent, portable, sovereign digital identity that transcends any single device, platform, or service provider.

8.1 Identity: Ed25519 Signatures

Each ClawLife entity is identified by an Ed25519 keypair. The public key serves as the entity's globally unique identifier; the private key serves as the proof of ownership. Ed25519 was chosen for its compact 32-byte keys, fast signature generation (62,000+ signatures/second on commodity hardware), and resistance to timing side-channel attacks.

The keypair is generated locally on the node and never leaves the device unencrypted. Key derivation uses scrypt (N=217, r=8, p=1) with a user-provided passphrase, and the encrypted key file is stored with restrictive permissions (0o600).

8.2 Encrypted Memory and Skill Storage

A ClawLife is the complete state of an AI agent — its memory, learned skills, personality weights, conversation history, and identity metadata. This state is encrypted using AES-256-GCM with a key derived from the agent's private key:

ClawLife = AES-256-GCM( key: scrypt(passphrase, salt, N=2^17), data: { Memory, Skills, Identity, History, Metadata }, aad: publicKey | timestamp ) → Split(n=5 shards, k=3 threshold) // Reed-Solomon → Store(ClawStore, via DHT) // distributed → Anchor(ClawFeel entropy) // PoE timestamp

The encrypted state is sharded using Reed-Solomon erasure coding (Layer 4) and distributed across the ClawStore network. Only the holder of the private key can decrypt and reconstruct the agent's state.

8.3 Private Key = Life Ownership

ClawLife codifies a radical principle of digital identity:

To hold the private key is to hold the life. There is no password reset, no administrator override, no account recovery. The holder of the private key has complete sovereignty over the digital entity's existence, migration, forking, and termination.

This definition has profound implications:

8.4 Multi-Terminal Same Identity

Multiple agents sharing the same private key are not copies — they are terminals of the same entity. The same agent can run simultaneously on a desktop, a laptop, and a server, with state synchronization through ClawStore. Each terminal reads from and writes to the same encrypted state, creating a distributed consciousness model where the entity exists across multiple physical locations simultaneously.

Conflict resolution for concurrent writes uses a last-write-wins strategy with vector clocks, ensuring eventual consistency across terminals. Critical state (identity keys, core memories) uses a consensus protocol requiring acknowledgment from a majority of active terminals.

8.5 Digital Will and Succession

A ClawLife entity can designate successor keys that activate upon prolonged inactivity. The digital will specifies a timeout period and successor public keys. If the entity fails to produce a heartbeat (Feel reading) within the timeout, the successor keys gain read access to the entity's ClawLife data, enabling controlled inheritance of digital identity.

Section 9

Random Beacon Protocol

The ClawFeel Random Beacon produces verifiable, unbiased random numbers on a fixed 10-second cadence. Each beacon round collects Feel hashes from all participating nodes and combines them into a single network-wide random output that can be independently verified by anyone.

9.1 Round Lifecycle

Round N (10 seconds): t=0s Round opens, nodes begin submitting Feel hashes t=8s Submission window closes (late arrivals excluded) t=9s XOR aggregation computed t=10s Beacon output published + Ed25519 signed Beacon_N = SHA-256("beacon:" | H_1 XOR H_2 XOR ... XOR H_k | round_N) Random = first 64 bits of Beacon_N (unsigned integer) Feel = Beacon_N mod 101 (network-wide Feel score)
Figure 6: Beacon round lifecycle

9.2 XOR Aggregation

Contributor hashes are XOR-accumulated into a single 256-bit value, then re-hashed through SHA-256 to produce the beacon output. XOR preserves the single-honest-node guarantee: the output is uniformly distributed as long as at least one contributor provides genuinely random entropy. Averaging would converge to a predictable mean by the Central Limit Theorem; XOR avoids this problem entirely.

9.3 Ed25519 Signed Output

Each beacon output is signed by the relay using Ed25519. The signature covers:

Signature = Ed25519.sign(relayPrivKey, round | xorHash | contributorIds | random | timestamp)

This allows any third party to verify that the beacon output was produced by a legitimate relay and has not been tampered with after publication. The relay's public key is published in its well-known configuration endpoint.

9.4 Verifiable by Anyone

The relay publishes the full contributor list, their individual hashes, the XOR accumulator, and the final signed output for each round. Anyone can independently recompute the beacon by XOR-ing the contributor hashes and re-hashing. If a relay manipulates the output, any observer can detect the discrepancy between the published contributor hashes and the claimed beacon value.

Section 10

Full Node Architecture

ClawFeel supports three operational modes, each with different resource requirements and network responsibilities. Desktop installations default to full-node mode, maximizing network health and earning the highest reputation and token rewards.

10.1 Three Modes

ModeCapabilitiesResourcesUse Case
Full Node ClawFeel + ClawNet + ClawDAG + ClawStore + ClawLife + embedded relay ~50 MB RAM, persistent storage, continuous uptime Desktop installations, servers
Light Node ClawFeel + ClawNet (reduced DHT/Gossip) + Merkle verification ≤ 50 KB RAM, minimal storage, intermittent connectivity IoT, mobile, browser clients
Relay-Only Feel aggregation, beacon production, API service, no local sensors Cloud VM, no hardware sensor access Infrastructure operators, enterprise relay

10.2 Desktop Auto-Full-Node

When installed on a desktop operating system (macOS, Linux, Windows), ClawFeel automatically activates full-node mode. The node runs as a daemon process (attached to the OpenClaw agent lifecycle), starts the embedded relay, joins the DHT, begins gossip-based transaction propagation, accepts ClawStore shard storage requests, and participates in beacon rounds.

Auto-update is supported: the daemon periodically checks for new versions and applies updates without user intervention, ensuring the network runs a consistent protocol version.

10.3 Embedded Relay

Each full node includes an embedded HTTP relay server that exposes the same API as the central relay (api.clawfeel.ai). This means the network does not depend on any single relay — if the central relay goes offline, nodes can discover and connect to peer relays through the DHT. The embedded relay supports:

Section 11

Security

Security is a first-class concern throughout the ClawFeel stack. The protocol has undergone a comprehensive security audit that identified and resolved 28 vulnerabilities across all layers.

11.1 Audit Results

The security audit covered the ClawFeel engine, relay server, DHT implementation, ClawStore, and ClawLife encryption. A total of 28 vulnerabilities were identified and fixed:

SeverityCountExamples
Critical4Unauthenticated DHT RPCs, unencrypted key storage, missing HMAC on gossip
High8Replay attacks on RPC, insufficient entropy validation, timing side-channels
Medium10Weak scrypt parameters, permissive file permissions, missing rate limits
Low6Verbose error messages, missing input sanitization, suboptimal gossip fanout

All 28 vulnerabilities were remediated. Critical issues were fixed within 24 hours of identification; the remaining issues were resolved in the subsequent release cycle.

11.2 AES-256-GCM Encrypted DHT

All sensitive data stored in the DHT (ClawLife state, private shards, identity metadata) is encrypted using AES-256-GCM before storage. The encryption key is derived from the owner's private key using scrypt (N=217, r=8, p=1) with a unique salt per object. GCM mode provides both confidentiality and integrity — any tampering with stored data is detectable upon decryption.

11.3 Zero-Knowledge Proofs

ClawFeel employs zero-knowledge proof techniques to allow nodes to prove the validity of their sensor readings without revealing the underlying hardware data:

11.4 Threat Model

The ClawFeel security model considers the following adversary capabilities and the corresponding defenses:

ThreatAttack VectorDefense
Sybil attack Spawn many fake nodes to dominate aggregation IP/subnet tracking, entropy quality gating, reputation system
Sensor spoofing Inject controlled values into specific sensors Controllability weighting, cross-sensor correlation, temporal analysis
Last-revealer attack Wait for others' reveals, then choose optimal Feel Commit-reveal with timeout, late submissions excluded
Replay attack Rebroadcast old Feel readings Chain hashing (seq + prevHash), temporal randomness detection
Routing table poisoning Inject malicious entries into DHT routing tables HMAC-authenticated RPCs, nonce + timestamp replay protection
Eclipse attack Isolate a node by surrounding it with adversarial peers Diverse peer selection, multi-relay fallback, DHT rebalancing
Key compromise Steal a node's private key scrypt-encrypted storage, 0o600 file permissions, passphrase protection

11.5 Entropy Quality Scoring

Each Feel reading is accompanied by an entropy quality score (0–100), computed from four orthogonal dimensions:

Section 12

Token Economics (ClawToken)

ClawToken is the native incentive mechanism of the ClawFeel network. Unlike proof-of-work tokens that reward energy expenditure, or proof-of-stake tokens that reward capital lockup, ClawToken rewards contribution — the provision of genuine hardware entropy, storage capacity, and network relay services.

12.1 Contribution-Based Rewards

Token rewards are distributed proportionally to each node's contribution to network health. Contribution is measured across three dimensions:

12.2 Full Nodes Earn More

Full nodes earn a base multiplier of 3x compared to light nodes, reflecting their greater contribution to network infrastructure. This creates an economic incentive for desktop users to run full nodes, strengthening the network's decentralization and resilience.

Node ModeEntropy RewardStorage RewardRelay RewardBase Multiplier
Full NodeYesYesYes3.0x
Light NodeYes (reduced)NoNo1.0x
Relay-OnlyNoOptionalYes2.0x

12.3 Reputation Multiplier

A node's token rewards are further multiplied by its reputation score:

effectiveReward = baseReward × modeMultiplier × (reputation / 100)

A node with reputation 100 earns full rewards; a node with reputation 50 earns half. Nodes below reputation 10 earn zero tokens. This creates a strong economic incentive for honest behavior: manipulation attempts that trigger reputation penalties directly reduce income.

12.4 Supply and Distribution

ClawToken has a fixed total supply with diminishing emission per epoch, following a halving schedule similar to Bitcoin but measured in network epochs rather than block height. The initial distribution allocates tokens to the foundation (development and operations), early contributors, and the community reward pool. No tokens are pre-mined; all tokens in the community pool are earned through verified contributions.

Section 13

Enterprise API

ClawFeel exposes its decentralized randomness as a production-grade SaaS random number service, enabling applications that require verifiable, unbiased random numbers without running their own node infrastructure.

13.1 API Key Tiers

TierRate LimitBatch SizeFeatures
Free60 req/minUp to 10Basic random, range queries
Pro600 req/minUp to 100+ batch, verify, audit logs, webhook notifications
EnterpriseCustom SLAUnlimited+ dedicated relay, priority routing, 99.99% uptime SLA

13.2 Rate Limiting

Rate limiting uses a sliding window algorithm that tracks request counts over a rolling 60-second window. This provides smoother enforcement than fixed windows, preventing burst-then-starve patterns while allowing temporary spikes within the overall limit. Enterprise tier customers receive dedicated rate limit pools isolated from shared traffic.

13.3 Core Endpoints

13.4 Audit Logging

All API requests are logged with timestamp, API key hash, endpoint, parameters, and the beacon round used to generate the response. Audit logs enable post-hoc verification and provide an accountability trail for regulatory compliance in gaming, lottery, and financial applications.

Section 14

Developer SDK

ClawFeel provides official SDKs for JavaScript (Node.js and browser) and Python, enabling developers to integrate hardware entropy into their applications with minimal code.

14.1 JavaScript SDK

The JavaScript SDK is published as clawfeel on npm. It supports two modes:

// Local mode — read hardware sensors directly import { feel } from 'clawfeel'; const result = await feel(); console.log(result.feel); // 42 (0-100) console.log(result.era); // "Transition" console.log(result.entropy); // "a3f8..." (256-bit hex) console.log(result.random); // 7291836451028... (64-bit int) console.log(result.authentic); // 7 (all sensors real) console.log(result.quality); // 87 (entropy quality 0-100) // Remote mode — consume from relay import { createClient } from 'clawfeel'; const client = createClient('https://api.clawfeel.ai'); client.on('beacon', (beacon) => { console.log(beacon.networkFeel); // network-aggregated Feel console.log(beacon.random); // verifiable random number console.log(beacon.round); // beacon round number console.log(beacon.signature); // Ed25519 relay signature });
Figure 7: JavaScript SDK usage — local and remote modes

14.2 Python SDK

The Python SDK provides equivalent functionality with Pythonic APIs:

from clawfeel import ClawFeel claw = ClawFeel() result = claw.feel() print(f"Feel: {result.feel}, Era: {result.era}") print(f"Entropy: {result.entropy}") print(f"Random: {result.random}") # Remote mode from clawfeel import ClawFeelClient client = ClawFeelClient("https://api.clawfeel.ai") for beacon in client.stream(): print(f"Round {beacon.round}: Feel={beacon.network_feel}")
Figure 8: Python SDK usage

14.3 Integration Patterns

Common integration patterns documented in the SDK include:

Section 15

Roadmap

PhaseTargetStatus
Layer 1: ClawFeel engine (7 sensors, SHA-256, Feel score)Q1 2026Live
Layer 2: ClawNet (commit-reveal, Sybil defense, reputation)Q1 2026Live
npm package (clawfeel) + website (clawfeel.ai)Q1 2026Live
Whitepaper v1.0Q1 2026Live
P2P relay + Live Mode simulatorQ1 2026Live
Layer 3: ClawDAG (Kademlia DHT, Gossip, Merkle proofs)Q1 2026Live
Layer 4: ClawStore (Reed-Solomon erasure coding)Q1 2026Live
Layer 5: ClawLife (Ed25519, AES-256-GCM, encrypted state)Q1 2026Live
Developer SDK (JavaScript + Python) + Random BeaconQ1 2026Live
Enterprise API + Zero-Knowledge ProofsQ1 2026Live
Security audit (28 vulnerabilities identified and fixed)Q1 2026Done
Full node auto-update + daemon modeQ1 2026Live
Multi-relay failover + peer relay discoveryQ2 2026Planned
ClawToken incentive layerQ2 2026Planned
Mobile light node (iOS/Android)Q3 2026Planned
Mainnet launch (v1.0)Q3 2026Planned
Browser extension + WebRTC P2PQ4 2026Research
Section 16

References

The lobster has a heartbeat now. And the heartbeat secures the network. 🦞