Block #1,432,554

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/28/2016, 9:29:52 AM · Difficulty 10.7869 · 5,411,335 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
767f0f7c0e290542231b96830bf42dbb87acf19aa7ffccaca678d6b13937c5a3

Height

#1,432,554

Difficulty

10.786905

Transactions

6

Size

1.59 KB

Version

2

Bits

0ac972a1

Nonce

818,130,009

Timestamp

1/28/2016, 9:29:52 AM

Confirmations

5,411,335

Merkle Root

c74e308505ed530a693214a6934e9536fbb3fb917604ae15537265d04ed48d0c
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.992 × 10⁹⁷(98-digit number)
19921174407751074132…06858122739655567359
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.992 × 10⁹⁷(98-digit number)
19921174407751074132…06858122739655567359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.984 × 10⁹⁷(98-digit number)
39842348815502148264…13716245479311134719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
7.968 × 10⁹⁷(98-digit number)
79684697631004296528…27432490958622269439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.593 × 10⁹⁸(99-digit number)
15936939526200859305…54864981917244538879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.187 × 10⁹⁸(99-digit number)
31873879052401718611…09729963834489077759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.374 × 10⁹⁸(99-digit number)
63747758104803437222…19459927668978155519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.274 × 10⁹⁹(100-digit number)
12749551620960687444…38919855337956311039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.549 × 10⁹⁹(100-digit number)
25499103241921374889…77839710675912622079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.099 × 10⁹⁹(100-digit number)
50998206483842749778…55679421351825244159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.019 × 10¹⁰⁰(101-digit number)
10199641296768549955…11358842703650488319
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,995,481 XPM·at block #6,843,888 · 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