Home • Why it works • Technical • FSC Architecture • AI & Autonomy • Past & Post
This page is for builders: how FairShareCoin is structured, where constraints live, and how the system scales.
fairsharecoin/foundation is authoritativeFSC combines three layers: identity-anchored issuance, transaction routing, and auditable ledger state. The key design goal is simple: constrain privilege at issuance, then let value move through real usage.
User experience is intentionally message-like: choose recipient, amount, send. Under the hood, each transfer follows a strict verification path.
FSC’s uniqueness anchor is COINMINT_ID: a deterministic identity-derived identifier used for issuance eligibility, not public identity disclosure.
Passport renewal should preserve identity continuity and prevent duplicate issuance. The model re-verifies under the same uniqueness logic and links continuity without reminting extra base issuance.
See technical identity section
KEYMINT is the operational signing layer: it reduces long-term key exposure and improves key rotation ergonomics.
Recovery is continuity-based, not “new account minting.” If credentials are lost, holder re-establishes control via verified continuity and relinks operational credentials.
FSC scaling strategy is to keep full verification possible while reducing default storage burden. Pruning and signed snapshots reduce historical overhead; sharding is a modular expansion path.
| User Base | Estimated Storage | Notes |
|---|---|---|
| 1 million | ~5 GB | Global ledger, compact metadata model |
| 21 million | ~105 GB | Consumer-hardware feasible |
| 100 million | ~500 GB | Pruned metadata heavy use case |
| 1 billion | ~5 TB | Infrastructure-grade full participation |
| 10 billion | ~50 TB | Global scale, strongly benefits from sharding |
| User Base | Storage per Shard |
|---|---|
| 1 million | ~50 MB |
| 21 million | ~1.05 GB |
| 100 million | ~5 GB |
| 1 billion | ~50 GB |
| 10 billion | ~500 GB |
Order-of-magnitude estimates (assuming ~10 transfers/user/year) suggest FSC can remain lightweight relative to many high-throughput systems.
| User Base | Yearly Transactions | Total Storage | Bandwidth per Full Node (year) | CPU per Full Node (year) |
|---|---|---|---|---|
| 1 million | 10 million | ~2.5 GB | ~256 MB | ~33 seconds |
| 21 million | 210 million | ~52.5 GB | ~5.4 GB | ~11.6 minutes |
| 100 million | 1 billion | ~250 GB | ~25 GB | ~55 minutes |
| 1 billion | 10 billion | ~2.5 TB | ~250 GB | ~9.2 hours |
| 10 billion | 100 billion | ~25 TB | ~2.5 TB | ~3.8 days |
Architecture goal: keep fairness constraints strict, implementation simple, and participation feasible on ordinary hardware wherever possible.
From identity to infrastructure, every layer exists to protect one core rule: one being, one base share.