WorksPhysics and Astronomy
Evolving only the observed spacetime region: perfectly parallel lightcone simulations with sCOLA
Abstract
Cosmological analyses of Stage-IV galaxy surveys require large ensembles of lightcone mock catalogues, but a full survey-scale -body run costs of order CPU hours, putting such ensembles out of reach. We present a framework that produces survey-scale dark matter lightcones for a typical cost of order CPU hours each, based on the spatial COmoving Lagrangian Acceleration (sCOLA) method. sCOLA decomposes an arbitrarily large volume into small tiles that are evolved independently, with buffer regions and non-periodic boundary conditions on the gravitational potential. We combine it with on-the-fly lightcone building, so that the evolved spacetime region reduces to the observed one: each tile is stopped as soon as the observer's past lightcone has left it, and only the tiles intersecting the region of interest are simulated at all. We further introduce two accuracy improvements to the sCOLA formalism: an LPT buffer that approximates the inflow of particles from outside the sCOLA box, and a second-order perturbative approximation to the gravitational potential at its boundaries; together they remove the large-scale inaccuracies of previous work and allow smaller tiles and buffers. Against a Gadget4 reference in a box with particles, up to the sCOLA lightcone reproduces the matter power spectrum to 1%, the velocity divergence power spectrum to 1.5% and the equilateral bispectrum to 2%, with no visible discontinuity at tile boundaries. The run cost CPU hours, a factor of below our run. Perfect parallelism at this cost brings ensembles of thousands of survey-scale lightcones within reach of a single allocation: realisations of the Galactic north cap with a mass resolution of for CPU hours.
Introduction
Stage-IV galaxy surveys such as Euclid ([27] (Blanchard et al. 2020)), DESI ([22]), the Rubin Observatory Legacy Survey of Space and Time (Ivezić et al., 2019), Roman (Spergel et al., 2015) and Xuntian (Gong et al., 2026) map the large-scale structure of the Universe over tens of cubic gigaparsecs and over most of cosmic history. Their cosmological constraints increasingly come from the full shape of the clustering statistics rather than from a few compressed summaries (Kobayashi et al., 2022; Adame et al., 2025), which makes them sensitive to the non-linear regime of structure formation, where no exact analytical description exists.
Interpreting these data therefore relies on numerical -body simulations of gravitational collapse ([5]). The mock catalogues built from them calibrate an analysis pipeline end to end, provide the covariance matrices of the summary statistics, whose noise otherwise biases the inferred parameters ([46, 23, 94] (Forero-Sánchez et al. 2025)), and serve as the forward model of simulation-based ([21, 24] (Makinen et al. 2022; Hahn et al. 2024; Elsner et al. 2020; Doeser et al. 2024; Nguyen et al. 2024)) inference. What a survey observes, however, is not the Universe at one epoch but the observer’s past lightcone: each object is seen at the time when the light we receive from it was emitted. A mock catalogue is accordingly assembled in stages — evolving the dark matter, identifying halos (e.g. [11]), assigning galaxies to them by a prescription calibrated on observations (e.g. [100]), and placing those galaxies on the dark matter lightcone (e.g. Monaco et al., 2025) — of which only the first is expensive: the others are comparatively cheap, and it is the cost of the dark matter evolution that decides whether an ensemble of mocks can be produced at all. The present paper is concerned with that step alone: producing the dark matter lightcone.
The scale required for these mock catalogues is set by the surveys themselves. For example, the Galactic north cap covered by the Euclid spectroscopic sample spans the redshift range and a comoving volume of tens of ([28]). A lightcone of that region must cover the same range of epochs, and resolve the halos that host the observed tracers. One simulation of that size is already a major undertaking: state-of-the-art projects consume allocations of order CPU hours ([29] (Monaco et al. 2025; Bayer et al. 2025)). Covariance estimation and simulation-based inference, however, require large ensembles of such simulations. quire not one such realisation but thousands, and at that unit cost an ensemble is out of reach. What is needed is a method that delivers one survey-scale lightcone for a cost of order CPU hours.
The lightcones used today are produced with full -body codes such as PKDGRAV3 [79], Gadget4 (Springel et al., 2021), RAMSES [95], GreeM [54], Abacus (Garrison et al., 2021) and HACC (Heitmann et al., 2019), which have produced the landmark runs of the field: the Horizon 4 simulation (Teyssier et al., 2009), the DEUS Full Universe Run (Alimi et al., 2012), MICE-GC (Fosalba et al., 2015a,b; Crocce et al., 2015), the Euclid Flagship simulation [29], Uchuu (Ishiyama et al., 2021), Abacus-Summit (Maksimova et al., 2021) and Farpoint (Frontiere et al., 2022). They reach the accuracy the surveys demand, but at a unit cost that rules out large ensembles: most of these projects deliver a single realisation of the Universe. Such a realisation can be compared with the data, but it cannot on its own furnish the ensemble statistics an analysis needs (a covariance matrix, or the distribution of a summary statistic over realisations) which require many independent realisations of the same volume.
Faster alternatives trade accuracy for speed. Pinocchio [89] (Rizzo et al. 2017), used for the Gepetto mocks (Monaco et al., 2025), predicts halo formation from ellipsoidal collapse instead of solving the equations of motion at all. Where the equations of motion are kept, two distinct strategies reduce the number of force evaluations. The first is to build a time integrator informed by perturbation theory, so that a handful of steps suffices: this is the approach of FastPM (Feng et al., 2016), of the integrators of List & Hahn (2024), and of BullFrog [82]. The second is to change the frame of reference: COLA (COmoving Lagrangian Acceleration, [92]) and COCA (COmoving Computer Acceleration, Bartlett et al., 2025) solve for the residual displacement with respect to an approximation of the real trajectories of particles. In particular, COLA has already been used to produce mocks: cola_halo (Koda et al., 2016) fills the survey volume with remapped and replicated snapshots in redshift bins, while L-PICOLA [52] and ICE-COLA [58, 57] build the lightcone at run time. Machine-learning emulators go further still, replacing the dynamics by a map learnt from the initial conditions (He et al., 2019; Jamieson et al., 2023, 2025; Doser et al., 2024); most of them return snapshots at fixed redshift. Two recent exceptions are a generative model of halo lightcones (Zacharegkas et al., 2026) and a Lagrangian neural cellular automaton that integrates particle trajectories in time, from which a matter lightcone can be recorded on the fly [59]. Whichever approximation is adopted, the small-scale clustering of the resulting lightcone mocks departs from a full -body reference and has to be corrected (Smith et al., 2022).
None of these methods addresses the inefficiency specific to lightcones. A lightcone is usually assembled by stacking replicated copies of the box into concentric shells [63] (Blaizot et al. 2005; Fosalba et al. 2008; Fosalba et al. 2015b), or by recording lightcone crossings on the fly and interpolating between time steps [51] (Evrard et al. 2002; Merson et al. 2013; Smith et al. 2017; Ramakrishnan et al. 2025). Both methods must replicate the box whenever the simulated volume is smaller than the observed one (e.g. [52, 57], as is the case even for the largest runs to date: the Euclid Flagship simulation replicates its Gpc box to cover the sky out to [29], HalfDome tiles its Gpc box out to (Bayer et al., 2025), and the Gepetto mocks use a Gpc box out to (Monaco et al., 2025). The same structures then recur in different directions and at different redshifts, biasing higher-order statistics and small-area surveys notably; reorienting the lightcone inside the box only delays the first repetition [18] (Ramakrishnan et al. 2025). Both approaches also evolve the whole volume to redshift zero, long after distant particles crossed the lightcone: much of the computation is spent on particles already observed. Shrinking the simulation domain as the lightcone contracts recovers part of that waste [72, 39], at the price of reshaping it during the run.
In this paper we use sCOLA (Tassev et al., 2015; Leclercq et al., 2020), an extension of COLA that splits an arbitrarily large volume into small tiles evolved independently (here 216 000 tiles of side Mpc). That independence is what makes the tiling well suited to lightcone construction. A tile can be stopped as soon as the past lightcone has left it, each of its particles having been recorded at its own crossing time, without any reference to the rest of the volume — a restriction in time. And only the tiles intersecting the survey footprint need be evolved at all — a restriction in space. Together, they make the evolved spacetime region coincide with the observed one, up to the tile buffers: no computation is spent on particles that have already been observed, nor on volume that will never be observed. What dedicated lightcone schemes obtain by reshaping the simulated domain during the run is therefore obtained here at no cost, as a by-product of the decomposition. Measured against a full -body reference run with Gadget4 from the same initial conditions, an sCOLA lightcone is about three orders of magnitude cheaper, at the price of approximate dynamics below the scales resolved by the particle mesh. We also introduce two improvements of the sCOLA formalism of Leclercq et al. (2020) at the boundaries of the tiles, where its approximations are least accurate. Together they allow substantially smaller buffers, and therefore a smaller fraction of the computation spent on volume that is afterwards discarded. Section II recalls the sCOLA paradigm, introduces our improvements to it, and details the lightcone-building procedure. Section III describes the simulations we ran. Section IV reports the accuracy and the cost of the method, which we discuss in Section V. We conclude in Section VI; implementation details and parameter studies are provided in the appendices.
Methods
We begin by reviewing the tCOLA and sCOLA methods in § 2 A and II B, respectively. In § 2 C, we discuss the improvements to sCOLA accuracy introduced by this paper, and in § 2 D we describe our lightcone-building procedure.
Review of tCOLA
The temporal COmoving Lagrangian Acceleration (tCOLA, Tassev, Zaldarriaga & Eisenstein [92]) method is a hybrid approach designed to combine the accuracy of -body simulations with the efficiency of analytical approximations. In this framework, the equations of motion for a particle are solved in a reference frame that co-moves with the approximate trajectory of the particle, as predicted by Lagrangian Perturbation Theory (LPT).
In the following, we adopt the notations of Leclercq [66]; Leclercq et al. (2020); Bartlett et al. (2025), where complete derivations can be found. Let denote the conformal time and denote the scale factor, normalised to unity at the present time, i.e., . The initial and final comoving positions of particles are denoted by and , respectively. The canonical momenta with respect to the Hubble flow, scaled by , are defined as
The Drift coefficient is defined as
with being the conformal expansion rate.
Second-order Lagrangian Perturbation Theory (2LPT, Bouchet et al. (1995)) is built upon two potentials. The first-order potential is sourced by the initial overdensity field , while the second-order potential is sourced by the initial gravitational tidal field:
From these potentials, the time-independent LPT displacement fields and are defined as for . The 2LPT positions and momenta are then given by
where and are the first- and second-order growth factors, respectively.
In the tCOLA framework, the full particle position of any particle is decomposed as (Tassev & Zaldarriaga [91])
where is the residual displacement with respect to the 2LPT trajectory. We also define such that . The time evolution of the system is governed by the Drift and Kick equations (Leclercq [66]):
where the Kick coefficient is defined by
and a superscript denotes quantities at the present time. The natural variables in tCOLA are and . The and operators perform the change of frame of reference by converting the physical momenta of particles to the residual momenta, and vice versa. They are defined by subtracting or adding the 2LPT momenta to the physical momenta, i.e.
The continuous tCOLA equations (8) and (9) are discretised to allow integration over a finite number of time steps. We use as the time variable, and choose a symplectic Kick-Drift-Kick (KDK, Quinn et al. (1997)) integrator, which alternates between Kick and Drift steps. In the following, the initial and final scale factors for a Drift step are denoted by and , respectively, and by and for a Kick step. The COLA method usually employs a modified discretisation scheme, introduced by Tassev, Zaldarriaga & Eisenstein [92], involving a free parameter (see Leclercq et al. (2020), Appendix B). Following earlier experimentations, we choose , which best reproduces the results of full gravity.
Gravitational forces (the term in the Kick equation (9)) can, in principle, be evaluated using any numerical prescription. So far, implementations of tCOLA have relied on evaluating forces on a particle-mesh (PM) grid, which is the approach adopted here. To do so, we obtain the density field by mass assignment of particles onto a regular mesh using the Cloud-in-Cell (CiC, Hockney & Eastwood, [49]) method, from which the gravitational potential is computed spectrally (see § 2 B), and the force field is derived using finite differences.
Since the residual with respect to the LPT trajectory is typically much smaller than the total displacement, fewer time steps are required to integrate equations (8) and (9) than the standard equations of motion to achieve results at the same accuracy. With respect to tree codes, tCOLA leads to a factor of reduction in the number of time steps required to reach 1% agreement down to scales of comoving wavenumber ({Tassev, Zaldarriaga & Eisenstein, 2013; Leclercq, Jasche & Wandelt, 2015; Izard, Crocce & Fosalba, 2016; Koda et al., 2016}).
Review of sCOLA
The spatial COmoving Lagrangian Acceleration framework (sCOLA, originally introduced by Tassev et al., 2015) extends COLA by using a comoving Lagrangian frame of reference to spatially decouple far and near fields in space, so that any single small volume embedded inside a larger simulation can reproduce the results of a standard -body run. The idea was later extended and refined by Leclercq et al. (2020) to simulate arbitrarily large volumes by splitting the simulation domain into small, independently evolved tiles. The key challenge is to make each tile self-contained: particles near the border of a tile are gravitationally influenced by particles outside it, and particles should be able to physically move in or out of the tile during the simulation. sCOLA addresses these two issues by introducing two approximations: (i) surrounding each tile with a buffer region that pushes boundary artefacts away from the domain of interest, and (ii) imposing non-periodic boundary conditions on the gravitational potential to encode the gravitational influence of the full matter distribution on each tile. The result is a simulation scheme that is perfectly parallel and asynchronous: each tile can be evolved independently (Leclercq et al., 2020).
We consider a full simulation volume of comoving size , with particles per axis and PM grid cells per axis, divided into cubic tiles, each of size with particles per axis (left panel of Figure 1; see also Figure 2 and Table 1 in Leclercq et al. 2020). Each tile is surrounded on all sides by a Lagrangian buffer of initial width . The Eulerian volume occupied by the tile and its buffer forms the sCOLA box, which is evolved by the -body solver. The generation of the initial conditions in sCOLA is slightly different from the traditional framework; indeed, the generation of the initial positions and momenta of particles in each sCOLA box can be included in the perfectly parallel section of the algorithm by directly computing them from a chunk of the 2LPT potentials and read locally (see Figure 1 of Leclercq et al. 2020). This implies that memory-expensive operations needed on the full box (e.g. fast Fourier transforms) are limited to calculating the LPT potentials.

Figure 1. Illustration of sCOLA with an LPT buffer: an arbitrarily large volume is split into small tiles that are simulated independently. Particles are represented as vertices of the Lagrangian grid. The LPT buffer (new in this work, in blue) approximates the inflow of particles from outside the sCOLA box (defined as the tile in white, plus its buffer in orange) as the Lagrangian grid deforms. Non-periodic boundary conditions on the gravitational potential (improved in this work) account for the large-scale gravitational field in which the sCOLA box is embedded.

Figure 2. Interpolation of positions and momenta at lightcone crossing. The position is interpolated between Drift times and , at the lightcone crossing time defined such that the particle lies at the comoving distance from the observer. The residual momentum is interpolated between the Kick times and that surround , and the LPT momentum at is then added back to recover the full momentum .
In a standard periodic PM simulation, the Poisson equation is solved globally via fast Fourier transforms, which assume periodic boundary conditions on the gravitational potential . In contrast, in sCOLA, each sCOLA box is a finite sub-volume of a larger universe. Therefore, assuming periodicity would incorrectly wrap the gravitational influence of the sCOLA box on itself and be unphysical (see Tassev et al., 2015, for a discussion of the resulting artefacts). Instead, following Leclercq et al. (2020), we impose Dirichlet boundary conditions on the faces of sCOLA boxes, prescribing the value of . Solving the Poisson equation with Dirichlet boundary conditions require the use of discrete sine transforms (DST) with ghost cells immediately outside the active domain of the PM grid (Leclercq et al., 2020, Appendix C).
Boundary conditions should be as accurate as possible: errors in propagate inward over time, affecting the quality of the gravitational potential field throughout the box, particularly near the sCOLA box edges. Unfortunately, having access to the exact would require solving the simulation in the full box, which is what sCOLA seeks to avoid. Thus, to preserve the perfectly parallel nature of the algorithm, in Leclercq et al. (2020), the boundary conditions are approximated under the linearly-evolving potential (LEP) approximation (Brainerd, Scherrer & Villumsen, [15]; Bagla & Padmanabhan [6]):
In this approximation, the spatial structure of the potential is frozen to the initial linear field of (whose computation is required for the initial conditions), with only its amplitude rescaled by the linear growth factor . All non-linear effects, such as gravitational clustering, are neglected.
Improvements of sCOLA
In this work, we introduce two elements that improve the accuracy of the sCOLA algorithm, as described by Leclercq et al. (2020): (1) a LPT buffer to approximate the inflow of particles into sCOLA boxes, and (2) second-order boundary conditions on the gravitational potential.
LPT buffer. As the simulation advances in time, particles that were initially outside the sCOLA box should be able to cross its boundary and enter the corresponding Eulerian volume. The standard sCOLA approach considers particles only within the initial sCOLA box and therefore misses this inflow, producing an approximate interior density contrast that sources the Poisson equation. This approximation produces artefacts near the boundary of sCOLA boxes and affects modes larger than the sCOLA box in the full simulation. Of the two approximations involved in sCOLA ( and ), Leclercq et al. (2020) Section IV.C and Figure 7 found this one to be the dominant one. To address this shortcoming, we introduce for each tile a LPT buffer, defined as a few additional Lagrangian layers of particles surrounding the sCOLA box (see Figure 1). Within the LPT buffer, particles evolve solely under their 2LPT trajectories, i.e. no gravitational forces are computed for them. They provide an inexpensive but physically motivated proxy for the inflow of matter from outside the sCOLA box and improve the approximation that defines (see Appendix A for more details). The LPT displacements and of these particles are generated from the 2LPT potentials and when the sCOLA box is initialised, within the perfectly parallel section of the algorithm.

Figure 7. Comparison of the matter density power spectrum and cross-correlations between Gadget4, sCOLA and tCOLA on the Mini and Main lightcone simulations, for 10 and 100 time steps ( variable). For the power spectrum, we plot the ratio to the reference Gadget4 power spectrum. The grey bands are 1% and 2% around Gadget4. The cross-correlations are also computed with respect to Gadget4; there, the grey bands are 1‰ and 2‰. sCOLA reaches 1% agreement with Gadget4 up to with 10 time steps; the residual bump near the sCOLA box scale stays within 1%. The fundamental modes of the tile and the sCOLA box are denoted and , respectively.
Second-order boundary conditions. After introducing the LPT buffer, our tests showed that the LEP approximation at the boundary of sCOLA boxes () became dominant over the approximation of the density contrast (). For this reason, in this work, we also replace the LEP approximation with an expression derived from second-order standard perturbation theory for the boundary conditions . The new approximation, derived in Appendix B, reads:
where the second-order correction is:
This expression involves the second-order LPT potential and the squared norm of the first-order displacement , both quadratic in . Computation of is inexpensive, since and are computed for each particle of the sCOLA box upon initialisation. Unlike the LEP approximation, the new has a time-evolving spatial structure: the second-order term captures some of the effects of non-linear structure formation on the gravitational potential. Taken together, the two improvements described above increase the accuracy of the sCOLA algorithm (see Appendix C for a detailed study). Therefore, to reach a given accuracy, they allow for smaller buffer regions around sCOLA tiles than reported by Leclercq et al. (2020): typically instead of , see Appendix D.
Lightcone building
In a simulation, the observer sees its past lightcone, which is defined by the ensemble of null geodesics intersecting both the source and the observer’s worldlines. An exact treatment of lightcone building using a relativistic ray-tracing framework is provided by MهاgrATHÉA-PATHFINDER (Breton et al., 2019; Breton & Reverdy, [16]). Following previous work (e.g. Howlett, Manera & Percival, [52]; Euclid Collaboration et al., [29]), we use a simplified geodesic equation allowing us to construct the lightcone on-the-fly during the simulation, rather than in post-processing. We define the radius of the lightcone from the observer at any past scale factor as the comoving distance (Hogg, [50]):
with the conformal expansion rate. Let us consider a particle at position , which is at a comoving distance of the observer located at . It will be seen by the observer when it crosses its past lightcone, i.e. at a time such that
This equation is the lightcone crossing condition. Defining , the crossing condition reads . We assume that is a continuous function of . Since particles move slower than light, the particle distance cannot decrease faster than the horizon as increases, so is a decreasing function of and (because ). For observable particles (particles within the observable radius ), we have . Therefore, for all observable particles, there exists a scale factor such that .
Since particle trajectories are integrated in discrete Drift steps, positions are only defined at discrete scale factors . A lightcone crossing occurs between and when:
Thus, at each time step, for all particles that have not yet crossed the lightcone, we monitor the sign of . When it becomes non-positive, the particle is flagged, and its position and residual momentum at are recovered by interpolation. For periodic simulations, the evaluation of and interpolation of are done before wrapping particle positions across the box boundaries to avoid unphysical discontinuities in the interpolation.
For a flagged particle, the crossing time and position are obtained by linear interpolation between and : using ,
The residual momenta are defined at Kick times. Therefore, the residual momentum at lightcone crossing is interpolated between the two Kick times and bracketing , i.e. such that .
The LPT momentum at (from equation (6)) is then added back via the operator to recover the full momentum . Figure 2 summarises the above interpolation procedure.
For a monolithic tCOLA simulation with the observer inside the box, the full simulation is run from the initial time to , and lightcone outputs are collected progressively as particles cross the lightcone. In the case of sCOLA, the simulation of each box can be stopped as soon as the lightcone has left the sCOLA box. Indeed, once the lightcone has passed the corner of the box closest to the observer, all particles in the tile have already crossed the lightcone and their outputs have been collected. Tiles farther from the observer are crossed by the lightcone at earlier times (smaller ), so they require fewer time steps, as illustrated in Figure 3. In Figure 4, we show the average fraction of time steps needed as a function of the size of the box. For example, sCOLA lightcone building for a octant with 10 time steps linearly spaced in yields a 57% reduction in the average number of time steps with respect to evolving all of the sCOLA boxes to .

Figure 3. sCOLA lightcone building: each tile is evolved only until the lightcone has left it, reducing the number of required time steps. Tiles farther from the observer are crossed by the lightcone earlier and require fewer time steps.
Gadget4, monolithic tCOLA, and sCOLA handle the periodic wrapping of particles differently when building a lightcone, leading to differences near the edges. Gadget4 replicates the box, which means that there can be duplication of particles in the produced snapshot. Monolithic tCOLA wraps particles during their evolution, so particles can cross the full box boundary and be wrapped before being interpolated. Finally, sCOLA does not wrap particles during evolution but does so at the end when gathering the tiles into a single snapshot. Due to these differences, we remove a safe border of around the box edges before any comparative analysis.
Simulations
In Section III A, we describe the two simulation volumes used throughout this work and the generation of initial conditions. In Section III B, we present the reference Gadget4 run; in Section III C, the monolithic tCOLA run, which isolates the error due to the sCOLA tiling from that due to the COLA time-stepping; and in Section III D, the sCOLA runs themselves.
General setup
We use two simulation setups, Main and Mini. The Main simulations have a box side length , particles per dimension, and PM grid cells per dimension. The particle mass is .
The box is slightly larger than that of the Euclid Flagship simulation (Euclid Collaboration et al. [29]) () but the resolution is coarser (). To compare sCOLA to monolithic tCOLA, we also ran Mini simulations, with the same mass and spatial resolution as the Main simulations but half their box side length: , , .
The initial conditions were generated with the MUSIC2-monofonIC code (Hahn et al. (2020)), modified to write to disk the quantities required by Simbelmynë and Gadget4: the initial overdensity field , the 2LPT potentials and , and the Lagrangian positions . monofonIC relies on CLASS (Lesgourgues [70]) for the initial power spectrum. The initial conditions were generated at scale factor . The cosmological parameters are those of Planck Collaboration et al. [78]: , , , , , and .
For both tCOLA and sCOLA, we used the KDK leapfrog integrator, with 10 time steps evenly spaced in (following Rampf, List & Hahn [82]). Table I lists the scale factors of the corresponding Kick and Drift operations.
Reference with Gadget4
We used Gadget4 (Springel et al. (2021)) as the reference -body code against which we assess the accuracy and computational cost of sCOLA. It was started from the particles generated by MUSIC2-monofonIC at . We used the TreePM force computation of Gadget4 with a PM grid (PMGRID), a force-split scale of 1.25 mesh cells (ASMTH), and a comoving softening length of (1/20 of the mean inter-particle separation); the tree was opened with the relative criterion at ErrTolForceAcc = 0.005, the time-step accuracy parameter was ErrTolIntAccuracy = 0.025, and long- and short-range forces were integrated on a common time step (TREEPM_NOTIMESPLIT). We ran Gadget4 on the Irene cluster of the Très Grand Centre de calcul du CEA (TGCC). The Main simulation was run on 192 nodes (128 CPUs and 228 GB of RAM per node), in many short jobs of about one hour each. In total, it consumed 3 379 000 CPU hours (CPUh). We also ran a Mini reference simulation with Gadget4, using the same parameters except for the PM grid, set to ; it consumed 128 200 CPUh.
Monolithic tCOLA
To separate the error due to the sCOLA approximations from that due to the reduced number of COLA
| Kicks | 0.05 | 0.0868 | 0.1606 | 0.2351 | 0.3111 | 0.3897 | 0.4727 | 0.5623 | 0.6620 | 0.7771 | 0.9165 | 1.00 |
| Drifts | 0.0500 | 0.1236 | 0.1977 | 0.2728 | 0.3500 | 0.4305 | 0.5165 | 0.6106 | 0.7171 | 0.8430 | 1.000 |
caption: Scale factors of the Kick and Drift operations of the time-stepping used in this article. Each operation runs between two consecutive scale factors (for instance the first Kick is between 0.0500 and 0.0868).
:::
time steps, we ran a monolithic tCOLA simulation with the Simbelmynë code (Leclercq, Jasche & Wandelt, 2015; Leclercq et al., 2020). We used an upgraded version of the code, which includes the sCOLA improvements and the lightcone-building capability described in § 2. Since the code does not support multi-node computation, the number of particles in a monolithic run is limited by the memory of a single node ( particles for a 2 TB node). We therefore ran tCOLA only in the Mini setup. The tCOLA Mini simulation was run on the Infinity cluster of the Institut d’Astrophysique de Paris (IAP), on a single node with 128 CPUs and 2 TB of RAM, for 1 h 36 min of wall-clock time (205 CPUh). To disentangle the effects of the time integration from those of the force model, we also ran a tCOLA Mini simulation with 100 time steps (1 527 CPUh).
sCOLA
For the Main sCOLA simulations, we used tiles per dimension, for a total of 216 000 tiles; and for the Mini sCOLA simulations, , for a total of 27 000 tiles. Each tile thus had a side length and particles per dimension. We used buffers of width (). Each sCOLA box is evolved in full, but only the particles of its tile are kept; the number of particles evolved therefore exceeds the number kept by the oversimulation factor (Leclercq et al., 2020)
which equals 3.38 for the configuration used here. Around the buffer, we added an LPT buffer of width (), in which particles move only under their 2LPT displacements. Appendix D justifies the choice of these sCOLA parameters.
We ran the Main simulation with sCOLA twice: once up to , and a second time with lightcone-only output, in which case each sCOLA box is stopped as soon as the lightcone has left it (§ 2 D). The sCOLA Main and Mini simulations were run asynchronously on the Infinity cluster of the IAP, on whichever CPUs were available at the time. Each sCOLA box used 4 CPUs and 150 MB of RAM. We also ran sCOLA simulations with 100 time steps for both Mini and Main, and both up to and lightcone-only.
Results
We now compare our sCOLA lightcone to the reference Gadget4 simulation, and assess the cost of producing it. Section IV A inspects the density and velocity fields directly, where artefacts of the tiling would be most conspicuous. Section IV B turns to summary statistics, which quantify the agreement scale by scale and allow the residual differences to be attributed to individual approximations. Section IV C reports the computational cost of the method, including the savings obtained by stopping each tile as soon as the lightcone has left it.
Density and velocity fields
Figure 5 compares a slice of the Main simulation lightcone density field from sCOLA and Gadget4. We show the quantity to enhance the visual contrast between voids and high-density regions. The mean absolute difference in between the two fields is 0.036, and no discontinuity is visible at tile boundaries: the sCOLA tiling preserves the continuity of the density field despite the independent evolution of the tiles.

Figure 5. Slice of the Main simulation lightcone dark matter density field for Gadget4 (top row) and sCOLA (middle row), shown as . The bottom row displays the difference in between the two fields, with the sCOLA tiling represented as dashed lines. The observer is located at (bottom left corner), coordinates are in , and the full box is a cube of side . sCOLA reproduces the Gadget4 density field with no visible tile-boundary artefacts, with a mean absolute difference in of 0.036.
Figure 6 compares a - slice of the line-of-sight velocity field from sCOLA and Gadget4. The velocity field was reconstructed using the Simplex-in-Cell (SiC) projection (Abel, Hahn & Kaehler, [1]; Hahn, Abel & Kaehler, [43]; Hahn, Angulo & Abel, [44]; Leclercq et al., 2017), and it is shown as in km s. sCOLA recovers the large-scale velocity structure of Gadget4, with a mean absolute difference in of 9.67 km s. A few tile-related velocity defects remain, for instance around (800, 480) in Figure 6. We traced them to particle displacements exceeding the buffer width, and checked that they disappear when the buffer is enlarged to 32 .

Figure 6. Slice of the Main simulation lightcone velocity field for Gadget4 (top row) and sCOLA (middle row). We plot the line-of-sight velocity component in km s. The bottom row displays the difference between the two velocity fields, with the sCOLA tiling represented as dashed lines. sCOLA reproduces the Gadget4 velocity field with only a handful of visible tile-boundary artefacts; the mean absolute difference in is 9.67 km s.
Power spectra and bispectra
Figure 7 compares two-point statistics in Fourier space for sCOLA, monolithic tCOLA, and Gadget4, allowing us to separate three sources of discrepancy: (i) the reduced number of time steps (COLA), (ii) the force model (PM versus TreePM), and (iii) the spatial tiling (sCOLA). With 10 time steps, sCOLA reaches 1% agreement with Gadget4 on the matter power spectrum up to , and cross-correlations above 0.999 up to .
The sCOLA power spectrum shows a mild bump with respect to tCOLA near the fundamental mode of the sCOLA box (, i.e. with , the side of the sCOLA box and not of the tile), associated with the finite size of the sCOLA boxes. For the chosen configuration, its amplitude remains below 1%. The bump can be further reduced by changing the sCOLA configuration (see Appendix D): with and , for instance, its amplitude falls below 0.2%.
Increasing the number of time steps from 10 to 100 in sCOLA and tCOLA reduces the overall difference from Gadget4 and pushes the small-scale divergence to smaller scales. For sCOLA, the wavenumber up to which the cross-correlation exceeds 0.999 moves from to . The divergence at small scales is caused by the limited resolution of the PM force model, as opposed to the TreePM method of Gadget4.
We also computed the equilateral bispectrum (see Appendix § 4.7). sCOLA agrees with Gadget4 at the level up to , confirming that it captures the non-Gaussian features of the density field. The velocity divergence power spectrum agrees with Gadget4 at the 1.5% level up to (see Appendix F). The power spectra and bispectra were computed on the lightcone, so the Main and Mini simulations probe different redshift ranges, and respectively; this difference in redshift coverage explains the difference between the Main and Mini spectra, notably at small scales.
Computational cost
The Gadget4 Main and Mini simulations cost 3 379 000 CPUh and 128 200 CPUh respectively. The monolithic tCOLA Mini simulation cost 205 CPUh, which corresponds to an average of 9.5 CPU seconds per million particles per force step (hereafter CPU sec / M part / step). Overall, on the Mini volume, tCOLA reduces the computational cost by a factor of 625 with respect to Gadget4. This reduction is due to (i) the reduced number of time steps allowed by COLA and (ii) the use of a PM force model.
For the Main simulation up to , an sCOLA box
| Project | Gravity Model | CPU hours / million | |||
| Uchuu ((Ishiyama et al., 2021)) | GreeM | ||||
| Euclid Flagship ([29]) | PKDGRAV3 | ||||
| HalfDome ((Bayer et al., 2025)) | FastPM | ||||
| Gepetto ((Monaco et al., 2025)) | Pinocchio | ||||
| This work | Gadget4 | ||||
| This work | sCOLA | ||||
| This work | tCOLA |
Table II. Computational cost of our simulations compared with that of other large cosmological simulations. The costs of our runs are given for lightcone simulations with 10 time steps and, for sCOLA, an oversimulation factor of 3.38 set by the buffer size. sCOLA reduces the cost by a factor of 120 to 2 600 with respect to the other -body codes, approaching the cost of Pinocchio while remaining an -body solver. These ratios are indicative only: the runs compared differ in mass resolution, gravity solver, and hardware.
ran on average for 11.2 s (43.5 CPU seconds), corresponding to a total computational cost of 2 690 CPUh. This amounts to 15.6 CPU sec / M part / step when only the particles kept, i.e. those of the tile, are counted (CPU sec / M part kept / step), above the monolithic tCOLA value because of the oversimulation factor. When all particles evolved are counted, i.e. including the buffer, the cost is approximately 4.6 CPU sec / M part / step, below the tCOLA value because of the imperfect CPU efficiency of the monolithic run on large grids. The memory footprint of sCOLA was 170 MB / M part.
The cost per million particles evolved per time step is expected to be nearly independent of the sCOLA configuration; taking it to be the ∼4.6 CPU sec / M part / step measured for all of the configurations studied here, the total cost of an sCOLA simulation is proportional to the oversimulation factor (here 3.38). In this work, we chose the smallest tiles that achieve an accuracy of 1% on the power spectrum, , to maximise the number of independent tiles, and hence the degree of parallelism. Larger tiles, for instance at fixed , would have given an oversimulation factor of 1.59 and divided the total budget by 2.1 (see Appendix D).
Because each sCOLA box is stopped as soon as the lightcone has left it, the boxes of the lightcone run ran for 5.4 s on average (20.8 CPU seconds), for a total of 1 300 CPUh: a 52% reduction with respect to the run to . This reduction is consistent with the predicted 57% reduction in the number of force steps (Figure 3 and Figure 4). The difference is explained by the overhead due to I/O, which does not scale with the number of steps. Overall, the computational cost of the sCOLA lightcone run is lower than that of our Gadget4 run by a factor of 2 600. Four effects drive this reduction: (i) the reduced number of time steps allowed by COLA, (ii) the use of a PM force model, (iii) the absence of global communications between nodes and (iv) the restriction of the evolution to the observed spacetime region. It is partly offset by the oversimulation factor, which multiplies the number of particles evolved by 3.38. These contributions can be separated using the runs of Section III. On the Mini volume, effects (i), (ii) and (iii) together reduce the cost by a factor of 625 with respect to Gadget4. Restricting the evolution to the observed spacetime region adds a factor 2 690/1 300 = 2.1. The tiling itself costs a net factor of the oversimulation factor of 3.38 being partly compensated by the better CPU efficiency of the small sCOLA boxes (4.6 against 9.5 CPU sec / M part / step). The remaining factor of 3.3 is the higher per-particle cost of Gadget4 on the Main volume than on the Mini (59.7 against 18.1 CPUh per million particles), and is therefore a property of the reference code rather than of sCOLA. Together, .

Figure 4. Mean number of time steps needed to build a lightcone with sCOLA, (averaged over sCOLA boxes), divided by the number of time steps needed to evolve each sCOLA box to , as a function of the size of the full box. We distinguish the cases of a cubical octant (the full volume is evolved) and a spherical octant (only the tiles in the sphere are evolved). We compare the ideal case of arbitrarily small tiles and an infinite number of time steps (dashed lines) to the realistic configuration used in this work, i.e. ten time steps and tiles of size (solid lines). For the cubical octant of this work, building the lightcone with sCOLA requires 57% fewer time steps than evolving the full volume to .
tbl:II compares the computational cost of our simulations with that of other large cosmological runs. sCOLA reaches a cost per particle comparable to that of approximate methods such as Pinocchio (0.022 versus 0.020 CPUh per million particles) while retaining full -body dynamics.
Discussion
We first ask what controlling the two sCOLA approximations has bought (§ 4 A), and how a tiling should be chosen in practice (§ 4 B). We then consider what restricting the evolved volume to the observed spacetime region makes possible (§ 4 C).
Accuracy improvements with respect to previous work
Compared to Lelercq et al. (2020), the present work improves the accuracy of sCOLA by better controlling its two approximations: the LPT buffer accounts for the inflow of particles, and the second-order gravitational potential improves the boundary conditions. In previous work, the sCOLA matter power spectrum differed from that of tCOLA at large scales (Figure 6 of Lelercq et al. (2020)); this difference disappears with the LPT buffer and the second-order gravitational potential (Figure 8). The gain also allows smaller tiles and buffers: whereas Lelercq et al. (2020) needed a sCOLA configuration of and to reach agreement with tCOLA on the matter power spectrum, a configuration with and now reaches 1% agreement with Gadget4.

Figure 8. Effects of the LPT buffer and second-order gravitational potential term on the sCOLA power spectrum and cross-correlations compared to monolithic tCOLA, for a configuration , , , , and the same mass resolution as the Main simulation. The two improvements combined bring the power spectrum error down from 3% to 1%, remove the bias at large scales, and push the scale at which the cross-correlations diverge from to . The vertical line in the top panel marks the fundamental mode of the sCOLA box, , with .
Accuracy improvements are directly visible in the density and velocity fields. In previous work, the density and velocity differences between sCOLA and tCOLA were of the order of in and km s, respectively (Figure 3 and Figure 4 of Lelercq et al. (2020)); here, between sCOLA and Gadget4, they are of the order of in and km s (see the colour bar scales of Figure 5 and Figure 6). Although the tiling artefacts of Lelercq et al. (2020) are no longer visible by eye, these residual differences are still preferentially located close to the tile edges and in high-density regions. As reported in Section IV A, these tile-related defects of the velocity field disappear when the buffer is enlarged; Appendix D shows more generally how the agreement with tCOLA improves with buffer size.
The velocity field also shows low-amplitude, spatially extended differences, which we interpret as a misestimation of bulk flows (of the order of km s). Both the density and velocity differences decrease with distance from the observer, as structures at higher redshift are less non-linear.
The residual differences between sCOLA and Gadget4 can be attributed to three approximations:
The sCOLA tiling leads to a bump at the scale of the sCOLA box in the density power spectrum, the velocity divergence power spectrum, and the
density bispectrum. Its amplitude is controlled by the tile and buffer sizes.
The reduced number of time steps in COLA leads to differences at wavenumbers in the density power spectrum, the velocity divergence power spectrum, and the density bispectrum. These differences can be mitigated by increasing the number of time steps.
The PM force model is responsible for the divergence at wavenumbers . Removing it requires a more accurate force model.
Computational strategy and scalability
A key quantity in sCOLA is the oversimulation factor of equation (22), which quantifies the extra volume simulated because of the buffers. The computational cost is roughly proportional to this ratio, which must therefore be balanced against accuracy requirements. Given the available RAM, the target mass resolution, and the accuracy requirements, one can use the Pareto fronts of Figure 11 and Figure 12 to find the and that minimise the oversimulation factor. For instance, with 2 GB of RAM per sCOLA box, the maximum number of particles per box is ; at the mass resolution of this work () and for a required accuracy of 1%, the configuration that minimises the oversimulation factor is then and , with an oversimulation factor of 1.59. With this configuration, the Main lightcone simulation would then cost an estimated 600 CPUh.

Figure 11. Pareto front of the sCOLA configurations (tile and buffer sizes), comparing the oversimulation factor (or equivalently the CPU sec / M part kept / step) to the distance to tCOLA, as defined in equation (D1). Coloured lines show varying buffer size at fixed tile size, grey lines show varying tile size at fixed buffer size. The annotated coloured labels correspond to the buffer sizes (in ). At a given accuracy, the largest tiles minimise the oversimulation factor.

Figure 12. Pareto front of the sCOLA configurations (tile and buffer sizes), comparing the RAM usage (or equivalently the number of particles in the sCOLA box) to the distance to tCOLA (as defined in equation (50)). Coloured lines show varying buffer size at fixed tile size, grey lines show varying tile size at fixed buffer size. The annotated coloured labels correspond to the buffer sizes (in ). At a given accuracy, the smallest tiles minimise the RAM usage.
The tiling strategy enables asynchronous and perfectly parallel computations (see Leclercq et al. 2020 for a detailed discussion). Unlike traditional large -body simulations, this approach does not require tightly synchronised high-performance computing resources. Instead, it allows a flexible use of distributed computing resources and is resilient to node failure. On the other hand, it does not exploit the fast inter-node communication capabilities typical of large supercomputers. The memory footprint of a single sCOLA box is also small, 150 MB for the configuration used here, so that sCOLA could in principle run on a wide range of hardware, and even be distributed over volunteer computing resources.
Lightcone simulations and applications
Cosmological surveys measure the properties of galaxies over a fraction of the sky and within a range of redshifts. Their footprints do not fill their bounding cube (the smallest cube containing the survey geometry). For instance, the Galactic north cap covered by Euclid spectroscopic data, defined as a truncated spherical cone sector covering the redshift range and a Galactic latitude (Euclid Collaboration et al. [28]), has a volume of , only 29% of the volume of its bounding cube (Appendix § 4.9).
The observed spacetime region is therefore further restricted by the survey geometry: of the past lightcone contained in the simulation box, only the part covered by the footprint is of interest. The sCOLA tiling makes it possible to evolve only the tiles that overlap that region, so that the cost of a simulation is reduced accordingly. Evolving only the observed spacetime region thus combines a restriction in time, set by the lightcone, and a restriction in space, set by the survey geometry. This spatial restriction also removes the need to replicate the box: since only the tiles overlapping the footprint are evolved, the bounding cube can be made as large as the survey requires while the evolution is paid for over the observed volume alone. The initial conditions are the exception: the LPT potentials must still be computed over the entire cube (§ 2 B), so the memory footprint of that step is set by the bounding volume and not by the survey.
With an allocation of CPUh, comparable to that of state-of-the-art projects (Euclid Collaboration et al. [29]; Monaco et al. 2025; Bayer et al. 2025), one could run Main lightcone simulations in the , configuration. Extrapolating to the Euclid north cap volume, the same budget would allow for north cap simulations (Appendix § 4.9) at the mass resolution of this work. On the other hand, improving the mass resolution to resolve the smallest halos containing tracers detectable by the survey would require many more particles (as in Euclid Collaboration et al. [29]) and therefore a much higher cost per simulation.
Combined with a prescription for populating the dark matter field with halos and galaxies, sCOLA therefore opens the possibility of producing large ensembles of mock catalogues. Such ensembles are required to estimate the covariance matrices of two-point and higher-order statistics (Hartlap, Simon & Schneider [46]; Kitaura et al. 2016; Forero-Sánchez et al. 2025), to perform simulation-based inference (SBI, also known as implicit-likelihood inference, ILI) (Hahn et al. 2024; Bairagi, Wandelt & Villescusas-Navarro [7]), to test modified gravity models (Fiorini et al. 2021; Ruan et al. 2022), and to probe relativistic effects such as gravitational redshift (Wojtak, Hansen & Hjorth [101]; Alam et al. 2017; Zhu et al. 2017). All these applications need mocks that are deep as well as numerous: a box shallower than the survey suffers from super-sample covariance (Bayer et al. 2023) and, once replicated to fill the volume, from spurious correlations between its copies (Chen & Yu [18]).
Conclusion
Lightcone simulations at survey scale have so far been affordable one at a time. We have shown that sCOLA lifts that constraint: because the volume is tiled into independent boxes, each box can be stopped as soon as the observer’s past lightcone has left it, and only the boxes intersecting the region of interest need be evolved at all, so that evolving only the observed spacetime region becomes a property of the tiling rather than a scheme added on top of it. We also improved the tiling itself, with an LPT buffer that approximates the inflow of particles into a box and a second-order approximation to the gravitational potential at its boundaries; together they remove the large-scale inaccuracies observed by Leclercq et al. (2020) and allow substantially smaller buffers and tiles, which is what makes the method cheap as well as perfectly parallel.
With respect to Gadget4, sCOLA reaches percent-level accuracy in the matter power spectrum up to , 2% agreement in the equilateral bispectrum up to the same scale, and 1.5% agreement in the velocity divergence power spectrum up to , at a computational cost reduced by a factor of 2600. Four effects drive this reduction:
Changing the frame of reference: sCOLA is an extension of COLA, in which we solve the equations of motion of particles in the reference frame of their 2LPT trajectories; fewer time steps are then needed to reach a given accuracy than in a standard -body integration (Tassev et al. (2015)).
Using a particle-mesh force model: gravitational forces are evaluated on a particle-mesh grid rather than with a tree, which makes each time step cheaper, at the price of accuracy below the scales resolved by the mesh.
Avoiding global communications: thanks to appropriate approximations at the tile boundaries (a buffer of simulated particles, an LPT buffer, and Dirichlet boundary conditions on the gravitational potential), each tile can be simulated independently of all the others, with no communication at all: the algorithm is perfectly parallel (Leclercq et al. (2020)).
Evolving only the observed spacetime region: we simulate only the tiles that intersect the region of interest, and evolve each of them only until the lightcone has left it (the contribution of the present paper).
The perfect parallelism and low cost of sCOLA make it particularly well suited to generating the large ensembles of simulations required by modern cosmological analyses: for instance, we estimate that lightcone simulations of the Euclid Galactic north cap at a mass resolution of would require a budget of CPUh. Such ensembles are essential for covariance estimation, simulation-based inference, and tests of fundamental physics.
Three directions follow naturally. The halo and galaxy statistics of sCOLA lightcones, in redshift space, remain to be validated against a full -body reference, since it is halos, not the matter field, that mock catalogues are built from; there, ten time steps may not suffice, since even a 20-step COLA integrator, which describes the density field around the most massive clusters accurately, does not yield converged virial masses for them (Stopyra et al. (2024)). The accuracy limit set by the particle-mesh force model, visible at , could be pushed to smaller scales by a more accurate short-range gravitational solver. Finally, the present framework could be combined with an emulated frame of reference to further reduce its computational cost without sacrificing asymptotic convergence to the physical solution (see Bartlett et al. (2025)). With these in hand, producing the ensembles of galaxy mock catalogues that Stage-IV surveys call for becomes a question of allocation rather than of method.
LPT buffer
Leclercq et al. (2020) quantified the error caused by the sCOLA approximations on the density field and on the gravitational boundary conditions (their Fig. 7). The dominant source of error was the approximation on the density field . The discrepancy between and is mostly due to the lack of particle inflow while the Lagrangian sCOLA box deforms (see Figure 1). This flow imbalance leads to defects in the gravitational potential near the boundaries of the box, which propagate as the simulation progresses. To address this issue, we implemented an additional buffer of particles around the sCOLA box, the LPT buffer, to approximate the missing inflow.
Particles in this LPT buffer follow the 2LPT trajectories of equation (5); no forces are computed for them. We compute the positions of the LPT-buffer particles on the fly, and project their mass onto the PM density grid using the same density assignment scheme as for particles of the sCOLA box (CiC here). Formally, using the notation of Leclercq et al. (2020), where denotes the density assignment operator, the set of particles of the sCOLA box, and that of the LPT buffer, we replaced the prescription (Leclercq et al. (2020), equation (19))
by
Figure 1 shows the overall structure of the new tiling scheme: each sCOLA box is composed of a tile and a buffer of particles (with PM trajectory), surrounded by an LPT buffer.
The LPT buffer must be wide enough to contain the particles that can enter the sCOLA box in the course of the run: its width should therefore exceed the distance a particle travels between the initial time and . That distance can be estimated within perturbation theory: at leading order the displacement is , so that the variance of one of its Cartesian components at is
where is the linear matter power spectrum at ; the second-order term contributes only a small correction to (Bouchet et al., 1995). For the cosmology of Section III A, equation (25) gives per Cartesian component. The LPT buffer adopted in this work, , that is layers of particles (Section III D), therefore covers about , and so accounts for the inflow of the large majority of the particles that cross the boundary of the sCOLA box. The residual effect of this approximation on the power spectrum is quantified in Appendix C.
Second-order gravitational potential approximation term 2
We start the derivation from the Vlasov–Poisson system in the single-stream regime
where absorbs the usual normalisation .
We consider the case of an Einstein–de Sitter universe. In second-order Eulerian (standard) perturbation theory, the density contrast is , with
where
We aim at building Eulerian perturbation theory at second order in the gravitational potential, such that
with rather than as the fundamental field. The first term corresponds to the linearly-evolving potential (LEP) approximation. The potential and the linear density contrast are linked by the Poisson equation:
therefore coincides with , the gravitational potential that appears in first-order Lagrangian perturbation theory and obeys (in Lagrangian coordinates) . Furthermore, equations (B1) and (B5) require
From equations (B2) and (B6), we obtain the formal expression of as a convolution of :
where the kernel for the gravitational potential is related to the kernel for the density contrast by:
with . In an Einstein–de Sitter universe, is a purely spatial kernel (as is ).
We now express in terms of the kernels that correspond to the operators and , which are two quadratic invariants of that appear in LPT:
In Fourier space, in Lagrangian coordinates, we have
so the kernel for is
Since , the kernel for itself is
Furthermore, , so the kernel for is
Let us seek constants and such that
This equation is successively equivalent to:
using . Matching the independent terms in , and gives
which are mutually consistent and yield
The final result is
which corresponds in configuration space to the following expression for the gravitational potential at second order:
This expression is valid in Lagrangian coordinates. The boundary conditions are, however, required at the Eulerian positions of the faces of the sCOLA box, whereas and are known on the Lagrangian grid. Using the expression above with in place of amounts to neglecting the Jacobian of the transformation between the two sets of coordinates, which only affects the result at third order. Indeed, the displacement is of first order at leading order (equation (5)); therefore, any field that is already quadratic in satisfies
whose first correction is of third order. The same counting holds for the derivative operators, which satisfy and thus modify the equations defining and one order beyond the order at which they are used. Since third-order terms are in any case discarded in the second-order expansion of , keeping track of the Jacobian would not improve the accuracy of the approximation.
Accuracy gains from the LPT buffer and the second-order boundary conditions
With the LPT buffer added, sCOLA has two approximations with respect to tCOLA: (i) the trajectories of inflow particles are 2LPT trajectories rather than tCOLA
trajectories, and (ii) the boundary conditions on the gravitational potential are those of the approximation rather than the exact . We tested these two approximations separately, by replacing the trajectories of inflow particles by tCOLA trajectories, and the boundary conditions by the tCOLA potential. We found that once the LPT buffer is enabled, the dominant source of error is the boundary conditions on the potential; this is why we sought an approximation at second order.
Figure 8 quantifies the gain brought by each improvement on its own and by the two combined, in a simulation of particles in a box of . The sCOLA configuration is , and . Without either of them, sCOLA is within 3% of monolithic tCOLA on the power spectrum and the cross-correlations diverge at . The LPT buffer alone brings the power spectrum within 2% but leaves the cross-correlations unchanged, which shows that the missing inflow is not the only source of error. The second-order gravitational potential alone also brings the power spectrum within 2%, and pushes the divergence of the cross-correlations to . With both, the sCOLA power spectrum converges to that of tCOLA at large scales and stays within 1% of it, and the cross-correlations diverge at .
sCOLA configurations: tile and buffer optimal choices
The comparisons presented in this appendix are carried out on a dedicated test volume, which we refer to as the Micro simulation: a box of side with particles and PM grid cells per dimension, that is, the same mass and force resolutions as the Main and Mini simulations of Section III (, ). The cosmological parameters, the initial conditions, the starting scale factor and the 10 KDK time steps are also those of Section III; the simulation is evolved to and no lightcone is built. This volume is small enough to be run monolithically, which provides the tCOLA reference used below, and its side is divisible by all the tile sizes considered here.
To compare sCOLA configurations quantitatively, we define the distance of a configuration to the tCOLA reference as the sum of a distance on the power spectrum and one on the cross-correlations:
with the wavenumber bins, the maximum wavenumber considered, the number of modes below , and the sCOLA and tCOLA power spectra, and their cross-correlation.
sCOLA has two more parameters than a monolithic tCOLA simulation: the size of the tile and the size of the buffer . We keep the particle resolution (or equivalently the mass resolution) and the PM grid resolution fixed. When exploring the space, four constraints must be satisfied:
The number of tiles per axis must be an integer;
The number of particles per axis in the tile must be an integer;
The number of particles per axis in the buffer must be an integer;
The sCOLA box PM grid size must have a simple prime factor decomposition for the DST operations to be fast. More precisely, the potential in a sCOLA box is obtained with type-I DSTs, whose Dirichlet boundary planes lie one cell outside the stored grid: the grid holds cells and the logical size of the transform, which governs its cost, is . We therefore require this number to be 7-smooth, , and to be dominated by its factors of 2, in the sense that , each odd prime being weighted by the exponent of the power of 2 closest to it (3 , 5 , 7 ). When the requested grid does not satisfy this criterion, Simbelmÿne substitutes for it the smallest admissible size at or above it, at fixed PM cell size , so that the force resolution is left unchanged. The substitution is never downwards: an admissible size below , even when it is the closest one, would leave the PM grid too small to cover the sCOLA particle box, and its outermost particles would then receive no force and deposit only part of their mass.
For , , and the Micro volume defined above (, ), 72 sets of parameters satisfy these constraints. Running all of them is unnecessary: the quantities we are after — the trend of the distance to tCOLA with and , and the Pareto fronts of these traces — are smooth in both parameters, so a coarser sampling resolves them just as well. We therefore ran 35 configurations, thinning the grid while keeping the full extent of both ranges. Figure 9 and Figure 10 show the power spectra and cross-correlations of a subset of these configurations compared to tCOLA; Figure 11 and Figure 12 show, for all of them, the Pareto fronts of the distance to tCOLA against the oversimulation factor and the RAM usage.

Figure 9. sCOLA power spectra and cross-correlations for the Micro simulation at compared to tCOLA, for different tile sizes at a fixed buffer size . Increasing the tile size decreases the distance to tCOLA: the sCOLA approximation introduces a bump in the power spectrum, which moves towards smaller and loses amplitude as increases. The bump sits close to , the fundamental mode of the sCOLA box, shown as a vertical line for each configuration.

Figure 10. sCOLA power spectra and cross-correlations for the Micro simulation at compared to tCOLA, for different buffer sizes at a fixed tile size . Increasing the buffer size decreases the distance to tCOLA: as in Figure 9, the bump introduced by the sCOLA approximation moves towards smaller and loses amplitude as increases, and sits close to (vertical lines).
We compare the distance to tCOLA, defined in equation (50), to two cost measures: the oversimulation factor of equation (22), which is equivalent to the CPU seconds per million particles kept per step (CPU sec / M part kept / step); and the RAM required, which is equivalent to the number of particles in the sCOLA box, since both the particle arrays and the PM grids scale with the number of particles. The first equivalence holds if the cost per million particles evolved per step, counting those of the buffer, is the same for every configuration. We did not time the Micro configurations individually, so we take this as an assumption; its scale is set by the only sCOLA timing at our disposal, the CPU sec / M part / step measured on the Main boxes (Section IV C). Plotting each cost measure against the distance metric yields the Pareto fronts of Figure 11 and Figure 12. Minimising the oversimulation ratio (CPU sec / M part kept / step) and minimising the RAM usage at a given accuracy are conflicting objectives: the Pareto optimum for the former is the largest tiles, whereas for the latter it is the smallest tiles. Increasing the buffer size moves along the Pareto front. The effect on the Pareto fronts of the particle resolution , fixed here to (or equivalently of the mass resolution), is beyond the scope of this article.
The Pareto fronts of Figure 11 and Figure 12 can be used to choose the most efficient configuration as follows. First, determine the RAM available per sCOLA job (with 4 CPUs per job, the RAM associated with these 4 CPUs, for instance 2 GB). Then, set a target accuracy in terms of the distance metric (for instance, 1% accuracy corresponds approximately to ). These two constraints delimit an allowed region in the bottom-left corner of the RAM Pareto plot (Figure 12): at the mass resolution of this work, 2 GB allow at most particles per sCOLA box. Finally, among the configurations in this region, choose the one with the smallest oversimulation factor in Figure 11 (the lowest point). Here this is , , with an oversimulation factor of 1.59, the configuration discussed in § 4. Both Pareto fronts also show where the returns from enlarging the buffer stop: at every tile size, the distance to tCOLA improves sharply up to buffer and only marginally beyond, while the oversimulation factor keeps growing. With the LPT buffer and the second-order boundary conditions of § 2 C enabled, buffers of are therefore sufficient. In this work, we focused on the configuration , to demonstrate that such small tiles and buffers reach 1% accuracy on the power spectrum; larger tiles would however have been more efficient in terms of computing resources.
Equilateral bispectra
We used a fork of the DensityFieldTools code (Flöss, [33]) to compute the equilateral bispectra of the dark matter density fields of the Mini and Main simulations, using the following estimator:
with the overdensity field restricted to one bin, computed with a fast Fourier transform and its inverse; the number of equilateral triangles in the considered bin; the number of grid cells per dimension used for the Fourier transforms; the volume of the simulation box; and the estimated equilateral bispectrum of this bin.
Figure 13 compares the equilateral bispectra of sCOLA, tCOLA and Gadget4. sCOLA agrees with Gadget4 at the level up to .

Figure 13. Comparison of the matter density equilateral bispectra between Gadget4, sCOLA and tCOLA on the Mini and Main lightcone simulations, for 10 and 100 time steps ( variable). We plot the ratio to the reference Gadget4 bispectrum. The grey bands are 1% and 2% around Gadget4. sCOLA agrees with Gadget4 at the level up to .
The approximations have effects comparable to those observed on the power spectrum: the sCOLA tiling introduces a slight bump around the fundamental mode of the sCOLA box, ; the reduced number of time steps leads to an overall increase of the bispectrum with a divergence at small scales; and the PM force model results in a divergence around .
Velocity power spectra
We deposit the lightcone velocity field on a grid with the Simplex-in-Cell (SiC) projection (Hahn, Angulo & Abel, [44]; Leclercq et al. (2017)) already used in Section IV A, on the same grid as the density field, and compute its divergence in Fourier space with fast Fourier transforms. Figure 14 compares the velocity divergence power spectra of sCOLA, tCOLA and Gadget4, together with their cross-correlations with the overdensity field . The density–divergence cross-correlations and the divergence power spectrum of sCOLA agree with Gadget4 at the level up to . For both and the effects of the approximations are the same as on the matter power spectrum and bispectrum.

Figure 14. Velocity statistics of the Mini (left column) and Main (right column) lightcone simulations, for Gadget4, tCOLA and sCOLA. The top row shows the cross-spectrum between the velocity divergence and the matter density , the bottom row the divergence auto-spectrum ; both are plotted as ratios to the Gadget4 reference, and the grey bands mark 1% and 2% around it. Solid lines are runs with time steps and dashed lines runs with ; the monolithic tCOLA reference is available for the Mini volume only (Section III C). sCOLA agrees with Gadget4 at the 1.5% level up to .
Volume and cost of a Euclid north cap simulation
This appendix derives the two numbers quoted in § 4 C: the volume of the Euclid Galactic north cap relative to its bounding cube, and the cost of simulating that region with sCOLA.
We model the north cap as a truncated spherical cone sector. With the cosmological parameters of Section III A, the redshift range translates into the comoving range , with and , and the Galactic latitude cut into the opening angle . Integrating over the sector gives its volume,
Since the sector has an axis of symmetry, it fits most tightly in a cube whose main diagonal carries that axis. Let be the angle between that diagonal and any edge of the cube. Since , the direction of each edge falls inside the sector, which therefore reaches the distance along it; in the opposite direction it extends only to , on its rim. The side of the bounding cube is the sum of the two,
We find , so that the cap occupies a fraction of its bounding cube. The cost of simulating the cap with sCOLA follows. Only the tiles overlapping the footprint need to be evolved, which saves the factor , and over this redshift range the lightcone reduces the average number of time steps by a further factor , estimated from Figure 4. Writing for the number of particles in the bounding cube at the particle resolution , and for the cost per particle and per time step, the cost of one north cap simulation is
With , the oversimulation factor of the , configuration (equation (22)), and CPUh, which is the 4.6 CPU seconds per million particles per time step measured in Section IV C, this gives CPUh.
Statement of contribution
MA implemented the lightcone construction, the LPT buffer and the second-order boundary conditions in the sCOLA module of Simbelmynë, ran the simulations, performed the analysis, produced the figures, and wrote the first draft of the paper. FL conceived and designed the study, wrote the Simbelmynë code and the original sCOLA algorithm, did the analytic calculation of the second-order gravitational potential approximation term , contributed to the analysis and interpretation of the results, edited the manuscript, supervised MA, and secured funding. GL contributed to the design of the algorithm, in particular the LPT buffer, co-supervised MA, contributed to the interpretation of the results, contributed to writing the paper, and secured funding. All authors read and approved the final manuscript.
Declaration of generative AI use
Generative AI assistants were used to help develop and review parts of the Simbelmynë code, and to improve the clarity, style, and grammar of the manuscript. All AI-assisted code was reviewed by the authors and subjected to the same testing and validation procedures as manually written code. The authors take responsibility for the scientific content of the paper.
Acknowledgements
We thank Oliver Hahn, Andrew Jaffe, Cornelius Rampf and Benjamin Wandelt for useful discussions, and Ludvig Doeser for comments on the draft. This work was done within the Aquila Consortium (https://www.aquila-consortium.org/). This work has made use of the Infinity Cluster hosted by the Institut d’Astrophysique de Paris; we appreciate the efforts of Stéphane Rouberol for running the cluster smoothly. Infinity was supported by the Domaine d’Intérêt Majeur (DIM) ORIGINES of the Région Île-de-France. This work was granted access to the resources of the Très Grand Centre de calcul du CEA (TGCC) under the allocation A0190416910 made by GENCI. MA is funded by an AMX doctoral fellowship from the École polytechnique. MA, FL and GL acknowledge financial support from the Agence Nationale de la Recherche (ANR) through the grant INFOCW, under reference ANR-23-CE46-0006-01. FL and GL acknowledge financial support from the Centre National d’Études Spatiales (CNES), and from the Simons Collaboration on “Learning the Universe”.
This work made use of Gadget4 (wwwmpa.mpa-garching.mpg.de/gadget4, (Springel et al., 2021)), MUSIC2-monofonIC (github.com/cosmo-sims/monofonIC, (Hahn et al., 2020)), CLASS (class-code.net, [70]) and Simbelmynë (git.aquila-consortium.org/Aquila-Consortium/simbelmyne, (Leclercq, Jasche & Wandelt, 2015)), as well as NumPy ([98]), SciPy ((Virtanen et al., 2020)) and Matplotlib ([53]). The figures use the scientific colour maps of Crameri ((2021)) and the CMasher package ([97]).
References
- [1](Abel, Hahn & Kaehler, 2012) T. Abel, O. Hahn, R. Kaehler, Tracing the dark matter sheet in phase space, Mon. Not. R. Astron. Soc. 427, 61 (2012), arXiv:1111.3944 [astro-ph.CO].DOI
- [5](Angulo & Hahn, 2022) R. E. Angulo, O. Hahn, Large-scale dark matter simulations, Living Reviews in Computational Astrophysics 8, 1 (2022), arXiv:2112.05165 [astro-ph.CO].DOI
- [6](Bagla & Padmanabhan, 1994) J. S. Bagla, T. Padmanabhan, Non-linear Evolution of Density Perturbations Using the Approximate Gravitational Potential, Mon. Not. R. Astron. Soc. 266, 227 (1994), arXiv:gr-qc/9304021 [gr-qc].
- [7](Bairagi, Wandelt & Villaescusa-Navarro, 2025) A. Bairagi, B. D. Wandelt, F. Villaescusa-Navarro, The BIG SOBOL SEQUENCE: How many simulations do we need for simulation-based inference in cosmology?, Astron. & Astrophys. 703, A301 (2025), arXiv:2503.13755 [astro-ph.CO].DOI
- [11](Behroozi, Wechsler & Wu, 2013) P. S. Behroozi, R. H. Wechsler, H.-Y. Wu, The ROCKSTAR Phase-space Temporal Halo Finder and the Velocity Offsets of Cluster Cores, Astrophys. J. 762, 109 (2013), arXiv:1110.4372 [astro-ph.CO].DOI
- [15](Brainerd, Scherrer & Villumsen, 1993) T. G. Brainerd, R. J. Scherrer, J. V. Villumsen, Linear Evolution of the Gravitational Potential: A New Approximation for the Nonlinear Evolution of Large-Scale Structure, Astrophys. J. 418, 570 (1993).DOI
- [16](Breton & Reverdy, 2022) M.-A. Breton, V. Reverdy, Magrathea-Pathfinder: a 3D adaptive-mesh code for geodesic ray tracing in N-body simulations, Astron. & Astrophys. 662, A114 (2022), arXiv:2111.08744 [astro-ph.CO].arxiv.org/abs/2111.08744
- [18](Chen & Yu, 2024) Z. Chen, Y. Yu, Box replication effects in weak lensing light-cone construction, Mon. Not. R. Astron. Soc. 534, 1205 (2024), arXiv:2312.05117 [astro-ph.CO].DOI
- [21](de Santi et al., 2023) N. S. M. de Santi, H. Shao, F. Villaescusa-Navarro, et al., Robust Field-level Likelihood-free Inference with Galaxies, Astrophys. J. 952, 69 (2023), arXiv:2302.14101 [astro-ph.CO].DOI
- [22](DESI Collaboration et al., 2024) DESI Collaboration, A. G. Adame, J. Aguilar, S. Ahlen, S. Alam, G. Aldering, D. M. Alexander, R. Alfarsy, C. Allende Prieto, M. Alvarez, et al., Validation of the Scientific Program for the Dark Energy Spectroscopic Instrument, Astron. J. 167, 62 (2024), arXiv:2306.06307 [astro-ph.CO].
- [23](Dodelson & Schneider, 2013) S. Dodelson, M. D. Schneider, The effect of covariance estimator error on cosmological parameter constraints, Phys. Rev. D 88, 063537 (2013), arXiv:1304.2593 [astro-ph.CO].DOI
- [24](Doeser, Ata & Jasche, 2025) L. Doeser, M. Ata, J. Jasche, Learning the Universe: learning to optimize cosmic initial conditions with non-differentiable structure formation models, Mon. Not. R. Astron. Soc. 542, 1403 (2025), arXiv:2502.13243 [astro-ph.CO].DOI
- [27](Euclid Collaboration et al., 2022a) Euclid Collaboration, S. Ilić, N. Aghanim, C. Baccigalupi, J. R. Bermejo-Climent, G. Fabian, L. Legrand, D. Paoletti, M. Ballardini, Archidiacono, et al., Euclid preparation. XV. Forecasting cosmological constraints for the Euclid and CMB joint analysis, Astron. & Astrophys. 657, A91 (2022a), arXiv:2106.08346 [astro-ph.CO].
- [28](Euclid Collaboration et al., 2022b) Euclid Collaboration, R. Scaramella, J. Amiaux, Y. Mellier, C. Burigana, C. S. Carvalho, J.-C. Cuillandre, A. Da Silva, A. Derosa, J. Dinis, et al., Euclid preparation. I. The Euclid Wide Survey, Astron. & Astrophys. 662, A112 (2022b), arXiv:2108.01201 [astro-ph.CO].
- [29](Euclid Collaboration et al., 2025) Euclid Collaboration, F. J. Castander, P. Fosalba, J. Stadel, D. Potter, J. Carretero, P. Tallada, Crespi, L. Pozzetti, M. Bolzonella, G. A. Mamon, et al., Euclid: V. The Flagship galaxy mock catalogue: A comprehensive simulation for the Euclid mission, Astron. & Astrophys. 697, A5 (2025), arXiv:2405.13495 [astro-ph.CO].
- [33](Flöss, 2023) T. Flöss, DensityFieldTools, https://github.com/tsfloss/DensityFieldTools (2023).
- [39](Garaldi, Nori & Baldi, 2020) E. Garaldi, M. Nori, M. Baldi, Dynamic zoom simulations: A fast, adaptive algorithm for simulating light-cones, Mon. Not. R. Astron. Soc. 499, 2685 (2020), arXiv:2005.05328 [astro-ph.CO].DOI
- [43](Hahn, Abel & Kaehler, 2013) O. Hahn, T. Abel, R. Kaehler, A new approach to simulating collisionless dark matter fluids, Mon. Not. R. Astron. Soc. 434, 1171 (2013), arXiv:1210.6652 [astro-ph.CO].DOI
- [44](Hahn, Angulo & Abel, 2015) O. Hahn, R. E. Angulo, T. Abel, The properties of cosmic velocity fields, Mon. Not. R. Astron. Soc. 454, 3920 (2015), arXiv:1404.2280 [astro-ph.CO].DOI
- [46](Hartlap, Simon & Schneider, 2007) J. Hartlap, P. Simon, P. Schneider, Why your model parameter confidences might be too optimistic. Unbiased estimation of the inverse covariance matrix, Astron. & Astrophys. 464, 399 (2007), arXiv:astro-ph/0608064 [astro-ph].
- [49](Hockney & Eastwood, 1981) R. W. Hockney, J. W. Eastwood, Computer Simulation Using Particles (McGraw-Hill, 1981).
- [50](Hogg, 1999) D. W. Hogg, Distance measures in cosmology (1999), arXiv:astro-ph/9905115 [astro-ph].
- [51](Hollowed, 2019) J. Hollowed, Lightcone Construction for HACC Cosmological Simulations with LANTERN (2019), arXiv:1906.08355 [astro-ph.CO].arxiv.org/abs/1906.08355
- [52](Howlett, Manera & Percival, 2015) C. Howlett, M. Manera, W. J. Percival, L-PICOLA: A parallel code for fast dark matter simulation, Astronomy and Computing 12, 109 (2015), arXiv:1506.03737 [astro-ph.CO].arxiv.org/abs/1506.03737
- [53](Hunter, 2007) J. D. Hunter, Matplotlib: A 2D Graphics Environment, Comput. Sci. Eng. 9, 90 (2007).DOI
- [54](Ishiyama, Fukushige & Makino, 2009) T. Ishiyama, T. Fukushige, J. Makino, GreeM: Massively Parallel TreePM Code for Large Cosmological N-body Simulations, Pub. Astron. Soc. Japan 61, 1319 (2009), arXiv:0910.0121 [astro-ph.IM].DOI
- [57](Izard, Fosalba & Crocce, 2018) A. Izard, P. Fosalba, M. Crocce, ICE-COLA: fast simulations for weak lensing observables, Mon. Not. R. Astron. Soc. 473, 3051 (2018), arXiv:1707.06312 [astro-ph.CO].DOI
- [58](Izard, Crocce & Fosalba, 2016) A. Izard, M. Crocce, P. Fosalba, ICE-COLA: towards fast and accurate synthetic galaxy catalogues optimizing a quasi-N-body method, Mon. Not. R. Astron. Soc. 459, 2327 (2016), arXiv:1509.04685 [astro-ph.CO].DOI
- [59](Jacobus, Tucci & Philcox, 2026) C. Jacobus, B. Tucci, O. Philcox, Emulating Cosmic Structure Formation with a Lagrangian Neural Cellular Automaton (2026), arXiv:2607.27320 [astro-ph.IM].arxiv.org/abs/2607.27320
- [63](Kitzbichler & White, 2007) M. G. Kitzbichler, S. D. M. White, The high-redshift galaxy population in hierarchical galaxy formation models, Mon. Not. R. Astron. Soc. 376, 2 (2007), arXiv:astro-ph/0609636 [astro-ph].DOI
- [66](Leclercq, 2015) F. Leclercq, Bayesian large-scale structure inference and cosmic web analysis, Ph.D. thesis, Institut d’Astrophysique de Paris (2015), arXiv:1512.04985 [astro-ph.CO].arxiv.org/abs/1512.04985
- [70](Lesgourgues, 2011) J. Lesgourgues, The Cosmic Linear Anisotropy Solving System (CLASS) I: Overview (2011), arXiv:1104.2932 [astro-ph.IM].arxiv.org/abs/1104.2932
- [72](Llinares, 2017) C. Llinares, The shrinking domain framework I: a new, faster, more efficient approach to cosmological simulations (2017), arXiv:1709.04706 [astro-ph.CO].
- [78](Planck Collaboration et al., 2020) Planck Collaboration, N. Aghanim, Y. Akrami, M. Ashdown, J. Aumont, C. Baccigalupi, M. Ballardini, A. J. Banday, R. B. Barreiro, N. Bartolo, et al., Planck 2018 results. VI. Cosmological parameters, Astron. & Astrophys. 641, A6 (2020), arXiv:1807.06209 [astro-ph.CO].
- [79](Potter, Stadel & Teyssier, 2017) D. Potter, J. Stadel, R. Teyssier, PKDGRAV3: beyond trillion particle cosmological simulations for the next era of galaxy surveys, Computational Astrophysics and Cosmology 4, 2 (2017), arXiv:1609.08621 [astro-ph.IM].arxiv.org/abs/1609.08621
- [82](Rampf, List & Hahn, 2025) C. Rampf, F. List, O. Hahn, BullFrog: multi-step perturbation theory as a time integrator for cosmological simulations, J. Cosmology Astropart. Phys. 2025, 020 (2025), arXiv:2409.19049 [astro-ph.CO].DOI
- [89](Stein, Alvarez & Bond, 2019) G. Stein, M. A. Alvarez, J. R. Bond, The mass-Peak Patch algorithm for fast generation of deep all-sky dark matter halo catalogues and its N-body validation, Mon. Not. R. Astron. Soc. 483, 2236 (2019), arXiv:1810.07727 [astro-ph.CO].DOI
- [91](Tassev & Zaldarriaga, 2012) S. Tassev, M. Zaldarriaga, Estimating CDM particle trajectories in the mildly non-linear regime of structure formation. Implications for the density field in real and redshift space, J. Cosmology Astropart. Phys. 2012, 011 (2012), arXiv:1203.5785 [astro-ph.CO].DOI
- [92](Tassev, Zaldarriaga & Eisenstein, 2013) S. Tassev, M. Zaldarriaga, D. J. Eisenstein, Solving large scale structure in ten easy steps with COLA, J. Cosmology Astropart. Phys. 2013, 036 (2013), arXiv:1301.0322 [astro-ph.CO].DOI
- [94](Taylor, Joachimi & Kitching, 2013) A. Taylor, B. Joachimi, T. Kitching, Putting the precision in precision cosmology: How accurate should your data covariance matrix be?, Mon. Not. R. Astron. Soc. 432, 1928 (2013), arXiv:1212.4359 [astro-ph.CO].DOI
- [95](Teyssier, 2002) R. Teyssier, Cosmological hydrodynamics with adaptive mesh refinement. A new high resolution code called RAMSES, Astron. & Astrophys. 385, 337 (2002), arXiv:astro-ph/0111367 [astro-ph].DOI
- [97](van der Velden, 2020) E. van der Velden, CMasher: Scientific colormaps for making accessible, informative and ’cmashing’ plots, The Journal of Open Source Software 5, 2004 (2020), arXiv:2003.01069 [esss.IV].DOI
- [98](van der Walt, Colbert & Varoquaux, 2011) S. van der Walt, S. C. Colbert, G. Varoquaux, The NumPy Array: A Structure for Efficient Numerical Computation, Comput. Sci. Eng. 13, 22 (2011), arXiv:1102.1523 [cs.MS].DOI
- [100](Wechsler & Tinker, 2018) R. H. Wechsler, J. L. Tinker, The Connection Between Galaxies and Their Dark Matter Halos, Ann. Rev. Astron. Astrophys. 56, 435 (2018), arXiv:1804.03097 [astro-ph.GA].
- [101](Wojtak, Hansen & Hjorth, 2011) R. Wojtak, S. H. Hansen, J. Hjorth, Gravitational redshift of galaxies in clusters as predicted by general relativity, Nature 477, 567 (2011), arXiv:1109.6571 [astro-ph.CO].DOI