Block #1,534,621

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/10/2016, 9:00:51 AM · Difficulty 10.6173 · 5,274,229 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
61d3d900e0f125427832fc43112c970a90d8d325763b96a39f05add6061cdc9e

Height

#1,534,621

Difficulty

10.617311

Transactions

3

Size

8.24 KB

Version

2

Bits

0a9e0816

Nonce

1,447,189,584

Timestamp

4/10/2016, 9:00:51 AM

Confirmations

5,274,229

Merkle Root

64808ebb15550b756a505a0caa02b5ce3d6b35e88d6630f228e2f1ff022d8fc3
Transactions (3)
1 in → 1 out8.9500 XPM109 B
4 in → 1 out100.7146 XPM635 B
51 in → 1 out1264.8240 XPM7.42 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.

1.407 × 10⁹⁶(97-digit number)
14070978368190120140…07569274270209075199
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.407 × 10⁹⁶(97-digit number)
14070978368190120140…07569274270209075199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.814 × 10⁹⁶(97-digit number)
28141956736380240281…15138548540418150399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.628 × 10⁹⁶(97-digit number)
56283913472760480563…30277097080836300799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.125 × 10⁹⁷(98-digit number)
11256782694552096112…60554194161672601599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.251 × 10⁹⁷(98-digit number)
22513565389104192225…21108388323345203199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.502 × 10⁹⁷(98-digit number)
45027130778208384450…42216776646690406399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
9.005 × 10⁹⁷(98-digit number)
90054261556416768901…84433553293380812799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.801 × 10⁹⁸(99-digit number)
18010852311283353780…68867106586761625599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.602 × 10⁹⁸(99-digit number)
36021704622566707560…37734213173523251199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
7.204 × 10⁹⁸(99-digit number)
72043409245133415121…75468426347046502399
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,714,849 XPM·at block #6,808,849 · 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.

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