Trying to Understand PaperTrade's Tokenomics
How PaperTrade pays winners, rewards losses with PAPER, and gets people to participate.
Blog posts on product work and business systems, alongside technical notes on mathematics, AI, and research. Browse the two collections below.
Product decisions, business systems, and lessons from building things.
How PaperTrade pays winners, rewards losses with PAPER, and gets people to participate.
The settlement boundary, its trade-off, and the acceptance criteria I work through with engineers.
Why TRON resource management changes the payment flow and the user experience.
How I map sales, delivery, and finance handovers for an internal CRM at Quandatics.
The product decisions behind payment states, confirmation, and settlement in a Web3 gateway.
A small photo record from the Talentbank Boardroom Challenge 2025.
What repeated hackathons taught me about exhaustion, comparison, and taking a proper break.
Why polished posts can feel disconnected from the people behind them.
A Gradio chatbot experiment with visible intermediate output and the 1.5B distilled DeepSeek-R1 model.
A carbon-footprint and financial-literacy prototype built during PayHack 2024 with OpenFinance APIs.
What I learned from my first physical hackathon at PayHack 2024, where we used OpenFinance APIs to prototype a financial-literacy app.
Mathematical explanations, derivations, and worked examples in AI and research.
Follow the derivations in order. Each lesson builds on the notation and results from the previous one.
Deposit detection, consolidation, and verified-webhook settlement across EVM and TRON.
A first-principles look at why reversible particle collisions can produce an irreversible Boltzmann equation, how entropy enters mathematically, and what Yu Deng's Fields Medal work with Zaher Hani and Xiao Ma actually proved.
A first-principles walkthrough from a single stochastic trajectory to the Fokker-Planck equation for its probability density, derived from Ito's lemma, with a from-scratch Python solution and an Ornstein-Uhlenbeck example checked three ways.
A plain-language tutorial that follows the Intro to MLOps slides end to end: reproducibility, the software cycle, DevOps, the ML lifecycle, MLOps, and MLflow, with diagrams and a runnable hands-on.
An intuition-first but math-heavy walkthrough from decision tree splits to bagging in Random Forests and boosting in XGBoost.
A first-principles walkthrough from sampled sound waves to the DFT, then from the DFT to the Cooley-Tukey FFT, with a from-scratch Python implementation and complexity proof.
A first-principles walkthrough from odds and log-odds to logistic regression, then from logistic regression to softmax regression.
Performing hypothesis tests on regression coefficients using t-tests, p-values, and the connection to confidence intervals.
Constructing confidence intervals for beta_0, beta_1, and beta_i using the t-distribution and standard errors.
Deriving the standard errors of the regression coefficients using MSE, Sxx, and the variance-covariance matrix.
Defining the coefficient of determination from the sum of squares decomposition and proving that R-squared equals the square of the correlation coefficient.
Defining the Pearson correlation coefficient using Sxx, Syy, Sxy, Sx, and Sy notation, and exploring its properties.
Understanding polynomial regression as a special case of multiple linear regression, with design matrix construction and overfitting considerations.
Extending simple linear regression to multiple predictors using matrix notation and deriving the OLS estimator in matrix form.
An introduction to simple linear regression, the OLS method, and deriving the estimators using Sxx and Sxy notation.
A review of energy demand, solar integration, forecasting, and control considerations for Malaysian wastewater treatment plants.
The gradient descent update rule, worked examples, and the effect of the learning rate.
A practical reading of three safety questions for reinforcement learning in clinical settings: confounding, effective sample size, and prospective behaviour.
Deriving the incremental update rule for action-value estimation in k-armed bandits, and why constant step sizes suit nonstationary problems.
No writing matches this selection.