Block #1,435,242

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/29/2016, 8:08:42 PM · Difficulty 10.8113 · 5,401,859 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
29f30ab541a08636f810b819339ab6a9f4eafe2a2cef25c48326fedc097fb302

Height

#1,435,242

Difficulty

10.811291

Transactions

2

Size

970 B

Version

2

Bits

0acfb0bd

Nonce

281,929,992

Timestamp

1/29/2016, 8:08:42 PM

Confirmations

5,401,859

Merkle Root

1d9f9cf043e8727b57cb3919523dbb16e0c2d3aa2ce35f712c990ec403c77820
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.815 × 10⁹¹(92-digit number)
78159958919986852111…95792826779167308879
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.815 × 10⁹¹(92-digit number)
78159958919986852111…95792826779167308879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.563 × 10⁹²(93-digit number)
15631991783997370422…91585653558334617759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.126 × 10⁹²(93-digit number)
31263983567994740844…83171307116669235519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.252 × 10⁹²(93-digit number)
62527967135989481689…66342614233338471039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.250 × 10⁹³(94-digit number)
12505593427197896337…32685228466676942079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.501 × 10⁹³(94-digit number)
25011186854395792675…65370456933353884159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.002 × 10⁹³(94-digit number)
50022373708791585351…30740913866707768319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.000 × 10⁹⁴(95-digit number)
10004474741758317070…61481827733415536639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.000 × 10⁹⁴(95-digit number)
20008949483516634140…22963655466831073279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.001 × 10⁹⁴(95-digit number)
40017898967033268280…45927310933662146559
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,941,115 XPM·at block #6,837,100 · 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