We present the Internet Computer Consensus (ICC) family of protocols for atomic broadcast (a.k.a., consensus), which underpin the Byzantine fault-tolerant replicated state machines of the Internet Computer. The ICC protocols are leader-based protocols that assume partial synchrony, and that are fully integrated with a blockchain. The leader changes probabilistically in every round. These protocols are simple and robust: in any round where the leader is corrupt (which itself happens with probability less than 1/3) or the network is asynchronous, each ICC protocol will effectively allow other parties to step in and propose blocks for that round and to move the protocol forward to the next round. In case there was no agreement on a single block in a round, a decision for this round will be taken in a later round with synchronous network behavior and an honest leader. The task of reliably disseminating the blocks to all parties is an integral part the protocol. We present three different protocols, along with various minor variations on each. The first of these protocols (ICC0) illustrates the combination of the main building blocks in a simplified manner for an easier presentation and analysis. Protocol ICC1 is designed to be integrated with a peer-to-peer gossip sub-layer, which reduces the bottleneck created at the leader for disseminating large blocks, a problem that all leader-based protocols must address. Our Protocol ICC2 addresses the same problem by substituting a lowcommunication reliable broadcast subprotocol (which may be of independent interest) for the gossip sub-layer.

Today's advanced driver assistance systems (ADAS) are increasingly becoming more complex. The next step in this direction is the development of automated driving systems. However, along with the complexity, the effort required for development and validation of these systems is increasing as well. In order to be able to master this complexity in terms of cost and time, simulations are being used more frequently. Since perception sensors are essential for highly and fully automated systems, it is important to have valid sensor models for the development and validation of such systems. Therefore, in this paper we present a method for the validation of perception sensor models. The method differs from known approaches by its two-step procedure. First we directly compare the experimental results and the model output. Then the output of the next tier in the system, using real and synthetic data from sensor model as input, is compared. We also show the tool chain for implementation along with first results, confirming the potential of our approach.

This article consists of a collection of slides from the author's conference presentation on the special features, system design and architectures, processing capabilities, and targeted markets for CoinTerra's Goldstrike, a first generation crypto-currency processor for Bitcoin mining machines.

The isomorphism problem means to decide if two given finite-dimensional simple algebras with center K are K-isomorphic and, if so, to construct a K-isomorphism between them. Applications lie in computational aspects of representation theory, algebraic geometry and Brauer group theory. The paper presents an algorithm for cyclic algebras that reduces the isomorphism problem to field theory and thus provides a solution if certain field theoretic problems including norm equations can be solved (this is satisfied over number fields). As an application, we can compute all automorphisms of any given cyclic algebra over a number field. A detailed example is provided which leads to the construction of an explicit noncrossed product division algebra.