Block #367,797

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/20/2014, 8:03:07 AM · Difficulty 10.4354 · 6,450,139 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
cbef08b61c39e44a92393910f6c72ac8e913af98d8451832b4c63c22e48955d5

Height

#367,797

Difficulty

10.435401

Transactions

3

Size

657 B

Version

2

Bits

0a6f7677

Nonce

71,476

Timestamp

1/20/2014, 8:03:07 AM

Confirmations

6,450,139

Merkle Root

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

4.697 × 10¹⁰⁴(105-digit number)
46971952505295547120…94646441649796894721
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
4.697 × 10¹⁰⁴(105-digit number)
46971952505295547120…94646441649796894721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
9.394 × 10¹⁰⁴(105-digit number)
93943905010591094240…89292883299593789441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.878 × 10¹⁰⁵(106-digit number)
18788781002118218848…78585766599187578881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.757 × 10¹⁰⁵(106-digit number)
37577562004236437696…57171533198375157761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.515 × 10¹⁰⁵(106-digit number)
75155124008472875392…14343066396750315521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.503 × 10¹⁰⁶(107-digit number)
15031024801694575078…28686132793500631041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.006 × 10¹⁰⁶(107-digit number)
30062049603389150156…57372265587001262081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.012 × 10¹⁰⁶(107-digit number)
60124099206778300313…14744531174002524161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.202 × 10¹⁰⁷(108-digit number)
12024819841355660062…29489062348005048321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.404 × 10¹⁰⁷(108-digit number)
24049639682711320125…58978124696010096641
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,553 XPM·at block #6,817,935 · 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