Block #507,208

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/23/2014, 2:16:06 PM · Difficulty 10.8158 · 6,320,022 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
22dde145f6de29e5ea83444f3e60e3691faae7f3d61ff36153205cdfb7f163e7

Height

#507,208

Difficulty

10.815839

Transactions

4

Size

886 B

Version

2

Bits

0ad0dacb

Nonce

28,855,696

Timestamp

4/23/2014, 2:16:06 PM

Confirmations

6,320,022

Merkle Root

55f0be58d83275848255051c1b49d7c21029ed3dca859e007ddb019dbfe8f1b2
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.743 × 10⁹⁷(98-digit number)
47436853561902173134…26513844323355865839
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.743 × 10⁹⁷(98-digit number)
47436853561902173134…26513844323355865839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
9.487 × 10⁹⁷(98-digit number)
94873707123804346269…53027688646711731679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.897 × 10⁹⁸(99-digit number)
18974741424760869253…06055377293423463359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.794 × 10⁹⁸(99-digit number)
37949482849521738507…12110754586846926719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
7.589 × 10⁹⁸(99-digit number)
75898965699043477015…24221509173693853439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.517 × 10⁹⁹(100-digit number)
15179793139808695403…48443018347387706879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.035 × 10⁹⁹(100-digit number)
30359586279617390806…96886036694775413759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
6.071 × 10⁹⁹(100-digit number)
60719172559234781612…93772073389550827519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.214 × 10¹⁰⁰(101-digit number)
12143834511846956322…87544146779101655039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.428 × 10¹⁰⁰(101-digit number)
24287669023693912644…75088293558203310079
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,861,940 XPM·at block #6,827,229 · 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