Verifiable reasoning for AI decisions.
Ontologic is a proof-of-reasoning protocol that enables AI agents and distributed systems to cryptographically prove the justification behind their actions, not just the actions themselves.A four-hash morpheme proof — rule, inputs, outputs, meaning — anchored on Hedera Consensus Service. Agents prove not just what they did, but why.
Ascension Hackathon
1st Place ($10K)
Hedera's official hackathon — external validation from the ecosystem
Built on Hedera
HCS Anchored
Verifiable timestamps and total ordering via Hedera Consensus Service
Research
The Ontologic Protocol: A Primitive for Deterministically Verifiable Proof-of-Reasoning
The canonical whitepaper. h(R‖I‖O‖M) seals a Rule, its Input, the resulting Output, and an attested declaration of Meaning into a single hash, deterministically replayable by any third party.
View on Zenodo →Fusing Ledger-Based Proof of Reasoning with Hardware Roots of Trust
Independent third-party validation — an external architecture paper positioning Ontologic's RIOM morpheme as the reasoning substrate for hardware-enforced AI governance.
View on Zenodo →Why This Matters
For decades, enterprise security operated on implicit trust. A badged employee, on a corporate machine, in a secure environment, running sanctioned software. The human in the chair was the verification layer, and nobody had to formalize it because the human was always there.
Today, autonomous processes are now making decisions, calling APIs, and moving data with no human in the chair. Unfortunately, most systems simply removed the human without building a new verification layer into their system. To solve this problem, new infrastructure must be built to replace what the person was quietly doing for the decades prior to the arrival of autonomous agents.
Ontologic is that infrastructure.
Validate a reasoning proof yourself.
A user says, "Hello." A declared rule binds that statement onto our Hello World and seals it into a cryptographic proof anchored on a public network. Anyone can re-check the proof from public data with no key, no API, no account, and no trust in the author.
The Thesis
The Problem
LLMs, autonomous agents, and symbolic systems produce outputs through processes that are neither reproducible nor independently verifiable. Blockchains secure state transitions without the logical structures that generated them. This is an egregious gap between action and meaning.
Ontologic's Response
Ontologic supplies a portable, witnessable proof for the binding event (the moment a rule meets an input). Our proof seals four parts into a single hash, h(R‖I‖O‖M) — Rule, Input, Output, and an attested declaration of Meaning:
Rule
A declarative expectation in canonical form — a logical axiom, a domain constraint, a transformation. The rule is referenced by URI, never inlined, and hashed to produce a ruleHash.
Input
The serialized input the rule was applied to, hashed to produce an inputsHash. Canonical form makes it deterministically reproducible by anyone, anywhere.
Output
The resulting output of applying the rule to the input, hashed to produce an outputsHash. Recompute it and it either matches the anchored proof or fails loudly.
Meaning
The reasoner's declared meaning, through a canonical URI addressable within the semiotic chain, and published via consensus-backed attestation on the Hedera Consensus Service: total ordering, verifiable timestamps, immutability.
M is the attested declaration of Meaning. It corresponds to the Floridi information lens and is represented by Yellow.proofHash = H(ruleHash || inputsHash || outputsHash || meaningHash)
Four parts, one seal. The hash proves the binding fired: that this rule, on this input, produced this output under this declared meaning. The proof is derivation without needing to evaluate whether the reasoning was wise or the premises true. An affidavit, not a brain scan.
This formula shows the canonical four-part morpheme proof: the proof hash equals the hash of the concatenation of rule hash, inputs hash, outputs hash, and meaning hash. This seals rule, input, output, and an attested declaration of meaning into a single verifiable identifier.The existence, ordering, attribution, and immutability of the proof is bestowed by witnesses on a hashgraph consensus topic and not merely asserted by the reasoner. Two independent parties replaying the same reasoning derive the same morpheme, so verification never requires trust in the agent that produced it. The protocol guarantees the record, not the referent.
Because the proof is just public data, anyone can re-derive it. The public can make four independent checks (logic, meaning, material, and self-proof closure) while ensuring that any failure or deceit is immediately noticed.
For a reference domain, we used formal colorimetry which can be viewed on our Visor topography.
What's Ahead
Building toward dynamic rule registries and the OTS/OCS framework. Instead of encoding rules in smart contracts, agents will resolve human-readable rule URIs via registries built on existing Hedera standards (HCS-1 for rule storage, HCS-2 for registries, HCS-13 for schema validation). Designing for community governance of rule taxonomies. This is the direction — not the current implementation.
Request Early Access
Ontologic is in active pre-Alpha development. Request early access to be notified when developer tooling ships.