Skip to content
TheChatArchiveThe Chat Archive
Metallama-2-13b-chat· MetaHugging Face Arena Human Preference 55K

I introduce two concepts 1. Partial store + zk verify, so let’s say if you have four…

From a Chatbot Arena battleThe same person sent this prompt to two anonymous models at once. Compare it with Hugging Facezephyr-7b-beta’s answer.
  1. User

    I introduce two concepts

    1. Partial store + zk verify, so let’s say if you have four data [a,b,c,d]

    Node 1 : [a,b,c] Node 2 : [b,c,d] Etc.

    Taking advantage of merkle tree + zk, we could make node without the need to store all data in the consensus layer, the consensus can work directly with each node only store part of the data of the chain 2. As the chain expand, we add more data to each node without having them to store all, so if we have 100 millions data, assume 100 millions node, then each node have half of the chain data stored only(50% just assume here), we increase to 1000x of the size of original data, we make all node take only like 10x of the data, since we have a lot of node, although all node with store now only 0.5% of all data(1000x/10x -> 100 times diluted) . I called this CPN (copyPerNode), CPN will drop but through can be kept. Node will depend also on other nodes which they will verify each other in merkle tree 3. Introducing mapper(so now we have miner, validator, mapper and also mem pool) Mapper’s role is to ensure that they can fetch and submit data between miners, we need this since on point 2 we have changed the consensus, now every node doesn’t have all the data, so there is a data mapper needed, data mapper are transporter who will strike for maximum efficiency and ensure the throughout of the network is high to get full reward for themselves (taxi driver). 4. Address as segmentation, let’s say there are 100 pointer addresses (0x0000 to 0x00f3), we will segment the pointers and assign them to different node, so

    Node 1 : (0x0000 to 0x0100) Node 2 : (0x0101 to 0x0200)

    The only one problem of this architecture is that as the blockchain scale, there will be latency if the contract call is complicated, so like ten proxy contracts and a lot of different pointers called, but this could be fixed by designing a good mapper consensus in point 3, is there a blockchain like this

  2. Meta Assistant

    Yes, there are blockchain networks that have similar architectures and features as the one you described. Here are a few examples:

    1. Polkadot: Polkadot is a decentralized platform that enables interoperability between different blockchain networks. It uses a multi-chain architecture, where each chain is a separate parachain that can have its own consensus algorithm and validator set. Each parachain has its own data storage, and data is only stored once on the main chain. Polkadot uses a technique called "data availability" to ensure that data is available across all parachains, and it uses a mapping system to route transactions between parachains.
    2. Cosmos: Cosmos is a decentralized network of independent, parallel blockchains, each powered by the Cosmos-SDK, a modular blockchain framework. Each blockchain in the Cosmos network is called a "zone," and zones can have different consensus algorithms and validator sets. Cosmos uses a technique called "hub-and-spoke" to route transactions between zones, and it uses a mapping system to ensure that data is available across all zones.
    3. Solana: Solana is a fast, decentralized blockchain platform that uses a multi-chain architecture. Each chain in the Solana network is called a "shard," and shards can have different consensus algorithms and validator sets. Solana uses a technique called "data availability" to ensure that data is available across all shards, and it uses a mapping system to route transactions between shards.

    In terms of the specific features you mentioned, all of these blockchain networks have some form of data segmentation, where data is stored on different nodes or chains. They also have some form of mapping system to route transactions between nodes or chains. However, the exact implementation and architecture of these features may differ between the networks.

    Regarding the issue of latency as the blockchain scales, all of these networks have implemented various optimizations to improve performance, such as sharding, data pruning, and caching. Additionally, Solana and Polkadot have implemented more advanced techniques such as recursive zk-SNARKs and batching to further improve performance.

    In summary, while there may not be a blockchain network that exactly matches the architecture you described, there are several blockchain networks that have similar features

Responses were produced in different, uncontrolled contexts (system prompts, settings, prior turns). This is not a benchmark.