Block #2,131,448

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 5/25/2017, 2:56:48 AM · Difficulty 10.9101 · 4,709,728 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
363b19513a9f5d1a5857db02fc982dcd55b8fd07999c7ea6434be5d44aebab4b

Height

#2,131,448

Difficulty

10.910076

Transactions

14

Size

5.54 KB

Version

2

Bits

0ae8fac1

Nonce

342,122,076

Timestamp

5/25/2017, 2:56:48 AM

Confirmations

4,709,728

Merkle Root

bea7406901f66ca2e854fa644614795f84e1b3c777b011c4745e4d64f8b5ba37
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.

6.478 × 10⁹⁴(95-digit number)
64781938963873508197…46883428563876424081
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
6.478 × 10⁹⁴(95-digit number)
64781938963873508197…46883428563876424081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.295 × 10⁹⁵(96-digit number)
12956387792774701639…93766857127752848161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.591 × 10⁹⁵(96-digit number)
25912775585549403279…87533714255505696321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.182 × 10⁹⁵(96-digit number)
51825551171098806558…75067428511011392641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.036 × 10⁹⁶(97-digit number)
10365110234219761311…50134857022022785281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.073 × 10⁹⁶(97-digit number)
20730220468439522623…00269714044045570561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.146 × 10⁹⁶(97-digit number)
41460440936879045246…00539428088091141121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
8.292 × 10⁹⁶(97-digit number)
82920881873758090493…01078856176182282241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.658 × 10⁹⁷(98-digit number)
16584176374751618098…02157712352364564481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.316 × 10⁹⁷(98-digit number)
33168352749503236197…04315424704729128961
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,973,766 XPM·at block #6,841,175 · 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