Block #3,404,277

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 10/24/2019, 1:57:40 AM · Difficulty 10.9868 · 3,421,305 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
13d141730287e1780a894950a529fd8bc01029b58ff9b5b030e12186fd010d05

Height

#3,404,277

Difficulty

10.986777

Transactions

13

Size

3.96 KB

Version

2

Bits

0afc9d6c

Nonce

472,273,158

Timestamp

10/24/2019, 1:57:40 AM

Confirmations

3,421,305

Merkle Root

7ad5529c0f67214f4cb9b61264b10d8b0ae4a6ec8e3da85e7299659dae851fd7
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.507 × 10⁹¹(92-digit number)
55078232466351778470…81609843768893494541
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.507 × 10⁹¹(92-digit number)
55078232466351778470…81609843768893494541
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.101 × 10⁹²(93-digit number)
11015646493270355694…63219687537786989081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.203 × 10⁹²(93-digit number)
22031292986540711388…26439375075573978161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.406 × 10⁹²(93-digit number)
44062585973081422776…52878750151147956321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
8.812 × 10⁹²(93-digit number)
88125171946162845552…05757500302295912641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.762 × 10⁹³(94-digit number)
17625034389232569110…11515000604591825281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.525 × 10⁹³(94-digit number)
35250068778465138221…23030001209183650561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
7.050 × 10⁹³(94-digit number)
70500137556930276442…46060002418367301121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.410 × 10⁹⁴(95-digit number)
14100027511386055288…92120004836734602241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.820 × 10⁹⁴(95-digit number)
28200055022772110576…84240009673469204481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
5.640 × 10⁹⁴(95-digit number)
56400110045544221153…68480019346938408961
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,848,755 XPM·at block #6,825,581 · 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