Block #338,493

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/1/2014, 11:29:44 AM · Difficulty 10.1222 · 6,479,482 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
fb8cfa27b722b3f215fb58fd1cab6f7a2ecff994390aaba78323a1e7928c5e56

Height

#338,493

Difficulty

10.122184

Transactions

11

Size

3.92 KB

Version

2

Bits

0a1f476c

Nonce

239,577

Timestamp

1/1/2014, 11:29:44 AM

Confirmations

6,479,482

Merkle Root

e2538722c54f091a5b1f1f3d74848539a33a18f6302e26a67036f66c538ac14f
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.839 × 10⁹⁵(96-digit number)
38393968894835126802…78636547418118078731
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.839 × 10⁹⁵(96-digit number)
38393968894835126802…78636547418118078731
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.678 × 10⁹⁵(96-digit number)
76787937789670253604…57273094836236157461
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.535 × 10⁹⁶(97-digit number)
15357587557934050720…14546189672472314921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.071 × 10⁹⁶(97-digit number)
30715175115868101441…29092379344944629841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.143 × 10⁹⁶(97-digit number)
61430350231736202883…58184758689889259681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.228 × 10⁹⁷(98-digit number)
12286070046347240576…16369517379778519361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.457 × 10⁹⁷(98-digit number)
24572140092694481153…32739034759557038721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.914 × 10⁹⁷(98-digit number)
49144280185388962306…65478069519114077441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
9.828 × 10⁹⁷(98-digit number)
98288560370777924613…30956139038228154881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.965 × 10⁹⁸(99-digit number)
19657712074155584922…61912278076456309761
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,787,870 XPM·at block #6,817,974 · 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