Block #2,143,061

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 6/3/2017, 5:48:01 AM · Difficulty 10.8789 · 4,698,919 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
f5c8e26c28874485c3ce59b30a81de15c3bc0c5618642a4c2f5c71304f946597

Height

#2,143,061

Difficulty

10.878883

Transactions

28

Size

8.73 KB

Version

2

Bits

0ae0fe7d

Nonce

1,390,605,973

Timestamp

6/3/2017, 5:48:01 AM

Confirmations

4,698,919

Merkle Root

5cc8dc6ec162fde5ebab6068b3dc0aeeb732e72cb44c44e0b45d1a662d11f9f3
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.927 × 10⁹²(93-digit number)
29275275225459019470…33186813971093075681
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.927 × 10⁹²(93-digit number)
29275275225459019470…33186813971093075681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.855 × 10⁹²(93-digit number)
58550550450918038940…66373627942186151361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.171 × 10⁹³(94-digit number)
11710110090183607788…32747255884372302721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.342 × 10⁹³(94-digit number)
23420220180367215576…65494511768744605441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.684 × 10⁹³(94-digit number)
46840440360734431152…30989023537489210881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
9.368 × 10⁹³(94-digit number)
93680880721468862304…61978047074978421761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.873 × 10⁹⁴(95-digit number)
18736176144293772460…23956094149956843521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.747 × 10⁹⁴(95-digit number)
37472352288587544921…47912188299913687041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
7.494 × 10⁹⁴(95-digit number)
74944704577175089843…95824376599827374081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.498 × 10⁹⁵(96-digit number)
14988940915435017968…91648753199654748161
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,980,225 XPM·at block #6,841,979 · 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