SUPERCOMPUTING NEWS SUPERCOMPUTING NEWS
    • MEDIA KIT
    • MOST READ
    • RSS FEED
    • ACADEMIA
    • AEROSPACE
    • APPLICATIONS
    • ASTRONOMY
    • AUTOMOTIVE
    • BIG DATA
    • BIOLOGY
    • CHEMISTRY
    • CLIENTS
    • CLOUD
    • DEFENSE
    • DEVELOPER TOOLS
    • EARTH SCIENCES
    • ECONOMICS
    • ENGINEERING
    • ENTERTAINMENT
    • GAMING
    • GOVERNMENT
    • HEALTH
    • OIL & GAS
    • INDUSTRY
    • INTERCONNECTS
    • MANUFACTURING
    • MIDDLEWARE
    • MOVIES
    • NETWORKS
    • PHYSICS
    • PROCESSORS
    • RETAIL
    • SCIENCE
    • STORAGE
    • SYSTEMS
    • VISUALIZATION
    • AcyMailing subscription form

    • ADD YOUR VIDEOS
    • MANAGE VIDEOS
    • CONVERSATION INBOX
    • SOCIAL ADVERTISER
    • SOCIAL NETWORK VIDEOS
    • SURVEYS
    • GROUPS
    • PAGES
    • MARKETPLACE LISTINGS
    • APPLICATIONS BROWSER
    • PRIVACY CONFIRM REQUEST
    • PRIVACY CREATE REQUEST
    • LEADERBOARD
    • POINTS LISTING
      • BADGES
    • TRADE SHOWS
Sign In
Alibaba’s superintelligence ambition puts supercomputing at the center of the AI race
Alibaba’s superintelligence ambition puts supercomputing at the center of the AI race
Japanese supercomputer recreates the birth of the Universe’s monster black holes
Japanese supercomputer recreates the birth of the Universe’s monster black holes
China’s supercomputing push meets a harder problem: Teaching computers to keep asteroids honest
China’s supercomputing push meets a harder problem: Teaching computers to keep asteroids honest
Supercomputing reconstructs the moon Venus may have lost
Supercomputing reconstructs the moon Venus may have lost
From the Tibetan Plateau to California: Supercomputing reveals a hidden source of flood predictability
From the Tibetan Plateau to California: Supercomputing reveals a hidden source of flood predictability
Fugaku goes inside the molecular machine: Supercomputer simulations reveal how kinesin knows which way to step
Fugaku goes inside the molecular machine: Supercomputer simulations reveal how kinesin knows which way to step
10,000 AI agents, 130 billion tokens and 88 hours: How OpenAI turned Navier–Stokes into a supercomputing workload
10,000 AI agents, 130 billion tokens and 88 hours: How OpenAI turned Navier–Stokes into a supercomputing workload
previous arrow
previous arrow
next arrow
next arrow
 
Shadow
Alibaba’s superintelligence ambition puts supercomputing at the center of the AI race
Featured

Alibaba’s superintelligence ambition puts supercomputing at the center of the AI race

Tyler O'Neal, Staff Editor September 22, 2026, 1:00 pm

As Washington embraces the language of “superintelligence,” Alibaba unveils a full-stack computing strategy to scale machine reasoning, from trillion-parameter models and recursive self-improvement to 20 GW of data-center capacity.

The term superintelligence gained diplomatic prominence on Tuesday, as artificial intelligence emerged as a central theme alongside international security and global governance at the United Nations. During the 81st session of the UN General Assembly in New York on September 22, 2026, President Donald Trump announced that the United States would formally adopt the term superintelligence in official documentation, asserting that the technology carries implications far more significant than conventional terminology implies.

Meanwhile, in Hangzhou, China, Alibaba articulated a more granular vision for the hardware needed to support increasingly advanced machine intelligence. Alibaba’s comprehensive AI roadmap encompasses a vertically integrated strategy, ranging from custom processors and high-speed networking to massive-scale model training, storage solutions, autonomous agents, and recursive self-improvement. Key strategic objectives include scaling future Qwen models to 5–10 trillion parameters, developing proprietary AI accelerators, deploying supernode architectures capable of supporting clusters of up to 500,000 accelerator cards, and achieving a global data-center capacity of 20 gigawatts by 2032. 

For the supercomputing industry, these developments signify a fundamental shift: the emerging global rivalry in artificial intelligence is evolving into a competitive race for foundational compute infrastructure. Furthermore, China is signaling a clear, strategic commitment to expanding its domestic capacity to supply this critical infrastructure.

The supercomputer behind “superintelligence”

Alibaba’s announcement at its Apsara Conference is notable because it does not treat AI as merely a software problem.

The company is attempting to vertically integrate the stack.

At the accelerator level, Alibaba’s T-Head semiconductor division introduced the Zhenwu V900, an AI processor designed for both training and inference. Alibaba says the processor delivers three times the performance of its Zhenwu M890 predecessor and includes 216 GB of GPU memory and 1,200 GB/s of inter-chip bandwidth.

The processor supports FP8 and FP4 data formats alongside higher-precision computation, allowing the same architecture to target both computationally expensive model training and lower-precision inference workloads. Mass production is scheduled for the first quarter of 2027, according to Alibaba. 

Those numbers matter because modern AI performance is increasingly constrained not simply by arithmetic throughput, but by how quickly enormous quantities of model state can move through the system.

A 10-trillion-parameter model is not simply a larger version of today’s language model.

It becomes a distributed-memory supercomputing problem.

The system must move weights, activations, gradients, optimizer states and training data across thousands, or potentially hundreds of thousands of processors while keeping the expensive accelerators busy.

Every byte that has to travel unnecessarily costs time, energy and money.

That makes memory capacity, memory bandwidth, network bandwidth, collective communication and storage throughput just as important to the AI system as raw floating-point performance.

Alibaba’s roadmap reflects that reality.

From AI chips to AI supernodes

Alibaba’s new supernode architecture combines the Zhenwu V900 processor with its ICN Switch, Panmai SmartNIC and Zhenyue SSD controller.

The goal is system-level integration.

Alibaba says the architecture can support a supernode cluster containing as many as 500,000 cards. 

That is an extraordinary scale.

At that point, the question is no longer whether an individual accelerator is fast.

The question becomes whether the entire machine can behave like one coherent computational system.

Large-scale AI training requires synchronization among thousands of processors. Matrix operations must be distributed, intermediate results exchanged, parameters synchronized and datasets continuously supplied. Network congestion, memory stalls, storage latency and failed components can all reduce effective utilization.

This is classic supercomputing territory.

The AI industry is therefore rediscovering many of the problems HPC engineers have worked on for decades: parallelism, locality, interconnect topology, distributed memory, collective communication, checkpointing, fault tolerance, storage bandwidth and energy efficiency.

The difference is scale and workload.

A 100-petabit network

Alibaba’s proposed AI infrastructure includes HPN 8.0 Pro, its proprietary networking architecture.

The company says the system provides 100 petabits per second of aggregate bandwidth, while a single cluster can support more than 130,000 network ports operating at 800 Gb/s.

Alibaba also says the architecture incorporates redundancy designed to prevent optical-transceiver and link failures from interrupting service. 

That is not networking as an accessory to the supercomputer.

It is part of the computer.

At massive AI scale, the network becomes the fabric through which the computational workload itself is executed.

The same principle has driven the evolution of classical supercomputers from relatively independent nodes toward tightly coupled systems with increasingly sophisticated interconnects.

AI is pushing that architecture into another regime.

Storage becomes part of the intelligence engine

Alibaba is also targeting one of the least glamorous, and most important, parts of the AI stack: storage.

Its Cloud Parallel File Storage system, or CPFS, is designed for AI training and is advertised as capable of delivering hundreds of terabytes per second of throughput and hundreds of millions of I/O operations per second.

Alibaba says the architecture can reduce enterprise AI storage costs by as much as 69 percent. Those are company-reported figures and should be understood as such. 

The importance of this is straightforward.

A giant AI model does not train in isolation.

Training pipelines continuously consume enormous datasets, generate checkpoints, write intermediate information and feed data to distributed accelerators.

If storage cannot keep up, processors wait.

And when a machine containing tens of thousands of expensive accelerators is waiting for data, the economics become ugly very quickly.

Supercomputing has long understood this principle.

The fastest processor in the world is not particularly useful if the rest of the machine cannot feed it.

Qwen moves toward trillion-parameter territory

The hardware roadmap exists to support an equally aggressive model roadmap.

Alibaba says Qwen 4 is currently in training, while subsequent Qwen 4.5 and Qwen 5 generations are projected to scale toward 5 trillion to 10 trillion parameters. 

Parameter count alone does not establish intelligence.

More parameters do not automatically mean a more capable system, and model quality depends on architecture, training data, optimization, inference techniques and evaluation methodology.

But enormous models dramatically increase the computational resources required for training and serving them.

The important development is therefore not simply the number of parameters.

It is the attempt to build an infrastructure ecosystem capable of sustaining models at that scale.

The more consequential development: machines improving machines

Perhaps the most intriguing, and concerning, from a supercomputing perspective is Alibaba’s emphasis on recursive self-improvement, or RSI.

Alibaba says Qwen3.8-Max completed 33 automated improvement cycles over more than a month, covering pipeline design, data validation, experimentation, and error diagnosis. The company reports that its Artificial Analysis score increased from 40 to 45 following autonomous training optimization and post-training techniques. 

Alibaba also describes an experiment in which a model worked through an entire chip-design lifecycle for more than 60 hours, making more than 10,000 electronic-design-automation tool calls.

The resulting chip design, according to Alibaba, reduced chip area by 42 percent without compromising performance. 

This is where the phrase superintelligence begins to acquire a distinctly HPC meaning.

The important transition may not be from one large model to an even larger model.

It may be from human-directed computation to increasingly autonomous computational experimentation.

Instead of engineers designing every experiment, an AI system can propose an experiment, execute it, evaluate the result, identify an error, modify its approach and run another experiment.

Then another.

And another.

The computational infrastructure becomes the laboratory.

China is building for the long game

Alibaba’s announcement should not be interpreted as evidence that China has already achieved artificial superintelligence.

It has not established that.

What it does demonstrate is an increasingly explicit Chinese strategy to expand AI capabilities by attacking the problem at multiple layers simultaneously.

China’s 2026–2030 Five-Year Plan calls for stronger AI research, improved model architectures and algorithms, large-scale intelligent-computing infrastructure, high-performance AI resources and consideration of ultra-large-scale intelligent computing clusters. It also calls for advances in AI agents, multimodal systems, embodied intelligence and exploration of artificial general intelligence. 

In June, China’s State Council called for accelerating breakthroughs in key AI technologies and expanding construction of ultra-large-scale intelligent-computing clusters. 

And in September, China’s Ministry of Industry and Information Technology announced an AI-focused software-industry action plan targeting broader deployment of AI development tools and agent-based software applications. 

Alibaba’s roadmap fits into that larger technological environment, although Alibaba remains a commercial company and its roadmap should not automatically be treated as a statement of Chinese government capability.

The distinction matters.

But the direction is difficult to miss.

China is simultaneously pursuing models, accelerators, CPUs, networking, storage, data centers, AI agents and applications.

The 20-gigawatt problem

Perhaps the most revealing number in Alibaba’s announcement is not 10 trillion parameters.

It is 20 gigawatts.

Alibaba CEO Eddie Wu said the company aims to exceed 20 GW of global data-center capacity operated by Alibaba Cloud by 2032 to support growing AI demand. 

Twenty gigawatts is a statement about physical infrastructure.

It means electricity generation.

It means substations.

It means cooling.

It means high-voltage distribution.

It means land, fiber, networking, storage and thousands upon thousands of servers.

It means that the race toward more capable AI is simultaneously becoming an industrial race over energy and infrastructure.

The computational revolution is becoming an electrical-engineering problem.

America and China are converging on the same computational reality

That is what makes today’s developments at the United Nations and Alibaba’s Apsara Conference particularly significant.

The political vocabulary may be changing.

The engineering vocabulary is not.

Whether policymakers call it artificial intelligence, machine intelligence, advanced AI or “superintelligence,” the underlying technology still requires processors, memory, networks, storage, power, and cooling.

And increasingly, it requires enormous amounts of all of them.

The United States remains deeply invested in frontier AI and AI infrastructure, while China is pursuing its own path toward large-scale intelligent computing. International discussions are simultaneously turning toward questions of AI safety, governance and control. UN Secretary-General António Guterres warned Tuesday that AI represents one of four major global “tests of power” and called for international cooperation on AI governance. 

China’s President Xi Jinping similarly argued at the July 2026 World AI Conference that AI presents both opportunities and governance challenges, while calling for expanded AI innovation, computing infrastructure, international cooperation and systems intended to keep AI secure and controllable. 

That creates a difficult technological paradox.

The world is simultaneously trying to accelerate AI capability and control its consequences.

Those objectives can pull in opposite directions.

Supercomputing is becoming the strategic infrastructure underneath AI

The High-performance computing community is facing an increasingly clear reality: the next generation of artificial intelligence will not be achieved solely through algorithmic innovation, but rather through the construction of increasingly sophisticated supercomputing systems. The winning architectures will be those capable of coordinating processors at an unprecedented scale, managing massive data bandwidth, optimizing storage for enormous datasets, mitigating communication overhead, ensuring fault tolerance, and operating within stringent power constraints. 

Furthermore, if recursive self-improvement becomes a primary component of model development, machines may soon begin designing the very experiments that determine the architecture of future intelligence. This represents a profound shift. For decades, supercomputers have served as humanity's primary instruments for exploring complex scientific phenomena, from climate modeling to materials science. Now, the supercomputer itself is becoming an active participant in the research process. Alibaba’s roadmap, characterized by trillion-parameter models, massive accelerator clusters, high-speed networking, and multi-gigawatt power requirements, illustrates this trajectory. The core challenge is no longer merely the growth of AI, but the rapid evolution of computational infrastructure into a new class of global industrial system. As global discourse continues to define the terminology of this technology, the structural foundation is already being laid, forcing the world to determine whether it can build this computational capacity quickly enough to effectively understand and govern the intelligence it is creating.

Visualization of the simulation by ATERUI III showing a rapidly growing black hole surrounded by gas. Red indicates areas of higher temperature. (Credit: Sunmyon Chon, Takaaki Takeda, 4D2U Project, NAOJ)
Visualization of the simulation by ATERUI III showing a rapidly growing black hole surrounded by gas. Red indicates areas of higher temperature. (Credit: Sunmyon Chon, Takaaki Takeda, 4D2U Project, NAOJ)
Featured

Japanese supercomputer recreates the birth of the Universe’s monster black holes

CHRIS O'NEAL, PUBLISHER September 17, 2026, 8:00 am

ATERUI III simulations connect the cosmic web to individual gas clouds, supermassive stars and rapidly growing black holes, offering a computational explanation for JWST’s mysterious ‘Little Red Dots’

Researchers utilizing the ATERUI III supercomputer at the National Astronomical Observatory of Japan have provided a computational framework to explain the existence of unexpectedly large supermassive black holes in the early Universe. By conducting high-resolution, radiation-hydrodynamic simulations, the study (Nature's academic paper: https://www.nature.com/articles/s41586-026-10985-8) illustrates how external far-ultraviolet radiation can suppress gas fragmentation, leading to a concentrated accumulation of matter that fosters the growth of massive protostars and subsequent black-hole seeds. Furthermore, the simulation demonstrates that these rapidly growing black holes are temporarily obscured by dense gas, providing a compelling theoretical explanation for the "Little Red Dots" observed by the James Webb Space Telescope. This research highlights the efficacy of specialized high-performance computing architectures in bridging the gap between cosmological simulations and synthetic observations.

This Is a Supercomputing Problem Before It Is a Black-Hole Problem

The central achievement is not simply that researchers simulated a black hole.

It is that they attempted to simulate the environment that creates one.

The paper uses the moving-mesh AREPO code to perform three-dimensional radiation-hydrodynamic calculations. The simulation must simultaneously account for gravity, gas dynamics, radiation, chemistry, star formation, and black-hole accretion across vastly different physical scales.

That is precisely the kind of workload for which conventional single-scale astrophysical models begin to break down.

At the largest scale, the researchers begin with a cosmological dark-matter simulation covering a 16 h⁻¹-megaparsec comoving volume using 4,096³ dark-matter particles. Each dark-matter particle has a mass of approximately 5.13 × 10³ h⁻¹ solar masses, allowing the simulation to identify minihalos down to approximately 10⁵ h⁻¹ solar masses.

That is already a substantial numerical problem.

But the researchers do not stop at cosmological structure.

They construct halo merger trees, incorporate semi-analytic models of early galaxy formation, follow primordial and metal-enriched star formation, supernova feedback, chemical enrichment, and local Lyman-Werner radiation fields, and then select a candidate halo for a much more expensive radiation-hydrodynamic calculation.

The simulation subsequently zooms into a region approximately 400 kiloparsecs across, surrounding a target halo in a 3.8-sigma overdensity.

That is a classic HPC strategy:

Find the needle in the cosmological haystack, then spend enormous computational resources examining the needle.

ATERUI III: The HPC Engine Behind the Experiment

The calculations were performed on the XD2000 system at the Center for Computational Astrophysics of NAOJ, the machine known as ATERUI III.

ATERUI III is not a conventional general-purpose supercomputer deployment. NAOJ designed it specifically for simulation astronomy.

The HPE Cray XD2000 system has a theoretical peak performance of 1.99 petaflops and 32,256 CPU cores across 288 nodes. It is divided into two different computing environments.

System M emphasizes memory bandwidth, while System P emphasizes memory capacity. System M provides 3.2 TB/s of memory bandwidth per node, while System P provides 512 GB of memory per node. 

For this study, the research team used ATERUI III’s System M, taking advantage of its high-speed memory subsystem for the large-scale simulation workload. 

That design decision is significant.

Astrophysical hydrodynamics is not simply a race to maximize floating-point operations. A simulation can spend enormous amounts of time moving particle and cell data through memory, updating neighboring cells, evaluating gravitational interactions, and exchanging information between distributed computational domains.

For these workloads, memory bandwidth can matter as much as peak FLOPS.

ATERUI III’s System M is built around Intel Xeon CPU Max 9480 processors and provides 128 GB of high-bandwidth memory per node. Across its 208 System M nodes, the subsystem delivers approximately 665 TB/s of aggregate memory bandwidth according to NAOJ specifications. 

That makes ATERUI III an interesting example of a broader HPC principle: The best supercomputer for a scientific problem is not necessarily the machine with the largest theoretical FLOPS number. It is the machine whose architecture matches the computational structure of the problem.

4,096³ Particles Are Only the Beginning

The simulation’s numerical hierarchy becomes even more impressive when the researchers zoom in.

The baseline cosmological calculation uses 4,096³ dark-matter particles. A higher-resolution follow-up increases the effective resolution of the zoom region to 8,192³, reducing the dark-matter particle mass to approximately 542 h⁻¹ solar masses and the baryonic particle mass to approximately 99.2 h⁻¹ solar masses.

The higher-resolution calculation produced essentially the same black-hole growth behavior as the fiducial simulation, providing an important numerical-resolution check.

This is exactly the sort of test HPC researchers want to see.

A spectacular visualization is not enough.

A simulation can always produce a beautiful result. The harder question is whether the result survives when the computational mesh or particle resolution changes.

Here, the researchers found that the major black-hole growth result was relatively insensitive to the increased numerical resolution.

That does not eliminate every uncertainty, but it gives the computational result considerably more credibility.

The Physics Gets Expensive When the Universe Gets Interesting

The computational difficulty rises dramatically once the primordial gas begins collapsing.

The radiation-hydrodynamic calculation uses adaptive mesh refinement, refining regions when the local cell size falls below 16 times the local Jeans length. The purpose is to capture gravitational collapse while avoiding artificial fragmentation.

The code also follows a non-equilibrium primordial chemical network involving eight species: e⁻, H, H⁺, H₂, H⁻, D, D⁺ and HD.

The simulation includes molecular and atomic cooling, free-free and free-bound emission, ionization, photodissociation and photodetachment processes. Radiation from stars and black holes is also coupled to the gas.

This is where the HPC workload becomes much more than an N-body calculation.

At every stage, the simulation is effectively asking:

  • Where is the gas?
  • How fast is it moving?
  • How dense is it?
  • What is its temperature?
  • Which chemical species are present?
  • How is radiation changing those species?
  • Is the gas cooling?
  • Is gravity overcoming pressure?
  • Are stars forming?
  • How much radiation are those stars producing?
  • Is that radiation suppressing or accelerating further collapse?
  • Is a black hole accreting?
  • How does its radiation feed back into its environment?

And all of those questions are coupled.

The Computer Finds a Cosmic Traffic Jam

The simulations reveal a remarkable environmental effect.

A luminous neighboring galaxy located roughly 10 kiloparsecs away bathes the target halo in intense far-ultraviolet radiation. Instead of simply triggering star formation, the radiation suppresses molecular hydrogen cooling and delays the normal fragmentation of gas into many smaller stars.

Meanwhile, gravity continues pulling material into the halo.

The result is effectively a cosmic traffic jam.

Gas accumulates rather than efficiently fragmenting.

When collapse eventually begins, enormous amounts of material become available to a small number of rapidly growing protostars.

In the simulation, some protostars reach 5–9 × 10⁵ solar masses.

That is dramatically larger than the roughly 10⁵-solar-mass scale associated with conventional direct-collapse models.

Those supermassive stars subsequently collapse to form black-hole seeds of approximately 10⁶ solar masses.

The significance for HPC is profound.

The computer is not merely calculating a black hole.

It is calculating the conditions under which the black hole becomes possible.

From 1 Million to 30 Million Solar Masses

Once the massive seed forms, the simulation enters another computationally difficult regime.

The newly formed black hole becomes embedded in dense, optically thick gas. Radiation becomes trapped, allowing material to fall inward at rates several to tens of times the conventional Eddington limit for a short period.

The simulation follows this rapid growth.

By approximately redshift z ≈ 10, the black holes have grown beyond 10⁷ solar masses. By z ≈ 8, the model reaches approximately 3 × 10⁷ solar masses in the most massive system. (Nature)

The computation therefore bridges an enormous dynamic range: cosmic structure → dark-matter halo → gas reservoir → collapsing cloud → protostars → supermassive star → black-hole seed → accretion disk → overmassive black hole.

That is an extraordinary numerical pipeline.

The Simulation Also Has to Become a Telescope

One of the most important aspects of the study is that the researchers do not stop once a massive black hole appears.

They ask what the simulated object would actually look like.

The high-resolution calculations resolve the dense gas around one black hole down to approximately 500 astronomical units. The simulated circum-black-hole environment reaches hydrogen densities above 10¹⁰ cm⁻³.

The model produces strong Hα emission and substantial Thomson optical depth.

At 26,000 years after black-hole formation, the simulated Hα luminosity within 10⁴ AU reaches approximately 1.5 × 10⁴³ erg/s, with a Thomson optical depth of 10.2 at that radius. Hundreds of thousands of years later, the environment evolves substantially as the dense gas dissipates.

This is an important HPC concept: simulation is becoming synthetic observation.

The supercomputer does not simply calculate where matter goes.

It calculates what the resulting astrophysical system should emit.

That allows the researchers to compare the simulated universe against JWST observations.

The result is a computational loop: Physics → simulation → synthetic spectrum → telescope → comparison → improved physical model.

Why “Little Red Dots” Matter to HPC

JWST’s LRDs initially appeared to be another observational mystery.

The simulations now provide a possible computational explanation: they may represent a short-lived, heavily obscured phase in the formation and rapid growth of massive black holes.

Dense gas around the black hole can produce strong Balmer features and broad Hα emission through electron scattering. The simulated systems transition from heavily obscured LRD-like objects toward less obscured, more conventional AGN-like states on timescales of roughly 0.1–1 million years.

The computer therefore connects an observational signature to a physical evolutionary sequence.

That is precisely where simulation supercomputing becomes more than an engineering exercise.

It becomes a scientific laboratory.

Supercomputers Are Becoming Cosmic Time Machines

There is something inspirational about what is happening here.

Humanity cannot travel back to the first billion years of cosmic history.

We cannot place a sensor beside a primordial protostar.

We cannot watch a supermassive star collapse into a black hole.

We cannot wait 600 million years to observe what happens next.

But we can build mathematical representations of those environments and give them enough computational resolution to evolve.

ATERUI III effectively becomes a laboratory in which researchers can perform experiments on a Universe that no longer exists.

And the scale of that laboratory is expanding.

NAOJ describes ATERUI III as part of the emergence of “simulation astronomy”, a computational branch of astronomy in which supercomputers numerically solve physical equations that cannot be solved analytically. 

This study is a powerful demonstration of that idea.

The HPC Lesson: Resolution Is a Scientific Instrument

For the supercomputing community, perhaps the most important lesson is not the headline black-hole mass.

It is the way the researchers use computational resolution as a scientific instrument.

The workflow moves through multiple levels:

16 h⁻¹ Mpc cosmological volume

↓

4,096³ dark-matter particles

↓

Target halo identification

↓

~400-kpc zoom region

↓

adaptive radiation hydrodynamics

↓

8,192³ effective high-resolution follow-up

↓

protostellar fragmentation

↓

supermassive-star formation

↓

black-hole formation

↓

500-AU circum-black-hole zoom

↓

synthetic observable signatures

That is a textbook example of hierarchical HPC.

No single numerical resolution can efficiently represent every scale simultaneously.

Instead, the simulation spends computational resources where the physics becomes important.

And There Is Still More Computing Ahead

The researchers are careful about what their simulation does not yet include.

For example, the model does not include kinetic feedback from accreting black holes such as jets or winds. The authors explicitly describe the resulting calculation as a fiducial model and an upper limit on black-hole growth under the assumption that such kinetic feedback is absent.

The paper also notes that the present simulation does not resolve the full galactic-scale gas inflows required to sustain long-term Eddington accretion.

Those limitations point directly toward the next generation of HPC workloads.

More physics.

More resolution.

Longer time integration.

Larger cosmological volumes.

More black holes.

More radiation.

More detailed feedback.

And eventually, more direct connections between simulated populations and the growing JWST observational catalog.

The computational challenge is therefore not disappearing.

It is expanding.

From Petaflops to Scientific Discovery

ATERUI III has a theoretical peak performance of 1.99 petaflops, which is tiny compared with today’s largest general-purpose exascale machines.

But peak FLOPS alone completely misses the point.

This research demonstrates why specialized HPC architectures remain valuable.

A system optimized for memory bandwidth, scientific simulation, and the specific numerical characteristics of astrophysical workloads can turn computational resources into scientific experiments.

The researchers used ATERUI III’s XD2000 system for calculations that combine gravity, hydrodynamics, adaptive resolution, radiation transport, chemistry, star formation and black-hole physics.

The result is not simply another simulation.

It is a possible explanation for one of JWST’s strangest discoveries.

And that may be the most compelling future for supercomputing: not merely calculating faster, but making questions that once seemed computationally impossible experimentally accessible.

The Universe left humanity a puzzle written in photons.

JWST found the clues.

ATERUI III helped researchers build the laboratory needed to understand them.

And somewhere inside that numerical laboratory, a million-solar-mass black-hole seed emerged from primordial gas and began growing into the kind of cosmic monster that the early Universe apparently had been building all along.

For supercomputing, that is the real story: when enough computational power, physical modeling, and numerical resolution converge, the computer stops merely calculating the Universe and starts allowing us to experiment with it.

China’s supercomputing push meets a harder problem: Teaching computers to keep asteroids honest
Featured

China’s supercomputing push meets a harder problem: Teaching computers to keep asteroids honest

Tyler O'Neal, Staff Editor September 16, 2026, 9:30 am

New geometric integration method could make long-duration spacecraft and binary-asteroid simulations more accurate, and potentially more computationally efficient

Every supercomputer simulation of an asteroid conceals a fundamental challenge. Although these systems can execute trillions of calculations per second, excessive computing power does not guarantee improved accuracy if the underlying numerical method gradually deviates from physical reality. In long-duration orbital simulations, minute numerical errors can accumulate, eventually causing a theoretically stable trajectory to deviate into an artifact of the simulation rather than a reflection of physics.

A recent study by researchers at Liaoning University and the Beijing Institute of Spacecraft Environment Engineering addresses this critical issue. The team has developed a numerical integration approach utilizing Hamel’s variational integrators to simulate the coupled orbital and rotational dynamics of binary asteroid systems. Their findings demonstrate that this method preserves essential geometric and physical properties more effectively than comparable Lie-group variational formulations, while requiring fewer computational operations. Furthermore, the approach exhibits significantly superior conservation of energy and rotational structure compared to conventional Runge–Kutta integration.

This development is particularly significant for high-performance computing (HPC). The research transcends the simple task of predicting asteroid positioning; it focuses on engineering numerically robust algorithms that maintain physical fidelity when modeling complex gravitational systems over extended timeframes. This pursuit represents the core objective of modern HPC applications.

When four asteroids become one difficult computing problem

The study, published in Space: Science & Technology (https://spj.science.org/doi/10.34133/space.0450), examines what the researchers call the full two-body problem involving two binary asteroids.

Each binary asteroid pair is approximated as a rigid “dumbbell”: two asteroids connected by a massless rod. The researchers assume the distance between the two members of each binary remains constant, allowing the pair to be treated as a rigid body.

That simplification still leaves a formidable computational problem.

Each dumbbell possesses both translational and rotational motion. The gravitational interaction therefore depends not only on where the bodies are located but also on how they are oriented.

The researchers formulate the system using SE(3), the special Euclidean group, which combines three-dimensional translation and rotation into a single mathematical framework. Rather than describing orientation with conventional Euler angles, the approach works directly with the geometry of rotations.

That matters computationally because the numerical representation itself becomes part of the physics.

Euler-angle formulations can encounter singularities, while the Lie-group formulation maintains the rotational configuration directly on the appropriate mathematical manifold. The researchers then formulate both continuous and discrete equations using Hamel’s formalism and derive a discrete integrator from Hamilton’s principle.

The resulting algorithm is a second-order variational integrator.

That phrase may sound like mathematical machinery for its own sake. It isn’t.

For an HPC engineer, it translates into a very practical question:

How many floating-point operations does it take to advance the simulation one step, and how much physical error accumulates while doing it?

The supercomputer problem is not just FLOPS

Traditional numerical integration methods such as Runge–Kutta are extremely useful because they are relatively straightforward and can provide high accuracy over individual integration steps.

But long-running orbital mechanics introduces another requirement: the numerical method must respect the underlying structure of the physical system.

The researchers compare Hamel’s method against both Lie-group variational integration and Runge–Kutta methods.

Their argument is that conventional integration can gradually violate quantities that should remain structurally constrained. In particular, the rotation matrix must remain orthogonal. If it drifts away from that condition, the computed orientation begins to contaminate the force and torque calculations.

That creates a feedback loop: numerical error → incorrect attitude → incorrect force/torque → additional numerical error.

The paper reports that this problem becomes particularly important for full-body dynamics because gravitational forces and torques depend simultaneously on position and attitude.

This is where a massively parallel computer can encounter an ironic limitation.

More processors can reduce wall-clock time, but they cannot repair a numerical algorithm that is systematically drifting away from the physics.

A better algorithm can.

Symplectic mathematics meets HPC efficiency

The researchers’ approach is based on preserving the symplectic structure of the underlying dynamical system.

Symplectic integrators are designed around the geometry of Hamiltonian mechanics rather than simply approximating derivatives. Their advantage becomes particularly important when simulations extend over many thousands, millions or potentially billions of integration steps.

In the study, both Hamel’s and Lie-group variational integrators preserve total energy and the Lie-group structure. The researchers report that Hamel’s formulation provides better structural preservation for comparable error magnitudes.

That is potentially important for future HPC workloads.

Consider a spacecraft mission simulation requiring a very long time horizon. If an integration method introduces a tiny error at every step, the computational cost can eventually become dominated by the need to reduce the timestep sufficiently to keep that error under control.

A structure-preserving method attacks the problem from a different direction.

Instead of simply calculating more steps, it attempts to make every step more physically meaningful.

That is a classic HPC optimization opportunity: reduce computational work by improving the algorithm rather than merely increasing the hardware.

The surprising result: the implicit method can be faster

Perhaps the most interesting performance result in the paper is that Hamel’s method is implicit, yet can require less computational work than the competing methods.

That sounds counterintuitive.

Implicit numerical schemes generally require equations to be solved during each timestep, while explicit schemes can advance the solution more directly.

But the details matter.

The researchers report that their Hamel formulation requires fewer operations than the Lie-group variational integrator because the implicit equations are expressed using Lie-algebra elements rather than Lie-group elements.

As a result, Hamel’s approach shows slightly higher computational efficiency in the comparison.

The comparison with Runge–Kutta is even more revealing.

The second-order explicit Runge–Kutta method requires two evaluations of the governing equations during each timestep. Each evaluation involves force and moment calculations, which are computationally expensive for this full-body problem.

Hamel’s method, although implicit, requires only one evaluation per step according to the study.

The authors note that this difference can become increasingly significant as the physical model or integrator order becomes more complex.

For HPC architects, this is a familiar lesson: The fastest algorithm is not necessarily the one with the fewest mathematical complications. It is the one that minimizes total computational work for the required accuracy.

Irregular asteroids make the problem more interesting

The researchers tested two configurations.

The first uses regular-shaped dumbbells consisting of identical rigid spheres connected by massless rods.

The second introduces irregularly shaped bodies and a more complicated gravitational potential.

That second case is particularly relevant to real asteroid dynamics.

Real asteroids are not spheres. Their irregular shapes affect both their gravitational fields and their rotational dynamics. The resulting forces can therefore alter spacecraft trajectories in ways that simplified point-mass models cannot capture.

The paper’s simulations show a noticeable trajectory deviation caused by the irregular geometry, particularly along the y direction. The researchers conclude that irregular planetary geometry can have a substantial influence on the resulting motion in full n-body dynamics.

For supercomputing, that creates a natural scaling path.

A simulation can move from: point masses → rigid bodies → irregular bodies → variable shapes → full n-body systems.

Every step increases the computational burden.

Every step also increases the value of numerical methods capable of preserving the underlying physics.

Where the HPC workload could explode

The current research should not be confused with a production-scale exascale asteroid simulation.

The paper reports CPU-time comparisons for the numerical methods; it does not claim that the experiments were executed on a TOP500-class supercomputer. That distinction is important.

But the algorithmic implications are much larger than the benchmark itself.

A future asteroid-dynamics workload could incorporate:

  • multiple interacting asteroids;
  • nonuniform mass distributions;
  • high-resolution shape models;
  • variable inter-asteroid distances;
  • spacecraft proximity operations;
  • solar radiation pressure;
  • planetary perturbations;
  • large ensembles of initial conditions;
  • uncertainty quantification;
  • trajectory optimization; and
  • Monte Carlo searches across millions of possible orbital states.

At that point, the numerical integrator becomes part of the HPC architecture.

A simulation campaign might require thousands or millions of independent trajectories. A structure-preserving algorithm that reduces the computational cost of each trajectory can therefore have an outsized effect on total cluster utilization.

The paper’s authors themselves identify variable inter-asteroid distance as an important direction for future work.

That could make the problem considerably more computationally demanding because the rigid-dumbbell assumption would no longer remove an internal degree of freedom.

And then there is China’s rapidly changing supercomputing landscape

The research also arrives at an interesting moment for Chinese HPC.

China’s supercomputing capability has recently taken a dramatic step forward on the public TOP500 benchmark.

In June 2026, LineShine, installed at the National Supercomputing Centre in Shenzhen, debuted at No. 1 on the TOP500 with a measured 2.198 exaflops on HPL. According to TOP500, the system contains approximately 13.79 million CPU cores, uses China’s custom LingKun platform and LX2 processors, a proprietary LingQi interconnect and Kylin operating system. 

The architectural detail is particularly notable.

LineShine is reported as a CPU-only exascale system, rather than relying on GPUs or other accelerators for its HPL result. TOP500 reports 2.198 exaflops of sustained HPL performance against a theoretical peak of 2.736 exaflops, approximately 80 percent of peak. 

China’s improvement is not confined to the headline HPL number.

LineShine also took the top position on the HPCG benchmark, with 22.00 petaflops. HPCG is intended to represent computational patterns more closely associated with many real scientific applications than the highly optimized dense linear algebra used by HPL. 

That is particularly relevant to the kind of computational science represented by the asteroid study.

HPC workloads are rarely just giant matrix multiplications.

Real scientific codes contain irregular memory accesses, synchronization, sparse calculations, nonlinear solvers and communication-heavy operations. An improvement in systems capable of handling those workloads matters just as much as an improvement in peak FLOPS.

From exaflops to better physics

There is therefore an interesting convergence taking place.

China is increasing the raw computational capability available for scientific computing while researchers are simultaneously improving the algorithms that determine how effectively that hardware can be used.

The asteroid paper represents the second half of that equation.

A supercomputer may have millions of cores, but the scientific result still depends on the numerical method running across those cores.

A poorly conditioned or physically drifting algorithm can turn enormous computational capacity into enormous computational waste.

A structure-preserving integrator can potentially allow the same hardware to simulate longer time horizons, larger ensembles or more complicated physical models without simply reducing the timestep until the computation becomes impractical.

The paper’s results show that Hamel’s variational integrators maintain low energy and orthogonality errors while also providing favorable CPU-time behavior. The researchers conclude that the approach offers a practical numerical method for full-body dynamics.

The bigger HPC question

The most compelling question prompted by this research is not merely the level of accuracy achievable in modeling binary asteroid systems, but whether future supercomputing efforts should prioritize the reduction of error-correction overhead in favor of deeper physical exploration.

Asteroid dynamics provide a rigorous test case, as the interplay between position, velocity, attitude, gravitational potential, angular momentum, and energy is unforgiving; even minute numerical deviations can lead to significant orbital inaccuracies over time. The researchers’ methodology compels the computational model to maintain fidelity to the underlying physical mathematics throughout the simulation.

This philosophy is increasingly vital as scientific computing scales to exascale levels and beyond. While China’s LineShine system exemplifies the vast potential of raw computational capacity, the research from Liaoning University highlights the essential, complementary challenge: ensuring that such power is translated into reliable scientific insight. Ultimately, the future of high-performance computing will depend not only on increasing floating-point operations but also on implementing the sophisticated mathematics necessary to ensure those operations remain physically meaningful.

  • Supercomputing reconstructs the moon Venus may have lost
  • 1
  • 2
Page 1 of 2
POPULAR RIGHT NOW
  • Supercomputing for the masses: Meta's vision of a personal superintelligence for everyone
    Supercomputing for the masses: Meta's vision of a personal superintelligence for everyone
  • NVIDIA helps turn AI compute into a new asset class as Wall Street mobilizes $500 billion
    NVIDIA helps turn AI compute into a new asset class as Wall Street mobilizes $500 billion
  • The stars that remember: Supercomputing reveals the hidden histories of massive binary systems
    The star γ Columbae is part of the Southern constellation of Columba, the Dove.
    The star γ Columbae is part of the Southern constellation of Columba, the Dove.
  • Supercomputers scan 165 years of weather data to find the ‘Snow-Eater’ heat waves behind Western US snowmelt
    Supercomputers scan 165 years of weather data to find the ‘Snow-Eater’ heat waves behind Western US snowmelt
  • Computational radiative transfer reveals a gas-ensheathed black hole at cosmic dawn
    Computational radiative transfer reveals a gas-ensheathed black hole at cosmic dawn
  • Supercomputers reveal four regimes of radiation damage in tungsten
    Supercomputers reveal four regimes of radiation damage in tungsten
  • Supercomputing rewrites the timeline of planet formation at cosmic dawn
    Supercomputing rewrites the timeline of planet formation at cosmic dawn
  • The next supercomputing breakthrough may come from memory, not compute
    The next supercomputing breakthrough may come from memory, not compute
  • Supercomputing reveals why some black hole flares fade away
    Supercomputing reveals why some black hole flares fade away
  • NVIDIA's $96.2 billion quarter redefines the supercomputing economy
    NVIDIA's $96.2 billion quarter redefines the supercomputing economy
THIS YEAR'S MOST READ
  • Beamforming the future: BeammWave's 6G push signals the rise of orbital-terrestrial wireless networks
    Joakim Axmon
    Joakim Axmon
  • Wall Street wants to trade supercomputing power like oil
    Wall Street wants to trade supercomputing power like oil
  • AI breaks conservation barriers: Australia’s Wildlife Observatory leverages supercomputing to protect biodiversity
    AI breaks conservation barriers: Australia’s Wildlife Observatory leverages supercomputing to protect biodiversity
  • Silicon spintronics brings the P-computer closer to reality
    Microscope image of a semiconductor-integrated spintronic test chip developed by researchers at Tohoku University and NIST. The device demonstrates the first silicon-integrated probabilistic bit (p-bit), a key building block for future large-scale probabilistic computers designed for AI and optimization workloads.
    Microscope image of a semiconductor-integrated spintronic test chip developed by researchers at Tohoku University and NIST. The device demonstrates the first silicon-integrated probabilistic bit (p-bit), a key building block for future large-scale probabilistic computers designed for AI and optimization workloads.
  • Physics-trained ‘Digital Super Brain’ learns from supercomputers to accelerate discovery
    Physics-trained ‘Digital Super Brain’ learns from supercomputers to accelerate discovery
  • Hidden order, revealed at scale: Supercomputing, electron ptychography uncover the inner workings of relaxor ferroelectrics
    Hidden order, revealed at scale: Supercomputing, electron ptychography uncover the inner workings of relaxor ferroelectrics
  • Cosmic ambition at scale: UK’s supercomputer unlocks a 2.5 petabytes universe
    Cosmic ambition at scale: UK’s supercomputer unlocks a 2.5 petabytes universe
  • Memory has become the new compute: Why Micron, SK Hynix crossing $1 trillion matters to supercomputing
    Memory has become the new compute: Why Micron, SK Hynix crossing $1 trillion matters to supercomputing
  • Huawei’s Tau Scaling ambition tests the limits of post-Moore semiconductor reality
    He Tingbo from HUAWEI delivered a keynote speech titled "New Semiconductor Path in Practice"
    He Tingbo from HUAWEI delivered a keynote speech titled "New Semiconductor Path in Practice"
  • Intel's Q1 results signal supercomputing surge driving Xeon momentum
    Intel's Q1 results signal supercomputing surge driving Xeon momentum
MOST READ OF ALL-TIME
  • Largest Computational Biology Simulation Mimics The Ribosome
    Details
    112457
    The amino acid (green) slithers into the chemical reaction center, moving through an evolutionarily ancient corridor of the ribosome (purple). The amino acid is delivered to the reaction core by the transfer RNA molecule (yellow).
    The amino acid (green) slithers into the chemical reaction center, moving through an evolutionarily ancient corridor of the ribosome (purple). The amino acid is delivered to the reaction core by the transfer RNA molecule (yellow).
  • Silicon 'neurons' may add a new dimension to chips
    Details
    81689
    Silicon 'neurons' may add a new dimension to chips
  • Linux Networx Accelerators Expected to Drive up to 4x Price/Performance
    Details
    75927
  • Complex Concepts That Really Add Up
    Details
    74254
    Complex Concepts That Really Add Up
  • Blue Sky Studios Donates Animation SuperComputer to Wesleyan
    Details
    68502
    Each rack holds 52 Angstrom Microsystem-brand “blades,” with a memory footprint of 12 or 24 gigabytes each. (Photos by Olivia Bartlett Drake)
    Each rack holds 52 Angstrom Microsystem-brand “blades,” with a memory footprint of 12 or 24 gigabytes each. (Photos by Olivia Bartlett Drake)
  • Humanities, HPC connect at NERSC
    Details
    58344
  • TeraGrid ’09 'Call for Participation'
    Details
    55333
  • Turbulence responsible for black holes' balancing act
    Details
    52713
  • Cray Wins $52 Million SuperComputer Contract
    Details
    50484
  • SDSC Researchers Accurately Predict Protein Docking
    Details
    46540
  • FRONTPAGE
  • LATEST
  • POPULAR
  • REGISTER
  • SOCIAL
  • VIDEO
  • SUBSCRIPTION
  • RSS
  • GUIDELINES
  • PRIVACY
  • TOS
  • ABOUT
  • +1 (816) 799-4488
  • editorial@supercomputingonline.com
© 2001 - 2026 SuperComputingOnline.com, LLC. All rights reserved. This material may not be published, broadcast, rewritten or redistributed without permission.
Sign In
  • FRONT PAGE
  • LATEST
    • MEDIA KIT
    • MOST READ
    • RSS FEED
    • ACADEMIA
    • AEROSPACE
    • APPLICATIONS
    • ASTRONOMY
    • AUTOMOTIVE
    • BIG DATA
    • BIOLOGY
    • CHEMISTRY
    • CLIENTS
    • CLOUD
    • DEFENSE
    • DEVELOPER TOOLS
    • EARTH SCIENCES
    • ECONOMICS
    • ENGINEERING
    • ENTERTAINMENT
    • HEALTH
    • INDUSTRY
    • INTERCONNECTS
    • GAMING
    • GOVERNMENT
    • MANUFACTURING
    • MIDDLEWARE
    • MOVIES
    • NETWORKS
    • OIL & GAS
    • PHYSICS
    • PROCESSORS
    • RETAIL
    • SCIENCE
    • STORAGE
    • SYSTEMS
    • VISUALIZATION
  • VIDEOS
    • ADD YOUR VIDEOS
    • MANAGE VIDEOS
  • COMMUNITY
    • TRADE SHOWS
    • SOCIAL NETWORK VIDEOS
    • SURVEYS
    • APPLICATIONS BROWSER
    • CONVERSATION INBOX
    • SOCIAL ADVERTISER
    • GROUPS
    • MARKETPLACE LISTINGS
    • PAGES
    • LEADERBOARD
    • POINTS LISTING
      • BADGES
    • PRIVACY CONFIRM REQUEST
    • PRIVACY CREATE REQUEST

Hey there! We noticed you’re using an ad blocker.