Block #1,545,071

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/17/2016, 6:01:55 AM · Difficulty 10.6572 · 5,264,314 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
b30e88b53a1f0e003196af2b1af09c3ebd132615b3c8f35527d93790be4e5fed

Height

#1,545,071

Difficulty

10.657244

Transactions

37

Size

12.95 KB

Version

2

Bits

0aa84126

Nonce

1,809,531,998

Timestamp

4/17/2016, 6:01:55 AM

Confirmations

5,264,314

Merkle Root

de1f4a05a686ac4834a6e124abccf92fb13e97772961047b9ad2073d904d4bbd
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.

8.337 × 10⁹²(93-digit number)
83370842576383218325…09925819865216148161
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
8.337 × 10⁹²(93-digit number)
83370842576383218325…09925819865216148161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.667 × 10⁹³(94-digit number)
16674168515276643665…19851639730432296321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.334 × 10⁹³(94-digit number)
33348337030553287330…39703279460864592641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.669 × 10⁹³(94-digit number)
66696674061106574660…79406558921729185281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.333 × 10⁹⁴(95-digit number)
13339334812221314932…58813117843458370561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.667 × 10⁹⁴(95-digit number)
26678669624442629864…17626235686916741121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.335 × 10⁹⁴(95-digit number)
53357339248885259728…35252471373833482241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.067 × 10⁹⁵(96-digit number)
10671467849777051945…70504942747666964481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.134 × 10⁹⁵(96-digit number)
21342935699554103891…41009885495333928961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.268 × 10⁹⁵(96-digit number)
42685871399108207782…82019770990667857921
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,719,151 XPM·at block #6,809,384 · 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