Block #2,784,997

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 8/8/2018, 2:49:09 PM · Difficulty 11.6697 · 4,058,398 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
24c6174d2bdcb3dc9cf1ec70fe9ebd8ca1c78b3dd8763b905e4a084436cb42f1

Height

#2,784,997

Difficulty

11.669738

Transactions

7

Size

2.39 KB

Version

2

Bits

0bab73f2

Nonce

581,040,115

Timestamp

8/8/2018, 2:49:09 PM

Confirmations

4,058,398

Merkle Root

8d619a0f52ffad3ffa277591762ecec958ab06372feb99cec15b93c950642488
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.

8.635 × 10⁹⁴(95-digit number)
86359464037340637052…85894849024872540959
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
8.635 × 10⁹⁴(95-digit number)
86359464037340637052…85894849024872540959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.727 × 10⁹⁵(96-digit number)
17271892807468127410…71789698049745081919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.454 × 10⁹⁵(96-digit number)
34543785614936254821…43579396099490163839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.908 × 10⁹⁵(96-digit number)
69087571229872509642…87158792198980327679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.381 × 10⁹⁶(97-digit number)
13817514245974501928…74317584397960655359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.763 × 10⁹⁶(97-digit number)
27635028491949003856…48635168795921310719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.527 × 10⁹⁶(97-digit number)
55270056983898007713…97270337591842621439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.105 × 10⁹⁷(98-digit number)
11054011396779601542…94540675183685242879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.210 × 10⁹⁷(98-digit number)
22108022793559203085…89081350367370485759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.421 × 10⁹⁷(98-digit number)
44216045587118406170…78162700734740971519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
8.843 × 10⁹⁷(98-digit number)
88432091174236812341…56325401469481943039
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,991,524 XPM·at block #6,843,394 · 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