Block #481,567

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/8/2014, 11:32:00 PM · Difficulty 10.5340 · 6,332,648 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
5ee0fe8a9b71cfb9278a64b06baeeaf6527d2bde118e1fb0df60d0e5e336dcba

Height

#481,567

Difficulty

10.533995

Transactions

2

Size

2.58 KB

Version

2

Bits

0a88b3e8

Nonce

49,054

Timestamp

4/8/2014, 11:32:00 PM

Confirmations

6,332,648

Merkle Root

1811d089dbeba47ac0deb1b3a19207d1506f2f756b66dd7fb21935f6c016bffa
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.

1.594 × 10⁹⁷(98-digit number)
15949001714483066354…41858421504640593919
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.594 × 10⁹⁷(98-digit number)
15949001714483066354…41858421504640593919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.189 × 10⁹⁷(98-digit number)
31898003428966132709…83716843009281187839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
6.379 × 10⁹⁷(98-digit number)
63796006857932265418…67433686018562375679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.275 × 10⁹⁸(99-digit number)
12759201371586453083…34867372037124751359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.551 × 10⁹⁸(99-digit number)
25518402743172906167…69734744074249502719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.103 × 10⁹⁸(99-digit number)
51036805486345812335…39469488148499005439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.020 × 10⁹⁹(100-digit number)
10207361097269162467…78938976296998010879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.041 × 10⁹⁹(100-digit number)
20414722194538324934…57877952593996021759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.082 × 10⁹⁹(100-digit number)
40829444389076649868…15755905187992043519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
8.165 × 10⁹⁹(100-digit number)
81658888778153299736…31511810375984087039
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,757,789 XPM·at block #6,814,214 · 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