---
title: Distinct Circular Subsum Sequences (DCSS)
url: https://www.emergentmind.com/topics/distinct-circular-subsum-sequences-dcss
type: topic
---

# Distinct Circular Subsum Sequences (DCSS)

Distinct Circular Subsum Sequences (DCSS) denote, in the most technically developed recent usage, modular sequences whose circular subsums are unique modulo a fixed length \(n\), so that their cumulative offsets can be used as noncolliding shift patterns for error localization and correction. In README, DCSS form the combinatorial core of the ERror PAinting (ERPA) module, which spreads the bit-error pattern of one 64-bit watermark patch into another patch and permits subsequent recovery even when the painted pattern is itself corrupted under distortion [2507.04495]. In the literature summarized here, the same expression also appears in a separate permutation-based sense tied to two distinct local sums on a circle, while adjacent work on sequenceability studies orderings in cyclic groups with distinct partial sums [2001.06162], [2203.16658].

## 1. Terminological scope

In the sources considered here, “DCSS” is not a single standardized object. The term is used for at least two non-equivalent constructions, and a nearby line of work studies distinct partial sums in cyclic groups without using the README definition.

| Source | Underlying object | Core distinctness requirement |
|---|---|---|
| README [2507.04495] | A sequence \(S=(s_1,\dots,s_L)\) of positive integers summing to \(n\) | Every nonempty circular subsum is unique modulo \(n\) |
| Cyclic-group sequenceability [2203.16658] | An ordering of a subset of \(G\setminus\{0\}\) | Partial sums are distinct, with possible \(y_0=y_k=0\) in the rotational case |
| Two-sum permutation usage [2001.06162] | A permutation of \(\{1,2,\dots,n\}\) on a circle | Three-term local sums at positions \(1 \bmod 4\) and \(3 \bmod 4\) are constant but unequal |

A common misconception is to treat these as interchangeable formulations. The available sources do not support that interpretation. The README object is an offset-design device for robust watermark decoding; the cyclic-group literature concerns sequenceability and distinct partial sums in finite abelian groups; and the permutation-based usage concerns circular arrangements with two prescribed local-sum classes.

## 2. Formal definition in README

Let \(n\) be the length of a bit-string; in README, \(n=64\). A DCSS is a sequence
\[
S=(s_1,s_2,\dots,s_L),\quad s_i\in\mathbb N,\quad \sum_{i=1}^L s_i=n,
\]
together with cumulative offsets
\[
D=\bigl\{d_0=0,\;d_1=s_1,\;d_2=s_1+s_2,\;\dots,\;d_L=s_1+\cdots+s_L=n\bigr\}
\]
considered modulo \(n\). The defining property is that for every pair of index ranges \([i,j)\) and \([k,\ell)\) with
\[
0\le i<j\le L,\quad 0\le k<\ell\le L,\quad (i,j)\neq(k,\ell),
\]
one has
\[
\sum_{r=i}^{j-1}s_r \not\equiv \sum_{r=k}^{\ell-1}s_r \pmod n.
\]
Equivalently,
\[
(d_j-d_i)\bmod n \neq (d_\ell-d_k)\bmod n \quad \forall\;(i,j)\neq(k,\ell).
\]
In words, every nonempty circular subsum of \(S\) is unique modulo \(n\) [2507.04495].

In practical use, README does not paint with the raw \(s_i\) but with the prefix sums. The offset set is
\[
D_{\rm offset}=\{d_0,d_1,\dots,d_{L-1}\},
\]
and an error at position \(i\) is shifted to
\[
\bigl\{(i+d)\bmod n\mid d\in D_{\rm offset}\bigr\}.
\]
This formulation is operational rather than purely structural: uniqueness of circular subsums is converted directly into a family of distinguishable modular shift patterns.

## 3. Error painting and inversion in ERPA

In README, a watermark decoder extracts a 64-bit message \(\tilde m\) from patch \(A\), and the bit-error pattern relative to the ground truth \(m\) is
\[
e=m\oplus \tilde m\in\{0,1\}^{64}.
\]
The stated motivation is that naively re-embedding the 64-bit vector \(e\) into a second patch \(B\) would leave further flips in \(B\) able to scramble the information needed to identify which bits in \(A\) were wrong. DCSS address this by spreading each single-bit error across a fixed subset of positions chosen so that no two different subsets can collide when viewed modulo 64 [2507.04495].

The ERPA painting map is defined by
\[
\text{shift}(S,i)=\{(i+d)\bmod 64\mid d\in D_{\rm offset}\},
\]
and the painted sequence is
\[
e'=\bigvee_{i=0}^{63}\Bigl[e_i\wedge \mathbf{1}_{\text{shift}(S,i)}\Bigr],
\]
where \(\mathbf 1_X\) denotes the binary mask with ones at positions in \(X\), and \(\bigvee\) is bitwise OR. This 64-bit \(e'\) is embedded into patch \(B\). After re-decoding \(B\) under distortion, a noisy \(\tilde e'\) is obtained and passed to a small neural decoder
\[
\mathrm{Dec}:\{0,1\}^{64}\to[0,1]^{64},
\]
implemented as a single \(64\times64\) linear layer plus sigmoid, to produce \(\hat e\). The corrected main message is then
\[
\hat m=\tilde m\oplus \hat e.
\]

The significance of the circular-subsum condition is localized invertibility under corruption. README states that the distinct circular subsum property guarantees that even if some of the painted bits are corrupted, a noise-robust decoder can still invert the painting map and recover the original indices of the flipped bits.

## 4. Construction for \(n=64\) and empirical behavior

For \(n=64\), README uses a concrete DCSS of length \(L=7\):
\[
S=\{1,2,4,5,8,10,34\},\quad \sum S=64.
\]
Its cumulative offsets are
\[
D_{\rm offset}=\{0,1,3,7,12,20,30\},
\]
all taken modulo 64. The summary describes a simple greedy search: starting from \(S=\emptyset\), one scans \(k=1\) to \(n\), appending \(k\) whenever doing so keeps \(\sum S\le n\) and preserves distinctness of all nonempty circular subsums modulo \(n\); in practice, one also prunes early and backtracks, and the reported outcome is the maximal-length DCSS above [2507.04495].

With this choice, any single-bit error at position \(i\) is spread to exactly seven positions. For the illustrative example \(i=10\),
\[
\mathrm{shift}(S,10)=\{10,11,13,17,22,30,40\}.
\]
README states that if JPEG noise flips at most two of those seven bits, the neural decoder still recognizes the pattern as coming from \(i=10\), and so recovers \(e_{10}=1\). More generally, the neural decoder is reported to tolerate roughly \(5\%\)–\(10\%\) random bit flips in \(e'\) with over \(99\%\) accuracy. Tables 3–5 are described as reporting BER and Z.B.I.R. as functions of painting density \(L\), noise probability \(p\), permutation strategy, and decoder training distribution. One specific operating point is \(L=7\) with Bernoulli(\(p=0.07\)) training, for which the average BER is \(0.1395\%\) and Z.B.I.R. is \(86.3\%\) under JPEG(50), versus \(1.2\%\) Z.B.I.R. without ERPA.

At the image level, README embeds a 2048-bit RSA/ECDSA signature across 32 “message” patches \(A\) and 32 “error-painting” patches \(B\) in a \(1024\times1024\) image. Under JPEG-50, the reported numbers are Z.B.I.R.\(=1.2\%\), BER\(\approx0.668\%\) without ERPA, and Z.B.I.R.\(=86.3\%\), BER\(\approx0.140\%\) with ERPA using DCSS and Bernoulli(\(p=0.07\)) training; under near-ideal conditions with no external distortion, ERPA pushes Z.B.I.R. to \(100\%\). The same summary describes this as yielding near-perfect full 2048-bit signature recovery and as making README the first framework to embed 2048-bit cryptographic signatures in images with high assurance of zero-bit-error extraction.

## 5. Relation to distinct partial sums and sequenceability

A nearby combinatorial framework is the theory of sequenceability in finite abelian groups. For a finite abelian group \(G\) and a subset \(S\subseteq G\setminus\{0\}\) of size \(k\), an ordering \((x_1,\dots,x_k)\) has partial sums
\[
y_0=0,\quad y_i=\sum_{j=1}^i x_j.
\]
It is a linear sequencing if \(y_0,y_1,\dots,y_k\) are all distinct, and a rotational sequencing if the only repetition is \(y_0=y_k=0\). A subset is sequenceable if it admits either a linear sequencing or a rotational sequencing, and a group is strongly sequenceable if every nonzero subset is sequenceable [2203.16658].

The 2022 results establish sequenceability for many subsets of \(\mathbb Z_n\setminus\{0\}\) when \(n=mt\). In particular, if \(n=pt\) with \(p\) prime, every subset \(S\subseteq\mathbb Z_n\setminus\{0\}\) of size \(k\) is sequenceable when \(k\le11\) and \(t\le5\), when \(k=12\) and \(t\le4\), and in several partial cases for \(13\le k\le15\). An asymptotic extension states that the same conclusions hold for \(n=mt\) when every prime divisor of \(m\) exceeds \(k!/2\). The proofs proceed by selecting a quotient sequencing in \(\mathbb Z_p\times\mathbb Z_t\), constructing a polynomial \(p_{\mathbf a}\), and applying Alon’s Combinatorial Nullstellensatz.

This literature does not define DCSS in the README sense, but it studies a related noncollision phenomenon: modular cumulative sums are required not to repeat. A plausible implication is that README’s circular-offset design belongs to a broader combinatorial tradition in which the uniqueness of cumulative modular structure is the crucial resource. The distinction remains important: sequenceability concerns orderings of group elements, whereas README DCSS concern integer compositions of \(n\) whose circular subsums produce a usable offset set.

## 6. Alternative permutation-based usage and open directions

A separate source uses “Distinct Circular Subsum Sequence” for a permutation-based object derived from work on “two-sum” sequences. In that formulation, for \(n\ge3\), a DCSS of length \(n\) is a permutation
\[
(a_1,a_2,\dots,a_n)
\]
of \(\{1,2,\dots,n\}\) such that, with indices taken modulo \(n\) and
\[
S_i=a_{i-1}+a_i+a_{i+1},
\]
there exist two integers \(x\neq y\) for which \(S_i=x\) whenever \(i\equiv1\pmod4\) and \(S_j=y\) whenever \(j\equiv3\pmod4\). The stated existence theorem is that for every integer \(n\ge3\), \(n\neq7\), there exists such a DCSS, with explicit constructions organized by congruence classes modulo \(8\) and with \(n=7\) as the sole exception [2001.06162].

The same summary gives concrete examples. For \(n=5\),
\[
\Pi_5=(4,1,5,2,3),
\]
with \(x=5\) and \(y=8\). For \(n=10\),
\[
\Pi_{10}=(9,7,3,1,10,5,4,2,8,6),
\]
with \(x=16\) and \(y=11\). It also states that these two-sum sequences arise from a local antimagic total labeling of a path, and that similar phenomena can be studied on cycles, wheels, and other graph families. Lau is reported to conjecture and in part prove that one can force more than two distinct sums under more general mod-\(k\) congruence conditions, leaving open the systematic treatment of \(k\)-sum sequences for \(k\ge3\).

Taken together, the sources support a careful, non-unified view of the term. In README, DCSS are a modular offset design for robust digital-signature watermarking; in the sequenceability literature, the closest analogue is the study of distinct partial sums in cyclic groups; and in the two-sum literature, DCSS refer to a different circular permutation problem. The shared theme is distinctness of modular or circularly indexed sum structures, but the objects, constraints, and applications differ substantially.

Source: https://www.emergentmind.com/topics/distinct-circular-subsum-sequences-dcss