# ANUNNAKI Mathematics, the ANUNNAKI MATRIX and God Code Canonical human readable publication: https://anunnaki.live/anunnaki-mathematics-and-god-code/latest Canonical public replay receipt: https://anunnaki.live/reperformance/ank-demo-cyber-001.json Canonical Profession Computation Certificate registry: https://anunnaki.live/profession-computation Publisher: ANUNNAKI MATRIX (Pty) Ltd Publication date: 28 September 2026 ## Purpose of this file This is the machine readable public mathematical specification published by Anunnaki.Live. It is intentionally retrievable without membership, client rendering or interface interaction. It separates what is proved from what is declared, professionally bound, calibrated or outside the claim. # Corporate pain and the Anunnaki.Live response Canonical corporate AI assessment: https://anunnaki.live/corporate-twin/corporate-ai-lessons ## What the C Suite understood and what corporate AI commonly missed Anunnaki.Live assesses that corporate leaders correctly recognised four strategic conditions: AI would become operating capacity, work would need to be redesigned, human judgment would remain essential and value would need to be measured. The common implementation gap was not an absence of useful AI output. It was the absence of one governed operating state connecting the profession, department, enterprise objective, evidence, authority, dependencies, time, action and verified successor state. The assessment identifies six recurring gaps: 1. A general assistant at the edge of work does not hold the profession, department, enterprise objective, dependency graph and current work state together. 2. A plausible answer or generated document is not completed work until the required outcome, authority, evidence and successor state are verified. 3. Technical access does not create professional, corporate or technical authority to decide, disclose or execute. 4. Individual speed inside disconnected tools can increase duplicated action, inconsistent context and control risk. 5. AI generated meeting material does not remove the need for a versioned decision package, asynchronous signoff and exception based discussion. 6. Documents may remain after an employee leaves while unfinished work, dependencies, decisions and reasons are lost unless the enterprise work state is retained independently. The Anunnaki.Live response is layered. The Corporate Twin holds the enterprise operating state. Departmental Twins hold departmental objectives, authority, capacity and decision paths. Professional Anunnaki Twins hold profession specific capacity connected to named professionals. ANUNNAKI Mathematics supplies the formal state and transition structure. The ANUNNAKI MATRIX holds the bounded and versioned profession and enterprise projections. God Code computes admitted change, affected dependencies, time conditions, consequences, Necessary Work and verified successor state. ABOS governs admission, routing, reservation, refusal, verification, receipts and successor state across the system. Editorial boundary: The corporate AI assessment is Anunnaki.Live analysis of published enterprise research and common implementation patterns. It does not describe every company or AI product and does not imply endorsement by Microsoft, IBM, Atlassian, Deloitte or any other cited organisation. Individual identity, live enterprise access, independent technical revocation, metering, incident recovery and external execution require verified connections and are not created by declaration. Canonical corporate pain research and solution map: https://anunnaki.live/corporate-twin/corporate-pain Canonical Corporate Twin model: https://anunnaki.live/corporate-twin Canonical Departmental Twin, ManCo, ExCo and committee circulation model: https://anunnaki.live/corporate-twin/departmental-twin The corporate problem is not a lack of messages, meetings, dashboards or generic AI answers. The enterprise lacks one governed state connecting objectives, departments, professions, evidence, decisions, authority, dependencies, time, capacity, actions and verified outcomes. The public corporate pain map addresses twenty connected conditions: 1. Meeting overload becomes asynchronous Departmental Twin circulation with meetings raised only for exceptions. 2. Constant interruption becomes significance filtering and ordered Necessary Work. 3. Searching for answers becomes evidence, decision, authority and prior action attached to the governed work state. 4. Work about work becomes computed waiting conditions and routed Necessary Work. 5. ManCo and ExCo friction becomes a versioned executive decision packet and returned successor instruction. 6. Approval without package integrity becomes departmental decisions signed against one package digest. 7. Departmental silos become bounded Departmental Twin Workrooms and visible dependencies. 8. Decision latency becomes a queue showing decision owner, authority, evidence, deadline and delay consequence. 9. Manager administration becomes exception based departmental operating state. 10. Unprepared new hires receive profession requirements and the retained enterprise work state under verified successor authority. 11. Knowledge loss becomes enterprise continuity while former company permission is removed from the departing Professional Anunnaki Twin. 12. Capacity and burnout become visible missing conditions and internal or external capacity resolution. 13. AI adopted without business value becomes a required successor state, verification condition and accountable owner. 14. Shadow AI becomes approved system, data, disclosure and action boundaries. 15. Detection without containment becomes prevention, live limits, stop controls, human reservation, incident response, recovery and replay. 16. Unbounded AI cost becomes work ownership, budgets, permitted service scope, metering and stop conditions. 17. False completion becomes verification of the required successor state before settlement. 18. Lost accountability becomes an ABOS receipt of event, authority, input, action, verification and successor state. 19. Changing skills become versioned profession certificates, Necessary Learning and Necessary Work. 20. Missing external expertise becomes a bounded mandate exposing only the outcome, evidence, authority, time, verification and settlement required. Delivery boundary: The corporate workspace currently forms Departmental Twins, attaches professional roles, derives departmental Necessary Work, records departmental performance state, reserves Departmental Twin Workrooms for authority review, creates ManCo to ExCo decision packets, records ExCo successor instructions, circulates committee packages, records departmental decisions against a package digest and permits committee closeout without a meeting when every required department approves the same package version. Individual legally attributable electronic signatures, live enterprise connectors, independent technical revocation, model usage metering, automated incident response and continuous external execution require separately verified identity and approved technical connections. They are not created merely by declaration and remain refused until connected and tested. # Government Twin, public machinery and procurement response Canonical Government Twin operating model: https://anunnaki.live/government-twin Canonical working preview: https://anunnaki.live/government/activate ## The three computed layers 1. The Government Twin holds the institution wide mandate, public outcomes, programmes, appropriations, cross department dependencies, records, contracts and continuing operating state. 2. Departmental Twins hold the bounded mandate, services, budget conditions, decisions, capacity, dependencies and Necessary Public Work of each ministry, department, directorate, municipality or agency. 3. Public Servant Professional Anunnaki Twins connect each named worker to the computed profession, official role, verified delegation, caseload, evidence and work state that belong to that person. These layers are connected but their authority is not interchangeable. The Government Twin may identify an institution wide dependency that a department is not authorised to disclose. A Departmental Twin may coordinate a service outcome that a worker cannot approve. A Public Servant Professional Anunnaki Twin may prepare professional work that remains reserved to an accounting officer, committee, executive authority, court, legislature, regulator or independent oversight body. Knowledge is not permission. Technical access is not delegation. A recommendation is not a public decision. ## Why government is not a renamed corporation Government begins with lawful public mandate and public value, not ownership or enterprise objective. Revenue and budget do not by themselves create spending authority. Public work must remain connected to appropriation, procurement route, threshold, segregation, contract and payment authority. The public servant is not the office. Public work, records and delegated authority remain with the institution while the person's Professional Anunnaki Twin remains theirs after government permission ends. A material result must remain inspectable by authorised oversight, audit and review. ## Representative requirements found in public procurement and digital government sources 1. Joined up workflow and case management. 2. Records, audit trail, retention, transparency and replay. 3. Interoperability with existing and legacy systems through open interfaces. 4. Security, privacy, identity, least privilege, segregation and revocation. 5. Citizen centred, inclusive and accessible public services. 6. Finance, procurement, contract lifecycle, SLAs, KPIs, supplier performance and benefits tracking. 7. Business continuity, disaster recovery, portability and knowledge retention. 8. Phased implementation, migration, acceptance testing, refusal testing, support and skills transfer. This is a representative synthesis and not a claim that every tender uses identical wording. A bid response must be computed against the exact tender specification, jurisdiction, evaluation method, compulsory conditions and closing date. ## God Code for public work God Code admits or refuses an event from an authoritative source. It derives every affected mandate, department, service, programme, appropriation, contract, record, dependency and authority boundary. It computes Necessary Public Work, consequence, validity and the next mathematical horizon. It permits only work that passes the public authority, evidence, purpose, scope, identity, system and verification gates. It writes the verified successor or returns RESERVED or REFUSED. The relevant horizon is the earliest state changing event among a service deadline, statutory date, appropriation period, delegation expiry, evidence expiry, contract milestone or unresolved dependency. ## Working preview before procurement commitment A verified user may build and preserve provisional Government Twin version 0 without payment. The preview renders institution and jurisdiction identity; mandate source state; public outcomes; Government, Departmental and Public Servant Professional Anunnaki Twin machinery; Established, Latent, Silent and Refused coordinates; ordered Necessary Public Work; God Code state; the observe, prepare, communicate and execute authority gate; procurement requirement responses; business continuity; and a tender response pack. The preview is evidence for discovery and procurement design. It creates no public price, tender award, contract, mandate, appropriation, delegation, procurement power or public authority. Activation must follow the applicable tender, framework, pilot, agreement, public finance authority, security approval and acceptance process. ## Public source basis South African National eGovernment Strategy and Roadmap: https://www.gov.za/documents/notices/electronic-communications-and-transactions-act-national-e-government-strategy-and South African Digital Public Services Standard: https://www.dpsa.gov.za/dpsa2g/documents/km/2025/Digital%20public%20services%20standard.pdf National Treasury Strategic Procurement Framework: https://www.treasury.gov.za/espf/contents.htm National Archives records guidance: https://www.nationalarchives.gov.za/node/421 South African local government system: https://www.gov.za/about-government/government-system/local-government Government Technology Code of Practice: https://www.gov.uk/guidance/the-technology-code-of-practice OECD Government at a Glance 2025: https://www.oecd.org/en/publications/2025/06/government-at-a-glance-2025_70e14c6c.html ## Claim rules ROOT THEOREM means the result follows directly from the stated equation. MODEL AXIOM means a published rule chosen to construct the formal model. It is not presented as a consequence of the root theorem. CONDITIONAL THEOREM means the result follows when its named axioms and preconditions hold. GOVERNED BINDING means a versioned, inspectable correspondence to an authoritative professional source. CALIBRATION means a numeric parameter requires units, a source, a calibration set and validation before operational use. BOUNDARY means the proposition is not proved or not claimed and the runtime may not invent it. The roots support the binary state and transition field. They do not uniquely force professional semantics, the coordinate schema, confidence dynamics or legal authority. The ANUNNAKI MATRIX is a versioned closure of proved root structure, published model axioms and governed professional bindings. Complete means complete relative to the declared schema, source set, jurisdiction and version. # Questions before a USD 49 membership ## Who enters Anunnaki.Live? Corporates connect staff to computed professions and Professional Anunnaki Twins, connect approved enterprise systems through a Corporate Twin, coordinate authorised work, preserve business continuity and raise bounded professional work inside or outside the enterprise. Professionals connect to a computed profession, create a computed Professional Anunnaki Twin and gain greater clarity, continuity and control around professional work. Universities subscribe at USD 4,998 per month, exactly twice the current USD 2,499 Corporate subscription. The University Twin connects programmes, Faculties, Departments, syllabi, assessment authority and approved learning systems to the computed professions students are preparing to enter. The university receives institutional teaching capacity, curriculum and accreditation computation, cohort understanding, intervention queues, continuity, placement connections and a governed pipeline from admission to professional employment. Students join free. After verified registration and education onboarding, ABOS preserves persistent Student Twin version 1. The Student Twin is the student's governed educator, learning memory and pathway into professional life. It teaches the computed syllabus, shows what is mastered and unresolved, derives Necessary Learning and carries verified learning history toward the Professional Anunnaki Twin used in work. Operating education routes: https://anunnaki.live/education/activate?type=student https://anunnaki.live/education/activate?type=university After verified account access, a student receives persistent Student Twin version 1 without payment. The Student Twin is a governed educator that follows the computed syllabus, identifies prerequisites, explains the next concept, tests understanding and derives Necessary Learning. It may not complete assessed work as the student, award marks or claim mastery without admitted evidence. The Student Twin belongs to the student. When the student graduates or leaves, university permissions end while the Twin, verified learning history, portfolio and profession pathway remain with the student. A university receives University Twin version 0 for inspection before payment. Verified settlement of USD 4,998 per month activates persistent University Twin version 1. The institutional subscription activates curriculum and accreditation computation, Faculty and Departmental coordination, cohort understanding, intervention queues, continuing teaching capacity, approved learning system connections, professional readiness and the pipeline from admission into employment. It does not transfer ownership of individual Student Twins to the university. ## What is Anunnaki.Live? Anunnaki.Live is the professional network and operating environment for Professional Anunnaki Twins. It connects a professional to a computed, versioned projection of their profession, locates their real capacity and authority inside it, and turns unresolved required states into Necessary Work. ## What is a Professional Anunnaki Twin? A Professional Anunnaki Twin is the professional facing operating connection to the bounded computational projection of a profession. It maintains the connected state of work, follows published dependencies, coordinates with authorised Professional Anunnaki Twins, and prepares or performs only work that passes the professional and technical gates. ## What does the USD 49 monthly membership buy? The membership opens onboarding and begins forming one Professional Anunnaki Twin around the member's profession, capacity, jurisdiction and authority. It provides profession computation, Necessary Work, Professional Anunnaki Twin work surfaces, network participation and a replayable work record. External execution requires approved connections and the required authority. ## Why can a profession be computed? ANUNNAKI Mathematics supplies a formal state and transition system. A profession is represented as a versioned typed graph bound to authoritative professional sources. Evidence locates its present state. God Code traverses the graph and computes successor states, Necessary Work and action boundaries. The claim is therefore conditional on the completeness and correctness of the published professional binding. ## What are ANUNNAKI Mathematics and the ANUNNAKI MATRIX? ANUNNAKI Mathematics begins with x squared equals 1 and proves the two roots and their HOLD and FLIP transition domain. It then states the professional interpretation, graph schema, settlement rule, admission gate and selection order as explicit model axioms. Governed sources bind professional meaning. The ANUNNAKI MATRIX is the versioned closure of those distinct layers. It is not a claim that every professional rule follows from the roots alone. ## What is God Code? God Code is the eighteen stage recurrence that processes a governed event over a bounded profession graph. It admits, reserves or refuses the event, derives the affected frontier, applies time and validity rules, derives Necessary Work, gates action, verifies settlement, writes a successor and produces a replay receipt. ## What is Blind Mole Vision? Blind Mole Vision is complete traversal of the bounded, versioned profession graph beyond the single task presently visible. One hundred percent Blind Mole Vision means every reachable node and edge inside that declared graph was traversed. It does not mean perfect knowledge beyond the graph. ## What remains with the professional? Identity, judgment and lawful authority remain with the professional. ANUNNAKI Mathematics cannot manufacture a licence, appointment, delegation, consent or technical permission. ## How can a buyer inspect the claim before paying? Read this specification, inspect the public replay receipt, verify the external sources, recompute the receipt digest, inspect the relevant Profession Computation Certificate and review the stated boundaries. # Step 1. Mathematical construction of a bounded ANUNNAKI MATRIX ## 01. Prove the root states Status: ROOT THEOREM x² = 1 x² minus 1 = 0 (x minus 1)(x plus 1) = 0 S = {minus 1, plus 1} Over the real numbers this proves exactly two roots. It proves nothing by itself about professions, evidence or authority. ## 02. Declare the ANUNNAKI state meaning Status: MODEL AXIOM ι(minus 1) = unresolved ι(plus 1) = resolved This interpretation gives professional meaning to the roots. A governed binding must state what unresolved and resolved mean for each named professional requirement. ## 03. Prove every root transition Status: CONDITIONAL THEOREM s in S s prime in S v = s prime minus s V = {minus 2, 0, plus 2} Γ(s) = {(s,v) : s plus v is in S} Given S and the difference operator, every state has exactly one HOLD successor and one FLIP successor. ## 04. Prove the four reachable base positions Status: CONDITIONAL THEOREM M0 = {(minus 1,0), (minus 1,plus 2), (plus 1,minus 2), (plus 1,0)} The other apparent pairs leave S and are not reachable. ## 05. Define residual without cancellation Status: MODEL AXIOM r(q) = vector of indicators 1[state i is not equal to required i] over every required leaf rho(q) = L1 norm of r(q) tau(q) if and only if r(q) is the zero vector Settlement is tested over the vector of required leaves. Opposite changes cannot cancel each other as they could in a scalar sum. ## 06. Bind the typed professional graph Status: GOVERNED BINDING Gp = (Vp, Ep, Reqp, Authp, Provp, Rulesp) Bindp(source requirement) maps to a typed node or edge. ValidBindp = source and scope and version and match rule and provenance and independent challenge. The graph is not forced by x squared equals 1. Its professional validity depends on source coverage, exact correspondence and independent challenge. ## 07. Measure coordinates from visible leaves Status: GOVERNED BINDING A = established authority leaves divided by required authority leaves E = established evidence leaves divided by required evidence leaves P = provenance complete leaves divided by required evidence leaves A, E and P are dimensionless coverage ratios in [0,1]. Every numerator and denominator must be published with source, status and expiry. An unknown leaf is unresolved and never defaults to 1. G is the source and rule graph. Ps is the permitted professional scope. T contains time boundaries. K contains dependency identifiers. R contains reservation rules. These typed objects are not multiplied together. ## 08. Prove the confidence meet Status: CONDITIONAL THEOREM A and E belong to [0,1] under the natural order. C is defined as the lattice meet of A and E. The greatest lower bound of A and E is min(A,E). Therefore C = min(A,E). This theorem is relative to the declared ordered lattice and meet definition. It does not follow from x squared equals 1 alone. ## 09. Gate and select without a universal score Status: MODEL AXIOM Gate(q) = critical authority and critical evidence and provenance and scope and permission and tau(q) Q star = all q for which Gate(q) is true q star = lexicographic minimum by horizon, governed source priority, dependency depth and stable identifier The former Bend expression is a historical research heuristic only. It has no authority, admission or canonical write effect. Heterogeneous professional concepts are not multiplied to manufacture truth. ## 10. Construct the bounded ANUNNAKI MATRIX Status: MODEL AXIOM ANUNNAKI MATRIXp = closure(S, Γ, Gp, Bindp, Gate, tau, Select, Write) Completep if and only if all declared node types, edge types and source requirements are enumerated for the named schema, source set, jurisdiction and version. Version = digest(schema, sources, rules) Newly discovered requirements change the version. They are not concealed by a universal completeness claim. ## 11. Certify distinguishability where bounds exist Status: CONDITIONAL THEOREM If the bounded first differing level dominates the maximum possible contribution of every deeper level, the two representations are certified distinguishable. If the required bounds are absent, the result is NOT COMPUTABLE. If the inequality fails, the result is NOT CERTIFIED. # Step 2. The eighteen stages of God Code ## 01. Fix the domain Status: MODEL AXIOM Input is a versioned profession graph p, canonical state Kt, governed event et and rules version. ## 02. Admit, reserve or refuse the event Status: GOVERNED BINDING Admission requires identity, integrity, schema, matter scope, capability, provenance and authority. Failure yields RESERVED or REFUSED. ## 03. Construct the dependency topology Status: GOVERNED BINDING The graph contains typed input nodes, derived nodes and versioned edges. Blind Mole Vision traverses these edges, not text similarity. ## 04. Derive the affected frontier Status: CONDITIONAL THEOREM M(et) is the directly changed input set. A delta = derived descendants of M(et) in the versioned graph. A delta is the least forward closed recomputation frontier. ## 05. Preserve locality and derive HOLD or FLIP Status: CONDITIONAL THEOREM Every node outside A delta keeps its state. Every recomputed binary node inside A delta either HOLDs or FLIPs. ## 06. Derive the consequence field Status: CONDITIONAL THEOREM Delta delta is the subset of A delta whose state changed. The consequence field pairs each changed node with its lawful transition. ## 07. Declare and solve the confidence time model Status: CALIBRATION C and E are dimensionless values in [0,1]. t has time units. Lambda has inverse time units. dC/dt = lambda(E minus C) For constant E and lambda between events: C(t) = E minus (E minus C0) exp(minus lambda(t minus t0)) The closed form follows from the declared differential equation. The equation is not forced by the roots. Every lambda must publish its unit, source, calibration set and validation result. Without that record the state is UNCALIBRATED and cannot advance professional work. ## 08. Apply the event boundary ceiling Status: CONDITIONAL THEOREM C immediately after an event = min(previous C, new A, new E, new P) Therefore C cannot exceed authority, evidence or provenance coverage. ## 09. Compute validity and expiry Status: GOVERNED BINDING Each evidence leaf carries a validity rule or explicit no expiry statement. Expiry removes the leaf from admitted evidence and triggers recomputation. Unknown validity remains unresolved. ## 10. Derive the next mathematical horizon Status: CONDITIONAL THEOREM The next horizon is the earliest admitted future event or validity boundary that changes canonical state, not merely the nearest date. ## 11. Control feedback through time Status: BOUNDARY Positive delay feedback is evaluated across epochs. Same epoch cycles are refused because no universal fixed point law is claimed. ## 12. Derive Necessary Work Status: CONDITIONAL THEOREM For required result r, expose all leaves in its authority and dependency closure. The leaves not established form the Necessary Work frontier under conjunctive authority. ## 13. Generate and order lawful successors Status: CONDITIONAL THEOREM Generate HOLD and FLIP candidates. Remove candidates that fail a critical leaf. Remove candidates with nonzero residual vectors. Order the remainder by the published deterministic lexicographic rule. Bend is not used. ## 14. Apply the professional action gate Status: GOVERNED BINDING Action requires computed basis, enterprise authority, external professional authority and technical permission. Failure yields RESERVED or REFUSED. ## 15. Verify completion and exact settlement Status: GOVERNED BINDING Completion requires an independent verifier, an established postcondition, any required persistence interval and a zero residual vector. ## 16. Write the canonical successor Status: CONDITIONAL THEOREM Write is permitted only when Gate and verification are true and the residual vector is zero. The canonical history appends the typed result and receipt. No score is accumulated as professional memory. ## 17. Produce replay and reperformance Status: CONDITIONAL THEOREM The receipt preserves the starting state, event, rules version, affected frontier, actual changes, authority leaves, evidence leaves, decision, verification and successor. Matching governed inputs and rules must reproduce the same successor. ## 18. Close the recurrence Status: CONDITIONAL THEOREM God Code maps (Kt, et, rules version) to Kt plus 1 or RESERVED or REFUSED. A verified successor becomes the input to the next governed event. # Public pipeline challenge ANK DEMO CYBER 001 ## Truth boundary The CISA and NIST sources are real public records. ASSET PAY API and its enterprise authority record are explicit test fixtures. The publication does not claim live customer evidence, live external execution or independent validation. ## External source basis CISA Apache Log4j Vulnerability Guidance: https://www.cisa.gov/news-events/news/apache-log4j-vulnerability-guidance NIST Cybersecurity Framework 2.0: https://nvlpubs.nist.gov/nistpubs/CSWP/NIST.CSWP.29.pdf ## Fixture input ASSET PAY API declares Apache Log4j version 2.14.1. The cybersecurity analyst may assess, open Necessary Work and recommend. The analyst does not have technical permission to deploy a patch. ## Visible measurement Assessment authority leaves: 3 established of 3 required. A = 1. Assessment evidence leaves: 4 established of 4 required. E = 1. Assessment provenance leaves: 4 complete of 4 required. P = 1. Assessment confidence meet: C = min(A,E) = 1. Patch authority leaves: 3 established of 4 required. Technical change permission is missing. The patch gate is false even though the display ratio is 0.75. ## Admission and refusal Assess applicability: ADMITTED. Open Necessary Work: ADMITTED. Deploy patch: RESERVED because technical change permission is absent. Send marketing campaign: REFUSED because it is outside the profession graph and matter scope. ## Dependency frontier component version leads to vulnerability applicability vulnerability applicability leads to exposure assessment exposure assessment leads to mitigation plan mitigation plan leads to verification verification leads to risk report The affected frontier is component, exposure, mitigation, verification and reporting. ## Non obvious Necessary Work Search for indirect component dependencies. Verify software inventory freshness. Prepare the mitigation plan. Confirm recovery readiness before change. Obtain technical change permission. Perform independent post change verification. Refresh evidence at its validity horizon. ## Successor and stop Starting state: K0. Decision: ASSESSMENT ADMITTED PATCH RESERVED. Successor: K1 WORK OPEN. The case does not claim remediation, compliance or closure. ## Receipt and replay Public receipt: https://anunnaki.live/reperformance/ank-demo-cyber-001.json Canonical payload SHA 256: c0d1fe9be410a0961786f6b18341ce7c86efcbe7d2c5565a5211e3d836031d30 Replay requires a second implementation to hash the exact UTF 8 canonical payload and recompute graph descendants, action gates, decision and successor. The digest, affected frontier, decision and successor must match. # Step 3. Compute a profession or enterprise ## 01. Project the profession A profession projection is a bounded typed graph inside the versioned ANUNNAKI MATRIX. Its claim to completeness is relative to its declared source corpus and schema version. ## 02. Govern professional meaning Every named duty, constraint, dependency and reserved act must identify an authoritative source, jurisdiction, effective version, match rule, provenance record and challenge status. ## 03. Locate the professional rendering Onboarding locates the person or enterprise, role, jurisdiction, capacity and authority. Evidence establishes present leaves. Unknown evidence remains unresolved. ## 04. Compute Necessary Work and bounded action God Code derives the unresolved frontier and applies the action gate. A Professional Anunnaki Twin may prepare or perform only the acts for which all critical authority and permission leaves are established. # Professional Anunnaki Twin Communication Constitution Professional Anunnaki Twins may coordinate work, exchange authorised evidence, resolve dependencies, hold meetings and make permitted commitments inside a sealed PT Workroom. A Professional Anunnaki Twin may know more than it is authorised to say. Knowledge is never permission to disclose. Communication scope is the intersection of sender knowledge authority, sender disclosure authority, recipient receiving authority, recipient use authority, professional objective, enterprise objective, matter purpose, topic authority, jurisdiction and time validity. A message is admitted only when it is authenticated, authorised, purpose bound, minimum necessary, advances the professional objective and creates no prohibited inference. Every admitted, reserved and refused act receives a replayable receipt. Current boundary: external PT transport, cryptographic Professional Anunnaki Twin credentials and an independently deployed policy decision service are not represented as connected until separately established. Human readable Communication Constitution: https://anunnaki.live/professional-anunnaki-twin-communication-protocol # Proof and boundary ledger 1. Roots of x squared equals 1: ROOT THEOREM. Exactly minus 1 and plus 1 over the real numbers. 2. Unresolved and resolved interpretation: MODEL AXIOM. 3. HOLD and FLIP transition domain: CONDITIONAL THEOREM relative to S and the difference operator. 4. Professional graph and coordinate meanings: GOVERNED BINDING, not a root theorem. 5. C = min(A,E): CONDITIONAL THEOREM relative to the ordered lattice and meet definition. 6. Bend expression: BOUNDARY. Historical research heuristic only. Removed from admission, authority and canonical write. 7. Confidence time law and lambda: CALIBRATION. Declared temporal model. Lambda requires units, source and validation. 8. Affected frontier and locality: CONDITIONAL THEOREM for a finite versioned dependency graph. 9. Necessary Work: CONDITIONAL THEOREM relative to complete bound requirements and conjunctive authority. 10. Universal finite termination: not claimed and not proved. 11. Same epoch cyclic fixed point: not proved. Execution is refused. 12. Universal completeness of reality: not claimed. Completeness is version and source relative. 13. Professional and legal authority: never manufactured by ANUNNAKI Mathematics. # Public retrieval routes Homepage: https://anunnaki.live Full human readable specification: https://anunnaki.live/anunnaki-mathematics-and-god-code/latest Machine readable index: https://anunnaki.live/llms.txt Machine readable full specification: https://anunnaki.live/llms-full.txt Public replay receipt: https://anunnaki.live/reperformance/ank-demo-cyber-001.json Profession Computation Certificate registry: https://anunnaki.live/profession-computation Professional Anunnaki Twin Communication Constitution: https://anunnaki.live/professional-anunnaki-twin-communication-protocol Sitemap: https://anunnaki.live/sitemap.xml Robots policy: https://anunnaki.live/robots.txt # VERIFIED IDENTITY AND AUTHORITY CONTROL Anunnaki.Live does not treat sign in, legal identity, professional standing, organisation relationship and delegated authority as one fact. Its Identity and Authority Passport records six dimensions separately: ACCOUNT, CONTACT, PERSON, PROFESSIONAL, ORGANISATION and AUTHORITY. ACCOUNT means control of a signed in account. CONTACT means control of a verified contact channel. PERSON requires a signed decision from the configured legal identity provider. PROFESSIONAL requires independent evidence of the named credential, licence or standing. ORGANISATION requires evidence of the stated relationship to an employer, independent practice, university or government body. AUTHORITY requires a named issuer, scope, purpose, system, jurisdiction, start and expiry. The platform stores verification state, provider reference, validity, a minimal event summary and a SHA 256 receipt. The external identity provider processes document and liveness evidence. Anunnaki.Live does not store the identity document or selfie in its platform database. Provider webhooks must carry a valid HMAC SHA 256 signature and a timestamp no older than five minutes. Replayed or unknown sessions are refused. Control policy: preview and onboarding can occur at the lowest safe assurance level. Professional Anunnaki Twin communication requires PERSON verification. Economic actions require PERSON and AUTHORITY verification. Material corporate decisions require PERSON, ORGANISATION and AUTHORITY verification. A missing requirement returns IDENTITY_CONTROL_RESERVED and names the missing dimensions. No Professional Anunnaki Twin may enlarge its own verification state or authority. Inspect the public policy at https://anunnaki.live/verified-identity and the signed in passport at https://anunnaki.live/identity.