Block #2,138,960

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 5/31/2017, 8:16:07 AM · Difficulty 10.8805 · 4,691,804 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
d9eb59913638a84a4a050cabb8e28069aa669d5e2a5023a0c36fabb80f44ad3d

Height

#2,138,960

Difficulty

10.880462

Transactions

2

Size

9.66 KB

Version

2

Bits

0ae165f5

Nonce

556,324,577

Timestamp

5/31/2017, 8:16:07 AM

Confirmations

4,691,804

Merkle Root

9a7ebc6a7b9edc7a9ed4779b5c2f0c7b3d33e4b89194a2154f94105f7dcabf80
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.

5.636 × 10⁹⁴(95-digit number)
56366527867729016980…56271256486883855361
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
5.636 × 10⁹⁴(95-digit number)
56366527867729016980…56271256486883855361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.127 × 10⁹⁵(96-digit number)
11273305573545803396…12542512973767710721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.254 × 10⁹⁵(96-digit number)
22546611147091606792…25085025947535421441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.509 × 10⁹⁵(96-digit number)
45093222294183213584…50170051895070842881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
9.018 × 10⁹⁵(96-digit number)
90186444588366427169…00340103790141685761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.803 × 10⁹⁶(97-digit number)
18037288917673285433…00680207580283371521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.607 × 10⁹⁶(97-digit number)
36074577835346570867…01360415160566743041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
7.214 × 10⁹⁶(97-digit number)
72149155670693141735…02720830321133486081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.442 × 10⁹⁷(98-digit number)
14429831134138628347…05441660642266972161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.885 × 10⁹⁷(98-digit number)
28859662268277256694…10883321284533944321
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,890,248 XPM·at block #6,830,763 · 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