Block #2,106,602

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 5/8/2017, 12:36:27 PM · Difficulty 10.8906 · 4,709,332 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
4cc31bcb028cd87779c9f616c7f0a0756b8168e4a9446ed427ce90bab32daa30

Height

#2,106,602

Difficulty

10.890583

Transactions

3

Size

29.79 KB

Version

2

Bits

0ae3fd3c

Nonce

1,918,207,100

Timestamp

5/8/2017, 12:36:27 PM

Confirmations

4,709,332

Merkle Root

600578229e9ddcd2b57369e740c7a00d26f1490ac3326214d75e6d0f89d77ffb
Transactions (3)
1 in → 1 out9.3600 XPM109 B
161 in → 1 out1762.9849 XPM23.31 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.

7.780 × 10⁹⁴(95-digit number)
77809165647320214477…01352687038252622719
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
7.780 × 10⁹⁴(95-digit number)
77809165647320214477…01352687038252622719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.556 × 10⁹⁵(96-digit number)
15561833129464042895…02705374076505245439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.112 × 10⁹⁵(96-digit number)
31123666258928085790…05410748153010490879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.224 × 10⁹⁵(96-digit number)
62247332517856171581…10821496306020981759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.244 × 10⁹⁶(97-digit number)
12449466503571234316…21642992612041963519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.489 × 10⁹⁶(97-digit number)
24898933007142468632…43285985224083927039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.979 × 10⁹⁶(97-digit number)
49797866014284937265…86571970448167854079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
9.959 × 10⁹⁶(97-digit number)
99595732028569874530…73143940896335708159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.991 × 10⁹⁷(98-digit number)
19919146405713974906…46287881792671416319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.983 × 10⁹⁷(98-digit number)
39838292811427949812…92575763585342832639
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,771,576 XPM·at block #6,815,932 · 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