Block #3,335,926

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 9/1/2019, 5:45:39 AM · Difficulty 11.0013 · 3,505,801 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
c55552883a0a93926c6c964a3adec444a767cbf06b997d41dfa84f26e751ac4a

Height

#3,335,926

Difficulty

11.001259

Transactions

18

Size

6.56 KB

Version

2

Bits

0b005282

Nonce

96,915,224

Timestamp

9/1/2019, 5:45:39 AM

Confirmations

3,505,801

Merkle Root

c9045961d27bc7aa1ec7161cead5f1f65cb031d12de33888e9dd2eb358e88f22
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.674 × 10⁹⁴(95-digit number)
36743414307079314319…72403304090082039201
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.674 × 10⁹⁴(95-digit number)
36743414307079314319…72403304090082039201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.348 × 10⁹⁴(95-digit number)
73486828614158628638…44806608180164078401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.469 × 10⁹⁵(96-digit number)
14697365722831725727…89613216360328156801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.939 × 10⁹⁵(96-digit number)
29394731445663451455…79226432720656313601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.878 × 10⁹⁵(96-digit number)
58789462891326902910…58452865441312627201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.175 × 10⁹⁶(97-digit number)
11757892578265380582…16905730882625254401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.351 × 10⁹⁶(97-digit number)
23515785156530761164…33811461765250508801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.703 × 10⁹⁶(97-digit number)
47031570313061522328…67622923530501017601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
9.406 × 10⁹⁶(97-digit number)
94063140626123044657…35245847061002035201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.881 × 10⁹⁷(98-digit number)
18812628125224608931…70491694122004070401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
3.762 × 10⁹⁷(98-digit number)
37625256250449217863…40983388244008140801
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,978,197 XPM·at block #6,841,726 · 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