Yes, through optimistic concurrency control. Each writer reads the current metadata, prepares its commit, and then attempts an atomic swap of the metadata pointer. If another writer committed first, the slower writer retries. This model avoids distributed locks while still guaranteeing that only one snapshot becomes the committed table state at any moment.