Abstract: This document describes low-latency Bluetooth connectivity in a wireless network in which a central node and a peripheral node establish a connection. During a first connection interval, the peripheral node receives a packet from the central node to synchronize communication with the central node, and based on receiving the packet, the peripheral node transmits a first fixed-length packet. If the first fixed-length packet fails to reach the central node, the peripheral node does not receive an acknowledgement, ACK, from the central node during the first connection interval and retransmits the first fixed-length packet during the first connection interval.

Abstract: This document describes low-latency Bluetooth connectivity in a wireless network in which a central node and a peripheral node establish a connection. During a first connection interval, the peripheral node receives a packet from the central node to synchronize communication with the central node, and based on receiving the packet, the peripheral node transmits a first fixed-length packet. If the first fixed-length packet fails to reach the central node, the peripheral node does not receive an acknowledgement, ACK, from the central node during the first connection interval and retransmits the first fixed-length packet during the first connection interval.

Abstract: A method for generating a random number is used for a plurality of blocks in a blockchain. The method comprises the steps of: selecting a committee comprising a subset of nodes from the blockchain; executing a distributed key generation to generate a share key and a public key at each of the nodes, wherein the public key further comprises a set of verification keys; broadcasting a share signature from each of the nodes; executing a threshold signature at each of the nodes when a new block is generated; and executing a random number which is a hash value of the threshold signature which is combined from a plurality of partial signature generated from the nodes.

Abstract: A method for building agreements among a plurality of nodes in a distributed system to improve the throughput of the distributed system is disclosed. The method comprises performing a first Byzantine Agreement protocol; selecting a first leader node from the plurality of nodes; broadcasting a fast message from the first leader node to all other nodes when a clock is equal to 0; determining whether the first leader node decides a block according to a number of a plurality of fast-vote messages received from all other nodes by the first leader node and a value of the clock; and performing a second Byzantine Agreement protocol if it is determined that the first leader node cannot decide a block.

Abstract: A method for a node to issue a new block is used for a distributed system in which transactions and records are organized in block. The method comprises the steps of: determining a value R from a common reference string; computing a value s associated to a value of a status with a private key at a node, wherein the private key is a private signing key corresponding to the node, and the value s can only be computed by the node with the private key; computing a value r by taking the value s into a function H at the node, wherein the value r is unpredictable and unique to other nodes; and determining whether the node obtains a right to issue a new block by taking the values R and r into a function V.