fss::GrottoDcf< in_bits, Prg, In >::ParityTreeView Struct Reference

Borrowed, read-only parity tree in level order. More...

Public Attributes
const bool *	p
	Borrowed parity entries, including leaves.

Detailed Description

template<int in_bits, typename Prg, typename In = uint>
struct fss::GrottoDcf< in_bits, Prg, In >::ParityTreeView

Borrowed, read-only parity tree in level order.

For N = 2^in_bits, p has 2*N-1 bool entries. Root is p[0], leaf x is p[N-1+x], and internal node j is p[2*j+1] XOR p[2*j+2]. The array payload uses (2*N-1) * sizeof(bool) bytes per party. Keeping both parties' trees uses twice that amount. For in_bits = 8, each tree has 511 bool entries, not 256. Keys, evaluation outputs, allocator overhead, and temporary storage used internally by GPU full-domain evaluation are separate. The view does not own storage or transfer it between host and device. Its storage must remain alive and accessible in the execution space of Eval().

---

The documentation for this struct was generated from the following file:

• include/fss/grotto_dcf.cuh