Block #2,131,559

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 5/25/2017, 4:39:09 AM · Difficulty 10.9102 · 4,710,435 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
bbd395bbbf83bce436feb025d3327155c2a4c37fb475d6f3c5a6a4931477fac4

Height

#2,131,559

Difficulty

10.910201

Transactions

2

Size

1016 B

Version

2

Bits

0ae902e9

Nonce

538,219,693

Timestamp

5/25/2017, 4:39:09 AM

Confirmations

4,710,435

Merkle Root

06efcf8e2395119a21cd93ed0784926fe764f449e64e5cd57d480dbd9a52a4c0
Transactions (2)
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.

9.772 × 10⁹⁴(95-digit number)
97728628112205194283…32910166920061460881
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
9.772 × 10⁹⁴(95-digit number)
97728628112205194283…32910166920061460881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.954 × 10⁹⁵(96-digit number)
19545725622441038856…65820333840122921761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.909 × 10⁹⁵(96-digit number)
39091451244882077713…31640667680245843521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.818 × 10⁹⁵(96-digit number)
78182902489764155426…63281335360491687041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.563 × 10⁹⁶(97-digit number)
15636580497952831085…26562670720983374081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.127 × 10⁹⁶(97-digit number)
31273160995905662170…53125341441966748161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.254 × 10⁹⁶(97-digit number)
62546321991811324341…06250682883933496321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.250 × 10⁹⁷(98-digit number)
12509264398362264868…12501365767866992641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.501 × 10⁹⁷(98-digit number)
25018528796724529736…25002731535733985281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.003 × 10⁹⁷(98-digit number)
50037057593449059473…50005463071467970561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.000 × 10⁹⁸(99-digit number)
10007411518689811894…00010926142935941121
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 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
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 2CC formula:

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