Block #506,209

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 4/22/2014, 10:49:16 PM · Difficulty 10.8131 · 6,308,003 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
4007adaab29e4499f75951f1536d61ce6b30c6ad8344795268f5568896127a76

Height

#506,209

Difficulty

10.813056

Transactions

3

Size

956 B

Version

2

Bits

0ad0246e

Nonce

45,933,945

Timestamp

4/22/2014, 10:49:16 PM

Confirmations

6,308,003

Merkle Root

d3ce06c2f1c7dca7dbc7bfb3d711ec212b478e29b1a37f597602e07e6683c471
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.258 × 10⁹⁹(100-digit number)
82589794858307249490…30976866131446767359
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.258 × 10⁹⁹(100-digit number)
82589794858307249490…30976866131446767359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.651 × 10¹⁰⁰(101-digit number)
16517958971661449898…61953732262893534719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.303 × 10¹⁰⁰(101-digit number)
33035917943322899796…23907464525787069439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.607 × 10¹⁰⁰(101-digit number)
66071835886645799592…47814929051574138879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.321 × 10¹⁰¹(102-digit number)
13214367177329159918…95629858103148277759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.642 × 10¹⁰¹(102-digit number)
26428734354658319836…91259716206296555519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.285 × 10¹⁰¹(102-digit number)
52857468709316639673…82519432412593111039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.057 × 10¹⁰²(103-digit number)
10571493741863327934…65038864825186222079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.114 × 10¹⁰²(103-digit number)
21142987483726655869…30077729650372444159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.228 × 10¹⁰²(103-digit number)
42285974967453311739…60155459300744888319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
8.457 × 10¹⁰²(103-digit number)
84571949934906623478…20310918601489776639
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,764 XPM·at block #6,814,211 · 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