# I am the Watcher. I am your guide through this vast new twtiverse.
# 
# Usage:
#     https://watcher.sour.is/api/plain/users              View list of users and latest twt date.
#     https://watcher.sour.is/api/plain/twt                View all twts.
#     https://watcher.sour.is/api/plain/mentions?uri=:uri  View all mentions for uri.
#     https://watcher.sour.is/api/plain/conv/:hash         View all twts for a conversation subject.
# 
# Options:
#     uri     Filter to show a specific users twts.
#     offset  Start index for quey.
#     limit   Count of items to return (going back in time).
# 
# twt range = 1 1
# self = https://watcher.sour.is/conv/2ix7hfa
yue-fang-readfog
feeds.twtxt.net
View Thread
內存一致性模型**
在計算機科學中, 當然只有 兩件難事 [1] : 緩存失效、命名和漏掉一個錯誤。但是在計算機科學的高草叢中還隱藏着另一個難題: 按順序看事物。無論是 排序 [2] 、 亂序 [3] 還是 發推文 [4] , 按順序看事物都是一個歷史悠久的挑戰。一個常見的排序挑戰是內存一致性, 即定義並行線程如何觀察其共享內存狀態的問題。關於內存一致性有許多資源, 但大多數要麼是 幻燈片 [5] (比如 我的 [6 ⌘ [Read more](https://www.readfog.com/a/1735097465556799488)