I intend to start a master's degree in distributed systems(more specifically in permissionless distributed ledgers scalability) and would like to know which math subfields are important to develop meaningful work in this field.
The idea is that the state of a distributed computation can be represented as a simplicial complex (think "graph" only in higher dimensions), and that steps in a protocol correspond to continuous transformations applied to the complex.
The result is that significant distributed computing problems get reduced to well-known results from combinatorial topology, and they "just fall out".