this isn’t a theorem of network science, and is an easily avoided failure mode. plumtree? kad? aodv? you’re wrong :(

It's observed in practice.

Protocols that run over the internet don't count. I meant actual mesh routing.

aodv works great and is “actual mesh.” the ‘overlays’ scale in practice and are topology agnostic, the hierarchical bgp mesh underneath isn’t altering the message or memory complexity, we can talk about them as algorithms. there are 10ks node meshes in the real world that use batman, geography-contrained hub and spoke, etc. guifi has 37k nodes in its heterogenous mesh with a batman fork, freifunk (originator of batman) around 40k.

edit to add: what is observed in practice is that gossip protocols can’t coordinate peers without centralizing. this is natural, and an artifact of the logarithmics in the routing protocols. the appropriate thing to do is model routing as a revocable proof system, and information theory explains the centralizing dynamics (problem I worked on 2018-2019) https://eprint.iacr.org/2022/1478 proves the global lower bound is linear (in route updates, when applied to routing, naively quadratic if distributed), and the trick routing protocols add to the game is locality, which yields the logarithmic advantage that when multiplied across the entire network is substantially subquadratic.

this feels a bit like a bombshell given the other recent works on emergent misalignment. how long have we been lying to models?

This is a deeply unsettling thought. I hope everyone can see this work. We truly have no idea how much resources have been wasted here.

What tasks are in your sights for evaluating the approach? is there anything you are most excited/curious to see the approach demonstrate?

The first evaluation is actually on language, via what I call the Universal Language Manifold (ULM).

You can explore the ULM on r/LanguageManifold

Contrariwise, I was part of the troupe of people that daily picked up these bags along walking trails. One of the few benefits of living in the USA: covert prosocial behavior is extremely common.

smell isn’t integrated in the thalamus with other sensory streams, it does something else entirely

A decade ago I ran several “seven hour roguelikes”, https://web.archive.org/web/20160321153532/http://people.cla... is the documentation from the first one.

The first year I spent six hours writing one of the first ecs crates in Rust and then an hour turning it into a game. lots of fun! you can search “7HRL” on github to find the historical participants not too ashamed to publicize their code at the end. A few dozen people enjoyed this.

List.TFAE is a helper definition and it’s invoked on a funny looking term when translated directly into english. I don’t know what I think, yeah it’s kinda junky but not in the way that 57 \mem 100 in a set encoding of the naturals.

    theorem TFAE_7_binary : List.TFAE (7).bits := by
  unfold Nat.bits Nat.binaryRec Nat.binaryRec; simp!

the binary expansion of 7 has three elements (you will find them at indexes Fin 0, Fin 1, and Fin 2) and the proof is of their equality.

The proof is actually of their equivalence as propositions. This is only possible because the binary digits are represented as Bools, and a Bool b can be coerced to the proposition that b = true.

the last paragraphs cite why junk theorems are objectionable but then fully misinterprets it to draw the opposite conclusion. the intersection is the S-feature and problematic. 1 + 2 = 4 is a “theorem beyond T” expressed in T theory.

don’t be mislead about what a junk theorem is!

Thank you. I was following along until that paragraph and got the opposite interpretation too.

Yah, I read that and thought "this seems like gibberish: maybe I am reading LLM slop".

rtld does a lot of work even in “static” binaries to rewrite relocations even in “unused parts” of any PIE (which should be all of them today) and most binaries need full dyld anyway.