diff --git a/src/t8_schemes/t8_default/t8_default_hex/t8_default_hex.cxx b/src/t8_schemes/t8_default/t8_default_hex/t8_default_hex.cxx
index 7c3c6fff8a..6b7d2b9213 100644
--- a/src/t8_schemes/t8_default/t8_default_hex/t8_default_hex.cxx
+++ b/src/t8_schemes/t8_default/t8_default_hex/t8_default_hex.cxx
@@ -197,7 +197,7 @@ t8_default_scheme_hex::element_get_ancestor_id (const t8_element_t *elem, const
 }
 
 int
-t8_default_scheme_hex::elements_are_family (t8_element_t *const *fam) const
+t8_default_scheme_hex::elements_are_family (const t8_element_t *const *fam) const
 {
 #if T8_ENABLE_DEBUG
   {
diff --git a/src/t8_schemes/t8_default/t8_default_hex/t8_default_hex.hxx b/src/t8_schemes/t8_default/t8_default_hex/t8_default_hex.hxx
index c24f60b53b..fa15dcb7e6 100644
--- a/src/t8_schemes/t8_default/t8_default_hex/t8_default_hex.hxx
+++ b/src/t8_schemes/t8_default/t8_default_hex/t8_default_hex.hxx
@@ -259,7 +259,7 @@ struct t8_default_scheme_hex: public t8_default_scheme_common<T8_ECLASS_HEX, t8_
    * \note level 0 elements do not form a family.
    */
   int
-  elements_are_family (t8_element_t *const *fam) const;
+  elements_are_family (const t8_element_t *const *fam) const;
 
   /** Compute the nearest common ancestor of two elements. That is,
    * the element with highest level that still has both given elements as
diff --git a/src/t8_schemes/t8_default/t8_default_line/t8_default_line.cxx b/src/t8_schemes/t8_default/t8_default_line/t8_default_line.cxx
index 39a9121d41..07e443650b 100644
--- a/src/t8_schemes/t8_default/t8_default_line/t8_default_line.cxx
+++ b/src/t8_schemes/t8_default/t8_default_line/t8_default_line.cxx
@@ -381,7 +381,7 @@ t8_default_scheme_line::element_get_ancestor_id (const t8_element_t *elem, int l
 }
 
 int
-t8_default_scheme_line::elements_are_family (t8_element_t *const *fam) const
+t8_default_scheme_line::elements_are_family (const t8_element_t *const *fam) const
 {
 #if T8_ENABLE_DEBUG
   int i;
diff --git a/src/t8_schemes/t8_default/t8_default_line/t8_default_line.hxx b/src/t8_schemes/t8_default/t8_default_line/t8_default_line.hxx
index 26122929e5..145c7ad949 100644
--- a/src/t8_schemes/t8_default/t8_default_line/t8_default_line.hxx
+++ b/src/t8_schemes/t8_default/t8_default_line/t8_default_line.hxx
@@ -271,7 +271,7 @@ struct t8_default_scheme_line: public t8_default_scheme_common<T8_ECLASS_LINE, t
    * \note level 0 elements do not form a family.
    */
   int
-  elements_are_family (t8_element_t *const *fam) const;
+  elements_are_family (const t8_element_t *const *fam) const;
 
   /** Compute the nearest common ancestor of two elements. That is,
    * the element with highest level that still has both given elements as
diff --git a/src/t8_schemes/t8_default/t8_default_prism/t8_default_prism.cxx b/src/t8_schemes/t8_default/t8_default_prism/t8_default_prism.cxx
index a8ff759cfe..c509b00fbc 100644
--- a/src/t8_schemes/t8_default/t8_default_prism/t8_default_prism.cxx
+++ b/src/t8_schemes/t8_default/t8_default_prism/t8_default_prism.cxx
@@ -251,7 +251,7 @@ t8_default_scheme_prism::element_extrude_face (const t8_element_t *face, t8_elem
 }
 
 int
-t8_default_scheme_prism::elements_are_family (t8_element_t *const *fam) const
+t8_default_scheme_prism::elements_are_family (const t8_element_t *const *fam) const
 {
 #if T8_ENABLE_DEBUG
   for (int i = 0; i < T8_DPRISM_CHILDREN; i++) {
diff --git a/src/t8_schemes/t8_default/t8_default_prism/t8_default_prism.hxx b/src/t8_schemes/t8_default/t8_default_prism/t8_default_prism.hxx
index e7079f3cb3..03bb78979b 100644
--- a/src/t8_schemes/t8_default/t8_default_prism/t8_default_prism.hxx
+++ b/src/t8_schemes/t8_default/t8_default_prism/t8_default_prism.hxx
@@ -260,7 +260,7 @@ struct t8_default_scheme_prism: public t8_default_scheme_common<T8_ECLASS_PRISM,
    * \note level 0 elements do not form a family.
    */
   int
-  elements_are_family (t8_element_t *const *fam) const;
+  elements_are_family (const t8_element_t *const *fam) const;
 
   /** Compute the nearest common ancestor of two elements. That is, the element with highest level that still has
    * both given elements as descendants.
diff --git a/src/t8_schemes/t8_default/t8_default_pyramid/t8_default_pyramid.cxx b/src/t8_schemes/t8_default/t8_default_pyramid/t8_default_pyramid.cxx
index 323090b303..816c6e1076 100644
--- a/src/t8_schemes/t8_default/t8_default_pyramid/t8_default_pyramid.cxx
+++ b/src/t8_schemes/t8_default/t8_default_pyramid/t8_default_pyramid.cxx
@@ -256,7 +256,7 @@ t8_default_scheme_pyramid::element_set_linear_id (t8_element_t *elem, int level,
 }
 
 int
-t8_default_scheme_pyramid::elements_are_family (t8_element_t *const *fam) const
+t8_default_scheme_pyramid::elements_are_family (const t8_element_t *const *fam) const
 {
 #if T8_ENABLE_DEBUG
   const int num_siblings = element_get_num_siblings (fam[0]);
diff --git a/src/t8_schemes/t8_default/t8_default_pyramid/t8_default_pyramid.hxx b/src/t8_schemes/t8_default/t8_default_pyramid/t8_default_pyramid.hxx
index f8d81486a8..529cd6ef96 100644
--- a/src/t8_schemes/t8_default/t8_default_pyramid/t8_default_pyramid.hxx
+++ b/src/t8_schemes/t8_default/t8_default_pyramid/t8_default_pyramid.hxx
@@ -275,7 +275,7 @@ struct t8_default_scheme_pyramid: public t8_default_scheme_common<T8_ECLASS_PYRA
    * \note level 0 elements do not form a family.
    */
   int
-  elements_are_family (t8_element_t *const *fam) const;
+  elements_are_family (const t8_element_t *const *fam) const;
 
   /** Compute the nearest common ancestor of two elements. That is, the element with highest level that still has both
    * given elements as descendants.
diff --git a/src/t8_schemes/t8_default/t8_default_quad/t8_default_quad.cxx b/src/t8_schemes/t8_default/t8_default_quad/t8_default_quad.cxx
index 071b6acdd0..1e999ae61c 100644
--- a/src/t8_schemes/t8_default/t8_default_quad/t8_default_quad.cxx
+++ b/src/t8_schemes/t8_default/t8_default_quad/t8_default_quad.cxx
@@ -235,7 +235,7 @@ t8_default_scheme_quad::element_get_ancestor_id (const t8_element_t *elem, int l
 }
 
 int
-t8_default_scheme_quad::elements_are_family (t8_element_t *const *fam) const
+t8_default_scheme_quad::elements_are_family (const t8_element_t *const *fam) const
 {
 #if T8_ENABLE_DEBUG
   for (int i = 0; i < P4EST_CHILDREN; i++) {
diff --git a/src/t8_schemes/t8_default/t8_default_quad/t8_default_quad.hxx b/src/t8_schemes/t8_default/t8_default_quad/t8_default_quad.hxx
index a6e107417c..23a99d4c5e 100644
--- a/src/t8_schemes/t8_default/t8_default_quad/t8_default_quad.hxx
+++ b/src/t8_schemes/t8_default/t8_default_quad/t8_default_quad.hxx
@@ -295,7 +295,7 @@ struct t8_default_scheme_quad: public t8_default_scheme_common<T8_ECLASS_QUAD, t
    * \note level 0 elements do not form a family.
    */
   int
-  elements_are_family (t8_element_t *const *fam) const;
+  elements_are_family (const t8_element_t *const *fam) const;
 
   /** Compute the nearest common ancestor of two elements. That is,
    * the element with highest level that still has both given elements as
diff --git a/src/t8_schemes/t8_default/t8_default_tet/t8_default_tet.cxx b/src/t8_schemes/t8_default/t8_default_tet/t8_default_tet.cxx
index 0a239e09ec..668b8cbbf4 100644
--- a/src/t8_schemes/t8_default/t8_default_tet/t8_default_tet.cxx
+++ b/src/t8_schemes/t8_default/t8_default_tet/t8_default_tet.cxx
@@ -169,7 +169,7 @@ t8_default_scheme_tet::element_get_ancestor_id (const t8_element_t *elem, int le
 }
 
 int
-t8_default_scheme_tet::elements_are_family (t8_element_t *const *fam) const
+t8_default_scheme_tet::elements_are_family (const t8_element_t *const *fam) const
 {
 #if T8_ENABLE_DEBUG
   for (int i = 0; i < T8_DTET_CHILDREN; i++) {
diff --git a/src/t8_schemes/t8_default/t8_default_tet/t8_default_tet.hxx b/src/t8_schemes/t8_default/t8_default_tet/t8_default_tet.hxx
index cde4d5fdbd..dfb6876e7a 100644
--- a/src/t8_schemes/t8_default/t8_default_tet/t8_default_tet.hxx
+++ b/src/t8_schemes/t8_default/t8_default_tet/t8_default_tet.hxx
@@ -244,7 +244,7 @@ struct t8_default_scheme_tet: public t8_default_scheme_common<T8_ECLASS_TET, t8_
    * \note level 0 elements do not form a family.
    */
   int
-  elements_are_family (t8_element_t *const *fam) const;
+  elements_are_family (const t8_element_t *const *fam) const;
 
   /** Compute the nearest common ancestor of two elements. That is, the element with highest level that still has both
    * given elements as descendants.
diff --git a/src/t8_schemes/t8_default/t8_default_tri/t8_default_tri.cxx b/src/t8_schemes/t8_default/t8_default_tri/t8_default_tri.cxx
index 70da181ee7..0c26f95c32 100644
--- a/src/t8_schemes/t8_default/t8_default_tri/t8_default_tri.cxx
+++ b/src/t8_schemes/t8_default/t8_default_tri/t8_default_tri.cxx
@@ -184,7 +184,7 @@ t8_default_scheme_tri::element_get_ancestor_id (const t8_element_t *elem, int le
 }
 
 int
-t8_default_scheme_tri::elements_are_family (t8_element_t *const *fam) const
+t8_default_scheme_tri::elements_are_family (const t8_element_t *const *fam) const
 {
 #if T8_ENABLE_DEBUG
   {
diff --git a/src/t8_schemes/t8_default/t8_default_tri/t8_default_tri.hxx b/src/t8_schemes/t8_default/t8_default_tri/t8_default_tri.hxx
index 5181ab6fe0..0ae793adf2 100644
--- a/src/t8_schemes/t8_default/t8_default_tri/t8_default_tri.hxx
+++ b/src/t8_schemes/t8_default/t8_default_tri/t8_default_tri.hxx
@@ -243,7 +243,7 @@ struct t8_default_scheme_tri: public t8_default_scheme_common<T8_ECLASS_TRIANGLE
    * \note level 0 elements do not form a family.
    */
   int
-  elements_are_family (t8_element_t *const *fam) const;
+  elements_are_family (const t8_element_t *const *fam) const;
 
   /** Compute the nearest common ancestor of two elements. That is, the element with highest level that still has both
    * given elements as descendants.
diff --git a/src/t8_schemes/t8_default/t8_default_vertex/t8_default_vertex.cxx b/src/t8_schemes/t8_default/t8_default_vertex/t8_default_vertex.cxx
index f773a8f407..47c1e53552 100644
--- a/src/t8_schemes/t8_default/t8_default_vertex/t8_default_vertex.cxx
+++ b/src/t8_schemes/t8_default/t8_default_vertex/t8_default_vertex.cxx
@@ -173,7 +173,7 @@ t8_default_scheme_vertex::element_get_ancestor_id ([[maybe_unused]] const t8_ele
 }
 
 int
-t8_default_scheme_vertex::elements_are_family (t8_element_t *const *fam) const
+t8_default_scheme_vertex::elements_are_family (const t8_element_t *const *fam) const
 {
 #if T8_ENABLE_DEBUG
   for (int i = 0; i < T8_DVERTEX_CHILDREN; i++) {
diff --git a/src/t8_schemes/t8_default/t8_default_vertex/t8_default_vertex.hxx b/src/t8_schemes/t8_default/t8_default_vertex/t8_default_vertex.hxx
index 894c7a5b66..752455e7f7 100644
--- a/src/t8_schemes/t8_default/t8_default_vertex/t8_default_vertex.hxx
+++ b/src/t8_schemes/t8_default/t8_default_vertex/t8_default_vertex.hxx
@@ -263,7 +263,7 @@ struct t8_default_scheme_vertex: public t8_default_scheme_common<T8_ECLASS_VERTE
    * \note level 0 elements do not form a family.
    */
   int
-  elements_are_family (t8_element_t *const *fam) const;
+  elements_are_family (const t8_element_t *const *fam) const;
 
   /** Compute the nearest common ancestor of two elements. That is,
    * the element with highest level that still has both given elements as
diff --git a/src/t8_schemes/t8_scheme.hxx b/src/t8_schemes/t8_scheme.hxx
index fdaf9510c4..319a70bb1b 100644
--- a/src/t8_schemes/t8_scheme.hxx
+++ b/src/t8_schemes/t8_scheme.hxx
@@ -532,7 +532,7 @@ struct t8_scheme
    * \note level 0 elements do not form a family.
    */
   inline bool
-  elements_are_family (const t8_eclass_t tree_class, t8_element_t *const *fam) const
+  elements_are_family (const t8_eclass_t tree_class, const t8_element_t *const *fam) const
   {
     return std::visit ([&] (auto &&scheme) { return scheme.elements_are_family (fam); }, eclass_schemes[tree_class]);
   };
diff --git a/src/t8_schemes/t8_standalone/t8_standalone_implementation.hxx b/src/t8_schemes/t8_standalone/t8_standalone_implementation.hxx
index c11e37cc3a..5255538575 100644
--- a/src/t8_schemes/t8_standalone/t8_standalone_implementation.hxx
+++ b/src/t8_schemes/t8_standalone/t8_standalone_implementation.hxx
@@ -577,7 +577,7 @@ struct t8_standalone_scheme: public t8_scheme_helpers<TEclass, t8_standalone_sch
    * \note level 0 elements do not form a family.
    */
   static constexpr int
-  elements_are_family (t8_element_t *const *fam) noexcept
+  elements_are_family (const t8_element_t *const *fam) noexcept
   {
 #if T8_ENABLE_DEBUG
     const int num_siblings = element_get_num_siblings (fam[0]);