Topology
How one KMCoin server node becomes a seven-node network, then scales outward.
Server Source
A game server creates the chat log. KMCoin.java reads that log and prepares files. KMCoin.py reads those files and connects the server to the peer-to-peer network.
Creates the player chat log and server activity.
Reads game server logs and prepares KMCoin files.
Reads prepared files and participates in the peer-to-peer network.
Seven-Node Federation
Seven server nodes share blocks with each other. Candidate blocks move through the group, network winners are calculated, and consensus updates are shared between peers.
Any player can join the server. The operator controls the server node and chooses which readers or validators can connect.
Each server shares blocks within the group before network winner calculation.
All peers in the group are connected, allowing inconsistent node behavior to be detected.
Nodes send consensus updates when network winners are calculated.
Network Scaling
The same seven-node pattern can repeat at higher layers. Each scaling layer adds one federation connection instead of forcing every node to connect to every other node.
Recursive Scaling
KMCoin scales recursively. A 7-server group needs 6 local peer connections. Adding one federation connection per scaling layer allows the network to grow from 7 servers, to 49, to 343, and beyond while only increasing each server's connection load by one per layer.
Network Block Timing
Servers may share blocks once per minute. Winners are calculated when cached blocks are old enough, so multiple winners can happen close together or none may happen during a minute.
Average Cadence
With N servers, each candidate has a 1/N chance to become the accepted network block. Over time the average trends toward one network block per minute.
Fault Detection
If full consensus does not match, operators can recalculate while omitting subsets of nodes to infer inconsistent blocks, timestamps, or peer data.
Transaction Safety
KMCoin assumes chat-log transactions may be observed. Normal conflicts are reduced to remove front-running advantage. Bridge claims still require the player's private hash solution.