quo-systems 0.1.0__tar.gz

quo_systems-0.1.0/.gitignore

@@ -0,0 +1,5 @@
+.venv/
+__pycache__/
+*.pyc
+*.egg-info/
+dist/

quo_systems-0.1.0/.python-version

@@ -0,0 +1 @@
+3.13

quo_systems-0.1.0/LICENSE

@@ -0,0 +1,201 @@
+                                 Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+
+   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+   1. Definitions.
+
+      "License" shall mean the terms and conditions for use, reproduction,
+      and distribution as defined by Sections 1 through 9 of this document.
+
+      "Licensor" shall mean the copyright owner or entity authorized by
+      the copyright owner that is granting the License.
+
+      "Legal Entity" shall mean the union of the acting entity and all
+      other entities that control, are controlled by, or are under common
+      control with that entity. For the purposes of this definition,
+      "control" means (i) the power, direct or indirect, to cause the
+      direction or management of such entity, whether by contract or
+      otherwise, or (ii) ownership of fifty percent (50%) or more of the
+      outstanding shares, or (iii) beneficial ownership of such entity.
+
+      "You" (or "Your") shall mean an individual or Legal Entity
+      exercising permissions granted by this License.
+
+      "Source" form shall mean the preferred form for making modifications,
+      including but not limited to software source code, documentation
+      source, and configuration files.
+
+      "Object" form shall mean any form resulting from mechanical
+      transformation or translation of a Source form, including but
+      not limited to compiled object code, generated documentation,
+      and conversions to other media types.
+
+      "Work" shall mean the work of authorship, whether in Source or
+      Object form, made available under the License, as indicated by a
+      copyright notice that is included in or attached to the work
+      (an example is provided in the Appendix below).
+
+      "Derivative Works" shall mean any work, whether in Source or Object
+      form, that is based on (or derived from) the Work and for which the
+      editorial revisions, annotations, elaborations, or other modifications
+      represent, as a whole, an original work of authorship. For the purposes
+      of this License, Derivative Works shall not include works that remain
+      separable from, or merely link (or bind by name) to the interfaces of,
+      the Work and Derivative Works thereof.
+
+      "Contribution" shall mean any work of authorship, including
+      the original version of the Work and any modifications or additions
+      to that Work or Derivative Works thereof, that is intentionally
+      submitted to Licensor for inclusion in the Work by the copyright owner
+      or by an individual or Legal Entity authorized to submit on behalf of
+      the copyright owner. For the purposes of this definition, "submitted"
+      means any form of electronic, verbal, or written communication sent
+      to the Licensor or its representatives, including but not limited to
+      communication on electronic mailing lists, source code control systems,
+      and issue tracking systems that are managed by, or on behalf of, the
+      Licensor for the purpose of discussing and improving the Work, but
+      excluding communication that is conspicuously marked or otherwise
+      designated in writing by the copyright owner as "Not a Contribution."
+
+      "Contributor" shall mean Licensor and any individual or Legal Entity
+      on behalf of whom a Contribution has been received by Licensor and
+      subsequently incorporated within the Work.
+
+   2. Grant of Copyright License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      copyright license to reproduce, prepare Derivative Works of,
+      publicly display, publicly perform, sublicense, and distribute the
+      Work and such Derivative Works in Source or Object form.
+
+   3. Grant of Patent License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      (except as stated in this section) patent license to make, have made,
+      use, offer to sell, sell, import, and otherwise transfer the Work,
+      where such license applies only to those patent claims licensable
+      by such Contributor that are necessarily infringed by their
+      Contribution(s) alone or by combination of their Contribution(s)
+      with the Work to which such Contribution(s) was submitted. If You
+      institute patent litigation against any entity (including a
+      cross-claim or counterclaim in a lawsuit) alleging that the Work
+      or a Contribution incorporated within the Work constitutes direct
+      or contributory patent infringement, then any patent licenses
+      granted to You under this License for that Work shall terminate
+      as of the date such litigation is filed.
+
+   4. Redistribution. You may reproduce and distribute copies of the
+      Work or Derivative Works thereof in any medium, with or without
+      modifications, and in Source or Object form, provided that You
+      meet the following conditions:
+
+      (a) You must give any other recipients of the Work or
+          Derivative Works a copy of this License; and
+
+      (b) You must cause any modified files to carry prominent notices
+          stating that You changed the files; and
+
+      (c) You must retain, in the Source form of any Derivative Works
+          that You distribute, all copyright, patent, trademark, and
+          attribution notices from the Source form of the Work,
+          excluding those notices that do not pertain to any part of
+          the Derivative Works; and
+
+      (d) If the Work includes a "NOTICE" text file as part of its
+          distribution, then any Derivative Works that You distribute must
+          include a readable copy of the attribution notices contained
+          within such NOTICE file, excluding those notices that do not
+          pertain to any part of the Derivative Works, in at least one
+          of the following places: within a NOTICE text file distributed
+          as part of the Derivative Works; within the Source form or
+          documentation, if provided along with the Derivative Works; or,
+          within a display generated by the Derivative Works, if and
+          wherever such third-party notices normally appear. The contents
+          of the NOTICE file are for informational purposes only and
+          do not modify the License. You may add Your own attribution
+          notices within Derivative Works that You distribute, alongside
+          or as an addendum to the NOTICE text from the Work, provided
+          that such additional attribution notices cannot be construed
+          as modifying the License.
+
+      You may add Your own copyright statement to Your modifications and
+      may provide additional or different license terms and conditions
+      for use, reproduction, or distribution of Your modifications, or
+      for any such Derivative Works as a whole, provided Your use,
+      reproduction, and distribution of the Work otherwise complies with
+      the conditions stated in this License.
+
+   5. Submission of Contributions. Unless You explicitly state otherwise,
+      any Contribution intentionally submitted for inclusion in the Work
+      by You to the Licensor shall be under the terms and conditions of
+      this License, without any additional terms or conditions.
+      Notwithstanding the above, nothing herein shall supersede or modify
+      the terms of any separate license agreement you may have executed
+      with Licensor regarding such Contributions.
+
+   6. Trademarks. This License does not grant permission to use the trade
+      names, trademarks, service marks, or product names of the Licensor,
+      except as required for reasonable and customary use in describing the
+      origin of the Work and reproducing the content of the NOTICE file.
+
+   7. Disclaimer of Warranty. Unless required by applicable law or
+      agreed to in writing, Licensor provides the Work (and each
+      Contributor provides its Contributions) on an "AS IS" BASIS,
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+      implied, including, without limitation, any warranties or conditions
+      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+      PARTICULAR PURPOSE. You are solely responsible for determining the
+      appropriateness of using or redistributing the Work and assume any
+      risks associated with Your exercise of permissions under this License.
+
+   8. Limitation of Liability. In no event and under no legal theory,
+      whether in tort (including negligence), contract, or otherwise,
+      unless required by applicable law (such as deliberate and grossly
+      negligent acts) or agreed to in writing, shall any Contributor be
+      liable to You for damages, including any direct, indirect, special,
+      incidental, or consequential damages of any character arising as a
+      result of this License or out of the use or inability to use the
+      Work (including but not limited to damages for loss of goodwill,
+      work stoppage, computer failure or malfunction, or any and all
+      other commercial damages or losses), even if such Contributor
+      has been advised of the possibility of such damages.
+
+   9. Accepting Warranty or Additional Liability. While redistributing
+      the Work or Derivative Works thereof, You may choose to offer,
+      and charge a fee for, acceptance of support, warranty, indemnity,
+      or other liability obligations and/or rights consistent with this
+      License. However, in accepting such obligations, You may act only
+      on Your own behalf and on Your sole responsibility, not on behalf
+      of any other Contributor, and only if You agree to indemnify,
+      defend, and hold each Contributor harmless for any liability
+      incurred by, or claims asserted against, such Contributor by reason
+      of your accepting any such warranty or additional liability.
+
+   END OF TERMS AND CONDITIONS
+
+   APPENDIX: How to apply the Apache License to your work.
+
+      To apply the Apache License to your work, attach the following
+      boilerplate notice, with the fields enclosed by brackets "{}"
+      replaced with your own identifying information. (Don't include
+      the brackets!)  The text should be enclosed in the appropriate
+      comment syntax for the file format. We also recommend that a
+      file or class name and description of purpose be included on the
+      same "printed page" as the copyright notice for easier
+      identification within third-party archives.
+
+   Copyright 2026 Razvan Gherghina
+
+   Licensed under the Apache License, Version 2.0 (the "License");
+   you may not use this file except in compliance with the License.
+   You may obtain a copy of the License at
+
+       http://www.apache.org/licenses/LICENSE-2.0
+
+   Unless required by applicable law or agreed to in writing, software
+   distributed under the License is distributed on an "AS IS" BASIS,
+   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+   See the License for the specific language governing permissions and
+   limitations under the License.

quo_systems-0.1.0/NOTICE

@@ -0,0 +1,6 @@
+Quo
+Copyright 2026 Razvan Gherghina
+
+This product includes software developed by Razvan Gherghina.
+
+Licensed under the Apache License, Version 2.0. See LICENSE.

quo_systems-0.1.0/PKG-INFO

@@ -0,0 +1,8 @@
+Metadata-Version: 2.5
+Name: quo-systems
+Version: 0.1.0
+Summary: Quo in Python: the protocol that answers by whose authority.
+License-File: LICENSE
+License-File: NOTICE
+Requires-Python: >=3.11
+Requires-Dist: cryptography

quo_systems-0.1.0/README.md

@@ -0,0 +1,109 @@
+# The Quo kit in Python
+
+Written from [the constitution](../../constitution.md) alone and judged
+against the pinned corpus in [`../js/vectors`](../js/vectors). Today it
+carries a core of five modules and the two roads.
+
+- **`quo.notation`** — Article IV. A blueprint's canonical text, its SHA-256
+  digest, and every text the notation refuses.
+- **`quo.arithmetic`** — Article VI. Ed25519 signs, X25519 seals, SHA-256
+  commits, AES-256-GCM encrypts under a key derived through HKDF-SHA-256.
+- **`quo.wire`** — Article V. The byte encoding of every closed type.
+- **`quo.envelope`** — Article XI. The sealed box and the two records inside it.
+- **`quo.warden`** — Articles IX and XII. The door, and the judgment in order.
+
+And the roads, which are not the core:
+
+- **`quo.carriage`** — Article III. The common carriage: one POST, bytes in
+  and bytes out. The only module that imports `http`.
+- **`quo.line`** — Article III. Framed envelopes over one persistent TCP
+  connection. The only module that imports `socket`.
+
+Importing `quo` gives the core and pulls in no host; a road is asked for by
+name, and `tests/test_roads.py` asserts that rather than trusting a reader to
+keep noticing it.
+
+One third-party import, and it is the whole of it: PyCA
+[`cryptography`](https://cryptography.io/), which carries Ed25519, X25519,
+AES-256-GCM and HKDF. SHA-256 still comes from `hashlib`, because a primitive
+the platform holds is taken from the platform. The core imports no host:
+nothing from `socket`, `http` or `asyncio`.
+
+## What it needs
+
+Python 3.11 or newer. The kit is developed and tested on CPython 3.13, pinned
+in `.python-version`, with the dependency resolved by the committed
+`uv.lock`.
+
+## The interface
+
+```python
+from quo import notation
+
+notation.parse(text)        # -> Blueprint, or raises NotationError
+notation.render(blueprint)  # -> the canonical text
+notation.canonical(text)    # -> the canonical bytes, UTF-8
+notation.digest(text)       # -> 32 bytes, the blueprint's identity
+```
+
+A text is canonical or it is refused. There is no repair: `parse` reads the
+text, then writes the blueprint back and requires the two to be the same
+bytes, so a trailing space or a second blank line is a refusal rather than
+something quietly dropped.
+
+```python
+from quo import arithmetic
+
+arithmetic.digest(data)                     # -> 32 bytes
+arithmetic.commitment(warden, heir)         # -> 32 bytes
+arithmetic.signing_public(secret)           # -> the Ed25519 pk of that seed
+arithmetic.sign(secret, message)            # -> 64 bytes
+arithmetic.verify(voice, message, sig)      # -> bool
+arithmetic.sealing_public(secret)           # -> the X25519 pk of that key
+arithmetic.agree(secret, public)            # -> 32 bytes, or ArithmeticError
+arithmetic.derive(shared)                   # -> (32-byte key, 12-byte nonce)
+arithmetic.seal(shared, additional, plain)  # -> ciphertext then 16-byte tag
+arithmetic.unseal(shared, additional, box)  # -> plaintext, or ArithmeticError
+```
+
+A key is 32 bytes; anything else is refused before an algorithm sees it. No
+function here mints a key — every draw of randomness is taken as an argument.
+`verify` answers false rather than raising, because a signature that does not
+stand is an ordinary answer; a seal that does not open is an
+`ArithmeticError`. So is a dead agreement — one handing back thirty-two zero
+bytes is refused at the point of agreement, said as this module's own refusal
+rather than as whatever `cryptography` raised underneath.
+
+```python
+from quo import carriage, line
+
+carriage.post(hint, message)            # -> the sealed answer, or b"" for silence
+carriage.Door(handle, limit=...)        # one POST in, one body out
+
+line.parse_hint("tcp://host:9000")      # -> Road(host, port, cap, declared)
+line.frame(envelope, cap)               # -> the length, then the envelope bytes
+line.dial(hint).send(envelope)          # the dialing end publishes nothing
+line.Listener(handle, cap=...)          # the listening end, and its hint
+```
+
+The default cap is 16,384 bytes, which a bare `tcp://` hint promises; a door
+with a different appetite declares it with `?cap=` and a dialer reads it before
+connecting. An over-cap send is refused in the sender's own kit. On a line
+silence has no wire form — a refused ask puts no frame out — and only a framing
+fault ends the connection, without a word.
+
+## The tests
+
+With [uv](https://docs.astral.sh/uv/), from this directory:
+
+```
+uv run --frozen --python 3.13 python -m unittest discover -s tests -t tests -v
+```
+
+Every vector in `../js/vectors/notation.json` is reproduced — six accepted
+texts asserted on both their canonical bytes and their digest, and
+twenty-eight refusals asserted as strictly as the acceptances. So is every
+vector in `arithmetic.json`, all sixteen, with the case count asserted
+against the file. `material.json` carries no vectors: instead every one of
+its twenty keys is accounted for, each derived from its own secret or named
+as a root the file does not derive.

quo_systems-0.1.0/pyproject.toml

@@ -0,0 +1,13 @@
+[project]
+name = "quo-systems"
+version = "0.1.0"
+description = "Quo in Python: the protocol that answers by whose authority."
+requires-python = ">=3.11"
+dependencies = ["cryptography"]
+
+[build-system]
+requires = ["hatchling"]
+build-backend = "hatchling.build"
+
+[tool.hatch.build.targets.wheel]
+packages = ["src/quo"]

quo_systems-0.1.0/src/quo/__init__.py

@@ -0,0 +1,11 @@
+"""The Quo kit in Python. The core: the notation, the arithmetic, the wire, the
+envelope and the warden.
+
+The three roads — ``quo.carriage``, ``quo.line`` and ``quo.call``, which is
+distance zero — are deliberately absent here. Importing this package pulls in
+no host, so the core stays portable; a road is asked for by name.
+"""
+
+from . import arithmetic, envelope, notation, warden, wire
+
+__all__ = ["arithmetic", "envelope", "notation", "warden", "wire"]

quo_systems-0.1.0/src/quo/arithmetic.py

@@ -0,0 +1,212 @@
+"""The arithmetic: the four algorithms, named once and never negotiated.
+
+Article VI of the constitution is the whole specification. Ed25519 signs,
+X25519 seals, SHA-256 commits, AES-256-GCM encrypts under a key derived
+through HKDF-SHA-256 with the fixed label ``quo-seal``. There is no suite
+identifier and no negotiation.
+
+Every draw of randomness is taken as an argument here, never reached for: no
+function in this module mints a key of its own.
+"""
+
+from __future__ import annotations
+
+import hashlib
+from typing import Tuple
+
+from cryptography.exceptions import InvalidSignature, InvalidTag
+from cryptography.hazmat.primitives.asymmetric.ed25519 import (
+    Ed25519PrivateKey,
+    Ed25519PublicKey,
+)
+from cryptography.hazmat.primitives.asymmetric.x25519 import (
+    X25519PrivateKey,
+    X25519PublicKey,
+)
+from cryptography.hazmat.primitives.ciphers.aead import AESGCM
+from cryptography.hazmat.primitives.hashes import SHA256
+from cryptography.hazmat.primitives.kdf.hkdf import HKDF
+from cryptography.hazmat.primitives.serialization import Encoding, PublicFormat
+
+__all__ = [
+    "ArithmeticError",
+    "KEY_LENGTH",
+    "SIGNATURE_LENGTH",
+    "NONCE_LENGTH",
+    "TAG_LENGTH",
+    "SEAL_INFO",
+    "digest",
+    "commitment",
+    "signing_public",
+    "sign",
+    "small_order",
+    "verify",
+    "sealing_public",
+    "agree",
+    "derive",
+    "seal",
+    "unseal",
+]
+
+
+class ArithmeticError(ValueError):
+    """An input the arithmetic refuses, or a seal that does not open."""
+
+
+KEY_LENGTH = 32
+SIGNATURE_LENGTH = 64
+NONCE_LENGTH = 12
+TAG_LENGTH = 16
+
+SEAL_INFO = b"quo-seal"
+"""The fixed ASCII label. The label and the info are one constant, not two."""
+
+_DRAWN = KEY_LENGTH + NONCE_LENGTH
+
+
+def _key(name: str, value: bytes) -> bytes:
+    """A key is 32 bytes. Anything else is refused before an algorithm sees it."""
+    if not isinstance(value, (bytes, bytearray)):
+        raise ArithmeticError(f"{name} must be bytes")
+    if len(value) != KEY_LENGTH:
+        raise ArithmeticError(f"{name} must be {KEY_LENGTH} bytes, got {len(value)}")
+    return bytes(value)
+
+
+def digest(data: bytes) -> bytes:
+    """SHA-256 commits."""
+    return hashlib.sha256(data).digest()
+
+
+def commitment(warden: bytes, heir: bytes) -> bytes:
+    """The pk of the warden the heir would spend at, then the heir's pk, hashed.
+
+    For a warden's own name that warden is itself.
+    """
+    return digest(_key("warden", warden) + _key("heir", heir))
+
+
+def signing_public(secret: bytes) -> bytes:
+    """The Ed25519 public key of the pair minted from these thirty-two bytes.
+
+    The bytes are the seed as Ed25519 defines it; the public key follows by the
+    algorithm's own rules.
+    """
+    private = Ed25519PrivateKey.from_private_bytes(_key("secret", secret))
+    return private.public_key().public_bytes(Encoding.Raw, PublicFormat.Raw)
+
+
+def sign(secret: bytes, message: bytes) -> bytes:
+    """Sign a message under the pair minted from this seed."""
+    private = Ed25519PrivateKey.from_private_bytes(_key("secret", secret))
+    return private.sign(bytes(message))
+
+
+# The small-order points of Curve25519's group, as Ed25519 public keys. A
+# signature under one binds to no secret, so a voice wearing one is silence.
+_SMALL_ORDER = frozenset(
+    bytes.fromhex(point)
+    for point in (
+        "0100000000000000000000000000000000000000000000000000000000000000",
+        "ecffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff7f",
+        "0000000000000000000000000000000000000000000000000000000000000000",
+        "0000000000000000000000000000000000000000000000000000000000000080",
+        "26e8958fc2b227b045c3f489f2ef98f0d5dfac05d3c63339b13802886d53fc05",
+        "c7176a703d4dd84fba3c0b760d10670f2a2053fa2c39ccc64ec7fd7792ac037a",
+        "26e8958fc2b227b045c3f489f2ef98f0d5dfac05d3c63339b13802886d53fc85",
+        "c7176a703d4dd84fba3c0b760d10670f2a2053fa2c39ccc64ec7fd7792ac03fa",
+    )
+)
+
+
+def small_order(pk: bytes) -> bool:
+    """Whether this public key is one of the curve's small-order points."""
+    return bytes(pk) in _SMALL_ORDER
+
+
+def verify(voice: bytes, message: bytes, signature: bytes) -> bool:
+    """Whether this signature stands under this voice over these bytes.
+
+    False rather than an exception: a signature that does not verify is an
+    ordinary answer, not a malformed input.
+    """
+    try:
+        public = Ed25519PublicKey.from_public_bytes(_key("voice", voice))
+    except ArithmeticError:
+        raise
+    if len(signature) != SIGNATURE_LENGTH:
+        return False
+    if small_order(voice):
+        return False
+    try:
+        public.verify(bytes(signature), bytes(message))
+    except InvalidSignature:
+        return False
+    return True
+
+
+def sealing_public(secret: bytes) -> bytes:
+    """The X25519 public key of the pair minted from these thirty-two bytes.
+
+    The bytes are the private key itself. Clamping happens inside the
+    algorithm; nothing is derived from a seed first.
+    """
+    private = X25519PrivateKey.from_private_bytes(_key("secret", secret))
+    return private.public_key().public_bytes(Encoding.Raw, PublicFormat.Raw)
+
+
+def agree(secret: bytes, public: bytes) -> bytes:
+    """The raw thirty-two-byte X25519 shared secret, exactly as it comes back.
+
+    **An agreement that hands back thirty-two zero bytes is refused at the
+    point of agreement**: the padlock was not a real key, and a seal derived
+    from it would protect nothing. ``cryptography`` refuses the degenerate
+    output itself, with a ``ValueError`` of its own that is not this module's
+    refusal — so it is caught here and said as one, and the zero check stands
+    behind it for a platform that would hand the bytes back instead.
+    """
+    private = X25519PrivateKey.from_private_bytes(_key("secret", secret))
+    other = X25519PublicKey.from_public_bytes(_key("public", public))
+    try:
+        shared = private.exchange(other)
+    except ValueError as bad:
+        raise ArithmeticError("a dead agreement") from bad
+    if shared == b"\x00" * KEY_LENGTH:
+        raise ArithmeticError("a dead agreement")
+    return shared
+
+
+def derive(shared: bytes) -> Tuple[bytes, bytes]:
+    """Draw forty-four bytes: thirty-two of key, then twelve of nonce.
+
+    HKDF-SHA-256 used whole, over the raw shared secret with nothing prepended
+    and nothing hashed first, under an empty salt — a salt of zero length,
+    not a run of zero bytes — and the fixed info ``quo-seal``.
+    """
+    drawn = HKDF(
+        algorithm=SHA256(),
+        length=_DRAWN,
+        salt=b"",
+        info=SEAL_INFO,
+    ).derive(_key("shared", shared))
+    return drawn[:KEY_LENGTH], drawn[KEY_LENGTH:]
+
+
+def seal(shared: bytes, additional: bytes, plaintext: bytes) -> bytes:
+    """AES-256-GCM under the derived key and nonce: ciphertext first, tag after.
+
+    The additional authenticated data is the ephemeral public key.
+    """
+    key, nonce = derive(shared)
+    return AESGCM(key).encrypt(nonce, bytes(plaintext), bytes(additional))
+
+
+def unseal(shared: bytes, additional: bytes, box: bytes) -> bytes:
+    """Open a box, or refuse it. The last sixteen bytes are the tag."""
+    if len(box) < TAG_LENGTH:
+        raise ArithmeticError("a box carries at least the sixteen-byte tag")
+    key, nonce = derive(shared)
+    try:
+        return AESGCM(key).decrypt(nonce, bytes(box), bytes(additional))
+    except InvalidTag as failure:
+        raise ArithmeticError("the seal does not open") from failure

quo_systems-0.1.0/src/quo/call.py

@@ -0,0 +1,99 @@
+"""Distance zero: the carriage is a call.
+
+Article III names three carriages. This is the third: two houses in one device
+or one process handing envelope bytes as bytes, a private carriage like any
+other, needing no naming because no wire exists to disagree about. There is no
+hint, because a hint is where to send bytes and here the door itself is the
+address.
+
+**Distance zero waives no step of the judgment.** The bytes handed over are the
+same sealed, signed envelope the common carriage would have carried, and the
+door behind this road spends every step of Article XII on them. The seal and
+the signature are what make the two houses two; a ground that strips them for
+being local has rebuilt the ambient permission the law exists to end. So this
+module carries no shortcut of any kind: it is the carriage with the socket
+removed and nothing else removed.
+
+Within one house there is no carriage at all, because there are no strangers.
+This road is for two houses that happen to share a process, never for a house
+talking to itself.
+
+This module is a road, not the core, and no core module imports it. Unlike the
+other two it imports no host at all — there is nothing to import, which is the
+whole of what distance zero means.
+"""
+
+from __future__ import annotations
+
+from typing import Callable, Optional
+
+__all__ = [
+    "CallError",
+    "DEFAULT_LIMIT",
+    "Door",
+    "post",
+]
+
+
+class CallError(Exception):
+    """The road failed. Never a word about the message, which the seal owns."""
+
+
+DEFAULT_LIMIT = 65536
+
+#: What a caller may hand over. A handler answers bytes, or ``None`` for silence.
+Handler = Callable[[bytes], Optional[bytes]]
+
+
+class Door:
+    """A warden's door at distance zero: bytes in, bytes out, no wire between.
+
+    ``limit`` is the largest message this door reads, which is the warden's own
+    published limit and nothing this road decided. A door that is not open
+    carries nothing, the same weather a closed socket is.
+    """
+
+    def __init__(self, handle: Handler, limit: int = DEFAULT_LIMIT) -> None:
+        self.handle = handle
+        self.limit = limit
+        self.open = False
+
+    def start(self) -> "Door":
+        self.open = True
+        return self
+
+    def close(self) -> None:
+        self.open = False
+
+    def __enter__(self) -> "Door":
+        return self.start()
+
+    def __exit__(self, *_exc) -> None:
+        self.close()
+
+
+def post(door: Door, message: bytes) -> bytes:
+    """Hand one message to the door. Returns the answer, empty for silence.
+
+    The bytes cross as bytes and nothing reads them on the way: no length is
+    negotiated, no framing is added, and the copy the door sees is its own, so
+    neither house can reach into the other's buffer after the call. A door that
+    is not open raises :class:`CallError`, which is weather rather than an
+    answer.
+    """
+    if not isinstance(door, Door):
+        raise CallError("not a door at distance zero")
+    if not isinstance(message, (bytes, bytearray)):
+        raise CallError("not bytes")
+    if not door.open:
+        raise CallError("a door that is not open")
+    body = bytes(message)
+    if len(body) == 0 or len(body) > door.limit:
+        # A message the door would not have read off a socket is not read here
+        # either, and it meets the same silence.
+        return b""
+    try:
+        answer = door.handle(body)
+    except Exception:  # a door never says which step it was
+        return b""
+    return bytes(answer) if answer else b""