Block #170,574

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 9/18/2013, 9:02:43 PM · Difficulty 9.8654 · 6,655,472 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
da38fd537d66661e5e92befe5ebaa287b9a9d72ec50b8ab2b7bf711aa7e6bdcf

Height

#170,574

Difficulty

9.865372

Transactions

4

Size

1.15 KB

Version

2

Bits

09dd8904

Nonce

1,112

Timestamp

9/18/2013, 9:02:43 PM

Confirmations

6,655,472

Merkle Root

901c216ee08306aae9dc0e95f15c47ebb3ee9e0843aea2933574feccff444ee2
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.461 × 10⁹²(93-digit number)
34613528684518389976…21354802130841534001
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.461 × 10⁹²(93-digit number)
34613528684518389976…21354802130841534001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.922 × 10⁹²(93-digit number)
69227057369036779952…42709604261683068001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.384 × 10⁹³(94-digit number)
13845411473807355990…85419208523366136001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.769 × 10⁹³(94-digit number)
27690822947614711980…70838417046732272001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.538 × 10⁹³(94-digit number)
55381645895229423961…41676834093464544001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.107 × 10⁹⁴(95-digit number)
11076329179045884792…83353668186929088001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.215 × 10⁹⁴(95-digit number)
22152658358091769584…66707336373858176001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.430 × 10⁹⁴(95-digit number)
44305316716183539169…33414672747716352001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
8.861 × 10⁹⁴(95-digit number)
88610633432367078338…66829345495432704001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.772 × 10⁹⁵(96-digit number)
17722126686473415667…33658690990865408001
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,852,494 XPM·at block #6,826,045 · 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