Block #3,547,102

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 2/6/2020, 11:28:47 AM · Difficulty 10.9336 · 3,261,875 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
9d2c98a2ba2e7146f692217ce287c1c0a9e96aa4978f61f108e35b5ca6f885f9

Height

#3,547,102

Difficulty

10.933557

Transactions

17

Size

3.19 KB

Version

2

Bits

0aeefd91

Nonce

151,881,742

Timestamp

2/6/2020, 11:28:47 AM

Confirmations

3,261,875

Merkle Root

1f5e3d5cb1fa3d092551013f3f4ef7ca38e9c5b14a21c8ab94e96c226695c57c
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.224 × 10⁹⁵(96-digit number)
92241328528478286381…34386834612552271361
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.224 × 10⁹⁵(96-digit number)
92241328528478286381…34386834612552271361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.844 × 10⁹⁶(97-digit number)
18448265705695657276…68773669225104542721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.689 × 10⁹⁶(97-digit number)
36896531411391314552…37547338450209085441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.379 × 10⁹⁶(97-digit number)
73793062822782629104…75094676900418170881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.475 × 10⁹⁷(98-digit number)
14758612564556525820…50189353800836341761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.951 × 10⁹⁷(98-digit number)
29517225129113051641…00378707601672683521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.903 × 10⁹⁷(98-digit number)
59034450258226103283…00757415203345367041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.180 × 10⁹⁸(99-digit number)
11806890051645220656…01514830406690734081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.361 × 10⁹⁸(99-digit number)
23613780103290441313…03029660813381468161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.722 × 10⁹⁸(99-digit number)
47227560206580882627…06059321626762936321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
9.445 × 10⁹⁸(99-digit number)
94455120413161765254…12118643253525872641
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,715,872 XPM·at block #6,808,976 · 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.

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