Ocior: Byzantine Consensus Protocols

• Ocior is a family of asynchronous Byzantine consensus protocols that achieve optimal resilience (n ≥ 3t + 1) using leaderless and parallel transaction processing.
• The protocols employ threshold signatures, asynchronous rounds, and epochal key refresh to ensure fast and reliable transaction finality in distributed networks.
• OciorABA extends this approach with asynchronous partial vector agreement and erasure-coded broadcasts to offer error-free, information-theoretic secure multi-valued consensus.

Searching arXiv for papers on "Ocior" and closely related protocol variants. arxiv_search(query="Ocior consensus OR OciorABA", max_results=10, sort_by="relevance") Ocior is the name used in recent arXiv literature for asynchronous Byzantine agreement and consensus protocols under the optimal resilience condition $n \ge 3t+1$. In its primary usage, Ocior denotes a practical asynchronous Byzantine fault-tolerant consensus protocol that is leaderless, processes transactions individually and concurrently via parallel consensus instances, and provides two asynchronous rounds of good-case finality for legitimate two-party transactions (Chen, 1 Sep 2025). In a related usage, the compound name OciorABA denotes an error-free, information-theoretically secure multi-valued asynchronous Byzantine agreement protocol built around the primitive of asynchronous partial vector agreement (APVA), with expected communication complexity $O(n\ell + n^3 \log q)$ bits and expected round complexity $O(1)$ (Chen, 20 Jan 2025). This suggests that “Ocior” functions less as a single algorithmic artifact than as a protocol line centered on low-latency asynchronous agreement under Byzantine faults.

1. Nomenclature and protocol scope

The literature distinguishes between two constructions carrying the Ocior name. Ocior is a transaction-oriented asynchronous BFT consensus protocol with threshold-signature-based fast finality and adaptive security (Chen, 1 Sep 2025). OciorABA is a multi-valued asynchronous Byzantine agreement protocol that is error-free and information-theoretically secure, and it uses APVA as a key building block (Chen, 20 Jan 2025).

Protocol	Problem setting	Core stated properties
Ocior	Practical asynchronous BFT consensus	Leaderless, parallel instances, two-round finality for legitimate two-party transactions, $O(n)$ expected communication per transaction
OciorABA	Multi-valued asynchronous Byzantine agreement	Error-free, information-theoretically secure, APVA-based, $O(n\ell + n^3 \log q)$ expected communication bits

The distinction is substantive. Ocior is framed as a protocol for transaction finalization in a fully asynchronous network with authenticated channels, threshold signatures, epochal key refresh, and adaptive Byzantine corruption. OciorABA is framed as an ABA construction without cryptographic hardness assumptions, apart from the availability of a common-coin primitive. A common misconception would be to treat them as interchangeable formulations of the same protocol. The papers instead describe different agreement tasks, different proof models, and different implementation mechanisms.

2. System model and resilience assumptions

Both protocols operate under the optimal resilience condition

$n \ge 3t + 1,$

where up to $t$ nodes may be Byzantine. This shared threshold places both constructions within the standard optimal regime for asynchronous Byzantine agreement (Chen, 1 Sep 2025).

For Ocior, the network model is fully asynchronous point-to-point links: messages between honest nodes may be delayed arbitrarily but eventually arrive and cannot be forged because the channels are authenticated. There is no global clock and no known upper bound on message delay. The protocol measures an asynchronous round as one send plus one receive step. The adversary is adaptive Byzantine, may corrupt nodes at any time subject to the bound $t$, and the protocol assumes $n \ge 3t+1$ throughout (Chen, 1 Sep 2025).

For OciorABA, communication is likewise asynchronous in the sense that messages may be delayed arbitrarily but eventually arrive. The protocol is explicitly error-free if it satisfies agreement, validity, and termination in every execution, and information-theoretically secure if it does so without computational hardness assumptions. The only non-information-theoretic assumption stated is the availability of a common-coin primitive (Chen, 20 Jan 2025).

This contrast is central to the protocol family’s interpretation. Ocior targets practical consensus with cryptographic acceleration and adaptive-security machinery. OciorABA targets the ABA problem with no signatures or hash functions and pursues information-theoretic guarantees. The common ground is asynchronous operation and optimal Byzantine resilience; the divergence is in the operational layer at which each protocol is meant to function.

3. Ocior consensus workflow

Ocior departs from classic single-block protocols in two stated ways: it is leaderless, and it runs parallel instances in which every incoming transaction spawns a fresh two-round “Propose→Vote” instance rather than being batched into a single leader proposal (Chen, 1 Sep 2025). Each of the $n$ nodes maintains its own chain and proposes transactions independently.

The protocol proceeds in epochs $O(n\ell + n^3 \log q)$0. Before epoch $O(n\ell + n^3 \log q)$1 starts, nodes run an asynchronous DKG to obtain fresh TS/LTS keys for that epoch, and old secret shares are erased. On node $O(n\ell + n^3 \log q)$2’s chain, heights increase as $O(n\ell + n^3 \log q)$3. At height $O(n\ell + n^3 \log q)$4, node $O(n\ell + n^3 \log q)$5 proposes a transaction $O(n\ell + n^3 \log q)$6 together with a virtual parent signature $O(n\ell + n^3 \log q)$7, defined as the threshold signature at height $O(n\ell + n^3 \log q)$8 on its own chain, and official parent signatures $O(n\ell + n^3 \log q)$9 on the parent transaction(s) cited in $O(1)$0. A proposal message has the form

$O(1)$1

where $O(1)$2 is the node’s $O(1)$3-th proposal in epoch $O(1)$4 (Chen, 1 Sep 2025).

Finality is obtained in two asynchronous rounds for a stated good case. In Round 1 (Propose), proposer $O(1)$5 multicasts the proposal. In Round 2 (Vote), after validating the virtual parent, the parents, and the correctness of $O(1)$6, each honest node $O(1)$7 returns two partial signatures:

$O(1)$8

$O(1)$9

where

$O(n)$0

As soon as the proposer collects

$O(n)$1

valid TS partial shares, it combines them into a full threshold signature $O(n)$2 via $O(n)$3. The pair $O(n)$4 is the Type I APS (Chen, 1 Sep 2025).

The protocol’s liveness claim is framed as stable liveness in a leaderless setting. No designated proposer exists; every node may propose at high rate, up to a configured per-epoch cap. Continuous progress is stated to be guaranteed as long as at least one honest proposer remains uncorrupted and transactions remain legitimate. A second common misconception is therefore that leaderlessness implies the absence of ordering structure. In Ocior, leaderlessness coexists with per-node chains, parent-signature dependencies, and explicit epochal state.

4. OciorBLSts and threshold-signature acceleration

A central component of Ocior is OciorBLSts, described as a novel non-interactive threshold signature scheme that offers fast signature aggregation, is adaptively secure, and supports Instantaneous TS Aggregation, meaning that partial signatures can be aggregated in real time as they arrive (Chen, 1 Sep 2025). The protocol states that this reduces waiting time and improves responsiveness.

OciorBLSts combines one standard BLS-style threshold signature scheme with one or multiple Layered Threshold Signature (LTS) structures. In the TS layer, the setup provides public parameters $O(n)$5, DKG yields a public key $O(n)$6 and shares $O(n)$7, and a partial signature is

$O(n)$8

The verification equation is

$O(n)$9

For a set $O(n\ell + n^3 \log q)$0 of at least $O(n\ell + n^3 \log q)$1 shares, combination is

$O(n\ell + n^3 \log q)$2

and the final signature verifies by

$O(n\ell + n^3 \log q)$3

The LTS structure defines $O(n\ell + n^3 \log q)$4 layers with parameters $O(n\ell + n^3 \log q)$5, satisfying $O(n\ell + n^3 \log q)$6 and $O(n\ell + n^3 \log q)$7. Bottom-layer shares are partitioned into groups, and whenever enough child shares arrive, they are combined immediately and propagated upward without waiting for all upper-level inputs. This is the mechanism behind the paper’s instantaneous aggregation property (Chen, 1 Sep 2025).

The stated security goals include TS-ROB-ACMA, TS-UNF-ACMA, LTS good-case robustness, LTS unforgeability, and adaptive security in algebraic group model under one-more discrete-log hardness. The stated computational cost is $O(n\ell + n^3 \log q)$8 group multiplications in the best case when the good LTS path succeeds, and $O(n\ell + n^3 \log q)$9 in the worst case when the protocol falls back to full BLS threshold combination (Chen, 1 Sep 2025).

Within the Ocior construction, this signature subsystem is not ancillary. It is the mechanism through which the protocol seeks to reconcile asynchronous operation with low proposer CPU cost and two-round good-case finality. The paper’s complexity claims for the consensus layer are tightly coupled to the existence of fast, non-interactive threshold aggregation.

5. OciorABA and the APVA primitive

OciorABA studies multi-valued asynchronous Byzantine agreement on an $n \ge 3t + 1,$0-bit message $n \ge 3t + 1,$1 and introduces Asynchronous Partial Vector Agreement (APVA) as a new primitive (Chen, 20 Jan 2025). In APVA, each node $n \ge 3t + 1,$2 inputs a length-$n \ge 3t + 1,$3 vector

$n \ge 3t + 1,$4

where $n \ge 3t + 1,$5 denotes a missing or unknown entry. Honest nodes must eventually output the same vector

$n \ge 3t + 1,$6

APVA guarantees three stated properties. Consistency (Agreement) requires that if any honest node outputs $n \ge 3t + 1,$7, every honest node outputs $n \ge 3t + 1,$8. Validity requires that, for each index $n \ge 3t + 1,$9 with $t$0, there exists at least one honest node $t$1 whose input has $t$2, and the number of non-$t$3 entries in $t$4 is at least $t$5. Termination requires eventual output when every honest node’s input vector has non-$t$6 values in some common set of at least $t$7 positions (Chen, 20 Jan 2025).

The APVA protocol interleaves four components: an ACID instance to share each node’s entire input vector, repeated rounds indexed by $t$8 in which a CommonCoin elects a candidate node $t$9, a two-phase binary subroutine built from ABBBA + ABBA to decide whether to adopt node $t$0’s vector, and then a coordinate-wise confirmation using $t$1 parallel ABBBA+ABBA instances if the candidate vector is adopted. The paper describes ACID as Asynchronous Complete Information Dispersal and uses RBC to deliver candidate vectors (Chen, 20 Jan 2025).

OciorABA itself uses exactly one instance of APVA plus $t$2 reliable broadcasts. Each node encodes its $t$3-bit input under an $t$4 erasure code over an alphabet $t$5 of size $t$6, producing symbols

$t$7

such that any $t$8 distinct symbols suffice to decode the original message. Node $t$9 RBC-broadcasts $n \ge 3t+1$0. Each node then forms a local indicator vector by comparing received symbols to its own codeword symbols, runs one APVA instance on these vectors, obtains a common vector $n \ge 3t+1$1, and decides as follows: if fewer than $n \ge 3t+1$2 coordinates equal $n \ge 3t+1$3, it outputs the indicator vector; otherwise it selects any $n \ge 3t+1$4 such indices, fetches the corresponding RBC outputs, and decodes the message (Chen, 20 Jan 2025).

The protocol’s stated complexity is expected communication complexity $n \ge 3t+1$5 bits and expected round complexity $n \ge 3t+1$6 rounds under $n \ge 3t+1$7 (Chen, 20 Jan 2025). The role of the erasure code is explicit: broadcasting a single coded fragment per node reduces the $n \ge 3t+1$8-dependent cost from the $n \ge 3t+1$9 behavior that would arise if every node RBC-broadcast the full message.

6. Complexity, performance, and conceptual distinctions

Ocior and OciorABA optimize different objects. For Ocior, the communication claim is $n$0 expected communication per transaction, or $n$1 in bits when CTS signatures have size $n$2. The computation claim is $n$3 in the best case and $n$4 in the worst case. The round claim is two asynchronous rounds for two-party transactions (Type I) in the good case, and the paper’s performance table states 4 rounds for general ones. It also reports millions of transactions/sec and sub-second finality in 128-node geo-distributed experiments (e.g., 200 ms end-to-end) (Chen, 1 Sep 2025).

For OciorABA, the dominant metric is expected bit complexity for multi-valued ABA on an $n$5-bit message. The protocol achieves $n$6 bits and $n$7 expected rounds, and the paper positions this against prior error-free asynchronous ABA protocols cited there: Patra ’11 with $n$8 bits and Nayak et al. ’20 with $n$9 bits, both at $O(n\ell + n^3 \log q)$00 rounds, as well as Li–Chen ’21 with $O(n\ell + n^3 \log q)$01 and $O(n\ell + n^3 \log q)$02 bits (Chen, 20 Jan 2025).

Several conceptual distinctions follow directly from these descriptions. First, two-round finality in Ocior is not a blanket statement about all agreement tasks; it is stated for a legitimate two-party transaction in the good case, where the transaction is proposed by any honest node. Second, leaderless in Ocior does not mean the absence of concurrency control; rather, the system uses per-node chains, parent-signature dependencies, and per-transaction instances. Third, OciorABA’s error-free and information-theoretic formulation is not inherited by Ocior. Ocior instead relies on threshold signatures, DKG, adaptive-security assumptions in the algebraic group model, and epochal key refresh.

Taken together, the Ocior literature represents two adjacent lines of asynchronous Byzantine protocol design. One line prioritizes practical transaction finalization with threshold-signature acceleration and leaderless concurrency; the other prioritizes error-free, information-theoretic multi-valued ABA via APVA and erasure-coded reliable broadcast. Their shared resilience threshold $O(n\ell + n^3 \log q)$03 and their emphasis on low asynchronous round complexity give the name “Ocior” a coherent thematic identity, even though the underlying mechanisms and formal objectives differ substantially (Chen, 1 Sep 2025).