# Introducing .me

[**.me**](https://github.com/neurons-me/.me) is a semantic runtime built on simple premises:

```javascript
// Declare meaning 
me.whatever(what)

// Resolve meaning
me("whatever") // prints what
```

# Syntax

```javascript
// State & Reactive derivations
me.users.ana.age(22)
me.people["[i]"]["="]("isAdult", "age>=18")
me("people[age>=18].name") // -> ["ana"]

// Audience & Secret Scope
me.wallet["_"]("k")
me.wallet.balance(12480)
me("wallet") // -> undefined (protected by secret scope)
me("wallet.balance") // -> 12480

// Reactivity & Proofs
me.order["="]("total", "price*quantity")
// O(k) inverted index, only deps recompute
me.explain("order.total") // -> {value, expr, inputs, dependsOn, recomputed, sourcePath}
me.prove() // -> Ed25519 cryptographic signature
```

# Inherent Logics

I integrate it, because I knew it would enter into criteria, but that no criterion should ever alter the data.

> ***Data must remain immutable even if interpretation changes.***
> 
> ***Axiom:***
> 
> ***Data must be invariant under criterion.***

### **Meaning is infrastructure.**

*   **Form contains its space of possible behaviors.**
    
*   Structure does not only define *what it is*. It defines *how it can be used*.
    

**It's that each structure:** **limits, allows, and guides how the system can evolve.**

* * *

**Simple examples:**

*   A tree forces you to think in parents/children.
    
*   A list forces you to think in order.
    
*   A graph forces you to think in relationships.
    
*   A runtime forces you to think in behavior.
    

They are **logics inherent** to the form.

# Namespace Resolution Protocol (NRP):

Mesh-aware resolution for `me://` paths. It acts as a living network of monads—discovering, scoring, forwarding, and learning—rather than relying on a centralized or static DNS table.

[Learn more about NRP](https://neurons-me.github.io/NRP/)

# Encrypted Audience Algebra:

![Description](https://res.cloudinary.com/dkwnxf6gm/image/upload/v1787542641/algebra-of-context-digital-spaces_hdgfyf.png align="center")

Access control derived through algebra over secret scopes rather than declared roles. Who can see what is computed dynamically based on contextual bounds and cryptographic proofs.

[Learn more about Encrypted Audience Algebra.](https://suign.github.io/EncryptedAudiences.html)

## Kernel Invariants & Axioms:

Non-negotiable guarantees built directly into the kernel—including stealth disclosure, hash-chain integrity, and deterministic conflict resolution.

\[Learn more about Kernel Invariants & Axioms.\]( https://neurons-me.github.io/.me/docs/Axioms.html)