Block #364,460

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/18/2014, 2:18:49 AM · Difficulty 10.4211 · 6,478,458 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
b3beb455d6fdc57c135a338c6b980c6de1bcf280aabbef76b954056eebba5190

Height

#364,460

Difficulty

10.421105

Transactions

5

Size

1.51 KB

Version

2

Bits

0a6bcd86

Nonce

73,138

Timestamp

1/18/2014, 2:18:49 AM

Confirmations

6,478,458

Merkle Root

30383e5ca787108bade3e2706be2b7ba1ebade4b791adafb9f7f9a281a282311
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.

5.065 × 10⁹⁹(100-digit number)
50651213274315633915…03903398691396649281
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
5.065 × 10⁹⁹(100-digit number)
50651213274315633915…03903398691396649281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.013 × 10¹⁰⁰(101-digit number)
10130242654863126783…07806797382793298561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.026 × 10¹⁰⁰(101-digit number)
20260485309726253566…15613594765586597121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.052 × 10¹⁰⁰(101-digit number)
40520970619452507132…31227189531173194241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
8.104 × 10¹⁰⁰(101-digit number)
81041941238905014264…62454379062346388481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.620 × 10¹⁰¹(102-digit number)
16208388247781002852…24908758124692776961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.241 × 10¹⁰¹(102-digit number)
32416776495562005705…49817516249385553921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.483 × 10¹⁰¹(102-digit number)
64833552991124011411…99635032498771107841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.296 × 10¹⁰²(103-digit number)
12966710598224802282…99270064997542215681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.593 × 10¹⁰²(103-digit number)
25933421196449604564…98540129995084431361
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,987,691 XPM·at block #6,842,917 · 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