Block #363,901

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/17/2014, 5:28:27 PM · Difficulty 10.4173 · 6,446,356 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
fe9cb96e7fc3d5f3d6adede45366b6ba3b065096807444c4a3e04b4bb3762734

Height

#363,901

Difficulty

10.417320

Transactions

1

Size

1005 B

Version

2

Bits

0a6ad57a

Nonce

5,532

Timestamp

1/17/2014, 5:28:27 PM

Confirmations

6,446,356

Merkle Root

f128353d8f1a50c64473e6418847a5f5f2a9d6d0f2c519d8c0567212d6420f67
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.203 × 10⁹⁹(100-digit number)
12032152190619454338…54262922629659614721
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.203 × 10⁹⁹(100-digit number)
12032152190619454338…54262922629659614721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.406 × 10⁹⁹(100-digit number)
24064304381238908676…08525845259319229441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.812 × 10⁹⁹(100-digit number)
48128608762477817352…17051690518638458881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
9.625 × 10⁹⁹(100-digit number)
96257217524955634705…34103381037276917761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.925 × 10¹⁰⁰(101-digit number)
19251443504991126941…68206762074553835521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.850 × 10¹⁰⁰(101-digit number)
38502887009982253882…36413524149107671041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.700 × 10¹⁰⁰(101-digit number)
77005774019964507764…72827048298215342081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.540 × 10¹⁰¹(102-digit number)
15401154803992901552…45654096596430684161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.080 × 10¹⁰¹(102-digit number)
30802309607985803105…91308193192861368321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.160 × 10¹⁰¹(102-digit number)
61604619215971606211…82616386385722736641
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,726,129 XPM·at block #6,810,256 · 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