3 repository-uri
Using boolean predicates to validate structured data for access control and authorization rules.
Distinct from Predicate-Based Request Filtering: Distinct from Predicate-Based Request Filtering: focuses on authorization and data validation rather than request dispatching.
Explore 3 awesome GitHub repositories matching software engineering & architecture · Predicate-Based Authorization. Refine with filters or upvote what's useful.
This repository contains the technical specification and architectural blueprint for a decentralized network protocol designed to coordinate autonomous agents. It defines a system model for a global autonomous agentic internet, covering protocol engineering, tokenomics, and the structural design of the network infrastructure. The protocol focuses on a programmable payment system that utilizes trustless atomic swaps and specific spending conditions to release funds. It incorporates a privacy-preserving framework for off-chain transaction execution, allowing service providers and users to maint
Uses trustless atomic swaps and specific logic predicates to control the release of funds.
Penrose is a compiler that transforms structured mathematical notation into optimized SVG diagrams. It uses a three-stage pipeline of separate domain, substance, and style files to define mathematical objects, relationships, and visual presentation, then solves continuous optimization problems with user-defined spatial constraints and objectives to automatically arrange diagram elements. The system separates diagram content from visual style using distinct declarative languages, and provides a typed domain language with subtype hierarchies for mathematical objects. It supports embedding compi
Marks binary predicates as symmetric so argument order is treated as equivalent by the diagram engine.
cel-go is a Go implementation of the Common Expression Language, providing a type-safe engine for the evaluation of non-Turing complete, side-effect-free expressions. It functions as an embedded expression engine that converts human-readable strings into type-checked abstract syntax trees to ensure safe execution. The system utilizes a compile-once evaluate-many model, parsing and validating expressions into cached programs for repeated execution across different datasets. It further distinguishes itself as a partial state evaluator, using commutative logic to compute results and return resid
Checks structured data against boolean conditions to enforce authorization rules or request filters.