Block #388,829

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/4/2014, 2:42:21 AM · Difficulty 10.4133 · 6,422,156 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
634788589c31e287b98aabebef95121d83b47332aaca035f4d3eca6310afce0d

Height

#388,829

Difficulty

10.413339

Transactions

2

Size

606 B

Version

2

Bits

0a69d096

Nonce

42,120

Timestamp

2/4/2014, 2:42:21 AM

Confirmations

6,422,156

Merkle Root

ef2be6e1f681de361f231c25113daaac0d42a9906c54ce8808693aa605461fb3
Transactions (2)
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.

1.338 × 10⁹⁴(95-digit number)
13386468858086799672…28065440714876825601
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
1.338 × 10⁹⁴(95-digit number)
13386468858086799672…28065440714876825601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.677 × 10⁹⁴(95-digit number)
26772937716173599344…56130881429753651201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.354 × 10⁹⁴(95-digit number)
53545875432347198688…12261762859507302401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.070 × 10⁹⁵(96-digit number)
10709175086469439737…24523525719014604801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.141 × 10⁹⁵(96-digit number)
21418350172938879475…49047051438029209601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.283 × 10⁹⁵(96-digit number)
42836700345877758950…98094102876058419201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
8.567 × 10⁹⁵(96-digit number)
85673400691755517901…96188205752116838401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.713 × 10⁹⁶(97-digit number)
17134680138351103580…92376411504233676801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.426 × 10⁹⁶(97-digit number)
34269360276702207160…84752823008467353601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.853 × 10⁹⁶(97-digit number)
68538720553404414321…69505646016934707201
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,731,983 XPM·at block #6,810,984 · 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