Block #383,893

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/31/2014, 5:09:53 PM · Difficulty 10.4060 · 6,442,870 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
f02a99c48d64b8ca8389399875a5e86acbddb3a1ca32e3a21614a135e9fd236e

Height

#383,893

Difficulty

10.405993

Transactions

6

Size

3.18 KB

Version

2

Bits

0a67ef22

Nonce

318,874

Timestamp

1/31/2014, 5:09:53 PM

Confirmations

6,442,870

Merkle Root

8ad1ab843a24141ea2ae05dee6845a8b1ee8b4d5051a6d3b67570a1abd79be66
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.327 × 10⁹⁵(96-digit number)
33275274196841439576…78514839840079287241
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.327 × 10⁹⁵(96-digit number)
33275274196841439576…78514839840079287241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.655 × 10⁹⁵(96-digit number)
66550548393682879152…57029679680158574481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.331 × 10⁹⁶(97-digit number)
13310109678736575830…14059359360317148961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.662 × 10⁹⁶(97-digit number)
26620219357473151661…28118718720634297921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.324 × 10⁹⁶(97-digit number)
53240438714946303322…56237437441268595841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.064 × 10⁹⁷(98-digit number)
10648087742989260664…12474874882537191681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.129 × 10⁹⁷(98-digit number)
21296175485978521328…24949749765074383361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.259 × 10⁹⁷(98-digit number)
42592350971957042657…49899499530148766721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
8.518 × 10⁹⁷(98-digit number)
85184701943914085315…99798999060297533441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.703 × 10⁹⁸(99-digit number)
17036940388782817063…99597998120595066881
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,858,264 XPM·at block #6,826,762 · 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