Block #506,167

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/22/2014, 10:11:09 PM · Difficulty 10.8129 · 6,308,682 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
094b3cd2a0ab7129fea431386d2a7645be680ea25eaa1793a26a435fd2bb44f3

Height

#506,167

Difficulty

10.812945

Transactions

4

Size

1.55 KB

Version

2

Bits

0ad01d29

Nonce

48,528

Timestamp

4/22/2014, 10:11:09 PM

Confirmations

6,308,682

Merkle Root

7ccc5fc06c2a76858c65ab6e47ebe4a80b850ec2c63718e162708aaf46d68c87
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.768 × 10⁹⁷(98-digit number)
17684045887993226053…60219360668112855039
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.768 × 10⁹⁷(98-digit number)
17684045887993226053…60219360668112855039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.536 × 10⁹⁷(98-digit number)
35368091775986452106…20438721336225710079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
7.073 × 10⁹⁷(98-digit number)
70736183551972904212…40877442672451420159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.414 × 10⁹⁸(99-digit number)
14147236710394580842…81754885344902840319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.829 × 10⁹⁸(99-digit number)
28294473420789161684…63509770689805680639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.658 × 10⁹⁸(99-digit number)
56588946841578323369…27019541379611361279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.131 × 10⁹⁹(100-digit number)
11317789368315664673…54039082759222722559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.263 × 10⁹⁹(100-digit number)
22635578736631329347…08078165518445445119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.527 × 10⁹⁹(100-digit number)
45271157473262658695…16156331036890890239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
9.054 × 10⁹⁹(100-digit number)
90542314946525317391…32312662073781780479
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,762,877 XPM·at block #6,814,848 · 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