# Behavioural properties in the Anoma specs **URL:** \ **Category:** Protocol Design\ **Created:** [December 20, 2023, 1:21pm UTC](https://forum.anoma.net/t/behavioural-properties-in-the-anoma-specs/423 "2023-12-20T13:21:35Z")\ **Posts on this page:** 1\ **Page:** 1
**Author:** ![graphomath](https://dub1.discourse-cdn.com/flex013/user_avatar/forum.anoma.net/graphomath/32/9_2.png) [@graphomath](https://forum.anoma.net/u/graphomath)\ **Post date:** [December 20, 2023, 1:21pm UTC](https://forum.anoma.net/t/behavioural-properties-in-the-anoma-specs/423/1 "2023-12-20T13:21:35Z")
The [Architecture 1](https://specs.anoma.net/alpha/main/denotational-architecture.html) specification is still in need of behavioral properties that Anoma instances should satisfy. A specific property, in natural language, is > every transaction that user submits will be executed, _eventually_. The notion of _eventually_ here is exactly the one from [linear temporal logic](https://en.wikipedia.org/wiki/Linear_temporal_logic), assuming that we can fabricate suitable action alphabets. Another property that we would like is unlikability of nullifiers and their respective commitments, maybe via [information theory](https://en.wikipedia.org/wiki/Information_theory)? I just don’t know and that’s why I am writing this… The purpose of this post is to get a rough delineation between properties that make it into [Architecture 1](https://specs.anoma.net/alpha/main/denotational-architecture.html) of the specs, say for Anoma v1, to get started; the delineation might just be two lists, one concerning well understood properties and others that are not yet understood in depth. In other words, I would like to make a collection of such behavioral properties, either in the narrow or wide sense. For the sake of this post, let me hand wave ‘narrow’ and ‘wide’ as follows: - _narrow:_ we have an idea which theory would allow us to capture this property slickly, e.g., via [differential privacy](https://en.wikipedia.org/wiki/Differential_privacy), [information theory](https://en.wikipedia.org/wiki/Information_theory), [temporal](https://en.wikipedia.org/wiki/Temporal_logic) and/or [epistemic](https://en.wikipedia.org/wiki/Dynamic_epistemic_logic) logics, game theory / mechanism design; - _wide:_ properties that are discussed very hot on twitter and social media, but so far have eluded the fangs of STEM, e.g., UX (for want of a better example that my brain refuses to produce right now) and _maybe_ governance, but well, I am just desperate for good examples. In short, this is just intended as condensation point for properties that have probably been discussed in several places, but never been collected in a single document. The post is a wiki, so please feel free to add properties to the two lists yourself, but I am happy to curate the list: _narrow:_ - inclusion fairness: - unbiased inclusion: - state machine replication: - … - … _wide:_ - -