Block #372,685

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/23/2014, 6:56:11 PM · Difficulty 10.4269 · 6,441,324 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
cb9d33ea957ee4a0b95f620fa5802cb3d817bfad538bcade4003e33453da07ff

Height

#372,685

Difficulty

10.426910

Transactions

2

Size

1.14 KB

Version

2

Bits

0a6d4a00

Nonce

12,104

Timestamp

1/23/2014, 6:56:11 PM

Confirmations

6,441,324

Merkle Root

b399dfcbce1bff4bd4d28e5b28c0c351be7931f6567986f3f1bfcb573a988155
Transactions (2)
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.

1.131 × 10⁹⁷(98-digit number)
11317187032078309307…99820887906832069881
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
1.131 × 10⁹⁷(98-digit number)
11317187032078309307…99820887906832069881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.263 × 10⁹⁷(98-digit number)
22634374064156618615…99641775813664139761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.526 × 10⁹⁷(98-digit number)
45268748128313237230…99283551627328279521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
9.053 × 10⁹⁷(98-digit number)
90537496256626474461…98567103254656559041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.810 × 10⁹⁸(99-digit number)
18107499251325294892…97134206509313118081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.621 × 10⁹⁸(99-digit number)
36214998502650589784…94268413018626236161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.242 × 10⁹⁸(99-digit number)
72429997005301179569…88536826037252472321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.448 × 10⁹⁹(100-digit number)
14485999401060235913…77073652074504944641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.897 × 10⁹⁹(100-digit number)
28971998802120471827…54147304149009889281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.794 × 10⁹⁹(100-digit number)
57943997604240943655…08294608298019778561
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,756,155 XPM·at block #6,814,008 · 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