Search the library

With three brokers and min.insync.replicas=2, acks=all requires the current in-sync replica set to meet the minimum. If the ISR falls to one, writes are rejected rather than acknowledged with reduced replication. acks=1 favors availability but risks losing leader-only writes if that leader fails before replication.

Start tracemalloc before the workload, take snapshots at comparable points, and compare line-level allocation differences. It tracks Python-managed allocations, not every native allocation from extensions or system libraries. Correlate it with RSS and object-retention behavior; growing allocation totals do not alone prove a leak if objects are later freed.

If neither vector is component-wise less than the other, neither history contains all represented knowledge of the other. This does not establish physical-time order or choose a globally agreed winner.

High allocation can cause frequent collections while post-GC occupancy remains broadly stable. A leak tends to retain objects that should have become unreachable, so compare heap dumps and dominator paths across time. Check allocation rate, live set, GC logs, and process/container memory together before changing heap settings.

Compare df -h with df -i. If block usage and directory totals disagree, inspect open-but-deleted files with lsof +L1. A process retains allocated blocks until it closes the file; restart or signal the owning service through its safe lifecycle after confirming the file is disposable.

If the whole source tree is copied before dependency installation, any source edit changes that COPY layer and invalidates all subsequent build steps. Copy lockfiles first, install from them, then copy source. Confirm the result with build output and a clean build; cache reuse should improve speed, not alter correctness.