Block #2,271,705

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 8/28/2017, 10:07:06 AM · Difficulty 10.9540 · 4,565,193 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
d771540abf72dcbd9b4f60e281c2383174184ccf4885a741760fbc19f17a7a5e

Height

#2,271,705

Difficulty

10.953959

Transactions

4

Size

2.44 KB

Version

2

Bits

0af436a2

Nonce

116,382,557

Timestamp

8/28/2017, 10:07:06 AM

Confirmations

4,565,193

Merkle Root

0e8fb28619615abe8f6bf2cde77879900ef962b56dc2f9708fcff56846f21204
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.

7.605 × 10⁹⁵(96-digit number)
76056521554015188753…00773423857171667839
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
7.605 × 10⁹⁵(96-digit number)
76056521554015188753…00773423857171667839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.521 × 10⁹⁶(97-digit number)
15211304310803037750…01546847714343335679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.042 × 10⁹⁶(97-digit number)
30422608621606075501…03093695428686671359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.084 × 10⁹⁶(97-digit number)
60845217243212151003…06187390857373342719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.216 × 10⁹⁷(98-digit number)
12169043448642430200…12374781714746685439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.433 × 10⁹⁷(98-digit number)
24338086897284860401…24749563429493370879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.867 × 10⁹⁷(98-digit number)
48676173794569720802…49499126858986741759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
9.735 × 10⁹⁷(98-digit number)
97352347589139441604…98998253717973483519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.947 × 10⁹⁸(99-digit number)
19470469517827888320…97996507435946967039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.894 × 10⁹⁸(99-digit number)
38940939035655776641…95993014871893934079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
7.788 × 10⁹⁸(99-digit number)
77881878071311553283…91986029743787868159
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,478 XPM·at block #6,836,897 · 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