Leander Jehl

Leander Jehl

Auto-generated profile, based on publicly available information

Leander Jehl

University of Stavanger, Stavanger, Norway

Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
24 June 2025 in Computer Science Review
Verified
Journal Article
Open access
PMPraveensankar Manimaran
Praveensankar Manimaran
TGThiago Garrett
Thiago Garrett
LJLeander Jehl
Leander Jehl
RVRoman Vitenberg
Roman Vitenberg

19 June 2023
Verified
Conference Paper
Open access
HGHanish Gogada
Hanish Gogada
HMHein Meling
Hein Meling
LJLeander Jehl
Leander Jehl
JOJohn Ingve Olsen
John Ingve Olsen
HotStuff is a Byzantine fault-tolerant state machine replication protocol that incurs linear communication costs to achieve consensus. This linear scalability promoted the protocol to be adopted as the consensus mechanism in permissioned blockchains. This paper discusses the architecture, testing, and evaluation of our extensible framework to implement HotStuff and its variants. The framework already contains three HotStuff variants and other interchangeable components for cryptographic operations and leader selection. Inspired by the Twins approach, we also provide a testing framework for validating protocol implementations by inducing Byzantine behaviors. Test generation is protocol-agnostic; new protocols can execute the test suite with little-to-no modifications. We report relevant insights on how we benefited from Twins for validation and test-driven development. Leveraging our deployment tool, we evaluated our implementation in various configurations.

1 July 2019
Verified
Conference Paper
Closed access
LJLeander Jehl
Leander Jehl
Systems tolerating arbitrary failures use significant resources to constantly mask omission and timing failures from faulty processes. This paper presents Quorum Selection, a mechanism that allows to select well functioning processes for active participation in a system. Different from previous work, Quorum Selection not only excludes provably faulty processes that deviated from the protocol, but also takes omission and timing failures into account, even if they only affect individual links. We present a system architecture for Quorum Selection, including a novel failure detector that uses expectations to detect omission and timing failures in a Byzantine environment. We investigate how often an adversary may cause the quorum to changes. We show a quadratic lower bound for general Quorum Selection, but we also define a special case of Quorum Selection for leader based systems that requires trying at most 6f quorums.

26 April 2026
Verified
Conference Paper
Open access
HGHanish Gogada
Hanish Gogada
CBChristian Berger
Christian Berger
LJLeander Jehl
Leander Jehl
HRHans P. Reiser
Hans P. Reiser
HMHein Meling
Hein Meling

2 September 2026
Verified
Conference Paper
Open access
LALennart Almstedt
Lennart Almstedt
LJLeander Jehl
Leander Jehl
LWLars Wolf
Lars Wolf

27 March 2023
Verified
Conference Paper
Open access
HGHanish Gogada
Hanish Gogada
JOJohn Olsen
John Olsen
HMHein Meling
Hein Meling
LJLeander Jehl
Leander Jehl
HotStuff is a Byzantine fault-tolerant state machine replication protocol that incurs linear communication costs to achieve consensus. This linear scalability promoted the protocol to be adopted as the consensus mechanism in permissioned blockchains. This paper discusses the architecture and evaluation of our extensible framework to implement three HotStuff variants. This reimplementation demonstrates the extensibility of our framework to implement other HotStuff-like protocols. Leveraging our deployment tool, we evaluated our implementation on a wide variety of configurations.