nockchain 0.1.0__tar.gz

nockchain-0.1.0/LICENSE

@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2026 nockchain-go contributors
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in
+all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+THE SOFTWARE.

nockchain-0.1.0/MANIFEST.in

@@ -0,0 +1,3 @@
+include README.md SECURITY.md requirements-dev.txt
+recursive-include testdata *.json
+recursive-include tests *.py

nockchain-0.1.0/PKG-INFO

@@ -0,0 +1,227 @@
+Metadata-Version: 2.4
+Name: nockchain
+Version: 0.1.0
+Summary: Native Python Nockchain V1 wallets, transactions, multisig and timelocks
+Author: SWPSCO
+License-Expression: MIT
+Project-URL: Repository, https://github.com/SWPSCO/nockchain-py
+Keywords: nockchain,nock,wallet,multisig
+Classifier: Programming Language :: Python :: 3
+Classifier: Typing :: Typed
+Requires-Python: >=3.11
+Description-Content-Type: text/markdown
+License-File: LICENSE
+License-File: THIRD_PARTY_LICENSES
+Dynamic: license-file
+
+# nockchain
+
+Native Python tools for Nockchain V1 wallets and transactions. Derive receiving
+addresses, inspect payments, select coins, and sign single-key or multisig spends.
+Python 3.11+; the package uses the standard library and has no runtime dependencies.
+
+```sh
+pip install nockchain
+```
+
+## Receive from a public branch
+
+```python
+from nockchain import derive_receive_address, parse_public_key
+
+branch = parse_public_key(zpub)  # rejects private extended keys
+receive = derive_receive_address(branch.zpub(), 42)
+print(receive.address, receive.lock_root)
+```
+
+Reserve each receiving index durably before giving its address to a payer. Use a
+dedicated non-hardened receiving branch and retain the path and allocated-index
+range for recovery. `address` is the sending wallet's destination; `lock_root` is
+its output lock commitment. A zpub is privacy-sensitive.
+
+## Wallets and recovery
+
+```python
+from nockchain import generate_wallet, restore_wallet
+
+key, recovery = generate_wallet("")  # optional BIP39 passphrase
+# Back up recovery.words() privately before receiving funds. Never log it.
+restored = restore_wallet(recovery.words(), "")
+public_branch = key.derive("m/44'/0'/0'/9000").public().zpub()
+```
+
+`generate_mnemonic()` creates a 24-word English BIP39 phrase. Recovery accepts
+12–24 words, validates checksums, and normalizes Unicode with NFKD. A wrong
+passphrase produces a different valid wallet. `generate_seed()` creates a raw
+64-byte seed; `master(seed_bytes)` accepts one. Raw seeds have no mnemonic.
+`zprv()`, `words()`, and `Seed.to_bytes()` explicitly export spending authority.
+Diagnostic string and repr output redact secret-bearing objects.
+
+Paths start with `m` and are relative to the supplied key. Apostrophes mark
+hardened indices, which require private parents. `public()` removes the private
+scalar. Key parsing validates canonical coordinates and the Cheetah prime-order
+subgroup.
+
+## Exact amounts and coin selection
+
+```python
+from nockchain import Payment, parse_nocks, select_transfer
+
+nicks = parse_nocks("1.25")  # 81920
+plan = select_transfer(sender.public(), verified_unspent_notes, [
+    Payment(destination, "1.25"),
+])
+review = plan.summary()
+# Present the review and obtain the wallet user's authorization before signing.
+signed = plan.sign(sender)
+wire = signed.jam()
+```
+
+Amounts, heights, digest limbs, and atoms are Python integers. Floats and booleans
+are rejected at numeric protocol boundaries. `1 NOCK = 65,536 nicks`;
+`parse_nocks()` rejects sub-nick decimal precision, and `format_nocks()` is exact.
+
+`select_transfer()` chooses sufficient notes largest-first with deterministic
+note-name ties. `prepare_transfer()` consumes every supplied record. Both merge
+repeated recipients, estimate fees, and send change to the sender unless
+`TransferOptions(change_address=...)` is set. A nonzero `fee_nicks` supplies an
+explicit fee. With automatic fees, a remainder too small to pay for change
+metadata becomes part of the fee; the review shows the exact amount.
+These helpers support plain 1-of-1 PKH inputs. `sign_transfer_v1()` accepts explicit
+per-input output and fee allocations.
+
+An `UnspentNote` holds the complete note and its verified lock root:
+
+```python
+from nockchain import NoteV1, NoteName, UnspentNote, cue, parse_digest
+
+note = NoteV1(
+    origin_page=100,
+    name=NoteName(parse_digest(first), parse_digest(last)),
+    note_data=cue(stored_metadata_jam),
+    nicks=10_000_000,
+)
+unspent = UnspentNote(note, parse_digest(input_lock_root))
+```
+
+Parent commitments include version, origin, name, **all stored metadata**, and
+value. Empty metadata is `0` only when the stored record actually has none.
+The application authenticates input existence, unspent status, and confirmations.
+
+## Multisig, timelocks, and independent signing
+
+```python
+from nockchain import (
+    HeightRange, TimelockV1, LockV1, LockedPaymentV1, LockedSpendPlanV1,
+    minimum_transaction_fee_v1, prepare_transaction_v1,
+)
+
+lock = LockV1(2, (alice_pkh, bob_pkh, carol_pkh), TimelockV1(
+    relative=HeightRange(min=10),
+    absolute=HeightRange(max=500_000),
+))
+fee = minimum_transaction_fee_v1([lock], [recipient_lock])
+unsigned = prepare_transaction_v1([LockedSpendPlanV1(
+    note=verified_note, lock=lock, fee=fee,
+    outputs=(LockedPaymentV1(recipient_lock, verified_note.nicks - fee),),
+)])
+# Each signer independently reviews the same unsigned plan.
+alice = unsigned.sign(alice_key)
+bob = unsigned.sign(bob_key)
+signed = alice.merge_signatures(bob)
+signed.verify_signatures()
+signed.validate_inputs([verified_note], chain_height)
+```
+
+A lock requires **exactly m signatures**, with up to 32 distinct keys. Extra
+signatures are rejected. Timelock endpoints are inclusive; `None` is unbounded.
+Relative heights measure age since the note's origin page. Signing does not
+assert that a timelock is satisfied. Each signature changes the transaction ID.
+Partial transactions travel as jam bytes; merging rejects altered plans and
+conflicting signatures. Plans, notes, policies, and reviews are immutable.
+
+## Inspect and validate
+
+```python
+from nockchain import parse_transaction_v1
+
+tx = parse_transaction_v1(wire)
+review = tx.summary()
+tx.verify_signatures()
+tx.validate_inputs(verified_notes, chain_height)
+print(str(tx.id))
+```
+
+| Operation | What it establishes |
+| --- | --- |
+| `parse_transaction_v1()` | Supported structure, canonical trees, proof roots, key encoding, and embedded ID |
+| `summary()` | Committed outputs, fees, signature hashes, and present signers |
+| `OutputV1.lock()` | Metadata authenticates the committed output policy |
+| `verify_signatures()` | Every signature, authorization, exact threshold, and minimum fee |
+| `validate_inputs()` | Complete supplied records, parent hashes, balances, origin heights, and timelocks |
+
+Validation methods raise `NockchainError` on protocol failures and return `None`
+on success. `verify_digest()` returns a boolean. Successful parsing is not proof
+of valid signatures or chain state. The package does not fetch chain data,
+broadcast transactions, or implement confirmation policy.
+
+## Protocol primitives and limits
+
+`Digest` is an immutable tuple of five field elements. `str(digest)` encodes its
+Base58 form and `parse_digest()` validates it. `Noun` is an integer atom or an
+immutable `Cell`. Use `atom()`, `Cell(head, tail)`, `noun_tuple()`, and `noun_list()`
+for construction; `hash_words()`, `hash_noun()`, `jam()`, and `cue()` implement the
+hashing and codec primitives. Atom values must be below the Goldilocks prime;
+these are based nouns, not arbitrary-size Nock atom containers.
+
+Noun hashing and jam/cue traversal are iterative. Shared subtrees count toward
+logical expansion limits even when backreferences make the wire encoding small.
+Equality memoizes visited cell pairs. General noun operations allow 1,048,576
+logical nodes and at most 16 MiB of jam bytes.
+
+Transactions support full axis-1 PKH proofs, optional conjunctive timelocks, and
+ordinary output seeds. Other Merkle proofs, hashlocks, burn locks,
+source-constrained outputs, and bridge construction are outside this API.
+Limits are 64 inputs, 256 output seeds, 32 keys per lock, 64 metadata entries,
+2,048 flattened metadata words per output lock, 65,536 transaction nodes, and
+depth 256. Every input retains at least one nonzero output seed.
+
+Fees follow the pinned mainnet V1 schedule, merging metadata per output lock and
+rejecting conflicting values. Applications must track network rule changes.
+Private-key arithmetic is **variable-time**; use trusted offline signing tools.
+See [SECURITY.md](SECURITY.md).
+
+## Develop and verify
+
+```sh
+python -m venv .venv
+. .venv/bin/activate
+pip install -r requirements-dev.txt
+pip install -e .
+python -m unittest discover -s tests -v
+ruff check src tests
+ruff format --check src tests
+python -m build
+python -m twine check dist/*
+```
+
+The public corpus checks 35 wallet vectors, 105 signatures, 24 BIP39 vectors,
+13 TIP5 vectors, seven noun encodings, four single-key transactions, and two
+multisig transactions. Tests compare exact partial and signed bytes and the
+canonical Hoon oracle's IDs, complete note commitments, and minimum fees.
+Additional tests cover malformed input, immutable reviews, timelock boundaries,
+metadata, fees, and selection. CI tests Python 3.11 and 3.13, then builds and
+installs the wheel. Normal tests are offline and require no Go, Rust, or Hoon.
+
+The protocol source of truth is
+[zorp-corp/nockchain at `1eac020`](https://github.com/zorp-corp/nockchain/tree/1eac02083a053c104b6a1299e80a8a51447017dc).
+The port follows
+[nockchain-go v0.1.0](https://github.com/yapishu/nockchain-go/tree/v0.1.0).
+Public interoperability fixtures come from
+[tx-types at `5f9ab2b`](https://github.com/SWPSCO/tx-types/tree/5f9ab2b38f1685a908f19a0e8f18e7845b3e7f35),
+[nockster at `d621105`](https://github.com/SWPSCO/nockster/tree/d62110560dd005827ae8a46126c9841c86db0d6a),
+and [Trezor BIP39 vectors](https://github.com/trezor/python-mnemonic/blob/master/vectors.json).
+Fixture generators are in the Go repository.
+**Never send funds to public test-vector addresses.**
+
+MIT licensed. See [THIRD_PARTY_LICENSES](THIRD_PARTY_LICENSES) for wordlist attribution.

nockchain-0.1.0/README.md

@@ -0,0 +1,211 @@
+# nockchain
+
+Native Python tools for Nockchain V1 wallets and transactions. Derive receiving
+addresses, inspect payments, select coins, and sign single-key or multisig spends.
+Python 3.11+; the package uses the standard library and has no runtime dependencies.
+
+```sh
+pip install nockchain
+```
+
+## Receive from a public branch
+
+```python
+from nockchain import derive_receive_address, parse_public_key
+
+branch = parse_public_key(zpub)  # rejects private extended keys
+receive = derive_receive_address(branch.zpub(), 42)
+print(receive.address, receive.lock_root)
+```
+
+Reserve each receiving index durably before giving its address to a payer. Use a
+dedicated non-hardened receiving branch and retain the path and allocated-index
+range for recovery. `address` is the sending wallet's destination; `lock_root` is
+its output lock commitment. A zpub is privacy-sensitive.
+
+## Wallets and recovery
+
+```python
+from nockchain import generate_wallet, restore_wallet
+
+key, recovery = generate_wallet("")  # optional BIP39 passphrase
+# Back up recovery.words() privately before receiving funds. Never log it.
+restored = restore_wallet(recovery.words(), "")
+public_branch = key.derive("m/44'/0'/0'/9000").public().zpub()
+```
+
+`generate_mnemonic()` creates a 24-word English BIP39 phrase. Recovery accepts
+12–24 words, validates checksums, and normalizes Unicode with NFKD. A wrong
+passphrase produces a different valid wallet. `generate_seed()` creates a raw
+64-byte seed; `master(seed_bytes)` accepts one. Raw seeds have no mnemonic.
+`zprv()`, `words()`, and `Seed.to_bytes()` explicitly export spending authority.
+Diagnostic string and repr output redact secret-bearing objects.
+
+Paths start with `m` and are relative to the supplied key. Apostrophes mark
+hardened indices, which require private parents. `public()` removes the private
+scalar. Key parsing validates canonical coordinates and the Cheetah prime-order
+subgroup.
+
+## Exact amounts and coin selection
+
+```python
+from nockchain import Payment, parse_nocks, select_transfer
+
+nicks = parse_nocks("1.25")  # 81920
+plan = select_transfer(sender.public(), verified_unspent_notes, [
+    Payment(destination, "1.25"),
+])
+review = plan.summary()
+# Present the review and obtain the wallet user's authorization before signing.
+signed = plan.sign(sender)
+wire = signed.jam()
+```
+
+Amounts, heights, digest limbs, and atoms are Python integers. Floats and booleans
+are rejected at numeric protocol boundaries. `1 NOCK = 65,536 nicks`;
+`parse_nocks()` rejects sub-nick decimal precision, and `format_nocks()` is exact.
+
+`select_transfer()` chooses sufficient notes largest-first with deterministic
+note-name ties. `prepare_transfer()` consumes every supplied record. Both merge
+repeated recipients, estimate fees, and send change to the sender unless
+`TransferOptions(change_address=...)` is set. A nonzero `fee_nicks` supplies an
+explicit fee. With automatic fees, a remainder too small to pay for change
+metadata becomes part of the fee; the review shows the exact amount.
+These helpers support plain 1-of-1 PKH inputs. `sign_transfer_v1()` accepts explicit
+per-input output and fee allocations.
+
+An `UnspentNote` holds the complete note and its verified lock root:
+
+```python
+from nockchain import NoteV1, NoteName, UnspentNote, cue, parse_digest
+
+note = NoteV1(
+    origin_page=100,
+    name=NoteName(parse_digest(first), parse_digest(last)),
+    note_data=cue(stored_metadata_jam),
+    nicks=10_000_000,
+)
+unspent = UnspentNote(note, parse_digest(input_lock_root))
+```
+
+Parent commitments include version, origin, name, **all stored metadata**, and
+value. Empty metadata is `0` only when the stored record actually has none.
+The application authenticates input existence, unspent status, and confirmations.
+
+## Multisig, timelocks, and independent signing
+
+```python
+from nockchain import (
+    HeightRange, TimelockV1, LockV1, LockedPaymentV1, LockedSpendPlanV1,
+    minimum_transaction_fee_v1, prepare_transaction_v1,
+)
+
+lock = LockV1(2, (alice_pkh, bob_pkh, carol_pkh), TimelockV1(
+    relative=HeightRange(min=10),
+    absolute=HeightRange(max=500_000),
+))
+fee = minimum_transaction_fee_v1([lock], [recipient_lock])
+unsigned = prepare_transaction_v1([LockedSpendPlanV1(
+    note=verified_note, lock=lock, fee=fee,
+    outputs=(LockedPaymentV1(recipient_lock, verified_note.nicks - fee),),
+)])
+# Each signer independently reviews the same unsigned plan.
+alice = unsigned.sign(alice_key)
+bob = unsigned.sign(bob_key)
+signed = alice.merge_signatures(bob)
+signed.verify_signatures()
+signed.validate_inputs([verified_note], chain_height)
+```
+
+A lock requires **exactly m signatures**, with up to 32 distinct keys. Extra
+signatures are rejected. Timelock endpoints are inclusive; `None` is unbounded.
+Relative heights measure age since the note's origin page. Signing does not
+assert that a timelock is satisfied. Each signature changes the transaction ID.
+Partial transactions travel as jam bytes; merging rejects altered plans and
+conflicting signatures. Plans, notes, policies, and reviews are immutable.
+
+## Inspect and validate
+
+```python
+from nockchain import parse_transaction_v1
+
+tx = parse_transaction_v1(wire)
+review = tx.summary()
+tx.verify_signatures()
+tx.validate_inputs(verified_notes, chain_height)
+print(str(tx.id))
+```
+
+| Operation | What it establishes |
+| --- | --- |
+| `parse_transaction_v1()` | Supported structure, canonical trees, proof roots, key encoding, and embedded ID |
+| `summary()` | Committed outputs, fees, signature hashes, and present signers |
+| `OutputV1.lock()` | Metadata authenticates the committed output policy |
+| `verify_signatures()` | Every signature, authorization, exact threshold, and minimum fee |
+| `validate_inputs()` | Complete supplied records, parent hashes, balances, origin heights, and timelocks |
+
+Validation methods raise `NockchainError` on protocol failures and return `None`
+on success. `verify_digest()` returns a boolean. Successful parsing is not proof
+of valid signatures or chain state. The package does not fetch chain data,
+broadcast transactions, or implement confirmation policy.
+
+## Protocol primitives and limits
+
+`Digest` is an immutable tuple of five field elements. `str(digest)` encodes its
+Base58 form and `parse_digest()` validates it. `Noun` is an integer atom or an
+immutable `Cell`. Use `atom()`, `Cell(head, tail)`, `noun_tuple()`, and `noun_list()`
+for construction; `hash_words()`, `hash_noun()`, `jam()`, and `cue()` implement the
+hashing and codec primitives. Atom values must be below the Goldilocks prime;
+these are based nouns, not arbitrary-size Nock atom containers.
+
+Noun hashing and jam/cue traversal are iterative. Shared subtrees count toward
+logical expansion limits even when backreferences make the wire encoding small.
+Equality memoizes visited cell pairs. General noun operations allow 1,048,576
+logical nodes and at most 16 MiB of jam bytes.
+
+Transactions support full axis-1 PKH proofs, optional conjunctive timelocks, and
+ordinary output seeds. Other Merkle proofs, hashlocks, burn locks,
+source-constrained outputs, and bridge construction are outside this API.
+Limits are 64 inputs, 256 output seeds, 32 keys per lock, 64 metadata entries,
+2,048 flattened metadata words per output lock, 65,536 transaction nodes, and
+depth 256. Every input retains at least one nonzero output seed.
+
+Fees follow the pinned mainnet V1 schedule, merging metadata per output lock and
+rejecting conflicting values. Applications must track network rule changes.
+Private-key arithmetic is **variable-time**; use trusted offline signing tools.
+See [SECURITY.md](SECURITY.md).
+
+## Develop and verify
+
+```sh
+python -m venv .venv
+. .venv/bin/activate
+pip install -r requirements-dev.txt
+pip install -e .
+python -m unittest discover -s tests -v
+ruff check src tests
+ruff format --check src tests
+python -m build
+python -m twine check dist/*
+```
+
+The public corpus checks 35 wallet vectors, 105 signatures, 24 BIP39 vectors,
+13 TIP5 vectors, seven noun encodings, four single-key transactions, and two
+multisig transactions. Tests compare exact partial and signed bytes and the
+canonical Hoon oracle's IDs, complete note commitments, and minimum fees.
+Additional tests cover malformed input, immutable reviews, timelock boundaries,
+metadata, fees, and selection. CI tests Python 3.11 and 3.13, then builds and
+installs the wheel. Normal tests are offline and require no Go, Rust, or Hoon.
+
+The protocol source of truth is
+[zorp-corp/nockchain at `1eac020`](https://github.com/zorp-corp/nockchain/tree/1eac02083a053c104b6a1299e80a8a51447017dc).
+The port follows
+[nockchain-go v0.1.0](https://github.com/yapishu/nockchain-go/tree/v0.1.0).
+Public interoperability fixtures come from
+[tx-types at `5f9ab2b`](https://github.com/SWPSCO/tx-types/tree/5f9ab2b38f1685a908f19a0e8f18e7845b3e7f35),
+[nockster at `d621105`](https://github.com/SWPSCO/nockster/tree/d62110560dd005827ae8a46126c9841c86db0d6a),
+and [Trezor BIP39 vectors](https://github.com/trezor/python-mnemonic/blob/master/vectors.json).
+Fixture generators are in the Go repository.
+**Never send funds to public test-vector addresses.**
+
+MIT licensed. See [THIRD_PARTY_LICENSES](THIRD_PARTY_LICENSES) for wordlist attribution.

nockchain-0.1.0/SECURITY.md

@@ -0,0 +1,30 @@
+# Security
+
+Online services use a dedicated public receiving branch. Public extended keys
+are privacy-sensitive. A non-hardened child private key together with its parent
+zpub can expose the parent's private key.
+
+Cheetah arithmetic uses variable-time Python integer operations. Private
+operations belong in trusted offline wallet tools, not remote signing or key
+services. Python's allocator and garbage collector do not guarantee erasure of
+secret copies. `zprv()`, `words()`, and `Seed.to_bytes()` explicitly export spending
+authority. Diagnostic string/repr output is redacted; generic object serializers
+and private attributes are not secret-storage boundaries. Callers own logging,
+backups, storage, and access control.
+
+Nouns, locks, notes and transaction reviews are immutable. Decoding has byte,
+logical-node and depth limits. Parsing does not establish signature or chain
+validity. Call `verify_signatures()` and `validate_inputs()` explicitly; obtain
+complete input records, canonical height, unspent status, and confirmations from
+a trusted chain-state source.
+
+The supported V1 subset uses full PKH proofs with optional conjunctive timelocks.
+This package is not a complete consensus validator, chain client, or broadcaster.
+Fee rules are pinned to the referenced source; applications must track changes.
+Native NOCK uses nicks (2^16 per NOCK), distinct from Base ERC-20 units.
+
+Tests use public Hoon, Rust and BIP39 fixtures. No independent cryptographic audit
+is claimed. Report vulnerabilities privately through GitHub private reporting
+when available or another established private channel to the maintainers. Never
+include real seeds, private extended keys, API credentials, or identifying wallet
+data in issues or reproductions.

nockchain-0.1.0/THIRD_PARTY_LICENSES

@@ -0,0 +1,23 @@
+English BIP39 wordlist from github.com/tyler-smith/go-bip39
+
+The MIT License (MIT)
+
+Copyright (c) 2014-2018 Tyler Smith and contributors
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.

nockchain-0.1.0/pyproject.toml

@@ -0,0 +1,30 @@
+[build-system]
+requires = ["setuptools>=77"]
+build-backend = "setuptools.build_meta"
+
+[project]
+name = "nockchain"
+version = "0.1.0"
+description = "Native Python Nockchain V1 wallets, transactions, multisig and timelocks"
+readme = "README.md"
+requires-python = ">=3.11"
+license = "MIT"
+license-files = ["LICENSE", "THIRD_PARTY_LICENSES"]
+authors = [{name = "SWPSCO"}]
+keywords = ["nockchain", "nock", "wallet", "multisig"]
+classifiers = ["Programming Language :: Python :: 3", "Typing :: Typed"]
+
+[project.urls]
+Repository = "https://github.com/SWPSCO/nockchain-py"
+
+[tool.setuptools.packages.find]
+where = ["src"]
+
+[tool.setuptools.package-data]
+nockchain = ["py.typed"]
+
+[tool.ruff]
+line-length = 100
+
+[tool.ruff.lint]
+select = ["E4", "E7", "E9", "F"]

nockchain-0.1.0/requirements-dev.txt

@@ -0,0 +1,3 @@
+build==1.6.1
+twine==7.0.0
+ruff==0.17.0

nockchain-0.1.0/setup.cfg

@@ -0,0 +1,4 @@
+[egg_info]
+tag_build = 
+tag_date = 0
+