VaultChainScanManifest

Documentation for eth_defi.vault.scan_manifest.VaultChainScanManifest Python class.

class VaultChainScanManifest

Bases: TypedDict

Separate successful collection from the newest published observation.

The builder combines scanner provenance with cleaned parquet maxima. A metadata-only scan cannot advance collection time, and a completed price scan need not have received new candles. Both fields are UTC ISO-8601 strings ending in Z, or None when unknown.

Attributes summary

`name`	Human-readable label; consumers select chains by numeric key.
`last_successful_price_scan_ended_at`	Completion time of the last successful price fetch, or `None` if unknown.
`last_candle_at`	Maximum timestamp in the published cleaned file, including hourly bucket labels from sparse observations.

Methods summary

`__init__`(args, *kwargs)
`clear`()	Remove all items from the dict.
`copy`()	Return a shallow copy of the dict.
`fromkeys`([value])	Create a new dictionary with keys from iterable and values set to value.
`get`(key[, default])	Return the value for key if key is in the dictionary, else default.
`items`()	Return a set-like object providing a view on the dict's items.
`keys`()	Return a set-like object providing a view on the dict's keys.
`pop`(k[,d])	If the key is not found, return the default if given; otherwise, raise a KeyError.
`popitem`()	Remove and return a (key, value) pair as a 2-tuple.
`setdefault`(key[, default])	Insert key with a value of default if key is not in the dictionary.
`update`([E, ]**F)	If E is present and has a .keys() method, then does: for k in E.keys(): 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`()	Return an object providing a view on the dict's values.

name: str: Human-readable label; consumers select chains by numeric key.

last_successful_price_scan_ended_at: Optional[str]: Completion time of the last successful price fetch, or None if unknown.

last_candle_at: Optional[str]: Maximum timestamp in the published cleaned file, including hourly bucket labels from sparse observations. This is not per-vault completeness.

__init__(*args, **kwargs)

__new__(**kwargs)

clear(): Remove all items from the dict.

copy(): Return a shallow copy of the dict.

fromkeys(value=None, /): Create a new dictionary with keys from iterable and values set to value.

get(key, default=None, /): Return the value for key if key is in the dictionary, else default.

items(): Return a set-like object providing a view on the dict’s items.

keys(): Return a set-like object providing a view on the dict’s keys.

pop(k[, d]) → v, remove specified key and return the corresponding value.: If the key is not found, return the default if given; otherwise, raise a KeyError.

popitem()

Remove and return a (key, value) pair as a 2-tuple.

Pairs are returned in LIFO (last-in, first-out) order. Raises KeyError if the dict is empty.

setdefault(key, default=None, /)

Insert key with a value of default if key is not in the dictionary.

Return the value for key if key is in the dictionary, else default.

update([E, ]**F) → None. Update D from mapping/iterable E and F.: If E is present and has a .keys() method, then does: for k in E.keys(): 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(): Return an object providing a view on the dict’s values.