Block #364,827

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/18/2014, 8:10:29 AM · Difficulty 10.4230 · 6,465,633 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
259027c685da0ccda6925d88b2b1453e6074df38539bc90526a5e38adb0f9238

Height

#364,827

Difficulty

10.422971

Transactions

4

Size

881 B

Version

2

Bits

0a6c47db

Nonce

43,725

Timestamp

1/18/2014, 8:10:29 AM

Confirmations

6,465,633

Merkle Root

c1f91ab01637e041b5988397080eef9695ec0a422b2aaa959e2dd96f3982a52e
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.481 × 10¹⁰³(104-digit number)
14810676238463305024…51584518800687769601
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.481 × 10¹⁰³(104-digit number)
14810676238463305024…51584518800687769601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.962 × 10¹⁰³(104-digit number)
29621352476926610048…03169037601375539201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.924 × 10¹⁰³(104-digit number)
59242704953853220097…06338075202751078401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.184 × 10¹⁰⁴(105-digit number)
11848540990770644019…12676150405502156801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.369 × 10¹⁰⁴(105-digit number)
23697081981541288039…25352300811004313601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.739 × 10¹⁰⁴(105-digit number)
47394163963082576078…50704601622008627201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
9.478 × 10¹⁰⁴(105-digit number)
94788327926165152156…01409203244017254401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.895 × 10¹⁰⁵(106-digit number)
18957665585233030431…02818406488034508801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.791 × 10¹⁰⁵(106-digit number)
37915331170466060862…05636812976069017601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.583 × 10¹⁰⁵(106-digit number)
75830662340932121725…11273625952138035201
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,887,926 XPM·at block #6,830,459 · 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