The codegree Turán density 
of an 
-uniform hypergraph 
is the limit of the largest possible
normalized minimum codegree 
over 
-vertex 
-uniform hypergraphs 
containing no copy of 
, as 
(Mubayi and Zhao 2007). Here 
is the minimum, over all 
-element subsets of the vertex set, of the number of hyperedges containing the subset.
The 3-uniform zycle 
has distinct vertices 
indexed modulo 
and hyperedges 
and 
(Piga and Schülke 2026). Wang (2026,
Theorem 1.1) proved that 
for even 
, with equality whenever 3 does not divide 
.
