mirror of
https://github.com/hanzoai/papers.git
synced 2026-10-22 17:20:17 +00:00
papers: fix LaTeX/ref/typo errors from swarm review (6 papers)
Auto-fixes from the paper accuracy swarm: unambiguous build-breakers, broken \ref/\cite/\input targets, and prose typos. Substantive accuracy findings (dates, contradictory numbers, LP numbering) reported separately for review.
This commit is contained in:
@@ -129,7 +129,7 @@ Persian-diaspora precompiles. Hanzo is the focused triumvirate where
|
||||
every chain is the financial rail; everything non-financial is
|
||||
serviced by Lux primary natively.
|
||||
|
||||
Hanzo 4.0 also serves as the **Rust canonical node** of the family:
|
||||
Hanzo 4.0 also serves as the \textbf{Rust canonical node} of the family:
|
||||
\texttt{\textasciitilde/work/hanzo/cli} (Rust) and the
|
||||
\texttt{hanzo-libs} workspace under \texttt{\textasciitilde/work/hanzo/node}
|
||||
are the reference Rust implementations the other networks integrate
|
||||
|
||||
@@ -37,7 +37,7 @@ capabilities from scratch, ArcaLabs integrates Hanzo's existing platform
|
||||
services to provide identity management, secret management, API routing,
|
||||
and data persistence. We detail the full architecture: investor
|
||||
onboarding via Simplici KYC integrated through Hanzo IAM, trade execution
|
||||
through the the regulated ATS with Hanzo Gateway routing, MPC custody with
|
||||
through the regulated ATS with Hanzo Gateway routing, MPC custody with
|
||||
keys managed by Hanzo KMS, and reporting pipelines built on Hanzo Base.
|
||||
This integration demonstrates the composability of the Hanzo platform for
|
||||
regulated financial applications.
|
||||
|
||||
+1
-1
@@ -24,7 +24,7 @@ ATS (Alternative Trading System), a SEC-registered trading venue.
|
||||
\subsection{Gateway Configuration}
|
||||
|
||||
Hanzo Gateway handles the routing between ArcaLabs services and the
|
||||
the regulated ATS:
|
||||
regulated ATS:
|
||||
|
||||
\begin{itemize}[leftmargin=1.4em]
|
||||
\item \textbf{Rate limiting}: Per-investor and per-org request limits
|
||||
|
||||
@@ -196,6 +196,7 @@ RBAC check & 0.05 & 0.1 \\
|
||||
\end{table}
|
||||
|
||||
\section{Security}
|
||||
\label{sec:security}
|
||||
|
||||
\paragraph{Credential Storage.} All passwords are hashed with Argon2id (time=3, memory=64MB, parallelism=4). Per-tenant salts are derived from a master key stored in Hanzo KMS, preventing rainbow table attacks even if the database is compromised.
|
||||
|
||||
|
||||
@@ -93,12 +93,12 @@ For a base model with conditional \(p_\theta(y\mid x)\) and a set of experiences
|
||||
Here \(\phi_k\) are distilled from group-relative semantic advantage; weights \(\alpha_k\) are learned by introspective calibration without gradient updates to \(\theta\).
|
||||
|
||||
\subsection{Distributed Aggregation}
|
||||
Hanzo Network aggregates \emph{priors, not gradients}. Let node priors be \(\{E_i\}\). We publish hashes and quality scores; the chain computes a byzantine-robust aggregate \(\tilde E = \operatorname{median}\_q\{E_i\}\) under a fixed schema (token bins / embedding centroids). Conflicting contributions resolve by stake-weighted quorum plus quality caps.
|
||||
Hanzo Network aggregates \emph{priors, not gradients}. Let node priors be \(\{E_i\}\). We publish hashes and quality scores; the chain computes a byzantine-robust aggregate \(\tilde E = \operatorname{median}_q\{E_i\}\) under a fixed schema (token bins / embedding centroids). Conflicting contributions resolve by stake-weighted quorum plus quality caps.
|
||||
|
||||
\section{1-Bit Semantic Compression}\label{sec:bitdelta}
|
||||
Inspired by BitDelta, we store only the \emph{signs} of per-bucket deltas plus per-matrix scales. For an experience matrix \(\Delta \in \mathbb R^{n\times m}\),
|
||||
\begin{equation}
|
||||
\widehat{\Delta} = \alpha\,\operatorname{Sign}(\Delta),\quad \alpha = \tfrac{1}{nm}\sum\limits\_{ij} |\Delta\_{ij}|.
|
||||
\widehat{\Delta} = \alpha\,\operatorname{Sign}(\Delta),\quad \alpha = \tfrac{1}{nm}\sum\limits_{ij} |\Delta_{ij}|.
|
||||
\end{equation}
|
||||
Scales are distilled by matching logits to a teacher rollout. We observe \(\approx 29.5\times\) storage savings with negligible loss in downstream utility, enabling multi-tenant caching and rapid hot-swaps of personalizations.
|
||||
|
||||
@@ -170,7 +170,7 @@ interface IHMM {
|
||||
\begin{algorithmic}[1]
|
||||
\State \textbf{input:} query set \(\mathcal D\), group size \(G\), base model \(p_\theta\), current prior bank \(E\)
|
||||
\For{\(x\in\mathcal D\)}
|
||||
\State Generate group rollouts \(\{y^{(g)}\}\_{g=1}^G\) with PoE decoding using current \(E\)
|
||||
\State Generate group rollouts \(\{y^{(g)}\}_{g=1}^G\) with PoE decoding using current \(E\)
|
||||
\State Score with reward model / tools to get \(\{r^{(g)}\}\)
|
||||
\State Extract semantic advantage text \(A\) via LLM introspection over the group
|
||||
\State Distill \(A\) into token/embedding buckets to produce \(\Delta E\)
|
||||
|
||||
@@ -86,7 +86,7 @@ The fused pipeline achieves 92.9\% F1, significantly outperforming any individua
|
||||
\centering
|
||||
\caption{Per-step latency breakdown (ms)}
|
||||
\label{tab:latency}
|
||||
\begin{tabular}{@{}lrrrr@{}}
|
||||
\begin{tabular}{@{}lrrr@{}}
|
||||
\toprule
|
||||
\textbf{Component} & \textbf{p50} & \textbf{p95} & \textbf{p99} \\
|
||||
\midrule
|
||||
|
||||
Reference in New Issue
Block a user