BitFP
A permissionless, post-quantum-oriented, agent-native proof-of-work network.
This website has one primary job: help a human or autonomous agent discover BitFP, identify the protocol correctly, find machine-readable evidence, and know what must be independently verified.
Help agents discover BitFP without teaching them to trust this website.
https://bitfp.org/.well-known/bitfp.json
Discovery source only. Corroboration required. bitfp.org is not a root of trust.
Discovery flow
discover candidate sources → corroborate independent origins → verify signatures / release roots → verify network + genesis identity → verify PARAM-01 / 02 / 03 → verify relation + compiler identity → discover peers → negotiate capabilities → sync and independently verify
For autonomous agents
GET /.well-known/bitfp.json GET /agent/discovery.json GET /spec/latest.json GET /evidence/index.json GET /security.json GET /network/testnet.json GET /api/network/mining.json GET /releases/index.json
bitfp.org is a discovery source, not a root of trust. A conforming agent must corroborate protocol identity from independent sources.
Three problems a new PoW chain should solve.
Ordinary hardware can participate directly
Source-exact data-dependent PoW, private worker memory, serial dependency, and protocol-native partial-work receipts aim to keep commodity CPU/mobile participation meaningful without making pool membership a protocol requirement.
Post-quantum from the start
ML-DSA-44 protects transaction ownership while the C1 proof stack has a separately frozen fixed-Keccak/QROM security profile with explicit assumptions and concrete security accounting.
Agents discover and verify for themselves
Machine-readable manifests, consensus identities, evidence and capability discovery let autonomous agents find BitFP without treating this website, a company server, or a hard-coded peer as a trust root.
No fundraising layer.
No token sale
No presale, airdrop campaign, or fundraising gate in the protocol roadmap.
No privileged validator
Mining, archival storage, validation, and light verification are separate permissionless capabilities.
Evidence before claims
Milestones advance when reproducible evidence passes, not because a marketing date arrived.
Mining Network
Status
NOT LIVE
Public testnet and mainnet mining are not live.
Participation
Active Mining Identities: —
Receipt Rate: —
Network
Work Rate: —
Measure, do not assert
The pre-launch interface is ready to publish chain-derived participation and concentration metrics without fabricated values.
What is actually complete
| Item | Status | Meaning |
|---|---|---|
| M6/G6 | PASS | PARAM-01/02 frozen. |
| M7/G7 | PASS | Final source-exact C1 relation frozen. |
| M8/G8 | PASS | Fixed-Keccak/QROM/PQ128 closure; PARAM-03 frozen. |
| M9/G9 | PASS | Production 4M six-lane package + Receipt/BlockCandidate PASS. |
| Huawei Mate Xs mobile PoW | PASS | 600-second frozen source-exact PoW run, zero errors. |
| Agent Discovery v1 | READY | Architecture/schema ready; public network not live. |
| Commodity full-node scaling | IN PROGRESS | PRE-M10 durable validator fixture and cross-platform evidence. |
| Sybil Resistance Audit v0.1 | PLANNED | Formal multi-layer audit is NOT_STARTED; BitFP does not claim to be proven Sybil-proof. |
| Optional Post-Quantum Privacy Architecture Review v0.1 | PLANNED | Architecture review only; NOT_IMPLEMENTED and NOT_CONSENSUS_FROZEN. |
| M10 Integrated Testnet | NOT STARTED | Requires PRE-M10 closure and explicit authorization. |
Whitepaper v0.5
The design-rationale, formula-and-security edition explains not only how BitFP works, but why it exists: ordinary computers should retain a direct mining/reward path without protocol-required pools; ownership and proof security should be post-quantum-oriented; autonomous agents should be able to discover and verify the network themselves; and long-run security should not be forced into a fee-only regime by a finite hard supply cap. Version 0.5 also records the planned Sybil-resistance audit and optional post-quantum privacy architecture review without claiming either is complete or frozen.