Block #493,605

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/15/2014, 6:38:35 PM · Difficulty 10.7040 · 6,316,633 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
d5d06469e6378f277626779881968b5df7d39b2683089c65caaff7ffb6e7ad43

Height

#493,605

Difficulty

10.703975

Transactions

2

Size

728 B

Version

2

Bits

0ab437ad

Nonce

111,556,133

Timestamp

4/15/2014, 6:38:35 PM

Confirmations

6,316,633

Merkle Root

284a175b7ce1e7252b1c184a55d5aa8b70db19cd5307f3c53c1ede820290dde5
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.

8.964 × 10⁹⁷(98-digit number)
89644928897559195106…78081424664112460799
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
8.964 × 10⁹⁷(98-digit number)
89644928897559195106…78081424664112460799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.792 × 10⁹⁸(99-digit number)
17928985779511839021…56162849328224921599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.585 × 10⁹⁸(99-digit number)
35857971559023678042…12325698656449843199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
7.171 × 10⁹⁸(99-digit number)
71715943118047356085…24651397312899686399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.434 × 10⁹⁹(100-digit number)
14343188623609471217…49302794625799372799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.868 × 10⁹⁹(100-digit number)
28686377247218942434…98605589251598745599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.737 × 10⁹⁹(100-digit number)
57372754494437884868…97211178503197491199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.147 × 10¹⁰⁰(101-digit number)
11474550898887576973…94422357006394982399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.294 × 10¹⁰⁰(101-digit number)
22949101797775153947…88844714012789964799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.589 × 10¹⁰⁰(101-digit number)
45898203595550307894…77689428025579929599
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,725,981 XPM·at block #6,810,237 · 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.

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