I created a new architecture that is very lightweight without recurrence called a "field machine". [P]

Source code: Core algorithm: F=cumsum(P(D)⊙E) Expanded form: D→P(D)→P(D)⊙E→cumsum→F→Decoder→Y D → structured token geometry P(D) → lift into field space ⊙ E → bind identity to position cumsum(. ) → accumulate history F → sequence field Field Machine (FM): a fully parallel sequence architecture with O(1) inference. No attention, no recurrence, no custom CUDA. Read the readme for a full writeup. MIT Licence. Core idea: represent each token as structured "DNA", project into a high-dimensional field, modulate by analytic position encoding, and accumulate with a single cumulative sum.