當我們使用擴展因子 8 時，我們將在 p(x) 上計算另外 32 * (8-1) 個點。 由于兩個不同的 D 次多項式最多共享 D 個點，因此具有有效多項式 (滿足上述約束條件) 和 D 次假多項式 (不滿足上述約束條件) 的多項式對最多共享 D 個點。這意味著假多項式有 次機會通過隨機抽樣檢查。如果我們進行 n 次抽樣檢查，機會會降低到 。 我們默認將 extension_factor 設置為 16，將抽樣檢查默認次數設置為 16，因此安全級別將為 80 位。 第三步：多項式承諾 我們使用計算記錄和相應的用戶余額、用戶 ID 以及每行對應約束多項式的值來計算哈希值，并生成默克爾樹 (Mekel tree)。默克爾樹根是多項式的承諾 (commitment) 值。 第四步：生成抽樣證明 使用默克爾樹根作為隨機源對數據進行抽樣。為避免洩露計算記錄數據，在抽樣過程中將會避免使用序號為 *k ** extension_factor 的數據，并生成相應的默克爾證明路徑。 然後進行抽樣檢查，檢查承諾的多項式是否是滿足第一步中列出的約束條件的有效多項式。

看漲份額隨後漲至 0.72 USDT，用戶全部賣出： 已實現盈虧 ≈ （0.72 − 0.40）× 100 ≈ +32.00 USDT 注： 以上未含手續費，實際到手金額以扣除手續費後為準。 Q：如果不提前平倉，持倉至到期會如何處理？ 合約到期時，系統自動完成交割，無需手動操作： 判斷正確：每份份額兌換為 1 USDT，再扣除交割手續費 判斷錯誤：份額價值歸零，不收取交割手續費 示例（BTC 價格事件，持倉至交割）： 用戶以 0.40 USDT 買入 100 份 BTC 看漲份額。到期時交割價高於目標價，看漲獲勝： 交割到賬 = 100 × 1.00 = 100.00 USDT（扣除手續費前） 已實現盈虧 ≈ +60 USDT（扣除手續費前） 若看跌獲勝，則份額歸零，不收取交割手續費。 交割規則Q：事件合約的交割流程是什麼？ 每個事件均有明確的規則說明，定義了標的物、數據來源、交割時間及邊界情況的處理方式。請在交易前查閱具體合約對應的規則說明。

"index":9583119,"account":{"id":"50f5f08cc5036e15a541c64ac4ac6d2d9aa8ddab1ec32ed58b10e6ed3edfad59","debt":["0","0","0","0","0","0","0","0","0","0","0","0","0","0","0","0","0","0","0","0","0","0","0","0","0","0","0","0","0","0","0","0","0","0","0","0","0","0","0","0","0","0","0","0","0","0","0","0","0","0","0","0","0","0","0","0","0","0","0","0","0","0","0","0","0","0","0","0","0","0","0","0","0","0","0","0","0","0","0","0","0","0","0","0","0","0","0","0","0","0","0","0","0","0","0","0","0","0","0