Block #2,857,902

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 9/28/2018, 3:23:49 AM · Difficulty 11.6821 · 3,975,952 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
6880365b5f7555b451134d0a9bce9fcec52d11217b1aee6d418329e3a90ffdaa

Height

#2,857,902

Difficulty

11.682123

Transactions

27

Size

7.62 KB

Version

2

Bits

0bae9f9a

Nonce

1,885,219,248

Timestamp

9/28/2018, 3:23:49 AM

Confirmations

3,975,952

Merkle Root

6f5adce8ae87a0fb3d3e6102973d3c5829bae14d5226f6e42d71b3364f47e121
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.

5.437 × 10⁹⁵(96-digit number)
54374825271841595569…13970141723671539999
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
5.437 × 10⁹⁵(96-digit number)
54374825271841595569…13970141723671539999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.087 × 10⁹⁶(97-digit number)
10874965054368319113…27940283447343079999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.174 × 10⁹⁶(97-digit number)
21749930108736638227…55880566894686159999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.349 × 10⁹⁶(97-digit number)
43499860217473276455…11761133789372319999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
8.699 × 10⁹⁶(97-digit number)
86999720434946552911…23522267578744639999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.739 × 10⁹⁷(98-digit number)
17399944086989310582…47044535157489279999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.479 × 10⁹⁷(98-digit number)
34799888173978621164…94089070314978559999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
6.959 × 10⁹⁷(98-digit number)
69599776347957242329…88178140629957119999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.391 × 10⁹⁸(99-digit number)
13919955269591448465…76356281259914239999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.783 × 10⁹⁸(99-digit number)
27839910539182896931…52712562519828479999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
5.567 × 10⁹⁸(99-digit number)
55679821078365793863…05425125039656959999
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,915,063 XPM·at block #6,833,853 · 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