Block #2,129,877

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 5/24/2017, 1:16:43 AM · Difficulty 10.9094 · 4,710,069 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
3bb1e0cafda96f2e8857867fa6d841369f2423d1b7b9e60954374dd641cd968b

Height

#2,129,877

Difficulty

10.909449

Transactions

9

Size

3.55 KB

Version

2

Bits

0ae8d1ad

Nonce

1,401,356,032

Timestamp

5/24/2017, 1:16:43 AM

Confirmations

4,710,069

Merkle Root

12aa6fec75539bdbac0bf855e29bc82519d46b235b0b636606f8c8ea251f4ce3
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.

3.272 × 10⁹³(94-digit number)
32721205982996673737…04382192510128005441
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
3.272 × 10⁹³(94-digit number)
32721205982996673737…04382192510128005441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.544 × 10⁹³(94-digit number)
65442411965993347474…08764385020256010881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.308 × 10⁹⁴(95-digit number)
13088482393198669494…17528770040512021761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.617 × 10⁹⁴(95-digit number)
26176964786397338989…35057540081024043521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.235 × 10⁹⁴(95-digit number)
52353929572794677979…70115080162048087041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.047 × 10⁹⁵(96-digit number)
10470785914558935595…40230160324096174081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.094 × 10⁹⁵(96-digit number)
20941571829117871191…80460320648192348161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.188 × 10⁹⁵(96-digit number)
41883143658235742383…60920641296384696321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
8.376 × 10⁹⁵(96-digit number)
83766287316471484767…21841282592769392641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.675 × 10⁹⁶(97-digit number)
16753257463294296953…43682565185538785281
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,963,869 XPM·at block #6,839,945 · 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