Block #2,647,824

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 5/4/2018, 3:36:11 AM · Difficulty 11.7629 · 4,184,923 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
744006153ece714130e5605626ed8f5811a9d2f0c5aa24707a62841f182acc8b

Height

#2,647,824

Difficulty

11.762890

Transactions

4

Size

1.75 KB

Version

2

Bits

0bc34cbe

Nonce

1,565,790,003

Timestamp

5/4/2018, 3:36:11 AM

Confirmations

4,184,923

Merkle Root

e24d0d021f1fb4f1102aee31ed9bf52673ad51cfeb9366718aa498109fcabaa5
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.447 × 10⁹³(94-digit number)
14472291226206334855…67922319958001009841
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.447 × 10⁹³(94-digit number)
14472291226206334855…67922319958001009841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.894 × 10⁹³(94-digit number)
28944582452412669711…35844639916002019681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.788 × 10⁹³(94-digit number)
57889164904825339423…71689279832004039361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.157 × 10⁹⁴(95-digit number)
11577832980965067884…43378559664008078721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.315 × 10⁹⁴(95-digit number)
23155665961930135769…86757119328016157441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.631 × 10⁹⁴(95-digit number)
46311331923860271538…73514238656032314881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
9.262 × 10⁹⁴(95-digit number)
92622663847720543077…47028477312064629761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.852 × 10⁹⁵(96-digit number)
18524532769544108615…94056954624129259521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.704 × 10⁹⁵(96-digit number)
37049065539088217230…88113909248258519041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.409 × 10⁹⁵(96-digit number)
74098131078176434461…76227818496517038081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.481 × 10⁹⁶(97-digit number)
14819626215635286892…52455636993034076161
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,906,136 XPM·at block #6,832,746 · 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