Problem
RuVector already has a GaussianSplat bridge for point cloud clusters with center, color, opacity, scale, label, point count, and an optional dense trajectory. This is useful for rendering, but it is not an object centric memory abstraction and it grows poorly when downstream agents need persistent object identity, compact task context, and repeated spatial retrieval.
Fresh research: ParticleSplat, arXiv:2609.19463, submitted 2026-09-16, learns a compact set of 3D latent particles and decodes each particle into a local Gaussian field. The paper reports 73.0 percent overall success on single view RLBench versus 46.6 percent for its DLP ablation with the same policy, 83.0 percent on multi view RLBench versus 59.4 percent for DLP, and 56.1 percent on MimicGen versus 48.1 percent for 3D DLP. The representation uses 20 latent particles while its image plane Gaussian decoder uses 128 squared Gaussians, a nominal 819.2 to 1 latent count reduction before decoder expansion.
Sources:
https://arxiv.org/abs/2609.19463
https://lyuxinghe.github.io/ParticleSplat-website/
https://github.com/lyuxinghe/ParticleSplat
Important limitation: the official GitHub repository currently says the code release is coming soon. Do not add it as a dependency or claim reproduction yet.
Why it matters
RuVector should distinguish authoritative spatial state from compact task memory.
Exact geometry, timestamps, coordinate frames, covariance, track identity, and provenance should remain deterministic and witnessed. A small object centric particle index can then provide fast semantic retrieval, manipulation context, and browser or agent working memory without replacing the authoritative world representation.
Current architecture
crates/ruvector-robotics/src/bridge/gaussian.rs currently maps point cloud clusters to GaussianSplat values. Each Gaussian stores center, visual attributes, point count, semantic label, and a raw trajectory vector.
Recent RuVector HNSW fixes also restored exact stored point coverage and improved recall on measured benchmarks, so new spatial memory experiments should use the corrected index as their retrieval baseline rather than building a duplicate vector store.
Observed limitation
- No explicit object level memory identity above individual Gaussians.
- No compact object state that can reference a set of exact Gaussians and trajectories.
- Dense trajectory vectors grow with observation duration.
- Current viewer oriented representation does not carry uncertainty or source evidence at object granularity.
- Agents must either retrieve too much Gaussian state or rely on lossy semantic summaries.
Proposed architecture
Add an experimental SpatialParticle layer in ruvector-robotics or the existing spatial memory crate selected by architecture review.
A particle is an index over authoritative state, not a replacement for it.
Suggested fields:
- stable object or region id
- world frame id
- exact anchor center and covariance
- bounded extent or oriented box
- semantic embedding and optional bounded label set
- motion state summary with links to exact trajectory anchors
- list or range of authoritative Gaussian ids
- source RVF roots or retrieval receipt ids
- first seen and last seen timestamps
- confidence ceiling derived from source evidence
- representation version
The object centric layer may be compact and learned. Geometry and provenance remain exact.
Experiment arms
- Current dense
GaussianSplatCloud retrieval.
- Current Gaussian cloud plus deterministic object clustering.
- Exact object anchors plus compressed semantic particle embeddings.
- Optional learned particle encoder only after arms 1 through 3 establish a deterministic baseline.
Do not copy ParticleSplat architecture directly until its source and license are actually released and reviewed.
Benchmark plan
Use RuView or robotics sequences with object tracks and exact geometry. Include static objects, moving people, repeated occlusion, object reappearance, scene rearrangement, and long horizon operation.
Measure:
- bytes retained per object hour
- compression ratio against dense Gaussian and trajectory state
- object retrieval recall at k
- spatial center and extent error
- temporal last seen error
- task query success
- p50 and p95 retrieval latency
- index build and update latency
- peak memory
- browser WASM memory where exposed
- source receipt coverage
- deterministic output for the deterministic baseline
Success metrics
Promotion to production candidate requires all of:
- At least 10 times smaller task working memory than dense Gaussian plus trajectory retrieval on a 24 hour equivalent sequence.
- No more than 2 centimetres additional median geometry error because exact anchors remain authoritative.
- No more than 3 percentage points loss in object retrieval recall at k versus dense state.
- p95 retrieval below 50 milliseconds on x86 and below 100 milliseconds on the reference ARM64 edge device.
- 100 percent source evidence coverage for every particle returned as authoritative context.
- Zero confidence amplification above the strongest source evidence.
- WASM path, if implemented, remains within a documented memory ceiling and never gains file or network capability beyond the host contract.
Security and privacy
- Object particles can concentrate location and identity information, so privacy classification must be at least the maximum of their source state.
- Semantic labels and embeddings are untrusted residual data and cannot execute instructions or override exact state.
- Bound object counts, embedding dimensions, Gaussian references, and trajectory anchor counts to prevent memory exhaustion.
- Validate every RVF root or source receipt before returning an authoritative particle.
- Protect against object identity linkage across privacy domains.
- A malicious or poisoned learned encoder cannot modify authoritative geometry or provenance.
- Browser WASM serialization must reject oversized and non finite inputs.
Compatibility and migration
Additive experimental layer only. Existing Gaussian, HNSW, RVF, and viewer formats stay unchanged. No RVF wire change until a dedicated profile with golden fixtures and migration rules is justified by benchmark results.
MetaHarness plan
Use stable ruvnet/metaharness v0.4.4 with repository specific objectives for memory reduction, retrieval quality, geometry preservation, latency, determinism, and provenance coverage. Darwin may tune bounded clustering or admission thresholds only after a frozen real holdout is created. Any candidate that changes authoritative geometry, loses receipt coverage, or regresses corrected HNSW retrieval fails immediately.
Use RuVector native retrieval and WASM rather than introducing another vector database.
Rollback
Disable the particle feature flag and fall back to existing dense Gaussian and trajectory retrieval. No source data migration is required.
Definition of done
- ADR defining authoritative state versus particle residual state.
- Deterministic non learned baseline implementation.
- Unit, property, adversarial, serialization, and long horizon tests.
- x86, ARM64, and WASM benchmarks where supported.
- Before and after storage, recall, latency, and memory report across at least three repeated runs.
- Optional learned path only after open source license review and independent reproduction.
- MetaHarness evidence receipt bound to the exact tested commit.
Production classification
Experimental. The representation concept is promising, but the fresh upstream repository does not yet contain released code.
Problem
RuVector already has a
GaussianSplatbridge for point cloud clusters with center, color, opacity, scale, label, point count, and an optional dense trajectory. This is useful for rendering, but it is not an object centric memory abstraction and it grows poorly when downstream agents need persistent object identity, compact task context, and repeated spatial retrieval.Fresh research: ParticleSplat, arXiv:2609.19463, submitted 2026-09-16, learns a compact set of 3D latent particles and decodes each particle into a local Gaussian field. The paper reports 73.0 percent overall success on single view RLBench versus 46.6 percent for its DLP ablation with the same policy, 83.0 percent on multi view RLBench versus 59.4 percent for DLP, and 56.1 percent on MimicGen versus 48.1 percent for 3D DLP. The representation uses 20 latent particles while its image plane Gaussian decoder uses 128 squared Gaussians, a nominal 819.2 to 1 latent count reduction before decoder expansion.
Sources:
https://arxiv.org/abs/2609.19463
https://lyuxinghe.github.io/ParticleSplat-website/
https://github.com/lyuxinghe/ParticleSplat
Important limitation: the official GitHub repository currently says the code release is coming soon. Do not add it as a dependency or claim reproduction yet.
Why it matters
RuVector should distinguish authoritative spatial state from compact task memory.
Exact geometry, timestamps, coordinate frames, covariance, track identity, and provenance should remain deterministic and witnessed. A small object centric particle index can then provide fast semantic retrieval, manipulation context, and browser or agent working memory without replacing the authoritative world representation.
Current architecture
crates/ruvector-robotics/src/bridge/gaussian.rscurrently maps point cloud clusters toGaussianSplatvalues. Each Gaussian stores center, visual attributes, point count, semantic label, and a raw trajectory vector.Recent RuVector HNSW fixes also restored exact stored point coverage and improved recall on measured benchmarks, so new spatial memory experiments should use the corrected index as their retrieval baseline rather than building a duplicate vector store.
Observed limitation
Proposed architecture
Add an experimental
SpatialParticlelayer inruvector-roboticsor the existing spatial memory crate selected by architecture review.A particle is an index over authoritative state, not a replacement for it.
Suggested fields:
The object centric layer may be compact and learned. Geometry and provenance remain exact.
Experiment arms
GaussianSplatCloudretrieval.Do not copy ParticleSplat architecture directly until its source and license are actually released and reviewed.
Benchmark plan
Use RuView or robotics sequences with object tracks and exact geometry. Include static objects, moving people, repeated occlusion, object reappearance, scene rearrangement, and long horizon operation.
Measure:
Success metrics
Promotion to production candidate requires all of:
Security and privacy
Compatibility and migration
Additive experimental layer only. Existing Gaussian, HNSW, RVF, and viewer formats stay unchanged. No RVF wire change until a dedicated profile with golden fixtures and migration rules is justified by benchmark results.
MetaHarness plan
Use stable
ruvnet/metaharnessv0.4.4 with repository specific objectives for memory reduction, retrieval quality, geometry preservation, latency, determinism, and provenance coverage. Darwin may tune bounded clustering or admission thresholds only after a frozen real holdout is created. Any candidate that changes authoritative geometry, loses receipt coverage, or regresses corrected HNSW retrieval fails immediately.Use RuVector native retrieval and WASM rather than introducing another vector database.
Rollback
Disable the particle feature flag and fall back to existing dense Gaussian and trajectory retrieval. No source data migration is required.
Definition of done
Production classification
Experimental. The representation concept is promising, but the fresh upstream repository does not yet contain released code.