Block #2,261,374

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 8/21/2017, 8:41:35 AM · Difficulty 10.9521 · 4,552,927 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
c5cc7abaac90708802ada16a01ac11b36757efafc38bc09108e656966844dcfb

Height

#2,261,374

Difficulty

10.952114

Transactions

4

Size

2.88 KB

Version

2

Bits

0af3bdba

Nonce

313,312,824

Timestamp

8/21/2017, 8:41:35 AM

Confirmations

4,552,927

Merkle Root

11144cd5dc908f52c8b07ea10d58f3022d041e2097cd9c25b1a4cb7ec6f7df60
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.669 × 10⁹⁷(98-digit number)
16698775928129262491…82619966087055114239
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.669 × 10⁹⁷(98-digit number)
16698775928129262491…82619966087055114239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.339 × 10⁹⁷(98-digit number)
33397551856258524982…65239932174110228479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
6.679 × 10⁹⁷(98-digit number)
66795103712517049964…30479864348220456959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.335 × 10⁹⁸(99-digit number)
13359020742503409992…60959728696440913919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.671 × 10⁹⁸(99-digit number)
26718041485006819985…21919457392881827839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.343 × 10⁹⁸(99-digit number)
53436082970013639971…43838914785763655679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.068 × 10⁹⁹(100-digit number)
10687216594002727994…87677829571527311359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.137 × 10⁹⁹(100-digit number)
21374433188005455988…75355659143054622719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.274 × 10⁹⁹(100-digit number)
42748866376010911977…50711318286109245439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
8.549 × 10⁹⁹(100-digit number)
85497732752021823955…01422636572218490879
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 10 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
UncommonChain length 10

Roughly 1 in 100 blocks. Solid but expected in a healthy network.

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,758,471 XPM·at block #6,814,300 · 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