Block #2,141,998

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 6/2/2017, 3:36:23 PM · Difficulty 10.8736 · 4,700,568 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
862e2a2ff78925b40fc7ad2a65f6edb4c1018d5bffe7e0df71a923e61ec89a46

Height

#2,141,998

Difficulty

10.873631

Transactions

7

Size

2.82 KB

Version

2

Bits

0adfa647

Nonce

1,196,694,410

Timestamp

6/2/2017, 3:36:23 PM

Confirmations

4,700,568

Merkle Root

edf2731c416e2a64e7c7743f8bc01334bd1ed7e29860acb904107a30050d175e
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.191 × 10⁹⁵(96-digit number)
51916156332809123023…13369581336360443201
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.191 × 10⁹⁵(96-digit number)
51916156332809123023…13369581336360443201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.038 × 10⁹⁶(97-digit number)
10383231266561824604…26739162672720886401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.076 × 10⁹⁶(97-digit number)
20766462533123649209…53478325345441772801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.153 × 10⁹⁶(97-digit number)
41532925066247298418…06956650690883545601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
8.306 × 10⁹⁶(97-digit number)
83065850132494596836…13913301381767091201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.661 × 10⁹⁷(98-digit number)
16613170026498919367…27826602763534182401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.322 × 10⁹⁷(98-digit number)
33226340052997838734…55653205527068364801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.645 × 10⁹⁷(98-digit number)
66452680105995677469…11306411054136729601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.329 × 10⁹⁸(99-digit number)
13290536021199135493…22612822108273459201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.658 × 10⁹⁸(99-digit number)
26581072042398270987…45225644216546918401
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,984,956 XPM·at block #6,842,565 · 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