Block #3,336,056

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 9/1/2019, 7:53:39 AM · Difficulty 11.0013 · 3,472,061 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
ad6df883811309951b7fb9d183c00e44857e24b246c506efeed83f1d83de472e

Height

#3,336,056

Difficulty

11.001339

Transactions

14

Size

2.97 KB

Version

2

Bits

0b0057c7

Nonce

5,831,725

Timestamp

9/1/2019, 7:53:39 AM

Confirmations

3,472,061

Merkle Root

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

1.621 × 10⁹⁴(95-digit number)
16210978532988510444…43152473541118779641
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
1.621 × 10⁹⁴(95-digit number)
16210978532988510444…43152473541118779641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.242 × 10⁹⁴(95-digit number)
32421957065977020889…86304947082237559281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.484 × 10⁹⁴(95-digit number)
64843914131954041778…72609894164475118561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.296 × 10⁹⁵(96-digit number)
12968782826390808355…45219788328950237121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.593 × 10⁹⁵(96-digit number)
25937565652781616711…90439576657900474241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.187 × 10⁹⁵(96-digit number)
51875131305563233422…80879153315800948481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.037 × 10⁹⁶(97-digit number)
10375026261112646684…61758306631601896961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.075 × 10⁹⁶(97-digit number)
20750052522225293369…23516613263203793921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.150 × 10⁹⁶(97-digit number)
41500105044450586738…47033226526407587841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
8.300 × 10⁹⁶(97-digit number)
83000210088901173476…94066453052815175681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.660 × 10⁹⁷(98-digit number)
16600042017780234695…88132906105630351361
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,708,977 XPM·at block #6,808,116 · 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