Block #620,181

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 7/6/2014, 6:35:46 PM · Difficulty 10.9493 · 6,196,254 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
4bea605feac434329d09b082663be2ce8d548b8f238f9326f7da020742334dd0

Height

#620,181

Difficulty

10.949323

Transactions

3

Size

659 B

Version

2

Bits

0af306d2

Nonce

26,596,561

Timestamp

7/6/2014, 6:35:46 PM

Confirmations

6,196,254

Merkle Root

b8352ebc6b35efb8170a4a86f3205499ae6f29ee7b860bad83bbe0ef808048a2
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.

3.572 × 10⁹⁶(97-digit number)
35727137573168509817…36078296305570181919
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
3.572 × 10⁹⁶(97-digit number)
35727137573168509817…36078296305570181919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
7.145 × 10⁹⁶(97-digit number)
71454275146337019635…72156592611140363839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.429 × 10⁹⁷(98-digit number)
14290855029267403927…44313185222280727679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.858 × 10⁹⁷(98-digit number)
28581710058534807854…88626370444561455359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.716 × 10⁹⁷(98-digit number)
57163420117069615708…77252740889122910719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.143 × 10⁹⁸(99-digit number)
11432684023413923141…54505481778245821439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.286 × 10⁹⁸(99-digit number)
22865368046827846283…09010963556491642879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.573 × 10⁹⁸(99-digit number)
45730736093655692566…18021927112983285759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
9.146 × 10⁹⁸(99-digit number)
91461472187311385133…36043854225966571519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.829 × 10⁹⁹(100-digit number)
18292294437462277026…72087708451933143039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
3.658 × 10⁹⁹(100-digit number)
36584588874924554053…44175416903866286079
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,775,605 XPM·at block #6,816,434 · 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