# 0x Mesh Architecture ## Metadata **Status**:: #x **Zettel**:: #zettel/literature **Created**:: [[2023-04-17]] **Format**:: #format/pdf **URL**:: [dirve.google.com](https://drive.google.com/file/d/1dAVTEND7e1sISO9VZSOou0DN-igoUi9z/view) **Highlights**:: [[Weijie Wu et al. - 0x Mesh Architecture Doc (Highlights)]] ## Synopsis 0x Mesh is a Peer-to-Peer (P2P) network that utilizes a random topology and gossip protocol. To discover peers, it makes use of a centralized service called the introducer, which acts as a peer registrar. To prevent Denial of Service (DoS) attacks, 0x Mesh uses a combination of measures, including a reputation system, quotas system, and order filtering. These systems work together to ensure that requests to the network are legitimate and trustworthy, helping to prevent malicious attacks and maintain the security of the system. ## Reputation System My neighbors earn reputation points by sending me valuable items. If I don't find the items to be meaningful, they will lose the reputation points. ## Quotas System Every peer has both a pending table and a local storage for storing orders. The pending table serves as a queue for incoming orders that the peer has not yet decided whether to keep. Once the decision is made to store them, the orders move to the local storage. Both the pending table and local storage have size limitations. Orders are prioritized based on the fee rate, which is calculated by dividing total fee by order size. Once the limit is reached, orders with the lowest fee rate are dropped. ## Transaction Filtering 0x Mesh requires orders are fillable for a non-zero amount. Orders must have an expiration time from 1 minute to 1 month.