
A high-performance, drop-in replacement for polymarket-rs-client with latency-optimized data structures and zero-allocation hot paths.
Quick Start
Add to your Cargo.toml:
[]
= "0.1.0"
Replace your imports:
// Before: use polymarket_rs_client::{ClobClient, Side, OrderType};
use ;
async
That's it! Your existing code works unchanged, but now runs significantly faster.
Why polyfill-rs?
100% API Compatible: Drop-in replacement for polymarket-rs-client with identical method signatures
Latency Optimized: Fixed-point arithmetic with cache-friendly data layouts for sub-microsecond order book operations
Market Microstructure Aware: Handles tick alignment, sequence validation, and market impact calculations with nanosecond precision
Production Hardened: Designed for co-located environments processing 100k+ market data updates per second
Performance Comparison
Real-World API Performance (with network I/O)
End-to-end performance with Polymarket's API, including network latency, JSON parsing, and decompression:
| Operation | polyfill-rs | polymarket-rs-client | Official Python Client |
|---|---|---|---|
| Fetch Markets | 368.6 ms ± 67.1 ms | 404.5 ms ± 22.9 ms | 1.366 s ± 0.048 s |
Performance vs Competition:
- 8.9% faster than polymarket-rs-client - 35.9ms improvement
- 3.7x faster than Official Python Client
Note: Best performance achieved with connection keep-alive enabled (client.start_keepalive(Duration::from_secs(30)).await).
Computational Performance (pure CPU, no I/O)
| Operation | Performance | Notes |
|---|---|---|
| Order Book Updates (1000 ops) | 159.6 µs ± 32 µs | 6,260 updates/sec, zero-allocation |
| Spread/Mid Calculations | 70 ns ± 77 ns | 14.3M ops/sec, optimized BTreeMap |
| JSON Parsing (480KB) | ~2.3 ms | SIMD-accelerated parsing (1.77x faster than serde_json) |
Key Performance Optimizations:
polyfill-rs achieves 8.9% better performance than polymarket-rs-client through several targeted optimizations and infrastructure integration. We use simd-json for SIMD-accelerated JSON parsing, which provides a 1.77x speedup over standard serde_json deserialization and saves approximately 1-2ms per request. Our HTTP/2 configuration has been empirically tuned through systematic benchmarking, with a 512KB initial stream window size proving optimal for the typical 469KB payload sizes from Polymarket's API. The client includes integrated DNS caching to eliminate redundant lookups, a connection manager with background keep-alive to maintain warm connections (preventing costly reconnections), and a buffer pool to reduce memory allocation overhead during request processing. These optimizations collectively reduce mean latency from 401ms to 368.6ms (with keep-alive enabled) while maintaining production-safe, conservative approaches.
Performance Breakdown:
- Network (DNS/TCP/TLS): ~150ms (optimized with DNS caching and HTTP/2 tuning)
- Download: ~230ms (improved with 512KB stream window)
- JSON Parse: ~2.3ms (SIMD-accelerated, 1.77x faster than standard parsing)
- Payload: 469KB compressed for simplified markets
Connection Reuse is Critical:
- First request: ~500ms (connection establishment)
- Subsequent requests: ~220-280ms (35.5% faster with connection pooling)
- Keep client alive between requests for best performance
Real Performance Factors:
- Network latency dominates (200-400ms)
- Payload size matters (simplified: 480KB, full: 2.4MB)
- Connection reuse critical for performance
- Different endpoints serve different use cases
Benchmarking Methodology
What We Measure:
- Pure computational performance using Rust's release mode optimizations
- Statistical analysis with multiple runs (mean ± standard deviation)
- Warm-up phases to account for CPU cache effects
- Black-box optimization prevention to ensure realistic measurements
Reproducible Benchmarks:
# Run real-world performance benchmarks (requires .env with API credentials)
The focus is on computational efficiency where Rust's zero-cost abstractions and our optimized algorithms provide measurable advantages.
Migration from polymarket-rs-client
Drop-in replacement in 2 steps:
-
Update Cargo.toml:
# Before: polymarket-rs-client = "0.x.x" = "0.1.1" -
Update imports:
// Before: use polymarket_rs_client::{ClobClient, Side, OrderType}; use ;
Usage Examples
Basic Trading Bot:
use ;
use dec;
let client = with_l2_headers;
// Create and submit order
let order_args = new;
let result = client.create_and_post_order.await?;
High-Frequency Market Making:
use ;
// Real-time order book with fixed-point optimizations
let mut book = new;
let mut stream = new.await?;
// Process thousands of updates per second
while let Some = stream.next.await
How It Works
The library has four main pieces that work together:
Order Book Engine
Critical path optimization through fixed-point arithmetic and memory layout design:
- Before:
BTreeMap<Decimal, Decimal>(heap allocations, decimal arithmetic overhead) - After:
BTreeMap<u32, i64>(stack-allocated keys, branchless integer operations)
Order book updates achieve ~10x throughput improvement by eliminating decimal parsing in the critical path. Price quantization happens at ingress boundaries, maintaining IEEE 754 compatibility at API surfaces while using fixed-point internally for cache efficiency.
Want to see how this works? Check out src/book.rs - every optimization has the commented-out "before" code so you can see exactly what changed and why.
Market Impact Engine
Liquidity-aware execution simulation with configurable market impact models:
let impact = book.calculate_market_impact;
// Returns: VWAP, total cost, basis point impact, liquidity consumption
Implements linear and square-root market impact models with parameterizable liquidity curves. Includes circuit breakers for adverse selection protection and maximum drawdown controls.
Market Data Infrastructure
Fault-tolerant WebSocket implementation with sequence gap detection and automatic recovery. Exponential backoff with jitter prevents thundering herd reconnection patterns. Message ordering guarantees maintained across reconnection boundaries.
Protocol Layer
EIP-712 signature validation, HMAC-SHA256 authentication, and adaptive rate limiting with token bucket algorithms. Request pipelining and connection pooling optimized for co-located deployment patterns.
Performance Characteristics
Designed for deterministic latency profiles in high-frequency environments:
Critical Path Optimizations
- Fixed-point arithmetic: Eliminates floating-point pipeline stalls and decimal parsing overhead
- Lock-free updates: Compare-and-swap operations for concurrent book modifications
- Cache-aligned structures: 64-byte alignment for optimal L1/L2 cache utilization
- Vectorized operations: SIMD-friendly data layouts for batch price level processing
Memory Architecture
- Bounded allocation: Pre-allocated pools eliminate GC pressure and allocation latency spikes
- Depth limiting: Configurable book depth prevents memory bloat in illiquid markets
- Temporal locality: Hot data structures designed for cache line efficiency
Architectural Principles
Precision-performance tradeoff optimization through boundary quantization:
- Ingress quantization: Convert to fixed-point at system boundaries, maintaining tick-aligned precision
- Critical path integers: Branchless comparisons and arithmetic in order matching logic
- Egress conversion: IEEE 754 compliance at API surfaces for downstream compatibility
- Deterministic execution: Predictable instruction counts for latency-sensitive code paths
Implementation notes: Performance-critical sections include cycle count analysis and memory access pattern documentation. Cache miss profiling and branch prediction optimization detailed in inline comments.
Performance Advantages
- Fixed-point arithmetic: Sub-nanosecond price calculations vs decimal operations
- Zero-allocation updates: Order book modifications without memory allocation
- Cache-optimized layouts: Data structures aligned for CPU cache efficiency
- Lock-free operations: Concurrent access without mutex contention
- Network optimizations: HTTP/2, connection pooling, TCP_NODELAY, adaptive timeouts
- Connection pre-warming: 1.7x faster subsequent requests
- Request parallelization: 3x faster when batching operations
Run benchmarks: cargo bench --bench comparison_benchmarks
Network Optimization Deep Dive
How We Achieve Superior Network Performance
polyfill-rs implements advanced HTTP client optimizations specifically designed for latency-sensitive trading:
HTTP/2 Connection Management
// Optimized client with connection pooling
let client = new_internet;
// Pre-warm connections for 70% faster subsequent requests
client.prewarm_connections.await?;
- Connection pooling: 5-20 persistent connections per host
- TCP_NODELAY: Disables Nagle's algorithm for immediate packet transmission
- HTTP/2 multiplexing: Multiple requests over single connection
- Keep-alive optimization: Reduces connection establishment overhead
Request Batching & Parallelization
// Sequential requests (slow)
for token_id in token_ids
// Parallel requests (200% faster)
let futures = token_ids.iter.map;
let prices = join_all.await;
Adaptive Network Resilience
- Circuit breaker pattern: Prevents cascade failures during network instability
- Adaptive timeouts: Dynamic timeout adjustment based on network conditions
- Connection affinity: Sticky connections for consistent performance
- Automatic retry logic: Exponential backoff with jitter
Measured Network Improvements
| Optimization Technique | Performance Gain | Use Case |
|---|---|---|
| Optimized HTTP client | 11% baseline improvement | Every API call |
| Connection pre-warming | 70% faster subsequent requests | Application startup |
| Request parallelization | 200% faster batch operations | Multi-market data fetching |
| Circuit breaker resilience | Better uptime during instability | Production trading systems |
Environment-Specific Configurations
// For co-located servers (aggressive settings)
let client = new_colocated;
// For internet connections (conservative, reliable)
let client = new_internet;
// Standard balanced configuration
let client = new;
Configuration details:
- Colocated: 20 connections, 1s timeouts, no compression (CPU optimization)
- Internet: 5 connections, 60s timeouts, full compression (bandwidth optimization)
- Standard: 10 connections, 30s timeouts, balanced settings
Real-World Trading Impact
In a high-frequency trading environment, these optimizations compound:
- Microsecond advantages: 11% improvement on every API call adds up over thousands of requests
- Cold start elimination: 70% faster warm connections critical for trading session startup
- Batch efficiency: 200% improvement enables real-time multi-market monitoring
- Fault tolerance: Circuit breakers prevent trading halts during network issues
The combination of network optimizations with our computational advantages (fixed-point arithmetic, zero-allocation updates) creates a multiplicative performance benefit for latency-sensitive applications.
Getting Started
[]
= "0.1.0"
Basic Usage
If You're Coming From polymarket-rs-client
Good news: your existing code should work without changes. I kept the same API.
use ;
use Decimal;
// Same initialization as before
let mut client = with_l1_headers;
// Same API calls
let api_creds = client.create_or_derive_api_key.await?;
client.set_api_creds;
// Same order creation
let order_args = new;
let result = client.create_and_post_order.await?;
The difference is sub-microsecond order book operations and deterministic latency profiles.
Real-Time Order Book Tracking
Here's where it gets interesting. You can track live order books for multiple tokens:
use ;
let mut book_manager = new; // Keep top 50 price levels
// This is what happens when you get a WebSocket update
let delta = OrderDelta ;
book_manager.apply_delta?; // This is now super fast
// Get current market state
let book = book_manager.get_book?;
let spread = book.spread; // How tight is the market?
let mid_price = book.mid_price; // Fair value estimate
let best_bid = book.best_bid; // Highest buy price
let best_ask = book.best_ask; // Lowest sell price
The apply_delta operation now executes in constant time with predictable cache behavior.
Market Impact Analysis
Before you place a big order, you probably want to know what it'll cost you:
use FillEngine;
let mut fill_engine = new;
// Simulate buying $1000 worth
let order = MarketOrderRequest ;
let result = fill_engine.execute_market_order?;
println!;
println!;
println!;
println!;
println!;
This tells you exactly what would happen without actually placing the order. Super useful for position sizing.
WebSocket Streaming (The Fun Part)
Here's how you connect to live market data. The library handles all the annoying reconnection stuff:
use ;
let mut stream = new;
// Set up authentication (you'll need API credentials)
let auth = WssAuth ;
stream = stream.with_auth;
// Subscribe to specific markets
stream.subscribe_market_channel.await?;
// Process live updates
while let Some = stream.next.await
The stream automatically reconnects when it drops. You just keep processing messages.
Example: Simple Spread Trading Bot
Here's a basic bot that looks for wide spreads and tries to capture them:
use ;
The key insight: with fast order book updates, you can check hundreds of tokens for opportunities without the library being the bottleneck.
Pro tip: The trading strategy examples in the code include detailed comments about market microstructure, order flow, and risk management techniques.
Configuration Tips
Order Book Depth Settings
The most important performance knob is how many price levels to track:
// For most trading bots: 10-50 levels is plenty
let book_manager = new;
// For market making: maybe 100+ levels
let book_manager = new;
// For analysis/research: could go higher, but memory usage grows
let book_manager = new;
Why this matters: Each price level takes memory, but 90% of trading happens in the top 10 levels anyway. More levels = more memory usage for diminishing returns.
The code comments in src/book.rs explain the memory layout and why we chose these specific data structures for different use cases.
WebSocket Reconnection
The defaults are pretty good, but you can tune them:
let reconnect_config = ReconnectConfig ;
let stream = new
.with_reconnect_config;
Memory Usage
If you're tracking lots of tokens, you might want to clean up stale books:
// Remove books that haven't updated in 5 minutes
let removed = book_manager.cleanup_stale_books?;
println!;
Error Handling (Because Things Break)
The library tries to be helpful about what went wrong:
use PolyfillError;
match book_manager.apply_delta
Most errors tell you whether they're worth retrying or if you should give up.
What's Different From Other Libraries?
Performance
Most trading libraries are built for "demo day" - they work fine for small examples but fall apart under real load. This one is designed for people who actually need to process thousands of updates per second.
Market Microstructure Compliance
Automatic tick size validation and price quantization prevent market fragmentation and ensure exchange compatibility. Sub-tick pricing rejection happens at ingress with zero-cost integer modulo operations.
Tick alignment implementation includes detailed analysis of market maker adverse selection and the role of minimum price increments in maintaining orderly markets.
Memory Management
Bounded memory growth through configurable depth limits and automatic stale data eviction. Memory usage scales linearly with active price levels rather than total market depth, preventing memory exhaustion in volatile market conditions.