Block #352,537

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/10/2014, 9:51:04 AM · Difficulty 10.3090 · 6,462,453 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
12af1901cc59e76dec0e59d964c7c8c04144d6a4861d0c58303909ed6d8f3280

Height

#352,537

Difficulty

10.308999

Transactions

5

Size

1.08 KB

Version

2

Bits

0a4f1a8e

Nonce

183,619

Timestamp

1/10/2014, 9:51:04 AM

Confirmations

6,462,453

Merkle Root

44240ac00d0b5f9491cb22febf805aa244c15632abc40e7699260bb879cb47e4
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.

6.295 × 10⁹⁶(97-digit number)
62952702772415713512…35692623622810562881
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
6.295 × 10⁹⁶(97-digit number)
62952702772415713512…35692623622810562881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.259 × 10⁹⁷(98-digit number)
12590540554483142702…71385247245621125761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.518 × 10⁹⁷(98-digit number)
25181081108966285405…42770494491242251521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.036 × 10⁹⁷(98-digit number)
50362162217932570810…85540988982484503041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.007 × 10⁹⁸(99-digit number)
10072432443586514162…71081977964969006081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.014 × 10⁹⁸(99-digit number)
20144864887173028324…42163955929938012161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.028 × 10⁹⁸(99-digit number)
40289729774346056648…84327911859876024321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
8.057 × 10⁹⁸(99-digit number)
80579459548692113296…68655823719752048641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.611 × 10⁹⁹(100-digit number)
16115891909738422659…37311647439504097281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.223 × 10⁹⁹(100-digit number)
32231783819476845318…74623294879008194561
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,764,005 XPM·at block #6,814,989 · 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