Uniswap V3 AMM核心原理：集中流动性与Tick数学-北京尧图网络

Uniswap V3 AMM核心原理集中流动性与Tick数学一、引言Uniswap V3是DeFi史上最重要的创新之一——通过集中流动性(Concentrated Liquidity),LP可以将资金集中在特定价格区间,资本效率比V2提升4000倍。但代价是复杂的数学和LP策略。二、从V2恒定乘积到V3集中流动性// V2: x * y k (全价格曲线均匀分配) // 问题: 99%的资金在极端价格下闲置 // V3: 虚拟储备量(Virtual Reserves) // 在区间[P_low, P_high]内: (x x_virtual) * (y y_virtual) L² // L √k, 是流动性的度量 // 核心公式推导: // 价格 P y / x // 在时刻t, x * y L² → x L/√P, y L√P // 当价格从P_a移到P_b: // Δx L * (1/√P_b - 1/√P_a) // Δy L * (√P_b - √P_a)三、Tick数学价格的对数空间3.1 为什么用Tick// V3将连续价格离散化为Tick空间 // tick ∈ [-887272, 887272] // P(tick) 1.0001^tick // tick0: P1.0001^0 1 // tick1000: P1.0001^1000 ≈ 1.105 (USDC/ETH涨10.5%) // tick-1000: P1.0001^-1000 ≈ 0.905 (跌9.5%) // tick887272: P1.0001^887272 ≈ 2^128(最大价格)3.2 SqrtPriceX96避免浮点运算// EVM没有浮点数 → 用Q64.96定点数 // sqrtPriceX96 √P * 2^96 library TickMath { int24 internal constant MIN_TICK -887272; int24 internal constant MAX_TICK 887272; // tick → sqrtPriceX96 function getSqrtRatioAtTick(int24 tick) internal pure returns (uint160) { uint256 absTick tick 0 ? uint256(-int256(tick)) : uint256(tick); // 利用1.0001的二进制分解快速计算 uint256 ratio absTick 0x1 ! 0 ? 0xfffcb933bd6fad37aa2d162d1a594001 : 0x100000000000000000000000000000000; if (absTick 0x2 ! 0) ratio (ratio * 0xfff97272373d413259a46990580e213a) 128; if (absTick 0x4 ! 0) ratio (ratio * 0xfff2e50f5f656932ef12357cf3c7fdcc) 128; if (absTick 0x8 ! 0) ratio (ratio * 0xffe5caca7e10e4e61c3624eaa0941cd0) 128; // ... 更多位移计算 if (absTick 0x20000 ! 0) ratio (ratio * 0x9aa508b5b7a84e1c677de54f3e99bc9) 128; if (tick 0) ratio type(uint256).max / ratio; return uint160((ratio 32) (ratio % (1 32) 0 ? 0 : 1)); } }四、Position管理4.1 Mint添加流动性contract UniswapV3Pool { struct Position { uint128 liquidity; // L int24 tickLower; // P_low对应的tick int24 tickUpper; // P_high对应的tick uint256 feeGrowthInside0LastX128; uint256 feeGrowthInside1LastX128; uint128 tokensOwed0; uint128 tokensOwed1; } mapping(bytes32 Position) public positions; // ★ 核心:铸造流动性 function mint( address owner, int24 tickLower, int24 tickUpper, uint128 amount ) external returns (uint256 amount0, uint256 amount1) { // 1. 计算需要存入的两种Token数量 (amount0, amount1) _calculateAmounts( slot0.sqrtPriceX96, // 当前价格的√P tickLower, tickUpper, amount // ΔL ); // 2. 更新Position Position storage position positions[ keccak256(abi.encodePacked(owner, tickLower, tickUpper)) ]; position.liquidity amount; position.tickLower tickLower; position.tickUpper tickUpper; // 3. 记录入场时的费用增长基数 (position.feeGrowthInside0LastX128, position.feeGrowthInside1LastX128) _getFeeGrowthInside( tickLower, tickUpper ); // 4. 更新Tick位图(标记哪些tick有流动性) if (amount 0) { flipTick(tickLower, true); flipTick(tickUpper, true); } // 5. 转账代币到池子 if (amount0 0) token0.transferFrom(msg.sender, address(this), amount0); if (amount1 0) token1.transferFrom(msg.sender, address(this), amount1); } // 计算给定ΔL时需要存入的Δx和Δy function _calculateAmounts( uint160 sqrtPriceX96, int24 tickLower, int24 tickUpper, uint128 liquidity ) internal pure returns (uint256, uint256) { uint160 sqrtRatioAX96 TickMath.getSqrtRatioAtTick(tickLower); uint160 sqrtRatioBX96 TickMath.getSqrtRatioAtTick(tickUpper); if (sqrtPriceX96 sqrtRatioAX96) { // 当前价格 ≤ 下界: 全部存Token0 return ( FullMath.mulDiv( uint256(liquidity) 96, sqrtRatioBX96 - sqrtRatioAX96, sqrtRatioBX96 * sqrtRatioAX96 / (1 96) ), 0 ); } else if (sqrtPriceX96 sqrtRatioBX96) { // 当前价格 ≥ 上界: 全部存Token1 return ( 0, FullMath.mulDiv( uint256(liquidity) * (1 96), sqrtRatioBX96 - sqrtRatioAX96, 1 96 ) ); } else { // 价格在区间内: 按比例分配两种Token return ( // Token0: 对应(P → P_high)部分 FullMath.mulDiv( uint256(liquidity) 96, sqrtRatioBX96 - sqrtPriceX96, sqrtRatioBX96 * sqrtPriceX96 / (1 96) ), // Token1: 对应(P_low → P)部分 FullMath.mulDiv( uint256(liquidity), sqrtPriceX96 - sqrtRatioAX96, 1 96 ) ); } } }4.2 Swap跨Tick执行// Swap执行流程(Go实现,原合约是Solidity)func(pool*Pool)Swap(zeroForOnebool,amountSpecified*big.Int,sqrtPriceLimitX96*big.Int)(amount0,amount1*big.Int){varexactInput,exactOutputboolifamountSpecified.Sign()0{exactInputtrue// 我要卖出确定数量的Token0}else{exactOutputtrue// 我要买入确定数量的Token1}state:SwapState{amountSpecifiedRemaining:amountSpecified,amountCalculated:new(big.Int),sqrtPriceX96:pool.sqrtPriceX96,tick:pool.tick,liquidity:pool.liquidity,}// ★ 核心循环:逐Tick跨越forstate.amountSpecifiedRemaining.Sign()!0state.sqrtPriceX96.Cmp(sqrtPriceLimitX96)!0{// 1. 找到下一个有流动性的Tickstep:StepComputations{}step.tickNextpool.nextInitializedTick(state.tick,zeroForOne)// 2. 计算该Tick的目标价格step.sqrtPriceNextX96TickMath.GetSqrtRatioAtTick(step.tickNext)// 3. 计算到达下一个Tick所需的Amount Instep.amountInpool.computeSwapStep(state.sqrtPriceX96,targetSqrtPrice(step.sqrtPriceNextX96,sqrtPriceLimitX96,zeroForOne),state.liquidity,state.amountSpecifiedRemaining,)// 4. 累积手续费(V3每笔Swap收取0.05%/0.3%/1%)feeAmount:step.amountIn*pool.fee/1_000_000state.feeGrowthGlobalfeeAmount*(1128)/state.liquidity// 5. 更新状态state.sqrtPriceX96step.sqrtPriceNextX96 state.amountSpecifiedRemaining.Sub(step.amountInfeeAmount)state.amountCalculated.Add(step.amountOut)// 6. 如果到达Tick边界,更新liquidityifstate.sqrtPriceX96.Cmp(step.sqrtPriceNextX96)0{// 跨越Tick → 净流动性该Tick的流动性liquidityDelta:pool.getLiquidityDelta(step.tickNext)state.liquidityliquidityDelta state.tickstep.tickNext}}// 7. 更新池子全局状态pool.sqrtPriceX96state.sqrtPriceX96 pool.tickstate.tick pool.liquiditystate.liquidityreturnamount0,amount1}五、手续费累积机制// V3的手续费累积是精髓: // 全局累积器 f_g Σ(fee_i / L_i) × 2^128 // Position在[t1,t2]应得手续费 L_position × (f_g(t2) - f_g(t1)) contract FeeAccumulator { // 全局累积器(Growth) uint256 public feeGrowthGlobal0X128; uint256 public feeGrowthGlobal1X128; // 每个Tick的外部累积器(区间边界) mapping(int24 uint256) public feeGrowthOutside0X128; mapping(int24 uint256) public feeGrowthOutside1X128; // 计算区间[tickLower, tickUpper]的手续费Growth function getFeeGrowthInside( int24 tickLower, int24 tickUpper, int24 tickCurrent, uint256 feeGrowthGlobal0X128 ) internal view returns (uint256, uint256) { uint256 feeGrowthBelow0X128; uint256 feeGrowthAbove0X128; if (tickCurrent tickLower) { feeGrowthBelow0X128 feeGrowthOutside0X128[tickLower]; } else { feeGrowthBelow0X128 feeGrowthGlobal0X128 - feeGrowthOutside0X128[tickLower]; } if (tickCurrent tickUpper) { feeGrowthAbove0X128 feeGrowthGlobal0X128 - feeGrowthOutside0X128[tickUpper]; } else { feeGrowthAbove0X128 feeGrowthOutside0X128[tickUpper]; } // 全局 - below - above inside! return ( feeGrowthGlobal0X128 - feeGrowthBelow0X128 - feeGrowthAbove0X128, 0 // token1同理 ); } // Position应得手续费 function collectFees(Position storage position) internal returns (uint128, uint128) { (uint256 feeGrowthInside0, uint256 feeGrowthInside1) getFeeGrowthInside( position.tickLower, position.tickUpper, slot0.tick, feeGrowthGlobal0X128 ); // 手续费 L × (当前Growth - 上次收取时的Growth) uint128 tokensOwed0 uint128( FullMath.mulDiv( feeGrowthInside0 - position.feeGrowthInside0LastX128, position.liquidity, FixedPoint128.Q128 ) ); position.feeGrowthInside0LastX128 feeGrowthInside0; return (tokensOwed0, tokensOwed1); } }六、TWAP预言机// V3内置TWAP预言机,每个池子存65536个价格观测点 struct Observation { uint32 blockTimestamp; // 观测时间 int56 tickCumulative; // tick * seconds 累积 uint160 liquidityCumulative; bool initialized; } // 查询TWAP function consult(address pool, uint32 period) external view returns (int24) { Observation memory then observe(pool, 0); // 最早的有效观测 Observation memory now observe(pool, period); // 当前 // tickCumulative是tick×时间的积分 → (now - then) / period 平均tick int56 tickCumulativesDelta now.tickCumulative - then.tickCumulative; int24 timeWeightedAverageTick int24(tickCumulativesDelta / int56(int32(period))); return timeWeightedAverageTick; // TWAP操纵成本 (流动性×时间) → 30分钟TWAP几乎不可能被操纵 }七、V3 vs V2 资本效率对比// 假设ETH/USDC池,当前价格$2000 // V2: 存入 $2000 USDC 1 ETH $4000 TVL // V3: 同样$4000 TVL,集中区间[$1900, $2100] // 当价格在区间内: $4000资金≈V2的$16M资金效率(4000x!) // 计算: // V2: L_v2 √(2000 * 1) 44.72 // V3 narrow: L_v3 $4000/(√2100 - √1900) ≈ 1789 // 效率比: (1789/44.72)² ≈ 1600x (在区间内) // 但区间外流动性0,需要主动管理!八、总结Uniswap V3三大创新:集中流动性— 区间内效率4000x,区间外为0Tick数学— Q64.96定点数 1.0001对数空间,精确无浮点误差手续费累积— 全局Growth→Tick外累积→Position内差分,一键claim复杂度的代价是LP需要主动管理仓位——催生了Arrakis/Gamma等自动化LP协议。

Uniswap V3 AMM核心原理：集中流动性与Tick数学

相关推荐

NLP 评测代码评审，先排数据泄漏和口径漂移

自学嵌入式第23天（Linux系统编程篇——文件编程）

Kimi LeetCode 3906. 统计网格路径中好整数的数目 C语言实现

更多资讯

自学AI应用开发半年后，我为什么还是报了训练营？

AI应用开发学习路径：先懂RAG与Agent原理再动手做项目

从零搭建神经网络开发环境：TensorFlow与Keras实战指南

三月CV顶会观察：多模态、3D重建与模式识别落地实操

嵌入式工程师的端侧AI重构：从CNN物理层开始

传统PID、BP与RBF神经网络自适应PID对比：原理、实现与选型指南

今日更新

防幻觉智能体架构：电源硬件设计中的大模型编排与工具化实践

OpenGL面试核心考点：渲染管线、矩阵变换与性能排查全解析

全国计算机二级C语言真题PDF高效刷题指南

本周精选

防幻觉智能体架构：电源硬件设计中的大模型编排与工具化实践

OpenGL面试核心考点：渲染管线、矩阵变换与性能排查全解析

全国计算机二级C语言真题PDF高效刷题指南

本月热门

我发现了一个新思路：用 Remotion + Claude Code 像写代码一样自动化生成短视频

Windows下 Codex 中 Chrome 和 Computer Use 插件不可用问题排查及解决参考方式：TaoToken 统一 Key 配置与验证

2026 大模型集体涨价：用 Python 做企业 Token 成本测算与选型避坑（附配置）

读完文章，想聊聊您的网站？