For ease of accounting, constituents
can be organized in tree structures with nodes (called
neighborhoods) corresponding to localities, cities, coun-
ties, states and countries. In this case, localities, cities,
counties, states and countries form a natural hierarchy.
The leaf of the tree of neighborhoods is the smallest
cell of the census management, and can be congured
to correspond in real life to a block, a street or an area
small enough (relatively to the population density) such
that members can learn and easily verify residency of
their neighbors.

Formally a neighborhood is a tuple
(N, n, t, P, c, C, q), where N is the GID of the
neighborhood, C is the GID of a constituent supporting
the existence of this neighborhood, n is the name of
the neighborhood, t is its type/level (e.g., city, block,
unit), P is the GID of the parent neighborhood, and c is the list of expected
types of descendant levels under this neighborhood.
N = HASH(n, P, c) q = SIGN(SK(C),(n,P,c))

Back To Menu