Hybrid decentralized network based on block chain data structure

Abstract

The present invention relates to a hybrid decentralized network system comprising a primary blockchain, the primary blockchain comprising a plurality of primary blockchain blocks arranged in a primary linear structure, where each of the primary blockchain blocks comprises a hash tree structure comprising a plurality of leaf nodes, wherein each of the plurality of leaf nodes includes 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

Technical Field

[0001] This disclosure relates to a hybrid decentralized network system based on a blockchain data structure. Background Technology

[0002] Social media platforms have revolutionized how people connect online, share information, and interact with each other. However, these platforms have raised significant concerns about content privacy and ownership. Privacy remains a major issue because social media platforms collect vast amounts of personal data from their users. This data is typically used for targeted advertising, personalized content, and algorithmic recommendations. Privacy problems can arise due to data misuse, lack of control, or targeted advertising.

[0003] There have been instances of social media companies mishandling user data or sharing it with various parties without proper consent. Once data is shared on social media, users have limited control over it. Privacy settings can be complex and confusing, leading to the unintentional disclosure of sensitive information. Furthermore, 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.

[0004] Social media platforms provide users with the ability to create and share various forms of content, such as photos, videos, and written posts. Users can discover that their content is being used by others without proper attribution or compensation. Copyright infringement and intellectual property disputes are prevalent because social media platforms struggle to regulate the vast amounts of content shared.

[0005] Finally, social media platforms have presented new challenges to mental health, well-being, and social dynamics. Algorithms designed for maximum engagement can create echo chambers, reinforcing existing beliefs and amplifying divisive content. This can lead to polarization and the spread of misinformation. It may also promote harassment, thereby impacting users' emotional well-being and safety.

[0006] Addressing these issues requires a different approach than current social media platforms, including improving privacy regulations, ensuring content ownership, and protecting the well-being of social media users. Summary of the Invention

[0007] Therefore, a hybrid decentralized network system is needed, in which 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 main blockchain, the main blockchain comprising multiple main blockchain blocks arranged in a main linear structure, wherein each of the main blockchain blocks comprises a hash tree structure comprising multiple leaf nodes, wherein each of the multiple leaf nodes comprises a user blockchain arranged in a user hash tree structure.

[0008] Through a hybrid decentralized network system tailored for digital ownership and real-world anchoring, users of this system can automatically and cryptographically sign the content they share and prove ownership. Content can potentially be signed without being shared, allowing users to prove ownership at any time, even years after the content is signed. In other words, a hybrid decentralized network system can provide a blockchain structure with cryptographic hashes that allows for digital ownership. Furthermore, by employing a hybrid decentralized structure, the hybrid decentralized network system solves the energy problem because all content provided on the hybrid decentralized structure may not need to be downloaded by every user of the hybrid decentralized network system.

[0009] 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 include the following steps: providing a hybrid decentralized network system comprising a main blockchain, the main blockchain including a plurality of main blockchain blocks arranged in a main linear structure, wherein each of the main blockchain blocks includes a hash tree structure; selecting a jury from a plurality of users in the hybrid decentralized network system; proposing at least one new main blockchain block from the main blockchain to the jury; verifying the hybrid decentralized network, wherein the jury approves or rejects the at least one new main blockchain block; and settling the at least one new main blockchain block if it is approved by the jury.

[0010] As disclosed herein, a method for verifying a hybrid decentralized network based on a hash tree structure, using a jury selected from multiple users within the network, allows for the verification process of the hash tree structure. Therefore, any probing blockchain attacks or exploits can be detected, ensuring the security of the hybrid decentralized network without having to deploy time- and data-intensive verification methods, such as the well-known proof-of-work and proof-of-stake. Attached Figure Description

[0011] Various embodiments are described below with reference to the accompanying drawings. The drawings are examples of embodiments and are intended to illustrate some features of the currently disclosed hybrid distributed network system and methods for verifying computer implementations of hybrid distributed network systems.

[0012] Figure 1 An embodiment of a hybrid distributed network system as disclosed herein is illustrated in the diagram; Figure 2 An example of a user blockchain is shown; Figure 3Examples of possible actions that a user can perform using a user blockchain are shown, wherein (A) shows a user blockchain with a genesis block and four data blocks representing NFT content, (B) shows a request to add a fifth data block to the user blockchain, (C) shows a request for a user to use or create a new data block to specify an intent, (D) shows a request to delete data blocks 3 and 4, (E) shows a user's deletion request, and (F) shows a specific request to delete data block 2. Figure 4 An embodiment of a method for verifying a computer implementation of a hybrid decentralized network system is shown, wherein new blocks in the block queue or main blockchain are pending, and a jury can verify and approve or reject a leader's proposal for a new block in the block queue. Figure 5 Examples of different steps for performing new main blockchain block verification in a block queue or main blockchain are shown, wherein (A) is the step of a leader proposing a new main blockchain block including a hash tree structure, (B) is the step of selecting a jury pseudo-randomly or randomly based on user activity, (C) is the step of the jury verifying the new main blockchain block by downloading the incremental tree of the new block of the main blockchain, and each jury member sends their signature with their approval or rejection, and (D) is the step of approving the new block of the block queue or main blockchain if more than a certain percentage of jury members send their signatures; Figure 6 An embodiment is shown in which a graph illustrating an incremental tree is displayed, wherein the incremental tree includes updates; Figures 7A-7B An embodiment of a method for updating a block queue is shown in the diagram; Figures 8A-8B An embodiment of a diagram illustrating the concept of a block queue is shown, where B1 and B2 are two subsequent blocks in the block queue. Detailed Implementation

[0013] In this disclosure, the terms blockchain and blockchain are used interchangeably to refer to the same basic idea: a blockchain that can consist of a chain of blocks that may be securely linked together via cryptographic hashes. These blocks can be linked together using cryptographic techniques to form a chronologically ordered chain. For clarity and understanding, the two terms can be used synonymously and should not imply any difference in the technology or its implementation.

[0014] In this disclosure, the term "user" can refer to both physical and non-physical entities. A user can be any entity capable of interacting with the hybrid decentralized network system, whether human or non-human, individual or organization, real or virtual. The concept of "user" in this disclosure can be broad and inclusive, encompassing all entities capable of interacting with the hybrid decentralized network system in any meaningful way. For example, a user can be a human user, i.e., an individual who can access and participate in the platform. A user can be a corporate user, which is an organization and / or enterprise that is also a user of the hybrid decentralized network system. AI-based programs, bot programs, or agents can act as users when they can interact with the hybrid decentralized network system. Automated systems, devices, virtual entities, and data processing systems can also be considered users, provided they can be configured to interact with the hybrid decentralized network system.

[0015] In this disclosure, the terms blockchain or blockchain structure may refer to a blockchain structure, but are not limited to the strict definition of a blockchain. As described in this disclosure, hybrid decentralized networks are based on blockchain data structures, which means that the concept of a blockchain is used with some modifications that may change the strict definition of a blockchain. For example, in some embodiments, a blockchain may be defined as a block queue, in which the first block of the blockchain can be deleted or removed while retaining the structure of the hybrid decentralized network as defined or disclosed in this disclosure. For example, the main blockchain may be defined as the main block queue.

[0016] As described in this 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 in which data can be organized within blocks, and each block can include cryptographic links, such as hashes, to another block. These links form a chain, where each block is connected to the previous block via its hash, ensuring data integrity and security. In this context, a blockchain is not limited to a linear structure but can be any cryptographically linked data block.

[0017] Each path through a hash tree structure or Merkle tree structure can be considered a blockchain in itself, where sibling hashes of different paths within the tree can be used as useful information or additional layers of verification. In this broader context, blockchains can also include a variety of other cryptographic security structures, whether linear, branching, or more complex.

[0018] In this disclosure, the term "blockchain" is used broadly to describe a wide variety of cryptographically linked data structures, including any system, regardless of its specific structure or configuration, that maintains data integrity through the cryptographic hashing and linking of blocks.

[0019] In this disclosure, a blockchain can be defined as a list of blocks, where each block can be a data container holding a payload, at least one piece of metadata, and a hash of previous blocks. The payload, metadata, and hashes of previous blocks can be hashed together to form the hash of the blocks included in the blockchain. The payload can refer to data or information that can be executed or stored within a block. In other words, the payload can be content that the blockchain is designed to store securely, and the payload can be included in each block.

[0020] This disclosure relates to a hybrid decentralized network system including a main blockchain comprising multiple main blockchain blocks, each of which includes a hash tree structure.

[0021] Each of the multiple main blockchain blocks can include the overall or complete state of the hybrid decentralized network at a given time or timestamp. Each main blockchain block can represent the state of the hybrid decentralized network at a specific and unique timestamp. A sequence of main blockchain blocks can represent different states of the hybrid decentralized network at different times, thus having different timestamps.

[0022] In the context of hybrid distributed networks, "state," "overall state," or "global state" can refer to the overall state of all nodes and data within the network at a specific moment. This can include the information stored on each node, the connections and relationships between nodes, and the data processed or transmitted throughout the network. State can also involve understanding the roles played by nodes, such as whether they are active or inactive, and where they are located within the network.

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

[0024] In a hybrid distributed network, the state can be dynamic and changes continuously as nodes join or leave, data is updated or transmitted, and various operations are performed.

[0025] A main blockchain block can include the entire state of the hybrid decentralized network system across various timestamps. The next main blockchain block can include additional updates to the hybrid decentralized network system, marked by subsequent timestamps, preferably occurring after the timestamp of the previous main blockchain block. Additional updates can include deleting or editing content or metadata included in the previous main blockchain block. Additional updates can also include adding content or metadata to the main blockchain block that includes the additional updates.

[0026] In one embodiment, the hybrid decentralized network system is a hybrid decentralized social network system. Multiple users can share content on the hybrid decentralized network system. Preferably, the hybrid decentralized network system can be configured such that, for example, multiple users can download and / or visualize content for each of the multiple users. Because the content can be encrypted with a cryptographic hash, ownership is authenticated, thereby reducing the risk of misuse or abuse of content.

[0027] A social network can refer to a digital platform that enables users to connect, interact, and share various forms of content with each other or with a limited number of other users on the network.

[0028] Hybrid decentralized network systems may include hash tree structures comprising multiple leaf nodes, each of which may include a user blockchain arranged in a user hash tree structure. A user blockchain may include a user genesis block and at least one data block. The hash tree structure may include each user account or user blockchain and its associated content. Therefore, the user blockchain or user account may be publicly visible and provable. Each user account may include a user hash tree structure for its own content or data. Advantageously, unlike individual transactions in contemporary blockchain systems such as cryptocurrency blockchains, each user can control, own, and sign their associated user hash tree structure.

[0029] User blockchains can be owned by users in a hybrid decentralized network. Each user can possess a single key, such as a cryptographic key or a quantum cryptographic key, which authorizes them to add, update, edit, delete, and / or remove content or data from their associated user blockchain. Advantageously, each user has their own single key to update the content of their own user blockchain, a significant advantage compared to contemporary blockchain systems such as cryptocurrency blockchains, where each transaction has a new key or address. The trivialization of access management, as described in this paragraph, reduces the computational burden.

[0030] At least one data block may include at least one non-fungible token (NFT). A 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 exchangeable on a one-to-one basis, NFTs can be indivisible, and each one can be distinct. NFTs can be linked to a blockchain, such as a user blockchain structure as disclosed herein. By linking at least one NFT to a user blockchain structure, content shared by each of multiple users can obtain a secure record of proof of authenticity or ownership. Each of the multiple users can, for example, tokenize and potentially sell their content, which can be, for example, a digital creation as a unique work of art.

[0031] Non-fungible tokens can have the following key characteristics: • Uniqueness: Each NFT can be different and cannot be replaced or exchanged on a comparable basis. This uniqueness can typically be associated with digital art, collectibles, virtual real estate, music, videos, in-game items, and / or other content.

[0032] • Based on blockchain: NFTs can typically be built on blockchain platforms or networks. These blockchains can ensure the authenticity, provenance, and ownership history of NFTs.

[0033] Ownership and Authenticity: NFTs can establish ownership and authenticity of associated content. Blockchain can record who owns an NFT and the content it represents, and this information can be publicly verified.

[0034] • Smart Contracts: NFTs can use smart contracts to define the rules and attributes of the token. These smart contracts can include details about the usage fees, rights, and conditions of use of the associated content or project.

[0035] • Interoperability: NFTs can be bought, sold, and traded on various online marketplaces and platforms that support NFT transactions. This allows users (such as creators and / or collectors) to exchange NFTs across different ecosystems.

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

[0037] • Digital Ownership: NFTs enable the concept of true digital ownership. They allow creators to sell and monetize their content to collectors without the need for traditional intermediaries. They can also allow users to protect their content by certifying ownership should it be susceptible to misuse.

[0038] A user blockchain may include a user genesis block and / or at least one data block. The user genesis block may be the first block of the user blockchain. It can define the basis upon which all subsequent blocks can be added. Subsequent blocks may be at least one data block. The user genesis block may include an initial set of data and information about the user. The user genesis block may not include references to previous blocks because it can be the first block of the user blockchain. The user genesis block may include a cryptographic hash, which may be a unique identifier for the user genesis block. The cryptographic hash of the user genesis block can be used as a reference point for at least one data block that can be added to the user blockchain structure. The user genesis block may contain information such as a timestamp of the creation of the user blockchain and / or initial configuration settings.

[0039] At least one data block may contain various information and data, which may depend on the user's blockchain protocol, and more generally on the hybrid decentralized network system protocol. Preferably, at least one data block may include the following information: Block header Previous block hash: A reference to the hash of a previous data block in the user's blockchain, which can create a link between at least one data block.

[0040] Timestamp: The time at which at least one data block was created, which can provide the chronological order of the blocks.

[0041] Block number (height): A unique identifier indicating the location of a block within a user's blockchain.

[0042] • Smart contracts or scripts: At least one data block may include code or script associated with a smart contract or script.

[0043] ·data: Any useful data, such as video sequences, images, and / or text.

[0044] At least one data block may also include metadata. Metadata can be, for example, data that can provide information about other data.

[0045] At least one data block may also include a cryptographic hash value.

[0046] Hybrid distributed network systems can allow additional data to be included in at least one data block. This can be used to include metadata or information related to at least one data block.

[0047] At least one data block may include at least one link to at least one piece of content and / or at least one piece of content. Each of the at least one link may link to multiple pieces of content. At least one link may be a hyperlink. Preferably, at least one link may be defined as a cryptographic reference or identifier that may point to content that may be located within or outside of at least one data block. At least one link may preferably indicate that the referenced content may be stored in an external database, such as a file storage system or some other data repository or storage system. At least one data block, more generally a user blockchain structure, and even more generally a hybrid decentralized network system may only store references to that data, such as cryptographic hashes, thereby ensuring the immutability of the data or content, while preferably preventing the storage of excessive amounts of data in the hybrid decentralized network system.

[0048] Preferably, at least one link can point to another blockchain or decentralized network. At least one link can indicate that the referenced data or content resides in another blockchain, thereby allowing different blockchains to interact with each other. In the case of smart contracts, at least one link can indicate a function call or interaction with an external smart contract, which can allow the user's blockchain, or preferably a hybrid decentralized network system, to communicate with other decentralized applications.

[0049] At least one piece of content may be included in at least one data block. Advantageously, at least one piece of content may be stored in a hybrid distributed network system. The hybrid distributed network system may also include data storage units configured to store at least one piece of content. Several data storage units may be used to store at least one piece of content: • Hard Disk Drive (HDD): HDDs are traditional mechanical storage devices that use spinning disks to store and retrieve data. They offer relatively large storage capacities but can be slower than other storage technologies.

[0050] 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, desktop computers, and servers.

[0051] • Network Attached Storage (NAS): A NAS system is a dedicated device or server that provides shared storage resources to a network of users or computers. They are typically used for centralized file storage and data sharing.

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

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

[0054] • Data warehouse: A data warehouse is a database specifically designed for storing and analyzing large amounts of historical data, typically used for business intelligence and analytics.

[0055] Preferably, at least one piece of content can be stored in multiple data storage units, which can be advantageously designed for blockchain technology, such as the following options: • 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 a hybrid decentralized network system.

[0056] • Decentralized storage networks: Various decentralized storage platforms exist that allow users to store files on a distributed network of nodes. These networks can provide a way to securely store data or content off-chain and can be integrated with blockchains to maintain data or content references.

[0057] • Databases and cloud storage: In some cases, data or content can be stored in traditional databases or cloud storage. A hybrid distributed network system then stores references to the data or content in external storage (e.g., URLs or cryptographic hashes).

[0058] • Sidechains and Layer 2 Solutions: Some blockchains support sidechains or Layer 2 solutions, which allow certain types of data to be stored outside the main blockchain while still being linked to it. This can help reduce congestion on the main chain while maintaining data integrity.

[0059] • Oracle: Oracles are services that provide external data to smart contracts. They can be used to acquire and verify real-world data from external sources, making it usable in blockchain-based applications.

[0060] • 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.

[0061] • 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 a hybrid decentralized network system.

[0062] At least one piece of content can be configured to be stored in the cloud or a personal user server. The cloud can be cloud storage, which can be configured to store and manage data on a remote server via the internet, preferably provided by a third-party provider. Cloud storage can provide a scalable solution for storing and accessing data without the need for physical hardware maintenance and management. The personal user server can be a desktop computer or any other device that can connect to the internet, and may preferably include local data storage units.

[0063] Preferably, the cloud storage can be a cloud storage system with an uninterrupted connection to the Internet, allowing content to be shared, downloaded, or viewed by multiple users on a hybrid distributed network system. By storing content on cloud storage with an uninterrupted Internet connection, users sharing content on a hybrid distributed network can avoid having their personal devices constantly connected to the Internet.

[0064] At least one piece of content can be at least one video, at least one image, and / or text. Preferably, at least one piece of content can be in any type of format that can be uploaded to a network. At least one piece of content can include at least one audio file and / or at least one image and / or at least one video sequence and / or sensor data.

[0065] At least one piece of content can be publicly shared. At least one piece of content can be kept private by the user. For example, one of several users might be interested in having a cryptographic hash on personal content (such as a private contract or at least one piece of content that the user might wish to keep private). By having a cryptographic hash on the personal content, the user can then have digital proof of ownership of at least one piece of content. Users can share personal content on the hybrid decentralized system network at any time.

[0066] The main blockchain can be a block queue. A block queue can have a different structure than the blockchain. A block queue allows the deletion of at least one main blockchain block, where at least one main blockchain block is not necessarily the most recent block in the main blockchain. By making the main blockchain potentially a block queue, some previous main blockchain blocks can be deleted, thereby reducing the amount of data to be stored in the hybrid decentralized network system. Since the main blockchain blocks can include hash tree structures, including at least one update to a previous hash tree structure in each main blockchain block, some previous blocks of the main blockchain can be deleted.

[0067] In this disclosure, the terms block queue and block queue are used interchangeably to refer to the same basic idea, which is the aforementioned basic idea. For clarity and understanding, the two terms can be used synonymously and should not imply any difference in the technology or its implementation.

[0068] The block queue can be configured to allow the deletion of at least one main blockchain block included in the block queue, and at least one main blockchain block can be placed before the last main blockchain block. The last main blockchain block can be the most recently created block in the main blockchain. Preferably, in a typical blockchain, only the most recently created block can be deleted because every other block placed in the blockchain has a cryptographic hash value that depends on the previous block.

[0069] Preferably, the block queue can be configured to allow the deletion of one or more blocks placed at the beginning of the block queue by copying multiple blocks and starting a new block queue. The new block queue can then include multiple blocks starting from the end of the block queue. The block queue can include a series or sequence of at least one internal block queue, wherein at least one internal block queue can be configured such that at least one last block of a first internal block queue can be copied into or within a second internal block queue, thereby allowing the deletion, forgetting, or erasure of at least one first block of the first block queue. By making the second internal block queue include a copy of at least one last block from the first internal block queue, the first internal block queue can then be deleted, erased, or forgotten.

[0070] The second internal block queue may include an initial salt or seed, wherein the initial salt or seed may be the first block of the second internal block queue, as defined in the previous paragraph. In other words, the initial salt or seed may be the first block from at least one of the last blocks of the first internal block queue. The initial salt or seed may include the same cryptographic hash as it has in the block queue in the second internal block queue.

[0071] An initial salt, or more generally, a salt, can refer to a random value added to data before it is hashed. The primary purpose of a salt can be to ensure that even if two identical pieces of data are hashed, they produce different hash outputs. This can help prevent attackers from reverse engineering the original data using a pre-computed table (such as a rainbow table) from the hash of the original data. While salts may be associated with cryptographic hashing, they can also be used in blockchains to enhance security, especially 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 chained, even if the underlying data is the same.

[0072] An initial seed, or more generally, a seed, can refer to the initial value used to generate a sequence of numbers or keys in a typically deterministic manner. A seed can serve as a starting point for generating pseudo-random numbers or keys, which can be reproduced later if the same seed is used. In blockchains, seeds can be used to generate private keys, wallet addresses, or other cryptographic keys.

[0073] In one embodiment, the second internal block queue may include a salt or seed for uniqueness. Advantageously, this can preferably guarantee that the hash of the second internal block queue may be different from the hash of the first internal block queue, even if the first block may include values ​​that are also contained in the first internal block queue.

[0074] Each of the main blockchain blocks can include updates to the hash tree structure included in previous main blockchain blocks. Updates can be identical in at least two main blockchain blocks. A new main blockchain block can be added, which can include the same hash tree structure as the previous main blockchain blocks.

[0075] An update to the hash tree structure may include at least one deletion of at least one data block and / or at least one new data block. The update may be at least one update relating to at least one user blockchain. Preferably, the update may include, for example, the deletion or addition of at least one data block within the at least one user blockchain.

[0076] The hash tree structure can have a height of 2, preferably 4, more preferably 8, even more preferably 16, and most preferably 30. The height limits the number of users in the hybrid distributed network system. Mathematically, and in the case of a binary hash tree structure, the maximum number of users at a given height is defined as Max{Number_of_users} = 2. Height If the hash tree structure has a height of 30, this assumes a maximum potential number of users of 1.07, 3.74, or 1.824. Preferably, the hash tree structure can have a height greater than 30.

[0077] The hash tree structure can be a Merkle tree structure. A hash tree structure can include nodes. Several types of nodes can exist, such as leaf nodes, intermediate nodes, and root nodes. Leaf nodes are the lowest-level nodes in the hash tree. Each leaf node can include the user's blockchain. Intermediate nodes are nodes above the leaf nodes. Intermediate nodes may not contain data or content, but are formed by hashing the cryptographic hash values ​​of their child nodes. The cryptographic hash value of each intermediate node can be a hash of the cascaded hash values ​​of its child nodes. The top of the hash tree is the root node. The root node can preferably be the main blockchain block. The main blockchain block can contain a cryptographic hash value, which can be calculated from the hash values ​​of its direct child nodes. The hash tree structure can be used to quickly verify that the data included in the hash tree has not been tampered with.

[0078] Hash tree structures can be configured such that nodes have zero child nodes, preferably one child node, and more preferably at least two child nodes. By having more child nodes per node, hash tree structures can be more efficient by reducing the height of the hash tree.

[0079] Each node and / or at least one data block and / or user genesis block and / or each main blockchain block can be labeled with a cryptographic hash. A cryptographic hash (which can also be defined as a hash, cryptographic hash value, or hash value) is a fixed-length sequence of characters generated from input data of arbitrary length. Cryptographic hashes can preferably be generated by a mathematical algorithm called a hash function. Cryptographic hash functions can be designed to have specific properties that make them useful in a variety of security applications, such as data integrity verification, cryptographic hashing, digital signatures, etc. Cryptographic hash functions can have key characteristics such as anti-identification, collision resistance, avalanche effect, and efficiency.

[0080] Cryptographic hashes can be generated by cryptographic hash functions. These functions can be Secure Hash Algorithms (SHA), RACE Integrity Primitive Evaluation Message Digest (RIPEMD), Keccak, BLAKE2, Ethash, and / or Scrypt. Other cryptographic hash functions can also be used. The choice of cryptographic hash function can be based on current standards.

[0081] The cryptographic hash function can have a fixed-size 64-bit output, preferably a fixed-size 128-bit output, more preferably a fixed-size 256-bit output, and even more preferably a fixed-size 512-bit output. The size of the cryptographic hash function can be chosen according to the number of users in the hybrid distributed network system. Advantageously, a high fixed-size output of the cryptographic hash function can allow for hybrid distributed networks with more users and / or more data blocks.

[0082] The user genesis block can be the first block of a user's blockchain. A user genesis block can include a genesis timestamp, network information, a random number, and / or a block number. A random number is a "one-time use number," a term commonly used in cryptography and computer science, referring to a value intended to be used only once for a specific purpose.

[0083] User blockchains can be configured to be owned by users. As described herein, users can be any entity that can engage with the hybrid decentralized network system, whether human or non-human, individual or organization, real or virtual. The hybrid decentralized network can be configured such that the user blockchain can only be modified by the user. Preferably, users can have user cryptographic keys, which are unique to each user, allowing users to cryptographically sign their content, thereby preventing potential corruption or misuse of their content by another user or third-party entity. Each user blockchain can be limited to a user account. User blockchains can be structured as user Merkle trees, where user content or data can be included in user accounts or user Merkle trees.

[0084] Hybrid decentralized networks can be configured to allow users to perform at least one action on a user blockchain. At least one action includes adding at least one data block, deleting at least one data block, or deleting the user blockchain. A user can delete or remove any content that they may have stored or linked to a user blockchain block, which is at least one data block. Advantageously, and compared to typical blockchain principles or definitions, a user can potentially remove at least one data block that may be included in the user blockchain, and where the at least one data block may not necessarily be the most recently created block in the user blockchain. At least one action can be adding at least one data block. A user can add any content to their user blockchain. The content that a user can add can be any content that can potentially be shared and / or stored on the network. Preferably, one data block can be added for one piece of content. More preferably, one or more data blocks can be added for one piece of content. A data block can preferably be used for one piece of content. If a user may wish to delete content, it can preferably be content contained in a data block. By having content in a data block, it may only be necessary to delete one data block to delete a piece of content. Due to the size of content such as videos, content can be divided into multiple segments, and each of these segments can be stored in a data block. Users can also choose which segments can be publicly shared on the hybrid decentralized network and which segments should remain private, while having cryptographic hash values ​​on multiple segments to prove ownership.

[0085] A user blockchain can include data blocks created when a user logs into the hybrid decentralized network system. By including data blocks with timestamps indicating the user's login and / or logout times, an activity score can be built based on user activity on the hybrid decentralized network system. The user blockchain can include data blocks containing information about a user's interactions with the hybrid decentralized network system. For example, a user can interact with content from other users, creating a data block referencing user interactions with other users' content. This could be a comment or reaction to other users' content.

[0086] This disclosure discloses a computer-implemented method for potentially validating a hybrid decentralized network based on a hash tree structure, wherein the method includes the following steps: providing a hybrid decentralized network system comprising a main blockchain, the main blockchain comprising a plurality of main blockchain blocks arranged in a main linear structure, wherein each of the main blockchain blocks includes a hash tree structure; selecting a jury from a plurality of users in the hybrid decentralized network system; proposing at least one new main blockchain block from the main blockchain to the jury; validating the hybrid decentralized network, wherein the jury approves or rejects the at least one new main blockchain block; and settling the at least one new main blockchain block if it is approved by the jury.

[0087] A method for validating a computer implementation of a hybrid decentralized network may include the following steps: selecting a jury from among multiple users in the hybrid decentralized network system, and proposing at least one new main blockchain block to the jury. Advantageously, the selection of the jury may be preferred if a new main blockchain block is to be proposed to the jury.

[0088] In a hybrid decentralized network system, a jury selected from multiple users can verify the system. Verification can be the verification of a cryptographic hash value included in a hash tree structure within at least one new main blockchain block. The jury can decide whether the cryptographic hash value is correct and can decide to approve or reject at least one new main blockchain block. If at least one new main blockchain block is approved, it can be settled within the main blockchain.

[0089] A jury can use data processing devices, etc., to potentially verify the hybrid decentralized network system. These devices can be configured to verify cryptographic hash values ​​and prove that the hash tree structure is intact. 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 action to resolve it and potentially correct the hash tree structure. For example, each user in the hybrid decentralized network system can have a cryptographic key. This key allows a user to interact only with their own user blockchain. By having a cryptographic key, each user can protect their own user blockchain. If a user intends to operate on another user blockchain, the operation may fail and be detected by the hybrid decentralized network system because the user's cryptographic key cannot be verified.

[0090] The verification process for the hybrid decentralized network can preferably be performed by a jury, which approves or rejects at least one new main blockchain block. Therefore, approval or rejection can be performed or implemented by a subset of users included in the hybrid decentralized network (i.e., the jury). Advantageously, this avoids introducing any vulnerabilities because the jury is sampled or selected from all user accounts or from multiple users within the hybrid decentralized network system.

[0091] The method may also include 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's blockchain. When at least one update can be provided to the hybrid decentralized network system, the hybrid decentralized network system may propose at least one new main blockchain block to the jury.

[0092] The method may also include the following steps: if at least one new main blockchain block is rejected by the jury, then propose at least one new main blockchain block. If a majority of the jury cannot approve at least one new main blockchain block, the jury may reject at least one new main blockchain block. Rejection may also be caused by the unavailability of the jury. Jury unavailability may be caused by the jury potentially being offline, or if the jury potentially using an outdated version of the hybrid decentralized network, such as an application that may be used on a phone with an outdated operating system, or if the application using the hybrid decentralized network is outdated.

[0093] A new at least one new main blockchain block may include at least one update from at least one user of the hybrid decentralized network system. If a jury cannot approve at least one new main blockchain block that may include at least one update, then a new at least one new main blockchain block proposed to the jury may include at least one update from at least one user of the hybrid decentralized network system. For similar reasons, a new at least one new main blockchain block may include the hash tree structure of at least one new main blockchain block.

[0094] The method may further include a step of selecting a second jury from among multiple users in the hybrid decentralized network. By selecting a second jury from among multiple users in the hybrid decentralized network, the jury can avoid being selected a second time, thereby preventing the jury from being unavailable a second time in order to approve or reject at least one new main blockchain block. Preferably, the second jury may include multiple second users of the hybrid decentralized network system, wherein the multiple second users are different from the multiple users that may be included in the jury.

[0095] All users and / or secondary users selected by the jury and / or second jury may not necessarily be required to approve or reject at least one new block on the main blockchain and / or at least one new block on the main blockchain. Only a portion of the users and / or secondary users may approve or reject at least one new block on the main blockchain and / or at least one new block on the main blockchain. The portion of the users and / or secondary users may be 10%, preferably 20%, more preferably 30%, even more preferably 40%, further more preferably 50%, further more preferably 60%, and most preferably 70%.

[0096] The method may also include a step of verifying the hybrid decentralized network, wherein a second jury approves or rejects at least one new main blockchain block.

[0097] In one embodiment, the second jury is a jury. The jury can be asked to approve or reject at least one new main blockchain block.

[0098] At least one update may be included in the hash tree structure. As discussed herein, 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 blockchain. At least one update may also be a modification of the hash tree structure, such as a modification of the number of child nodes for each node. At least one update may be an update of a cryptographic hash function used in or by a hybrid decentralized network system.

[0099] The jury and / or second jury can be selected pseudo-randomly or randomly from multiple users in the hybrid decentralized network system. The jury and / or second jury can be selected with bias. Bias can be provided / calculated based on user activity. User activity can be determined based on multiple criteria. User activity can be determined based on the number of data blocks created by a user within a given time period. User activity can be determined based on a user's login / logout activity within a given time period. Preferably, user activity can be determined when selecting a jury from multiple users in the hybrid decentralized network system. By determining user activity when selecting a jury from multiple users in the hybrid decentralized network system, there is a greater chance of avoiding jury unavailability when proposing at least one new main blockchain block and / or at least one new main blockchain block to the jury and / or second jury. User activity can also help the hybrid decentralized network system identify inactive users. Inactive users can be defined as users of the hybrid decentralized network who may have no activity for a long period of time, such as one week, two weeks, three weeks, four weeks, one month, six months, one year, two years, or three years.

[0100] In this hybrid decentralized network, a jury can be selected because all users of the network can be identified. In contemporary blockchain systems such as cryptocurrency blockchains, jury sampling is impossible because it's impossible to identify users on the blockchain. For contemporary blockchain systems, even knowing the number of accounts or users is not feasible.

[0101] User activity can be propagated upwards through a hash tree structure. Various methods can be applied to propagate user activity upwards through the hash tree structure. For example, a user activity score can be calculated based on user activity, as described in this paper. The user activity score can be a number within a given range, and this number can be propagated upwards through the hash tree structure. Thus, a weighted hash tree structure based on user activity can be obtained.

[0102] The jury and / or second jury may download the incremental tree. To verify the hybrid distributed network system, the jury and / or second jury may avoid downloading the hash tree structure. Instead, they may download the incremental tree. The incremental tree can be a partially hash tree that includes at least one update. By downloading the incremental tree, the jury can avoid downloading the hash tree structure, thereby reducing the amount of content and / or data to download.

[0103] Hybrid distributed network systems can be as described in this paper. Detailed description of the attached figures

[0104] Figure 1 An embodiment of a hybrid decentralized network system as disclosed herein is illustrated. In this embodiment, the hybrid decentralized network system includes a block queue comprising a series of blocks, each potentially including an update to a hash tree structure. The block queue may be a main blockchain as disclosed herein. The block queue has a linear structure, where one network state may be followed by another network state at a different timestamp. A network state is the state of the network at a given timestamp, which is preferably a hash tree structure. The main blockchain may preferably have a primary linear structure because network states are unique and can preferably not be split into two or more distinct parallel updates with the same timestamp. In this embodiment, the network state is a hash tree structure or a Merkle tree, where the Merkle tree comprises a network of block stacks, each block stack comprising blocks belonging to a specific user of the hybrid decentralized network. Each block stack represents a user blockchain. Each user blockchain includes at least one data block, depending on the amount of data or content that each user can share or store on the hybrid decentralized network. A data block can represent NFT content, which can be text, video, image, or any other file that can potentially be shared or kept private between hybrid decentralized networks.

[0105] The block queue comprises at least one main blockchain block in a verification period, while the last or most recent block in the queue is the state of the hybrid decentralized network with a given timestamp. At least one block in a verification period can be verified by a jury, as described in the specification. Once multiple blocks have been verified, previous blocks are forgotten, which can mean that forgotten blocks can be deleted from the block queue. By deleting forgotten blocks, disk space can be freed up from the central server, where the hash and hybrid decentralized network could be stored. With the main blockchain, the integrity of the hybrid decentralized network can be checked once a sufficient amount of updates has been provided to it. The sufficient amount of updates can be determined by the leader or the central authority, where a trade-off must be found between the amount of data, updates, or content that the jury might need to download to verify the integrity of the hybrid decentralized network. Too many updates could result in a potentially larger data volume than intended, and too few updates could result in verification periods being too close together, leading to different juries verifying the hybrid decentralized network in a relatively short amount of time or obtaining a relatively large block queue size for potential storage or preservation. This could result in unnecessary verification attempts.

[0106] Figure 2 An embodiment of a user blockchain is illustrated. The user blockchain includes a user genesis block, which serves as the first data block of the user blockchain. Following the user genesis block, the user blockchain structure may include at least one user block or at least one data block. Each data block may include NFT content, wherein the NFT content may preferably be content shared by a user identified in the user genesis block of the user blockchain. The NFT content may be limited to non-fungible token content, wherein the non-fungible token content may be one of the following non-exhaustive lists: • Images and photographs: memes, visually appealing photos, illustrations, quotations, and graphics.

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

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

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

[0110] • Live streaming and narrative: Live streaming and ephemeral content through narrative. Live streaming allows for real-time sharing and interaction, while narrative offers a more casual and ad-hoc format for sharing moments and updates.

[0111] • User-generated content (UGC): Content created by users themselves, such as comments, testimonies, photos or videos submitted by users.

[0112] • Audio content: podcast episodes, audio clips, or sound snippets, which can be informational, entertaining, or inspiring.

[0113] like Figure 2 As shown, a user action / request is to create a new user block or a new data block on the user blockchain. A user action / request can be to delete one or more specific data blocks, create additional data blocks, or request to suppress / delete the entire user blockchain, including the user genesis block, which removes the user from the hybrid decentralized network.

[0114] Figure 3 Examples of possible actions a user can perform using a user blockchain are shown, where (A) shows a user blockchain with a genesis block and four data blocks potentially representing NFT content, (B) shows a request to add a fifth data block to the user blockchain, (C) shows a request for a user to use or create a new data block to specify an intent, (D) shows a request to delete data blocks 3 and 4, (E) shows a user deletion request, and (F) shows a request to specifically delete data block 2. (A) shows a user blockchain with a specific timestamp, where the user blockchain includes a user genesis block and four data blocks potentially containing NFT content. Each data block is related to each other through a hash tree structure, and if the user blockchain structure is corrupted, it can be identified when verifying a hybrid decentralized network system. (B) shows a user attempting to add data block number 5 to the user blockchain structure. Data block number 5 includes a cryptographic hash value linking data block number 5 to the previous data block number 4. (C) shows a request for a user to use or create a new data block to specify an intent on the user blockchain. The intent could be (D), where a user requests the deletion of data block number 2; (E), where a user requests the deletion of their user blockchain, thereby requesting the "right to be forgotten" from the hybrid decentralized network system; and / or (F), where a user requests the specific deletion of data block number 2.

[0115] Figure 4An embodiment of a method for verifying a computer-implemented hybrid decentralized network system is illustrated, wherein new blocks in a block queue or main blockchain are pending, and a jury can verify and approve or reject a leader's proposal for a new block in the block queue. The leader can be the center of the hybrid decentralized network system. The center can be the hybrid decentralized network system. As discussed herein, the leader can propose at least one new main blockchain block or at least one new main blockchain block, which can be approved or rejected by a jury selected from multiple users in the hybrid decentralized network system. Verification or rejection of new blocks in the main blockchain can be performed using a data processing device such as a mobile phone, tablet, or computer, e.g. Figure 6 As shown in the diagram. When the verification process is performed by the jury's data processing unit, the jury can approve or reject a new block on the main blockchain.

[0116] Figure 5 Examples of different steps for performing new main blockchain block verification in a block queue or main blockchain are shown, wherein (A) is the step of a leader proposing a new main blockchain block including a hash tree structure, (B) is the step of selecting a jury pseudo-randomly or randomly based on user activity, (C) is the step of the jury verifying the new main blockchain block by downloading an incremental tree of the new block of the main blockchain, and each jury sends their signature with their approval or rejection, and (D) is the step of approving the new block of the block queue or main blockchain if more than a certain percentage of jury members send their signatures.

[0117] Figure 6 An embodiment illustrating the structure of a specific master blockchain block in a hybrid decentralized network system is shown, specifically illustrating a path. This path shows the route from the specific master blockchain block to at least one data block, which is updated by being added to the user blockchain prior to the specific master blockchain block compared to a previous master blockchain block. This path represents an increment tree, where the increment tree includes at least one updated data block. The increment tree is downloaded by the jury, thus limiting the amount of data the jury needs to download when validating the hybrid decentralized network system by approving a new master blockchain block. The size of the increment tree to be downloaded can be estimated based on calculations. If the hash tree structure is estimated to have a height of 30, and the average user blockchain can have a height of 20, and by assuming each node contains approximately 32 bytes of data, the size of the increment tree would be approximately 1.6 kilobytes. The size of the increment tree assumes that only one data block is validated. If more updates are provided to the hybrid decentralized system network, the number of updates multiplied by the previously calculated size of the increment tree will give an estimate of the total size of the increment tree. By downloading only the incremental tree of specific main blockchain blocks, the jury does not have to download the entire hash tree structure, thus reducing the amount of data to be downloaded and inevitably reducing the energy required to download the reduced amount of data.

[0118] Figure 7A An embodiment of a diagram illustrating a method for updating a block queue is shown. The block queue can be the main blockchain. In the example, each row of blocks represents a block queue that is remembered (i.e., possibly stored in a hybrid decentralized network system). As described herein, each block in the block queue includes a hash tree structure, and each consecutive block includes a hash tree structure with consecutive timestamps. Once the block queue exceeds a predetermined length, such as 7 blocks, a given number of blocks (e.g., the last three blocks) are copied to start a new blockchain, such as a new main blockchain. The last three blocks are an example. Any suitable number of blocks can be used. At least one last block can be copied to start a new main blockchain. In this embodiment, this means that four previous blocks from the main blockchain shown in row 3 are forgotten, deleted, or erased. For this purpose, the blocks can be referred to as forgotten blocks. By forgetting, deleting, or erasing these blocks, storage space can be cleared without losing important data in the hybrid decentralized network system because the last three blocks copied in the new main blockchain include the hash tree structure included in the forgotten blocks, which may have some updates. Once the new main blockchain exceeds the predetermined maximum number of blocks, the same method is applied, such as... Figure 7A As shown in line 8 of the illustrated embodiment, the last three blocks are then replicated in the new main blockchain, as shown in line 9.

[0119] Figure 7B An embodiment of a diagram illustrating a method for updating a block queue is shown. The block queue can be the main blockchain. In the example, each row of blocks represents a block queue that is remembered (i.e., possibly stored in a hybrid decentralized network system). As described herein, each block in the block queue includes a hash tree structure, and each consecutive block includes a hash tree structure with consecutive timestamps. Once the block queue exceeds a predetermined length, such as 7 blocks, a given number of blocks (such as the last three blocks) are copied to start a new blockchain, such as a new main blockchain. The last three blocks are an example. Any suitable number of blocks can be used. At least one last block can be copied to start a new main blockchain. In this embodiment, this means that the four previous blocks from the main blockchain shown in row 3 are forgotten, deleted, or erased. They can be deleted, forgotten, or erased from the hybrid decentralized network system. For this purpose, the blocks can be referred to as forgotten blocks. By forgetting, deleting, or erasing these blocks, storage space can be freed up without losing important data in the hybrid decentralized network system. This is because the three most recent blocks copied to the new main blockchain include the hash tree structure of the forgotten blocks and any potential updates associated with different consecutive timestamps. The same method is applied once the new main blockchain exceeds the predetermined maximum number of blocks. Figure 7BAs shown in line 5 of the embodiment illustrated, the last three blocks are then replicated in the new main blockchain, as shown in line 6. a1 and B a2 Each includes B b1 and B b2 The same hash tree structure, because B b1 and B b2 It is B a1 and B a2 A copy is created to enable the restart of the block queue, as defined herein. Figures 7A-7B As shown in the diagram. However, block B... a1 and B a2 They may not have the same block hash because they are not included in the same block queue. In fact, since the first block in a new block queue includes a salt or seed as defined in this disclosure, subsequent block hashes are linked to that first block hash, which is necessarily different from the copies inherited from it because the new first block includes a salt or seed.

[0120] Figures 8A-8B An embodiment of a diagram illustrating the concept of a block queue is shown, where B1 and B2 are two subsequent blocks in the block queue. Figure 8A An embodiment of the main blockchain is illustrated, comprising seven main blockchain blocks. As described herein, B1 and B2 are two subsequent blocks in the block queue, wherein B1 and B2 preferably do not share any content. B1 represents the entire state of the hybrid decentralized network at a single timestamp or time, while B2 represents the entire state of the hybrid decentralized network at a subsequent timestamp, where the timestamp of B2 may occur after the timestamp of B1. The last block of the graph represents the latest state of the hybrid decentralized network. Each block of the main blockchain includes the state of the hybrid decentralized network at a specific timestamp. A diagram illustrating how the Merkle tree included in the fifth block of the main blockchain encodes or represents the hash tree structure is shown. Merkle tree implementations can be used to optimize the compression of data included in main blockchain blocks. Each leaf node can represent a user blockchain associated with a user of the hybrid decentralized network. Figure 8B An embodiment of the hash tree structure included in the main blockchain blocks B1 and B2 is shown. B2 represents the state of the hybrid decentralized network at a timestamp that may occur after B1's timestamp. A jury can approve B2 if it proves that the update performed in the hybrid decentralized network between B1 and B2 has not been corrupted. B2 represents the current state of the hybrid decentralized network at B2's timestamp. The hash tree structure of B2 is not linked to the hash tree structure of B1. B2 may not include the history of B1. Further details of the invention

[0121] 1. A hybrid decentralized network system including a main blockchain, the main blockchain comprising a plurality of main blockchain blocks arranged in a main linear structure, wherein each of the main blockchain blocks includes a hash tree structure, the hash tree structure including a plurality of leaf nodes, wherein each of the plurality of leaf nodes includes a user blockchain arranged in a user hash tree structure.

[0122] 2. The hybrid decentralized network system according to item 1, wherein the user blockchain includes a user genesis block and / or at least one data block.

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

[0124] 4. A 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.

[0125] 5. A hybrid distributed network system according to any one of the preceding claims, wherein the at least one data block includes at least one link to at least one piece of content and / or at least one piece of content.

[0126] 6. The hybrid distributed network system according to any one of the preceding claims, wherein the hybrid distributed network system further includes a data storage unit configured to store the at least one piece of content.

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

[0128] 8. A hybrid distributed 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 text.

[0129] 9. A hybrid distributed network system according to any one of the preceding claims, wherein the at least one piece of content is preferably publicly shared.

[0130] 10. A hybrid decentralized network system according to any one of the preceding items, wherein the main blockchain is a block queue.

[0131] 11. The hybrid decentralized network system according to claim 10, wherein the block queue is configured to allow the deletion of at least one main blockchain block included in the block queue, and wherein the at least one main blockchain block is arranged before the last main blockchain block.

[0132] 12. A hybrid decentralized network system according to any one of the preceding claims, wherein each of the main blockchain blocks includes an update of the hash tree structure included in the previous main blockchain block.

[0133] 13. A hybrid decentralized network system according to any one of the preceding items, wherein the update is identical in at least two main blockchain blocks.

[0134] 14. The hybrid distributed network system according to item 12, wherein updating the hash tree structure includes at least one deletion of at least one data block and / or at least one new data block.

[0135] 15. The hybrid distributed network system according to any one of the preceding claims, wherein the height of the hash tree structure is 2, preferably 4, more preferably 8, even more preferably 16, and most preferably 30.

[0136] 16. The hybrid distributed network system according to any one of the preceding claims, wherein the hash tree structure comprises nodes.

[0137] 17. A hybrid distributed network system according to any one of the preceding claims, wherein the hash tree structure is configured such that a node has zero child nodes, preferably at least one child node, more preferably at least two child nodes.

[0138] 18. A hybrid decentralized network system according to any one of the preceding items, wherein each node and / or at least one data block and / or user genesis block and / or each main blockchain block is marked with a cryptographic hash.

[0139] 19. The hybrid distributed network system according to item 18, wherein the cryptographic hash is generated by a cryptographic hash function.

[0140] 20. A hybrid distributed network system according to any one of items 18-19, wherein the cryptographic hash function is a secure hash algorithm (SHA), RACE integrity primitive evaluation message digest (RIPEMD), Keccak, BLAKE2, Ethash and / or Scrypt.

[0141] 21. A hybrid distributed 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, and even more preferably a fixed-size 512-bit output.

[0142] 22. A hybrid decentralized network system according to any one of the preceding claims, wherein the user genesis block is the first block of the user blockchain.

[0143] 23. A hybrid distributed network system according to any one of the preceding claims, wherein the user genesis block includes a genesis timestamp, network information, a random number, and / or a block number.

[0144] 24. A hybrid decentralized network system according to any one of the preceding items, wherein the user blockchain is configured to be owned by the user.

[0145] 25. A hybrid decentralized network system according to any one of the preceding claims, wherein the hybrid decentralized network is configured such that the user blockchain can only be modified by the user.

[0146] 26. A hybrid decentralized network system according to any one of the preceding claims, wherein the hybrid decentralized network is configured such that a user performs at least one action on a user blockchain.

[0147] 27. The hybrid decentralized network system according to item 26, wherein the at least one action includes adding at least one data block, deleting at least one data block, or deleting a user blockchain.

[0148] 28. A computer-based method for verifying a hybrid distributed network based on a hash tree structure, wherein the method includes the following steps: Provide a hybrid decentralized network system including a main blockchain, the main blockchain comprising multiple main blockchain blocks arranged in a main linear structure, wherein each of the main blockchain blocks includes a hash tree structure; A jury is selected from among multiple users in the hybrid distributed network system. Propose at least one new main blockchain block from the main blockchain to the jury; Verify the hybrid decentralized network, wherein the jury approves or rejects the at least one new main blockchain block; If the at least one new main blockchain block is approved by the jury, then the at least one new main blockchain block is settled.

[0149] 29. 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 distributed network system.

[0150] 30. A computer-implemented method according to any one of items 28-29, wherein the method further comprises the step of: proposing at least one new main blockchain block if the at least one new main blockchain block is rejected by the jury.

[0151] 31. A computer-implemented method according to any one of items 28-30, wherein the new at least one new master blockchain block includes at least one update from at least one user of the hybrid decentralized network system.

[0152] 32. The computer-implemented method according to any one of items 28-31, wherein the new at least one new main blockchain block includes a hash tree structure of the at least one new main blockchain block.

[0153] 33. The computer-implemented method according to any one of claims 28-32, wherein the method further comprises the step of selecting a second jury from among the plurality of users in the hybrid distributed network.

[0154] 34. A computer-implemented method according to any one of claims 28-33, wherein the method further comprises the step of verifying the hybrid decentralized network, wherein the second jury approves or rejects the new at least one new main blockchain block.

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

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

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

[0158] 38. A computer-implemented method according to any one 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.

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

[0160] 40. The computer-implemented method according to item 39, wherein the deviation is provided / calculated based on user activity.

[0161] 41. A computer-implemented method according to any one of claims 39-40, wherein the user activity propagates upward through the hash tree structure.

[0162] 42. The computer-implemented method according to any one of items 28-41, wherein the jury downloads an incremental tree.

[0163] 43. The computer-implemented method according to item 42, wherein the incremental tree is a partially hash tree including the at least one update.

[0164] 44. A computer-implemented method according to any one of items 28-43, wherein the hybrid distributed network system is a hybrid distributed network system according to any one of items 1-27.

Claims

1. A hybrid decentralized network system, the hybrid decentralized network system comprising a main blockchain, the main blockchain comprising multiple main blockchain blocks arranged in a main linear structure, wherein, Each of the main blockchain blocks includes a hash tree structure comprising multiple leaf nodes, wherein each of the multiple leaf nodes includes a user blockchain arranged in a user hash tree structure, wherein the user blockchain includes a user genesis block and / or at least one data block, and wherein the user blockchain is owned by a user of the hybrid decentralized network system.

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

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

4. The hybrid distributed 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 text.

5. The hybrid distributed network system according to any one of the preceding claims, wherein, The main blockchain is a block queue, wherein the block queue is configured to allow the deletion of at least one main blockchain block included in the block queue, and wherein the at least one main blockchain block is arranged before the last main blockchain block.

6. The hybrid distributed network system according to any one of the preceding claims, wherein, Each node and / or at least one data block and / or user genesis block and / or each main blockchain block is marked with a cryptographic hash, wherein the cryptographic hash is generated by a cryptographic hash function.

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

8. The hybrid distributed network system according to any one of the preceding claims, wherein, The hybrid decentralized network is configured such that a user performs at least one action on the user's blockchain.

9. A method for verifying a computer implementation of a hybrid distributed network, wherein, The method includes the following steps: A hybrid decentralized network system is provided, comprising a main blockchain including multiple main blockchain blocks arranged in a main linear structure, wherein each of the main blockchain blocks includes a hash tree structure, the hash tree structure including multiple leaf nodes, wherein each of the multiple leaf nodes includes a user blockchain arranged in a user hash tree structure, and wherein each of the multiple leaf nodes is associated with a user, such that the hybrid decentralized network system is used by multiple users; A jury is selected from among multiple users in the hybrid decentralized network system, and at least one new main blockchain block is proposed to the jury. Verify the hybrid decentralized network, wherein the jury approves or rejects the at least one new main blockchain block; If the at least one new main blockchain block is approved by the jury, then the at least one new main blockchain block is settled.

10. The computer-implemented method according to claim 9, wherein, The method further includes the step of receiving at least one update from at least one user of the hybrid distributed network system.

11. The computer-implemented method according to any one of claims 9-10, wherein, The method further includes the step of: proposing at least one new main blockchain block if the at least one new main blockchain block is rejected by the jury.

12. The computer-implemented method according to any one of claims 9-11, wherein, The jury is selected pseudo-randomly or randomly from the plurality of users, and the selection of the jury is biased.

13. The computer-implemented method according to claim 12, wherein, The deviation is provided / calculated based on user activity, wherein the user activity propagates upward through the hash tree structure.

14. The computer-implemented method according to any one of claims 10-14, wherein, The jury downloads an incremental tree, wherein the incremental tree is a partially hashed tree that includes the at least one update.

Images