Patents by Inventor Andrius Dagys

Andrius Dagys has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • HASH SUBTREES FOR GROUPING COMPONENTS BY COMPONENT TYPE
    Publication number: 20220278849
    Abstract: A system for generating a hash tree with components grouped by component type is provided. Each non-leaf node of the hash tree has a hash of the hashes of its child nodes, and a leaf node has a hash of a component of the hash tree. The system generates, for each component type, a component subtree for that component type based on the leaf nodes that have hashes of the components of that component type. The system then generates a root subtree of the hash tree based on leaf nodes that are the root nodes of the component subtrees. The combination of the root subtree and the component subtrees form the hash tree.
    Type: Application
    Filed: March 15, 2022
    Publication date: September 1, 2022
    Inventors: Konstantinos Chalkias, Michael Christopher Hearn, Richard John Parker, Andrius Dagys
  • Hash subtrees for grouping components by component type
    Patent number: 11316696
    Abstract: A system for generating a hash tree with components grouped by component type is provided. Each non-leaf node of the hash tree has a hash of the hashes of its child nodes, and a leaf node has a hash of a component of the hash tree. The system generates, for each component type, a component subtree for that component type based on the leaf nodes that have hashes of the components of that component type. The system then generates a root subtree of the hash tree based on leaf nodes that are the root nodes of the component subtrees. The combination of the root subtree and the component subtrees form the hash tree.
    Type: Grant
    Filed: September 29, 2017
    Date of Patent: April 26, 2022
    Assignee: R3 Ltd.
    Inventors: Konstantinos Chalkias, Michael Christopher Hearn, Richard John Parker, Andrius Dagys
  • HASH SUBTREES FOR GROUPING COMPONENTS BY COMPONENT TYPE
    Publication number: 20190103973
    Abstract: A system for generating a hash tree with components grouped by component type is provided. Each non-leaf node of the hash tree has a hash of the hashes of its child nodes, and a leaf node has a hash of a component of the hash tree. The system generates, for each component type, a component subtree for that component type based on the leaf nodes that have hashes of the components of that component type. The system then generates a root subtree of the hash tree based on leaf nodes that are the root nodes of the component subtrees. The combination of the root subtree and the component subtrees form the hash tree.
    Type: Application
    Filed: September 29, 2017
    Publication date: April 4, 2019
    Inventors: Konstantinos Chalkias, Michael Christopher Hearn, Rick Parker, Andrius Dagys