Block #2,645,299

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 5/2/2018, 8:38:18 PM · Difficulty 11.7292 · 4,188,435 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
1a2c637fdd25b91d5ab097e5ddf89d7b7465539a1ab0396d0b52a32a07174370

Height

#2,645,299

Difficulty

11.729179

Transactions

7

Size

1.52 KB

Version

2

Bits

0bbaab7c

Nonce

1,577,828,860

Timestamp

5/2/2018, 8:38:18 PM

Confirmations

4,188,435

Merkle Root

7f860e26f5a157e2532e32a3dca647f4bf73bfe0761492876df901b4c480349c
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.879 × 10⁹⁴(95-digit number)
18792354028955375755…58199569975064483199
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.879 × 10⁹⁴(95-digit number)
18792354028955375755…58199569975064483199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.758 × 10⁹⁴(95-digit number)
37584708057910751510…16399139950128966399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
7.516 × 10⁹⁴(95-digit number)
75169416115821503020…32798279900257932799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.503 × 10⁹⁵(96-digit number)
15033883223164300604…65596559800515865599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.006 × 10⁹⁵(96-digit number)
30067766446328601208…31193119601031731199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.013 × 10⁹⁵(96-digit number)
60135532892657202416…62386239202063462399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.202 × 10⁹⁶(97-digit number)
12027106578531440483…24772478404126924799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.405 × 10⁹⁶(97-digit number)
24054213157062880966…49544956808253849599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.810 × 10⁹⁶(97-digit number)
48108426314125761933…99089913616507699199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
9.621 × 10⁹⁶(97-digit number)
96216852628251523866…98179827233015398399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.924 × 10⁹⁷(98-digit number)
19243370525650304773…96359654466030796799
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,914,096 XPM·at block #6,833,733 · 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