Block #364,446

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/18/2014, 2:04:39 AM · Difficulty 10.4211 · 6,466,846 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
f98d3f76a3572e20583f13f9071b02f109a8cfe93b93b26bdac4c819451246a6

Height

#364,446

Difficulty

10.421108

Transactions

1

Size

1002 B

Version

2

Bits

0a6bcdbc

Nonce

57,682

Timestamp

1/18/2014, 2:04:39 AM

Confirmations

6,466,846

Merkle Root

6c83e5c882b58b7f9c77d1379551e2d12c83908d26979a6bdd4e31b74fec1c6f
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.

1.712 × 10⁹²(93-digit number)
17128923829459867460…58503295501160627201
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
1.712 × 10⁹²(93-digit number)
17128923829459867460…58503295501160627201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.425 × 10⁹²(93-digit number)
34257847658919734921…17006591002321254401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.851 × 10⁹²(93-digit number)
68515695317839469843…34013182004642508801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.370 × 10⁹³(94-digit number)
13703139063567893968…68026364009285017601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.740 × 10⁹³(94-digit number)
27406278127135787937…36052728018570035201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.481 × 10⁹³(94-digit number)
54812556254271575875…72105456037140070401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.096 × 10⁹⁴(95-digit number)
10962511250854315175…44210912074280140801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.192 × 10⁹⁴(95-digit number)
21925022501708630350…88421824148560281601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.385 × 10⁹⁴(95-digit number)
43850045003417260700…76843648297120563201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
8.770 × 10⁹⁴(95-digit number)
87700090006834521400…53687296594241126401
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,894,482 XPM·at block #6,831,291 · 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