Block #337,551

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/31/2013, 6:30:13 PM · Difficulty 10.1350 · 6,469,195 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
51d08bbd5e6c4e2e09c5ed69f15a617ffb200350fb5847b04e552b8e120afe18

Height

#337,551

Difficulty

10.135040

Transactions

1

Size

1.05 KB

Version

2

Bits

0a229202

Nonce

121,062

Timestamp

12/31/2013, 6:30:13 PM

Confirmations

6,469,195

Merkle Root

7e39659213acba5a232b265af4ac9978ca0febaf78737a53187a0c27ad25cd65
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.

3.804 × 10⁹⁶(97-digit number)
38044565676110353816…10490254428431348441
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
3.804 × 10⁹⁶(97-digit number)
38044565676110353816…10490254428431348441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.608 × 10⁹⁶(97-digit number)
76089131352220707632…20980508856862696881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.521 × 10⁹⁷(98-digit number)
15217826270444141526…41961017713725393761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.043 × 10⁹⁷(98-digit number)
30435652540888283052…83922035427450787521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.087 × 10⁹⁷(98-digit number)
60871305081776566105…67844070854901575041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.217 × 10⁹⁸(99-digit number)
12174261016355313221…35688141709803150081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.434 × 10⁹⁸(99-digit number)
24348522032710626442…71376283419606300161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.869 × 10⁹⁸(99-digit number)
48697044065421252884…42752566839212600321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
9.739 × 10⁹⁸(99-digit number)
97394088130842505768…85505133678425200641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.947 × 10⁹⁹(100-digit number)
19478817626168501153…71010267356850401281
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,698,066 XPM·at block #6,806,745 · 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.

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