Evaluating Deterministic BFT Finality within a Confidential UTXO State Machine

FinalisCore represents a novel open-source, from-scratch Layer-1 protocol implemented in C++. It seeks to combine strict deterministic finality with UTXO-based ledger architecture and enforce robust transactional privacy from genesis. The protocol addresses the limitations of probabilistic consensus models by implementing deterministic Byzantine Fault Tolerant (BFT) state transitions. Instead of relying on longest-chain rules, which allow deep chain reorganizations and introduce rolling probabilistic risks, FinalisCore advances its ledger in bounded epochs of 32 blocks. Blocks reach instant finalization when a cryptographic quorum—specifically, floor(2N/3) + 1 of the epoch's validator committee—signs off on the block hash. State progression operates through absolute increments, with new committees being deterministically selected each epoch based on historical stake records within the finalized chain database.

Privacy within FinalisCore is ensured natively through the use of the secp256k1-zkp cryptographic library, drawing inspiration from Elements/Liquid’s implementations. This enables validators to confirm that transaction inputs and outputs are balanced using only homomorphic addition, thereby never exposing actual asset amounts. Such a structure allows for the validation of balance equations without sacrificing confidentiality, reinforcing both privacy and functional auditability at the protocol level.

The protocol has entered its initial public testing phase, dubbed testnet-1, where its liveness and safety properties under various network partition scenarios are actively monitored. Formal specification and validation have been achieved through TLA+, ensuring rigor in design assumptions and implementation. As decentralization efforts progress—from a single bootstrap validator to a wider subset of independent node operators—the development team is soliciting technical feedback regarding certain architectural challenges.

One primary concern involves mempool invalidation during rapid committee rotations inherent to deterministic finality. When validator leadership changes swiftly, input selection in UTXO architectures can become fragile, especially if newly established committees introduce tighter propagation requirements. This raises questions about how dynamic wallet pipelines might adapt to such conditions, preserving reliability and user experience amid shifting consensus structures.

Another challenge centers on the computational demands associated with batch-verifying Pedersen range proofs via secp256k1-zkp. While homomorphic proofs provide strong guarantees for transaction integrity and privacy, their verification incurs significant CPU overhead, particularly under standard consumer hardware. This bottleneck threatens to breach targeted three-minute block intervals during heavy simulation loads. The community is invited to suggest possible optimizations, including parallelization strategies or cache-locality enhancements within the secp256k1-zkp framework, to alleviate these constraints.

The project is openly licensed under MIT, with comprehensive technical resources available for review and contribution. Interested contributors can access the FinalisCore repository, the Technical Whitepaper, and the Testnet Setup Guide. All activity on the testnet is strictly non-commercial, with FLS tokens used purely for experimental bonding and governance, holding no real-world economic value. The initiative invites thorough code reviews, architectural critiques, and protocol-level insights from the broader development community.