Block #2,271,784

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 8/28/2017, 11:14:22 AM · Difficulty 10.9541 · 4,560,371 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
5b8ae7acbe7c57d1d161c8db7840c676a7c3c15522b09a90ac3fc3036a499402

Height

#2,271,784

Difficulty

10.954060

Transactions

2

Size

427 B

Version

2

Bits

0af43d44

Nonce

1,159,124,214

Timestamp

8/28/2017, 11:14:22 AM

Confirmations

4,560,371

Merkle Root

719a016fca244526d23cbffcdf69638a599fa94156c044d9f852dd491ab167de
Transactions (2)
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.

4.520 × 10⁹⁸(99-digit number)
45206487030771976315…78799551639244728319
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
4.520 × 10⁹⁸(99-digit number)
45206487030771976315…78799551639244728319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
9.041 × 10⁹⁸(99-digit number)
90412974061543952631…57599103278489456639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.808 × 10⁹⁹(100-digit number)
18082594812308790526…15198206556978913279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.616 × 10⁹⁹(100-digit number)
36165189624617581052…30396413113957826559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
7.233 × 10⁹⁹(100-digit number)
72330379249235162105…60792826227915653119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.446 × 10¹⁰⁰(101-digit number)
14466075849847032421…21585652455831306239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.893 × 10¹⁰⁰(101-digit number)
28932151699694064842…43171304911662612479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.786 × 10¹⁰⁰(101-digit number)
57864303399388129684…86342609823325224959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.157 × 10¹⁰¹(102-digit number)
11572860679877625936…72685219646650449919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.314 × 10¹⁰¹(102-digit number)
23145721359755251873…45370439293300899839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
4.629 × 10¹⁰¹(102-digit number)
46291442719510503747…90740878586601799679
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,901,379 XPM·at block #6,832,154 · 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