Block #1,270,574

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 10/7/2015, 6:42:29 AM · Difficulty 10.8161 · 5,539,340 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
28bc395d3b44747bf2a39d90d8bff79d6ed73926ff8163ccfe66f6d2919f934b

Height

#1,270,574

Difficulty

10.816137

Transactions

5

Size

1.51 KB

Version

2

Bits

0ad0ee5b

Nonce

949,143,778

Timestamp

10/7/2015, 6:42:29 AM

Confirmations

5,539,340

Merkle Root

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

2.020 × 10⁹⁴(95-digit number)
20206522224208858853…09091585581854839681
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
2.020 × 10⁹⁴(95-digit number)
20206522224208858853…09091585581854839681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.041 × 10⁹⁴(95-digit number)
40413044448417717707…18183171163709679361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
8.082 × 10⁹⁴(95-digit number)
80826088896835435414…36366342327419358721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.616 × 10⁹⁵(96-digit number)
16165217779367087082…72732684654838717441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.233 × 10⁹⁵(96-digit number)
32330435558734174165…45465369309677434881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.466 × 10⁹⁵(96-digit number)
64660871117468348331…90930738619354869761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.293 × 10⁹⁶(97-digit number)
12932174223493669666…81861477238709739521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.586 × 10⁹⁶(97-digit number)
25864348446987339332…63722954477419479041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.172 × 10⁹⁶(97-digit number)
51728696893974678665…27445908954838958081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.034 × 10⁹⁷(98-digit number)
10345739378794935733…54891817909677916161
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,723,396 XPM·at block #6,809,913 · 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