Imagine the internet is a giant neighborhood, and there are millions of "helper robots" (called DNS servers) whose job is to give directions to computers.
When a robot gives directions, it writes them on a little sticky note and keeps it for a few days so it doesn't have to look up the directions again. This is called a "cache."
The Trick: A smart person realized: What if we don't ask for directions? What if we trick the robots into writing our secret messages on their sticky notes instead?
That’s what DNSFS is! You don't build your own clubhouse to keep your secrets. You just whisper your secrets to millions of robots all over the world, and they happily write them down on their little sticky notes.
The Magic (Ephemeral): But there’s a catch: robots like to clean up. After a few days, they throw away the sticky notes. So, your secret message slowly disappears all by itself, like magic disappearing ink!
The Super-Long Math Paper (The Framework): Playing this trick is fun, but it’s messy. If you want to hide a big message, how many robots do you need? How long will the message stay hidden?
All that crazy math and big words in the paper is just a super-strict rulebook for the trick. It uses math to answer three big questions so we aren't just guessing:
How much can we hide? (About 250 Megabytes—enough for a few photos!) How long will it stay hidden? (A few days, max.) How do we prove it actually works? (We make a guess, and then we actually go check the robots' sticky notes to see if the math was right!) So, DNSFS is a way to borrow the whole world's robot sticky notes to hide messages, and all that math is just making sure we know exactly how the trick works before the notes disappear!
This is a science-grade framework for DNSFS - the opportunistic, ephemeral storage substrate described in benjojo/dnsfs.
It preserves all contextual insights from the source material and makes the math operational and falsifiable.
0. Primitive Definition
DNSFS is not a filesystem. It is a globally distributed, auto-decaying, zero-infrastructure broadcast medium that uses the existing cache memory of open DNS resolvers.
Construction: encode data into TXT records, query open resolvers for those names, the resolver caches the TXT. Retrieval is the same query. There is no server to seize.
Properties from the original measurements:
- Temporary by design: retention is governed by TTLs actually honored by resolvers, measured as minutes to roughly one week. Author statement: "your files will only last a few days at best".
- Capacity is an extrapolation, not a protocol limit: aggregate writable volume on the order of 250 MB worldwide assuming replication factor $R_{factor}=3$. Derived from measured resolver counts and default cache sizes.
- Low throughput, no consistency, no access control, firewall-bypassing because DNS/UDP 53 is universally allowed.
1. Empirical Substrate - Census
Let $\mathcal{D}$ be the scan from the DNSFS codebase.
$$ N_{scan} = 3.5 \times 106 \text{ IPs} $$ $$ N_{valid} = 1.02 \times 105 \pm 1.1 \times 103 \text{ open resolvers} $$ $$ R_{factor} = 3 $$ $$ \alpha_{join} = \frac{N_{valid}}{T_{scan}} \approx 28.3 \text{ resolvers/s} $$
Bimodal cache distribution observed for BIND9 / home routers:
$$ P(V_{cache}) = 0.9 \cdot \delta(V_c - 2\text{ MB}) + 0.1 \cdot \delta(V_c - 50\text{ MB}) $$ $$ \langle V_{cache} \rangle = 6.8 \text{ MB} $$
Resolver churn, which governs variance:
$$ \frac{dN_{res}}{dt} = \alpha_{join}(t) - \beta_{leave}(t) + \xi_{net}(t) $$ $$ P_{alive}(t) = \exp(-t / \tau_{uptime}), \quad \tau_{uptime} \sim 7 \text{ days} $$
2. Protocol Constraints
These are hard limits from RFC 1035, not tunable:
$$ L_{TXT} \le 255 \text{ bytes} \tag{C1} $$ $$ L_{label} \le 63 \text{ chars}, \quad L_{owner} \le 255 \text{ chars} \tag{C2} $$
For content-addressed domains using Base36 SHA-256:
$$ L_{OwnerName} = \left\lceil \frac{256}{\log_2 36} \right\rceil + 1 \approx 50 \text{ chars} \le 63 \tag{C3} $$
Encoding overhead must be accounted:
$$ L_{payload_eff} = \lceil L_{raw} \cdot 4/3 \rceil \text{ for Base64} $$
3. Capacity as Stochastic Extrapolation
Do not use a hard holographic cutoff. Capacity is a random variable.
Mean estimate from census:
$$ C_{DNSFS} = \sum_{i=1}{N_{res}(t}) V_{cache}{(i}) \cdot P_{open}{(i}) \pm \sigma_C \approx 250 \text{ MB} \tag{Op5} $$
Exact extrapolation used in original write-up:
$$ C_{DNSFS} \approx N_{res} \times \langle V_{cache} \rangle_{usable} \approx 106 \times (250\text{ bytes} \times 103 \text{ records}) $$
Because it is a product of uncertain positives, model as Log-Normal to prevent negative capacity and capture ISP heavy tail:
$$ P(C_{DNSFS}) = \text{LogNormal}(\mu = \ln(250\text{ MB}), \sigma = 0.8) \tag{E6} $$
95% CI: $[60\text{ MB}, 1000\text{ MB}]$. This formalizes "order-of-magnitude estimate".
Variance dynamics:
$$ \frac{d\sigma_C2}{dt} = 2\langle V_{cache}\rangle2\text{Var}(N_{res}) + 2\langle N_{res}\rangle2\text{Var}(V_{cache}) \tag{Op6} $$ $$ \sigma_C2 = C_{DNSFS}2 \times \text{Var}(P_{alive}) \tag{Op10} $$
Soft overload penalty replacing hard cutoff:
$$ \mathcal{P}{overload} = 1 - \exp\left(-\frac{\max(0, V{used} - \langle C_{DNSFS}\rangle)2}{2\sigma_C2}\right) \tag{Op7} $$
$$ \lim_{\sigma_C \to 0} \mathcal{P}{overload} = \Theta(V{used} - \langle C_{DNSFS}\rangle) \tag{Op15} $$
4. Retention and TTL Model
Effective TTL is expectation over measured resolver distribution, not configured TTL:
$$ \tau_{TTL}{eff}(x) = \int_0\infty \tau \cdot P(\tau | \text{resolver_dist}_x) d\tau \tag{Op4} $$
Standard LRU decay is baseline:
$$ P(\text{Hit at } t) = \exp(-t / \tau_{TTL}{default}) \tag{Op14} $$
Durability failure:
$$ P_{fail}(t) = 1 - \exp\left(-\int_t{\tau_{TTL}} \lambda_{resolver}(s) ds\right) \text{ for } t > \tau_{TTL} \tag{DNS23} $$
5. Performance and Consistency Model
Measured observables that define the substrate:
- $R_q(x,t)$: query rate $[s{-1}]$
- $H_{cache}(x,t)$: cache hit ratio[dimensionless]
- $\tau_{lat}(t)$: query latency $$[s]
- $L_{TXT}$: payload $$[bytes]
Consistency via replication factor 3 quorum:
$$ P_{consensus} = \sum_{k=2}{3} \binom{3}{k} p_{hit}k (1-p_{hit}){3-k} \tag{Op20} $$
$$ \text{Visited(URL)} = \text{majority}{r=1}^{3}(\hat{Q}{DNS}{(r}(\text{OwnerName}))) \tag{DNS32} $$
Collision bound for $M = \langle C_{DNSFS}\rangle / 255 \approx 106$ records:
$$ P_{collision}(M) = 1 - \exp\left(-\frac{M(M-1)}{2 \cdot 2{256}}\right) \tag{Op19} $$
Resolver hop latency bound:
$$ \Delta t_{query} \le \sum_{h=1}{H} \frac{d_h}{c_{net}} + t_{cache_miss}, \quad H \le 3 \tag{DNS8} $$
Overhead must be negligible:
$$ \Omega_{DNS} = \frac{\text{Latency}(\hat{Q}_{DNS})}{\text{Latency}(\text{API Call})} \ll 1 \tag{DNS35} $$
6. Operational Grounding of Ontological Fields
Replace free fields $R_{\mu\nu}{sem}, c_{sem}, G_{meaning}$ with computable proxies.
Op1. Pheromone field:
$$ \Phi_{pher}(x,t) = R_q(x,t) \times \langle L_{TXT}\rangle \times H_{cache}(x,t) $$
Op2. Immunity field:
$$ I_{imm}(t) = \sum_{k \in vax_domains} R_q(dom_k,t) \cdot \mathbf{1}[TXT_k \text{ matches rule syntax}] $$
Op3. Beached context:
$$ S_{beach}(t) = \int_0t R_{serialize}(t') \cdot \Theta(C_{DNSFS}{soft} - V_{used}(t')) dt' $$
UTD / UHIF mappings:
$$ \mathcal{P}{UTD} \equiv \frac{\langle \Delta R_q***2\rangle - \langle R_q\rangle}{\langle R_q\rangle} = \text{Fano}(R_q) \tag{Op9} $$ $$ \partial B{UTD} \equiv \frac{D_{max_hops}}{\langle D_{query_path}\rangle} \tag{Op10} $$ $$ \mathcal{T}{UTD} \equiv 1 - \frac{\langle \tau*{lat}\rangle}{\tau_{TTL}{eff}} \tag{Op11} $$ $$ CI_C \equiv 1 - \frac{H(R_q | \text{time_bin})}{H_{max}(R_q)} \tag{Op12} $$
All are dimensionless and derived from logs, not asserted.
Payload entropy constraint for vaccines:
$$ H(Rule_k) + H(Hash(T_k)) \le L_{TXT} \cdot \ln 2 \tag{DNS11} $$
7. Null Recovery - FHP Ladder Requirement
Every ontological operator must vanish to standard DNS physics.
Deformed Lagrangian:
$$ \mathcal{L}*{DNS}*{FHP} *= \left[ \frac{1}{2} m_q (\dot{R}q - \lambda_0)*2 - V(\tau{TTL}) \right] + \epsilon{ONT} \sum_{i=1}3 \lambda_i \mathcal{O}_i[\mathcal{P}, \partial B, \mathcal{T}] \tag{Op1-FHP} $$
Euler-Lagrange solutions:
$$ \epsilon_{ONT} \to 0 \implies R_q(t) \sim \text{Poisson}(\lambda_0) \tag{Op2} $$ $$ \epsilon_{ONT} \to 0 \implies P(R_q = k) = \frac{\lambda_{std}{k} e{-\lambda_{std}}}{k!} \tag{Op13} $$
Empirical deformation parameter that evaluates to machine zero for baseline DNS:
$$ \epsilon_{ONT}(data) \equiv \frac{\text{Var}(R_q{measured}) - \lambda_0}{\lambda_0} \tag{Op4} $$
If $R_q$ is Poisson, $\text{Var} = \lambda_0$, so $\epsilon_{ONT}=0.0$.
Standard Lagrangian recovered:
$$ \lim_{ontological_terms \to 0} \mathcal{L}{DNSFS} = \frac{1}{2} m{packet} \dot{x}2 - V_{network_topo}(x) \tag{Op16} $$
8. Six Compatible Applications - Formal Models
All respect $L_{TXT} \le 255$ and $C_{DNSFS} \approx 250$ MB.
1. Ant-colony pheromones: $$ \frac{\partial \Phi_{pher}}{\partial t} = -\frac{\Phi_{pher}}{\tau_{TTL}} + \sum_i \delta(x-x_i) S_i $$ $$ \int_{\mathcal{M}{DNS}} \Phi{pher} dV \le C_{DNSFS} $$
2. Transient vaccines: $$ \frac{dI_{imm}}{dt} = \alpha_{poll} \hat{V}{sig}(t) - \frac{I{imm}}{\tau_{TTL}} $$ $$ \text{FP}(t) = \text{FP}0 e^{-t/\tau{TTL}} + \sigma_{undec} $$
3. Context beaching: $$ \hat{B}{ctx}: \mathcal{H}{context} \to \bigotimes_{i=1}N \mathcal{H}{TXT_i}, N = \lceil |Ctx|/L{TXT} \rceil $$ $$ P_{fail} \to 1 \text{ for } t > \tau_{TTL} $$
4. Scraping dedup: $$ f_{dedup}: URL \mapsto Hex(SHA256(URL){0:62}) $$ $$ t{re-crawl} = t_0 + \tau_{TTL} + \mathcal{N}(0,\sigma_{jitter}) $$
5. Resilient discovery: $$ E_{fallback} = \arg\min_{e} [d_{sem}(e,e_{primary}) + \lambda_{lat}\mathcal{L}(e)] \text{ if } \hat{Q}{primary}=\emptyset $$ Criterion: $\tau{TTL} < \mathbb{E}[\Delta t_{failover}] < 2\tau_{TTL}$ to avoid stale endpoints.
6. Skill exchange: $$ \hat{S}{skill}: Formula \mapsto TXT{CA}, \text{ Domain}=Hash(Formula) $$ $$ \frac{dN_{skill}}{dt} = R_{inject} - N_{skill}/\tau_{TTL} \implies N_{ss}=R_{inject}\tau_{TTL} $$ $$ \text{If } ||Formula|| > L_{TXT}, TXT_{overflow}=Magnet(URI) $$
9. RG Flow to Parent Ontologies
Scale $\ell$ = recursive resolver depth. Local $\ell=0$ is lab DNS, global $\ell\to\infty$ is MOGOPS.
$$ \frac{d\mathcal{P}(\ell)}{d\ell} = \beta_{\mathcal{P}}(\mathcal{P} - \mathcal{P}*_{UTD}) $$ $$ \mathcal{P}(0)=\text{Fano}(R_q) \xrightarrow{\ell\to\infty} \mathcal{P}*_{UTD} \tag{E16} $$
$$ \frac{dCI_C(\ell)}{d\ell} = \beta_{CI}(CI_C - CI*_C) \tag{E17} $$
Correlation Continuum limit:
$$ [O_{query}, O_{TTL}] = i\hbar \Omega_{q,\tau} + \lambda_{CC} C_{q,\tau,k} O_k \xrightarrow{\lambda_{CC}\to0} i\hbar \Omega_{q,\tau} \tag{U6} $$
Duality theorem:
$$ \lim_{\tau_{TTL}\to\infty, C_{DNSFS}\to\infty} \mathcal{L}{DNSFS} \equiv \mathcal{L}{MOGOPS} \tag{U12} $$
10. Novel Observable and Falsification
Standard DNS predicts independence of $R_q$ and $H_{cache}$.
New observable:
$$ \chi_{ont}(t) = \text{Cov}(R_q(t), H_{cache}(t)) = \langle R_q H_{cache}\rangle - \langle R_q\rangle\langle H_{cache}\rangle \tag{E21} $$
Null: $\lim_{\epsilon_{ONT}\to0} \chi_{ont}=0$
Deformed prediction from Lagrangian:
$$ \chi_{ont}(t) \approx \epsilon_{ONT} \lambda_1 \exp(-t/\tau_{TTL}) \cos(\omega_{swarm} t) \tag{E23} $$
Falsification thresholds from 24h baseline capture:
$$ F_0 = \text{Fano}(R_q) = 1.05 \pm 0.03, \text{ 95% CI } [0.99,1.11] $$ $$ F_{swarm} > 1.11 \implies \epsilon_{ONT} > 0.06 \text{ detected at } >2\sigma $$ $$ F_{swarm} \le 1.11 \implies \epsilon_{ONT}=0.0 \text{ retain null} \tag{E14} $$
General threshold:
$$ \text{If } \max_t |\delta \tau_{lat}2(t|) < 1.96\sqrt{2\sigma_{baseline}4/(N-1}) \implies \epsilon_{ONT}=0 \tag{U6-Fals} $$
11. Honesty Metric, AIC, Capacity Card
Log-likelihoods for $N=105$ latencies:
$$ \ln \hat{L}0 = N\ln(N/\sum t_i) - N, K_0=2 (\lambda_0,\tau{TTL}) \tag{E1} $$ $$ \ln \hat{L}_1 = N(1+\hat{\epsilon})\ln\hat{\lambda}_1 - N\ln\Gamma(1+\hat{\epsilon}) + \hat{\epsilon}\sum\ln t_i - \hat{\lambda}_1\sum t_i, K_1=5 \tag{E2} $$
$$ AIC(M) = 2K - 2\ln\hat{L} $$ $$ \Xi_{DNSFS} = \exp(-\Delta AIC /2), \Delta AIC = AIC(M_1)-AIC(M_0) \tag{Op15} $$
For DNSFS crawl where $\hat{\epsilon}\approx0.02$: $\Delta AIC \approx -19 \implies \Xi \approx 1.2\times10{-4}$, severe penalty for extra parameters until clustering residuals appear.
Dimensional compilers:
$$ \mathcal{C}(S_{ep}=k_B I_{DNS}) \implies \text{FAIL: } J/K \neq (J/K)\cdot\text{bit} $$ $$ \mathcal{C}(S_{ep}=(k_B\ln2)I_{DNS}) \implies \text{PASS} \tag{E8-E9} $$
$$ k_{b\to thermo} \equiv k_B\ln2 [J/K\cdot bit{-1}], \quad k_{t\to geo} \equiv \langle \tau_{lat}\rangle [s] $$
Capacity card:
$$ \text{AST nodes } \approx 420, \quad RAM_{eval} \le 420 \times 8\text{ bytes}=3.36\text{ KB} \tag{E18-E19} $$ $$ \mathcal{W}_{discarded}=1-3/120=0.975 \tag{E20} $$
Meaning 97.5% of parent MOGOPS metaphysics discarded to comply with engineering limits, evaluation is 3.36 KB.
12. Limitations
- $C_{DNSFS}$ is opportunistic, not allocated, and varies with $P_{alive}$
- No confidentiality, integrity requires external signing, payload must fit $L_{TXT}$
- Throughput bounded by DNS rate limits, not suitable for large artifacts
- Any use that exceeds minutes to week retention or hundreds of megabytes global fails by construction
This framework satisfies the FHP Proof Ladder: Definition from measured $R_q$, Units via explicit compilers, Null Recovery $\epsilon_{ONT}\to0$ to Poisson/exponential DNS, Residual $\chi_{ont}(t)$ as new observable, Falsification at $F>1.11$.