Block #474,757

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/4/2014, 6:37:14 PM · Difficulty 10.4564 · 6,363,365 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
595bae6b9cfeda6a8bc36df3d51d52e0fe7bda7c9f9d8287cb86d9f8a600cfb4

Height

#474,757

Difficulty

10.456377

Transactions

2

Size

433 B

Version

2

Bits

0a74d522

Nonce

2,652,211

Timestamp

4/4/2014, 6:37:14 PM

Confirmations

6,363,365

Merkle Root

accde63eaffe870fb470bf177a0980189d9b278a1e09b36f3816fa06230ec79a
Transactions (2)
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.

8.079 × 10⁹³(94-digit number)
80791794590281073995…56010497979046533199
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
8.079 × 10⁹³(94-digit number)
80791794590281073995…56010497979046533199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.615 × 10⁹⁴(95-digit number)
16158358918056214799…12020995958093066399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.231 × 10⁹⁴(95-digit number)
32316717836112429598…24041991916186132799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.463 × 10⁹⁴(95-digit number)
64633435672224859196…48083983832372265599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.292 × 10⁹⁵(96-digit number)
12926687134444971839…96167967664744531199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.585 × 10⁹⁵(96-digit number)
25853374268889943678…92335935329489062399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.170 × 10⁹⁵(96-digit number)
51706748537779887357…84671870658978124799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.034 × 10⁹⁶(97-digit number)
10341349707555977471…69343741317956249599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.068 × 10⁹⁶(97-digit number)
20682699415111954942…38687482635912499199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.136 × 10⁹⁶(97-digit number)
41365398830223909885…77374965271824998399
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,949,332 XPM·at block #6,838,121 · 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