Files
mev-beta/orig/pkg/uniswap/roundtrip_test.go
Administrator 803de231ba feat: create v2-prep branch with comprehensive planning
Restructured project for V2 refactor:

**Structure Changes:**
- Moved all V1 code to orig/ folder (preserved with git mv)
- Created docs/planning/ directory
- Added orig/README_V1.md explaining V1 preservation

**Planning Documents:**
- 00_V2_MASTER_PLAN.md: Complete architecture overview
  - Executive summary of critical V1 issues
  - High-level component architecture diagrams
  - 5-phase implementation roadmap
  - Success metrics and risk mitigation

- 07_TASK_BREAKDOWN.md: Atomic task breakdown
  - 99+ hours of detailed tasks
  - Every task < 2 hours (atomic)
  - Clear dependencies and success criteria
  - Organized by implementation phase

**V2 Key Improvements:**
- Per-exchange parsers (factory pattern)
- Multi-layer strict validation
- Multi-index pool cache
- Background validation pipeline
- Comprehensive observability

**Critical Issues Addressed:**
- Zero address tokens (strict validation + cache enrichment)
- Parsing accuracy (protocol-specific parsers)
- No audit trail (background validation channel)
- Inefficient lookups (multi-index cache)
- Stats disconnection (event-driven metrics)

Next Steps:
1. Review planning documents
2. Begin Phase 1: Foundation (P1-001 through P1-010)
3. Implement parsers in Phase 2
4. Build cache system in Phase 3
5. Add validation pipeline in Phase 4
6. Migrate and test in Phase 5

🤖 Generated with [Claude Code](https://claude.com/claude-code)

Co-Authored-By: Claude <noreply@anthropic.com>
2025-11-10 10:14:26 +01:00

61 lines
2.1 KiB
Go

package uniswap
import (
"math/big"
"testing"
"github.com/holiman/uint256"
"github.com/stretchr/testify/assert"
)
func TestRoundTripConversions(t *testing.T) {
// Test sqrtPriceX96 -> price -> sqrtPriceX96 round trip
sqrtPriceX96 := new(big.Int)
sqrtPriceX96.SetString("79228162514264337593543950336", 10) // 2^96 (price = 1.0)
price := SqrtPriceX96ToPrice(sqrtPriceX96)
resultSqrtPriceX96 := PriceToSqrtPriceX96(price)
// Allow for small differences due to floating point precision
diff := new(big.Int).Sub(sqrtPriceX96, resultSqrtPriceX96)
assert.True(t, diff.Cmp(big.NewInt(1000000000000)) < 0, "Round trip conversion should be accurate")
// Test tick -> sqrtPriceX96 -> tick round trip
tick := 100000
sqrtPrice := TickToSqrtPriceX96(tick)
resultTick := SqrtPriceX96ToTick(sqrtPrice)
// Allow for small differences due to floating point precision
assert.InDelta(t, tick, resultTick, 1, "Round trip tick conversion should be accurate")
}
func TestGetTickAtSqrtPriceWithUint256(t *testing.T) {
// Test with a known value
bigInt := new(big.Int)
bigInt.SetString("79228162514264337593543950336", 10) // 2^96
sqrtPriceX96, _ := uint256.FromBig(bigInt)
tick := GetTickAtSqrtPrice(sqrtPriceX96)
expectedTick := 0 // sqrtPriceX96 = 2^96 corresponds to price = 1.0, which is tick 0
assert.Equal(t, expectedTick, tick, "GetTickAtSqrtPrice should return correct tick")
}
func TestTickSpacingCalculations(t *testing.T) {
currentTick := 100000
// Test with medium tick spacing (60)
nextTick := GetNextTick(currentTick, MediumTickSpacing)
previousTick := GetPreviousTick(currentTick, MediumTickSpacing)
assert.Equal(t, 100020, nextTick, "GetNextTick should return correct next tick")
assert.Equal(t, 99960, previousTick, "GetPreviousTick should return correct previous tick")
// Test with low tick spacing (10)
nextTick = GetNextTick(currentTick, LowTickSpacing)
previousTick = GetPreviousTick(currentTick, LowTickSpacing)
assert.Equal(t, 100010, nextTick, "GetNextTick should return correct next tick")
assert.Equal(t, 100000, previousTick, "GetPreviousTick should return correct previous tick")
}