Block #1,684,232

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 7/22/2016, 4:29:12 AM · Difficulty 10.7245 · 5,140,798 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
332013e490e295d4de969b5818dc568219228291854709821e7db6b217bb9baa

Height

#1,684,232

Difficulty

10.724482

Transactions

2

Size

1.14 KB

Version

2

Bits

0ab977a8

Nonce

708,469,504

Timestamp

7/22/2016, 4:29:12 AM

Confirmations

5,140,798

Merkle Root

799d7ad7b11304c6cf2bd3fe0db9a5837de6cf16b56e721e8543ca373598d714
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.970 × 10⁹³(94-digit number)
19707579297129281597…73040693043721040959
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.970 × 10⁹³(94-digit number)
19707579297129281597…73040693043721040959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.941 × 10⁹³(94-digit number)
39415158594258563195…46081386087442081919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
7.883 × 10⁹³(94-digit number)
78830317188517126390…92162772174884163839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.576 × 10⁹⁴(95-digit number)
15766063437703425278…84325544349768327679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.153 × 10⁹⁴(95-digit number)
31532126875406850556…68651088699536655359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.306 × 10⁹⁴(95-digit number)
63064253750813701112…37302177399073310719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.261 × 10⁹⁵(96-digit number)
12612850750162740222…74604354798146621439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.522 × 10⁹⁵(96-digit number)
25225701500325480444…49208709596293242879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.045 × 10⁹⁵(96-digit number)
50451403000650960889…98417419192586485759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.009 × 10⁹⁶(97-digit number)
10090280600130192177…96834838385172971519
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,844,323 XPM·at block #6,825,029 · 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