Cube
Trade
Pro
Advanced trading interface with professional tools
Swap
Exchange cryptocurrencies instantly
Bundles
Trade multiple tokens in a single transaction
Algos
Create and manage automated trading strategies
Portfolio
Portfolio
View your cryptocurrency holdings and performance
Orders
Track your open and completed orders
Transactions
View your complete transaction history
Rewards
Rewards Dashboard
View your rewards and claim loot boxes
Blocks Leaderboard
See top traders competing for block rewards
Referral Leaderboard
See top referrers and track referral rankings
Investors
Investor Resources
Browse investor resources and documentation
Presentation (pdf)
Download investor presentation
Settings
Profile
Your profile and account verification
Subaccounts
Separate portfolios across subaccounts
Address Book
Manage saved withdrawal addresses
Multi-Factor Authentication
Add a verification step for sensitive account actions
API Keys
Connect applications to your account
Onramp
Link bank account to buy crypto
Account Recovery
Manage account recovery setup
Learn
News
Read the latest news, announcements, and updates from Cube Exchange
What-Is Guides
Learn about cryptocurrencies
FAQ
Frequently asked questions about Cube Exchange
Fees
View our transparent fee schedule and pricing information
Security
Learn more about Cube Exchange security
About
About
Learn more about Cube Exchange
Legal
Legal information, terms of service, privacy policy, and risk disclosures
EN
Select Language
EN
English
ES
Español
ID
Bahasa Indonesia
JA
日本語
PL
Polski
PT
Português
RU
Россия
TH
แบบไทย
TR
Türkçe
UK
Україна
VI
Tiếng Việt
ZH-CN
简体中文
ZH-TW
繁體中文
Light
Dark
System
Sign In
/
Foundations
/
Cryptography
/
Commitments
/
Foundations: Cryptography / Commitments
What Are KZG Commitments?
KZG commitments are a way to commit to an entire polynomial with a single small cryptographic object, then later prove specific values of that polynomial with equally short proofs. That unusual combination of compactness and verifiability is why they matter in modern zero-knowledge systems and blockchain data-availability designs.
Mar 21, 2026
•
23 min read
#COMMITMENTS
What is a Pedersen Commitment?
Pedersen commitments solve a delicate problem: how to hide a value completely while still letting others verify arithmetic about it. That combination — **perfect hiding** with **additive homomorphism** — is why they sit underneath confidential transactions, range proofs, and many zero-knowledge systems.
Mar 21, 2026
•
21 min read
#COMMITMENTS
What Is a Polynomial Commitment?
Polynomial commitments solve a surprisingly specific problem with broad consequences: how do you bind yourself to a whole polynomial now, then later prove just one value of it without revealing everything else? That simple capability sits underneath modern SNARKs, verifiable secret sharing, and blockchain data-availability designs.
Mar 21, 2026
•
24 min read
#COMMITMENTS
What is a Hash Commitment?
A hash commitment lets you publish a short digest now and reveal the underlying value later, in a way that is meant to hide the value at first and lock it in for later verification. That simple trick sits underneath coin flipping, auctions, smart-contract commit–reveal flows, and many zero-knowledge systems—but it only works if you understand exactly what the hash is, and is not, buying you.
Mar 21, 2026
•
26 min read
#COMMITMENTS