Block #493,769

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/15/2014, 8:30:16 PM · Difficulty 10.7072 · 6,320,349 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
feb9992412ee3a1c0c14c4c64dc95de369bb1b3d56fab124ed96d94fd6964aa1

Height

#493,769

Difficulty

10.707195

Transactions

5

Size

1.66 KB

Version

2

Bits

0ab50ac3

Nonce

168,247

Timestamp

4/15/2014, 8:30:16 PM

Confirmations

6,320,349

Merkle Root

50c6f447f97cae250f4f37da3eb01f968d86e3904dc6b26327cd4ed6779d055f
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.943 × 10¹⁰²(103-digit number)
89436372968722783340…52583384066197501439
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.943 × 10¹⁰²(103-digit number)
89436372968722783340…52583384066197501439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.788 × 10¹⁰³(104-digit number)
17887274593744556668…05166768132395002879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.577 × 10¹⁰³(104-digit number)
35774549187489113336…10333536264790005759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
7.154 × 10¹⁰³(104-digit number)
71549098374978226672…20667072529580011519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.430 × 10¹⁰⁴(105-digit number)
14309819674995645334…41334145059160023039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.861 × 10¹⁰⁴(105-digit number)
28619639349991290668…82668290118320046079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.723 × 10¹⁰⁴(105-digit number)
57239278699982581337…65336580236640092159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.144 × 10¹⁰⁵(106-digit number)
11447855739996516267…30673160473280184319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.289 × 10¹⁰⁵(106-digit number)
22895711479993032535…61346320946560368639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.579 × 10¹⁰⁵(106-digit number)
45791422959986065070…22692641893120737279
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,027 XPM·at block #6,814,117 · 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