Update concurrency · Documentation-based guide with original exercise

Concurrent Make updates: arrival order and data version

Content updated:

Scope: Documentation-based guide reviewed on 8 October 2026. Examples are fictional and protocols proposed; they are not product tests performed by CallsIQ.

Short answer

Ordered event processing reduces overlap within a scenario, but arrival order is not business-version order. Retain record ID, event ID and version; also check other writers and whether the destination supports conditional updates.

Key verification: A stale event must not overwrite newer data merely because it arrives or retries later.

Sources and limitations

Two successful executions can leave an incorrect final value. This happens when both read the same version, calculate different changes and write the whole record. Neither duplicate webhooks nor HTTP failures are required. This guide identifies that race and proposes a write rule preserving the business’s current state.

Original simulation of a lost update

Make: prevent concurrent updates overwriting data: table 1
StepExecution AExecution B
ReadAmount 500; old phoneAmount 500; old phone
Local changeUpdates amount to 600Updates phone
Whole-record writeSaves 600 and old phoneLater saves 500 and new phone

The destination retains the new phone but returns to 500. Both runs may appear successful. First check whether you can write only the changed field, without reconstructing the rest from an old read. Then identify dependencies: if phone and amount must change together as one operation, two independent partial writes are not enough either.

What ordered processing solves

Make documents Process data in order: one run finishes before the next starts, while webhooks are parallel by default. Review that option and incomplete executions in your scenario. Local serialisation does not stop a person or another scenario writing concurrently to the destination.

Business version versus receipt order

Proposed example: version 3 arrives first, followed by a delayed version 2. Saving both sequentially without another rule leaves stale data. Compare the event version with the applied version and retain stale events as rejected with a reason. Evaluate atomic compare-and-update if the destination provides it; separate read, compare and write steps can still race.

Accept the change with adverse cases

Rehearse two nearby distinct events, a late stale event and a failure between reading and writing. Retain authorised traces without secrets and check final state, rejections and pending work. Preserve recoverable settings before modifying production. These are CallsIQ documentary proposals, not tests performed in Make. A native integration with version control may suffice; compare scope before adding automation.

Sources and limitations

Documentary review: . Content type: Documentation-based guide with original exercise.

Sources describe terms and capabilities stated by their owners. Proposed protocols and fictional examples do not establish product tests performed by CallsIQ.

How to report a correction

Check current terms

Consider these options if they solve the problem described. Confirm features, limits and availability in your country.

MakeAffiliate link

The labelled commercial links may earn CallsIQ a commission or referral reward. Our commercial policy.

How this guide was prepared

Official sources, explained calculations and clearly labelled examples. Read about our methodology and use of AI in writing.