Developing a Fast ML Inference System with Monitoring and Automation

We design and develop full-cycle blockchain solutions: from smart contract architecture to launching DeFi protocols, NFT marketplaces and crypto exchanges. Security audits, tokenomics, integration with existing infrastructure.
Showing 1 of 1All 1305 services
Developing a Fast ML Inference System with Monitoring and Automation
Complex
from 2 weeks to 3 months
Frequently Asked Questions

Blockchain Development Services

Blockchain Development Stages

Latest works

  • image_website-b2b-advance_0.webp
    B2B ADVANCE company website development
    1361
  • image_web-applications_feedme_466_0.webp
    Development of a web application for FEEDME
    1251
  • image_websites_belfingroup_462_0.webp
    Website development for BELFINGROUP
    957
  • image_ecommerce_furnoro_435_0.webp
    Development of an online store for the company FURNORO
    1189
  • image_logo-advance_0.webp
    B2B Advance company logo design
    646
  • image_crm_enviok_479_0.webp
    Development of a web application for Enviok
    929

We've encountered the scenario: a trained model shows 70% accuracy on historical data, but in production predictions arrive with a delay of several seconds — the strategy loses profit. A real-time ML prediction system is not just 'deploy a model'; it's an infrastructure with low-latency serving, quality monitoring, and automatic model switching. Our experience includes 10+ years in high-load ML and blockchain trading, with 5 turnkey systems implemented. Certified engineers guarantee P95 latency below 50 ms and directional accuracy of at least 55%. Our clients save an average of $5,000 per month on GPU costs. We have delivered over 5 such systems for crypto funds and prop trading companies.

To achieve stable latency and accuracy, you need to solve several key problems: feature pipeline optimization, serving method selection, batching, model versioning, and real-time monitoring. Let's examine each on the example of a real project — a trading system on the cryptocurrency market. According to NVIDIA, batching improves GPU utilization up to 5x.

How to Build Low-Latency ML Inference?

The architecture of real-time serving is built around a pipeline: data → features → inference → consumption. We'll demonstrate on a trading system example.

Market Data Sources
    │
    ▼
Feature Pipeline (sliding window calculation)
    │
    ▼
Feature Store (Redis — hot features)
    │
    ▼
ML Model Server (FastAPI + GPU/CPU inference)
    │
    ▼
Prediction Cache (Redis — результаты)
    │
    ├──► Trading Strategy (consume predictions)
    ├──► Dashboard (visualize)
    └──► Monitoring (track accuracy)

Feature Pipeline for Real-Time

import asyncio
import numpy as np
from collections import deque
from datetime import datetime

class RealtimeFeaturePipeline:
    def __init__(self, symbol, window_sizes=[60, 120, 240]):
        self.symbol = symbol
        self.window_sizes = window_sizes
        self.max_window = max(window_sizes)
        
        self.price_buffer = deque(maxlen=self.max_window + 10)
        self.volume_buffer = deque(maxlen=self.max_window + 10)
        self.high_buffer = deque(maxlen=self.max_window + 10)
        self.low_buffer = deque(maxlen=self.max_window + 10)
    
    def update(self, ohlcv):
        self.price_buffer.append(ohlcv['close'])
        self.volume_buffer.append(ohlcv['volume'])
        self.high_buffer.append(ohlcv['high'])
        self.low_buffer.append(ohlcv['low'])
    
    def get_features(self):
        if len(self.price_buffer) < self.max_window:
            return None
        
        prices = np.array(self.price_buffer)
        volumes = np.array(self.volume_buffer)
        highs = np.array(self.high_buffer)
        lows = np.array(self.low_buffer)
        
        features = {}
        
        for window in self.window_sizes:
            p = prices[-window:]
            v = volumes[-window:]
            
            features[f'return_{window}'] = (p[-1] - p[0]) / p[0]
            features[f'return_std_{window}'] = np.std(np.diff(np.log(p)))
            features[f'vol_ratio_{window}'] = v[-1] / np.mean(v)
            diffs = np.diff(p)
            gains = diffs[diffs > 0].sum()
            losses = -diffs[diffs < 0].sum()
            rs = gains / (losses + 1e-8)
            features[f'rsi_{window}'] = 100 - 100 / (1 + rs)
            ma = np.mean(p)
            std = np.std(p)
            features[f'bb_pos_{window}'] = (p[-1] - ma) / (2 * std + 1e-8)
        
        return features

ML Model Serving with FastAPI

FastAPI Serving Code
from fastapi import FastAPI
from pydantic import BaseModel
import joblib
import numpy as np
from typing import Optional
import time

app = FastAPI()

models = {
    'lgbm_1h': joblib.load('models/lgbm_1h_v3.pkl'),
    'lgbm_4h': joblib.load('models/lgbm_4h_v2.pkl'),
    'lstm_24h': load_torch_model('models/lstm_24h_v1.pt')
}
scaler = joblib.load('models/feature_scaler.pkl')

class PredictionRequest(BaseModel):
    symbol: str
    features: dict
    model_id: Optional[str] = 'lgbm_1h'

class PredictionResponse(BaseModel):
    symbol: str
    model_id: str
    prediction: float
    probability_up: float
    probability_down: float
    confidence: float
    latency_ms: float
    timestamp: str

@app.post("/predict", response_model=PredictionResponse)
async def predict(request: PredictionRequest):
    start_time = time.time()
    feature_vector = np.array(list(request.features.values())).reshape(1, -1)
    feature_vector_scaled = scaler.transform(feature_vector)
    model = models.get(request.model_id, models['lgbm_1h'])
    proba = model.predict_proba(feature_vector_scaled)[0]
    latency = (time.time() - start_time) * 1000
    return PredictionResponse(
        symbol=request.symbol,
        model_id=request.model_id,
        prediction=float(proba[1] - proba[0]),
        probability_up=float(proba[1]),
        probability_down=float(proba[0]),
        confidence=float(max(proba)),
        latency_ms=latency,
        timestamp=datetime.utcnow().isoformat()
    )

Why Batching Is 10x More Efficient Than Single Requests?

At high request volumes, batching reduces overhead. Instead of thousands of individual calls — one batch. Throughput scales linearly up to 10x, and on GPU up to 15x. GPU-hour cost reduction reaches 50%. Batching is a key technique for low-latency systems: it reduces the number of model calls and amortizes fixed overhead. Thanks to batching and pipeline optimization, you reduce GPU-hour costs by 30-50%, and the average project pays for itself in 4-6 months.

class BatchedPredictor:
    def __init__(self, model, batch_size=32, max_wait_ms=10):
        self.model = model
        self.batch_size = batch_size
        self.max_wait_ms = max_wait_ms
        self.queue = asyncio.Queue()
    
    async def predict(self, features):
        future = asyncio.Future()
        await self.queue.put((features, future))
        return await future
    
    async def batch_worker(self):
        while True:
            batch = []
            try:
                item = await asyncio.wait_for(
                    self.queue.get(), timeout=self.max_wait_ms/1000
                )
                batch.append(item)
                while len(batch) < self.batch_size and not self.queue.empty():
                    batch.append(self.queue.get_nowait())
            except asyncio.TimeoutError:
                continue
            if batch:
                features_batch = np.array([b[0] for b in batch])
                predictions = self.model.predict_proba(features_batch)
                for i, (_, future) in enumerate(batch):
                    future.set_result(predictions[i])

Step-by-Step Batch Inference Setup

  1. Estimate typical RPS (requests per second) — this determines batch size.
  2. Choose batch_size so that latency does not exceed 50 ms for 95% of requests.
  3. Set a batch accumulation timeout (usually 5-15 ms).
  4. Use asynchronous queues (asyncio.Queue) to collect requests.
  5. Profile with cProfile or py-spy.

Model Registry and Versioning

Model registry with MLflow allows automatic promotion of models to Production based on accuracy and Sharpe ratio thresholds.

import mlflow
from mlflow.tracking import MlflowClient

class ModelRegistry:
    def __init__(self, tracking_uri):
        mlflow.set_tracking_uri(tracking_uri)
        self.client = MlflowClient()
    
    def load_production_model(self, model_name):
        model_version = self.client.get_latest_versions(
            model_name, stages=['Production']
        )[0]
        model = mlflow.sklearn.load_model(
            f"models:/{model_name}/{model_version.version}"
        )
        return model, model_version
    
    def promote_to_production(self, model_name, version, metrics):
        if metrics['test_accuracy'] > 0.54 and metrics['sharpe'] > 1.2:
            self.client.transition_model_version_stage(
                model_name, version, 'Production'
            )
            return True
        return False

Why Prediction Quality Monitoring Matters?

Real-time monitoring catches degradation before losses occur. Metrics are collected in Prometheus, visualized in Grafana. When directional accuracy drops below 50%, an automatic rollback is triggered.

Metric Description Alert Threshold
directional_accuracy Fraction of correct direction <0.55
high_confidence_accuracy Accuracy when confidence >0.7 <0.65
P95 latency Inference latency >50 ms
P99 latency Maximum latency >100 ms

How Automatic Rollback Works

We configured the pipeline so that when accuracy decreases or latency increases above thresholds, the system rolls back to the previous Production model version. This takes less than 10 seconds. All metrics are logged in MLflow, enabling quick analysis of degradation causes.

Implementation Stages

Stage Duration Result
Analytics and current latency measurement 1 week baseline metrics, bottlenecks
Design and prototype 2 weeks architecture, technology selection
Core component implementation 3-4 weeks feature pipeline, inference server
Integration and load testing 1 week SLA latency confirmation
Launch and monitoring 1 week production system with alerting

Total timeline: 4 to 8 weeks. Cost is calculated individually. The average project pays for itself in 4-6 months through GPU-hour cost savings and improved trading accuracy.

What's Included in the Work

  • Audit of current ML infrastructure
  • Architecture design for real-time serving
  • Development of feature pipeline and inference server
  • Integration with MLflow and A/B testing setup
  • Quality monitoring and alerting (Prometheus + Grafana)
  • Documentation and team training

Order a turnkey system development — get a consultation on architecture and latency estimation within a day. We guarantee SLA for latency and accuracy. Contact us for an audit of your current ML infrastructure. GPU-hour savings through batching reach up to 30%. We specialize in crypto trading ML systems, providing real-time ML predictions with strict SLA latency guarantees.

MLflow documentation FastAPI

Why exchange development requires deep domain expertise

We develop exchanges — not 'chart sites,' but matching engines that process thousands of orders per second without delay, route liquidity between pools, and guarantee that no user gains access to others' funds. Teams that start with the UI and postpone the engine 'for later' end up rewriting everything in six months in 90% of cases.

Order Book vs AMM: where most projects break

Centralized exchanges (CEX) are built around an order book + matching engine. Decentralized exchanges (DEX) either also use an order book (dYdX on StarkEx, Serum/OpenBook on Solana) or an AMM with concentrated liquidity (Uniswap v3/v4, Curve, Balancer). A classic mistake when developing a CEX is implementing the matching engine on top of a relational database with transactions for each match. PostgreSQL handles ~500 RPS without special effort, but at peak loads of 5,000–10,000 orders per second, it turns into a deadlock nightmare. The correct architecture: in-memory order book (Redis Sorted Sets or custom C++/Rust structure), asynchronous writing of matches to PostgreSQL via a queue (Kafka/RabbitMQ), and a separate settlement service that finally updates balances.

For DEX, the most painful problem is sandwich attacks and MEV. A pool with a plain xy=k AMM without slippage protection becomes a target for MEV bots within hours of launch. Uniswap v2 lost hundreds of millions of dollars in user liquidity. Solutions: integration with Flashbots Protect, a commit-reveal scheme for orders, or switching to TWAMM (Time-Weighted AMM) for large trades.

Concentrated liquidity and impermanent loss

Uniswap v3 introduced concentrated liquidity – LPs choose a price range in which to provide liquidity. Capital efficiency increased 4,000x compared to v2 for stable pairs. But implementing this mechanism correctly is non-trivial. The Uniswap v3 liquidity contract uses tick-based accounting: the price space is divided into discrete ticks (tick = log₁.0001(price)), each tick stores accumulated fee growth and liquidity delta. When creating a position, the lower and upper ticks are computed, and the contract recalculates all active positions at each swap. Storage layout is critical here – incorrect variable packing in slots easily adds 40–60% to swap gas cost.

We implemented a Uniswap v3 fork for a client on Polygon with a custom fee tier system. The initial version consumed 180k gas for a swap across 2 ticks. After slot packing of variables in Tick.Info and inlining several internal calls, it dropped to 112k gas. This reduced gas costs by 38% and saved the client substantial costs on fees monthly. The techniques applied are described in the Uniswap v3 Whitepaper and confirmed by our audit experience.

How a matching engine delivers performance

A production-ready matching engine is built according to the following scheme:

  • Order ingestion layer – WebSocket gateway (Go or Rust), accepts orders, validates signature, checks balance via Redis, queues them. Latency at this level must be <1ms.
  • Matching core – single-threaded event loop (eliminates race conditions without mutexes). In memory, we hold two Sorted Sets for each trading instrument: bids and asks. FIFO matching for limit orders, immediate-or-cancel for market orders. Throughput with a proper Rust implementation – 500k–1M matches per second on a single core.
  • Settlement service – reads matches from Kafka, atomically updates balances in PostgreSQL (UPDATE accounts SET balance = balance - $1 WHERE id = $2 AND balance >= $1). Optimistic locking via row versioning.
  • Withdrawal pipeline – separate service with cold/hot wallet architecture. The hot wallet holds 5–10% of total deposits, the rest is cold storage with multi-sig (Gnosis Safe or custom HSM). Automatic withdrawals only from hot wallet, large amounts require manual authorization.
Component Technology Latency / Throughput
Order gateway Go + WebSocket <1ms p99
Matching engine Rust (in-memory) 500k+ orders/sec
Balance store Redis (write-through) <0.5ms
Settlement DB PostgreSQL 14+ ~50k TPS with partitioning
Event streaming Apache Kafka 1M+ events/sec
Blockchain node Geth / Solana validator depends on chain

How our exchange development process ensures reliability

Smart contracts and gas optimization

For EVM-based DEX (Ethereum, Arbitrum, Optimism, Polygon), the entire critical path lives in Solidity. Main contracts: Pool, Factory, Router, PositionManager (for v3-like), and Quoter for off-chain calculations. Typical mistakes we see in audits:

Reentrancy via callback. Uniswap v3 uses flash swap with a callback (uniswapV3SwapCallback). If your router lacks a nonReentrant guard and you don't check msg.sender == pool, the contract gets drained via a nested call. This is not hypothetical – several v3 forks lost funds this way.

Oracle manipulation in AMM. If your contract uses the spot price from the pool for collateral calculation, it is front-runnable. Correct: TWAP over 30+ minutes (Uniswap v3 OracleLib) or an external oracle (Chainlink).

Unbounded loops in liquidity range. If a swap crosses many ticks in a row (price impact 80%+), gas may exceed the block limit. Need MAX_TICKS_CROSSED with partial fill and returning the remainder.

For Solana DEX (Anchor framework, Rust), the architecture is fundamentally different: account-based model, Program Derived Addresses (PDA) instead of storage, Cross-Program Invocations instead of internal calls. Solana's throughput (~3,000–4,000 TPS vs 15–30 on Ethereum mainnet) allows building on-chain order books – exactly what Phoenix DEX does.

Liquidity bootstrapping and aggregator integration

Launching a pool is not enough – you need to ensure liquidity at launch. Practical mechanisms:

  • Liquidity Bootstrapping Pool (LBP) – initial price is high, asset weights dynamically shift, creating selling pressure and even token distribution. Implemented in Balancer v2.
  • Initial Liquidity Offering via Uniswap v3 – adding liquidity in a narrow range around the initial price, then gradually expanding as volume grows. Requires active liquidity management or integration with Arrakis/Gamma.
  • Integration with 1inch, Paraswap, Li.Fi – aggregators bring traffic but require standard compliance: the pool must have correct getAmountsOut, support ERC-20 approval/permit, and not have custom transfer hooks that break the aggregator's routing.

Development process and deliverables

Analytics and design begin with choosing the architectural model: CEX with custodial storage, non-custodial DEX, or hybrid (off-chain order book + on-chain settlement, like dYdX v3). This decision determines everything – regulatory load, tech stack, team.

Development proceeds in layers: first smart contracts with full Foundry coverage (fuzzing, invariant testing), then backend services, then integration layer, and finally frontend. Testing includes fork testing on mainnet via Foundry – we reproduce real liquidity conditions, not synthetic ones.

Audit is mandatory before mainnet deployment. For DEX contracts, minimally one firm with manual review (Trail of Bits, Spearbit, Code4rena contest). For CEX custody, audit of key storage processes. We guarantee all contracts undergo formal verification and fuzzing testing (Echidna, Foundry invariant).

Estimated timelines

Exchange type Timeframe
DEX (AMM, xy=k) 3 to 5 months
DEX with concentrated liquidity (v3-like) 6 to 10 months
CEX (matching engine + custody + trading UI) 8 to 14 months
Integration with existing protocol 4 to 8 weeks

Cost is calculated individually after a technical briefing: chain selection, throughput requirements, custodial model. Our certified engineers with 10+ years of experience will help you choose the optimal architecture and avoid common pitfalls. Contact our team for a detailed proposal.

Pitfalls to avoid at launch

  • Forgetting the price oracle in AMM. Spot price can be manipulated with a flash loan in one transaction. If your lending protocol uses the spot price from its own pool, that's a bug.
  • Hot wallet without limits. A CEX without daily limits on automatic withdrawals is an invitation for attackers. Compromising one key should lose at most 10% of total funds.
  • Absence of circuit breaker. A 40% price drop in 5 minutes should halt automatic liquidations or withdrawals until manual review. Without this, a cascading liquidation spiral destroys all TVL.
  • Incorrect decimal handling. USDC uses 6 decimals, WBTC – 8, most tokens – 18. Mixing without normalization leads to either precision loss or overflow. Solidity has no float; we work with fixed-point using FullMath (mulDiv with overflow protection).

Want to avoid these problems? Get a consultation — we will select the architecture for your project and provide exact timelines. Order exchange development with quality guarantee and ongoing support.