Monte Carlo Portfolio Simulation Development
A crypto portfolio can lose 30% in a year — standard metrics like volatility, beta, Sharpe ratio don't provide probabilistic assessment. Monte Carlo simulation generates thousands of scenarios and shows the full outcome distribution. We, engineers with 8+ years of blockchain development experience and 30+ completed risk analytics projects, build such systems turnkey: from model selection (GBM, t-distribution, GARCH) to an interactive dashboard.
Investment in the system pays off: typical rebalancing savings amount to 20–40% annually. Average portfolio return after implementation increases by 5–10% per year.
How Monte Carlo Simulation Helps Assess Crypto Portfolio Risk?
Instead of "portfolio will grow X%", we get: "with 70% probability the portfolio grows 20–80%, with 15% probability it loses 10–30%". This is achieved by modeling price paths based on statistical properties of market data. The foundation is Geometric Brownian Motion (GBM), but for crypto, modifications are needed due to fat tails and volatility clustering.
import numpy as np
def simulate_gbm(initial_price, mu, sigma, days, n_simulations=10000):
"""
mu: daily mean return
sigma: daily volatility
"""
dt = 1
random_returns = np.random.normal(
mu * dt,
sigma * np.sqrt(dt),
(n_simulations, days)
)
cumulative = np.cumprod(1 + random_returns, axis=1)
price_paths = initial_price * cumulative
return price_paths
Multi-Asset Simulation with Correlations
For a portfolio, correlations between assets are crucial:
from numpy.linalg import cholesky
def simulate_correlated_portfolio(initial_prices, means, cov_matrix,
days=365, n_sims=10000):
n_assets = len(initial_prices)
symbols = list(initial_prices.keys())
L = cholesky(cov_matrix)
portfolio_paths = []
for _ in range(n_sims):
z = np.random.standard_normal((days, n_assets))
correlated_returns = z @ L.T
daily_means = np.array([means[s] for s in symbols])
actual_returns = correlated_returns + daily_means
prices = np.zeros((days + 1, n_assets))
prices[0] = [initial_prices[s] for s in symbols]
for t in range(1, days + 1):
prices[t] = prices[t-1] * (1 + actual_returns[t-1])
weights = np.ones(n_assets) / n_assets
portfolio_value = (prices * weights).sum(axis=1)
portfolio_paths.append(portfolio_value)
return np.array(portfolio_paths)
Improved Return Models
GBM assumes normal distribution of returns. For crypto, this is wrong — there are fat tails and volatility clustering.
| Model |
Assumptions |
Applicability for Crypto |
Forecast Accuracy |
| GBM |
Normal distribution, const volatility |
Low due to fat tails |
Satisfactory only on short windows |
| Student's t |
Fat tails, const volatility |
Medium, better than GBM |
Higher than GBM but ignores volatility dynamics |
| GARCH(1,1) |
Conditionally normal, time-varying volatility |
High |
Best among classical models for crypto |
GARCH model
Student's t-distribution for fat tails:
from scipy.stats import t as t_dist
def simulate_fat_tail(mu, sigma, df, n_sims, days):
returns = t_dist.rvs(df=df, loc=mu, scale=sigma, size=(n_sims, days))
return np.cumprod(1 + returns, axis=1)
GARCH(1,1) conditional volatility:
from arch import arch_model
def fit_garch_and_simulate(returns_history, n_sims=10000, horizon=252):
model = arch_model(returns_history * 100, vol='GARCH', p=1, q=1)
result = model.fit(disp='off')
simulations = result.forecast(horizon=horizon, method='simulation',
simulations=n_sims)
return simulations.simulations.values
Why GARCH Model Is More Accurate Than GBM for Crypto?
GBM assumes constant volatility, but crypto markets experience volatility clustering. GARCH adapts dynamically, which is critical for estimating VaR 95% and drawdowns. We use GARCH(1,1) as the baseline, and for more extreme tails, combine GARCH with t-distribution.
VaR Calculation Example
```python
def analyze_simulation_results(portfolio_paths, initial_value,
confidence_levels=[0.05, 0.25, 0.50, 0.75, 0.95]):
final_values = portfolio_paths[:, -1]
percentiles = {f'p{int(c*100)}': np.percentile(final_values, c*100)
for c in confidence_levels}
prob_loss = (final_values < initial_value).mean()
returns = (final_values - initial_value) / initial_value
var_95 = np.percentile(final_values - initial_value, 5)
cvar_95 = (final_values - initial_value)[
final_values - initial_value <= var_95
].mean()
max_drawdowns = []
for path in portfolio_paths:
peaks = np.maximum.accumulate(path)
drawdowns = (peaks - path) / peaks
max_drawdowns.append(drawdowns.max())
return {
'percentiles': percentiles,
'prob_loss': prob_loss,
'expected_return': returns.mean(),
'return_std': returns.std(),
'var_95': var_95,
'cvar_95': cvar_95,
'avg_max_drawdown': np.mean(max_drawdowns),
'worst_max_drawdown': np.max(max_drawdowns)
}
```
Output metrics include percentiles, loss probability, expected return, VaR 95%, CVaR 95%, and maximum drawdown distribution. For example, with 10,000 simulations over 252 days, VaR 95% might be -15% of initial capital.
| Metric |
Description |
Example |
| VaR 95% |
Worst 5% scenarios |
-15.2% |
| CVaR 95% |
Average loss in worst 5% |
-22.1% |
| Prob loss |
Probability of loss |
34.5% |
| Avg max drawdown |
Average maximum drawdown |
-28.3% |
Visualization of Results
Fan chart shows the range of possible portfolio trajectories. The central line is the median (50th percentile). Darker zones indicate likely ranges (25–75%), lighter zones rare (5–95%). Return distribution histogram and drawdown distribution complement the analysis.
Applications in Portfolio Management
- Probability of achieving a goal: compute the likelihood that the portfolio grows 50% in a year under the current strategy.
- Strategy comparison: run simulation for two strategies and compare outcome distributions.
- Optimal rebalancing frequency: simulate portfolio with different rebalancing frequencies to pick the best.
- Capital allocation: decide how much to allocate to risky vs. conservative strategies to hit a target given acceptable risk.
Technology Stack
Python (numpy, scipy, arch for GARCH), Numba for simulation acceleration (JIT gives 10–50x speedup), pandas for data processing, matplotlib/plotly for fan chart visualization. 10,000 simulations over 252 days take < 1 second with Numba.
Work Process
- Collect historical data for 2–3 years (OHLCV) using CCXT or CoinGecko API.
- Calibrate model: estimate parameters for GBM, t-distribution, or GARCH(1,1) from daily returns.
- Simulate 10,000–50,000 trajectories with correlation matrix of assets.
- Compute risk metrics: VaR, CVaR, maximum drawdown, loss probability.
- Build an interactive dashboard using Plotly/Dash with fan chart and histograms.
- Integrate with your backend via REST API or WebSocket for daily updates.
What's Included
- Python code with comments and documentation
- Model selection and calibration (GBM, t-student, GARCH) tailored to your portfolio
- Historical backtesting
- Integration with your backend (REST API or WebSocket)
- Interactive dashboard on Plotly/Dash
- Team training and documentation
Contact us to discuss your case. Get a consultation on model selection and cost estimate within 1 day. Order turnkey system development — we guarantee accuracy and reliable deployment.
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.
