Redmond, WA, United States of America

Sreeram Kannan


Average Co-Inventor Count = 5.0

ph-index = 1

Forward Citations = 2(Granted Patents)


Company Filing History:


Years Active: 2022

Loading Chart...
2 patents (USPTO):Explore Patents

Title: Sreeram Kannan: Innovator in Digital Tree Technologies

Introduction

Sreeram Kannan is a notable inventor based in Redmond, WA (US). He has made significant contributions to the field of digital tree technologies, holding 2 patents that showcase his innovative approach to data availability and verification.

Latest Patents

Kannan's latest patents include groundbreaking work on determining data availability. This patent involves performing a data availability challenge with respect to a claimer node to ascertain whether the node stores elements included in a base layer of a digital tree corresponding to a data entity. Additionally, it covers the process of publishing a first set of elements associated with the base layer and the data availability challenge. Another significant patent focuses on verifying a set of remotely stored data. This includes requesting a first element corresponding to a first leaf in a base layer of a digital tree and receiving a membership proof that enhances confidence in the availability of additional leaves.

Career Highlights

Sreeram Kannan is currently employed at Kaleidoscope Blockchain, Inc., where he continues to develop innovative solutions in the realm of blockchain technology. His work is instrumental in advancing the understanding and application of digital trees in data management.

Collaborations

Kannan collaborates with talented individuals such as Mingchao Yu and Pramod Viswanath, contributing to a dynamic team focused on pushing the boundaries of technology.

Conclusion

Sreeram Kannan's contributions to digital tree technologies and data verification are noteworthy. His innovative patents reflect a commitment to enhancing data management solutions in the blockchain space.

This text is generated by artificial intelligence and may not be accurate.
Please report any incorrect information to support@idiyas.com
Loading…