Block #427,315

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/3/2014, 7:21:47 AM · Difficulty 10.3470 · 6,389,789 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
37ed5ef6017a6c8bfda24cf52c11f63eb04632605e5d2e765967003f7dadc6d1

Height

#427,315

Difficulty

10.346986

Transactions

4

Size

2.30 KB

Version

2

Bits

0a58d413

Nonce

2,541

Timestamp

3/3/2014, 7:21:47 AM

Confirmations

6,389,789

Merkle Root

afa48d0ec367672c74f16a65c69150ace8b12e733995025fd04e28f4349a54f0
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.788 × 10⁹⁰(91-digit number)
17885654665928499239…32755012510872774789
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.788 × 10⁹⁰(91-digit number)
17885654665928499239…32755012510872774789
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.577 × 10⁹⁰(91-digit number)
35771309331856998479…65510025021745549579
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
7.154 × 10⁹⁰(91-digit number)
71542618663713996959…31020050043491099159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.430 × 10⁹¹(92-digit number)
14308523732742799391…62040100086982198319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.861 × 10⁹¹(92-digit number)
28617047465485598783…24080200173964396639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.723 × 10⁹¹(92-digit number)
57234094930971197567…48160400347928793279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.144 × 10⁹²(93-digit number)
11446818986194239513…96320800695857586559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.289 × 10⁹²(93-digit number)
22893637972388479026…92641601391715173119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.578 × 10⁹²(93-digit number)
45787275944776958053…85283202783430346239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
9.157 × 10⁹²(93-digit number)
91574551889553916107…70566405566860692479
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,780,871 XPM·at block #6,817,103 · 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