Block #314,772

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/16/2013, 4:00:14 AM · Difficulty 10.0723 · 6,502,147 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
72ab6c21c69e335cda40e549e515aea4e70b5d3c9cbde536689c72119446fbda

Height

#314,772

Difficulty

10.072273

Transactions

1

Size

1.05 KB

Version

2

Bits

0a128083

Nonce

253,891

Timestamp

12/16/2013, 4:00:14 AM

Confirmations

6,502,147

Merkle Root

b88763ae9324ca974d524a1f81970309bbcb73b1522db22a74559b74e2c4d5da
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.470 × 10⁹⁸(99-digit number)
14701802929617068740…35621473133160111999
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.470 × 10⁹⁸(99-digit number)
14701802929617068740…35621473133160111999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.940 × 10⁹⁸(99-digit number)
29403605859234137480…71242946266320223999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.880 × 10⁹⁸(99-digit number)
58807211718468274960…42485892532640447999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.176 × 10⁹⁹(100-digit number)
11761442343693654992…84971785065280895999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.352 × 10⁹⁹(100-digit number)
23522884687387309984…69943570130561791999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.704 × 10⁹⁹(100-digit number)
47045769374774619968…39887140261123583999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
9.409 × 10⁹⁹(100-digit number)
94091538749549239936…79774280522247167999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.881 × 10¹⁰⁰(101-digit number)
18818307749909847987…59548561044494335999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.763 × 10¹⁰⁰(101-digit number)
37636615499819695974…19097122088988671999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
7.527 × 10¹⁰⁰(101-digit number)
75273230999639391949…38194244177977343999
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 First 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 1CC formula:

1CC: p₁ (first prime), p₂ = 2p₁ + 1, p₃ = 2p₂ + 1, …
Circulating Supply:57,779,394 XPM·at block #6,816,918 · 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