Armon Dadgar
Seattle, Washington, United States
Summary
🤩
RockstarArmon Dadgar is a co-founder and CTO with 15+ years building secure, distributed systems and developer tooling, now leading HashiCorp’s technology vision as part of IBM. He architected and implemented core components of industry-leading open-source projects like Terraform, Vault, Consul, and memberlist, translating real-world operational pain points into production-grade DevOps software. A hands-on engineer with deep networking and systems expertise, his contributions span gossip protocols, in-memory datastores, multiplexing, and secret/back-end storage implementations. He leads HashiCorp Research, bridging academic security research with industrial-scale product engineering to harden cloud infrastructure. Known for shipping pragmatic, well-tested code across languages (notably Go and C), he also has a track record of scaling low-latency systems in production at high request volumes. Based in Seattle, he pairs product strategy with day-to-day engineering execution and an emphasis on reproducible, auditable infrastructure.
15 years of coding experience
Github Skills (83)
transaction10
statsd10
python10
testing10
authentication10
c1110
render10
terraform10
c1710
consul10
automation10
infrastructure10
automation-testing10
dns10
inmemory-cache10
Programming languages (13)
Github contributions (5)
hashicorp/golang-lru
Aug 2014 - Feb 2018
Golang LRU cache
Role in this project:
Back-end Developer
Back-end DeveloperContributions:44 commits, 20 PRs, 22 pushes in 3 years 6 months
Contributions summary:Armon primarily contributed to the implementation of an LRU (Least Recently Used) cache in Go. Their initial commit established the basic structure of the cache, followed by the addition of a Purge method to clear the cache. The user then expanded the project by incorporating a non-thread safe LRU cache within an internal package. Further work included refactoring the code to use the internal package and making improvements to the ARC cache implementation.
golanglru
armon/libart
May 2013 - Feb 2021
Adaptive Radix Trees implemented in C
Role in this project:Back-end Developer
Back-end DeveloperContributions:47 commits, 17 PRs, 17 pushes in 7 years 10 months
Contributions summary:Armon contributed to the implementation of an Adaptive Radix Tree (ART) data structure in C. Their work involved adding dependencies, including the check library, and implementing core functionalities like iteration and prefix matching. They also added tests to validate the insert, search, delete, and iteration features, including tests for long prefixes and random UUIDs, indicating a focus on ensuring the data structure's correctness and performance. The user's changes highlight their expertise in developing and testing data structures.
radix-tree
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.