# Farcaster Authors - Farcaster Protocol (Highlights)  ## Highlights - The state of the social network is a graph where each vertex is an entity like a user or message, and each edge is a relationship between entities. ([View Highlight](https://read.readwise.io/read/01gtns4dq9vgkbg0xjw4rjydkz)) ^485940556 - A delta is an action a user takes, like posting a message or liking something. ([View Highlight](https://read.readwise.io/read/01gtns3ft91vsvv8y00qnkqden)) ^485940408 - Each delta is an atomic operation that may add one or more vertices or edges to the social graph. ([View Highlight](https://read.readwise.io/read/01gtns2yaqjydfsy52k6y69sdj)) ^485940386 - Our design goal, in formal terms, is to simplify syncing by making deltas commutative, associative, and idempotent across the graph. ([View Highlight](https://read.readwise.io/read/01gtns2hjn5m5q3tyn2nzsf9cs)) ^485940345 - The delta graph checks any new delta's identifier against all known deltas sand discards it if it is a duplicate. ([View Highlight](https://read.readwise.io/read/01gtns6p81xaeftebw79zn9d1a)) ^485940684 - Deltas must have a conflict identifier c and a total ordering scheme. The delta graph discards the delta with the lowest order whenever two deltas have the same c value. ([View Highlight](https://read.readwise.io/read/01gtns6d4wt6qk09byj83keyec)) ^485940671