Block #507,351

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/23/2014, 4:37:15 PM · Difficulty 10.8159 · 6,310,395 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
9c883120162bce3943c534d148a402189036f49d882d620edcca743f571a4d46

Height

#507,351

Difficulty

10.815943

Transactions

2

Size

616 B

Version

2

Bits

0ad0e1a2

Nonce

55,194,458

Timestamp

4/23/2014, 4:37:15 PM

Confirmations

6,310,395

Merkle Root

8d9cd125c85bde0ef522c1b0b3ab38f4e6d5f05a036fb3fbfbdd87425c0f14f0
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.563 × 10¹⁰⁰(101-digit number)
15630452373573116382…97941177348205317119
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.563 × 10¹⁰⁰(101-digit number)
15630452373573116382…97941177348205317119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.126 × 10¹⁰⁰(101-digit number)
31260904747146232765…95882354696410634239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
6.252 × 10¹⁰⁰(101-digit number)
62521809494292465531…91764709392821268479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.250 × 10¹⁰¹(102-digit number)
12504361898858493106…83529418785642536959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.500 × 10¹⁰¹(102-digit number)
25008723797716986212…67058837571285073919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.001 × 10¹⁰¹(102-digit number)
50017447595433972425…34117675142570147839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.000 × 10¹⁰²(103-digit number)
10003489519086794485…68235350285140295679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.000 × 10¹⁰²(103-digit number)
20006979038173588970…36470700570280591359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.001 × 10¹⁰²(103-digit number)
40013958076347177940…72941401140561182719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
8.002 × 10¹⁰²(103-digit number)
80027916152694355880…45882802281122365439
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,786,021 XPM·at block #6,817,745 · 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