Block #2,259,723

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 8/20/2017, 5:23:41 AM · Difficulty 10.9519 · 4,585,606 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
185cc1f3563628d28f6e032a48b9f51179ac9567594f5e8625b7b0207f1fc3b4

Height

#2,259,723

Difficulty

10.951940

Transactions

66

Size

29.89 KB

Version

2

Bits

0af3b24f

Nonce

587,932,669

Timestamp

8/20/2017, 5:23:41 AM

Confirmations

4,585,606

Merkle Root

cec3a2c6861720471ac3c851f427f68a24ec36c27b3ebf5e74b12912ad3cf3fe
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.

1.217 × 10⁹⁵(96-digit number)
12179827814035306043…69894331222352854079
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
1.217 × 10⁹⁵(96-digit number)
12179827814035306043…69894331222352854079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.435 × 10⁹⁵(96-digit number)
24359655628070612086…39788662444705708159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.871 × 10⁹⁵(96-digit number)
48719311256141224172…79577324889411416319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
9.743 × 10⁹⁵(96-digit number)
97438622512282448344…59154649778822832639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.948 × 10⁹⁶(97-digit number)
19487724502456489668…18309299557645665279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.897 × 10⁹⁶(97-digit number)
38975449004912979337…36618599115291330559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
7.795 × 10⁹⁶(97-digit number)
77950898009825958675…73237198230582661119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.559 × 10⁹⁷(98-digit number)
15590179601965191735…46474396461165322239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.118 × 10⁹⁷(98-digit number)
31180359203930383470…92948792922330644479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.236 × 10⁹⁷(98-digit number)
62360718407860766940…85897585844661288959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.247 × 10⁹⁸(99-digit number)
12472143681572153388…71795171689322577919
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:58,007,072 XPM·at block #6,845,328 · 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