Block #669,153

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 8/8/2014, 5:37:22 PM · Difficulty 10.9638 · 6,161,579 confirmations

2CC
Cunningham Chain of the Second Kind

A sequence where each prime is double the previous prime minus one.

Block Header
Block Hash
6780528de5c86c9ec85edffcd1b1b5c254eff849e9531b3b3f93536ed41df028

Height

#669,153

Difficulty

10.963796

Transactions

3

Size

9.44 KB

Version

5

Bits

0af6bb58

Nonce

351,927,334

Timestamp

8/8/2014, 5:37:22 PM

Confirmations

6,161,579

Merkle Root

edbf7e6d41c65c0a3005052469872aac2b1231e0523a02cf849abc2f632808d2
Transactions (3)
Prime Chain Origin

This is the prime chain origin stored in the block header. It is a composite number (not prime itself) — it equals the first prime in the chain multiplied by a primorial. The origin anchors the entire chain to this specific block.

7.103 × 10⁹⁴(95-digit number)
71033486778955700098…22323334169332618881
Discovered Prime Numbers
p_k = 2^k × origin + 1

These are the actual prime numbers discovered by this block, computed using the verified Primecoin formula. Each number has been independently confirmed to pass the Fermat primality test. Use the FactorDB links to verify any number independently.

1
origin + 1
7.103 × 10⁹⁴(95-digit number)
71033486778955700098…22323334169332618881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.420 × 10⁹⁵(96-digit number)
14206697355791140019…44646668338665237761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.841 × 10⁹⁵(96-digit number)
28413394711582280039…89293336677330475521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.682 × 10⁹⁵(96-digit number)
56826789423164560079…78586673354660951041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.136 × 10⁹⁶(97-digit number)
11365357884632912015…57173346709321902081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.273 × 10⁹⁶(97-digit number)
22730715769265824031…14346693418643804161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.546 × 10⁹⁶(97-digit number)
45461431538531648063…28693386837287608321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
9.092 × 10⁹⁶(97-digit number)
90922863077063296126…57386773674575216641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.818 × 10⁹⁷(98-digit number)
18184572615412659225…14773547349150433281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.636 × 10⁹⁷(98-digit number)
36369145230825318450…29547094698300866561
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 10 consecutive prime numbers forming a Cunningham Chain of the Second Kind. The prime chain origin — the large number shown above — anchors the chain and is divisible by a primorial (the product of small primes), cryptographically tying these prime numbers to this specific block.

★★☆☆☆
Rarity
UncommonChain length 10

Roughly 1 in 100 blocks. Solid but expected in a healthy network.

How Primecoin's Proof-of-Work Constructs These Primes

Primecoin stores a value called the prime chain origin in each block. The miner found a large integer such that when divided by a primorial (the product of small primes: 2 × 3 × 5 × 7 × …), the result is the first prime in the chain. The origin is deliberately divisible by this primorial — that divisibility is part of the proof.

Prime Chain Origin = First Prime × Primorial (2·3·5·7·11·…)
Source: Primecoin prime.cpp — CheckPrimeProofOfWork()

This is why the origin has many small prime factors — those factors are the primorial divisor. The chain then extends from the first prime using the 2CC formula:

2CC: p₁ (first prime), p₂ = 2p₁ − 1, p₃ = 2p₂ − 1, …
Circulating Supply:57,889,992 XPM·at block #6,830,731 · updates every 60s
xpmprime.info is a work in progress. If you enjoy using this service you can support this project with a Primecoin donation.
Privacy Policy·

Cookie Preferences

We use cookies to enhance your experience. Some are essential for the site to function, while others help us understand how you use the site.

·Privacy Policy