Non-Abelian Proca model based on the improved BFT formalism

We present the newly improved Batalin-Fradkin-Tyutin (BFT) Hamiltonian formalism and the generalization to the Lagrangian formulation, which provide the much more simple and transparent insight to the usual BFT method, with application to the non-Abelian Proca model which has been an difficult problem in the usual BFT method. The infinite terms of the effectively first class constraints can be made to be the regular power series forms by ingenious choice of $X_{\alpha \beta}$ and $\omega^{\alpha \beta}$-matrices. In this new method, the first class Hamiltonian, which also needs infinite correction terms is obtained simply by replacing the original variables in the original Hamiltonian with the BFT physical variables. Remarkably all the infinite correction terms can be expressed in the compact exponential form. We also show that in our model the Poisson brackets of the BFT physical variables in the extended phase space are the same structure as the Dirac brackets of the original phase space variables. With the help of both our newly developed Lagrangian formulation and Hamilton's equations of motion, we obtain the desired classical Lagrangian corresponding to the first class Hamiltonian which can be reduced to the generalized St\"uckelberg Lagrangian which is non-trivial conjecture in our infinitely many terms involved in Hamiltonian and Lagrangian.Comment: Notable improvements in Sec. I

Generalized BFT Formalism of Electroweak Theory in the Unitary Gauge

We systematically embed the SU(2)$\times$U(1) Higgs model in the unitary gauge into a fully gauge-invariant theory by following the generalized BFT formalism. We also suggest a novel path to get a first-class Lagrangian directly from the original second-class one using the BFT fields.Comment: 14 pages, Latex, no figure

A Byzantine Fault-Tolerant Ordering Service for the Hyperledger Fabric Blockchain Platform

Hyperledger Fabric (HLF) is a flexible permissioned blockchain platform designed for business applications beyond the basic digital coin addressed by Bitcoin and other existing networks. A key property of HLF is its extensibility, and in particular the support for multiple ordering services for building the blockchain. Nonetheless, the version 1.0 was launched in early 2017 without an implementation of a Byzantine fault-tolerant (BFT) ordering service. To overcome this limitation, we designed, implemented, and evaluated a BFT ordering service for HLF on top of the BFT-SMaRt state machine replication/consensus library, implementing also optimizations for wide-area deployment. Our results show that HLF with our ordering service can achieve up to ten thousand transactions per second and write a transaction irrevocably in the blockchain in half a second, even with peers spread in different continents

FairLedger: A Fair Blockchain Protocol for Financial Institutions

Financial institutions are currently looking into technologies for permissioned blockchains. A major effort in this direction is Hyperledger, an open source project hosted by the Linux Foundation and backed by a consortium of over a hundred companies. A key component in permissioned blockchain protocols is a byzantine fault tolerant (BFT) consensus engine that orders transactions. However, currently available BFT solutions in Hyperledger (as well as in the literature at large) are inadequate for financial settings; they are not designed to ensure fairness or to tolerate selfish behavior that arises when financial institutions strive to maximize their own profit. We present FairLedger, a permissioned blockchain BFT protocol, which is fair, designed to deal with rational behavior, and, no less important, easy to understand and implement. The secret sauce of our protocol is a new communication abstraction, called detectable all-to-all (DA2A), which allows us to detect participants (byzantine or rational) that deviate from the protocol, and punish them. We implement FairLedger in the Hyperledger open source project, using Iroha framework, one of the biggest projects therein. To evaluate FairLegder's performance, we also implement it in the PBFT framework and compare the two protocols. Our results show that in failure-free scenarios FairLedger achieves better throughput than both Iroha's implementation and PBFT in wide-area settings