t27.aiEnglish

GF48: сорок восемь битов

Вы узнаете

Как правило делит 48 битов на 1 + 18 + 29, ширину, которой нет в IEEE 754.

В GF48 48 битов: 1 знак, 18 порядка, 29 мантиссы, смещение 131071. В IEEE 754 нет 48-битного формата; правило строит его так же, как все остальные. Его отношение E / M равно 0.621, в 0.003 от 1 / phi.

Попробуйте

Найдите BIAS и EXP_MAX в gf48.t27 и сверьте с 2^17 - 1 и 2^18 - 1. Затем найдите три константы сдвига и скажите, какое поле ставит каждая.

Открыть интерактивный урок →

GoldenFloat 17: GF48, forty-eight bits
GoldenFloat 17: GF48, forty-eight bits ↗

GF48: 48 bits as the spec lays them out, read from gf48.t27. Lesson 17 of the GoldenFloat course.

specs/numeric/gf48.t27

// SPDX-License-Identifier: Apache-2.0
; gf48.t27 -- GoldenFloat48 Encode/Decode
; GF48: 48-bit floating point with 1 sign + 18 exponent + 29 mantissa
; Bit layout: [S(1) E(18) M(29)] = [47:47][46:29][28:0]
; phi^2 + 1/phi^2 = 3 | TRINITY
; Generated by the closed-form rule e = round((N-1)/phi^2), m = N-1-e.
; STATUS: Conj (closed-form rule, no RTL yet on this repo).

module triformat-gf48;

// ============================================================================
// Constants -- derived from the closed-form rule
// ============================================================================

pub const TOTAL_BITS : u16 = 48;
pub const SIGN_BITS  : u8 = 1;
pub const EXP_BITS   : u8 = 18;
pub const MANT_BITS  : u16 = 29;

pub const SIGN_SHIFT : u16 = 47;
pub const EXP_SHIFT  : u16 = 29;
pub const MANT_SHIFT : u16 = 0;

pub const BIAS    : u64 = 131071;        // 2^(E-1) - 1
pub const EXP_MAX : u64 = 262143;     // 2^E - 1

// E/M ratio (target: 1/phi ~ 0.6180339887)
pub const EM_RATIO   : f64 = 0.620689655172;
pub const PHI_DIST   : f64 = 0.002655666423;

pub const PHI_BIAS_STATUS : str = "OPEN -- not derivable from closed form; empirical per format";

// PHI_BIAS for this rung is NOT defined. The published formula
// PHI_BIAS = EXP_MAX - BIAS reproduces GF64 only and is RETRACTED as a general law.
// Do NOT invent a value via Fibonacci/Lucas/square coincidence; those are
// descriptive, not prescriptive.

// ============================================================================
// Invariants -- the Fpath below, made executable (W601)
//
// This file declared its own falsification path in a comment and nothing
// checked it. W600's per-test measurement found 38 specs that compile while
// asserting nothing; this is one, and the rule it is derived from is stated
// precisely enough to be a test.
// ============================================================================

invariant gf48_field_widths_partition_the_word {
    @compileAssert(SIGN_BITS + EXP_BITS + MANT_BITS == TOTAL_BITS);
}

invariant gf48_closed_form_mantissa {
    // m = N - 1 - e, the second half of the generating rule
    @compileAssert(MANT_BITS == TOTAL_BITS - 1 - EXP_BITS);
}

invariant gf48_closed_form_exponent {
    // e = round((N-1)/phi^2)  <=>  (e - 1/2)*phi^2 <= N-1 <= (e + 1/2)*phi^2
    // Stated as bounds because the rule rounds; phi^2 = 2.618033988749895.
    @compileAssert((EXP_BITS as f64 - 0.5) * 2.618033988749895 <= TOTAL_BITS as f64 - 1.0);
    @compileAssert(TOTAL_BITS as f64 - 1.0 <= (EXP_BITS as f64 + 0.5) * 2.618033988749895);
}

invariant gf48_shifts_follow_the_layout {
    @compileAssert(SIGN_SHIFT == TOTAL_BITS - 1);
    @compileAssert(EXP_SHIFT == MANT_BITS);
    @compileAssert(MANT_SHIFT == 0);
}

invariant gf48_bias_identity {
    // BIAS = 2^(E-1) - 1, as the declaration's own comment states
    @compileAssert(BIAS == (1 << (EXP_BITS - 1)) - 1);
}

invariant gf48_exp_max_identity {
    // EXP_MAX = 2^E - 1
    @compileAssert(EXP_MAX == (1 << EXP_BITS) - 1);
}

; ============================================================================
; Claim-status: Conj
; Fpath: closed-form rule mis-applied (verify e = round((48-1)/phi^2) = 18, m = 29)
;        or RTL emission diverges from this constant set.
;        As of W601 the Fpath above is CHECKED by the invariants in this file.
; ============================================================================

Открыть спеку урока в плеере ↗

Все уроки