Block #364,312

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/17/2014, 11:40:17 PM · Difficulty 10.4222 · 6,443,187 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
8c9208ca69647b8a8c036d6eb0c891889f18450e0d2f836eb23f906b97ab09a1

Height

#364,312

Difficulty

10.422242

Transactions

4

Size

886 B

Version

2

Bits

0a6c1812

Nonce

134,168

Timestamp

1/17/2014, 11:40:17 PM

Confirmations

6,443,187

Merkle Root

39508bc90cecf1c9d2b15aa6e042160035b519e9c077e7ae7d788952df6b4342
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.

8.702 × 10⁹⁴(95-digit number)
87023009053852248766…81356483210860107951
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
8.702 × 10⁹⁴(95-digit number)
87023009053852248766…81356483210860107951
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.740 × 10⁹⁵(96-digit number)
17404601810770449753…62712966421720215901
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.480 × 10⁹⁵(96-digit number)
34809203621540899506…25425932843440431801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.961 × 10⁹⁵(96-digit number)
69618407243081799013…50851865686880863601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.392 × 10⁹⁶(97-digit number)
13923681448616359802…01703731373761727201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.784 × 10⁹⁶(97-digit number)
27847362897232719605…03407462747523454401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.569 × 10⁹⁶(97-digit number)
55694725794465439210…06814925495046908801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.113 × 10⁹⁷(98-digit number)
11138945158893087842…13629850990093817601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.227 × 10⁹⁷(98-digit number)
22277890317786175684…27259701980187635201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.455 × 10⁹⁷(98-digit number)
44555780635572351368…54519403960375270401
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,704,021 XPM·at block #6,807,498 · 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