Unbroken Security – Concurrent computing · Formal verification · Capability security

Security, unbroken in two decades, applying granular protection to data

F1R3FLY is a computing and security platform built on the Rho-Calculus, a branch of mathematics for describing many computations happening at once. In plain terms, it offers three things together: the strongest known form of security (the kind that protects blockchains, unbroken in two decades) running at the high speed needed by businesses; separate locks on every single record; and software that is checked with mathematics, not just trial and error.

100,000+ TPSThe design target: over one hundred thousand transactions per second (“TPS”), with speed growing almost in step with the hardware you add. Actual figures vary by deployment.

No successful breach to dateF1R3FLY's security model – where many independent computational agents must all agree before anything is accepted – has a twenty-year public record without a successful break-in.

Per-record isolationEvery single record has its own lock, and every read or write needs its own key. Were a breach to occur, which is a massively unlikely event, it would be confined to a single data action, not cascaded through the system.

Mathematical assuranceBefore any code runs, the OSLF checking tool proves it is safe and does what it claims – like checking a bridge design before building it, rather than driving trucks over it to see if it holds.

The platform

Six proprietary capabilities. One integrated stack.

Where conventional systems bolt security onto an architecture designed for something else, F1R3FLY derives security and performance from the same mathematical foundation: a model of computation in which concurrency, communication and access control are one and the same thing.

Rholang

F1R3FLY's own programming language, built directly on the Rho-Calculus. Programs written in it genuinely do many things at once: many independent computational agents – think of them as workers – each doing their job at the same time, safely.

OSLF verification

The checking tool (short for Operational Semantics in Logical Form): a mathematical analysis that confirms a program is correct, finds security weaknesses, and predicts exactly how the program will behave – all before it is allowed to run.

MORK search

A search engine of unusual power: it catalogues almost any kind of data, identifying with precision its type, and can search billions of records in close to real time – whether finding patterns in transaction histories or combing through research data.

Per-record protection

Access control at the level of the individual record: the right to read or write each piece of data is built into a digital key itself, not managed through an administrator's permission list that could be hacked. If you do not hold the correct key and deploy it via the correct channel, the record simply will not open.

Byzantine Fault Tolerance

The agreement system behind the world's most attack-resistant networks: many independent computational agents must agree before a change is accepted, so no single compromised machine can corrupt the record. Never successfully breached to date and lifted by F1R3FLY to business speed – with support for “quantum-safe” encryption: it provides protection against the code-breaking power of future quantum computers.

Sharded architecture

The network is divided into protected compartments called shards. Independent organizations connect to their own shard and control precisely which items of data they share, and with whom. Shards can be linked together for joint projects, and the whole system sits on top of whatever technology a client already runs. Shards are de-centralized, rather than running on one system, and are system-agnostic: for example, a shard could be on AWS, Microsoft Azure, Oracle, or a host of other available systems.