Block #1,534,669

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/10/2016, 9:49:56 AM · Difficulty 10.6172 · 5,281,642 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
83ccc73737fd6c60dbf1fb715b0df40ca637cd9f50b22e7e811386ec65fc814f

Height

#1,534,669

Difficulty

10.617185

Transactions

2

Size

7.60 KB

Version

2

Bits

0a9dffd9

Nonce

344,948,074

Timestamp

4/10/2016, 9:49:56 AM

Confirmations

5,281,642

Merkle Root

b39e8b69133007a4b0ebec1b2e56daadda3b49239238b2f5fd73711fd6f0579e
Transactions (2)
1 in → 1 out8.9400 XPM109 B
51 in → 1 out1361.1980 XPM7.41 KB
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.

4.181 × 10⁹⁵(96-digit number)
41816657468223217306…24042289567438075519
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
4.181 × 10⁹⁵(96-digit number)
41816657468223217306…24042289567438075519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
8.363 × 10⁹⁵(96-digit number)
83633314936446434612…48084579134876151039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.672 × 10⁹⁶(97-digit number)
16726662987289286922…96169158269752302079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.345 × 10⁹⁶(97-digit number)
33453325974578573844…92338316539504604159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.690 × 10⁹⁶(97-digit number)
66906651949157147689…84676633079009208319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.338 × 10⁹⁷(98-digit number)
13381330389831429537…69353266158018416639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.676 × 10⁹⁷(98-digit number)
26762660779662859075…38706532316036833279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.352 × 10⁹⁷(98-digit number)
53525321559325718151…77413064632073666559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.070 × 10⁹⁸(99-digit number)
10705064311865143630…54826129264147333119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.141 × 10⁹⁸(99-digit number)
21410128623730287260…09652258528294666239
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,774,609 XPM·at block #6,816,310 · 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