Block #2,868,647

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 10/5/2018, 5:18:13 PM · Difficulty 11.6716 · 3,969,459 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
f401518c98e97c699b73b7c14737c227aabc2773169f184a0f07b146e009b4e3

Height

#2,868,647

Difficulty

11.671634

Transactions

3

Size

847 B

Version

2

Bits

0babf035

Nonce

963,843,054

Timestamp

10/5/2018, 5:18:13 PM

Confirmations

3,969,459

Merkle Root

a3321f61d0ee5ff83c0c0fb733fef633ce45740babf29e2de795e31c60a9d70c
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.898 × 10⁹⁵(96-digit number)
18981136825574139061…95862128159904820799
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.898 × 10⁹⁵(96-digit number)
18981136825574139061…95862128159904820799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.796 × 10⁹⁵(96-digit number)
37962273651148278123…91724256319809641599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
7.592 × 10⁹⁵(96-digit number)
75924547302296556246…83448512639619283199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.518 × 10⁹⁶(97-digit number)
15184909460459311249…66897025279238566399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.036 × 10⁹⁶(97-digit number)
30369818920918622498…33794050558477132799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.073 × 10⁹⁶(97-digit number)
60739637841837244997…67588101116954265599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.214 × 10⁹⁷(98-digit number)
12147927568367448999…35176202233908531199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.429 × 10⁹⁷(98-digit number)
24295855136734897998…70352404467817062399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.859 × 10⁹⁷(98-digit number)
48591710273469795997…40704808935634124799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
9.718 × 10⁹⁷(98-digit number)
97183420546939591995…81409617871268249599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.943 × 10⁹⁸(99-digit number)
19436684109387918399…62819235742536499199
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,949,202 XPM·at block #6,838,105 · 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