bitsharesbase.signedtransactions module

class bitsharesbase.signedtransactions.Signed_Transaction(*args, **kwargs)[source]

Bases: graphenebase.signedtransactions.Signed_Transaction

Create a signed transaction and offer method to create the signature

  • refNum (num) – parameter ref_block_num (see getBlockParams)
  • refPrefix (num) – parameter ref_block_prefix (see getBlockParams)
  • expiration (str) – expiration date
  • operations (Array) – array of operations
clear() → None. Remove all items from od.
copy() → a shallow copy of od

Read data explicitly (backwards compatibility)

default_prefix = 'BTS'
detail(*args, **kwargs)[source]
fromkeys(S[, v]) → New ordered dictionary with keys from S.

If not specified, the value defaults to None.

get(k[, d]) → D[k] if k in D, else d. d defaults to None.

The transaction id of this transaction

items() → a set-like object providing a view on D's items
keys() → a set-like object providing a view on D's keys
known_chains = {'BTS': {'prefix': 'BTS', 'chain_id': '4018d7844c78f6a6c41c6a552b898022310fc5dec06da467ee7905a8dad512c8', 'core_symbol': 'BTS'}, 'TEST': {'prefix': 'TEST', 'chain_id': '39f5e2ede1f8bc1a3a54a7914414e3779e33193f1f5693510e73cb7a87617447', 'core_symbol': 'TEST'}}

Move an existing element to the end (or beginning if last==False).

Raises KeyError if the element does not exist. When last=True, acts like a fast version of self[key]=self.pop(key).


alias of bitsharesbase.objects.Operation

pop(k[, d]) → v, remove specified key and return the corresponding

value. If key is not found, d is returned if given, otherwise KeyError is raised.

popitem() → (k, v), return and remove a (key, value) pair.

Pairs are returned in LIFO order if last is true or FIFO order if false.

setdefault(k[, d]) → od.get(k,d), also set od[k]=d if k not in od
sign(wifkeys, chain=None)[source]

Sign the transaction with the provided private keys.

  • wifkeys (array) – Array of wif keys
  • chain (str) – identifier for the chain
update([E, ]**F) → None. Update D from dict/iterable E and F.

If E is present and has a .keys() method, then does: for k in E: D[k] = E[k] If E is present and lacks a .keys() method, then does: for k, v in E: D[k] = v In either case, this is followed by: for k in F: D[k] = F[k]

values() → an object providing a view on D's values
verify(pubkeys=[], chain=None)[source]