Block #1,387,727

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/27/2015, 6:35:14 PM · Difficulty 10.8134 · 5,438,787 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
b07e23cff0653985529f88ba9217767aee2226d7cb253b593e6fb9d609edd092

Height

#1,387,727

Difficulty

10.813449

Transactions

2

Size

1.28 KB

Version

2

Bits

0ad03e33

Nonce

883,725,478

Timestamp

12/27/2015, 6:35:14 PM

Confirmations

5,438,787

Merkle Root

f09ab51bd8a16b9641ca0570c9e5bc724f00293f6dd25a220aa1d5b9c7c89043
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.314 × 10⁹⁵(96-digit number)
13140925823522593184…24966771982670709121
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.314 × 10⁹⁵(96-digit number)
13140925823522593184…24966771982670709121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.628 × 10⁹⁵(96-digit number)
26281851647045186368…49933543965341418241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.256 × 10⁹⁵(96-digit number)
52563703294090372736…99867087930682836481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.051 × 10⁹⁶(97-digit number)
10512740658818074547…99734175861365672961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.102 × 10⁹⁶(97-digit number)
21025481317636149094…99468351722731345921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.205 × 10⁹⁶(97-digit number)
42050962635272298189…98936703445462691841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
8.410 × 10⁹⁶(97-digit number)
84101925270544596378…97873406890925383681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.682 × 10⁹⁷(98-digit number)
16820385054108919275…95746813781850767361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.364 × 10⁹⁷(98-digit number)
33640770108217838551…91493627563701534721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.728 × 10⁹⁷(98-digit number)
67281540216435677102…82987255127403069441
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,856,256 XPM·at block #6,826,513 · 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