Block #1,599,883

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 5/25/2016, 8:05:27 PM · Difficulty 10.6050 · 5,240,383 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
2cd551c23d4ee234a6d2a66699c40db744f5d13e9a0a5ce52c76ef232212cb70

Height

#1,599,883

Difficulty

10.604990

Transactions

2

Size

1.45 KB

Version

2

Bits

0a9ae09e

Nonce

144,729,545

Timestamp

5/25/2016, 8:05:27 PM

Confirmations

5,240,383

Merkle Root

91bba177b825bf5d310482af46da9c24ccc119d53bd27d6433d61607a5083a06
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.

3.481 × 10⁹³(94-digit number)
34819998886860886195…44649667859351865999
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
3.481 × 10⁹³(94-digit number)
34819998886860886195…44649667859351865999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.963 × 10⁹³(94-digit number)
69639997773721772391…89299335718703731999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.392 × 10⁹⁴(95-digit number)
13927999554744354478…78598671437407463999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.785 × 10⁹⁴(95-digit number)
27855999109488708956…57197342874814927999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.571 × 10⁹⁴(95-digit number)
55711998218977417913…14394685749629855999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.114 × 10⁹⁵(96-digit number)
11142399643795483582…28789371499259711999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.228 × 10⁹⁵(96-digit number)
22284799287590967165…57578742998519423999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.456 × 10⁹⁵(96-digit number)
44569598575181934330…15157485997038847999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
8.913 × 10⁹⁵(96-digit number)
89139197150363868660…30314971994077695999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.782 × 10⁹⁶(97-digit number)
17827839430072773732…60629943988155391999
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,966,442 XPM·at block #6,840,265 · 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