Block #1,328,121

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 11/15/2015, 2:05:23 PM · Difficulty 10.8495 · 5,497,520 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
efefdc50a1f1ba70cb711e569914c2f4e755339fadb6c3bb31302fa528c66d19

Height

#1,328,121

Difficulty

10.849454

Transactions

4

Size

1.87 KB

Version

2

Bits

0ad975d0

Nonce

323,324,050

Timestamp

11/15/2015, 2:05:23 PM

Confirmations

5,497,520

Merkle Root

de26564716a5a3fc11b1d8e0dc6d67ccf82502c4ce32758d970435ecd8313ba2
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.088 × 10⁹⁷(98-digit number)
10882175996868222597…46473894334806015999
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.088 × 10⁹⁷(98-digit number)
10882175996868222597…46473894334806015999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.176 × 10⁹⁷(98-digit number)
21764351993736445195…92947788669612031999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.352 × 10⁹⁷(98-digit number)
43528703987472890391…85895577339224063999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
8.705 × 10⁹⁷(98-digit number)
87057407974945780783…71791154678448127999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.741 × 10⁹⁸(99-digit number)
17411481594989156156…43582309356896255999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.482 × 10⁹⁸(99-digit number)
34822963189978312313…87164618713792511999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.964 × 10⁹⁸(99-digit number)
69645926379956624627…74329237427585023999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.392 × 10⁹⁹(100-digit number)
13929185275991324925…48658474855170047999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.785 × 10⁹⁹(100-digit number)
27858370551982649850…97316949710340095999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.571 × 10⁹⁹(100-digit number)
55716741103965299701…94633899420680191999
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,849,232 XPM·at block #6,825,640 · 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