Block #363,635

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/17/2014, 1:30:06 PM · Difficulty 10.4140 · 6,444,552 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
f8552a446ba180f9067269abbeaef72c29185ff0988385fd0ba50b0eee0d3ae4

Height

#363,635

Difficulty

10.414046

Transactions

5

Size

2.11 KB

Version

2

Bits

0a69fef1

Nonce

12,822

Timestamp

1/17/2014, 1:30:06 PM

Confirmations

6,444,552

Merkle Root

abcd6386777d7cbd90a41c48120a3a288b77a7c8a124e1f56f1469416e672757
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.728 × 10⁹²(93-digit number)
37285786124177404868…43602403060110177281
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.728 × 10⁹²(93-digit number)
37285786124177404868…43602403060110177281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.457 × 10⁹²(93-digit number)
74571572248354809736…87204806120220354561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.491 × 10⁹³(94-digit number)
14914314449670961947…74409612240440709121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.982 × 10⁹³(94-digit number)
29828628899341923894…48819224480881418241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.965 × 10⁹³(94-digit number)
59657257798683847789…97638448961762836481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.193 × 10⁹⁴(95-digit number)
11931451559736769557…95276897923525672961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.386 × 10⁹⁴(95-digit number)
23862903119473539115…90553795847051345921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.772 × 10⁹⁴(95-digit number)
47725806238947078231…81107591694102691841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
9.545 × 10⁹⁴(95-digit number)
95451612477894156462…62215183388205383681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.909 × 10⁹⁵(96-digit number)
19090322495578831292…24430366776410767361
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,709,546 XPM·at block #6,808,186 · 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