Paul Banks
Engineer, Storage (Neon Lakebase) at Databricks
Teignbridge, England, United Kingdom
Summary
🤩
Rockstar🎓
Top SchoolPaul Banks is an experienced storage and distributed systems engineer with 16 years building resilient infrastructure and database-backed services, currently working on Neon Lakebase at Databricks. He spent a decade at HashiCorp driving Consul and Vault architecture and execution—shaping product strategy, federation models, and high-availability backends while mentoring growing teams. A pragmatic systems developer, Paul’s open-source contributions to projects like hashicorp/raft, go-memdb and the immutable radix tree showcase deep expertise in consensus, in-memory indexing, and correctness via fuzz testing. He pairs hands-on performance and reliability work (hot-reloadable timing, iterator optimizations, race fixes) with product-minded proposals that became operational features. Based in Teignbridge, UK, he brings rare breadth from low-level C++ daemons to cloud-native service mesh and platform engineering. Collected evidence of his craft includes critical fixes and range-scan features that improve both observability and real-time behaviour in widely used infrastructure libraries.
16 years of coding experience
18 years of employment as a software developer
BSc, Music Systems Engineering, First Class, BSc, Music Systems Engineering, First Class at University of the West of England
Github Skills (36)
algorithm10
algorithms10
messaging10
redis10
testing10
distributed-systems10
data-structure10
consul10
go10
radix-tree10
data-structures10
raft10
iterator10
pubsub10
scalability10
Programming languages (16)
Github contributions (5)
hashicorp/go-immutable-radix
May 2019 - Jun 2021
An immutable radix tree implementation in Golang
Role in this project:
Back-end Developer
Back-end DeveloperContributions:2 releases, 5 reviews, 11 commits in 2 years 2 months
Contributions summary:Paul primarily focused on implementing and testing a `SeekLowerBound` function for the radix tree, enhancing its range scan capabilities. They developed fuzz tests to ensure the correctness of the algorithm and addressed a critical bug related to prefix keys. Their contributions involved modifying the iterator and node structures to support the new functionality and improve the overall efficiency and reliability of the radix tree implementation.
golangoomradix-treeimmutablehashmap
hashicorp/go-memdb
May 2019 - Mar 2020
Golang in-memory database built on immutable radix trees
Role in this project:Back-end Developer
Back-end DeveloperContributions:5 releases, 15 reviews, 8 commits in 10 months
Contributions summary:Paul primarily contributed to the `go-memdb` project by implementing core database functionalities, specifically lower bound range scans and change tracking. Their work involved modifying existing code and adding new features related to indexing and data retrieval within the in-memory database. The user's commits also included refactoring code for better structure and utilizing a released version of an immutable radix tree library to support the new functionalities. These contributions enhanced the database's capabilities for efficient data access and change management.
golangmemorylrutransactionalgo
Find and Hire Top DevelopersWe’ve analyzed the programming source code of over 60 million software developers on GitHub and scored them by 50,000 skills. Sign-up on Prog,AI to search for software developers.