Block #2,274,695

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 8/30/2017, 10:23:04 AM · Difficulty 10.9549 · 4,565,881 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
ef8cc3efcd6b2bf9365348381f51f45506083cb73faa9900ac4c23b36d332775

Height

#2,274,695

Difficulty

10.954900

Transactions

3

Size

799 B

Version

2

Bits

0af4744e

Nonce

454,050,033

Timestamp

8/30/2017, 10:23:04 AM

Confirmations

4,565,881

Merkle Root

62da199e01d85a14b18cfd850e0570a6c2a5d02656bedbd0791725ab15d3f93b
Transactions (3)
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.656 × 10⁹⁵(96-digit number)
46562050879568896249…67775684708777495039
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.656 × 10⁹⁵(96-digit number)
46562050879568896249…67775684708777495039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
9.312 × 10⁹⁵(96-digit number)
93124101759137792499…35551369417554990079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.862 × 10⁹⁶(97-digit number)
18624820351827558499…71102738835109980159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.724 × 10⁹⁶(97-digit number)
37249640703655116999…42205477670219960319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
7.449 × 10⁹⁶(97-digit number)
74499281407310233999…84410955340439920639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.489 × 10⁹⁷(98-digit number)
14899856281462046799…68821910680879841279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.979 × 10⁹⁷(98-digit number)
29799712562924093599…37643821361759682559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.959 × 10⁹⁷(98-digit number)
59599425125848187199…75287642723519365119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.191 × 10⁹⁸(99-digit number)
11919885025169637439…50575285447038730239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.383 × 10⁹⁸(99-digit number)
23839770050339274879…01150570894077460479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
4.767 × 10⁹⁸(99-digit number)
47679540100678549759…02301141788154920959
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,968,943 XPM·at block #6,840,575 · 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