Not

Hacker News!

Beta
Home
Jobs
Q&A
Startups
Trends
Users
Live
AI companion for Hacker News

Not

Hacker News!

Beta
Home
Jobs
Q&A
Startups
Trends
Users
Live
AI companion for Hacker News
  1. Home
  2. /Story
  3. /Show HN: I built an O(N) AI using an Agent Swarm. Asking for audit
  1. Home
  2. /Story
  3. /Show HN: I built an O(N) AI using an Agent Swarm. Asking for audit
Nov 24, 2025 at 1:34 PM EST

Show HN: I built an O(N) AI using an Agent Swarm. Asking for audit

makimilan22
1 points
1 comments

Mood

informative

Sentiment

neutral

Category

startup_launch

Key topics

Ai

Agent_swarm

Algorithm_optimization

Discussion Activity

Light discussion

First comment

1m

Peak period

1

Hour 1

Avg / period

1

Comment distribution1 data points
Loading chart...

Based on 1 loaded comments

Key moments

  1. 01Story posted

    Nov 24, 2025 at 1:34 PM EST

    8h ago

    Step 01
  2. 02First comment

    Nov 24, 2025 at 1:36 PM EST

    1m after posting

    Step 02
  3. 03Peak activity

    1 comments in Hour 1

    Hottest window of the conversation

    Step 03
  4. 04Latest activity

    Nov 24, 2025 at 1:36 PM EST

    8h ago

    Step 04

Generating AI Summary...

Analyzing up to 500 comments to identify key contributors and discussion patterns

Discussion (1 comments)
Showing 1 comments
makimilan22
8h ago
Hi.

This is an experimental "Testbed" release, and the backstory is a bit unusual.

I didn't write this code alone. I orchestrated a swarm of AI Agents (using reasoning models like GPT-5.1/Gemini 3) to architect and build it. My job was basically arguing with them to stop them from building "just another vector DB" and actually implement the physics-based O(N) routing logic I envisioned. The previous post was useless because it was a dummy project with fictitious data. I won't delete this one and will leave it for your feedback.

What we achieved (v4.0): We built an engine that replaces the O(N^2) Attention Matrix with Event-Driven Routing + State Space Models (SSM).

Why I'm sharing this: The model is currently UNTRAINED (random weights), so it won't write poetry yet. I am releasing the engine to verify the performance claims:

1. Efficiency: At 4096 tokens, it uses ~27,000x fewer FLOPS than a Transformer. 2. Speed: It runs in pure Python. It starts slower (overhead), but overtakes optimized Transformers at ~2k tokens. 3. Logic: v4.0 finally fixed the "Bag-of-Words" issue. It now understands sequence order.

I need the community to stress-test the physics. Clone the repo, run `python run_v3_demo.py`, and tell me if the math holds up.

Repo: https://github.com/makimilan/pulse-field-corev

Cheers!

View full discussion on Hacker News
ID: 46037373Type: storyLast synced: 11/24/2025, 6:36:11 PM

Want the full context?

Jump to the original sources

Read the primary article or dive into the live Hacker News thread when you're ready.

Read ArticleView on HN

Not

Hacker News!

AI-observed conversations & context

Daily AI-observed summaries, trends, and audience signals pulled from Hacker News so you can see the conversation before it hits your feed.

LiveBeta

Explore

  • Home
  • Jobs radar
  • Tech pulse
  • Startups
  • Trends

Resources

  • Visit Hacker News
  • HN API
  • Modal cronjobs
  • Meta Llama

Briefings

Inbox recaps on the loudest debates & under-the-radar launches.

Connect

© 2025 Not Hacker News! — independent Hacker News companion.

Not affiliated with Hacker News or Y Combinator. We simply enrich the public API with analytics.