Drafts by Vishnu Seesahai
HFT QUARTET + POC: A MULTI-SCALE REGIME DETECTION SYSTEM FOR HIGH-FREQUENCY CRYPTOCURRENCY TRADING, 2026
The abstract describes HFT Quartet + POC as a high-frequency crypto trading framework that combin... more The abstract describes HFT Quartet + POC as a high-frequency crypto trading framework that combines four statistical regime-detection tools—lag-1 autocorrelation, variance ratio, Reynolds-number turbulence modeling, and Higuchi fractal dimension—with volume profile Point of Control confirmation. Its goal is to detect whether the market is trending, mean-reverting, turbulent, or structurally stable, then adjust position sizing dynamically.
It claims strong empirical performance on 30-second Bitcoin data, including 70–80% win rates, Sharpe ratios above 2.5, max drawdown under 8%, and roughly 30% fewer false signals compared with traditional methods. The abstract positions the system as computationally efficient, automated, and adaptable across timeframes.
PacketCrypt , 2021
Since proof of work was popularized by the Bitcoin project, there has been active research into w... more Since proof of work was popularized by the Bitcoin project, there has been active research into ways to make Proof of Work (PoW) useful. Unfortunately it has proven remarkably difficult to make PoW serve humans without allowing miners to influence the nature of the work problem to their own advantage, destroying the fairness of the algorithm. PacketCrypt takes a different approach, while the work done by PacketCrypt itself is not useful, PacketCrypt attempts to make the PoW very similar to useful work so that research and development into technologies for efficiently mining PacketCrypt will be reusable for other purposes. PacketCrypt encourages the development of technologies for high speed encryption of internet traffic, it also contains a component using randomly generated code in order to encourage CPU mining and research on highly parallel CPUs. Most importantly, PacketCrypt is parallelizable with n-ton communication, making it a bandwidth hard proof of work.
Analysis of Packet Crypt Bandwidth Hardness, 2019
Since proof of work was popularized by the Bitcoin project, there has been active research into w... more Since proof of work was popularized by the Bitcoin project, there has been active research into ways to make Proof of Work (PoW) useful. Unfortunately it has proven remarkably difficult to make PoW serve humans without allowing miners to influence the nature of the work problem to their own advantage, destroying the fairness of the algorithm.
PacketCrypt takes a different approach, while the work done by PacketCrypt itself is not useful, PacketCrypt attempts to make the PoW very similar to useful work so that research and development into technologies for efficiently mining PacketCrypt will be reusable for other purposes.
This paper provides a boundary function for the bandwidth hardness of a network whose PoW utilizes this category of function. This paper provides a maximal bound on any network utilizing the PacketCrypt algorithm.
PacketCrypt encourages the development of technologies for high speed encryption of internet traffic, it also contains a component using randomly generated code in order to encourage CPU mining and research on highly parallel CPUs. Most importantly, PacketCrypt is parallelizable with n-to-n communication, making it a bandwidth hard proof of work.
Papers by Vishnu Seesahai
Experimental violations of Bell's inequality are widely cited as definitive evidence that nature ... more Experimental violations of Bell's inequality are widely cited as definitive evidence that nature is not locally real. This paper argues that this inference is not logically compelled. Bell-type theorems — including the CHSH formulation tested in all major experiments — rest on three jointly necessary assumptions: locality, realism, and measurement independence. Measurement independence, formally stated as P(λ | a, b) = P(λ), requires that the hidden variable governing a particle pair is statistically independent of the measurement settings chosen by experimenters. This assumption has never been independently verified in a model-independent way, cannot be conclusively verified from within the experimental system, and is not a consequence of quantum mechanics. Experimental violations of Bell's inequality establish only that at least one of the three assumptions fails; they do not identify which one. The dominant interpretation assigns the failure to locality and realism, treating measurement independence as unproblematic. This paper challenges that asymmetry. We introduce the Measurement-Dependent Local Variable (MDLV) framework, a class of locally real models in which hidden variables are correlated with measurement settings, and show that such models are consistent with all known Bell test results. Positioning relative to Hall (2010) and Friedman et al. (2019), we show that full quantum CHSH correlations can be reproduced by a local deterministic model that relaxes measurement independence by a quantifiable and modest amount — specifically, by Hall's parameter M_H ≈ 0.207 under his relative-deviation convention (distinguished from the Friedman et al. M_F convention), as defined precisely in Section 7. We further argue that the freedom-of-choice loophole — the experimental expression of measurement independence — has never been closed and cannot be closed from within the system under study. We extend this epistemological argument with reference to Gödel's Incompleteness Theorems and Turing's Halting Problem as suggestive analogies, not as formal proofs of physical conclusions. The paper's central claim is precise: Bell inequality experiments rule out measurement-independent local hidden-variable theories; they do not rule out local realism as such. The violation tells us the joint hypothesis fails; it does not tell us which conjunct bears the weight. As a formal phenomenological contribution, this paper introduces the Profile-Sensitive MDLV (PS-MDLV) subclass and derives its closed-form CHSH drift prediction: |S|(γ,δ) = 2√2 − (√2−1)/2 · (4ε/3) · Σ_{xy}|p_{xy}(γ,δ)−1/4|, providing a computable, experimentally constrainable distinction from the quantum prediction of zero drift under setting-bias perturbation. For any fixed ε > 0, a null result constrains ε and falsifies PS-MDLV parameter regimes above experimental sensitivity.
LSS MPC ECDSA, 2025
This paper presents LSS MPC ECDSA, a robust and pragmatically engineered framework for T-of-N thr... more This paper presents LSS MPC ECDSA, a robust and pragmatically engineered framework for T-of-N threshold signatures. The system's principal innovation is not the introduction of novel cryptographic primitives, but rather the sophisticated integration of established techniques to solve critical operational challenges in distributed systems. Its core strength is the ability to perform live expansion and contraction of the signing group without downtime or reconstruction of the master private key. This is achieved through a coordinator-driven, verifiable resharing protocol rooted in joint verifiable secret sharing (JVSS). The architecture is further distinguished by its automated fault tolerance, where signing failures trigger node eviction and state rollback to a previously certified shard generation. It provides native support for multiple blockchains and signature formats, including Ethereum, Bitcoin, personal messages, and raw transaction signing. We detail the system's architecture, its underlying mathematical protocols for signing and dynamic membership, and provide proofs of their correctness. We conclude by exploring high-impact applications, including wallet abstraction, secure cross-chain bridging, and a novel paradigm for agentic voting systems, where the framework provides a secure and auditable foundation for economies driven by autonomous AI agents.
White Paper, 2020
Since proof of work was popularized by the Bitcoin project, there has been active research into w... more Since proof of work was popularized by the Bitcoin project, there has been active research into ways to make Proof of Work (PoW) useful. Unfortunately it has proven remarkably difficult to make PoW serve humans without allowing miners to influence the nature of the work problem to their own advantage, destroying the fairness of the algorithm. PacketCrypt takes a different approach, while the work done by PacketCrypt itself is not useful, PacketCrypt attempts to make the PoW very similar to useful work so that research and development into technologies for efficiently mining PacketCrypt will be reusable for other purposes. PacketCrypt encourages the development of technologies for high speed encryption of internet traffic, it also contains a component using randomly generated code in order to encourage CPU mining and research on highly parallel CPUs. Most importantly, PacketCrypt is parallelizable with n-ton communication, making it a bandwidth hard proof of work.
Uploads
Drafts by Vishnu Seesahai
It claims strong empirical performance on 30-second Bitcoin data, including 70–80% win rates, Sharpe ratios above 2.5, max drawdown under 8%, and roughly 30% fewer false signals compared with traditional methods. The abstract positions the system as computationally efficient, automated, and adaptable across timeframes.
PacketCrypt takes a different approach, while the work done by PacketCrypt itself is not useful, PacketCrypt attempts to make the PoW very similar to useful work so that research and development into technologies for efficiently mining PacketCrypt will be reusable for other purposes.
This paper provides a boundary function for the bandwidth hardness of a network whose PoW utilizes this category of function. This paper provides a maximal bound on any network utilizing the PacketCrypt algorithm.
PacketCrypt encourages the development of technologies for high speed encryption of internet traffic, it also contains a component using randomly generated code in order to encourage CPU mining and research on highly parallel CPUs. Most importantly, PacketCrypt is parallelizable with n-to-n communication, making it a bandwidth hard proof of work.
Papers by Vishnu Seesahai