Block #2,792,327

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 8/13/2018, 3:41:14 PM · Difficulty 11.6752 · 4,038,175 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
83f758a0f512a22f232ddfeb481c36b62d051e4a32af91996d2a4cd14709e08c

Height

#2,792,327

Difficulty

11.675224

Transactions

5

Size

1.81 KB

Version

2

Bits

0bacdb7f

Nonce

92,587,455

Timestamp

8/13/2018, 3:41:14 PM

Confirmations

4,038,175

Merkle Root

6e93d8816e62873a7d3e4c3ae2fa17bf1afeb394ba9da298b12b4dbbfd093fe5
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.997 × 10⁹⁵(96-digit number)
59979676135741729670…85134315310975931199
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.997 × 10⁹⁵(96-digit number)
59979676135741729670…85134315310975931199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.199 × 10⁹⁶(97-digit number)
11995935227148345934…70268630621951862399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.399 × 10⁹⁶(97-digit number)
23991870454296691868…40537261243903724799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.798 × 10⁹⁶(97-digit number)
47983740908593383736…81074522487807449599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
9.596 × 10⁹⁶(97-digit number)
95967481817186767472…62149044975614899199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.919 × 10⁹⁷(98-digit number)
19193496363437353494…24298089951229798399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.838 × 10⁹⁷(98-digit number)
38386992726874706989…48596179902459596799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
7.677 × 10⁹⁷(98-digit number)
76773985453749413978…97192359804919193599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.535 × 10⁹⁸(99-digit number)
15354797090749882795…94384719609838387199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.070 × 10⁹⁸(99-digit number)
30709594181499765591…88769439219676774399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
6.141 × 10⁹⁸(99-digit number)
61419188362999531182…77538878439353548799
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,888,266 XPM·at block #6,830,501 · 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