Block #1,533,416

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/9/2016, 1:05:32 PM · Difficulty 10.6167 · 5,280,602 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
33c4936646169bb3204638900bbfa6d4851ade5e46d5101792fa188b585feeab

Height

#1,533,416

Difficulty

10.616750

Transactions

2

Size

1.15 KB

Version

2

Bits

0a9de34c

Nonce

923,772,771

Timestamp

4/9/2016, 1:05:32 PM

Confirmations

5,280,602

Merkle Root

afe4f5209d14116fd31d534dea020c8e2de1fee9beadfdf64179533815112e0a
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.074 × 10⁹⁶(97-digit number)
40749724902258892735…52413567408900792321
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.074 × 10⁹⁶(97-digit number)
40749724902258892735…52413567408900792321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
8.149 × 10⁹⁶(97-digit number)
81499449804517785470…04827134817801584641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.629 × 10⁹⁷(98-digit number)
16299889960903557094…09654269635603169281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.259 × 10⁹⁷(98-digit number)
32599779921807114188…19308539271206338561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.519 × 10⁹⁷(98-digit number)
65199559843614228376…38617078542412677121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.303 × 10⁹⁸(99-digit number)
13039911968722845675…77234157084825354241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.607 × 10⁹⁸(99-digit number)
26079823937445691350…54468314169650708481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.215 × 10⁹⁸(99-digit number)
52159647874891382701…08936628339301416961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.043 × 10⁹⁹(100-digit number)
10431929574978276540…17873256678602833921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.086 × 10⁹⁹(100-digit number)
20863859149956553080…35746513357205667841
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 Second 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 2CC formula:

2CC: p₁ (first prime), p₂ = 2p₁ − 1, p₃ = 2p₂ − 1, …
Circulating Supply:57,756,228 XPM·at block #6,814,017 · 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