Block #2,869,664

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 10/6/2018, 10:39:54 AM · Difficulty 11.6701 · 3,967,256 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
95c1f96842d9e194aabaabb95d5854b4b16c2676ae22c86fd32e84f7fdd50435

Height

#2,869,664

Difficulty

11.670149

Transactions

29

Size

7.76 KB

Version

2

Bits

0bab8eea

Nonce

320,365,616

Timestamp

10/6/2018, 10:39:54 AM

Confirmations

3,967,256

Merkle Root

e11f0b762ee09c5dd29dc0b0ce59a95264a6f337e6e60784c4777637fb496b0e
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.769 × 10⁹⁵(96-digit number)
17692744031885962351…07678320703943726079
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.769 × 10⁹⁵(96-digit number)
17692744031885962351…07678320703943726079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.538 × 10⁹⁵(96-digit number)
35385488063771924703…15356641407887452159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
7.077 × 10⁹⁵(96-digit number)
70770976127543849407…30713282815774904319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.415 × 10⁹⁶(97-digit number)
14154195225508769881…61426565631549808639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.830 × 10⁹⁶(97-digit number)
28308390451017539763…22853131263099617279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.661 × 10⁹⁶(97-digit number)
56616780902035079526…45706262526199234559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.132 × 10⁹⁷(98-digit number)
11323356180407015905…91412525052398469119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.264 × 10⁹⁷(98-digit number)
22646712360814031810…82825050104796938239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.529 × 10⁹⁷(98-digit number)
45293424721628063620…65650100209593876479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
9.058 × 10⁹⁷(98-digit number)
90586849443256127241…31300200419187752959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.811 × 10⁹⁸(99-digit number)
18117369888651225448…62600400838375505919
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,655 XPM·at block #6,836,919 · 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