The Philos Trust Algorithm: Preventing Exploitation of Distributed Trust

TL;DR

The paper introduces the Philos Trust Algorithm, a novel trust-based consensus mechanism for hierarchical blockchain systems, which prevents exploitation by misbehaving nodes through participant limits, enhancing scalability and security.

Contribution

It formally defines the Philos trust algorithm and demonstrates how it can prevent strategic exploitation, improving trust management in hierarchical blockchains.

Findings

Trust algorithm effectively assigns node scores based on performance.

Enforcing participant limits prevents exploitation of the trust system.

The architecture improves scalability over traditional linear blockchains.

Abstract

The Philos Marketplace blockchain system is a proposed hierarchical blockchain architecture which allows a large number of individual blockchains to operate in parallel. These parallel chains achieve consensus among one another on a limited set of core operations, while allowing each on-chain application to manage its own data independently of others. This architecture addresses the scalability issues of traditional linear blockchains, but requires novel consensus mechanisms. A central feature of the Philos consensus mechanism is its trust algorithm, which assigns each network node a numerical trust value (or score) indicating the quality of recent past performance. This trust value is then used to determine a node's voting weight at the higher levels of consensus. In this paper, we formally define the Philos trust algorithm, and provide several illustrations of its operation, both theoretically and empirically. We also ask whether a misbehaving node can strategically exploit the algorithm for its personal gain, and show that this type of exploitation can be universally prevented simply by enforcing a mild limit on the number of participants in each of the parallel chains.