event_connect
event_connect is a protocol-independent Python library for building device clients. You describe a device as a set of typed points. event_connect then:
- decides when to read each point;
- notifies subscribers when a value changes;
- schedules follow-up reads after a write or a change;
- keeps the last known value, marked stale, when a reply is lost;
- decides when the device counts as offline, and stops asking a device that has gone silent.
You supply the protocol: where each value is stored on the device, how it is encoded, and how a request is sent. event_connect performs no I/O and never sleeps, so everything it decides can be tested without a device.
Requirements
- Python 3.14 or later.
- No dependencies outside the standard library.
- Fully typed (
py.typed). - Status: alpha. Until 1.0, only a new minor version may change the API.
Installation
pip install event-connect
In your package, require a range of versions up to the next one that may break the API, for
example event_connect>=0.5,<0.6. Versioning explains why.
Concepts
- Point: one value on the device, such as a temperature, a set point or a command. A point
is identified by a typed
Keyand describes how the value behaves: how often it is read, what may be written, and which other points to read again when it changes. - Key: the name of a point, carrying the type of its value.
Key("temperature", float)is a string at runtime, so it works as a dictionary key and in logs. - Poll rate: how often a point is read (
FAST,MEDIUM,SLOW,RARE,STATIC). ATimingmaps each rate a device's points are read at to seconds; aSTATICpoint is never read on a timer, and has none. - Pass: one round in which the client reads everything that is due.
- Quality: how far a value can be trusted.
GOODmeans the device answered.STALEmeans the last read failed and the value is the last good one. - Refresh: an extra read of other points, a set time after a write or a change.
- Deadband: the smallest change of a value that counts as a change. Smaller movements are not reported, and they count as settled.
Quick start
The scheduler tells you which points to read. You read them with your protocol and record the outcome.
from dataclasses import KW_ONLY, dataclass
from event_connect import DataValue, Key, Point, PollRate, Quality, Timing
from event_connect.testing import FakeClock
@dataclass(frozen=True, eq=False)
class RegisterPoint[T](Point[T]):
"""A value in one register of the device."""
_: KW_ONLY
register: int
@property
def readable(self) -> bool:
return True
@property
def writable(self) -> bool:
return False
TEMPERATURE = Key("temperature", float)
clock = FakeClock()
timing = Timing(poll_intervals={PollRate.FAST: 10.0}, read_back_after=1.0)
scheduler = timing.scheduler(clock)
scheduler.set_points([RegisterPoint(TEMPERATURE, register=1, poll_rate=PollRate.FAST)])
scheduler.set_polled(TEMPERATURE, True)
assert scheduler.due() == ["temperature"] # never read, so due now
value = DataValue(21.5, Quality.GOOD, clock.now(), raw=(215,)) # as your protocol decoded it
scheduler.record(TEMPERATURE, value, success=True)
assert scheduler.due() == [] # due again after its poll interval
Each point keeps its own rhythm, counted from its last regular read. Whenever a point is due, the points due within the next second, and at most a tenth of their interval, are returned with it and take its rhythm. Points read together therefore stay together, and one request can carry them, where moments between their records would otherwise drift them apart until each is read alone.
Example: a complete client
The client below reads an imaginary device that answers a list of register numbers with their
values, or not at all. send stands in for the protocol; every other call the Client class
makes is to event_connect. At the end, main() runs it against a fake device and a fake clock.
import asyncio
from collections.abc import Awaitable, Callable, Mapping, Sequence
from dataclasses import KW_ONLY, dataclass
from typing import Any
from event_connect import (
CircuitBreaker, Clock, DataValue, Fixed, Key, Passes, Point, PollRate, Quality, Reachability,
Retry, Status, StatusBoard, Subscriptions, SystemClock, Timing, ValueCallback, stale,
)
from event_connect.testing import FakeClock
# 1. Points: subclass Point to add the value's address, and declare whether it can be
# read and written.
@dataclass(frozen=True, eq=False)
class RegisterPoint[T](Point[T]):
"""A value in one register of the device, in tenths."""
_: KW_ONLY
register: int
@property
def readable(self) -> bool:
return True
@property
def writable(self) -> bool:
return False
TEMPERATURE = Key("temperature", float)
POINTS = [RegisterPoint(TEMPERATURE, register=1, poll_rate=PollRate.FAST)]
# 2. Timing: the interval of each poll rate the points use, and how long a write takes to
# show. How many reads of the fastest rate the device may miss before it counts as
# offline. The breaker: after how many unanswered requests in a row to stop asking, and
# when to ask again - here every 10 s, for ever.
TIMING = Timing(poll_intervals={PollRate.FAST: 10.0}, read_back_after=1.0)
OFFLINE_AFTER_INTERVALS = 3
BREAKER = CircuitBreaker(after=2, retry=Retry(Fixed(10.0), None))
Send = Callable[[Sequence[int]], Awaitable[Mapping[int, int] | None]]
class Client:
def __init__(self, send: Send, clock: Clock | None = None) -> None:
self._send = send # the protocol: register numbers in, values out, None if no reply
self._clock = clock or SystemClock()
self._points: dict[str, RegisterPoint[Any]] = {point.key: point for point in POINTS}
self._values: dict[str, DataValue[Any]] = {}
self._scheduler = TIMING.scheduler(self._clock)
self._scheduler.set_points(POINTS)
self._subscriptions = Subscriptions()
self._reachability = Reachability(self._clock, offline_after_intervals=OFFLINE_AFTER_INTERVALS,
fastest_interval=TIMING.fastest_interval, name="The device")
self._statuses = StatusBoard(self._clock)
self._breaker = BREAKER.breaker()
self._passes = Passes()
# 3. Subscribing: a subscribed key is polled, and its subscriber is told when the
# quality changes or the value moves by at least the point's deadband.
def subscribe(self, key: Key[Any], callback: ValueCallback[Any]) -> None:
self._subscriptions.add(key, callback, polls=True)
self._scheduler.set_polled(key, True)
# 4. Polling: read what is due, one pass at a time. Call poll() again at the monotonic
# time self._scheduler.next_due() returns; None means nothing will be due.
async def poll(self) -> None:
await self._passes.run(self._pass, due=lambda: bool(self._scheduler.due()))
async def _pass(self) -> None:
points = [self._points[key] for key in self._scheduler.due()]
if not points:
return
answer = await self._request([point.register for point in points])
for point in points:
previous = self._values.get(point.key)
if answer is None:
data = stale(previous, self._clock.now())
else:
raw = answer[point.register]
data = DataValue(raw / 10, Quality.GOOD, self._clock.now(), raw=(raw,))
self._values[point.key] = data
self._subscriptions.report(point, data)
self._scheduler.record(point.key, data, success=answer is not None)
# 5. Sending a request: skipped while the circuit breaker is open. Every outcome is
# reported to the breaker, and to Reachability, a skipped request among them; whether
# the device now counts as online is published as Status.CONNECTED.
async def _request(self, registers: Sequence[int]) -> Mapping[int, int] | None:
answer: Mapping[int, int] | None = None
attempt = self._breaker.attempt(self._clock.monotonic())
if attempt is not None:
with attempt:
answer = await self._send(registers)
if answer is None:
attempt.unanswered(self._clock.monotonic())
else:
attempt.answered()
if answer is None:
self._reachability.unanswered()
else:
self._reachability.answered(self._scheduler)
self._statuses.set(Status.CONNECTED, self._reachability.reachable)
return answer
async def device(registers: Sequence[int]) -> Mapping[int, int]:
return {register: 215 for register in registers}
async def main() -> None:
client = Client(device, clock=FakeClock())
seen: list[float | None] = []
client.subscribe(TEMPERATURE, lambda key, old, new: seen.append(new.value))
await client.poll()
assert seen == [21.5]
asyncio.run(main())
A real client also:
- runs a loop that sleeps on its clock until the time
next_due()returns; - offers the whole of
DeviceClient, described below, so that it is used as every other client is; - handles writes: it refuses a value that
point.limits.problem(value)names a reason for, reads the written point back afterTiming.written_point_delay(point), and reads the points itson_writerefresh selects withselect()afterTiming.on_write_delay(point); - compares each new value with the last one using
changed(old, new, point.on_change.when), and schedules the point'son_changerefresh when it has changed; - keeps
set_polledin step withshould_poll(point, subscriptions, polled)for every point, and again whenever a subscriber comes or leaves or a consumer asks for a point; - holds
Status.WRITE_PENDINGwithStatusBoard.holding()while a write is in flight, so that overlapping writes show as one; - passes
retry_aftertorecord()when its protocol wants a failed read retried sooner.
How it works
Points
A Point[T] describes how one value behaves:
poll_rate: how often it is read; every point that can be read has one, and no other.poll_always: read even when nobody subscribes, because the client itself needs the value.deadband: the smallest change that is reported.limits: what may be written.unit: the unit of the value.write_kind: whether a write is a setting or a command.pulsemakes a command return to its idle value by itself: write, wait, write the idle value.on_write,on_change: the follow-up reads a write or a change triggers.labels: tags that aRefreshcan select points by.certainty: how certain it is that the point is what it says;REPORTEDuntil it has been read on a unit.candidate: set, as aCandidate, on a point used only at the Test level; see Levels and candidates.
write_range() gives the values a point can be written with, as a WriteRange(min, max, step):
from its limits, or None without a minimum and a maximum. A protocol's point overrides it where
it knows more, such as what its encoding can carry.
A point validates itself when it is created, and raises one error that lists every
inconsistency. Your subclass adds where the value is stored. It overrides readable and
writable to say which directions it supports, and problems() to add its protocol's own
checks.
Levels and candidates
A consumer chooses how certain a point must be to be used, as a Level:
| Level | Uses |
|---|---|
VERIFIED |
points read on a unit of the model |
DOCUMENTED |
those, and points stated in the model's documentation |
TEST |
every point, whatever its certainty, and each candidate in place of the point it replaces |
A candidate is the next guess at a point: a point used only at TEST, marked
candidate=Candidate(). With Candidate(replaces=key), it takes the place of the point of that
key, which TEST then leaves out; below TEST, the candidate is left out and that point is used.
A candidate may replace a point of its own key, to read the key from another place: a consumer
that stores the key keeps it. Once a candidate has been read on a unit, it becomes an ordinary
point, and the point it replaced is removed.
points_at(points, level) gives the points a level uses, in the order given.
candidates_in_place(points, level) gives the same points before their certainty is weighed,
for a client that still reads a point the level leaves out, such as one it needs to find out
what the unit has. A level is stored by its text, Level("documented").
from event_connect import Candidate, Certainty, Key, Level, PollRate, points_at
from event_connect.testing import FakePoint
REHEAT = Key("reheat", bool)
COIL = Key("coil", int)
points = [
FakePoint(REHEAT, poll_rate=PollRate.SLOW, certainty=Certainty.VERIFIED),
FakePoint(COIL, poll_rate=PollRate.SLOW, candidate=Candidate(replaces=REHEAT)),
FakePoint(Key("guess", int), poll_rate=PollRate.SLOW, certainty=Certainty.INFERRED),
]
assert [point.key for point in points_at(points, Level.VERIFIED)] == ["reheat"]
assert [point.key for point in points_at(points, Level.DOCUMENTED)] == ["reheat"]
assert [point.key for point in points_at(points, Level.TEST)] == ["coil", "guess"]
Which key a candidate names, and that it names a point of the same model, is for the protocol package to check: a point knows nothing of the others.
Follow-up reads
Devices do not push updates, and points are read at different rates. When one value changes, a
value that depends on it may not be read again for a long time. A Refresh(targets, after, until_stable, when=...) schedules extra reads of those dependent points:
- It reads
targetsafterseconds after a write (on_write) or a change (on_change). - With
until_stableset, it keeps reading them everyafterseconds until two reads in a row agree, for at mostuntil_stableseconds from the write or change. Two reads agree when they have the same quality and equal values, or values within the point'sdeadbandwhere it has one. A failed read neither ends it nor counts. whenlimits the trigger to a value that rises or one that falls.
If after is None, a refresh triggered by a write waits the device's
Timing.read_back_after, and one triggered by a change runs at once. Timing.on_write_delay(point)
gives the wait after a write. The written point itself is always read back after
Timing.read_back_after, which Timing.written_point_delay(point) gives, whatever its on_write
says.
select(points, targets) gives the points a refresh names: for keys, in the order given, and a
KeyError naming every key that none of the points has; for Labels, every point that carries
them, in the order of the points.
Scheduling
The scheduler decides what to read; your client performs the reads.
due()lists the keys to read now, in this order:- extra reads, both refreshes and retries asked for with
retry_after, the earliest first; - keys never read;
- the most overdue keys.
- extra reads, both refreshes and retries asked for with
- After reading, your client calls
record()for each key. This also advances anyuntil_stablerefresh in progress. next_due()returns the monotonic time at which something is next due, orNoneif nothing ever will be.- Only keys marked polled with
set_polled(key, True)are read on their interval or by a refresh. A forced refresh (refresh(..., force=True)) reads any key.
Three rules hold throughout:
- One request at a time. Keep one request in flight per device, and read everything
due()lists in as few requests as the protocol allows. What fell due while a slow reply was awaited goes out together in the next request. WithPasses, a call made during a pass waits for it, then makes its own pass only if something is still due. - Refreshes don't shift the schedule. An extra read does not delay the key's next regular read, so keys that are polled together stay in the same request.
- Your protocol decides when to retry. Only the protocol knows what a failure means: a busy
device, a gateway that has no data yet, or a device that has stopped answering. Pass
retry_aftertorecord()to ask for a failed read to be retried that many seconds later; without it, the read waits for its next regular turn. A refresh reads when it says.
A Scheduler is given the interval of every poll rate its points are read at, and nothing else:
set_points() refuses a point that can be read at a rate it has no interval for, naming every
such point. A Timing holds the intervals, with how long a write takes to show; its
scheduler(clock) plans by them.
Unresponsive devices
- One lost reply is not an outage.
Reachability(clock, offline_after_intervals=n, fastest_interval=s)reports a device online as soon as it answers. It reports it offline at the first unanswered request made at leastntimessseconds after the first unanswered one: the device may missnreads of its fastest poll rate, whichTiming.fastest_intervalgives. Three missed reads of a 10 s rate allow 30 s of silence. Where nothing is read on a timer (fastest_interval=None), the first unanswered request counts. Tell it about every request, including one the breaker skips. A device counts as offline until it first answers. - Missed reads are caught up when the device answers again. After a silence,
answered(scheduler)makes every key whose last read failed due at once. If the device had counted as offline, it makes every polled key due as if it had never been read, and drops pending refreshes and retries. Going offline and coming back online are each logged once, at INFO level. - A silent device is not asked again and again. A
CircuitBreaker(after=, retry=)opens afterafterunanswered requests in a row; each pause isretry's next delay, after which one probe goes through. Each device keeps its ownBreakerof these settings.attempt()returns a handle for one request, or None while the breaker refuses it; report the outcome on the handle. Used as a context manager, it releases the probe if no outcome was reported, so a cancelled request does not block later ones. Once the retry gives up (gave_up), nothing goes through untilreset(), as when the device is connected afresh. Before letting a probe go, askawait retry.ready(); if it says no,postpone(now)waits the same pause again.
The shared client
DeviceClient is a typing.Protocol of what every client of a device offers, so that a consumer
uses each the same way: connect(), disconnect(), run() and poll(); refresh(), write()
and write_sequence(); value(), values, status(); the subscriptions to values, statuses
and points; set_polling() and set_scheduled_polling(); points, model, identity, has(),
can_read(), can_write(), select(), instances() and unavailable_reasons; silent,
silent_for, consecutive_failures(), seconds_until_next_poll() and diagnostics(). Its
model is a ModelInfo: a name and a manufacturer. A client is checked against it both by a type
checker and at runtime:
from event_connect import DeviceClient
assert not isinstance(object(), DeviceClient)
Every client behaves alike where the protocol does not decide: poll, refresh and write raise
NotConnectedError until connect(), and again from disconnect() until the next connect(),
which also turns Status.CONNECTED False; points, model and seconds_until_next_poll raise it
until the first connect(); value(key) is None for a key the device has no value for; and
subscribe(key) raises KeyError for a key no model of the client has.
Retry policies
These objects only make decisions; your protocol code asks them and acts:
from event_connect import NO_RETRY, Attempts, CircuitBreaker, Exponential, Fixed, Jitter, Retry, Steps, Within
busy = Retry(wait=Exponential(0.2, factor=2, max=None), stop=Attempts(4)) # a busy reply
no_data_yet = Retry(wait=Steps(0.5, then=Fixed(1)), stop=Within(7.5)) # a gateway with no data yet
silent = CircuitBreaker(after=3, retry=Retry(Jitter(Exponential(10, factor=2, max=120), spread=0.1), None)) # ask again for ever
reconnect = CircuitBreaker(after=3, retry=Retry(Exponential(2, factor=2, max=10), Attempts(8))) # 7 probes, then give up
once = CircuitBreaker(after=1, retry=NO_RETRY) # never again until reset()
assert busy.next_delay(attempts=1, elapsed=0.0) == 0.2 # None once it is time to give up
assert Retry(Fixed(10), None).next_delay(attempts=1000, elapsed=86400.0) == 10 # no stop: never gives up
A breaker's retry counts openings, not requests: the first opening is the after unanswered
requests, and each later one an unanswered probe. Attempts(8) therefore gives up at the eighth
opening, after seven probes.
A retry that checks something before each try is a subclass with its own ready. It is frozen,
like every Retry, so it asks something outside itself:
import asyncio
from collections.abc import Callable
from dataclasses import dataclass
from event_connect import Exponential, Retry
@dataclass(frozen=True, kw_only=True)
class WhenOnline(Retry):
online: Callable[[], bool] # your own check: a ping, the OS, the app
async def ready(self) -> bool:
return self.online()
network = {"up": False}
retry = WhenOnline(Exponential(2, factor=2, max=10), None, online=lambda: network["up"])
assert not asyncio.run(retry.ready())
network["up"] = True
assert asyncio.run(retry.ready())
| Part | Decides |
|---|---|
Fixed(s), Exponential(start, factor=, max=), Steps(a, b, ..., then=), Jitter(wait, spread) |
how long to wait before the next try |
Attempts(n), Within(s), combined with | |
when to give up |
Retry(wait, stop) |
the delay before each retry, until the stop condition is met; with a stop of None, forever |
CircuitBreaker(after=, retry=) |
when to stop asking a silent device, and when to let one probe through |
Write these policies out where your device is defined. No part has a default for a number it
goes by: an Exponential names its factor and its max (None for no cap), a Jitter its
spread, a Retry its stop, and a CircuitBreaker takes both its settings by name.
Measuring a device
Base the delays in Timing and in each Refresh on measurements of a real device, not on
guesses. Record response times in a Latency, and the readings after a change in a Settling.
recommended_refresh() derives after and until_stable from the slowest settling time, with
room for a change margin times as slow:
from event_connect.testing import Latency, Settling, recommended_refresh
latency = Latency(answers=(0.04, 0.05, None, 0.06)) # seconds per request; None: no reply
assert latency.slowest == 0.06 and latency.unanswered == 1
# A fan speed read once a second after it was set: it settles 4 s after the change.
fan = Settling("fan speed 1 to 3", readings=((1, 600), (2, 900), (3, 1180), (4, 1200), (5, 1205)),
tolerance=20)
assert recommended_refresh((fan,), every=1, margin=2) == (4, 8) # after=4, until_stable=8
API overview
Everything is imported from event_connect, and test support from event_connect.testing.
Describing points
Key[T]: the typed name of a point.is_key()andis_state_type()check a value and a type.Point[T]: the base class for your points.PollRate,Limits,Unit,WriteKind,Pulse: parts of a point.WriteRange: the values a point can be written with, fromPoint.write_range().Transform,Transforms: conversions between the device's value and the value shown.Certainty: how certain it is that a point is what it says, as itscertaintyfield.Candidate: what makes a point a candidate, as itscandidatefield, and the key it replaces.VALUE_TYPES,is_instance(): the types a value may have, and a check for one.
Levels
Level: how certain a point must be to be used, and whether candidates are tried.points_at(): the points a level uses.candidates_in_place(): the same, before their certainty is weighed.
Values
DataValue[T]: a value with itsQuality, the time it was read, and the raw reply.Quality.shows_a_valuesays whether there is something to show: the value, or that the device has no reading.Value: the type of a point's value.stale(): the previous value, marked stale, for use when a read fails.
Scheduling
Timing: a device's poll intervals and the wait for a write to show.Scheduler: decides which keys are due.Passes: runs one polling pass at a time.
Follow-up reads
Refresh: extra reads after a write or a change.Change,changed(): which changes trigger a refresh, and the check for one.Labels,Selector,selector(),select(): choosing the points a refresh reads.
Notifications
Subscriptions,Subscriber,ValueCallback,tell(): subscribers to values and the calls that notify them.should_poll(): whether anything wants a point read on its schedule.Status,StatusBoard,StatusCallback: client state that is not a point, such as whether the device is connected.
Writes
Write[T]: one write of a sequence.
Clients
DeviceClient: what every client of a device offers, whatever its protocol.ModelInfo: the name and manufacturer of a device's model.Identity: what a device reports about itself.PointsCallback: called with the keys a device has gained and lost.
Unresponsive devices and retries
Reachability: whether the device is online.CircuitBreaker,Breaker,Attempt: when to stop asking a silent device.Retry,NO_RETRY: how a failed request is retried, and a silent device asked again.WaitwithFixed,Exponential,Steps,Jitter: delays between tries.StopwithAttempts,Within,AnyOf: when to give up.
Exceptions
ClientError, and its subclassesCannotConnectError,NotConnectedError,ReadOnlyError,UnsupportedDeviceErrorandAuthenticationError.InvalidValueErrorandModelError, which areValueErrorsubclasses rather thanClientErrorones.
Time
Clock: the interface for a clock: monotonic time to schedule by, wall time to stamp values with, andsleep()on the monotonic one.SystemClockis the real one.
Testing (event_connect.testing)
FakeClock: a clock that moves only when told. Itssleep()ends onceadvance()reaches its end; withFakeClock(autojump=True)it moves the clock itself and returns at once.sleepsrecords what each sleep asked for.FakePoint: a point without a protocol.Latency,Settling,recommended_refresh(): turning measurements into waits.
Versioning
event_connect follows semantic versioning. Before 1.0, only a new minor version may break the API, and a patch fixes or adds; from 1.0 on, only a major version may break it, and a minor version adds.
A Python environment holds one version of each package. An application that uses two packages built on event_connect therefore gets one copy of it, and that copy must satisfy both. If one of them pinned an exact version, the other would have to want that same version, or the two could not be installed together. So require a range: from the version whose features you use, up to the next version that may break the API.
License
MIT. See LICENSE.
Metadata
Release files for event-connect 0.5.1
For a detailed explanation of source distributions (sdists) and built distributions (wheels), please see the package formats documentation.
Source distribution (sdist)
| File | Size | Uploaded | Provenance | Actions |
|---|---|---|---|---|
| event_connect-0.5.1.tar.gz | 83.1 kB | With provenance | Details for event_connect-0.5.1.tar.gz |
Built distribution (wheel)
| File | Interpreter | ABI | Platform | Actions Reset |
|---|---|---|---|---|
| event_connect-0.5.1-py3-none-any.whl | Python 3 | none | any | Details for event_connect-0.5.1-py3-none-any.whl |
Total release size: 129.5 kB
Release files / event_connect-0.5.1.tar.gz
| Download URL | event_connect-0.5.1.tar.gz |
|---|---|
| Size | 83.1 kB |
| Tags | Source |
|
SHA-256 checksum How to use checksums |
5d888506135e8672d21fb08e37448a3171a1b8f80aa75e12e22bf7c9e3a32654
|
|
BLAKE2b-256 checksum How to use checksums |
1b7217f714d8c4e06fc499b0384f204f5b893493f23ac7026971a055777059f1
|
| Upload date | |
|
Uploaded using Trusted Publishing? What is trusted publishing? |
Yes |
| Uploaded via |
twine/7.0.0 CPython/3.13.16
|
Provenance
Provenance describes where a file came from. On PyPI, provenance is shared via attestations, which provide a verifiable record of the build or publishing details. View details, limitations and caveats.
PyPI Publish Attestation
PyPI verified that this artifact, at this checksum, originated from the publisher listed below.
Signed by GitHub Actions, verified by PyPI on Nov 19, 2026.
Transparency logRelease files / event_connect-0.5.1-py3-none-any.whl
| Download URL | event_connect-0.5.1-py3-none-any.whl |
|---|---|
| Size | 46.4 kB |
| Tags | Python 3 |
|
SHA-256 checksum How to use checksums |
b7f1d016462236e944bfe195356c56fd081645525dd250456e64102d14a2ed9e
|
|
BLAKE2b-256 checksum How to use checksums |
065df1cb9cabff05478bb1199bef2c265387c431445627e91916342b824b52e2
|
| Upload date | |
|
Uploaded using Trusted Publishing? What is trusted publishing? |
Yes |
| Uploaded via |
twine/7.0.0 CPython/3.13.16
|
Provenance
Provenance describes where a file came from. On PyPI, provenance is shared via attestations, which provide a verifiable record of the build or publishing details. View details, limitations and caveats.
PyPI Publish Attestation
PyPI verified that this artifact, at this checksum, originated from the publisher listed below.
Signed by GitHub Actions, verified by PyPI on Nov 19, 2026.
Transparency logSecurity for event-connect 0.5.1
Provenance
Provenance describes where a file came from. On PyPI, provenance is shared via attestations, which provide a verifiable record of the build or publishing details. View details, limitations and caveats.
Full provenance
Both files in this release have been uploaded with provenance metadata.
Attestation for event_connect-0.5.1.tar.gz
PyPI Publish Attestation
PyPI verified that this artifact, at this checksum, originated from the publisher listed below.
Signed by GitHub Actions, verified by PyPI on Nov 19, 2026.
Transparency logA note on package security
PyPI is a repository for distributing packages, not a service for auditing them. While third-party security researchers and our staff do their best to detect and remove malicious packages, PyPI cannot guarantee the quality, security or suitability of any given package.
To learn more about protecting yourself from malicious actors, visit our package security documentation.