Block #1,417,761

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/17/2016, 11:07:28 PM · Difficulty 10.7959 · 5,399,936 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
30fdb14abc698f41fcc80891dcf916fdf7160a1e93f94b3ace5a34277a1876d5

Height

#1,417,761

Difficulty

10.795942

Transactions

2

Size

835 B

Version

2

Bits

0acbc2d7

Nonce

167,757,975

Timestamp

1/17/2016, 11:07:28 PM

Confirmations

5,399,936

Merkle Root

448463a6012e2abfeaf34a5ae88fcad8ee3b6123450cd01d3393d69762c63524
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.632 × 10⁹⁶(97-digit number)
16329230809958408287…69885645031378682879
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.632 × 10⁹⁶(97-digit number)
16329230809958408287…69885645031378682879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.265 × 10⁹⁶(97-digit number)
32658461619916816575…39771290062757365759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
6.531 × 10⁹⁶(97-digit number)
65316923239833633150…79542580125514731519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.306 × 10⁹⁷(98-digit number)
13063384647966726630…59085160251029463039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.612 × 10⁹⁷(98-digit number)
26126769295933453260…18170320502058926079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.225 × 10⁹⁷(98-digit number)
52253538591866906520…36340641004117852159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.045 × 10⁹⁸(99-digit number)
10450707718373381304…72681282008235704319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.090 × 10⁹⁸(99-digit number)
20901415436746762608…45362564016471408639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.180 × 10⁹⁸(99-digit number)
41802830873493525216…90725128032942817279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
8.360 × 10⁹⁸(99-digit number)
83605661746987050432…81450256065885634559
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,785,635 XPM·at block #6,817,696 · 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