@Ronny_MiniMaxi
iAccount based inUnited States!
About this account
- Account based in
- United States
- Connected via
- United States App Store
! X says this location may be affected by a proxy or VPN.
Account-level information from X, not a live location or the device used for a specific post.
Head of R&D at MiniMax Code. Co-creator of DeerFlow. Building the next generation of AI agent systems.
北京
Joined March 2025
- Tweets420
- Following215
- Followers5.6K
- Likes475
Pinned Tweet
hello, world! i'm daniel! currently i'm the head of r&d of MiniMax code @MiniMax_AI, which is a frontier ai lab in china.
i enjoy working on our ai-native product @MiniMaxAgent . i'm really obsessed with this question: what does an ai-native organization look like? how can our organization co-evolve together with llms?
besides that, i'm passionate about open source. i'm the co-author of the deerflow project, which is a representative work in harness engineering and has 78k 🌟 on github.
if you're passionate about open source, foundation models, or agents- or if you enjoy playing basketball or riding a road bike - let's chat and be friends! :)
By opening MiniMax Code, we hope more developers can examine the tradeoffs and use, test, and improve them in their own environments.
MiniMax Code is going open source in the next few days.
Built with developers. Now, built in the open.
See you on GitHub.
We said, “See you on GitHub.”
Well, here we are.
MiniMax Code CLI is now open source. 🎉
76.7% on FrontierHarness — fast, efficient, and now open.
Built with developers. Now, built with you.
github.com/MiniMax-AI/minima…
RonnyHe retweeted
After co-inventing ChatGPT, I kept asking myself: why have superhuman chat models not led to AGI?
I’ve spent the last 2 years in stealth building a new way to train models (RLCD), and a new type of frontier AI model that we are releasing today: Jev
• 20-200x faster
• 40-400x cheaper (w/ output tokens free)
• Frontier composable intelligence optimized for decisions
AFAICT the shortest path to AI-based economic revolution
RonnyHe retweeted
Jev is a new model from the co-inventor of ChatGPT that can use computer tools in realtime
right now it's playing Minecraft on its own computer in the cloud on Orgo
this is what it looks like with just one Jev, but imagine:
what about a thousand?
or what about a billion of Jevs?
each working together on their own computers in the cloud, discovering new science, running experiments, and designing new drugs 24/7.
this is going to be bigger than ChatGPT
A useful harness gives the model enough freedom to solve the task while making the consequences of its decisions observable and recoverable.
I believe experimental throughput and evaluation methodology are becoming the most important parts of a harness. They are also a critical step toward moving from handcrafted harnesses to auto harnesses.
Good CI/CD and a solid sandbox are the real infrastructure behind vibe coding.
The vibes are only as good as the infra.
A reusable /goal prompt for performance audits.
Trace real workflows, reproduce bottlenecks, measure scaling, and rank fixes by ROI—with evidence and repro scripts.
Full prompt in the first reply 👇
/goal Audit this project for actionable performance, resource-management, and concurrency problems. Identify unnecessary work, poor scaling, resource retention, and lifecycle errors that affect meaningful user or system workflows. Validate findings with reproducible evidence and rank them by expected repair ROI.
Do not assume a particular language, framework, architecture, or application type. Adapt the investigation to the repository.
## 1. Discover the system
Read the repository's instructions and identify:
- Its purpose, architecture, execution environments, and supported platforms.
- Critical user journeys or system operations.
- Entry points, data flows, persistence boundaries, background jobs, and external dependencies.
- Existing tests, benchmarks, profiling tools, and observability.
- Representative workload sizes and any documented performance requirements.
Record the reviewed revision, working tree state, and environment.
Select a bounded set of important workflows based on impact and likely risk. Explain the selection. Review the current implementation, not only recent changes.
## 2. Investigate how work and resources scale
Trace selected workflows end to end. Look for patterns such as:
- Small or bounded requests triggering full scans, large materialization, or complete recomputation.
- Repeated queries, network calls, serialization, parsing, rendering, or filesystem operations.
- N+1 access patterns, quadratic algorithms, repeated collection copies, and redundant dependency resolution.
- Blocking work on latency-sensitive threads or event loops.
- Excessive startup work, eager initialization, and avoidable work on frequently executed paths.
- Missing backpressure, excessive concurrency, retry amplification, and unbounded queues.
- Caches whose memory grows without an effective total budget, invalidation policy, or eviction strategy.
- Leaked or unnecessarily retained subscriptions, listeners, timers, handles, connections, tasks, and subprocesses.
- Timeouts that do not cancel underlying work, abandoned requests that keep running, and asynchronous work that outlives its owner.
- Lock contention, overly broad serialization, races, stale writes, and inconsistent read-modify-write operations.
- Polling, watchers, refresh loops, or invalidation chains that amplify small changes into large amounts of work.
For each path, ask:
“What determines its cost: request size, total stored data, elapsed uptime, concurrency, or unrelated system activity?”
Treat suspicious patterns as hypotheses. A pattern alone is not a defect.
## 3. Validate promising hypotheses
For each candidate:
1. Identify a realistic trigger and the expected behavior or resource bound.
2. Inspect callers, guards, caching, cancellation, and cleanup before drawing conclusions.
3. Create the smallest reproducible experiment using the actual implementation.
4. Prefer realistic local dependencies and isolated fixtures over mocks.
5. Use controlled stubs only where necessary, and state exactly what they replace.
6. Vary input size, accumulated state, or concurrency to establish scaling.
7. Measure the relevant quantities: operation counts, rows, bytes, allocations, retained resources, CPU, elapsed time, latency distribution, or throughput.
8. Include controls and repeated samples where meaningful.
9. Separate instrumentation overhead, warm-up, caching, and environmental noise from application cost.
Do not equate high resource usage with waste without understanding its purpose. Do not present synthetic benchmark timing as observed production latency.
Run focused existing tests and appropriate profiling tools. Avoid broad test runs unless they answer a concrete question.
Investigate failures instead of repeatedly rerunning until green. Distinguish product defects, cascading failures, test isolation problems, and environment limitations.
## 4. Exercise the real interface
Where feasible, validate the affected workflow through the project's actual interface: application UI, CLI, API, worker, service, library consumer, or batch job.
Confirm which build and configuration are running.
Keep these evidence levels distinct:
- Static code analysis.
- Isolated implementation probes.
- Integration tests.
- Real interface or system workflows.
- Production observations, if available and authorized.
If access, credentials, tooling, or infrastructure blocks validation, continue independent work and document the exact limitation. Never substitute a fixture or mock and describe it as end-to-end validation.
## 5. Rank actionable findings
For each confirmed finding, provide:
- Severity and confidence.
- Exact source locations.
- Triggering conditions and affected workflows.
- Expected versus observed behavior.
- Reproduction steps and raw evidence.
- Scaling behavior and practical impact.
- A minimal repair direction.
- Regression acceptance criteria.
- Remaining uncertainty.
Rank repair ROI using:
- Impact on users or system reliability.
- Likely frequency and affected population.
- Strength of evidence.
- Expected implementation effort.
- Regression and operational risk.
Label unknown frequency and repair cost as estimates. Avoid false numerical precision.
Prefer removing unnecessary work over weakening guarantees. Do not automatically recommend more caching, batching, concurrency, lower limits, or broader architectural changes.
## 6. Boundaries and completion
Follow repository-specific instructions. Keep tracked product code unchanged unless fixes are explicitly requested. Temporary probes, isolated fixtures, profiles, and reports are allowed.
Do not modify real user data, disrupt unrelated processes, use production systems without authorization, or publish sensitive evidence.
Deliver:
- An executive summary and prioritized findings.
- A workflow coverage matrix.
- Reproduction artifacts and measurements.
- Rejected hypotheses.
- Unresolved risks and validation blockers.
Finish when the selected workflows have been investigated or have explicit blockers, every confirmed finding has a defensible evidence chain, and the report is ready for review.
Do not stop at a list of suspicious code patterns. Do not invent findings to meet a quota. Do not claim to have found every possible problem.
RonnyHe retweeted
MHA, MQA, GQA, and MLA are often presented as four attention variants, but the more useful distinction is what happens to the key/value state during decoding.
In standard Multi-Head Attention, every query head has its own key and value head. MQA keeps the query heads but makes all of them share a single K/V head. GQA sits between the two, grouping multiple query heads around fewer shared K/V heads. The number of query heads can stay the same while the amount of K/V state that has to be stored and supplied during decoding drops substantially.
MLA takes a different route. Instead of asking how many conventional K/V heads should be cached, it asks whether those full per-head K/V representations need to be cached at all. DeepSeek-V2 compresses the reusable K/V content into a lower-dimensional latent representation and stores a separate small positional component for decoupled RoPE. That is why MLA is not simply "GQA with fewer heads." It changes the cached representation itself.
These choices show up far beyond an architecture diagram. They change KV-cache capacity, K/V projection width, how much distinct cached data must be supplied during decode, and the trade-off between representational freedom and inference efficiency. They also explain why saying "GQA makes attention 4x cheaper" is too vague. The K/V cache may shrink by 4x in a 32-query-head / 8-KV-head setup, while the model still computes attention outputs for all 32 query heads.
I put together a technical handbook that works through this from first principles => one attention head, MHA, MQA, GQA, the KV-cache formula, decode bandwidth, GQA uptraining and benchmark results, MLA latent compression, projection absorption, decoupled RoPE, worked cache comparisons, FlashAttention and PagedAttention, implementation details, and the common mistakes around all of it.
The explanations are grounded in the original papers and current framework documentation.
Sharing Understanding MHA, MQA, GQA & MLA here:
Oh, come on.
Yesterday, the mission was AGI.
Today, we’re told to slow down.
Why do you always get to define the game—and change the rules?
An agent that works for thirty seconds can be built around a loop. An agent that works across interruptions, context changes, tool failures, and multiple clients needs a runtime with a stronger model of work.