Block #1,432,511

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/28/2016, 8:50:30 AM · Difficulty 10.7868 · 5,393,110 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
e8d3112a7d66f504a017b266f885d7d3b3e07c9854d66b4eb4598400913ea40e

Height

#1,432,511

Difficulty

10.786807

Transactions

2

Size

3.02 KB

Version

2

Bits

0ac96c29

Nonce

110,526,528

Timestamp

1/28/2016, 8:50:30 AM

Confirmations

5,393,110

Merkle Root

74ef4080fe5bca239239dad31ab577cc2795fe1e788b7f11faf0aec62a235c83
Transactions (2)
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.763 × 10⁹⁴(95-digit number)
17631490674965789077…40104444403234601819
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.763 × 10⁹⁴(95-digit number)
17631490674965789077…40104444403234601819
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.526 × 10⁹⁴(95-digit number)
35262981349931578155…80208888806469203639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
7.052 × 10⁹⁴(95-digit number)
70525962699863156310…60417777612938407279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.410 × 10⁹⁵(96-digit number)
14105192539972631262…20835555225876814559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.821 × 10⁹⁵(96-digit number)
28210385079945262524…41671110451753629119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.642 × 10⁹⁵(96-digit number)
56420770159890525048…83342220903507258239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.128 × 10⁹⁶(97-digit number)
11284154031978105009…66684441807014516479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.256 × 10⁹⁶(97-digit number)
22568308063956210019…33368883614029032959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.513 × 10⁹⁶(97-digit number)
45136616127912420038…66737767228058065919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
9.027 × 10⁹⁶(97-digit number)
90273232255824840077…33475534456116131839
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,070 XPM·at block #6,825,620 · 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