Block #380,696

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/29/2014, 10:55:53 AM · Difficulty 10.4112 · 6,426,877 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
b72deffe6c8920239422d9049a892a2272c9c20d6213bf8595ee717bbb1d2417

Height

#380,696

Difficulty

10.411164

Transactions

3

Size

1.95 KB

Version

2

Bits

0a694204

Nonce

82,624,645

Timestamp

1/29/2014, 10:55:53 AM

Confirmations

6,426,877

Merkle Root

2d943e6baa0696e98c6532f56176241c2747e05a8f11a2c00238b10c885b5e4f
Transactions (3)
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.067 × 10⁹⁸(99-digit number)
30678227575097845079…09282438895211363201
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.067 × 10⁹⁸(99-digit number)
30678227575097845079…09282438895211363201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.135 × 10⁹⁸(99-digit number)
61356455150195690158…18564877790422726401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.227 × 10⁹⁹(100-digit number)
12271291030039138031…37129755580845452801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.454 × 10⁹⁹(100-digit number)
24542582060078276063…74259511161690905601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.908 × 10⁹⁹(100-digit number)
49085164120156552126…48519022323381811201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
9.817 × 10⁹⁹(100-digit number)
98170328240313104253…97038044646763622401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.963 × 10¹⁰⁰(101-digit number)
19634065648062620850…94076089293527244801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.926 × 10¹⁰⁰(101-digit number)
39268131296125241701…88152178587054489601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
7.853 × 10¹⁰⁰(101-digit number)
78536262592250483402…76304357174108979201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.570 × 10¹⁰¹(102-digit number)
15707252518450096680…52608714348217958401
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,615 XPM·at block #6,807,572 · 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