Block #2,856,590

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 9/27/2018, 3:25:32 AM · Difficulty 11.6901 · 3,980,324 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
0633ec1c025417e5093d89086be7ab0348bd1805bae23948aeef188733f09267

Height

#2,856,590

Difficulty

11.690071

Transactions

2

Size

7.94 KB

Version

2

Bits

0bb0a87d

Nonce

1,174,743,831

Timestamp

9/27/2018, 3:25:32 AM

Confirmations

3,980,324

Merkle Root

a86e6c94796dce9fec20b2668ddca898df3eec93561cd01d8ac594154a2c41b8
Transactions (2)
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.

2.225 × 10⁹⁴(95-digit number)
22252684719868785188…55274969983132486609
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
2.225 × 10⁹⁴(95-digit number)
22252684719868785188…55274969983132486609
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.450 × 10⁹⁴(95-digit number)
44505369439737570377…10549939966264973219
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
8.901 × 10⁹⁴(95-digit number)
89010738879475140755…21099879932529946439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.780 × 10⁹⁵(96-digit number)
17802147775895028151…42199759865059892879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.560 × 10⁹⁵(96-digit number)
35604295551790056302…84399519730119785759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
7.120 × 10⁹⁵(96-digit number)
71208591103580112604…68799039460239571519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.424 × 10⁹⁶(97-digit number)
14241718220716022520…37598078920479143039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.848 × 10⁹⁶(97-digit number)
28483436441432045041…75196157840958286079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.696 × 10⁹⁶(97-digit number)
56966872882864090083…50392315681916572159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.139 × 10⁹⁷(98-digit number)
11393374576572818016…00784631363833144319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
2.278 × 10⁹⁷(98-digit number)
22786749153145636033…01569262727666288639
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,939,606 XPM·at block #6,836,913 · 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