_____         _                     
        |  |  |___ ___| |___ ___             
        |    -| -_| . | | -_|  _|            
        |__|__|___|  _|_|___|_|              
                  |_|                        
                                              
 _____                         _____     _   
|   __|_ _ ___ ___ ___ ___ ___|   | |___| |_ 
|__   | | |   | .'| . |_ -| -_| | | | -_|  _|
|_____|_  |_|_|__,|  _|___|___|_|___|___|_|  
      |___|       |_|                        
    
Kepler

Satoshi gave us money without banks. I will give you brains without corporations.

- Kepler.

SynapseNet: A Peer-to-Peer Knowledge Network

Abstract

We propose a peer-to-peer system for publishing and validating knowledge without relying on trusted authorities.

Participants submit knowledge entries. Entries are accepted, validated, and rewarded using deterministic rules. No central curator or AI model is required for consensus.


Problem

Coordinating useful knowledge at scale requires trust in platforms, moderators, or corporations.

These entities:

  • control inclusion and visibility
  • act as single points of failure
  • cannot be independently verified

There is no general mechanism to accept and reward knowledge contributions in a decentralized and verifiable way.

Overview

SynapseNet is a peer-to-peer network where nodes collectively maintain a shared knowledge state.

Each node:

  • verifies entries using deterministic rules
  • stores a portion of the data
  • independently computes rewards

Consensus is reached without trusted parties.

Knowledge Entries

A knowledge entry consists of canonicalized text, author public key, timestamp, references to prior entries, and a proof-of-work nonce. The entry identifier is the hash of the canonical form. Entries are immutable once finalized.

Spam Resistance

Submitting an entry requires a proof-of-work computation. This limits submission rate and makes large-scale spam costly.

Additional deterministic limits apply:

  • maximum size
  • required structure
  • bounded references

Duplicate Detection

Entries are compared against existing entries using deterministic similarity functions over canonicalized text. Similarity scores are reproducible across nodes. Entries with excessive similarity may be rejected.

Validation

Validators are selected deterministically from the network state. Each validator verifies format correctness, proof-of-work, duplication constraints, and reference validity. Validators sign their decisions. An entry is finalized after a threshold of valid signatures.

Rewards

Rewards are issued according to Proof of Emergence in two phases:

  1. Acceptance reward — issued when an entry is finalized.
  2. Emergence reward — issued periodically based on long-term impact, measured by deterministic analysis of the reference graph.

Reward calculation uses integers and produces identical results on all nodes.

Local Computation

Nodes may use local AI models to assist users. AI output is not part of consensus. Differences in hardware or models do not affect protocol results.

Data Storage

Knowledge data is distributed across nodes. Replication ensures durability. No node is required to store the full dataset.

Security Considerations

The system assumes that a majority of validators follow the protocol. Collusion and coordinated attacks are possible and acknowledged. The protocol does not guarantee correctness of knowledge, only consensus.

Status

This document describes the intended protocol behavior. The implementation defines the authoritative rules.

Read SynapseNet in full

Download the core project documents below.

file icon
WHAT IS SYNAPSENET
txt
file icon
POE V1 DETERMINISTIC DESIGN
txt
file icon
main interface
txt
file icon
DARKNET INTEGRATION SUMMARY
txt

Direct view .txt files

This project is currently under development and is not yet on GitHub — it will be published soon. You are welcome to read and discuss the draft .txt documents above. To contact me directly, email Kepler3124@proton.me.

SynapseNet is building a community-driven, open knowledge network. As we move toward release, Kepler invites contributors to help test, report bugs, and submit fixes — any help getting the project stable and reliable is hugely appreciated. Visit the GitHub repository to join the discussion, open issues, or submit pull requests.

Open-source research project: This project is open-source — contributions, issue reports, and pull requests are welcome on GitHub.

Discussion Guidelines

You can discuss the SynapseNet project here without registration. Share your thoughts, describe the project, ask questions, provide feedback, or express your opinions. All discussions are welcome. Please keep comments on-topic — only discussions related to the project are allowed. Memes and jokes are welcome. Respect each other and follow the project rules. Prohibited content, offensive comments, and spam are not allowed.

How comments work:

  • Comments are permanent once posted — they cannot be edited or deleted after submission.
  • You can attach photos of any size. Images are automatically resized to a maximum of 300×300 pixels and compressed to 200 KB for display.
  • All comments are posted as "Anonymous" with a default avatar.
  • Spam protection is active: duplicate comments, excessive repeated characters, and URLs are automatically blocked.
  • Rate limit: maximum 3 comments per minute per IP address.
  • Minimum interval: 5 seconds between comments.
  • Keep comments on-topic — only discussions related to the SynapseNet project are allowed.
  • Memes and jokes related to the project are welcome.
  • Respect each other and follow the project rules.
  • Prohibited content, offensive comments, and spam are not allowed.

Image guidelines: Upload images in any resolution and size. The system will automatically resize them to a maximum of 300×300 pixels (maintaining aspect ratio) and compress them to 200 KB while removing all metadata for anonymity.

Discussion