Block #481,370

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/8/2014, 8:35:58 PM · Difficulty 10.5318 · 6,335,769 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
515ab7295c33ca58ae8eeb12c4577fda05d8e63f5ec50dbbed1eb5f40a7445a8

Height

#481,370

Difficulty

10.531821

Transactions

6

Size

1.45 KB

Version

2

Bits

0a88256f

Nonce

218,043

Timestamp

4/8/2014, 8:35:58 PM

Confirmations

6,335,769

Merkle Root

9681576fef71a06cb3caaf352d7d13241b6bf0799871ac613defd9f093a808f0
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.896 × 10⁹⁶(97-digit number)
48967945297741984113…27586541436422011839
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.896 × 10⁹⁶(97-digit number)
48967945297741984113…27586541436422011839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
9.793 × 10⁹⁶(97-digit number)
97935890595483968226…55173082872844023679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.958 × 10⁹⁷(98-digit number)
19587178119096793645…10346165745688047359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.917 × 10⁹⁷(98-digit number)
39174356238193587290…20692331491376094719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
7.834 × 10⁹⁷(98-digit number)
78348712476387174581…41384662982752189439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.566 × 10⁹⁸(99-digit number)
15669742495277434916…82769325965504378879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.133 × 10⁹⁸(99-digit number)
31339484990554869832…65538651931008757759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
6.267 × 10⁹⁸(99-digit number)
62678969981109739664…31077303862017515519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.253 × 10⁹⁹(100-digit number)
12535793996221947932…62154607724035031039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.507 × 10⁹⁹(100-digit number)
25071587992443895865…24309215448070062079
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,781,147 XPM·at block #6,817,138 · 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