Skip to main content

F4QuotientShape

Struct F4QuotientShape 

Source
pub struct F4QuotientShape<const COMPONENT_LABEL_BYTES: usize>;
Expand description

F₄-via-quotient composition shape — the unary quotient construction on the Atlas image inside E₈ per wiki [ADR-059]’s categorical-operation vocabulary.

F₄ is the rank-4 exceptional Lie algebra reached from the Atlas by the 96 / ± mirror-symmetry quotient (48 sign classes). As a categorical operation, F₄ is a quotient of one Atlas structure under mirror symmetry — the shape is therefore unary by structural necessity: SITE_COUNT = COMPONENT_LABEL_BYTES. A single operand κ-label is canonicalized into its mirror-symmetry equivalence class before σ-projection.

The composed κ-label addresses the operand’s equivalence class under the quotient, not the operand directly. Two operands that are mirror-symmetric per the realization’s commitment compose to byte-identical composed κ-labels.

§See also

§Constraints

  • TC-01 — admission is compile-time.
  • TC-04 — bilateral compile-time enforcement.
  • ADR-013 — closure under uor-foundation.
  • ADR-017 — content-addressed identity via the IRI.
  • ADR-058 — κ-derivation produces the composed κ-label.
  • ADR-059 — codomain factors through the Atlas image inside E₈.
  • ADR-061 — operational composition surface for κ-labels.

§Behavior

use prism::pipeline::ConstrainedTypeShape;
use prism::std_types::F4QuotientShape;

// Given a unary F₄ quotient over one sha256 κ-label (71 bytes),
type F = F4QuotientShape<71>;
// When SITE_COUNT is queried,
// Then it equals the operand width — F₄'s quotient is unary.
assert_eq!(<F as ConstrainedTypeShape>::SITE_COUNT, 71);
assert_eq!(
    <F as ConstrainedTypeShape>::IRI,
    "https://uor.foundation/type/ConstrainedType",
);
assert!(<F as ConstrainedTypeShape>::CONSTRAINTS.is_empty());

Trait Implementations§

Source§

impl<const COMPONENT_LABEL_BYTES: usize> ConstrainedTypeShape for F4QuotientShape<COMPONENT_LABEL_BYTES>

Source§

const IRI: &'static str = "https://uor.foundation/type/ConstrainedType"

IRI of the ontology type:ConstrainedType instance this shape represents.
Source§

const SITE_COUNT: usize = COMPONENT_LABEL_BYTES

Number of sites (fields) this constrained type carries.
Source§

const CONSTRAINTS: &'static [ConstraintRef]

Per-site constraint list. Empty means unconstrained.
Source§

const CYCLE_SIZE: u64

ADR-032: cardinality of the shape’s value-set (the cycle structure of the shape under the substrate’s discrete-clock model). Used by the prism_model! macro to lower first_admit (closure-body grammar G16) to the correct descent measure. Conventions: Read more
Source§

const SITE_BUDGET: usize = Self::SITE_COUNT

Ontology-level siteBudget: count of data sites only, excluding bookkeeping introduced by composition (coproduct tag sites, etc.). Equals SITE_COUNT for leaf shapes and for shapes whose composition introduces no bookkeeping (products, cartesian products). Strictly less than SITE_COUNT for coproduct shapes and any shape whose SITE_COUNT includes inherited bookkeeping. Introduced by the Product/Coproduct Completion Amendment §4a; defaults to SITE_COUNT so pre-amendment shape impls remain valid without edits.

Auto Trait Implementations§

§

impl<const COMPONENT_LABEL_BYTES: usize> Freeze for F4QuotientShape<COMPONENT_LABEL_BYTES>

§

impl<const COMPONENT_LABEL_BYTES: usize> RefUnwindSafe for F4QuotientShape<COMPONENT_LABEL_BYTES>

§

impl<const COMPONENT_LABEL_BYTES: usize> Send for F4QuotientShape<COMPONENT_LABEL_BYTES>

§

impl<const COMPONENT_LABEL_BYTES: usize> Sync for F4QuotientShape<COMPONENT_LABEL_BYTES>

§

impl<const COMPONENT_LABEL_BYTES: usize> Unpin for F4QuotientShape<COMPONENT_LABEL_BYTES>

§

impl<const COMPONENT_LABEL_BYTES: usize> UnsafeUnpin for F4QuotientShape<COMPONENT_LABEL_BYTES>

§

impl<const COMPONENT_LABEL_BYTES: usize> UnwindSafe for F4QuotientShape<COMPONENT_LABEL_BYTES>

Blanket Implementations§

Source§

impl<T> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source§

impl<T> Same for T

Source§

type Output = T

Should always be Self
Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = Infallible

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.