Block #305,213

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/11/2013, 8:57:07 AM · Difficulty 9.9935 · 6,505,817 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
619f61fef11080804e17edfcb699799e2071abe7962c2acf4f116010b26f0804

Height

#305,213

Difficulty

9.993541

Transactions

4

Size

1.83 KB

Version

2

Bits

09fe58b5

Nonce

163,441

Timestamp

12/11/2013, 8:57:07 AM

Confirmations

6,505,817

Merkle Root

ea9d5d08ebf99a1cf2de315868118a72c7a65bc6dfdcccbd6e56e12307c9c014
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.281 × 10⁹¹(92-digit number)
12816360679668939810…45860829018325807539
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.281 × 10⁹¹(92-digit number)
12816360679668939810…45860829018325807539
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.563 × 10⁹¹(92-digit number)
25632721359337879620…91721658036651615079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.126 × 10⁹¹(92-digit number)
51265442718675759241…83443316073303230159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.025 × 10⁹²(93-digit number)
10253088543735151848…66886632146606460319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.050 × 10⁹²(93-digit number)
20506177087470303696…33773264293212920639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.101 × 10⁹²(93-digit number)
41012354174940607393…67546528586425841279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
8.202 × 10⁹²(93-digit number)
82024708349881214786…35093057172851682559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.640 × 10⁹³(94-digit number)
16404941669976242957…70186114345703365119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.280 × 10⁹³(94-digit number)
32809883339952485914…40372228691406730239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.561 × 10⁹³(94-digit number)
65619766679904971829…80744457382813460479
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,732,348 XPM·at block #6,811,029 · 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