A hybrid-decentralized network based on a blockchain data structure

Abstract

The invention regards a hybrid-decentralized network system comprising a master block chain, said master block chain comprising a plurality of master block chain blocks arranged in a master linear structure, wherein each of the master block chain blocks comprises a hash tree structure, said hash tree structure comprising a plurality of leaf 5 nodes, wherein each of the plurality of leaf nodes comprises a user block chain arranged in a user hash tree structure. A computer-implemented method for verifying a hybrid-decentralized network based on a hash tree structure is also disclosed.

Description

[0001] A hybrid-decentralized network based on a blockchain data structure

[0002] The present disclosure relates to a hybrid-decentralized network system based on a blockchain data structure.

[0003] Background

[0004] Social media platforms have revolutionized the way people connect, share information, and engage with each other online. However, these platforms have raised significant concerns regarding privacy and ownership of content. Privacy concerns remains one major issue, since social media platforms collect vast amounts of personal data from their users. This data is often used for targeted advertising, personalized content, and algorithmic recommendations. Privacy concerns can arise because of data misuse, lack of control or targeted advertising.

[0005] There have been instances where social media companies mishandled user data or shared it with this parties without proper consent. Users have limited control over their data once it is shared on social media. Privacy settings can be complex and confusing, leading to inadvertent disclosure of sensitive information. Moreover, social media platforms rely on targeted advertising based on user data. While this practice enables personalized content, it also raises concerns about the manipulation of user behavior.

[0006] Social media platforms provide users with the ability to create and share various forms of content, such as photos, videos, and written posts. Users may find their content used by others without proper attribution or compensation. Copyright infringement and intellectual property disputes are common, as social media platforms struggle to regulate the vast amount of content being shared.

[0007] Last, social media platforms have introduced new challenges to mental health, wellbeing, and societal dynamics. Algorithms designed to maximize engagement can create echo chambers, reinforcing existing beliefs and amplifying divisive content. This can contribute to polarization and the spread of misinformation. Harassment can be facilitated, impacting users’ emotional well-being and safety.

[0008] Addressing these issues requires a different approach than the current social media platforms, involving improved privacy regulations, ensure content ownership and protect the well-being of social media users. Summary

[0009] Thus, there exists a need for a hybrid-decentralized network system, where the content of the hybrid-decentralized network system can be verified. As disclosed herein this can be achieved by a hybrid-decentralized network system comprising a master block chain, said master block chain comprising a plurality of master block chain blocks arranged in a master linear structure, wherein each of the master block chain blocks comprises a hash tree structure, said hash tree structure comprising a plurality of leaf nodes, wherein each of the plurality of leaf nodes comprises a user block chain arranged in a user hash tree structure.

[0010] By having a hybrid-decentralized network system tailored for digital ownership and reality anchoring, users of the hybrid-decentralized network system can automatically digitally and cryptographically signed contents that they share and the ownership of the contents can be proven. Content can potentially be signed without being shared, which may allow users to prove ownership any time, even some years later after the content was signed. In other terms, the hybrid-decentralized network system can provide a block chain structure with cryptographic hashes that may allow digital ownership.

[0011] Moreover, by having a hybrid-decentralized structure, the hybrid-decentralized network system resolves the energy-issue, since all contents provided on the hybrid- decentralized structure may not need to be downloaded by each users of the hybrid- decentralized network system.

[0012] In another aspect, a computer-implemented method for verifying a hybrid-decentralized network based on a hash tree structure is disclosed. The computer-implemented method may comprise the steps of providing a hybrid-decentralized network system comprising a master block chain, said master block chain comprising a plurality of master block chain blocks arranged in a master linear structure, wherein each of the master block chain blocks comprises a hash tree structure; selecting a jury among a plurality of users of the hybrid-decentralized network system; proposing at least one new master block chain block in the master block chain to the jury; verifying the hybrid- decentralized network, wherein the jury approves or rejects the at least one new master block chain block; if the at least one new master block chain block is approved by the jury, settling the at least one new master block chain block.

[0013] As disclosed herein, the computer-implemented method for verifying a hybrid- decentralized network based on a hash tree structure may allow a verification process of the hash tree structures, by a jury selected among a plurality of users of the hybrid- decentralized network. Thus, it is possible to detect any tentative of block chain attack or block chain exploit, guaranteeing the security of the hybrid-decentralized network without having to deploy time and data-consuming methods of verification, such as the well-known Proof of Stake of Proof of Work.

[0014] Description of the drawings

[0015] Various embodiments are described hereinafter with reference to the drawings. The drawings are examples of embodiments and are intended to illustrate some of the features of the presently disclosed hybrid-decentralized network system and computer- implemented method for verifying a hybrid-decentralized network system.

[0016] Fig. 1 shows an embodiment of a diagram of the hybrid-decentralized network system as disclosed herein.

[0017] Fig. 2 shows an embodiment of a user block chain.

[0018] Fig. 3 shows an embodiment of possible actions that a user may perform with the user block chain, wherein (A) shows the user block chain with a genesis block and 4 data blocks, representing NFT contents, (B) shows a request for addition of a fifth data block on the user block chain, (C) shows a request where the user uses or creates a new data block to specify an intention, (D) shows a request of deleting the data blocks 3 and 4, (E) shows a request of user deletion, (F) shows a request of specifically deleting data block 2.

[0019] Fig. 4 shows an embodiment of the computer-implemented method for verifying the hybrid-decentralized network system, where a new block in the blockqueue or master block chain is pending, wherein a jury can verify and approve or reject leader’s proposal of the new block in the blockqueue.

[0020] Fig. 5 shows an embodiment of the different steps to perform a new master block chain block validation in the blockqueue or master block chain, wherein (A) is the step where a leader proposes a new master block chain block comprising a hash tree structure, (B) is the step where a jury is selected pseudo-randomly or randomly, based on user activity, (C) is the step where the jury verify the new block of the master block chain by downloading delta-trees of the new block of the master block chain and each sends their signature with their approval or rejection, (D) is the step where the new block of the blockqueue or master block chain gets approved if more than a certain ratio of the jury-members send their signature.

[0021] Fig. 6 shows an embodiment of a diagram where a delta-tree is illustrated, wherein the delta-tree comprises an update.

[0022] Figs. 7A-B shows embodiments of diagrams where a method of updating a blockqueue is illustrated.

[0023] Figs. 8A-B shows embodiments of diagrams describing the block queue concept, where Bi and B2are two subsequent blocks of the blockqueue.

[0024] Detailed description

[0025] In the present disclosure, the terms blockchain and block chain may be used interchangeably to refer to the same underlying idea, i.e. a blockchain that can consist of a chain of blocks that are securely linked together, possibly via cryptographic hashes. These blocks may be linked together using cryptographic techniques, forming a chronological chain. For the sake of clarity and understanding, both terms may be used synonymously and cannot imply any difference in the technology or its implementation.

[0026] In the present disclosure, the term user may refer to both a physical entity and a nonphysical entity. A user can be any entity that can engage with the hybrid-decentralized network system, whether it is human or non-human, individual or organizational, real or virtual. The concept of a user in the present disclosure can be broad and inclusive, encompassing all entities that may interact with the hybrid-decentralized network system in any meaningful way. For instance, a user can be a human user, i.e. individuals who may access and engage with the platform. A user can be a company user, which is an organization and / or business that can also be a user of the hybrid- decentralized network system. Al-based programs, bots or agents can act as users when they may interact with the hybrid-decentralized network system. Automated systems, devices, virtual entities, data processing systems can also be considered as users as long as they can be configured to interact with the hybrid-decentralized network system.

[0027] In the present disclosure, the term block chain or blockchain can refer to a blockchain structure, but is not limiting to the strict definition of a blockchain. As described in the present disclosure, the hybrid-decentralized network is based on a blockchain data structure, which would mean that the concept of blockchain is used with some modifications that may alter the strict definition of the blockchain. For instance, in some embodiments, the blockchain can be defined as a blockqueue, wherein the first blocks of the blockchain can be deleted or removed while preserving the structure of the hybrid-decentralized network, as defined or disclosed in the present disclosure. For instance, the master blockchain can be defined as a master blockqueue.

[0028] As described in the present disclosure, the term “blockchain” can broadly refer to any cryptographically linked data structure. Such a cryptographically linked data structure can be defined as an arrangement where data may be organized within blocks, and each block may include a cryptographic link, such as a hash, to another block. This linkage forms a chain, where each block is connected to the previous one through its hash, ensuring data integrity and security. A blockchain, in this context, is not limited to linear structures but can encompass any cryptographic linkage of data blocks.

[0029] Each path through a hash tree structure or a Merkle tree structure can be considered a blockchain in itself, where the sibling hashes of different paths within the tree can serve as utility information or additional verification layers. In this broader context, a blockchain could also include various other cryptographically secured structures, whether they are linear, branched, or more complex.

[0030] In the present disclosure, the term “blockchain” is used liberally to describe a wide range of cryptographically linked data structures, encompassing any system where data integrity can be maintained through cryptographic hashing and linking of blocks, irrespective of the specific structure or configuration.

[0031] In the present disclosure, a blockchain can be defined as a list of blocks, wherein each blocks may be a data-container holding a payload, at least one metadata and the previous block’s hash. The payload, metadata and previous block’s hash can be hashed together to form the hash of the block comprised in the blockchain. The payload may refer to the data or information that can be carried out or saved within the block. In other terms, the payload can be what the blockchain may be designed to store securely, and the payload may be comprised in each of the blocks.

[0032] The present disclosure relates to a hybrid-decentralized network system comprising a master block chain, said master block chain comprising a plurality of master block chain blocks, wherein each of the master block chain blocks comprises a hash tree structure.

[0033] Each of the plurality of master block chain blocks may comprise a whole state or entire state of the hybrid-decentralized network, at a given time or timestamp. Each master block chain block can represent a state of the hybrid-decentralized network at a specific and unique timestamp. The succession of the master block chain blocks can represent different state of the hybrid-decentralized network, at different time, thereby with different timestamps.

[0034] In the context of a hybrid-decentralized network, the "state" or “entire state” or “whole state” can refer to the overall status of all nodes and data within the network at a particular moment in time. This may include information stored on each node, the connections and relationships between nodes, and the data being processed or transmitted throughout the network. The state can also involve understanding the roles that nodes play, such as whether they are active or inactive, and where they are located within the network.

[0035] Additionally, the state may encompass the distribution of data across the network, indicating where specific information is stored or accessed. The structure of the network, including how nodes are connected and communicate with each other, may also be part of the state. Furthermore, the state may consider ongoing processes or transactions, such as file transfers, data processing tasks, or messaging activities.

[0036] In a hybrid-decentralized network, the state can be dynamic and continuously changing as nodes join or leave, data is updated or transferred, and various operations are carried out.

[0037] The master block chain blocks can comprise the entire state of the hybrid-decentralized network system at various timestamps. The next master blockchain block in the master blockchain may include an additional update to the hybrid-decentralized network system, marked by a subsequent timestamp, preferably occurring after the timestamp of the previous master blockchain block in the master blockchain. An additional update may comprise deletion or edition of content or metadata comprised in the previous master block chain block. The additional update may comprise an addition of content or metadata in the master block chain block comprising the additional update. In one embodiment, the hybrid-decentralized network system is a hybrid-decentralized social network system. The plurality of users can share contents on the hybrid- decentralized network system. Preferably, the hybrid-decentralized network system may be configured such as the plurality of users can download and / or visualize the contents of each of the plurality of users. Since the contents may be encrypted with a cryptographic hash, an ownership is certified, thereby decreasing the risk of misusing or abusing contents.

[0038] A social network can refer to a digital platform, that may enable users of the social network to connect, interact, and share various forms of content with each other, or with a restricted number of users among the network.

[0039] The hybrid-decentralized network system may comprise a hash tree structure, comprising a plurality of leaf nodes wherein each of the plurality of leaf nodes can comprise a user block chain arranged in a user hash tree structure. The user block chain can comprise a user genesis block and at least one data block. The hash tree structure may comprise every user accounts or user block chains and its associated content. Thereby, the user block chains or user accounts can be publicly visible and provable. Each user account may comprise a user hash tree structure for their own content or data. Advantageously, each user may control, own and sign its associated user hash tree structure, as opposed to individual transactions in contemporary blockchain systems such as cryptocurrency blockchains.

[0040] The user block chain can be owned by a user of the hybrid-decentralized network. The user may own a single key, such as a cryptographic key, such as a quantum cryptographic key, that would give him authorisation to add, update, edit, delete and / or remove content or data from its associated user block chain. Advantageously, each user has their own single key to update the content of their own user block chain, which is a clear advantage compared to contemporary blockchain systems such as cryptocurrency blockchains, wherein each transaction has a new key or address. The trivialized access-management as described in this paragraph can reduce computational burden.

[0041] The at least one data block can comprise at least one non-fungible token. A non- fungible token (NFT) can be a type of digital asset that can represent ownership or proof of authenticity of a unique item or content. Unlike cryptocurrencies, which can be fungible and can be exchanged on a one-to-one basis, a NFT may be indivisible and each one can be distinct. A NFT can be linked to a blockchain, such as, as disclosed herein, a user block chain structure. By linking at least one NFT to a user block chain structure, contents shared by each one of the plurality of users can get a proof of authenticity or a secure record of ownership. Each of the plurality of users can for instance tokenize and potentially sell their contents, that can for instance be digital creations as unique pieces of art.

[0042] A non-fungible token can have some key characteristics summarized below:

[0043] • Uniqueness: Each NFT can be distinct and cannot be replaced or exchanged on a like-for-like basis. This uniqueness can be often tied to digital art, collectibles, virtual real estate, music, videos, in-game items, and / or other contents.

[0044] • Blockchain-Based: A NFT can typically be built on blockchain platforms or networks. These blockchains can ensure the authenticity and provenance of the NFT, as well as the ownership history.

[0045] • Ownership and Authenticity: A NFT can establish ownership and authenticity of the associated content. The blockchain may record who owns the NFT and the content it represents, and this information can be publicly verifiable.

[0046] • Smart Contracts: A NFT can use smart contracts to define the rules and properties of the token. These smart contracts can include details about royalties, rights, and conditions of use for the associated content or item.

[0047] • Interoperability: NFTs can be bought, sold, and traded on various online marketplaces and platforms that support NFT transactions. This may allow users, for instance creators and / or collectors, to exchange NFTs across different ecosystems.

[0048] • Value: The value of an NFT can be determined by factors such as the perceived value of the underlying content, the demand for it, the rarity, and the history of ownership.

[0049] • Digital Ownership: NFTs can enable the concept of true digital ownership. They can allow creators to sell and monetize their contents to collectors without the need for traditional intermediaries. They may allow users to protect their content by certifying ownership if the content can get misused.

[0050] The user block chain can comprise a user genesis block and / or at least one data block.

[0051] The user genesis block may be the first block of the user block chain. It can define the foundation upon which all subsequent blocks can be added. The subsequent blocks can be the at least one data block. The user genesis block may comprise an initial set of data and information on the user. The user genesis block may not comprise a reference to a previous block since the user genesis block can be the first block of the user block chain. The user genesis block may comprise a cryptographic hash, which can be a unique identifier of the user genesis block. The cryptographic hash of the user genesis block may be used as a reference point for the at least one data block, that can be added in the user block chain structure. The user genesis block can contain information such as a timestamp of the user block chain’s creation and / or initial configuration settings.

[0052] The at least one data block can contain a variety of information and data, which may depend on a user block chain protocol, more generally on a hybrid-decentralized network system protocol. Preferably, the at least one data block can comprise the following information:

[0053] • Block Header o Previous Block Hash: A reference to the hash of the previous data block in the user block chain, which can create the linkage between the at least one data block. o Timestamp: The time when the at least one data block may be created, which can provide a chronological order of blocks.

[0054] • Block Number (Height): o A unique identifier indicating the position of the block within the user block chain.

[0055] • Smart Contracts or Scripts: o The at least one data block may include a code or script associated with smart contracts or scripts.

[0056] • Data: o Any useful data, such as a video sequence, an image and / or text. o The at least one data block may further comprise metadata. Metadata may be, for example, data that can provide information about other data. o The at least one data block may further comprise cryptographic hash values. The hybrid-decentralized network system may allow for extra data to be included in the at least one data block. This can be used to include metadata or information relevant to the at least one data block.

[0057] The at least one data block may comprise at least one link to at least one content and / or at least one content. Each of the at least one link may link to a plurality of contents. The at least one link can be a hyperlink. Preferably, the at least one link can be defined as a cryptographic reference or identifier that may point to content, which is potentially located within or outside from the at least one data block. The at least one link may preferably indicate that the content being referred to can be stored in an external database, such as a file storage system or some other data repository or storage systems. The at least one data block, and more generally the user block chain structure, even more generally the hybrid-decentralized network system, may only store the reference, such as the cryptographic hash, to this data, ensuring the data or content immutability, while preferably keeping the hybrid-decentralized network system from an excessive large amount of data to be stored in the hybrid-decentralized network system.

[0058] Preferably, the at least one link may refer to another blockchain or decentralized network. The at least one link can indicate that the data or content being referred to is located in another blockchain, thereby allowing different blockchains to interact with each other. In the case of smart contracts, the at least one link may indicate a function call or interaction with an external smart contract, which can allow the user block chain or preferably the hybrid-decentralized network system to communicate with other decentralized applications.

[0059] The at least one content can be comprised in the at least one data block. Advantageously, the at least one content can be stored in the hybrid-decentralized network system. The hybrid-decentralized network system may further comprise a data storage unit configured to store the at least one content. Several data storage unit can be used to store the at least one content:

[0060] • Hard Disk Drives (HDDs): HDDs are traditional mechanical storage devices that use spinning disks to store and retrieve data. They offer relatively large storage capacities but may be slower than other storage technologies. • Solid State Drives (SSDs): SSDs use flash memory to store data electronically, resulting in faster read and write speeds compared to HDDs. They are commonly used in laptops, desktops, and servers.

[0061] • Network Attached Storage (NAS): NAS systems are dedicated devices or servers that provide shared storage resources to a network of users or computers. They are often used for centralized file storage and data sharing.

[0062] • Cloud Storage: Cloud storage services offer data storage and management over the internet. Providers like Amazon Web Services (AWS), Google Cloud, and Microsoft Azure offer scalable and accessible storage solutions.

[0063] • Distributed Databases: Distributed databases store data across multiple servers or nodes, enhancing scalability and fault tolerance. They are common in large- scale applications and blockchain networks.

[0064] • Data Warehouses: Data warehouses are specialized databases designed for storing and analyzing large volumes of historical data, often used for business intelligence and analytics.

[0065] Preferably, the at least one content can be stored in a plurality of data storage units that may advantageously be designed for block chain technology such as the following options:

[0066] • IPFS (Interplanetary File System): IPFS is a distributed file system. It uses a content-addressable system, where data is identified by its content rather than its location. IPFS can be used to store files and data off-chain while referencing their content hashes on the hybrid-decentralized network system.

[0067] • Decentralized Storage Networks: There are various decentralized storage platforms that may allow users to store files on a distributed network of nodes. These networks can offer a way to securely store data or content off-chain and can be integrated with blockchains to maintain data or content references.

[0068] • Databases and Cloud Storage: In some cases, data or content can be stored in traditional databases or cloud storage. The hybrid-decentralized network system would then store references (e.g., URLs or cryptographic hashes) to the data or content stored externally.

[0069] • Sidechains and Layer 2 Solutions: Some blockchains support sidechains or layer 2 solutions that allow for specific types of data to be stored off the main blockchain while still being linked to it. This can help reduce congestion on the main chain while maintaining data integrity. • Oracles: Oracles are services that provide external data to smart contracts. They can be used to fetch and verify real-world data from external sources and then make it available for use within a blockchain-based application.

[0070] • Cross-Chain Communication: In a multi-chain ecosystem, data or content can be stored on one blockchain and referenced from another. Cross-chain communication protocols and bridges facilitate communication and data or content sharing between different blockchains.

[0071] • Smart Contracts and State Channels: Smart contracts can store and manage data. State channels can also be used to temporarily offload some data processing from the hybrid-decentralized network system.

[0072] The at least one content can be configured to be stored in a cloud or a personal user server. A cloud can be a cloud storage, which may be configured to store and manage data over the internet on remote servers, preferably provided by a third-party provider. Cloud storage may provide a scalable solution for storing and accessing data without any needs for physical hardware maintenance and management. A personal user server can be a desktop computer, or any other devices which can be connected to the internet and may preferably comprise a local data storage unit.

[0073] Preferably, the cloud storage can be a cloud storage that may have an uninterrupted connection to internet, such that the content can be shared, downloaded or seen by the plurality of users of the hybrid-decentralized network system. By having the contents stored on a cloud storage that may have an uninterrupted connection to internet, the user that may share contents on the hybrid-decentralized network may avoid having his personal device uninterruptedly connected to internet.

[0074] The at least one content may be at least one video, at least one image and / or texts. Preferably, the at least one content can be of any type of formats that can be uploaded on a network. The at least one content may comprise at least one audio file and / or at least one image and / or at least one video sequence and / or sensor data.

[0075] The at least one content can be publicly shared. The at least one content may be kept private by the users. For instance, one of the plurality of users may be interested in having a cryptographic hash on a personal content, such as a private contract or at least one content that the user may wish to keep private. By having a cryptographic hash on a personal content, the user can then have a digital proof of ownership of the at least one content. The user can share at any time the personal content on the hybrid-decentralized system network.

[0076] The master block chain can be a block queue. A block queue can have a different structure than a block chain. A block queue may allow deletion of at least one master block chain block, wherein the at least one master block chain block can not necessarily be a latest block in the master block chain block. By having the master block chain potentially be a block queue, some previous master block chain blocks can be deleted, thereby reducing the amount of data to be stored in the hybrid- decentralized network system. Since the master block chain block may comprise hash tree structures, wherein each of the hash tree structures comprised in the master block chain blocks comprises at least one update on the previous hash tree structures, some of the previous blocks of the master block chain can be deleted.

[0077] In the present disclosure, the terms blockqueue and block queue may be used interchangeably to refer to the same underlying idea, which is the underlying idea described above. For the sake of clarity and understanding, both terms may be used synonymously and cannot imply any difference in the technology or its implementation.

[0078] The block queue can be configured to allow deletion of at least one master block chain block comprised in the block queue, and wherein the at least one master block chain block may be arranged before a final master block chain block. The final master block chain block can be the latest block created in the master block chain. Preferably, in a typical block chain, only the latest block can be deleted, since every other blocks arranged in the block chain have a cryptographic hash value that is dependent on the previous block.

[0079] Preferably, the block queue can be configured to allow deletion of one or more blocks arranged at the beginning of the block queue by copying a number of blocks and starting a new block queue. The new block queue may then comprise a number of blocks from the end of the block queue. The block queue may comprise a succession or a sequence of at least one internal block queue, wherein the at least one internal block queue can be configured such that the at least one final block of a first internal block queue may be copied within or into a second internal block queue, allowing the at least one first blocks of the first block queue to be deleted, forgotten or erased. By having the second internal block queue comprising a copy of the at least one final block from the first internal block queue, the first internal block queue can then be deleted, erased or forgotten.

[0080] The second internal block queue may comprise an initial salt or seed, wherein the initial salt or seed can be the first block of the second internal block queue, as defined in the precedent paragraph. In other terms, the initial salt or seed may be the first block of the at least one final block from the first internal block queue. The initial salt or seed may comprise the same cryptographic hash in the second internal block queue as the one it had in the block queue.

[0081] An initial salt or more generally a salt can refer to a random value added to data before it is hashed. The main purpose of a salt may be to ensure that even if two identical pieces of data are hashed, they produce different hash outputs. This can help prevent attackers from using precomputed tables, like rainbow tables, to reverse-engineer the original data from its hash. While salts may be associated with password hashing, they can also be used in blockchains to enhance security, particularly in cases where privacy and data uniqueness are important. For example, in zero-knowledge proofs or certain privacy-focused blockchain implementations, a salt can ensure that transactions or data are not easily linkable, even if the underlying data is the same.

[0082] An initial seed or more generally a seed may refer to an initial value used to generate a sequence of numbers or keys, typically in a deterministic way. The seed can act as the starting point for generating pseudorandom numbers or keys, which can be reproduced later if the same seed is used. In blockchains, a seed can be used to generate private keys, wallet addresses, or other cryptographic keys.

[0083] In one embodiment, the second internal block queue may comprise a salt or seed for uniqueness. Advantageously, this can preferably guarantee that the hashes of the second internal block queue can be different from those of the first internal block queue, even though the first blocks may comprise values also contained in the first internal block queue.

[0084] Each of the master block chain blocks may comprise an update of the hash tree structure comprised in a previous master block chain block. The update can be identical in at least two master block chain blocks. One new master block chain block can be added, where the new master block chain block can comprise the same hash tree structure as the previous master block chain block. The update of the hash tree structure may comprise at least one deletion of the at least one data block and / or at least one new data block. The update can be at least one update on at least one user block chain. Preferably, the update can be comprised in at least one user block chain, such as at least one data block can be deleted or added.

[0085] The hash tree structure can have a height of 2, preferably a height of 4, more preferably a height of 8, even more preferably a height of 16, most preferably a height of 30. A height can define the number of users of the hybrid-decentralized network system. Mathematically, and in the case of a binary hash tree structure, a maximal number of users for a given height are defined in regards to height as Max{Number_of_users} = 2He'9ht. This would assume a potential maximum of users of 1 .073.741 .824 users if the hash tree structure has a height of 30. Preferably, the hash tree structure may have a height of more than 30.

[0086] The hash tree structure may be a Merkle tree structure. The hash tree structure can comprises nodes. There can be several types of nodes such as leaf nodes, intermediate nodes and root node. The leaf nodes are the lowest-level nodes in the hash tree. Each of the leaf nodes may comprise a user block chain. The intermediate nodes are the ones above the leaf nodes. The intermediate nodes may not contain data or content but can be instead formed by hashing the cryptographic hash values of their child nodes. Each intermediate node’s cryptographic hash value can be the hash of the concatenated hash values of its child nodes. The top of the hash tree is the root node. The root node may preferably be a master block chain block. The master block chain block may contain a cryptographic hash value that may be computed from the hash values of its immediate child nodes. The hash tree structure can be used to quickly verify that the data comprised in the hash tree has not been tampered.

[0087] The hash tree structure may be configured such that the nodes has zero child, preferably one child, more preferably at least two children. By having more children per nodes, the hash tree structure may be more efficient, by reducing the height of the hash tree.

[0088] Each of the nodes and / or the at least one data block and / or the user genesis block and / or each of the master block chain blocks can be labelled with a cryptographic hash. A cryptographic hash, which can also be defined as a hash, a cryptographic hash value or a hash value, is a fixed-length sequence of characters generated from input data of arbitrary length. A cryptographic hash may preferably be generated by a mathematical algorithm known as a hash function. Cryptographic hash functions can be designed to have specific properties that make them useful in various security applications, such as data integrity verification, password hashing, digital signatures, and more. Cryptographic hash functions may have key characteristics such as preimage resistance, collision resistance, avalanche effect and efficiency.

[0089] The cryptographic hash may be generated by a cryptographic hash function. The cryptographic hash function may be a Secure Hash Algorithm (SHA), a RACE Integrity Primitives Evaluation Message Digest (RIPEMD), Keccak, BLAKE2, Ethash, and / or Scrypt. Other cryptographic hash functions may also be used. The cryptographic hash function may be selected depending on current standards.

[0090] The cryptographic hash function may be fixed-size 64-bit output, preferably a fixed-size 128-bit output, more preferably a fixed-size 256-bit output, even more preferably a fixed-size 512-bit output. The size of the cryptographic hash function may be chosen according to the number of users of the hybrid-decentralized network system. Advantageously, a high fixed-size output of the cryptographic has function may allow a hybrid-decentralized network with more users and / or more data blocks.

[0091] The user genesis block may be a first block of a user block chain. The user genesis block may comprise a genesis timestamp, a network information, a nonce and / or a block number. A nonce refers to “number used once”, which is a term commonly used in cryptography and computer science to refer to a value that is meant to be used only once for a specific purpose.

[0092] The user block chain may be configured to be owned by a user. A user can be, as described herein, any entity that can engage with the hybrid-decentralized network system, whether it is human or non-human, individual or organizational, real or virtual. The hybrid-decentralized network can be configured such that the user block chain can only be modified by the user. Preferably, a user may have a user cryptographic key, which can be unique for each user, such that a user can cryptographically sign its content, thereby avoiding another user or a third-party entity to potentially corrupt or misuse its content. Each user block chain can be defined as a user account. The user block chain can be set as a user Merkle tree, wherein the user’s content or data can be comprised in the user account or user Merkle tree. The hybrid-decentralized network can be configured such that at least one action is performed on the user block chain by the user. The at least one action comprises an addition of at least one data block, a deletion of at least one data block or a deletion of the user block chain. A user can delete or remove any content that he may have stored or linked to a user block chain block, which is at least one data block. Advantageously, and in contrast with typical block chain principles or definitions, a user can potentially remove the at least one data block that may be comprised in the user block chain, and wherein the at least one data block may not necessarily be the most recent block created in the user block chain. The at least one action can be an addition of at least one data block. The user can add any content to its user block chain. Contents that the user may add can be any contents that can be potentially shared and / or stored on a network. Preferably, one data block may be added for one content. More preferably, one or more data blocks may be added for one content. One data block can preferably be used for one content. If the user may wish to delete a content, it may preferably be a content contained in one data block. By having one content in one data block, only one data block may need to be deleted to delete one content. Due to the size of some contents, such as videos, the content can be divided into a plurality of pieces, and wherein each of the plurality of pieces can be stored in one data block. The user may also choose which pieces of the plurality of pieces may be publicly shared on the hybrid-decentralized network and which ones should be kept private, while having a cryptographic hash value on the plurality of pieces, thereby certifying ownership.

[0093] The user block chain may comprise data blocks created when the user may log in in the hybrid-decentralized network system. By comprising data blocks with timestamp indicating log in and / or log off time of the user, an activity score can be established based on the user activity on the hybrid-decentralized network system. The user block chain can comprise data blocks comprising information on user interaction with the hybrid-decentralized network system. For instance, the user can interact with other user contents, thereby creating one data block referencing user interactions with other user contents. This may be comments or reactions on other user contents.

[0094] The present disclosure discloses a computer-implemented method for verifying a hybrid-decentralized network, potentially based on a hash tree structure, wherein the method comprises the steps of: providing a hybrid-decentralized network system comprising a master block chain, said master block chain comprising a plurality of master block chain blocks arranged in a master linear structure, wherein each of the master block chain blocks comprises a hash tree structure; selecting a jury among a plurality of users of the hybrid-decentralized network system; proposing at least one new master block chain block in the master block chain to the jury; verifying the hybrid- decentralized network, wherein the jury approves or rejects the at least one new master block chain block; if the at least one new master block chain block is approved by the jury, settling the at least one new master block chain block.

[0095] The computer-implemented method for verifying a hybrid-decentralized network may include the step of selecting a jury among a plurality of users of the hybrid- decentralized network system and proposing at least one new master block chain block in the master block chain to the jury. Advantageously, a selection of a jury may be preferable if a new master block chain block is to be proposed to the jury.

[0096] The jury selected among a plurality of users of the hybrid-decentralized network system may verify the hybrid-decentralized network system, where the verification may be a verification of the cryptographic hash values comprised in the hash tree structure comprised in the at least one new master block chain block. The jury may decide if the cryptographic hash values are correct or not, and may take a decision of approving or rejecting the at least one new master block chain block in the master block chain. If the at least one new master block chain block is approved, then the at least one new master block chain block can be settled in the master block chain.

[0097] The jury may use data-processing apparatus or the like, in order to potentially verify the hybrid-decentralized network system. The data-processing apparatus or the like may be configured to verify the cryptographic hash values and can certify that the hash tree structure is not corrupted. If the hash tree structure is corrupted, the hybrid- decentralized network can be configured to identify which content or data block is corrupted and can take actions to solve it and potentially correct the hash tree structure. For instance, each user of the hybrid-decentralized network system may have a cryptographic key. The cryptographic key may allow the user to only interact with its user block chain. By having a cryptographic key, each user may secure their own user block chain. If a user intend to make operation on another user block chain, this operation may fail and thereby detected by the hybrid-decentralized network system since the user cryptographic key cannot be validated.

[0098] The step of verifying the hybrid-decentralized network, wherein the jury approves or rejects the at least one new master block chain block may preferably be executed by the jury. Thereby, the approval or rejection can be executed or performed by a fraction of users comprised in the hybrid-decentralized network, i.e. the jury. Advantageously, this avoids the introduction of any vulnerabilities, since the jury is sampled or selected amongst all user accounts or amongst the plurality of users of the hybrid-decentralized network system.

[0099] The method may further comprise the step of receiving at least one update from at least one user of the hybrid-decentralized network system. As described herein, the at least one update may be at least one addition and / or at least one deletion of at least one data block, in at least one user block chain. When at least one update can be provided to the hybrid-decentralized network system, at least one new master block chain block may be proposed by the hybrid-decentralized network system to the jury.

[0100] The method can further comprise the step of proposing a new at least one new master block chain block, if the at least one new master block chain block is rejected by the jury. The at least one new master block chain block can be rejected by the jury if a majority of the jury cannot approve the at least one new master block chain block. A rejection can also be caused by an unavailability of the jury. An unavailability of the jury can be caused by the jury potentially being offline, or if the jury potentially uses a version of the hybrid-decentralized network being outdated, such as an app on a phone that can potentially be used in an outdated operating system, or if an application using the hybrid-decentralized network is outdated.

[0101] The new at least one new master block chain block may comprise the at least one update from at least one user of the hybrid-decentralized network system. If the jury can be unavailable to approve the at least one new master block chain block that can comprise the at least one update, the new at least one new master block chain block that can be proposed to the jury may comprise the at least one update from at least one user of the hybrid-decentralized network system. For a similar reason, the new at least one new master block chain block can comprise the hash tree structure of the at least one new master block chain block.

[0102] The method can further comprise a step of selecting a second jury among a plurality of users of the hybrid-decentralized network. By selecting a second jury among a plurality of users of the hybrid-decentralized network, the jury may avoid being selected a second time and thereby avoiding the jury to be unavailable a second time in order to approve or reject the at least one new master block chain block. Preferably, the second jury may comprise a plurality of second users of the hybrid-decentralized network system, where the plurality of second users are different than the plurality of users that may be comprised in the jury.

[0103] All the plurality of users and / or the plurality of second users respectively selected in the jury and / or the second jury may not necessarily have to approve or reject the at least one new block of the master block chain and / or the new at least one new block of the master block chain. Only a portion of the plurality of users and / or the plurality of second users may approve or reject the at least one new block of the master block chain and / or the new at least one new block of the master block chain. The portion of the plurality of users and / or the plurality of second users can be 10% of them, preferably 20 %, more preferably 30 %, even more preferably 40 %, further more preferably 50 %, even more further preferably 60 %, most preferably 70 % of them.

[0104] The method may further comprise a step of verifying the hybrid-decentralized network, wherein the second jury approves or rejects the new at least one new master block chain block.

[0105] In one embodiment, the second jury is the jury. The jury can be asked to approve or reject the new at least one new master block chain block.

[0106] The at least one update can be comprised in the hash tree structure. As discussed herein, the at least one update can be may be at least one addition and / or at least one deletion of at least one data block, in at least one user block chain. The at least one update may also be a modification of the hash tree structure, such that a modification of the number of children per nodes. The at least one update may be an update of the cryptographic hash function used in or by the hybrid-decentralized network system.

[0107] The jury and / or the second jury may be pseudo-randomly or randomly selected among the plurality of users of the hybrid-decentralized network system. The jury and / or the second jury may be selected with a bias. The bias can be provided / calculated according to user activity. The user activity can be determined according to multiple criteria. The user activity can be determined based on the number of data blocks created by the user in a given amount of time. The user activity can be determined based on the login / logoff activity of the user in a given amount of time. Preferably, the user activity may be determined when the jury is selected among a plurality of users of the hybrid-decentralized network system. By determining the user activity when selecting the jury among a plurality of users of the hybrid-decentralized network system, a higher chance is obtained of avoiding the jury being unavailable when the at least one new master block chain block and / or the new at least one new master block chain block is proposed to the jury and / or the second jury. The user activity may also help the hybrid-decentralized network system to identify dead users. The dead users may be defined as the users of the hybrid-decentralized network that may have not had any activity of a long period of time, such as one week, such as two weeks, such as three weeks, such as four weeks, such as one month, such as six months, such as one year, such as two years, such as three years.

[0108] The selection of the jury can be possible in this hybrid-decentralized network, since all the users of the hybrid-decentralized network can be identified. In contemporary blockchain systems such as cryptocurrency blockchains, it can not be possible to sample a jury since identifying the users of the blockchain can not be executed or performed. Even knowing the number of accounts or users can not be possible for contemporary blockchain systems.

[0109] The user activity may be propagated up through the hash tree structure. Various methods may be applied to propagate the user activity up through the hash tree structure. For instance, a user activity score can be calculated based on the user activity as described herein. The user activity score can be a number in a given range, and this number can be propagated up through the hash tree structure. Thereby, a weighted hash tree structure based on user activity can be obtained.

[0110] The jury and / or the second jury can download a delta-tree. In order to verify the hybrid- decentralized network system, the jury and / or the second jury may avoid downloading the hash tree structure. Instead, the jury and / or the second jury may download a deltatree. The delta-tree may be a partial hash tree comprising the at least one update. By downloading the delta-tree, the jury may avoid downloading the hash tree structure, thereby decreasing the amount of content and / or data to be downloaded.

[0111] The hybrid-decentralized network system can be the hybrid-decentralized network system as described herein.

[0112] Detailed description of the drawings

[0113] Fig. 1 shows an embodiment of a diagram of the hybrid-decentralized network system as disclosed herein. In this embodiment the hybrid-decentralized network system comprises a blockqueue, where the blockqueue comprises a succession of blocks, where each blocks potentially comprises an update of the hash tree structure. The blockqueue may be the master block chain as disclosed in the present disclosure. The blockqueue has a linear structure, where one network status can be followed by another network status at a different timestamp. A network status is a status of the network, which is preferably a status of the hash tree structure, at a given timestamp. The master block chain may preferably have a master linear structure since a network status is unique, and can preferably not be split in two or more different parallel updates with the same timestamp. In this embodiment, the network status is a hash tree structure, or a merkelized tree, where the merkelized tree comprises a blockstack network, wherein each blockstack comprises blocks of a specific user of the hybrid- decentralized network. Each blockstack represents a user block chain. Each of the user block chains comprises at least one data block, depending on the amount of data or content that each users may share or store on the hybrid-decentralized network. One data block may represent one NFT content, where a NFT content can be texts, videos, images, or any other files that can be potentially shared among the hybrid- decentralized network, or kept private.

[0114] The blockqueue comprises at least one master block chain block being in the verification period, while the last or more recent block of the blockqueue is the hybrid- decentralized network status, with a given timestamp. The at least one block being in the verification period may be validated by a jury as described in the description. Once a number of blocks have been validated, former blocks are forgotten, which can mean that the forgotten blocks of the blockqueue may be deleted. By deleting the forgotten blocks, disk space can be released from a central server, where the hashes and the hybrid-decentralized network may be stored. By having a master block chain, the integrity of the hybrid-decentralized network can be checked as soon as a sufficient amount of updates are provided to the hybrid-decentralized network. The sufficient amount of updates can be decided by a leader or a central, where a compromise is to be found on the amount of data, updates or contents that may need to be downloaded by the jury for verifying the integrity of the hybrid-decentralized network. Too many updates may lead to an amount of data which may be bigger than expected, and too few updates may lead to verification periods that may be too close in time to each other, thereby having different juries to verify the hybrid-decentralized network in a relatively short amount of time or obtaining a relatively large block queue size to be potentially stored or saved. This may cause an unnecessary number of verifications. Fig. 2 shows an embodiment of a user block chain. A user blockchain comprises a user genesis block as the first data block of the user block chain. Following the user genesis block, a user blockchain structure may comprise at least one user block or at least one data block. Each data blocks can comprise a NFT content, where the NFT content may preferably be contents shared by the user identified in the user genesis block of the user block chain. NFT content may be defined as non-fungible token content, where non-fungible token contents can be one of the contents listed in the non-exhaustive following list:

[0115] • Images and Photos: Memes, visually appealing photos, illustrations, quotes, and graphics.

[0116] • Videos: Engaging and entertaining videos, including funny clips, short skits, tutorials, product demonstrations, or viral challenges.

[0117] • Infographics: Visual representations of information or data presented in a concise and appealing manner.

[0118] • Text and Quotes: Shareable content also includes written text, such as inspirational quotes, thought-provoking statements, or snippets of text. These can be shared as standalone posts or overlaid on images.

[0119] • Live Streams and Stories: Live streaming and ephemeral content through stories. Live streams allow real-time sharing and interaction, while stories provide a more casual and temporary format for sharing moments and updates.

[0120] • User-Generated Content (UGC): Content created by users themselves, such as reviews, testimonials, user-submitted photos, or videos.

[0121] • Audio Content: Podcast episodes, audio clips, or sound bites that can be informative, entertaining, or inspiring.

[0122] A user action / request, as shown in Fig. 2, is the creation of a new user block or new data block on the user block chain. The user action / request can be a deletion of one or more specific data blocks, a creation of an additional data block, or a request for suppression / deletion of the whole user block chain, comprising the user genesis block, which is the deletion of the user from the hybrid-decentralized network. Fig. 3 shows an embodiment of possible actions that a user may perform with the user block chain, wherein (A) shows the user block chain with a genesis block and 4 data blocks, potentially representing NFT contents, (B) shows a request for addition of a fifth data block on the user block chain, (C) shows a request where the user uses or creates a new data block to specify an intention, (D) shows a request of deleting the data blocks 3 and 4, (E) shows a request of user deletion, (F) shows a request of specifically deleting data block 2. (A) shows a user block chain with a specific timestamp, where the user block chain comprises a user genesis block and four data blocks potentially comprising NFT contents. Each data blocks are related to each other with a hash tree structure, and if the user blockchain structure is corrupted, it can be identified while verifying the hybrid-decentralized network system. (B) shows a request where the user attempts to add a data block number 5 to the user blockchain structure. The data block number 5 comprises a cryptographic hash value that links the data block number 5 to the previous data block number 4. (C) shows the request of the user using or creating a new data block to specify an intention on the user block chain. The intention can be (D), where the user requests the deletion of the data block number 2, (E) where the user requests the deletion of its user block chain, thereby requesting a “right to be forgotten” from the hybrid-decentralized network system, and / or (F) where the user requests the specific deletion of the data block number 2.

[0123] Fig. 4 shows an embodiment of the computer-implemented method for verifying the hybrid-decentralized network system, where a new block in the blockqueue or master block chain is pending, wherein a jury can verify and approve or reject leader’s proposal of the new block in the blockqueue. The leader may be a central of the hybrid- decentralized network system. The central may be the hybrid-decentralized network system. As discussed herein, the leader may propose at least one new master block chain block or a new at least one new master block chain block, that can be approved or rejected by a jury selected among a plurality of users of the hybrid-decentralized network system. The validation or rejection of the new block in the master block chain can be performed with a data processing apparatus, such as a mobile phone, a tablet or a computer, as illustrated in Fig. 6. When the verification process is performed by data processing apparatus of the jury, the jury may approve or reject the new block of the master block chain.

[0124] Fig. 5 shows an embodiment of the different steps to perform a new master block chain block validation in the blockqueue or master block chain, wherein (A) is the step where a leader proposes a new master block chain block comprising a hash tree structure, (B) is the step where a jury is selected pseudo-randomly or randomly, based on user activity, (C) is the step where the jury verify the new block of the master block chain by downloading delta-trees of the new block of the master block chain and each sends their signature with their approval or rejection, (D) is the step where the new block of the blockqueue or master block chain gets approved if more than a certain ratio of the jury-members send their signature.

[0125] Fig. 6 shows an embodiment of a structure schematic of a specific master block chain block of the hybrid-decentralized network system, where one path is specifically illustrated. This one path illustrates the path from the specific master block chain block to at least one data block which was updated by being added in a user block chain, compared to the previous master block chain block, previous to the specific master block chain block. This one path represents a delta-tree, wherein the delta-tree comprises the at least one data block which was updated. The dela-tree is downloaded by the jury, thereby limiting the amount of data to be downloaded by the jury when validating the hybrid-decentralized network system, by approving a new master block chain block. The delta-tree size to be download can be estimated according to a calculation. If the hash tree structure is estimated to potentially have a height of 30, and an average user block chain may have a height of 20, and by assuming that each node is around 32 Bytes of data, the size of the delta-tree would be around 1 .6 kBytes. The size of the delta-tree is assuming only one data block to be verified. If more updates are provided to the hybrid-decentralized system network, then a multiplication of the number of updates by the size of the delta-tree previously calculated would give an estimation of the total size of the delta-tree. By downloading only a delta-tree of the specific master block chain block, the jury does not have to download the hash tree structure in its entirety, thereby reducing the amount of data to be downloaded, and inevitably also reducing the energy used to download the reduced amount of data.

[0126] Fig. 7A shows an embodiment of a diagram where a method of updating a blockqueue is illustrated. The blockqueue may be the master block chain. In the example each line of blocks represents the blockqueue which is remembered, i.e. potentially stored in the hybrid-decentralized network system. As described herein, each blocks of the block queue comprises a hash tree structure, and wherein each successive blocks comprises the hash tree structure with successive timestamps. As soon as the blockqueue exceeds at predetermined length, for example a number of 7 blocks, a given number of blocks, such as the three last blocks, are then copied in order to start a new block chain, such as a new master block chain. The three last blocks is an example. Any suitable number of blocks may be used. At least one last block can be copied to start a new master block chain. In this embodiment, this means that the four precedent blocks from the master block chain illustrated on line 3 are forgotten, deleted or erased. For this purpose the blocks may be referred to as forgotten blocks. By forgetting, deleting or erasing these blocks, storage space can be cleared, while no important data of the hybrid-decentralized network system is lost since the three last blocks copied in the new master block chain comprised the hash tree structure comprised in the forgotten blocks, with potentially some updates. The same method is applied as soon as the new master block chain exceeds the predetermined maximum number of blocks, as illustrated in the line 8 of the embodiment illustrated in Fig. 7A, where the three last blocks are then copied in a new master block chain, illustrated in line 9.

[0127] Fig. 7B shows an embodiment of a diagram where a method of updating a blockqueue is illustrated. The blockqueue may be the master block chain. In the example each line of blocks represents the blockqueue which is remembered, i.e. potentially stored in the hybrid-decentralized network system. As described herein, each blocks of the block queue comprises a hash tree structure, and wherein each successive blocks comprises the hash tree structure with successive timestamps. As soon as the blockqueue exceeds a predetermined length, for example a number of 7 blocks, a given number of blocks, such as the three last blocks, are then copied in order to start a new block chain, such as a new master block chain. The three last blocks is an example. Any suitable number of blocks may be used. At least one last block can be copied to start a new master block chain. In this embodiment, this means that the four precedent blocks from the master block chain illustrated on line 3 are forgotten, deleted or erased. They may be deleted, forgotten or erased from the hybrid-decentralized network system. For this purpose the blocks may be referred to as forgotten blocks. By forgetting, deleting, or erasing these blocks, storage space can be freed up, while no important data of the hybrid-decentralized network system is lost, since the three latest blocks copied into the new master blockchain comprise the hash tree structure of the forgotten blocks, along with any potential updates, associated with different successive timestamps. The same method is applied as soon as the new master block chain exceeds the predetermined maximum number of blocks, as illustrated in the line 5 of the embodiment illustrated in Fig. 7B, where the three last blocks are then copied in a new master block chain, illustrated in line 6. Baiand Ba2 comprises identical hash three structures than Bbiand Bb2, respectively, since Bbiand Bb2are copies of Baiand Ba2, in order to perform a reboot of the blockqueue, as defined herein and illustrated in Figs. 7A-B. However, blocks Baiand Ba2may not have the same block hash since they are not comprised in the same blockqueue. Indeed, since the first block of the new blockqueue comprises a salt or seed as defined in the present disclosure, the subsequent block hashes are linked to this first block hash, which is necessarily different than the copy it is inherited from, since the new first block comprises a salt or seed.

[0128] Figs. 8A-B show embodiments of diagrams describing the blockqueue concept, where Bi and B2are two subsequent blocks of the blockqueue. Fig. 8A shows an embodiment of the master block chain, wherein the master block chain comprises 7 master block chain blocks. As described herein, Bi and B2are two subsequent blocks of the blockqueue, wherein Bi and B2preferably do not share any content. Bi represents the entire status of the hybrid-decentralized network at one timestamp or time, while B2represents the entire status of the hybrid-decentralized network at a subsequent timestamp, where the timestamp of B2may occur after the timestamp of Bi. The final block of this figure represents the most up-to-date state of the hybrid-decentralized network. Each blocks of the master block chain comprises the status of the hybrid- decentralized network at one specific timestamp. The Merkle tree comprised in the fifth block of the master block chain is an illustration of how the hash tree structure can be encoded or represented. The Merkle tree implementation can be used to optimize the compression of the data comprised in the master block chain block. Each leaf nodes may represent one user block chain, associated to a user of the hybrid-decentralized network. Fig. 8B shows an embodiment of the hash tree structures comprised in the master block chain blocks Bi and B2. B2is the status of the hybrid-decentralized network at a timestamp that may occur after the timestamp of Bi. The jury may approve B2, that would certify that the updates performed in the hybrid-decentralized network between Bi and B2are not corrupted. B2represents the current state of the hybrid- decentralized network at the timestamp of B2. The hash tree structure of B2is not linked to the hash tree structure of Bi. B2may not comprise the history of Bi.

[0129] Further details of the invention

[0130] 1 . A hybrid-decentralized network system comprising a master block chain, said master block chain comprising a plurality of master block chain blocks arranged in a master linear structure, wherein each of the master block chain blocks comprises a hash tree structure, said hash tree structure comprising a plurality of leaf nodes, wherein each of the plurality of leaf nodes comprises a user block chain arranged in a user hash tree structure.

[0131] 2. The hybrid-decentralized network system according to item 1 , wherein the user block chain comprises a user genesis block and / or at least one data block.

[0132] 3. The hybrid-decentralized network system according to any one of the preceding items, wherein the hybrid-decentralized network system is a hybrid- decentralized social network system.

[0133] 4. The hybrid-decentralized network system according to any one of the preceding items, wherein the at least one data block comprises at least one non-fungible token.

[0134] 5. The hybrid-decentralized network system according to any one of the preceding items, wherein the at least one data block comprises at least one link to at least one content and / or at least one content.

[0135] 6. The hybrid-decentralized network system according to any one of the preceding items, wherein the hybrid-decentralized network system further comprises a data storage unit configured to store the at least one content.

[0136] 7. The hybrid-decentralized network system according to any one of the preceding items, wherein the at least one content is configured to be stored in a cloud or a personal user server.

[0137] 8. The hybrid-decentralized network system according to any one of the preceding items, wherein the at least one content is at least one video, at least one image and / or texts.

[0138] 9. The hybrid-decentralized network system according to any one of the preceding items, wherein the at least one content is preferably publicly shared. 10. The hybrid-decentralized network system according to any one of the preceding items, wherein the master block chain is a block queue.

[0139] 11 . The hybrid-decentralized network system according to item 10, wherein the block queue is configured to allow deletion of at least one master block chain block comprised in the block queue, and wherein the at least one master block chain block is arranged before a final master block chain block.

[0140] 12. The hybrid-decentralized network system according to any one of the preceding items, wherein each of the master block chain blocks comprises an update of the hash tree structure comprised in a previous master block chain block.

[0141] 13. The hybrid-decentralized network system according to any one of the preceding items, wherein the update is identic in at least two master block chain blocks.

[0142] 14. The hybrid-decentralized network system according to item 12, wherein the update of the hash tree structure comprises at least one deletion of the at least one data block and / or at least one new data block.

[0143] 15. The hybrid-decentralized network system according to any one of the preceding items, wherein the hash tree structure has a height of 2, preferably a height of 4, more preferably a height of 8, even more preferably a height of 16, most preferably a height of 30.

[0144] 16. The hybrid-decentralized network system according to any one of the preceding items, wherein the hash tree structure comprises nodes.

[0145] 17. The hybrid-decentralized network system according to any one of the preceding items, wherein the hash tree structure is configured such that nodes has zero child, preferably at least one child, more preferably at least two children.

[0146] 18. The hybrid-decentralized network system according to any one of the preceding items, wherein each of the nodes and / or the at least one data block and / or the user genesis block and / or each of the master block chain blocks are labelled with a cryptographic hash. 19. The hybrid-decentralized network system according to item 18, wherein the cryptographic hash is generated by a cryptographic hash function.

[0147] 20. The hybrid-decentralized network system according to any one of items 18-19, wherein the cryptographic hash function is a Secure Hash Algorithm (SHA), a RACE Integrity Primitives Evaluation Message Digest (RIPEMD), Keccak, BLAKE2, Ethash, and / or Scrypt.

[0148] 21 . The hybrid-decentralized network system according to any one of items 18-20, wherein the cryptographic hash function has a fixed-size 64-bit output, preferably a fixed-size 128-bit output, more preferably a fixed-size 256-bit output, even more preferably a fixed-size 512-bit output.

[0149] 22. The hybrid-decentralized network system according to any one of the preceding items, wherein the user genesis block is a first block of the user block chain.

[0150] 23. The hybrid-decentralized network system according to any one of the preceding items, wherein the user genesis block comprises a genesis timestamp, a network information, a nonce and / or a block number.

[0151] 24. The hybrid-decentralized network system according to any one of the preceding items, wherein the user block chain is configured to be owned by a user.

[0152] 25. The hybrid-decentralized network system according to any one of the preceding items, wherein the hybrid-decentralized network is configured such that the user block chain can only be modified by the user.

[0153] 26. The hybrid-decentralized network system according to any one of the preceding items, wherein the hybrid-decentralized network is configured such that at least one action is performed on the user block chain by the user.

[0154] 27. The hybrid-decentralized network system according to item 26, wherein the at least one action comprises an addition of at least one data block, a deletion of at least one data block or a deletion of the user block chain. A computer-implemented method for verifying a hybrid-decentralized network based on a hash tree structure, wherein the method comprises the steps of: providing a hybrid-decentralized network system comprising a master block chain, said master block chain comprising a plurality of master block chain blocks arranged in a master linear structure, wherein each of the master block chain blocks comprises a hash tree structure; selecting a jury among a plurality of users of the hybrid-decentralized network system; proposing at least one new master block chain block in the master block chain to the jury; verifying the hybrid-decentralized network, wherein the jury approves or rejects the at least one new master block chain block; if the at least one new master block chain block is approved by the jury, settling the at least one new master block chain block. The computer-implemented method according to item 28, wherein the method further comprises the step of receiving at least one update from at least one user of the hybrid-decentralized network system. The computer-implemented method according to any one of items 28-29, wherein the method further comprises the step of proposing a new at least one new master block chain block, if the at least one new master block chain block is rejected by the jury. The computer-implemented method according to any one of items 28-30, wherein the new at least one new master block chain block comprises the at least one update from at least one user of the hybrid-decentralized network system. The computer-implemented method, according to any one of items 28-31 , wherein the new at least one new master block chain block comprises the hash tree structure of the at least one new master block chain block. 33. The computer-implemented method according to any one of items 28-32, wherein the method further comprises a step of selecting a second jury among a plurality of users of the hybrid-decentralized network.

[0155] 34. The computer-implemented method according to any one of items 28-33, wherein the method further comprises a step of verifying the hybrid- decentralized network, wherein the second jury approves or rejects the new at least one new master block chain block.

[0156] 35. The computer-implemented method according to any one of items 28-34, wherein the second jury is the jury.

[0157] 36. The computer-implemented method according to any of items 28-35, wherein the at least one update is comprised in the hash tree structure.

[0158] 37. The computer-implemented method according to any of items 28-36, wherein the jury and / or the second jury is pseudo-randomly or randomly selected among the plurality of users.

[0159] 38. The computer-implemented method according to any of items 28-37, wherein the at least one update is at least one deletion of the at least one data block and / or at least one new data block.

[0160] 39. The computer-implemented method according to any of items 28-38, wherein the jury is selected with a bias.

[0161] 40. The computer-implemented method according to item 39, wherein the bias is provided / calculated according to user activity.

[0162] 41 . The computer-implemented method according to any one of items 39-40, wherein the user activity is propagated up through the hash tree structure.

[0163] 42. The computer-implemented method according to any of items 28-41 , wherein the jury downloads a delta-tree. The computer-implemented method according to item 42, wherein the delta-tree is a partial hash tree comprising the at least one update. The computer-implemented method according to any of items 28-43, wherein the hybrid-decentralized network system is the hybrid-decentralized network system according to any of items 1-27.

Claims

Claims1 . A hybrid-decentralized network system comprising a master block chain, said master block chain comprising a plurality of master block chain blocks arranged in a master linear structure, wherein each of the master block chain blocks comprises a hash tree structure, said hash tree structure comprising a plurality of leaf nodes, wherein each of the plurality of leaf nodes comprises a user block chain arranged in a user hash tree structure, wherein the user block chain comprises a user genesis block and / or at least one data block, and wherein the user block chain is owned by a user of the hybrid-decentralized network system.

2. The hybrid-decentralized network system according to any one of the preceding claims, wherein the at least one data block comprises at least one non-fungible token.

3. The hybrid-decentralized network system according to any one of the preceding claims, wherein the at least one data block comprises at least one link to at least one content and / or at least one content.

4. The hybrid-decentralized network system according to any one of the preceding claims, wherein the at least one content is at least one video, at least one image and / or texts.

5. The hybrid-decentralized network system according to any one of the preceding claims, wherein the master block chain is a block queue, wherein the block queue is configured to allow deletion of at least one master block chain block comprised in the block queue, and wherein the at least one master block chain block is arranged before a final master block chain block.

6. The hybrid-decentralized network system according to any one of the preceding claims, wherein each of the nodes and / or the at least one data block and / or the user genesis block and / or each of the master block chain blocks are labelled with a cryptographic hash, and wherein the cryptographic hash is generated by a cryptographic hash function.

7. The hybrid-decentralized network system according to any one of the preceding claims, wherein the user block chain is configured to be owned by a user, and wherein the hybrid-decentralized network is configured such that the user block chain can only be modified by the user.

8. The hybrid-decentralized network system according to any one of the preceding claims, wherein the hybrid-decentralized network is configured such that at least one action is performed on the user block chain by the user.

9. A computer-implemented method for verifying a hybrid-decentralized network, wherein the method comprises the steps of: providing a hybrid-decentralized network system comprising a master block chain, said master block chain comprising a plurality of master block chain blocks arranged in a master linear structure, wherein each of the master block chain blocks comprises a hash tree structure, said hash tree structure comprising a plurality of leaf nodes, wherein each of the plurality of leaf nodes comprises a user block chain arranged in a user hash tree structure, and wherein each of the plurality of leaf nodes is associated with a user, such that the hybrid-decentralized network system is used by a plurality of users; selecting a jury among the plurality of users of the hybrid-decentralized network system and proposing at least one new master block chain block in the master block chain to the jury; verifying the hybrid-decentralized network, wherein the jury approves or rejects the at least one new master block chain block; if the at least one new master block chain block is approved by the jury, settling the at least one new master block chain block.

10. The computer-implemented method according to claim 9, wherein the method further comprises the step of receiving at least one update from at least one user of the hybrid-decentralized network system.11 . The computer-implemented method according to any one of claims 9-10, wherein the method further comprises the step of proposing a new at least onenew master block chain block, if the at least one new master block chain block is rejected by the jury.

12. The computer-implemented method according to any of claims 9-11 , wherein the jury is pseudo-randomly or randomly selected among the plurality of users, and wherein the jury is selected with a bias.

13. The computer-implemented method according to claim 12, wherein the bias is provided / calculated according to user activity, and wherein the user activity is propagated up through the hash tree structure.

14. The computer-implemented method according to any of claims 10-14, wherein the jury downloads a delta-tree, and wherein the delta-tree is a partial hash tree comprising the at least one update.

Images