Block #357,145

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/13/2014, 5:26:23 AM · Difficulty 10.3827 · 6,451,519 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
13fa8b44e6d144be2e6dff462f9167cd2f246ede4181fd774f3a756e6912aa7c

Height

#357,145

Difficulty

10.382710

Transactions

14

Size

3.24 KB

Version

2

Bits

0a61f940

Nonce

10,683

Timestamp

1/13/2014, 5:26:23 AM

Confirmations

6,451,519

Merkle Root

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

2.902 × 10⁹⁴(95-digit number)
29029713541207888128…15216810592088243441
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
2.902 × 10⁹⁴(95-digit number)
29029713541207888128…15216810592088243441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.805 × 10⁹⁴(95-digit number)
58059427082415776257…30433621184176486881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.161 × 10⁹⁵(96-digit number)
11611885416483155251…60867242368352973761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.322 × 10⁹⁵(96-digit number)
23223770832966310502…21734484736705947521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.644 × 10⁹⁵(96-digit number)
46447541665932621005…43468969473411895041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
9.289 × 10⁹⁵(96-digit number)
92895083331865242011…86937938946823790081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.857 × 10⁹⁶(97-digit number)
18579016666373048402…73875877893647580161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.715 × 10⁹⁶(97-digit number)
37158033332746096804…47751755787295160321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
7.431 × 10⁹⁶(97-digit number)
74316066665492193609…95503511574590320641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.486 × 10⁹⁷(98-digit number)
14863213333098438721…91007023149180641281
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,713,356 XPM·at block #6,808,663 · 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