universal-life-protocol-core/ctl-consensus.js

Revolutionary AI framework implementing living, conscious digital reality with meta-cognitive reasoning, attention economics, and autonomous learning

import { CryptoUtil } from './crypto.js';
/**
 * Implements the Continuous Transylvanian Lottery (CTL) consensus protocol.
 */
export class CtlConsensus {
    // The 7 points of the Fano plane represent 7 network validators.
    points;
    // The 7 lines (sets of 3 points) are the pre-defined consensus quorums.
    // RECTIFIED: Corrected the Fano Plane definition for geometric integrity.
    lines;
    constructor(validatorIds) {
        if (validatorIds.length !== 7) {
            throw new Error("CTL requires exactly 7 validators for this Fano Plane implementation.");
        }
        this.points = validatorIds;
        this.lines = [
            new Set([this.points[0], this.points[1], this.points[3]]),
            new Set([this.points[1], this.points[2], this.points[4]]),
            new Set([this.points[2], this.points[3], this.points[5]]),
            new Set([this.points[3], this.points[4], this.points[6]]),
            new Set([this.points[4], this.points[5], this.points[0]]),
            new Set([this.points[5], this.points[6], this.points[1]]),
            new Set([this.points[6], this.points[0], this.points[2]]),
        ];
    }
    /**
     * Simulates the selection of a consensus quorum for a given round.
     * @param vrfSeed A seed for the Verifiable Random Function.
     * @returns The validator IDs of the activated consensus quorum.
     */
    getActivatedQuorum(vrfSeed) {
        // A Verifiable Random Function (VRF) selects a small, random subset of validators.
        // We simulate selecting 3 "winning" validators based on the seed.
        const selectedValidators = this.selectRandomSubset(3, vrfSeed);
        // The mathematical properties of the Fano Plane guarantee that any 3 points will have
        // a well-defined intersection with one of the lines, deterministically activating a quorum.
        for (const line of this.lines) {
            const intersectionSize = [...selectedValidators].filter(v => line.has(v)).length;
            // The design guarantees an intersection of at least 2 will activate a single quorum.
            if (intersectionSize >= 2) {
                return line;
            }
        }
        return null; // Should not happen in a correctly configured system.
    }
    // Helper to simulate a deterministic selection based on a seed (simulating a VRF).
    selectRandomSubset(size, seed) {
        // Simple deterministic shuffling based on seed hash
        const sorted = [...this.points].sort((a, b) => {
            const hashA = CryptoUtil.simpleHash(a + seed);
            const hashB = CryptoUtil.simpleHash(b + seed);
            return hashA - hashB;
        });
        return new Set(sorted.slice(0, size));
    }
}
//# sourceMappingURL=ctl-consensus.js.map