[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"article-deep-evm-16-dabao-chongtu-jiejue-zuzhuang-jiaoyia":3},{"article":4,"author":59},{"id":5,"category_id":6,"title":7,"slug":8,"excerpt":9,"content_md":10,"content_html":11,"locale":12,"author_id":13,"published":14,"published_at":15,"meta_title":16,"meta_description":17,"focus_keyword":18,"og_image":19,"canonical_url":19,"robots_meta":20,"created_at":15,"updated_at":15,"tags":21,"category_name":39,"related_articles":40},"d3000000-0000-0000-0000-000000000116","a0000000-0000-0000-0000-000000000036","Deep EVM #16：打包和冲突解决——组装盈利交易","deep-evm-16-dabao-chongtu-jiejue-zuzhuang-jiaoyia","使用位掩码检测、贪心打包和通过Flashbots MEV-Share提交将多笔MEV套利交易打包成无冲突的Bundle。","## 从单笔交易到Bundle\n\n在发现多个套利机会并模拟确认盈利后，下一步是将它们打包成一个Bundle。挑战在于：多笔交易可能访问相同的池，导致冲突。\n\n## 冲突检测\n\n两笔交易冲突当且仅当它们访问相同的存储槽（池状态）。使用位掩码可以高效检测冲突：\n\n```rust\nstruct TxCandidate {\n    profit: U256,\n    gas_cost: U256,\n    pool_mask: u128,  \u002F\u002F 每个池一个bit\n}\n\nfn conflicts(a: &TxCandidate, b: &TxCandidate) -> bool {\n    (a.pool_mask & b.pool_mask) != 0\n}\n```\n\n## 贪心打包\n\n将无冲突的交易打包成利润最大化的Bundle是一个加权最大独立集问题（NP-hard）。在实践中，按利润\u002Fgas比排序的贪心算法表现良好：\n\n```rust\nfn greedy_pack(candidates: &mut Vec\u003CTxCandidate>) -> Vec\u003CTxCandidate> {\n    candidates.sort_by(|a, b| {\n        let ratio_a = a.profit * 1000 \u002F a.gas_cost;\n        let ratio_b = b.profit * 1000 \u002F b.gas_cost;\n        ratio_b.cmp(&ratio_a)\n    });\n    \n    let mut bundle = Vec::new();\n    let mut used_pools: u128 = 0;\n    \n    for tx in candidates.iter() {\n        if (used_pools & tx.pool_mask) == 0 {\n            used_pools |= tx.pool_mask;\n            bundle.push(tx.clone());\n        }\n    }\n    \n    bundle\n}\n```\n\n## 通过Flashbots提交\n\nBundle通过Flashbots MEV-Share或直接到区块构建者提交。提交包括：\n- 交易列表（有序）\n- 目标区块号\n- 可选的退款地址和百分比\n\n## 总结\n\n打包是MEV机器人从单个机会到整体盈利能力的关键步骤。通过位掩码冲突检测、贪心打包算法和高效的Bundle提交，你可以最大化每个区块的总提取价值。","\u003Ch2 id=\"bundle\">从单笔交易到Bundle\u003C\u002Fh2>\n\u003Cp>在发现多个套利机会并模拟确认盈利后，下一步是将它们打包成一个Bundle。挑战在于：多笔交易可能访问相同的池，导致冲突。\u003C\u002Fp>\n\u003Ch2 id=\"\">冲突检测\u003C\u002Fh2>\n\u003Cp>两笔交易冲突当且仅当它们访问相同的存储槽（池状态）。使用位掩码可以高效检测冲突：\u003C\u002Fp>\n\u003Cpre>\u003Ccode class=\"language-rust\">struct TxCandidate {\n    profit: U256,\n    gas_cost: U256,\n    pool_mask: u128,  \u002F\u002F 每个池一个bit\n}\n\nfn conflicts(a: &TxCandidate, b: &TxCandidate) -> bool {\n    (a.pool_mask & b.pool_mask) != 0\n}\n\u003C\u002Fcode>\u003C\u002Fpre>\n\u003Ch2 id=\"\">贪心打包\u003C\u002Fh2>\n\u003Cp>将无冲突的交易打包成利润最大化的Bundle是一个加权最大独立集问题（NP-hard）。在实践中，按利润\u002Fgas比排序的贪心算法表现良好：\u003C\u002Fp>\n\u003Cpre>\u003Ccode class=\"language-rust\">fn greedy_pack(candidates: &mut Vec<TxCandidate>) -> Vec<TxCandidate> {\n    candidates.sort_by(|a, b| {\n        let ratio_a = a.profit * 1000 \u002F a.gas_cost;\n        let ratio_b = b.profit * 1000 \u002F b.gas_cost;\n        ratio_b.cmp(&ratio_a)\n    });\n    \n    let mut bundle = Vec::new();\n    let mut used_pools: u128 = 0;\n    \n    for tx in candidates.iter() {\n        if (used_pools & tx.pool_mask) == 0 {\n            used_pools |= tx.pool_mask;\n            bundle.push(tx.clone());\n        }\n    }\n    \n    bundle\n}\n\u003C\u002Fcode>\u003C\u002Fpre>\n\u003Ch2 id=\"flashbots\">通过Flashbots提交\u003C\u002Fh2>\n\u003Cp>Bundle通过Flashbots MEV-Share或直接到区块构建者提交。提交包括：\u003C\u002Fp>\n\u003Cul>\n\u003Cli>交易列表（有序）\u003C\u002Fli>\n\u003Cli>目标区块号\u003C\u002Fli>\n\u003Cli>可选的退款地址和百分比\u003C\u002Fli>\n\u003C\u002Ful>\n\u003Ch2 id=\"\">总结\u003C\u002Fh2>\n\u003Cp>打包是MEV机器人从单个机会到整体盈利能力的关键步骤。通过位掩码冲突检测、贪心打包算法和高效的Bundle提交，你可以最大化每个区块的总提取价值。\u003C\u002Fp>\n","zh","b0000000-0000-0000-0000-000000000001",true,"2026-03-28T10:44:26.123889Z","Deep EVM #16：打包和冲突解决——组装MEV交易","将多笔MEV套利交易打包成无冲突Bundle：位掩码检测、贪心打包和通过Flashbots MEV-Share提交。","mev打包 冲突解决",null,"index, follow",[22,27,31,35],{"id":23,"name":24,"slug":25,"created_at":26},"c0000000-0000-0000-0000-000000000019","MEV","mev","2026-03-28T10:44:21.513630Z",{"id":28,"name":29,"slug":30,"created_at":26},"c0000000-0000-0000-0000-000000000001","Rust","rust",{"id":32,"name":33,"slug":34,"created_at":26},"c0000000-0000-0000-0000-000000000013","Security","security",{"id":36,"name":37,"slug":38,"created_at":26},"c0000000-0000-0000-0000-000000000009","Web3","web3","工程",[41,47,53],{"id":42,"title":43,"slug":44,"excerpt":45,"locale":12,"category_name":39,"published_at":46},"d0000000-0000-0000-0000-000000000668","为什么Bali在2026年正在成为东南亚的影响力科技中心","weishenme-bali-2026-zhengzai-chengwei-dongnanya-yingxiangli-keji-zhongxin","Bali在东南亚创业生态系统中排名第16位。随着Web3构建者、AI可持续发展初创公司和生态旅游科技公司的集中，该岛正在打造区域影响力科技之都的独特定位。","2026-03-28T10:44:48.898750Z",{"id":48,"title":49,"slug":50,"excerpt":51,"locale":12,"category_name":39,"published_at":52},"d0000000-0000-0000-0000-000000000667","ASEAN数据保护拼图：开发者合规清单","asean-shuju-baohu-pintu-kaifazhe-heguiqingdan","七个ASEAN国家现已拥有全面的数据保护法律，各自具有不同的同意模型、本地化要求和处罚结构。这是一份为构建多国应用程序的开发者准备的实用合规清单。","2026-03-28T10:44:48.893467Z",{"id":54,"title":55,"slug":56,"excerpt":57,"locale":12,"category_name":39,"published_at":58},"d0000000-0000-0000-0000-000000000666","Indonesia 290亿美元数字化转型：软件公司的机遇","indonesia-290yi-meiyuan-shuzihua-zhuanxing-ruanjian-gongsi-jiyu","Indonesia IT服务市场预计在2026年达到290.3亿美元，高于2025年的243.7亿美元。云基础设施、AI、电子商务和数据中心正在推动东南亚最快的增长。","2026-03-28T10:44:48.875457Z",{"id":13,"name":60,"slug":61,"bio":62,"photo_url":19,"linkedin":19,"role":63,"created_at":64,"updated_at":64},"Open Soft Team","open-soft-team","The engineering team at Open Soft, building premium software solutions from Bali, Indonesia.","Engineering Team","2026-03-28T08:31:22.226811Z"]