Block #2,864,415

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 10/2/2018, 6:35:24 PM · Difficulty 11.6722 · 3,972,571 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
07c5a07bd1be2b479ef7657d659b90b77bb33630ed1fa45dc4b234546032c7ed

Height

#2,864,415

Difficulty

11.672225

Transactions

5

Size

1.99 KB

Version

2

Bits

0bac16f2

Nonce

115,430,670

Timestamp

10/2/2018, 6:35:24 PM

Confirmations

3,972,571

Merkle Root

eb2fe8b8f0b290fc50736e4ca618f8f908319de1ef52fdc8fbc67c2fc61783a1
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.823 × 10⁹³(94-digit number)
38235968793812696179…15390401038573225499
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.823 × 10⁹³(94-digit number)
38235968793812696179…15390401038573225499
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
7.647 × 10⁹³(94-digit number)
76471937587625392358…30780802077146450999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.529 × 10⁹⁴(95-digit number)
15294387517525078471…61561604154292901999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.058 × 10⁹⁴(95-digit number)
30588775035050156943…23123208308585803999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.117 × 10⁹⁴(95-digit number)
61177550070100313886…46246416617171607999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.223 × 10⁹⁵(96-digit number)
12235510014020062777…92492833234343215999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.447 × 10⁹⁵(96-digit number)
24471020028040125554…84985666468686431999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.894 × 10⁹⁵(96-digit number)
48942040056080251109…69971332937372863999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
9.788 × 10⁹⁵(96-digit number)
97884080112160502218…39942665874745727999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.957 × 10⁹⁶(97-digit number)
19576816022432100443…79885331749491455999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
3.915 × 10⁹⁶(97-digit number)
39153632044864200887…59770663498982911999
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 First 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 1CC formula:

1CC: p₁ (first prime), p₂ = 2p₁ + 1, p₃ = 2p₂ + 1, …
Circulating Supply:57,940,188 XPM·at block #6,836,985 · 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