Block #2,456,413

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 1/3/2018, 11:40:12 PM · Difficulty 10.9535 · 4,386,136 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
d18e0f3b8ef42754514f7c425d4c20eecc910fcefca64b8ff0e9c6f1b093a965

Height

#2,456,413

Difficulty

10.953461

Transactions

47

Size

10.62 KB

Version

2

Bits

0af4160c

Nonce

1,097,948,550

Timestamp

1/3/2018, 11:40:12 PM

Confirmations

4,386,136

Merkle Root

59eb742354b712a518ace04f3aafc0ab84df5e5e3a8ff0b09383b578c3c2c216
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.

6.458 × 10⁹⁵(96-digit number)
64583905587226755956…20700355119363839999
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
6.458 × 10⁹⁵(96-digit number)
64583905587226755956…20700355119363839999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.291 × 10⁹⁶(97-digit number)
12916781117445351191…41400710238727679999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.583 × 10⁹⁶(97-digit number)
25833562234890702382…82801420477455359999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.166 × 10⁹⁶(97-digit number)
51667124469781404765…65602840954910719999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.033 × 10⁹⁷(98-digit number)
10333424893956280953…31205681909821439999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.066 × 10⁹⁷(98-digit number)
20666849787912561906…62411363819642879999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.133 × 10⁹⁷(98-digit number)
41333699575825123812…24822727639285759999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
8.266 × 10⁹⁷(98-digit number)
82667399151650247624…49645455278571519999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.653 × 10⁹⁸(99-digit number)
16533479830330049524…99290910557143039999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.306 × 10⁹⁸(99-digit number)
33066959660660099049…98581821114286079999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
6.613 × 10⁹⁸(99-digit number)
66133919321320198099…97163642228572159999
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,984,817 XPM·at block #6,842,548 · 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