Block #366,743

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/19/2014, 2:38:39 PM · Difficulty 10.4340 · 6,460,650 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
cff6355b5dc9a221fe06f6d739a6879b45975f3665c37d5c4ecaa48bdacf900e

Height

#366,743

Difficulty

10.433953

Transactions

14

Size

46.71 KB

Version

2

Bits

0a6f1787

Nonce

24,451

Timestamp

1/19/2014, 2:38:39 PM

Confirmations

6,460,650

Merkle Root

b543c33dd2bb92763857cd9fd981cf7c8ecb21e3f5c751355458e301e77b634f
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.

9.533 × 10⁹²(93-digit number)
95332504426416097320…20653222396213041921
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
9.533 × 10⁹²(93-digit number)
95332504426416097320…20653222396213041921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.906 × 10⁹³(94-digit number)
19066500885283219464…41306444792426083841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.813 × 10⁹³(94-digit number)
38133001770566438928…82612889584852167681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.626 × 10⁹³(94-digit number)
76266003541132877856…65225779169704335361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.525 × 10⁹⁴(95-digit number)
15253200708226575571…30451558339408670721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.050 × 10⁹⁴(95-digit number)
30506401416453151142…60903116678817341441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.101 × 10⁹⁴(95-digit number)
61012802832906302285…21806233357634682881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.220 × 10⁹⁵(96-digit number)
12202560566581260457…43612466715269365761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.440 × 10⁹⁵(96-digit number)
24405121133162520914…87224933430538731521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.881 × 10⁹⁵(96-digit number)
48810242266325041828…74449866861077463041
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,863,247 XPM·at block #6,827,392 · 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