Block #2,213,047

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 7/19/2017, 6:12:10 AM · Difficulty 10.9439 · 4,629,029 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
7f6c4fa0ecc5df968ca0a6b28527ff2d364b8117a99513db1db054d4a96800ab

Height

#2,213,047

Difficulty

10.943903

Transactions

5

Size

4.54 KB

Version

2

Bits

0af1a3a5

Nonce

1,892,289,456

Timestamp

7/19/2017, 6:12:10 AM

Confirmations

4,629,029

Merkle Root

08160f0d68fab9ba95dfb77e23f43e35f4f564d052996469677dd76cd4c84fcc
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.

7.115 × 10⁹¹(92-digit number)
71151315849151026454…94971847409251161759
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
7.115 × 10⁹¹(92-digit number)
71151315849151026454…94971847409251161759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.423 × 10⁹²(93-digit number)
14230263169830205290…89943694818502323519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.846 × 10⁹²(93-digit number)
28460526339660410581…79887389637004647039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.692 × 10⁹²(93-digit number)
56921052679320821163…59774779274009294079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.138 × 10⁹³(94-digit number)
11384210535864164232…19549558548018588159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.276 × 10⁹³(94-digit number)
22768421071728328465…39099117096037176319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.553 × 10⁹³(94-digit number)
45536842143456656930…78198234192074352639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
9.107 × 10⁹³(94-digit number)
91073684286913313861…56396468384148705279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.821 × 10⁹⁴(95-digit number)
18214736857382662772…12792936768297410559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.642 × 10⁹⁴(95-digit number)
36429473714765325544…25585873536594821119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
7.285 × 10⁹⁴(95-digit number)
72858947429530651088…51171747073189642239
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 consecutive prime numbers forming a Cunningham Chain of the First 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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 1CC formula:

1CC: p₁ (first prime), p₂ = 2p₁ + 1, p₃ = 2p₂ + 1, …
Circulating Supply:57,980,993 XPM·at block #6,842,075 · 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